--- /srv/reproducible-results/rbuild-debian/r-b-build.I7YUvwEx/b1/libtorrent-rasterbar_2.0.11-1_amd64.changes +++ /srv/reproducible-results/rbuild-debian/r-b-build.I7YUvwEx/b2/libtorrent-rasterbar_2.0.11-1_amd64.changes ├── Files │ @@ -1,7 +1,7 @@ │ │ 1e537d9298a8b265e97c6e12e4bbe431 366364 libdevel optional libtorrent-rasterbar-dev_2.0.11-1_amd64.deb │ - 6e439eed6cd44bb2dc86a3394e70081e 1669648 doc optional libtorrent-rasterbar-doc_2.0.11-1_all.deb │ + 170e62e3838b403baad44c40b94c0500 1669560 doc optional libtorrent-rasterbar-doc_2.0.11-1_all.deb │ 38b0059e881ca760d24f1b1fc13706c4 51329120 debug optional libtorrent-rasterbar2.0t64-dbgsym_2.0.11-1_amd64.deb │ 9407e673853b6a7328c06d86c0269bde 1670032 libs optional libtorrent-rasterbar2.0t64_2.0.11-1_amd64.deb │ 7a16d3b323ab86c1f4fba48a5c4e580c 13346336 debug optional python3-libtorrent-dbgsym_2.0.11-1_amd64.deb │ 00649faa7c41920ca17578e17a31bf7b 710020 python optional python3-libtorrent_2.0.11-1_amd64.deb ├── libtorrent-rasterbar-doc_2.0.11-1_all.deb │ ├── file list │ │ @@ -1,3 +1,3 @@ │ │ -rw-r--r-- 0 0 0 4 2025-01-28 14:33:12.000000 debian-binary │ │ --rw-r--r-- 0 0 0 3636 2025-01-28 14:33:12.000000 control.tar.xz │ │ --rw-r--r-- 0 0 0 1665820 2025-01-28 14:33:12.000000 data.tar.xz │ │ +-rw-r--r-- 0 0 0 3632 2025-01-28 14:33:12.000000 control.tar.xz │ │ +-rw-r--r-- 0 0 0 1665736 2025-01-28 14:33:12.000000 data.tar.xz │ ├── control.tar.xz │ │ ├── control.tar │ │ │ ├── ./md5sums │ │ │ │ ├── ./md5sums │ │ │ │ │┄ Files differ │ ├── data.tar.xz │ │ ├── data.tar │ │ │ ├── file list │ │ │ │ @@ -73,43 +73,43 @@ │ │ │ │ -rw-r--r-- 0 root (0) root (0) 428298 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/img/troubleshooting.png │ │ │ │ -rw-r--r-- 0 root (0) root (0) 46281 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/img/troubleshooting_thumb.png │ │ │ │ -rw-r--r-- 0 root (0) root (0) 243 2025-01-28 10:57:42.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/img/utp_stack.diagram │ │ │ │ -rw-r--r-- 0 root (0) root (0) 2007 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/img/utp_stack.png │ │ │ │ -rw-r--r-- 0 root (0) root (0) 1156 2025-01-28 10:57:42.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/img/write_disk_buffers.diagram │ │ │ │ -rw-r--r-- 0 root (0) root (0) 9631 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/img/write_disk_buffers.png │ │ │ │ -rw-r--r-- 0 root (0) root (0) 9768 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/index.html │ │ │ │ --rw-r--r-- 0 root (0) root (0) 144610 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/manual-ref.html │ │ │ │ +-rw-r--r-- 0 root (0) root (0) 144603 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/manual-ref.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 9650 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/projects.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 22814 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/python_binding.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 33687 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Add_Torrent.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 256772 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Alerts.html │ │ │ │ --rw-r--r-- 0 root (0) root (0) 27437 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Bdecoding.html │ │ │ │ +-rw-r--r-- 0 root (0) root (0) 27435 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Bdecoding.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 25856 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Bencoding.html │ │ │ │ --rw-r--r-- 0 root (0) root (0) 88949 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Core.html │ │ │ │ +-rw-r--r-- 0 root (0) root (0) 88956 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Core.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 43859 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Create_Torrents.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 50915 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Custom_Storage.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 24960 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-DHT.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 48763 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Error_Codes.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 13261 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Filter.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 12804 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-PeerClass.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 68487 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Plugins.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 9618 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Resume_Data.html │ │ │ │ --rw-r--r-- 0 root (0) root (0) 102476 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Session.html │ │ │ │ +-rw-r--r-- 0 root (0) root (0) 102462 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Session.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 169276 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Settings.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 9742 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Stats.html │ │ │ │ --rw-r--r-- 0 root (0) root (0) 56856 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Storage.html │ │ │ │ --rw-r--r-- 0 root (0) root (0) 129808 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Torrent_Handle.html │ │ │ │ --rw-r--r-- 0 root (0) root (0) 55640 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Torrent_Info.html │ │ │ │ +-rw-r--r-- 0 root (0) root (0) 56863 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Storage.html │ │ │ │ +-rw-r--r-- 0 root (0) root (0) 129829 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Torrent_Handle.html │ │ │ │ +-rw-r--r-- 0 root (0) root (0) 55634 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Torrent_Info.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 48385 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Torrent_Status.html │ │ │ │ --rw-r--r-- 0 root (0) root (0) 16462 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Trackers.html │ │ │ │ +-rw-r--r-- 0 root (0) root (0) 16461 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Trackers.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 25530 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Utility.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 9129 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-ed25519.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 34353 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/reference.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 29242 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/security-audit.html │ │ │ │ --rw-r--r-- 0 root (0) root (0) 1274792 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/single-page-ref.html │ │ │ │ +-rw-r--r-- 0 root (0) root (0) 1274804 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/single-page-ref.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 10121 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/streaming.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 8807 2025-01-28 10:57:42.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/style.css │ │ │ │ -rw-r--r-- 0 root (0) root (0) 522888 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/todo.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 3023 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/troubleshooting.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 25162 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/tuning-ref.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 132630 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/tutorial-ref.html │ │ │ │ -rw-r--r-- 0 root (0) root (0) 16383 2025-01-28 14:33:12.000000 ./usr/share/doc/libtorrent-rasterbar-doc/html/udp_tracker_protocol.html │ │ │ ├── ./usr/share/doc/libtorrent-rasterbar-doc/html/manual-ref.html │ │ │ │ @@ -100,30 +100,30 @@ │ │ │ │ the session, it contains the main loop that serves all torrents.

│ │ │ │

The basic usage is as follows:

│ │ │ │ │ │ │ │ │ │ │ │
  • torrent_removed_alert
  • │ │ │ │
  • read_piece_alert
  • │ │ │ │
  • file_completed_alert
  • │ │ │ │
  • file_renamed_alert │ │ │ │
  • │ │ │ │
  • file_rename_failed_alert
  • │ │ │ │
  • performance_alert │ │ │ │
  • │ │ │ │ @@ -199,20 +199,20 @@ │ │ │ │ │ │ │ │ │ │ │ │
  • dht_get_peers_reply_alert
  • │ │ │ │
  • dht_direct_response_alert
  • │ │ │ │
  • picker_log_alert
  • │ │ │ │
  • session_error_alert
  • │ │ │ │
  • dht_live_nodes_alert │ │ │ │
  • │ │ │ │
  • session_stats_header_alert
  • │ │ │ │
  • dht_sample_infohashes_alert │ │ │ │
  • │ │ │ │
  • block_uploaded_alert
  • │ │ │ │
  • alerts_dropped_alert
  • │ │ │ │
  • socks5_alert
  • │ │ │ │ @@ -220,16 +220,16 @@ │ │ │ │
  • oversized_file_alert
  • │ │ │ │
  • torrent_conflict_alert
  • │ │ │ │
  • peer_info_alert
  • │ │ │ │
  • file_progress_alert
  • │ │ │ │
  • piece_info_alert
  • │ │ │ │
  • piece_availability_alert
  • │ │ │ │
  • tracker_list_alert
  • │ │ │ │ -
  • alert_cast()
  • │ │ │ │ -
  • operation_name()
  • │ │ │ │ +
  • operation_name()
  • │ │ │ │ +
  • alert_cast()
  • │ │ │ │
  • enum operation_t
  • │ │ │ │
  • alert_category_t
  • │ │ │ │
  • int
  • │ │ │ │ │ │ │ │ │ │ │ │

    The pop_alerts() function on session is the main interface for retrieving │ │ │ │ alerts (warnings, messages and errors from libtorrent). If no alerts have │ │ │ │ @@ -551,17 +551,17 @@ │ │ │ │ char const* new_name () const; │ │ │ │ char const* old_name () const; │ │ │ │ │ │ │ │ static constexpr alert_category_t static_category = alert_category::storage; │ │ │ │ file_index_t const index; │ │ │ │ }; │ │ │ │ │ │ │ │ - │ │ │ │ -[report issue]

    │ │ │ │ -

    new_name() old_name()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    old_name() new_name()

    │ │ │ │
    │ │ │ │  char const* new_name () const;
    │ │ │ │  char const* old_name () const;
    │ │ │ │  
    │ │ │ │

    returns the new and previous file name, respectively.

    │ │ │ │ [report issue]
    │ │ │ │
    index
    │ │ │ │ @@ -2951,17 +2951,17 @@ │ │ │ │ int num_nodes () const; │ │ │ │ std::vector<std::pair<sha1_hash, udp::endpoint>> nodes () const; │ │ │ │ │ │ │ │ static constexpr alert_category_t static_category = alert_category::dht; │ │ │ │ sha1_hash node_id; │ │ │ │ }; │ │ │ │ │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -

    num_nodes() nodes()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    nodes() num_nodes()

    │ │ │ │
    │ │ │ │  int num_nodes () const;
    │ │ │ │  std::vector<std::pair<sha1_hash, udp::endpoint>> nodes () const;
    │ │ │ │  
    │ │ │ │

    the number of nodes in the routing table and the actual nodes.

    │ │ │ │ [report issue]
    │ │ │ │
    node_id
    │ │ │ │ @@ -2993,32 +2993,32 @@ │ │ │ │

    Declared in "libtorrent/alert_types.hpp"

    │ │ │ │

    posted as a response to a call to session::dht_sample_infohashes() with │ │ │ │ the information from the DHT response message.

    │ │ │ │
    │ │ │ │  struct dht_sample_infohashes_alert final : alert
    │ │ │ │  {
    │ │ │ │     std::string message () const override;
    │ │ │ │ -   std::vector<sha1_hash> samples () const;
    │ │ │ │     int num_samples () const;
    │ │ │ │ +   std::vector<sha1_hash> samples () const;
    │ │ │ │     int num_nodes () const;
    │ │ │ │     std::vector<std::pair<sha1_hash, udp::endpoint>> nodes () const;
    │ │ │ │  
    │ │ │ │     static constexpr alert_category_t static_category  = alert_category::dht_operation;
    │ │ │ │     sha1_hash node_id;
    │ │ │ │     aux::noexcept_movable<udp::endpoint> endpoint;
    │ │ │ │     time_duration const interval;
    │ │ │ │     int const num_infohashes;
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -

    samples() num_samples()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    num_samples() samples()

    │ │ │ │
    │ │ │ │ -std::vector<sha1_hash> samples () const;
    │ │ │ │  int num_samples () const;
    │ │ │ │ +std::vector<sha1_hash> samples () const;
    │ │ │ │  
    │ │ │ │

    returns the number of info-hashes returned by the node, as well as the │ │ │ │ actual info-hashes. num_samples() is more efficient than │ │ │ │ samples().size().

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    num_nodes()

    │ │ │ │ @@ -3079,16 +3079,16 @@ │ │ │ │

    this alert is posted to indicate to the client that some alerts were │ │ │ │ dropped. Dropped meaning that the alert failed to be delivered to the │ │ │ │ client. The most common cause of such failure is that the internal alert │ │ │ │ queue grew too big (controlled by alert_queue_size).

    │ │ │ │
    │ │ │ │  struct alerts_dropped_alert final : alert
    │ │ │ │  {
    │ │ │ │ -   static_assert (num_alert_types <= abi_alert_count, "need to increase bitset. This is an ABI break");
    │ │ │ │     std::string message () const override;
    │ │ │ │ +   static_assert (num_alert_types <= abi_alert_count, "need to increase bitset. This is an ABI break");
    │ │ │ │  
    │ │ │ │     static constexpr alert_category_t static_category  = alert_category::error;
    │ │ │ │     std::bitset<abi_alert_count> dropped_alerts;
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ [report issue]
    │ │ │ │
    dropped_alerts
    │ │ │ │ @@ -3294,38 +3294,38 @@ │ │ │ │ std::vector<announce_entry> trackers; │ │ │ │ }; │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    trackers
    │ │ │ │
    list of trackers and their status for the torrent
    │ │ │ │
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    operation_name()

    │ │ │ │ +

    Declared in "libtorrent/operations.hpp"

    │ │ │ │ +
    │ │ │ │ +char const* operation_name (operation_t op);
    │ │ │ │ +
    │ │ │ │ +

    maps an operation id (from peer_error_alert and peer_disconnected_alert) │ │ │ │ +to its name. See operation_t for the constants

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    alert_cast()

    │ │ │ │

    Declared in "libtorrent/alert.hpp"

    │ │ │ │
    │ │ │ │ -template <typename T> T* alert_cast (alert* a);
    │ │ │ │  template <typename T> T const* alert_cast (alert const* a);
    │ │ │ │ +template <typename T> T* alert_cast (alert* a);
    │ │ │ │  
    │ │ │ │

    When you get an alert, you can use alert_cast<> to attempt to cast the │ │ │ │ pointer to a specific alert type, in order to query it for more │ │ │ │ information.

    │ │ │ │
    │ │ │ │

    Note

    │ │ │ │

    alert_cast<> can only cast to an exact alert type, not a base class

    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    operation_name()

    │ │ │ │ -

    Declared in "libtorrent/operations.hpp"

    │ │ │ │ -
    │ │ │ │ -char const* operation_name (operation_t op);
    │ │ │ │ -
    │ │ │ │ -

    maps an operation id (from peer_error_alert and peer_disconnected_alert) │ │ │ │ -to its name. See operation_t for the constants

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    enum operation_t

    │ │ │ │

    Declared in "libtorrent/operations.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ├── html2text {} │ │ │ │ │ @@ -15,15 +15,15 @@ │ │ │ │ │ * _p_e_e_r___a_l_e_r_t │ │ │ │ │ * _t_r_a_c_k_e_r___a_l_e_r_t │ │ │ │ │ o _t_r_a_c_k_e_r___u_r_l_(_) │ │ │ │ │ * _t_o_r_r_e_n_t___r_e_m_o_v_e_d___a_l_e_r_t │ │ │ │ │ * _r_e_a_d___p_i_e_c_e___a_l_e_r_t │ │ │ │ │ * _f_i_l_e___c_o_m_p_l_e_t_e_d___a_l_e_r_t │ │ │ │ │ * _f_i_l_e___r_e_n_a_m_e_d___a_l_e_r_t │ │ │ │ │ - o _n_e_w___n_a_m_e_(_)_ _o_l_d___n_a_m_e_(_) │ │ │ │ │ + o _o_l_d___n_a_m_e_(_)_ _n_e_w___n_a_m_e_(_) │ │ │ │ │ * _f_i_l_e___r_e_n_a_m_e___f_a_i_l_e_d___a_l_e_r_t │ │ │ │ │ * _p_e_r_f_o_r_m_a_n_c_e___a_l_e_r_t │ │ │ │ │ o _e_n_u_m_ _p_e_r_f_o_r_m_a_n_c_e___w_a_r_n_i_n_g___t │ │ │ │ │ * _s_t_a_t_e___c_h_a_n_g_e_d___a_l_e_r_t │ │ │ │ │ * _t_r_a_c_k_e_r___e_r_r_o_r___a_l_e_r_t │ │ │ │ │ o _f_a_i_l_u_r_e___r_e_a_s_o_n_(_) │ │ │ │ │ * _t_r_a_c_k_e_r___w_a_r_n_i_n_g___a_l_e_r_t │ │ │ │ │ @@ -120,33 +120,33 @@ │ │ │ │ │ o _p_k_t___b_u_f_(_) │ │ │ │ │ o _e_n_u_m_ _d_i_r_e_c_t_i_o_n___t │ │ │ │ │ * _d_h_t___g_e_t___p_e_e_r_s___r_e_p_l_y___a_l_e_r_t │ │ │ │ │ * _d_h_t___d_i_r_e_c_t___r_e_s_p_o_n_s_e___a_l_e_r_t │ │ │ │ │ * _p_i_c_k_e_r___l_o_g___a_l_e_r_t │ │ │ │ │ * _s_e_s_s_i_o_n___e_r_r_o_r___a_l_e_r_t │ │ │ │ │ * _d_h_t___l_i_v_e___n_o_d_e_s___a_l_e_r_t │ │ │ │ │ - o _n_u_m___n_o_d_e_s_(_)_ _n_o_d_e_s_(_) │ │ │ │ │ + o _n_o_d_e_s_(_)_ _n_u_m___n_o_d_e_s_(_) │ │ │ │ │ * _s_e_s_s_i_o_n___s_t_a_t_s___h_e_a_d_e_r___a_l_e_r_t │ │ │ │ │ * _d_h_t___s_a_m_p_l_e___i_n_f_o_h_a_s_h_e_s___a_l_e_r_t │ │ │ │ │ - o _s_a_m_p_l_e_s_(_)_ _n_u_m___s_a_m_p_l_e_s_(_) │ │ │ │ │ + o _n_u_m___s_a_m_p_l_e_s_(_)_ _s_a_m_p_l_e_s_(_) │ │ │ │ │ o _n_u_m___n_o_d_e_s_(_) │ │ │ │ │ o _n_o_d_e_s_(_) │ │ │ │ │ * _b_l_o_c_k___u_p_l_o_a_d_e_d___a_l_e_r_t │ │ │ │ │ * _a_l_e_r_t_s___d_r_o_p_p_e_d___a_l_e_r_t │ │ │ │ │ * _s_o_c_k_s_5___a_l_e_r_t │ │ │ │ │ * _f_i_l_e___p_r_i_o___a_l_e_r_t │ │ │ │ │ * _o_v_e_r_s_i_z_e_d___f_i_l_e___a_l_e_r_t │ │ │ │ │ * _t_o_r_r_e_n_t___c_o_n_f_l_i_c_t___a_l_e_r_t │ │ │ │ │ * _p_e_e_r___i_n_f_o___a_l_e_r_t │ │ │ │ │ * _f_i_l_e___p_r_o_g_r_e_s_s___a_l_e_r_t │ │ │ │ │ * _p_i_e_c_e___i_n_f_o___a_l_e_r_t │ │ │ │ │ * _p_i_e_c_e___a_v_a_i_l_a_b_i_l_i_t_y___a_l_e_r_t │ │ │ │ │ * _t_r_a_c_k_e_r___l_i_s_t___a_l_e_r_t │ │ │ │ │ - * _a_l_e_r_t___c_a_s_t_(_) │ │ │ │ │ * _o_p_e_r_a_t_i_o_n___n_a_m_e_(_) │ │ │ │ │ + * _a_l_e_r_t___c_a_s_t_(_) │ │ │ │ │ * _e_n_u_m_ _o_p_e_r_a_t_i_o_n___t │ │ │ │ │ * _a_l_e_r_t___c_a_t_e_g_o_r_y___t │ │ │ │ │ * _i_n_t │ │ │ │ │ The _p_o_p___a_l_e_r_t_s_(_) function on _s_e_s_s_i_o_n is the main interface for retrieving │ │ │ │ │ alerts (warnings, messages and errors from libtorrent). If no alerts have been │ │ │ │ │ posted by libtorrent _p_o_p___a_l_e_r_t_s_(_) will return an empty list. │ │ │ │ │ By default, only errors are reported. _s_e_t_t_i_n_g_s___p_a_c_k_:_:_a_l_e_r_t___m_a_s_k can be used to │ │ │ │ │ @@ -408,15 +408,15 @@ │ │ │ │ │ char const* oolldd__nnaammee () const; │ │ │ │ │ │ │ │ │ │ static constexpr alert_category_t ssttaattiicc__ccaatteeggoorryy = alert_category:: │ │ │ │ │ storage; │ │ │ │ │ file_index_t const index; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** nneeww__nnaammee(()) oolldd__nnaammee(()) ********** │ │ │ │ │ +********** oolldd__nnaammee(()) nneeww__nnaammee(()) ********** │ │ │ │ │ char const* nneeww__nnaammee () const; │ │ │ │ │ char const* oolldd__nnaammee () const; │ │ │ │ │ returns the new and previous file name, respectively. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ index │ │ │ │ │ refers to the index of the file that was renamed, │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ @@ -2295,15 +2295,15 @@ │ │ │ │ │ int nnuumm__nnooddeess () const; │ │ │ │ │ std::vector> nnooddeess () const; │ │ │ │ │ │ │ │ │ │ static constexpr alert_category_t ssttaattiicc__ccaatteeggoorryy = alert_category::dht; │ │ │ │ │ sha1_hash node_id; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** nnuumm__nnooddeess(()) nnooddeess(()) ********** │ │ │ │ │ +********** nnooddeess(()) nnuumm__nnooddeess(()) ********** │ │ │ │ │ int nnuumm__nnooddeess () const; │ │ │ │ │ std::vector> nnooddeess () const; │ │ │ │ │ the number of nodes in the routing table and the actual nodes. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ node_id │ │ │ │ │ the local DHT node's node-ID this routing table belongs to │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ @@ -2326,30 +2326,30 @@ │ │ │ │ │ ************ ddhhtt__ssaammppllee__iinnffoohhaasshheess__aalleerrtt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_a_l_e_r_t___t_y_p_e_s_._h_p_p" │ │ │ │ │ posted as a response to a call to session::dht_sample_infohashes() with the │ │ │ │ │ information from the DHT response message. │ │ │ │ │ struct dht_sample_infohashes_alert final : alert │ │ │ │ │ { │ │ │ │ │ std::string mmeessssaaggee () const override; │ │ │ │ │ - std::vector ssaammpplleess () const; │ │ │ │ │ int nnuumm__ssaammpplleess () const; │ │ │ │ │ + std::vector ssaammpplleess () const; │ │ │ │ │ int nnuumm__nnooddeess () const; │ │ │ │ │ std::vector> nnooddeess () const; │ │ │ │ │ │ │ │ │ │ static constexpr alert_category_t ssttaattiicc__ccaatteeggoorryy = alert_category:: │ │ │ │ │ dht_operation; │ │ │ │ │ sha1_hash node_id; │ │ │ │ │ aux::noexcept_movable endpoint; │ │ │ │ │ time_duration const interval; │ │ │ │ │ int const num_infohashes; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ssaammpplleess(()) nnuumm__ssaammpplleess(()) ********** │ │ │ │ │ -std::vector ssaammpplleess () const; │ │ │ │ │ +********** nnuumm__ssaammpplleess(()) ssaammpplleess(()) ********** │ │ │ │ │ int nnuumm__ssaammpplleess () const; │ │ │ │ │ +std::vector ssaammpplleess () const; │ │ │ │ │ returns the number of info-hashes returned by the node, as well as the actual │ │ │ │ │ info-hashes. num_samples() is more efficient than samples().size(). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** nnuumm__nnooddeess(()) ********** │ │ │ │ │ int nnuumm__nnooddeess () const; │ │ │ │ │ The total number of nodes returned by nodes(). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ @@ -2394,17 +2394,17 @@ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_a_l_e_r_t___t_y_p_e_s_._h_p_p" │ │ │ │ │ this _a_l_e_r_t is posted to indicate to the client that some alerts were dropped. │ │ │ │ │ Dropped meaning that the _a_l_e_r_t failed to be delivered to the client. The most │ │ │ │ │ common cause of such failure is that the internal _a_l_e_r_t queue grew too big │ │ │ │ │ (controlled by alert_queue_size). │ │ │ │ │ struct alerts_dropped_alert final : alert │ │ │ │ │ { │ │ │ │ │ + std::string mmeessssaaggee () const override; │ │ │ │ │ ssttaattiicc__aasssseerrtt (num_alert_types <= abi_alert_count, "need to increase bitset. │ │ │ │ │ This is an ABI break"); │ │ │ │ │ - std::string mmeessssaaggee () const override; │ │ │ │ │ │ │ │ │ │ static constexpr alert_category_t ssttaattiicc__ccaatteeggoorryy = alert_category::error; │ │ │ │ │ std::bitset dropped_alerts; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ dropped_alerts │ │ │ │ │ a bitmask indicating which alerts were dropped. Each bit represents the │ │ │ │ │ @@ -2572,29 +2572,29 @@ │ │ │ │ │ static constexpr alert_category_t ssttaattiicc__ccaatteeggoorryy = alert_category::status; │ │ │ │ │ std::vector trackers; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ trackers │ │ │ │ │ list of trackers and their status for the torrent │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ooppeerraattiioonn__nnaammee(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_o_p_e_r_a_t_i_o_n_s_._h_p_p" │ │ │ │ │ +char const* ooppeerraattiioonn__nnaammee (operation_t op); │ │ │ │ │ +maps an operation id (from _p_e_e_r___e_r_r_o_r___a_l_e_r_t and _p_e_e_r___d_i_s_c_o_n_n_e_c_t_e_d___a_l_e_r_t) to its │ │ │ │ │ +name. See _o_p_e_r_a_t_i_o_n___t for the constants │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ aalleerrtt__ccaasstt(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_a_l_e_r_t_._h_p_p" │ │ │ │ │ -template T* aalleerrtt__ccaasstt (alert* a); │ │ │ │ │ template T const* aalleerrtt__ccaasstt (alert const* a); │ │ │ │ │ +template T* aalleerrtt__ccaasstt (alert* a); │ │ │ │ │ When you get an _a_l_e_r_t, you can use alert_cast<> to attempt to cast the pointer │ │ │ │ │ to a specific _a_l_e_r_t type, in order to query it for more information. │ │ │ │ │ Note │ │ │ │ │ alert_cast<> can only cast to an exact _a_l_e_r_t type, not a base class │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ooppeerraattiioonn__nnaammee(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_o_p_e_r_a_t_i_o_n_s_._h_p_p" │ │ │ │ │ -char const* ooppeerraattiioonn__nnaammee (operation_t op); │ │ │ │ │ -maps an operation id (from _p_e_e_r___e_r_r_o_r___a_l_e_r_t and _p_e_e_r___d_i_s_c_o_n_n_e_c_t_e_d___a_l_e_r_t) to its │ │ │ │ │ -name. See _o_p_e_r_a_t_i_o_n___t for the constants │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ eennuumm ooppeerraattiioonn__tt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_o_p_e_r_a_t_i_o_n_s_._h_p_p" │ │ │ │ │ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ |_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |unknown |0 |the error was unexpected and it is unknown which | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_p_e_r_a_t_i_o_n_ _c_a_u_s_e_d_ _i_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |bittorrent |1 |this is used when the bittorrent logic determines | │ │ │ ├── ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Bdecoding.html │ │ │ │ @@ -34,19 +34,19 @@ │ │ │ │
      │ │ │ │
    • bdecode_node │ │ │ │ @@ -63,45 +63,45 @@ │ │ │ │ non_owning() member function.

      │ │ │ │

      There are 5 different types of nodes, see type_t.

      │ │ │ │
      │ │ │ │  struct bdecode_node
      │ │ │ │  {
      │ │ │ │     bdecode_node () = default;
      │ │ │ │     bdecode_node& operator= (bdecode_node&&) & = default;
      │ │ │ │ -   bdecode_node (bdecode_node const&);
      │ │ │ │ -   bdecode_node (bdecode_node&&) noexcept;
      │ │ │ │     bdecode_node& operator= (bdecode_node const&) &;
      │ │ │ │ +   bdecode_node (bdecode_node&&) noexcept;
      │ │ │ │ +   bdecode_node (bdecode_node const&);
      │ │ │ │     type_t type () const noexcept;
      │ │ │ │     explicit operator bool () const noexcept;
      │ │ │ │     bdecode_node non_owning () const;
      │ │ │ │     std::ptrdiff_t data_offset () const noexcept;
      │ │ │ │     span<char const> data_section () const noexcept;
      │ │ │ │ +   int list_size () const;
      │ │ │ │ +   string_view list_string_value_at (int i
      │ │ │ │ +      , string_view default_val = string_view()) const;
      │ │ │ │     std::int64_t list_int_value_at (int i
      │ │ │ │        , std::int64_t default_val = 0) const;
      │ │ │ │     bdecode_node list_at (int i) const;
      │ │ │ │ -   string_view list_string_value_at (int i
      │ │ │ │ -      , string_view default_val = string_view()) const;
      │ │ │ │ -   int list_size () const;
      │ │ │ │ -   bdecode_node dict_find_string (string_view key) const;
      │ │ │ │     std::pair<string_view, bdecode_node> dict_at (int i) const;
      │ │ │ │ -   int dict_size () const;
      │ │ │ │ -   bdecode_node dict_find_list (string_view key) const;
      │ │ │ │ -   bdecode_node dict_find_int (string_view key) const;
      │ │ │ │ -   std::pair<bdecode_node, bdecode_node> dict_at_node (int i) const;
      │ │ │ │     string_view dict_find_string_value (string_view key
      │ │ │ │        , string_view default_value = string_view()) const;
      │ │ │ │ -   std::int64_t dict_find_int_value (string_view key
      │ │ │ │ -      , std::int64_t default_val = 0) const;
      │ │ │ │ +   bdecode_node dict_find_string (string_view key) const;
      │ │ │ │     bdecode_node dict_find_dict (string_view key) const;
      │ │ │ │ +   std::pair<bdecode_node, bdecode_node> dict_at_node (int i) const;
      │ │ │ │ +   bdecode_node dict_find_int (string_view key) const;
      │ │ │ │     bdecode_node dict_find (string_view key) const;
      │ │ │ │ +   std::int64_t dict_find_int_value (string_view key
      │ │ │ │ +      , std::int64_t default_val = 0) const;
      │ │ │ │ +   bdecode_node dict_find_list (string_view key) const;
      │ │ │ │ +   int dict_size () const;
      │ │ │ │     std::int64_t int_value () const;
      │ │ │ │ -   int string_length () const;
      │ │ │ │ +   char const* string_ptr () const;
      │ │ │ │     std::ptrdiff_t string_offset () const;
      │ │ │ │     string_view string_value () const;
      │ │ │ │ -   char const* string_ptr () const;
      │ │ │ │ +   int string_length () const;
      │ │ │ │     void clear ();
      │ │ │ │     void swap (bdecode_node& n);
      │ │ │ │     void reserve (int tokens);
      │ │ │ │     void switch_underlying_buffer (char const* buf) noexcept;
      │ │ │ │     bool has_soft_error (span<char> error) const;
      │ │ │ │  
      │ │ │ │     enum type_t
      │ │ │ │ @@ -122,17 +122,17 @@
      │ │ │ │  

      creates a default constructed node, it will have the type none_t.

      │ │ │ │ │ │ │ │ [report issue] │ │ │ │
      │ │ │ │

      bdecode_node() operator=()

      │ │ │ │
      │ │ │ │  bdecode_node& operator= (bdecode_node&&) & = default;
      │ │ │ │ -bdecode_node (bdecode_node const&);
      │ │ │ │ -bdecode_node (bdecode_node&&) noexcept;
      │ │ │ │  bdecode_node& operator= (bdecode_node const&) &;
      │ │ │ │ +bdecode_node (bdecode_node&&) noexcept;
      │ │ │ │ +bdecode_node (bdecode_node const&);
      │ │ │ │  
      │ │ │ │

      For owning nodes, the copy will create a copy of the tree, but the │ │ │ │ underlying buffer remains the same.

      │ │ │ │ [report issue]
      │ │ │ │
      │ │ │ │

      type()

      │ │ │ │
      │ │ │ │ @@ -141,80 +141,80 @@
      │ │ │ │  

      the type of this node. See type_t.

      │ │ │ │ [report issue]
      │ │ │ │
      │ │ │ │

      bool()

      │ │ │ │
      │ │ │ │  explicit operator bool () const noexcept;
      │ │ │ │  
      │ │ │ │ -

      returns true if type() != none_t.

      │ │ │ │ +

      returns true if type() != none_t.

      │ │ │ │ [report issue]
      │ │ │ │
      │ │ │ │

      non_owning()

      │ │ │ │
      │ │ │ │  bdecode_node non_owning () const;
      │ │ │ │  
      │ │ │ │

      return a non-owning reference to this node. This is useful to refer to │ │ │ │ the root node without copying it in assignments.

      │ │ │ │ - │ │ │ │ -[report issue]
      │ │ │ │ -
      │ │ │ │ -

      data_offset() data_section()

      │ │ │ │ + │ │ │ │ +[report issue]
      │ │ │ │ +
      │ │ │ │ +

      data_section() data_offset()

      │ │ │ │
      │ │ │ │  std::ptrdiff_t data_offset () const noexcept;
      │ │ │ │  span<char const> data_section () const noexcept;
      │ │ │ │  
      │ │ │ │

      returns the buffer and length of the section in the original bencoded │ │ │ │ buffer where this node is defined. For a dictionary for instance, this │ │ │ │ starts with d and ends with e, and has all the content of the │ │ │ │ dictionary in between. │ │ │ │ the data_offset() function returns the byte-offset to this node in, │ │ │ │ starting from the beginning of the buffer that was parsed.

      │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ -[report issue]
      │ │ │ │ -
      │ │ │ │ -

      list_at() list_int_value_at() list_string_value_at() list_size()

      │ │ │ │ +[report issue]
      │ │ │ │ +
      │ │ │ │ +

      list_size() list_int_value_at() list_string_value_at() list_at()

      │ │ │ │
      │ │ │ │ +int list_size () const;
      │ │ │ │ +string_view list_string_value_at (int i
      │ │ │ │ +      , string_view default_val = string_view()) const;
      │ │ │ │  std::int64_t list_int_value_at (int i
      │ │ │ │        , std::int64_t default_val = 0) const;
      │ │ │ │  bdecode_node list_at (int i) const;
      │ │ │ │ -string_view list_string_value_at (int i
      │ │ │ │ -      , string_view default_val = string_view()) const;
      │ │ │ │ -int list_size () const;
      │ │ │ │  
      │ │ │ │

      functions with the list_ prefix operate on lists. These functions are │ │ │ │ only valid if type() == list_t. list_at() returns the item │ │ │ │ in the list at index i. i may not be greater than or equal to the │ │ │ │ size of the list. size() returns the size of the list.

      │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ │ │ │ │ - │ │ │ │ │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ -[report issue]
      │ │ │ │ -
      │ │ │ │ -

      dict_at_node() dict_find_int_value() dict_find() dict_at() dict_find_int() dict_find_string_value() dict_find_list() dict_find_string() dict_size() dict_find_dict()

      │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
      │ │ │ │ +
      │ │ │ │ +

      dict_find_dict() dict_at_node() dict_find_string_value() dict_find_string() dict_at() dict_find_int_value() dict_size() dict_find() dict_find_list() dict_find_int()

      │ │ │ │
      │ │ │ │ -bdecode_node dict_find_string (string_view key) const;
      │ │ │ │  std::pair<string_view, bdecode_node> dict_at (int i) const;
      │ │ │ │ -int dict_size () const;
      │ │ │ │ -bdecode_node dict_find_list (string_view key) const;
      │ │ │ │ -bdecode_node dict_find_int (string_view key) const;
      │ │ │ │ -std::pair<bdecode_node, bdecode_node> dict_at_node (int i) const;
      │ │ │ │  string_view dict_find_string_value (string_view key
      │ │ │ │        , string_view default_value = string_view()) const;
      │ │ │ │ -std::int64_t dict_find_int_value (string_view key
      │ │ │ │ -      , std::int64_t default_val = 0) const;
      │ │ │ │ +bdecode_node dict_find_string (string_view key) const;
      │ │ │ │  bdecode_node dict_find_dict (string_view key) const;
      │ │ │ │ +std::pair<bdecode_node, bdecode_node> dict_at_node (int i) const;
      │ │ │ │ +bdecode_node dict_find_int (string_view key) const;
      │ │ │ │  bdecode_node dict_find (string_view key) const;
      │ │ │ │ +std::int64_t dict_find_int_value (string_view key
      │ │ │ │ +      , std::int64_t default_val = 0) const;
      │ │ │ │ +bdecode_node dict_find_list (string_view key) const;
      │ │ │ │ +int dict_size () const;
      │ │ │ │  
      │ │ │ │

      Functions with the dict_ prefix operates on dictionaries. They are │ │ │ │ only valid if type() == dict_t. In case a key you're looking up │ │ │ │ contains a 0 byte, you cannot use the 0-terminated string overloads, │ │ │ │ but have to use string_view instead. dict_find_list will return a │ │ │ │ valid bdecode_node if the key is found _and_ it is a list. Otherwise │ │ │ │ it will return a default-constructed bdecode_node.

      │ │ │ │ @@ -229,25 +229,25 @@ │ │ │ │
      │ │ │ │

      int_value()

      │ │ │ │
      │ │ │ │  std::int64_t int_value () const;
      │ │ │ │  
      │ │ │ │

      this function is only valid if type() == int_t. It returns the │ │ │ │ value of the integer.

      │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ │ │ │ │ -[report issue]
      │ │ │ │ -
      │ │ │ │ -

      string_ptr() string_value() string_length() string_offset()

      │ │ │ │ +[report issue]
      │ │ │ │ +
      │ │ │ │ +

      string_offset() string_ptr() string_length() string_value()

      │ │ │ │
      │ │ │ │ -int string_length () const;
      │ │ │ │ +char const* string_ptr () const;
      │ │ │ │  std::ptrdiff_t string_offset () const;
      │ │ │ │  string_view string_value () const;
      │ │ │ │ -char const* string_ptr () const;
      │ │ │ │ +int string_length () const;
      │ │ │ │  
      │ │ │ │

      these functions are only valid if type() == string_t. They return │ │ │ │ the string values. Note that string_ptr() is not 0-terminated. │ │ │ │ string_length() returns the number of bytes in the string. │ │ │ │ string_offset() returns the byte offset from the start of the parsed │ │ │ │ bencoded buffer this string can be found.

      │ │ │ │ [report issue]
      │ │ │ │ @@ -345,22 +345,22 @@ │ │ │ │

      print the bencoded structure in a human-readable format to a string │ │ │ │ that's returned.

      │ │ │ │ [report issue]
      │ │ │ │
      │ │ │ │

      bdecode()

      │ │ │ │

      Declared in "libtorrent/bdecode.hpp"

      │ │ │ │
      │ │ │ │ -bdecode_node bdecode (span<char const> buffer
      │ │ │ │ +int bdecode (char const* start, char const* end, bdecode_node& ret
      │ │ │ │     , error_code& ec, int* error_pos = nullptr, int depth_limit = 100
      │ │ │ │     , int token_limit = 2000000);
      │ │ │ │  bdecode_node bdecode (span<char const> buffer
      │ │ │ │ -   , int depth_limit = 100, int token_limit = 2000000);
      │ │ │ │ -int bdecode (char const* start, char const* end, bdecode_node& ret
      │ │ │ │     , error_code& ec, int* error_pos = nullptr, int depth_limit = 100
      │ │ │ │     , int token_limit = 2000000);
      │ │ │ │ +bdecode_node bdecode (span<char const> buffer
      │ │ │ │ +   , int depth_limit = 100, int token_limit = 2000000);
      │ │ │ │  
      │ │ │ │

      This function decodes/parses bdecoded data (for example a .torrent file). │ │ │ │ The data structure is returned in the ret argument. the buffer to parse │ │ │ │ is specified by the start of the buffer as well as the end, i.e. one │ │ │ │ byte past the end. If the buffer fails to parse, the function returns a │ │ │ │ non-zero value and fills in ec with the error code. The optional │ │ │ │ argument error_pos, if set to non-nullptr, will be set to the byte offset │ │ │ │ ├── html2text {} │ │ │ │ │ @@ -5,21 +5,21 @@ │ │ │ │ │ Table of contents │ │ │ │ │ * _b_d_e_c_o_d_e___n_o_d_e │ │ │ │ │ o _b_d_e_c_o_d_e___n_o_d_e_(_) │ │ │ │ │ o _b_d_e_c_o_d_e___n_o_d_e_(_)_ _o_p_e_r_a_t_o_r_=_(_) │ │ │ │ │ o _t_y_p_e_(_) │ │ │ │ │ o _b_o_o_l_(_) │ │ │ │ │ o _n_o_n___o_w_n_i_n_g_(_) │ │ │ │ │ - o _d_a_t_a___o_f_f_s_e_t_(_)_ _d_a_t_a___s_e_c_t_i_o_n_(_) │ │ │ │ │ - o _l_i_s_t___a_t_(_)_ _l_i_s_t___i_n_t___v_a_l_u_e___a_t_(_)_ _l_i_s_t___s_t_r_i_n_g___v_a_l_u_e___a_t_(_)_ _l_i_s_t___s_i_z_e_(_) │ │ │ │ │ - o _d_i_c_t___a_t___n_o_d_e_(_)_ _d_i_c_t___f_i_n_d___i_n_t___v_a_l_u_e_(_)_ _d_i_c_t___f_i_n_d_(_)_ _d_i_c_t___a_t_(_) │ │ │ │ │ - _d_i_c_t___f_i_n_d___i_n_t_(_)_ _d_i_c_t___f_i_n_d___s_t_r_i_n_g___v_a_l_u_e_(_)_ _d_i_c_t___f_i_n_d___l_i_s_t_(_) │ │ │ │ │ - _d_i_c_t___f_i_n_d___s_t_r_i_n_g_(_)_ _d_i_c_t___s_i_z_e_(_)_ _d_i_c_t___f_i_n_d___d_i_c_t_(_) │ │ │ │ │ + o _d_a_t_a___s_e_c_t_i_o_n_(_)_ _d_a_t_a___o_f_f_s_e_t_(_) │ │ │ │ │ + o _l_i_s_t___s_i_z_e_(_)_ _l_i_s_t___i_n_t___v_a_l_u_e___a_t_(_)_ _l_i_s_t___s_t_r_i_n_g___v_a_l_u_e___a_t_(_)_ _l_i_s_t___a_t_(_) │ │ │ │ │ + o _d_i_c_t___f_i_n_d___d_i_c_t_(_)_ _d_i_c_t___a_t___n_o_d_e_(_)_ _d_i_c_t___f_i_n_d___s_t_r_i_n_g___v_a_l_u_e_(_) │ │ │ │ │ + _d_i_c_t___f_i_n_d___s_t_r_i_n_g_(_)_ _d_i_c_t___a_t_(_)_ _d_i_c_t___f_i_n_d___i_n_t___v_a_l_u_e_(_)_ _d_i_c_t___s_i_z_e_(_) │ │ │ │ │ + _d_i_c_t___f_i_n_d_(_)_ _d_i_c_t___f_i_n_d___l_i_s_t_(_)_ _d_i_c_t___f_i_n_d___i_n_t_(_) │ │ │ │ │ o _i_n_t___v_a_l_u_e_(_) │ │ │ │ │ - o _s_t_r_i_n_g___p_t_r_(_)_ _s_t_r_i_n_g___v_a_l_u_e_(_)_ _s_t_r_i_n_g___l_e_n_g_t_h_(_)_ _s_t_r_i_n_g___o_f_f_s_e_t_(_) │ │ │ │ │ + o _s_t_r_i_n_g___o_f_f_s_e_t_(_)_ _s_t_r_i_n_g___p_t_r_(_)_ _s_t_r_i_n_g___l_e_n_g_t_h_(_)_ _s_t_r_i_n_g___v_a_l_u_e_(_) │ │ │ │ │ o _c_l_e_a_r_(_) │ │ │ │ │ o _s_w_a_p_(_) │ │ │ │ │ o _r_e_s_e_r_v_e_(_) │ │ │ │ │ o _s_w_i_t_c_h___u_n_d_e_r_l_y_i_n_g___b_u_f_f_e_r_(_) │ │ │ │ │ o _h_a_s___s_o_f_t___e_r_r_o_r_(_) │ │ │ │ │ o _e_n_u_m_ _t_y_p_e___t │ │ │ │ │ * _p_r_i_n_t___e_n_t_r_y_(_) │ │ │ │ │ @@ -31,45 +31,45 @@ │ │ │ │ │ able to copy it as a reference for instance). For that, use the _n_o_n___o_w_n_i_n_g_(_) │ │ │ │ │ member function. │ │ │ │ │ There are 5 different types of nodes, see _t_y_p_e___t. │ │ │ │ │ struct bdecode_node │ │ │ │ │ { │ │ │ │ │ bbddeeccooddee__nnooddee () = default; │ │ │ │ │ bdecode_node& ooppeerraattoorr== (bdecode_node&&) & = default; │ │ │ │ │ - bbddeeccooddee__nnooddee (bdecode_node const&); │ │ │ │ │ - bbddeeccooddee__nnooddee (bdecode_node&&) noexcept; │ │ │ │ │ bdecode_node& ooppeerraattoorr== (bdecode_node const&) &; │ │ │ │ │ + bbddeeccooddee__nnooddee (bdecode_node&&) noexcept; │ │ │ │ │ + bbddeeccooddee__nnooddee (bdecode_node const&); │ │ │ │ │ type_t ttyyppee () const noexcept; │ │ │ │ │ explicit operator bbooooll () const noexcept; │ │ │ │ │ bdecode_node nnoonn__oowwnniinngg () const; │ │ │ │ │ std::ptrdiff_t ddaattaa__ooffffsseett () const noexcept; │ │ │ │ │ span ddaattaa__sseeccttiioonn () const noexcept; │ │ │ │ │ + int lliisstt__ssiizzee () const; │ │ │ │ │ + string_view lliisstt__ssttrriinngg__vvaalluuee__aatt (int i │ │ │ │ │ + , string_view default_val = string_view()) const; │ │ │ │ │ std::int64_t lliisstt__iinntt__vvaalluuee__aatt (int i │ │ │ │ │ , std::int64_t default_val = 0) const; │ │ │ │ │ bdecode_node lliisstt__aatt (int i) const; │ │ │ │ │ - string_view lliisstt__ssttrriinngg__vvaalluuee__aatt (int i │ │ │ │ │ - , string_view default_val = string_view()) const; │ │ │ │ │ - int lliisstt__ssiizzee () const; │ │ │ │ │ - bdecode_node ddiicctt__ffiinndd__ssttrriinngg (string_view key) const; │ │ │ │ │ std::pair ddiicctt__aatt (int i) const; │ │ │ │ │ - int ddiicctt__ssiizzee () const; │ │ │ │ │ - bdecode_node ddiicctt__ffiinndd__lliisstt (string_view key) const; │ │ │ │ │ - bdecode_node ddiicctt__ffiinndd__iinntt (string_view key) const; │ │ │ │ │ - std::pair ddiicctt__aatt__nnooddee (int i) const; │ │ │ │ │ string_view ddiicctt__ffiinndd__ssttrriinngg__vvaalluuee (string_view key │ │ │ │ │ , string_view default_value = string_view()) const; │ │ │ │ │ - std::int64_t ddiicctt__ffiinndd__iinntt__vvaalluuee (string_view key │ │ │ │ │ - , std::int64_t default_val = 0) const; │ │ │ │ │ + bdecode_node ddiicctt__ffiinndd__ssttrriinngg (string_view key) const; │ │ │ │ │ bdecode_node ddiicctt__ffiinndd__ddiicctt (string_view key) const; │ │ │ │ │ + std::pair ddiicctt__aatt__nnooddee (int i) const; │ │ │ │ │ + bdecode_node ddiicctt__ffiinndd__iinntt (string_view key) const; │ │ │ │ │ bdecode_node ddiicctt__ffiinndd (string_view key) const; │ │ │ │ │ + std::int64_t ddiicctt__ffiinndd__iinntt__vvaalluuee (string_view key │ │ │ │ │ + , std::int64_t default_val = 0) const; │ │ │ │ │ + bdecode_node ddiicctt__ffiinndd__lliisstt (string_view key) const; │ │ │ │ │ + int ddiicctt__ssiizzee () const; │ │ │ │ │ std::int64_t iinntt__vvaalluuee () const; │ │ │ │ │ - int ssttrriinngg__lleennggtthh () const; │ │ │ │ │ + char const* ssttrriinngg__ppttrr () const; │ │ │ │ │ std::ptrdiff_t ssttrriinngg__ooffffsseett () const; │ │ │ │ │ string_view ssttrriinngg__vvaalluuee () const; │ │ │ │ │ - char const* ssttrriinngg__ppttrr () const; │ │ │ │ │ + int ssttrriinngg__lleennggtthh () const; │ │ │ │ │ void cclleeaarr (); │ │ │ │ │ void sswwaapp (bdecode_node& n); │ │ │ │ │ void rreesseerrvvee (int tokens); │ │ │ │ │ void sswwiittcchh__uunnddeerrllyyiinngg__bbuuffffeerr (char const* buf) noexcept; │ │ │ │ │ bool hhaass__ssoofftt__eerrrroorr (span error) const; │ │ │ │ │ │ │ │ │ │ enum type_t │ │ │ │ │ @@ -84,17 +84,17 @@ │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** bbddeeccooddee__nnooddee(()) ********** │ │ │ │ │ bbddeeccooddee__nnooddee () = default; │ │ │ │ │ creates a default constructed node, it will have the type none_t. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** bbddeeccooddee__nnooddee(()) ooppeerraattoorr==(()) ********** │ │ │ │ │ bdecode_node& ooppeerraattoorr== (bdecode_node&&) & = default; │ │ │ │ │ -bbddeeccooddee__nnooddee (bdecode_node const&); │ │ │ │ │ -bbddeeccooddee__nnooddee (bdecode_node&&) noexcept; │ │ │ │ │ bdecode_node& ooppeerraattoorr== (bdecode_node const&) &; │ │ │ │ │ +bbddeeccooddee__nnooddee (bdecode_node&&) noexcept; │ │ │ │ │ +bbddeeccooddee__nnooddee (bdecode_node const&); │ │ │ │ │ For owning nodes, the copy will create a copy of the tree, but the underlying │ │ │ │ │ buffer remains the same. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ttyyppee(()) ********** │ │ │ │ │ type_t ttyyppee () const noexcept; │ │ │ │ │ the type of this node. See _t_y_p_e___t. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ @@ -103,50 +103,50 @@ │ │ │ │ │ returns true if _t_y_p_e_(_) != none_t. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** nnoonn__oowwnniinngg(()) ********** │ │ │ │ │ bdecode_node nnoonn__oowwnniinngg () const; │ │ │ │ │ return a non-owning reference to this node. This is useful to refer to the root │ │ │ │ │ node without copying it in assignments. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddaattaa__ooffffsseett(()) ddaattaa__sseeccttiioonn(()) ********** │ │ │ │ │ +********** ddaattaa__sseeccttiioonn(()) ddaattaa__ooffffsseett(()) ********** │ │ │ │ │ std::ptrdiff_t ddaattaa__ooffffsseett () const noexcept; │ │ │ │ │ span ddaattaa__sseeccttiioonn () const noexcept; │ │ │ │ │ returns the buffer and length of the section in the original bencoded buffer │ │ │ │ │ where this node is defined. For a dictionary for instance, this starts with d │ │ │ │ │ and ends with e, and has all the content of the dictionary in between. the │ │ │ │ │ data_offset() function returns the byte-offset to this node in, starting from │ │ │ │ │ the beginning of the buffer that was parsed. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** lliisstt__aatt(()) lliisstt__iinntt__vvaalluuee__aatt(()) lliisstt__ssttrriinngg__vvaalluuee__aatt(()) lliisstt__ssiizzee(()) ********** │ │ │ │ │ +********** lliisstt__ssiizzee(()) lliisstt__iinntt__vvaalluuee__aatt(()) lliisstt__ssttrriinngg__vvaalluuee__aatt(()) lliisstt__aatt(()) ********** │ │ │ │ │ +int lliisstt__ssiizzee () const; │ │ │ │ │ +string_view lliisstt__ssttrriinngg__vvaalluuee__aatt (int i │ │ │ │ │ + , string_view default_val = string_view()) const; │ │ │ │ │ std::int64_t lliisstt__iinntt__vvaalluuee__aatt (int i │ │ │ │ │ , std::int64_t default_val = 0) const; │ │ │ │ │ bdecode_node lliisstt__aatt (int i) const; │ │ │ │ │ -string_view lliisstt__ssttrriinngg__vvaalluuee__aatt (int i │ │ │ │ │ - , string_view default_val = string_view()) const; │ │ │ │ │ -int lliisstt__ssiizzee () const; │ │ │ │ │ functions with the list_ prefix operate on lists. These functions are only │ │ │ │ │ valid if type() == list_t. list_at() returns the item in the list at index i. i │ │ │ │ │ may not be greater than or equal to the size of the list. size() returns the │ │ │ │ │ size of the list. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddiicctt__aatt__nnooddee(()) ddiicctt__ffiinndd__iinntt__vvaalluuee(()) ddiicctt__ffiinndd(()) ddiicctt__aatt(()) ddiicctt__ffiinndd__iinntt │ │ │ │ │ -(()) ddiicctt__ffiinndd__ssttrriinngg__vvaalluuee(()) ddiicctt__ffiinndd__lliisstt(()) ddiicctt__ffiinndd__ssttrriinngg(()) ddiicctt__ssiizzee(()) │ │ │ │ │ -ddiicctt__ffiinndd__ddiicctt(()) ********** │ │ │ │ │ -bdecode_node ddiicctt__ffiinndd__ssttrriinngg (string_view key) const; │ │ │ │ │ +********** ddiicctt__ffiinndd__ddiicctt(()) ddiicctt__aatt__nnooddee(()) ddiicctt__ffiinndd__ssttrriinngg__vvaalluuee(()) ddiicctt__ffiinndd__ssttrriinngg │ │ │ │ │ +(()) ddiicctt__aatt(()) ddiicctt__ffiinndd__iinntt__vvaalluuee(()) ddiicctt__ssiizzee(()) ddiicctt__ffiinndd(()) ddiicctt__ffiinndd__lliisstt(()) │ │ │ │ │ +ddiicctt__ffiinndd__iinntt(()) ********** │ │ │ │ │ std::pair ddiicctt__aatt (int i) const; │ │ │ │ │ -int ddiicctt__ssiizzee () const; │ │ │ │ │ -bdecode_node ddiicctt__ffiinndd__lliisstt (string_view key) const; │ │ │ │ │ -bdecode_node ddiicctt__ffiinndd__iinntt (string_view key) const; │ │ │ │ │ -std::pair ddiicctt__aatt__nnooddee (int i) const; │ │ │ │ │ string_view ddiicctt__ffiinndd__ssttrriinngg__vvaalluuee (string_view key │ │ │ │ │ , string_view default_value = string_view()) const; │ │ │ │ │ -std::int64_t ddiicctt__ffiinndd__iinntt__vvaalluuee (string_view key │ │ │ │ │ - , std::int64_t default_val = 0) const; │ │ │ │ │ +bdecode_node ddiicctt__ffiinndd__ssttrriinngg (string_view key) const; │ │ │ │ │ bdecode_node ddiicctt__ffiinndd__ddiicctt (string_view key) const; │ │ │ │ │ +std::pair ddiicctt__aatt__nnooddee (int i) const; │ │ │ │ │ +bdecode_node ddiicctt__ffiinndd__iinntt (string_view key) const; │ │ │ │ │ bdecode_node ddiicctt__ffiinndd (string_view key) const; │ │ │ │ │ +std::int64_t ddiicctt__ffiinndd__iinntt__vvaalluuee (string_view key │ │ │ │ │ + , std::int64_t default_val = 0) const; │ │ │ │ │ +bdecode_node ddiicctt__ffiinndd__lliisstt (string_view key) const; │ │ │ │ │ +int ddiicctt__ssiizzee () const; │ │ │ │ │ Functions with the dict_ prefix operates on dictionaries. They are only valid │ │ │ │ │ if type() == dict_t. In case a key you're looking up contains a 0 byte, you │ │ │ │ │ cannot use the 0-terminated string overloads, but have to use string_view │ │ │ │ │ instead. dict_find_list will return a valid bdecode_node if the key is found │ │ │ │ │ _and_ it is a list. Otherwise it will return a default-constructed │ │ │ │ │ _b_d_e_c_o_d_e___n_o_d_e. │ │ │ │ │ Functions with the _value suffix return the value of the node directly, rather │ │ │ │ │ @@ -158,19 +158,19 @@ │ │ │ │ │ string). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** iinntt__vvaalluuee(()) ********** │ │ │ │ │ std::int64_t iinntt__vvaalluuee () const; │ │ │ │ │ this function is only valid if type() == int_t. It returns the value of the │ │ │ │ │ integer. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ssttrriinngg__ppttrr(()) ssttrriinngg__vvaalluuee(()) ssttrriinngg__lleennggtthh(()) ssttrriinngg__ooffffsseett(()) ********** │ │ │ │ │ -int ssttrriinngg__lleennggtthh () const; │ │ │ │ │ +********** ssttrriinngg__ooffffsseett(()) ssttrriinngg__ppttrr(()) ssttrriinngg__lleennggtthh(()) ssttrriinngg__vvaalluuee(()) ********** │ │ │ │ │ +char const* ssttrriinngg__ppttrr () const; │ │ │ │ │ std::ptrdiff_t ssttrriinngg__ooffffsseett () const; │ │ │ │ │ string_view ssttrriinngg__vvaalluuee () const; │ │ │ │ │ -char const* ssttrriinngg__ppttrr () const; │ │ │ │ │ +int ssttrriinngg__lleennggtthh () const; │ │ │ │ │ these functions are only valid if type() == string_t. They return the string │ │ │ │ │ values. Note that string_ptr() is nnoott 0-terminated. string_length() returns the │ │ │ │ │ number of bytes in the string. string_offset() returns the byte offset from the │ │ │ │ │ start of the parsed bencoded buffer this string can be found. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** cclleeaarr(()) ********** │ │ │ │ │ void cclleeaarr (); │ │ │ │ │ @@ -214,22 +214,22 @@ │ │ │ │ │ std::string pprriinntt__eennttrryy (bdecode_node const& e │ │ │ │ │ , bool single_line = false, int indent = 0); │ │ │ │ │ print the bencoded structure in a human-readable format to a string that's │ │ │ │ │ returned. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ bbddeeccooddee(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_b_d_e_c_o_d_e_._h_p_p" │ │ │ │ │ -bdecode_node bbddeeccooddee (span buffer │ │ │ │ │ +int bbddeeccooddee (char const* start, char const* end, bdecode_node& ret │ │ │ │ │ , error_code& ec, int* error_pos = nullptr, int depth_limit = 100 │ │ │ │ │ , int token_limit = 2000000); │ │ │ │ │ bdecode_node bbddeeccooddee (span buffer │ │ │ │ │ - , int depth_limit = 100, int token_limit = 2000000); │ │ │ │ │ -int bbddeeccooddee (char const* start, char const* end, bdecode_node& ret │ │ │ │ │ , error_code& ec, int* error_pos = nullptr, int depth_limit = 100 │ │ │ │ │ , int token_limit = 2000000); │ │ │ │ │ +bdecode_node bbddeeccooddee (span buffer │ │ │ │ │ + , int depth_limit = 100, int token_limit = 2000000); │ │ │ │ │ This function decodes/parses bdecoded data (for example a .torrent file). The │ │ │ │ │ data structure is returned in the ret argument. the buffer to parse is │ │ │ │ │ specified by the start of the buffer as well as the end, i.e. one byte past the │ │ │ │ │ end. If the buffer fails to parse, the function returns a non-zero value and │ │ │ │ │ fills in ec with the error code. The optional argument error_pos, if set to │ │ │ │ │ non-nullptr, will be set to the byte offset into the buffer where the parse │ │ │ │ │ failure occurred. │ │ │ ├── ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Bencoding.html │ │ │ │ @@ -34,24 +34,24 @@ │ │ │ │

      │ │ │ │
      │ │ │ │

      Bencoding is a common representation in bittorrent used for dictionary, │ │ │ │ list, int and string hierarchies. It's used to encode .torrent files and │ │ │ │ some messages in the network protocol. libtorrent also uses it to store │ │ │ │ settings, resume data and other session state.

      │ │ │ │

      Strings in bencoded structures do not necessarily represent text. │ │ │ │ @@ -69,46 +69,46 @@ │ │ │ │

      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.

      │ │ │ │
      │ │ │ │  class entry
      │ │ │ │  {
      │ │ │ │     data_type type () const;
      │ │ │ │ -   entry (preformatted_type);
      │ │ │ │ -   entry (list_type);
      │ │ │ │ +   entry (dictionary_type);
      │ │ │ │     entry (integer_type);
      │ │ │ │     entry (span<char const>);
      │ │ │ │ -   entry (dictionary_type);
      │ │ │ │ +   entry (list_type);
      │ │ │ │ +   entry (preformatted_type);
      │ │ │ │     entry (U v);
      │ │ │ │     entry (data_type t);
      │ │ │ │     entry (bdecode_node const& n);
      │ │ │ │ -   entry& operator= (dictionary_type) &;
      │ │ │ │ -   entry& operator= (entry&&) & noexcept;
      │ │ │ │ -   entry& operator= (preformatted_type) &;
      │ │ │ │ -   entry& operator= (list_type) &;
      │ │ │ │ -   entry& operator= (integer_type) &;
      │ │ │ │     entry& operator= (bdecode_node const&) &;
      │ │ │ │ +   entry& operator= (preformatted_type) &;
      │ │ │ │     entry& operator= (entry const&) &;
      │ │ │ │ +   entry& operator= (list_type) &;
      │ │ │ │ +   entry& operator= (entry&&) & noexcept;
      │ │ │ │     entry& operator= (span<char const>) &;
      │ │ │ │ +   entry& operator= (dictionary_type) &;
      │ │ │ │ +   entry& operator= (integer_type) &;
      │ │ │ │     entry& operator= (U v) &;
      │ │ │ │ -   integer_type& integer ();
      │ │ │ │ -   dictionary_type const& dict () const;
      │ │ │ │ -   list_type const& list () const;
      │ │ │ │ -   string_type& string ();
      │ │ │ │     string_type const& string () const;
      │ │ │ │ -   list_type& list ();
      │ │ │ │ +   string_type& string ();
      │ │ │ │     dictionary_type& dict ();
      │ │ │ │ -   preformatted_type& preformatted ();
      │ │ │ │ -   integer_type const& integer () const;
      │ │ │ │     preformatted_type const& preformatted () const;
      │ │ │ │ +   integer_type const& integer () const;
      │ │ │ │ +   preformatted_type& preformatted ();
      │ │ │ │ +   integer_type& integer ();
      │ │ │ │ +   dictionary_type const& dict () const;
      │ │ │ │ +   list_type& list ();
      │ │ │ │ +   list_type const& list () const;
      │ │ │ │     void swap (entry& e);
      │ │ │ │ -   entry const& operator[] (string_view key) const;
      │ │ │ │     entry& operator[] (string_view key);
      │ │ │ │ -   entry const* find_key (string_view key) const;
      │ │ │ │ +   entry const& operator[] (string_view key) const;
      │ │ │ │     entry* find_key (string_view key);
      │ │ │ │ +   entry const* find_key (string_view key) const;
      │ │ │ │     std::string to_string (bool single_line = false) const;
      │ │ │ │  
      │ │ │ │     enum data_type
      │ │ │ │     {
      │ │ │ │        int_t,
      │ │ │ │        string_t,
      │ │ │ │        list_t,
      │ │ │ │ @@ -124,19 +124,19 @@
      │ │ │ │  data_type type () const;
      │ │ │ │  
      │ │ │ │

      returns the concrete type of the entry

      │ │ │ │ [report issue] │ │ │ │
      │ │ │ │

      entry()

      │ │ │ │
      │ │ │ │ -entry (preformatted_type);
      │ │ │ │ -entry (list_type);
      │ │ │ │ +entry (dictionary_type);
      │ │ │ │  entry (integer_type);
      │ │ │ │  entry (span<char const>);
      │ │ │ │ -entry (dictionary_type);
      │ │ │ │ +entry (list_type);
      │ │ │ │ +entry (preformatted_type);
      │ │ │ │  
      │ │ │ │

      constructors directly from a specific type. │ │ │ │ The content of the argument is copied into the │ │ │ │ newly constructed entry

      │ │ │ │ [report issue]
      │ │ │ │
      │ │ │ │

      entry()

      │ │ │ │ @@ -152,43 +152,43 @@ │ │ │ │ entry (bdecode_node const& n); │ │ │ │
      │ │ │ │

      construct from bdecode_node parsed form (see bdecode())

      │ │ │ │ [report issue] │ │ │ │
      │ │ │ │

      operator=()

      │ │ │ │
      │ │ │ │ -entry& operator= (dictionary_type) &;
      │ │ │ │ -entry& operator= (entry&&) & noexcept;
      │ │ │ │ -entry& operator= (preformatted_type) &;
      │ │ │ │ -entry& operator= (list_type) &;
      │ │ │ │ -entry& operator= (integer_type) &;
      │ │ │ │  entry& operator= (bdecode_node const&) &;
      │ │ │ │ +entry& operator= (preformatted_type) &;
      │ │ │ │  entry& operator= (entry const&) &;
      │ │ │ │ +entry& operator= (list_type) &;
      │ │ │ │ +entry& operator= (entry&&) & noexcept;
      │ │ │ │  entry& operator= (span<char const>) &;
      │ │ │ │ +entry& operator= (dictionary_type) &;
      │ │ │ │ +entry& operator= (integer_type) &;
      │ │ │ │  
      │ │ │ │

      copies the structure of the right hand side into this │ │ │ │ entry.

      │ │ │ │ │ │ │ │ - │ │ │ │ │ │ │ │ - │ │ │ │ -[report issue]
      │ │ │ │ -
      │ │ │ │ -

      list() dict() string() preformatted() integer()

      │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
      │ │ │ │ +
      │ │ │ │ +

      list() string() dict() integer() preformatted()

      │ │ │ │
      │ │ │ │ -integer_type& integer ();
      │ │ │ │ -dictionary_type const& dict () const;
      │ │ │ │ -list_type const& list () const;
      │ │ │ │ -string_type& string ();
      │ │ │ │  string_type const& string () const;
      │ │ │ │ -list_type& list ();
      │ │ │ │ +string_type& string ();
      │ │ │ │  dictionary_type& dict ();
      │ │ │ │ -preformatted_type& preformatted ();
      │ │ │ │ -integer_type const& integer () const;
      │ │ │ │  preformatted_type const& preformatted () const;
      │ │ │ │ +integer_type const& integer () const;
      │ │ │ │ +preformatted_type& preformatted ();
      │ │ │ │ +integer_type& integer ();
      │ │ │ │ +dictionary_type const& dict () const;
      │ │ │ │ +list_type& list ();
      │ │ │ │ +list_type const& list () 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 │ │ │ │ system_error. You can ask an entry for its type through the │ │ │ │ type() function.

      │ │ │ │

      If you want to create an entry you give it the type you want it to │ │ │ │ @@ -232,32 +232,32 @@ │ │ │ │ void swap (entry& e); │ │ │ │ │ │ │ │

      swaps the content of this with e.

      │ │ │ │ [report issue]
      │ │ │ │
      │ │ │ │

      operator[]()

      │ │ │ │
      │ │ │ │ -entry const& operator[] (string_view key) const;
      │ │ │ │  entry& operator[] (string_view key);
      │ │ │ │ +entry const& operator[] (string_view key) const;
      │ │ │ │  
      │ │ │ │

      All of these functions requires the entry to be a dictionary, if it │ │ │ │ isn't they will throw system_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 system_error.

      │ │ │ │ [report issue]
      │ │ │ │
      │ │ │ │

      find_key()

      │ │ │ │
      │ │ │ │ -entry const* find_key (string_view key) const;
      │ │ │ │  entry* find_key (string_view key);
      │ │ │ │ +entry const* find_key (string_view key) const;
      │ │ │ │  
      │ │ │ │

      These functions requires the entry to be a dictionary, if it isn't │ │ │ │ they will throw system_error.

      │ │ │ │

      They will look for an element at the given key in the dictionary, if │ │ │ │ the element cannot be found, they will return nullptr. If an element │ │ │ │ with the given key is found, the return a pointer to it.

      │ │ │ │ [report issue]
      │ │ │ │ @@ -307,16 +307,24 @@ │ │ │ │ │ │ │ │
    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
    preformatted_t5 
    │ │ │ │ -[report issue]
    │ │ │ │ +[report issue]
    │ │ │ │
    │ │ │ │ +
    │ │ │ │ +

    operator<<()

    │ │ │ │ +

    Declared in "libtorrent/entry.hpp"

    │ │ │ │ +
    │ │ │ │ +inline std::ostream& operator<< (std::ostream& os, const entry& e);
    │ │ │ │ +
    │ │ │ │ +

    prints the bencoded structure to the ostream as a JSON-style structure.

    │ │ │ │ +[report issue]
    │ │ │ │
    │ │ │ │

    bencode()

    │ │ │ │

    Declared in "libtorrent/bencode.hpp"

    │ │ │ │
    │ │ │ │  template<class OutIt> int bencode (OutIt out, const entry& e);
    │ │ │ │  
    │ │ │ │

    This function will encode data to bencoded form.

    │ │ │ │ @@ -328,22 +336,14 @@ │ │ │ │ instantiated as ostream_iterator or back_insert_iterator. This │ │ │ │ function assumes the value_type of the iterator is a char. │ │ │ │ In order to encode entry e into a buffer, do:

    │ │ │ │
    │ │ │ │  std::vector<char> buf;
    │ │ │ │  bencode(std::back_inserter(buf), e);
    │ │ │ │  
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    operator<<()

    │ │ │ │ -

    Declared in "libtorrent/entry.hpp"

    │ │ │ │ -
    │ │ │ │ -inline std::ostream& operator<< (std::ostream& os, const entry& e);
    │ │ │ │ -
    │ │ │ │ -

    prints the bencoded structure to the ostream as a JSON-style structure.

    │ │ │ │
    │ │ │ │ │ │ │ │
    │ │ │ │
    │ │ │ │
    │ │ │ │
    │ │ │ │ │ │ │ │ -
    │ │ │ │ -

    version()

    │ │ │ │ -

    Declared in "libtorrent/version.hpp"

    │ │ │ │ -
    │ │ │ │ -char const* version ();
    │ │ │ │ -
    │ │ │ │ -

    returns the libtorrent version as string form in this format: │ │ │ │ -"<major>.<minor>.<tiny>.<tag>"

    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    load_torrent_parsed() load_torrent_buffer() load_torrent_file()

    │ │ │ │ -

    Declared in "libtorrent/load_torrent.hpp"

    │ │ │ │ -
    │ │ │ │ -add_torrent_params load_torrent_buffer (
    │ │ │ │ -   span<char const> buffer);
    │ │ │ │ -add_torrent_params load_torrent_buffer (
    │ │ │ │ -   span<char const> buffer, load_torrent_limits const& cfg);
    │ │ │ │ -add_torrent_params load_torrent_parsed (
    │ │ │ │ -   bdecode_node const& torrent_file);
    │ │ │ │ -add_torrent_params load_torrent_parsed (
    │ │ │ │ -   bdecode_node const& torrent_file, load_torrent_limits const& cfg);
    │ │ │ │ -add_torrent_params load_torrent_file (
    │ │ │ │ -   std::string const& filename);
    │ │ │ │ -add_torrent_params load_torrent_file (
    │ │ │ │ -   std::string const& filename, load_torrent_limits const& cfg);
    │ │ │ │ -
    │ │ │ │ -

    These functions load the content of a .torrent file into an │ │ │ │ -add_torrent_params object. │ │ │ │ -The immutable part of a torrent file (the info-dictionary) is stored in │ │ │ │ -the ti field in the add_torrent_params object (as a torrent_info │ │ │ │ -object). │ │ │ │ -The returned object is suitable to be:

    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    enum protocol_version

    │ │ │ │

    Declared in "libtorrent/info_hash.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ @@ -823,14 +823,45 @@ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
    NUM2 
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum connection_type

    │ │ │ │ +

    Declared in "libtorrent/peer_connection.hpp"

    │ │ │ │ + │ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +
    namevaluedescription
    bittorrent0 
    url_seed1 
    http_seed2 
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    enum socket_type_t

    │ │ │ │

    Declared in "libtorrent/socket_type.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ @@ -878,142 +909,143 @@ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
    utp_ssl8 
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum portmap_transport

    │ │ │ │ -

    Declared in "libtorrent/portmap.hpp"

    │ │ │ │ - │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -
    namevaluedescription
    natpmp0natpmp can be NAT-PMP or PCP
    upnp1 
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum portmap_protocol

    │ │ │ │ -

    Declared in "libtorrent/portmap.hpp"

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum event_t

    │ │ │ │ +

    Declared in "libtorrent/tracker_manager.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ +│ │ │ │ │ │ │ │ -│ │ │ │ -│ │ │ │ +│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │
    namevaluedescription
    none0 
    tcp
    completed1 
    udp
    started2 
    stopped3 
    paused4 
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum event_t

    │ │ │ │ -

    Declared in "libtorrent/tracker_manager.hpp"

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum portmap_transport

    │ │ │ │ +

    Declared in "libtorrent/portmap.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ │ │ │ │
    namevaluedescription
    none
    natpmp0 natpmp can be NAT-PMP or PCP
    completed
    upnp1 
    started2 
    stopped3 
    paused4 
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum connection_type

    │ │ │ │ -

    Declared in "libtorrent/peer_connection.hpp"

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum portmap_protocol

    │ │ │ │ +

    Declared in "libtorrent/portmap.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
    namevaluedescription
    bittorrent
    none0 
    url_seed
    tcp1 
    http_seed
    udp2 
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    int

    │ │ │ │ +

    Declared in "libtorrent/version.hpp"

    │ │ │ │ +
    │ │ │ │ +
    version_major
    │ │ │ │ +
    the major, minor and tiny versions of libtorrent
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    version_minor
    │ │ │ │ +
    the major, minor and tiny versions of libtorrent
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    version_tiny
    │ │ │ │ +
    the major, minor and tiny versions of libtorrent
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    char const*

    │ │ │ │ +

    Declared in "libtorrent/version.hpp"

    │ │ │ │ +
    │ │ │ │ +
    version_str
    │ │ │ │ +
    the libtorrent version in string form
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    std::uint64_t

    │ │ │ │ +

    Declared in "libtorrent/version.hpp"

    │ │ │ │ +
    │ │ │ │ +
    version_revision
    │ │ │ │ +
    the git commit of this libtorrent version
    │ │ │ │ +
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    torrent_flags_t

    │ │ │ │

    Declared in "libtorrent/torrent_flags.hpp"

    │ │ │ │
    │ │ │ │
    seed_mode
    │ │ │ │

    If seed_mode is set, libtorrent will assume that all files │ │ │ │ @@ -1142,15 +1174,15 @@ │ │ │ │ stop-when-ready immediately.

    │ │ │ │

    When the stop-when-ready logic fires, the flag is cleared. Any │ │ │ │ subsequent transitions between downloading and non-downloading states │ │ │ │ will not be affected, until this flag is set again.

    │ │ │ │

    The behavior is more robust when setting this flag as part of adding │ │ │ │ the torrent. See add_torrent_params.

    │ │ │ │

    The stop-when-ready flag fixes the inherent race condition of waiting │ │ │ │ -for the state_changed_alert and then call pause(). The download/seeding │ │ │ │ +for the state_changed_alert and then call pause(). The download/seeding │ │ │ │ will most likely start in between posting the alert and receiving the │ │ │ │ call to pause.

    │ │ │ │

    A downloading state is one where peers are being connected. Which means │ │ │ │ just downloading the metadata via the ut_metadata extension counts │ │ │ │ as a downloading state. In order to stop a torrent once the metadata │ │ │ │ has been downloaded, instead set all file priorities to dont_download

    │ │ │ │
    │ │ │ │ @@ -1240,14 +1272,35 @@ │ │ │ │ URL. │ │ │ │
    │ │ │ │
    │ │ │ │
    all
    │ │ │ │
    all torrent flags combined. Can conveniently be used when creating masks │ │ │ │ for flags
    │ │ │ │
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    download_priority_t

    │ │ │ │ +

    Declared in "libtorrent/download_priority.hpp"

    │ │ │ │ +
    │ │ │ │ +
    dont_download
    │ │ │ │ +
    Don't download the file or piece. Partial pieces may still be downloaded when │ │ │ │ +setting file priorities.
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    default_priority
    │ │ │ │ +
    The default priority for files and pieces.
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    low_priority
    │ │ │ │ +
    The lowest priority for files and pieces.
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    top_priority
    │ │ │ │ +
    The highest priority for files and pieces.
    │ │ │ │ +
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    pex_flags_t

    │ │ │ │

    Declared in "libtorrent/pex_flags.hpp"

    │ │ │ │
    │ │ │ │
    pex_encryption
    │ │ │ │
    the peer supports protocol encryption
    │ │ │ │ @@ -1267,67 +1320,14 @@ │ │ │ │ the peer fail │ │ │ │
    │ │ │ │
    │ │ │ │
    pex_lt_v2
    │ │ │ │
    protocol v2 │ │ │ │ this is not a standard flag, it is only used internally
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    download_priority_t

    │ │ │ │ -

    Declared in "libtorrent/download_priority.hpp"

    │ │ │ │ -
    │ │ │ │ -
    dont_download
    │ │ │ │ -
    Don't download the file or piece. Partial pieces may still be downloaded when │ │ │ │ -setting file priorities.
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -
    default_priority
    │ │ │ │ -
    The default priority for files and pieces.
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -
    low_priority
    │ │ │ │ -
    The lowest priority for files and pieces.
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -
    top_priority
    │ │ │ │ -
    The highest priority for files and pieces.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    int

    │ │ │ │ -

    Declared in "libtorrent/version.hpp"

    │ │ │ │ -
    │ │ │ │ -
    version_major
    │ │ │ │ -
    the major, minor and tiny versions of libtorrent
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -
    version_minor
    │ │ │ │ -
    the major, minor and tiny versions of libtorrent
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -
    version_tiny
    │ │ │ │ -
    the major, minor and tiny versions of libtorrent
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    char const*

    │ │ │ │ -

    Declared in "libtorrent/version.hpp"

    │ │ │ │ -
    │ │ │ │ -
    version_str
    │ │ │ │ -
    the libtorrent version in string form
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    std::uint64_t

    │ │ │ │ -

    Declared in "libtorrent/version.hpp"

    │ │ │ │ -
    │ │ │ │ -
    version_revision
    │ │ │ │ -
    the git commit of this libtorrent version
    │ │ │ │ -
    │ │ │ │
    │ │ │ │ │ │ │ │
    │ │ │ │
    │ │ │ │
    │ │ │ │
    │ │ │ │ │ │ │ │
    │ │ │ │

    add_files()

    │ │ │ │

    Declared in "libtorrent/create_torrent.hpp"

    │ │ │ │
    │ │ │ │  void add_files (file_storage& fs, std::string const& file
    │ │ │ │ -   , create_flags_t flags = {});
    │ │ │ │ -void add_files (file_storage& fs, std::string const& file
    │ │ │ │     , std::function<bool(std::string)> p, create_flags_t flags = {});
    │ │ │ │ +void add_files (file_storage& fs, std::string const& file
    │ │ │ │ +   , create_flags_t flags = {});
    │ │ │ │  
    │ │ │ │

    Adds the file specified by path to the file_storage object. In case path │ │ │ │ refers to a directory, files will be added recursively from the directory.

    │ │ │ │

    If specified, the predicate p is called once for every file and directory that │ │ │ │ is encountered. Files for which p returns true are added, and directories for │ │ │ │ which p returns true are traversed. p must have the following signature:

    │ │ │ │
    │ │ │ │ @@ -482,29 +482,29 @@
    │ │ │ │  

    The flags argument should be the same as the flags passed to the create_torrent │ │ │ │ constructor.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    set_piece_hashes()

    │ │ │ │

    Declared in "libtorrent/create_torrent.hpp"

    │ │ │ │
    │ │ │ │ -inline void set_piece_hashes (create_torrent& t, std::string const& p);
    │ │ │ │ +inline void set_piece_hashes (create_torrent& t, std::string const& p
    │ │ │ │ +   , std::function<void(piece_index_t)> const& f);
    │ │ │ │  inline void set_piece_hashes (create_torrent& t, std::string const& p
    │ │ │ │     , settings_interface const& settings
    │ │ │ │     , std::function<void(piece_index_t)> const& f);
    │ │ │ │  void set_piece_hashes (create_torrent& t, std::string const& p
    │ │ │ │ -   , settings_interface const& settings, disk_io_constructor_type disk_io
    │ │ │ │     , std::function<void(piece_index_t)> const& f, error_code& ec);
    │ │ │ │ -inline void set_piece_hashes (create_torrent& t, std::string const& p
    │ │ │ │ -   , std::function<void(piece_index_t)> const& f);
    │ │ │ │  inline void set_piece_hashes (create_torrent& t, std::string const& p, error_code& ec);
    │ │ │ │  void set_piece_hashes (create_torrent& t, std::string const& p
    │ │ │ │ -   , settings_interface const& settings
    │ │ │ │ +   , settings_interface const& settings, disk_io_constructor_type disk_io
    │ │ │ │     , std::function<void(piece_index_t)> const& f, error_code& ec);
    │ │ │ │  void set_piece_hashes (create_torrent& t, std::string const& p
    │ │ │ │ +   , settings_interface const& settings
    │ │ │ │     , std::function<void(piece_index_t)> const& f, error_code& ec);
    │ │ │ │ +inline void set_piece_hashes (create_torrent& t, std::string const& p);
    │ │ │ │  
    │ │ │ │

    This function will assume that the files added to the torrent file exists at path │ │ │ │ p, read those files and hash the content and set the hashes in the create_torrent │ │ │ │ object. The optional function f is called in between every hash that is set. f │ │ │ │ must have the following signature:

    │ │ │ │
    │ │ │ │  void Fun(piece_index_t);
    │ │ │ │ ├── html2text {}
    │ │ │ │ │ @@ -1,15 +1,15 @@
    │ │ │ │ │  >
    │ │ │ │ │  _[_l_i_b_t_o_r_r_e_n_t_ _l_o_g_o_]
    │ │ │ │ │  VVeerrssiioonn:: 2.0.11
    │ │ │ │ │  _h_o_m_e
    │ │ │ │ │  Table of contents
    │ │ │ │ │      * _c_r_e_a_t_e___t_o_r_r_e_n_t
    │ │ │ │ │            o _c_r_e_a_t_e___t_o_r_r_e_n_t_(_)
    │ │ │ │ │ -          o _g_e_n_e_r_a_t_e___b_u_f_(_)_ _g_e_n_e_r_a_t_e_(_)
    │ │ │ │ │ +          o _g_e_n_e_r_a_t_e_(_)_ _g_e_n_e_r_a_t_e___b_u_f_(_)
    │ │ │ │ │            o _f_i_l_e_s_(_)
    │ │ │ │ │            o _s_e_t___c_o_m_m_e_n_t_(_)
    │ │ │ │ │            o _s_e_t___c_r_e_a_t_o_r_(_)
    │ │ │ │ │            o _s_e_t___c_r_e_a_t_i_o_n___d_a_t_e_(_)
    │ │ │ │ │            o _s_e_t___h_a_s_h_(_)
    │ │ │ │ │            o _s_e_t___h_a_s_h_2_(_)
    │ │ │ │ │            o _a_d_d___h_t_t_p___s_e_e_d_(_)_ _a_d_d___u_r_l___s_e_e_d_(_)
    │ │ │ │ │ @@ -19,15 +19,15 @@
    │ │ │ │ │            o _p_r_i_v_(_)_ _s_e_t___p_r_i_v_(_)
    │ │ │ │ │            o _n_u_m___p_i_e_c_e_s_(_)
    │ │ │ │ │            o _p_i_e_c_e___r_a_n_g_e_(_)
    │ │ │ │ │            o _f_i_l_e___r_a_n_g_e_(_)
    │ │ │ │ │            o _f_i_l_e___p_i_e_c_e___r_a_n_g_e_(_)
    │ │ │ │ │            o _t_o_t_a_l___s_i_z_e_(_)
    │ │ │ │ │            o _p_i_e_c_e___s_i_z_e_(_)_ _p_i_e_c_e___l_e_n_g_t_h_(_)
    │ │ │ │ │ -          o _a_d_d___s_i_m_i_l_a_r___t_o_r_r_e_n_t_(_)_ _a_d_d___c_o_l_l_e_c_t_i_o_n_(_)
    │ │ │ │ │ +          o _a_d_d___c_o_l_l_e_c_t_i_o_n_(_)_ _a_d_d___s_i_m_i_l_a_r___t_o_r_r_e_n_t_(_)
    │ │ │ │ │      * _a_d_d___f_i_l_e_s_(_)
    │ │ │ │ │      * _s_e_t___p_i_e_c_e___h_a_s_h_e_s_(_)
    │ │ │ │ │  This section describes the functions and classes that are used to create
    │ │ │ │ │  torrent files. It is a layered API with low level classes and higher level
    │ │ │ │ │  convenience functions. A torrent is created in 4 steps:
    │ │ │ │ │     1. first the files that will be part of the torrent are determined.
    │ │ │ │ │     2. the torrent properties are set, such as tracker url, web seeds, DHT nodes
    │ │ │ │ │ @@ -66,28 +66,28 @@
    │ │ │ │ │  Declared in "_l_i_b_t_o_r_r_e_n_t_/_c_r_e_a_t_e___t_o_r_r_e_n_t_._h_p_p"
    │ │ │ │ │  This class holds state for creating a torrent. After having added all
    │ │ │ │ │  information to it, call _c_r_e_a_t_e___t_o_r_r_e_n_t_:_:_g_e_n_e_r_a_t_e_(_) to generate the torrent. The
    │ │ │ │ │  _e_n_t_r_y that's returned can then be bencoded into a .torrent file using _b_e_n_c_o_d_e
    │ │ │ │ │  _(_).
    │ │ │ │ │  struct create_torrent
    │ │ │ │ │  {
    │ │ │ │ │ +   explicit ccrreeaattee__ttoorrrreenntt (torrent_info const& ti);
    │ │ │ │ │     explicit ccrreeaattee__ttoorrrreenntt (file_storage& fs, int piece_size = 0
    │ │ │ │ │        , create_flags_t flags = {});
    │ │ │ │ │ -   explicit ccrreeaattee__ttoorrrreenntt (torrent_info const& ti);
    │ │ │ │ │     std::vector ggeenneerraattee__bbuuff () const;
    │ │ │ │ │     entry ggeenneerraattee () const;
    │ │ │ │ │     file_storage const& ffiilleess () const;
    │ │ │ │ │     void sseett__ccoommmmeenntt (char const* str);
    │ │ │ │ │     void sseett__ccrreeaattoorr (char const* str);
    │ │ │ │ │     void sseett__ccrreeaattiioonn__ddaattee (std::time_t timestamp);
    │ │ │ │ │     void sseett__hhaasshh (piece_index_t index, sha1_hash const& h);
    │ │ │ │ │     void sseett__hhaasshh22 (file_index_t file, piece_index_t::diff_type piece,
    │ │ │ │ │  sha256_hash const& h);
    │ │ │ │ │ -   void aadddd__uurrll__sseeeedd (string_view url);
    │ │ │ │ │     void aadddd__hhttttpp__sseeeedd (string_view url);
    │ │ │ │ │ +   void aadddd__uurrll__sseeeedd (string_view url);
    │ │ │ │ │     void aadddd__nnooddee (std::pair node);
    │ │ │ │ │     void aadddd__ttrraacckkeerr (string_view url, int tier = 0);
    │ │ │ │ │     void sseett__rroooott__cceerrtt (string_view cert);
    │ │ │ │ │     bool pprriivv () const;
    │ │ │ │ │     void sseett__pprriivv (bool p);
    │ │ │ │ │     bool iiss__vv22__oonnllyy () const;
    │ │ │ │ │     bool iiss__vv11__oonnllyy () const;
    │ │ │ │ │ @@ -109,17 +109,17 @@
    │ │ │ │ │     static constexpr create_flags_t vv11__oonnllyy  = 6_bit;
    │ │ │ │ │     static constexpr create_flags_t ccaannoonniiccaall__ffiilleess  = 7_bit;
    │ │ │ │ │     static constexpr create_flags_t nnoo__aattttrriibbuutteess  = 8_bit;
    │ │ │ │ │     static constexpr create_flags_t ccaannoonniiccaall__ffiilleess__nnoo__ttaaiill__ppaaddddiinngg  = 9_bit;
    │ │ │ │ │  };
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │  ********** ccrreeaattee__ttoorrrreenntt(()) **********
    │ │ │ │ │ +explicit ccrreeaattee__ttoorrrreenntt (torrent_info const& ti);
    │ │ │ │ │  explicit ccrreeaattee__ttoorrrreenntt (file_storage& fs, int piece_size = 0
    │ │ │ │ │        , create_flags_t flags = {});
    │ │ │ │ │ -explicit ccrreeaattee__ttoorrrreenntt (torrent_info const& ti);
    │ │ │ │ │  The piece_size is the size of each piece in bytes. It must be a power of 2 and
    │ │ │ │ │  a minimum of 16 kiB. If a piece size of 0 is specified, a piece_size will be
    │ │ │ │ │  set automatically. Piece sizes greater than 128 MiB are considered unreasonable
    │ │ │ │ │  and will be rejected (with an lt::system_error exception).
    │ │ │ │ │  The flags arguments specifies options for the torrent creation. It can be any
    │ │ │ │ │  combination of the flags defined by create_flags_t.
    │ │ │ │ │  The _f_i_l_e___s_t_o_r_a_g_e (fs) parameter defines the files, sizes and their properties
    │ │ │ │ │ @@ -131,15 +131,15 @@
    │ │ │ │ │  functions of _c_r_e_a_t_e___t_o_r_r_e_n_t that affects the content of the info dictionary
    │ │ │ │ │  (such as _s_e_t___h_a_s_h_(_)), will have any affect. Instead of using this overload,
    │ │ │ │ │  consider using _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e_(_) instead.
    │ │ │ │ │  Warning
    │ │ │ │ │  The _f_i_l_e___s_t_o_r_a_g_e and _t_o_r_r_e_n_t___i_n_f_o objects must stay alive for the entire
    │ │ │ │ │  duration of the _c_r_e_a_t_e___t_o_r_r_e_n_t object.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ -********** ggeenneerraattee__bbuuff(()) ggeenneerraattee(()) **********
    │ │ │ │ │ +********** ggeenneerraattee(()) ggeenneerraattee__bbuuff(()) **********
    │ │ │ │ │  std::vector ggeenneerraattee__bbuuff () const;
    │ │ │ │ │  entry ggeenneerraattee () const;
    │ │ │ │ │  This function will generate the .torrent file as a bencode tree, or a bencoded
    │ │ │ │ │  into a buffer. In order to encode the _e_n_t_r_y into a flat file, use the _b_e_n_c_o_d_e_(_)
    │ │ │ │ │  function.
    │ │ │ │ │  The function returning an _e_n_t_r_y may be useful to add custom entries to the
    │ │ │ │ │  torrent file before bencoding it and saving it to disk.
    │ │ │ │ │ @@ -199,16 +199,16 @@
    │ │ │ │ │  be powers-of-2, so all per-piece merkle trees are complete. A SHA-256 hash of
    │ │ │ │ │  all zeros is internally used to indicate a hash that has not been set. Setting
    │ │ │ │ │  such hash will not be considered set when calling _g_e_n_e_r_a_t_e_(_). This function
    │ │ │ │ │  will throw std::system_error if it is called on an object constructed with the
    │ │ │ │ │  v1_only flag.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │  ********** aadddd__hhttttpp__sseeeedd(()) aadddd__uurrll__sseeeedd(()) **********
    │ │ │ │ │ -void aadddd__uurrll__sseeeedd (string_view url);
    │ │ │ │ │  void aadddd__hhttttpp__sseeeedd (string_view url);
    │ │ │ │ │ +void aadddd__uurrll__sseeeedd (string_view url);
    │ │ │ │ │  This adds a url seed to the torrent. You can have any number of url seeds. For
    │ │ │ │ │  a single file torrent, this should be an HTTP url, pointing to a file with
    │ │ │ │ │  identical content as the file of the torrent. For a multi-file torrent, it
    │ │ │ │ │  should point to a directory containing a directory with the same name as this
    │ │ │ │ │  torrent, and all the files of the torrent in it.
    │ │ │ │ │  The second function, add_http_seed() adds an HTTP seed instead.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ @@ -270,15 +270,15 @@
    │ │ │ │ │  ********** ppiieeccee__ssiizzee(()) ppiieeccee__lleennggtthh(()) **********
    │ │ │ │ │  int ppiieeccee__lleennggtthh () const;
    │ │ │ │ │  int ppiieeccee__ssiizzee (piece_index_t i) const;
    │ │ │ │ │  piece_length() returns the piece size of all pieces but the last one.
    │ │ │ │ │  piece_size() returns the size of the specified piece. these functions are just
    │ │ │ │ │  forwarding to the associated _f_i_l_e___s_t_o_r_a_g_e.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ -********** aadddd__ssiimmiillaarr__ttoorrrreenntt(()) aadddd__ccoolllleeccttiioonn(()) **********
    │ │ │ │ │ +********** aadddd__ccoolllleeccttiioonn(()) aadddd__ssiimmiillaarr__ttoorrrreenntt(()) **********
    │ │ │ │ │  void aadddd__ccoolllleeccttiioonn (string_view c);
    │ │ │ │ │  void aadddd__ssiimmiillaarr__ttoorrrreenntt (sha1_hash ih);
    │ │ │ │ │  Add similar torrents (by info-hash) or collections of similar torrents. Similar
    │ │ │ │ │  torrents are expected to share some files with this torrent. Torrents sharing a
    │ │ │ │ │  collection name with this torrent are also expected to share files with this
    │ │ │ │ │  torrent. A torrent may have more than one collection and more than one similar
    │ │ │ │ │  torrents. For more information, see _B_E_P_ _3_8.
    │ │ │ │ │ @@ -330,17 +330,17 @@
    │ │ │ │ │        behavior deviates from the specification but was the way libtorrent
    │ │ │ │ │        created torrents in version up to and including 2.0.7. This flag is here
    │ │ │ │ │        for backwards compatibility.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │  ************ aadddd__ffiilleess(()) ************
    │ │ │ │ │  Declared in "_l_i_b_t_o_r_r_e_n_t_/_c_r_e_a_t_e___t_o_r_r_e_n_t_._h_p_p"
    │ │ │ │ │  void aadddd__ffiilleess (file_storage& fs, std::string const& file
    │ │ │ │ │ -   , create_flags_t flags = {});
    │ │ │ │ │ -void aadddd__ffiilleess (file_storage& fs, std::string const& file
    │ │ │ │ │     , std::function p, create_flags_t flags = {});
    │ │ │ │ │ +void aadddd__ffiilleess (file_storage& fs, std::string const& file
    │ │ │ │ │ +   , create_flags_t flags = {});
    │ │ │ │ │  Adds the file specified by path to the _f_i_l_e___s_t_o_r_a_g_e object. In case path refers
    │ │ │ │ │  to a directory, files will be added recursively from the directory.
    │ │ │ │ │  If specified, the predicate p is called once for every file and directory that
    │ │ │ │ │  is encountered. Files for which p returns true are added, and directories for
    │ │ │ │ │  which p returns true are traversed. p must have the following signature:
    │ │ │ │ │  bool Pred(std::string const& p);
    │ │ │ │ │  The path that is passed in to the predicate is the full path of the file or
    │ │ │ │ │ @@ -348,30 +348,30 @@
    │ │ │ │ │  directories are traversed.
    │ │ │ │ │  The ".." directory is never traversed.
    │ │ │ │ │  The flags argument should be the same as the flags passed to the _c_r_e_a_t_e___t_o_r_r_e_n_t
    │ │ │ │ │  constructor.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │  ************ sseett__ppiieeccee__hhaasshheess(()) ************
    │ │ │ │ │  Declared in "_l_i_b_t_o_r_r_e_n_t_/_c_r_e_a_t_e___t_o_r_r_e_n_t_._h_p_p"
    │ │ │ │ │ -inline void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p);
    │ │ │ │ │ +inline void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p
    │ │ │ │ │ +   , std::function const& f);
    │ │ │ │ │  inline void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p
    │ │ │ │ │     , settings_interface const& settings
    │ │ │ │ │     , std::function const& f);
    │ │ │ │ │  void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p
    │ │ │ │ │ -   , settings_interface const& settings, disk_io_constructor_type disk_io
    │ │ │ │ │     , std::function const& f, error_code& ec);
    │ │ │ │ │ -inline void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p
    │ │ │ │ │ -   , std::function const& f);
    │ │ │ │ │  inline void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p,
    │ │ │ │ │  error_code& ec);
    │ │ │ │ │  void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p
    │ │ │ │ │ -   , settings_interface const& settings
    │ │ │ │ │ +   , settings_interface const& settings, disk_io_constructor_type disk_io
    │ │ │ │ │     , std::function const& f, error_code& ec);
    │ │ │ │ │  void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p
    │ │ │ │ │ +   , settings_interface const& settings
    │ │ │ │ │     , std::function const& f, error_code& ec);
    │ │ │ │ │ +inline void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p);
    │ │ │ │ │  This function will assume that the files added to the torrent file exists at
    │ │ │ │ │  path p, read those files and hash the content and set the hashes in the
    │ │ │ │ │  create_torrent object. The optional function f is called in between every hash
    │ │ │ │ │  that is set. f must have the following signature:
    │ │ │ │ │  void Fun(piece_index_t);
    │ │ │ │ │  The overloads taking a _s_e_t_t_i_n_g_s___p_a_c_k may be used to configure the underlying
    │ │ │ │ │  disk access. Such as settings_pack::aio_threads.
    │ │ │ ├── ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Custom_Storage.html
    │ │ │ │ @@ -36,15 +36,15 @@
    │ │ │ │  
  • on_disk()
  • │ │ │ │ │ │ │ │ │ │ │ │
  • open_file_state
  • │ │ │ │
  • disk_interface │ │ │ │
  • │ │ │ │
  • storage_holder
  • │ │ │ │ -
  • settings_interface
  • │ │ │ │ -
  • buffer_allocator_interface
  • │ │ │ │ -
  • disk_buffer_holder │ │ │ │
  • │ │ │ │

    You have some control over session configuration through the session::apply_settings() │ │ │ │ member function. To change one or more configuration options, create a settings_pack │ │ │ │ object and fill it with the settings to be set and pass it in to session::apply_settings().

    │ │ │ │

    The settings_pack object is a collection of settings updates that are applied │ │ │ │ @@ -218,18 +218,18 @@ │ │ │ │

    remove_torrent()

    │ │ │ │
    │ │ │ │  virtual void remove_torrent (storage_index_t) = 0;
    │ │ │ │  
    │ │ │ │

    remove the storage with the specified index. This is not expected to │ │ │ │ delete any files from disk, just to clean up any resources associated │ │ │ │ with the specified storage.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    async_write() async_read()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    async_read() async_write()

    │ │ │ │
    │ │ │ │  virtual bool async_write (storage_index_t storage, peer_request const& r
    │ │ │ │        , char const* buf, std::shared_ptr<disk_observer> o
    │ │ │ │        , std::function<void(storage_error const&)> handler
    │ │ │ │        , disk_job_flags_t flags = {}) = 0;
    │ │ │ │  virtual void async_read (storage_index_t storage, peer_request const& r
    │ │ │ │        , std::function<void(disk_buffer_holder, storage_error const&)> handler
    │ │ │ │ @@ -500,32 +500,14 @@
    │ │ │ │     void reset ();
    │ │ │ │     storage_holder& operator= (storage_holder const&) = delete;
    │ │ │ │     storage_holder (storage_holder const&) = delete;
    │ │ │ │     storage_holder (storage_holder&& rhs) noexcept;
    │ │ │ │     storage_holder& operator= (storage_holder&& rhs) noexcept;
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    settings_interface

    │ │ │ │ -

    Declared in "libtorrent/settings_pack.hpp"

    │ │ │ │ -

    the common interface to settings_pack and the internal representation of │ │ │ │ -settings.

    │ │ │ │ -
    │ │ │ │ -struct settings_interface
    │ │ │ │ -{
    │ │ │ │ -   virtual void set_bool (int name, bool val) = 0;
    │ │ │ │ -   virtual bool has_val (int name) const = 0;
    │ │ │ │ -   virtual void set_int (int name, int val) = 0;
    │ │ │ │ -   virtual void set_str (int name, std::string val) = 0;
    │ │ │ │ -   virtual int get_int (int name) const = 0;
    │ │ │ │ -   virtual std::string const& get_str (int name) const = 0;
    │ │ │ │ -   virtual bool get_bool (int name) const = 0;
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    buffer_allocator_interface

    │ │ │ │

    Declared in "libtorrent/disk_buffer_holder.hpp"

    │ │ │ │

    the interface for freeing disk buffers, used by the disk_buffer_holder. │ │ │ │ when implementing disk_interface, this must also be implemented in order │ │ │ │ to return disk buffers back to libtorrent

    │ │ │ │ @@ -542,16 +524,16 @@ │ │ │ │

    The disk buffer holder acts like a unique_ptr that frees a disk buffer │ │ │ │ when it's destructed

    │ │ │ │

    If this buffer holder is moved-from, default constructed or reset, │ │ │ │ data() will return nullptr.

    │ │ │ │
    │ │ │ │  struct disk_buffer_holder
    │ │ │ │  {
    │ │ │ │ -   disk_buffer_holder (disk_buffer_holder&&) noexcept;
    │ │ │ │     disk_buffer_holder& operator= (disk_buffer_holder&&) & noexcept;
    │ │ │ │ +   disk_buffer_holder (disk_buffer_holder&&) noexcept;
    │ │ │ │     disk_buffer_holder& operator= (disk_buffer_holder const&) = delete;
    │ │ │ │     disk_buffer_holder (disk_buffer_holder const&) = delete;
    │ │ │ │     disk_buffer_holder (buffer_allocator_interface& alloc
    │ │ │ │        , char* buf, int sz) noexcept;
    │ │ │ │     disk_buffer_holder () noexcept = default;
    │ │ │ │     ~disk_buffer_holder ();
    │ │ │ │     char* data () const noexcept;
    │ │ │ │ @@ -618,16 +600,34 @@
    │ │ │ │  
    │ │ │ │

    bool()

    │ │ │ │
    │ │ │ │  explicit operator bool () const noexcept;
    │ │ │ │  
    │ │ │ │

    implicitly convertible to true if the object is currently holding a │ │ │ │ buffer

    │ │ │ │ -[report issue]
    │ │ │ │ +[report issue]
    │ │ │ │ │ │ │ │ +
    │ │ │ │ +

    settings_interface

    │ │ │ │ +

    Declared in "libtorrent/settings_pack.hpp"

    │ │ │ │ +

    the common interface to settings_pack and the internal representation of │ │ │ │ +settings.

    │ │ │ │ +
    │ │ │ │ +struct settings_interface
    │ │ │ │ +{
    │ │ │ │ +   virtual void set_str (int name, std::string val) = 0;
    │ │ │ │ +   virtual bool has_val (int name) const = 0;
    │ │ │ │ +   virtual void set_bool (int name, bool val) = 0;
    │ │ │ │ +   virtual void set_int (int name, int val) = 0;
    │ │ │ │ +   virtual int get_int (int name) const = 0;
    │ │ │ │ +   virtual bool get_bool (int name) const = 0;
    │ │ │ │ +   virtual std::string const& get_str (int name) const = 0;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │
    │ │ │ │

    file_open_mode_t

    │ │ │ │

    Declared in "libtorrent/disk_interface.hpp"

    │ │ │ │
    │ │ │ │
    read_only
    │ │ │ │
    open the file for reading only
    │ │ │ │
    │ │ │ │ ├── html2text {} │ │ │ │ │ @@ -5,15 +5,15 @@ │ │ │ │ │ Table of contents │ │ │ │ │ * _d_i_s_k___o_b_s_e_r_v_e_r │ │ │ │ │ o _o_n___d_i_s_k_(_) │ │ │ │ │ * _o_p_e_n___f_i_l_e___s_t_a_t_e │ │ │ │ │ * _d_i_s_k___i_n_t_e_r_f_a_c_e │ │ │ │ │ o _n_e_w___t_o_r_r_e_n_t_(_) │ │ │ │ │ o _r_e_m_o_v_e___t_o_r_r_e_n_t_(_) │ │ │ │ │ - o _a_s_y_n_c___w_r_i_t_e_(_)_ _a_s_y_n_c___r_e_a_d_(_) │ │ │ │ │ + o _a_s_y_n_c___r_e_a_d_(_)_ _a_s_y_n_c___w_r_i_t_e_(_) │ │ │ │ │ o _a_s_y_n_c___h_a_s_h_(_) │ │ │ │ │ o _a_s_y_n_c___h_a_s_h_2_(_) │ │ │ │ │ o _a_s_y_n_c___m_o_v_e___s_t_o_r_a_g_e_(_) │ │ │ │ │ o _a_s_y_n_c___r_e_l_e_a_s_e___f_i_l_e_s_(_) │ │ │ │ │ o _a_s_y_n_c___c_h_e_c_k___f_i_l_e_s_(_) │ │ │ │ │ o _a_s_y_n_c___s_t_o_p___t_o_r_r_e_n_t_(_) │ │ │ │ │ o _a_s_y_n_c___r_e_n_a_m_e___f_i_l_e_(_) │ │ │ │ │ @@ -22,25 +22,25 @@ │ │ │ │ │ o _a_s_y_n_c___c_l_e_a_r___p_i_e_c_e_(_) │ │ │ │ │ o _u_p_d_a_t_e___s_t_a_t_s___c_o_u_n_t_e_r_s_(_) │ │ │ │ │ o _g_e_t___s_t_a_t_u_s_(_) │ │ │ │ │ o _a_b_o_r_t_(_) │ │ │ │ │ o _s_u_b_m_i_t___j_o_b_s_(_) │ │ │ │ │ o _s_e_t_t_i_n_g_s___u_p_d_a_t_e_d_(_) │ │ │ │ │ * _s_t_o_r_a_g_e___h_o_l_d_e_r │ │ │ │ │ - * _s_e_t_t_i_n_g_s___i_n_t_e_r_f_a_c_e │ │ │ │ │ * _b_u_f_f_e_r___a_l_l_o_c_a_t_o_r___i_n_t_e_r_f_a_c_e │ │ │ │ │ * _d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r │ │ │ │ │ o _d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r_(_) │ │ │ │ │ o _d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r_(_) │ │ │ │ │ o _~_d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r_(_) │ │ │ │ │ o _d_a_t_a_(_) │ │ │ │ │ o _r_e_s_e_t_(_) │ │ │ │ │ o _s_w_a_p_(_) │ │ │ │ │ o _i_s___m_u_t_a_b_l_e_(_) │ │ │ │ │ o _b_o_o_l_(_) │ │ │ │ │ + * _s_e_t_t_i_n_g_s___i_n_t_e_r_f_a_c_e │ │ │ │ │ * _f_i_l_e___o_p_e_n___m_o_d_e___t │ │ │ │ │ You have some control over _s_e_s_s_i_o_n configuration through the session:: │ │ │ │ │ apply_settings() member function. To change one or more configuration options, │ │ │ │ │ create a _s_e_t_t_i_n_g_s___p_a_c_k object and fill it with the settings to be set and pass │ │ │ │ │ it in to session::apply_settings(). │ │ │ │ │ The _s_e_t_t_i_n_g_s___p_a_c_k object is a collection of settings updates that are applied │ │ │ │ │ to the _s_e_s_s_i_o_n when passed to session::apply_settings(). It's empty when │ │ │ │ │ @@ -171,15 +171,15 @@ │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** rreemmoovvee__ttoorrrreenntt(()) ********** │ │ │ │ │ virtual void rreemmoovvee__ttoorrrreenntt (storage_index_t) = 0; │ │ │ │ │ remove the storage with the specified index. This is not expected to delete any │ │ │ │ │ files from disk, just to clean up any resources associated with the specified │ │ │ │ │ storage. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aassyynncc__wwrriittee(()) aassyynncc__rreeaadd(()) ********** │ │ │ │ │ +********** aassyynncc__rreeaadd(()) aassyynncc__wwrriittee(()) ********** │ │ │ │ │ virtual bool aassyynncc__wwrriittee (storage_index_t storage, peer_request const& r │ │ │ │ │ , char const* buf, std::shared_ptr o │ │ │ │ │ , std::function handler │ │ │ │ │ , disk_job_flags_t flags = {}) = 0; │ │ │ │ │ virtual void aassyynncc__rreeaadd (storage_index_t storage, peer_request const& r │ │ │ │ │ , std::function handler │ │ │ │ │ , disk_job_flags_t flags = {}) = 0; │ │ │ │ │ @@ -385,29 +385,14 @@ │ │ │ │ │ void rreesseett (); │ │ │ │ │ storage_holder& ooppeerraattoorr== (storage_holder const&) = delete; │ │ │ │ │ ssttoorraaggee__hhoollddeerr (storage_holder const&) = delete; │ │ │ │ │ ssttoorraaggee__hhoollddeerr (storage_holder&& rhs) noexcept; │ │ │ │ │ storage_holder& ooppeerraattoorr== (storage_holder&& rhs) noexcept; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ sseettttiinnggss__iinntteerrffaaccee ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_t_t_i_n_g_s___p_a_c_k_._h_p_p" │ │ │ │ │ -the common interface to _s_e_t_t_i_n_g_s___p_a_c_k and the internal representation of │ │ │ │ │ -settings. │ │ │ │ │ -struct settings_interface │ │ │ │ │ -{ │ │ │ │ │ - virtual void sseett__bbooooll (int name, bool val) = 0; │ │ │ │ │ - virtual bool hhaass__vvaall (int name) const = 0; │ │ │ │ │ - virtual void sseett__iinntt (int name, int val) = 0; │ │ │ │ │ - virtual void sseett__ssttrr (int name, std::string val) = 0; │ │ │ │ │ - virtual int ggeett__iinntt (int name) const = 0; │ │ │ │ │ - virtual std::string const& ggeett__ssttrr (int name) const = 0; │ │ │ │ │ - virtual bool ggeett__bbooooll (int name) const = 0; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ bbuuffffeerr__aallllooccaattoorr__iinntteerrffaaccee ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r_._h_p_p" │ │ │ │ │ the interface for freeing disk buffers, used by the _d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r. when │ │ │ │ │ implementing _d_i_s_k___i_n_t_e_r_f_a_c_e, this must also be implemented in order to return │ │ │ │ │ disk buffers back to libtorrent │ │ │ │ │ struct buffer_allocator_interface │ │ │ │ │ { │ │ │ │ │ @@ -418,16 +403,16 @@ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r_._h_p_p" │ │ │ │ │ The disk buffer holder acts like a unique_ptr that frees a disk buffer when │ │ │ │ │ it's destructed │ │ │ │ │ If this buffer holder is moved-from, default constructed or reset, data() will │ │ │ │ │ return nullptr. │ │ │ │ │ struct disk_buffer_holder │ │ │ │ │ { │ │ │ │ │ - ddiisskk__bbuuffffeerr__hhoollddeerr (disk_buffer_holder&&) noexcept; │ │ │ │ │ disk_buffer_holder& ooppeerraattoorr== (disk_buffer_holder&&) & noexcept; │ │ │ │ │ + ddiisskk__bbuuffffeerr__hhoollddeerr (disk_buffer_holder&&) noexcept; │ │ │ │ │ disk_buffer_holder& ooppeerraattoorr== (disk_buffer_holder const&) = delete; │ │ │ │ │ ddiisskk__bbuuffffeerr__hhoollddeerr (disk_buffer_holder const&) = delete; │ │ │ │ │ ddiisskk__bbuuffffeerr__hhoollddeerr (buffer_allocator_interface& alloc │ │ │ │ │ , char* buf, int sz) noexcept; │ │ │ │ │ ddiisskk__bbuuffffeerr__hhoollddeerr () noexcept = default; │ │ │ │ │ ~~ddiisskk__bbuuffffeerr__hhoollddeerr (); │ │ │ │ │ char* ddaattaa () const noexcept; │ │ │ │ │ @@ -469,14 +454,29 @@ │ │ │ │ │ bool iiss__mmuuttaabbllee () const noexcept; │ │ │ │ │ if this returns true, the buffer may not be modified in place │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** bbooooll(()) ********** │ │ │ │ │ explicit operator bbooooll () const noexcept; │ │ │ │ │ implicitly convertible to true if the object is currently holding a buffer │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ sseettttiinnggss__iinntteerrffaaccee ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_t_t_i_n_g_s___p_a_c_k_._h_p_p" │ │ │ │ │ +the common interface to _s_e_t_t_i_n_g_s___p_a_c_k and the internal representation of │ │ │ │ │ +settings. │ │ │ │ │ +struct settings_interface │ │ │ │ │ +{ │ │ │ │ │ + virtual void sseett__ssttrr (int name, std::string val) = 0; │ │ │ │ │ + virtual bool hhaass__vvaall (int name) const = 0; │ │ │ │ │ + virtual void sseett__bbooooll (int name, bool val) = 0; │ │ │ │ │ + virtual void sseett__iinntt (int name, int val) = 0; │ │ │ │ │ + virtual int ggeett__iinntt (int name) const = 0; │ │ │ │ │ + virtual bool ggeett__bbooooll (int name) const = 0; │ │ │ │ │ + virtual std::string const& ggeett__ssttrr (int name) const = 0; │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ffiillee__ooppeenn__mmooddee__tt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___i_n_t_e_r_f_a_c_e_._h_p_p" │ │ │ │ │ read_only │ │ │ │ │ open the file for reading only │ │ │ │ │ write_only │ │ │ │ │ open the file for writing only │ │ │ │ │ read_write │ │ │ ├── ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Error_Codes.html │ │ │ │ @@ -33,44 +33,44 @@ │ │ │ │

    Table of contents

    │ │ │ │ │ │ │ │
    │ │ │ │ [report issue]
    │ │ │ │

    storage_error

    │ │ │ │

    Declared in "libtorrent/error_code.hpp"

    │ │ │ │

    used by storage to return errors │ │ │ │ also includes which underlying file the │ │ │ │ error happened on

    │ │ │ │
    │ │ │ │  struct storage_error
    │ │ │ │  {
    │ │ │ │     explicit operator bool () const;
    │ │ │ │ -   file_index_t file () const;
    │ │ │ │     void file (file_index_t f);
    │ │ │ │ +   file_index_t file () const;
    │ │ │ │  
    │ │ │ │     error_code ec;
    │ │ │ │     operation_t operation;
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ [report issue]
    │ │ │ │

    bool()

    │ │ │ │ @@ -79,31 +79,39 @@ │ │ │ │ │ │ │ │

    explicitly converts to true if this object represents an error, and │ │ │ │ false if it does not.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    file()

    │ │ │ │
    │ │ │ │ -file_index_t file () const;
    │ │ │ │  void file (file_index_t f);
    │ │ │ │ +file_index_t file () const;
    │ │ │ │  
    │ │ │ │

    set and query the index (in the torrent) of the file this error │ │ │ │ occurred on. This may also have special values defined in │ │ │ │ torrent_status.

    │ │ │ │ [report issue]
    │ │ │ │
    ec
    │ │ │ │
    the error that occurred
    │ │ │ │
    │ │ │ │ [report issue]
    │ │ │ │
    operation
    │ │ │ │
    A code from operation_t enum, indicating what │ │ │ │ kind of operation failed.
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ +[report issue]
    │ │ │ │ │ │ │ │ +
    │ │ │ │ +

    i2p_category()

    │ │ │ │ +

    Declared in "libtorrent/i2p_stream.hpp"

    │ │ │ │ +
    │ │ │ │ +boost::system::error_category& i2p_category ();
    │ │ │ │ +
    │ │ │ │ +

    returns the error category for I2P errors

    │ │ │ │ +[report issue]
    │ │ │ │
    │ │ │ │

    libtorrent_category()

    │ │ │ │

    Declared in "libtorrent/error_code.hpp"

    │ │ │ │
    │ │ │ │  boost::system::error_category& libtorrent_category ();
    │ │ │ │  
    │ │ │ │

    return the instance of the libtorrent_error_category which │ │ │ │ @@ -112,29 +120,30 @@ │ │ │ │

    │ │ │ │

    http_category()

    │ │ │ │

    Declared in "libtorrent/error_code.hpp"

    │ │ │ │
    │ │ │ │  boost::system::error_category& http_category ();
    │ │ │ │  
    │ │ │ │

    returns the error_category for HTTP errors

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    i2p_category()

    │ │ │ │ -

    Declared in "libtorrent/i2p_stream.hpp"

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    upnp_category()

    │ │ │ │ +

    Declared in "libtorrent/upnp.hpp"

    │ │ │ │
    │ │ │ │ -boost::system::error_category& i2p_category ();
    │ │ │ │ +boost::system::error_category& upnp_category ();
    │ │ │ │  
    │ │ │ │ -

    returns the error category for I2P errors

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    bdecode_category()

    │ │ │ │ -

    Declared in "libtorrent/bdecode.hpp"

    │ │ │ │ +

    the boost.system error category for UPnP errors

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    gzip_category()

    │ │ │ │ +

    Declared in "libtorrent/gzip.hpp"

    │ │ │ │
    │ │ │ │ -boost::system::error_category& bdecode_category ();
    │ │ │ │ +boost::system::error_category& gzip_category ();
    │ │ │ │  
    │ │ │ │ +

    get the error_category for zip errors

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    pcp_category()

    │ │ │ │

    Declared in "libtorrent/natpmp.hpp"

    │ │ │ │
    │ │ │ │  boost::system::error_category& pcp_category ();
    │ │ │ │  
    │ │ │ │ @@ -142,30 +151,80 @@ │ │ │ │
    │ │ │ │

    socks_category()

    │ │ │ │

    Declared in "libtorrent/socks5_stream.hpp"

    │ │ │ │
    │ │ │ │  boost::system::error_category& socks_category ();
    │ │ │ │  
    │ │ │ │

    returns the error_category for SOCKS5 errors

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    gzip_category()

    │ │ │ │ -

    Declared in "libtorrent/gzip.hpp"

    │ │ │ │ -
    │ │ │ │ -boost::system::error_category& gzip_category ();
    │ │ │ │ -
    │ │ │ │ -

    get the error_category for zip errors

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    upnp_category()

    │ │ │ │ -

    Declared in "libtorrent/upnp.hpp"

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    bdecode_category()

    │ │ │ │ +

    Declared in "libtorrent/bdecode.hpp"

    │ │ │ │
    │ │ │ │ -boost::system::error_category& upnp_category ();
    │ │ │ │ +boost::system::error_category& bdecode_category ();
    │ │ │ │  
    │ │ │ │ -

    the boost.system error category for UPnP errors

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum i2p_error_code

    │ │ │ │ +

    Declared in "libtorrent/i2p_stream.hpp"

    │ │ │ │ + │ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +
    namevaluedescription
    no_error0 
    parse_failed1 
    cant_reach_peer2 
    i2p_error3 
    invalid_key4 
    invalid_id5 
    timeout6 
    key_not_found7 
    duplicated_id8 
    num_errors9 
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    enum error_code_enum

    │ │ │ │

    Declared in "libtorrent/error_code.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ @@ -991,124 +1050,167 @@ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
    service_unavailable503 
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum i2p_error_code

    │ │ │ │ -

    Declared in "libtorrent/i2p_stream.hpp"

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum error_code_enum

    │ │ │ │ +

    Declared in "libtorrent/upnp.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │
    namevaluedescription
    no_error0 No error
    parse_failed1 
    invalid_argument402One of the arguments in the request is invalid
    cant_reach_peer2 
    action_failed501The request failed
    i2p_error3 
    value_not_in_array714The specified value does not exist in the array
    invalid_key4 
    source_ip_cannot_be_wildcarded715The source IP address cannot be wild-carded, but │ │ │ │ +must be fully specified
    invalid_id5 
    external_port_cannot_be_wildcarded716The external port cannot be a wildcard, but must │ │ │ │ +be specified
    timeout6 
    port_mapping_conflict718The port mapping entry specified conflicts with a │ │ │ │ +mapping assigned previously to another client
    key_not_found7 
    internal_port_must_match_external724Internal and external port value must be the same
    duplicated_id8 
    only_permanent_leases_supported725The NAT implementation only supports permanent │ │ │ │ +lease times on port mappings
    num_errors9 
    remote_host_must_be_wildcard726RemoteHost must be a wildcard and cannot be a │ │ │ │ +specific IP address or DNS name
    external_port_must_be_wildcard727ExternalPort must be a wildcard and cannot be a │ │ │ │ +specific port
    │ │ │ │ [report issue]
    │ │ │ │ -
    │ │ │ │ +
    │ │ │ │

    enum error_code_enum

    │ │ │ │ -

    Declared in "libtorrent/bdecode.hpp"

    │ │ │ │ +

    Declared in "libtorrent/gzip.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
    namevaluedescription
    no_error0Not an error
    expected_digit
    invalid_gzip_header1expected digit in bencoded stringthe supplied gzip buffer has invalid header
    expected_colon
    inflated_data_too_large2expected colon in bencoded stringthe gzip buffer would inflate to more bytes than the specified │ │ │ │ +maximum size, and was rejected.
    unexpected_eof
    data_did_not_terminate3unexpected end of file in bencoded stringavailable inflate data did not terminate
    expected_value
    space_exhausted4expected value (list, dict, int or string) in bencoded stringoutput space exhausted before completing inflate
    depth_exceeded
    invalid_block_type5bencoded recursion depth limit exceededinvalid block type (type == 3)
    limit_exceeded
    invalid_stored_block_length6bencoded item count limit exceededstored block length did not match one's complement
    overflow
    too_many_length_or_distance_codes7integer overflowdynamic block code description: too many length or distance codes
    error_code_max
    code_lengths_codes_incomplete8dynamic block code description: code lengths codes incomplete
    repeat_lengths_with_no_first_length9dynamic block code description: repeat lengths with no first length
    repeat_more_than_specified_lengths10dynamic block code description: repeat more than specified lengths
    invalid_literal_length_code_lengths11dynamic block code description: invalid literal/length code lengths
    invalid_distance_code_lengths12dynamic block code description: invalid distance code lengths
    invalid_literal_code_in_block13invalid literal/length or distance code in fixed or dynamic block
    distance_too_far_back_in_block14distance is too far back in fixed or dynamic block
    unknown_gzip_error15an unknown error occurred during gzip inflation
    error_code_max16the number of error codes
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    enum pcp_errors

    │ │ │ │ @@ -1244,170 +1346,68 @@ │ │ │ │ num_errors │ │ │ │ 10 │ │ │ │   │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │ -
    │ │ │ │ +
    │ │ │ │

    enum error_code_enum

    │ │ │ │ -

    Declared in "libtorrent/gzip.hpp"

    │ │ │ │ +

    Declared in "libtorrent/bdecode.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
    namevaluedescription
    no_error0Not an error
    invalid_gzip_header
    expected_digit1the supplied gzip buffer has invalid headerexpected digit in bencoded string
    inflated_data_too_large
    expected_colon2the gzip buffer would inflate to more bytes than the specified │ │ │ │ -maximum size, and was rejected.expected colon in bencoded string
    data_did_not_terminate
    unexpected_eof3available inflate data did not terminateunexpected end of file in bencoded string
    space_exhausted
    expected_value4output space exhausted before completing inflateexpected value (list, dict, int or string) in bencoded string
    invalid_block_type
    depth_exceeded5invalid block type (type == 3)bencoded recursion depth limit exceeded
    invalid_stored_block_length
    limit_exceeded6stored block length did not match one's complementbencoded item count limit exceeded
    too_many_length_or_distance_codes
    overflow7dynamic block code description: too many length or distance codes
    code_lengths_codes_incomplete8dynamic block code description: code lengths codes incomplete
    repeat_lengths_with_no_first_length9dynamic block code description: repeat lengths with no first length
    repeat_more_than_specified_lengths10dynamic block code description: repeat more than specified lengths
    invalid_literal_length_code_lengths11dynamic block code description: invalid literal/length code lengths
    invalid_distance_code_lengths12dynamic block code description: invalid distance code lengths
    invalid_literal_code_in_block13invalid literal/length or distance code in fixed or dynamic block
    distance_too_far_back_in_block14distance is too far back in fixed or dynamic block
    unknown_gzip_error15an unknown error occurred during gzip inflationinteger overflow
    error_code_max168the number of error codes
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum error_code_enum

    │ │ │ │ -

    Declared in "libtorrent/upnp.hpp"

    │ │ │ │ - │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -
    namevaluedescription
    no_error0No error
    invalid_argument402One of the arguments in the request is invalid
    action_failed501The request failed
    value_not_in_array714The specified value does not exist in the array
    source_ip_cannot_be_wildcarded715The source IP address cannot be wild-carded, but │ │ │ │ -must be fully specified
    external_port_cannot_be_wildcarded716The external port cannot be a wildcard, but must │ │ │ │ -be specified
    port_mapping_conflict718The port mapping entry specified conflicts with a │ │ │ │ -mapping assigned previously to another client
    internal_port_must_match_external724Internal and external port value must be the same
    only_permanent_leases_supported725The NAT implementation only supports permanent │ │ │ │ -lease times on port mappings
    remote_host_must_be_wildcard726RemoteHost must be a wildcard and cannot be a │ │ │ │ -specific IP address or DNS name
    external_port_must_be_wildcard727ExternalPort must be a wildcard and cannot be a │ │ │ │ -specific port
    │ │ │ │
    │ │ │ │ │ │ │ │
    │ │ │ │
    │ │ │ │
    │ │ │ │
    │ │ │ │ │ │ │ │ -
    │ │ │ │ -

    on_choke() on_have() on_have_all() on_have_none() on_unchoke() on_request() on_bitfield() on_allowed_fast() on_dont_have() on_not_interested() on_interested()

    │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    on_bitfield() on_request() on_have_all() on_have() on_allowed_fast() on_have_none() on_not_interested() on_unchoke() on_choke() on_interested() on_dont_have()

    │ │ │ │
    │ │ │ │ -virtual bool on_request (peer_request const&);
    │ │ │ │ -virtual bool on_dont_have (piece_index_t);
    │ │ │ │ -virtual bool on_bitfield (bitfield const& /*bitfield*/);
    │ │ │ │ -virtual bool on_have_none ();
    │ │ │ │  virtual bool on_have_all ();
    │ │ │ │ -virtual bool on_not_interested ();
    │ │ │ │ +virtual bool on_unchoke ();
    │ │ │ │ +virtual bool on_dont_have (piece_index_t);
    │ │ │ │  virtual bool on_allowed_fast (piece_index_t);
    │ │ │ │ +virtual bool on_have (piece_index_t);
    │ │ │ │ +virtual bool on_bitfield (bitfield const& /*bitfield*/);
    │ │ │ │  virtual bool on_interested ();
    │ │ │ │ -virtual bool on_unchoke ();
    │ │ │ │ +virtual bool on_have_none ();
    │ │ │ │  virtual bool on_choke ();
    │ │ │ │ -virtual bool on_have (piece_index_t);
    │ │ │ │ +virtual bool on_not_interested ();
    │ │ │ │ +virtual bool on_request (peer_request const&);
    │ │ │ │  
    │ │ │ │

    returning true from any of the message handlers │ │ │ │ indicates that the plugin has handled the message. │ │ │ │ it will break the plugin chain traversing and not let │ │ │ │ anyone else handle the message, including the default │ │ │ │ handler.

    │ │ │ │ [report issue]
    │ │ │ │ @@ -683,27 +613,27 @@ │ │ │ │ │ │ │ │

    This function is called when the peer connection is receiving │ │ │ │ a piece. buf points (non-owning pointer) to the data in an │ │ │ │ internal immutable disk buffer. The length of the data is specified │ │ │ │ in the length member of the piece parameter. │ │ │ │ returns true to indicate that the piece is handled and the │ │ │ │ rest of the logic should be ignored.

    │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ + │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    sent_unchoke() sent_piece() sent_have() sent_interested() sent_not_interested()

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    sent_not_interested() sent_have() sent_unchoke() sent_interested() sent_piece()

    │ │ │ │
    │ │ │ │  virtual void sent_not_interested ();
    │ │ │ │ -virtual void sent_interested ();
    │ │ │ │ -virtual void sent_have (piece_index_t);
    │ │ │ │  virtual void sent_piece (peer_request const&);
    │ │ │ │  virtual void sent_unchoke ();
    │ │ │ │ +virtual void sent_interested ();
    │ │ │ │ +virtual void sent_have (piece_index_t);
    │ │ │ │  
    │ │ │ │

    called after a choke message has been sent to the peer

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    sent_payload()

    │ │ │ │
    │ │ │ │  virtual void sent_payload (int /* bytes */);
    │ │ │ │ @@ -739,18 +669,18 @@
    │ │ │ │  
    │ │ │ │

    on_unknown_message()

    │ │ │ │
    │ │ │ │  virtual bool on_unknown_message (int /*length*/, int /*msg*/,
    │ │ │ │        span<char const> /*body*/);
    │ │ │ │  
    │ │ │ │

    this is not called for web seeds

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    on_piece_pass() on_piece_failed()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    on_piece_failed() on_piece_pass()

    │ │ │ │
    │ │ │ │  virtual void on_piece_pass (piece_index_t);
    │ │ │ │  virtual void on_piece_failed (piece_index_t);
    │ │ │ │  
    │ │ │ │

    called when a piece that this peer participated in either │ │ │ │ fails or passes the hash_check

    │ │ │ │ [report issue]
    │ │ │ │ @@ -773,16 +703,16 @@ │ │ │ │
    │ │ │ │
    │ │ │ │

    crypto_plugin

    │ │ │ │

    Declared in "libtorrent/extensions.hpp"

    │ │ │ │
    │ │ │ │  struct crypto_plugin
    │ │ │ │  {
    │ │ │ │ -   virtual void set_outgoing_key (span<char const> key) = 0;
    │ │ │ │     virtual void set_incoming_key (span<char const> key) = 0;
    │ │ │ │ +   virtual void set_outgoing_key (span<char const> key) = 0;
    │ │ │ │     encrypt (span<span<char>> /*send_vec*/) = 0;
    │ │ │ │     virtual std::tuple<int, int, int> decrypt (span<span<char>> /*receive_vec*/) = 0;
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ [report issue]
    │ │ │ │

    decrypt()

    │ │ │ │
    │ │ │ │ @@ -793,42 +723,112 @@
    │ │ │ │  (consume, produce, packet_size)

    │ │ │ │

    consume is set to the number of bytes which should be trimmed from the │ │ │ │ head of the buffers, default is 0

    │ │ │ │

    produce is set to the number of bytes of payload which are now ready to │ │ │ │ be sent to the upper layer. default is the number of bytes passed in receive_vec

    │ │ │ │

    packet_size is set to the minimum number of bytes which must be read to │ │ │ │ advance the next step of decryption. default is 0

    │ │ │ │ -[report issue]
    │ │ │ │ +[report issue]
    │ │ │ │
    │ │ │ │ -
    │ │ │ │ -

    create_smart_ban_plugin()

    │ │ │ │ -

    Declared in "libtorrent/extensions/smart_ban.hpp"

    │ │ │ │ +
    │ │ │ │ +

    peer_connection_handle

    │ │ │ │ +

    Declared in "libtorrent/peer_connection_handle.hpp"

    │ │ │ │ +

    the peer_connection_handle class provides a handle to the internal peer │ │ │ │ +connection object, to be used by plugins. This is a low level interface that │ │ │ │ +may not be stable across libtorrent versions

    │ │ │ │
    │ │ │ │ -std::shared_ptr<torrent_plugin> create_smart_ban_plugin (torrent_handle const&, client_data_t);
    │ │ │ │ +struct peer_connection_handle
    │ │ │ │ +{
    │ │ │ │ +   explicit peer_connection_handle (std::weak_ptr<peer_connection> impl);
    │ │ │ │ +   connection_type type () const;
    │ │ │ │ +   void add_extension (std::shared_ptr<peer_plugin>);
    │ │ │ │ +   peer_plugin const* find_plugin (string_view type) const;
    │ │ │ │ +   bool is_seed () const;
    │ │ │ │ +   bool upload_only () const;
    │ │ │ │ +   bool has_piece (piece_index_t i) const;
    │ │ │ │ +   peer_id const& pid () const;
    │ │ │ │ +   bool is_choked () const;
    │ │ │ │ +   bool is_interesting () const;
    │ │ │ │ +   bool has_peer_choked () const;
    │ │ │ │ +   bool is_peer_interested () const;
    │ │ │ │ +   void choke_this_peer ();
    │ │ │ │ +   void maybe_unchoke_this_peer ();
    │ │ │ │ +   void get_peer_info (peer_info& p) const;
    │ │ │ │ +   torrent_handle associated_torrent () const;
    │ │ │ │ +   tcp::endpoint const& remote () const;
    │ │ │ │ +   tcp::endpoint local_endpoint () const;
    │ │ │ │ +   void disconnect (error_code const& ec, operation_t op
    │ │ │ │ +      , disconnect_severity_t = peer_connection_interface::normal);
    │ │ │ │ +   bool is_disconnecting () const;
    │ │ │ │ +   bool is_connecting () const;
    │ │ │ │ +   bool is_outgoing () const;
    │ │ │ │ +   bool on_local_network () const;
    │ │ │ │ +   bool ignore_unchoke_slots () const;
    │ │ │ │ +   bool failed () const;
    │ │ │ │ +   bool should_log (peer_log_alert::direction_t direction) const;
    │ │ │ │ +   void peer_log (peer_log_alert::direction_t direction
    │ │ │ │ +      , char const* event, char const* fmt = "", ...) const TORRENT_FORMAT(4,5);
    │ │ │ │ +   bool can_disconnect (error_code const& ec) const;
    │ │ │ │ +   bool has_metadata () const;
    │ │ │ │ +   bool in_handshake () const;
    │ │ │ │ +   void send_buffer (char const* begin, int size);
    │ │ │ │ +   std::time_t last_seen_complete () const;
    │ │ │ │ +   time_point time_of_last_unchoke () const;
    │ │ │ │ +   bool operator== (peer_connection_handle const& o) const;
    │ │ │ │ +   bool operator< (peer_connection_handle const& o) const;
    │ │ │ │ +   bool operator!= (peer_connection_handle const& o) const;
    │ │ │ │ +   std::shared_ptr<peer_connection> native_handle () const;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    bt_peer_connection_handle

    │ │ │ │ +

    Declared in "libtorrent/peer_connection_handle.hpp"

    │ │ │ │ +

    The bt_peer_connection_handle provides a handle to the internal bittorrent │ │ │ │ +peer connection object to plugins. It's low level and may not be a stable API │ │ │ │ +across libtorrent versions.

    │ │ │ │ +
    │ │ │ │ +struct bt_peer_connection_handle : peer_connection_handle
    │ │ │ │ +{
    │ │ │ │ +   explicit bt_peer_connection_handle (peer_connection_handle pc);
    │ │ │ │ +   bool support_extensions () const;
    │ │ │ │ +   bool packet_finished () const;
    │ │ │ │ +   bool supports_encryption () const;
    │ │ │ │ +   void switch_send_crypto (std::shared_ptr<crypto_plugin> crypto);
    │ │ │ │ +   void switch_recv_crypto (std::shared_ptr<crypto_plugin> crypto);
    │ │ │ │ +   std::shared_ptr<bt_peer_connection> native_handle () const;
    │ │ │ │ +};
    │ │ │ │  
    │ │ │ │ -

    constructor function for the smart ban extension. The extension keeps │ │ │ │ -track of the data peers have sent us for failing pieces and once the │ │ │ │ -piece completes and passes the hash check bans the peers that turned │ │ │ │ -out to have sent corrupt data. │ │ │ │ -This function can either be passed in the add_torrent_params::extensions │ │ │ │ -field, or via torrent_handle::add_extension().

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    create_ut_pex_plugin()

    │ │ │ │

    Declared in "libtorrent/extensions/ut_pex.hpp"

    │ │ │ │
    │ │ │ │  std::shared_ptr<torrent_plugin> create_ut_pex_plugin (torrent_handle const&, client_data_t);
    │ │ │ │  
    │ │ │ │

    constructor function for the ut_pex extension. The ut_pex │ │ │ │ extension allows peers to gossip about their connections, allowing │ │ │ │ the swarm stay well connected and peers aware of more peers in the │ │ │ │ swarm. This extension is enabled by default unless explicitly disabled in │ │ │ │ the session constructor.

    │ │ │ │

    This can either be passed in the add_torrent_params::extensions field, or │ │ │ │ via torrent_handle::add_extension().

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    create_smart_ban_plugin()

    │ │ │ │ +

    Declared in "libtorrent/extensions/smart_ban.hpp"

    │ │ │ │ +
    │ │ │ │ +std::shared_ptr<torrent_plugin> create_smart_ban_plugin (torrent_handle const&, client_data_t);
    │ │ │ │ +
    │ │ │ │ +

    constructor function for the smart ban extension. The extension keeps │ │ │ │ +track of the data peers have sent us for failing pieces and once the │ │ │ │ +piece completes and passes the hash check bans the peers that turned │ │ │ │ +out to have sent corrupt data. │ │ │ │ +This function can either be passed in the add_torrent_params::extensions │ │ │ │ +field, or via torrent_handle::add_extension().

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    create_ut_metadata_plugin()

    │ │ │ │

    Declared in "libtorrent/extensions/ut_metadata.hpp"

    │ │ │ │
    │ │ │ │  std::shared_ptr<torrent_plugin> create_ut_metadata_plugin (torrent_handle const&, client_data_t);
    │ │ │ │  
    │ │ │ │ ├── html2text {} │ │ │ │ │ @@ -2,59 +2,59 @@ │ │ │ │ │ _[_l_i_b_t_o_r_r_e_n_t_ _l_o_g_o_] │ │ │ │ │ VVeerrssiioonn:: 2.0.11 │ │ │ │ │ _h_o_m_e │ │ │ │ │ Table of contents │ │ │ │ │ * _a_ _w_o_r_d_ _o_f_ _c_a_u_t_i_o_n │ │ │ │ │ * _p_l_u_g_i_n_-_i_n_t_e_r_f_a_c_e │ │ │ │ │ * _c_u_s_t_o_m_ _a_l_e_r_t_s │ │ │ │ │ - * _p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e │ │ │ │ │ - * _b_t___p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e │ │ │ │ │ * _p_l_u_g_i_n │ │ │ │ │ o _i_m_p_l_e_m_e_n_t_e_d___f_e_a_t_u_r_e_s_(_) │ │ │ │ │ o _n_e_w___t_o_r_r_e_n_t_(_) │ │ │ │ │ o _a_d_d_e_d_(_) │ │ │ │ │ o _a_b_o_r_t_(_) │ │ │ │ │ o _o_n___d_h_t___r_e_q_u_e_s_t_(_) │ │ │ │ │ o _o_n___a_l_e_r_t_(_) │ │ │ │ │ o _o_n___u_n_k_n_o_w_n___t_o_r_r_e_n_t_(_) │ │ │ │ │ o _o_n___t_i_c_k_(_) │ │ │ │ │ o _g_e_t___u_n_c_h_o_k_e___p_r_i_o_r_i_t_y_(_) │ │ │ │ │ o _l_o_a_d___s_t_a_t_e_(_) │ │ │ │ │ * _t_o_r_r_e_n_t___p_l_u_g_i_n │ │ │ │ │ o _n_e_w___c_o_n_n_e_c_t_i_o_n_(_) │ │ │ │ │ - o _o_n___p_i_e_c_e___p_a_s_s_(_)_ _o_n___p_i_e_c_e___f_a_i_l_e_d_(_) │ │ │ │ │ + o _o_n___p_i_e_c_e___f_a_i_l_e_d_(_)_ _o_n___p_i_e_c_e___p_a_s_s_(_) │ │ │ │ │ o _t_i_c_k_(_) │ │ │ │ │ o _o_n___p_a_u_s_e_(_)_ _o_n___r_e_s_u_m_e_(_) │ │ │ │ │ o _o_n___f_i_l_e_s___c_h_e_c_k_e_d_(_) │ │ │ │ │ o _o_n___s_t_a_t_e_(_) │ │ │ │ │ o _o_n___a_d_d___p_e_e_r_(_) │ │ │ │ │ * _p_e_e_r___p_l_u_g_i_n │ │ │ │ │ o _t_y_p_e_(_) │ │ │ │ │ o _a_d_d___h_a_n_d_s_h_a_k_e_(_) │ │ │ │ │ o _o_n___d_i_s_c_o_n_n_e_c_t_(_) │ │ │ │ │ o _o_n___c_o_n_n_e_c_t_e_d_(_) │ │ │ │ │ o _o_n___h_a_n_d_s_h_a_k_e_(_) │ │ │ │ │ o _o_n___e_x_t_e_n_s_i_o_n___h_a_n_d_s_h_a_k_e_(_) │ │ │ │ │ - o _o_n___c_h_o_k_e_(_)_ _o_n___h_a_v_e_(_)_ _o_n___h_a_v_e___a_l_l_(_)_ _o_n___h_a_v_e___n_o_n_e_(_)_ _o_n___u_n_c_h_o_k_e_(_) │ │ │ │ │ - _o_n___r_e_q_u_e_s_t_(_)_ _o_n___b_i_t_f_i_e_l_d_(_)_ _o_n___a_l_l_o_w_e_d___f_a_s_t_(_)_ _o_n___d_o_n_t___h_a_v_e_(_) │ │ │ │ │ - _o_n___n_o_t___i_n_t_e_r_e_s_t_e_d_(_)_ _o_n___i_n_t_e_r_e_s_t_e_d_(_) │ │ │ │ │ + o _o_n___b_i_t_f_i_e_l_d_(_)_ _o_n___r_e_q_u_e_s_t_(_)_ _o_n___h_a_v_e___a_l_l_(_)_ _o_n___h_a_v_e_(_)_ _o_n___a_l_l_o_w_e_d___f_a_s_t │ │ │ │ │ + _(_)_ _o_n___h_a_v_e___n_o_n_e_(_)_ _o_n___n_o_t___i_n_t_e_r_e_s_t_e_d_(_)_ _o_n___u_n_c_h_o_k_e_(_)_ _o_n___c_h_o_k_e_(_) │ │ │ │ │ + _o_n___i_n_t_e_r_e_s_t_e_d_(_)_ _o_n___d_o_n_t___h_a_v_e_(_) │ │ │ │ │ o _o_n___p_i_e_c_e_(_) │ │ │ │ │ - o _s_e_n_t___u_n_c_h_o_k_e_(_)_ _s_e_n_t___p_i_e_c_e_(_)_ _s_e_n_t___h_a_v_e_(_)_ _s_e_n_t___i_n_t_e_r_e_s_t_e_d_(_) │ │ │ │ │ - _s_e_n_t___n_o_t___i_n_t_e_r_e_s_t_e_d_(_) │ │ │ │ │ + o _s_e_n_t___n_o_t___i_n_t_e_r_e_s_t_e_d_(_)_ _s_e_n_t___h_a_v_e_(_)_ _s_e_n_t___u_n_c_h_o_k_e_(_)_ _s_e_n_t___i_n_t_e_r_e_s_t_e_d_(_) │ │ │ │ │ + _s_e_n_t___p_i_e_c_e_(_) │ │ │ │ │ o _s_e_n_t___p_a_y_l_o_a_d_(_) │ │ │ │ │ o _c_a_n___d_i_s_c_o_n_n_e_c_t_(_) │ │ │ │ │ o _o_n___e_x_t_e_n_d_e_d_(_) │ │ │ │ │ o _o_n___u_n_k_n_o_w_n___m_e_s_s_a_g_e_(_) │ │ │ │ │ - o _o_n___p_i_e_c_e___p_a_s_s_(_)_ _o_n___p_i_e_c_e___f_a_i_l_e_d_(_) │ │ │ │ │ + o _o_n___p_i_e_c_e___f_a_i_l_e_d_(_)_ _o_n___p_i_e_c_e___p_a_s_s_(_) │ │ │ │ │ o _t_i_c_k_(_) │ │ │ │ │ o _w_r_i_t_e___r_e_q_u_e_s_t_(_) │ │ │ │ │ * _c_r_y_p_t_o___p_l_u_g_i_n │ │ │ │ │ o _d_e_c_r_y_p_t_(_) │ │ │ │ │ - * _c_r_e_a_t_e___s_m_a_r_t___b_a_n___p_l_u_g_i_n_(_) │ │ │ │ │ + * _p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e │ │ │ │ │ + * _b_t___p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e │ │ │ │ │ * _c_r_e_a_t_e___u_t___p_e_x___p_l_u_g_i_n_(_) │ │ │ │ │ + * _c_r_e_a_t_e___s_m_a_r_t___b_a_n___p_l_u_g_i_n_(_) │ │ │ │ │ * _c_r_e_a_t_e___u_t___m_e_t_a_d_a_t_a___p_l_u_g_i_n_(_) │ │ │ │ │ libtorrent has a _p_l_u_g_i_n interface for implementing extensions to the protocol. │ │ │ │ │ These can be general extensions for transferring metadata or peer exchange │ │ │ │ │ extensions, or it could be used to provide a way to customize the protocol to │ │ │ │ │ fit a particular (closed) network. │ │ │ │ │ In short, the _p_l_u_g_i_n interface makes it possible to: │ │ │ │ │ * register extension messages (sent in the extension handshake), see │ │ │ │ │ @@ -131,79 +131,14 @@ │ │ │ │ │ The static category is required for checking whether or not the category for a │ │ │ │ │ specific _a_l_e_r_t is enabled or not, without instantiating the _a_l_e_r_t. The category │ │ │ │ │ virtual function is the run-time equivalence. │ │ │ │ │ The what() virtual function may simply be a string literal of the class name of │ │ │ │ │ your _a_l_e_r_t. │ │ │ │ │ For more information, see the _a_l_e_r_t_ _s_e_c_t_i_o_n. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ppeeeerr__ccoonnnneeccttiioonn__hhaannddllee ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ -the _p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e class provides a handle to the internal peer │ │ │ │ │ -connection object, to be used by plugins. This is a low level interface that │ │ │ │ │ -may not be stable across libtorrent versions │ │ │ │ │ -struct peer_connection_handle │ │ │ │ │ -{ │ │ │ │ │ - explicit ppeeeerr__ccoonnnneeccttiioonn__hhaannddllee (std::weak_ptr impl); │ │ │ │ │ - connection_type ttyyppee () const; │ │ │ │ │ - void aadddd__eexxtteennssiioonn (std::shared_ptr); │ │ │ │ │ - peer_plugin const* ffiinndd__pplluuggiinn (string_view type) const; │ │ │ │ │ - bool iiss__sseeeedd () const; │ │ │ │ │ - bool uuppllooaadd__oonnllyy () const; │ │ │ │ │ - peer_id const& ppiidd () const; │ │ │ │ │ - bool hhaass__ppiieeccee (piece_index_t i) const; │ │ │ │ │ - bool iiss__cchhookkeedd () const; │ │ │ │ │ - bool iiss__iinntteerreessttiinngg () const; │ │ │ │ │ - bool hhaass__ppeeeerr__cchhookkeedd () const; │ │ │ │ │ - bool iiss__ppeeeerr__iinntteerreesstteedd () const; │ │ │ │ │ - void mmaayybbee__uunncchhookkee__tthhiiss__ppeeeerr (); │ │ │ │ │ - void cchhookkee__tthhiiss__ppeeeerr (); │ │ │ │ │ - void ggeett__ppeeeerr__iinnffoo (peer_info& p) const; │ │ │ │ │ - torrent_handle aassssoocciiaatteedd__ttoorrrreenntt () const; │ │ │ │ │ - _t_c_p_:_:_e_n_d_p_o_i_n_t const& rreemmoottee () const; │ │ │ │ │ - _t_c_p_:_:_e_n_d_p_o_i_n_t llooccaall__eennddppooiinntt () const; │ │ │ │ │ - bool iiss__ccoonnnneeccttiinngg () const; │ │ │ │ │ - bool iiss__oouuttggooiinngg () const; │ │ │ │ │ - void ddiissccoonnnneecctt (error_code const& ec, operation_t op │ │ │ │ │ - , disconnect_severity_t = peer_connection_interface::normal); │ │ │ │ │ - bool iiss__ddiissccoonnnneeccttiinngg () const; │ │ │ │ │ - bool iiggnnoorree__uunncchhookkee__sslloottss () const; │ │ │ │ │ - bool oonn__llooccaall__nneettwwoorrkk () const; │ │ │ │ │ - bool ffaaiilleedd () const; │ │ │ │ │ - void ppeeeerr__lloogg (peer_log_alert::direction_t direction │ │ │ │ │ - , char const* event, char const* fmt = "", ...) const TORRENT_FORMAT │ │ │ │ │ -(4,5); │ │ │ │ │ - bool sshhoouulldd__lloogg (peer_log_alert::direction_t direction) const; │ │ │ │ │ - bool ccaann__ddiissccoonnnneecctt (error_code const& ec) const; │ │ │ │ │ - bool hhaass__mmeettaaddaattaa () const; │ │ │ │ │ - bool iinn__hhaannddsshhaakkee () const; │ │ │ │ │ - void sseenndd__bbuuffffeerr (char const* begin, int size); │ │ │ │ │ - std::time_t llaasstt__sseeeenn__ccoommpplleettee () const; │ │ │ │ │ - time_point ttiimmee__ooff__llaasstt__uunncchhookkee () const; │ │ │ │ │ - bool ooppeerraattoorr!!== (peer_connection_handle const& o) const; │ │ │ │ │ - bool ooppeerraattoorr<< (peer_connection_handle const& o) const; │ │ │ │ │ - bool ooppeerraattoorr==== (peer_connection_handle const& o) const; │ │ │ │ │ - std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ bbtt__ppeeeerr__ccoonnnneeccttiioonn__hhaannddllee ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ -The _b_t___p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e provides a handle to the internal bittorrent peer │ │ │ │ │ -connection object to plugins. It's low level and may not be a stable API across │ │ │ │ │ -libtorrent versions. │ │ │ │ │ -struct bt_peer_connection_handle : peer_connection_handle │ │ │ │ │ -{ │ │ │ │ │ - explicit bbtt__ppeeeerr__ccoonnnneeccttiioonn__hhaannddllee (peer_connection_handle pc); │ │ │ │ │ - bool ssuuppppoorrtt__eexxtteennssiioonnss () const; │ │ │ │ │ - bool ppaacckkeett__ffiinniisshheedd () const; │ │ │ │ │ - bool ssuuppppoorrttss__eennccrryyppttiioonn () const; │ │ │ │ │ - void sswwiittcchh__rreeccvv__ccrryyppttoo (std::shared_ptr crypto); │ │ │ │ │ - void sswwiittcchh__sseenndd__ccrryyppttoo (std::shared_ptr crypto); │ │ │ │ │ - std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ pplluuggiinn ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_x_t_e_n_s_i_o_n_s_._h_p_p" │ │ │ │ │ this is the base class for a _s_e_s_s_i_o_n _p_l_u_g_i_n. One primary feature is that it is │ │ │ │ │ notified of all torrents that are added to the _s_e_s_s_i_o_n, and can add its own │ │ │ │ │ torrent_plugins. │ │ │ │ │ struct plugin │ │ │ │ │ { │ │ │ │ │ @@ -324,16 +259,16 @@ │ │ │ │ │ struct torrent_plugin │ │ │ │ │ { │ │ │ │ │ virtual std::shared_ptr nneeww__ccoonnnneeccttiioonn (peer_connection_handle │ │ │ │ │ const&); │ │ │ │ │ virtual void oonn__ppiieeccee__ppaassss (piece_index_t); │ │ │ │ │ virtual void oonn__ppiieeccee__ffaaiilleedd (piece_index_t); │ │ │ │ │ virtual void ttiicckk (); │ │ │ │ │ - virtual bool oonn__ppaauussee (); │ │ │ │ │ virtual bool oonn__rreessuummee (); │ │ │ │ │ + virtual bool oonn__ppaauussee (); │ │ │ │ │ virtual void oonn__ffiilleess__cchheecckkeedd (); │ │ │ │ │ virtual void oonn__ssttaattee (torrent_status::state_t); │ │ │ │ │ virtual void oonn__aadddd__ppeeeerr (tcp::endpoint const&, │ │ │ │ │ peer_source_flags_t, add_peer_flags_t); │ │ │ │ │ │ │ │ │ │ static constexpr add_peer_flags_t ffiirrsstt__ttiimmee = 1_bit; │ │ │ │ │ static constexpr add_peer_flags_t ffiilltteerreedd = 2_bit; │ │ │ │ │ @@ -350,30 +285,30 @@ │ │ │ │ │ have its hook functions called on event specific to that peer. │ │ │ │ │ The peer_connection_handle will be valid as long as the shared_ptr is being │ │ │ │ │ held by the torrent object. So, it is generally a good idea to not keep a │ │ │ │ │ shared_ptr to your own _p_e_e_r___p_l_u_g_i_n. If you want to keep references to it, use │ │ │ │ │ weak_ptr. │ │ │ │ │ If this function throws an exception, the connection will be closed. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** oonn__ppiieeccee__ppaassss(()) oonn__ppiieeccee__ffaaiilleedd(()) ********** │ │ │ │ │ +********** oonn__ppiieeccee__ffaaiilleedd(()) oonn__ppiieeccee__ppaassss(()) ********** │ │ │ │ │ virtual void oonn__ppiieeccee__ppaassss (piece_index_t); │ │ │ │ │ virtual void oonn__ppiieeccee__ffaaiilleedd (piece_index_t); │ │ │ │ │ These hooks are called when a piece passes the hash check or fails the hash │ │ │ │ │ check, respectively. The index is the piece index that was downloaded. It is │ │ │ │ │ possible to access the list of peers that participated in sending the piece │ │ │ │ │ through the torrent and the piece_picker. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ttiicckk(()) ********** │ │ │ │ │ virtual void ttiicckk (); │ │ │ │ │ This hook is called approximately once per second. It is a way of making it │ │ │ │ │ easy for plugins to do timed events, for sending messages or whatever. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** oonn__ppaauussee(()) oonn__rreessuummee(()) ********** │ │ │ │ │ -virtual bool oonn__ppaauussee (); │ │ │ │ │ virtual bool oonn__rreessuummee (); │ │ │ │ │ +virtual bool oonn__ppaauussee (); │ │ │ │ │ These hooks are called when the torrent is paused and resumed respectively. The │ │ │ │ │ return value indicates if the event was handled. A return value of true │ │ │ │ │ indicates that it was handled, and no other _p_l_u_g_i_n after this one will have │ │ │ │ │ this hook function called, and the standard handler will also not be invoked. │ │ │ │ │ So, returning true effectively overrides the standard behavior of pause or │ │ │ │ │ resume. │ │ │ │ │ Note that if you call pause() or resume() on the torrent from your handler it │ │ │ │ │ @@ -419,43 +354,43 @@ │ │ │ │ │ { │ │ │ │ │ virtual string_view ttyyppee () const; │ │ │ │ │ virtual void aadddd__hhaannddsshhaakkee (entry&); │ │ │ │ │ virtual void oonn__ddiissccoonnnneecctt (error_code const&); │ │ │ │ │ virtual void oonn__ccoonnnneecctteedd (); │ │ │ │ │ virtual bool oonn__hhaannddsshhaakkee (span); │ │ │ │ │ virtual bool oonn__eexxtteennssiioonn__hhaannddsshhaakkee (bdecode_node const&); │ │ │ │ │ - virtual bool oonn__rreeqquueesstt (peer_request const&); │ │ │ │ │ - virtual bool oonn__ddoonntt__hhaavvee (piece_index_t); │ │ │ │ │ - virtual bool oonn__bbiittffiieelldd (bitfield const& //**bbiittffiieelldd**//); │ │ │ │ │ - virtual bool oonn__hhaavvee__nnoonnee (); │ │ │ │ │ virtual bool oonn__hhaavvee__aallll (); │ │ │ │ │ - virtual bool oonn__nnoott__iinntteerreesstteedd (); │ │ │ │ │ + virtual bool oonn__uunncchhookkee (); │ │ │ │ │ + virtual bool oonn__ddoonntt__hhaavvee (piece_index_t); │ │ │ │ │ virtual bool oonn__aalllloowweedd__ffaasstt (piece_index_t); │ │ │ │ │ + virtual bool oonn__hhaavvee (piece_index_t); │ │ │ │ │ + virtual bool oonn__bbiittffiieelldd (bitfield const& //**bbiittffiieelldd**//); │ │ │ │ │ virtual bool oonn__iinntteerreesstteedd (); │ │ │ │ │ - virtual bool oonn__uunncchhookkee (); │ │ │ │ │ + virtual bool oonn__hhaavvee__nnoonnee (); │ │ │ │ │ virtual bool oonn__cchhookkee (); │ │ │ │ │ - virtual bool oonn__hhaavvee (piece_index_t); │ │ │ │ │ + virtual bool oonn__nnoott__iinntteerreesstteedd (); │ │ │ │ │ + virtual bool oonn__rreeqquueesstt (peer_request const&); │ │ │ │ │ virtual bool oonn__ppiieeccee (peer_request const& //**ppiieeccee**// │ │ │ │ │ , span //**bbuuff**//); │ │ │ │ │ - virtual bool oonn__ssuuggggeesstt (piece_index_t); │ │ │ │ │ - virtual bool oonn__rreejjeecctt (peer_request const&); │ │ │ │ │ virtual bool oonn__ccaanncceell (peer_request const&); │ │ │ │ │ - virtual void sseenntt__hhaavvee__nnoonnee (); │ │ │ │ │ + virtual bool oonn__rreejjeecctt (peer_request const&); │ │ │ │ │ + virtual bool oonn__ssuuggggeesstt (piece_index_t); │ │ │ │ │ virtual void sseenntt__ssuuggggeesstt (piece_index_t); │ │ │ │ │ - virtual void sseenntt__hhaavvee__aallll (); │ │ │ │ │ - virtual void sseenntt__ccaanncceell (peer_request const&); │ │ │ │ │ virtual void sseenntt__rreeqquueesstt (peer_request const&); │ │ │ │ │ + virtual void sseenntt__ccaanncceell (peer_request const&); │ │ │ │ │ + virtual void sseenntt__hhaavvee__aallll (); │ │ │ │ │ + virtual void sseenntt__hhaavvee__nnoonnee (); │ │ │ │ │ virtual void sseenntt__aallllooww__ffaasstt (piece_index_t); │ │ │ │ │ - virtual void sseenntt__rreejjeecctt__rreeqquueesstt (peer_request const&); │ │ │ │ │ virtual void sseenntt__cchhookkee (); │ │ │ │ │ + virtual void sseenntt__rreejjeecctt__rreeqquueesstt (peer_request const&); │ │ │ │ │ virtual void sseenntt__nnoott__iinntteerreesstteedd (); │ │ │ │ │ - virtual void sseenntt__iinntteerreesstteedd (); │ │ │ │ │ - virtual void sseenntt__hhaavvee (piece_index_t); │ │ │ │ │ virtual void sseenntt__ppiieeccee (peer_request const&); │ │ │ │ │ virtual void sseenntt__uunncchhookkee (); │ │ │ │ │ + virtual void sseenntt__iinntteerreesstteedd (); │ │ │ │ │ + virtual void sseenntt__hhaavvee (piece_index_t); │ │ │ │ │ virtual void sseenntt__ppaayyllooaadd (int //** bbyytteess **//); │ │ │ │ │ virtual bool ccaann__ddiissccoonnnneecctt (error_code const& //**eecc**//); │ │ │ │ │ virtual bool oonn__eexxtteennddeedd (int //**lleennggtthh**//, int //**mmssgg**//, │ │ │ │ │ span //**bbooddyy**//); │ │ │ │ │ virtual bool oonn__uunnkknnoowwnn__mmeessssaaggee (int //**lleennggtthh**//, int //**mmssgg**//, │ │ │ │ │ span //**bbooddyy**//); │ │ │ │ │ virtual void oonn__ppiieeccee__ppaassss (piece_index_t); │ │ │ │ │ @@ -491,48 +426,48 @@ │ │ │ │ │ ********** oonn__eexxtteennssiioonn__hhaannddsshhaakkee(()) ********** │ │ │ │ │ virtual bool oonn__eexxtteennssiioonn__hhaannddsshhaakkee (bdecode_node const&); │ │ │ │ │ called when the extension handshake from the other end is received if this │ │ │ │ │ returns false, it means that this extension isn't supported by this peer. It │ │ │ │ │ will result in this _p_e_e_r___p_l_u_g_i_n being removed from the peer_connection and │ │ │ │ │ destructed. this is not called for web seeds │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** oonn__cchhookkee(()) oonn__hhaavvee(()) oonn__hhaavvee__aallll(()) oonn__hhaavvee__nnoonnee(()) oonn__uunncchhookkee(()) oonn__rreeqquueesstt │ │ │ │ │ -(()) oonn__bbiittffiieelldd(()) oonn__aalllloowweedd__ffaasstt(()) oonn__ddoonntt__hhaavvee(()) oonn__nnoott__iinntteerreesstteedd(()) │ │ │ │ │ -oonn__iinntteerreesstteedd(()) ********** │ │ │ │ │ -virtual bool oonn__rreeqquueesstt (peer_request const&); │ │ │ │ │ -virtual bool oonn__ddoonntt__hhaavvee (piece_index_t); │ │ │ │ │ -virtual bool oonn__bbiittffiieelldd (bitfield const& //**bbiittffiieelldd**//); │ │ │ │ │ -virtual bool oonn__hhaavvee__nnoonnee (); │ │ │ │ │ +********** oonn__bbiittffiieelldd(()) oonn__rreeqquueesstt(()) oonn__hhaavvee__aallll(()) oonn__hhaavvee(()) oonn__aalllloowweedd__ffaasstt(()) │ │ │ │ │ +oonn__hhaavvee__nnoonnee(()) oonn__nnoott__iinntteerreesstteedd(()) oonn__uunncchhookkee(()) oonn__cchhookkee(()) oonn__iinntteerreesstteedd(()) │ │ │ │ │ +oonn__ddoonntt__hhaavvee(()) ********** │ │ │ │ │ virtual bool oonn__hhaavvee__aallll (); │ │ │ │ │ -virtual bool oonn__nnoott__iinntteerreesstteedd (); │ │ │ │ │ +virtual bool oonn__uunncchhookkee (); │ │ │ │ │ +virtual bool oonn__ddoonntt__hhaavvee (piece_index_t); │ │ │ │ │ virtual bool oonn__aalllloowweedd__ffaasstt (piece_index_t); │ │ │ │ │ +virtual bool oonn__hhaavvee (piece_index_t); │ │ │ │ │ +virtual bool oonn__bbiittffiieelldd (bitfield const& //**bbiittffiieelldd**//); │ │ │ │ │ virtual bool oonn__iinntteerreesstteedd (); │ │ │ │ │ -virtual bool oonn__uunncchhookkee (); │ │ │ │ │ +virtual bool oonn__hhaavvee__nnoonnee (); │ │ │ │ │ virtual bool oonn__cchhookkee (); │ │ │ │ │ -virtual bool oonn__hhaavvee (piece_index_t); │ │ │ │ │ +virtual bool oonn__nnoott__iinntteerreesstteedd (); │ │ │ │ │ +virtual bool oonn__rreeqquueesstt (peer_request const&); │ │ │ │ │ returning true from any of the message handlers indicates that the _p_l_u_g_i_n has │ │ │ │ │ handled the message. it will break the _p_l_u_g_i_n chain traversing and not let │ │ │ │ │ anyone else handle the message, including the default handler. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** oonn__ppiieeccee(()) ********** │ │ │ │ │ virtual bool oonn__ppiieeccee (peer_request const& //**ppiieeccee**// │ │ │ │ │ , span //**bbuuff**//); │ │ │ │ │ This function is called when the peer connection is receiving a piece. buf │ │ │ │ │ points (non-owning pointer) to the data in an internal immutable disk buffer. │ │ │ │ │ The length of the data is specified in the length member of the piece │ │ │ │ │ parameter. returns true to indicate that the piece is handled and the rest of │ │ │ │ │ the logic should be ignored. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseenntt__uunncchhookkee(()) sseenntt__ppiieeccee(()) sseenntt__hhaavvee(()) sseenntt__iinntteerreesstteedd(()) │ │ │ │ │ -sseenntt__nnoott__iinntteerreesstteedd(()) ********** │ │ │ │ │ +********** sseenntt__nnoott__iinntteerreesstteedd(()) sseenntt__hhaavvee(()) sseenntt__uunncchhookkee(()) sseenntt__iinntteerreesstteedd(()) │ │ │ │ │ +sseenntt__ppiieeccee(()) ********** │ │ │ │ │ virtual void sseenntt__nnoott__iinntteerreesstteedd (); │ │ │ │ │ -virtual void sseenntt__iinntteerreesstteedd (); │ │ │ │ │ -virtual void sseenntt__hhaavvee (piece_index_t); │ │ │ │ │ virtual void sseenntt__ppiieeccee (peer_request const&); │ │ │ │ │ virtual void sseenntt__uunncchhookkee (); │ │ │ │ │ +virtual void sseenntt__iinntteerreesstteedd (); │ │ │ │ │ +virtual void sseenntt__hhaavvee (piece_index_t); │ │ │ │ │ called after a choke message has been sent to the peer │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** sseenntt__ppaayyllooaadd(()) ********** │ │ │ │ │ virtual void sseenntt__ppaayyllooaadd (int //** bbyytteess **//); │ │ │ │ │ called after piece data has been sent to the peer this can be used for stats │ │ │ │ │ book keeping │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ @@ -555,15 +490,15 @@ │ │ │ │ │ receiving large messages. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** oonn__uunnkknnoowwnn__mmeessssaaggee(()) ********** │ │ │ │ │ virtual bool oonn__uunnkknnoowwnn__mmeessssaaggee (int //**lleennggtthh**//, int //**mmssgg**//, │ │ │ │ │ span //**bbooddyy**//); │ │ │ │ │ this is not called for web seeds │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** oonn__ppiieeccee__ppaassss(()) oonn__ppiieeccee__ffaaiilleedd(()) ********** │ │ │ │ │ +********** oonn__ppiieeccee__ffaaiilleedd(()) oonn__ppiieeccee__ppaassss(()) ********** │ │ │ │ │ virtual void oonn__ppiieeccee__ppaassss (piece_index_t); │ │ │ │ │ virtual void oonn__ppiieeccee__ffaaiilleedd (piece_index_t); │ │ │ │ │ called when a piece that this peer participated in either fails or passes the │ │ │ │ │ hash_check │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ttiicckk(()) ********** │ │ │ │ │ virtual void ttiicckk (); │ │ │ │ │ @@ -575,16 +510,16 @@ │ │ │ │ │ original request message won't be sent and no other _p_l_u_g_i_n will have this │ │ │ │ │ function called. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ccrryyppttoo__pplluuggiinn ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_x_t_e_n_s_i_o_n_s_._h_p_p" │ │ │ │ │ struct crypto_plugin │ │ │ │ │ { │ │ │ │ │ - virtual void sseett__oouuttggooiinngg__kkeeyy (span key) = 0; │ │ │ │ │ virtual void sseett__iinnccoommiinngg__kkeeyy (span key) = 0; │ │ │ │ │ + virtual void sseett__oouuttggooiinngg__kkeeyy (span key) = 0; │ │ │ │ │ eennccrryypptt (span> //**sseenndd__vveecc**//) = 0; │ │ │ │ │ virtual std::tuple ddeeccrryypptt (span> //**rreecceeiivvee__vveecc**// │ │ │ │ │ ) = 0; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ddeeccrryypptt(()) ********** │ │ │ │ │ virtual std::tuple ddeeccrryypptt (span> //**rreecceeiivvee__vveecc**//) = │ │ │ │ │ @@ -594,35 +529,100 @@ │ │ │ │ │ consume is set to the number of bytes which should be trimmed from the head of │ │ │ │ │ the buffers, default is 0 │ │ │ │ │ produce is set to the number of bytes of payload which are now ready to be sent │ │ │ │ │ to the upper layer. default is the number of bytes passed in receive_vec │ │ │ │ │ packet_size is set to the minimum number of bytes which must be read to advance │ │ │ │ │ the next step of decryption. default is 0 │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ccrreeaattee__ssmmaarrtt__bbaann__pplluuggiinn(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_x_t_e_n_s_i_o_n_s_/_s_m_a_r_t___b_a_n_._h_p_p" │ │ │ │ │ -std::shared_ptr ccrreeaattee__ssmmaarrtt__bbaann__pplluuggiinn (torrent_handle const&, │ │ │ │ │ -client_data_t); │ │ │ │ │ -constructor function for the smart ban extension. The extension keeps track of │ │ │ │ │ -the data peers have sent us for failing pieces and once the piece completes and │ │ │ │ │ -passes the hash check bans the peers that turned out to have sent corrupt data. │ │ │ │ │ -This function can either be passed in the add_torrent_params::extensions field, │ │ │ │ │ -or via _t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_a_d_d___e_x_t_e_n_s_i_o_n_(_). │ │ │ │ │ +************ ppeeeerr__ccoonnnneeccttiioonn__hhaannddllee ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ +the _p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e class provides a handle to the internal peer │ │ │ │ │ +connection object, to be used by plugins. This is a low level interface that │ │ │ │ │ +may not be stable across libtorrent versions │ │ │ │ │ +struct peer_connection_handle │ │ │ │ │ +{ │ │ │ │ │ + explicit ppeeeerr__ccoonnnneeccttiioonn__hhaannddllee (std::weak_ptr impl); │ │ │ │ │ + connection_type ttyyppee () const; │ │ │ │ │ + void aadddd__eexxtteennssiioonn (std::shared_ptr); │ │ │ │ │ + peer_plugin const* ffiinndd__pplluuggiinn (string_view type) const; │ │ │ │ │ + bool iiss__sseeeedd () const; │ │ │ │ │ + bool uuppllooaadd__oonnllyy () const; │ │ │ │ │ + bool hhaass__ppiieeccee (piece_index_t i) const; │ │ │ │ │ + peer_id const& ppiidd () const; │ │ │ │ │ + bool iiss__cchhookkeedd () const; │ │ │ │ │ + bool iiss__iinntteerreessttiinngg () const; │ │ │ │ │ + bool hhaass__ppeeeerr__cchhookkeedd () const; │ │ │ │ │ + bool iiss__ppeeeerr__iinntteerreesstteedd () const; │ │ │ │ │ + void cchhookkee__tthhiiss__ppeeeerr (); │ │ │ │ │ + void mmaayybbee__uunncchhookkee__tthhiiss__ppeeeerr (); │ │ │ │ │ + void ggeett__ppeeeerr__iinnffoo (peer_info& p) const; │ │ │ │ │ + torrent_handle aassssoocciiaatteedd__ttoorrrreenntt () const; │ │ │ │ │ + _t_c_p_:_:_e_n_d_p_o_i_n_t const& rreemmoottee () const; │ │ │ │ │ + _t_c_p_:_:_e_n_d_p_o_i_n_t llooccaall__eennddppooiinntt () const; │ │ │ │ │ + void ddiissccoonnnneecctt (error_code const& ec, operation_t op │ │ │ │ │ + , disconnect_severity_t = peer_connection_interface::normal); │ │ │ │ │ + bool iiss__ddiissccoonnnneeccttiinngg () const; │ │ │ │ │ + bool iiss__ccoonnnneeccttiinngg () const; │ │ │ │ │ + bool iiss__oouuttggooiinngg () const; │ │ │ │ │ + bool oonn__llooccaall__nneettwwoorrkk () const; │ │ │ │ │ + bool iiggnnoorree__uunncchhookkee__sslloottss () const; │ │ │ │ │ + bool ffaaiilleedd () const; │ │ │ │ │ + bool sshhoouulldd__lloogg (peer_log_alert::direction_t direction) const; │ │ │ │ │ + void ppeeeerr__lloogg (peer_log_alert::direction_t direction │ │ │ │ │ + , char const* event, char const* fmt = "", ...) const TORRENT_FORMAT │ │ │ │ │ +(4,5); │ │ │ │ │ + bool ccaann__ddiissccoonnnneecctt (error_code const& ec) const; │ │ │ │ │ + bool hhaass__mmeettaaddaattaa () const; │ │ │ │ │ + bool iinn__hhaannddsshhaakkee () const; │ │ │ │ │ + void sseenndd__bbuuffffeerr (char const* begin, int size); │ │ │ │ │ + std::time_t llaasstt__sseeeenn__ccoommpplleettee () const; │ │ │ │ │ + time_point ttiimmee__ooff__llaasstt__uunncchhookkee () const; │ │ │ │ │ + bool ooppeerraattoorr==== (peer_connection_handle const& o) const; │ │ │ │ │ + bool ooppeerraattoorr<< (peer_connection_handle const& o) const; │ │ │ │ │ + bool ooppeerraattoorr!!== (peer_connection_handle const& o) const; │ │ │ │ │ + std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ bbtt__ppeeeerr__ccoonnnneeccttiioonn__hhaannddllee ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ +The _b_t___p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e provides a handle to the internal bittorrent peer │ │ │ │ │ +connection object to plugins. It's low level and may not be a stable API across │ │ │ │ │ +libtorrent versions. │ │ │ │ │ +struct bt_peer_connection_handle : peer_connection_handle │ │ │ │ │ +{ │ │ │ │ │ + explicit bbtt__ppeeeerr__ccoonnnneeccttiioonn__hhaannddllee (peer_connection_handle pc); │ │ │ │ │ + bool ssuuppppoorrtt__eexxtteennssiioonnss () const; │ │ │ │ │ + bool ppaacckkeett__ffiinniisshheedd () const; │ │ │ │ │ + bool ssuuppppoorrttss__eennccrryyppttiioonn () const; │ │ │ │ │ + void sswwiittcchh__sseenndd__ccrryyppttoo (std::shared_ptr crypto); │ │ │ │ │ + void sswwiittcchh__rreeccvv__ccrryyppttoo (std::shared_ptr crypto); │ │ │ │ │ + std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ +}; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ccrreeaattee__uutt__ppeexx__pplluuggiinn(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_x_t_e_n_s_i_o_n_s_/_u_t___p_e_x_._h_p_p" │ │ │ │ │ std::shared_ptr ccrreeaattee__uutt__ppeexx__pplluuggiinn (torrent_handle const&, │ │ │ │ │ client_data_t); │ │ │ │ │ constructor function for the ut_pex extension. The ut_pex extension allows │ │ │ │ │ peers to gossip about their connections, allowing the swarm stay well connected │ │ │ │ │ and peers aware of more peers in the swarm. This extension is enabled by │ │ │ │ │ default unless explicitly disabled in the _s_e_s_s_i_o_n constructor. │ │ │ │ │ This can either be passed in the add_torrent_params::extensions field, or via │ │ │ │ │ _t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_a_d_d___e_x_t_e_n_s_i_o_n_(_). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ccrreeaattee__ssmmaarrtt__bbaann__pplluuggiinn(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_x_t_e_n_s_i_o_n_s_/_s_m_a_r_t___b_a_n_._h_p_p" │ │ │ │ │ +std::shared_ptr ccrreeaattee__ssmmaarrtt__bbaann__pplluuggiinn (torrent_handle const&, │ │ │ │ │ +client_data_t); │ │ │ │ │ +constructor function for the smart ban extension. The extension keeps track of │ │ │ │ │ +the data peers have sent us for failing pieces and once the piece completes and │ │ │ │ │ +passes the hash check bans the peers that turned out to have sent corrupt data. │ │ │ │ │ +This function can either be passed in the add_torrent_params::extensions field, │ │ │ │ │ +or via _t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_a_d_d___e_x_t_e_n_s_i_o_n_(_). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ccrreeaattee__uutt__mmeettaaddaattaa__pplluuggiinn(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_x_t_e_n_s_i_o_n_s_/_u_t___m_e_t_a_d_a_t_a_._h_p_p" │ │ │ │ │ std::shared_ptr ccrreeaattee__uutt__mmeettaaddaattaa__pplluuggiinn (torrent_handle │ │ │ │ │ const&, client_data_t); │ │ │ │ │ constructor function for the ut_metadata extension. The ut_metadata extension │ │ │ │ │ allows peers to request the .torrent file (or more specifically the info- │ │ │ │ │ dictionary of the .torrent file) from each other. This is the main building │ │ │ ├── ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Resume_Data.html │ │ │ │ @@ -28,79 +28,79 @@ │ │ │ │ 2.0.11 │ │ │ │ │ │ │ │ │ │ │ │

    home

    │ │ │ │
    │ │ │ │

    Table of contents

    │ │ │ │ │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -

    read_resume_data()

    │ │ │ │ -

    Declared in "libtorrent/read_resume_data.hpp"

    │ │ │ │ -
    │ │ │ │ -add_torrent_params read_resume_data (span<char const> buffer
    │ │ │ │ -   , error_code& ec, load_torrent_limits const& cfg = {});
    │ │ │ │ -add_torrent_params read_resume_data (bdecode_node const& rd
    │ │ │ │ -   , int piece_limit = 0x200000);
    │ │ │ │ -add_torrent_params read_resume_data (span<char const> buffer
    │ │ │ │ -   , load_torrent_limits const& cfg = {});
    │ │ │ │ -add_torrent_params read_resume_data (bdecode_node const& rd
    │ │ │ │ -   , error_code& ec, int piece_limit = 0x200000);
    │ │ │ │ -
    │ │ │ │ -

    these functions are used to parse resume data and populate the appropriate │ │ │ │ -fields in an add_torrent_params object. This object can then be used to add │ │ │ │ -the actual torrent_info object to and pass to session::add_torrent() or │ │ │ │ -session::async_add_torrent().

    │ │ │ │ -

    If the client wants to override any field that was loaded from the resume │ │ │ │ -data, e.g. save_path, those fields must be changed after loading resume │ │ │ │ -data but before adding the torrent.

    │ │ │ │ -

    The piece_limit parameter determines the largest number of pieces │ │ │ │ -allowed in the torrent that may be loaded as part of the resume data, if │ │ │ │ -it contains an info field. The overloads that take a flat buffer are │ │ │ │ -instead configured with limits on torrent sizes via load_torrent limits.

    │ │ │ │ -

    In order to support large torrents, it may also be necessary to raise the │ │ │ │ -settings_pack::max_piece_count setting and pass a higher limit to calls │ │ │ │ -to torrent_info::parse_info_section().

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    write_resume_data_buf() write_resume_data()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    write_resume_data() write_resume_data_buf()

    │ │ │ │

    Declared in "libtorrent/write_resume_data.hpp"

    │ │ │ │
    │ │ │ │  std::vector<char> write_resume_data_buf (add_torrent_params const& atp);
    │ │ │ │  entry write_resume_data (add_torrent_params const& atp);
    │ │ │ │  
    │ │ │ │

    this function turns the resume data in an add_torrent_params object │ │ │ │ into a bencoded structure

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    write_torrent_file_buf() write_torrent_file()

    │ │ │ │

    Declared in "libtorrent/write_resume_data.hpp"

    │ │ │ │
    │ │ │ │ -entry write_torrent_file (add_torrent_params const& atp);
    │ │ │ │ -entry write_torrent_file (add_torrent_params const& atp, write_torrent_flags_t flags);
    │ │ │ │  std::vector<char> write_torrent_file_buf (add_torrent_params const& atp
    │ │ │ │     , write_torrent_flags_t flags);
    │ │ │ │ +entry write_torrent_file (add_torrent_params const& atp, write_torrent_flags_t flags);
    │ │ │ │ +entry write_torrent_file (add_torrent_params const& atp);
    │ │ │ │  
    │ │ │ │

    writes only the fields to create a .torrent file. This function may fail │ │ │ │ with a std::system_error exception if:

    │ │ │ │
      │ │ │ │
    • The add_torrent_params object passed to this function does not contain the │ │ │ │ info dictionary (the ti field)
    • │ │ │ │
    • The piece layers are not complete for all files that need them
    • │ │ │ │
    │ │ │ │

    The write_torrent_file_buf() overload returns the torrent file in │ │ │ │ bencoded buffer form. This overload may be faster at the expense of lost │ │ │ │ flexibility to add custom fields.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    read_resume_data()

    │ │ │ │ +

    Declared in "libtorrent/read_resume_data.hpp"

    │ │ │ │ +
    │ │ │ │ +add_torrent_params read_resume_data (bdecode_node const& rd
    │ │ │ │ +   , error_code& ec, int piece_limit = 0x200000);
    │ │ │ │ +add_torrent_params read_resume_data (span<char const> buffer
    │ │ │ │ +   , error_code& ec, load_torrent_limits const& cfg = {});
    │ │ │ │ +add_torrent_params read_resume_data (bdecode_node const& rd
    │ │ │ │ +   , int piece_limit = 0x200000);
    │ │ │ │ +add_torrent_params read_resume_data (span<char const> buffer
    │ │ │ │ +   , load_torrent_limits const& cfg = {});
    │ │ │ │ +
    │ │ │ │ +

    these functions are used to parse resume data and populate the appropriate │ │ │ │ +fields in an add_torrent_params object. This object can then be used to add │ │ │ │ +the actual torrent_info object to and pass to session::add_torrent() or │ │ │ │ +session::async_add_torrent().

    │ │ │ │ +

    If the client wants to override any field that was loaded from the resume │ │ │ │ +data, e.g. save_path, those fields must be changed after loading resume │ │ │ │ +data but before adding the torrent.

    │ │ │ │ +

    The piece_limit parameter determines the largest number of pieces │ │ │ │ +allowed in the torrent that may be loaded as part of the resume data, if │ │ │ │ +it contains an info field. The overloads that take a flat buffer are │ │ │ │ +instead configured with limits on torrent sizes via load_torrent limits.

    │ │ │ │ +

    In order to support large torrents, it may also be necessary to raise the │ │ │ │ +settings_pack::max_piece_count setting and pass a higher limit to calls │ │ │ │ +to torrent_info::parse_info_section().

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    write_torrent_flags_t

    │ │ │ │

    Declared in "libtorrent/write_resume_data.hpp"

    │ │ │ │
    │ │ │ │
    allow_missing_piece_layer
    │ │ │ │
    this makes write_torrent_file() not fail when attempting to write a │ │ │ │ ├── html2text {} │ │ │ │ │ @@ -1,27 +1,50 @@ │ │ │ │ │ > │ │ │ │ │ _[_l_i_b_t_o_r_r_e_n_t_ _l_o_g_o_] │ │ │ │ │ VVeerrssiioonn:: 2.0.11 │ │ │ │ │ _h_o_m_e │ │ │ │ │ Table of contents │ │ │ │ │ - * _r_e_a_d___r_e_s_u_m_e___d_a_t_a_(_) │ │ │ │ │ - * _w_r_i_t_e___r_e_s_u_m_e___d_a_t_a___b_u_f_(_)_ _w_r_i_t_e___r_e_s_u_m_e___d_a_t_a_(_) │ │ │ │ │ + * _w_r_i_t_e___r_e_s_u_m_e___d_a_t_a_(_)_ _w_r_i_t_e___r_e_s_u_m_e___d_a_t_a___b_u_f_(_) │ │ │ │ │ * _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e___b_u_f_(_)_ _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e_(_) │ │ │ │ │ + * _r_e_a_d___r_e_s_u_m_e___d_a_t_a_(_) │ │ │ │ │ * _w_r_i_t_e___t_o_r_r_e_n_t___f_l_a_g_s___t │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ wwrriittee__rreessuummee__ddaattaa(()) wwrriittee__rreessuummee__ddaattaa__bbuuff(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_w_r_i_t_e___r_e_s_u_m_e___d_a_t_a_._h_p_p" │ │ │ │ │ +std::vector wwrriittee__rreessuummee__ddaattaa__bbuuff (add_torrent_params const& atp); │ │ │ │ │ +entry wwrriittee__rreessuummee__ddaattaa (add_torrent_params const& atp); │ │ │ │ │ +this function turns the resume data in an add_torrent_params object into a │ │ │ │ │ +bencoded structure │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ wwrriittee__ttoorrrreenntt__ffiillee__bbuuff(()) wwrriittee__ttoorrrreenntt__ffiillee(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_w_r_i_t_e___r_e_s_u_m_e___d_a_t_a_._h_p_p" │ │ │ │ │ +std::vector wwrriittee__ttoorrrreenntt__ffiillee__bbuuff (add_torrent_params const& atp │ │ │ │ │ + , write_torrent_flags_t flags); │ │ │ │ │ +entry wwrriittee__ttoorrrreenntt__ffiillee (add_torrent_params const& atp, write_torrent_flags_t │ │ │ │ │ +flags); │ │ │ │ │ +entry wwrriittee__ttoorrrreenntt__ffiillee (add_torrent_params const& atp); │ │ │ │ │ +writes only the fields to create a .torrent file. This function may fail with a │ │ │ │ │ +std::system_error exception if: │ │ │ │ │ + * The _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s object passed to this function does not contain │ │ │ │ │ + the info dictionary (the ti field) │ │ │ │ │ + * The piece layers are not complete for all files that need them │ │ │ │ │ +The write_torrent_file_buf() overload returns the torrent file in bencoded │ │ │ │ │ +buffer form. This overload may be faster at the expense of lost flexibility to │ │ │ │ │ +add custom fields. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ rreeaadd__rreessuummee__ddaattaa(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_r_e_a_d___r_e_s_u_m_e___d_a_t_a_._h_p_p" │ │ │ │ │ +add_torrent_params rreeaadd__rreessuummee__ddaattaa (bdecode_node const& rd │ │ │ │ │ + , error_code& ec, int piece_limit = 0x200000); │ │ │ │ │ add_torrent_params rreeaadd__rreessuummee__ddaattaa (span buffer │ │ │ │ │ , error_code& ec, load_torrent_limits const& cfg = {}); │ │ │ │ │ add_torrent_params rreeaadd__rreessuummee__ddaattaa (bdecode_node const& rd │ │ │ │ │ , int piece_limit = 0x200000); │ │ │ │ │ add_torrent_params rreeaadd__rreessuummee__ddaattaa (span buffer │ │ │ │ │ , load_torrent_limits const& cfg = {}); │ │ │ │ │ -add_torrent_params rreeaadd__rreessuummee__ddaattaa (bdecode_node const& rd │ │ │ │ │ - , error_code& ec, int piece_limit = 0x200000); │ │ │ │ │ these functions are used to parse resume data and populate the appropriate │ │ │ │ │ fields in an _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s object. This object can then be used to add the │ │ │ │ │ actual _t_o_r_r_e_n_t___i_n_f_o object to and pass to session::add_torrent() or session:: │ │ │ │ │ async_add_torrent(). │ │ │ │ │ If the client wants to override any field that was loaded from the resume data, │ │ │ │ │ e.g. save_path, those fields must be changed after loading resume data but │ │ │ │ │ before adding the torrent. │ │ │ │ │ @@ -29,37 +52,14 @@ │ │ │ │ │ the torrent that may be loaded as part of the resume data, if it contains an │ │ │ │ │ info field. The overloads that take a flat buffer are instead configured with │ │ │ │ │ limits on torrent sizes via load_torrent limits. │ │ │ │ │ In order to support large torrents, it may also be necessary to raise the │ │ │ │ │ _s_e_t_t_i_n_g_s___p_a_c_k_:_:_m_a_x___p_i_e_c_e___c_o_u_n_t setting and pass a higher limit to calls to │ │ │ │ │ _t_o_r_r_e_n_t___i_n_f_o_:_:_p_a_r_s_e___i_n_f_o___s_e_c_t_i_o_n_(_). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ wwrriittee__rreessuummee__ddaattaa__bbuuff(()) wwrriittee__rreessuummee__ddaattaa(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_w_r_i_t_e___r_e_s_u_m_e___d_a_t_a_._h_p_p" │ │ │ │ │ -std::vector wwrriittee__rreessuummee__ddaattaa__bbuuff (add_torrent_params const& atp); │ │ │ │ │ -entry wwrriittee__rreessuummee__ddaattaa (add_torrent_params const& atp); │ │ │ │ │ -this function turns the resume data in an add_torrent_params object into a │ │ │ │ │ -bencoded structure │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ wwrriittee__ttoorrrreenntt__ffiillee__bbuuff(()) wwrriittee__ttoorrrreenntt__ffiillee(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_w_r_i_t_e___r_e_s_u_m_e___d_a_t_a_._h_p_p" │ │ │ │ │ -entry wwrriittee__ttoorrrreenntt__ffiillee (add_torrent_params const& atp); │ │ │ │ │ -entry wwrriittee__ttoorrrreenntt__ffiillee (add_torrent_params const& atp, write_torrent_flags_t │ │ │ │ │ -flags); │ │ │ │ │ -std::vector wwrriittee__ttoorrrreenntt__ffiillee__bbuuff (add_torrent_params const& atp │ │ │ │ │ - , write_torrent_flags_t flags); │ │ │ │ │ -writes only the fields to create a .torrent file. This function may fail with a │ │ │ │ │ -std::system_error exception if: │ │ │ │ │ - * The _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s object passed to this function does not contain │ │ │ │ │ - the info dictionary (the ti field) │ │ │ │ │ - * The piece layers are not complete for all files that need them │ │ │ │ │ -The write_torrent_file_buf() overload returns the torrent file in bencoded │ │ │ │ │ -buffer form. This overload may be faster at the expense of lost flexibility to │ │ │ │ │ -add custom fields. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ wwrriittee__ttoorrrreenntt__ffllaaggss__tt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_w_r_i_t_e___r_e_s_u_m_e___d_a_t_a_._h_p_p" │ │ │ │ │ allow_missing_piece_layer │ │ │ │ │ this makes _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e_(_) not fail when attempting to write a v2 │ │ │ │ │ torrent file that does not have all the piece layers │ │ │ │ │ no_http_seeds │ │ │ │ │ don't include http seeds in the torrent file, even if some are present in │ │ │ ├── ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Session.html │ │ │ │ @@ -29,66 +29,66 @@ │ │ │ │ │ │ │ │ │ │ │ │

    home

    │ │ │ │
    │ │ │ │

    Table of contents

    │ │ │ │
    │ │ │ │ [report issue]
    │ │ │ │

    session_proxy

    │ │ │ │ @@ -99,32 +99,32 @@ │ │ │ │ may outlive session, causing the session destructor to not block. The │ │ │ │ session_proxy destructor will block however, until the underlying session │ │ │ │ is done shutting down.

    │ │ │ │
    │ │ │ │  struct session_proxy
    │ │ │ │  {
    │ │ │ │     session_proxy ();
    │ │ │ │ -   ~session_proxy ();
    │ │ │ │ -   session_proxy& operator= (session_proxy&&) & noexcept;
    │ │ │ │ -   session_proxy (session_proxy&&) noexcept;
    │ │ │ │     session_proxy& operator= (session_proxy const&) &;
    │ │ │ │     session_proxy (session_proxy const&);
    │ │ │ │ +   ~session_proxy ();
    │ │ │ │ +   session_proxy (session_proxy&&) noexcept;
    │ │ │ │ +   session_proxy& operator= (session_proxy&&) & noexcept;
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ - │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -

    session_proxy() operator=() ~session_proxy()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    operator=() session_proxy() ~session_proxy()

    │ │ │ │
    │ │ │ │  session_proxy ();
    │ │ │ │ -~session_proxy ();
    │ │ │ │ -session_proxy& operator= (session_proxy&&) & noexcept;
    │ │ │ │ -session_proxy (session_proxy&&) noexcept;
    │ │ │ │  session_proxy& operator= (session_proxy const&) &;
    │ │ │ │  session_proxy (session_proxy const&);
    │ │ │ │ +~session_proxy ();
    │ │ │ │ +session_proxy (session_proxy&&) noexcept;
    │ │ │ │ +session_proxy& operator= (session_proxy&&) & noexcept;
    │ │ │ │  
    │ │ │ │

    default constructor, does not refer to any session │ │ │ │ implementation object.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │
    │ │ │ │

    session

    │ │ │ │ @@ -138,52 +138,52 @@ │ │ │ │ session_handle::apply_settings() member function. To change one or more │ │ │ │ configuration options, create a settings_pack. object and fill it with │ │ │ │ the settings to be set and pass it in to session::apply_settings().

    │ │ │ │

    see apply_settings().

    │ │ │ │
    │ │ │ │  struct session : session_handle
    │ │ │ │  {
    │ │ │ │ -   session ();
    │ │ │ │ -   explicit session (session_params&& params);
    │ │ │ │     explicit session (session_params const& params);
    │ │ │ │ -   session (session_params&& params, session_flags_t flags);
    │ │ │ │ +   explicit session (session_params&& params);
    │ │ │ │ +   session ();
    │ │ │ │     session (session_params const& params, session_flags_t flags);
    │ │ │ │ +   session (session_params&& params, session_flags_t flags);
    │ │ │ │     session (session_params&& params, io_context& ios);
    │ │ │ │ +   session (session_params const& params, io_context& ios, session_flags_t);
    │ │ │ │     session (session_params const& params, io_context& ios);
    │ │ │ │     session (session_params&& params, io_context& ios, session_flags_t);
    │ │ │ │ -   session (session_params const& params, io_context& ios, session_flags_t);
    │ │ │ │     ~session ();
    │ │ │ │     session_proxy abort ();
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ [report issue]
    │ │ │ │

    session()

    │ │ │ │
    │ │ │ │ -session ();
    │ │ │ │ -explicit session (session_params&& params);
    │ │ │ │  explicit session (session_params const& params);
    │ │ │ │ -session (session_params&& params, session_flags_t flags);
    │ │ │ │ +explicit session (session_params&& params);
    │ │ │ │ +session ();
    │ │ │ │  session (session_params const& params, session_flags_t flags);
    │ │ │ │ +session (session_params&& params, session_flags_t flags);
    │ │ │ │  
    │ │ │ │

    Constructs the session objects which acts as the container of torrents. │ │ │ │ In order to avoid a race condition between starting the session and │ │ │ │ configuring it, you can pass in a session_params object. Its settings │ │ │ │ will take effect before the session starts up.

    │ │ │ │

    The overloads taking flags can be used to start a session in │ │ │ │ paused mode (by passing in session::paused). Note that │ │ │ │ add_default_plugins do not have an affect on constructors that │ │ │ │ take a session_params object. It already contains the plugins to use.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    session()

    │ │ │ │
    │ │ │ │  session (session_params&& params, io_context& ios);
    │ │ │ │ +session (session_params const& params, io_context& ios, session_flags_t);
    │ │ │ │  session (session_params const& params, io_context& ios);
    │ │ │ │  session (session_params&& params, io_context& ios, session_flags_t);
    │ │ │ │ -session (session_params const& params, io_context& ios, session_flags_t);
    │ │ │ │  
    │ │ │ │

    Overload of the constructor that takes an external io_context to run │ │ │ │ the session object on. This is primarily useful for tests that may want │ │ │ │ to run multiple sessions on a single io_context, or low resource │ │ │ │ systems where additional threads are expensive and sharing an │ │ │ │ io_context with other events is fine.

    │ │ │ │
    │ │ │ │ @@ -223,129 +223,49 @@ │ │ │ │ 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:

    │ │ │ │
    │ │ │ │  struct session_proxy {};
    │ │ │ │  
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    session_params

    │ │ │ │ -

    Declared in "libtorrent/session_params.hpp"

    │ │ │ │ -

    The session_params is a parameters pack for configuring the session │ │ │ │ -before it's started.

    │ │ │ │ -
    │ │ │ │ -struct session_params
    │ │ │ │ -{
    │ │ │ │ -   session_params (settings_pack const& sp);
    │ │ │ │ -   session_params (settings_pack&& sp);
    │ │ │ │ -   session_params ();
    │ │ │ │ -   session_params (settings_pack const& sp
    │ │ │ │ -      , std::vector<std::shared_ptr<plugin>> exts);
    │ │ │ │ -   session_params (settings_pack&& sp
    │ │ │ │ -      , std::vector<std::shared_ptr<plugin>> exts);
    │ │ │ │ -
    │ │ │ │ -   settings_pack settings;
    │ │ │ │ -   std::vector<std::shared_ptr<plugin>> extensions;
    │ │ │ │ -   dht::dht_state dht_state;
    │ │ │ │ -   dht::dht_storage_constructor_type dht_storage_constructor;
    │ │ │ │ -   disk_io_constructor_type disk_io_constructor;
    │ │ │ │ -   std::map<std::string, std::string> ext_state;
    │ │ │ │ -   libtorrent::ip_filter ip_filter;
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -

    session_params()

    │ │ │ │ -
    │ │ │ │ -session_params (settings_pack const& sp);
    │ │ │ │ -session_params (settings_pack&& sp);
    │ │ │ │ -session_params ();
    │ │ │ │ -
    │ │ │ │ -

    This constructor can be used to start with the default plugins │ │ │ │ -(ut_metadata, ut_pex and smart_ban). Pass a settings_pack to set the │ │ │ │ -initial settings when the session starts.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    session_params()

    │ │ │ │ -
    │ │ │ │ -session_params (settings_pack const& sp
    │ │ │ │ -      , std::vector<std::shared_ptr<plugin>> exts);
    │ │ │ │ -session_params (settings_pack&& sp
    │ │ │ │ -      , std::vector<std::shared_ptr<plugin>> exts);
    │ │ │ │ -
    │ │ │ │ -

    This constructor helps to configure the set of initial plugins │ │ │ │ -to be added to the session before it's started.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    settings
    │ │ │ │ -
    The settings to configure the session with
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    extensions
    │ │ │ │ -
    the plugins to add to the session as it is constructed
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    dht_state
    │ │ │ │ -
    DHT node ID and node addresses to bootstrap the DHT with.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    dht_storage_constructor
    │ │ │ │ -
    function object to construct the storage object for DHT items.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    disk_io_constructor
    │ │ │ │ -
    function object to create the disk I/O subsystem. Defaults to │ │ │ │ -default_disk_io_constructor.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    ext_state
    │ │ │ │ -
    this container can be used by extensions/plugins to store settings. It's │ │ │ │ -primarily here to make it convenient to save and restore state across │ │ │ │ -sessions, using read_session_params() and write_session_params().
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    ip_filter
    │ │ │ │ -
    the IP filter to use for the session. This restricts which peers are allowed │ │ │ │ -to connect. As if passed to set_ip_filter().
    │ │ │ │ -
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │
    │ │ │ │

    session_handle

    │ │ │ │

    Declared in "libtorrent/session_handle.hpp"

    │ │ │ │

    this class provides a non-owning handle to a session and a subset of the │ │ │ │ interface of the session class. If the underlying session is destructed │ │ │ │ -any handle to it will no longer be valid. is_valid() will return false and │ │ │ │ +any handle to it will no longer be valid. is_valid() will return false and │ │ │ │ any operation on it will throw a system_error exception, with error code │ │ │ │ invalid_session_handle.

    │ │ │ │
    │ │ │ │  struct session_handle
    │ │ │ │  {
    │ │ │ │     bool is_valid () const;
    │ │ │ │     session_params session_state (save_state_flags_t flags = save_state_flags_t::all()) const;
    │ │ │ │ -   void refresh_torrent_status (std::vector<torrent_status>* ret
    │ │ │ │ -      , status_flags_t flags = {}) const;
    │ │ │ │     std::vector<torrent_status> get_torrent_status (
    │ │ │ │        std::function<bool(torrent_status const&)> const& pred
    │ │ │ │        , status_flags_t flags = {}) const;
    │ │ │ │ +   void refresh_torrent_status (std::vector<torrent_status>* ret
    │ │ │ │ +      , status_flags_t flags = {}) const;
    │ │ │ │     void post_torrent_updates (status_flags_t flags = status_flags_t::all());
    │ │ │ │     void post_session_stats ();
    │ │ │ │     void post_dht_stats ();
    │ │ │ │ -   void set_dht_state (dht::dht_state&& st);
    │ │ │ │     void set_dht_state (dht::dht_state const& st);
    │ │ │ │ -   std::vector<torrent_handle> get_torrents () const;
    │ │ │ │ +   void set_dht_state (dht::dht_state&& st);
    │ │ │ │     torrent_handle find_torrent (sha1_hash const& info_hash) const;
    │ │ │ │ +   std::vector<torrent_handle> get_torrents () const;
    │ │ │ │     torrent_handle add_torrent (add_torrent_params const& params);
    │ │ │ │ +   void async_add_torrent (add_torrent_params const& params);
    │ │ │ │     torrent_handle add_torrent (add_torrent_params&& params, error_code& ec);
    │ │ │ │ -   torrent_handle add_torrent (add_torrent_params const& params, error_code& ec);
    │ │ │ │     torrent_handle add_torrent (add_torrent_params&& params);
    │ │ │ │ -   void async_add_torrent (add_torrent_params const& params);
    │ │ │ │     void async_add_torrent (add_torrent_params&& params);
    │ │ │ │ -   void resume ();
    │ │ │ │ +   torrent_handle add_torrent (add_torrent_params const& params, error_code& ec);
    │ │ │ │     void pause ();
    │ │ │ │ +   void resume ();
    │ │ │ │     bool is_paused () const;
    │ │ │ │     bool is_dht_running () const;
    │ │ │ │     void set_dht_storage (dht::dht_storage_constructor_type sc);
    │ │ │ │     void add_dht_node (std::pair<std::string, int> const& node);
    │ │ │ │     void dht_get_item (sha1_hash const& target);
    │ │ │ │     void dht_get_item (std::array<char, 32> key
    │ │ │ │        , std::string salt = std::string());
    │ │ │ │ @@ -355,40 +275,40 @@
    │ │ │ │        , std::int64_t&, std::string const&)> cb
    │ │ │ │        , std::string salt = std::string());
    │ │ │ │     void dht_get_peers (sha1_hash const& info_hash);
    │ │ │ │     void dht_announce (sha1_hash const& info_hash, int port = 0, dht::announce_flags_t flags = {});
    │ │ │ │     void dht_live_nodes (sha1_hash const& nid);
    │ │ │ │     void dht_sample_infohashes (udp::endpoint const& ep, sha1_hash const& target);
    │ │ │ │     void dht_direct_request (udp::endpoint const& ep, entry const& e, client_data_t userdata = {});
    │ │ │ │ +   void add_extension (std::shared_ptr<plugin> ext);
    │ │ │ │     void add_extension (std::function<std::shared_ptr<torrent_plugin>(
    │ │ │ │        torrent_handle const&, client_data_t)> ext);
    │ │ │ │ -   void add_extension (std::shared_ptr<plugin> ext);
    │ │ │ │ -   void set_ip_filter (ip_filter f);
    │ │ │ │     ip_filter get_ip_filter () const;
    │ │ │ │ +   void set_ip_filter (ip_filter f);
    │ │ │ │     void set_port_filter (port_filter const& f);
    │ │ │ │ -   unsigned short listen_port () const;
    │ │ │ │ -   bool is_listening () const;
    │ │ │ │     unsigned short ssl_listen_port () const;
    │ │ │ │ +   bool is_listening () const;
    │ │ │ │ +   unsigned short listen_port () const;
    │ │ │ │     ip_filter get_peer_class_filter () const;
    │ │ │ │     void set_peer_class_filter (ip_filter const& f);
    │ │ │ │     void set_peer_class_type_filter (peer_class_type_filter const& f);
    │ │ │ │     peer_class_type_filter get_peer_class_type_filter () const;
    │ │ │ │     peer_class_t create_peer_class (char const* name);
    │ │ │ │     void delete_peer_class (peer_class_t cid);
    │ │ │ │ -   void set_peer_class (peer_class_t cid, peer_class_info const& pci);
    │ │ │ │     peer_class_info get_peer_class (peer_class_t cid) const;
    │ │ │ │ +   void set_peer_class (peer_class_t cid, peer_class_info const& pci);
    │ │ │ │     void remove_torrent (const torrent_handle&, remove_flags_t = {});
    │ │ │ │     void apply_settings (settings_pack const&);
    │ │ │ │ -   settings_pack get_settings () const;
    │ │ │ │     void apply_settings (settings_pack&&);
    │ │ │ │ +   settings_pack get_settings () const;
    │ │ │ │ +   alert* wait_for_alert (time_duration max_wait);
    │ │ │ │     void set_alert_notify (std::function<void()> const& fun);
    │ │ │ │     void pop_alerts (std::vector<alert*>* alerts);
    │ │ │ │ -   alert* wait_for_alert (time_duration max_wait);
    │ │ │ │ -   void delete_port_mapping (port_mapping_t handle);
    │ │ │ │     std::vector<port_mapping_t> add_port_mapping (portmap_protocol t, int external_port, int local_port);
    │ │ │ │ +   void delete_port_mapping (port_mapping_t handle);
    │ │ │ │     void reopen_network_sockets (reopen_network_flags_t options = reopen_map_ports);
    │ │ │ │     std::shared_ptr<aux::session_impl> native_handle () const;
    │ │ │ │  
    │ │ │ │     static constexpr save_state_flags_t save_settings  = 0_bit;
    │ │ │ │     static constexpr save_state_flags_t save_dht_state  = 2_bit;
    │ │ │ │     static constexpr save_state_flags_t save_extension_state  = 11_bit;
    │ │ │ │     static constexpr save_state_flags_t save_ip_filter  = 12_bit;
    │ │ │ │ @@ -425,19 +345,19 @@
    │ │ │ │  the flags parameter can be used to only save certain parts of the
    │ │ │ │  session state

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    refresh_torrent_status() get_torrent_status()

    │ │ │ │
    │ │ │ │ -void refresh_torrent_status (std::vector<torrent_status>* ret
    │ │ │ │ -      , status_flags_t flags = {}) const;
    │ │ │ │  std::vector<torrent_status> get_torrent_status (
    │ │ │ │        std::function<bool(torrent_status const&)> const& pred
    │ │ │ │        , status_flags_t flags = {}) const;
    │ │ │ │ +void refresh_torrent_status (std::vector<torrent_status>* ret
    │ │ │ │ +      , status_flags_t flags = {}) const;
    │ │ │ │  
    │ │ │ │
    │ │ │ │

    Note

    │ │ │ │

    these calls are potentially expensive and won't scale well with │ │ │ │ lots of torrents. If you're concerned about performance, consider │ │ │ │ using post_torrent_updates() instead.

    │ │ │ │
    │ │ │ │ @@ -501,47 +421,47 @@ │ │ │ │ void post_dht_stats (); │ │ │ │ │ │ │ │

    This will cause a dht_stats_alert to be posted.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    set_dht_state()

    │ │ │ │
    │ │ │ │ -void set_dht_state (dht::dht_state&& st);
    │ │ │ │  void set_dht_state (dht::dht_state const& st);
    │ │ │ │ +void set_dht_state (dht::dht_state&& st);
    │ │ │ │  
    │ │ │ │

    set the DHT state for the session. This will be taken into account the │ │ │ │ next time the DHT is started, as if it had been passed in via the │ │ │ │ session_params on startup.

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    find_torrent() get_torrents()

    │ │ │ │
    │ │ │ │ -std::vector<torrent_handle> get_torrents () const;
    │ │ │ │  torrent_handle find_torrent (sha1_hash const& info_hash) const;
    │ │ │ │ +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.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    async_add_torrent() add_torrent()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    add_torrent() async_add_torrent()

    │ │ │ │
    │ │ │ │  torrent_handle add_torrent (add_torrent_params const& params);
    │ │ │ │ +void async_add_torrent (add_torrent_params const& params);
    │ │ │ │  torrent_handle add_torrent (add_torrent_params&& params, error_code& ec);
    │ │ │ │ -torrent_handle add_torrent (add_torrent_params const& params, error_code& ec);
    │ │ │ │  torrent_handle add_torrent (add_torrent_params&& params);
    │ │ │ │ -void async_add_torrent (add_torrent_params const& params);
    │ │ │ │  void async_add_torrent (add_torrent_params&& params);
    │ │ │ │ +torrent_handle add_torrent (add_torrent_params const& params, error_code& ec);
    │ │ │ │  
    │ │ │ │

    You add torrents through the add_torrent() function where you give an │ │ │ │ object with all the parameters. The add_torrent() overloads will block │ │ │ │ until the torrent has been added (or failed to be added) and returns │ │ │ │ an error code and a torrent_handle. In order to add torrents more │ │ │ │ efficiently, consider using async_add_torrent() which returns │ │ │ │ immediately, without waiting for the torrent to add. Notification of │ │ │ │ @@ -566,22 +486,22 @@ │ │ │ │ want to control are torrent_flags::paused and │ │ │ │ torrent_flags::auto_managed. In order to add a magnet link that will │ │ │ │ just download the metadata, but no payload, set the │ │ │ │ torrent_flags::upload_mode flag.

    │ │ │ │

    Special consideration has to be taken when adding hybrid torrents │ │ │ │ (i.e. torrents that are BitTorrent v2 torrents that are backwards │ │ │ │ compatible with v1). For more details, see BitTorrent v2 torrents.

    │ │ │ │ - │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    is_paused() pause() resume()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    pause() is_paused() resume()

    │ │ │ │
    │ │ │ │ -void resume ();
    │ │ │ │  void pause ();
    │ │ │ │ +void resume ();
    │ │ │ │  bool is_paused () const;
    │ │ │ │  
    │ │ │ │

    Pausing the session has the same effect as pausing every torrent in │ │ │ │ it, except that torrents will not be resumed by the auto-manage │ │ │ │ mechanism. Resuming will restore the torrents to their previous paused │ │ │ │ state. i.e. the session pause state is separate from the torrent pause │ │ │ │ state. A torrent is inactive if it is paused or if the session is │ │ │ │ @@ -690,18 +610,18 @@ │ │ │ │ with the function object's context and make the function entirely │ │ │ │ self-contained. The only reason data blob's value is computed │ │ │ │ via a function instead of just passing in the new value is to avoid │ │ │ │ race conditions. If you want to update the value in the DHT, you │ │ │ │ must first retrieve it, then modify it, then write it back. The way │ │ │ │ the DHT works, it is natural to always do a lookup before storing and │ │ │ │ calling the callback in between is convenient.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    dht_announce() dht_get_peers()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    dht_get_peers() dht_announce()

    │ │ │ │
    │ │ │ │  void dht_get_peers (sha1_hash const& info_hash);
    │ │ │ │  void dht_announce (sha1_hash const& info_hash, int port = 0, dht::announce_flags_t flags = {});
    │ │ │ │  
    │ │ │ │

    dht_get_peers() will issue a DHT get_peer request to the DHT for the │ │ │ │ specified info-hash. The response (the peers) will be posted back in a │ │ │ │ dht_get_peers_reply_alert.

    │ │ │ │ @@ -749,17 +669,17 @@ │ │ │ │ with the response (if any) and the userdata pointer passed in here. │ │ │ │ Since this alert is a response to an explicit call, it will always be │ │ │ │ posted, regardless of the alert mask.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    add_extension()

    │ │ │ │
    │ │ │ │ +void add_extension (std::shared_ptr<plugin> ext);
    │ │ │ │  void add_extension (std::function<std::shared_ptr<torrent_plugin>(
    │ │ │ │        torrent_handle const&, client_data_t)> ext);
    │ │ │ │ -void add_extension (std::shared_ptr<plugin> ext);
    │ │ │ │  
    │ │ │ │

    This function adds an extension to this session. The argument is a │ │ │ │ function object that is called with a torrent_handle and which should │ │ │ │ return a std::shared_ptr<torrent_plugin>. To write custom │ │ │ │ plugins, see libtorrent plugins. For the typical bittorrent client │ │ │ │ all of these extensions should be added. The main plugins implemented │ │ │ │ in libtorrent are:

    │ │ │ │ @@ -792,16 +712,16 @@ │ │ │ │ ses.add_extension(&lt::create_smart_ban_plugin); │ │ │ │ │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    get_ip_filter() set_ip_filter()

    │ │ │ │
    │ │ │ │ -void set_ip_filter (ip_filter f);
    │ │ │ │  ip_filter get_ip_filter () const;
    │ │ │ │ +void set_ip_filter (ip_filter f);
    │ │ │ │  
    │ │ │ │

    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. get_ip_filter() Returns the │ │ │ │ @@ -818,17 +738,17 @@ │ │ │ │ anti-virus software by connecting to SMTP, FTP ports.

    │ │ │ │ │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    ssl_listen_port() is_listening() listen_port()

    │ │ │ │
    │ │ │ │ -unsigned short listen_port () const;
    │ │ │ │ -bool is_listening () const;
    │ │ │ │  unsigned short ssl_listen_port () const;
    │ │ │ │ +bool is_listening () const;
    │ │ │ │ +unsigned short listen_port () const;
    │ │ │ │  
    │ │ │ │

    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 set a new │ │ │ │ settings_pack::listen_interfaces to try another interface and port to │ │ │ │ bind to.

    │ │ │ │

    listen_port() returns the port we ended up listening on.

    │ │ │ │ @@ -862,18 +782,18 @@ │ │ │ │ 32 bits in the IP range mapping. Only the set bits matter; no peer │ │ │ │ class will be removed from a peer as a result of this call, peer │ │ │ │ classes are only added.

    │ │ │ │

    The peer_class argument cannot be greater than 31. The bitmasks │ │ │ │ representing peer classes in the peer_class_filter are 32 bits.

    │ │ │ │

    The get_peer_class_filter() function returns the current filter.

    │ │ │ │

    For more information, see peer classes.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_peer_class_type_filter() get_peer_class_type_filter()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    get_peer_class_type_filter() set_peer_class_type_filter()

    │ │ │ │
    │ │ │ │  void set_peer_class_type_filter (peer_class_type_filter const& f);
    │ │ │ │  peer_class_type_filter get_peer_class_type_filter () const;
    │ │ │ │  
    │ │ │ │

    Sets and gets the peer class type filter. This is controls automatic │ │ │ │ peer class assignments to peers based on what kind of socket it is.

    │ │ │ │

    It does not only support assigning peer classes, it also supports │ │ │ │ @@ -915,21 +835,21 @@ │ │ │ │ remove the peer class if it's still assigned to torrents or peers. It │ │ │ │ will however remove it once the last peer and torrent drops their │ │ │ │ references to it.

    │ │ │ │

    There is no need to call this function for custom peer classes. All │ │ │ │ peer classes will be properly destructed when the session object │ │ │ │ destructs.

    │ │ │ │

    For more information on peer classes, see peer classes.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_peer_class() get_peer_class()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    get_peer_class() set_peer_class()

    │ │ │ │
    │ │ │ │ -void set_peer_class (peer_class_t cid, peer_class_info const& pci);
    │ │ │ │  peer_class_info get_peer_class (peer_class_t cid) const;
    │ │ │ │ +void set_peer_class (peer_class_t cid, peer_class_info const& pci);
    │ │ │ │  
    │ │ │ │

    These functions queries information from a peer class and updates the │ │ │ │ configuration of a peer class, respectively.

    │ │ │ │

    cid must refer to an existing peer class. If it does not, the │ │ │ │ return value of get_peer_class() is undefined.

    │ │ │ │

    set_peer_class() sets all the information in the │ │ │ │ peer_class_info object in the specified peer class. There is no │ │ │ │ @@ -944,60 +864,60 @@ │ │ │ │

    │ │ │ │  void remove_torrent (const torrent_handle&, remove_flags_t = {});
    │ │ │ │  
    │ │ │ │

    remove_torrent() will close all peer connections associated with │ │ │ │ the torrent and tell the tracker that we've stopped participating in │ │ │ │ the swarm. This operation cannot fail. When it completes, you will │ │ │ │ receive a torrent_removed_alert.

    │ │ │ │ -

    remove_torrent() is non-blocking, but will remove the torrent from the │ │ │ │ +

    remove_torrent() is non-blocking, but will remove the torrent from the │ │ │ │ session synchronously. Calling session_handle::add_torrent() immediately │ │ │ │ afterward with the same torrent will succeed. Note that this creates a │ │ │ │ new handle which is not equal to the removed one.

    │ │ │ │

    The optional second argument options can be used to delete all the │ │ │ │ files downloaded by this torrent. To do so, pass in the value │ │ │ │ session_handle::delete_files. Once the torrent is deleted, a │ │ │ │ torrent_deleted_alert is posted.

    │ │ │ │ -

    The torrent_handle remains valid for some time after remove_torrent() is │ │ │ │ +

    The torrent_handle remains valid for some time after remove_torrent() is │ │ │ │ called. It will become invalid only after all libtorrent tasks (such as │ │ │ │ I/O tasks) release their references to the torrent. Until this happens, │ │ │ │ torrent_handle::is_valid() will return true, and other calls such │ │ │ │ as torrent_handle::status() will succeed. Because of this, and because │ │ │ │ -remove_torrent() is non-blocking, the following sequence usually │ │ │ │ +remove_torrent() is non-blocking, the following sequence usually │ │ │ │ succeeds (does not throw system_error): │ │ │ │ .. code:: c++

    │ │ │ │
    │ │ │ │ session.remove_handle(handle); │ │ │ │ handle.save_resume_data();
    │ │ │ │

    Note that when a queued or downloading torrent is removed, its position │ │ │ │ in the download queue is vacated and every subsequent torrent in the │ │ │ │ queue has their queue positions updated. This can potentially cause a │ │ │ │ large state_update to be posted. When removing all torrents, it is │ │ │ │ advised to remove them from the back of the queue, to minimize the │ │ │ │ shifting.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    get_settings() apply_settings()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    apply_settings() get_settings()

    │ │ │ │
    │ │ │ │  void apply_settings (settings_pack const&);
    │ │ │ │ -settings_pack get_settings () const;
    │ │ │ │  void apply_settings (settings_pack&&);
    │ │ │ │ +settings_pack get_settings () const;
    │ │ │ │  
    │ │ │ │

    Applies the settings specified by the settings_pack s. This is an │ │ │ │ asynchronous operation that will return immediately and actually apply │ │ │ │ the settings to the main thread of libtorrent some time later.

    │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    pop_alerts() set_alert_notify() wait_for_alert()

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    wait_for_alert() pop_alerts() set_alert_notify()

    │ │ │ │
    │ │ │ │ +alert* wait_for_alert (time_duration max_wait);
    │ │ │ │  void set_alert_notify (std::function<void()> const& fun);
    │ │ │ │  void pop_alerts (std::vector<alert*>* alerts);
    │ │ │ │ -alert* wait_for_alert (time_duration max_wait);
    │ │ │ │  
    │ │ │ │

    Alerts is the main mechanism for libtorrent to report errors and │ │ │ │ events. pop_alerts fills in the vector passed to it with pointers │ │ │ │ to new alerts. The session still owns these alerts and they will stay │ │ │ │ valid until the next time pop_alerts is called. You may not delete │ │ │ │ the alert objects.

    │ │ │ │

    It is safe to call pop_alerts from multiple different threads, as │ │ │ │ @@ -1048,16 +968,16 @@ │ │ │ │ alert::type() but can also be queries from a concrete type via │ │ │ │ T::alert_type, as a static constant.

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    delete_port_mapping() add_port_mapping()

    │ │ │ │
    │ │ │ │ -void delete_port_mapping (port_mapping_t handle);
    │ │ │ │  std::vector<port_mapping_t> add_port_mapping (portmap_protocol t, int external_port, int local_port);
    │ │ │ │ +void delete_port_mapping (port_mapping_t handle);
    │ │ │ │  
    │ │ │ │

    add_port_mapping adds one or more port forwards on UPnP and/or NAT-PMP, │ │ │ │ whichever is enabled. A mapping is created for each listen socket │ │ │ │ in the session. The return values are all handles referring to the │ │ │ │ port mappings that were just created. Pass them to delete_port_mapping() │ │ │ │ to remove them.

    │ │ │ │ [report issue]
    │ │ │ │ @@ -1123,30 +1043,110 @@ │ │ │ │ [report issue]
    │ │ │ │
    reopen_map_ports
    │ │ │ │
    This option indicates if the ports are mapped using natpmp │ │ │ │ and upnp. If mapping was already made, they are deleted and added │ │ │ │ again. This only works if natpmp and/or upnp are configured to be │ │ │ │ enable.
    │ │ │ │
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    session_params

    │ │ │ │ +

    Declared in "libtorrent/session_params.hpp"

    │ │ │ │ +

    The session_params is a parameters pack for configuring the session │ │ │ │ +before it's started.

    │ │ │ │ +
    │ │ │ │ +struct session_params
    │ │ │ │ +{
    │ │ │ │ +   session_params (settings_pack&& sp);
    │ │ │ │ +   session_params (settings_pack const& sp);
    │ │ │ │ +   session_params ();
    │ │ │ │ +   session_params (settings_pack const& sp
    │ │ │ │ +      , std::vector<std::shared_ptr<plugin>> exts);
    │ │ │ │ +   session_params (settings_pack&& sp
    │ │ │ │ +      , std::vector<std::shared_ptr<plugin>> exts);
    │ │ │ │ +
    │ │ │ │ +   settings_pack settings;
    │ │ │ │ +   std::vector<std::shared_ptr<plugin>> extensions;
    │ │ │ │ +   dht::dht_state dht_state;
    │ │ │ │ +   dht::dht_storage_constructor_type dht_storage_constructor;
    │ │ │ │ +   disk_io_constructor_type disk_io_constructor;
    │ │ │ │ +   std::map<std::string, std::string> ext_state;
    │ │ │ │ +   libtorrent::ip_filter ip_filter;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +

    session_params()

    │ │ │ │ +
    │ │ │ │ +session_params (settings_pack&& sp);
    │ │ │ │ +session_params (settings_pack const& sp);
    │ │ │ │ +session_params ();
    │ │ │ │ +
    │ │ │ │ +

    This constructor can be used to start with the default plugins │ │ │ │ +(ut_metadata, ut_pex and smart_ban). Pass a settings_pack to set the │ │ │ │ +initial settings when the session starts.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    session_params()

    │ │ │ │ +
    │ │ │ │ +session_params (settings_pack const& sp
    │ │ │ │ +      , std::vector<std::shared_ptr<plugin>> exts);
    │ │ │ │ +session_params (settings_pack&& sp
    │ │ │ │ +      , std::vector<std::shared_ptr<plugin>> exts);
    │ │ │ │ +
    │ │ │ │ +

    This constructor helps to configure the set of initial plugins │ │ │ │ +to be added to the session before it's started.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    settings
    │ │ │ │ +
    The settings to configure the session with
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    extensions
    │ │ │ │ +
    the plugins to add to the session as it is constructed
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    dht_state
    │ │ │ │ +
    DHT node ID and node addresses to bootstrap the DHT with.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    dht_storage_constructor
    │ │ │ │ +
    function object to construct the storage object for DHT items.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    disk_io_constructor
    │ │ │ │ +
    function object to create the disk I/O subsystem. Defaults to │ │ │ │ +default_disk_io_constructor.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    ext_state
    │ │ │ │ +
    this container can be used by extensions/plugins to store settings. It's │ │ │ │ +primarily here to make it convenient to save and restore state across │ │ │ │ +sessions, using read_session_params() and write_session_params().
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    ip_filter
    │ │ │ │ +
    the IP filter to use for the session. This restricts which peers are allowed │ │ │ │ +to connect. As if passed to set_ip_filter().
    │ │ │ │ +
    │ │ │ │ │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │
    │ │ │ │

    write_session_params_buf() write_session_params() read_session_params()

    │ │ │ │

    Declared in "libtorrent/session_params.hpp"

    │ │ │ │
    │ │ │ │ -session_params read_session_params (span<char const> buf
    │ │ │ │ -   , save_state_flags_t flags = save_state_flags_t::all());
    │ │ │ │ -std::vector<char> write_session_params_buf (session_params const& sp
    │ │ │ │ -   , save_state_flags_t flags = save_state_flags_t::all());
    │ │ │ │  entry write_session_params (session_params const& sp
    │ │ │ │     , save_state_flags_t flags = save_state_flags_t::all());
    │ │ │ │  session_params read_session_params (bdecode_node const& e
    │ │ │ │     , save_state_flags_t flags = save_state_flags_t::all());
    │ │ │ │ +session_params read_session_params (span<char const> buf
    │ │ │ │ +   , save_state_flags_t flags = save_state_flags_t::all());
    │ │ │ │ +std::vector<char> write_session_params_buf (session_params const& sp
    │ │ │ │ +   , save_state_flags_t flags = save_state_flags_t::all());
    │ │ │ │  
    │ │ │ │

    These functions serialize and de-serialize a session_params object to and │ │ │ │ from bencoded form. The session_params object is used to initialize a new │ │ │ │ session using the state from a previous one (or by programmatically configure │ │ │ │ the session up-front). │ │ │ │ The flags parameter can be used to only save and load certain aspects of the │ │ │ │ session's state. │ │ │ │ ├── html2text {} │ │ │ │ │ @@ -1,86 +1,86 @@ │ │ │ │ │ > │ │ │ │ │ _[_l_i_b_t_o_r_r_e_n_t_ _l_o_g_o_] │ │ │ │ │ VVeerrssiioonn:: 2.0.11 │ │ │ │ │ _h_o_m_e │ │ │ │ │ Table of contents │ │ │ │ │ * _s_e_s_s_i_o_n___p_r_o_x_y │ │ │ │ │ - o _s_e_s_s_i_o_n___p_r_o_x_y_(_)_ _o_p_e_r_a_t_o_r_=_(_)_ _~_s_e_s_s_i_o_n___p_r_o_x_y_(_) │ │ │ │ │ + o _o_p_e_r_a_t_o_r_=_(_)_ _s_e_s_s_i_o_n___p_r_o_x_y_(_)_ _~_s_e_s_s_i_o_n___p_r_o_x_y_(_) │ │ │ │ │ * _s_e_s_s_i_o_n │ │ │ │ │ o _s_e_s_s_i_o_n_(_) │ │ │ │ │ o _s_e_s_s_i_o_n_(_) │ │ │ │ │ o _~_s_e_s_s_i_o_n_(_) │ │ │ │ │ o _a_b_o_r_t_(_) │ │ │ │ │ - * _s_e_s_s_i_o_n___p_a_r_a_m_s │ │ │ │ │ - o _s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ - o _s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ * _s_e_s_s_i_o_n___h_a_n_d_l_e │ │ │ │ │ o _i_s___v_a_l_i_d_(_) │ │ │ │ │ o _s_e_s_s_i_o_n___s_t_a_t_e_(_) │ │ │ │ │ o _r_e_f_r_e_s_h___t_o_r_r_e_n_t___s_t_a_t_u_s_(_)_ _g_e_t___t_o_r_r_e_n_t___s_t_a_t_u_s_(_) │ │ │ │ │ o _p_o_s_t___t_o_r_r_e_n_t___u_p_d_a_t_e_s_(_) │ │ │ │ │ o _p_o_s_t___s_e_s_s_i_o_n___s_t_a_t_s_(_) │ │ │ │ │ o _p_o_s_t___d_h_t___s_t_a_t_s_(_) │ │ │ │ │ o _s_e_t___d_h_t___s_t_a_t_e_(_) │ │ │ │ │ o _f_i_n_d___t_o_r_r_e_n_t_(_)_ _g_e_t___t_o_r_r_e_n_t_s_(_) │ │ │ │ │ - o _a_s_y_n_c___a_d_d___t_o_r_r_e_n_t_(_)_ _a_d_d___t_o_r_r_e_n_t_(_) │ │ │ │ │ - o _i_s___p_a_u_s_e_d_(_)_ _p_a_u_s_e_(_)_ _r_e_s_u_m_e_(_) │ │ │ │ │ + o _a_d_d___t_o_r_r_e_n_t_(_)_ _a_s_y_n_c___a_d_d___t_o_r_r_e_n_t_(_) │ │ │ │ │ + o _p_a_u_s_e_(_)_ _i_s___p_a_u_s_e_d_(_)_ _r_e_s_u_m_e_(_) │ │ │ │ │ o _i_s___d_h_t___r_u_n_n_i_n_g_(_) │ │ │ │ │ o _s_e_t___d_h_t___s_t_o_r_a_g_e_(_) │ │ │ │ │ o _a_d_d___d_h_t___n_o_d_e_(_) │ │ │ │ │ o _d_h_t___g_e_t___i_t_e_m_(_) │ │ │ │ │ o _d_h_t___g_e_t___i_t_e_m_(_) │ │ │ │ │ o _d_h_t___p_u_t___i_t_e_m_(_) │ │ │ │ │ o _d_h_t___p_u_t___i_t_e_m_(_) │ │ │ │ │ - o _d_h_t___a_n_n_o_u_n_c_e_(_)_ _d_h_t___g_e_t___p_e_e_r_s_(_) │ │ │ │ │ + o _d_h_t___g_e_t___p_e_e_r_s_(_)_ _d_h_t___a_n_n_o_u_n_c_e_(_) │ │ │ │ │ o _d_h_t___l_i_v_e___n_o_d_e_s_(_) │ │ │ │ │ o _d_h_t___s_a_m_p_l_e___i_n_f_o_h_a_s_h_e_s_(_) │ │ │ │ │ o _d_h_t___d_i_r_e_c_t___r_e_q_u_e_s_t_(_) │ │ │ │ │ o _a_d_d___e_x_t_e_n_s_i_o_n_(_) │ │ │ │ │ o _g_e_t___i_p___f_i_l_t_e_r_(_)_ _s_e_t___i_p___f_i_l_t_e_r_(_) │ │ │ │ │ o _s_e_t___p_o_r_t___f_i_l_t_e_r_(_) │ │ │ │ │ o _s_s_l___l_i_s_t_e_n___p_o_r_t_(_)_ _i_s___l_i_s_t_e_n_i_n_g_(_)_ _l_i_s_t_e_n___p_o_r_t_(_) │ │ │ │ │ o _s_e_t___p_e_e_r___c_l_a_s_s___f_i_l_t_e_r_(_)_ _g_e_t___p_e_e_r___c_l_a_s_s___f_i_l_t_e_r_(_) │ │ │ │ │ - o _s_e_t___p_e_e_r___c_l_a_s_s___t_y_p_e___f_i_l_t_e_r_(_)_ _g_e_t___p_e_e_r___c_l_a_s_s___t_y_p_e___f_i_l_t_e_r_(_) │ │ │ │ │ + o _g_e_t___p_e_e_r___c_l_a_s_s___t_y_p_e___f_i_l_t_e_r_(_)_ _s_e_t___p_e_e_r___c_l_a_s_s___t_y_p_e___f_i_l_t_e_r_(_) │ │ │ │ │ o _c_r_e_a_t_e___p_e_e_r___c_l_a_s_s_(_) │ │ │ │ │ o _d_e_l_e_t_e___p_e_e_r___c_l_a_s_s_(_) │ │ │ │ │ - o _s_e_t___p_e_e_r___c_l_a_s_s_(_)_ _g_e_t___p_e_e_r___c_l_a_s_s_(_) │ │ │ │ │ + o _g_e_t___p_e_e_r___c_l_a_s_s_(_)_ _s_e_t___p_e_e_r___c_l_a_s_s_(_) │ │ │ │ │ o _r_e_m_o_v_e___t_o_r_r_e_n_t_(_) │ │ │ │ │ - o _g_e_t___s_e_t_t_i_n_g_s_(_)_ _a_p_p_l_y___s_e_t_t_i_n_g_s_(_) │ │ │ │ │ - o _p_o_p___a_l_e_r_t_s_(_)_ _s_e_t___a_l_e_r_t___n_o_t_i_f_y_(_)_ _w_a_i_t___f_o_r___a_l_e_r_t_(_) │ │ │ │ │ + o _a_p_p_l_y___s_e_t_t_i_n_g_s_(_)_ _g_e_t___s_e_t_t_i_n_g_s_(_) │ │ │ │ │ + o _w_a_i_t___f_o_r___a_l_e_r_t_(_)_ _p_o_p___a_l_e_r_t_s_(_)_ _s_e_t___a_l_e_r_t___n_o_t_i_f_y_(_) │ │ │ │ │ o _d_e_l_e_t_e___p_o_r_t___m_a_p_p_i_n_g_(_)_ _a_d_d___p_o_r_t___m_a_p_p_i_n_g_(_) │ │ │ │ │ o _r_e_o_p_e_n___n_e_t_w_o_r_k___s_o_c_k_e_t_s_(_) │ │ │ │ │ o _n_a_t_i_v_e___h_a_n_d_l_e_(_) │ │ │ │ │ + * _s_e_s_s_i_o_n___p_a_r_a_m_s │ │ │ │ │ + o _s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ + o _s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ * _w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s___b_u_f_(_)_ _w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s_(_)_ _r_e_a_d___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ sseessssiioonn__pprrooxxyy ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n_._h_p_p" │ │ │ │ │ this is a holder for the internal _s_e_s_s_i_o_n implementation object. Once the │ │ │ │ │ _s_e_s_s_i_o_n destruction is explicitly initiated, this holder is used to synchronize │ │ │ │ │ the completion of the shutdown. The lifetime of this object may outlive │ │ │ │ │ _s_e_s_s_i_o_n, causing the _s_e_s_s_i_o_n destructor to not block. The _s_e_s_s_i_o_n___p_r_o_x_y │ │ │ │ │ destructor will block however, until the underlying _s_e_s_s_i_o_n is done shutting │ │ │ │ │ down. │ │ │ │ │ struct session_proxy │ │ │ │ │ { │ │ │ │ │ sseessssiioonn__pprrooxxyy (); │ │ │ │ │ - ~~sseessssiioonn__pprrooxxyy (); │ │ │ │ │ - session_proxy& ooppeerraattoorr== (session_proxy&&) & noexcept; │ │ │ │ │ - sseessssiioonn__pprrooxxyy (session_proxy&&) noexcept; │ │ │ │ │ session_proxy& ooppeerraattoorr== (session_proxy const&) &; │ │ │ │ │ sseessssiioonn__pprrooxxyy (session_proxy const&); │ │ │ │ │ + ~~sseessssiioonn__pprrooxxyy (); │ │ │ │ │ + sseessssiioonn__pprrooxxyy (session_proxy&&) noexcept; │ │ │ │ │ + session_proxy& ooppeerraattoorr== (session_proxy&&) & noexcept; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseessssiioonn__pprrooxxyy(()) ooppeerraattoorr==(()) ~~sseessssiioonn__pprrooxxyy(()) ********** │ │ │ │ │ +********** ooppeerraattoorr==(()) sseessssiioonn__pprrooxxyy(()) ~~sseessssiioonn__pprrooxxyy(()) ********** │ │ │ │ │ sseessssiioonn__pprrooxxyy (); │ │ │ │ │ -~~sseessssiioonn__pprrooxxyy (); │ │ │ │ │ -session_proxy& ooppeerraattoorr== (session_proxy&&) & noexcept; │ │ │ │ │ -sseessssiioonn__pprrooxxyy (session_proxy&&) noexcept; │ │ │ │ │ session_proxy& ooppeerraattoorr== (session_proxy const&) &; │ │ │ │ │ sseessssiioonn__pprrooxxyy (session_proxy const&); │ │ │ │ │ +~~sseessssiioonn__pprrooxxyy (); │ │ │ │ │ +sseessssiioonn__pprrooxxyy (session_proxy&&) noexcept; │ │ │ │ │ +session_proxy& ooppeerraattoorr== (session_proxy&&) & noexcept; │ │ │ │ │ default constructor, does not refer to any _s_e_s_s_i_o_n implementation object. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ sseessssiioonn ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n_._h_p_p" │ │ │ │ │ The _s_e_s_s_i_o_n holds all state that spans multiple torrents. Among other things it │ │ │ │ │ runs the network loop and manages all torrents. Once it's created, the _s_e_s_s_i_o_n │ │ │ │ │ object will spawn the main thread that will do all the work. The main thread │ │ │ │ │ @@ -88,47 +88,47 @@ │ │ │ │ │ You have some control over _s_e_s_s_i_o_n configuration through the session_handle:: │ │ │ │ │ apply_settings() member function. To change one or more configuration options, │ │ │ │ │ create a _s_e_t_t_i_n_g_s___p_a_c_k. object and fill it with the settings to be set and pass │ │ │ │ │ it in to session::apply_settings(). │ │ │ │ │ see _a_p_p_l_y___s_e_t_t_i_n_g_s_(_). │ │ │ │ │ struct session : session_handle │ │ │ │ │ { │ │ │ │ │ - sseessssiioonn (); │ │ │ │ │ - explicit sseessssiioonn (session_params&& params); │ │ │ │ │ explicit sseessssiioonn (session_params const& params); │ │ │ │ │ - sseessssiioonn (session_params&& params, session_flags_t flags); │ │ │ │ │ + explicit sseessssiioonn (session_params&& params); │ │ │ │ │ + sseessssiioonn (); │ │ │ │ │ sseessssiioonn (session_params const& params, session_flags_t flags); │ │ │ │ │ + sseessssiioonn (session_params&& params, session_flags_t flags); │ │ │ │ │ sseessssiioonn (session_params&& params, io_context& ios); │ │ │ │ │ + sseessssiioonn (session_params const& params, io_context& ios, session_flags_t); │ │ │ │ │ sseessssiioonn (session_params const& params, io_context& ios); │ │ │ │ │ sseessssiioonn (session_params&& params, io_context& ios, session_flags_t); │ │ │ │ │ - sseessssiioonn (session_params const& params, io_context& ios, session_flags_t); │ │ │ │ │ ~~sseessssiioonn (); │ │ │ │ │ session_proxy aabboorrtt (); │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** sseessssiioonn(()) ********** │ │ │ │ │ -sseessssiioonn (); │ │ │ │ │ -explicit sseessssiioonn (session_params&& params); │ │ │ │ │ explicit sseessssiioonn (session_params const& params); │ │ │ │ │ -sseessssiioonn (session_params&& params, session_flags_t flags); │ │ │ │ │ +explicit sseessssiioonn (session_params&& params); │ │ │ │ │ +sseessssiioonn (); │ │ │ │ │ sseessssiioonn (session_params const& params, session_flags_t flags); │ │ │ │ │ +sseessssiioonn (session_params&& params, session_flags_t flags); │ │ │ │ │ Constructs the _s_e_s_s_i_o_n objects which acts as the container of torrents. In │ │ │ │ │ order to avoid a race condition between starting the _s_e_s_s_i_o_n and configuring │ │ │ │ │ it, you can pass in a _s_e_s_s_i_o_n___p_a_r_a_m_s object. Its settings will take effect │ │ │ │ │ before the _s_e_s_s_i_o_n starts up. │ │ │ │ │ The overloads taking flags can be used to start a _s_e_s_s_i_o_n in paused mode (by │ │ │ │ │ passing in session::paused). Note that add_default_plugins do not have an │ │ │ │ │ affect on constructors that take a _s_e_s_s_i_o_n___p_a_r_a_m_s object. It already contains │ │ │ │ │ the plugins to use. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** sseessssiioonn(()) ********** │ │ │ │ │ sseessssiioonn (session_params&& params, io_context& ios); │ │ │ │ │ +sseessssiioonn (session_params const& params, io_context& ios, session_flags_t); │ │ │ │ │ sseessssiioonn (session_params const& params, io_context& ios); │ │ │ │ │ sseessssiioonn (session_params&& params, io_context& ios, session_flags_t); │ │ │ │ │ -sseessssiioonn (session_params const& params, io_context& ios, session_flags_t); │ │ │ │ │ Overload of the constructor that takes an external io_context to run the │ │ │ │ │ _s_e_s_s_i_o_n object on. This is primarily useful for tests that may want to run │ │ │ │ │ multiple sessions on a single io_context, or low resource systems where │ │ │ │ │ additional threads are expensive and sharing an io_context with other events is │ │ │ │ │ fine. │ │ │ │ │ Warning │ │ │ │ │ The _s_e_s_s_i_o_n object does not cleanly terminate with an external io_context. The │ │ │ │ │ @@ -156,111 +156,47 @@ │ │ │ │ │ then synchronize the threads. So, the destruction of the _s_e_s_s_i_o_n 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 _s_e_s_s_i_o_n is being │ │ │ │ │ closed down, no operations are allowed on it). The only valid operation is │ │ │ │ │ calling the destructor: │ │ │ │ │ struct session_proxy {}; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ sseessssiioonn__ppaarraammss ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n___p_a_r_a_m_s_._h_p_p" │ │ │ │ │ -The _s_e_s_s_i_o_n___p_a_r_a_m_s is a parameters pack for configuring the _s_e_s_s_i_o_n before it's │ │ │ │ │ -started. │ │ │ │ │ -struct session_params │ │ │ │ │ -{ │ │ │ │ │ - sseessssiioonn__ppaarraammss (settings_pack const& sp); │ │ │ │ │ - sseessssiioonn__ppaarraammss (settings_pack&& sp); │ │ │ │ │ - sseessssiioonn__ppaarraammss (); │ │ │ │ │ - sseessssiioonn__ppaarraammss (settings_pack const& sp │ │ │ │ │ - , std::vector> exts); │ │ │ │ │ - sseessssiioonn__ppaarraammss (settings_pack&& sp │ │ │ │ │ - , std::vector> exts); │ │ │ │ │ - │ │ │ │ │ - settings_pack settings; │ │ │ │ │ - std::vector> extensions; │ │ │ │ │ - dht::dht_state dht_state; │ │ │ │ │ - dht::dht_storage_constructor_type dht_storage_constructor; │ │ │ │ │ - disk_io_constructor_type disk_io_constructor; │ │ │ │ │ - std::map ext_state; │ │ │ │ │ - libtorrent::ip_filter ip_filter; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseessssiioonn__ppaarraammss(()) ********** │ │ │ │ │ -sseessssiioonn__ppaarraammss (settings_pack const& sp); │ │ │ │ │ -sseessssiioonn__ppaarraammss (settings_pack&& sp); │ │ │ │ │ -sseessssiioonn__ppaarraammss (); │ │ │ │ │ -This constructor can be used to start with the default plugins (ut_metadata, │ │ │ │ │ -ut_pex and smart_ban). Pass a _s_e_t_t_i_n_g_s___p_a_c_k to set the initial settings when │ │ │ │ │ -the _s_e_s_s_i_o_n starts. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseessssiioonn__ppaarraammss(()) ********** │ │ │ │ │ -sseessssiioonn__ppaarraammss (settings_pack const& sp │ │ │ │ │ - , std::vector> exts); │ │ │ │ │ -sseessssiioonn__ppaarraammss (settings_pack&& sp │ │ │ │ │ - , std::vector> exts); │ │ │ │ │ -This constructor helps to configure the set of initial plugins to be added to │ │ │ │ │ -the _s_e_s_s_i_o_n before it's started. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - settings │ │ │ │ │ - The settings to configure the _s_e_s_s_i_o_n with │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - extensions │ │ │ │ │ - the plugins to add to the _s_e_s_s_i_o_n as it is constructed │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - dht_state │ │ │ │ │ - DHT node ID and node addresses to bootstrap the DHT with. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - dht_storage_constructor │ │ │ │ │ - function object to construct the storage object for DHT items. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - disk_io_constructor │ │ │ │ │ - function object to create the disk I/O subsystem. Defaults to │ │ │ │ │ - default_disk_io_constructor. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - ext_state │ │ │ │ │ - this container can be used by extensions/plugins to store settings. It's │ │ │ │ │ - primarily here to make it convenient to save and restore state across │ │ │ │ │ - sessions, using _r_e_a_d___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) and _w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s_(_). │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - ip_filter │ │ │ │ │ - the IP filter to use for the _s_e_s_s_i_o_n. This restricts which peers are │ │ │ │ │ - allowed to connect. As if passed to _s_e_t___i_p___f_i_l_t_e_r_(_). │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ sseessssiioonn__hhaannddllee ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ this class provides a non-owning handle to a _s_e_s_s_i_o_n and a subset of the │ │ │ │ │ interface of the _s_e_s_s_i_o_n class. If the underlying _s_e_s_s_i_o_n is destructed any │ │ │ │ │ handle to it will no longer be valid. _i_s___v_a_l_i_d_(_) will return false and any │ │ │ │ │ operation on it will throw a system_error exception, with error code │ │ │ │ │ invalid_session_handle. │ │ │ │ │ struct session_handle │ │ │ │ │ { │ │ │ │ │ bool iiss__vvaalliidd () const; │ │ │ │ │ session_params sseessssiioonn__ssttaattee (save_state_flags_t flags = │ │ │ │ │ save_state_flags_t::all()) const; │ │ │ │ │ - void rreeffrreesshh__ttoorrrreenntt__ssttaattuuss (std::vector* ret │ │ │ │ │ - , status_flags_t flags = {}) const; │ │ │ │ │ std::vector ggeett__ttoorrrreenntt__ssttaattuuss ( │ │ │ │ │ std::function const& pred │ │ │ │ │ , status_flags_t flags = {}) const; │ │ │ │ │ + void rreeffrreesshh__ttoorrrreenntt__ssttaattuuss (std::vector* ret │ │ │ │ │ + , status_flags_t flags = {}) const; │ │ │ │ │ void ppoosstt__ttoorrrreenntt__uuppddaatteess (status_flags_t flags = status_flags_t::all()); │ │ │ │ │ void ppoosstt__sseessssiioonn__ssttaattss (); │ │ │ │ │ void ppoosstt__ddhhtt__ssttaattss (); │ │ │ │ │ - void sseett__ddhhtt__ssttaattee (dht::dht_state&& st); │ │ │ │ │ void sseett__ddhhtt__ssttaattee (dht::dht_state const& st); │ │ │ │ │ - std::vector ggeett__ttoorrrreennttss () const; │ │ │ │ │ + void sseett__ddhhtt__ssttaattee (dht::dht_state&& st); │ │ │ │ │ torrent_handle ffiinndd__ttoorrrreenntt (sha1_hash const& info_hash) const; │ │ │ │ │ + std::vector ggeett__ttoorrrreennttss () const; │ │ │ │ │ torrent_handle aadddd__ttoorrrreenntt (add_torrent_params const& params); │ │ │ │ │ + void aassyynncc__aadddd__ttoorrrreenntt (add_torrent_params const& params); │ │ │ │ │ torrent_handle aadddd__ttoorrrreenntt (add_torrent_params&& params, error_code& ec); │ │ │ │ │ - torrent_handle aadddd__ttoorrrreenntt (add_torrent_params const& params, error_code& │ │ │ │ │ -ec); │ │ │ │ │ torrent_handle aadddd__ttoorrrreenntt (add_torrent_params&& params); │ │ │ │ │ - void aassyynncc__aadddd__ttoorrrreenntt (add_torrent_params const& params); │ │ │ │ │ void aassyynncc__aadddd__ttoorrrreenntt (add_torrent_params&& params); │ │ │ │ │ - void rreessuummee (); │ │ │ │ │ + torrent_handle aadddd__ttoorrrreenntt (add_torrent_params const& params, error_code& │ │ │ │ │ +ec); │ │ │ │ │ void ppaauussee (); │ │ │ │ │ + void rreessuummee (); │ │ │ │ │ bool iiss__ppaauusseedd () const; │ │ │ │ │ bool iiss__ddhhtt__rruunnnniinngg () const; │ │ │ │ │ void sseett__ddhhtt__ssttoorraaggee (dht::dht_storage_constructor_type sc); │ │ │ │ │ void aadddd__ddhhtt__nnooddee (std::pair const& node); │ │ │ │ │ void ddhhtt__ggeett__iitteemm (sha1_hash const& target); │ │ │ │ │ void ddhhtt__ggeett__iitteemm (std::array key │ │ │ │ │ , std::string salt = std::string()); │ │ │ │ │ @@ -273,41 +209,41 @@ │ │ │ │ │ void ddhhtt__aannnnoouunnccee (sha1_hash const& info_hash, int port = 0, dht:: │ │ │ │ │ announce_flags_t flags = {}); │ │ │ │ │ void ddhhtt__lliivvee__nnooddeess (sha1_hash const& nid); │ │ │ │ │ void ddhhtt__ssaammppllee__iinnffoohhaasshheess (udp::endpoint const& ep, sha1_hash const& │ │ │ │ │ target); │ │ │ │ │ void ddhhtt__ddiirreecctt__rreeqquueesstt (udp::endpoint const& ep, entry const& e, │ │ │ │ │ client_data_t userdata = {}); │ │ │ │ │ + void aadddd__eexxtteennssiioonn (std::shared_ptr ext); │ │ │ │ │ void aadddd__eexxtteennssiioonn (std::function( │ │ │ │ │ torrent_handle const&, client_data_t)> ext); │ │ │ │ │ - void aadddd__eexxtteennssiioonn (std::shared_ptr ext); │ │ │ │ │ - void sseett__iipp__ffiilltteerr (ip_filter f); │ │ │ │ │ ip_filter ggeett__iipp__ffiilltteerr () const; │ │ │ │ │ + void sseett__iipp__ffiilltteerr (ip_filter f); │ │ │ │ │ void sseett__ppoorrtt__ffiilltteerr (port_filter const& f); │ │ │ │ │ - unsigned short lliisstteenn__ppoorrtt () const; │ │ │ │ │ - bool iiss__lliisstteenniinngg () const; │ │ │ │ │ unsigned short ssssll__lliisstteenn__ppoorrtt () const; │ │ │ │ │ + bool iiss__lliisstteenniinngg () const; │ │ │ │ │ + unsigned short lliisstteenn__ppoorrtt () const; │ │ │ │ │ ip_filter ggeett__ppeeeerr__ccllaassss__ffiilltteerr () const; │ │ │ │ │ void sseett__ppeeeerr__ccllaassss__ffiilltteerr (ip_filter const& f); │ │ │ │ │ void sseett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr (peer_class_type_filter const& f); │ │ │ │ │ peer_class_type_filter ggeett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr () const; │ │ │ │ │ peer_class_t ccrreeaattee__ppeeeerr__ccllaassss (char const* name); │ │ │ │ │ void ddeelleettee__ppeeeerr__ccllaassss (peer_class_t cid); │ │ │ │ │ - void sseett__ppeeeerr__ccllaassss (peer_class_t cid, peer_class_info const& pci); │ │ │ │ │ peer_class_info ggeett__ppeeeerr__ccllaassss (peer_class_t cid) const; │ │ │ │ │ + void sseett__ppeeeerr__ccllaassss (peer_class_t cid, peer_class_info const& pci); │ │ │ │ │ void rreemmoovvee__ttoorrrreenntt (const torrent_handle&, remove_flags_t = {}); │ │ │ │ │ void aappppllyy__sseettttiinnggss (settings_pack const&); │ │ │ │ │ - settings_pack ggeett__sseettttiinnggss () const; │ │ │ │ │ void aappppllyy__sseettttiinnggss (settings_pack&&); │ │ │ │ │ + settings_pack ggeett__sseettttiinnggss () const; │ │ │ │ │ + alert* wwaaiitt__ffoorr__aalleerrtt (time_duration max_wait); │ │ │ │ │ void sseett__aalleerrtt__nnoottiiffyy (std::function const& fun); │ │ │ │ │ void ppoopp__aalleerrttss (std::vector* alerts); │ │ │ │ │ - alert* wwaaiitt__ffoorr__aalleerrtt (time_duration max_wait); │ │ │ │ │ - void ddeelleettee__ppoorrtt__mmaappppiinngg (port_mapping_t handle); │ │ │ │ │ std::vector aadddd__ppoorrtt__mmaappppiinngg (portmap_protocol t, int │ │ │ │ │ external_port, int local_port); │ │ │ │ │ + void ddeelleettee__ppoorrtt__mmaappppiinngg (port_mapping_t handle); │ │ │ │ │ void rreeooppeenn__nneettwwoorrkk__ssoocckkeettss (reopen_network_flags_t options = │ │ │ │ │ reopen_map_ports); │ │ │ │ │ std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ │ │ │ │ │ static constexpr save_state_flags_t ssaavvee__sseettttiinnggss = 0_bit; │ │ │ │ │ static constexpr save_state_flags_t ssaavvee__ddhhtt__ssttaattee = 2_bit; │ │ │ │ │ static constexpr save_state_flags_t ssaavvee__eexxtteennssiioonn__ssttaattee = 11_bit; │ │ │ │ │ @@ -334,19 +270,19 @@ │ │ │ │ │ returns the current _s_e_s_s_i_o_n state. This can be passed to _w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ to save the state to disk and restored using _r_e_a_d___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) when │ │ │ │ │ constructing a new _s_e_s_s_i_o_n. The kind of state that's included is all settings, │ │ │ │ │ the DHT routing table, possibly plugin-specific state. the flags parameter can │ │ │ │ │ be used to only save certain parts of the _s_e_s_s_i_o_n state │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** rreeffrreesshh__ttoorrrreenntt__ssttaattuuss(()) ggeett__ttoorrrreenntt__ssttaattuuss(()) ********** │ │ │ │ │ -void rreeffrreesshh__ttoorrrreenntt__ssttaattuuss (std::vector* ret │ │ │ │ │ - , status_flags_t flags = {}) const; │ │ │ │ │ std::vector ggeett__ttoorrrreenntt__ssttaattuuss ( │ │ │ │ │ std::function const& pred │ │ │ │ │ , status_flags_t flags = {}) const; │ │ │ │ │ +void rreeffrreesshh__ttoorrrreenntt__ssttaattuuss (std::vector* ret │ │ │ │ │ + , status_flags_t flags = {}) const; │ │ │ │ │ Note │ │ │ │ │ these calls are potentially expensive and won't scale well with lots of │ │ │ │ │ torrents. If you're concerned about performance, consider using │ │ │ │ │ post_torrent_updates() instead. │ │ │ │ │ get_torrent_status returns a vector of the _t_o_r_r_e_n_t___s_t_a_t_u_s for every torrent │ │ │ │ │ which satisfies pred, which is a predicate function which determines if a │ │ │ │ │ torrent should be included in the returned set or not. Returning true means it │ │ │ │ │ @@ -391,37 +327,37 @@ │ │ │ │ │ For more information, see the _s_e_s_s_i_o_n_ _s_t_a_t_i_s_t_i_c_s section. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ppoosstt__ddhhtt__ssttaattss(()) ********** │ │ │ │ │ void ppoosstt__ddhhtt__ssttaattss (); │ │ │ │ │ This will cause a _d_h_t___s_t_a_t_s___a_l_e_r_t to be posted. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** sseett__ddhhtt__ssttaattee(()) ********** │ │ │ │ │ -void sseett__ddhhtt__ssttaattee (dht::dht_state&& st); │ │ │ │ │ void sseett__ddhhtt__ssttaattee (dht::dht_state const& st); │ │ │ │ │ +void sseett__ddhhtt__ssttaattee (dht::dht_state&& st); │ │ │ │ │ set the DHT state for the _s_e_s_s_i_o_n. This will be taken into account the next │ │ │ │ │ time the DHT is started, as if it had been passed in via the _s_e_s_s_i_o_n___p_a_r_a_m_s on │ │ │ │ │ startup. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ffiinndd__ttoorrrreenntt(()) ggeett__ttoorrrreennttss(()) ********** │ │ │ │ │ -std::vector ggeett__ttoorrrreennttss () const; │ │ │ │ │ torrent_handle ffiinndd__ttoorrrreenntt (sha1_hash const& info_hash) const; │ │ │ │ │ +std::vector ggeett__ttoorrrreennttss () const; │ │ │ │ │ find_torrent() looks for a torrent with the given info-hash. In case there is │ │ │ │ │ such a torrent in the _s_e_s_s_i_o_n, a _t_o_r_r_e_n_t___h_a_n_d_l_e to that torrent is returned. In │ │ │ │ │ case the torrent cannot be found, an invalid _t_o_r_r_e_n_t___h_a_n_d_l_e 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 _s_e_s_s_i_o_n. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aassyynncc__aadddd__ttoorrrreenntt(()) aadddd__ttoorrrreenntt(()) ********** │ │ │ │ │ +********** aadddd__ttoorrrreenntt(()) aassyynncc__aadddd__ttoorrrreenntt(()) ********** │ │ │ │ │ torrent_handle aadddd__ttoorrrreenntt (add_torrent_params const& params); │ │ │ │ │ +void aassyynncc__aadddd__ttoorrrreenntt (add_torrent_params const& params); │ │ │ │ │ torrent_handle aadddd__ttoorrrreenntt (add_torrent_params&& params, error_code& ec); │ │ │ │ │ -torrent_handle aadddd__ttoorrrreenntt (add_torrent_params const& params, error_code& ec); │ │ │ │ │ torrent_handle aadddd__ttoorrrreenntt (add_torrent_params&& params); │ │ │ │ │ -void aassyynncc__aadddd__ttoorrrreenntt (add_torrent_params const& params); │ │ │ │ │ void aassyynncc__aadddd__ttoorrrreenntt (add_torrent_params&& params); │ │ │ │ │ +torrent_handle aadddd__ttoorrrreenntt (add_torrent_params const& params, error_code& ec); │ │ │ │ │ You add torrents through the _a_d_d___t_o_r_r_e_n_t_(_) function where you give an object │ │ │ │ │ with all the parameters. The _a_d_d___t_o_r_r_e_n_t_(_) overloads will block until the │ │ │ │ │ torrent has been added (or failed to be added) and returns an error code and a │ │ │ │ │ _t_o_r_r_e_n_t___h_a_n_d_l_e. In order to add torrents more efficiently, consider using │ │ │ │ │ _a_s_y_n_c___a_d_d___t_o_r_r_e_n_t_(_) which returns immediately, without waiting for the torrent │ │ │ │ │ to add. Notification of the torrent being added is sent as _a_d_d___t_o_r_r_e_n_t___a_l_e_r_t. │ │ │ │ │ The save_path field in _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s must be set to a valid path where the │ │ │ │ │ @@ -442,17 +378,17 @@ │ │ │ │ │ torrent_flags::paused and torrent_flags::auto_managed. In order to add a magnet │ │ │ │ │ link that will just download the metadata, but no payload, set the │ │ │ │ │ torrent_flags::upload_mode flag. │ │ │ │ │ Special consideration has to be taken when adding hybrid torrents (i.e. │ │ │ │ │ torrents that are BitTorrent v2 torrents that are backwards compatible with │ │ │ │ │ v1). For more details, see _B_i_t_T_o_r_r_e_n_t_ _v_2_ _t_o_r_r_e_n_t_s. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** iiss__ppaauusseedd(()) ppaauussee(()) rreessuummee(()) ********** │ │ │ │ │ -void rreessuummee (); │ │ │ │ │ +********** ppaauussee(()) iiss__ppaauusseedd(()) rreessuummee(()) ********** │ │ │ │ │ void ppaauussee (); │ │ │ │ │ +void rreessuummee (); │ │ │ │ │ bool iiss__ppaauusseedd () const; │ │ │ │ │ Pausing the _s_e_s_s_i_o_n has the same effect as pausing every torrent in it, except │ │ │ │ │ that torrents will not be resumed by the auto-manage mechanism. Resuming will │ │ │ │ │ restore the torrents to their previous paused state. i.e. the _s_e_s_s_i_o_n pause │ │ │ │ │ state is separate from the torrent pause state. A torrent is inactive if it is │ │ │ │ │ paused or if the _s_e_s_s_i_o_n is paused. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ @@ -529,15 +465,15 @@ │ │ │ │ │ and make the function entirely self-contained. The only reason data blob's │ │ │ │ │ value is computed via a function instead of just passing in the new value is to │ │ │ │ │ avoid race conditions. If you want to uuppddaattee the value in the DHT, you must │ │ │ │ │ first retrieve it, then modify it, then write it back. The way the DHT works, │ │ │ │ │ it is natural to always do a lookup before storing and calling the callback in │ │ │ │ │ between is convenient. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddhhtt__aannnnoouunnccee(()) ddhhtt__ggeett__ppeeeerrss(()) ********** │ │ │ │ │ +********** ddhhtt__ggeett__ppeeeerrss(()) ddhhtt__aannnnoouunnccee(()) ********** │ │ │ │ │ void ddhhtt__ggeett__ppeeeerrss (sha1_hash const& info_hash); │ │ │ │ │ void ddhhtt__aannnnoouunnccee (sha1_hash const& info_hash, int port = 0, dht:: │ │ │ │ │ announce_flags_t flags = {}); │ │ │ │ │ dht_get_peers() will issue a DHT get_peer request to the DHT for the specified │ │ │ │ │ info-hash. The response (the peers) will be posted back in a │ │ │ │ │ _d_h_t___g_e_t___p_e_e_r_s___r_e_p_l_y___a_l_e_r_t. │ │ │ │ │ dht_announce() will issue a DHT announce request to the DHT to the specified │ │ │ │ │ @@ -572,17 +508,17 @@ │ │ │ │ │ Send an arbitrary DHT request directly to the specified endpoint. This function │ │ │ │ │ is intended for use by plugins. When a response is received or the request │ │ │ │ │ times out, a _d_h_t___d_i_r_e_c_t___r_e_s_p_o_n_s_e___a_l_e_r_t will be posted with the response (if │ │ │ │ │ any) and the userdata pointer passed in here. Since this _a_l_e_r_t is a response to │ │ │ │ │ an explicit call, it will always be posted, regardless of the _a_l_e_r_t mask. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** aadddd__eexxtteennssiioonn(()) ********** │ │ │ │ │ +void aadddd__eexxtteennssiioonn (std::shared_ptr ext); │ │ │ │ │ void aadddd__eexxtteennssiioonn (std::function( │ │ │ │ │ torrent_handle const&, client_data_t)> ext); │ │ │ │ │ -void aadddd__eexxtteennssiioonn (std::shared_ptr ext); │ │ │ │ │ This function adds an extension to this _s_e_s_s_i_o_n. The argument is a function │ │ │ │ │ object that is called with a torrent_handle and which should return a std:: │ │ │ │ │ shared_ptr. To write custom plugins, see _l_i_b_t_o_r_r_e_n_t_ _p_l_u_g_i_n_s. │ │ │ │ │ For the typical bittorrent client all of these extensions should be added. The │ │ │ │ │ main plugins implemented in libtorrent are: │ │ │ │ │ uTorrent metadata │ │ │ │ │ Allows peers to download the metadata (.torrent files) from the swarm │ │ │ │ │ @@ -598,16 +534,16 @@ │ │ │ │ │ A _p_l_u_g_i_n that, with a small overhead, can ban peers that sends bad data │ │ │ │ │ with very high accuracy. Should eliminate most problems on poisoned │ │ │ │ │ torrents. │ │ │ │ │ #include │ │ │ │ │ ses.add_extension(<::create_smart_ban_plugin); │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ggeett__iipp__ffiilltteerr(()) sseett__iipp__ffiilltteerr(()) ********** │ │ │ │ │ -void sseett__iipp__ffiilltteerr (ip_filter f); │ │ │ │ │ ip_filter ggeett__iipp__ffiilltteerr () const; │ │ │ │ │ +void sseett__iipp__ffiilltteerr (ip_filter f); │ │ │ │ │ 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 _i_p___f_i_l_t_e_r. │ │ │ │ │ Each time a peer is blocked because of the IP filter, a _p_e_e_r___b_l_o_c_k_e_d___a_l_e_r_t is │ │ │ │ │ generated. get_ip_filter() Returns the _i_p___f_i_l_t_e_r currently in the _s_e_s_s_i_o_n. See │ │ │ │ │ _i_p___f_i_l_t_e_r. │ │ │ │ │ @@ -616,17 +552,17 @@ │ │ │ │ │ void sseett__ppoorrtt__ffiilltteerr (port_filter const& f); │ │ │ │ │ apply _p_o_r_t___f_i_l_t_e_r f to incoming and outgoing peers. a port filter will reject │ │ │ │ │ making outgoing peer connections to certain remote ports. The main intention is │ │ │ │ │ to be able to avoid triggering certain anti-virus software by connecting to │ │ │ │ │ SMTP, FTP ports. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ssssll__lliisstteenn__ppoorrtt(()) iiss__lliisstteenniinngg(()) lliisstteenn__ppoorrtt(()) ********** │ │ │ │ │ -unsigned short lliisstteenn__ppoorrtt () const; │ │ │ │ │ -bool iiss__lliisstteenniinngg () const; │ │ │ │ │ unsigned short ssssll__lliisstteenn__ppoorrtt () const; │ │ │ │ │ +bool iiss__lliisstteenniinngg () const; │ │ │ │ │ +unsigned short lliisstteenn__ppoorrtt () const; │ │ │ │ │ is_listening() will tell you whether or not the _s_e_s_s_i_o_n has successfully opened │ │ │ │ │ a listening port. If it hasn't, this function will return false, and then you │ │ │ │ │ can set a new _s_e_t_t_i_n_g_s___p_a_c_k_:_:_l_i_s_t_e_n___i_n_t_e_r_f_a_c_e_s to try another interface and │ │ │ │ │ port to bind to. │ │ │ │ │ listen_port() returns the port we ended up listening on. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** sseett__ppeeeerr__ccllaassss__ffiilltteerr(()) ggeett__ppeeeerr__ccllaassss__ffiilltteerr(()) ********** │ │ │ │ │ @@ -652,15 +588,15 @@ │ │ │ │ │ in the IP range mapping. Only the set bits matter; no peer class will be │ │ │ │ │ removed from a peer as a result of this call, peer classes are only added. │ │ │ │ │ The peer_class argument cannot be greater than 31. The bitmasks representing │ │ │ │ │ peer classes in the peer_class_filter are 32 bits. │ │ │ │ │ The get_peer_class_filter() function returns the current filter. │ │ │ │ │ For more information, see _p_e_e_r_ _c_l_a_s_s_e_s. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr(()) ggeett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr(()) ********** │ │ │ │ │ +********** ggeett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr(()) sseett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr(()) ********** │ │ │ │ │ void sseett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr (peer_class_type_filter const& f); │ │ │ │ │ peer_class_type_filter ggeett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr () const; │ │ │ │ │ Sets and gets the ppeeeerr ccllaassss ttyyppee ffiilltteerr. This is controls automatic peer class │ │ │ │ │ assignments to peers based on what kind of socket it is. │ │ │ │ │ It does not only support assigning peer classes, it also supports removing peer │ │ │ │ │ classes based on socket type. │ │ │ │ │ The order of these rules being applied are: │ │ │ │ │ @@ -690,17 +626,17 @@ │ │ │ │ │ Since peer classes are reference counted, this function will not remove the │ │ │ │ │ peer class if it's still assigned to torrents or peers. It will however remove │ │ │ │ │ it once the last peer and torrent drops their references to it. │ │ │ │ │ There is no need to call this function for custom peer classes. All peer │ │ │ │ │ classes will be properly destructed when the _s_e_s_s_i_o_n object destructs. │ │ │ │ │ For more information on peer classes, see _p_e_e_r_ _c_l_a_s_s_e_s. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__ppeeeerr__ccllaassss(()) ggeett__ppeeeerr__ccllaassss(()) ********** │ │ │ │ │ -void sseett__ppeeeerr__ccllaassss (peer_class_t cid, peer_class_info const& pci); │ │ │ │ │ +********** ggeett__ppeeeerr__ccllaassss(()) sseett__ppeeeerr__ccllaassss(()) ********** │ │ │ │ │ peer_class_info ggeett__ppeeeerr__ccllaassss (peer_class_t cid) const; │ │ │ │ │ +void sseett__ppeeeerr__ccllaassss (peer_class_t cid, peer_class_info const& pci); │ │ │ │ │ These functions queries information from a peer class and updates the │ │ │ │ │ configuration of a peer class, respectively. │ │ │ │ │ cid must refer to an existing peer class. If it does not, the return value of │ │ │ │ │ get_peer_class() is undefined. │ │ │ │ │ set_peer_class() sets all the information in the _p_e_e_r___c_l_a_s_s___i_n_f_o object in the │ │ │ │ │ specified peer class. There is no option to only update a single property. │ │ │ │ │ A peer or torrent belonging to more than one class, the highest priority among │ │ │ │ │ @@ -730,26 +666,26 @@ │ │ │ │ │ session.remove_handle(handle); handle.save_resume_data(); │ │ │ │ │ Note that when a queued or downloading torrent is removed, its position in the │ │ │ │ │ download queue is vacated and every subsequent torrent in the queue has their │ │ │ │ │ queue positions updated. This can potentially cause a large state_update to be │ │ │ │ │ posted. When removing all torrents, it is advised to remove them from the back │ │ │ │ │ of the queue, to minimize the shifting. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ggeett__sseettttiinnggss(()) aappppllyy__sseettttiinnggss(()) ********** │ │ │ │ │ +********** aappppllyy__sseettttiinnggss(()) ggeett__sseettttiinnggss(()) ********** │ │ │ │ │ void aappppllyy__sseettttiinnggss (settings_pack const&); │ │ │ │ │ -settings_pack ggeett__sseettttiinnggss () const; │ │ │ │ │ void aappppllyy__sseettttiinnggss (settings_pack&&); │ │ │ │ │ +settings_pack ggeett__sseettttiinnggss () const; │ │ │ │ │ Applies the settings specified by the _s_e_t_t_i_n_g_s___p_a_c_k s. This is an asynchronous │ │ │ │ │ operation that will return immediately and actually apply the settings to the │ │ │ │ │ main thread of libtorrent some time later. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppoopp__aalleerrttss(()) sseett__aalleerrtt__nnoottiiffyy(()) wwaaiitt__ffoorr__aalleerrtt(()) ********** │ │ │ │ │ +********** wwaaiitt__ffoorr__aalleerrtt(()) ppoopp__aalleerrttss(()) sseett__aalleerrtt__nnoottiiffyy(()) ********** │ │ │ │ │ +alert* wwaaiitt__ffoorr__aalleerrtt (time_duration max_wait); │ │ │ │ │ void sseett__aalleerrtt__nnoottiiffyy (std::function const& fun); │ │ │ │ │ void ppoopp__aalleerrttss (std::vector* alerts); │ │ │ │ │ -alert* wwaaiitt__ffoorr__aalleerrtt (time_duration max_wait); │ │ │ │ │ Alerts is the main mechanism for libtorrent to report errors and events. │ │ │ │ │ pop_alerts fills in the vector passed to it with pointers to new alerts. The │ │ │ │ │ _s_e_s_s_i_o_n still owns these alerts and they will stay valid until the next time │ │ │ │ │ pop_alerts is called. You may not delete the _a_l_e_r_t objects. │ │ │ │ │ It is safe to call pop_alerts from multiple different threads, as long as the │ │ │ │ │ alerts themselves are not accessed once another thread calls pop_alerts. Doing │ │ │ │ │ this requires manual synchronization between the popping threads. │ │ │ │ │ @@ -789,17 +725,17 @@ │ │ │ │ │ block. It should not perform any expensive work. It really should just notify │ │ │ │ │ the main application thread. │ │ │ │ │ The type of an _a_l_e_r_t is returned by the polymorphic function alert::type() but │ │ │ │ │ can also be queries from a concrete type via T::alert_type, as a static │ │ │ │ │ constant. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ddeelleettee__ppoorrtt__mmaappppiinngg(()) aadddd__ppoorrtt__mmaappppiinngg(()) ********** │ │ │ │ │ -void ddeelleettee__ppoorrtt__mmaappppiinngg (port_mapping_t handle); │ │ │ │ │ std::vector aadddd__ppoorrtt__mmaappppiinngg (portmap_protocol t, int │ │ │ │ │ external_port, int local_port); │ │ │ │ │ +void ddeelleettee__ppoorrtt__mmaappppiinngg (port_mapping_t handle); │ │ │ │ │ add_port_mapping adds one or more port forwards on UPnP and/or NAT-PMP, │ │ │ │ │ whichever is enabled. A mapping is created for each listen socket in the │ │ │ │ │ _s_e_s_s_i_o_n. The return values are all handles referring to the port mappings that │ │ │ │ │ were just created. Pass them to _d_e_l_e_t_e___p_o_r_t___m_a_p_p_i_n_g_(_) to remove them. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** rreeooppeenn__nneettwwoorrkk__ssoocckkeettss(()) ********** │ │ │ │ │ void rreeooppeenn__nneettwwoorrkk__ssoocckkeettss (reopen_network_flags_t options = │ │ │ │ │ @@ -845,25 +781,89 @@ │ │ │ │ │ protocols used by _a_d_d___p_o_r_t___m_a_p_p_i_n_g_(_) │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ reopen_map_ports │ │ │ │ │ This option indicates if the ports are mapped using natpmp and upnp. If │ │ │ │ │ mapping was already made, they are deleted and added again. This only │ │ │ │ │ works if natpmp and/or upnp are configured to be enable. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ sseessssiioonn__ppaarraammss ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n___p_a_r_a_m_s_._h_p_p" │ │ │ │ │ +The _s_e_s_s_i_o_n___p_a_r_a_m_s is a parameters pack for configuring the _s_e_s_s_i_o_n before it's │ │ │ │ │ +started. │ │ │ │ │ +struct session_params │ │ │ │ │ +{ │ │ │ │ │ + sseessssiioonn__ppaarraammss (settings_pack&& sp); │ │ │ │ │ + sseessssiioonn__ppaarraammss (settings_pack const& sp); │ │ │ │ │ + sseessssiioonn__ppaarraammss (); │ │ │ │ │ + sseessssiioonn__ppaarraammss (settings_pack const& sp │ │ │ │ │ + , std::vector> exts); │ │ │ │ │ + sseessssiioonn__ppaarraammss (settings_pack&& sp │ │ │ │ │ + , std::vector> exts); │ │ │ │ │ + │ │ │ │ │ + settings_pack settings; │ │ │ │ │ + std::vector> extensions; │ │ │ │ │ + dht::dht_state dht_state; │ │ │ │ │ + dht::dht_storage_constructor_type dht_storage_constructor; │ │ │ │ │ + disk_io_constructor_type disk_io_constructor; │ │ │ │ │ + std::map ext_state; │ │ │ │ │ + libtorrent::ip_filter ip_filter; │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** sseessssiioonn__ppaarraammss(()) ********** │ │ │ │ │ +sseessssiioonn__ppaarraammss (settings_pack&& sp); │ │ │ │ │ +sseessssiioonn__ppaarraammss (settings_pack const& sp); │ │ │ │ │ +sseessssiioonn__ppaarraammss (); │ │ │ │ │ +This constructor can be used to start with the default plugins (ut_metadata, │ │ │ │ │ +ut_pex and smart_ban). Pass a _s_e_t_t_i_n_g_s___p_a_c_k to set the initial settings when │ │ │ │ │ +the _s_e_s_s_i_o_n starts. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** sseessssiioonn__ppaarraammss(()) ********** │ │ │ │ │ +sseessssiioonn__ppaarraammss (settings_pack const& sp │ │ │ │ │ + , std::vector> exts); │ │ │ │ │ +sseessssiioonn__ppaarraammss (settings_pack&& sp │ │ │ │ │ + , std::vector> exts); │ │ │ │ │ +This constructor helps to configure the set of initial plugins to be added to │ │ │ │ │ +the _s_e_s_s_i_o_n before it's started. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + settings │ │ │ │ │ + The settings to configure the _s_e_s_s_i_o_n with │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + extensions │ │ │ │ │ + the plugins to add to the _s_e_s_s_i_o_n as it is constructed │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + dht_state │ │ │ │ │ + DHT node ID and node addresses to bootstrap the DHT with. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + dht_storage_constructor │ │ │ │ │ + function object to construct the storage object for DHT items. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + disk_io_constructor │ │ │ │ │ + function object to create the disk I/O subsystem. Defaults to │ │ │ │ │ + default_disk_io_constructor. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + ext_state │ │ │ │ │ + this container can be used by extensions/plugins to store settings. It's │ │ │ │ │ + primarily here to make it convenient to save and restore state across │ │ │ │ │ + sessions, using _r_e_a_d___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) and _w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s_(_). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + ip_filter │ │ │ │ │ + the IP filter to use for the _s_e_s_s_i_o_n. This restricts which peers are │ │ │ │ │ + allowed to connect. As if passed to _s_e_t___i_p___f_i_l_t_e_r_(_). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ wwrriittee__sseessssiioonn__ppaarraammss__bbuuff(()) wwrriittee__sseessssiioonn__ppaarraammss(()) rreeaadd__sseessssiioonn__ppaarraammss(()) │ │ │ │ │ ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n___p_a_r_a_m_s_._h_p_p" │ │ │ │ │ -session_params rreeaadd__sseessssiioonn__ppaarraammss (span buf │ │ │ │ │ - , save_state_flags_t flags = save_state_flags_t::all()); │ │ │ │ │ -std::vector wwrriittee__sseessssiioonn__ppaarraammss__bbuuff (session_params const& sp │ │ │ │ │ - , save_state_flags_t flags = save_state_flags_t::all()); │ │ │ │ │ entry wwrriittee__sseessssiioonn__ppaarraammss (session_params const& sp │ │ │ │ │ , save_state_flags_t flags = save_state_flags_t::all()); │ │ │ │ │ session_params rreeaadd__sseessssiioonn__ppaarraammss (bdecode_node const& e │ │ │ │ │ , save_state_flags_t flags = save_state_flags_t::all()); │ │ │ │ │ +session_params rreeaadd__sseessssiioonn__ppaarraammss (span buf │ │ │ │ │ + , save_state_flags_t flags = save_state_flags_t::all()); │ │ │ │ │ +std::vector wwrriittee__sseessssiioonn__ppaarraammss__bbuuff (session_params const& sp │ │ │ │ │ + , save_state_flags_t flags = save_state_flags_t::all()); │ │ │ │ │ These functions serialize and de-serialize a session_params object to and from │ │ │ │ │ bencoded form. The _s_e_s_s_i_o_n___p_a_r_a_m_s object is used to initialize a new _s_e_s_s_i_o_n │ │ │ │ │ using the state from a previous one (or by programmatically configure the │ │ │ │ │ _s_e_s_s_i_o_n up-front). The flags parameter can be used to only save and load │ │ │ │ │ certain aspects of the session's state. The _buf suffix indicates the function │ │ │ │ │ operates on buffer rather than the bencoded structure. The torrents in a │ │ │ │ │ _s_e_s_s_i_o_n are not part of the _s_e_s_s_i_o_n___p_a_r_a_m_s state, they have to be restored │ │ │ ├── ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Settings.html │ │ │ │ @@ -29,35 +29,35 @@ │ │ │ │ │ │ │ │ │ │ │ │

    home

    │ │ │ │
    │ │ │ │

    Table of contents

    │ │ │ │ │ │ │ │
    │ │ │ │

    You have some control over session configuration through the session::apply_settings() │ │ │ │ member function. To change one or more configuration options, create a settings_pack │ │ │ │ object and fill it with the settings to be set and pass it in to session::apply_settings().

    │ │ │ │

    The settings_pack object is a collection of settings updates that are applied │ │ │ │ to the session when passed to session::apply_settings(). It's empty when │ │ │ │ @@ -4598,24 +4598,24 @@ │ │ │ │

    │ │ │ │
    │ │ │ │  struct settings_pack final : settings_interface
    │ │ │ │  {
    │ │ │ │     friend  void apply_pack_impl (settings_pack const*
    │ │ │ │        , aux::session_settings_single_thread&
    │ │ │ │        , std::vector<void(aux::session_impl::*)()>*);
    │ │ │ │ -   void set_str (int name, std::string val) override;
    │ │ │ │ +   void set_bool (int name, bool val) override;
    │ │ │ │     void set_int (int name, flags::bitfield_flag<Type, Tag> const val);
    │ │ │ │     void set_int (int name, int val) override;
    │ │ │ │ -   void set_bool (int name, bool val) override;
    │ │ │ │ +   void set_str (int name, std::string val) override;
    │ │ │ │     bool has_val (int name) const override;
    │ │ │ │     void clear ();
    │ │ │ │     void clear (int name);
    │ │ │ │ +   std::string const& get_str (int name) const override;
    │ │ │ │     int get_int (int name) const override;
    │ │ │ │     bool get_bool (int name) const override;
    │ │ │ │ -   std::string const& get_str (int name) const override;
    │ │ │ │     void for_each (Fun&& f) const;
    │ │ │ │  
    │ │ │ │     enum type_bases
    │ │ │ │     {
    │ │ │ │        string_type_base,
    │ │ │ │        int_type_base,
    │ │ │ │        bool_type_base,
    │ │ │ │ @@ -4685,23 +4685,23 @@
    │ │ │ │        socks5,
    │ │ │ │        socks5_pw,
    │ │ │ │        http,
    │ │ │ │        http_pw,
    │ │ │ │     };
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ - │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -

    set_int() set_bool() set_str()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    set_bool() set_int() set_str()

    │ │ │ │
    │ │ │ │ -void set_str (int name, std::string val) override;
    │ │ │ │ +void set_bool (int name, bool val) override;
    │ │ │ │  void set_int (int name, flags::bitfield_flag<Type, Tag> const val);
    │ │ │ │  void set_int (int name, int val) override;
    │ │ │ │ -void set_bool (int name, bool val) override;
    │ │ │ │ +void set_str (int name, std::string val) override;
    │ │ │ │  
    │ │ │ │

    set a configuration option in the settings_pack. name is one of │ │ │ │ the enum values from string_types, int_types or bool_types. They must │ │ │ │ match the respective type of the set_* function.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    has_val()

    │ │ │ │ @@ -4721,23 +4721,23 @@ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    clear()

    │ │ │ │
    │ │ │ │  void clear (int name);
    │ │ │ │  
    │ │ │ │

    clear a specific setting from the pack

    │ │ │ │ - │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    get_int() get_str() get_bool()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    get_str() get_int() get_bool()

    │ │ │ │
    │ │ │ │ +std::string const& get_str (int name) const override;
    │ │ │ │  int get_int (int name) const override;
    │ │ │ │  bool get_bool (int name) const override;
    │ │ │ │ -std::string const& get_str (int name) const override;
    │ │ │ │  
    │ │ │ │

    queries the current configuration option from the settings_pack. │ │ │ │ name is one of the enumeration values from string_types, int_types │ │ │ │ or bool_types. The enum value must match the type of the get_* │ │ │ │ function. If the specified setting field has not been set, the default │ │ │ │ value is returned.

    │ │ │ │ [report issue]
    │ │ │ │ @@ -5126,14 +5126,33 @@ │ │ │ │ pieces, instead of reading it all into memory before hashing.

    │ │ │ │

    This configuration is intended to be the starting point for embedded │ │ │ │ devices. It will significantly reduce memory usage.

    │ │ │ │

    high_performance_seed returns settings optimized for a seed box, │ │ │ │ serving many peers and that doesn't do any downloading. It has a 128 MB │ │ │ │ disk cache and has a limit of 400 files in its file pool. It support fast │ │ │ │ upload rates by allowing large send buffers.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    setting_by_name() name_for_setting()

    │ │ │ │ +

    Declared in "libtorrent/settings_pack.hpp"

    │ │ │ │ +
    │ │ │ │ +char const* name_for_setting (int s);
    │ │ │ │ +int setting_by_name (string_view name);
    │ │ │ │ +
    │ │ │ │ +

    converts a setting integer (from the enums string_types, int_types or │ │ │ │ +bool_types) to a string, and vice versa.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    default_settings()

    │ │ │ │ +

    Declared in "libtorrent/settings_pack.hpp"

    │ │ │ │ +
    │ │ │ │ +settings_pack default_settings ();
    │ │ │ │ +
    │ │ │ │ +

    returns a settings_pack with every setting set to its default value

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    generate_fingerprint()

    │ │ │ │

    Declared in "libtorrent/fingerprint.hpp"

    │ │ │ │
    │ │ │ │  std::string generate_fingerprint (std::string name
    │ │ │ │     , int major, int minor = 0, int revision = 0, int tag = 0);
    │ │ │ │ @@ -5183,33 +5202,14 @@
    │ │ │ │  Tribler
    │ │ │ │  
    │ │ │ │  
    │ │ │ │  
    │ │ │ │  

    There's an informal directory of client id's here.

    │ │ │ │

    The major, minor, revision and tag parameters are used to │ │ │ │ identify the version of your client.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    name_for_setting() setting_by_name()

    │ │ │ │ -

    Declared in "libtorrent/settings_pack.hpp"

    │ │ │ │ -
    │ │ │ │ -char const* name_for_setting (int s);
    │ │ │ │ -int setting_by_name (string_view name);
    │ │ │ │ -
    │ │ │ │ -

    converts a setting integer (from the enums string_types, int_types or │ │ │ │ -bool_types) to a string, and vice versa.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    default_settings()

    │ │ │ │ -

    Declared in "libtorrent/settings_pack.hpp"

    │ │ │ │ -
    │ │ │ │ -settings_pack default_settings ();
    │ │ │ │ -
    │ │ │ │ -

    returns a settings_pack with every setting set to its default value

    │ │ │ │
    │ │ │ │ │ │ │ │
    │ │ │ │
    │ │ │ │
    │ │ │ │
    │ │ │ │ │ │ │ │ +
    │ │ │ │ +

    mmap_disk_io_constructor()

    │ │ │ │ +

    Declared in "libtorrent/mmap_disk_io.hpp"

    │ │ │ │ +
    │ │ │ │ +std::unique_ptr<disk_interface> mmap_disk_io_constructor (
    │ │ │ │ +   io_context& ios, settings_interface const&, counters& cnt);
    │ │ │ │ +
    │ │ │ │ +

    constructs a memory mapped file disk I/O object.

    │ │ │ │ +[report issue]
    │ │ │ │
    │ │ │ │

    default_disk_io_constructor()

    │ │ │ │

    Declared in "libtorrent/session.hpp"

    │ │ │ │
    │ │ │ │  std::unique_ptr<disk_interface> default_disk_io_constructor (
    │ │ │ │     io_context& ios, settings_interface const&, counters& cnt);
    │ │ │ │  
    │ │ │ │

    the constructor function for the default storage. On systems that support │ │ │ │ memory mapped files (and a 64 bit address space) the memory mapped storage │ │ │ │ will be constructed, otherwise the portable posix storage.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    posix_disk_io_constructor()

    │ │ │ │ -

    Declared in "libtorrent/posix_disk_io.hpp"

    │ │ │ │ -
    │ │ │ │ -std::unique_ptr<disk_interface> posix_disk_io_constructor (
    │ │ │ │ -   io_context& ios, settings_interface const&, counters& cnt);
    │ │ │ │ -
    │ │ │ │ -

    this is a simple posix disk I/O back-end, used for systems that don't │ │ │ │ -have a 64 bit virtual address space or don't support memory mapped files. │ │ │ │ -It's implemented using portable C file functions and is single-threaded.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    disabled_disk_io_constructor()

    │ │ │ │

    Declared in "libtorrent/disabled_disk_io.hpp"

    │ │ │ │
    │ │ │ │  std::unique_ptr<disk_interface> disabled_disk_io_constructor (
    │ │ │ │     io_context& ios, settings_interface const&, counters& cnt);
    │ │ │ │  
    │ │ │ │

    creates a disk io object that discards all data written to it, and only │ │ │ │ returns zero-buffers when read from. May be useful for testing and │ │ │ │ benchmarking.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    mmap_disk_io_constructor()

    │ │ │ │ -

    Declared in "libtorrent/mmap_disk_io.hpp"

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    posix_disk_io_constructor()

    │ │ │ │ +

    Declared in "libtorrent/posix_disk_io.hpp"

    │ │ │ │
    │ │ │ │ -std::unique_ptr<disk_interface> mmap_disk_io_constructor (
    │ │ │ │ +std::unique_ptr<disk_interface> posix_disk_io_constructor (
    │ │ │ │     io_context& ios, settings_interface const&, counters& cnt);
    │ │ │ │  
    │ │ │ │ -

    constructs a memory mapped file disk I/O object.

    │ │ │ │ +

    this is a simple posix disk I/O back-end, used for systems that don't │ │ │ │ +have a 64 bit virtual address space or don't support memory mapped files. │ │ │ │ +It's implemented using portable C file functions and is single-threaded.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    enum storage_mode_t

    │ │ │ │

    Declared in "libtorrent/storage_defs.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ├── html2text {} │ │ │ │ │ @@ -24,31 +24,31 @@ │ │ │ │ │ o _p_i_e_c_e___s_i_z_e_(_) │ │ │ │ │ o _p_i_e_c_e___s_i_z_e_2_(_) │ │ │ │ │ o _b_l_o_c_k_s___i_n___p_i_e_c_e_2_(_) │ │ │ │ │ o _b_l_o_c_k_s___p_e_r___p_i_e_c_e_(_) │ │ │ │ │ o _s_e_t___n_a_m_e_(_)_ _n_a_m_e_(_) │ │ │ │ │ o _s_w_a_p_(_) │ │ │ │ │ o _c_a_n_o_n_i_c_a_l_i_z_e_(_) │ │ │ │ │ - o _f_i_l_e___p_a_t_h_(_)_ _s_y_m_l_i_n_k_(_)_ _h_a_s_h_(_)_ _f_i_l_e___n_a_m_e_(_)_ _r_o_o_t_(_)_ _r_o_o_t___p_t_r_(_) │ │ │ │ │ - _f_i_l_e___s_i_z_e_(_)_ _p_a_d___f_i_l_e___a_t_(_)_ _m_t_i_m_e_(_)_ _f_i_l_e___o_f_f_s_e_t_(_) │ │ │ │ │ - o _f_i_l_e___p_i_e_c_e___r_a_n_g_e_(_)_ _f_i_l_e___n_u_m___p_i_e_c_e_s_(_)_ _f_i_l_e___n_u_m___b_l_o_c_k_s_(_) │ │ │ │ │ + o _p_a_d___f_i_l_e___a_t_(_)_ _h_a_s_h_(_)_ _m_t_i_m_e_(_)_ _r_o_o_t___p_t_r_(_)_ _f_i_l_e___p_a_t_h_(_)_ _s_y_m_l_i_n_k_(_) │ │ │ │ │ + _f_i_l_e___o_f_f_s_e_t_(_)_ _f_i_l_e___n_a_m_e_(_)_ _r_o_o_t_(_)_ _f_i_l_e___s_i_z_e_(_) │ │ │ │ │ + o _f_i_l_e___n_u_m___b_l_o_c_k_s_(_)_ _f_i_l_e___n_u_m___p_i_e_c_e_s_(_)_ _f_i_l_e___p_i_e_c_e___r_a_n_g_e_(_) │ │ │ │ │ o _f_i_l_e___f_i_r_s_t___p_i_e_c_e___n_o_d_e_(_)_ _f_i_l_e___f_i_r_s_t___b_l_o_c_k___n_o_d_e_(_) │ │ │ │ │ o _f_i_l_e___p_a_t_h___h_a_s_h_(_) │ │ │ │ │ o _a_l_l___p_a_t_h___h_a_s_h_e_s_(_) │ │ │ │ │ o _f_i_l_e___f_l_a_g_s_(_) │ │ │ │ │ o _f_i_l_e___a_b_s_o_l_u_t_e___p_a_t_h_(_) │ │ │ │ │ o _f_i_l_e___i_n_d_e_x___a_t___p_i_e_c_e_(_)_ _f_i_l_e___i_n_d_e_x___a_t___o_f_f_s_e_t_(_) │ │ │ │ │ o _f_i_l_e___i_n_d_e_x___f_o_r___r_o_o_t_(_) │ │ │ │ │ o _p_i_e_c_e___i_n_d_e_x___a_t___f_i_l_e_(_) │ │ │ │ │ o _s_a_n_i_t_i_z_e___s_y_m_l_i_n_k_s_(_) │ │ │ │ │ o _v_2_(_) │ │ │ │ │ + * _m_m_a_p___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ * _d_e_f_a_u_l_t___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ - * _p_o_s_i_x___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ * _d_i_s_a_b_l_e_d___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ - * _m_m_a_p___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ + * _p_o_s_i_x___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ * _e_n_u_m_ _s_t_o_r_a_g_e___m_o_d_e___t │ │ │ │ │ * _e_n_u_m_ _s_t_a_t_u_s___t │ │ │ │ │ * _e_n_u_m_ _m_o_v_e___f_l_a_g_s___t │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ssttoorraaggee__ppaarraammss ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_t_o_r_a_g_e___d_e_f_s_._h_p_p" │ │ │ │ │ a parameter pack used to construct the storage for a torrent, used in │ │ │ │ │ @@ -96,68 +96,68 @@ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_f_i_l_e___s_t_o_r_a_g_e_._h_p_p" │ │ │ │ │ The file_storage class represents a file list and the piece size. Everything │ │ │ │ │ necessary to interpret a regular bittorrent storage file structure. │ │ │ │ │ class file_storage │ │ │ │ │ { │ │ │ │ │ bool iiss__vvaalliidd () const; │ │ │ │ │ void rreesseerrvvee (int num_files); │ │ │ │ │ - void aadddd__ffiillee__bboorrrrooww (error_code& ec, string_view filename │ │ │ │ │ - , std::string const& path, std::int64_t file_size │ │ │ │ │ - , file_flags_t file_flags = {}, char const* filehash = nullptr │ │ │ │ │ - , std::int64_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ + void aadddd__ffiillee (std::string const& path, std::int64_t file_size │ │ │ │ │ + , file_flags_t file_flags = {} │ │ │ │ │ + , std::time_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ , char const* root_hash = nullptr); │ │ │ │ │ void aadddd__ffiillee__bboorrrrooww (string_view filename │ │ │ │ │ , std::string const& path, std::int64_t file_size │ │ │ │ │ , file_flags_t file_flags = {}, char const* filehash = nullptr │ │ │ │ │ , std::int64_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ , char const* root_hash = nullptr); │ │ │ │ │ void aadddd__ffiillee (error_code& ec, std::string const& path, std::int64_t │ │ │ │ │ file_size │ │ │ │ │ , file_flags_t file_flags = {} │ │ │ │ │ , std::time_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ , char const* root_hash = nullptr); │ │ │ │ │ - void aadddd__ffiillee (std::string const& path, std::int64_t file_size │ │ │ │ │ - , file_flags_t file_flags = {} │ │ │ │ │ - , std::time_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ + void aadddd__ffiillee__bboorrrrooww (error_code& ec, string_view filename │ │ │ │ │ + , std::string const& path, std::int64_t file_size │ │ │ │ │ + , file_flags_t file_flags = {}, char const* filehash = nullptr │ │ │ │ │ + , std::int64_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ , char const* root_hash = nullptr); │ │ │ │ │ void rreennaammee__ffiillee (file_index_t index, std::string const& new_filename); │ │ │ │ │ std::vector mmaapp__bblloocckk (piece_index_t piece, std::int64_t offset │ │ │ │ │ , std::int64_t size) const; │ │ │ │ │ peer_request mmaapp__ffiillee (file_index_t file, std::int64_t offset, int size) │ │ │ │ │ const; │ │ │ │ │ int nnuumm__ffiilleess () const noexcept; │ │ │ │ │ file_index_t eenndd__ffiillee () const noexcept; │ │ │ │ │ index_range ffiillee__rraannggee () const noexcept; │ │ │ │ │ std::int64_t ttoottaall__ssiizzee () const; │ │ │ │ │ - void sseett__nnuumm__ppiieecceess (int n); │ │ │ │ │ int nnuumm__ppiieecceess () const; │ │ │ │ │ + void sseett__nnuumm__ppiieecceess (int n); │ │ │ │ │ piece_index_t eenndd__ppiieeccee () const; │ │ │ │ │ piece_index_t llaasstt__ppiieeccee () const; │ │ │ │ │ index_range ppiieeccee__rraannggee () const noexcept; │ │ │ │ │ int ppiieeccee__lleennggtthh () const; │ │ │ │ │ void sseett__ppiieeccee__lleennggtthh (int l); │ │ │ │ │ int ppiieeccee__ssiizzee (piece_index_t index) const; │ │ │ │ │ int ppiieeccee__ssiizzee22 (piece_index_t index) const; │ │ │ │ │ int bblloocckkss__iinn__ppiieeccee22 (piece_index_t index) const; │ │ │ │ │ int bblloocckkss__ppeerr__ppiieeccee () const; │ │ │ │ │ void sseett__nnaammee (std::string const& n); │ │ │ │ │ std::string const& nnaammee () const; │ │ │ │ │ void sswwaapp (file_storage& ti) noexcept; │ │ │ │ │ void ccaannoonniiccaalliizzee (); │ │ │ │ │ + sha256_hash rroooott (file_index_t index) const; │ │ │ │ │ sha1_hash hhaasshh (file_index_t index) const; │ │ │ │ │ - char const* rroooott__ppttrr (file_index_t const index) const; │ │ │ │ │ + std::int64_t ffiillee__ooffffsseett (file_index_t index) const; │ │ │ │ │ + std::time_t mmttiimmee (file_index_t index) const; │ │ │ │ │ std::int64_t ffiillee__ssiizzee (file_index_t index) const; │ │ │ │ │ - string_view ffiillee__nnaammee (file_index_t index) const; │ │ │ │ │ - bool ppaadd__ffiillee__aatt (file_index_t index) const; │ │ │ │ │ - std::string ssyymmlliinnkk (file_index_t index) const; │ │ │ │ │ + char const* rroooott__ppttrr (file_index_t const index) const; │ │ │ │ │ std::string ffiillee__ppaatthh (file_index_t index, std::string const& save_path = │ │ │ │ │ "") const; │ │ │ │ │ - std::time_t mmttiimmee (file_index_t index) const; │ │ │ │ │ - std::int64_t ffiillee__ooffffsseett (file_index_t index) const; │ │ │ │ │ - sha256_hash rroooott (file_index_t index) const; │ │ │ │ │ + std::string ssyymmlliinnkk (file_index_t index) const; │ │ │ │ │ + bool ppaadd__ffiillee__aatt (file_index_t index) const; │ │ │ │ │ + string_view ffiillee__nnaammee (file_index_t index) const; │ │ │ │ │ index_range ffiillee__ppiieeccee__rraannggee (file_index_t) const; │ │ │ │ │ int ffiillee__nnuumm__ppiieecceess (file_index_t index) const; │ │ │ │ │ int ffiillee__nnuumm__bblloocckkss (file_index_t index) const; │ │ │ │ │ int ffiillee__ffiirrsstt__bblloocckk__nnooddee (file_index_t index) const; │ │ │ │ │ int ffiillee__ffiirrsstt__ppiieeccee__nnooddee (file_index_t index) const; │ │ │ │ │ std::uint32_t ffiillee__ppaatthh__hhaasshh (file_index_t index, std::string const& │ │ │ │ │ save_path) const; │ │ │ │ │ @@ -186,31 +186,31 @@ │ │ │ │ │ ********** rreesseerrvvee(()) ********** │ │ │ │ │ void rreesseerrvvee (int num_files); │ │ │ │ │ allocates space for num_files in the internal file list. This can be used to │ │ │ │ │ avoid reallocating the internal file list when the number of files to be added │ │ │ │ │ is known up-front. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** aadddd__ffiillee__bboorrrrooww(()) aadddd__ffiillee(()) ********** │ │ │ │ │ -void aadddd__ffiillee__bboorrrrooww (error_code& ec, string_view filename │ │ │ │ │ - , std::string const& path, std::int64_t file_size │ │ │ │ │ - , file_flags_t file_flags = {}, char const* filehash = nullptr │ │ │ │ │ - , std::int64_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ +void aadddd__ffiillee (std::string const& path, std::int64_t file_size │ │ │ │ │ + , file_flags_t file_flags = {} │ │ │ │ │ + , std::time_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ , char const* root_hash = nullptr); │ │ │ │ │ void aadddd__ffiillee__bboorrrrooww (string_view filename │ │ │ │ │ , std::string const& path, std::int64_t file_size │ │ │ │ │ , file_flags_t file_flags = {}, char const* filehash = nullptr │ │ │ │ │ , std::int64_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ , char const* root_hash = nullptr); │ │ │ │ │ void aadddd__ffiillee (error_code& ec, std::string const& path, std::int64_t file_size │ │ │ │ │ , file_flags_t file_flags = {} │ │ │ │ │ , std::time_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ , char const* root_hash = nullptr); │ │ │ │ │ -void aadddd__ffiillee (std::string const& path, std::int64_t file_size │ │ │ │ │ - , file_flags_t file_flags = {} │ │ │ │ │ - , std::time_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ +void aadddd__ffiillee__bboorrrrooww (error_code& ec, string_view filename │ │ │ │ │ + , std::string const& path, std::int64_t file_size │ │ │ │ │ + , file_flags_t file_flags = {}, char const* filehash = nullptr │ │ │ │ │ + , std::int64_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ , char const* root_hash = nullptr); │ │ │ │ │ Adds a file to the file storage. The add_file_borrow version expects that │ │ │ │ │ filename is the file name (without a path) of the file that's being added. This │ │ │ │ │ memory is bboorrrroowweedd, i.e. it is the caller's responsibility to make sure it │ │ │ │ │ stays valid throughout the lifetime of this _f_i_l_e___s_t_o_r_a_g_e object or any copy of │ │ │ │ │ it. The same thing applies to filehash, which is an optional pointer to a 20 │ │ │ │ │ byte binary SHA-1 hash of the file. │ │ │ │ │ @@ -281,16 +281,16 @@ │ │ │ │ │ _f_i_l_e___s_t_o_r_a_g_e. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ttoottaall__ssiizzee(()) ********** │ │ │ │ │ std::int64_t ttoottaall__ssiizzee () const; │ │ │ │ │ returns the total number of bytes all the files in this torrent spans │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** nnuumm__ppiieecceess(()) sseett__nnuumm__ppiieecceess(()) ********** │ │ │ │ │ -void sseett__nnuumm__ppiieecceess (int n); │ │ │ │ │ int nnuumm__ppiieecceess () const; │ │ │ │ │ +void sseett__nnuumm__ppiieecceess (int n); │ │ │ │ │ set and get the number of pieces in the torrent │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** eenndd__ppiieeccee(()) ********** │ │ │ │ │ piece_index_t eenndd__ppiieeccee () const; │ │ │ │ │ returns the index of the one-past-end piece in the file storage │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** llaasstt__ppiieeccee(()) ********** │ │ │ │ │ @@ -342,27 +342,27 @@ │ │ │ │ │ void sswwaapp (file_storage& ti) noexcept; │ │ │ │ │ swap all content of tthhiiss with ttii. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ccaannoonniiccaalliizzee(()) ********** │ │ │ │ │ void ccaannoonniiccaalliizzee (); │ │ │ │ │ arrange files and padding to match the canonical form required by BEP 52 │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiillee__ppaatthh(()) ssyymmlliinnkk(()) hhaasshh(()) ffiillee__nnaammee(()) rroooott(()) rroooott__ppttrr(()) ffiillee__ssiizzee(()) │ │ │ │ │ -ppaadd__ffiillee__aatt(()) mmttiimmee(()) ffiillee__ooffffsseett(()) ********** │ │ │ │ │ +********** ppaadd__ffiillee__aatt(()) hhaasshh(()) mmttiimmee(()) rroooott__ppttrr(()) ffiillee__ppaatthh(()) ssyymmlliinnkk(()) ffiillee__ooffffsseett │ │ │ │ │ +(()) ffiillee__nnaammee(()) rroooott(()) ffiillee__ssiizzee(()) ********** │ │ │ │ │ +sha256_hash rroooott (file_index_t index) const; │ │ │ │ │ sha1_hash hhaasshh (file_index_t index) const; │ │ │ │ │ -char const* rroooott__ppttrr (file_index_t const index) const; │ │ │ │ │ +std::int64_t ffiillee__ooffffsseett (file_index_t index) const; │ │ │ │ │ +std::time_t mmttiimmee (file_index_t index) const; │ │ │ │ │ std::int64_t ffiillee__ssiizzee (file_index_t index) const; │ │ │ │ │ -string_view ffiillee__nnaammee (file_index_t index) const; │ │ │ │ │ -bool ppaadd__ffiillee__aatt (file_index_t index) const; │ │ │ │ │ -std::string ssyymmlliinnkk (file_index_t index) const; │ │ │ │ │ +char const* rroooott__ppttrr (file_index_t const index) const; │ │ │ │ │ std::string ffiillee__ppaatthh (file_index_t index, std::string const& save_path = "") │ │ │ │ │ const; │ │ │ │ │ -std::time_t mmttiimmee (file_index_t index) const; │ │ │ │ │ -std::int64_t ffiillee__ooffffsseett (file_index_t index) const; │ │ │ │ │ -sha256_hash rroooott (file_index_t index) const; │ │ │ │ │ +std::string ssyymmlliinnkk (file_index_t index) const; │ │ │ │ │ +bool ppaadd__ffiillee__aatt (file_index_t index) const; │ │ │ │ │ +string_view ffiillee__nnaammee (file_index_t index) const; │ │ │ │ │ These functions are used to query attributes of files at a given index. │ │ │ │ │ The hash() is a SHA-1 hash of the file, or 0 if none was provided in the │ │ │ │ │ torrent file. This can potentially be used to join a bittorrent network with │ │ │ │ │ other file sharing networks. │ │ │ │ │ root() returns the SHA-256 merkle tree root of the specified file, in case this │ │ │ │ │ is a v2 torrent. Otherwise returns zeros. root_ptr() returns a pointer to the │ │ │ │ │ SHA-256 merkle tree root hash for the specified file. The pointer points into │ │ │ │ │ @@ -375,15 +375,15 @@ │ │ │ │ │ file_size() returns the size of a file. │ │ │ │ │ pad_file_at() returns true if the file at the given index is a pad-file. │ │ │ │ │ file_name() returns jjuusstt the name of the file, whereas file_path() returns the │ │ │ │ │ path (inside the torrent file) with the filename appended. │ │ │ │ │ file_offset() returns the byte offset within the torrent file where this file │ │ │ │ │ starts. It can be used to map the file to a piece index (given the piece size). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiillee__ppiieeccee__rraannggee(()) ffiillee__nnuumm__ppiieecceess(()) ffiillee__nnuumm__bblloocckkss(()) ********** │ │ │ │ │ +********** ffiillee__nnuumm__bblloocckkss(()) ffiillee__nnuumm__ppiieecceess(()) ffiillee__ppiieeccee__rraannggee(()) ********** │ │ │ │ │ index_range ffiillee__ppiieeccee__rraannggee (file_index_t) const; │ │ │ │ │ int ffiillee__nnuumm__ppiieecceess (file_index_t index) const; │ │ │ │ │ int ffiillee__nnuumm__bblloocckkss (file_index_t index) const; │ │ │ │ │ Returns the number of pieces or blocks the file atindexspans, under the │ │ │ │ │ assumption that the file is aligned to the start of a piece. This is only │ │ │ │ │ meaningful for v2 torrents, where files are guaranteed such alignment. These │ │ │ │ │ numbers are used to size and navigate the merkle hash tree for each file. │ │ │ │ │ @@ -450,42 +450,42 @@ │ │ │ │ │ flag_executable │ │ │ │ │ this file has the executable attribute set. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ flag_symlink │ │ │ │ │ this file is a symbolic link. It should have a link target string │ │ │ │ │ associated with it. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ mmmmaapp__ddiisskk__iioo__ccoonnssttrruuccttoorr(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_m_m_a_p___d_i_s_k___i_o_._h_p_p" │ │ │ │ │ +std::unique_ptr mmmmaapp__ddiisskk__iioo__ccoonnssttrruuccttoorr ( │ │ │ │ │ + io_context& ios, settings_interface const&, counters& cnt); │ │ │ │ │ +constructs a memory mapped file disk I/O object. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ddeeffaauulltt__ddiisskk__iioo__ccoonnssttrruuccttoorr(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n_._h_p_p" │ │ │ │ │ std::unique_ptr ddeeffaauulltt__ddiisskk__iioo__ccoonnssttrruuccttoorr ( │ │ │ │ │ io_context& ios, settings_interface const&, counters& cnt); │ │ │ │ │ the constructor function for the default storage. On systems that support │ │ │ │ │ memory mapped files (and a 64 bit address space) the memory mapped storage will │ │ │ │ │ be constructed, otherwise the portable posix storage. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ppoossiixx__ddiisskk__iioo__ccoonnssttrruuccttoorr(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_o_s_i_x___d_i_s_k___i_o_._h_p_p" │ │ │ │ │ -std::unique_ptr ppoossiixx__ddiisskk__iioo__ccoonnssttrruuccttoorr ( │ │ │ │ │ - io_context& ios, settings_interface const&, counters& cnt); │ │ │ │ │ -this is a simple posix disk I/O back-end, used for systems that don't have a 64 │ │ │ │ │ -bit virtual address space or don't support memory mapped files. It's │ │ │ │ │ -implemented using portable C file functions and is single-threaded. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ddiissaabblleedd__ddiisskk__iioo__ccoonnssttrruuccttoorr(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_a_b_l_e_d___d_i_s_k___i_o_._h_p_p" │ │ │ │ │ std::unique_ptr ddiissaabblleedd__ddiisskk__iioo__ccoonnssttrruuccttoorr ( │ │ │ │ │ io_context& ios, settings_interface const&, counters& cnt); │ │ │ │ │ creates a disk io object that discards all data written to it, and only returns │ │ │ │ │ zero-buffers when read from. May be useful for testing and benchmarking. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ mmmmaapp__ddiisskk__iioo__ccoonnssttrruuccttoorr(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_m_m_a_p___d_i_s_k___i_o_._h_p_p" │ │ │ │ │ -std::unique_ptr mmmmaapp__ddiisskk__iioo__ccoonnssttrruuccttoorr ( │ │ │ │ │ +************ ppoossiixx__ddiisskk__iioo__ccoonnssttrruuccttoorr(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_o_s_i_x___d_i_s_k___i_o_._h_p_p" │ │ │ │ │ +std::unique_ptr ppoossiixx__ddiisskk__iioo__ccoonnssttrruuccttoorr ( │ │ │ │ │ io_context& ios, settings_interface const&, counters& cnt); │ │ │ │ │ -constructs a memory mapped file disk I/O object. │ │ │ │ │ +this is a simple posix disk I/O back-end, used for systems that don't have a 64 │ │ │ │ │ +bit virtual address space or don't support memory mapped files. It's │ │ │ │ │ +implemented using portable C file functions and is single-threaded. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ eennuumm ssttoorraaggee__mmooddee__tt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_t_o_r_a_g_e___d_e_f_s_._h_p_p" │ │ │ │ │ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ |_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ | | |All pieces will be written to their final | │ │ │ │ │ | | |position, all files will be allocated in full | │ │ │ ├── ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Torrent_Handle.html │ │ │ │ @@ -41,50 +41,50 @@ │ │ │ │
  • torrent_handle │ │ │ │
  • │ │ │ │
  • hash_value()
  • │ │ │ │ @@ -254,119 +254,119 @@ │ │ │ │ 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 system_error │ │ │ │ exception, in case the handle is no longer referring to a torrent. │ │ │ │ -There is one exception is_valid() will never throw. Since the torrents │ │ │ │ +There is one exception 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.

    │ │ │ │
    │ │ │ │
    │ │ │ │  struct torrent_handle
    │ │ │ │  {
    │ │ │ │     friend std::size_t hash_value (torrent_handle const& th);
    │ │ │ │     torrent_handle () noexcept = default;
    │ │ │ │     void add_piece (piece_index_t piece, char const* data, add_piece_flags_t flags = {}) const;
    │ │ │ │     void add_piece (piece_index_t piece, std::vector<char> data, add_piece_flags_t flags = {}) const;
    │ │ │ │     void read_piece (piece_index_t piece) const;
    │ │ │ │     bool have_piece (piece_index_t piece) const;
    │ │ │ │     void post_peer_info () const;
    │ │ │ │     void get_peer_info (std::vector<peer_info>& v) const;
    │ │ │ │ -   void post_status (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │     torrent_status status (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │ -   std::vector<partial_piece_info> get_download_queue () const;
    │ │ │ │ +   void post_status (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │     void get_download_queue (std::vector<partial_piece_info>& queue) const;
    │ │ │ │     void post_download_queue () const;
    │ │ │ │ +   std::vector<partial_piece_info> get_download_queue () const;
    │ │ │ │     void clear_piece_deadlines () const;
    │ │ │ │     void reset_piece_deadline (piece_index_t index) const;
    │ │ │ │     void set_piece_deadline (piece_index_t index, int deadline, deadline_flags_t flags = {}) const;
    │ │ │ │     void file_progress (std::vector<std::int64_t>& progress, file_progress_flags_t flags = {}) const;
    │ │ │ │     std::vector<std::int64_t> file_progress (file_progress_flags_t flags = {}) const;
    │ │ │ │     void post_file_progress (file_progress_flags_t flags) const;
    │ │ │ │     std::vector<open_file_state> file_status () const;
    │ │ │ │     void clear_error () const;
    │ │ │ │ -   void post_trackers () const;
    │ │ │ │ -   void replace_trackers (std::vector<announce_entry> const&) const;
    │ │ │ │ -   std::vector<announce_entry> trackers () const;
    │ │ │ │     void add_tracker (announce_entry const&) const;
    │ │ │ │ +   std::vector<announce_entry> trackers () const;
    │ │ │ │ +   void replace_trackers (std::vector<announce_entry> const&) const;
    │ │ │ │ +   void post_trackers () const;
    │ │ │ │ +   std::set<std::string> url_seeds () const;
    │ │ │ │     void add_url_seed (std::string const& url) const;
    │ │ │ │     void remove_url_seed (std::string const& url) const;
    │ │ │ │ -   std::set<std::string> url_seeds () const;
    │ │ │ │     void add_http_seed (std::string const& url) const;
    │ │ │ │ -   std::set<std::string> http_seeds () const;
    │ │ │ │     void remove_http_seed (std::string const& url) const;
    │ │ │ │ +   std::set<std::string> http_seeds () const;
    │ │ │ │     void add_extension (
    │ │ │ │        std::function<std::shared_ptr<torrent_plugin>(torrent_handle const&, client_data_t)> const& ext
    │ │ │ │        , client_data_t userdata = client_data_t{});
    │ │ │ │     bool set_metadata (span<char const> metadata) const;
    │ │ │ │     bool is_valid () const;
    │ │ │ │     void pause (pause_flags_t flags = {}) const;
    │ │ │ │     void resume () const;
    │ │ │ │ +   void set_flags (torrent_flags_t flags) const;
    │ │ │ │ +   torrent_flags_t flags () const;
    │ │ │ │     void set_flags (torrent_flags_t flags, torrent_flags_t mask) const;
    │ │ │ │     void unset_flags (torrent_flags_t flags) const;
    │ │ │ │ -   torrent_flags_t flags () const;
    │ │ │ │ -   void set_flags (torrent_flags_t flags) const;
    │ │ │ │     void flush_cache () const;
    │ │ │ │     void force_recheck () const;
    │ │ │ │     void save_resume_data (resume_data_flags_t flags = {}) const;
    │ │ │ │ -   bool need_save_resume_data (resume_data_flags_t flags) const;
    │ │ │ │     bool need_save_resume_data () const;
    │ │ │ │ -   queue_position_t queue_position () const;
    │ │ │ │ +   bool need_save_resume_data (resume_data_flags_t flags) const;
    │ │ │ │ +   void queue_position_down () const;
    │ │ │ │     void queue_position_up () const;
    │ │ │ │ -   void queue_position_bottom () const;
    │ │ │ │     void queue_position_top () const;
    │ │ │ │ -   void queue_position_down () const;
    │ │ │ │ +   queue_position_t queue_position () const;
    │ │ │ │ +   void queue_position_bottom () const;
    │ │ │ │     void queue_position_set (queue_position_t p) const;
    │ │ │ │ -   void set_ssl_certificate_buffer (std::string const& certificate
    │ │ │ │ -      , std::string const& private_key
    │ │ │ │ -      , std::string const& dh_params);
    │ │ │ │     void set_ssl_certificate (std::string const& certificate
    │ │ │ │        , std::string const& private_key
    │ │ │ │        , std::string const& dh_params
    │ │ │ │        , std::string const& passphrase = "");
    │ │ │ │ +   void set_ssl_certificate_buffer (std::string const& certificate
    │ │ │ │ +      , std::string const& private_key
    │ │ │ │ +      , std::string const& dh_params);
    │ │ │ │     std::shared_ptr<const torrent_info> torrent_file () const;
    │ │ │ │     std::shared_ptr<torrent_info> torrent_file_with_hashes () const;
    │ │ │ │     std::vector<std::vector<sha256_hash>> piece_layers () const;
    │ │ │ │     void piece_availability (std::vector<int>& avail) const;
    │ │ │ │     void post_piece_availability () const;
    │ │ │ │     void prioritize_pieces (std::vector<download_priority_t> const& pieces) const;
    │ │ │ │ -   std::vector<download_priority_t> get_piece_priorities () const;
    │ │ │ │     void piece_priority (piece_index_t index, download_priority_t priority) const;
    │ │ │ │ -   void prioritize_pieces (std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces) const;
    │ │ │ │ +   std::vector<download_priority_t> get_piece_priorities () const;
    │ │ │ │     download_priority_t piece_priority (piece_index_t index) const;
    │ │ │ │ -   std::vector<download_priority_t> get_file_priorities () const;
    │ │ │ │ +   void prioritize_pieces (std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces) const;
    │ │ │ │     download_priority_t file_priority (file_index_t index) const;
    │ │ │ │ +   std::vector<download_priority_t> get_file_priorities () const;
    │ │ │ │     void prioritize_files (std::vector<download_priority_t> const& files) const;
    │ │ │ │     void file_priority (file_index_t index, download_priority_t priority) const;
    │ │ │ │ -   void force_lsd_announce () const;
    │ │ │ │ -   void force_dht_announce () const;
    │ │ │ │     void force_reannounce (int seconds = 0, int idx = -1, reannounce_flags_t = {}) const;
    │ │ │ │ +   void force_dht_announce () const;
    │ │ │ │ +   void force_lsd_announce () const;
    │ │ │ │     void scrape_tracker (int idx = -1) const;
    │ │ │ │ -   int download_limit () const;
    │ │ │ │ +   int upload_limit () const;
    │ │ │ │     void set_upload_limit (int limit) const;
    │ │ │ │     void set_download_limit (int limit) const;
    │ │ │ │ -   int upload_limit () const;
    │ │ │ │ +   int download_limit () const;
    │ │ │ │     void connect_peer (tcp::endpoint const& adr, peer_source_flags_t source = {}
    │ │ │ │        , pex_flags_t flags = pex_encryption | pex_utp | pex_holepunch) const;
    │ │ │ │     void clear_peers ();
    │ │ │ │     void set_max_uploads (int max_uploads) const;
    │ │ │ │     int max_uploads () const;
    │ │ │ │ -   void set_max_connections (int max_connections) const;
    │ │ │ │     int max_connections () const;
    │ │ │ │ +   void set_max_connections (int max_connections) const;
    │ │ │ │     void move_storage (std::string const& save_path
    │ │ │ │        , move_flags_t flags = move_flags_t::always_replace_files
    │ │ │ │        ) const;
    │ │ │ │     void rename_file (file_index_t index, std::string const& new_name) const;
    │ │ │ │     info_hash_t info_hashes () const;
    │ │ │ │     sha1_hash info_hash () const;
    │ │ │ │ -   bool operator!= (const torrent_handle& h) const;
    │ │ │ │ -   bool operator== (const torrent_handle& h) const;
    │ │ │ │     bool operator< (const torrent_handle& h) const;
    │ │ │ │ +   bool operator== (const torrent_handle& h) const;
    │ │ │ │ +   bool operator!= (const torrent_handle& h) const;
    │ │ │ │     std::uint32_t id () const;
    │ │ │ │     std::shared_ptr<torrent> native_handle () const;
    │ │ │ │     client_data_t userdata () const;
    │ │ │ │     bool in_session () const;
    │ │ │ │  
    │ │ │ │     static constexpr add_piece_flags_t overwrite_existing  = 0_bit;
    │ │ │ │     static constexpr status_flags_t query_distributed_copies  = 0_bit;
    │ │ │ │ @@ -393,15 +393,15 @@
    │ │ │ │  
    │ │ │ │ [report issue]
    │ │ │ │

    torrent_handle()

    │ │ │ │
    │ │ │ │  torrent_handle () noexcept = default;
    │ │ │ │  
    │ │ │ │

    constructs a torrent handle that does not refer to a torrent. │ │ │ │ -i.e. is_valid() will return false.

    │ │ │ │ +i.e. is_valid() will return false.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    add_piece()

    │ │ │ │
    │ │ │ │  void add_piece (piece_index_t piece, char const* data, add_piece_flags_t flags = {}) const;
    │ │ │ │  void add_piece (piece_index_t piece, std::vector<char> data, add_piece_flags_t flags = {}) const;
    │ │ │ │  
    │ │ │ │ @@ -467,16 +467,16 @@ │ │ │ │ the vector contains information about that particular peer. See │ │ │ │ peer_info.

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    status() post_status()

    │ │ │ │
    │ │ │ │ -void post_status (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │  torrent_status status (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │ +void post_status (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │  
    │ │ │ │

    status() will return a structure with information about the status │ │ │ │ of this torrent. If the torrent_handle is invalid, it will throw │ │ │ │ system_error exception. See torrent_status. The flags │ │ │ │ argument filters what information is returned in the torrent_status. │ │ │ │ Some information in there is relatively expensive to calculate, and if │ │ │ │ you're not interested in it (and see performance issues), you can │ │ │ │ @@ -486,22 +486,22 @@ │ │ │ │ instead call post_status(). It will trigger posting of a │ │ │ │ state_update_alert with a single torrent_status object for this │ │ │ │ torrent.

    │ │ │ │

    In order to get regular updates for torrents whose status changes, │ │ │ │ consider calling session::post_torrent_updates()`` instead.

    │ │ │ │

    By default everything is included. The flags you can use to decide │ │ │ │ what to include are defined in this class.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    post_download_queue() get_download_queue()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    get_download_queue() post_download_queue()

    │ │ │ │
    │ │ │ │ -std::vector<partial_piece_info> get_download_queue () const;
    │ │ │ │  void get_download_queue (std::vector<partial_piece_info>& queue) const;
    │ │ │ │  void post_download_queue () const;
    │ │ │ │ +std::vector<partial_piece_info> get_download_queue () const;
    │ │ │ │  
    │ │ │ │

    post_download_queue() triggers a download_queue_alert to be │ │ │ │ posted. │ │ │ │ get_download_queue() is a synchronous call and returns a vector │ │ │ │ with information about pieces that are partially downloaded or not │ │ │ │ downloaded but partially requested. See partial_piece_info for the │ │ │ │ fields in the returned vector.

    │ │ │ │ @@ -528,18 +528,18 @@ │ │ │ │

    deadline is the number of milliseconds until this piece should be │ │ │ │ completed.

    │ │ │ │

    reset_piece_deadline removes the deadline from the piece. If it │ │ │ │ hasn't already been downloaded, it will no longer be considered a │ │ │ │ priority.

    │ │ │ │

    clear_piece_deadlines() removes deadlines on all pieces in │ │ │ │ the torrent. As if reset_piece_deadline() was called on all pieces.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    post_file_progress() file_progress()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    file_progress() post_file_progress()

    │ │ │ │
    │ │ │ │  void file_progress (std::vector<std::int64_t>& progress, file_progress_flags_t flags = {}) const;
    │ │ │ │  std::vector<std::int64_t> file_progress (file_progress_flags_t flags = {}) const;
    │ │ │ │  void post_file_progress (file_progress_flags_t flags) const;
    │ │ │ │  
    │ │ │ │

    This function fills in the supplied vector, or returns a vector, with │ │ │ │ the number of bytes downloaded of each file in this torrent. The │ │ │ │ @@ -572,25 +572,25 @@ │ │ │ │

    │ │ │ │

    clear_error()

    │ │ │ │
    │ │ │ │  void clear_error () const;
    │ │ │ │  
    │ │ │ │

    If the torrent is in an error state (i.e. torrent_status::error is │ │ │ │ non-empty), this will clear the error and start the torrent again.

    │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    replace_trackers() add_tracker() trackers() post_trackers()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    post_trackers() trackers() replace_trackers() add_tracker()

    │ │ │ │
    │ │ │ │ -void post_trackers () const;
    │ │ │ │ -void replace_trackers (std::vector<announce_entry> const&) const;
    │ │ │ │ -std::vector<announce_entry> trackers () const;
    │ │ │ │  void add_tracker (announce_entry const&) const;
    │ │ │ │ +std::vector<announce_entry> trackers () const;
    │ │ │ │ +void replace_trackers (std::vector<announce_entry> const&) const;
    │ │ │ │ +void post_trackers () const;
    │ │ │ │  
    │ │ │ │

    trackers() returns 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 │ │ │ │ @@ -603,41 +603,41 @@ │ │ │ │ set. If it is, it doesn't do anything. If it's not in the current set │ │ │ │ of trackers, it will insert it in the tier specified in the │ │ │ │ announce_entry.

    │ │ │ │

    The updated set of trackers will be saved in the resume data, and when │ │ │ │ a torrent is started with resume data, the trackers from the resume │ │ │ │ data will replace the original ones.

    │ │ │ │ │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    url_seeds() add_url_seed() remove_url_seed()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    url_seeds() remove_url_seed() add_url_seed()

    │ │ │ │
    │ │ │ │ +std::set<std::string> url_seeds () const;
    │ │ │ │  void add_url_seed (std::string const& url) const;
    │ │ │ │  void remove_url_seed (std::string const& url) const;
    │ │ │ │ -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.

    │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    add_http_seed() http_seeds() remove_http_seed()

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    remove_http_seed() add_http_seed() http_seeds()

    │ │ │ │
    │ │ │ │  void add_http_seed (std::string const& url) const;
    │ │ │ │ -std::set<std::string> http_seeds () const;
    │ │ │ │  void remove_http_seed (std::string const& url) const;
    │ │ │ │ +std::set<std::string> http_seeds () const;
    │ │ │ │  
    │ │ │ │

    These functions are identical as the *_url_seed() variants, but │ │ │ │ they operate on BEP 17 web seeds instead of BEP 19.

    │ │ │ │

    See http seeding for more information.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    add_extension()

    │ │ │ │ @@ -673,17 +673,17 @@ │ │ │ │

    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 │ │ │ │ removed from the session AND destructed.

    │ │ │ │

    To tell if the torrent_handle is in the session, use │ │ │ │ torrent_handle::in_session(). This will return true before │ │ │ │ session_handle::remove_torrent() is called, and false │ │ │ │ afterward.

    │ │ │ │ -

    Clients should only use is_valid() to determine if the result of │ │ │ │ +

    Clients should only use is_valid() to determine if the result of │ │ │ │ session::find_torrent() was successful.

    │ │ │ │ -

    Unlike other member functions which return a value, is_valid() │ │ │ │ +

    Unlike other member functions which return a value, is_valid() │ │ │ │ completes immediately, without blocking on a result from the │ │ │ │ network thread. Also unlike other functions, it never throws │ │ │ │ the system_error exception.

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    pause() resume()

    │ │ │ │ @@ -704,24 +704,24 @@ │ │ │ │
    │ │ │ │

    Note

    │ │ │ │

    Torrents that are auto-managed may be automatically resumed again. It │ │ │ │ does not make sense to pause an auto-managed torrent without making it │ │ │ │ not auto-managed first. Torrents are auto-managed by default when added │ │ │ │ to the session. For more information, see queuing.

    │ │ │ │
    │ │ │ │ - │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    flags() unset_flags() set_flags()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    unset_flags() flags() set_flags()

    │ │ │ │
    │ │ │ │ +void set_flags (torrent_flags_t flags) const;
    │ │ │ │ +torrent_flags_t flags () const;
    │ │ │ │  void set_flags (torrent_flags_t flags, torrent_flags_t mask) const;
    │ │ │ │  void unset_flags (torrent_flags_t flags) const;
    │ │ │ │ -torrent_flags_t flags () const;
    │ │ │ │ -void set_flags (torrent_flags_t flags) const;
    │ │ │ │  
    │ │ │ │

    sets and gets the torrent state flags. See torrent_flags_t. │ │ │ │ The set_flags overload that take a mask will affect all │ │ │ │ flags part of the mask, and set their values to what the │ │ │ │ flags argument is set to. This allows clearing and │ │ │ │ setting flags in a single function call. │ │ │ │ The set_flags overload that just takes flags, sets all │ │ │ │ @@ -780,15 +780,15 @@ │ │ │ │

  • No torrent state has changed since the last saving of resume │ │ │ │ data, and the only_if_modified flag is set. │ │ │ │ metadata (see libtorrent's metadata from peers extension)
  • │ │ │ │ │ │ │ │ │ │ │ │

    Note that some counters may be outdated by the time you receive the fast resume data

    │ │ │ │

    When saving resume data because of shutting down, make sure not to │ │ │ │ -remove_torrent() before you receive the save_resume_data_alert. │ │ │ │ +remove_torrent() before you receive the save_resume_data_alert. │ │ │ │ There's no need to pause the session or torrent when saving resume │ │ │ │ data.

    │ │ │ │

    The paused state of a torrent is saved in the resume data, so pausing │ │ │ │ all torrents before saving resume data will all torrents be restored │ │ │ │ in a paused state.

    │ │ │ │
    │ │ │ │

    Note

    │ │ │ │ @@ -858,16 +858,16 @@ │ │ │ │ report that they don't need to save resume data again, and skipped by │ │ │ │ the initial loop, and thwart the counter otherwise.

    │ │ │ │
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    need_save_resume_data()

    │ │ │ │
    │ │ │ │ -bool need_save_resume_data (resume_data_flags_t flags) const;
    │ │ │ │  bool need_save_resume_data () const;
    │ │ │ │ +bool need_save_resume_data (resume_data_flags_t flags) const;
    │ │ │ │  
    │ │ │ │

    This function returns true if anything that is stored in the resume │ │ │ │ data has changed since the last time resume data was saved. │ │ │ │ The overload that takes flags let you ask if specific categories │ │ │ │ of properties have changed. These flags have the same behavior as in │ │ │ │ the save_resume_data() call.

    │ │ │ │

    This is a blocking call. It will wait for a response from │ │ │ │ @@ -877,27 +877,27 @@ │ │ │ │

    │ │ │ │

    Note

    │ │ │ │

    A torrent's resume data is considered saved as soon as the │ │ │ │ save_resume_data_alert is posted. It is important to make sure this │ │ │ │ alert is received and handled in order for this function to be │ │ │ │ meaningful.

    │ │ │ │
    │ │ │ │ - │ │ │ │ - │ │ │ │ │ │ │ │ + │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    queue_position_top() queue_position_bottom() queue_position_up() queue_position() queue_position_down()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    queue_position_up() queue_position_down() queue_position() queue_position_bottom() queue_position_top()

    │ │ │ │
    │ │ │ │ -queue_position_t queue_position () const;
    │ │ │ │ +void queue_position_down () const;
    │ │ │ │  void queue_position_up () const;
    │ │ │ │ -void queue_position_bottom () const;
    │ │ │ │  void queue_position_top () const;
    │ │ │ │ -void queue_position_down () const;
    │ │ │ │ +queue_position_t queue_position () const;
    │ │ │ │ +void queue_position_bottom () const;
    │ │ │ │  
    │ │ │ │

    Every torrent that is added is assigned a queue position exactly one │ │ │ │ greater than the greatest queue position of all existing torrents. │ │ │ │ Torrents that are being seeded have -1 as their queue position, since │ │ │ │ they're no longer in line to be downloaded.

    │ │ │ │

    When a torrent is removed or turns into a seed, all torrents with │ │ │ │ greater queue positions have their positions decreased to fill in the │ │ │ │ @@ -921,21 +921,21 @@ │ │ │ │ of all other torrents remain intact but their numerical queue position │ │ │ │ shifts to make space for this torrent's new position

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    set_ssl_certificate_buffer() set_ssl_certificate()

    │ │ │ │
    │ │ │ │ -void set_ssl_certificate_buffer (std::string const& certificate
    │ │ │ │ -      , std::string const& private_key
    │ │ │ │ -      , std::string const& dh_params);
    │ │ │ │  void set_ssl_certificate (std::string const& certificate
    │ │ │ │        , std::string const& private_key
    │ │ │ │        , std::string const& dh_params
    │ │ │ │        , std::string const& passphrase = "");
    │ │ │ │ +void set_ssl_certificate_buffer (std::string const& certificate
    │ │ │ │ +      , std::string const& private_key
    │ │ │ │ +      , std::string const& dh_params);
    │ │ │ │  
    │ │ │ │

    For SSL torrents, use this to specify a path to a .pem file to use as │ │ │ │ this client's certificate. The certificate must be signed by the │ │ │ │ certificate in the .torrent file to be valid.

    │ │ │ │

    The set_ssl_certificate_buffer() overload takes the actual certificate, │ │ │ │ private key and DH params as strings, rather than paths to files.

    │ │ │ │

    cert is a path to the (signed) certificate in .pem format │ │ │ │ @@ -1015,24 +1015,24 @@ │ │ │ │

    post_piece_availability() will trigger a piece_availability_alert │ │ │ │ to be posted.

    │ │ │ │

    piece_availability() fills the specified std::vector<int> │ │ │ │ with the availability for each piece in this torrent. libtorrent does │ │ │ │ not keep track of availability for seeds, so if the torrent is │ │ │ │ seeding the availability for all pieces is reported as 0.

    │ │ │ │ │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    get_piece_priorities() prioritize_pieces() piece_priority()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    get_piece_priorities() piece_priority() prioritize_pieces()

    │ │ │ │
    │ │ │ │  void prioritize_pieces (std::vector<download_priority_t> const& pieces) const;
    │ │ │ │ -std::vector<download_priority_t> get_piece_priorities () const;
    │ │ │ │  void piece_priority (piece_index_t index, download_priority_t priority) const;
    │ │ │ │ -void prioritize_pieces (std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces) const;
    │ │ │ │ +std::vector<download_priority_t> get_piece_priorities () const;
    │ │ │ │  download_priority_t piece_priority (piece_index_t index) const;
    │ │ │ │ +void prioritize_pieces (std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces) const;
    │ │ │ │  
    │ │ │ │

    These functions are used to set and get the priority of individual │ │ │ │ pieces. By default all pieces have priority 4. 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 │ │ │ │ priority levels. 0 means not to download the piece at all. Otherwise, │ │ │ │ lower priority values means less likely to be picked. Piece priority │ │ │ │ @@ -1054,22 +1054,22 @@ │ │ │ │ Invalid entries, where the piece index or priority is out of range, are │ │ │ │ not allowed.

    │ │ │ │

    get_piece_priorities returns a vector with one element for each piece │ │ │ │ in the torrent. Each element is the current priority of that piece.

    │ │ │ │

    It's possible to cancel the effect of file priorities by setting the │ │ │ │ priorities for the affected pieces. Care has to be taken when mixing │ │ │ │ usage of file- and piece priorities.

    │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    file_priority() get_file_priorities() prioritize_files()

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    prioritize_files() file_priority() get_file_priorities()

    │ │ │ │
    │ │ │ │ -std::vector<download_priority_t> get_file_priorities () const;
    │ │ │ │  download_priority_t file_priority (file_index_t index) const;
    │ │ │ │ +std::vector<download_priority_t> get_file_priorities () const;
    │ │ │ │  void prioritize_files (std::vector<download_priority_t> const& files) const;
    │ │ │ │  void file_priority (file_index_t index, download_priority_t priority) const;
    │ │ │ │  
    │ │ │ │

    index must be in the range [0, number_of_files).

    │ │ │ │

    file_priority() queries or sets the priority of file index.

    │ │ │ │

    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 │ │ │ │ @@ -1094,23 +1094,23 @@ │ │ │ │ file_prio_alert.

    │ │ │ │

    When combining file- and piece priorities, the resume file will record │ │ │ │ both. When loading the resume data, the file priorities will be applied │ │ │ │ first, then the piece priorities.

    │ │ │ │

    Moving data from a file into the part file is currently not │ │ │ │ supported. If a file has its priority set to 0 after it has already │ │ │ │ been created, it will not be moved into the partfile.

    │ │ │ │ - │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    force_reannounce() force_dht_announce() force_lsd_announce()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    force_dht_announce() force_reannounce() force_lsd_announce()

    │ │ │ │
    │ │ │ │ -void force_lsd_announce () const;
    │ │ │ │ -void force_dht_announce () const;
    │ │ │ │  void force_reannounce (int seconds = 0, int idx = -1, reannounce_flags_t = {}) const;
    │ │ │ │ +void force_dht_announce () const;
    │ │ │ │ +void force_lsd_announce () const;
    │ │ │ │  
    │ │ │ │

    force_reannounce() will force this torrent to do another tracker │ │ │ │ request, to receive new peers. The seconds argument specifies how │ │ │ │ many seconds from now to issue the tracker announces.

    │ │ │ │

    If the tracker's min_interval has not passed since the last │ │ │ │ announce, the forced announce will be scheduled to happen immediately │ │ │ │ as the min_interval expires. This is to honor trackers minimum │ │ │ │ @@ -1135,24 +1135,24 @@ │ │ │ │

    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.

    │ │ │ │ │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_download_limit() download_limit() upload_limit() set_upload_limit()

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_download_limit() set_upload_limit() download_limit() upload_limit()

    │ │ │ │
    │ │ │ │ -int download_limit () const;
    │ │ │ │ +int upload_limit () const;
    │ │ │ │  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 │ │ │ │ @@ -1184,18 +1184,18 @@ │ │ │ │

    clear_peers()

    │ │ │ │
    │ │ │ │  void clear_peers ();
    │ │ │ │  
    │ │ │ │

    This will disconnect all peers and clear the peer list for this │ │ │ │ torrent. New peers will have to be acquired before resuming, from │ │ │ │ trackers, DHT or local service discovery, for example.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_max_uploads() max_uploads()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    max_uploads() set_max_uploads()

    │ │ │ │
    │ │ │ │  void set_max_uploads (int max_uploads) const;
    │ │ │ │  int max_uploads () 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. This defaults to infinite. The primary setting controlling │ │ │ │ @@ -1203,16 +1203,16 @@ │ │ │ │ settings_pack.

    │ │ │ │

    max_uploads() returns the current settings.

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    set_max_connections() max_connections()

    │ │ │ │
    │ │ │ │ -void set_max_connections (int max_connections) const;
    │ │ │ │  int max_connections () const;
    │ │ │ │ +void set_max_connections (int max_connections) const;
    │ │ │ │  
    │ │ │ │

    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. There is also a │ │ │ │ global limit of the number of connections, set by │ │ │ │ @@ -1275,37 +1275,37 @@ │ │ │ │

    rename_file()

    │ │ │ │
    │ │ │ │  void rename_file (file_index_t index, std::string const& new_name) const;
    │ │ │ │  
    │ │ │ │

    Renames the file with the given index asynchronously. The rename │ │ │ │ operation is complete when either a file_renamed_alert or │ │ │ │ file_rename_failed_alert is posted.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    info_hash() info_hashes()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    info_hashes() info_hash()

    │ │ │ │
    │ │ │ │  info_hash_t info_hashes () const;
    │ │ │ │  sha1_hash info_hash () const;
    │ │ │ │  
    │ │ │ │

    returns the info-hash(es) of the torrent. If this handle is to a │ │ │ │ torrent that hasn't loaded yet (for instance by being added) by a │ │ │ │ URL, the returned value is undefined. │ │ │ │ The info_hash() returns the SHA-1 info-hash for v1 torrents and a │ │ │ │ truncated hash for v2 torrents. For the full v2 info-hash, use │ │ │ │ info_hashes() instead.

    │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ +[report issue]
    │ │ │ │
    │ │ │ │ -

    operator!=() operator==() operator<()

    │ │ │ │ +

    operator<() operator==() operator!=()

    │ │ │ │
    │ │ │ │ -bool operator!= (const torrent_handle& h) const;
    │ │ │ │ -bool operator== (const torrent_handle& h) const;
    │ │ │ │  bool operator< (const torrent_handle& h) const;
    │ │ │ │ +bool operator== (const torrent_handle& h) const;
    │ │ │ │ +bool operator!= (const torrent_handle& h) const;
    │ │ │ │  
    │ │ │ │

    comparison operators. The order of the torrents is unspecified │ │ │ │ but stable.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    id()

    │ │ │ │
    │ │ │ │ ├── html2text {}
    │ │ │ │ │ @@ -10,52 +10,52 @@
    │ │ │ │ │      * _t_o_r_r_e_n_t___h_a_n_d_l_e
    │ │ │ │ │            o _t_o_r_r_e_n_t___h_a_n_d_l_e_(_)
    │ │ │ │ │            o _a_d_d___p_i_e_c_e_(_)
    │ │ │ │ │            o _r_e_a_d___p_i_e_c_e_(_)
    │ │ │ │ │            o _h_a_v_e___p_i_e_c_e_(_)
    │ │ │ │ │            o _p_o_s_t___p_e_e_r___i_n_f_o_(_)_ _g_e_t___p_e_e_r___i_n_f_o_(_)
    │ │ │ │ │            o _s_t_a_t_u_s_(_)_ _p_o_s_t___s_t_a_t_u_s_(_)
    │ │ │ │ │ -          o _p_o_s_t___d_o_w_n_l_o_a_d___q_u_e_u_e_(_)_ _g_e_t___d_o_w_n_l_o_a_d___q_u_e_u_e_(_)
    │ │ │ │ │ +          o _g_e_t___d_o_w_n_l_o_a_d___q_u_e_u_e_(_)_ _p_o_s_t___d_o_w_n_l_o_a_d___q_u_e_u_e_(_)
    │ │ │ │ │            o _r_e_s_e_t___p_i_e_c_e___d_e_a_d_l_i_n_e_(_)_ _s_e_t___p_i_e_c_e___d_e_a_d_l_i_n_e_(_)_ _c_l_e_a_r___p_i_e_c_e___d_e_a_d_l_i_n_e_s_(_)
    │ │ │ │ │ -          o _p_o_s_t___f_i_l_e___p_r_o_g_r_e_s_s_(_)_ _f_i_l_e___p_r_o_g_r_e_s_s_(_)
    │ │ │ │ │ +          o _f_i_l_e___p_r_o_g_r_e_s_s_(_)_ _p_o_s_t___f_i_l_e___p_r_o_g_r_e_s_s_(_)
    │ │ │ │ │            o _f_i_l_e___s_t_a_t_u_s_(_)
    │ │ │ │ │            o _c_l_e_a_r___e_r_r_o_r_(_)
    │ │ │ │ │ -          o _r_e_p_l_a_c_e___t_r_a_c_k_e_r_s_(_)_ _a_d_d___t_r_a_c_k_e_r_(_)_ _t_r_a_c_k_e_r_s_(_)_ _p_o_s_t___t_r_a_c_k_e_r_s_(_)
    │ │ │ │ │ -          o _u_r_l___s_e_e_d_s_(_)_ _a_d_d___u_r_l___s_e_e_d_(_)_ _r_e_m_o_v_e___u_r_l___s_e_e_d_(_)
    │ │ │ │ │ -          o _a_d_d___h_t_t_p___s_e_e_d_(_)_ _h_t_t_p___s_e_e_d_s_(_)_ _r_e_m_o_v_e___h_t_t_p___s_e_e_d_(_)
    │ │ │ │ │ +          o _p_o_s_t___t_r_a_c_k_e_r_s_(_)_ _t_r_a_c_k_e_r_s_(_)_ _r_e_p_l_a_c_e___t_r_a_c_k_e_r_s_(_)_ _a_d_d___t_r_a_c_k_e_r_(_)
    │ │ │ │ │ +          o _u_r_l___s_e_e_d_s_(_)_ _r_e_m_o_v_e___u_r_l___s_e_e_d_(_)_ _a_d_d___u_r_l___s_e_e_d_(_)
    │ │ │ │ │ +          o _r_e_m_o_v_e___h_t_t_p___s_e_e_d_(_)_ _a_d_d___h_t_t_p___s_e_e_d_(_)_ _h_t_t_p___s_e_e_d_s_(_)
    │ │ │ │ │            o _a_d_d___e_x_t_e_n_s_i_o_n_(_)
    │ │ │ │ │            o _s_e_t___m_e_t_a_d_a_t_a_(_)
    │ │ │ │ │            o _i_s___v_a_l_i_d_(_)
    │ │ │ │ │            o _p_a_u_s_e_(_)_ _r_e_s_u_m_e_(_)
    │ │ │ │ │ -          o _f_l_a_g_s_(_)_ _u_n_s_e_t___f_l_a_g_s_(_)_ _s_e_t___f_l_a_g_s_(_)
    │ │ │ │ │ +          o _u_n_s_e_t___f_l_a_g_s_(_)_ _f_l_a_g_s_(_)_ _s_e_t___f_l_a_g_s_(_)
    │ │ │ │ │            o _f_l_u_s_h___c_a_c_h_e_(_)
    │ │ │ │ │            o _f_o_r_c_e___r_e_c_h_e_c_k_(_)
    │ │ │ │ │            o _s_a_v_e___r_e_s_u_m_e___d_a_t_a_(_)
    │ │ │ │ │            o _n_e_e_d___s_a_v_e___r_e_s_u_m_e___d_a_t_a_(_)
    │ │ │ │ │ -          o _q_u_e_u_e___p_o_s_i_t_i_o_n___t_o_p_(_)_ _q_u_e_u_e___p_o_s_i_t_i_o_n___b_o_t_t_o_m_(_)_ _q_u_e_u_e___p_o_s_i_t_i_o_n___u_p_(_)
    │ │ │ │ │ -            _q_u_e_u_e___p_o_s_i_t_i_o_n_(_)_ _q_u_e_u_e___p_o_s_i_t_i_o_n___d_o_w_n_(_)
    │ │ │ │ │ +          o _q_u_e_u_e___p_o_s_i_t_i_o_n___u_p_(_)_ _q_u_e_u_e___p_o_s_i_t_i_o_n___d_o_w_n_(_)_ _q_u_e_u_e___p_o_s_i_t_i_o_n_(_)
    │ │ │ │ │ +            _q_u_e_u_e___p_o_s_i_t_i_o_n___b_o_t_t_o_m_(_)_ _q_u_e_u_e___p_o_s_i_t_i_o_n___t_o_p_(_)
    │ │ │ │ │            o _q_u_e_u_e___p_o_s_i_t_i_o_n___s_e_t_(_)
    │ │ │ │ │            o _s_e_t___s_s_l___c_e_r_t_i_f_i_c_a_t_e___b_u_f_f_e_r_(_)_ _s_e_t___s_s_l___c_e_r_t_i_f_i_c_a_t_e_(_)
    │ │ │ │ │            o _t_o_r_r_e_n_t___f_i_l_e___w_i_t_h___h_a_s_h_e_s_(_)_ _t_o_r_r_e_n_t___f_i_l_e_(_)
    │ │ │ │ │            o _p_i_e_c_e___l_a_y_e_r_s_(_)
    │ │ │ │ │            o _p_o_s_t___p_i_e_c_e___a_v_a_i_l_a_b_i_l_i_t_y_(_)_ _p_i_e_c_e___a_v_a_i_l_a_b_i_l_i_t_y_(_)
    │ │ │ │ │ -          o _g_e_t___p_i_e_c_e___p_r_i_o_r_i_t_i_e_s_(_)_ _p_r_i_o_r_i_t_i_z_e___p_i_e_c_e_s_(_)_ _p_i_e_c_e___p_r_i_o_r_i_t_y_(_)
    │ │ │ │ │ -          o _f_i_l_e___p_r_i_o_r_i_t_y_(_)_ _g_e_t___f_i_l_e___p_r_i_o_r_i_t_i_e_s_(_)_ _p_r_i_o_r_i_t_i_z_e___f_i_l_e_s_(_)
    │ │ │ │ │ -          o _f_o_r_c_e___r_e_a_n_n_o_u_n_c_e_(_)_ _f_o_r_c_e___d_h_t___a_n_n_o_u_n_c_e_(_)_ _f_o_r_c_e___l_s_d___a_n_n_o_u_n_c_e_(_)
    │ │ │ │ │ +          o _g_e_t___p_i_e_c_e___p_r_i_o_r_i_t_i_e_s_(_)_ _p_i_e_c_e___p_r_i_o_r_i_t_y_(_)_ _p_r_i_o_r_i_t_i_z_e___p_i_e_c_e_s_(_)
    │ │ │ │ │ +          o _p_r_i_o_r_i_t_i_z_e___f_i_l_e_s_(_)_ _f_i_l_e___p_r_i_o_r_i_t_y_(_)_ _g_e_t___f_i_l_e___p_r_i_o_r_i_t_i_e_s_(_)
    │ │ │ │ │ +          o _f_o_r_c_e___d_h_t___a_n_n_o_u_n_c_e_(_)_ _f_o_r_c_e___r_e_a_n_n_o_u_n_c_e_(_)_ _f_o_r_c_e___l_s_d___a_n_n_o_u_n_c_e_(_)
    │ │ │ │ │            o _s_c_r_a_p_e___t_r_a_c_k_e_r_(_)
    │ │ │ │ │ -          o _s_e_t___d_o_w_n_l_o_a_d___l_i_m_i_t_(_)_ _d_o_w_n_l_o_a_d___l_i_m_i_t_(_)_ _u_p_l_o_a_d___l_i_m_i_t_(_)
    │ │ │ │ │ -            _s_e_t___u_p_l_o_a_d___l_i_m_i_t_(_)
    │ │ │ │ │ +          o _s_e_t___d_o_w_n_l_o_a_d___l_i_m_i_t_(_)_ _s_e_t___u_p_l_o_a_d___l_i_m_i_t_(_)_ _d_o_w_n_l_o_a_d___l_i_m_i_t_(_)
    │ │ │ │ │ +            _u_p_l_o_a_d___l_i_m_i_t_(_)
    │ │ │ │ │            o _c_o_n_n_e_c_t___p_e_e_r_(_)
    │ │ │ │ │            o _c_l_e_a_r___p_e_e_r_s_(_)
    │ │ │ │ │ -          o _s_e_t___m_a_x___u_p_l_o_a_d_s_(_)_ _m_a_x___u_p_l_o_a_d_s_(_)
    │ │ │ │ │ +          o _m_a_x___u_p_l_o_a_d_s_(_)_ _s_e_t___m_a_x___u_p_l_o_a_d_s_(_)
    │ │ │ │ │            o _s_e_t___m_a_x___c_o_n_n_e_c_t_i_o_n_s_(_)_ _m_a_x___c_o_n_n_e_c_t_i_o_n_s_(_)
    │ │ │ │ │            o _m_o_v_e___s_t_o_r_a_g_e_(_)
    │ │ │ │ │            o _r_e_n_a_m_e___f_i_l_e_(_)
    │ │ │ │ │ -          o _i_n_f_o___h_a_s_h_(_)_ _i_n_f_o___h_a_s_h_e_s_(_)
    │ │ │ │ │ -          o _o_p_e_r_a_t_o_r_!_=_(_)_ _o_p_e_r_a_t_o_r_=_=_(_)_ _o_p_e_r_a_t_o_r_<_(_)
    │ │ │ │ │ +          o _i_n_f_o___h_a_s_h_e_s_(_)_ _i_n_f_o___h_a_s_h_(_)
    │ │ │ │ │ +          o _o_p_e_r_a_t_o_r_<_(_)_ _o_p_e_r_a_t_o_r_=_=_(_)_ _o_p_e_r_a_t_o_r_!_=_(_)
    │ │ │ │ │            o _i_d_(_)
    │ │ │ │ │            o _n_a_t_i_v_e___h_a_n_d_l_e_(_)
    │ │ │ │ │            o _u_s_e_r_d_a_t_a_(_)
    │ │ │ │ │            o _i_n___s_e_s_s_i_o_n_(_)
    │ │ │ │ │      * _h_a_s_h___v_a_l_u_e_(_)
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │  ************ bblloocckk__iinnffoo ************
    │ │ │ │ │ @@ -183,112 +183,112 @@
    │ │ │ │ │  flags = {}) const;
    │ │ │ │ │     void aadddd__ppiieeccee (piece_index_t piece, std::vector data,
    │ │ │ │ │  add_piece_flags_t flags = {}) const;
    │ │ │ │ │     void rreeaadd__ppiieeccee (piece_index_t piece) const;
    │ │ │ │ │     bool hhaavvee__ppiieeccee (piece_index_t piece) const;
    │ │ │ │ │     void ppoosstt__ppeeeerr__iinnffoo () const;
    │ │ │ │ │     void ggeett__ppeeeerr__iinnffoo (std::vector& v) const;
    │ │ │ │ │ -   void ppoosstt__ssttaattuuss (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │ │     torrent_status ssttaattuuss (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │ │ -   std::vector ggeett__ddoowwnnllooaadd__qquueeuuee () const;
    │ │ │ │ │ +   void ppoosstt__ssttaattuuss (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │ │     void ggeett__ddoowwnnllooaadd__qquueeuuee (std::vector& queue) const;
    │ │ │ │ │     void ppoosstt__ddoowwnnllooaadd__qquueeuuee () const;
    │ │ │ │ │ +   std::vector ggeett__ddoowwnnllooaadd__qquueeuuee () const;
    │ │ │ │ │     void cclleeaarr__ppiieeccee__ddeeaaddlliinneess () const;
    │ │ │ │ │     void rreesseett__ppiieeccee__ddeeaaddlliinnee (piece_index_t index) const;
    │ │ │ │ │     void sseett__ppiieeccee__ddeeaaddlliinnee (piece_index_t index, int deadline, deadline_flags_t
    │ │ │ │ │  flags = {}) const;
    │ │ │ │ │     void ffiillee__pprrooggrreessss (std::vector& progress,
    │ │ │ │ │  file_progress_flags_t flags = {}) const;
    │ │ │ │ │     std::vector ffiillee__pprrooggrreessss (file_progress_flags_t flags = {})
    │ │ │ │ │  const;
    │ │ │ │ │     void ppoosstt__ffiillee__pprrooggrreessss (file_progress_flags_t flags) const;
    │ │ │ │ │     std::vector ffiillee__ssttaattuuss () const;
    │ │ │ │ │     void cclleeaarr__eerrrroorr () const;
    │ │ │ │ │ -   void ppoosstt__ttrraacckkeerrss () const;
    │ │ │ │ │ -   void rreeppllaaccee__ttrraacckkeerrss (std::vector const&) const;
    │ │ │ │ │ -   std::vector ttrraacckkeerrss () const;
    │ │ │ │ │     void aadddd__ttrraacckkeerr (announce_entry const&) const;
    │ │ │ │ │ +   std::vector ttrraacckkeerrss () const;
    │ │ │ │ │ +   void rreeppllaaccee__ttrraacckkeerrss (std::vector const&) const;
    │ │ │ │ │ +   void ppoosstt__ttrraacckkeerrss () const;
    │ │ │ │ │ +   std::set uurrll__sseeeeddss () const;
    │ │ │ │ │     void aadddd__uurrll__sseeeedd (std::string const& url) const;
    │ │ │ │ │     void rreemmoovvee__uurrll__sseeeedd (std::string const& url) const;
    │ │ │ │ │ -   std::set uurrll__sseeeeddss () const;
    │ │ │ │ │     void aadddd__hhttttpp__sseeeedd (std::string const& url) const;
    │ │ │ │ │ -   std::set hhttttpp__sseeeeddss () const;
    │ │ │ │ │     void rreemmoovvee__hhttttpp__sseeeedd (std::string const& url) const;
    │ │ │ │ │ +   std::set hhttttpp__sseeeeddss () const;
    │ │ │ │ │     void aadddd__eexxtteennssiioonn (
    │ │ │ │ │        std::function(torrent_handle const&,
    │ │ │ │ │  client_data_t)> const& ext
    │ │ │ │ │        , client_data_t userdata = client_data_t{});
    │ │ │ │ │     bool sseett__mmeettaaddaattaa (span metadata) const;
    │ │ │ │ │     bool iiss__vvaalliidd () const;
    │ │ │ │ │     void ppaauussee (pause_flags_t flags = {}) const;
    │ │ │ │ │     void rreessuummee () const;
    │ │ │ │ │ +   void sseett__ffllaaggss (torrent_flags_t flags) const;
    │ │ │ │ │ +   torrent_flags_t ffllaaggss () const;
    │ │ │ │ │     void sseett__ffllaaggss (torrent_flags_t flags, torrent_flags_t mask) const;
    │ │ │ │ │     void uunnsseett__ffllaaggss (torrent_flags_t flags) const;
    │ │ │ │ │ -   torrent_flags_t ffllaaggss () const;
    │ │ │ │ │ -   void sseett__ffllaaggss (torrent_flags_t flags) const;
    │ │ │ │ │     void fflluusshh__ccaacchhee () const;
    │ │ │ │ │     void ffoorrccee__rreecchheecckk () const;
    │ │ │ │ │     void ssaavvee__rreessuummee__ddaattaa (resume_data_flags_t flags = {}) const;
    │ │ │ │ │ -   bool nneeeedd__ssaavvee__rreessuummee__ddaattaa (resume_data_flags_t flags) const;
    │ │ │ │ │     bool nneeeedd__ssaavvee__rreessuummee__ddaattaa () const;
    │ │ │ │ │ -   queue_position_t qquueeuuee__ppoossiittiioonn () const;
    │ │ │ │ │ +   bool nneeeedd__ssaavvee__rreessuummee__ddaattaa (resume_data_flags_t flags) const;
    │ │ │ │ │ +   void qquueeuuee__ppoossiittiioonn__ddoowwnn () const;
    │ │ │ │ │     void qquueeuuee__ppoossiittiioonn__uupp () const;
    │ │ │ │ │ -   void qquueeuuee__ppoossiittiioonn__bboottttoomm () const;
    │ │ │ │ │     void qquueeuuee__ppoossiittiioonn__ttoopp () const;
    │ │ │ │ │ -   void qquueeuuee__ppoossiittiioonn__ddoowwnn () const;
    │ │ │ │ │ +   queue_position_t qquueeuuee__ppoossiittiioonn () const;
    │ │ │ │ │ +   void qquueeuuee__ppoossiittiioonn__bboottttoomm () const;
    │ │ │ │ │     void qquueeuuee__ppoossiittiioonn__sseett (queue_position_t p) const;
    │ │ │ │ │ -   void sseett__ssssll__cceerrttiiffiiccaattee__bbuuffffeerr (std::string const& certificate
    │ │ │ │ │ -      , std::string const& private_key
    │ │ │ │ │ -      , std::string const& dh_params);
    │ │ │ │ │     void sseett__ssssll__cceerrttiiffiiccaattee (std::string const& certificate
    │ │ │ │ │        , std::string const& private_key
    │ │ │ │ │        , std::string const& dh_params
    │ │ │ │ │        , std::string const& passphrase = "");
    │ │ │ │ │ +   void sseett__ssssll__cceerrttiiffiiccaattee__bbuuffffeerr (std::string const& certificate
    │ │ │ │ │ +      , std::string const& private_key
    │ │ │ │ │ +      , std::string const& dh_params);
    │ │ │ │ │     std::shared_ptr ttoorrrreenntt__ffiillee () const;
    │ │ │ │ │     std::shared_ptr ttoorrrreenntt__ffiillee__wwiitthh__hhaasshheess () const;
    │ │ │ │ │     std::vector> ppiieeccee__llaayyeerrss () const;
    │ │ │ │ │     void ppiieeccee__aavvaaiillaabbiilliittyy (std::vector& avail) const;
    │ │ │ │ │     void ppoosstt__ppiieeccee__aavvaaiillaabbiilliittyy () const;
    │ │ │ │ │     void pprriioorriittiizzee__ppiieecceess (std::vector const& pieces)
    │ │ │ │ │  const;
    │ │ │ │ │ -   std::vector ggeett__ppiieeccee__pprriioorriittiieess () const;
    │ │ │ │ │     void ppiieeccee__pprriioorriittyy (piece_index_t index, download_priority_t priority)
    │ │ │ │ │  const;
    │ │ │ │ │ +   std::vector ggeett__ppiieeccee__pprriioorriittiieess () const;
    │ │ │ │ │ +   download_priority_t ppiieeccee__pprriioorriittyy (piece_index_t index) const;
    │ │ │ │ │     void pprriioorriittiizzee__ppiieecceess (std::vector> const& pieces) const;
    │ │ │ │ │ -   download_priority_t ppiieeccee__pprriioorriittyy (piece_index_t index) const;
    │ │ │ │ │ -   std::vector ggeett__ffiillee__pprriioorriittiieess () const;
    │ │ │ │ │     download_priority_t ffiillee__pprriioorriittyy (file_index_t index) const;
    │ │ │ │ │ +   std::vector ggeett__ffiillee__pprriioorriittiieess () const;
    │ │ │ │ │     void pprriioorriittiizzee__ffiilleess (std::vector const& files) const;
    │ │ │ │ │     void ffiillee__pprriioorriittyy (file_index_t index, download_priority_t priority) const;
    │ │ │ │ │ -   void ffoorrccee__llssdd__aannnnoouunnccee () const;
    │ │ │ │ │ -   void ffoorrccee__ddhhtt__aannnnoouunnccee () const;
    │ │ │ │ │     void ffoorrccee__rreeaannnnoouunnccee (int seconds = 0, int idx = -1, reannounce_flags_t =
    │ │ │ │ │  {}) const;
    │ │ │ │ │ +   void ffoorrccee__ddhhtt__aannnnoouunnccee () const;
    │ │ │ │ │ +   void ffoorrccee__llssdd__aannnnoouunnccee () const;
    │ │ │ │ │     void ssccrraappee__ttrraacckkeerr (int idx = -1) const;
    │ │ │ │ │ -   int ddoowwnnllooaadd__lliimmiitt () const;
    │ │ │ │ │ +   int uuppllooaadd__lliimmiitt () const;
    │ │ │ │ │     void sseett__uuppllooaadd__lliimmiitt (int limit) const;
    │ │ │ │ │     void sseett__ddoowwnnllooaadd__lliimmiitt (int limit) const;
    │ │ │ │ │ -   int uuppllooaadd__lliimmiitt () const;
    │ │ │ │ │ +   int ddoowwnnllooaadd__lliimmiitt () const;
    │ │ │ │ │     void ccoonnnneecctt__ppeeeerr (tcp::endpoint const& adr, peer_source_flags_t source = {}
    │ │ │ │ │        , pex_flags_t flags = pex_encryption | pex_utp | pex_holepunch) const;
    │ │ │ │ │     void cclleeaarr__ppeeeerrss ();
    │ │ │ │ │     void sseett__mmaaxx__uuppllooaaddss (int max_uploads) const;
    │ │ │ │ │     int mmaaxx__uuppllooaaddss () const;
    │ │ │ │ │ -   void sseett__mmaaxx__ccoonnnneeccttiioonnss (int max_connections) const;
    │ │ │ │ │     int mmaaxx__ccoonnnneeccttiioonnss () const;
    │ │ │ │ │ +   void sseett__mmaaxx__ccoonnnneeccttiioonnss (int max_connections) const;
    │ │ │ │ │     void mmoovvee__ssttoorraaggee (std::string const& save_path
    │ │ │ │ │        , move_flags_t flags = move_flags_t::always_replace_files
    │ │ │ │ │        ) const;
    │ │ │ │ │     void rreennaammee__ffiillee (file_index_t index, std::string const& new_name) const;
    │ │ │ │ │     info_hash_t iinnffoo__hhaasshheess () const;
    │ │ │ │ │     sha1_hash iinnffoo__hhaasshh () const;
    │ │ │ │ │ -   bool ooppeerraattoorr!!== (const torrent_handle& h) const;
    │ │ │ │ │ -   bool ooppeerraattoorr==== (const torrent_handle& h) const;
    │ │ │ │ │     bool ooppeerraattoorr<< (const torrent_handle& h) const;
    │ │ │ │ │ +   bool ooppeerraattoorr==== (const torrent_handle& h) const;
    │ │ │ │ │ +   bool ooppeerraattoorr!!== (const torrent_handle& h) const;
    │ │ │ │ │     std::uint32_t iidd () const;
    │ │ │ │ │     std::shared_ptr nnaattiivvee__hhaannddllee () const;
    │ │ │ │ │     client_data_t uusseerrddaattaa () const;
    │ │ │ │ │     bool iinn__sseessssiioonn () const;
    │ │ │ │ │  
    │ │ │ │ │     static constexpr add_piece_flags_t oovveerrwwrriittee__eexxiissttiinngg  = 0_bit;
    │ │ │ │ │     static constexpr status_flags_t qquueerryy__ddiissttrriibbuutteedd__ccooppiieess  = 0_bit;
    │ │ │ │ │ @@ -368,16 +368,16 @@
    │ │ │ │ │  connected peer.
    │ │ │ │ │  get_peer_info() is synchronous and takes a reference to a vector that will be
    │ │ │ │ │  cleared and filled with one _e_n_t_r_y for each peer connected to this torrent,
    │ │ │ │ │  given the handle is valid. Each _e_n_t_r_y in the vector contains information about
    │ │ │ │ │  that particular peer. See _p_e_e_r___i_n_f_o.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │  ********** ssttaattuuss(()) ppoosstt__ssttaattuuss(()) **********
    │ │ │ │ │ -void ppoosstt__ssttaattuuss (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │ │  torrent_status ssttaattuuss (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │ │ +void ppoosstt__ssttaattuuss (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │ │  status() will return a structure with information about the status of this
    │ │ │ │ │  torrent. If the _t_o_r_r_e_n_t___h_a_n_d_l_e is invalid, it will throw system_error
    │ │ │ │ │  exception. See _t_o_r_r_e_n_t___s_t_a_t_u_s. The flags argument filters what information is
    │ │ │ │ │  returned in the _t_o_r_r_e_n_t___s_t_a_t_u_s. Some information in there is relatively
    │ │ │ │ │  expensive to calculate, and if you're not interested in it (and see performance
    │ │ │ │ │  issues), you can filter them out.
    │ │ │ │ │  The status() function will block until the internal libtorrent thread responds
    │ │ │ │ │ @@ -385,18 +385,18 @@
    │ │ │ │ │  It will trigger posting of a _s_t_a_t_e___u_p_d_a_t_e___a_l_e_r_t with a single _t_o_r_r_e_n_t___s_t_a_t_u_s
    │ │ │ │ │  object for this torrent.
    │ │ │ │ │  In order to get regular updates for torrents whose status changes, consider
    │ │ │ │ │  calling session::post_torrent_updates()`` instead.
    │ │ │ │ │  By default everything is included. The flags you can use to decide what to
    │ │ │ │ │  iinncclluuddee are defined in this class.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ -********** ppoosstt__ddoowwnnllooaadd__qquueeuuee(()) ggeett__ddoowwnnllooaadd__qquueeuuee(()) **********
    │ │ │ │ │ -std::vector ggeett__ddoowwnnllooaadd__qquueeuuee () const;
    │ │ │ │ │ +********** ggeett__ddoowwnnllooaadd__qquueeuuee(()) ppoosstt__ddoowwnnllooaadd__qquueeuuee(()) **********
    │ │ │ │ │  void ggeett__ddoowwnnllooaadd__qquueeuuee (std::vector& queue) const;
    │ │ │ │ │  void ppoosstt__ddoowwnnllooaadd__qquueeuuee () const;
    │ │ │ │ │ +std::vector ggeett__ddoowwnnllooaadd__qquueeuuee () const;
    │ │ │ │ │  post_download_queue() triggers a download_queue_alert to be posted.
    │ │ │ │ │  get_download_queue() is a synchronous call and returns a vector with
    │ │ │ │ │  information about pieces that are partially downloaded or not downloaded but
    │ │ │ │ │  partially requested. See _p_a_r_t_i_a_l___p_i_e_c_e___i_n_f_o for the fields in the returned
    │ │ │ │ │  vector.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │  ********** rreesseett__ppiieeccee__ddeeaaddlliinnee(()) sseett__ppiieeccee__ddeeaaddlliinnee(()) cclleeaarr__ppiieeccee__ddeeaaddlliinneess(()) **********
    │ │ │ │ │ @@ -415,15 +415,15 @@
    │ │ │ │ │  same effect as calling _r_e_a_d___p_i_e_c_e_(_) for index.
    │ │ │ │ │  deadline is the number of milliseconds until this piece should be completed.
    │ │ │ │ │  reset_piece_deadline removes the deadline from the piece. If it hasn't already
    │ │ │ │ │  been downloaded, it will no longer be considered a priority.
    │ │ │ │ │  clear_piece_deadlines() removes deadlines on all pieces in the torrent. As if
    │ │ │ │ │  _r_e_s_e_t___p_i_e_c_e___d_e_a_d_l_i_n_e_(_) was called on all pieces.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ -********** ppoosstt__ffiillee__pprrooggrreessss(()) ffiillee__pprrooggrreessss(()) **********
    │ │ │ │ │ +********** ffiillee__pprrooggrreessss(()) ppoosstt__ffiillee__pprrooggrreessss(()) **********
    │ │ │ │ │  void ffiillee__pprrooggrreessss (std::vector& progress, file_progress_flags_t
    │ │ │ │ │  flags = {}) const;
    │ │ │ │ │  std::vector ffiillee__pprrooggrreessss (file_progress_flags_t flags = {})
    │ │ │ │ │  const;
    │ │ │ │ │  void ppoosstt__ffiillee__pprrooggrreessss (file_progress_flags_t flags) const;
    │ │ │ │ │  This function fills in the supplied vector, or returns a vector, with the
    │ │ │ │ │  number of bytes downloaded of each file in this torrent. The progress values
    │ │ │ │ │ @@ -449,19 +449,19 @@
    │ │ │ │ │  See _o_p_e_n___f_i_l_e___s_t_a_t_e
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │  ********** cclleeaarr__eerrrroorr(()) **********
    │ │ │ │ │  void cclleeaarr__eerrrroorr () const;
    │ │ │ │ │  If the torrent is in an error state (i.e. torrent_status::error is non-empty),
    │ │ │ │ │  this will clear the error and start the torrent again.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ -********** rreeppllaaccee__ttrraacckkeerrss(()) aadddd__ttrraacckkeerr(()) ttrraacckkeerrss(()) ppoosstt__ttrraacckkeerrss(()) **********
    │ │ │ │ │ -void ppoosstt__ttrraacckkeerrss () const;
    │ │ │ │ │ -void rreeppllaaccee__ttrraacckkeerrss (std::vector const&) const;
    │ │ │ │ │ -std::vector ttrraacckkeerrss () const;
    │ │ │ │ │ +********** ppoosstt__ttrraacckkeerrss(()) ttrraacckkeerrss(()) rreeppllaaccee__ttrraacckkeerrss(()) aadddd__ttrraacckkeerr(()) **********
    │ │ │ │ │  void aadddd__ttrraacckkeerr (announce_entry const&) const;
    │ │ │ │ │ +std::vector ttrraacckkeerrss () const;
    │ │ │ │ │ +void rreeppllaaccee__ttrraacckkeerrss (std::vector const&) const;
    │ │ │ │ │ +void ppoosstt__ttrraacckkeerrss () const;
    │ │ │ │ │  trackers() returns the list of trackers for this torrent. The announce _e_n_t_r_y
    │ │ │ │ │  contains both a string url which specify the announce url for the tracker as
    │ │ │ │ │  well as an _i_n_t 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 _f_o_r_c_e___r_e_a_n_n_o_u_n_c_e_(_). See _a_n_n_o_u_n_c_e___e_n_t_r_y.
    │ │ │ │ │ @@ -470,30 +470,30 @@
    │ │ │ │ │  add_tracker() will look if the specified tracker is already in the set. If it
    │ │ │ │ │  is, it doesn't do anything. If it's not in the current set of trackers, it will
    │ │ │ │ │  insert it in the tier specified in the _a_n_n_o_u_n_c_e___e_n_t_r_y.
    │ │ │ │ │  The updated set of trackers will be saved in the resume data, and when a
    │ │ │ │ │  torrent is started with resume data, the trackers from the resume data will
    │ │ │ │ │  replace the original ones.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ -********** uurrll__sseeeeddss(()) aadddd__uurrll__sseeeedd(()) rreemmoovvee__uurrll__sseeeedd(()) **********
    │ │ │ │ │ +********** uurrll__sseeeeddss(()) rreemmoovvee__uurrll__sseeeedd(()) aadddd__uurrll__sseeeedd(()) **********
    │ │ │ │ │ +std::set uurrll__sseeeeddss () const;
    │ │ │ │ │  void aadddd__uurrll__sseeeedd (std::string const& url) const;
    │ │ │ │ │  void rreemmoovvee__uurrll__sseeeedd (std::string const& url) const;
    │ │ │ │ │ -std::set uurrll__sseeeeddss () 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 _h_t_t_p_ _s_e_e_d_i_n_g for more information.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ -********** aadddd__hhttttpp__sseeeedd(()) hhttttpp__sseeeeddss(()) rreemmoovvee__hhttttpp__sseeeedd(()) **********
    │ │ │ │ │ +********** rreemmoovvee__hhttttpp__sseeeedd(()) aadddd__hhttttpp__sseeeedd(()) hhttttpp__sseeeeddss(()) **********
    │ │ │ │ │  void aadddd__hhttttpp__sseeeedd (std::string const& url) const;
    │ │ │ │ │ -std::set hhttttpp__sseeeeddss () const;
    │ │ │ │ │  void rreemmoovvee__hhttttpp__sseeeedd (std::string const& url) const;
    │ │ │ │ │ +std::set hhttttpp__sseeeeddss () const;
    │ │ │ │ │  These functions are identical as the *_url_seed() variants, but they operate on
    │ │ │ │ │  _B_E_P_ _1_7 web seeds instead of _B_E_P_ _1_9.
    │ │ │ │ │  See _h_t_t_p_ _s_e_e_d_i_n_g for more information.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │  ********** aadddd__eexxtteennssiioonn(()) **********
    │ │ │ │ │  void aadddd__eexxtteennssiioonn (
    │ │ │ │ │        std::function(torrent_handle const&,
    │ │ │ │ │ @@ -541,19 +541,19 @@
    │ │ │ │ │  for the torrent_status::paused flag.
    │ │ │ │ │  Note
    │ │ │ │ │  Torrents that are auto-managed may be automatically resumed again. It does not
    │ │ │ │ │  make sense to pause an auto-managed torrent without making it not auto-managed
    │ │ │ │ │  first. Torrents are auto-managed by default when added to the _s_e_s_s_i_o_n. For more
    │ │ │ │ │  information, see _q_u_e_u_i_n_g.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ -********** ffllaaggss(()) uunnsseett__ffllaaggss(()) sseett__ffllaaggss(()) **********
    │ │ │ │ │ +********** uunnsseett__ffllaaggss(()) ffllaaggss(()) sseett__ffllaaggss(()) **********
    │ │ │ │ │ +void sseett__ffllaaggss (torrent_flags_t flags) const;
    │ │ │ │ │ +torrent_flags_t ffllaaggss () const;
    │ │ │ │ │  void sseett__ffllaaggss (torrent_flags_t flags, torrent_flags_t mask) const;
    │ │ │ │ │  void uunnsseett__ffllaaggss (torrent_flags_t flags) const;
    │ │ │ │ │ -torrent_flags_t ffllaaggss () const;
    │ │ │ │ │ -void sseett__ffllaaggss (torrent_flags_t flags) const;
    │ │ │ │ │  sets and gets the torrent state flags. See _t_o_r_r_e_n_t___f_l_a_g_s___t. The set_flags
    │ │ │ │ │  overload that take a mask will affect all flags part of the mask, and set their
    │ │ │ │ │  values to what the flags argument is set to. This allows clearing and setting
    │ │ │ │ │  flags in a single function call. The set_flags overload that just takes flags,
    │ │ │ │ │  sets all the specified flags and leave any other flags unchanged. unset_flags
    │ │ │ │ │  clears the specified flags, while leaving any other flags unchanged.
    │ │ │ │ │  Theseed_modeflag is special, it can only be cleared once the torrent has been
    │ │ │ │ │ @@ -663,35 +663,35 @@
    │ │ │ │ │  Note how outstanding_resume_data is a global counter in this example. This is
    │ │ │ │ │  deliberate, otherwise there is a race condition for torrents that was just
    │ │ │ │ │  asked to save their resume data, they posted the _a_l_e_r_t, but it has not been
    │ │ │ │ │  received yet. Those torrents would report that they don't need to save resume
    │ │ │ │ │  data again, and skipped by the initial loop, and thwart the counter otherwise.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │  ********** nneeeedd__ssaavvee__rreessuummee__ddaattaa(()) **********
    │ │ │ │ │ -bool nneeeedd__ssaavvee__rreessuummee__ddaattaa (resume_data_flags_t flags) const;
    │ │ │ │ │  bool nneeeedd__ssaavvee__rreessuummee__ddaattaa () const;
    │ │ │ │ │ +bool nneeeedd__ssaavvee__rreessuummee__ddaattaa (resume_data_flags_t flags) const;
    │ │ │ │ │  This function returns true if anything that is stored in the resume data has
    │ │ │ │ │  changed since the last time resume data was saved. The overload that takes
    │ │ │ │ │  flags let you ask if specific categories of properties have changed. These
    │ │ │ │ │  flags have the same behavior as in the _s_a_v_e___r_e_s_u_m_e___d_a_t_a_(_) call.
    │ │ │ │ │  This is a bblloocckkiinngg call. It will wait for a response from libtorrent's main
    │ │ │ │ │  thread. A way to avoid blocking is to instead call _s_a_v_e___r_e_s_u_m_e___d_a_t_a_(_) directly,
    │ │ │ │ │  specifying the conditions under which resume data should be saved.
    │ │ │ │ │  Note
    │ │ │ │ │  A torrent's resume data is considered saved as soon as the
    │ │ │ │ │  _s_a_v_e___r_e_s_u_m_e___d_a_t_a___a_l_e_r_t is posted. It is important to make sure this _a_l_e_r_t is
    │ │ │ │ │  received and handled in order for this function to be meaningful.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ -********** qquueeuuee__ppoossiittiioonn__ttoopp(()) qquueeuuee__ppoossiittiioonn__bboottttoomm(()) qquueeuuee__ppoossiittiioonn__uupp(())
    │ │ │ │ │ -qquueeuuee__ppoossiittiioonn(()) qquueeuuee__ppoossiittiioonn__ddoowwnn(()) **********
    │ │ │ │ │ -queue_position_t qquueeuuee__ppoossiittiioonn () const;
    │ │ │ │ │ +********** qquueeuuee__ppoossiittiioonn__uupp(()) qquueeuuee__ppoossiittiioonn__ddoowwnn(()) qquueeuuee__ppoossiittiioonn(())
    │ │ │ │ │ +qquueeuuee__ppoossiittiioonn__bboottttoomm(()) qquueeuuee__ppoossiittiioonn__ttoopp(()) **********
    │ │ │ │ │ +void qquueeuuee__ppoossiittiioonn__ddoowwnn () const;
    │ │ │ │ │  void qquueeuuee__ppoossiittiioonn__uupp () const;
    │ │ │ │ │ -void qquueeuuee__ppoossiittiioonn__bboottttoomm () const;
    │ │ │ │ │  void qquueeuuee__ppoossiittiioonn__ttoopp () const;
    │ │ │ │ │ -void qquueeuuee__ppoossiittiioonn__ddoowwnn () const;
    │ │ │ │ │ +queue_position_t qquueeuuee__ppoossiittiioonn () const;
    │ │ │ │ │ +void qquueeuuee__ppoossiittiioonn__bboottttoomm () const;
    │ │ │ │ │  Every torrent that is added is assigned a queue position exactly one greater
    │ │ │ │ │  than the greatest queue position of all existing torrents. Torrents that are
    │ │ │ │ │  being seeded have -1 as their queue position, since they're no longer in line
    │ │ │ │ │  to be downloaded.
    │ │ │ │ │  When a torrent is removed or turns into a seed, all torrents with greater queue
    │ │ │ │ │  positions have their positions decreased to fill in the space in the sequence.
    │ │ │ │ │  queue_position() returns the torrent's position in the download queue. The
    │ │ │ │ │ @@ -706,21 +706,21 @@
    │ │ │ │ │  ********** qquueeuuee__ppoossiittiioonn__sseett(()) **********
    │ │ │ │ │  void qquueeuuee__ppoossiittiioonn__sseett (queue_position_t p) const;
    │ │ │ │ │  updates the position in the queue for this torrent. The relative order of all
    │ │ │ │ │  other torrents remain intact but their numerical queue position shifts to make
    │ │ │ │ │  space for this torrent's new position
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │  ********** sseett__ssssll__cceerrttiiffiiccaattee__bbuuffffeerr(()) sseett__ssssll__cceerrttiiffiiccaattee(()) **********
    │ │ │ │ │ -void sseett__ssssll__cceerrttiiffiiccaattee__bbuuffffeerr (std::string const& certificate
    │ │ │ │ │ -      , std::string const& private_key
    │ │ │ │ │ -      , std::string const& dh_params);
    │ │ │ │ │  void sseett__ssssll__cceerrttiiffiiccaattee (std::string const& certificate
    │ │ │ │ │        , std::string const& private_key
    │ │ │ │ │        , std::string const& dh_params
    │ │ │ │ │        , std::string const& passphrase = "");
    │ │ │ │ │ +void sseett__ssssll__cceerrttiiffiiccaattee__bbuuffffeerr (std::string const& certificate
    │ │ │ │ │ +      , std::string const& private_key
    │ │ │ │ │ +      , std::string const& dh_params);
    │ │ │ │ │  For SSL torrents, use this to specify a path to a .pem file to use as this
    │ │ │ │ │  client's certificate. The certificate must be signed by the certificate in the
    │ │ │ │ │  .torrent file to be valid.
    │ │ │ │ │  The _s_e_t___s_s_l___c_e_r_t_i_f_i_c_a_t_e___b_u_f_f_e_r_(_) overload takes the actual certificate, private
    │ │ │ │ │  key and DH params as strings, rather than paths to files.
    │ │ │ │ │  cert is a path to the (signed) certificate in .pem format corresponding to this
    │ │ │ │ │  torrent.
    │ │ │ │ │ @@ -782,21 +782,21 @@
    │ │ │ │ │  uses in order to prefer picking rare pieces.
    │ │ │ │ │  post_piece_availability() will trigger a _p_i_e_c_e___a_v_a_i_l_a_b_i_l_i_t_y___a_l_e_r_t to be posted.
    │ │ │ │ │  piece_availability() fills the specified std::vector with the availability
    │ │ │ │ │  for each piece in this torrent. libtorrent does not keep track of availability
    │ │ │ │ │  for seeds, so if the torrent is seeding the availability for all pieces is
    │ │ │ │ │  reported as 0.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ -********** ggeett__ppiieeccee__pprriioorriittiieess(()) pprriioorriittiizzee__ppiieecceess(()) ppiieeccee__pprriioorriittyy(()) **********
    │ │ │ │ │ +********** ggeett__ppiieeccee__pprriioorriittiieess(()) ppiieeccee__pprriioorriittyy(()) pprriioorriittiizzee__ppiieecceess(()) **********
    │ │ │ │ │  void pprriioorriittiizzee__ppiieecceess (std::vector const& pieces) const;
    │ │ │ │ │ -std::vector ggeett__ppiieeccee__pprriioorriittiieess () const;
    │ │ │ │ │  void ppiieeccee__pprriioorriittyy (piece_index_t index, download_priority_t priority) const;
    │ │ │ │ │ +std::vector ggeett__ppiieeccee__pprriioorriittiieess () const;
    │ │ │ │ │ +download_priority_t ppiieeccee__pprriioorriittyy (piece_index_t index) const;
    │ │ │ │ │  void pprriioorriittiizzee__ppiieecceess (std::vector> const& pieces) const;
    │ │ │ │ │ -download_priority_t ppiieeccee__pprriioorriittyy (piece_index_t index) const;
    │ │ │ │ │  These functions are used to set and get the priority of individual pieces. By
    │ │ │ │ │  default all pieces have priority 4. 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 priority levels. 0 means not to
    │ │ │ │ │  download the piece at all. Otherwise, lower priority values means less likely
    │ │ │ │ │  to be picked. Piece priority takes precedence over piece availability. Every
    │ │ │ │ │  piece with priority 7 will be attempted to be picked before a priority 6 piece
    │ │ │ │ │ @@ -816,17 +816,17 @@
    │ │ │ │ │  where the piece index or priority is out of range, are not allowed.
    │ │ │ │ │  get_piece_priorities returns a vector with one element for each piece in the
    │ │ │ │ │  torrent. Each element is the current priority of that piece.
    │ │ │ │ │  It's possible to cancel the effect of ffiillee priorities by setting the priorities
    │ │ │ │ │  for the affected pieces. Care has to be taken when mixing usage of file- and
    │ │ │ │ │  piece priorities.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ -********** ffiillee__pprriioorriittyy(()) ggeett__ffiillee__pprriioorriittiieess(()) pprriioorriittiizzee__ffiilleess(()) **********
    │ │ │ │ │ -std::vector ggeett__ffiillee__pprriioorriittiieess () const;
    │ │ │ │ │ +********** pprriioorriittiizzee__ffiilleess(()) ffiillee__pprriioorriittyy(()) ggeett__ffiillee__pprriioorriittiieess(()) **********
    │ │ │ │ │  download_priority_t ffiillee__pprriioorriittyy (file_index_t index) const;
    │ │ │ │ │ +std::vector ggeett__ffiillee__pprriioorriittiieess () const;
    │ │ │ │ │  void pprriioorriittiizzee__ffiilleess (std::vector const& files) const;
    │ │ │ │ │  void ffiillee__pprriioorriittyy (file_index_t index, download_priority_t priority) const;
    │ │ │ │ │  index must be in the range [0, number_of_files).
    │ │ │ │ │  file_priority() queries or sets the priority of file index.
    │ │ │ │ │  prioritize_files() takes a vector that has at as many elements as there are
    │ │ │ │ │  files in the torrent. Each _e_n_t_r_y is the priority of that file. The function
    │ │ │ │ │  sets the priorities of all the pieces in the torrent based on the vector.
    │ │ │ │ │ @@ -847,19 +847,19 @@
    │ │ │ │ │  When combining file- and piece priorities, the resume file will record both.
    │ │ │ │ │  When loading the resume data, the file priorities will be applied first, then
    │ │ │ │ │  the piece priorities.
    │ │ │ │ │  Moving data from a file into the part file is currently not supported. If a
    │ │ │ │ │  file has its priority set to 0 aafftteerr it has already been created, it will not
    │ │ │ │ │  be moved into the partfile.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ -********** ffoorrccee__rreeaannnnoouunnccee(()) ffoorrccee__ddhhtt__aannnnoouunnccee(()) ffoorrccee__llssdd__aannnnoouunnccee(()) **********
    │ │ │ │ │ -void ffoorrccee__llssdd__aannnnoouunnccee () const;
    │ │ │ │ │ -void ffoorrccee__ddhhtt__aannnnoouunnccee () const;
    │ │ │ │ │ +********** ffoorrccee__ddhhtt__aannnnoouunnccee(()) ffoorrccee__rreeaannnnoouunnccee(()) ffoorrccee__llssdd__aannnnoouunnccee(()) **********
    │ │ │ │ │  void ffoorrccee__rreeaannnnoouunnccee (int seconds = 0, int idx = -1, reannounce_flags_t = {})
    │ │ │ │ │  const;
    │ │ │ │ │ +void ffoorrccee__ddhhtt__aannnnoouunnccee () const;
    │ │ │ │ │ +void ffoorrccee__llssdd__aannnnoouunnccee () const;
    │ │ │ │ │  force_reannounce() will force this torrent to do another tracker request, to
    │ │ │ │ │  receive new peers. The seconds argument specifies how many seconds from now to
    │ │ │ │ │  issue the tracker announces.
    │ │ │ │ │  If the tracker's min_interval has not passed since the last announce, the
    │ │ │ │ │  forced announce will be scheduled to happen immediately as the min_interval
    │ │ │ │ │  expires. This is to honor trackers minimum re-announce interval settings.
    │ │ │ │ │  The tracker_index argument specifies which tracker to re-announce. If set to -
    │ │ │ │ │ @@ -877,20 +877,20 @@
    │ │ │ │ │  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 _t_o_r_r_e_n_t___s_t_a_t_u_s struct once it completes. When it completes, it
    │ │ │ │ │  will generate a _s_c_r_a_p_e___r_e_p_l_y___a_l_e_r_t. If it fails, it will generate a
    │ │ │ │ │  _s_c_r_a_p_e___f_a_i_l_e_d___a_l_e_r_t.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ -********** sseett__ddoowwnnllooaadd__lliimmiitt(()) ddoowwnnllooaadd__lliimmiitt(()) uuppllooaadd__lliimmiitt(()) sseett__uuppllooaadd__lliimmiitt(())
    │ │ │ │ │ +********** sseett__ddoowwnnllooaadd__lliimmiitt(()) sseett__uuppllooaadd__lliimmiitt(()) ddoowwnnllooaadd__lliimmiitt(()) uuppllooaadd__lliimmiitt(())
    │ │ │ │ │  **********
    │ │ │ │ │ -int ddoowwnnllooaadd__lliimmiitt () const;
    │ │ │ │ │ +int uuppllooaadd__lliimmiitt () const;
    │ │ │ │ │  void sseett__uuppllooaadd__lliimmiitt (int limit) const;
    │ │ │ │ │  void sseett__ddoowwnnllooaadd__lliimmiitt (int limit) const;
    │ │ │ │ │ -int uuppllooaadd__lliimmiitt () const;
    │ │ │ │ │ +int ddoowwnnllooaadd__lliimmiitt () 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 (settings_pack::upload_rate_limit)
    │ │ │ │ │  will not override the global rate limit. The torrent can never upload more than
    │ │ │ │ │  the global rate limit.
    │ │ │ │ │ @@ -913,26 +913,26 @@
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │  ********** cclleeaarr__ppeeeerrss(()) **********
    │ │ │ │ │  void cclleeaarr__ppeeeerrss ();
    │ │ │ │ │  This will disconnect all peers and clear the peer list for this torrent. New
    │ │ │ │ │  peers will have to be acquired before resuming, from trackers, DHT or local
    │ │ │ │ │  service discovery, for example.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ -********** sseett__mmaaxx__uuppllooaaddss(()) mmaaxx__uuppllooaaddss(()) **********
    │ │ │ │ │ +********** mmaaxx__uuppllooaaddss(()) sseett__mmaaxx__uuppllooaaddss(()) **********
    │ │ │ │ │  void sseett__mmaaxx__uuppllooaaddss (int max_uploads) const;
    │ │ │ │ │  int mmaaxx__uuppllooaaddss () 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. This
    │ │ │ │ │  defaults to infinite. The primary setting controlling this is the global
    │ │ │ │ │  unchoke slots limit, set by unchoke_slots_limit in _s_e_t_t_i_n_g_s___p_a_c_k.
    │ │ │ │ │  max_uploads() returns the current settings.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │  ********** sseett__mmaaxx__ccoonnnneeccttiioonnss(()) mmaaxx__ccoonnnneeccttiioonnss(()) **********
    │ │ │ │ │ -void sseett__mmaaxx__ccoonnnneeccttiioonnss (int max_connections) const;
    │ │ │ │ │  int mmaaxx__ccoonnnneeccttiioonnss () const;
    │ │ │ │ │ +void sseett__mmaaxx__ccoonnnneeccttiioonnss (int max_connections) const;
    │ │ │ │ │  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. There is also a global limit of the number of connections, set by
    │ │ │ │ │  connections_limit in _s_e_t_t_i_n_g_s___p_a_c_k.
    │ │ │ │ │  max_connections() returns the current settings.
    │ │ │ │ │ @@ -982,27 +982,27 @@
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │  ********** rreennaammee__ffiillee(()) **********
    │ │ │ │ │  void rreennaammee__ffiillee (file_index_t index, std::string const& new_name) const;
    │ │ │ │ │  Renames the file with the given index asynchronously. The rename operation is
    │ │ │ │ │  complete when either a _f_i_l_e___r_e_n_a_m_e_d___a_l_e_r_t or _f_i_l_e___r_e_n_a_m_e___f_a_i_l_e_d___a_l_e_r_t is
    │ │ │ │ │  posted.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ -********** iinnffoo__hhaasshh(()) iinnffoo__hhaasshheess(()) **********
    │ │ │ │ │ +********** iinnffoo__hhaasshheess(()) iinnffoo__hhaasshh(()) **********
    │ │ │ │ │  info_hash_t iinnffoo__hhaasshheess () const;
    │ │ │ │ │  sha1_hash iinnffoo__hhaasshh () const;
    │ │ │ │ │  returns the info-hash(es) of the torrent. If this handle is to a torrent that
    │ │ │ │ │  hasn't loaded yet (for instance by being added) by a URL, the returned value is
    │ │ │ │ │  undefined. The info_hash() returns the SHA-1 info-hash for v1 torrents and a
    │ │ │ │ │  truncated hash for v2 torrents. For the full v2 info-hash, use info_hashes()
    │ │ │ │ │  instead.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │ -********** ooppeerraattoorr!!==(()) ooppeerraattoorr====(()) ooppeerraattoorr<<(()) **********
    │ │ │ │ │ -bool ooppeerraattoorr!!== (const torrent_handle& h) const;
    │ │ │ │ │ -bool ooppeerraattoorr==== (const torrent_handle& h) const;
    │ │ │ │ │ +********** ooppeerraattoorr<<(()) ooppeerraattoorr====(()) ooppeerraattoorr!!==(()) **********
    │ │ │ │ │  bool ooppeerraattoorr<< (const torrent_handle& h) const;
    │ │ │ │ │ +bool ooppeerraattoorr==== (const torrent_handle& h) const;
    │ │ │ │ │ +bool ooppeerraattoorr!!== (const torrent_handle& h) const;
    │ │ │ │ │  comparison operators. The order of the torrents is unspecified but stable.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ │ │  ********** iidd(()) **********
    │ │ │ │ │  std::uint32_t iidd () const;
    │ │ │ │ │  returns a unique identifier for this torrent. It's not a dense index. It's not
    │ │ │ │ │  preserved across sessions.
    │ │ │ │ │  [_r_e_p_o_r_t_ _i_s_s_u_e]
    │ │ │ ├── ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Torrent_Info.html
    │ │ │ │ @@ -38,35 +38,35 @@
    │ │ │ │  
  • enum type_t
  • │ │ │ │ │ │ │ │ │ │ │ │
  • load_torrent_limits
  • │ │ │ │
  • torrent_info
      │ │ │ │
    • torrent_info()
    • │ │ │ │
    • ~torrent_info()
    • │ │ │ │ -
    • files() orig_files()
    • │ │ │ │ +
    • orig_files() files()
    • │ │ │ │
    • rename_file()
    • │ │ │ │
    • remap_files()
    • │ │ │ │ -
    • add_tracker() trackers() clear_trackers()
    • │ │ │ │ +
    • clear_trackers() trackers() add_tracker()
    • │ │ │ │
    • collections() similar_torrents()
    • │ │ │ │ -
    • add_http_seed() add_url_seed() set_web_seeds() web_seeds()
    • │ │ │ │ +
    • web_seeds() set_web_seeds() add_http_seed() add_url_seed()
    • │ │ │ │
    • total_size()
    • │ │ │ │ -
    • piece_length() num_pieces()
    • │ │ │ │ +
    • num_pieces() piece_length()
    • │ │ │ │
    • blocks_per_piece()
    • │ │ │ │ -
    • piece_range() last_piece() end_piece()
    • │ │ │ │ -
    • info_hash() info_hashes()
    • │ │ │ │ +
    • piece_range() end_piece() last_piece()
    • │ │ │ │ +
    • info_hashes() info_hash()
    • │ │ │ │
    • v2() v1()
    • │ │ │ │
    • num_files()
    • │ │ │ │
    • map_block()
    • │ │ │ │
    • map_file()
    • │ │ │ │
    • ssl_cert()
    • │ │ │ │
    • is_valid()
    • │ │ │ │
    • priv()
    • │ │ │ │
    • is_i2p()
    • │ │ │ │
    • piece_size()
    • │ │ │ │ -
    • hash_for_piece() hash_for_piece_ptr()
    • │ │ │ │ +
    • hash_for_piece_ptr() hash_for_piece()
    • │ │ │ │
    • name()
    • │ │ │ │
    • creation_date()
    • │ │ │ │
    • creator()
    • │ │ │ │
    • comment()
    • │ │ │ │
    • nodes()
    • │ │ │ │
    • add_node()
    • │ │ │ │
    • parse_info_section()
    • │ │ │ │ @@ -197,69 +197,69 @@ │ │ │ │
      │ │ │ │

      torrent_info

      │ │ │ │

      Declared in "libtorrent/torrent_info.hpp"

      │ │ │ │

      the torrent_info class holds the information found in a .torrent file.

      │ │ │ │
      │ │ │ │  class torrent_info
      │ │ │ │  {
      │ │ │ │ -   explicit torrent_info (span<char const> buffer, from_span_t);
      │ │ │ │ -   torrent_info (char const* buffer, int size, error_code& ec);
      │ │ │ │     explicit torrent_info (info_hash_t const& info_hash);
      │ │ │ │ -   torrent_info (std::string const& filename, error_code& ec);
      │ │ │ │     torrent_info (span<char const> buffer, error_code& ec, from_span_t);
      │ │ │ │ -   torrent_info (span<char const> buffer, load_torrent_limits const& cfg, from_span_t);
      │ │ │ │ -   explicit torrent_info (bdecode_node const& torrent_file);
      │ │ │ │     torrent_info (bdecode_node const& torrent_file, error_code& ec);
      │ │ │ │ -   torrent_info (std::string const& filename, load_torrent_limits const& cfg);
      │ │ │ │ -   torrent_info (char const* buffer, int size);
      │ │ │ │     explicit torrent_info (std::string const& filename);
      │ │ │ │ +   explicit torrent_info (bdecode_node const& torrent_file);
      │ │ │ │ +   torrent_info (char const* buffer, int size, error_code& ec);
      │ │ │ │ +   torrent_info (span<char const> buffer, load_torrent_limits const& cfg, from_span_t);
      │ │ │ │     torrent_info (torrent_info const& t);
      │ │ │ │ +   torrent_info (std::string const& filename, load_torrent_limits const& cfg);
      │ │ │ │ +   torrent_info (char const* buffer, int size);
      │ │ │ │     torrent_info (bdecode_node const& torrent_file, load_torrent_limits const& cfg);
      │ │ │ │ +   explicit torrent_info (span<char const> buffer, from_span_t);
      │ │ │ │ +   torrent_info (std::string const& filename, error_code& ec);
      │ │ │ │     ~torrent_info ();
      │ │ │ │     file_storage const& files () const;
      │ │ │ │     file_storage const& orig_files () const;
      │ │ │ │     void rename_file (file_index_t index, std::string const& new_filename);
      │ │ │ │     void remap_files (file_storage const& f);
      │ │ │ │     void clear_trackers ();
      │ │ │ │     void add_tracker (std::string const& url, int tier
      │ │ │ │        , announce_entry::tracker_source source);
      │ │ │ │ -   std::vector<announce_entry> const& trackers () const;
      │ │ │ │     void add_tracker (std::string const& url, int tier = 0);
      │ │ │ │ +   std::vector<announce_entry> const& trackers () const;
      │ │ │ │     std::vector<sha1_hash> similar_torrents () const;
      │ │ │ │     std::vector<std::string> collections () const;
      │ │ │ │ -   void set_web_seeds (std::vector<web_seed_entry> seeds);
      │ │ │ │ +   void add_url_seed (std::string const& url
      │ │ │ │ +      , std::string const& ext_auth = std::string()
      │ │ │ │ +      , web_seed_entry::headers_t const& ext_headers = web_seed_entry::headers_t());
      │ │ │ │     void add_http_seed (std::string const& url
      │ │ │ │        , std::string const& extern_auth = std::string()
      │ │ │ │        , web_seed_entry::headers_t const& extra_headers = web_seed_entry::headers_t());
      │ │ │ │ +   void set_web_seeds (std::vector<web_seed_entry> seeds);
      │ │ │ │     std::vector<web_seed_entry> const& web_seeds () const;
      │ │ │ │ -   void add_url_seed (std::string const& url
      │ │ │ │ -      , std::string const& ext_auth = std::string()
      │ │ │ │ -      , web_seed_entry::headers_t const& ext_headers = web_seed_entry::headers_t());
      │ │ │ │     std::int64_t total_size () const;
      │ │ │ │ -   int num_pieces () const;
      │ │ │ │     int piece_length () const;
      │ │ │ │ +   int num_pieces () const;
      │ │ │ │     int blocks_per_piece () const;
      │ │ │ │     piece_index_t end_piece () const;
      │ │ │ │ -   piece_index_t last_piece () const;
      │ │ │ │     index_range<piece_index_t> piece_range () const;
      │ │ │ │ +   piece_index_t last_piece () const;
      │ │ │ │     info_hash_t const& info_hashes () const;
      │ │ │ │     sha1_hash info_hash () const noexcept;
      │ │ │ │ -   bool v2 () const;
      │ │ │ │     bool v1 () const;
      │ │ │ │ +   bool v2 () const;
      │ │ │ │     int num_files () const;
      │ │ │ │     std::vector<file_slice> map_block (piece_index_t const piece
      │ │ │ │        , std::int64_t offset, int size) const;
      │ │ │ │     peer_request map_file (file_index_t const file, std::int64_t offset, int size) const;
      │ │ │ │     string_view ssl_cert () const;
      │ │ │ │     bool is_valid () const;
      │ │ │ │     bool priv () const;
      │ │ │ │     bool is_i2p () const;
      │ │ │ │     int piece_size (piece_index_t index) const;
      │ │ │ │ -   sha1_hash hash_for_piece (piece_index_t index) const;
      │ │ │ │     char const* hash_for_piece_ptr (piece_index_t const index) const;
      │ │ │ │ +   sha1_hash hash_for_piece (piece_index_t index) const;
      │ │ │ │     bool is_loaded () const;
      │ │ │ │     const std::string& name () const;
      │ │ │ │     std::time_t creation_date () const;
      │ │ │ │     const std::string& creator () const;
      │ │ │ │     const std::string& comment () const;
      │ │ │ │     std::vector<std::pair<std::string, int>> const& nodes () const;
      │ │ │ │     void add_node (std::pair<std::string, int> const& node);
      │ │ │ │ @@ -269,27 +269,27 @@
      │ │ │ │     span<char const> piece_layer (file_index_t) const;
      │ │ │ │     void free_piece_layers ();
      │ │ │ │  };
      │ │ │ │  
      │ │ │ │ [report issue]
      │ │ │ │

      torrent_info()

      │ │ │ │
      │ │ │ │ -explicit torrent_info (span<char const> buffer, from_span_t);
      │ │ │ │ -torrent_info (char const* buffer, int size, error_code& ec);
      │ │ │ │  explicit torrent_info (info_hash_t const& info_hash);
      │ │ │ │ -torrent_info (std::string const& filename, error_code& ec);
      │ │ │ │  torrent_info (span<char const> buffer, error_code& ec, from_span_t);
      │ │ │ │ -torrent_info (span<char const> buffer, load_torrent_limits const& cfg, from_span_t);
      │ │ │ │ -explicit torrent_info (bdecode_node const& torrent_file);
      │ │ │ │  torrent_info (bdecode_node const& torrent_file, error_code& ec);
      │ │ │ │ -torrent_info (std::string const& filename, load_torrent_limits const& cfg);
      │ │ │ │ -torrent_info (char const* buffer, int size);
      │ │ │ │  explicit torrent_info (std::string const& filename);
      │ │ │ │ +explicit torrent_info (bdecode_node const& torrent_file);
      │ │ │ │ +torrent_info (char const* buffer, int size, error_code& ec);
      │ │ │ │ +torrent_info (span<char const> buffer, load_torrent_limits const& cfg, from_span_t);
      │ │ │ │  torrent_info (torrent_info const& t);
      │ │ │ │ +torrent_info (std::string const& filename, load_torrent_limits const& cfg);
      │ │ │ │ +torrent_info (char const* buffer, int size);
      │ │ │ │  torrent_info (bdecode_node const& torrent_file, load_torrent_limits const& cfg);
      │ │ │ │ +explicit torrent_info (span<char const> buffer, from_span_t);
      │ │ │ │ +torrent_info (std::string const& filename, error_code& ec);
      │ │ │ │  
      │ │ │ │

      The constructor that takes an info-hash will initialize the info-hash │ │ │ │ to the given value, but leave all other fields empty. 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 constructor that takes a bdecode_node will create a torrent_info │ │ │ │ @@ -318,18 +318,18 @@ │ │ │ │ [report issue]

      │ │ │ │
      │ │ │ │

      ~torrent_info()

      │ │ │ │
      │ │ │ │  ~torrent_info ();
      │ │ │ │  
      │ │ │ │

      frees all storage associated with this torrent_info object

      │ │ │ │ - │ │ │ │ -[report issue]
      │ │ │ │ -
      │ │ │ │ -

      files() orig_files()

      │ │ │ │ + │ │ │ │ +[report issue]
      │ │ │ │ +
      │ │ │ │ +

      orig_files() files()

      │ │ │ │
      │ │ │ │  file_storage const& files () const;
      │ │ │ │  file_storage const& orig_files () const;
      │ │ │ │  
      │ │ │ │

      The file_storage object contains the information on how to map the │ │ │ │ pieces to files. It is separated from the torrent_info object because │ │ │ │ when creating torrents a storage object needs to be created without │ │ │ │ @@ -348,15 +348,15 @@ │ │ │ │

      │ │ │ │  void rename_file (file_index_t index, std::string const& new_filename);
      │ │ │ │  
      │ │ │ │

      Renames the file with the specified index to the new name. The new │ │ │ │ filename is reflected by the file_storage returned by files() │ │ │ │ but not by the one returned by orig_files().

      │ │ │ │

      If you want to rename the base name of the torrent (for a multi file │ │ │ │ -torrent), you can copy the file_storage (see files() and │ │ │ │ +torrent), you can copy the file_storage (see files() and │ │ │ │ orig_files() ), change the name, and then use remap_files().

      │ │ │ │

      The new_filename can both be a relative path, in which case the │ │ │ │ file name is relative to the save_path of the torrent. If the │ │ │ │ new_filename is an absolute path (i.e. is_complete(new_filename) │ │ │ │ == true), then the file is detached from the save_path of the │ │ │ │ torrent. In this case the file is not moved when move_storage() is │ │ │ │ invoked.

      │ │ │ │ @@ -376,25 +376,25 @@ │ │ │ │
      │ │ │ │

      Remaps the file storage to a new file layout. This can be used to, for │ │ │ │ instance, download all data in a torrent to a single file, or to a │ │ │ │ number of fixed size sector aligned files, regardless of the number │ │ │ │ and sizes of the files in the torrent.

      │ │ │ │

      The new specified file_storage must have the exact same size as │ │ │ │ the current one.

      │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ -[report issue]
      │ │ │ │ -
      │ │ │ │ -

      add_tracker() trackers() clear_trackers()

      │ │ │ │ +[report issue]
      │ │ │ │ +
      │ │ │ │ +

      clear_trackers() trackers() add_tracker()

      │ │ │ │
      │ │ │ │  void clear_trackers ();
      │ │ │ │  void add_tracker (std::string const& url, int tier
      │ │ │ │        , announce_entry::tracker_source source);
      │ │ │ │ -std::vector<announce_entry> const& trackers () const;
      │ │ │ │  void add_tracker (std::string const& url, int tier = 0);
      │ │ │ │ +std::vector<announce_entry> const& trackers () const;
      │ │ │ │  
      │ │ │ │

      add_tracker() adds a tracker to the announce-list. The tier │ │ │ │ determines the order in which the trackers are to be tried. │ │ │ │ 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 │ │ │ │ @@ -411,29 +411,29 @@ │ │ │ │ std::vector<std::string> collections () const; │ │ │ │

  • │ │ │ │

    These two functions are related to BEP 38 (mutable torrents). The │ │ │ │ vectors returned from these correspond to the "similar" and │ │ │ │ "collections" keys in the .torrent file. Both info-hashes and │ │ │ │ collections from within the info-dict and from outside of it are │ │ │ │ included.

    │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    add_http_seed() add_url_seed() set_web_seeds() web_seeds()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    web_seeds() set_web_seeds() add_http_seed() add_url_seed()

    │ │ │ │
    │ │ │ │ -void set_web_seeds (std::vector<web_seed_entry> seeds);
    │ │ │ │ +void add_url_seed (std::string const& url
    │ │ │ │ +      , std::string const& ext_auth = std::string()
    │ │ │ │ +      , web_seed_entry::headers_t const& ext_headers = web_seed_entry::headers_t());
    │ │ │ │  void add_http_seed (std::string const& url
    │ │ │ │        , std::string const& extern_auth = std::string()
    │ │ │ │        , web_seed_entry::headers_t const& extra_headers = web_seed_entry::headers_t());
    │ │ │ │ +void set_web_seeds (std::vector<web_seed_entry> seeds);
    │ │ │ │  std::vector<web_seed_entry> const& web_seeds () const;
    │ │ │ │ -void add_url_seed (std::string const& url
    │ │ │ │ -      , std::string const& ext_auth = std::string()
    │ │ │ │ -      , web_seed_entry::headers_t const& ext_headers = web_seed_entry::headers_t());
    │ │ │ │  
    │ │ │ │

    web_seeds() returns all url seeds and http seeds in the torrent. │ │ │ │ Each entry is a web_seed_entry and may refer to either a url seed │ │ │ │ or http seed.

    │ │ │ │

    add_url_seed() and add_http_seed() adds one url to the list of │ │ │ │ url/http seeds.

    │ │ │ │

    set_web_seeds() replaces all web seeds with the ones specified in │ │ │ │ @@ -453,21 +453,21 @@ │ │ │ │ std::int64_t total_size () const; │ │ │ │ │ │ │ │

    total_size() returns the total number of bytes the torrent-file │ │ │ │ represents. Note that this is the number of pieces times the piece │ │ │ │ size (modulo the last piece possibly being smaller). With pad files, │ │ │ │ the total size will be larger than the sum of all (regular) file │ │ │ │ sizes.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    piece_length() num_pieces()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    num_pieces() piece_length()

    │ │ │ │
    │ │ │ │ -int num_pieces () const;
    │ │ │ │  int piece_length () const;
    │ │ │ │ +int num_pieces () const;
    │ │ │ │  
    │ │ │ │

    piece_length() and num_pieces() returns 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 │ │ │ │ @@ -477,47 +477,47 @@ │ │ │ │

    blocks_per_piece()

    │ │ │ │
    │ │ │ │  int blocks_per_piece () const;
    │ │ │ │  
    │ │ │ │

    returns the number of blocks there are in the typical piece. There │ │ │ │ may be fewer in the last piece)

    │ │ │ │ │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    piece_range() last_piece() end_piece()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    piece_range() end_piece() last_piece()

    │ │ │ │
    │ │ │ │  piece_index_t end_piece () const;
    │ │ │ │ -piece_index_t last_piece () const;
    │ │ │ │  index_range<piece_index_t> piece_range () const;
    │ │ │ │ +piece_index_t last_piece () const;
    │ │ │ │  
    │ │ │ │

    last_piece() returns the index to the last piece in the torrent and │ │ │ │ end_piece() returns the index to the one-past-end piece in the │ │ │ │ torrent │ │ │ │ piece_range() returns an implementation-defined type that can be │ │ │ │ used as the container in a range-for loop. Where the values are the │ │ │ │ indices of all pieces in the file_storage.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    info_hash() info_hashes()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    info_hashes() info_hash()

    │ │ │ │
    │ │ │ │  info_hash_t const& info_hashes () const;
    │ │ │ │  sha1_hash info_hash () const noexcept;
    │ │ │ │  
    │ │ │ │

    returns the info-hash of the torrent. For BitTorrent v2 support, use │ │ │ │ info_hashes() to get an object that may hold both a v1 and v2 │ │ │ │ info-hash

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    v2() v1()

    │ │ │ │
    │ │ │ │ -bool v2 () const;
    │ │ │ │  bool v1 () const;
    │ │ │ │ +bool v2 () const;
    │ │ │ │  
    │ │ │ │

    returns whether this torrent has v1 and/or v2 metadata, respectively. │ │ │ │ Hybrid torrents have both. These are shortcuts for │ │ │ │ info_hashes().has_v1() and info_hashes().has_v2() calls.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    num_files()

    │ │ │ │ @@ -588,23 +588,23 @@ │ │ │ │ to peers over anything other than the i2p network.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    piece_size()

    │ │ │ │
    │ │ │ │  int piece_size (piece_index_t index) const;
    │ │ │ │  
    │ │ │ │ -

    returns the piece size of file with index. This will be the same as piece_length(), │ │ │ │ +

    returns the piece size of file with index. This will be the same as piece_length(), │ │ │ │ except for the last piece, which may be shorter.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    hash_for_piece() hash_for_piece_ptr()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    hash_for_piece_ptr() hash_for_piece()

    │ │ │ │
    │ │ │ │ -sha1_hash hash_for_piece (piece_index_t index) const;
    │ │ │ │  char const* hash_for_piece_ptr (piece_index_t const index) const;
    │ │ │ │ +sha1_hash hash_for_piece (piece_index_t 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. │ │ │ │ hash_for_piece_ptr() returns a pointer to the 20 byte sha1 digest │ │ │ │ for the piece. Note that the string is not 0-terminated.

    │ │ │ │ [report issue]
    │ │ │ │ ├── html2text {} │ │ │ │ │ @@ -7,35 +7,35 @@ │ │ │ │ │ o _o_p_e_r_a_t_o_r_=_=_(_) │ │ │ │ │ o _o_p_e_r_a_t_o_r_<_(_) │ │ │ │ │ o _e_n_u_m_ _t_y_p_e___t │ │ │ │ │ * _l_o_a_d___t_o_r_r_e_n_t___l_i_m_i_t_s │ │ │ │ │ * _t_o_r_r_e_n_t___i_n_f_o │ │ │ │ │ o _t_o_r_r_e_n_t___i_n_f_o_(_) │ │ │ │ │ o _~_t_o_r_r_e_n_t___i_n_f_o_(_) │ │ │ │ │ - o _f_i_l_e_s_(_)_ _o_r_i_g___f_i_l_e_s_(_) │ │ │ │ │ + o _o_r_i_g___f_i_l_e_s_(_)_ _f_i_l_e_s_(_) │ │ │ │ │ o _r_e_n_a_m_e___f_i_l_e_(_) │ │ │ │ │ o _r_e_m_a_p___f_i_l_e_s_(_) │ │ │ │ │ - o _a_d_d___t_r_a_c_k_e_r_(_)_ _t_r_a_c_k_e_r_s_(_)_ _c_l_e_a_r___t_r_a_c_k_e_r_s_(_) │ │ │ │ │ + o _c_l_e_a_r___t_r_a_c_k_e_r_s_(_)_ _t_r_a_c_k_e_r_s_(_)_ _a_d_d___t_r_a_c_k_e_r_(_) │ │ │ │ │ o _c_o_l_l_e_c_t_i_o_n_s_(_)_ _s_i_m_i_l_a_r___t_o_r_r_e_n_t_s_(_) │ │ │ │ │ - o _a_d_d___h_t_t_p___s_e_e_d_(_)_ _a_d_d___u_r_l___s_e_e_d_(_)_ _s_e_t___w_e_b___s_e_e_d_s_(_)_ _w_e_b___s_e_e_d_s_(_) │ │ │ │ │ + o _w_e_b___s_e_e_d_s_(_)_ _s_e_t___w_e_b___s_e_e_d_s_(_)_ _a_d_d___h_t_t_p___s_e_e_d_(_)_ _a_d_d___u_r_l___s_e_e_d_(_) │ │ │ │ │ o _t_o_t_a_l___s_i_z_e_(_) │ │ │ │ │ - o _p_i_e_c_e___l_e_n_g_t_h_(_)_ _n_u_m___p_i_e_c_e_s_(_) │ │ │ │ │ + o _n_u_m___p_i_e_c_e_s_(_)_ _p_i_e_c_e___l_e_n_g_t_h_(_) │ │ │ │ │ o _b_l_o_c_k_s___p_e_r___p_i_e_c_e_(_) │ │ │ │ │ - o _p_i_e_c_e___r_a_n_g_e_(_)_ _l_a_s_t___p_i_e_c_e_(_)_ _e_n_d___p_i_e_c_e_(_) │ │ │ │ │ - o _i_n_f_o___h_a_s_h_(_)_ _i_n_f_o___h_a_s_h_e_s_(_) │ │ │ │ │ + o _p_i_e_c_e___r_a_n_g_e_(_)_ _e_n_d___p_i_e_c_e_(_)_ _l_a_s_t___p_i_e_c_e_(_) │ │ │ │ │ + o _i_n_f_o___h_a_s_h_e_s_(_)_ _i_n_f_o___h_a_s_h_(_) │ │ │ │ │ o _v_2_(_)_ _v_1_(_) │ │ │ │ │ o _n_u_m___f_i_l_e_s_(_) │ │ │ │ │ o _m_a_p___b_l_o_c_k_(_) │ │ │ │ │ o _m_a_p___f_i_l_e_(_) │ │ │ │ │ o _s_s_l___c_e_r_t_(_) │ │ │ │ │ o _i_s___v_a_l_i_d_(_) │ │ │ │ │ o _p_r_i_v_(_) │ │ │ │ │ o _i_s___i_2_p_(_) │ │ │ │ │ o _p_i_e_c_e___s_i_z_e_(_) │ │ │ │ │ - o _h_a_s_h___f_o_r___p_i_e_c_e_(_)_ _h_a_s_h___f_o_r___p_i_e_c_e___p_t_r_(_) │ │ │ │ │ + o _h_a_s_h___f_o_r___p_i_e_c_e___p_t_r_(_)_ _h_a_s_h___f_o_r___p_i_e_c_e_(_) │ │ │ │ │ o _n_a_m_e_(_) │ │ │ │ │ o _c_r_e_a_t_i_o_n___d_a_t_e_(_) │ │ │ │ │ o _c_r_e_a_t_o_r_(_) │ │ │ │ │ o _c_o_m_m_e_n_t_(_) │ │ │ │ │ o _n_o_d_e_s_(_) │ │ │ │ │ o _a_d_d___n_o_d_e_(_) │ │ │ │ │ o _p_a_r_s_e___i_n_f_o___s_e_c_t_i_o_n_(_) │ │ │ │ │ @@ -120,74 +120,74 @@ │ │ │ │ │ the max number of bdecode tokens │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ttoorrrreenntt__iinnffoo ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___i_n_f_o_._h_p_p" │ │ │ │ │ the _t_o_r_r_e_n_t___i_n_f_o class holds the information found in a .torrent file. │ │ │ │ │ class torrent_info │ │ │ │ │ { │ │ │ │ │ - explicit ttoorrrreenntt__iinnffoo (span buffer, from_span_t); │ │ │ │ │ - ttoorrrreenntt__iinnffoo (char const* buffer, int size, error_code& ec); │ │ │ │ │ explicit ttoorrrreenntt__iinnffoo (info_hash_t const& info_hash); │ │ │ │ │ - ttoorrrreenntt__iinnffoo (std::string const& filename, error_code& ec); │ │ │ │ │ ttoorrrreenntt__iinnffoo (span buffer, error_code& ec, from_span_t); │ │ │ │ │ + ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file, error_code& ec); │ │ │ │ │ + explicit ttoorrrreenntt__iinnffoo (std::string const& filename); │ │ │ │ │ + explicit ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file); │ │ │ │ │ + ttoorrrreenntt__iinnffoo (char const* buffer, int size, error_code& ec); │ │ │ │ │ ttoorrrreenntt__iinnffoo (span buffer, load_torrent_limits const& cfg, │ │ │ │ │ from_span_t); │ │ │ │ │ - explicit ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file); │ │ │ │ │ - ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file, error_code& ec); │ │ │ │ │ + ttoorrrreenntt__iinnffoo (torrent_info const& t); │ │ │ │ │ ttoorrrreenntt__iinnffoo (std::string const& filename, load_torrent_limits const& cfg); │ │ │ │ │ ttoorrrreenntt__iinnffoo (char const* buffer, int size); │ │ │ │ │ - explicit ttoorrrreenntt__iinnffoo (std::string const& filename); │ │ │ │ │ - ttoorrrreenntt__iinnffoo (torrent_info const& t); │ │ │ │ │ ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file, load_torrent_limits const& │ │ │ │ │ cfg); │ │ │ │ │ + explicit ttoorrrreenntt__iinnffoo (span buffer, from_span_t); │ │ │ │ │ + ttoorrrreenntt__iinnffoo (std::string const& filename, error_code& ec); │ │ │ │ │ ~~ttoorrrreenntt__iinnffoo (); │ │ │ │ │ file_storage const& ffiilleess () const; │ │ │ │ │ file_storage const& oorriigg__ffiilleess () const; │ │ │ │ │ void rreennaammee__ffiillee (file_index_t index, std::string const& new_filename); │ │ │ │ │ void rreemmaapp__ffiilleess (file_storage const& f); │ │ │ │ │ void cclleeaarr__ttrraacckkeerrss (); │ │ │ │ │ void aadddd__ttrraacckkeerr (std::string const& url, int tier │ │ │ │ │ , announce_entry::tracker_source source); │ │ │ │ │ - std::vector const& ttrraacckkeerrss () const; │ │ │ │ │ void aadddd__ttrraacckkeerr (std::string const& url, int tier = 0); │ │ │ │ │ + std::vector const& ttrraacckkeerrss () const; │ │ │ │ │ std::vector ssiimmiillaarr__ttoorrrreennttss () const; │ │ │ │ │ std::vector ccoolllleeccttiioonnss () const; │ │ │ │ │ - void sseett__wweebb__sseeeeddss (std::vector seeds); │ │ │ │ │ + void aadddd__uurrll__sseeeedd (std::string const& url │ │ │ │ │ + , std::string const& ext_auth = std::string() │ │ │ │ │ + , web_seed_entry::headers_t const& ext_headers = web_seed_entry:: │ │ │ │ │ +headers_t()); │ │ │ │ │ void aadddd__hhttttpp__sseeeedd (std::string const& url │ │ │ │ │ , std::string const& extern_auth = std::string() │ │ │ │ │ , web_seed_entry::headers_t const& extra_headers = web_seed_entry:: │ │ │ │ │ headers_t()); │ │ │ │ │ + void sseett__wweebb__sseeeeddss (std::vector seeds); │ │ │ │ │ std::vector const& wweebb__sseeeeddss () const; │ │ │ │ │ - void aadddd__uurrll__sseeeedd (std::string const& url │ │ │ │ │ - , std::string const& ext_auth = std::string() │ │ │ │ │ - , web_seed_entry::headers_t const& ext_headers = web_seed_entry:: │ │ │ │ │ -headers_t()); │ │ │ │ │ std::int64_t ttoottaall__ssiizzee () const; │ │ │ │ │ - int nnuumm__ppiieecceess () const; │ │ │ │ │ int ppiieeccee__lleennggtthh () const; │ │ │ │ │ + int nnuumm__ppiieecceess () const; │ │ │ │ │ int bblloocckkss__ppeerr__ppiieeccee () const; │ │ │ │ │ piece_index_t eenndd__ppiieeccee () const; │ │ │ │ │ - piece_index_t llaasstt__ppiieeccee () const; │ │ │ │ │ index_range ppiieeccee__rraannggee () const; │ │ │ │ │ + piece_index_t llaasstt__ppiieeccee () const; │ │ │ │ │ info_hash_t const& iinnffoo__hhaasshheess () const; │ │ │ │ │ sha1_hash iinnffoo__hhaasshh () const noexcept; │ │ │ │ │ - bool vv22 () const; │ │ │ │ │ bool vv11 () const; │ │ │ │ │ + bool vv22 () const; │ │ │ │ │ int nnuumm__ffiilleess () const; │ │ │ │ │ std::vector mmaapp__bblloocckk (piece_index_t const piece │ │ │ │ │ , std::int64_t offset, int size) const; │ │ │ │ │ peer_request mmaapp__ffiillee (file_index_t const file, std::int64_t offset, int │ │ │ │ │ size) const; │ │ │ │ │ string_view ssssll__cceerrtt () const; │ │ │ │ │ bool iiss__vvaalliidd () const; │ │ │ │ │ bool pprriivv () const; │ │ │ │ │ bool iiss__ii22pp () const; │ │ │ │ │ int ppiieeccee__ssiizzee (piece_index_t index) const; │ │ │ │ │ - sha1_hash hhaasshh__ffoorr__ppiieeccee (piece_index_t index) const; │ │ │ │ │ char const* hhaasshh__ffoorr__ppiieeccee__ppttrr (piece_index_t const index) const; │ │ │ │ │ + sha1_hash hhaasshh__ffoorr__ppiieeccee (piece_index_t index) const; │ │ │ │ │ bool iiss__llooaaddeedd () const; │ │ │ │ │ const std::string& nnaammee () const; │ │ │ │ │ std::time_t ccrreeaattiioonn__ddaattee () const; │ │ │ │ │ const std::string& ccrreeaattoorr () const; │ │ │ │ │ const std::string& ccoommmmeenntt () const; │ │ │ │ │ std::vector> const& nnooddeess () const; │ │ │ │ │ void aadddd__nnooddee (std::pair const& node); │ │ │ │ │ @@ -196,29 +196,29 @@ │ │ │ │ │ bdecode_node iinnffoo (char const* key) const; │ │ │ │ │ span iinnffoo__sseeccttiioonn () const; │ │ │ │ │ span ppiieeccee__llaayyeerr (file_index_t) const; │ │ │ │ │ void ffrreeee__ppiieeccee__llaayyeerrss (); │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ttoorrrreenntt__iinnffoo(()) ********** │ │ │ │ │ -explicit ttoorrrreenntt__iinnffoo (span buffer, from_span_t); │ │ │ │ │ -ttoorrrreenntt__iinnffoo (char const* buffer, int size, error_code& ec); │ │ │ │ │ explicit ttoorrrreenntt__iinnffoo (info_hash_t const& info_hash); │ │ │ │ │ -ttoorrrreenntt__iinnffoo (std::string const& filename, error_code& ec); │ │ │ │ │ ttoorrrreenntt__iinnffoo (span buffer, error_code& ec, from_span_t); │ │ │ │ │ +ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file, error_code& ec); │ │ │ │ │ +explicit ttoorrrreenntt__iinnffoo (std::string const& filename); │ │ │ │ │ +explicit ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file); │ │ │ │ │ +ttoorrrreenntt__iinnffoo (char const* buffer, int size, error_code& ec); │ │ │ │ │ ttoorrrreenntt__iinnffoo (span buffer, load_torrent_limits const& cfg, │ │ │ │ │ from_span_t); │ │ │ │ │ -explicit ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file); │ │ │ │ │ -ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file, error_code& ec); │ │ │ │ │ +ttoorrrreenntt__iinnffoo (torrent_info const& t); │ │ │ │ │ ttoorrrreenntt__iinnffoo (std::string const& filename, load_torrent_limits const& cfg); │ │ │ │ │ ttoorrrreenntt__iinnffoo (char const* buffer, int size); │ │ │ │ │ -explicit ttoorrrreenntt__iinnffoo (std::string const& filename); │ │ │ │ │ -ttoorrrreenntt__iinnffoo (torrent_info const& t); │ │ │ │ │ ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file, load_torrent_limits const& │ │ │ │ │ cfg); │ │ │ │ │ +explicit ttoorrrreenntt__iinnffoo (span buffer, from_span_t); │ │ │ │ │ +ttoorrrreenntt__iinnffoo (std::string const& filename, error_code& ec); │ │ │ │ │ The constructor that takes an info-hash will initialize the info-hash to the │ │ │ │ │ given value, but leave all other fields empty. 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 constructor that takes a _b_d_e_c_o_d_e___n_o_d_e will create a _t_o_r_r_e_n_t___i_n_f_o object │ │ │ │ │ from the information found in the given torrent_file. The _b_d_e_c_o_d_e___n_o_d_e │ │ │ │ │ represents a tree node in an bencoded file. To load an ordinary .torrent file │ │ │ │ │ @@ -241,15 +241,15 @@ │ │ │ │ │ from_span_t to disambiguate the std::string overload for string literals. There │ │ │ │ │ is an object in the libtorrent namespace of this type called from_span. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ~~ttoorrrreenntt__iinnffoo(()) ********** │ │ │ │ │ ~~ttoorrrreenntt__iinnffoo (); │ │ │ │ │ frees all storage associated with this _t_o_r_r_e_n_t___i_n_f_o object │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiilleess(()) oorriigg__ffiilleess(()) ********** │ │ │ │ │ +********** oorriigg__ffiilleess(()) ffiilleess(()) ********** │ │ │ │ │ file_storage const& ffiilleess () const; │ │ │ │ │ file_storage const& oorriigg__ffiilleess () const; │ │ │ │ │ The _f_i_l_e___s_t_o_r_a_g_e object contains the information on how to map the pieces to │ │ │ │ │ files. It is separated from the _t_o_r_r_e_n_t___i_n_f_o object because when creating │ │ │ │ │ torrents a storage object needs to be created without having a torrent file. │ │ │ │ │ When renaming files in a storage, the storage needs to make its own copy of the │ │ │ │ │ _f_i_l_e___s_t_o_r_a_g_e in order to make its mapping differ from the one in the torrent │ │ │ │ │ @@ -284,20 +284,20 @@ │ │ │ │ │ Remaps the file storage to a new file layout. This can be used to, for │ │ │ │ │ instance, download all data in a torrent to a single file, or to a number of │ │ │ │ │ fixed size sector aligned files, regardless of the number and sizes of the │ │ │ │ │ files in the torrent. │ │ │ │ │ The new specified file_storage must have the exact same size as the current │ │ │ │ │ one. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aadddd__ttrraacckkeerr(()) ttrraacckkeerrss(()) cclleeaarr__ttrraacckkeerrss(()) ********** │ │ │ │ │ +********** cclleeaarr__ttrraacckkeerrss(()) ttrraacckkeerrss(()) aadddd__ttrraacckkeerr(()) ********** │ │ │ │ │ void cclleeaarr__ttrraacckkeerrss (); │ │ │ │ │ void aadddd__ttrraacckkeerr (std::string const& url, int tier │ │ │ │ │ , announce_entry::tracker_source source); │ │ │ │ │ -std::vector const& ttrraacckkeerrss () const; │ │ │ │ │ void aadddd__ttrraacckkeerr (std::string const& url, int tier = 0); │ │ │ │ │ +std::vector const& ttrraacckkeerrss () const; │ │ │ │ │ add_tracker() adds a tracker to the announce-list. The tier determines the │ │ │ │ │ order in which the trackers are to be tried. The trackers() function will │ │ │ │ │ return a sorted vector of _a_n_n_o_u_n_c_e___e_n_t_r_y. Each announce _e_n_t_r_y 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. For more │ │ │ │ │ information, see _a_n_n_o_u_n_c_e___e_n_t_r_y. │ │ │ │ │ @@ -308,25 +308,25 @@ │ │ │ │ │ std::vector ssiimmiillaarr__ttoorrrreennttss () const; │ │ │ │ │ std::vector ccoolllleeccttiioonnss () const; │ │ │ │ │ These two functions are related to _B_E_P_ _3_8 (mutable torrents). The vectors │ │ │ │ │ returned from these correspond to the "similar" and "collections" keys in the │ │ │ │ │ .torrent file. Both info-hashes and collections from within the info-dict and │ │ │ │ │ from outside of it are included. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aadddd__hhttttpp__sseeeedd(()) aadddd__uurrll__sseeeedd(()) sseett__wweebb__sseeeeddss(()) wweebb__sseeeeddss(()) ********** │ │ │ │ │ -void sseett__wweebb__sseeeeddss (std::vector seeds); │ │ │ │ │ +********** wweebb__sseeeeddss(()) sseett__wweebb__sseeeeddss(()) aadddd__hhttttpp__sseeeedd(()) aadddd__uurrll__sseeeedd(()) ********** │ │ │ │ │ +void aadddd__uurrll__sseeeedd (std::string const& url │ │ │ │ │ + , std::string const& ext_auth = std::string() │ │ │ │ │ + , web_seed_entry::headers_t const& ext_headers = web_seed_entry:: │ │ │ │ │ +headers_t()); │ │ │ │ │ void aadddd__hhttttpp__sseeeedd (std::string const& url │ │ │ │ │ , std::string const& extern_auth = std::string() │ │ │ │ │ , web_seed_entry::headers_t const& extra_headers = web_seed_entry:: │ │ │ │ │ headers_t()); │ │ │ │ │ +void sseett__wweebb__sseeeeddss (std::vector seeds); │ │ │ │ │ std::vector const& wweebb__sseeeeddss () const; │ │ │ │ │ -void aadddd__uurrll__sseeeedd (std::string const& url │ │ │ │ │ - , std::string const& ext_auth = std::string() │ │ │ │ │ - , web_seed_entry::headers_t const& ext_headers = web_seed_entry:: │ │ │ │ │ -headers_t()); │ │ │ │ │ web_seeds() returns all url seeds and http seeds in the torrent. Each _e_n_t_r_y is │ │ │ │ │ a web_seed_entry and may refer to either a url seed or http seed. │ │ │ │ │ add_url_seed() and add_http_seed() adds one url to the list of url/http seeds. │ │ │ │ │ set_web_seeds() replaces all web seeds with the ones specified in the seeds │ │ │ │ │ vector. │ │ │ │ │ The extern_auth argument can be used for other authorization schemes than basic │ │ │ │ │ HTTP authorization. If set, it will override any username and password found in │ │ │ │ │ @@ -339,47 +339,47 @@ │ │ │ │ │ ********** ttoottaall__ssiizzee(()) ********** │ │ │ │ │ std::int64_t ttoottaall__ssiizzee () const; │ │ │ │ │ total_size() returns the total number of bytes the torrent-file represents. │ │ │ │ │ Note that this is the number of pieces times the piece size (modulo the last │ │ │ │ │ piece possibly being smaller). With pad files, the total size will be larger │ │ │ │ │ than the sum of all (regular) file sizes. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppiieeccee__lleennggtthh(()) nnuumm__ppiieecceess(()) ********** │ │ │ │ │ -int nnuumm__ppiieecceess () const; │ │ │ │ │ +********** nnuumm__ppiieecceess(()) ppiieeccee__lleennggtthh(()) ********** │ │ │ │ │ int ppiieeccee__lleennggtthh () const; │ │ │ │ │ +int nnuumm__ppiieecceess () const; │ │ │ │ │ piece_length() and num_pieces() returns 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. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** bblloocckkss__ppeerr__ppiieeccee(()) ********** │ │ │ │ │ int bblloocckkss__ppeerr__ppiieeccee () const; │ │ │ │ │ returns the number of blocks there are in the typical piece. There may be fewer │ │ │ │ │ in the last piece) │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppiieeccee__rraannggee(()) llaasstt__ppiieeccee(()) eenndd__ppiieeccee(()) ********** │ │ │ │ │ +********** ppiieeccee__rraannggee(()) eenndd__ppiieeccee(()) llaasstt__ppiieeccee(()) ********** │ │ │ │ │ piece_index_t eenndd__ppiieeccee () const; │ │ │ │ │ -piece_index_t llaasstt__ppiieeccee () const; │ │ │ │ │ index_range ppiieeccee__rraannggee () const; │ │ │ │ │ +piece_index_t llaasstt__ppiieeccee () const; │ │ │ │ │ last_piece() returns the index to the last piece in the torrent and end_piece() │ │ │ │ │ returns the index to the one-past-end piece in the torrent piece_range() │ │ │ │ │ returns an implementation-defined type that can be used as the container in a │ │ │ │ │ range-for loop. Where the values are the indices of all pieces in the │ │ │ │ │ _f_i_l_e___s_t_o_r_a_g_e. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** iinnffoo__hhaasshh(()) iinnffoo__hhaasshheess(()) ********** │ │ │ │ │ +********** iinnffoo__hhaasshheess(()) iinnffoo__hhaasshh(()) ********** │ │ │ │ │ info_hash_t const& iinnffoo__hhaasshheess () const; │ │ │ │ │ sha1_hash iinnffoo__hhaasshh () const noexcept; │ │ │ │ │ returns the info-hash of the torrent. For BitTorrent v2 support, use │ │ │ │ │ info_hashes() to get an object that may hold both a v1 and v2 info-hash │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** vv22(()) vv11(()) ********** │ │ │ │ │ -bool vv22 () const; │ │ │ │ │ bool vv11 () const; │ │ │ │ │ +bool vv22 () const; │ │ │ │ │ returns whether this torrent has v1 and/or v2 metadata, respectively. Hybrid │ │ │ │ │ torrents have both. These are shortcuts for info_hashes().has_v1() and │ │ │ │ │ info_hashes().has_v2() calls. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** nnuumm__ffiilleess(()) ********** │ │ │ │ │ int nnuumm__ffiilleess () const; │ │ │ │ │ If you need index-access to files you can use the num_files() along with the │ │ │ │ │ @@ -427,17 +427,17 @@ │ │ │ │ │ than the i2p network. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ppiieeccee__ssiizzee(()) ********** │ │ │ │ │ int ppiieeccee__ssiizzee (piece_index_t index) const; │ │ │ │ │ returns the piece size of file with index. This will be the same as │ │ │ │ │ _p_i_e_c_e___l_e_n_g_t_h_(_), except for the last piece, which may be shorter. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** hhaasshh__ffoorr__ppiieeccee(()) hhaasshh__ffoorr__ppiieeccee__ppttrr(()) ********** │ │ │ │ │ -sha1_hash hhaasshh__ffoorr__ppiieeccee (piece_index_t index) const; │ │ │ │ │ +********** hhaasshh__ffoorr__ppiieeccee__ppttrr(()) hhaasshh__ffoorr__ppiieeccee(()) ********** │ │ │ │ │ char const* hhaasshh__ffoorr__ppiieeccee__ppttrr (piece_index_t const index) const; │ │ │ │ │ +sha1_hash hhaasshh__ffoorr__ppiieeccee (piece_index_t 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. hash_for_piece_ptr() returns a pointer to the 20 byte sha1 │ │ │ │ │ digest for the piece. Note that the string is not 0-terminated. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** nnaammee(()) ********** │ │ │ │ │ const std::string& nnaammee () const; │ │ │ ├── ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Trackers.html │ │ │ │ @@ -31,15 +31,15 @@ │ │ │ │

    home

    │ │ │ │
    │ │ │ │

    Table of contents

    │ │ │ │ │ │ │ │
    │ │ │ │ [report issue]
    │ │ │ │

    announce_infohash

    │ │ │ │ @@ -131,19 +131,19 @@ │ │ │ │

    announce_entry

    │ │ │ │

    Declared in "libtorrent/announce_entry.hpp"

    │ │ │ │

    this class holds information about one bittorrent tracker, as it │ │ │ │ relates to a specific torrent.

    │ │ │ │
    │ │ │ │  struct announce_entry
    │ │ │ │  {
    │ │ │ │ -   announce_entry& operator= (announce_entry const&) &;
    │ │ │ │ -   ~announce_entry ();
    │ │ │ │ -   announce_entry (announce_entry const&);
    │ │ │ │     announce_entry ();
    │ │ │ │ +   announce_entry (announce_entry const&);
    │ │ │ │ +   ~announce_entry ();
    │ │ │ │     explicit announce_entry (string_view u);
    │ │ │ │ +   announce_entry& operator= (announce_entry const&) &;
    │ │ │ │  
    │ │ │ │     enum tracker_source
    │ │ │ │     {
    │ │ │ │        source_torrent,
    │ │ │ │        source_client,
    │ │ │ │        source_magnet_link,
    │ │ │ │        source_tex,
    │ │ │ │ @@ -154,24 +154,24 @@
    │ │ │ │     std::vector<announce_endpoint> endpoints;
    │ │ │ │     std::uint8_t tier  = 0;
    │ │ │ │     std::uint8_t fail_limit  = 0;
    │ │ │ │     std::uint8_t source:4;
    │ │ │ │     bool verified:1;
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ - │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -

    announce_entry() operator=() ~announce_entry()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    operator=() ~announce_entry() announce_entry()

    │ │ │ │
    │ │ │ │ -announce_entry& operator= (announce_entry const&) &;
    │ │ │ │ -~announce_entry ();
    │ │ │ │ -announce_entry (announce_entry const&);
    │ │ │ │  announce_entry ();
    │ │ │ │ +announce_entry (announce_entry const&);
    │ │ │ │ +~announce_entry ();
    │ │ │ │  explicit announce_entry (string_view u);
    │ │ │ │ +announce_entry& operator= (announce_entry const&) &;
    │ │ │ │  
    │ │ │ │

    constructs a tracker announce entry with u as the URL.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    enum tracker_source

    │ │ │ │

    Declared in "libtorrent/announce_entry.hpp"

    │ │ │ │
    │ │ │ │ @@ -189,15 +189,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ├── html2text {} │ │ │ │ │ @@ -2,15 +2,15 @@ │ │ │ │ │ _[_l_i_b_t_o_r_r_e_n_t_ _l_o_g_o_] │ │ │ │ │ VVeerrssiioonn:: 2.0.11 │ │ │ │ │ _h_o_m_e │ │ │ │ │ Table of contents │ │ │ │ │ * _a_n_n_o_u_n_c_e___i_n_f_o_h_a_s_h │ │ │ │ │ * _a_n_n_o_u_n_c_e___e_n_d_p_o_i_n_t │ │ │ │ │ * _a_n_n_o_u_n_c_e___e_n_t_r_y │ │ │ │ │ - o _a_n_n_o_u_n_c_e___e_n_t_r_y_(_)_ _o_p_e_r_a_t_o_r_=_(_)_ _~_a_n_n_o_u_n_c_e___e_n_t_r_y_(_) │ │ │ │ │ + o _o_p_e_r_a_t_o_r_=_(_)_ _~_a_n_n_o_u_n_c_e___e_n_t_r_y_(_)_ _a_n_n_o_u_n_c_e___e_n_t_r_y_(_) │ │ │ │ │ o _e_n_u_m_ _t_r_a_c_k_e_r___s_o_u_r_c_e │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ aannnnoouunnccee__iinnffoohhaasshh ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_a_n_n_o_u_n_c_e___e_n_t_r_y_._h_p_p" │ │ │ │ │ struct announce_infohash │ │ │ │ │ { │ │ │ │ │ std::string message; │ │ │ │ │ @@ -78,19 +78,19 @@ │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ aannnnoouunnccee__eennttrryy ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_a_n_n_o_u_n_c_e___e_n_t_r_y_._h_p_p" │ │ │ │ │ this class holds information about one bittorrent tracker, as it relates to a │ │ │ │ │ specific torrent. │ │ │ │ │ struct announce_entry │ │ │ │ │ { │ │ │ │ │ - announce_entry& ooppeerraattoorr== (announce_entry const&) &; │ │ │ │ │ - ~~aannnnoouunnccee__eennttrryy (); │ │ │ │ │ - aannnnoouunnccee__eennttrryy (announce_entry const&); │ │ │ │ │ aannnnoouunnccee__eennttrryy (); │ │ │ │ │ + aannnnoouunnccee__eennttrryy (announce_entry const&); │ │ │ │ │ + ~~aannnnoouunnccee__eennttrryy (); │ │ │ │ │ explicit aannnnoouunnccee__eennttrryy (string_view u); │ │ │ │ │ + announce_entry& ooppeerraattoorr== (announce_entry const&) &; │ │ │ │ │ │ │ │ │ │ enum tracker_source │ │ │ │ │ { │ │ │ │ │ source_torrent, │ │ │ │ │ source_client, │ │ │ │ │ source_magnet_link, │ │ │ │ │ source_tex, │ │ │ │ │ @@ -101,20 +101,20 @@ │ │ │ │ │ std::vector endpoints; │ │ │ │ │ std::uint8_t ttiieerr = 0; │ │ │ │ │ std::uint8_t ffaaiill__lliimmiitt = 0; │ │ │ │ │ std::uint8_t source:4; │ │ │ │ │ bool verified:1; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aannnnoouunnccee__eennttrryy(()) ooppeerraattoorr==(()) ~~aannnnoouunnccee__eennttrryy(()) ********** │ │ │ │ │ -announce_entry& ooppeerraattoorr== (announce_entry const&) &; │ │ │ │ │ -~~aannnnoouunnccee__eennttrryy (); │ │ │ │ │ -aannnnoouunnccee__eennttrryy (announce_entry const&); │ │ │ │ │ +********** ooppeerraattoorr==(()) ~~aannnnoouunnccee__eennttrryy(()) aannnnoouunnccee__eennttrryy(()) ********** │ │ │ │ │ aannnnoouunnccee__eennttrryy (); │ │ │ │ │ +aannnnoouunnccee__eennttrryy (announce_entry const&); │ │ │ │ │ +~~aannnnoouunnccee__eennttrryy (); │ │ │ │ │ explicit aannnnoouunnccee__eennttrryy (string_view u); │ │ │ │ │ +announce_entry& ooppeerraattoorr== (announce_entry const&) &; │ │ │ │ │ constructs a tracker announce _e_n_t_r_y with u as the URL. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** eennuumm ttrraacckkeerr__ssoouurrccee ********** │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_a_n_n_o_u_n_c_e___e_n_t_r_y_._h_p_p" │ │ │ │ │ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ |_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_s_o_u_r_c_e___t_o_r_r_e_n_t_ _ _ _ _|_1_ _ _ _ _|_t_h_e_ _t_r_a_c_k_e_r_ _w_a_s_ _p_a_r_t_ _o_f_ _t_h_e_ _._t_o_r_r_e_n_t_ _f_i_l_e_ _ _ _ _ _ _ _ _ _ | │ │ │ ├── ./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Utility.html │ │ │ │ @@ -28,184 +28,62 @@ │ │ │ │ │ │ │ │ │ │ │ │
    source_torrent1the tracker was part of the .torrent file
    source_client2the tracker was added programmatically via the add_tracker() functionthe tracker was added programmatically via the add_tracker() function
    source_magnet_link4the tracker was part of a magnet link
    source_tex82.0.11
    │ │ │ │

    home

    │ │ │ │
    │ │ │ │

    Table of contents

    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -

    hasher

    │ │ │ │ -

    Declared in "libtorrent/hasher.hpp"

    │ │ │ │ -

    this is a SHA-1 hash class.

    │ │ │ │ -

    You use it by first instantiating it, then call update() to feed it │ │ │ │ -with data. i.e. you don't have to keep the entire buffer of which you want to │ │ │ │ -create the hash in memory. You can feed the hasher parts of it at a time. When │ │ │ │ -You have fed the hasher with all the data, you call final() and it │ │ │ │ -will return the sha1-hash of the data.

    │ │ │ │ -

    The constructor that takes a char const* and an integer will construct the │ │ │ │ -sha1 context and feed it the data passed in.

    │ │ │ │ -

    If you want to reuse the hasher object once you have created a hash, you have to │ │ │ │ -call reset() to reinitialize it.

    │ │ │ │ -

    The built-in software version of sha1-algorithm was implemented │ │ │ │ -by Steve Reid and released as public domain. │ │ │ │ -For more info, see src/sha1.cpp.

    │ │ │ │ -
    │ │ │ │ -class hasher
    │ │ │ │ -{
    │ │ │ │ -   hasher ();
    │ │ │ │ -   hasher (char const* data, int len);
    │ │ │ │ -   hasher& operator= (hasher const&) &;
    │ │ │ │ -   hasher (hasher const&);
    │ │ │ │ -   explicit hasher (span<char const> data);
    │ │ │ │ -   hasher& update (span<char const> data);
    │ │ │ │ -   hasher& update (char const* data, int len);
    │ │ │ │ -   sha1_hash final ();
    │ │ │ │ -   void reset ();
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -

    hasher() operator=()

    │ │ │ │ -
    │ │ │ │ -hasher (char const* data, int len);
    │ │ │ │ -hasher& operator= (hasher const&) &;
    │ │ │ │ -hasher (hasher const&);
    │ │ │ │ -explicit hasher (span<char const> data);
    │ │ │ │ -
    │ │ │ │ -

    this is the same as default constructing followed by a call to │ │ │ │ -update(data, len).

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    update()

    │ │ │ │ -
    │ │ │ │ -hasher& update (span<char const> data);
    │ │ │ │ -hasher& update (char const* data, int len);
    │ │ │ │ -
    │ │ │ │ -

    append the following bytes to what is being hashed

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    final()

    │ │ │ │ -
    │ │ │ │ -sha1_hash final ();
    │ │ │ │ -
    │ │ │ │ -

    returns the SHA-1 digest of the buffers previously passed to │ │ │ │ -update() and the hasher constructor.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    reset()

    │ │ │ │ -
    │ │ │ │ -void reset ();
    │ │ │ │ -
    │ │ │ │ -

    restore the hasher state to be as if the hasher has just been │ │ │ │ -default constructed.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    hasher256

    │ │ │ │ -

    Declared in "libtorrent/hasher.hpp"

    │ │ │ │ -
    │ │ │ │ -class hasher256
    │ │ │ │ -{
    │ │ │ │ -   hasher256 ();
    │ │ │ │ -   hasher256 (char const* data, int len);
    │ │ │ │ -   explicit hasher256 (span<char const> data);
    │ │ │ │ -   hasher256 (hasher256 const&);
    │ │ │ │ -   hasher256& operator= (hasher256 const&) &;
    │ │ │ │ -   hasher256& update (char const* data, int len);
    │ │ │ │ -   hasher256& update (span<char const> data);
    │ │ │ │ -   sha256_hash final ();
    │ │ │ │ -   void reset ();
    │ │ │ │ -   ~hasher256 ();
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -

    hasher256() operator=()

    │ │ │ │ -
    │ │ │ │ -hasher256 (char const* data, int len);
    │ │ │ │ -explicit hasher256 (span<char const> data);
    │ │ │ │ -hasher256 (hasher256 const&);
    │ │ │ │ -hasher256& operator= (hasher256 const&) &;
    │ │ │ │ -
    │ │ │ │ -

    this is the same as default constructing followed by a call to │ │ │ │ -update(data, len).

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    update()

    │ │ │ │ -
    │ │ │ │ -hasher256& update (char const* data, int len);
    │ │ │ │ -hasher256& update (span<char const> data);
    │ │ │ │ -
    │ │ │ │ -

    append the following bytes to what is being hashed

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    final()

    │ │ │ │ -
    │ │ │ │ -sha256_hash final ();
    │ │ │ │ -
    │ │ │ │ -

    returns the SHA-1 digest of the buffers previously passed to │ │ │ │ -update() and the hasher constructor.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    reset()

    │ │ │ │ -
    │ │ │ │ -void reset ();
    │ │ │ │ -
    │ │ │ │ -

    restore the hasher state to be as if the hasher has just been │ │ │ │ -default constructed.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ +[report issue]
    │ │ │ │

    bitfield

    │ │ │ │

    Declared in "libtorrent/bitfield.hpp"

    │ │ │ │

    The bitfield type stores any number of bits as a bitfield │ │ │ │ in a heap allocated array.

    │ │ │ │
    │ │ │ │  struct bitfield
    │ │ │ │  {
    │ │ │ │ +   explicit bitfield (int bits);
    │ │ │ │     bitfield (int bits, bool val);
    │ │ │ │     bitfield (char const* b, int bits);
    │ │ │ │ +   bitfield () noexcept = default;
    │ │ │ │     bitfield (bitfield const& rhs);
    │ │ │ │ -   explicit bitfield (int bits);
    │ │ │ │     bitfield (bitfield&& rhs) noexcept = default;
    │ │ │ │ -   bitfield () noexcept = default;
    │ │ │ │     void assign (char const* b, int const bits);
    │ │ │ │     bool get_bit (int index) const noexcept;
    │ │ │ │     bool operator[] (int index) const noexcept;
    │ │ │ │     void clear_bit (int index) noexcept;
    │ │ │ │     void set_bit (int index) noexcept;
    │ │ │ │     bool all_set () const noexcept;
    │ │ │ │     bool none_set () const noexcept;
    │ │ │ │ @@ -221,20 +99,20 @@
    │ │ │ │     int find_last_clear () const noexcept;
    │ │ │ │     bool operator== (lt::bitfield const& rhs) const;
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ [report issue]
    │ │ │ │

    bitfield()

    │ │ │ │
    │ │ │ │ +explicit bitfield (int bits);
    │ │ │ │  bitfield (int bits, bool val);
    │ │ │ │  bitfield (char const* b, int bits);
    │ │ │ │ +bitfield () noexcept = default;
    │ │ │ │  bitfield (bitfield const& rhs);
    │ │ │ │ -explicit bitfield (int bits);
    │ │ │ │  bitfield (bitfield&& rhs) noexcept = default;
    │ │ │ │ -bitfield () noexcept = default;
    │ │ │ │  
    │ │ │ │

    constructs a new bitfield. The default constructor creates an empty │ │ │ │ bitfield. bits is the size of the bitfield (specified in bits). │ │ │ │ val is the value to initialize the bits to. If not specified │ │ │ │ all bits are initialized to 0.

    │ │ │ │

    The constructor taking a pointer b and bits copies a bitfield │ │ │ │ from the specified buffer, and bits number of bits (rounded up to │ │ │ │ @@ -252,18 +130,18 @@ │ │ │ │

    │ │ │ │

    get_bit() operator[]()

    │ │ │ │
    │ │ │ │  bool get_bit (int index) const noexcept;
    │ │ │ │  bool operator[] (int index) const noexcept;
    │ │ │ │  
    │ │ │ │

    query bit at index. Returns true if bit is 1, otherwise false.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    clear_bit() set_bit()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_bit() clear_bit()

    │ │ │ │
    │ │ │ │  void clear_bit (int index) noexcept;
    │ │ │ │  void set_bit (int index) noexcept;
    │ │ │ │  
    │ │ │ │

    set bit at index to 0 (clear_bit) or 1 (set_bit).

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │ @@ -342,14 +220,136 @@ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    find_last_clear()

    │ │ │ │
    │ │ │ │  int find_last_clear () const noexcept;
    │ │ │ │  
    │ │ │ │

    returns the index to the last cleared bit in the bitfield, i.e. 0 bit.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    hasher

    │ │ │ │ +

    Declared in "libtorrent/hasher.hpp"

    │ │ │ │ +

    this is a SHA-1 hash class.

    │ │ │ │ +

    You use it by first instantiating it, then call update() to feed it │ │ │ │ +with data. i.e. you don't have to keep the entire buffer of which you want to │ │ │ │ +create the hash in memory. You can feed the hasher parts of it at a time. When │ │ │ │ +You have fed the hasher with all the data, you call final() and it │ │ │ │ +will return the sha1-hash of the data.

    │ │ │ │ +

    The constructor that takes a char const* and an integer will construct the │ │ │ │ +sha1 context and feed it the data passed in.

    │ │ │ │ +

    If you want to reuse the hasher object once you have created a hash, you have to │ │ │ │ +call reset() to reinitialize it.

    │ │ │ │ +

    The built-in software version of sha1-algorithm was implemented │ │ │ │ +by Steve Reid and released as public domain. │ │ │ │ +For more info, see src/sha1.cpp.

    │ │ │ │ +
    │ │ │ │ +class hasher
    │ │ │ │ +{
    │ │ │ │ +   hasher ();
    │ │ │ │ +   explicit hasher (span<char const> data);
    │ │ │ │ +   hasher (hasher const&);
    │ │ │ │ +   hasher (char const* data, int len);
    │ │ │ │ +   hasher& operator= (hasher const&) &;
    │ │ │ │ +   hasher& update (span<char const> data);
    │ │ │ │ +   hasher& update (char const* data, int len);
    │ │ │ │ +   sha1_hash final ();
    │ │ │ │ +   void reset ();
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    hasher() operator=()

    │ │ │ │ +
    │ │ │ │ +explicit hasher (span<char const> data);
    │ │ │ │ +hasher (hasher const&);
    │ │ │ │ +hasher (char const* data, int len);
    │ │ │ │ +hasher& operator= (hasher const&) &;
    │ │ │ │ +
    │ │ │ │ +

    this is the same as default constructing followed by a call to │ │ │ │ +update(data, len).

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    update()

    │ │ │ │ +
    │ │ │ │ +hasher& update (span<char const> data);
    │ │ │ │ +hasher& update (char const* data, int len);
    │ │ │ │ +
    │ │ │ │ +

    append the following bytes to what is being hashed

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    final()

    │ │ │ │ +
    │ │ │ │ +sha1_hash final ();
    │ │ │ │ +
    │ │ │ │ +

    returns the SHA-1 digest of the buffers previously passed to │ │ │ │ +update() and the hasher constructor.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    reset()

    │ │ │ │ +
    │ │ │ │ +void reset ();
    │ │ │ │ +
    │ │ │ │ +

    restore the hasher state to be as if the hasher has just been │ │ │ │ +default constructed.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    hasher256

    │ │ │ │ +

    Declared in "libtorrent/hasher.hpp"

    │ │ │ │ +
    │ │ │ │ +class hasher256
    │ │ │ │ +{
    │ │ │ │ +   hasher256 ();
    │ │ │ │ +   hasher256 (hasher256 const&);
    │ │ │ │ +   hasher256& operator= (hasher256 const&) &;
    │ │ │ │ +   hasher256 (char const* data, int len);
    │ │ │ │ +   explicit hasher256 (span<char const> data);
    │ │ │ │ +   hasher256& update (span<char const> data);
    │ │ │ │ +   hasher256& update (char const* data, int len);
    │ │ │ │ +   sha256_hash final ();
    │ │ │ │ +   void reset ();
    │ │ │ │ +   ~hasher256 ();
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    operator=() hasher256()

    │ │ │ │ +
    │ │ │ │ +hasher256 (hasher256 const&);
    │ │ │ │ +hasher256& operator= (hasher256 const&) &;
    │ │ │ │ +hasher256 (char const* data, int len);
    │ │ │ │ +explicit hasher256 (span<char const> data);
    │ │ │ │ +
    │ │ │ │ +

    this is the same as default constructing followed by a call to │ │ │ │ +update(data, len).

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    update()

    │ │ │ │ +
    │ │ │ │ +hasher256& update (span<char const> data);
    │ │ │ │ +hasher256& update (char const* data, int len);
    │ │ │ │ +
    │ │ │ │ +

    append the following bytes to what is being hashed

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    final()

    │ │ │ │ +
    │ │ │ │ +sha256_hash final ();
    │ │ │ │ +
    │ │ │ │ +

    returns the SHA-1 digest of the buffers previously passed to │ │ │ │ +update() and the hasher constructor.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    reset()

    │ │ │ │ +
    │ │ │ │ +void reset ();
    │ │ │ │ +
    │ │ │ │ +

    restore the hasher state to be as if the hasher has just been │ │ │ │ +default constructed.

    │ │ │ │
    │ │ │ │
    │ │ │ │ │ │ │ │
    │ │ │ │
    │ │ │ │
    │ │ │ │
    │ │ │ │ ├── html2text {} │ │ │ │ │ @@ -1,140 +1,51 @@ │ │ │ │ │ > │ │ │ │ │ _[_l_i_b_t_o_r_r_e_n_t_ _l_o_g_o_] │ │ │ │ │ VVeerrssiioonn:: 2.0.11 │ │ │ │ │ _h_o_m_e │ │ │ │ │ Table of contents │ │ │ │ │ - * _h_a_s_h_e_r │ │ │ │ │ - o _h_a_s_h_e_r_(_)_ _o_p_e_r_a_t_o_r_=_(_) │ │ │ │ │ - o _u_p_d_a_t_e_(_) │ │ │ │ │ - o _f_i_n_a_l_(_) │ │ │ │ │ - o _r_e_s_e_t_(_) │ │ │ │ │ - * _h_a_s_h_e_r_2_5_6 │ │ │ │ │ - o _h_a_s_h_e_r_2_5_6_(_)_ _o_p_e_r_a_t_o_r_=_(_) │ │ │ │ │ - o _u_p_d_a_t_e_(_) │ │ │ │ │ - o _f_i_n_a_l_(_) │ │ │ │ │ - o _r_e_s_e_t_(_) │ │ │ │ │ * _b_i_t_f_i_e_l_d │ │ │ │ │ o _b_i_t_f_i_e_l_d_(_) │ │ │ │ │ o _a_s_s_i_g_n_(_) │ │ │ │ │ o _g_e_t___b_i_t_(_)_ _o_p_e_r_a_t_o_r_[_]_(_) │ │ │ │ │ - o _c_l_e_a_r___b_i_t_(_)_ _s_e_t___b_i_t_(_) │ │ │ │ │ + o _s_e_t___b_i_t_(_)_ _c_l_e_a_r___b_i_t_(_) │ │ │ │ │ o _a_l_l___s_e_t_(_) │ │ │ │ │ o _n_o_n_e___s_e_t_(_) │ │ │ │ │ o _s_i_z_e_(_) │ │ │ │ │ o _n_u_m___w_o_r_d_s_(_) │ │ │ │ │ o _n_u_m___b_y_t_e_s_(_) │ │ │ │ │ o _e_m_p_t_y_(_) │ │ │ │ │ o _d_a_t_a_(_) │ │ │ │ │ o _s_w_a_p_(_) │ │ │ │ │ o _c_o_u_n_t_(_) │ │ │ │ │ o _f_i_n_d___f_i_r_s_t___s_e_t_(_) │ │ │ │ │ o _f_i_n_d___l_a_s_t___c_l_e_a_r_(_) │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ hhaasshheerr ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_h_a_s_h_e_r_._h_p_p" │ │ │ │ │ -this is a SHA-1 hash class. │ │ │ │ │ -You use it by first instantiating it, then call update() to feed it with data. │ │ │ │ │ -i.e. you don't have to keep the entire buffer of which you want to create the │ │ │ │ │ -hash in memory. You can feed the _h_a_s_h_e_r parts of it at a time. When You have │ │ │ │ │ -fed the _h_a_s_h_e_r with all the data, you call final() and it will return the sha1- │ │ │ │ │ -hash of the data. │ │ │ │ │ -The constructor that takes a char const* and an integer will construct the sha1 │ │ │ │ │ -context and feed it the data passed in. │ │ │ │ │ -If you want to reuse the _h_a_s_h_e_r object once you have created a hash, you have │ │ │ │ │ -to call reset() to reinitialize it. │ │ │ │ │ -The built-in software version of sha1-algorithm was implemented by Steve Reid │ │ │ │ │ -and released as public domain. For more info, see src/sha1.cpp. │ │ │ │ │ -class hasher │ │ │ │ │ -{ │ │ │ │ │ - hhaasshheerr (); │ │ │ │ │ - hhaasshheerr (char const* data, int len); │ │ │ │ │ - hasher& ooppeerraattoorr== (hasher const&) &; │ │ │ │ │ - hhaasshheerr (hasher const&); │ │ │ │ │ - explicit hhaasshheerr (span data); │ │ │ │ │ - hasher& uuppddaattee (span data); │ │ │ │ │ - hasher& uuppddaattee (char const* data, int len); │ │ │ │ │ - sha1_hash ffiinnaall (); │ │ │ │ │ - void rreesseett (); │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** hhaasshheerr(()) ooppeerraattoorr==(()) ********** │ │ │ │ │ -hhaasshheerr (char const* data, int len); │ │ │ │ │ -hasher& ooppeerraattoorr== (hasher const&) &; │ │ │ │ │ -hhaasshheerr (hasher const&); │ │ │ │ │ -explicit hhaasshheerr (span data); │ │ │ │ │ -this is the same as default constructing followed by a call to update(data, │ │ │ │ │ -len). │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** uuppddaattee(()) ********** │ │ │ │ │ -hasher& uuppddaattee (span data); │ │ │ │ │ -hasher& uuppddaattee (char const* data, int len); │ │ │ │ │ -append the following bytes to what is being hashed │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiinnaall(()) ********** │ │ │ │ │ -sha1_hash ffiinnaall (); │ │ │ │ │ -returns the SHA-1 digest of the buffers previously passed to _u_p_d_a_t_e_(_) and the │ │ │ │ │ -_h_a_s_h_e_r constructor. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** rreesseett(()) ********** │ │ │ │ │ -void rreesseett (); │ │ │ │ │ -restore the _h_a_s_h_e_r state to be as if the _h_a_s_h_e_r has just been default │ │ │ │ │ -constructed. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ hhaasshheerr225566 ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_h_a_s_h_e_r_._h_p_p" │ │ │ │ │ -class hasher256 │ │ │ │ │ -{ │ │ │ │ │ - hhaasshheerr225566 (); │ │ │ │ │ - hhaasshheerr225566 (char const* data, int len); │ │ │ │ │ - explicit hhaasshheerr225566 (span data); │ │ │ │ │ - hhaasshheerr225566 (hasher256 const&); │ │ │ │ │ - hasher256& ooppeerraattoorr== (hasher256 const&) &; │ │ │ │ │ - hasher256& uuppddaattee (char const* data, int len); │ │ │ │ │ - hasher256& uuppddaattee (span data); │ │ │ │ │ - sha256_hash ffiinnaall (); │ │ │ │ │ - void rreesseett (); │ │ │ │ │ - ~~hhaasshheerr225566 (); │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** hhaasshheerr225566(()) ooppeerraattoorr==(()) ********** │ │ │ │ │ -hhaasshheerr225566 (char const* data, int len); │ │ │ │ │ -explicit hhaasshheerr225566 (span data); │ │ │ │ │ -hhaasshheerr225566 (hasher256 const&); │ │ │ │ │ -hasher256& ooppeerraattoorr== (hasher256 const&) &; │ │ │ │ │ -this is the same as default constructing followed by a call to update(data, │ │ │ │ │ -len). │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** uuppddaattee(()) ********** │ │ │ │ │ -hasher256& uuppddaattee (char const* data, int len); │ │ │ │ │ -hasher256& uuppddaattee (span data); │ │ │ │ │ -append the following bytes to what is being hashed │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiinnaall(()) ********** │ │ │ │ │ -sha256_hash ffiinnaall (); │ │ │ │ │ -returns the SHA-1 digest of the buffers previously passed to _u_p_d_a_t_e_(_) and the │ │ │ │ │ -_h_a_s_h_e_r constructor. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** rreesseett(()) ********** │ │ │ │ │ -void rreesseett (); │ │ │ │ │ -restore the _h_a_s_h_e_r state to be as if the _h_a_s_h_e_r has just been default │ │ │ │ │ -constructed. │ │ │ │ │ + * _h_a_s_h_e_r │ │ │ │ │ + o _h_a_s_h_e_r_(_)_ _o_p_e_r_a_t_o_r_=_(_) │ │ │ │ │ + o _u_p_d_a_t_e_(_) │ │ │ │ │ + o _f_i_n_a_l_(_) │ │ │ │ │ + o _r_e_s_e_t_(_) │ │ │ │ │ + * _h_a_s_h_e_r_2_5_6 │ │ │ │ │ + o _o_p_e_r_a_t_o_r_=_(_)_ _h_a_s_h_e_r_2_5_6_(_) │ │ │ │ │ + o _u_p_d_a_t_e_(_) │ │ │ │ │ + o _f_i_n_a_l_(_) │ │ │ │ │ + o _r_e_s_e_t_(_) │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ bbiittffiieelldd ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_b_i_t_f_i_e_l_d_._h_p_p" │ │ │ │ │ The _b_i_t_f_i_e_l_d type stores any number of bits as a _b_i_t_f_i_e_l_d in a heap allocated │ │ │ │ │ array. │ │ │ │ │ struct bitfield │ │ │ │ │ { │ │ │ │ │ + explicit bbiittffiieelldd (int bits); │ │ │ │ │ bbiittffiieelldd (int bits, bool val); │ │ │ │ │ bbiittffiieelldd (char const* b, int bits); │ │ │ │ │ + bbiittffiieelldd () noexcept = default; │ │ │ │ │ bbiittffiieelldd (bitfield const& rhs); │ │ │ │ │ - explicit bbiittffiieelldd (int bits); │ │ │ │ │ bbiittffiieelldd (bitfield&& rhs) noexcept = default; │ │ │ │ │ - bbiittffiieelldd () noexcept = default; │ │ │ │ │ void aassssiiggnn (char const* b, int const bits); │ │ │ │ │ bool ggeett__bbiitt (int index) const noexcept; │ │ │ │ │ bool ooppeerraattoorr[[]] (int index) const noexcept; │ │ │ │ │ void cclleeaarr__bbiitt (int index) noexcept; │ │ │ │ │ void sseett__bbiitt (int index) noexcept; │ │ │ │ │ bool aallll__sseett () const noexcept; │ │ │ │ │ bool nnoonnee__sseett () const noexcept; │ │ │ │ │ @@ -148,20 +59,20 @@ │ │ │ │ │ int ccoouunntt () const noexcept; │ │ │ │ │ int ffiinndd__ffiirrsstt__sseett () const noexcept; │ │ │ │ │ int ffiinndd__llaasstt__cclleeaarr () const noexcept; │ │ │ │ │ bool ooppeerraattoorr==== (lt::bitfield const& rhs) const; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** bbiittffiieelldd(()) ********** │ │ │ │ │ +explicit bbiittffiieelldd (int bits); │ │ │ │ │ bbiittffiieelldd (int bits, bool val); │ │ │ │ │ bbiittffiieelldd (char const* b, int bits); │ │ │ │ │ +bbiittffiieelldd () noexcept = default; │ │ │ │ │ bbiittffiieelldd (bitfield const& rhs); │ │ │ │ │ -explicit bbiittffiieelldd (int bits); │ │ │ │ │ bbiittffiieelldd (bitfield&& rhs) noexcept = default; │ │ │ │ │ -bbiittffiieelldd () noexcept = default; │ │ │ │ │ constructs a new _b_i_t_f_i_e_l_d. The default constructor creates an empty _b_i_t_f_i_e_l_d. │ │ │ │ │ bits is the size of the _b_i_t_f_i_e_l_d (specified in bits). val is the value to │ │ │ │ │ initialize the bits to. If not specified all bits are initialized to 0. │ │ │ │ │ The constructor taking a pointer b and bits copies a _b_i_t_f_i_e_l_d from the │ │ │ │ │ specified buffer, and bits number of bits (rounded up to the nearest byte │ │ │ │ │ boundary). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ @@ -171,15 +82,15 @@ │ │ │ │ │ byte boundary. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ggeett__bbiitt(()) ooppeerraattoorr[[]](()) ********** │ │ │ │ │ bool ggeett__bbiitt (int index) const noexcept; │ │ │ │ │ bool ooppeerraattoorr[[]] (int index) const noexcept; │ │ │ │ │ query bit at index. Returns true if bit is 1, otherwise false. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** cclleeaarr__bbiitt(()) sseett__bbiitt(()) ********** │ │ │ │ │ +********** sseett__bbiitt(()) cclleeaarr__bbiitt(()) ********** │ │ │ │ │ void cclleeaarr__bbiitt (int index) noexcept; │ │ │ │ │ void sseett__bbiitt (int index) noexcept; │ │ │ │ │ set bit at index to 0 (clear_bit) or 1 (set_bit). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** aallll__sseett(()) ********** │ │ │ │ │ bool aallll__sseett () const noexcept; │ │ │ │ │ returns true if all bits in the _b_i_t_f_i_e_l_d are set │ │ │ │ │ @@ -222,14 +133,103 @@ │ │ │ │ │ ********** ffiinndd__ffiirrsstt__sseett(()) ********** │ │ │ │ │ int ffiinndd__ffiirrsstt__sseett () const noexcept; │ │ │ │ │ returns the index of the first set bit in the _b_i_t_f_i_e_l_d, i.e. 1 bit. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ffiinndd__llaasstt__cclleeaarr(()) ********** │ │ │ │ │ int ffiinndd__llaasstt__cclleeaarr () const noexcept; │ │ │ │ │ returns the index to the last cleared bit in the _b_i_t_f_i_e_l_d, i.e. 0 bit. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ hhaasshheerr ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_h_a_s_h_e_r_._h_p_p" │ │ │ │ │ +this is a SHA-1 hash class. │ │ │ │ │ +You use it by first instantiating it, then call update() to feed it with data. │ │ │ │ │ +i.e. you don't have to keep the entire buffer of which you want to create the │ │ │ │ │ +hash in memory. You can feed the _h_a_s_h_e_r parts of it at a time. When You have │ │ │ │ │ +fed the _h_a_s_h_e_r with all the data, you call final() and it will return the sha1- │ │ │ │ │ +hash of the data. │ │ │ │ │ +The constructor that takes a char const* and an integer will construct the sha1 │ │ │ │ │ +context and feed it the data passed in. │ │ │ │ │ +If you want to reuse the _h_a_s_h_e_r object once you have created a hash, you have │ │ │ │ │ +to call reset() to reinitialize it. │ │ │ │ │ +The built-in software version of sha1-algorithm was implemented by Steve Reid │ │ │ │ │ +and released as public domain. For more info, see src/sha1.cpp. │ │ │ │ │ +class hasher │ │ │ │ │ +{ │ │ │ │ │ + hhaasshheerr (); │ │ │ │ │ + explicit hhaasshheerr (span data); │ │ │ │ │ + hhaasshheerr (hasher const&); │ │ │ │ │ + hhaasshheerr (char const* data, int len); │ │ │ │ │ + hasher& ooppeerraattoorr== (hasher const&) &; │ │ │ │ │ + hasher& uuppddaattee (span data); │ │ │ │ │ + hasher& uuppddaattee (char const* data, int len); │ │ │ │ │ + sha1_hash ffiinnaall (); │ │ │ │ │ + void rreesseett (); │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** hhaasshheerr(()) ooppeerraattoorr==(()) ********** │ │ │ │ │ +explicit hhaasshheerr (span data); │ │ │ │ │ +hhaasshheerr (hasher const&); │ │ │ │ │ +hhaasshheerr (char const* data, int len); │ │ │ │ │ +hasher& ooppeerraattoorr== (hasher const&) &; │ │ │ │ │ +this is the same as default constructing followed by a call to update(data, │ │ │ │ │ +len). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** uuppddaattee(()) ********** │ │ │ │ │ +hasher& uuppddaattee (span data); │ │ │ │ │ +hasher& uuppddaattee (char const* data, int len); │ │ │ │ │ +append the following bytes to what is being hashed │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ffiinnaall(()) ********** │ │ │ │ │ +sha1_hash ffiinnaall (); │ │ │ │ │ +returns the SHA-1 digest of the buffers previously passed to _u_p_d_a_t_e_(_) and the │ │ │ │ │ +_h_a_s_h_e_r constructor. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** rreesseett(()) ********** │ │ │ │ │ +void rreesseett (); │ │ │ │ │ +restore the _h_a_s_h_e_r state to be as if the _h_a_s_h_e_r has just been default │ │ │ │ │ +constructed. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ hhaasshheerr225566 ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_h_a_s_h_e_r_._h_p_p" │ │ │ │ │ +class hasher256 │ │ │ │ │ +{ │ │ │ │ │ + hhaasshheerr225566 (); │ │ │ │ │ + hhaasshheerr225566 (hasher256 const&); │ │ │ │ │ + hasher256& ooppeerraattoorr== (hasher256 const&) &; │ │ │ │ │ + hhaasshheerr225566 (char const* data, int len); │ │ │ │ │ + explicit hhaasshheerr225566 (span data); │ │ │ │ │ + hasher256& uuppddaattee (span data); │ │ │ │ │ + hasher256& uuppddaattee (char const* data, int len); │ │ │ │ │ + sha256_hash ffiinnaall (); │ │ │ │ │ + void rreesseett (); │ │ │ │ │ + ~~hhaasshheerr225566 (); │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ooppeerraattoorr==(()) hhaasshheerr225566(()) ********** │ │ │ │ │ +hhaasshheerr225566 (hasher256 const&); │ │ │ │ │ +hasher256& ooppeerraattoorr== (hasher256 const&) &; │ │ │ │ │ +hhaasshheerr225566 (char const* data, int len); │ │ │ │ │ +explicit hhaasshheerr225566 (span data); │ │ │ │ │ +this is the same as default constructing followed by a call to update(data, │ │ │ │ │ +len). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** uuppddaattee(()) ********** │ │ │ │ │ +hasher256& uuppddaattee (span data); │ │ │ │ │ +hasher256& uuppddaattee (char const* data, int len); │ │ │ │ │ +append the following bytes to what is being hashed │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ffiinnaall(()) ********** │ │ │ │ │ +sha256_hash ffiinnaall (); │ │ │ │ │ +returns the SHA-1 digest of the buffers previously passed to _u_p_d_a_t_e_(_) and the │ │ │ │ │ +_h_a_s_h_e_r constructor. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** rreesseett(()) ********** │ │ │ │ │ +void rreesseett (); │ │ │ │ │ +restore the _h_a_s_h_e_r state to be as if the _h_a_s_h_e_r has just been default │ │ │ │ │ +constructed. │ │ │ │ │ _h_o_m_e │ │ │ │ │ _b_l_o_g │ │ │ │ │ _u_T_P │ │ │ │ │ _d_o_w_n_l_o_a_d │ │ │ │ │ _d_o_c_u_m_e_n_t_a_t_i_o_n │ │ │ │ │ _D_H_T_ _p_u_t_ _e_x_t_e_n_s_i_o_n │ │ │ │ │ _p_y_t_h_o_n_ _b_i_n_d_i_n_g_s │ │ │ ├── ./usr/share/doc/libtorrent-rasterbar-doc/html/reference.html │ │ │ │┄ Ordering differences only │ │ │ │ @@ -21,61 +21,38 @@ │ │ │ │
    │ │ │ │

    reference documentation

    │ │ │ │ │ │ │ │

    single-page version

    │ │ │ │
    │ │ │ │

    Core

    │ │ │ │
    │ │ │ │ - │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ │ │ │ │ + │ │ │ │ │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ -
    │ │ │ │ -

    Torrent Handle

    │ │ │ │ -
    │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -
    │ │ │ │ -

    Torrent Info

    │ │ │ │ -
    │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -
    │ │ │ │ -

    Session

    │ │ │ │ -
    │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │
    │ │ │ │

    Stats

    │ │ │ │
    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ @@ -88,144 +65,167 @@ │ │ │ │
    │ │ │ │

    Trackers

    │ │ │ │
    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
    │ │ │ │ -

    Torrent Status

    │ │ │ │ +

    Session

    │ │ │ │
    │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +
    │ │ │ │ +

    Torrent Info

    │ │ │ │ +
    │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +
    │ │ │ │ +

    Torrent Handle

    │ │ │ │ +
    │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │
    │ │ │ │

    Settings

    │ │ │ │
    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ │ │ │ │ + │ │ │ │ │ │ │ │ + │ │ │ │ +
    │ │ │ │ +

    Torrent Status

    │ │ │ │ +
    │ │ │ │ + │ │ │ │
    │ │ │ │

    DHT

    │ │ │ │
    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
    │ │ │ │

    Resume Data

    │ │ │ │
    │ │ │ │ - │ │ │ │ - │ │ │ │ │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ + │ │ │ │ │ │ │ │
    │ │ │ │
    │ │ │ │
    │ │ │ │ -

    Filter

    │ │ │ │ -
    │ │ │ │ - │ │ │ │ - │ │ │ │ -
    │ │ │ │

    Error Codes

    │ │ │ │
    │ │ │ │ │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │
    │ │ │ │ -

    Bdecoding

    │ │ │ │ +

    Create Torrents

    │ │ │ │
    │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +
    │ │ │ │ +

    Filter

    │ │ │ │ +
    │ │ │ │ + │ │ │ │ + │ │ │ │
    │ │ │ │

    Bencoding

    │ │ │ │
    │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ │ │ │ │ + │ │ │ │
    │ │ │ │ -

    Create Torrents

    │ │ │ │ +

    Bdecoding

    │ │ │ │
    │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │
    │ │ │ │
    │ │ │ │
    │ │ │ │ -

    Utility

    │ │ │ │ +

    Custom Storage

    │ │ │ │
    │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │
    │ │ │ │

    Storage

    │ │ │ │
    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
    │ │ │ │

    Plugins

    │ │ │ │
    │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ + │ │ │ │ │ │ │ │
    │ │ │ │

    PeerClass

    │ │ │ │
    │ │ │ │ - │ │ │ │ │ │ │ │ + │ │ │ │
    │ │ │ │ -

    Custom Storage

    │ │ │ │ +

    Utility

    │ │ │ │
    │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │
    │ │ │ │

    ed25519

    │ │ │ │
    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ @@ -334,16 +334,16 @@ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
    │ │ │ │
    │ │ │ │ │ │ │ │
    │ │ │ │ ├── html2text {} │ │ │ │ │ @@ -1,165 +1,165 @@ │ │ │ │ │ > │ │ │ │ │ _[_l_i_b_t_o_r_r_e_n_t_ _l_o_g_o_] │ │ │ │ │ ************ rreeffeerreennccee ddooccuummeennttaattiioonn ************ │ │ │ │ │ _s_i_n_g_l_e_-_p_a_g_e_ _v_e_r_s_i_o_n │ │ │ │ │ Core │ │ │ │ │ -_p_i_e_c_e___b_l_o_c_k │ │ │ │ │ _i_n_f_o___h_a_s_h___t │ │ │ │ │ _p_e_e_r___i_n_f_o │ │ │ │ │ _p_e_e_r___r_e_q_u_e_s_t │ │ │ │ │ +_p_i_e_c_e___b_l_o_c_k │ │ │ │ │ +_l_o_a_d___t_o_r_r_e_n_t___f_i_l_e_(_) │ │ │ │ │ +_l_o_a_d___t_o_r_r_e_n_t___b_u_f_f_e_r_(_) │ │ │ │ │ +_l_o_a_d___t_o_r_r_e_n_t___p_a_r_s_e_d_(_) │ │ │ │ │ _t_o_r_r_e_n_t___p_e_e_r___e_q_u_a_l_(_) │ │ │ │ │ +_v_e_r_s_i_o_n_(_) │ │ │ │ │ _m_a_k_e___m_a_g_n_e_t___u_r_i_(_) │ │ │ │ │ _p_a_r_s_e___m_a_g_n_e_t___u_r_i_(_) │ │ │ │ │ _t_r_u_n_c_a_t_e___f_i_l_e_s_(_) │ │ │ │ │ -_v_e_r_s_i_o_n_(_) │ │ │ │ │ -_l_o_a_d___t_o_r_r_e_n_t___p_a_r_s_e_d_(_) │ │ │ │ │ -_l_o_a_d___t_o_r_r_e_n_t___b_u_f_f_e_r_(_) │ │ │ │ │ -_l_o_a_d___t_o_r_r_e_n_t___f_i_l_e_(_) │ │ │ │ │ _p_r_o_t_o_c_o_l___v_e_r_s_i_o_n │ │ │ │ │ +_c_o_n_n_e_c_t_i_o_n___t_y_p_e │ │ │ │ │ _s_o_c_k_e_t___t_y_p_e___t │ │ │ │ │ +_e_v_e_n_t___t │ │ │ │ │ _p_o_r_t_m_a_p___t_r_a_n_s_p_o_r_t │ │ │ │ │ _p_o_r_t_m_a_p___p_r_o_t_o_c_o_l │ │ │ │ │ -_e_v_e_n_t___t │ │ │ │ │ -_c_o_n_n_e_c_t_i_o_n___t_y_p_e │ │ │ │ │ -_t_o_r_r_e_n_t___f_l_a_g_s___t │ │ │ │ │ -_p_e_x___f_l_a_g_s___t │ │ │ │ │ -_d_o_w_n_l_o_a_d___p_r_i_o_r_i_t_y___t │ │ │ │ │ _i_n_t │ │ │ │ │ _c_h_a_r_ _c_o_n_s_t_* │ │ │ │ │ _s_t_d_:_:_u_i_n_t_6_4___t │ │ │ │ │ -Torrent Handle │ │ │ │ │ -_b_l_o_c_k___i_n_f_o │ │ │ │ │ -_p_a_r_t_i_a_l___p_i_e_c_e___i_n_f_o │ │ │ │ │ -_t_o_r_r_e_n_t___h_a_n_d_l_e │ │ │ │ │ -_h_a_s_h___v_a_l_u_e_(_) │ │ │ │ │ -Torrent Info │ │ │ │ │ -_w_e_b___s_e_e_d___e_n_t_r_y │ │ │ │ │ -_l_o_a_d___t_o_r_r_e_n_t___l_i_m_i_t_s │ │ │ │ │ -_t_o_r_r_e_n_t___i_n_f_o │ │ │ │ │ -Session │ │ │ │ │ -_s_e_s_s_i_o_n___p_r_o_x_y │ │ │ │ │ -_s_e_s_s_i_o_n │ │ │ │ │ -_s_e_s_s_i_o_n___p_a_r_a_m_s │ │ │ │ │ -_s_e_s_s_i_o_n___h_a_n_d_l_e │ │ │ │ │ -_w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s___b_u_f_(_) │ │ │ │ │ -_w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ -_r_e_a_d___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ +_t_o_r_r_e_n_t___f_l_a_g_s___t │ │ │ │ │ +_d_o_w_n_l_o_a_d___p_r_i_o_r_i_t_y___t │ │ │ │ │ +_p_e_x___f_l_a_g_s___t │ │ │ │ │ Stats │ │ │ │ │ _s_t_a_t_s___m_e_t_r_i_c │ │ │ │ │ _c_o_u_n_t_e_r_s │ │ │ │ │ _s_e_s_s_i_o_n___s_t_a_t_s___m_e_t_r_i_c_s_(_) │ │ │ │ │ _f_i_n_d___m_e_t_r_i_c___i_d_x_(_) │ │ │ │ │ _m_e_t_r_i_c___t_y_p_e___t │ │ │ │ │ Add Torrent │ │ │ │ │ _c_l_i_e_n_t___d_a_t_a___t │ │ │ │ │ _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s │ │ │ │ │ Trackers │ │ │ │ │ _a_n_n_o_u_n_c_e___i_n_f_o_h_a_s_h │ │ │ │ │ _a_n_n_o_u_n_c_e___e_n_d_p_o_i_n_t │ │ │ │ │ _a_n_n_o_u_n_c_e___e_n_t_r_y │ │ │ │ │ -Torrent Status │ │ │ │ │ -_t_o_r_r_e_n_t___s_t_a_t_u_s │ │ │ │ │ +Session │ │ │ │ │ +_s_e_s_s_i_o_n___p_r_o_x_y │ │ │ │ │ +_s_e_s_s_i_o_n │ │ │ │ │ +_s_e_s_s_i_o_n___h_a_n_d_l_e │ │ │ │ │ +_s_e_s_s_i_o_n___p_a_r_a_m_s │ │ │ │ │ +_w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s___b_u_f_(_) │ │ │ │ │ +_w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ +_r_e_a_d___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ +Torrent Info │ │ │ │ │ +_w_e_b___s_e_e_d___e_n_t_r_y │ │ │ │ │ +_l_o_a_d___t_o_r_r_e_n_t___l_i_m_i_t_s │ │ │ │ │ +_t_o_r_r_e_n_t___i_n_f_o │ │ │ │ │ +Torrent Handle │ │ │ │ │ +_b_l_o_c_k___i_n_f_o │ │ │ │ │ +_p_a_r_t_i_a_l___p_i_e_c_e___i_n_f_o │ │ │ │ │ +_t_o_r_r_e_n_t___h_a_n_d_l_e │ │ │ │ │ +_h_a_s_h___v_a_l_u_e_(_) │ │ │ │ │ Settings │ │ │ │ │ _o_v_e_r_v_i_e_w │ │ │ │ │ _s_e_t_t_i_n_g_s___p_a_c_k │ │ │ │ │ _m_i_n___m_e_m_o_r_y___u_s_a_g_e_(_) │ │ │ │ │ _h_i_g_h___p_e_r_f_o_r_m_a_n_c_e___s_e_e_d_(_) │ │ │ │ │ -_g_e_n_e_r_a_t_e___f_i_n_g_e_r_p_r_i_n_t_(_) │ │ │ │ │ -_n_a_m_e___f_o_r___s_e_t_t_i_n_g_(_) │ │ │ │ │ _s_e_t_t_i_n_g___b_y___n_a_m_e_(_) │ │ │ │ │ +_n_a_m_e___f_o_r___s_e_t_t_i_n_g_(_) │ │ │ │ │ _d_e_f_a_u_l_t___s_e_t_t_i_n_g_s_(_) │ │ │ │ │ +_g_e_n_e_r_a_t_e___f_i_n_g_e_r_p_r_i_n_t_(_) │ │ │ │ │ +Torrent Status │ │ │ │ │ +_t_o_r_r_e_n_t___s_t_a_t_u_s │ │ │ │ │ DHT │ │ │ │ │ _d_h_t___s_t_o_r_a_g_e___c_o_u_n_t_e_r_s │ │ │ │ │ _d_h_t___s_t_o_r_a_g_e___i_n_t_e_r_f_a_c_e │ │ │ │ │ _d_h_t___s_t_a_t_e │ │ │ │ │ _d_h_t___d_e_f_a_u_l_t___s_t_o_r_a_g_e___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ _s_i_g_n___m_u_t_a_b_l_e___i_t_e_m_(_) │ │ │ │ │ _a_n_n_o_u_n_c_e___f_l_a_g_s___t │ │ │ │ │ Resume Data │ │ │ │ │ -_r_e_a_d___r_e_s_u_m_e___d_a_t_a_(_) │ │ │ │ │ -_w_r_i_t_e___r_e_s_u_m_e___d_a_t_a___b_u_f_(_) │ │ │ │ │ _w_r_i_t_e___r_e_s_u_m_e___d_a_t_a_(_) │ │ │ │ │ +_w_r_i_t_e___r_e_s_u_m_e___d_a_t_a___b_u_f_(_) │ │ │ │ │ _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e___b_u_f_(_) │ │ │ │ │ _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e_(_) │ │ │ │ │ +_r_e_a_d___r_e_s_u_m_e___d_a_t_a_(_) │ │ │ │ │ _w_r_i_t_e___t_o_r_r_e_n_t___f_l_a_g_s___t │ │ │ │ │ -Filter │ │ │ │ │ -_i_p___f_i_l_t_e_r │ │ │ │ │ -_p_o_r_t___f_i_l_t_e_r │ │ │ │ │ Error Codes │ │ │ │ │ _s_t_o_r_a_g_e___e_r_r_o_r │ │ │ │ │ +_i_2_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ _l_i_b_t_o_r_r_e_n_t___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ _h_t_t_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ -_i_2_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ -_b_d_e_c_o_d_e___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ +_u_p_n_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ +_g_z_i_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ _p_c_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ _s_o_c_k_s___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ -_g_z_i_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ -_u_p_n_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ +_b_d_e_c_o_d_e___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ +_i_2_p___e_r_r_o_r___c_o_d_e │ │ │ │ │ _e_r_r_o_r___c_o_d_e___e_n_u_m │ │ │ │ │ _h_t_t_p___e_r_r_o_r_s │ │ │ │ │ -_i_2_p___e_r_r_o_r___c_o_d_e │ │ │ │ │ +_e_r_r_o_r___c_o_d_e___e_n_u_m │ │ │ │ │ _e_r_r_o_r___c_o_d_e___e_n_u_m │ │ │ │ │ _p_c_p___e_r_r_o_r_s │ │ │ │ │ _s_o_c_k_s___e_r_r_o_r___c_o_d_e │ │ │ │ │ _e_r_r_o_r___c_o_d_e___e_n_u_m │ │ │ │ │ -_e_r_r_o_r___c_o_d_e___e_n_u_m │ │ │ │ │ -Bdecoding │ │ │ │ │ -_b_d_e_c_o_d_e___n_o_d_e │ │ │ │ │ -_p_r_i_n_t___e_n_t_r_y_(_) │ │ │ │ │ -_b_d_e_c_o_d_e_(_) │ │ │ │ │ -Bencoding │ │ │ │ │ -_o_v_e_r_v_i_e_w │ │ │ │ │ -_e_n_t_r_y │ │ │ │ │ -_b_e_n_c_o_d_e_(_) │ │ │ │ │ -_o_p_e_r_a_t_o_r_<_<_(_) │ │ │ │ │ Create Torrents │ │ │ │ │ _o_v_e_r_v_i_e_w │ │ │ │ │ _c_r_e_a_t_e___t_o_r_r_e_n_t │ │ │ │ │ _a_d_d___f_i_l_e_s_(_) │ │ │ │ │ _s_e_t___p_i_e_c_e___h_a_s_h_e_s_(_) │ │ │ │ │ -Utility │ │ │ │ │ -_h_a_s_h_e_r │ │ │ │ │ -_h_a_s_h_e_r_2_5_6 │ │ │ │ │ -_b_i_t_f_i_e_l_d │ │ │ │ │ +Filter │ │ │ │ │ +_i_p___f_i_l_t_e_r │ │ │ │ │ +_p_o_r_t___f_i_l_t_e_r │ │ │ │ │ +Bencoding │ │ │ │ │ +_o_v_e_r_v_i_e_w │ │ │ │ │ +_e_n_t_r_y │ │ │ │ │ +_o_p_e_r_a_t_o_r_<_<_(_) │ │ │ │ │ +_b_e_n_c_o_d_e_(_) │ │ │ │ │ +Bdecoding │ │ │ │ │ +_b_d_e_c_o_d_e___n_o_d_e │ │ │ │ │ +_p_r_i_n_t___e_n_t_r_y_(_) │ │ │ │ │ +_b_d_e_c_o_d_e_(_) │ │ │ │ │ +Custom Storage │ │ │ │ │ +_o_v_e_r_v_i_e_w │ │ │ │ │ +_d_i_s_k___o_b_s_e_r_v_e_r │ │ │ │ │ +_o_p_e_n___f_i_l_e___s_t_a_t_e │ │ │ │ │ +_d_i_s_k___i_n_t_e_r_f_a_c_e │ │ │ │ │ +_s_t_o_r_a_g_e___h_o_l_d_e_r │ │ │ │ │ +_b_u_f_f_e_r___a_l_l_o_c_a_t_o_r___i_n_t_e_r_f_a_c_e │ │ │ │ │ +_d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r │ │ │ │ │ +_s_e_t_t_i_n_g_s___i_n_t_e_r_f_a_c_e │ │ │ │ │ +_f_i_l_e___o_p_e_n___m_o_d_e___t │ │ │ │ │ Storage │ │ │ │ │ _s_t_o_r_a_g_e___p_a_r_a_m_s │ │ │ │ │ _f_i_l_e___s_l_i_c_e │ │ │ │ │ _f_i_l_e___s_t_o_r_a_g_e │ │ │ │ │ +_m_m_a_p___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ _d_e_f_a_u_l_t___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ -_p_o_s_i_x___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ _d_i_s_a_b_l_e_d___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ -_m_m_a_p___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ +_p_o_s_i_x___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ _s_t_o_r_a_g_e___m_o_d_e___t │ │ │ │ │ _s_t_a_t_u_s___t │ │ │ │ │ _m_o_v_e___f_l_a_g_s___t │ │ │ │ │ Plugins │ │ │ │ │ _o_v_e_r_v_i_e_w │ │ │ │ │ -_p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e │ │ │ │ │ -_b_t___p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e │ │ │ │ │ _p_l_u_g_i_n │ │ │ │ │ _t_o_r_r_e_n_t___p_l_u_g_i_n │ │ │ │ │ _p_e_e_r___p_l_u_g_i_n │ │ │ │ │ _c_r_y_p_t_o___p_l_u_g_i_n │ │ │ │ │ -_c_r_e_a_t_e___s_m_a_r_t___b_a_n___p_l_u_g_i_n_(_) │ │ │ │ │ +_p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e │ │ │ │ │ +_b_t___p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e │ │ │ │ │ _c_r_e_a_t_e___u_t___p_e_x___p_l_u_g_i_n_(_) │ │ │ │ │ +_c_r_e_a_t_e___s_m_a_r_t___b_a_n___p_l_u_g_i_n_(_) │ │ │ │ │ _c_r_e_a_t_e___u_t___m_e_t_a_d_a_t_a___p_l_u_g_i_n_(_) │ │ │ │ │ PeerClass │ │ │ │ │ -_p_e_e_r___c_l_a_s_s___i_n_f_o │ │ │ │ │ _p_e_e_r___c_l_a_s_s___t_y_p_e___f_i_l_t_e_r │ │ │ │ │ -Custom Storage │ │ │ │ │ -_o_v_e_r_v_i_e_w │ │ │ │ │ -_d_i_s_k___o_b_s_e_r_v_e_r │ │ │ │ │ -_o_p_e_n___f_i_l_e___s_t_a_t_e │ │ │ │ │ -_d_i_s_k___i_n_t_e_r_f_a_c_e │ │ │ │ │ -_s_t_o_r_a_g_e___h_o_l_d_e_r │ │ │ │ │ -_s_e_t_t_i_n_g_s___i_n_t_e_r_f_a_c_e │ │ │ │ │ -_b_u_f_f_e_r___a_l_l_o_c_a_t_o_r___i_n_t_e_r_f_a_c_e │ │ │ │ │ -_d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r │ │ │ │ │ -_f_i_l_e___o_p_e_n___m_o_d_e___t │ │ │ │ │ +_p_e_e_r___c_l_a_s_s___i_n_f_o │ │ │ │ │ +Utility │ │ │ │ │ +_b_i_t_f_i_e_l_d │ │ │ │ │ +_h_a_s_h_e_r │ │ │ │ │ +_h_a_s_h_e_r_2_5_6 │ │ │ │ │ ed25519 │ │ │ │ │ _e_d_2_5_5_1_9___c_r_e_a_t_e___s_e_e_d_(_) │ │ │ │ │ _e_d_2_5_5_1_9___c_r_e_a_t_e___k_e_y_p_a_i_r_(_) │ │ │ │ │ _e_d_2_5_5_1_9___s_i_g_n_(_) │ │ │ │ │ _e_d_2_5_5_1_9___v_e_r_i_f_y_(_) │ │ │ │ │ _e_d_2_5_5_1_9___a_d_d___s_c_a_l_a_r_(_) │ │ │ │ │ _e_d_2_5_5_1_9___k_e_y___e_x_c_h_a_n_g_e_(_) │ │ │ │ │ @@ -262,16 +262,16 @@ │ │ │ │ │ _o_v_e_r_s_i_z_e_d___f_i_l_e___a_l_e_r_t │ │ │ │ │ _t_o_r_r_e_n_t___c_o_n_f_l_i_c_t___a_l_e_r_t │ │ │ │ │ _p_e_e_r___i_n_f_o___a_l_e_r_t │ │ │ │ │ _f_i_l_e___p_r_o_g_r_e_s_s___a_l_e_r_t │ │ │ │ │ _p_i_e_c_e___i_n_f_o___a_l_e_r_t │ │ │ │ │ _p_i_e_c_e___a_v_a_i_l_a_b_i_l_i_t_y___a_l_e_r_t │ │ │ │ │ _t_r_a_c_k_e_r___l_i_s_t___a_l_e_r_t │ │ │ │ │ -_a_l_e_r_t___c_a_s_t_(_) │ │ │ │ │ _o_p_e_r_a_t_i_o_n___n_a_m_e_(_) │ │ │ │ │ +_a_l_e_r_t___c_a_s_t_(_) │ │ │ │ │ _o_p_e_r_a_t_i_o_n___t │ │ │ │ │ _a_l_e_r_t___c_a_t_e_g_o_r_y___t │ │ │ │ │ _i_n_t │ │ │ │ │ _h_o_m_e │ │ │ │ │ _b_l_o_g │ │ │ │ │ _u_T_P │ │ │ │ │ _d_o_w_n_l_o_a_d │ │ │ ├── ./usr/share/doc/libtorrent-rasterbar-doc/html/single-page-ref.html │ │ │ │ @@ -28,728 +28,728 @@ │ │ │ │ 2.0.11 │ │ │ │ │ │ │ │ │ │ │ │

    home

    │ │ │ │
    │ │ │ │

    Table of contents

    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -

    piece_block

    │ │ │ │ -

    Declared in "libtorrent/piece_block.hpp"

    │ │ │ │ +[report issue]
    │ │ │ │ +

    storage_error

    │ │ │ │ +

    Declared in "libtorrent/error_code.hpp"

    │ │ │ │ +

    used by storage to return errors │ │ │ │ +also includes which underlying file the │ │ │ │ +error happened on

    │ │ │ │
    │ │ │ │ -struct piece_block
    │ │ │ │ +struct storage_error
    │ │ │ │  {
    │ │ │ │ -   piece_block () = default;
    │ │ │ │ -   piece_block (piece_index_t p_index, int b_index);
    │ │ │ │ -   bool operator< (piece_block const& b) const;
    │ │ │ │ -   bool operator== (piece_block const& b) const;
    │ │ │ │ -   bool operator!= (piece_block const& b) const;
    │ │ │ │ +   explicit operator bool () const;
    │ │ │ │ +   void file (file_index_t f);
    │ │ │ │ +   file_index_t file () const;
    │ │ │ │  
    │ │ │ │ -   static const piece_block invalid;
    │ │ │ │ -   piece_index_t piece_index {0};
    │ │ │ │ -   int block_index  = 0;
    │ │ │ │ +   error_code ec;
    │ │ │ │ +   operation_t operation;
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ +[report issue]
    │ │ │ │ +

    bool()

    │ │ │ │ +
    │ │ │ │ +explicit operator bool () const;
    │ │ │ │ +
    │ │ │ │ +

    explicitly converts to true if this object represents an error, and │ │ │ │ +false if it does not.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    file()

    │ │ │ │ +
    │ │ │ │ +void file (file_index_t f);
    │ │ │ │ +file_index_t file () const;
    │ │ │ │ +
    │ │ │ │ +

    set and query the index (in the torrent) of the file this error │ │ │ │ +occurred on. This may also have special values defined in │ │ │ │ +torrent_status.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    ec
    │ │ │ │ +
    the error that occurred
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    operation
    │ │ │ │ +
    A code from operation_t enum, indicating what │ │ │ │ +kind of operation failed.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    i2p_category()

    │ │ │ │ +

    Declared in "libtorrent/i2p_stream.hpp"

    │ │ │ │ +
    │ │ │ │ +boost::system::error_category& i2p_category ();
    │ │ │ │ +
    │ │ │ │ +

    returns the error category for I2P errors

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    libtorrent_category()

    │ │ │ │ +

    Declared in "libtorrent/error_code.hpp"

    │ │ │ │ +
    │ │ │ │ +boost::system::error_category& libtorrent_category ();
    │ │ │ │ +
    │ │ │ │ +

    return the instance of the libtorrent_error_category which │ │ │ │ +maps libtorrent error codes to human readable error messages.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    http_category()

    │ │ │ │ +

    Declared in "libtorrent/error_code.hpp"

    │ │ │ │ +
    │ │ │ │ +boost::system::error_category& http_category ();
    │ │ │ │ +
    │ │ │ │ +

    returns the error_category for HTTP errors

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    upnp_category()

    │ │ │ │ +

    Declared in "libtorrent/upnp.hpp"

    │ │ │ │ +
    │ │ │ │ +boost::system::error_category& upnp_category ();
    │ │ │ │ +
    │ │ │ │ +

    the boost.system error category for UPnP errors

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    gzip_category()

    │ │ │ │ +

    Declared in "libtorrent/gzip.hpp"

    │ │ │ │ +
    │ │ │ │ +boost::system::error_category& gzip_category ();
    │ │ │ │ +
    │ │ │ │ +

    get the error_category for zip errors

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    pcp_category()

    │ │ │ │ +

    Declared in "libtorrent/natpmp.hpp"

    │ │ │ │ +
    │ │ │ │ +boost::system::error_category& pcp_category ();
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    socks_category()

    │ │ │ │ +

    Declared in "libtorrent/socks5_stream.hpp"

    │ │ │ │ +
    │ │ │ │ +boost::system::error_category& socks_category ();
    │ │ │ │ +
    │ │ │ │ +

    returns the error_category for SOCKS5 errors

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    bdecode_category()

    │ │ │ │ +

    Declared in "libtorrent/bdecode.hpp"

    │ │ │ │ +
    │ │ │ │ +boost::system::error_category& bdecode_category ();
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum i2p_error_code

    │ │ │ │ +

    Declared in "libtorrent/i2p_stream.hpp"

    │ │ │ │ + │ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +
    namevaluedescription
    no_error0 
    parse_failed1 
    cant_reach_peer2 
    i2p_error3 
    invalid_key4 
    invalid_id5 
    timeout6 
    key_not_found7 
    duplicated_id8 
    num_errors9 
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum error_code_enum

    │ │ │ │ +

    Declared in "libtorrent/error_code.hpp"

    │ │ │ │ + │ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +
    namevaluedescription
    no_error0Not an error
    file_collision1Two torrents has files which end up overwriting each other
    failed_hash_check2A piece did not match its piece hash
    torrent_is_no_dict3The .torrent file does not contain a bencoded dictionary at │ │ │ │ +its top level
    torrent_missing_info4The .torrent file does not have an info dictionary
    torrent_info_no_dict5The .torrent file's info entry is not a dictionary
    torrent_missing_piece_length6The .torrent file does not have a piece length entry
    torrent_missing_name7The .torrent file does not have a name entry
    torrent_invalid_name8The .torrent file's name entry is invalid
    torrent_invalid_length9The length of a file, or of the whole .torrent file is invalid. │ │ │ │ +Either negative or not an integer
    torrent_file_parse_failed10Failed to parse a file entry in the .torrent
    torrent_missing_pieces11The pieces field is missing or invalid in the .torrent file
    torrent_invalid_hashes12The pieces string has incorrect length
    too_many_pieces_in_torrent13The .torrent file has more pieces than is supported by libtorrent
    invalid_swarm_metadata14The metadata (.torrent file) that was received from the swarm │ │ │ │ +matched the info-hash, but failed to be parsed
    invalid_bencoding15The file or buffer is not correctly bencoded
    no_files_in_torrent16The .torrent file does not contain any files
    invalid_escaped_string17The string was not properly url-encoded as expected
    session_is_closing18Operation is not permitted since the session is shutting down
    duplicate_torrent19There's already a torrent with that info-hash added to the │ │ │ │ +session
    invalid_torrent_handle20The supplied torrent_handle is not referring to a valid torrent
    invalid_entry_type21The type requested from the entry did not match its type
    missing_info_hash_in_uri22The specified URI does not contain a valid info-hash
    file_too_short23One of the files in the torrent was unexpectedly small. This │ │ │ │ +might be caused by files being changed by an external process
    unsupported_url_protocol24The URL used an unknown protocol. Currently http and │ │ │ │ +https (if built with openssl support) are recognized. For │ │ │ │ +trackers udp is recognized as well.
    url_parse_error25The URL did not conform to URL syntax and failed to be parsed
    peer_sent_empty_piece26The peer sent a piece message of length 0
    parse_failed27A bencoded structure was corrupt and failed to be parsed
    invalid_file_tag28The fast resume file was missing or had an invalid file version │ │ │ │ +tag
    missing_info_hash29The fast resume file was missing or had an invalid info-hash
    mismatching_info_hash30The info-hash did not match the torrent
    invalid_hostname31The URL contained an invalid hostname
    invalid_port32The URL had an invalid port
    port_blocked33The port is blocked by the port-filter, and prevented the │ │ │ │ +connection
    expected_close_bracket_in_address34The IPv6 address was expected to end with "]"
    destructing_torrent35The torrent is being destructed, preventing the operation to │ │ │ │ +succeed
    timed_out36The connection timed out
    upload_upload_connection37The peer is upload only, and we are upload only. There's no point │ │ │ │ +in keeping the connection
    uninteresting_upload_peer38The peer is upload only, and we're not interested in it. There's │ │ │ │ +no point in keeping the connection
    invalid_info_hash39The peer sent an unknown info-hash
    torrent_paused40The torrent is paused, preventing the operation from succeeding
    invalid_have41The peer sent an invalid have message, either wrong size or │ │ │ │ +referring to a piece that doesn't exist in the torrent
    invalid_bitfield_size42The bitfield message had the incorrect size
    too_many_requests_when_choked43The peer kept requesting pieces after it was choked, possible │ │ │ │ +abuse attempt.
    invalid_piece44The peer sent a piece message that does not correspond to a │ │ │ │ +piece request sent by the client
    no_memory45memory allocation failed
    torrent_aborted46The torrent is aborted, preventing the operation to succeed
    self_connection47The peer is a connection to ourself, no point in keeping it
    invalid_piece_size48The peer sent a piece message with invalid size, either negative │ │ │ │ +or greater than one block
    timed_out_no_interest49The peer has not been interesting or interested in us for too │ │ │ │ +long, no point in keeping it around
    timed_out_inactivity50The peer has not said anything in a long time, possibly dead
    timed_out_no_handshake51The peer did not send a handshake within a reasonable amount of │ │ │ │ +time, it might not be a bittorrent peer
    timed_out_no_request52The peer has been unchoked for too long without requesting any │ │ │ │ +data. It might be lying about its interest in us
    invalid_choke53The peer sent an invalid choke message
    invalid_unchoke54The peer send an invalid unchoke message
    invalid_interested55The peer sent an invalid interested message
    invalid_not_interested56The peer sent an invalid not-interested message
    invalid_request57The peer sent an invalid piece request message
    invalid_hash_list58The peer sent an invalid hash-list message (this is part of the │ │ │ │ +merkle-torrent extension)
    invalid_hash_piece59The peer sent an invalid hash-piece message (this is part of the │ │ │ │ +merkle-torrent extension)
    invalid_cancel60The peer sent an invalid cancel message
    invalid_dht_port61The peer sent an invalid DHT port-message
    invalid_suggest62The peer sent an invalid suggest piece-message
    invalid_have_all63The peer sent an invalid have all-message
    invalid_have_none64The peer sent an invalid have none-message
    invalid_reject65The peer sent an invalid reject message
    invalid_allow_fast66The peer sent an invalid allow fast-message
    invalid_extended67The peer sent an invalid extension message ID
    invalid_message68The peer sent an invalid message ID
    sync_hash_not_found69The synchronization hash was not found in the encrypted handshake
    invalid_encryption_constant70The encryption constant in the handshake is invalid
    no_plaintext_mode71The peer does not support plain text, which is the selected mode
    no_rc4_mode72The peer does not support RC4, which is the selected mode
    unsupported_encryption_mode73The peer does not support any of the encryption modes that the │ │ │ │ +client supports
    unsupported_encryption_mode_selected74The peer selected an encryption mode that the client did not │ │ │ │ +advertise and does not support
    invalid_pad_size75The pad size used in the encryption handshake is of invalid size
    invalid_encrypt_handshake76The encryption handshake is invalid
    no_incoming_encrypted77The client is set to not support incoming encrypted connections │ │ │ │ +and this is an encrypted connection
    no_incoming_regular78The client is set to not support incoming regular bittorrent │ │ │ │ +connections, and this is a regular connection
    duplicate_peer_id79The client is already connected to this peer-ID
    torrent_removed80Torrent was removed
    packet_too_large81The packet size exceeded the upper sanity check-limit
    reserved82 
    http_error83The web server responded with an error
    missing_location84The web server response is missing a location header
    invalid_redirection85The web seed redirected to a path that no longer matches the │ │ │ │ +.torrent directory structure
    redirecting86The connection was closed because it redirected to a different │ │ │ │ +URL
    invalid_range87The HTTP range header is invalid
    no_content_length88The HTTP response did not have a content length
    banned_by_ip_filter89The IP is blocked by the IP filter
    too_many_connections90At the connection limit
    peer_banned91The peer is marked as banned
    stopping_torrent92The torrent is stopping, causing the operation to fail
    too_many_corrupt_pieces93The peer has sent too many corrupt pieces and is banned
    torrent_not_ready94The torrent is not ready to receive peers
    peer_not_constructed95The peer is not completely constructed yet
    session_closing96The session is closing, causing the operation to fail
    optimistic_disconnect97The peer was disconnected in order to leave room for a │ │ │ │ +potentially better peer
    torrent_finished98The torrent is finished
    no_router99No UPnP router found
    metadata_too_large100The metadata message says the metadata exceeds the limit
    invalid_metadata_request101The peer sent an invalid metadata request message
    invalid_metadata_size102The peer advertised an invalid metadata size
    invalid_metadata_offset103The peer sent a message with an invalid metadata offset
    invalid_metadata_message104The peer sent an invalid metadata message
    pex_message_too_large105The peer sent a peer exchange message that was too large
    invalid_pex_message106The peer sent an invalid peer exchange message
    invalid_lt_tracker_message107The peer sent an invalid tracker exchange message
    too_frequent_pex108The peer sent an pex messages too often. This is a possible │ │ │ │ +attempt of and attack
    no_metadata109The operation failed because it requires the torrent to have │ │ │ │ +the metadata (.torrent file) and it doesn't have it yet. │ │ │ │ +This happens for magnet links before they have downloaded the │ │ │ │ +metadata, and also torrents added by URL.
    invalid_dont_have110The peer sent an invalid dont_have message. The don't have │ │ │ │ +message is an extension to allow peers to advertise that the │ │ │ │ +no longer has a piece they previously had.
    requires_ssl_connection111The peer tried to connect to an SSL torrent without connecting │ │ │ │ +over SSL.
    invalid_ssl_cert112The peer tried to connect to a torrent with a certificate │ │ │ │ +for a different torrent.
    not_an_ssl_torrent113the torrent is not an SSL torrent, and the operation requires │ │ │ │ +an SSL torrent
    banned_by_port_filter114peer was banned because its listen port is within a banned port │ │ │ │ +range, as specified by the port_filter.
    invalid_session_handle115The session_handle is not referring to a valid session_impl
    invalid_listen_socket116the listen socket associated with this request was closed
    invalid_hash_request117 
    invalid_hashes118 
    invalid_hash_reject119 
    deprecated_120120 
    deprecated_121121 
    deprecated_122122 
    deprecated_123123 
    deprecated_124124 
    missing_file_sizes130The resume data file is missing the file sizes entry
    no_files_in_resume_data131The resume data file file sizes entry is empty
    missing_pieces132The resume data file is missing the pieces and slots entry
    mismatching_number_of_files133The number of files in the resume data does not match the number │ │ │ │ +of files in the torrent
    mismatching_file_size134One of the files on disk has a different size than in the fast │ │ │ │ +resume file
    mismatching_file_timestamp135One of the files on disk has a different timestamp than in the │ │ │ │ +fast resume file
    not_a_dictionary136The resume data file is not a dictionary
    invalid_blocks_per_piece137The blocks per piece entry is invalid in the resume data file
    missing_slots138The resume file is missing the slots entry, which is required │ │ │ │ +for torrents with compact allocation. DEPRECATED
    too_many_slots139The resume file contains more slots than the torrent
    invalid_slot_list140The slot entry is invalid in the resume data
    invalid_piece_index141One index in the slot list is invalid
    pieces_need_reorder142The pieces on disk needs to be re-ordered for the specified │ │ │ │ +allocation mode. This happens if you specify sparse allocation │ │ │ │ +and the files on disk are using compact storage. The pieces needs │ │ │ │ +to be moved to their right position. DEPRECATED
    resume_data_not_modified143this error is returned when asking to save resume data and │ │ │ │ +specifying the flag to only save when there's anything new to save │ │ │ │ +(torrent_handle::only_if_modified) and there wasn't anything changed.
    invalid_save_path144the save_path in add_torrent_params is not valid
    http_parse_error150The HTTP header was not correctly formatted
    http_missing_location151The HTTP response was in the 300-399 range but lacked a location │ │ │ │ +header
    http_failed_decompress152The HTTP response was encoded with gzip or deflate but │ │ │ │ +decompressing it failed
    no_i2p_router160The URL specified an i2p address, but no i2p router is configured
    no_i2p_endpoint161i2p acceptor is not available yet, can't announce without endpoint
    scrape_not_available170The tracker URL doesn't support transforming it into a scrape │ │ │ │ +URL. i.e. it doesn't contain "announce.
    invalid_tracker_response171invalid tracker response
    invalid_peer_dict172invalid peer dictionary entry. Not a dictionary
    tracker_failure173tracker sent a failure message
    invalid_files_entry174missing or invalid files entry
    invalid_hash_entry175missing or invalid hash entry
    invalid_peers_entry176missing or invalid peers and peers6 entry
    invalid_tracker_response_length177UDP tracker response packet has invalid size
    invalid_tracker_transaction_id178invalid transaction id in UDP tracker response
    invalid_tracker_action179invalid action field in UDP tracker response
    announce_skipped180skipped announce (because it's assumed to be unreachable over the │ │ │ │ +given source network interface)
    no_entropy200random number generation failed
    ssrf_mitigation201blocked by SSRF mitigation
    blocked_by_idna202blocked because IDNA host names are banned
    torrent_unknown_version210the torrent file has an unknown meta version
    torrent_missing_file_tree211the v2 torrent file has no file tree
    torrent_missing_meta_version212the torrent contains v2 keys but does not specify meta version 2
    torrent_inconsistent_files213the v1 and v2 file metadata does not match
    torrent_missing_piece_layer214one or more files are missing piece layer hashes
    torrent_invalid_piece_layer215a piece layer has the wrong size or failed hash check
    torrent_missing_pieces_root216a v2 file entry has no root hash
    torrent_inconsistent_hashes217the v1 and v2 hashes do not describe the same data
    torrent_invalid_pad_file218a file in the v2 metadata has the pad attribute set
    error_code_max219the number of error codes
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum http_errors

    │ │ │ │ +

    Declared in "libtorrent/error_code.hpp"

    │ │ │ │ + │ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +
    namevaluedescription
    cont100 
    ok200 
    created201 
    accepted202 
    no_content204 
    multiple_choices300 
    moved_permanently301 
    moved_temporarily302 
    not_modified304 
    bad_request400 
    unauthorized401 
    forbidden403 
    not_found404 
    internal_server_error500 
    not_implemented501 
    bad_gateway502 
    service_unavailable503 
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum error_code_enum

    │ │ │ │ +

    Declared in "libtorrent/upnp.hpp"

    │ │ │ │ + │ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +
    namevaluedescription
    no_error0No error
    invalid_argument402One of the arguments in the request is invalid
    action_failed501The request failed
    value_not_in_array714The specified value does not exist in the array
    source_ip_cannot_be_wildcarded715The source IP address cannot be wild-carded, but │ │ │ │ +must be fully specified
    external_port_cannot_be_wildcarded716The external port cannot be a wildcard, but must │ │ │ │ +be specified
    port_mapping_conflict718The port mapping entry specified conflicts with a │ │ │ │ +mapping assigned previously to another client
    internal_port_must_match_external724Internal and external port value must be the same
    only_permanent_leases_supported725The NAT implementation only supports permanent │ │ │ │ +lease times on port mappings
    remote_host_must_be_wildcard726RemoteHost must be a wildcard and cannot be a │ │ │ │ +specific IP address or DNS name
    external_port_must_be_wildcard727ExternalPort must be a wildcard and cannot be a │ │ │ │ +specific port
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum error_code_enum

    │ │ │ │ +

    Declared in "libtorrent/gzip.hpp"

    │ │ │ │ + │ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +
    namevaluedescription
    no_error0Not an error
    invalid_gzip_header1the supplied gzip buffer has invalid header
    inflated_data_too_large2the gzip buffer would inflate to more bytes than the specified │ │ │ │ +maximum size, and was rejected.
    data_did_not_terminate3available inflate data did not terminate
    space_exhausted4output space exhausted before completing inflate
    invalid_block_type5invalid block type (type == 3)
    invalid_stored_block_length6stored block length did not match one's complement
    too_many_length_or_distance_codes7dynamic block code description: too many length or distance codes
    code_lengths_codes_incomplete8dynamic block code description: code lengths codes incomplete
    repeat_lengths_with_no_first_length9dynamic block code description: repeat lengths with no first length
    repeat_more_than_specified_lengths10dynamic block code description: repeat more than specified lengths
    invalid_literal_length_code_lengths11dynamic block code description: invalid literal/length code lengths
    invalid_distance_code_lengths12dynamic block code description: invalid distance code lengths
    invalid_literal_code_in_block13invalid literal/length or distance code in fixed or dynamic block
    distance_too_far_back_in_block14distance is too far back in fixed or dynamic block
    unknown_gzip_error15an unknown error occurred during gzip inflation
    error_code_max16the number of error codes
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum pcp_errors

    │ │ │ │ +

    Declared in "libtorrent/natpmp.hpp"

    │ │ │ │ + │ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +
    namevaluedescription
    pcp_success0 
    pcp_unsupp_version1 
    pcp_not_authorized2 
    pcp_malformed_request3 
    pcp_unsupp_opcode4 
    pcp_unsupp_option5 
    pcp_malformed_option6 
    pcp_network_failure7 
    pcp_no_resources8 
    pcp_unsupp_protocol9 
    pcp_user_ex_quota10 
    pcp_cannot_provide_external11 
    pcp_address_mismatch12 
    pcp_excessive_remote_peers13 
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum socks_error_code

    │ │ │ │ +

    Declared in "libtorrent/socks5_stream.hpp"

    │ │ │ │ + │ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +
    namevaluedescription
    no_error0 
    unsupported_version1 
    unsupported_authentication_method2 
    unsupported_authentication_version3 
    authentication_error4 
    username_required5 
    general_failure6 
    command_not_supported7 
    no_identd8 
    identd_error9 
    num_errors10 
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum error_code_enum

    │ │ │ │ +

    Declared in "libtorrent/bdecode.hpp"

    │ │ │ │ + │ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +
    namevaluedescription
    no_error0Not an error
    expected_digit1expected digit in bencoded string
    expected_colon2expected colon in bencoded string
    unexpected_eof3unexpected end of file in bencoded string
    expected_value4expected value (list, dict, int or string) in bencoded string
    depth_exceeded5bencoded recursion depth limit exceeded
    limit_exceeded6bencoded item count limit exceeded
    overflow7integer overflow
    error_code_max8the number of error codes
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    info_hash_t

    │ │ │ │

    Declared in "libtorrent/info_hash.hpp"

    │ │ │ │

    class holding the info-hash of a torrent. It can hold a v1 info-hash │ │ │ │ (SHA-1) or a v2 info-hash (SHA-256) or both.

    │ │ │ │
    │ │ │ │ @@ -811,17 +2143,17 @@ │ │ │ │
    │ │ │ │  struct info_hash_t
    │ │ │ │  {
    │ │ │ │     info_hash_t () noexcept = default;
    │ │ │ │     explicit info_hash_t (sha256_hash h2) noexcept;
    │ │ │ │     info_hash_t (sha1_hash h1, sha256_hash h2) noexcept;
    │ │ │ │     explicit info_hash_t (sha1_hash h1) noexcept;
    │ │ │ │ -   bool has_v1 () const;
    │ │ │ │ -   bool has (protocol_version v) const;
    │ │ │ │     bool has_v2 () const;
    │ │ │ │ +   bool has (protocol_version v) const;
    │ │ │ │ +   bool has_v1 () const;
    │ │ │ │     sha1_hash get (protocol_version v) const;
    │ │ │ │     sha1_hash get_best () const;
    │ │ │ │     friend bool operator!= (info_hash_t const& lhs, info_hash_t const& rhs);
    │ │ │ │     friend bool operator== (info_hash_t const& lhs, info_hash_t const& rhs) noexcept;
    │ │ │ │     template <typename F> void for_each (F f) const;
    │ │ │ │     bool operator< (info_hash_t const& o) const;
    │ │ │ │     friend std::ostream& operator<< (std::ostream& os, info_hash_t const& ih);
    │ │ │ │ @@ -839,23 +2171,23 @@
    │ │ │ │  explicit info_hash_t (sha1_hash h1) noexcept;
    │ │ │ │  
    │ │ │ │

    The default constructor creates an object that has neither a v1 or v2 │ │ │ │ hash.

    │ │ │ │

    For backwards compatibility, make it possible to construct directly │ │ │ │ from a v1 hash. This constructor allows implicit conversion from a │ │ │ │ v1 hash, but the implicitness is deprecated.

    │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    has_v2() has() has_v1()

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    has_v1() has() has_v2()

    │ │ │ │
    │ │ │ │ -bool has_v1 () const;
    │ │ │ │ -bool has (protocol_version v) const;
    │ │ │ │  bool has_v2 () const;
    │ │ │ │ +bool has (protocol_version v) const;
    │ │ │ │ +bool has_v1 () const;
    │ │ │ │  
    │ │ │ │

    returns true if the corresponding info hash is present in this │ │ │ │ object.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    get()

    │ │ │ │
    │ │ │ │ @@ -1400,30 +2732,90 @@
    │ │ │ │  
    start
    │ │ │ │
    The byte offset within that piece where the range starts.
    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    length
    │ │ │ │
    The size of the range, in bytes.
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ +[report issue]
    │ │ │ │
    │ │ │ │ +
    │ │ │ │ +

    piece_block

    │ │ │ │ +

    Declared in "libtorrent/piece_block.hpp"

    │ │ │ │ +
    │ │ │ │ +struct piece_block
    │ │ │ │ +{
    │ │ │ │ +   piece_block (piece_index_t p_index, int b_index);
    │ │ │ │ +   piece_block () = default;
    │ │ │ │ +   bool operator< (piece_block const& b) const;
    │ │ │ │ +   bool operator== (piece_block const& b) const;
    │ │ │ │ +   bool operator!= (piece_block const& b) const;
    │ │ │ │ +
    │ │ │ │ +   static const piece_block invalid;
    │ │ │ │ +   piece_index_t piece_index {0};
    │ │ │ │ +   int block_index  = 0;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    load_torrent_buffer() load_torrent_file() load_torrent_parsed()

    │ │ │ │ +

    Declared in "libtorrent/load_torrent.hpp"

    │ │ │ │ +
    │ │ │ │ +add_torrent_params load_torrent_buffer (
    │ │ │ │ +   span<char const> buffer, load_torrent_limits const& cfg);
    │ │ │ │ +add_torrent_params load_torrent_parsed (
    │ │ │ │ +   bdecode_node const& torrent_file, load_torrent_limits const& cfg);
    │ │ │ │ +add_torrent_params load_torrent_file (
    │ │ │ │ +   std::string const& filename, load_torrent_limits const& cfg);
    │ │ │ │ +add_torrent_params load_torrent_file (
    │ │ │ │ +   std::string const& filename);
    │ │ │ │ +add_torrent_params load_torrent_buffer (
    │ │ │ │ +   span<char const> buffer);
    │ │ │ │ +add_torrent_params load_torrent_parsed (
    │ │ │ │ +   bdecode_node const& torrent_file);
    │ │ │ │ +
    │ │ │ │ +

    These functions load the content of a .torrent file into an │ │ │ │ +add_torrent_params object. │ │ │ │ +The immutable part of a torrent file (the info-dictionary) is stored in │ │ │ │ +the ti field in the add_torrent_params object (as a torrent_info │ │ │ │ +object). │ │ │ │ +The returned object is suitable to be:

    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │
    │ │ │ │

    torrent_peer_equal()

    │ │ │ │

    Declared in "libtorrent/torrent_peer.hpp"

    │ │ │ │
    │ │ │ │  inline bool torrent_peer_equal (torrent_peer const* lhs, torrent_peer const* rhs);
    │ │ │ │  
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    version()

    │ │ │ │ +

    Declared in "libtorrent/version.hpp"

    │ │ │ │ +
    │ │ │ │ +char const* version ();
    │ │ │ │ +
    │ │ │ │ +

    returns the libtorrent version as string form in this format: │ │ │ │ +"<major>.<minor>.<tiny>.<tag>"

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    make_magnet_uri()

    │ │ │ │

    Declared in "libtorrent/magnet_uri.hpp"

    │ │ │ │
    │ │ │ │ -std::string make_magnet_uri (torrent_info const& info);
    │ │ │ │  std::string make_magnet_uri (torrent_handle const& handle);
    │ │ │ │  std::string make_magnet_uri (add_torrent_params const& atp);
    │ │ │ │ +std::string make_magnet_uri (torrent_info const& info);
    │ │ │ │  
    │ │ │ │

    Generates a magnet URI from the specified torrent.

    │ │ │ │

    Several fields from the add_torrent_params objects are recorded in the │ │ │ │ magnet link. In order to not include them, they have to be cleared before │ │ │ │ calling make_magnet_uri(). These fields are used:

    │ │ │ │
    │ │ │ │ ti, info_hashes, url_seeds, dht_nodes, │ │ │ │ @@ -1443,17 +2835,17 @@ │ │ │ │ an empty string is returned.

    │ │ │ │

    For more information about magnet links, see magnet links.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    parse_magnet_uri()

    │ │ │ │

    Declared in "libtorrent/magnet_uri.hpp"

    │ │ │ │
    │ │ │ │ -add_torrent_params parse_magnet_uri (string_view uri);
    │ │ │ │ -add_torrent_params parse_magnet_uri (string_view uri, error_code& ec);
    │ │ │ │  void parse_magnet_uri (string_view uri, add_torrent_params& p, error_code& ec);
    │ │ │ │ +add_torrent_params parse_magnet_uri (string_view uri, error_code& ec);
    │ │ │ │ +add_torrent_params parse_magnet_uri (string_view uri);
    │ │ │ │  
    │ │ │ │

    This function parses out information from the magnet link and populates the │ │ │ │ add_torrent_params object. The overload that does not take an │ │ │ │ error_code reference will throw a system_error on error │ │ │ │ The overload taking an add_torrent_params reference will fill in the │ │ │ │ fields specified in the magnet URI.

    │ │ │ │ [report issue]
    │ │ │ │ @@ -1461,56 +2853,14 @@ │ │ │ │

    truncate_files()

    │ │ │ │

    Declared in "libtorrent/truncate.hpp"

    │ │ │ │
    │ │ │ │  void truncate_files (file_storage const& fs, std::string const& save_path, storage_error& ec);
    │ │ │ │  
    │ │ │ │

    Truncates files larger than specified in the file_storage, saved under │ │ │ │ the specified save_path.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    version()

    │ │ │ │ -

    Declared in "libtorrent/version.hpp"

    │ │ │ │ -
    │ │ │ │ -char const* version ();
    │ │ │ │ -
    │ │ │ │ -

    returns the libtorrent version as string form in this format: │ │ │ │ -"<major>.<minor>.<tiny>.<tag>"

    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    load_torrent_buffer() load_torrent_file() load_torrent_parsed()

    │ │ │ │ -

    Declared in "libtorrent/load_torrent.hpp"

    │ │ │ │ -
    │ │ │ │ -add_torrent_params load_torrent_file (
    │ │ │ │ -   std::string const& filename, load_torrent_limits const& cfg);
    │ │ │ │ -add_torrent_params load_torrent_buffer (
    │ │ │ │ -   span<char const> buffer);
    │ │ │ │ -add_torrent_params load_torrent_parsed (
    │ │ │ │ -   bdecode_node const& torrent_file, load_torrent_limits const& cfg);
    │ │ │ │ -add_torrent_params load_torrent_parsed (
    │ │ │ │ -   bdecode_node const& torrent_file);
    │ │ │ │ -add_torrent_params load_torrent_file (
    │ │ │ │ -   std::string const& filename);
    │ │ │ │ -add_torrent_params load_torrent_buffer (
    │ │ │ │ -   span<char const> buffer, load_torrent_limits const& cfg);
    │ │ │ │ -
    │ │ │ │ -

    These functions load the content of a .torrent file into an │ │ │ │ -add_torrent_params object. │ │ │ │ -The immutable part of a torrent file (the info-dictionary) is stored in │ │ │ │ -the ti field in the add_torrent_params object (as a torrent_info │ │ │ │ -object). │ │ │ │ -The returned object is suitable to be:

    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    enum protocol_version

    │ │ │ │

    Declared in "libtorrent/info_hash.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ @@ -1534,14 +2884,45 @@ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
    NUM2 
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum connection_type

    │ │ │ │ +

    Declared in "libtorrent/peer_connection.hpp"

    │ │ │ │ + │ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +
    namevaluedescription
    bittorrent0 
    url_seed1 
    http_seed2 
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    enum socket_type_t

    │ │ │ │

    Declared in "libtorrent/socket_type.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ @@ -1589,142 +2970,143 @@ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
    utp_ssl8 
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum portmap_transport

    │ │ │ │ -

    Declared in "libtorrent/portmap.hpp"

    │ │ │ │ - │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -
    namevaluedescription
    natpmp0natpmp can be NAT-PMP or PCP
    upnp1 
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum portmap_protocol

    │ │ │ │ -

    Declared in "libtorrent/portmap.hpp"

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum event_t

    │ │ │ │ +

    Declared in "libtorrent/tracker_manager.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ +│ │ │ │ │ │ │ │ -│ │ │ │ -│ │ │ │ +│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │
    namevaluedescription
    none0 
    tcp
    completed1 
    udp
    started2 
    stopped3 
    paused4 
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum event_t

    │ │ │ │ -

    Declared in "libtorrent/tracker_manager.hpp"

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum portmap_transport

    │ │ │ │ +

    Declared in "libtorrent/portmap.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ │ │ │ │
    namevaluedescription
    none
    natpmp0 natpmp can be NAT-PMP or PCP
    completed
    upnp1 
    started2 
    stopped3 
    paused4 
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum connection_type

    │ │ │ │ -

    Declared in "libtorrent/peer_connection.hpp"

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum portmap_protocol

    │ │ │ │ +

    Declared in "libtorrent/portmap.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
    namevaluedescription
    bittorrent
    none0 
    url_seed
    tcp1 
    http_seed
    udp2 
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    int

    │ │ │ │ +

    Declared in "libtorrent/version.hpp"

    │ │ │ │ +
    │ │ │ │ +
    version_major
    │ │ │ │ +
    the major, minor and tiny versions of libtorrent
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    version_minor
    │ │ │ │ +
    the major, minor and tiny versions of libtorrent
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    version_tiny
    │ │ │ │ +
    the major, minor and tiny versions of libtorrent
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    char const*

    │ │ │ │ +

    Declared in "libtorrent/version.hpp"

    │ │ │ │ +
    │ │ │ │ +
    version_str
    │ │ │ │ +
    the libtorrent version in string form
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    std::uint64_t

    │ │ │ │ +

    Declared in "libtorrent/version.hpp"

    │ │ │ │ +
    │ │ │ │ +
    version_revision
    │ │ │ │ +
    the git commit of this libtorrent version
    │ │ │ │ +
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    torrent_flags_t

    │ │ │ │

    Declared in "libtorrent/torrent_flags.hpp"

    │ │ │ │
    │ │ │ │
    seed_mode
    │ │ │ │

    If seed_mode is set, libtorrent will assume that all files │ │ │ │ @@ -1853,15 +3235,15 @@ │ │ │ │ stop-when-ready immediately.

    │ │ │ │

    When the stop-when-ready logic fires, the flag is cleared. Any │ │ │ │ subsequent transitions between downloading and non-downloading states │ │ │ │ will not be affected, until this flag is set again.

    │ │ │ │

    The behavior is more robust when setting this flag as part of adding │ │ │ │ the torrent. See add_torrent_params.

    │ │ │ │

    The stop-when-ready flag fixes the inherent race condition of waiting │ │ │ │ -for the state_changed_alert and then call pause(). The download/seeding │ │ │ │ +for the state_changed_alert and then call pause(). The download/seeding │ │ │ │ will most likely start in between posting the alert and receiving the │ │ │ │ call to pause.

    │ │ │ │

    A downloading state is one where peers are being connected. Which means │ │ │ │ just downloading the metadata via the ut_metadata extension counts │ │ │ │ as a downloading state. In order to stop a torrent once the metadata │ │ │ │ has been downloaded, instead set all file priorities to dont_download

    │ │ │ │
    │ │ │ │ @@ -1951,14 +3333,35 @@ │ │ │ │ URL. │ │ │ │
    │ │ │ │
    │ │ │ │
    all
    │ │ │ │
    all torrent flags combined. Can conveniently be used when creating masks │ │ │ │ for flags
    │ │ │ │
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    download_priority_t

    │ │ │ │ +

    Declared in "libtorrent/download_priority.hpp"

    │ │ │ │ +
    │ │ │ │ +
    dont_download
    │ │ │ │ +
    Don't download the file or piece. Partial pieces may still be downloaded when │ │ │ │ +setting file priorities.
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    default_priority
    │ │ │ │ +
    The default priority for files and pieces.
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    low_priority
    │ │ │ │ +
    The lowest priority for files and pieces.
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    top_priority
    │ │ │ │ +
    The highest priority for files and pieces.
    │ │ │ │ +
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    pex_flags_t

    │ │ │ │

    Declared in "libtorrent/pex_flags.hpp"

    │ │ │ │
    │ │ │ │
    pex_encryption
    │ │ │ │
    the peer supports protocol encryption
    │ │ │ │ @@ -1978,3461 +3381,14 @@ │ │ │ │ the peer fail │ │ │ │
    │ │ │ │
    │ │ │ │
    pex_lt_v2
    │ │ │ │
    protocol v2 │ │ │ │ this is not a standard flag, it is only used internally
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    download_priority_t

    │ │ │ │ -

    Declared in "libtorrent/download_priority.hpp"

    │ │ │ │ -
    │ │ │ │ -
    dont_download
    │ │ │ │ -
    Don't download the file or piece. Partial pieces may still be downloaded when │ │ │ │ -setting file priorities.
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -
    default_priority
    │ │ │ │ -
    The default priority for files and pieces.
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -
    low_priority
    │ │ │ │ -
    The lowest priority for files and pieces.
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -
    top_priority
    │ │ │ │ -
    The highest priority for files and pieces.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    int

    │ │ │ │ -

    Declared in "libtorrent/version.hpp"

    │ │ │ │ -
    │ │ │ │ -
    version_major
    │ │ │ │ -
    the major, minor and tiny versions of libtorrent
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -
    version_minor
    │ │ │ │ -
    the major, minor and tiny versions of libtorrent
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -
    version_tiny
    │ │ │ │ -
    the major, minor and tiny versions of libtorrent
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    char const*

    │ │ │ │ -

    Declared in "libtorrent/version.hpp"

    │ │ │ │ -
    │ │ │ │ -
    version_str
    │ │ │ │ -
    the libtorrent version in string form
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    std::uint64_t

    │ │ │ │ -

    Declared in "libtorrent/version.hpp"

    │ │ │ │ -
    │ │ │ │ -
    version_revision
    │ │ │ │ -
    the git commit of this libtorrent version
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    block_info

    │ │ │ │ -

    Declared in "libtorrent/torrent_handle.hpp"

    │ │ │ │ -

    holds the state of a block in a piece. Who we requested │ │ │ │ -it from and how far along we are at downloading it.

    │ │ │ │ -
    │ │ │ │ -struct block_info
    │ │ │ │ -{
    │ │ │ │ -   tcp::endpoint peer () const;
    │ │ │ │ -   void set_peer (tcp::endpoint const& ep);
    │ │ │ │ -
    │ │ │ │ -   enum block_state_t
    │ │ │ │ -   {
    │ │ │ │ -      none,
    │ │ │ │ -      requested,
    │ │ │ │ -      writing,
    │ │ │ │ -      finished,
    │ │ │ │ -   };
    │ │ │ │ -
    │ │ │ │ -   unsigned bytes_progress:15;
    │ │ │ │ -   unsigned block_size:15;
    │ │ │ │ -   unsigned state:2;
    │ │ │ │ -   unsigned num_peers:14;
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -

    set_peer() peer()

    │ │ │ │ -
    │ │ │ │ -tcp::endpoint peer () const;
    │ │ │ │ -void set_peer (tcp::endpoint const& ep);
    │ │ │ │ -
    │ │ │ │ -

    The peer is the ip address of the peer this block was downloaded from.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum block_state_t

    │ │ │ │ -

    Declared in "libtorrent/torrent_handle.hpp"

    │ │ │ │ - │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -
    namevaluedescription
    none0This block has not been downloaded or requested form any peer.
    requested1The block has been requested, but not completely downloaded yet.
    writing2The block has been downloaded and is currently queued for being │ │ │ │ -written to disk.
    finished3The block has been written to disk.
    │ │ │ │ -[report issue]
    │ │ │ │ -
    bytes_progress
    │ │ │ │ -
    the number of bytes that have been received for this block
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    block_size
    │ │ │ │ -
    the total number of bytes in this block.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    state
    │ │ │ │ -
    the state this block is in (see block_state_t)
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    num_peers
    │ │ │ │ -
    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.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    partial_piece_info

    │ │ │ │ -

    Declared in "libtorrent/torrent_handle.hpp"

    │ │ │ │ -

    This class holds information about pieces that have outstanding requests │ │ │ │ -or outstanding writes

    │ │ │ │ -
    │ │ │ │ -struct partial_piece_info
    │ │ │ │ -{
    │ │ │ │ -   piece_index_t piece_index;
    │ │ │ │ -   int blocks_in_piece;
    │ │ │ │ -   int finished;
    │ │ │ │ -   int writing;
    │ │ │ │ -   int requested;
    │ │ │ │ -   block_info const* blocks;
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    piece_index
    │ │ │ │ -
    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.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    blocks_in_piece
    │ │ │ │ -
    the number of blocks in this piece
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    finished
    │ │ │ │ -
    the number of blocks that are in the finished state
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    writing
    │ │ │ │ -
    the number of blocks that are in the writing state
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    requested
    │ │ │ │ -
    the number of blocks that are in the requested state
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    blocks
    │ │ │ │ -

    this is an array of blocks_in_piece number of │ │ │ │ -items. One for each block in the piece.

    │ │ │ │ -
    │ │ │ │ -

    Warning

    │ │ │ │ -

    This is a pointer that points to an array │ │ │ │ -that's owned by the session object. The next time │ │ │ │ -get_download_queue() is called, it will be invalidated. │ │ │ │ -In the case of piece_info_alert, these pointers point into the alert │ │ │ │ -object itself, and will be invalidated when the alert destruct.

    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    torrent_handle

    │ │ │ │ -

    Declared in "libtorrent/torrent_handle.hpp"

    │ │ │ │ -

    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.

    │ │ │ │ -
    │ │ │ │ -

    Warning

    │ │ │ │ -

    Any member function that returns a value or fills in a value has to be │ │ │ │ -made synchronously. This means it has to wait for the main thread to │ │ │ │ -complete the query before it can return. This might potentially be │ │ │ │ -expensive if done from within a GUI thread that needs to stay │ │ │ │ -responsive. Try to avoid querying for information you don't need, and │ │ │ │ -try to do it in as few calls as possible. You can get most of the │ │ │ │ -interesting information about a torrent from the │ │ │ │ -torrent_handle::status() call.

    │ │ │ │ -
    │ │ │ │ -

    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 system_error │ │ │ │ -exception, in case the handle is no longer referring to a torrent. │ │ │ │ -There is one exception 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.

    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -struct torrent_handle
    │ │ │ │ -{
    │ │ │ │ -   friend std::size_t hash_value (torrent_handle const& th);
    │ │ │ │ -   torrent_handle () noexcept = default;
    │ │ │ │ -   void add_piece (piece_index_t piece, std::vector<char> data, add_piece_flags_t flags = {}) const;
    │ │ │ │ -   void add_piece (piece_index_t piece, char const* data, add_piece_flags_t flags = {}) const;
    │ │ │ │ -   void read_piece (piece_index_t piece) const;
    │ │ │ │ -   bool have_piece (piece_index_t piece) const;
    │ │ │ │ -   void post_peer_info () const;
    │ │ │ │ -   void get_peer_info (std::vector<peer_info>& v) const;
    │ │ │ │ -   torrent_status status (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │ -   void post_status (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │ -   void get_download_queue (std::vector<partial_piece_info>& queue) const;
    │ │ │ │ -   void post_download_queue () const;
    │ │ │ │ -   std::vector<partial_piece_info> get_download_queue () const;
    │ │ │ │ -   void clear_piece_deadlines () const;
    │ │ │ │ -   void reset_piece_deadline (piece_index_t index) const;
    │ │ │ │ -   void set_piece_deadline (piece_index_t index, int deadline, deadline_flags_t flags = {}) const;
    │ │ │ │ -   void file_progress (std::vector<std::int64_t>& progress, file_progress_flags_t flags = {}) const;
    │ │ │ │ -   std::vector<std::int64_t> file_progress (file_progress_flags_t flags = {}) const;
    │ │ │ │ -   void post_file_progress (file_progress_flags_t flags) const;
    │ │ │ │ -   std::vector<open_file_state> file_status () const;
    │ │ │ │ -   void clear_error () const;
    │ │ │ │ -   void post_trackers () const;
    │ │ │ │ -   void replace_trackers (std::vector<announce_entry> const&) const;
    │ │ │ │ -   std::vector<announce_entry> trackers () const;
    │ │ │ │ -   void add_tracker (announce_entry const&) const;
    │ │ │ │ -   std::set<std::string> url_seeds () const;
    │ │ │ │ -   void add_url_seed (std::string const& url) const;
    │ │ │ │ -   void remove_url_seed (std::string const& url) const;
    │ │ │ │ -   std::set<std::string> http_seeds () const;
    │ │ │ │ -   void add_http_seed (std::string const& url) const;
    │ │ │ │ -   void remove_http_seed (std::string const& url) const;
    │ │ │ │ -   void add_extension (
    │ │ │ │ -      std::function<std::shared_ptr<torrent_plugin>(torrent_handle const&, client_data_t)> const& ext
    │ │ │ │ -      , client_data_t userdata = client_data_t{});
    │ │ │ │ -   bool set_metadata (span<char const> metadata) const;
    │ │ │ │ -   bool is_valid () const;
    │ │ │ │ -   void resume () const;
    │ │ │ │ -   void pause (pause_flags_t flags = {}) const;
    │ │ │ │ -   void unset_flags (torrent_flags_t flags) const;
    │ │ │ │ -   void set_flags (torrent_flags_t flags, torrent_flags_t mask) const;
    │ │ │ │ -   void set_flags (torrent_flags_t flags) const;
    │ │ │ │ -   torrent_flags_t flags () const;
    │ │ │ │ -   void flush_cache () const;
    │ │ │ │ -   void force_recheck () const;
    │ │ │ │ -   void save_resume_data (resume_data_flags_t flags = {}) const;
    │ │ │ │ -   bool need_save_resume_data (resume_data_flags_t flags) const;
    │ │ │ │ -   bool need_save_resume_data () const;
    │ │ │ │ -   queue_position_t queue_position () const;
    │ │ │ │ -   void queue_position_bottom () const;
    │ │ │ │ -   void queue_position_top () const;
    │ │ │ │ -   void queue_position_down () const;
    │ │ │ │ -   void queue_position_up () const;
    │ │ │ │ -   void queue_position_set (queue_position_t p) const;
    │ │ │ │ -   void set_ssl_certificate_buffer (std::string const& certificate
    │ │ │ │ -      , std::string const& private_key
    │ │ │ │ -      , std::string const& dh_params);
    │ │ │ │ -   void set_ssl_certificate (std::string const& certificate
    │ │ │ │ -      , std::string const& private_key
    │ │ │ │ -      , std::string const& dh_params
    │ │ │ │ -      , std::string const& passphrase = "");
    │ │ │ │ -   std::shared_ptr<torrent_info> torrent_file_with_hashes () const;
    │ │ │ │ -   std::shared_ptr<const torrent_info> torrent_file () const;
    │ │ │ │ -   std::vector<std::vector<sha256_hash>> piece_layers () const;
    │ │ │ │ -   void post_piece_availability () const;
    │ │ │ │ -   void piece_availability (std::vector<int>& avail) const;
    │ │ │ │ -   void prioritize_pieces (std::vector<download_priority_t> const& pieces) const;
    │ │ │ │ -   void prioritize_pieces (std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces) const;
    │ │ │ │ -   std::vector<download_priority_t> get_piece_priorities () const;
    │ │ │ │ -   download_priority_t piece_priority (piece_index_t index) const;
    │ │ │ │ -   void piece_priority (piece_index_t index, download_priority_t priority) const;
    │ │ │ │ -   std::vector<download_priority_t> get_file_priorities () const;
    │ │ │ │ -   download_priority_t file_priority (file_index_t index) const;
    │ │ │ │ -   void file_priority (file_index_t index, download_priority_t priority) const;
    │ │ │ │ -   void prioritize_files (std::vector<download_priority_t> const& files) const;
    │ │ │ │ -   void force_reannounce (int seconds = 0, int idx = -1, reannounce_flags_t = {}) const;
    │ │ │ │ -   void force_dht_announce () const;
    │ │ │ │ -   void force_lsd_announce () const;
    │ │ │ │ -   void scrape_tracker (int idx = -1) const;
    │ │ │ │ -   int upload_limit () const;
    │ │ │ │ -   int download_limit () const;
    │ │ │ │ -   void set_upload_limit (int limit) const;
    │ │ │ │ -   void set_download_limit (int limit) const;
    │ │ │ │ -   void connect_peer (tcp::endpoint const& adr, peer_source_flags_t source = {}
    │ │ │ │ -      , pex_flags_t flags = pex_encryption | pex_utp | pex_holepunch) const;
    │ │ │ │ -   void clear_peers ();
    │ │ │ │ -   int max_uploads () const;
    │ │ │ │ -   void set_max_uploads (int max_uploads) const;
    │ │ │ │ -   int max_connections () const;
    │ │ │ │ -   void set_max_connections (int max_connections) const;
    │ │ │ │ -   void move_storage (std::string const& save_path
    │ │ │ │ -      , move_flags_t flags = move_flags_t::always_replace_files
    │ │ │ │ -      ) const;
    │ │ │ │ -   void rename_file (file_index_t index, std::string const& new_name) const;
    │ │ │ │ -   sha1_hash info_hash () const;
    │ │ │ │ -   info_hash_t info_hashes () const;
    │ │ │ │ -   bool operator< (const torrent_handle& h) const;
    │ │ │ │ -   bool operator== (const torrent_handle& h) const;
    │ │ │ │ -   bool operator!= (const torrent_handle& h) const;
    │ │ │ │ -   std::uint32_t id () const;
    │ │ │ │ -   std::shared_ptr<torrent> native_handle () const;
    │ │ │ │ -   client_data_t userdata () const;
    │ │ │ │ -   bool in_session () const;
    │ │ │ │ -
    │ │ │ │ -   static constexpr add_piece_flags_t overwrite_existing  = 0_bit;
    │ │ │ │ -   static constexpr status_flags_t query_distributed_copies  = 0_bit;
    │ │ │ │ -   static constexpr status_flags_t query_accurate_download_counters  = 1_bit;
    │ │ │ │ -   static constexpr status_flags_t query_last_seen_complete  = 2_bit;
    │ │ │ │ -   static constexpr status_flags_t query_pieces  = 3_bit;
    │ │ │ │ -   static constexpr status_flags_t query_verified_pieces  = 4_bit;
    │ │ │ │ -   static constexpr status_flags_t query_torrent_file  = 5_bit;
    │ │ │ │ -   static constexpr status_flags_t query_name  = 6_bit;
    │ │ │ │ -   static constexpr status_flags_t query_save_path  = 7_bit;
    │ │ │ │ -   static constexpr deadline_flags_t alert_when_available  = 0_bit;
    │ │ │ │ -   static constexpr file_progress_flags_t piece_granularity  = 0_bit;
    │ │ │ │ -   static constexpr pause_flags_t graceful_pause  = 0_bit;
    │ │ │ │ -   static constexpr resume_data_flags_t flush_disk_cache  = 0_bit;
    │ │ │ │ -   static constexpr resume_data_flags_t save_info_dict  = 1_bit;
    │ │ │ │ -   static constexpr resume_data_flags_t only_if_modified  = 2_bit;
    │ │ │ │ -   static constexpr resume_data_flags_t if_counters_changed  = 3_bit;
    │ │ │ │ -   static constexpr resume_data_flags_t if_download_progress  = 4_bit;
    │ │ │ │ -   static constexpr resume_data_flags_t if_config_changed  = 5_bit;
    │ │ │ │ -   static constexpr resume_data_flags_t if_state_changed  = 6_bit;
    │ │ │ │ -   static constexpr resume_data_flags_t if_metadata_changed  = 7_bit;
    │ │ │ │ -   static constexpr reannounce_flags_t ignore_min_interval  = 0_bit;
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -

    torrent_handle()

    │ │ │ │ -
    │ │ │ │ -torrent_handle () noexcept = default;
    │ │ │ │ -
    │ │ │ │ -

    constructs a torrent handle that does not refer to a torrent. │ │ │ │ -i.e. is_valid() will return false.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    add_piece()

    │ │ │ │ -
    │ │ │ │ -void add_piece (piece_index_t piece, std::vector<char> data, add_piece_flags_t flags = {}) const;
    │ │ │ │ -void add_piece (piece_index_t piece, char const* data, add_piece_flags_t flags = {}) const;
    │ │ │ │ -
    │ │ │ │ -

    This function will write data to the storage as piece piece, │ │ │ │ -as if it had been downloaded from a peer.

    │ │ │ │ -

    By default, data that's already been downloaded is not overwritten by │ │ │ │ -this buffer. If you trust this data to be correct (and pass the piece │ │ │ │ -hash check) you may pass the overwrite_existing flag. This will │ │ │ │ -instruct libtorrent to overwrite any data that may already have been │ │ │ │ -downloaded with this data.

    │ │ │ │ -

    Since the data is written asynchronously, you may know that is passed │ │ │ │ -or failed the hash check by waiting for piece_finished_alert or │ │ │ │ -hash_failed_alert.

    │ │ │ │ -

    Adding pieces while the torrent is being checked (i.e. in │ │ │ │ -torrent_status::checking_files state) is not supported.

    │ │ │ │ -

    The overload taking a raw pointer to the data is a blocking call. It │ │ │ │ -won't return until the libtorrent thread has copied the data into its │ │ │ │ -disk write buffer. data is expected to point to a buffer of as │ │ │ │ -many bytes as the size of the specified piece. See │ │ │ │ -file_storage::piece_size().

    │ │ │ │ -

    The data in the buffer is copied and passed on to the disk IO thread │ │ │ │ -to be written at a later point.

    │ │ │ │ -

    The overload taking a std::vector<char> is not blocking, it will │ │ │ │ -send the buffer to the main thread and return immediately.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    read_piece()

    │ │ │ │ -
    │ │ │ │ -void read_piece (piece_index_t piece) const;
    │ │ │ │ -
    │ │ │ │ -

    This function starts an asynchronous read operation of the specified │ │ │ │ -piece from this torrent. You must have completed the download of the │ │ │ │ -specified piece before calling this function.

    │ │ │ │ -

    When the read operation is completed, it is passed back through an │ │ │ │ -alert, read_piece_alert. Since this alert is a response to an explicit │ │ │ │ -call, it will always be posted, regardless of the alert mask.

    │ │ │ │ -

    Note that if you read multiple pieces, the read operations are not │ │ │ │ -guaranteed to finish in the same order as you initiated them.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    have_piece()

    │ │ │ │ -
    │ │ │ │ -bool have_piece (piece_index_t piece) const;
    │ │ │ │ -
    │ │ │ │ -

    Returns true if this piece has been completely downloaded and written │ │ │ │ -to disk, and false otherwise.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    post_peer_info() get_peer_info()

    │ │ │ │ -
    │ │ │ │ -void post_peer_info () const;
    │ │ │ │ -void get_peer_info (std::vector<peer_info>& v) const;
    │ │ │ │ -
    │ │ │ │ -

    Query information about connected peers for this torrent. If the │ │ │ │ -torrent_handle is invalid, it will throw a system_error exception.

    │ │ │ │ -

    post_peer_info() is asynchronous and will trigger the posting of │ │ │ │ -a peer_info_alert. The alert contain a list of peer_info objects, one │ │ │ │ -for each connected peer.

    │ │ │ │ -

    get_peer_info() is synchronous and 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. Each entry in │ │ │ │ -the vector contains information about that particular peer. See │ │ │ │ -peer_info.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    status() post_status()

    │ │ │ │ -
    │ │ │ │ -torrent_status status (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │ -void post_status (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │ -
    │ │ │ │ -

    status() will return a structure with information about the status │ │ │ │ -of this torrent. If the torrent_handle is invalid, it will throw │ │ │ │ -system_error exception. See torrent_status. The flags │ │ │ │ -argument filters what information is returned in the torrent_status. │ │ │ │ -Some information in there is relatively expensive to calculate, and if │ │ │ │ -you're not interested in it (and see performance issues), you can │ │ │ │ -filter them out.

    │ │ │ │ -

    The status() function will block until the internal libtorrent │ │ │ │ -thread responds with the torrent_status object. To avoid blocking, │ │ │ │ -instead call post_status(). It will trigger posting of a │ │ │ │ -state_update_alert with a single torrent_status object for this │ │ │ │ -torrent.

    │ │ │ │ -

    In order to get regular updates for torrents whose status changes, │ │ │ │ -consider calling session::post_torrent_updates()`` instead.

    │ │ │ │ -

    By default everything is included. The flags you can use to decide │ │ │ │ -what to include are defined in this class.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    get_download_queue() post_download_queue()

    │ │ │ │ -
    │ │ │ │ -void get_download_queue (std::vector<partial_piece_info>& queue) const;
    │ │ │ │ -void post_download_queue () const;
    │ │ │ │ -std::vector<partial_piece_info> get_download_queue () const;
    │ │ │ │ -
    │ │ │ │ -

    post_download_queue() triggers a download_queue_alert to be │ │ │ │ -posted. │ │ │ │ -get_download_queue() is a synchronous call and returns a vector │ │ │ │ -with information about pieces that are partially downloaded or not │ │ │ │ -downloaded but partially requested. See partial_piece_info for the │ │ │ │ -fields in the returned vector.

    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_piece_deadline() clear_piece_deadlines() reset_piece_deadline()

    │ │ │ │ -
    │ │ │ │ -void clear_piece_deadlines () const;
    │ │ │ │ -void reset_piece_deadline (piece_index_t index) const;
    │ │ │ │ -void set_piece_deadline (piece_index_t index, int deadline, deadline_flags_t flags = {}) const;
    │ │ │ │ -
    │ │ │ │ -

    This function sets or resets the deadline associated with a specific │ │ │ │ -piece index (index). libtorrent will attempt to download this │ │ │ │ -entire piece before the deadline expires. This is not necessarily │ │ │ │ -possible, but pieces with a more recent deadline will always be │ │ │ │ -prioritized over pieces with a deadline further ahead in time. The │ │ │ │ -deadline (and flags) of a piece can be changed by calling this │ │ │ │ -function again.

    │ │ │ │ -

    If the piece is already downloaded when this call is made, nothing │ │ │ │ -happens, unless the alert_when_available flag is set, in which case it │ │ │ │ -will have the same effect as calling read_piece() for index.

    │ │ │ │ -

    deadline is the number of milliseconds until this piece should be │ │ │ │ -completed.

    │ │ │ │ -

    reset_piece_deadline removes the deadline from the piece. If it │ │ │ │ -hasn't already been downloaded, it will no longer be considered a │ │ │ │ -priority.

    │ │ │ │ -

    clear_piece_deadlines() removes deadlines on all pieces in │ │ │ │ -the torrent. As if reset_piece_deadline() was called on all pieces.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    file_progress() post_file_progress()

    │ │ │ │ -
    │ │ │ │ -void file_progress (std::vector<std::int64_t>& progress, file_progress_flags_t flags = {}) const;
    │ │ │ │ -std::vector<std::int64_t> file_progress (file_progress_flags_t flags = {}) const;
    │ │ │ │ -void post_file_progress (file_progress_flags_t flags) const;
    │ │ │ │ -
    │ │ │ │ -

    This function fills in the supplied vector, or returns a vector, with │ │ │ │ -the number of bytes downloaded 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. Its complexity is O(n + mj). │ │ │ │ -Where n is the number of files, m is the number of currently │ │ │ │ -downloading pieces and j is the number of blocks in a piece.

    │ │ │ │ -

    The flags parameter can be used to specify the granularity of the │ │ │ │ -file progress. If left at the default value of 0, the progress will be │ │ │ │ -as accurate as possible, but also more expensive to calculate. If │ │ │ │ -torrent_handle::piece_granularity is specified, the progress will │ │ │ │ -be specified in piece granularity. i.e. only pieces that have been │ │ │ │ -fully downloaded and passed the hash check count. When specifying │ │ │ │ -piece granularity, the operation is a lot cheaper, since libtorrent │ │ │ │ -already keeps track of this internally and no calculation is required.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    file_status()

    │ │ │ │ -
    │ │ │ │ -std::vector<open_file_state> file_status () const;
    │ │ │ │ -
    │ │ │ │ -

    This function returns a vector with status about files │ │ │ │ -that are open for this torrent. Any file that is not open │ │ │ │ -will not be reported in the vector, i.e. it's possible that │ │ │ │ -the vector is empty when returning, if none of the files in the │ │ │ │ -torrent are currently open.

    │ │ │ │ -

    See open_file_state

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    clear_error()

    │ │ │ │ -
    │ │ │ │ -void clear_error () const;
    │ │ │ │ -
    │ │ │ │ -

    If the torrent is in an error state (i.e. torrent_status::error is │ │ │ │ -non-empty), this will clear the error and start the torrent again.

    │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    trackers() add_tracker() replace_trackers() post_trackers()

    │ │ │ │ -
    │ │ │ │ -void post_trackers () const;
    │ │ │ │ -void replace_trackers (std::vector<announce_entry> const&) const;
    │ │ │ │ -std::vector<announce_entry> trackers () const;
    │ │ │ │ -void add_tracker (announce_entry const&) const;
    │ │ │ │ -
    │ │ │ │ -

    trackers() returns 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(). See │ │ │ │ -announce_entry.

    │ │ │ │ -

    post_trackers() is the asynchronous version of trackers(). It │ │ │ │ -will trigger a tracker_list_alert to be posted.

    │ │ │ │ -

    add_tracker() will look if the specified tracker is already in the │ │ │ │ -set. If it is, it doesn't do anything. If it's not in the current set │ │ │ │ -of trackers, it will insert it in the tier specified in the │ │ │ │ -announce_entry.

    │ │ │ │ -

    The updated set of trackers will be saved in the resume data, and when │ │ │ │ -a torrent is started with resume data, the trackers from the resume │ │ │ │ -data will replace the original ones.

    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    add_url_seed() remove_url_seed() url_seeds()

    │ │ │ │ -
    │ │ │ │ -std::set<std::string> url_seeds () const;
    │ │ │ │ -void add_url_seed (std::string const& url) const;
    │ │ │ │ -void remove_url_seed (std::string const& url) 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.

    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    remove_http_seed() add_http_seed() http_seeds()

    │ │ │ │ -
    │ │ │ │ -std::set<std::string> http_seeds () const;
    │ │ │ │ -void add_http_seed (std::string const& url) const;
    │ │ │ │ -void remove_http_seed (std::string const& url) const;
    │ │ │ │ -
    │ │ │ │ -

    These functions are identical as the *_url_seed() variants, but │ │ │ │ -they operate on BEP 17 web seeds instead of BEP 19.

    │ │ │ │ -

    See http seeding for more information.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    add_extension()

    │ │ │ │ -
    │ │ │ │ -void add_extension (
    │ │ │ │ -      std::function<std::shared_ptr<torrent_plugin>(torrent_handle const&, client_data_t)> const& ext
    │ │ │ │ -      , client_data_t userdata = client_data_t{});
    │ │ │ │ -
    │ │ │ │ -

    add the specified extension to this torrent. The ext argument is │ │ │ │ -a function that will be called from within libtorrent's context │ │ │ │ -passing in the internal torrent object and the specified userdata │ │ │ │ -pointer. The function is expected to return a shared pointer to │ │ │ │ -a torrent_plugin instance.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_metadata()

    │ │ │ │ -
    │ │ │ │ -bool set_metadata (span<char const> metadata) const;
    │ │ │ │ -
    │ │ │ │ -

    set_metadata expects the info section of metadata. i.e. The │ │ │ │ -buffer passed in will be hashed and verified against the info-hash. If │ │ │ │ -it fails, a metadata_failed_alert will be generated. If it passes, │ │ │ │ -a metadata_received_alert is generated. The function returns true │ │ │ │ -if the metadata is successfully set on the torrent, and false │ │ │ │ -otherwise. If the torrent already has metadata, this function will not │ │ │ │ -affect the torrent, and false will be returned.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    is_valid()

    │ │ │ │ -
    │ │ │ │ -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 │ │ │ │ -removed from the session AND destructed.

    │ │ │ │ -

    To tell if the torrent_handle is in the session, use │ │ │ │ -torrent_handle::in_session(). This will return true before │ │ │ │ -session_handle::remove_torrent() is called, and false │ │ │ │ -afterward.

    │ │ │ │ -

    Clients should only use is_valid() to determine if the result of │ │ │ │ -session::find_torrent() was successful.

    │ │ │ │ -

    Unlike other member functions which return a value, is_valid() │ │ │ │ -completes immediately, without blocking on a result from the │ │ │ │ -network thread. Also unlike other functions, it never throws │ │ │ │ -the system_error exception.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    pause() resume()

    │ │ │ │ -
    │ │ │ │ -void resume () const;
    │ │ │ │ -void pause (pause_flags_t flags = {}) 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. Torrents may be paused automatically if there is a │ │ │ │ -file error (e.g. disk full) or something similar. See │ │ │ │ -file_error_alert.

    │ │ │ │ -

    For possible values of the flags parameter, see pause_flags_t.

    │ │ │ │ -

    To know if a torrent is paused or not, call │ │ │ │ -torrent_handle::flags() and check for the │ │ │ │ -torrent_status::paused flag.

    │ │ │ │ -
    │ │ │ │ -

    Note

    │ │ │ │ -

    Torrents that are auto-managed may be automatically resumed again. It │ │ │ │ -does not make sense to pause an auto-managed torrent without making it │ │ │ │ -not auto-managed first. Torrents are auto-managed by default when added │ │ │ │ -to the session. For more information, see queuing.

    │ │ │ │ -
    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    unset_flags() set_flags() flags()

    │ │ │ │ -
    │ │ │ │ -void unset_flags (torrent_flags_t flags) const;
    │ │ │ │ -void set_flags (torrent_flags_t flags, torrent_flags_t mask) const;
    │ │ │ │ -void set_flags (torrent_flags_t flags) const;
    │ │ │ │ -torrent_flags_t flags () const;
    │ │ │ │ -
    │ │ │ │ -

    sets and gets the torrent state flags. See torrent_flags_t. │ │ │ │ -The set_flags overload that take a mask will affect all │ │ │ │ -flags part of the mask, and set their values to what the │ │ │ │ -flags argument is set to. This allows clearing and │ │ │ │ -setting flags in a single function call. │ │ │ │ -The set_flags overload that just takes flags, sets all │ │ │ │ -the specified flags and leave any other flags unchanged. │ │ │ │ -unset_flags clears the specified flags, while leaving │ │ │ │ -any other flags unchanged.

    │ │ │ │ -

    The seed_mode flag is special, it can only be cleared once the │ │ │ │ -torrent has been added, and it can only be set as part of the │ │ │ │ -add_torrent_params flags, when adding the torrent.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    flush_cache()

    │ │ │ │ -
    │ │ │ │ -void flush_cache () const;
    │ │ │ │ -
    │ │ │ │ -

    Instructs libtorrent to flush all the disk caches for this torrent and │ │ │ │ -close all file handles. This is done asynchronously and you will be │ │ │ │ -notified that it's complete through cache_flushed_alert.

    │ │ │ │ -

    Note that by the time you get the alert, libtorrent may have cached │ │ │ │ -more data for the torrent, but you are guaranteed that whatever cached │ │ │ │ -data libtorrent had by the time you called │ │ │ │ -torrent_handle::flush_cache() has been written to disk.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    force_recheck()

    │ │ │ │ -
    │ │ │ │ -void force_recheck () const;
    │ │ │ │ -
    │ │ │ │ -

    force_recheck puts the torrent back in a state where it assumes to │ │ │ │ -have no resume data. All peers will be disconnected and the torrent │ │ │ │ -will stop announcing to the tracker. The torrent will be added to the │ │ │ │ -checking queue, and will be checked (all the files will be read and │ │ │ │ -compared to the piece hashes). Once the check is complete, the torrent │ │ │ │ -will start connecting to peers again, as normal. │ │ │ │ -The torrent will be placed last in queue, i.e. its queue position │ │ │ │ -will be the highest of all torrents in the session.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    save_resume_data()

    │ │ │ │ -
    │ │ │ │ -void save_resume_data (resume_data_flags_t flags = {}) const;
    │ │ │ │ -
    │ │ │ │ -

    save_resume_data() asks libtorrent to generate fast-resume data for │ │ │ │ -this torrent. The fast resume data (stored in an add_torrent_params │ │ │ │ -object) can be used to resume a torrent in the next session without │ │ │ │ -having to check all files for which pieces have been downloaded. It │ │ │ │ -can also be used to save a .torrent file for a torrent_handle.

    │ │ │ │ -

    This operation is asynchronous, save_resume_data will return │ │ │ │ -immediately. The resume data is delivered when it's done through a │ │ │ │ -save_resume_data_alert.

    │ │ │ │ -

    The operation will fail, and post a save_resume_data_failed_alert │ │ │ │ -instead, in the following cases:

    │ │ │ │ -
    │ │ │ │ -
      │ │ │ │ -
    1. The torrent is in the process of being removed.
    2. │ │ │ │ -
    3. No torrent state has changed since the last saving of resume │ │ │ │ -data, and the only_if_modified flag is set. │ │ │ │ -metadata (see libtorrent's metadata from peers extension)
    4. │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    Note that some counters may be outdated by the time you receive the fast resume data

    │ │ │ │ -

    When saving resume data because of shutting down, make sure not to │ │ │ │ -remove_torrent() before you receive the save_resume_data_alert. │ │ │ │ -There's no need to pause the session or torrent when saving resume │ │ │ │ -data.

    │ │ │ │ -

    The paused state of a torrent is saved in the resume data, so pausing │ │ │ │ -all torrents before saving resume data will all torrents be restored │ │ │ │ -in a paused state.

    │ │ │ │ -
    │ │ │ │ -

    Note

    │ │ │ │ -

    It is typically a good idea to save resume data whenever a torrent │ │ │ │ -is completed or paused. If you save resume data for torrents when they are │ │ │ │ -paused, you can accelerate the shutdown process by not saving resume │ │ │ │ -data again for those torrents. Completed torrents should have their │ │ │ │ -resume data saved when they complete and on exit, since their │ │ │ │ -statistics might be updated.

    │ │ │ │ -
    │ │ │ │ -

    Example code to pause and save resume data for all torrents and wait │ │ │ │ -for the alerts:

    │ │ │ │ -
    │ │ │ │ -extern int outstanding_resume_data; // global counter of outstanding resume data
    │ │ │ │ -std::vector<torrent_handle> handles = ses.get_torrents();
    │ │ │ │ -for (torrent_handle const& h : handles) try
    │ │ │ │ -{
    │ │ │ │ -        h.save_resume_data(torrent_handle::only_if_modified);
    │ │ │ │ -        ++outstanding_resume_data;
    │ │ │ │ -}
    │ │ │ │ -catch (lt::system_error const& e)
    │ │ │ │ -{
    │ │ │ │ -        // the handle was invalid, ignore this one and move to the next
    │ │ │ │ -}
    │ │ │ │ -
    │ │ │ │ -while (outstanding_resume_data > 0)
    │ │ │ │ -{
    │ │ │ │ -        alert const* a = ses.wait_for_alert(seconds(30));
    │ │ │ │ -
    │ │ │ │ -        // if we don't get an alert within 30 seconds, abort
    │ │ │ │ -        if (a == nullptr) break;
    │ │ │ │ -
    │ │ │ │ -        std::vector<alert*> alerts;
    │ │ │ │ -        ses.pop_alerts(&alerts);
    │ │ │ │ -
    │ │ │ │ -        for (alert* i : alerts)
    │ │ │ │ -        {
    │ │ │ │ -                if (alert_cast<save_resume_data_failed_alert>(i))
    │ │ │ │ -                {
    │ │ │ │ -                        process_alert(i);
    │ │ │ │ -                        --outstanding_resume_data;
    │ │ │ │ -                        continue;
    │ │ │ │ -                }
    │ │ │ │ -
    │ │ │ │ -                save_resume_data_alert const* rd = alert_cast<save_resume_data_alert>(i);
    │ │ │ │ -                if (rd == nullptr)
    │ │ │ │ -                {
    │ │ │ │ -                        process_alert(i);
    │ │ │ │ -                        continue;
    │ │ │ │ -                }
    │ │ │ │ -
    │ │ │ │ -                std::ofstream out((rd->params.save_path
    │ │ │ │ -                        + "/" + rd->params.name + ".fastresume").c_str()
    │ │ │ │ -                        , std::ios_base::binary);
    │ │ │ │ -                std::vector<char> buf = write_resume_data_buf(rd->params);
    │ │ │ │ -                out.write(buf.data(), buf.size());
    │ │ │ │ -                --outstanding_resume_data;
    │ │ │ │ -        }
    │ │ │ │ -}
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    Note

    │ │ │ │ -

    Note how outstanding_resume_data is a global counter in this │ │ │ │ -example. This is deliberate, otherwise there is a race condition for │ │ │ │ -torrents that was just asked to save their resume data, they posted │ │ │ │ -the alert, but it has not been received yet. Those torrents would │ │ │ │ -report that they don't need to save resume data again, and skipped by │ │ │ │ -the initial loop, and thwart the counter otherwise.

    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    need_save_resume_data()

    │ │ │ │ -
    │ │ │ │ -bool need_save_resume_data (resume_data_flags_t flags) const;
    │ │ │ │ -bool need_save_resume_data () const;
    │ │ │ │ -
    │ │ │ │ -

    This function returns true if anything that is stored in the resume │ │ │ │ -data has changed since the last time resume data was saved. │ │ │ │ -The overload that takes flags let you ask if specific categories │ │ │ │ -of properties have changed. These flags have the same behavior as in │ │ │ │ -the save_resume_data() call.

    │ │ │ │ -

    This is a blocking call. It will wait for a response from │ │ │ │ -libtorrent's main thread. A way to avoid blocking is to instead │ │ │ │ -call save_resume_data() directly, specifying the conditions under │ │ │ │ -which resume data should be saved.

    │ │ │ │ -
    │ │ │ │ -

    Note

    │ │ │ │ -

    A torrent's resume data is considered saved as soon as the │ │ │ │ -save_resume_data_alert is posted. It is important to make sure this │ │ │ │ -alert is received and handled in order for this function to be │ │ │ │ -meaningful.

    │ │ │ │ -
    │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    queue_position_top() queue_position_up() queue_position() queue_position_down() queue_position_bottom()

    │ │ │ │ -
    │ │ │ │ -queue_position_t queue_position () const;
    │ │ │ │ -void queue_position_bottom () const;
    │ │ │ │ -void queue_position_top () const;
    │ │ │ │ -void queue_position_down () const;
    │ │ │ │ -void queue_position_up () const;
    │ │ │ │ -
    │ │ │ │ -

    Every torrent that is added is assigned a queue position exactly one │ │ │ │ -greater than the greatest queue position of all existing torrents. │ │ │ │ -Torrents that are being seeded have -1 as their queue position, since │ │ │ │ -they're no longer in line to be downloaded.

    │ │ │ │ -

    When a torrent is removed or turns into a seed, all torrents with │ │ │ │ -greater queue positions have their positions decreased to fill in the │ │ │ │ -space in the sequence.

    │ │ │ │ -

    queue_position() returns the torrent's position in the download │ │ │ │ -queue. The torrents with the smallest numbers are the ones that are │ │ │ │ -being downloaded. The smaller number, the closer the torrent is to the │ │ │ │ -front of the line to be started.

    │ │ │ │ -

    The queue position is also available in the torrent_status.

    │ │ │ │ -

    The queue_position_*() functions adjust the torrents position in │ │ │ │ -the queue. Up means closer to the front and down means closer to the │ │ │ │ -back of the queue. Top and bottom refers to the front and the back of │ │ │ │ -the queue respectively.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    queue_position_set()

    │ │ │ │ -
    │ │ │ │ -void queue_position_set (queue_position_t p) const;
    │ │ │ │ -
    │ │ │ │ -

    updates the position in the queue for this torrent. The relative order │ │ │ │ -of all other torrents remain intact but their numerical queue position │ │ │ │ -shifts to make space for this torrent's new position

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_ssl_certificate_buffer() set_ssl_certificate()

    │ │ │ │ -
    │ │ │ │ -void set_ssl_certificate_buffer (std::string const& certificate
    │ │ │ │ -      , std::string const& private_key
    │ │ │ │ -      , std::string const& dh_params);
    │ │ │ │ -void set_ssl_certificate (std::string const& certificate
    │ │ │ │ -      , std::string const& private_key
    │ │ │ │ -      , std::string const& dh_params
    │ │ │ │ -      , std::string const& passphrase = "");
    │ │ │ │ -
    │ │ │ │ -

    For SSL torrents, use this to specify a path to a .pem file to use as │ │ │ │ -this client's certificate. The certificate must be signed by the │ │ │ │ -certificate in the .torrent file to be valid.

    │ │ │ │ -

    The set_ssl_certificate_buffer() overload takes the actual certificate, │ │ │ │ -private key and DH params as strings, rather than paths to files.

    │ │ │ │ -

    cert is a path to the (signed) certificate in .pem format │ │ │ │ -corresponding to this torrent.

    │ │ │ │ -

    private_key is a path to the private key for the specified │ │ │ │ -certificate. This must be in .pem format.

    │ │ │ │ -

    dh_params is a path to the Diffie-Hellman parameter file, which │ │ │ │ -needs to be in .pem format. You can generate this file using the │ │ │ │ -openssl command like this: openssl dhparam -outform PEM -out │ │ │ │ -dhparams.pem 512.

    │ │ │ │ -

    passphrase may be specified if the private key is encrypted and │ │ │ │ -requires a passphrase to be decrypted.

    │ │ │ │ -

    Note that when a torrent first starts up, and it needs a certificate, │ │ │ │ -it will suspend connecting to any peers until it has one. It's │ │ │ │ -typically desirable to resume the torrent after setting the SSL │ │ │ │ -certificate.

    │ │ │ │ -

    If you receive a torrent_need_cert_alert, you need to call this to │ │ │ │ -provide a valid cert. If you don't have a cert you won't be allowed to │ │ │ │ -connect to any peers.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    torrent_file_with_hashes() torrent_file()

    │ │ │ │ -
    │ │ │ │ -std::shared_ptr<torrent_info> torrent_file_with_hashes () const;
    │ │ │ │ -std::shared_ptr<const torrent_info> torrent_file () const;
    │ │ │ │ -
    │ │ │ │ -

    torrent_file() returns a pointer to the torrent_info object │ │ │ │ -associated with this torrent. The torrent_info object may be a copy │ │ │ │ -of the internal object. If the torrent doesn't have metadata, the │ │ │ │ -pointer will not be initialized (i.e. a nullptr). The torrent may be │ │ │ │ -in a state without metadata only if it was started without a .torrent │ │ │ │ -file, e.g. by being added by magnet link.

    │ │ │ │ -

    Note that the torrent_info object returned here may be a different │ │ │ │ -instance than the one added to the session, with different attributes │ │ │ │ -like piece layers, dht nodes and trackers. A torrent_info object does │ │ │ │ -not round-trip cleanly when added to a session.

    │ │ │ │ -

    If you want to save a .torrent file from the torrent_handle, instead │ │ │ │ -call save_resume_data() and write_torrent_file() the │ │ │ │ -add_torrent_params object passed back in the alert.

    │ │ │ │ -

    torrent_file_with_hashes() returns a copy of the internal │ │ │ │ -torrent_info and piece layer hashes (if it's a v2 torrent). The piece │ │ │ │ -layers will only be included if they are available. If this torrent │ │ │ │ -was added from a .torrent file with piece layers or if it's seeding, │ │ │ │ -the piece layers are available. This function is more expensive than │ │ │ │ -torrent_file() since it needs to make copies of this information.

    │ │ │ │ -

    The torrent_file_with_hashes() is here for backwards compatibility │ │ │ │ -when constructing a create_torrent object from a torrent_info that's │ │ │ │ -in a session. Prefer save_resume_data() + write_torrent_file().

    │ │ │ │ -

    Note that a torrent added from a magnet link may not have the full │ │ │ │ -merkle trees for all files, and hence not have the complete piece │ │ │ │ -layers. In that state, you cannot create a .torrent file even from │ │ │ │ -the torrent_info returned from torrent_file_with_hashes(). Once the │ │ │ │ -torrent completes downloading all files, becoming a seed, you can │ │ │ │ -make a .torrent file from it.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    piece_layers()

    │ │ │ │ -
    │ │ │ │ -std::vector<std::vector<sha256_hash>> piece_layers () const;
    │ │ │ │ -
    │ │ │ │ -

    returns the piece layers for all files in the torrent. If this is a │ │ │ │ -v1 torrent (and doesn't have any piece layers) it returns an empty │ │ │ │ -vector. This is a blocking call that will synchronize with the │ │ │ │ -libtorrent network thread.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    piece_availability() post_piece_availability()

    │ │ │ │ -
    │ │ │ │ -void post_piece_availability () const;
    │ │ │ │ -void piece_availability (std::vector<int>& avail) const;
    │ │ │ │ -
    │ │ │ │ -

    The piece availability is the number of peers that we are connected │ │ │ │ -that has advertised having a particular piece. This is the information │ │ │ │ -that libtorrent uses in order to prefer picking rare pieces.

    │ │ │ │ -

    post_piece_availability() will trigger a piece_availability_alert │ │ │ │ -to be posted.

    │ │ │ │ -

    piece_availability() fills the specified std::vector<int> │ │ │ │ -with the availability for each piece in this torrent. libtorrent does │ │ │ │ -not keep track of availability for seeds, so if the torrent is │ │ │ │ -seeding the availability for all pieces is reported as 0.

    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    prioritize_pieces() piece_priority() get_piece_priorities()

    │ │ │ │ -
    │ │ │ │ -void prioritize_pieces (std::vector<download_priority_t> const& pieces) const;
    │ │ │ │ -void prioritize_pieces (std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces) const;
    │ │ │ │ -std::vector<download_priority_t> get_piece_priorities () const;
    │ │ │ │ -download_priority_t piece_priority (piece_index_t index) const;
    │ │ │ │ -void piece_priority (piece_index_t index, download_priority_t priority) const;
    │ │ │ │ -
    │ │ │ │ -

    These functions are used to set and get the priority of individual │ │ │ │ -pieces. By default all pieces have priority 4. 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 │ │ │ │ -priority levels. 0 means not to download the piece at all. Otherwise, │ │ │ │ -lower priority values means less likely to be picked. Piece priority │ │ │ │ -takes precedence over piece availability. Every piece with priority 7 │ │ │ │ -will be attempted to be picked before a priority 6 piece and so on.

    │ │ │ │ -

    The default priority of pieces is 4.

    │ │ │ │ -

    Piece priorities can not be changed for torrents that have not │ │ │ │ -downloaded the metadata yet. Magnet links won't have metadata │ │ │ │ -immediately. see the metadata_received_alert.

    │ │ │ │ -

    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. │ │ │ │ -The second overload of prioritize_pieces that takes a vector of pairs │ │ │ │ -will update the priorities of only select pieces, and leave all other │ │ │ │ -unaffected. Each pair is (piece, priority). That is, the first item is │ │ │ │ -the piece index and the second item is the priority of that piece. │ │ │ │ -Invalid entries, where the piece index or priority is out of range, are │ │ │ │ -not allowed.

    │ │ │ │ -

    get_piece_priorities returns a vector with one element for each piece │ │ │ │ -in the torrent. Each element is the current priority of that piece.

    │ │ │ │ -

    It's possible to cancel the effect of file priorities by setting the │ │ │ │ -priorities for the affected pieces. Care has to be taken when mixing │ │ │ │ -usage of file- and piece priorities.

    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    file_priority() get_file_priorities() prioritize_files()

    │ │ │ │ -
    │ │ │ │ -std::vector<download_priority_t> get_file_priorities () const;
    │ │ │ │ -download_priority_t file_priority (file_index_t index) const;
    │ │ │ │ -void file_priority (file_index_t index, download_priority_t priority) const;
    │ │ │ │ -void prioritize_files (std::vector<download_priority_t> const& files) const;
    │ │ │ │ -
    │ │ │ │ -

    index must be in the range [0, number_of_files).

    │ │ │ │ -

    file_priority() queries or sets the priority of file index.

    │ │ │ │ -

    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.

    │ │ │ │ -

    get_file_priorities() returns a vector with the priorities of all │ │ │ │ -files.

    │ │ │ │ -

    The priority values are the same as for piece_priority(). See │ │ │ │ -download_priority_t.

    │ │ │ │ -

    Whenever a file priority is changed, all other piece priorities are │ │ │ │ -reset to match the file priorities. In order to maintain special │ │ │ │ -priorities for particular pieces, piece_priority() has to be called │ │ │ │ -again for those pieces.

    │ │ │ │ -

    You cannot set the file priorities on a torrent that does not yet have │ │ │ │ -metadata or a torrent that is a seed. file_priority(int, int) and │ │ │ │ -prioritize_files() are both no-ops for such torrents.

    │ │ │ │ -

    Since changing file priorities may involve disk operations (of moving │ │ │ │ -files in- and out of the part file), the internal accounting of file │ │ │ │ -priorities happen asynchronously. i.e. setting file priorities and then │ │ │ │ -immediately querying them may not yield the same priorities just set. │ │ │ │ -To synchronize with the priorities taking effect, wait for the │ │ │ │ -file_prio_alert.

    │ │ │ │ -

    When combining file- and piece priorities, the resume file will record │ │ │ │ -both. When loading the resume data, the file priorities will be applied │ │ │ │ -first, then the piece priorities.

    │ │ │ │ -

    Moving data from a file into the part file is currently not │ │ │ │ -supported. If a file has its priority set to 0 after it has already │ │ │ │ -been created, it will not be moved into the partfile.

    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    force_dht_announce() force_reannounce() force_lsd_announce()

    │ │ │ │ -
    │ │ │ │ -void force_reannounce (int seconds = 0, int idx = -1, reannounce_flags_t = {}) const;
    │ │ │ │ -void force_dht_announce () const;
    │ │ │ │ -void force_lsd_announce () const;
    │ │ │ │ -
    │ │ │ │ -

    force_reannounce() will force this torrent to do another tracker │ │ │ │ -request, to receive new peers. The seconds argument specifies how │ │ │ │ -many seconds from now to issue the tracker announces.

    │ │ │ │ -

    If the tracker's min_interval has not passed since the last │ │ │ │ -announce, the forced announce will be scheduled to happen immediately │ │ │ │ -as the min_interval expires. This is to honor trackers minimum │ │ │ │ -re-announce interval settings.

    │ │ │ │ -

    The tracker_index argument specifies which tracker to re-announce. │ │ │ │ -If set to -1 (which is the default), all trackers are re-announce.

    │ │ │ │ -

    The flags argument can be used to affect the re-announce. See │ │ │ │ -ignore_min_interval.

    │ │ │ │ -

    force_dht_announce will announce the torrent to the DHT │ │ │ │ -immediately.

    │ │ │ │ -

    force_lsd_announce will announce the torrent on LSD │ │ │ │ -immediately.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    scrape_tracker()

    │ │ │ │ -
    │ │ │ │ -void scrape_tracker (int idx = -1) const;
    │ │ │ │ -
    │ │ │ │ -

    scrape_tracker() will send a scrape request to a tracker. By │ │ │ │ -default (idx = -1) it will scrape the last working tracker. If │ │ │ │ -idx is >= 0, the tracker with the specified index will scraped.

    │ │ │ │ -

    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.

    │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    download_limit() set_download_limit() upload_limit() set_upload_limit()

    │ │ │ │ -
    │ │ │ │ -int upload_limit () const;
    │ │ │ │ -int download_limit () const;
    │ │ │ │ -void set_upload_limit (int limit) const;
    │ │ │ │ -void set_download_limit (int 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 │ │ │ │ -(settings_pack::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.

    │ │ │ │ -

    Local peers are not rate limited by default. see peer classes.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    connect_peer()

    │ │ │ │ -
    │ │ │ │ -void connect_peer (tcp::endpoint const& adr, peer_source_flags_t source = {}
    │ │ │ │ -      , pex_flags_t flags = pex_encryption | pex_utp | pex_holepunch) 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 system_error. The second (optional) │ │ │ │ -argument will be bitwise 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.

    │ │ │ │ -

    For possible values of flags, see pex_flags_t.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    clear_peers()

    │ │ │ │ -
    │ │ │ │ -void clear_peers ();
    │ │ │ │ -
    │ │ │ │ -

    This will disconnect all peers and clear the peer list for this │ │ │ │ -torrent. New peers will have to be acquired before resuming, from │ │ │ │ -trackers, DHT or local service discovery, for example.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    max_uploads() set_max_uploads()

    │ │ │ │ -
    │ │ │ │ -int max_uploads () const;
    │ │ │ │ -void set_max_uploads (int max_uploads) 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. This defaults to infinite. The primary setting controlling │ │ │ │ -this is the global unchoke slots limit, set by unchoke_slots_limit in │ │ │ │ -settings_pack.

    │ │ │ │ -

    max_uploads() returns the current settings.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_max_connections() max_connections()

    │ │ │ │ -
    │ │ │ │ -int max_connections () const;
    │ │ │ │ -void set_max_connections (int max_connections) const;
    │ │ │ │ -
    │ │ │ │ -

    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. There is also a │ │ │ │ -global limit of the number of connections, set by │ │ │ │ -connections_limit in settings_pack.

    │ │ │ │ -

    max_connections() returns the current settings.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    move_storage()

    │ │ │ │ -
    │ │ │ │ -void move_storage (std::string const& save_path
    │ │ │ │ -      , move_flags_t flags = move_flags_t::always_replace_files
    │ │ │ │ -      ) const;
    │ │ │ │ -
    │ │ │ │ -

    Moves the file(s) that this torrent are currently seeding from or │ │ │ │ -downloading to. If the given save_path is not located on the same │ │ │ │ -drive as the original save path, the files will be copied to the new │ │ │ │ -drive and removed from their original location. This will block all │ │ │ │ -other disk IO, and other torrents download and upload rates may drop │ │ │ │ -while copying the file.

    │ │ │ │ -

    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. If the move fails for some reason, │ │ │ │ -storage_moved_failed_alert is generated instead, containing the │ │ │ │ -error message.

    │ │ │ │ -

    The flags argument determines the behavior of the copying/moving │ │ │ │ -of the files in the torrent. see move_flags_t.

    │ │ │ │ -

    always_replace_files is the default and replaces any file that │ │ │ │ -exist in both the source directory and the target directory.

    │ │ │ │ -

    fail_if_exist first check to see that none of the copy operations │ │ │ │ -would cause an overwrite. If it would, it will fail. Otherwise it will │ │ │ │ -proceed as if it was in always_replace_files mode. Note that there │ │ │ │ -is an inherent race condition here. If the files in the target │ │ │ │ -directory appear after the check but before the copy or move │ │ │ │ -completes, they will be overwritten. When failing because of files │ │ │ │ -already existing in the target path, the error of │ │ │ │ -move_storage_failed_alert is set to │ │ │ │ -boost::system::errc::file_exists.

    │ │ │ │ -

    The intention is that a client may use this as a probe, and if it │ │ │ │ -fails, ask the user which mode to use. The client may then re-issue │ │ │ │ -the move_storage call with one of the other modes.

    │ │ │ │ -

    dont_replace always keeps the existing file in the target │ │ │ │ -directory, if there is one. The source files will still be removed in │ │ │ │ -that case. Note that it won't automatically re-check files. If an │ │ │ │ -incomplete torrent is moved into a directory with the complete files, │ │ │ │ -pause, move, force-recheck and resume. Without the re-checking, the │ │ │ │ -torrent will keep downloading and files in the new download directory │ │ │ │ -will be overwritten.

    │ │ │ │ -

    Files that have been renamed to have absolute paths are not moved by │ │ │ │ -this function. Keep in mind that files that don't belong to the │ │ │ │ -torrent but are stored in the torrent's directory may be moved as │ │ │ │ -well. This goes for files that have been renamed to absolute paths │ │ │ │ -that still end up inside the save path.

    │ │ │ │ -

    When copying files, sparse regions are not likely to be preserved. │ │ │ │ -This makes it proportionally more expensive to move a large torrent │ │ │ │ -when only few pieces have been downloaded, since the files are then │ │ │ │ -allocated with zeros in the destination directory.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    rename_file()

    │ │ │ │ -
    │ │ │ │ -void rename_file (file_index_t index, std::string const& new_name) const;
    │ │ │ │ -
    │ │ │ │ -

    Renames the file with the given index asynchronously. The rename │ │ │ │ -operation is complete when either a file_renamed_alert or │ │ │ │ -file_rename_failed_alert is posted.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    info_hash() info_hashes()

    │ │ │ │ -
    │ │ │ │ -sha1_hash info_hash () const;
    │ │ │ │ -info_hash_t info_hashes () const;
    │ │ │ │ -
    │ │ │ │ -

    returns the info-hash(es) of the torrent. If this handle is to a │ │ │ │ -torrent that hasn't loaded yet (for instance by being added) by a │ │ │ │ -URL, the returned value is undefined. │ │ │ │ -The info_hash() returns the SHA-1 info-hash for v1 torrents and a │ │ │ │ -truncated hash for v2 torrents. For the full v2 info-hash, use │ │ │ │ -info_hashes() instead.

    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    operator!=() operator<() operator==()

    │ │ │ │ -
    │ │ │ │ -bool operator< (const torrent_handle& h) const;
    │ │ │ │ -bool operator== (const torrent_handle& h) const;
    │ │ │ │ -bool operator!= (const torrent_handle& h) const;
    │ │ │ │ -
    │ │ │ │ -

    comparison operators. The order of the torrents is unspecified │ │ │ │ -but stable.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    id()

    │ │ │ │ -
    │ │ │ │ -std::uint32_t id () const;
    │ │ │ │ -
    │ │ │ │ -

    returns a unique identifier for this torrent. It's not a dense index. │ │ │ │ -It's not preserved across sessions.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    native_handle()

    │ │ │ │ -
    │ │ │ │ -std::shared_ptr<torrent> native_handle () const;
    │ │ │ │ -
    │ │ │ │ -

    This function is intended only for use by plugins and the alert │ │ │ │ -dispatch function. This type does not have a stable ABI and should │ │ │ │ -be relied on as little as possible. Accessing the handle returned by │ │ │ │ -this function is not thread safe outside of libtorrent's internal │ │ │ │ -thread (which is used to invoke plugin callbacks). │ │ │ │ -The torrent class is not only eligible for changing ABI across │ │ │ │ -minor versions of libtorrent, its layout is also dependent on build │ │ │ │ -configuration. This adds additional requirements on a client to be │ │ │ │ -built with the exact same build configuration as libtorrent itself. │ │ │ │ -i.e. the TORRENT_ macros must match between libtorrent and the │ │ │ │ -client builds.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    userdata()

    │ │ │ │ -
    │ │ │ │ -client_data_t userdata () const;
    │ │ │ │ -
    │ │ │ │ -

    returns the userdata pointer as set in add_torrent_params

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    in_session()

    │ │ │ │ -
    │ │ │ │ -bool in_session () const;
    │ │ │ │ -
    │ │ │ │ -

    Returns true if the torrent is in the session. It returns true before │ │ │ │ -session::remove_torrent() is called, and false afterward.

    │ │ │ │ -

    Note that this is a blocking function, unlike torrent_handle::is_valid() │ │ │ │ -which returns immediately.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    overwrite_existing
    │ │ │ │ -
    instruct libtorrent to overwrite any data that may already have been │ │ │ │ -downloaded with the data of the new piece being added. Using this │ │ │ │ -flag when adding a piece that is actively being downloaded from other │ │ │ │ -peers may have some unexpected consequences, as blocks currently │ │ │ │ -being downloaded from peers may not be replaced.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    query_distributed_copies
    │ │ │ │ -
    calculates distributed_copies, distributed_full_copies and │ │ │ │ -distributed_fraction.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    query_accurate_download_counters
    │ │ │ │ -
    includes partial downloaded blocks in total_done and │ │ │ │ -total_wanted_done.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    query_last_seen_complete
    │ │ │ │ -
    includes last_seen_complete.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    query_pieces
    │ │ │ │ -
    populate the pieces field in torrent_status.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    query_verified_pieces
    │ │ │ │ -
    includes verified_pieces (only applies to torrents in seed │ │ │ │ -mode).
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    query_torrent_file
    │ │ │ │ -
    includes torrent_file, which is all the static information from │ │ │ │ -the .torrent file.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    query_name
    │ │ │ │ -
    includes name, the name of the torrent. This is either derived │ │ │ │ -from the .torrent file, or from the &dn= magnet link argument │ │ │ │ -or possibly some other source. If the name of the torrent is not │ │ │ │ -known, this is an empty string.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    query_save_path
    │ │ │ │ -
    includes save_path, the path to the directory the files of the │ │ │ │ -torrent are saved to.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    alert_when_available
    │ │ │ │ -
    used to ask libtorrent to send an alert once the piece has been │ │ │ │ -downloaded, by passing alert_when_available. When set, the │ │ │ │ -read_piece_alert alert will be delivered, with the piece data, when │ │ │ │ -it's downloaded.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    piece_granularity
    │ │ │ │ -
    only calculate file progress at piece granularity. This makes │ │ │ │ -the file_progress() call cheaper and also only takes bytes that │ │ │ │ -have passed the hash check into account, so progress cannot │ │ │ │ -regress in this mode.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    graceful_pause
    │ │ │ │ -
    will delay the disconnect of peers that we're still downloading │ │ │ │ -outstanding requests from. The torrent will not accept any more │ │ │ │ -requests and will disconnect all idle peers. As soon as a peer is done │ │ │ │ -transferring the blocks that were requested from it, it is │ │ │ │ -disconnected. This is a graceful shut down of the torrent in the sense │ │ │ │ -that no downloaded bytes are wasted.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    flush_disk_cache
    │ │ │ │ -
    the disk cache will be flushed before creating the resume data. │ │ │ │ -This avoids a problem with file timestamps in the resume data in │ │ │ │ -case the cache hasn't been flushed yet.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    save_info_dict
    │ │ │ │ -
    the resume data will contain the metadata from the torrent file as │ │ │ │ -well. This is useful for clients that don't keep .torrent files │ │ │ │ -around separately, or for torrents that were added via a magnet link.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    only_if_modified
    │ │ │ │ -
    this flag has the same behavior as the combination of: │ │ │ │ -if_counters_changed | if_download_progress | if_config_changed | │ │ │ │ -if_state_changed | if_metadata_changed
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    if_counters_changed
    │ │ │ │ -
    save resume data if any counters has changed since the last time │ │ │ │ -resume data was saved. This includes upload/download counters, active │ │ │ │ -time counters and scrape data. A torrent that is not paused will have │ │ │ │ -its active time counters incremented continuously.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    if_download_progress
    │ │ │ │ -
    save the resume data if any blocks have been downloaded since the │ │ │ │ -last time resume data was saved. This includes: │ │ │ │ -* checking existing files on disk │ │ │ │ -* downloading a block from a peer
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    if_config_changed
    │ │ │ │ -
    save the resume data if configuration options changed since last time │ │ │ │ -the resume data was saved. This includes: │ │ │ │ -* file- or piece priorities │ │ │ │ -* upload- and download rate limits │ │ │ │ -* change max-uploads (unchoke slots) │ │ │ │ -* change max connection limit │ │ │ │ -* enable/disable peer-exchange, local service discovery or DHT │ │ │ │ -* enable/disable apply IP-filter │ │ │ │ -* enable/disable auto-managed │ │ │ │ -* enable/disable share-mode │ │ │ │ -* enable/disable sequential-mode │ │ │ │ -* files renamed │ │ │ │ -* storage moved (save_path changed)
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    if_state_changed
    │ │ │ │ -
    save the resume data if torrent state has changed since last time the │ │ │ │ -resume data was saved. This includes: │ │ │ │ -* upload mode │ │ │ │ -* paused state │ │ │ │ -* super-seeding │ │ │ │ -* seed-mode
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    if_metadata_changed
    │ │ │ │ -
    save the resume data if any metadata changed since the last time │ │ │ │ -resume data was saved. This includes: │ │ │ │ -* add/remove web seeds │ │ │ │ -* add/remove trackers │ │ │ │ -* receiving metadata for a magnet link
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    ignore_min_interval
    │ │ │ │ -
    by default, force-reannounce will still honor the min-interval │ │ │ │ -published by the tracker. If this flag is set, it will be ignored │ │ │ │ -and the tracker is announced immediately.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    hash_value()

    │ │ │ │ -

    Declared in "libtorrent/torrent_handle.hpp"

    │ │ │ │ -
    │ │ │ │ -std::size_t hash_value (torrent_handle const& h);
    │ │ │ │ -
    │ │ │ │ -

    for std::hash (and to support using this type in unordered_map etc.)

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    web_seed_entry

    │ │ │ │ -

    Declared in "libtorrent/torrent_info.hpp"

    │ │ │ │ -

    the web_seed_entry holds information about a web seed (also known │ │ │ │ -as URL seed or HTTP seed). It is essentially a URL with some state │ │ │ │ -associated with it. For more information, see BEP 17 and BEP 19.

    │ │ │ │ -
    │ │ │ │ -struct web_seed_entry
    │ │ │ │ -{
    │ │ │ │ -   bool operator== (web_seed_entry const& e) const;
    │ │ │ │ -   bool operator< (web_seed_entry const& e) const;
    │ │ │ │ -
    │ │ │ │ -   enum type_t
    │ │ │ │ -   {
    │ │ │ │ -      url_seed,
    │ │ │ │ -      http_seed,
    │ │ │ │ -   };
    │ │ │ │ -
    │ │ │ │ -   std::string url;
    │ │ │ │ -   std::string auth;
    │ │ │ │ -   headers_t extra_headers;
    │ │ │ │ -   std::uint8_t type;
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -

    operator==()

    │ │ │ │ -
    │ │ │ │ -bool operator== (web_seed_entry const& e) const;
    │ │ │ │ -
    │ │ │ │ -

    URL and type comparison

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    operator<()

    │ │ │ │ -
    │ │ │ │ -bool operator< (web_seed_entry const& e) const;
    │ │ │ │ -
    │ │ │ │ -

    URL and type less-than comparison

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum type_t

    │ │ │ │ -

    Declared in "libtorrent/torrent_info.hpp"

    │ │ │ │ - │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -
    namevaluedescription
    url_seed0 
    http_seed1 
    │ │ │ │ -[report issue]
    │ │ │ │ -
    url
    │ │ │ │ -
    The URL of the web seed
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    auth
    │ │ │ │ -
    Optional authentication. If this is set, it's passed │ │ │ │ -in as HTTP basic auth to the web seed. The format is: │ │ │ │ -username:password.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    extra_headers
    │ │ │ │ -
    Any extra HTTP headers that need to be passed to the web seed
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    type
    │ │ │ │ -
    The type of web seed (see type_t)
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    load_torrent_limits

    │ │ │ │ -

    Declared in "libtorrent/torrent_info.hpp"

    │ │ │ │ -

    this object holds configuration options for limits to use when loading │ │ │ │ -torrents. They are meant to prevent loading potentially malicious torrents │ │ │ │ -that cause excessive memory allocations.

    │ │ │ │ -
    │ │ │ │ -struct load_torrent_limits
    │ │ │ │ -{
    │ │ │ │ -   int max_buffer_size  = 10000000;
    │ │ │ │ -   int max_pieces  = 0x200000;
    │ │ │ │ -   int max_decode_depth  = 100;
    │ │ │ │ -   int max_decode_tokens  = 3000000;
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    max_buffer_size
    │ │ │ │ -
    the max size of a .torrent file to load into RAM
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    max_pieces
    │ │ │ │ -
    the max number of pieces allowed in the torrent
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    max_decode_depth
    │ │ │ │ -
    the max recursion depth in the bdecoded structure
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    max_decode_tokens
    │ │ │ │ -
    the max number of bdecode tokens
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    torrent_info

    │ │ │ │ -

    Declared in "libtorrent/torrent_info.hpp"

    │ │ │ │ -

    the torrent_info class holds the information found in a .torrent file.

    │ │ │ │ -
    │ │ │ │ -class torrent_info
    │ │ │ │ -{
    │ │ │ │ -   torrent_info (char const* buffer, int size, error_code& ec);
    │ │ │ │ -   torrent_info (bdecode_node const& torrent_file, error_code& ec);
    │ │ │ │ -   torrent_info (span<char const> buffer, error_code& ec, from_span_t);
    │ │ │ │ -   explicit torrent_info (span<char const> buffer, from_span_t);
    │ │ │ │ -   explicit torrent_info (info_hash_t const& info_hash);
    │ │ │ │ -   explicit torrent_info (bdecode_node const& torrent_file);
    │ │ │ │ -   torrent_info (std::string const& filename, error_code& ec);
    │ │ │ │ -   torrent_info (torrent_info const& t);
    │ │ │ │ -   explicit torrent_info (std::string const& filename);
    │ │ │ │ -   torrent_info (std::string const& filename, load_torrent_limits const& cfg);
    │ │ │ │ -   torrent_info (span<char const> buffer, load_torrent_limits const& cfg, from_span_t);
    │ │ │ │ -   torrent_info (char const* buffer, int size);
    │ │ │ │ -   torrent_info (bdecode_node const& torrent_file, load_torrent_limits const& cfg);
    │ │ │ │ -   ~torrent_info ();
    │ │ │ │ -   file_storage const& files () const;
    │ │ │ │ -   file_storage const& orig_files () const;
    │ │ │ │ -   void rename_file (file_index_t index, std::string const& new_filename);
    │ │ │ │ -   void remap_files (file_storage const& f);
    │ │ │ │ -   std::vector<announce_entry> const& trackers () const;
    │ │ │ │ -   void add_tracker (std::string const& url, int tier = 0);
    │ │ │ │ -   void clear_trackers ();
    │ │ │ │ -   void add_tracker (std::string const& url, int tier
    │ │ │ │ -      , announce_entry::tracker_source source);
    │ │ │ │ -   std::vector<sha1_hash> similar_torrents () const;
    │ │ │ │ -   std::vector<std::string> collections () const;
    │ │ │ │ -   void add_url_seed (std::string const& url
    │ │ │ │ -      , std::string const& ext_auth = std::string()
    │ │ │ │ -      , web_seed_entry::headers_t const& ext_headers = web_seed_entry::headers_t());
    │ │ │ │ -   std::vector<web_seed_entry> const& web_seeds () const;
    │ │ │ │ -   void set_web_seeds (std::vector<web_seed_entry> seeds);
    │ │ │ │ -   void add_http_seed (std::string const& url
    │ │ │ │ -      , std::string const& extern_auth = std::string()
    │ │ │ │ -      , web_seed_entry::headers_t const& extra_headers = web_seed_entry::headers_t());
    │ │ │ │ -   std::int64_t total_size () const;
    │ │ │ │ -   int piece_length () const;
    │ │ │ │ -   int num_pieces () const;
    │ │ │ │ -   int blocks_per_piece () const;
    │ │ │ │ -   index_range<piece_index_t> piece_range () const;
    │ │ │ │ -   piece_index_t last_piece () const;
    │ │ │ │ -   piece_index_t end_piece () const;
    │ │ │ │ -   info_hash_t const& info_hashes () const;
    │ │ │ │ -   sha1_hash info_hash () const noexcept;
    │ │ │ │ -   bool v2 () const;
    │ │ │ │ -   bool v1 () const;
    │ │ │ │ -   int num_files () const;
    │ │ │ │ -   std::vector<file_slice> map_block (piece_index_t const piece
    │ │ │ │ -      , std::int64_t offset, int size) const;
    │ │ │ │ -   peer_request map_file (file_index_t const file, std::int64_t offset, int size) const;
    │ │ │ │ -   string_view ssl_cert () const;
    │ │ │ │ -   bool is_valid () const;
    │ │ │ │ -   bool priv () const;
    │ │ │ │ -   bool is_i2p () const;
    │ │ │ │ -   int piece_size (piece_index_t index) const;
    │ │ │ │ -   char const* hash_for_piece_ptr (piece_index_t const index) const;
    │ │ │ │ -   sha1_hash hash_for_piece (piece_index_t index) const;
    │ │ │ │ -   bool is_loaded () const;
    │ │ │ │ -   const std::string& name () const;
    │ │ │ │ -   std::time_t creation_date () const;
    │ │ │ │ -   const std::string& creator () const;
    │ │ │ │ -   const std::string& comment () const;
    │ │ │ │ -   std::vector<std::pair<std::string, int>> const& nodes () const;
    │ │ │ │ -   void add_node (std::pair<std::string, int> const& node);
    │ │ │ │ -   bool parse_info_section (bdecode_node const& info, error_code& ec, int max_pieces);
    │ │ │ │ -   bdecode_node info (char const* key) const;
    │ │ │ │ -   span<char const> info_section () const;
    │ │ │ │ -   span<char const> piece_layer (file_index_t) const;
    │ │ │ │ -   void free_piece_layers ();
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -

    torrent_info()

    │ │ │ │ -
    │ │ │ │ -torrent_info (char const* buffer, int size, error_code& ec);
    │ │ │ │ -torrent_info (bdecode_node const& torrent_file, error_code& ec);
    │ │ │ │ -torrent_info (span<char const> buffer, error_code& ec, from_span_t);
    │ │ │ │ -explicit torrent_info (span<char const> buffer, from_span_t);
    │ │ │ │ -explicit torrent_info (info_hash_t const& info_hash);
    │ │ │ │ -explicit torrent_info (bdecode_node const& torrent_file);
    │ │ │ │ -torrent_info (std::string const& filename, error_code& ec);
    │ │ │ │ -torrent_info (torrent_info const& t);
    │ │ │ │ -explicit torrent_info (std::string const& filename);
    │ │ │ │ -torrent_info (std::string const& filename, load_torrent_limits const& cfg);
    │ │ │ │ -torrent_info (span<char const> buffer, load_torrent_limits const& cfg, from_span_t);
    │ │ │ │ -torrent_info (char const* buffer, int size);
    │ │ │ │ -torrent_info (bdecode_node const& torrent_file, load_torrent_limits const& cfg);
    │ │ │ │ -
    │ │ │ │ -

    The constructor that takes an info-hash will initialize the info-hash │ │ │ │ -to the given value, but leave all other fields empty. 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 constructor that takes a bdecode_node will create a torrent_info │ │ │ │ -object from the information found in the given torrent_file. The │ │ │ │ -bdecode_node represents a tree node in an bencoded file. To load an │ │ │ │ -ordinary .torrent file into a bdecode_node, use bdecode().

    │ │ │ │ -

    The version that takes a buffer pointer and a size will decode it as a │ │ │ │ -.torrent file and initialize the torrent_info object for you.

    │ │ │ │ -

    The version that takes a filename will simply load the torrent file │ │ │ │ -and decode it inside the constructor, for convenience. This might not │ │ │ │ -be the most suitable for applications that want to be able to report │ │ │ │ -detailed errors on what might go wrong.

    │ │ │ │ -

    There is an upper limit on the size of the torrent file that will be │ │ │ │ -loaded by the overload taking a filename. If it's important that even │ │ │ │ -very large torrent files are loaded, use one of the other overloads.

    │ │ │ │ -

    The overloads that takes an error_code const& never throws if an │ │ │ │ -error occur, they will simply set the error code to describe what went │ │ │ │ -wrong and not fully initialize the torrent_info object. The overloads │ │ │ │ -that do not take the extra error_code parameter will always throw if │ │ │ │ -an error occurs. These overloads are not available when building │ │ │ │ -without exception support.

    │ │ │ │ -

    The overload that takes a span also needs an extra parameter of │ │ │ │ -type from_span_t to disambiguate the std::string overload for │ │ │ │ -string literals. There is an object in the libtorrent namespace of this │ │ │ │ -type called from_span.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    ~torrent_info()

    │ │ │ │ -
    │ │ │ │ -~torrent_info ();
    │ │ │ │ -
    │ │ │ │ -

    frees all storage associated with this torrent_info object

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    orig_files() files()

    │ │ │ │ -
    │ │ │ │ -file_storage const& files () const;
    │ │ │ │ -file_storage const& orig_files () const;
    │ │ │ │ -
    │ │ │ │ -

    The file_storage object contains the information on how to map the │ │ │ │ -pieces to files. It is separated from the torrent_info object because │ │ │ │ -when creating torrents a storage object needs to be created without │ │ │ │ -having a torrent file. When renaming files in a storage, the storage │ │ │ │ -needs to make its own copy of the file_storage in order to make its │ │ │ │ -mapping differ from the one in the torrent file.

    │ │ │ │ -

    orig_files() returns the original (unmodified) file storage for │ │ │ │ -this torrent. This is used by the web server connection, which needs │ │ │ │ -to request files with the original names. Filename may be changed using │ │ │ │ -torrent_info::rename_file().

    │ │ │ │ -

    For more information on the file_storage object, see the separate │ │ │ │ -document on how to create torrents.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    rename_file()

    │ │ │ │ -
    │ │ │ │ -void rename_file (file_index_t index, std::string const& new_filename);
    │ │ │ │ -
    │ │ │ │ -

    Renames the file with the specified index to the new name. The new │ │ │ │ -filename is reflected by the file_storage returned by files() │ │ │ │ -but not by the one returned by orig_files().

    │ │ │ │ -

    If you want to rename the base name of the torrent (for a multi file │ │ │ │ -torrent), you can copy the file_storage (see files() and │ │ │ │ -orig_files() ), change the name, and then use remap_files().

    │ │ │ │ -

    The new_filename can both be a relative path, in which case the │ │ │ │ -file name is relative to the save_path of the torrent. If the │ │ │ │ -new_filename is an absolute path (i.e. is_complete(new_filename) │ │ │ │ -== true), then the file is detached from the save_path of the │ │ │ │ -torrent. In this case the file is not moved when move_storage() is │ │ │ │ -invoked.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    remap_files()

    │ │ │ │ -
    │ │ │ │ -void remap_files (file_storage const& f);
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    Warning

    │ │ │ │ -

    Using remap_files() is discouraged as it's incompatible with v2 │ │ │ │ -torrents. This is because the piece boundaries and piece hashes in │ │ │ │ -v2 torrents are intimately tied to the file boundaries. Instead, │ │ │ │ -just rename individual files, or implement a custom disk_interface │ │ │ │ -to customize how to store files.

    │ │ │ │ -
    │ │ │ │ -

    Remaps the file storage to a new file layout. This can be used to, for │ │ │ │ -instance, download all data in a torrent to a single file, or to a │ │ │ │ -number of fixed size sector aligned files, regardless of the number │ │ │ │ -and sizes of the files in the torrent.

    │ │ │ │ -

    The new specified file_storage must have the exact same size as │ │ │ │ -the current one.

    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    trackers() add_tracker() clear_trackers()

    │ │ │ │ -
    │ │ │ │ -std::vector<announce_entry> const& trackers () const;
    │ │ │ │ -void add_tracker (std::string const& url, int tier = 0);
    │ │ │ │ -void clear_trackers ();
    │ │ │ │ -void add_tracker (std::string const& url, int tier
    │ │ │ │ -      , announce_entry::tracker_source source);
    │ │ │ │ -
    │ │ │ │ -

    add_tracker() adds a tracker to the announce-list. The tier │ │ │ │ -determines the order in which the trackers are to be tried. │ │ │ │ -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. For more information, see announce_entry.

    │ │ │ │ -

    trackers() returns all entries from announce-list.

    │ │ │ │ -

    clear_trackers() removes all trackers from announce-list.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    similar_torrents() collections()

    │ │ │ │ -
    │ │ │ │ -std::vector<sha1_hash> similar_torrents () const;
    │ │ │ │ -std::vector<std::string> collections () const;
    │ │ │ │ -
    │ │ │ │ -

    These two functions are related to BEP 38 (mutable torrents). The │ │ │ │ -vectors returned from these correspond to the "similar" and │ │ │ │ -"collections" keys in the .torrent file. Both info-hashes and │ │ │ │ -collections from within the info-dict and from outside of it are │ │ │ │ -included.

    │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_web_seeds() web_seeds() add_url_seed() add_http_seed()

    │ │ │ │ -
    │ │ │ │ -void add_url_seed (std::string const& url
    │ │ │ │ -      , std::string const& ext_auth = std::string()
    │ │ │ │ -      , web_seed_entry::headers_t const& ext_headers = web_seed_entry::headers_t());
    │ │ │ │ -std::vector<web_seed_entry> const& web_seeds () const;
    │ │ │ │ -void set_web_seeds (std::vector<web_seed_entry> seeds);
    │ │ │ │ -void add_http_seed (std::string const& url
    │ │ │ │ -      , std::string const& extern_auth = std::string()
    │ │ │ │ -      , web_seed_entry::headers_t const& extra_headers = web_seed_entry::headers_t());
    │ │ │ │ -
    │ │ │ │ -

    web_seeds() returns all url seeds and http seeds in the torrent. │ │ │ │ -Each entry is a web_seed_entry and may refer to either a url seed │ │ │ │ -or http seed.

    │ │ │ │ -

    add_url_seed() and add_http_seed() adds one url to the list of │ │ │ │ -url/http seeds.

    │ │ │ │ -

    set_web_seeds() replaces all web seeds with the ones specified in │ │ │ │ -the seeds vector.

    │ │ │ │ -

    The extern_auth argument can be used for other authorization │ │ │ │ -schemes than basic HTTP authorization. If set, it will override any │ │ │ │ -username and password found in the URL itself. The string will be sent │ │ │ │ -as the HTTP authorization header's value (without specifying "Basic").

    │ │ │ │ -

    The extra_headers argument defaults to an empty list, but can be │ │ │ │ -used to insert custom HTTP headers in the requests to a specific web │ │ │ │ -seed.

    │ │ │ │ -

    See http seeding for more information.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    total_size()

    │ │ │ │ -
    │ │ │ │ -std::int64_t total_size () const;
    │ │ │ │ -
    │ │ │ │ -

    total_size() returns the total number of bytes the torrent-file │ │ │ │ -represents. Note that this is the number of pieces times the piece │ │ │ │ -size (modulo the last piece possibly being smaller). With pad files, │ │ │ │ -the total size will be larger than the sum of all (regular) file │ │ │ │ -sizes.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    piece_length() num_pieces()

    │ │ │ │ -
    │ │ │ │ -int piece_length () const;
    │ │ │ │ -int num_pieces () const;
    │ │ │ │ -
    │ │ │ │ -

    piece_length() and num_pieces() returns 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.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    blocks_per_piece()

    │ │ │ │ -
    │ │ │ │ -int blocks_per_piece () const;
    │ │ │ │ -
    │ │ │ │ -

    returns the number of blocks there are in the typical piece. There │ │ │ │ -may be fewer in the last piece)

    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    last_piece() piece_range() end_piece()

    │ │ │ │ -
    │ │ │ │ -index_range<piece_index_t> piece_range () const;
    │ │ │ │ -piece_index_t last_piece () const;
    │ │ │ │ -piece_index_t end_piece () const;
    │ │ │ │ -
    │ │ │ │ -

    last_piece() returns the index to the last piece in the torrent and │ │ │ │ -end_piece() returns the index to the one-past-end piece in the │ │ │ │ -torrent │ │ │ │ -piece_range() returns an implementation-defined type that can be │ │ │ │ -used as the container in a range-for loop. Where the values are the │ │ │ │ -indices of all pieces in the file_storage.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    info_hash() info_hashes()

    │ │ │ │ -
    │ │ │ │ -info_hash_t const& info_hashes () const;
    │ │ │ │ -sha1_hash info_hash () const noexcept;
    │ │ │ │ -
    │ │ │ │ -

    returns the info-hash of the torrent. For BitTorrent v2 support, use │ │ │ │ -info_hashes() to get an object that may hold both a v1 and v2 │ │ │ │ -info-hash

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    v1() v2()

    │ │ │ │ -
    │ │ │ │ -bool v2 () const;
    │ │ │ │ -bool v1 () const;
    │ │ │ │ -
    │ │ │ │ -

    returns whether this torrent has v1 and/or v2 metadata, respectively. │ │ │ │ -Hybrid torrents have both. These are shortcuts for │ │ │ │ -info_hashes().has_v1() and info_hashes().has_v2() calls.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    num_files()

    │ │ │ │ -
    │ │ │ │ -int num_files () const;
    │ │ │ │ -
    │ │ │ │ -

    If you need index-access to files you can use the num_files() along │ │ │ │ -with the file_path(), file_size()-family of functions to access │ │ │ │ -files using indices.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    map_block()

    │ │ │ │ -
    │ │ │ │ -std::vector<file_slice> map_block (piece_index_t const piece
    │ │ │ │ -      , std::int64_t offset, int size) 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. See file_slice.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    map_file()

    │ │ │ │ -
    │ │ │ │ -peer_request map_file (file_index_t const file, std::int64_t offset, int size) 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. See peer_request.

    │ │ │ │ -

    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().

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    ssl_cert()

    │ │ │ │ -
    │ │ │ │ -string_view ssl_cert () const;
    │ │ │ │ -
    │ │ │ │ -

    Returns the SSL root certificate for the torrent, if it is an SSL │ │ │ │ -torrent. Otherwise returns an empty string. The certificate is │ │ │ │ -the public certificate in x509 format.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    is_valid()

    │ │ │ │ -
    │ │ │ │ -bool is_valid () const;
    │ │ │ │ -
    │ │ │ │ -

    returns true if this torrent_info object has a torrent loaded. │ │ │ │ -This is primarily used to determine if a magnet link has had its │ │ │ │ -metadata resolved yet or not.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    priv()

    │ │ │ │ -
    │ │ │ │ -bool priv () const;
    │ │ │ │ -
    │ │ │ │ -

    returns true if this torrent is private. i.e., the client should not │ │ │ │ -advertise itself on the trackerless network (the Kademlia DHT) for this torrent.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    is_i2p()

    │ │ │ │ -
    │ │ │ │ -bool is_i2p () const;
    │ │ │ │ -
    │ │ │ │ -

    returns true if this is an i2p torrent. This is determined by whether │ │ │ │ -or not it has a tracker whose URL domain name ends with ".i2p". i2p │ │ │ │ -torrents disable the DHT and local peer discovery as well as talking │ │ │ │ -to peers over anything other than the i2p network.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    piece_size()

    │ │ │ │ -
    │ │ │ │ -int piece_size (piece_index_t index) const;
    │ │ │ │ -
    │ │ │ │ -

    returns the piece size of file with index. This will be the same as piece_length(), │ │ │ │ -except for the last piece, which may be shorter.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    hash_for_piece_ptr() hash_for_piece()

    │ │ │ │ -
    │ │ │ │ -char const* hash_for_piece_ptr (piece_index_t const index) const;
    │ │ │ │ -sha1_hash hash_for_piece (piece_index_t 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. │ │ │ │ -hash_for_piece_ptr() returns a pointer to the 20 byte sha1 digest │ │ │ │ -for the piece. Note that the string is not 0-terminated.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    name()

    │ │ │ │ -
    │ │ │ │ -const std::string& name () const;
    │ │ │ │ -
    │ │ │ │ -

    name() returns the name of the torrent. │ │ │ │ -name contains UTF-8 encoded string.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    creation_date()

    │ │ │ │ -
    │ │ │ │ -std::time_t creation_date () const;
    │ │ │ │ -
    │ │ │ │ -

    creation_date() returns the creation date of the torrent as time_t │ │ │ │ -(posix time). If there's no time stamp in the torrent file, 0 is │ │ │ │ -returned. │ │ │ │ -.. posix time: http://www.opengroup.org/onlinepubs/009695399/functions/time.html

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    creator()

    │ │ │ │ -
    │ │ │ │ -const std::string& creator () const;
    │ │ │ │ -
    │ │ │ │ -

    creator() returns the creator string in the torrent. If there is │ │ │ │ -no creator string it will return an empty string.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    comment()

    │ │ │ │ -
    │ │ │ │ -const std::string& comment () const;
    │ │ │ │ -
    │ │ │ │ -

    comment() returns the comment associated with the torrent. If │ │ │ │ -there's no comment, it will return an empty string. │ │ │ │ -comment contains UTF-8 encoded string.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    nodes()

    │ │ │ │ -
    │ │ │ │ -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).

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    add_node()

    │ │ │ │ -
    │ │ │ │ -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.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    parse_info_section()

    │ │ │ │ -
    │ │ │ │ -bool parse_info_section (bdecode_node const& info, error_code& ec, int max_pieces);
    │ │ │ │ -
    │ │ │ │ -

    populates the torrent_info by providing just the info-dict buffer. │ │ │ │ -This is used when loading a torrent from a magnet link for instance, │ │ │ │ -where we only have the info-dict. The bdecode_node e points to a │ │ │ │ -parsed info-dictionary. ec returns an error code if something │ │ │ │ -fails (typically if the info dictionary is malformed). │ │ │ │ -The max_pieces parameter allows limiting the amount of memory │ │ │ │ -dedicated to loading the torrent, and fails for torrents that exceed │ │ │ │ -the limit. To load large torrents, this limit may also need to be │ │ │ │ -raised in settings_pack::max_piece_count and in calls to │ │ │ │ -read_resume_data().

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    info()

    │ │ │ │ -
    │ │ │ │ -bdecode_node info (char const* key) const;
    │ │ │ │ -
    │ │ │ │ -

    This function looks up keys from the info-dictionary of the loaded │ │ │ │ -torrent file. It can be used to access extension values put in the │ │ │ │ -.torrent file. If the specified key cannot be found, it returns nullptr.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    info_section()

    │ │ │ │ -
    │ │ │ │ -span<char const> info_section () const;
    │ │ │ │ -
    │ │ │ │ -

    returns a the raw info section of the torrent file. │ │ │ │ -The underlying buffer is still owned by the torrent_info object

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    piece_layer()

    │ │ │ │ -
    │ │ │ │ -span<char const> piece_layer (file_index_t) const;
    │ │ │ │ -
    │ │ │ │ -

    return the bytes of the piece layer hashes for the specified file. If │ │ │ │ -the file doesn't have a piece layer, an empty span is returned. │ │ │ │ -The span size is divisible by 32, the size of a SHA-256 hash. │ │ │ │ -If the size of the file is smaller than or equal to the piece size, │ │ │ │ -the files "root hash" is the hash of the file and is not saved │ │ │ │ -separately in the "piece layers" field, but this function still │ │ │ │ -returns the root hash of the file in that case.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    free_piece_layers()

    │ │ │ │ -
    │ │ │ │ -void free_piece_layers ();
    │ │ │ │ -
    │ │ │ │ -

    clears the piece layers from the torrent_info. This is done by the │ │ │ │ -session when a torrent is added, to avoid storing it twice. The piece │ │ │ │ -layer (or other hashes part of the merkle tree) are stored in the │ │ │ │ -internal torrent object.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    hasher

    │ │ │ │ -

    Declared in "libtorrent/hasher.hpp"

    │ │ │ │ -

    this is a SHA-1 hash class.

    │ │ │ │ -

    You use it by first instantiating it, then call update() to feed it │ │ │ │ -with data. i.e. you don't have to keep the entire buffer of which you want to │ │ │ │ -create the hash in memory. You can feed the hasher parts of it at a time. When │ │ │ │ -You have fed the hasher with all the data, you call final() and it │ │ │ │ -will return the sha1-hash of the data.

    │ │ │ │ -

    The constructor that takes a char const* and an integer will construct the │ │ │ │ -sha1 context and feed it the data passed in.

    │ │ │ │ -

    If you want to reuse the hasher object once you have created a hash, you have to │ │ │ │ -call reset() to reinitialize it.

    │ │ │ │ -

    The built-in software version of sha1-algorithm was implemented │ │ │ │ -by Steve Reid and released as public domain. │ │ │ │ -For more info, see src/sha1.cpp.

    │ │ │ │ -
    │ │ │ │ -class hasher
    │ │ │ │ -{
    │ │ │ │ -   hasher ();
    │ │ │ │ -   explicit hasher (span<char const> data);
    │ │ │ │ -   hasher (hasher const&);
    │ │ │ │ -   hasher (char const* data, int len);
    │ │ │ │ -   hasher& operator= (hasher const&) &;
    │ │ │ │ -   hasher& update (char const* data, int len);
    │ │ │ │ -   hasher& update (span<char const> data);
    │ │ │ │ -   sha1_hash final ();
    │ │ │ │ -   void reset ();
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -

    hasher() operator=()

    │ │ │ │ -
    │ │ │ │ -explicit hasher (span<char const> data);
    │ │ │ │ -hasher (hasher const&);
    │ │ │ │ -hasher (char const* data, int len);
    │ │ │ │ -hasher& operator= (hasher const&) &;
    │ │ │ │ -
    │ │ │ │ -

    this is the same as default constructing followed by a call to │ │ │ │ -update(data, len).

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    update()

    │ │ │ │ -
    │ │ │ │ -hasher& update (char const* data, int len);
    │ │ │ │ -hasher& update (span<char const> data);
    │ │ │ │ -
    │ │ │ │ -

    append the following bytes to what is being hashed

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    final()

    │ │ │ │ -
    │ │ │ │ -sha1_hash final ();
    │ │ │ │ -
    │ │ │ │ -

    returns the SHA-1 digest of the buffers previously passed to │ │ │ │ -update() and the hasher constructor.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    reset()

    │ │ │ │ -
    │ │ │ │ -void reset ();
    │ │ │ │ -
    │ │ │ │ -

    restore the hasher state to be as if the hasher has just been │ │ │ │ -default constructed.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    hasher256

    │ │ │ │ -

    Declared in "libtorrent/hasher.hpp"

    │ │ │ │ -
    │ │ │ │ -class hasher256
    │ │ │ │ -{
    │ │ │ │ -   hasher256 ();
    │ │ │ │ -   hasher256 (hasher256 const&);
    │ │ │ │ -   hasher256 (char const* data, int len);
    │ │ │ │ -   explicit hasher256 (span<char const> data);
    │ │ │ │ -   hasher256& operator= (hasher256 const&) &;
    │ │ │ │ -   hasher256& update (span<char const> data);
    │ │ │ │ -   hasher256& update (char const* data, int len);
    │ │ │ │ -   sha256_hash final ();
    │ │ │ │ -   void reset ();
    │ │ │ │ -   ~hasher256 ();
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -

    hasher256() operator=()

    │ │ │ │ -
    │ │ │ │ -hasher256 (hasher256 const&);
    │ │ │ │ -hasher256 (char const* data, int len);
    │ │ │ │ -explicit hasher256 (span<char const> data);
    │ │ │ │ -hasher256& operator= (hasher256 const&) &;
    │ │ │ │ -
    │ │ │ │ -

    this is the same as default constructing followed by a call to │ │ │ │ -update(data, len).

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    update()

    │ │ │ │ -
    │ │ │ │ -hasher256& update (span<char const> data);
    │ │ │ │ -hasher256& update (char const* data, int len);
    │ │ │ │ -
    │ │ │ │ -

    append the following bytes to what is being hashed

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    final()

    │ │ │ │ -
    │ │ │ │ -sha256_hash final ();
    │ │ │ │ -
    │ │ │ │ -

    returns the SHA-1 digest of the buffers previously passed to │ │ │ │ -update() and the hasher constructor.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    reset()

    │ │ │ │ -
    │ │ │ │ -void reset ();
    │ │ │ │ -
    │ │ │ │ -

    restore the hasher state to be as if the hasher has just been │ │ │ │ -default constructed.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    bitfield

    │ │ │ │ -

    Declared in "libtorrent/bitfield.hpp"

    │ │ │ │ -

    The bitfield type stores any number of bits as a bitfield │ │ │ │ -in a heap allocated array.

    │ │ │ │ -
    │ │ │ │ -struct bitfield
    │ │ │ │ -{
    │ │ │ │ -   bitfield (char const* b, int bits);
    │ │ │ │ -   bitfield (int bits, bool val);
    │ │ │ │ -   explicit bitfield (int bits);
    │ │ │ │ -   bitfield () noexcept = default;
    │ │ │ │ -   bitfield (bitfield const& rhs);
    │ │ │ │ -   bitfield (bitfield&& rhs) noexcept = default;
    │ │ │ │ -   void assign (char const* b, int const bits);
    │ │ │ │ -   bool operator[] (int index) const noexcept;
    │ │ │ │ -   bool get_bit (int index) const noexcept;
    │ │ │ │ -   void clear_bit (int index) noexcept;
    │ │ │ │ -   void set_bit (int index) noexcept;
    │ │ │ │ -   bool all_set () const noexcept;
    │ │ │ │ -   bool none_set () const noexcept;
    │ │ │ │ -   int size () const noexcept;
    │ │ │ │ -   int num_words () const noexcept;
    │ │ │ │ -   int num_bytes () const noexcept;
    │ │ │ │ -   bool empty () const noexcept;
    │ │ │ │ -   char const* data () const noexcept;
    │ │ │ │ -   char* data () noexcept;
    │ │ │ │ -   void swap (bitfield& rhs) noexcept;
    │ │ │ │ -   int count () const noexcept;
    │ │ │ │ -   int find_first_set () const noexcept;
    │ │ │ │ -   int find_last_clear () const noexcept;
    │ │ │ │ -   bool operator== (lt::bitfield const& rhs) const;
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -

    bitfield()

    │ │ │ │ -
    │ │ │ │ -bitfield (char const* b, int bits);
    │ │ │ │ -bitfield (int bits, bool val);
    │ │ │ │ -explicit bitfield (int bits);
    │ │ │ │ -bitfield () noexcept = default;
    │ │ │ │ -bitfield (bitfield const& rhs);
    │ │ │ │ -bitfield (bitfield&& rhs) noexcept = default;
    │ │ │ │ -
    │ │ │ │ -

    constructs a new bitfield. The default constructor creates an empty │ │ │ │ -bitfield. bits is the size of the bitfield (specified in bits). │ │ │ │ -val is the value to initialize the bits to. If not specified │ │ │ │ -all bits are initialized to 0.

    │ │ │ │ -

    The constructor taking a pointer b and bits copies a bitfield │ │ │ │ -from the specified buffer, and bits number of bits (rounded up to │ │ │ │ -the nearest byte boundary).

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    assign()

    │ │ │ │ -
    │ │ │ │ -void assign (char const* b, int const bits);
    │ │ │ │ -
    │ │ │ │ -

    copy bitfield from buffer b of bits number of bits, rounded up to │ │ │ │ -the nearest byte boundary.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    get_bit() operator[]()

    │ │ │ │ -
    │ │ │ │ -bool operator[] (int index) const noexcept;
    │ │ │ │ -bool get_bit (int index) const noexcept;
    │ │ │ │ -
    │ │ │ │ -

    query bit at index. Returns true if bit is 1, otherwise false.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_bit() clear_bit()

    │ │ │ │ -
    │ │ │ │ -void clear_bit (int index) noexcept;
    │ │ │ │ -void set_bit (int index) noexcept;
    │ │ │ │ -
    │ │ │ │ -

    set bit at index to 0 (clear_bit) or 1 (set_bit).

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    all_set()

    │ │ │ │ -
    │ │ │ │ -bool all_set () const noexcept;
    │ │ │ │ -
    │ │ │ │ -

    returns true if all bits in the bitfield are set

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    none_set()

    │ │ │ │ -
    │ │ │ │ -bool none_set () const noexcept;
    │ │ │ │ -
    │ │ │ │ -

    returns true if no bit in the bitfield is set

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    size()

    │ │ │ │ -
    │ │ │ │ -int size () const noexcept;
    │ │ │ │ -
    │ │ │ │ -

    returns the size of the bitfield in bits.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    num_words()

    │ │ │ │ -
    │ │ │ │ -int num_words () const noexcept;
    │ │ │ │ -
    │ │ │ │ -

    returns the number of 32 bit words are needed to represent all bits in │ │ │ │ -this bitfield.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    num_bytes()

    │ │ │ │ -
    │ │ │ │ -int num_bytes () const noexcept;
    │ │ │ │ -
    │ │ │ │ -

    returns the number of bytes needed to represent all bits in this │ │ │ │ -bitfield

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    empty()

    │ │ │ │ -
    │ │ │ │ -bool empty () const noexcept;
    │ │ │ │ -
    │ │ │ │ -

    returns true if the bitfield has zero size.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    data()

    │ │ │ │ -
    │ │ │ │ -char const* data () const noexcept;
    │ │ │ │ -char* data () noexcept;
    │ │ │ │ -
    │ │ │ │ -

    returns a pointer to the internal buffer of the bitfield, or │ │ │ │ -nullptr if it's empty.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    swap()

    │ │ │ │ -
    │ │ │ │ -void swap (bitfield& rhs) noexcept;
    │ │ │ │ -
    │ │ │ │ -

    swaps the bit-fields two variables refer to

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    count()

    │ │ │ │ -
    │ │ │ │ -int count () const noexcept;
    │ │ │ │ -
    │ │ │ │ -

    count the number of bits in the bitfield that are set to 1.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    find_first_set()

    │ │ │ │ -
    │ │ │ │ -int find_first_set () const noexcept;
    │ │ │ │ -
    │ │ │ │ -

    returns the index of the first set bit in the bitfield, i.e. 1 bit.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    find_last_clear()

    │ │ │ │ -
    │ │ │ │ -int find_last_clear () const noexcept;
    │ │ │ │ -
    │ │ │ │ -

    returns the index to the last cleared bit in the bitfield, i.e. 0 bit.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    session_proxy

    │ │ │ │ -

    Declared in "libtorrent/session.hpp"

    │ │ │ │ -

    this is a holder for the internal session implementation object. Once the │ │ │ │ -session destruction is explicitly initiated, this holder is used to │ │ │ │ -synchronize the completion of the shutdown. The lifetime of this object │ │ │ │ -may outlive session, causing the session destructor to not block. The │ │ │ │ -session_proxy destructor will block however, until the underlying session │ │ │ │ -is done shutting down.

    │ │ │ │ -
    │ │ │ │ -struct session_proxy
    │ │ │ │ -{
    │ │ │ │ -   session_proxy& operator= (session_proxy const&) &;
    │ │ │ │ -   ~session_proxy ();
    │ │ │ │ -   session_proxy (session_proxy const&);
    │ │ │ │ -   session_proxy& operator= (session_proxy&&) & noexcept;
    │ │ │ │ -   session_proxy ();
    │ │ │ │ -   session_proxy (session_proxy&&) noexcept;
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -

    session_proxy() ~session_proxy() operator=()

    │ │ │ │ -
    │ │ │ │ -session_proxy& operator= (session_proxy const&) &;
    │ │ │ │ -~session_proxy ();
    │ │ │ │ -session_proxy (session_proxy const&);
    │ │ │ │ -session_proxy& operator= (session_proxy&&) & noexcept;
    │ │ │ │ -session_proxy ();
    │ │ │ │ -session_proxy (session_proxy&&) noexcept;
    │ │ │ │ -
    │ │ │ │ -

    default constructor, does not refer to any session │ │ │ │ -implementation object.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    session

    │ │ │ │ -

    Declared in "libtorrent/session.hpp"

    │ │ │ │ -

    The session holds all state that spans multiple torrents. Among other │ │ │ │ -things it runs the network loop and manages all torrents. 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.

    │ │ │ │ -

    You have some control over session configuration through the │ │ │ │ -session_handle::apply_settings() member function. To change one or more │ │ │ │ -configuration options, create a settings_pack. object and fill it with │ │ │ │ -the settings to be set and pass it in to session::apply_settings().

    │ │ │ │ -

    see apply_settings().

    │ │ │ │ -
    │ │ │ │ -struct session : session_handle
    │ │ │ │ -{
    │ │ │ │ -   session (session_params const& params, session_flags_t flags);
    │ │ │ │ -   session ();
    │ │ │ │ -   session (session_params&& params, session_flags_t flags);
    │ │ │ │ -   explicit session (session_params const& params);
    │ │ │ │ -   explicit session (session_params&& params);
    │ │ │ │ -   session (session_params const& params, io_context& ios);
    │ │ │ │ -   session (session_params&& params, io_context& ios);
    │ │ │ │ -   session (session_params&& params, io_context& ios, session_flags_t);
    │ │ │ │ -   session (session_params const& params, io_context& ios, session_flags_t);
    │ │ │ │ -   ~session ();
    │ │ │ │ -   session_proxy abort ();
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -

    session()

    │ │ │ │ -
    │ │ │ │ -session (session_params const& params, session_flags_t flags);
    │ │ │ │ -session ();
    │ │ │ │ -session (session_params&& params, session_flags_t flags);
    │ │ │ │ -explicit session (session_params const& params);
    │ │ │ │ -explicit session (session_params&& params);
    │ │ │ │ -
    │ │ │ │ -

    Constructs the session objects which acts as the container of torrents. │ │ │ │ -In order to avoid a race condition between starting the session and │ │ │ │ -configuring it, you can pass in a session_params object. Its settings │ │ │ │ -will take effect before the session starts up.

    │ │ │ │ -

    The overloads taking flags can be used to start a session in │ │ │ │ -paused mode (by passing in session::paused). Note that │ │ │ │ -add_default_plugins do not have an affect on constructors that │ │ │ │ -take a session_params object. It already contains the plugins to use.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    session()

    │ │ │ │ -
    │ │ │ │ -session (session_params const& params, io_context& ios);
    │ │ │ │ -session (session_params&& params, io_context& ios);
    │ │ │ │ -session (session_params&& params, io_context& ios, session_flags_t);
    │ │ │ │ -session (session_params const& params, io_context& ios, session_flags_t);
    │ │ │ │ -
    │ │ │ │ -

    Overload of the constructor that takes an external io_context to run │ │ │ │ -the session object on. This is primarily useful for tests that may want │ │ │ │ -to run multiple sessions on a single io_context, or low resource │ │ │ │ -systems where additional threads are expensive and sharing an │ │ │ │ -io_context with other events is fine.

    │ │ │ │ -
    │ │ │ │ -

    Warning

    │ │ │ │ -

    The session object does not cleanly terminate with an external │ │ │ │ -io_context. The io_context::run() call must have returned │ │ │ │ -before it's safe to destruct the session. Which means you MUST │ │ │ │ -call session::abort() and save the session_proxy first, then │ │ │ │ -destruct the session object, then sync with the io_context, then │ │ │ │ -destruct the session_proxy object.

    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    ~session()

    │ │ │ │ -
    │ │ │ │ -~session ();
    │ │ │ │ -
    │ │ │ │ -

    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 apply_settings().

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    abort()

    │ │ │ │ -
    │ │ │ │ -session_proxy abort ();
    │ │ │ │ -
    │ │ │ │ -

    In case you want to destruct the session asynchronously, 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:

    │ │ │ │ -
    │ │ │ │ -struct session_proxy {};
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    session_params

    │ │ │ │ -

    Declared in "libtorrent/session_params.hpp"

    │ │ │ │ -

    The session_params is a parameters pack for configuring the session │ │ │ │ -before it's started.

    │ │ │ │ -
    │ │ │ │ -struct session_params
    │ │ │ │ -{
    │ │ │ │ -   session_params (settings_pack&& sp);
    │ │ │ │ -   session_params (settings_pack const& sp);
    │ │ │ │ -   session_params ();
    │ │ │ │ -   session_params (settings_pack&& sp
    │ │ │ │ -      , std::vector<std::shared_ptr<plugin>> exts);
    │ │ │ │ -   session_params (settings_pack const& sp
    │ │ │ │ -      , std::vector<std::shared_ptr<plugin>> exts);
    │ │ │ │ -
    │ │ │ │ -   settings_pack settings;
    │ │ │ │ -   std::vector<std::shared_ptr<plugin>> extensions;
    │ │ │ │ -   dht::dht_state dht_state;
    │ │ │ │ -   dht::dht_storage_constructor_type dht_storage_constructor;
    │ │ │ │ -   disk_io_constructor_type disk_io_constructor;
    │ │ │ │ -   std::map<std::string, std::string> ext_state;
    │ │ │ │ -   libtorrent::ip_filter ip_filter;
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -

    session_params()

    │ │ │ │ -
    │ │ │ │ -session_params (settings_pack&& sp);
    │ │ │ │ -session_params (settings_pack const& sp);
    │ │ │ │ -session_params ();
    │ │ │ │ -
    │ │ │ │ -

    This constructor can be used to start with the default plugins │ │ │ │ -(ut_metadata, ut_pex and smart_ban). Pass a settings_pack to set the │ │ │ │ -initial settings when the session starts.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    session_params()

    │ │ │ │ -
    │ │ │ │ -session_params (settings_pack&& sp
    │ │ │ │ -      , std::vector<std::shared_ptr<plugin>> exts);
    │ │ │ │ -session_params (settings_pack const& sp
    │ │ │ │ -      , std::vector<std::shared_ptr<plugin>> exts);
    │ │ │ │ -
    │ │ │ │ -

    This constructor helps to configure the set of initial plugins │ │ │ │ -to be added to the session before it's started.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    settings
    │ │ │ │ -
    The settings to configure the session with
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    extensions
    │ │ │ │ -
    the plugins to add to the session as it is constructed
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    dht_state
    │ │ │ │ -
    DHT node ID and node addresses to bootstrap the DHT with.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    dht_storage_constructor
    │ │ │ │ -
    function object to construct the storage object for DHT items.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    disk_io_constructor
    │ │ │ │ -
    function object to create the disk I/O subsystem. Defaults to │ │ │ │ -default_disk_io_constructor.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    ext_state
    │ │ │ │ -
    this container can be used by extensions/plugins to store settings. It's │ │ │ │ -primarily here to make it convenient to save and restore state across │ │ │ │ -sessions, using read_session_params() and write_session_params().
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    ip_filter
    │ │ │ │ -
    the IP filter to use for the session. This restricts which peers are allowed │ │ │ │ -to connect. As if passed to set_ip_filter().
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    session_handle

    │ │ │ │ -

    Declared in "libtorrent/session_handle.hpp"

    │ │ │ │ -

    this class provides a non-owning handle to a session and a subset of the │ │ │ │ -interface of the session class. If the underlying session is destructed │ │ │ │ -any handle to it will no longer be valid. is_valid() will return false and │ │ │ │ -any operation on it will throw a system_error exception, with error code │ │ │ │ -invalid_session_handle.

    │ │ │ │ -
    │ │ │ │ -struct session_handle
    │ │ │ │ -{
    │ │ │ │ -   bool is_valid () const;
    │ │ │ │ -   session_params session_state (save_state_flags_t flags = save_state_flags_t::all()) const;
    │ │ │ │ -   std::vector<torrent_status> get_torrent_status (
    │ │ │ │ -      std::function<bool(torrent_status const&)> const& pred
    │ │ │ │ -      , status_flags_t flags = {}) const;
    │ │ │ │ -   void refresh_torrent_status (std::vector<torrent_status>* ret
    │ │ │ │ -      , status_flags_t flags = {}) const;
    │ │ │ │ -   void post_torrent_updates (status_flags_t flags = status_flags_t::all());
    │ │ │ │ -   void post_session_stats ();
    │ │ │ │ -   void post_dht_stats ();
    │ │ │ │ -   void set_dht_state (dht::dht_state const& st);
    │ │ │ │ -   void set_dht_state (dht::dht_state&& st);
    │ │ │ │ -   std::vector<torrent_handle> get_torrents () const;
    │ │ │ │ -   torrent_handle find_torrent (sha1_hash const& info_hash) const;
    │ │ │ │ -   void async_add_torrent (add_torrent_params const& params);
    │ │ │ │ -   torrent_handle add_torrent (add_torrent_params const& params);
    │ │ │ │ -   void async_add_torrent (add_torrent_params&& params);
    │ │ │ │ -   torrent_handle add_torrent (add_torrent_params&& params, error_code& ec);
    │ │ │ │ -   torrent_handle add_torrent (add_torrent_params&& params);
    │ │ │ │ -   torrent_handle add_torrent (add_torrent_params const& params, error_code& ec);
    │ │ │ │ -   void pause ();
    │ │ │ │ -   bool is_paused () const;
    │ │ │ │ -   void resume ();
    │ │ │ │ -   bool is_dht_running () const;
    │ │ │ │ -   void set_dht_storage (dht::dht_storage_constructor_type sc);
    │ │ │ │ -   void add_dht_node (std::pair<std::string, int> const& node);
    │ │ │ │ -   void dht_get_item (sha1_hash const& target);
    │ │ │ │ -   void dht_get_item (std::array<char, 32> key
    │ │ │ │ -      , std::string salt = std::string());
    │ │ │ │ -   sha1_hash dht_put_item (entry data);
    │ │ │ │ -   void dht_put_item (std::array<char, 32> key
    │ │ │ │ -      , std::function<void(entry&, std::array<char, 64>&
    │ │ │ │ -      , std::int64_t&, std::string const&)> cb
    │ │ │ │ -      , std::string salt = std::string());
    │ │ │ │ -   void dht_announce (sha1_hash const& info_hash, int port = 0, dht::announce_flags_t flags = {});
    │ │ │ │ -   void dht_get_peers (sha1_hash const& info_hash);
    │ │ │ │ -   void dht_live_nodes (sha1_hash const& nid);
    │ │ │ │ -   void dht_sample_infohashes (udp::endpoint const& ep, sha1_hash const& target);
    │ │ │ │ -   void dht_direct_request (udp::endpoint const& ep, entry const& e, client_data_t userdata = {});
    │ │ │ │ -   void add_extension (std::function<std::shared_ptr<torrent_plugin>(
    │ │ │ │ -      torrent_handle const&, client_data_t)> ext);
    │ │ │ │ -   void add_extension (std::shared_ptr<plugin> ext);
    │ │ │ │ -   ip_filter get_ip_filter () const;
    │ │ │ │ -   void set_ip_filter (ip_filter f);
    │ │ │ │ -   void set_port_filter (port_filter const& f);
    │ │ │ │ -   bool is_listening () const;
    │ │ │ │ -   unsigned short ssl_listen_port () const;
    │ │ │ │ -   unsigned short listen_port () const;
    │ │ │ │ -   ip_filter get_peer_class_filter () const;
    │ │ │ │ -   void set_peer_class_filter (ip_filter const& f);
    │ │ │ │ -   void set_peer_class_type_filter (peer_class_type_filter const& f);
    │ │ │ │ -   peer_class_type_filter get_peer_class_type_filter () const;
    │ │ │ │ -   peer_class_t create_peer_class (char const* name);
    │ │ │ │ -   void delete_peer_class (peer_class_t cid);
    │ │ │ │ -   void set_peer_class (peer_class_t cid, peer_class_info const& pci);
    │ │ │ │ -   peer_class_info get_peer_class (peer_class_t cid) const;
    │ │ │ │ -   void remove_torrent (const torrent_handle&, remove_flags_t = {});
    │ │ │ │ -   void apply_settings (settings_pack&&);
    │ │ │ │ -   settings_pack get_settings () const;
    │ │ │ │ -   void apply_settings (settings_pack const&);
    │ │ │ │ -   void pop_alerts (std::vector<alert*>* alerts);
    │ │ │ │ -   alert* wait_for_alert (time_duration max_wait);
    │ │ │ │ -   void set_alert_notify (std::function<void()> const& fun);
    │ │ │ │ -   void delete_port_mapping (port_mapping_t handle);
    │ │ │ │ -   std::vector<port_mapping_t> add_port_mapping (portmap_protocol t, int external_port, int local_port);
    │ │ │ │ -   void reopen_network_sockets (reopen_network_flags_t options = reopen_map_ports);
    │ │ │ │ -   std::shared_ptr<aux::session_impl> native_handle () const;
    │ │ │ │ -
    │ │ │ │ -   static constexpr save_state_flags_t save_settings  = 0_bit;
    │ │ │ │ -   static constexpr save_state_flags_t save_dht_state  = 2_bit;
    │ │ │ │ -   static constexpr save_state_flags_t save_extension_state  = 11_bit;
    │ │ │ │ -   static constexpr save_state_flags_t save_ip_filter  = 12_bit;
    │ │ │ │ -   static constexpr peer_class_t global_peer_class_id {0};
    │ │ │ │ -   static constexpr peer_class_t tcp_peer_class_id {1};
    │ │ │ │ -   static constexpr peer_class_t local_peer_class_id {2};
    │ │ │ │ -   static constexpr remove_flags_t delete_files  = 0_bit;
    │ │ │ │ -   static constexpr remove_flags_t delete_partfile  = 1_bit;
    │ │ │ │ -   static constexpr session_flags_t paused  = 2_bit;
    │ │ │ │ -   static constexpr portmap_protocol udp  = portmap_protocol::udp;
    │ │ │ │ -   static constexpr portmap_protocol tcp  = portmap_protocol::tcp;
    │ │ │ │ -   static constexpr reopen_network_flags_t reopen_map_ports  = 0_bit;
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -

    is_valid()

    │ │ │ │ -
    │ │ │ │ -bool is_valid () const;
    │ │ │ │ -
    │ │ │ │ -

    returns true if this handle refers to a valid session object. If the │ │ │ │ -session has been destroyed, all session_handle objects will expire and │ │ │ │ -not be valid.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    session_state()

    │ │ │ │ -
    │ │ │ │ -session_params session_state (save_state_flags_t flags = save_state_flags_t::all()) const;
    │ │ │ │ -
    │ │ │ │ -

    returns the current session state. This can be passed to │ │ │ │ -write_session_params() to save the state to disk and restored using │ │ │ │ -read_session_params() when constructing a new session. The kind of │ │ │ │ -state that's included is all settings, the DHT routing table, possibly │ │ │ │ -plugin-specific state. │ │ │ │ -the flags parameter can be used to only save certain parts of the │ │ │ │ -session state

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    get_torrent_status() refresh_torrent_status()

    │ │ │ │ -
    │ │ │ │ -std::vector<torrent_status> get_torrent_status (
    │ │ │ │ -      std::function<bool(torrent_status const&)> const& pred
    │ │ │ │ -      , status_flags_t flags = {}) const;
    │ │ │ │ -void refresh_torrent_status (std::vector<torrent_status>* ret
    │ │ │ │ -      , status_flags_t flags = {}) const;
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    Note

    │ │ │ │ -

    these calls are potentially expensive and won't scale well with │ │ │ │ -lots of torrents. If you're concerned about performance, consider │ │ │ │ -using post_torrent_updates() instead.

    │ │ │ │ -
    │ │ │ │ -

    get_torrent_status returns a vector of the torrent_status for │ │ │ │ -every torrent which satisfies pred, which is a predicate function │ │ │ │ -which determines if a torrent should be included in the returned set │ │ │ │ -or not. Returning true means it should be included and false means │ │ │ │ -excluded. The flags argument is the same as to │ │ │ │ -torrent_handle::status(). Since pred is guaranteed to be │ │ │ │ -called for every torrent, it may be used to count the number of │ │ │ │ -torrents of different categories as well.

    │ │ │ │ -

    refresh_torrent_status takes a vector of torrent_status structs │ │ │ │ -(for instance the same vector that was returned by │ │ │ │ -get_torrent_status() ) and refreshes the status based on the │ │ │ │ -handle member. It is possible to use this function by first │ │ │ │ -setting up a vector of default constructed torrent_status objects, │ │ │ │ -only initializing the handle member, in order to request the │ │ │ │ -torrent status for multiple torrents in a single call. This can save a │ │ │ │ -significant amount of time if you have a lot of torrents.

    │ │ │ │ -

    Any torrent_status object whose handle member is not referring to │ │ │ │ -a valid torrent are ignored.

    │ │ │ │ -

    The intended use of these functions is to start off by calling │ │ │ │ -get_torrent_status() to get a list of all torrents that match your │ │ │ │ -criteria. Then call refresh_torrent_status() on that list. This │ │ │ │ -will only refresh the status for the torrents in your list, and thus │ │ │ │ -ignore all other torrents you might be running. This may save a │ │ │ │ -significant amount of time, especially if the number of torrents you're │ │ │ │ -interested in is small. In order to keep your list of interested │ │ │ │ -torrents up to date, you can either call get_torrent_status() from │ │ │ │ -time to time, to include torrents you might have become interested in │ │ │ │ -since the last time. In order to stop refreshing a certain torrent, │ │ │ │ -simply remove it from the list.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    post_torrent_updates()

    │ │ │ │ -
    │ │ │ │ -void post_torrent_updates (status_flags_t flags = status_flags_t::all());
    │ │ │ │ -
    │ │ │ │ -

    This functions instructs the session to post the state_update_alert, │ │ │ │ -containing the status of all torrents whose state changed since the │ │ │ │ -last time this function was called.

    │ │ │ │ -

    Only torrents who has the state subscription flag set will be │ │ │ │ -included. This flag is on by default. See add_torrent_params. │ │ │ │ -the flags argument is the same as for torrent_handle::status(). │ │ │ │ -see status_flags_t in torrent_handle.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    post_session_stats()

    │ │ │ │ -
    │ │ │ │ -void post_session_stats ();
    │ │ │ │ -
    │ │ │ │ -

    This function will post a session_stats_alert object, containing a │ │ │ │ -snapshot of the performance counters from the internals of libtorrent. │ │ │ │ -To interpret these counters, query the session via │ │ │ │ -session_stats_metrics().

    │ │ │ │ -

    For more information, see the session statistics section.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    post_dht_stats()

    │ │ │ │ -
    │ │ │ │ -void post_dht_stats ();
    │ │ │ │ -
    │ │ │ │ -

    This will cause a dht_stats_alert to be posted.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_dht_state()

    │ │ │ │ -
    │ │ │ │ -void set_dht_state (dht::dht_state const& st);
    │ │ │ │ -void set_dht_state (dht::dht_state&& st);
    │ │ │ │ -
    │ │ │ │ -

    set the DHT state for the session. This will be taken into account the │ │ │ │ -next time the DHT is started, as if it had been passed in via the │ │ │ │ -session_params on startup.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    get_torrents() find_torrent()

    │ │ │ │ -
    │ │ │ │ -std::vector<torrent_handle> get_torrents () const;
    │ │ │ │ -torrent_handle find_torrent (sha1_hash const& info_hash) 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.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    async_add_torrent() add_torrent()

    │ │ │ │ -
    │ │ │ │ -void async_add_torrent (add_torrent_params const& params);
    │ │ │ │ -torrent_handle add_torrent (add_torrent_params const& params);
    │ │ │ │ -void async_add_torrent (add_torrent_params&& params);
    │ │ │ │ -torrent_handle add_torrent (add_torrent_params&& params, error_code& ec);
    │ │ │ │ -torrent_handle add_torrent (add_torrent_params&& params);
    │ │ │ │ -torrent_handle add_torrent (add_torrent_params const& params, error_code& ec);
    │ │ │ │ -
    │ │ │ │ -

    You add torrents through the add_torrent() function where you give an │ │ │ │ -object with all the parameters. The add_torrent() overloads will block │ │ │ │ -until the torrent has been added (or failed to be added) and returns │ │ │ │ -an error code and a torrent_handle. In order to add torrents more │ │ │ │ -efficiently, consider using async_add_torrent() which returns │ │ │ │ -immediately, without waiting for the torrent to add. Notification of │ │ │ │ -the torrent being added is sent as add_torrent_alert.

    │ │ │ │ -

    The save_path field in add_torrent_params must be set to a valid │ │ │ │ -path where the files for the torrent will be saved. Even when using a │ │ │ │ -custom storage, this needs to be set to something. If the save_path │ │ │ │ -is empty, the call to add_torrent() will throw a system_error │ │ │ │ -exception.

    │ │ │ │ -

    The overload that does not take an error_code throws an exception on │ │ │ │ -error and is not available when building without exception support. │ │ │ │ -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.

    │ │ │ │ -

    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 system_error which derives from │ │ │ │ -std::exception unless duplicate_is_error is set to false. In that │ │ │ │ -case, add_torrent() will return the handle to the existing torrent.

    │ │ │ │ -

    The add_torrent_params class has a flags field. It can be used to │ │ │ │ -control what state the new torrent will be added in. Common flags to │ │ │ │ -want to control are torrent_flags::paused and │ │ │ │ -torrent_flags::auto_managed. In order to add a magnet link that will │ │ │ │ -just download the metadata, but no payload, set the │ │ │ │ -torrent_flags::upload_mode flag.

    │ │ │ │ -

    Special consideration has to be taken when adding hybrid torrents │ │ │ │ -(i.e. torrents that are BitTorrent v2 torrents that are backwards │ │ │ │ -compatible with v1). For more details, see BitTorrent v2 torrents.

    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    pause() resume() is_paused()

    │ │ │ │ -
    │ │ │ │ -void pause ();
    │ │ │ │ -bool is_paused () const;
    │ │ │ │ -void resume ();
    │ │ │ │ -
    │ │ │ │ -

    Pausing the session has the same effect as pausing every torrent in │ │ │ │ -it, except that torrents will not be resumed by the auto-manage │ │ │ │ -mechanism. Resuming will restore the torrents to their previous paused │ │ │ │ -state. i.e. the session pause state is separate from the torrent pause │ │ │ │ -state. A torrent is inactive if it is paused or if the session is │ │ │ │ -paused.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    is_dht_running()

    │ │ │ │ -
    │ │ │ │ -bool is_dht_running () const;
    │ │ │ │ -
    │ │ │ │ -

    is_dht_running() returns true if the DHT support has been started │ │ │ │ -and false otherwise.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_dht_storage()

    │ │ │ │ -
    │ │ │ │ -void set_dht_storage (dht::dht_storage_constructor_type sc);
    │ │ │ │ -
    │ │ │ │ -

    set_dht_storage set a dht custom storage constructor function │ │ │ │ -to be used internally when the dht is created.

    │ │ │ │ -

    Since the dht storage is a critical component for the dht behavior, │ │ │ │ -this function will only be effective the next time the dht is started. │ │ │ │ -If you never touch this feature, a default map-memory based storage │ │ │ │ -is used.

    │ │ │ │ -

    If you want to make sure the dht is initially created with your │ │ │ │ -custom storage, create a session with the setting │ │ │ │ -settings_pack::enable_dht to false, set your constructor function │ │ │ │ -and call apply_settings with settings_pack::enable_dht to true.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    add_dht_node()

    │ │ │ │ -
    │ │ │ │ -void add_dht_node (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.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    dht_get_item()

    │ │ │ │ -
    │ │ │ │ -void dht_get_item (sha1_hash const& target);
    │ │ │ │ -
    │ │ │ │ -

    query the DHT for an immutable item at the target hash. │ │ │ │ -the result is posted as a dht_immutable_item_alert.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    dht_get_item()

    │ │ │ │ -
    │ │ │ │ -void dht_get_item (std::array<char, 32> key
    │ │ │ │ -      , std::string salt = std::string());
    │ │ │ │ -
    │ │ │ │ -

    query the DHT for a mutable item under the public key key. │ │ │ │ -this is an ed25519 key. salt is optional and may be left │ │ │ │ -as an empty string if no salt is to be used. │ │ │ │ -if the item is found in the DHT, a dht_mutable_item_alert is │ │ │ │ -posted.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    dht_put_item()

    │ │ │ │ -
    │ │ │ │ -sha1_hash dht_put_item (entry data);
    │ │ │ │ -
    │ │ │ │ -

    store the given bencoded data as an immutable item in the DHT. │ │ │ │ -the returned hash is the key that is to be used to look the item │ │ │ │ -up again. It's just the SHA-1 hash of the bencoded form of the │ │ │ │ -structure.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    dht_put_item()

    │ │ │ │ -
    │ │ │ │ -void dht_put_item (std::array<char, 32> key
    │ │ │ │ -      , std::function<void(entry&, std::array<char, 64>&
    │ │ │ │ -      , std::int64_t&, std::string const&)> cb
    │ │ │ │ -      , std::string salt = std::string());
    │ │ │ │ -
    │ │ │ │ -

    store a mutable item. The key is the public key the blob is │ │ │ │ -to be stored under. The optional salt argument is a string that │ │ │ │ -is to be mixed in with the key when determining where in the DHT │ │ │ │ -the value is to be stored. The callback function is called from within │ │ │ │ -the libtorrent network thread once we've found where to store the blob, │ │ │ │ -possibly with the current value stored under the key. │ │ │ │ -The values passed to the callback functions are:

    │ │ │ │ -
    │ │ │ │ -
    entry& value
    │ │ │ │ -
    the current value stored under the key (may be empty). Also expected │ │ │ │ -to be set to the value to be stored by the function.
    │ │ │ │ -
    std::array<char,64>& signature
    │ │ │ │ -
    the signature authenticating the current value. This may be zeros │ │ │ │ -if there is currently no value stored. The function is expected to │ │ │ │ -fill in this buffer with the signature of the new value to store. │ │ │ │ -To generate the signature, you may want to use the │ │ │ │ -sign_mutable_item function.
    │ │ │ │ -
    std::int64_t& seq
    │ │ │ │ -
    current sequence number. May be zero if there is no current value. │ │ │ │ -The function is expected to set this to the new sequence number of │ │ │ │ -the value that is to be stored. Sequence numbers must be monotonically │ │ │ │ -increasing. Attempting to overwrite a value with a lower or equal │ │ │ │ -sequence number will fail, even if the signature is correct.
    │ │ │ │ -
    std::string const& salt
    │ │ │ │ -
    this is the salt that was used for this put call.
    │ │ │ │ -
    │ │ │ │ -

    Since the callback function cb is called from within libtorrent, │ │ │ │ -it is critical to not perform any blocking operations. Ideally not │ │ │ │ -even locking a mutex. Pass any data required for this function along │ │ │ │ -with the function object's context and make the function entirely │ │ │ │ -self-contained. The only reason data blob's value is computed │ │ │ │ -via a function instead of just passing in the new value is to avoid │ │ │ │ -race conditions. If you want to update the value in the DHT, you │ │ │ │ -must first retrieve it, then modify it, then write it back. The way │ │ │ │ -the DHT works, it is natural to always do a lookup before storing and │ │ │ │ -calling the callback in between is convenient.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    dht_announce() dht_get_peers()

    │ │ │ │ -
    │ │ │ │ -void dht_announce (sha1_hash const& info_hash, int port = 0, dht::announce_flags_t flags = {});
    │ │ │ │ -void dht_get_peers (sha1_hash const& info_hash);
    │ │ │ │ -
    │ │ │ │ -

    dht_get_peers() will issue a DHT get_peer request to the DHT for the │ │ │ │ -specified info-hash. The response (the peers) will be posted back in a │ │ │ │ -dht_get_peers_reply_alert.

    │ │ │ │ -

    dht_announce() will issue a DHT announce request to the DHT to the │ │ │ │ -specified info-hash, advertising the specified port. If the port is │ │ │ │ -left at its default, 0, the port will be implied by the DHT message's │ │ │ │ -source port (which may improve connectivity through a NAT). │ │ │ │ -dht_announce() is not affected by the announce_port override setting.

    │ │ │ │ -

    Both these functions are exposed for advanced custom use of the DHT. │ │ │ │ -All torrents eligible to be announce to the DHT will be automatically, │ │ │ │ -by libtorrent.

    │ │ │ │ -

    For possible flags, see announce_flags_t.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    dht_live_nodes()

    │ │ │ │ -
    │ │ │ │ -void dht_live_nodes (sha1_hash const& nid);
    │ │ │ │ -
    │ │ │ │ -

    Retrieve all the live DHT (identified by nid) nodes. All the │ │ │ │ -nodes id and endpoint will be returned in the list of nodes in the │ │ │ │ -alert dht_live_nodes_alert. │ │ │ │ -Since this alert is a response to an explicit call, it will always be │ │ │ │ -posted, regardless of the alert mask.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    dht_sample_infohashes()

    │ │ │ │ -
    │ │ │ │ -void dht_sample_infohashes (udp::endpoint const& ep, sha1_hash const& target);
    │ │ │ │ -
    │ │ │ │ -

    Query the DHT node specified by ep to retrieve a sample of the │ │ │ │ -info-hashes that the node currently have in their storage. │ │ │ │ -The target is included for iterative lookups so that indexing nodes │ │ │ │ -can perform a key space traversal with a single RPC per node by adjusting │ │ │ │ -the target value for each RPC. It has no effect on the returned sample value. │ │ │ │ -The result is posted as a dht_sample_infohashes_alert.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    dht_direct_request()

    │ │ │ │ -
    │ │ │ │ -void dht_direct_request (udp::endpoint const& ep, entry const& e, client_data_t userdata = {});
    │ │ │ │ -
    │ │ │ │ -

    Send an arbitrary DHT request directly to the specified endpoint. This │ │ │ │ -function is intended for use by plugins. When a response is received │ │ │ │ -or the request times out, a dht_direct_response_alert will be posted │ │ │ │ -with the response (if any) and the userdata pointer passed in here. │ │ │ │ -Since this alert is a response to an explicit call, it will always be │ │ │ │ -posted, regardless of the alert mask.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    add_extension()

    │ │ │ │ -
    │ │ │ │ -void add_extension (std::function<std::shared_ptr<torrent_plugin>(
    │ │ │ │ -      torrent_handle const&, client_data_t)> ext);
    │ │ │ │ -void add_extension (std::shared_ptr<plugin> ext);
    │ │ │ │ -
    │ │ │ │ -

    This function adds an extension to this session. The argument is a │ │ │ │ -function object that is called with a torrent_handle and which should │ │ │ │ -return a std::shared_ptr<torrent_plugin>. To write custom │ │ │ │ -plugins, see libtorrent plugins. For the typical bittorrent client │ │ │ │ -all of these extensions should be added. The main plugins implemented │ │ │ │ -in libtorrent are:

    │ │ │ │ -
    │ │ │ │ -
    uTorrent metadata
    │ │ │ │ -
    Allows peers to download the metadata (.torrent files) from the swarm │ │ │ │ -directly. Makes it possible to join a swarm with just a tracker and │ │ │ │ -info-hash.
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -#include <libtorrent/extensions/ut_metadata.hpp>
    │ │ │ │ -ses.add_extension(&lt::create_ut_metadata_plugin);
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -
    uTorrent peer exchange
    │ │ │ │ -
    Exchanges peers between clients.
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -#include <libtorrent/extensions/ut_pex.hpp>
    │ │ │ │ -ses.add_extension(&lt::create_ut_pex_plugin);
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -
    smart ban plugin
    │ │ │ │ -
    A plugin that, with a small overhead, can ban peers │ │ │ │ -that sends bad data with very high accuracy. Should │ │ │ │ -eliminate most problems on poisoned torrents.
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -#include <libtorrent/extensions/smart_ban.hpp>
    │ │ │ │ -ses.add_extension(&lt::create_smart_ban_plugin);
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_ip_filter() get_ip_filter()

    │ │ │ │ -
    │ │ │ │ -ip_filter get_ip_filter () const;
    │ │ │ │ -void set_ip_filter (ip_filter f);
    │ │ │ │ -
    │ │ │ │ -

    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. get_ip_filter() Returns the │ │ │ │ -ip_filter currently in the session. See ip_filter.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_port_filter()

    │ │ │ │ -
    │ │ │ │ -void set_port_filter (port_filter const& f);
    │ │ │ │ -
    │ │ │ │ -

    apply port_filter f to incoming and outgoing peers. a port filter │ │ │ │ -will reject making outgoing peer connections to certain remote ports. │ │ │ │ -The main intention is to be able to avoid triggering certain │ │ │ │ -anti-virus software by connecting to SMTP, FTP ports.

    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    ssl_listen_port() listen_port() is_listening()

    │ │ │ │ -
    │ │ │ │ -bool is_listening () const;
    │ │ │ │ -unsigned short ssl_listen_port () const;
    │ │ │ │ -unsigned short listen_port () const;
    │ │ │ │ -
    │ │ │ │ -

    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 set a new │ │ │ │ -settings_pack::listen_interfaces to try another interface and port to │ │ │ │ -bind to.

    │ │ │ │ -

    listen_port() returns the port we ended up listening on.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    get_peer_class_filter() set_peer_class_filter()

    │ │ │ │ -
    │ │ │ │ -ip_filter get_peer_class_filter () const;
    │ │ │ │ -void set_peer_class_filter (ip_filter const& f);
    │ │ │ │ -
    │ │ │ │ -

    Sets the peer class filter for this session. All new peer connections │ │ │ │ -will take this into account and be added to the peer classes specified │ │ │ │ -by this filter, based on the peer's IP address.

    │ │ │ │ -

    The ip-filter essentially maps an IP -> uint32. Each bit in that 32 │ │ │ │ -bit integer represents a peer class. The least significant bit │ │ │ │ -represents class 0, the next bit class 1 and so on.

    │ │ │ │ -

    For more info, see ip_filter.

    │ │ │ │ -

    For example, to make all peers in the range 200.1.1.0 - 200.1.255.255 │ │ │ │ -belong to their own peer class, apply the following filter:

    │ │ │ │ -
    │ │ │ │ -ip_filter f = ses.get_peer_class_filter();
    │ │ │ │ -peer_class_t my_class = ses.create_peer_class("200.1.x.x IP range");
    │ │ │ │ -f.add_rule(make_address("200.1.1.0"), make_address("200.1.255.255")
    │ │ │ │ -        , 1 << static_cast<std::uint32_t>(my_class));
    │ │ │ │ -ses.set_peer_class_filter(f);
    │ │ │ │ -
    │ │ │ │ -

    This setting only applies to new connections, it won't affect existing │ │ │ │ -peer connections.

    │ │ │ │ -

    This function is limited to only peer class 0-31, since there are only │ │ │ │ -32 bits in the IP range mapping. Only the set bits matter; no peer │ │ │ │ -class will be removed from a peer as a result of this call, peer │ │ │ │ -classes are only added.

    │ │ │ │ -

    The peer_class argument cannot be greater than 31. The bitmasks │ │ │ │ -representing peer classes in the peer_class_filter are 32 bits.

    │ │ │ │ -

    The get_peer_class_filter() function returns the current filter.

    │ │ │ │ -

    For more information, see peer classes.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_peer_class_type_filter() get_peer_class_type_filter()

    │ │ │ │ -
    │ │ │ │ -void set_peer_class_type_filter (peer_class_type_filter const& f);
    │ │ │ │ -peer_class_type_filter get_peer_class_type_filter () const;
    │ │ │ │ -
    │ │ │ │ -

    Sets and gets the peer class type filter. This is controls automatic │ │ │ │ -peer class assignments to peers based on what kind of socket it is.

    │ │ │ │ -

    It does not only support assigning peer classes, it also supports │ │ │ │ -removing peer classes based on socket type.

    │ │ │ │ -

    The order of these rules being applied are:

    │ │ │ │ -
      │ │ │ │ -
    1. peer-class IP filter
    2. │ │ │ │ -
    3. peer-class type filter, removing classes
    4. │ │ │ │ -
    5. peer-class type filter, adding classes
    6. │ │ │ │ -
    │ │ │ │ -

    For more information, see peer classes.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    create_peer_class()

    │ │ │ │ -
    │ │ │ │ -peer_class_t create_peer_class (char const* name);
    │ │ │ │ -
    │ │ │ │ -

    Creates a new peer class (see peer classes) with the given name. The │ │ │ │ -returned integer is the new peer class identifier. Peer classes may │ │ │ │ -have the same name, so each invocation of this function creates a new │ │ │ │ -class and returns a unique identifier.

    │ │ │ │ -

    Identifiers are assigned from low numbers to higher. So if you plan on │ │ │ │ -using certain peer classes in a call to set_peer_class_filter(), │ │ │ │ -make sure to create those early on, to get low identifiers.

    │ │ │ │ -

    For more information on peer classes, see peer classes.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    delete_peer_class()

    │ │ │ │ -
    │ │ │ │ -void delete_peer_class (peer_class_t cid);
    │ │ │ │ -
    │ │ │ │ -

    This call dereferences the reference count of the specified peer │ │ │ │ -class. When creating a peer class it's automatically referenced by 1. │ │ │ │ -If you want to recycle a peer class, you may call this function. You │ │ │ │ -may only call this function once per peer class you create. │ │ │ │ -Calling it more than once for the same class will lead to memory │ │ │ │ -corruption.

    │ │ │ │ -

    Since peer classes are reference counted, this function will not │ │ │ │ -remove the peer class if it's still assigned to torrents or peers. It │ │ │ │ -will however remove it once the last peer and torrent drops their │ │ │ │ -references to it.

    │ │ │ │ -

    There is no need to call this function for custom peer classes. All │ │ │ │ -peer classes will be properly destructed when the session object │ │ │ │ -destructs.

    │ │ │ │ -

    For more information on peer classes, see peer classes.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_peer_class() get_peer_class()

    │ │ │ │ -
    │ │ │ │ -void set_peer_class (peer_class_t cid, peer_class_info const& pci);
    │ │ │ │ -peer_class_info get_peer_class (peer_class_t cid) const;
    │ │ │ │ -
    │ │ │ │ -

    These functions queries information from a peer class and updates the │ │ │ │ -configuration of a peer class, respectively.

    │ │ │ │ -

    cid must refer to an existing peer class. If it does not, the │ │ │ │ -return value of get_peer_class() is undefined.

    │ │ │ │ -

    set_peer_class() sets all the information in the │ │ │ │ -peer_class_info object in the specified peer class. There is no │ │ │ │ -option to only update a single property.

    │ │ │ │ -

    A peer or torrent belonging to more than one class, the highest │ │ │ │ -priority among any of its classes is the one that is taken into │ │ │ │ -account.

    │ │ │ │ -

    For more information, see peer classes.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    remove_torrent()

    │ │ │ │ -
    │ │ │ │ -void remove_torrent (const torrent_handle&, remove_flags_t = {});
    │ │ │ │ -
    │ │ │ │ -

    remove_torrent() will close all peer connections associated with │ │ │ │ -the torrent and tell the tracker that we've stopped participating in │ │ │ │ -the swarm. This operation cannot fail. When it completes, you will │ │ │ │ -receive a torrent_removed_alert.

    │ │ │ │ -

    remove_torrent() is non-blocking, but will remove the torrent from the │ │ │ │ -session synchronously. Calling session_handle::add_torrent() immediately │ │ │ │ -afterward with the same torrent will succeed. Note that this creates a │ │ │ │ -new handle which is not equal to the removed one.

    │ │ │ │ -

    The optional second argument options can be used to delete all the │ │ │ │ -files downloaded by this torrent. To do so, pass in the value │ │ │ │ -session_handle::delete_files. Once the torrent is deleted, a │ │ │ │ -torrent_deleted_alert is posted.

    │ │ │ │ -

    The torrent_handle remains valid for some time after remove_torrent() is │ │ │ │ -called. It will become invalid only after all libtorrent tasks (such as │ │ │ │ -I/O tasks) release their references to the torrent. Until this happens, │ │ │ │ -torrent_handle::is_valid() will return true, and other calls such │ │ │ │ -as torrent_handle::status() will succeed. Because of this, and because │ │ │ │ -remove_torrent() is non-blocking, the following sequence usually │ │ │ │ -succeeds (does not throw system_error): │ │ │ │ -.. code:: c++

    │ │ │ │ -
    │ │ │ │ -session.remove_handle(handle); │ │ │ │ -handle.save_resume_data();
    │ │ │ │ -

    Note that when a queued or downloading torrent is removed, its position │ │ │ │ -in the download queue is vacated and every subsequent torrent in the │ │ │ │ -queue has their queue positions updated. This can potentially cause a │ │ │ │ -large state_update to be posted. When removing all torrents, it is │ │ │ │ -advised to remove them from the back of the queue, to minimize the │ │ │ │ -shifting.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    apply_settings() get_settings()

    │ │ │ │ -
    │ │ │ │ -void apply_settings (settings_pack&&);
    │ │ │ │ -settings_pack get_settings () const;
    │ │ │ │ -void apply_settings (settings_pack const&);
    │ │ │ │ -
    │ │ │ │ -

    Applies the settings specified by the settings_pack s. This is an │ │ │ │ -asynchronous operation that will return immediately and actually apply │ │ │ │ -the settings to the main thread of libtorrent some time later.

    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    pop_alerts() wait_for_alert() set_alert_notify()

    │ │ │ │ -
    │ │ │ │ -void pop_alerts (std::vector<alert*>* alerts);
    │ │ │ │ -alert* wait_for_alert (time_duration max_wait);
    │ │ │ │ -void set_alert_notify (std::function<void()> const& fun);
    │ │ │ │ -
    │ │ │ │ -

    Alerts is the main mechanism for libtorrent to report errors and │ │ │ │ -events. pop_alerts fills in the vector passed to it with pointers │ │ │ │ -to new alerts. The session still owns these alerts and they will stay │ │ │ │ -valid until the next time pop_alerts is called. You may not delete │ │ │ │ -the alert objects.

    │ │ │ │ -

    It is safe to call pop_alerts from multiple different threads, as │ │ │ │ -long as the alerts themselves are not accessed once another thread │ │ │ │ -calls pop_alerts. Doing this requires manual synchronization │ │ │ │ -between the popping threads.

    │ │ │ │ -

    wait_for_alert will block the current thread for max_wait time │ │ │ │ -duration, or until another alert is posted. If an alert is available │ │ │ │ -at the time of the call, it returns immediately. The returned alert │ │ │ │ -pointer is the head of the alert queue. wait_for_alert does not │ │ │ │ -pop alerts from the queue, it merely peeks at it. The returned alert │ │ │ │ -will stay valid until pop_alerts is called twice. The first time │ │ │ │ -will pop it and the second will free it.

    │ │ │ │ -

    If there is no alert in the queue and no alert arrives within the │ │ │ │ -specified timeout, wait_for_alert returns nullptr.

    │ │ │ │ -

    In the python binding, wait_for_alert takes the number of │ │ │ │ -milliseconds to wait as an integer.

    │ │ │ │ -

    The alert queue in the session will not grow indefinitely. Make sure │ │ │ │ -to pop periodically to not miss notifications. To control the max │ │ │ │ -number of alerts that's queued by the session, see │ │ │ │ -settings_pack::alert_queue_size.

    │ │ │ │ -

    Some alerts are considered so important that they are posted even when │ │ │ │ -the alert queue is full. Some alerts are considered mandatory and cannot │ │ │ │ -be disabled by the alert_mask. For instance, │ │ │ │ -save_resume_data_alert and save_resume_data_failed_alert are always │ │ │ │ -posted, regardless of the alert mask.

    │ │ │ │ -

    To control which alerts are posted, set the alert_mask │ │ │ │ -(settings_pack::alert_mask).

    │ │ │ │ -

    If the alert queue fills up to the point where alerts are dropped, this │ │ │ │ -will be indicated by a alerts_dropped_alert, which contains a bitmask │ │ │ │ -of which types of alerts were dropped. Generally it is a good idea to │ │ │ │ -make sure the alert queue is large enough, the alert_mask doesn't have │ │ │ │ -unnecessary categories enabled and to call pop_alert() frequently, to │ │ │ │ -avoid alerts being dropped.

    │ │ │ │ -

    the set_alert_notify function lets the client set a function object │ │ │ │ -to be invoked every time the alert queue goes from having 0 alerts to │ │ │ │ -1 alert. This function is called from within libtorrent, it may be the │ │ │ │ -main thread, or it may be from within a user call. The intention of │ │ │ │ -of the function is that the client wakes up its main thread, to poll │ │ │ │ -for more alerts using pop_alerts(). If the notify function fails │ │ │ │ -to do so, it won't be called again, until pop_alerts is called for │ │ │ │ -some other reason. For instance, it could signal an eventfd, post a │ │ │ │ -message to an HWND or some other main message pump. The actual │ │ │ │ -retrieval of alerts should not be done in the callback. In fact, the │ │ │ │ -callback should not block. It should not perform any expensive work. │ │ │ │ -It really should just notify the main application thread.

    │ │ │ │ -

    The type of an alert is returned by the polymorphic function │ │ │ │ -alert::type() but can also be queries from a concrete type via │ │ │ │ -T::alert_type, as a static constant.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    add_port_mapping() delete_port_mapping()

    │ │ │ │ -
    │ │ │ │ -void delete_port_mapping (port_mapping_t handle);
    │ │ │ │ -std::vector<port_mapping_t> add_port_mapping (portmap_protocol t, int external_port, int local_port);
    │ │ │ │ -
    │ │ │ │ -

    add_port_mapping adds one or more port forwards on UPnP and/or NAT-PMP, │ │ │ │ -whichever is enabled. A mapping is created for each listen socket │ │ │ │ -in the session. The return values are all handles referring to the │ │ │ │ -port mappings that were just created. Pass them to delete_port_mapping() │ │ │ │ -to remove them.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    reopen_network_sockets()

    │ │ │ │ -
    │ │ │ │ -void reopen_network_sockets (reopen_network_flags_t options = reopen_map_ports);
    │ │ │ │ -
    │ │ │ │ -

    Instructs the session to reopen all listen and outgoing sockets.

    │ │ │ │ -

    It's useful in the case your platform doesn't support the built in │ │ │ │ -IP notifier mechanism, or if you have a better more reliable way to │ │ │ │ -detect changes in the IP routing table.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    native_handle()

    │ │ │ │ -
    │ │ │ │ -std::shared_ptr<aux::session_impl> native_handle () const;
    │ │ │ │ -
    │ │ │ │ -

    This function is intended only for use by plugins. This type does │ │ │ │ -not have a stable API and should be relied on as little as possible.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    save_settings
    │ │ │ │ -
    saves settings (i.e. the settings_pack)
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    save_dht_state
    │ │ │ │ -
    saves dht state such as nodes and node-id, possibly accelerating │ │ │ │ -joining the DHT if provided at next session startup.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    save_extension_state
    │ │ │ │ -
    load or save state from plugins
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    save_ip_filter
    │ │ │ │ -
    load or save the IP filter set on the session
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    global_peer_class_id tcp_peer_class_id local_peer_class_id
    │ │ │ │ -
    built-in peer classes
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    delete_files
    │ │ │ │ -
    delete the files belonging to the torrent from disk. │ │ │ │ -including the part-file, if there is one
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    delete_partfile
    │ │ │ │ -
    delete just the part-file associated with this torrent
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    paused
    │ │ │ │ -
    when set, the session will start paused. Call │ │ │ │ -session_handle::resume() to start
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    udp tcp
    │ │ │ │ -
    protocols used by add_port_mapping()
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    reopen_map_ports
    │ │ │ │ -
    This option indicates if the ports are mapped using natpmp │ │ │ │ -and upnp. If mapping was already made, they are deleted and added │ │ │ │ -again. This only works if natpmp and/or upnp are configured to be │ │ │ │ -enable.
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    write_session_params_buf() write_session_params() read_session_params()

    │ │ │ │ -

    Declared in "libtorrent/session_params.hpp"

    │ │ │ │ -
    │ │ │ │ -session_params read_session_params (bdecode_node const& e
    │ │ │ │ -   , save_state_flags_t flags = save_state_flags_t::all());
    │ │ │ │ -std::vector<char> write_session_params_buf (session_params const& sp
    │ │ │ │ -   , save_state_flags_t flags = save_state_flags_t::all());
    │ │ │ │ -session_params read_session_params (span<char const> buf
    │ │ │ │ -   , save_state_flags_t flags = save_state_flags_t::all());
    │ │ │ │ -entry write_session_params (session_params const& sp
    │ │ │ │ -   , save_state_flags_t flags = save_state_flags_t::all());
    │ │ │ │ -
    │ │ │ │ -

    These functions serialize and de-serialize a session_params object to and │ │ │ │ -from bencoded form. The session_params object is used to initialize a new │ │ │ │ -session using the state from a previous one (or by programmatically configure │ │ │ │ -the session up-front). │ │ │ │ -The flags parameter can be used to only save and load certain aspects of the │ │ │ │ -session's state. │ │ │ │ -The _buf suffix indicates the function operates on buffer rather than the │ │ │ │ -bencoded structure. │ │ │ │ -The torrents in a session are not part of the session_params state, they have │ │ │ │ -to be restored separately.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    stats_metric

    │ │ │ │

    Declared in "libtorrent/session_stats.hpp"

    │ │ │ │

    describes one statistics metric from the session. For more information, │ │ │ │ see the session statistics section.

    │ │ │ │
    │ │ │ │ @@ -5460,26 +3416,26 @@
    │ │ │ │  

    Declared in "libtorrent/performance_counters.hpp"

    │ │ │ │
    │ │ │ │  struct counters
    │ │ │ │  {
    │ │ │ │     counters () ;
    │ │ │ │     counters (counters const&) ;
    │ │ │ │     counters& operator= (counters const&) & ;
    │ │ │ │ -   std::int64_t operator[] (int i) const ;
    │ │ │ │     std::int64_t inc_stats_counter (int c, std::int64_t value = 1) ;
    │ │ │ │ -   void blend_stats_counter (int c, std::int64_t value, int ratio) ;
    │ │ │ │ +   std::int64_t operator[] (int i) const ;
    │ │ │ │     void set_value (int c, std::int64_t value) ;
    │ │ │ │ +   void blend_stats_counter (int c, std::int64_t value, int ratio) ;
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -

    inc_stats_counter() operator[]()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    operator[]() inc_stats_counter()

    │ │ │ │
    │ │ │ │ -std::int64_t operator[] (int i) const ;
    │ │ │ │  std::int64_t inc_stats_counter (int c, std::int64_t value = 1) ;
    │ │ │ │ +std::int64_t operator[] (int i) const ;
    │ │ │ │  
    │ │ │ │

    returns the new value

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │
    │ │ │ │

    session_stats_metrics()

    │ │ │ │

    Declared in "libtorrent/session_stats.hpp"

    │ │ │ │ @@ -5524,198 +3480,31 @@ │ │ │ │ │ │ │ │ gauge │ │ │ │ 1 │ │ │ │   │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    ip_filter

    │ │ │ │ -

    Declared in "libtorrent/ip_filter.hpp"

    │ │ │ │ -

    The ip_filter class is a set of rules that uniquely categorizes all │ │ │ │ -ip addresses as allowed or disallowed. The default constructor creates │ │ │ │ -a single rule that allows all addresses (0.0.0.0 - 255.255.255.255 for │ │ │ │ -the IPv4 range, and the equivalent range covering all addresses for the │ │ │ │ -IPv6 range).

    │ │ │ │ -

    A default constructed ip_filter does not filter any address.

    │ │ │ │ -
    │ │ │ │ -struct ip_filter
    │ │ │ │ -{
    │ │ │ │ -   ip_filter (ip_filter const&);
    │ │ │ │ -   ip_filter& operator= (ip_filter&&);
    │ │ │ │ -   ~ip_filter ();
    │ │ │ │ -   ip_filter& operator= (ip_filter const&);
    │ │ │ │ -   ip_filter (ip_filter&&);
    │ │ │ │ -   ip_filter ();
    │ │ │ │ -   bool empty () const;
    │ │ │ │ -   void add_rule (address const& first, address const& last, std::uint32_t flags);
    │ │ │ │ -   std::uint32_t access (address const& addr) const;
    │ │ │ │ -   filter_tuple_t export_filter () const;
    │ │ │ │ -
    │ │ │ │ -   enum access_flags
    │ │ │ │ -   {
    │ │ │ │ -      blocked,
    │ │ │ │ -   };
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -

    empty()

    │ │ │ │ -
    │ │ │ │ -bool empty () const;
    │ │ │ │ -
    │ │ │ │ -

    returns true if the filter does not contain any rules

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    add_rule()

    │ │ │ │ -
    │ │ │ │ -void add_rule (address const& first, address const& last, std::uint32_t flags);
    │ │ │ │ -
    │ │ │ │ -

    Adds a rule to the filter. first and last defines a range of │ │ │ │ -ip addresses that will be marked with the given flags. The flags │ │ │ │ -can currently be 0, which means allowed, or ip_filter::blocked, which │ │ │ │ -means disallowed.

    │ │ │ │ -

    precondition: │ │ │ │ -first.is_v4() == last.is_v4() && first.is_v6() == last.is_v6()

    │ │ │ │ -

    postcondition: │ │ │ │ -access(x) == flags for every x in the range [first, last]

    │ │ │ │ -

    This means that in a case of overlapping ranges, the last one applied takes │ │ │ │ -precedence.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    access()

    │ │ │ │ -
    │ │ │ │ -std::uint32_t access (address const& addr) const;
    │ │ │ │ -
    │ │ │ │ -

    Returns the access permissions for the given address (addr). The permission │ │ │ │ -can currently be 0 or ip_filter::blocked. The complexity of this operation │ │ │ │ -is O(log n), where n is the minimum number of non-overlapping ranges to describe │ │ │ │ -the current filter.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    export_filter()

    │ │ │ │ -
    │ │ │ │ -filter_tuple_t export_filter () const;
    │ │ │ │ -
    │ │ │ │ -

    This function will return the current state of the filter in the minimum number of │ │ │ │ -ranges possible. They are sorted from ranges in low addresses to high addresses. Each │ │ │ │ -entry in the returned vector is a range with the access control specified in its │ │ │ │ -flags field.

    │ │ │ │ -

    The return value is a tuple containing two range-lists. One for IPv4 addresses │ │ │ │ -and one for IPv6 addresses.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum access_flags

    │ │ │ │ -

    Declared in "libtorrent/ip_filter.hpp"

    │ │ │ │ - │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -
    namevaluedescription
    blocked1indicates that IPs in this range should not be connected │ │ │ │ -to nor accepted as incoming connections
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    port_filter

    │ │ │ │ -

    Declared in "libtorrent/ip_filter.hpp"

    │ │ │ │ -

    the port filter maps non-overlapping port ranges to flags. This │ │ │ │ -is primarily used to indicate whether a range of ports should │ │ │ │ -be connected to or not. The default is to have the full port │ │ │ │ -range (0-65535) set to flag 0.

    │ │ │ │ -
    │ │ │ │ -class port_filter
    │ │ │ │ -{
    │ │ │ │ -   port_filter (port_filter&&);
    │ │ │ │ -   port_filter (port_filter const&);
    │ │ │ │ -   port_filter ();
    │ │ │ │ -   ~port_filter ();
    │ │ │ │ -   port_filter& operator= (port_filter const&);
    │ │ │ │ -   port_filter& operator= (port_filter&&);
    │ │ │ │ -   void add_rule (std::uint16_t first, std::uint16_t last, std::uint32_t flags);
    │ │ │ │ -   std::uint32_t access (std::uint16_t port) const;
    │ │ │ │ -
    │ │ │ │ -   enum access_flags
    │ │ │ │ -   {
    │ │ │ │ -      blocked,
    │ │ │ │ -   };
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -

    add_rule()

    │ │ │ │ -
    │ │ │ │ -void add_rule (std::uint16_t first, std::uint16_t last, std::uint32_t flags);
    │ │ │ │ -
    │ │ │ │ -

    set the flags for the specified port range (first, last) to │ │ │ │ -flags overwriting any existing rule for those ports. The range │ │ │ │ -is inclusive, i.e. the port last also has the flag set on it.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    access()

    │ │ │ │ -
    │ │ │ │ -std::uint32_t access (std::uint16_t port) const;
    │ │ │ │ -
    │ │ │ │ -

    test the specified port (port) for whether it is blocked │ │ │ │ -or not. The returned value is the flags set for this port. │ │ │ │ -see access_flags.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum access_flags

    │ │ │ │ -

    Declared in "libtorrent/ip_filter.hpp"

    │ │ │ │ - │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -
    namevaluedescription
    blocked1this flag indicates that destination ports in the │ │ │ │ -range should not be connected to
    │ │ │ │ [report issue]
    │ │ │ │ -
    │ │ │ │
    │ │ │ │

    client_data_t

    │ │ │ │

    Declared in "libtorrent/client_data.hpp"

    │ │ │ │

    A thin wrapper around a void pointer used as "user data". i.e. an opaque │ │ │ │ cookie passed in to libtorrent and returned on demand. It adds type-safety by │ │ │ │ requiring the same type be requested out of it as was assigned to it.

    │ │ │ │
    │ │ │ │  struct client_data_t
    │ │ │ │  {
    │ │ │ │     client_data_t () = default;
    │ │ │ │     explicit client_data_t (T* v);
    │ │ │ │     client_data_t& operator= (T* v);
    │ │ │ │     T* get () const;
    │ │ │ │     explicit operator T () const;
    │ │ │ │ -   operator void* () const = delete;
    │ │ │ │     client_data_t& operator= (void*) = delete;
    │ │ │ │ +   operator void* () const = delete;
    │ │ │ │     client_data_t& operator= (void const*) = delete;
    │ │ │ │     operator void const* () const = delete;
    │ │ │ │  
    │ │ │ │     template <typename T, typename U  = typename std::enable_if<std::is_pointer<T>::value>::type>
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ [report issue]
    │ │ │ │ @@ -5726,16 +3515,16 @@ │ │ │ │

    construct a nullptr client data

    │ │ │ │ │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    const*() operator=() void*()

    │ │ │ │
    │ │ │ │ -operator void* () const = delete;
    │ │ │ │  client_data_t& operator= (void*) = delete;
    │ │ │ │ +operator void* () const = delete;
    │ │ │ │  client_data_t& operator= (void const*) = delete;
    │ │ │ │  operator void const* () const = delete;
    │ │ │ │  
    │ │ │ │

    we don't allow type-unsafe operations

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │
    │ │ │ │ @@ -6150,19 +3939,19 @@ │ │ │ │

    announce_entry

    │ │ │ │

    Declared in "libtorrent/announce_entry.hpp"

    │ │ │ │

    this class holds information about one bittorrent tracker, as it │ │ │ │ relates to a specific torrent.

    │ │ │ │
    │ │ │ │  struct announce_entry
    │ │ │ │  {
    │ │ │ │ +   announce_entry ();
    │ │ │ │     explicit announce_entry (string_view u);
    │ │ │ │     announce_entry (announce_entry const&);
    │ │ │ │     ~announce_entry ();
    │ │ │ │     announce_entry& operator= (announce_entry const&) &;
    │ │ │ │ -   announce_entry ();
    │ │ │ │  
    │ │ │ │     enum tracker_source
    │ │ │ │     {
    │ │ │ │        source_torrent,
    │ │ │ │        source_client,
    │ │ │ │        source_magnet_link,
    │ │ │ │        source_tex,
    │ │ │ │ @@ -6178,19 +3967,19 @@
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │

    announce_entry() operator=() ~announce_entry()

    │ │ │ │
    │ │ │ │ +announce_entry ();
    │ │ │ │  explicit announce_entry (string_view u);
    │ │ │ │  announce_entry (announce_entry const&);
    │ │ │ │  ~announce_entry ();
    │ │ │ │  announce_entry& operator= (announce_entry const&) &;
    │ │ │ │ -announce_entry ();
    │ │ │ │  
    │ │ │ │

    constructs a tracker announce entry with u as the URL.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    enum tracker_source

    │ │ │ │

    Declared in "libtorrent/announce_entry.hpp"

    │ │ │ │ │ │ │ │ @@ -6208,15 +3997,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ @@ -7315,26 +5104,26 @@ │ │ │ │ torrent_handle::move_storage. This is useful to synchronize with the │ │ │ │ actual disk. The storage_path() member return the new path of the │ │ │ │ storage.

    │ │ │ │
    │ │ │ │  struct storage_moved_alert final : torrent_alert
    │ │ │ │  {
    │ │ │ │     std::string message () const override;
    │ │ │ │ -   char const* storage_path () const;
    │ │ │ │     char const* old_path () const;
    │ │ │ │ +   char const* storage_path () const;
    │ │ │ │  
    │ │ │ │     static constexpr alert_category_t static_category  = alert_category::storage;
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -

    old_path() storage_path()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    storage_path() old_path()

    │ │ │ │
    │ │ │ │ -char const* storage_path () const;
    │ │ │ │  char const* old_path () const;
    │ │ │ │ +char const* storage_path () const;
    │ │ │ │  
    │ │ │ │

    the path the torrent was moved to and from, respectively.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │
    │ │ │ │

    storage_moved_failed_alert

    │ │ │ │

    Declared in "libtorrent/alert_types.hpp"

    │ │ │ │ @@ -9021,45 +6810,45 @@ │ │ │ │

    Declared in "libtorrent/alert_types.hpp"

    │ │ │ │

    posted as a response to a call to session::dht_sample_infohashes() with │ │ │ │ the information from the DHT response message.

    │ │ │ │
    │ │ │ │  struct dht_sample_infohashes_alert final : alert
    │ │ │ │  {
    │ │ │ │     std::string message () const override;
    │ │ │ │ -   int num_samples () const;
    │ │ │ │     std::vector<sha1_hash> samples () const;
    │ │ │ │ +   int num_samples () const;
    │ │ │ │     int num_nodes () const;
    │ │ │ │     std::vector<std::pair<sha1_hash, udp::endpoint>> nodes () const;
    │ │ │ │  
    │ │ │ │     static constexpr alert_category_t static_category  = alert_category::dht_operation;
    │ │ │ │     sha1_hash node_id;
    │ │ │ │     aux::noexcept_movable<udp::endpoint> endpoint;
    │ │ │ │     time_duration const interval;
    │ │ │ │     int const num_infohashes;
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -

    samples() num_samples()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    num_samples() samples()

    │ │ │ │
    │ │ │ │ -int num_samples () const;
    │ │ │ │  std::vector<sha1_hash> samples () const;
    │ │ │ │ +int num_samples () const;
    │ │ │ │  
    │ │ │ │

    returns the number of info-hashes returned by the node, as well as the │ │ │ │ actual info-hashes. num_samples() is more efficient than │ │ │ │ samples().size().

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    num_nodes()

    │ │ │ │
    │ │ │ │  int num_nodes () const;
    │ │ │ │  
    │ │ │ │

    The total number of nodes returned by nodes().

    │ │ │ │ [report issue]
    │ │ │ │ -
    │ │ │ │ +
    │ │ │ │

    nodes()

    │ │ │ │
    │ │ │ │  std::vector<std::pair<sha1_hash, udp::endpoint>> nodes () const;
    │ │ │ │  
    │ │ │ │

    This is the set of more DHT nodes returned by the request.

    │ │ │ │

    The information is included so that indexing nodes can perform a key │ │ │ │ space traversal with a single RPC per node by adjusting the target │ │ │ │ @@ -9322,14 +7111,23 @@ │ │ │ │ std::vector<announce_entry> trackers; │ │ │ │ }; │ │ │ │ │ │ │ │ [report issue]

    │ │ │ │
    trackers
    │ │ │ │
    list of trackers and their status for the torrent
    │ │ │ │
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    operation_name()

    │ │ │ │ +

    Declared in "libtorrent/operations.hpp"

    │ │ │ │ +
    │ │ │ │ +char const* operation_name (operation_t op);
    │ │ │ │ +
    │ │ │ │ +

    maps an operation id (from peer_error_alert and peer_disconnected_alert) │ │ │ │ +to its name. See operation_t for the constants

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    alert_cast()

    │ │ │ │

    Declared in "libtorrent/alert.hpp"

    │ │ │ │
    │ │ │ │  template <typename T> T* alert_cast (alert* a);
    │ │ │ │  template <typename T> T const* alert_cast (alert const* a);
    │ │ │ │ @@ -9337,23 +7135,14 @@
    │ │ │ │  

    When you get an alert, you can use alert_cast<> to attempt to cast the │ │ │ │ pointer to a specific alert type, in order to query it for more │ │ │ │ information.

    │ │ │ │
    │ │ │ │

    Note

    │ │ │ │

    alert_cast<> can only cast to an exact alert type, not a base class

    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    operation_name()

    │ │ │ │ -

    Declared in "libtorrent/operations.hpp"

    │ │ │ │ -
    │ │ │ │ -char const* operation_name (operation_t op);
    │ │ │ │ -
    │ │ │ │ -

    maps an operation id (from peer_error_alert and peer_disconnected_alert) │ │ │ │ -to its name. See operation_t for the constants

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    enum operation_t

    │ │ │ │

    Declared in "libtorrent/operations.hpp"

    │ │ │ │
    source_torrent1the tracker was part of the .torrent file
    source_client2the tracker was added programmatically via the add_tracker() functionthe tracker was added programmatically via the add_tracker() function
    source_magnet_link4the tracker was part of a magnet link
    source_tex8
    │ │ │ │ │ │ │ │ │ │ │ │ @@ -9684,34 +7473,623 @@ │ │ │ │ │ │ │ │
    │ │ │ │
    block_progress
    │ │ │ │
    alerts on individual blocks being requested, downloading, finished, │ │ │ │ rejected, time-out and cancelled. This is likely to post alerts at a │ │ │ │ high rate.
    │ │ │ │
    │ │ │ │ -
    │ │ │ │ -
    all
    │ │ │ │ -

    The full bitmask, representing all available categories.

    │ │ │ │ -

    since the enum is signed, make sure this isn't │ │ │ │ -interpreted as -1. For instance, boost.python │ │ │ │ -does that and fails when assigning it to an │ │ │ │ -unsigned parameter.

    │ │ │ │ -
    │ │ │ │ +
    │ │ │ │ +
    all
    │ │ │ │ +

    The full bitmask, representing all available categories.

    │ │ │ │ +

    since the enum is signed, make sure this isn't │ │ │ │ +interpreted as -1. For instance, boost.python │ │ │ │ +does that and fails when assigning it to an │ │ │ │ +unsigned parameter.

    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +[report issue] │ │ │ │ +
    │ │ │ │ +

    int

    │ │ │ │ +

    Declared in "libtorrent/alert_types.hpp"

    │ │ │ │ +
    │ │ │ │ +
    user_alert_id
    │ │ │ │ +
    user defined alerts should use IDs greater than this
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    num_alert_types
    │ │ │ │ +
    this constant represents "max_alert_index" + 1
    │ │ │ │ +
    │ │ │ │ +

    You have some control over session configuration through the session::apply_settings() │ │ │ │ +member function. To change one or more configuration options, create a settings_pack │ │ │ │ +object and fill it with the settings to be set and pass it in to session::apply_settings().

    │ │ │ │ +

    The settings_pack object is a collection of settings updates that are applied │ │ │ │ +to the session when passed to session::apply_settings(). It's empty when │ │ │ │ +constructed.

    │ │ │ │ +

    You have control over proxy and authorization settings and also the user-agent │ │ │ │ +that will be sent to the tracker. The user-agent will also be used to identify the │ │ │ │ +client with other peers.

    │ │ │ │ +

    Each configuration option is named with an enum value inside the │ │ │ │ +settings_pack class. These are the available settings:

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    disk_observer

    │ │ │ │ +

    Declared in "libtorrent/disk_observer.hpp"

    │ │ │ │ +
    │ │ │ │ +struct disk_observer
    │ │ │ │ +{
    │ │ │ │ +   virtual void on_disk () = 0;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +

    on_disk()

    │ │ │ │ +
    │ │ │ │ +virtual void on_disk () = 0;
    │ │ │ │ +
    │ │ │ │ +

    called when the disk cache size has dropped │ │ │ │ +below the low watermark again and we can │ │ │ │ +resume downloading from peers

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    open_file_state

    │ │ │ │ +

    Declared in "libtorrent/disk_interface.hpp"

    │ │ │ │ +

    this contains information about a file that's currently open by the │ │ │ │ +libtorrent disk I/O subsystem. It's associated with a single torrent.

    │ │ │ │ +
    │ │ │ │ +struct open_file_state
    │ │ │ │ +{
    │ │ │ │ +   file_index_t file_index;
    │ │ │ │ +   file_open_mode_t open_mode;
    │ │ │ │ +   time_point last_use;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    file_index
    │ │ │ │ +
    the index of the file this entry refers to into the file_storage │ │ │ │ +file list of this torrent. This starts indexing at 0.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    open_mode
    │ │ │ │ +

    open_mode is a bitmask of the file flags this file is currently │ │ │ │ +opened with. For possible flags, see file_open_mode_t.

    │ │ │ │ +

    Note that the read/write mode is not a bitmask. The two least significant bits are used │ │ │ │ +to represent the read/write mode. Those bits can be masked out using the rw_mask constant.

    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    last_use
    │ │ │ │ +
    a (high precision) timestamp of when the file was last used.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    disk_interface

    │ │ │ │ +

    Declared in "libtorrent/disk_interface.hpp"

    │ │ │ │ +

    The disk_interface is the customization point for disk I/O in libtorrent. │ │ │ │ +implement this interface and provide a factory function to the session constructor │ │ │ │ +use custom disk I/O. All functions on the disk subsystem (implementing │ │ │ │ +disk_interface) are called from within libtorrent's network thread. For │ │ │ │ +disk I/O to be performed in a separate thread, the disk subsystem has to │ │ │ │ +manage that itself.

    │ │ │ │ +

    Although the functions are called async_*, they do not technically │ │ │ │ +have to be asynchronous, but they support being asynchronous, by │ │ │ │ +expecting the result passed back into a callback. The callbacks must be │ │ │ │ +posted back onto the network thread via the io_context object passed into │ │ │ │ +the constructor. The callbacks will be run in the network thread.

    │ │ │ │ +
    │ │ │ │ +struct disk_interface
    │ │ │ │ +{
    │ │ │ │ +   virtual storage_holder new_torrent (storage_params const& p
    │ │ │ │ +      , std::shared_ptr<void> const& torrent) = 0;
    │ │ │ │ +   virtual void remove_torrent (storage_index_t) = 0;
    │ │ │ │ +   virtual bool async_write (storage_index_t storage, peer_request const& r
    │ │ │ │ +      , char const* buf, std::shared_ptr<disk_observer> o
    │ │ │ │ +      , std::function<void(storage_error const&)> handler
    │ │ │ │ +      , disk_job_flags_t flags = {}) = 0;
    │ │ │ │ +   virtual void async_read (storage_index_t storage, peer_request const& r
    │ │ │ │ +      , std::function<void(disk_buffer_holder, storage_error const&)> handler
    │ │ │ │ +      , disk_job_flags_t flags = {}) = 0;
    │ │ │ │ +   virtual void async_hash (storage_index_t storage, piece_index_t piece, span<sha256_hash> v2
    │ │ │ │ +      , disk_job_flags_t flags
    │ │ │ │ +      , std::function<void(piece_index_t, sha1_hash const&, storage_error const&)> handler) = 0;
    │ │ │ │ +   virtual void async_hash2 (storage_index_t storage, piece_index_t piece, int offset, disk_job_flags_t flags
    │ │ │ │ +      , std::function<void(piece_index_t, sha256_hash const&, storage_error const&)> handler) = 0;
    │ │ │ │ +   virtual void async_move_storage (storage_index_t storage, std::string p, move_flags_t flags
    │ │ │ │ +      , std::function<void(status_t, std::string const&, storage_error const&)> handler) = 0;
    │ │ │ │ +   virtual void async_release_files (storage_index_t storage
    │ │ │ │ +      , std::function<void()> handler = std::function<void()>()) = 0;
    │ │ │ │ +   virtual void async_check_files (storage_index_t storage
    │ │ │ │ +      , add_torrent_params const* resume_data
    │ │ │ │ +      , aux::vector<std::string, file_index_t> links
    │ │ │ │ +      , std::function<void(status_t, storage_error const&)> handler) = 0;
    │ │ │ │ +   virtual void async_stop_torrent (storage_index_t storage
    │ │ │ │ +      , std::function<void()> handler = std::function<void()>()) = 0;
    │ │ │ │ +   virtual void async_rename_file (storage_index_t storage
    │ │ │ │ +      , file_index_t index, std::string name
    │ │ │ │ +      , std::function<void(std::string const&, file_index_t, storage_error const&)> handler) = 0;
    │ │ │ │ +   virtual void async_delete_files (storage_index_t storage, remove_flags_t options
    │ │ │ │ +      , std::function<void(storage_error const&)> handler) = 0;
    │ │ │ │ +   virtual void async_set_file_priority (storage_index_t storage
    │ │ │ │ +      , aux::vector<download_priority_t, file_index_t> prio
    │ │ │ │ +      , std::function<void(storage_error const&
    │ │ │ │ +      , aux::vector<download_priority_t, file_index_t>)> handler) = 0;
    │ │ │ │ +   virtual void async_clear_piece (storage_index_t storage, piece_index_t index
    │ │ │ │ +      , std::function<void(piece_index_t)> handler) = 0;
    │ │ │ │ +   virtual void update_stats_counters (counters& c) const = 0;
    │ │ │ │ +   virtual std::vector<open_file_state> get_status (storage_index_t) const = 0;
    │ │ │ │ +   virtual void abort (bool wait) = 0;
    │ │ │ │ +   virtual void submit_jobs () = 0;
    │ │ │ │ +   virtual void settings_updated () = 0;
    │ │ │ │ +
    │ │ │ │ +   static constexpr disk_job_flags_t force_copy  = 0_bit;
    │ │ │ │ +   static constexpr disk_job_flags_t sequential_access  = 3_bit;
    │ │ │ │ +   static constexpr disk_job_flags_t volatile_read  = 4_bit;
    │ │ │ │ +   static constexpr disk_job_flags_t v1_hash  = 5_bit;
    │ │ │ │ +   static constexpr disk_job_flags_t flush_piece  = 7_bit;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +

    new_torrent()

    │ │ │ │ +
    │ │ │ │ +virtual storage_holder new_torrent (storage_params const& p
    │ │ │ │ +      , std::shared_ptr<void> const& torrent) = 0;
    │ │ │ │ +
    │ │ │ │ +

    this is called when a new torrent is added. The shared_ptr can be │ │ │ │ +used to hold the internal torrent object alive as long as there are │ │ │ │ +outstanding disk operations on the storage. │ │ │ │ +The returned storage_holder is an owning reference to the underlying │ │ │ │ +storage that was just created. It is fundamentally a storage_index_t

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    remove_torrent()

    │ │ │ │ +
    │ │ │ │ +virtual void remove_torrent (storage_index_t) = 0;
    │ │ │ │ +
    │ │ │ │ +

    remove the storage with the specified index. This is not expected to │ │ │ │ +delete any files from disk, just to clean up any resources associated │ │ │ │ +with the specified storage.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    async_write() async_read()

    │ │ │ │ +
    │ │ │ │ +virtual bool async_write (storage_index_t storage, peer_request const& r
    │ │ │ │ +      , char const* buf, std::shared_ptr<disk_observer> o
    │ │ │ │ +      , std::function<void(storage_error const&)> handler
    │ │ │ │ +      , disk_job_flags_t flags = {}) = 0;
    │ │ │ │ +virtual void async_read (storage_index_t storage, peer_request const& r
    │ │ │ │ +      , std::function<void(disk_buffer_holder, storage_error const&)> handler
    │ │ │ │ +      , disk_job_flags_t flags = {}) = 0;
    │ │ │ │ +
    │ │ │ │ +

    perform a read or write operation from/to the specified storage │ │ │ │ +index and the specified request. When the operation completes, call │ │ │ │ +handler possibly with a disk_buffer_holder, holding the buffer with │ │ │ │ +the result. Flags may be set to affect the read operation. See │ │ │ │ +disk_job_flags_t.

    │ │ │ │ +

    The disk_observer is a callback to indicate that │ │ │ │ +the store buffer/disk write queue is below the watermark to let peers │ │ │ │ +start writing buffers to disk again. When async_write() returns │ │ │ │ +true, indicating the write queue is full, the peer will stop │ │ │ │ +further writes and wait for the passed-in disk_observer to be │ │ │ │ +notified before resuming.

    │ │ │ │ +

    Note that for async_read, the peer_request (r) is not │ │ │ │ +necessarily aligned to blocks (but it is most of the time). However, │ │ │ │ +all writes (passed to async_write) are guaranteed to be block │ │ │ │ +aligned.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    async_hash()

    │ │ │ │ +
    │ │ │ │ +virtual void async_hash (storage_index_t storage, piece_index_t piece, span<sha256_hash> v2
    │ │ │ │ +      , disk_job_flags_t flags
    │ │ │ │ +      , std::function<void(piece_index_t, sha1_hash const&, storage_error const&)> handler) = 0;
    │ │ │ │ +
    │ │ │ │ +

    Compute hash(es) for the specified piece. Unless the v1_hash flag is │ │ │ │ +set (in flags), the SHA-1 hash of the whole piece does not need │ │ │ │ +to be computed.

    │ │ │ │ +

    The v2 span is optional and can be empty, which means v2 hashes │ │ │ │ +should not be computed. If v2 is non-empty it must be at least large │ │ │ │ +enough to hold all v2 blocks in the piece, and this function will │ │ │ │ +fill in the span with the SHA-256 block hashes of the piece.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    async_hash2()

    │ │ │ │ +
    │ │ │ │ +virtual void async_hash2 (storage_index_t storage, piece_index_t piece, int offset, disk_job_flags_t flags
    │ │ │ │ +      , std::function<void(piece_index_t, sha256_hash const&, storage_error const&)> handler) = 0;
    │ │ │ │ +
    │ │ │ │ +

    computes the v2 hash (SHA-256) of a single block. The block at │ │ │ │ +offset in piece piece.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    async_move_storage()

    │ │ │ │ +
    │ │ │ │ +virtual void async_move_storage (storage_index_t storage, std::string p, move_flags_t flags
    │ │ │ │ +      , std::function<void(status_t, std::string const&, storage_error const&)> handler) = 0;
    │ │ │ │ +
    │ │ │ │ +

    called to request the files for the specified storage/torrent be │ │ │ │ +moved to a new location. It is the disk I/O object's responsibility │ │ │ │ +to synchronize this with any currently outstanding disk operations to │ │ │ │ +the storage. Whether files are replaced at the destination path or │ │ │ │ +not is controlled by flags (see move_flags_t).

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    async_release_files()

    │ │ │ │ +
    │ │ │ │ +virtual void async_release_files (storage_index_t storage
    │ │ │ │ +      , std::function<void()> handler = std::function<void()>()) = 0;
    │ │ │ │ +
    │ │ │ │ +

    This is called on disk I/O objects to request they close all open │ │ │ │ +files for the specified storage/torrent. If file handles are not │ │ │ │ +pooled/cached, it can be a no-op. For truly asynchronous disk I/O, │ │ │ │ +this should provide at least one point in time when all files are │ │ │ │ +closed. It is possible that later asynchronous operations will │ │ │ │ +re-open some of the files, by the time this completion handler is │ │ │ │ +called, that's fine.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    async_check_files()

    │ │ │ │ +
    │ │ │ │ +virtual void async_check_files (storage_index_t storage
    │ │ │ │ +      , add_torrent_params const* resume_data
    │ │ │ │ +      , aux::vector<std::string, file_index_t> links
    │ │ │ │ +      , std::function<void(status_t, storage_error const&)> handler) = 0;
    │ │ │ │ +
    │ │ │ │ +

    this is called when torrents are added to validate their resume data │ │ │ │ +against the files on disk. This function is expected to do a few things:

    │ │ │ │ +

    if links is non-empty, it contains a string for each file in the │ │ │ │ +torrent. The string being a path to an existing identical file. The │ │ │ │ +default behavior is to create hard links of those files into the │ │ │ │ +storage of the new torrent (specified by storage). An empty │ │ │ │ +string indicates that there is no known identical file. This is part │ │ │ │ +of the "mutable torrent" feature, where files can be reused from │ │ │ │ +other torrents.

    │ │ │ │ +

    The resume_data points the resume data passed in by the client.

    │ │ │ │ +

    If the resume_data->flags field has the seed_mode flag set, all │ │ │ │ +files/pieces are expected to be on disk already. This should be │ │ │ │ +verified. Not just the existence of the file, but also that it has │ │ │ │ +the correct size.

    │ │ │ │ +

    Any file with a piece set in the resume_data->have_pieces bitmask │ │ │ │ +should exist on disk, this should be verified. Pad files and files │ │ │ │ +with zero priority may be skipped.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    async_stop_torrent()

    │ │ │ │ +
    │ │ │ │ +virtual void async_stop_torrent (storage_index_t storage
    │ │ │ │ +      , std::function<void()> handler = std::function<void()>()) = 0;
    │ │ │ │ +
    │ │ │ │ +

    This is called when a torrent is stopped. It gives the disk I/O │ │ │ │ +object an opportunity to flush any data to disk that's currently kept │ │ │ │ +cached. This function should at least do the same thing as │ │ │ │ +async_release_files().

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    async_rename_file()

    │ │ │ │ +
    │ │ │ │ +virtual void async_rename_file (storage_index_t storage
    │ │ │ │ +      , file_index_t index, std::string name
    │ │ │ │ +      , std::function<void(std::string const&, file_index_t, storage_error const&)> handler) = 0;
    │ │ │ │ +
    │ │ │ │ +

    This function is called when the name of a file in the specified │ │ │ │ +storage has been requested to be renamed. The disk I/O object is │ │ │ │ +responsible for renaming the file without racing with other │ │ │ │ +potentially outstanding operations against the file (such as read, │ │ │ │ +write, move, etc.).

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    async_delete_files()

    │ │ │ │ +
    │ │ │ │ +virtual void async_delete_files (storage_index_t storage, remove_flags_t options
    │ │ │ │ +      , std::function<void(storage_error const&)> handler) = 0;
    │ │ │ │ +
    │ │ │ │ +

    This function is called when some file(s) on disk have been requested │ │ │ │ +to be removed by the client. storage indicates which torrent is │ │ │ │ +referred to. See session_handle for remove_flags_t flags │ │ │ │ +indicating which files are to be removed. │ │ │ │ +e.g. session_handle::delete_files - delete all files │ │ │ │ +session_handle::delete_partfile - only delete part file.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    async_set_file_priority()

    │ │ │ │ +
    │ │ │ │ +virtual void async_set_file_priority (storage_index_t storage
    │ │ │ │ +      , aux::vector<download_priority_t, file_index_t> prio
    │ │ │ │ +      , std::function<void(storage_error const&
    │ │ │ │ +      , aux::vector<download_priority_t, file_index_t>)> handler) = 0;
    │ │ │ │ +
    │ │ │ │ +

    This is called to set the priority of some or all files. Changing the │ │ │ │ +priority from or to 0 may involve moving data to and from the │ │ │ │ +partfile. The disk I/O object is responsible for correctly │ │ │ │ +synchronizing this work to not race with any potentially outstanding │ │ │ │ +asynchronous operations affecting these files.

    │ │ │ │ +

    prio is a vector of the file priority for all files. If it's │ │ │ │ +shorter than the total number of files in the torrent, they are │ │ │ │ +assumed to be set to the default priority.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    async_clear_piece()

    │ │ │ │ +
    │ │ │ │ +virtual void async_clear_piece (storage_index_t storage, piece_index_t index
    │ │ │ │ +      , std::function<void(piece_index_t)> handler) = 0;
    │ │ │ │ +
    │ │ │ │ +

    This is called when a piece fails the hash check, to ensure there are │ │ │ │ +no outstanding disk operations to the piece before blocks are │ │ │ │ +re-requested from peers to overwrite the existing blocks. The disk I/O │ │ │ │ +object does not need to perform any action other than synchronize │ │ │ │ +with all outstanding disk operations to the specified piece before │ │ │ │ +posting the result back.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    update_stats_counters()

    │ │ │ │ +
    │ │ │ │ +virtual void update_stats_counters (counters& c) const = 0;
    │ │ │ │ +
    │ │ │ │ +

    update_stats_counters() is called to give the disk storage an │ │ │ │ +opportunity to update gauges in the c stats counters, that aren't │ │ │ │ +updated continuously as operations are performed. This is called │ │ │ │ +before a snapshot of the counters are passed to the client.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    get_status()

    │ │ │ │ +
    │ │ │ │ +virtual std::vector<open_file_state> get_status (storage_index_t) const = 0;
    │ │ │ │ +
    │ │ │ │ +

    Return a list of all the files that are currently open for the │ │ │ │ +specified storage/torrent. This is is just used for the client to │ │ │ │ +query the currently open files, and which modes those files are open │ │ │ │ +in.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    abort()

    │ │ │ │ +
    │ │ │ │ +virtual void abort (bool wait) = 0;
    │ │ │ │ +
    │ │ │ │ +

    this is called when the session is starting to shut down. The disk │ │ │ │ +I/O object is expected to flush any outstanding write jobs, cancel │ │ │ │ +hash jobs and initiate tearing down of any internal threads. If │ │ │ │ +wait is true, this should be asynchronous. i.e. this call should │ │ │ │ +not return until all threads have stopped and all jobs have either │ │ │ │ +been aborted or completed and the disk I/O object is ready to be │ │ │ │ +destructed.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    submit_jobs()

    │ │ │ │ +
    │ │ │ │ +virtual void submit_jobs () = 0;
    │ │ │ │ +
    │ │ │ │ +

    This will be called after a batch of disk jobs has been issues (via │ │ │ │ +the async_* ). It gives the disk I/O object an opportunity to │ │ │ │ +notify any potential condition variables to wake up the disk │ │ │ │ +thread(s). The async_* calls can of course also notify condition │ │ │ │ +variables, but doing it in this call allows for batching jobs, by │ │ │ │ +issuing the notification once for a collection of jobs.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    settings_updated()

    │ │ │ │ +
    │ │ │ │ +virtual void settings_updated () = 0;
    │ │ │ │ +
    │ │ │ │ +

    This is called to notify the disk I/O object that the settings have │ │ │ │ +been updated. In the disk io constructor, a settings_interface │ │ │ │ +reference is passed in. Whenever these settings are updated, this │ │ │ │ +function is called to allow the disk I/O object to react to any │ │ │ │ +changed settings relevant to its operations.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    force_copy
    │ │ │ │ +
    force making a copy of the cached block, rather than getting a │ │ │ │ +reference to a block already in the cache. This is used the block is │ │ │ │ +expected to be overwritten very soon, by async_write()`, and we need │ │ │ │ +access to the previous content.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    sequential_access
    │ │ │ │ +
    hint that there may be more disk operations with sequential access to │ │ │ │ +the file
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    volatile_read
    │ │ │ │ +
    don't keep the read block in cache. This is a hint that this block is │ │ │ │ +unlikely to be read again anytime soon, and caching it would be │ │ │ │ +wasteful.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    v1_hash
    │ │ │ │ +
    compute a v1 piece hash. This is only used by the async_hash() call. │ │ │ │ +If this flag is not set in the async_hash() call, the SHA-1 piece │ │ │ │ +hash does not need to be computed.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    flush_piece
    │ │ │ │ +
    this flag instructs a hash job that we just completed this piece, and │ │ │ │ +it should be flushed to disk
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    storage_holder

    │ │ │ │ +

    Declared in "libtorrent/disk_interface.hpp"

    │ │ │ │ +

    a unique, owning, reference to the storage of a torrent in a disk io │ │ │ │ +subsystem (class that implements disk_interface). This is held by the │ │ │ │ +internal libtorrent torrent object to tie the storage object allocated │ │ │ │ +for a torrent to the lifetime of the internal torrent object. When a │ │ │ │ +torrent is removed from the session, this holder is destructed and will │ │ │ │ +inform the disk object.

    │ │ │ │ +
    │ │ │ │ +struct storage_holder
    │ │ │ │ +{
    │ │ │ │ +   storage_holder (storage_index_t idx, disk_interface& disk_io);
    │ │ │ │ +   ~storage_holder ();
    │ │ │ │ +   storage_holder () = default;
    │ │ │ │ +   explicit operator bool () const;
    │ │ │ │ +   operator storage_index_t () const;
    │ │ │ │ +   void reset ();
    │ │ │ │ +   storage_holder& operator= (storage_holder const&) = delete;
    │ │ │ │ +   storage_holder (storage_holder const&) = delete;
    │ │ │ │ +   storage_holder (storage_holder&& rhs) noexcept;
    │ │ │ │ +   storage_holder& operator= (storage_holder&& rhs) noexcept;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    buffer_allocator_interface

    │ │ │ │ +

    Declared in "libtorrent/disk_buffer_holder.hpp"

    │ │ │ │ +

    the interface for freeing disk buffers, used by the disk_buffer_holder. │ │ │ │ +when implementing disk_interface, this must also be implemented in order │ │ │ │ +to return disk buffers back to libtorrent

    │ │ │ │ +
    │ │ │ │ +struct buffer_allocator_interface
    │ │ │ │ +{
    │ │ │ │ +   virtual void free_disk_buffer (char* b) = 0;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    disk_buffer_holder

    │ │ │ │ +

    Declared in "libtorrent/disk_buffer_holder.hpp"

    │ │ │ │ +

    The disk buffer holder acts like a unique_ptr that frees a disk buffer │ │ │ │ +when it's destructed

    │ │ │ │ +

    If this buffer holder is moved-from, default constructed or reset, │ │ │ │ +data() will return nullptr.

    │ │ │ │ +
    │ │ │ │ +struct disk_buffer_holder
    │ │ │ │ +{
    │ │ │ │ +   disk_buffer_holder& operator= (disk_buffer_holder&&) & noexcept;
    │ │ │ │ +   disk_buffer_holder (disk_buffer_holder&&) noexcept;
    │ │ │ │ +   disk_buffer_holder (disk_buffer_holder const&) = delete;
    │ │ │ │ +   disk_buffer_holder& operator= (disk_buffer_holder const&) = delete;
    │ │ │ │ +   disk_buffer_holder (buffer_allocator_interface& alloc
    │ │ │ │ +      , char* buf, int sz) noexcept;
    │ │ │ │ +   disk_buffer_holder () noexcept = default;
    │ │ │ │ +   ~disk_buffer_holder ();
    │ │ │ │ +   char* data () const noexcept;
    │ │ │ │ +   void reset ();
    │ │ │ │ +   void swap (disk_buffer_holder& h) noexcept;
    │ │ │ │ +   bool is_mutable () const noexcept;
    │ │ │ │ +   explicit operator bool () const noexcept;
    │ │ │ │ +   std::ptrdiff_t size () const;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +

    disk_buffer_holder()

    │ │ │ │ +
    │ │ │ │ +disk_buffer_holder (buffer_allocator_interface& alloc
    │ │ │ │ +      , char* buf, int sz) noexcept;
    │ │ │ │ +
    │ │ │ │ +

    construct a buffer holder that will free the held buffer │ │ │ │ +using a disk buffer pool directly (there's only one │ │ │ │ +disk_buffer_pool per session)

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    disk_buffer_holder()

    │ │ │ │ +
    │ │ │ │ +disk_buffer_holder () noexcept = default;
    │ │ │ │ +
    │ │ │ │ +

    default construct a holder that does not own any buffer

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    ~disk_buffer_holder()

    │ │ │ │ +
    │ │ │ │ +~disk_buffer_holder ();
    │ │ │ │ +
    │ │ │ │ +

    frees disk buffer held by this object

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    data()

    │ │ │ │ +
    │ │ │ │ +char* data () const noexcept;
    │ │ │ │ +
    │ │ │ │ +

    return a pointer to the held buffer, if any. Otherwise returns nullptr.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    reset()

    │ │ │ │ +
    │ │ │ │ +void reset ();
    │ │ │ │ +
    │ │ │ │ +

    free the held disk buffer, if any, and clear the holder. This sets the │ │ │ │ +holder object to a default-constructed state

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    swap()

    │ │ │ │ +
    │ │ │ │ +void swap (disk_buffer_holder& h) noexcept;
    │ │ │ │ +
    │ │ │ │ +

    swap pointers of two disk buffer holders.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    is_mutable()

    │ │ │ │ +
    │ │ │ │ +bool is_mutable () const noexcept;
    │ │ │ │ +
    │ │ │ │ +

    if this returns true, the buffer may not be modified in place

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    bool()

    │ │ │ │ +
    │ │ │ │ +explicit operator bool () const noexcept;
    │ │ │ │ +
    │ │ │ │ +

    implicitly convertible to true if the object is currently holding a │ │ │ │ +buffer

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    settings_interface

    │ │ │ │ +

    Declared in "libtorrent/settings_pack.hpp"

    │ │ │ │ +

    the common interface to settings_pack and the internal representation of │ │ │ │ +settings.

    │ │ │ │ +
    │ │ │ │ +struct settings_interface
    │ │ │ │ +{
    │ │ │ │ +   virtual void set_int (int name, int val) = 0;
    │ │ │ │ +   virtual bool has_val (int name) const = 0;
    │ │ │ │ +   virtual void set_str (int name, std::string val) = 0;
    │ │ │ │ +   virtual void set_bool (int name, bool val) = 0;
    │ │ │ │ +   virtual bool get_bool (int name) const = 0;
    │ │ │ │ +   virtual int get_int (int name) const = 0;
    │ │ │ │ +   virtual std::string const& get_str (int name) const = 0;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    file_open_mode_t

    │ │ │ │ +

    Declared in "libtorrent/disk_interface.hpp"

    │ │ │ │ +
    │ │ │ │ +
    read_only
    │ │ │ │ +
    open the file for reading only
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    write_only
    │ │ │ │ +
    open the file for writing only
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    read_write
    │ │ │ │ +
    open the file for reading and writing
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    rw_mask
    │ │ │ │ +
    the mask for the bits determining read or write mode
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    sparse
    │ │ │ │ +
    open the file in sparse mode (if supported by the │ │ │ │ +filesystem).
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    int

    │ │ │ │ -

    Declared in "libtorrent/alert_types.hpp"

    │ │ │ │ -
    │ │ │ │ -
    user_alert_id
    │ │ │ │ -
    user defined alerts should use IDs greater than this
    │ │ │ │ +
    │ │ │ │ +
    no_atime
    │ │ │ │ +
    don't update the access timestamps on the file (if │ │ │ │ +supported by the operating system and filesystem). │ │ │ │ +this generally improves disk performance.
    │ │ │ │
    │ │ │ │ -
    │ │ │ │ -
    num_alert_types
    │ │ │ │ -
    this constant represents "max_alert_index" + 1
    │ │ │ │ +
    │ │ │ │ +
    random_access
    │ │ │ │ +
    When this is not set, the kernel is hinted that access to this file will │ │ │ │ +be made sequentially.
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    mmapped
    │ │ │ │ +
    the file is memory mapped
    │ │ │ │
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    storage_params

    │ │ │ │

    Declared in "libtorrent/storage_defs.hpp"

    │ │ │ │

    a parameter pack used to construct the storage for a torrent, used in │ │ │ │ disk_interface

    │ │ │ │ @@ -9795,62 +8173,62 @@ │ │ │ │ std::vector<file_slice> map_block (piece_index_t piece, std::int64_t offset │ │ │ │ , std::int64_t size) const; │ │ │ │ peer_request map_file (file_index_t file, std::int64_t offset, int size) const; │ │ │ │ int num_files () const noexcept; │ │ │ │ file_index_t end_file () const noexcept; │ │ │ │ index_range<file_index_t> file_range () const noexcept; │ │ │ │ std::int64_t total_size () const; │ │ │ │ - void set_num_pieces (int n); │ │ │ │ int num_pieces () const; │ │ │ │ + void set_num_pieces (int n); │ │ │ │ piece_index_t end_piece () const; │ │ │ │ piece_index_t last_piece () const; │ │ │ │ index_range<piece_index_t> piece_range () const noexcept; │ │ │ │ - int piece_length () const; │ │ │ │ void set_piece_length (int l); │ │ │ │ + int piece_length () const; │ │ │ │ int piece_size (piece_index_t index) const; │ │ │ │ int piece_size2 (piece_index_t index) const; │ │ │ │ int blocks_in_piece2 (piece_index_t index) const; │ │ │ │ int blocks_per_piece () const; │ │ │ │ - void set_name (std::string const& n); │ │ │ │ std::string const& name () const; │ │ │ │ + void set_name (std::string const& n); │ │ │ │ void swap (file_storage& ti) noexcept; │ │ │ │ void canonicalize (); │ │ │ │ - bool pad_file_at (file_index_t index) const; │ │ │ │ - string_view file_name (file_index_t index) const; │ │ │ │ - std::time_t mtime (file_index_t index) const; │ │ │ │ - char const* root_ptr (file_index_t const index) const; │ │ │ │ - sha1_hash hash (file_index_t index) const; │ │ │ │ sha256_hash root (file_index_t index) const; │ │ │ │ - std::int64_t file_offset (file_index_t index) const; │ │ │ │ std::string symlink (file_index_t index) const; │ │ │ │ + char const* root_ptr (file_index_t const index) const; │ │ │ │ + std::int64_t file_offset (file_index_t index) const; │ │ │ │ + bool pad_file_at (file_index_t index) const; │ │ │ │ std::int64_t file_size (file_index_t index) const; │ │ │ │ + sha1_hash hash (file_index_t index) const; │ │ │ │ + string_view file_name (file_index_t index) const; │ │ │ │ std::string file_path (file_index_t index, std::string const& save_path = "") const; │ │ │ │ - int file_num_blocks (file_index_t index) const; │ │ │ │ - index_range<piece_index_t::diff_type> file_piece_range (file_index_t) const; │ │ │ │ + std::time_t mtime (file_index_t index) const; │ │ │ │ int file_num_pieces (file_index_t index) const; │ │ │ │ - int file_first_block_node (file_index_t index) const; │ │ │ │ + index_range<piece_index_t::diff_type> file_piece_range (file_index_t) const; │ │ │ │ + int file_num_blocks (file_index_t index) const; │ │ │ │ int file_first_piece_node (file_index_t index) const; │ │ │ │ + int file_first_block_node (file_index_t index) const; │ │ │ │ std::uint32_t file_path_hash (file_index_t index, std::string const& save_path) const; │ │ │ │ void all_path_hashes (std::unordered_set<std::uint32_t>& table) const; │ │ │ │ file_flags_t file_flags (file_index_t index) const; │ │ │ │ bool file_absolute_path (file_index_t index) const; │ │ │ │ - file_index_t file_index_at_piece (piece_index_t piece) const; │ │ │ │ file_index_t file_index_at_offset (std::int64_t offset) const; │ │ │ │ + file_index_t file_index_at_piece (piece_index_t piece) const; │ │ │ │ file_index_t file_index_for_root (sha256_hash const& root_hash) const; │ │ │ │ piece_index_t piece_index_at_file (file_index_t f) const; │ │ │ │ void sanitize_symlinks (); │ │ │ │ bool v2 () const; │ │ │ │ │ │ │ │ static constexpr file_flags_t flag_pad_file = 0_bit; │ │ │ │ static constexpr file_flags_t flag_hidden = 1_bit; │ │ │ │ static constexpr file_flags_t flag_executable = 2_bit; │ │ │ │ static constexpr file_flags_t flag_symlink = 3_bit; │ │ │ │ }; │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ +[report issue]
    │ │ │ │

    is_valid()

    │ │ │ │
    │ │ │ │  bool is_valid () const;
    │ │ │ │  
    │ │ │ │

    returns true if the piece length has been initialized │ │ │ │ on the file_storage. This is typically taken as a proxy │ │ │ │ of whether the file_storage as a whole is initialized or │ │ │ │ @@ -9860,18 +8238,18 @@ │ │ │ │

    reserve()

    │ │ │ │
    │ │ │ │  void reserve (int num_files);
    │ │ │ │  
    │ │ │ │

    allocates space for num_files in the internal file list. This can │ │ │ │ be used to avoid reallocating the internal file list when the number │ │ │ │ of files to be added is known up-front.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    add_file() add_file_borrow()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    add_file_borrow() add_file()

    │ │ │ │
    │ │ │ │  void add_file_borrow (error_code& ec, string_view filename
    │ │ │ │        , std::string const& path, std::int64_t file_size
    │ │ │ │        , file_flags_t file_flags = {}, char const* filehash = nullptr
    │ │ │ │        , std::int64_t mtime = 0, string_view symlink_path = string_view()
    │ │ │ │        , char const* root_hash = nullptr);
    │ │ │ │  void add_file (error_code& ec, std::string const& path, std::int64_t file_size
    │ │ │ │ @@ -9924,50 +8302,50 @@
    │ │ │ │  the same root directory.

    │ │ │ │

    That is, the first path element of all files must be the same. │ │ │ │ This shared path element is also set to the name of the torrent. It │ │ │ │ can be changed by calling set_name.

    │ │ │ │

    The overloads that take an error_code reference will report failures │ │ │ │ via that variable, otherwise system_error is thrown.

    │ │ │ │ [report issue]
    │ │ │ │ -
    │ │ │ │ +
    │ │ │ │

    rename_file()

    │ │ │ │
    │ │ │ │  void rename_file (file_index_t index, std::string const& new_filename);
    │ │ │ │  
    │ │ │ │

    renames the file at index to new_filename. Keep in mind │ │ │ │ that filenames are expected to be UTF-8 encoded.

    │ │ │ │ [report issue]
    │ │ │ │ -
    │ │ │ │ +
    │ │ │ │

    map_block()

    │ │ │ │
    │ │ │ │  std::vector<file_slice> map_block (piece_index_t piece, std::int64_t offset
    │ │ │ │        , std::int64_t size) const;
    │ │ │ │  
    │ │ │ │

    returns a list of file_slice objects representing the portions of │ │ │ │ files the specified piece index, byte offset and size range overlaps. │ │ │ │ -this is the inverse mapping of map_file().

    │ │ │ │ +this is the inverse mapping of map_file().

    │ │ │ │

    Preconditions of this function is that the input range is within the │ │ │ │ torrents address space. piece may not be negative and

    │ │ │ │
    │ │ │ │ piece * piece_size + offset + size
    │ │ │ │

    may not exceed the total size of the torrent.

    │ │ │ │ [report issue]
    │ │ │ │ -
    │ │ │ │ +
    │ │ │ │

    map_file()

    │ │ │ │
    │ │ │ │  peer_request map_file (file_index_t file, std::int64_t offset, int size) const;
    │ │ │ │  
    │ │ │ │

    returns a peer_request representing the piece index, byte offset │ │ │ │ and size the specified file range overlaps. This is the inverse │ │ │ │ -mapping over map_block(). Note that the peer_request return type │ │ │ │ +mapping over map_block(). Note that the peer_request return type │ │ │ │ is meant to hold bittorrent block requests, which may not be larger │ │ │ │ than 16 kiB. Mapping a range larger than that may return an overflown │ │ │ │ integer.

    │ │ │ │ [report issue]
    │ │ │ │ -
    │ │ │ │ +
    │ │ │ │

    num_files()

    │ │ │ │
    │ │ │ │  int num_files () const noexcept;
    │ │ │ │  
    │ │ │ │

    returns the number of files in the file_storage

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │ @@ -9982,27 +8360,27 @@ │ │ │ │
    │ │ │ │  index_range<file_index_t> file_range () const noexcept;
    │ │ │ │  
    │ │ │ │

    returns an implementation-defined type that can be used as the │ │ │ │ container in a range-for loop. Where the values are the indices of all │ │ │ │ files in the file_storage.

    │ │ │ │ [report issue]
    │ │ │ │ -
    │ │ │ │ +
    │ │ │ │

    total_size()

    │ │ │ │
    │ │ │ │  std::int64_t total_size () const;
    │ │ │ │  
    │ │ │ │

    returns the total number of bytes all the files in this torrent spans

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_num_pieces() num_pieces()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    num_pieces() set_num_pieces()

    │ │ │ │
    │ │ │ │ -void set_num_pieces (int n);
    │ │ │ │  int num_pieces () const;
    │ │ │ │ +void set_num_pieces (int n);
    │ │ │ │  
    │ │ │ │

    set and get the number of pieces in the torrent

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    end_piece()

    │ │ │ │
    │ │ │ │  piece_index_t end_piece () const;
    │ │ │ │ @@ -10027,26 +8405,26 @@
    │ │ │ │  container in a range-for loop. Where the values are the indices of all
    │ │ │ │  pieces in the file_storage.

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    set_piece_length() piece_length()

    │ │ │ │
    │ │ │ │ -int piece_length () const;
    │ │ │ │  void set_piece_length (int l);
    │ │ │ │ +int piece_length () const;
    │ │ │ │  
    │ │ │ │

    set and get the size of each piece in this torrent. It must be a power of two │ │ │ │ and at least 16 kiB.

    │ │ │ │ [report issue]
    │ │ │ │ -
    │ │ │ │ +
    │ │ │ │

    piece_size()

    │ │ │ │
    │ │ │ │  int piece_size (piece_index_t index) const;
    │ │ │ │  
    │ │ │ │ -

    returns the piece size of index. This will be the same as piece_length(), except │ │ │ │ +

    returns the piece size of index. This will be the same as piece_length(), except │ │ │ │ for the last piece, which may be shorter.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    piece_size2()

    │ │ │ │
    │ │ │ │  int piece_size2 (piece_index_t index) const;
    │ │ │ │  
    │ │ │ │ @@ -10058,28 +8436,28 @@ │ │ │ │
    │ │ │ │

    blocks_in_piece2()

    │ │ │ │
    │ │ │ │  int blocks_in_piece2 (piece_index_t index) const;
    │ │ │ │  
    │ │ │ │

    returns the number of blocks in the specified piece, for v2 torrents.

    │ │ │ │ [report issue]
    │ │ │ │ -
    │ │ │ │ +
    │ │ │ │

    blocks_per_piece()

    │ │ │ │
    │ │ │ │  int blocks_per_piece () const;
    │ │ │ │  
    │ │ │ │

    returns the number of blocks there are in the typical piece. There │ │ │ │ may be fewer in the last piece)

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    set_name() name()

    │ │ │ │
    │ │ │ │ -void set_name (std::string const& n);
    │ │ │ │  std::string const& name () const;
    │ │ │ │ +void set_name (std::string const& n);
    │ │ │ │  
    │ │ │ │

    set and get the name of this torrent. For multi-file torrents, this is also │ │ │ │ the name of the root directory all the files are stored in.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    swap()

    │ │ │ │
    │ │ │ │ @@ -10090,37 +8468,37 @@
    │ │ │ │  
    │ │ │ │

    canonicalize()

    │ │ │ │
    │ │ │ │  void canonicalize ();
    │ │ │ │  
    │ │ │ │

    arrange files and padding to match the canonical form required │ │ │ │ by BEP 52

    │ │ │ │ - │ │ │ │ - │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ - │ │ │ │ + │ │ │ │ -
    │ │ │ │ -

    file_num_blocks() file_piece_range() file_num_pieces()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    file_piece_range() file_num_blocks() file_num_pieces()

    │ │ │ │
    │ │ │ │ -int file_num_blocks (file_index_t index) const;
    │ │ │ │ -index_range<piece_index_t::diff_type> file_piece_range (file_index_t) const;
    │ │ │ │  int file_num_pieces (file_index_t index) const;
    │ │ │ │ +index_range<piece_index_t::diff_type> file_piece_range (file_index_t) const;
    │ │ │ │ +int file_num_blocks (file_index_t index) const;
    │ │ │ │  
    │ │ │ │

    Returns the number of pieces or blocks the file at index spans, │ │ │ │ under the assumption that the file is aligned to the start of a piece. │ │ │ │ This is only meaningful for v2 torrents, where files are guaranteed │ │ │ │ such alignment. │ │ │ │ These numbers are used to size and navigate the merkle hash tree for │ │ │ │ each file.

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    file_first_block_node() file_first_piece_node()

    │ │ │ │
    │ │ │ │ -int file_first_block_node (file_index_t index) const;
    │ │ │ │  int file_first_piece_node (file_index_t index) const;
    │ │ │ │ +int file_first_block_node (file_index_t index) const;
    │ │ │ │  
    │ │ │ │

    index of first piece node in the merkle tree

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    file_path_hash()

    │ │ │ │
    │ │ │ │  std::uint32_t file_path_hash (file_index_t index, std::string const& save_path) const;
    │ │ │ │ @@ -10204,16 +8582,16 @@
    │ │ │ │  have an absolute path, i.e. is not anchored in the save path of the
    │ │ │ │  torrent.

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    file_index_at_offset() file_index_at_piece()

    │ │ │ │
    │ │ │ │ -file_index_t file_index_at_piece (piece_index_t piece) const;
    │ │ │ │  file_index_t file_index_at_offset (std::int64_t offset) const;
    │ │ │ │ +file_index_t file_index_at_piece (piece_index_t piece) const;
    │ │ │ │  
    │ │ │ │

    returns the index of the file at the given offset in the torrent

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    file_index_for_root()

    │ │ │ │
    │ │ │ │  file_index_t file_index_for_root (sha256_hash const& root_hash) const;
    │ │ │ │ @@ -10259,57 +8637,57 @@
    │ │ │ │  
    this file has the executable attribute set.
    │ │ │ │
    │ │ │ │ [report issue]
    │ │ │ │
    flag_symlink
    │ │ │ │
    this file is a symbolic link. It should have a link │ │ │ │ target string associated with it.
    │ │ │ │
    │ │ │ │ -[report issue] │ │ │ │ +[report issue] │ │ │ │ │ │ │ │ +
    │ │ │ │ +

    mmap_disk_io_constructor()

    │ │ │ │ +

    Declared in "libtorrent/mmap_disk_io.hpp"

    │ │ │ │ +
    │ │ │ │ +std::unique_ptr<disk_interface> mmap_disk_io_constructor (
    │ │ │ │ +   io_context& ios, settings_interface const&, counters& cnt);
    │ │ │ │ +
    │ │ │ │ +

    constructs a memory mapped file disk I/O object.

    │ │ │ │ +[report issue]
    │ │ │ │
    │ │ │ │

    default_disk_io_constructor()

    │ │ │ │

    Declared in "libtorrent/session.hpp"

    │ │ │ │
    │ │ │ │  std::unique_ptr<disk_interface> default_disk_io_constructor (
    │ │ │ │     io_context& ios, settings_interface const&, counters& cnt);
    │ │ │ │  
    │ │ │ │

    the constructor function for the default storage. On systems that support │ │ │ │ memory mapped files (and a 64 bit address space) the memory mapped storage │ │ │ │ will be constructed, otherwise the portable posix storage.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    posix_disk_io_constructor()

    │ │ │ │ -

    Declared in "libtorrent/posix_disk_io.hpp"

    │ │ │ │ -
    │ │ │ │ -std::unique_ptr<disk_interface> posix_disk_io_constructor (
    │ │ │ │ -   io_context& ios, settings_interface const&, counters& cnt);
    │ │ │ │ -
    │ │ │ │ -

    this is a simple posix disk I/O back-end, used for systems that don't │ │ │ │ -have a 64 bit virtual address space or don't support memory mapped files. │ │ │ │ -It's implemented using portable C file functions and is single-threaded.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    disabled_disk_io_constructor()

    │ │ │ │

    Declared in "libtorrent/disabled_disk_io.hpp"

    │ │ │ │
    │ │ │ │  std::unique_ptr<disk_interface> disabled_disk_io_constructor (
    │ │ │ │     io_context& ios, settings_interface const&, counters& cnt);
    │ │ │ │  
    │ │ │ │

    creates a disk io object that discards all data written to it, and only │ │ │ │ returns zero-buffers when read from. May be useful for testing and │ │ │ │ benchmarking.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    mmap_disk_io_constructor()

    │ │ │ │ -

    Declared in "libtorrent/mmap_disk_io.hpp"

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    posix_disk_io_constructor()

    │ │ │ │ +

    Declared in "libtorrent/posix_disk_io.hpp"

    │ │ │ │
    │ │ │ │ -std::unique_ptr<disk_interface> mmap_disk_io_constructor (
    │ │ │ │ +std::unique_ptr<disk_interface> posix_disk_io_constructor (
    │ │ │ │     io_context& ios, settings_interface const&, counters& cnt);
    │ │ │ │  
    │ │ │ │ -

    constructs a memory mapped file disk I/O object.

    │ │ │ │ +

    this is a simple posix disk I/O back-end, used for systems that don't │ │ │ │ +have a 64 bit virtual address space or don't support memory mapped files. │ │ │ │ +It's implemented using portable C file functions and is single-threaded.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    enum storage_mode_t

    │ │ │ │

    Declared in "libtorrent/storage_defs.hpp"

    │ │ │ │
    │ │ │ │ │ │ │ │ │ │ │ │ @@ -10423,14 +8801,1079 @@ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
    reset_save_path_unchecked4don't move any source files, just change save path │ │ │ │ and continue working without any checks
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    session_proxy

    │ │ │ │ +

    Declared in "libtorrent/session.hpp"

    │ │ │ │ +

    this is a holder for the internal session implementation object. Once the │ │ │ │ +session destruction is explicitly initiated, this holder is used to │ │ │ │ +synchronize the completion of the shutdown. The lifetime of this object │ │ │ │ +may outlive session, causing the session destructor to not block. The │ │ │ │ +session_proxy destructor will block however, until the underlying session │ │ │ │ +is done shutting down.

    │ │ │ │ +
    │ │ │ │ +struct session_proxy
    │ │ │ │ +{
    │ │ │ │ +   session_proxy& operator= (session_proxy const&) &;
    │ │ │ │ +   session_proxy& operator= (session_proxy&&) & noexcept;
    │ │ │ │ +   session_proxy (session_proxy&&) noexcept;
    │ │ │ │ +   session_proxy ();
    │ │ │ │ +   ~session_proxy ();
    │ │ │ │ +   session_proxy (session_proxy const&);
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    ~session_proxy() session_proxy() operator=()

    │ │ │ │ +
    │ │ │ │ +session_proxy& operator= (session_proxy const&) &;
    │ │ │ │ +session_proxy& operator= (session_proxy&&) & noexcept;
    │ │ │ │ +session_proxy (session_proxy&&) noexcept;
    │ │ │ │ +session_proxy ();
    │ │ │ │ +~session_proxy ();
    │ │ │ │ +session_proxy (session_proxy const&);
    │ │ │ │ +
    │ │ │ │ +

    default constructor, does not refer to any session │ │ │ │ +implementation object.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    session

    │ │ │ │ +

    Declared in "libtorrent/session.hpp"

    │ │ │ │ +

    The session holds all state that spans multiple torrents. Among other │ │ │ │ +things it runs the network loop and manages all torrents. 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.

    │ │ │ │ +

    You have some control over session configuration through the │ │ │ │ +session_handle::apply_settings() member function. To change one or more │ │ │ │ +configuration options, create a settings_pack. object and fill it with │ │ │ │ +the settings to be set and pass it in to session::apply_settings().

    │ │ │ │ +

    see apply_settings().

    │ │ │ │ +
    │ │ │ │ +struct session : session_handle
    │ │ │ │ +{
    │ │ │ │ +   explicit session (session_params const& params);
    │ │ │ │ +   session (session_params&& params, session_flags_t flags);
    │ │ │ │ +   session ();
    │ │ │ │ +   session (session_params const& params, session_flags_t flags);
    │ │ │ │ +   explicit session (session_params&& params);
    │ │ │ │ +   session (session_params&& params, io_context& ios);
    │ │ │ │ +   session (session_params const& params, io_context& ios);
    │ │ │ │ +   session (session_params&& params, io_context& ios, session_flags_t);
    │ │ │ │ +   session (session_params const& params, io_context& ios, session_flags_t);
    │ │ │ │ +   ~session ();
    │ │ │ │ +   session_proxy abort ();
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +

    session()

    │ │ │ │ +
    │ │ │ │ +explicit session (session_params const& params);
    │ │ │ │ +session (session_params&& params, session_flags_t flags);
    │ │ │ │ +session ();
    │ │ │ │ +session (session_params const& params, session_flags_t flags);
    │ │ │ │ +explicit session (session_params&& params);
    │ │ │ │ +
    │ │ │ │ +

    Constructs the session objects which acts as the container of torrents. │ │ │ │ +In order to avoid a race condition between starting the session and │ │ │ │ +configuring it, you can pass in a session_params object. Its settings │ │ │ │ +will take effect before the session starts up.

    │ │ │ │ +

    The overloads taking flags can be used to start a session in │ │ │ │ +paused mode (by passing in session::paused). Note that │ │ │ │ +add_default_plugins do not have an affect on constructors that │ │ │ │ +take a session_params object. It already contains the plugins to use.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    session()

    │ │ │ │ +
    │ │ │ │ +session (session_params&& params, io_context& ios);
    │ │ │ │ +session (session_params const& params, io_context& ios);
    │ │ │ │ +session (session_params&& params, io_context& ios, session_flags_t);
    │ │ │ │ +session (session_params const& params, io_context& ios, session_flags_t);
    │ │ │ │ +
    │ │ │ │ +

    Overload of the constructor that takes an external io_context to run │ │ │ │ +the session object on. This is primarily useful for tests that may want │ │ │ │ +to run multiple sessions on a single io_context, or low resource │ │ │ │ +systems where additional threads are expensive and sharing an │ │ │ │ +io_context with other events is fine.

    │ │ │ │ +
    │ │ │ │ +

    Warning

    │ │ │ │ +

    The session object does not cleanly terminate with an external │ │ │ │ +io_context. The io_context::run() call must have returned │ │ │ │ +before it's safe to destruct the session. Which means you MUST │ │ │ │ +call session::abort() and save the session_proxy first, then │ │ │ │ +destruct the session object, then sync with the io_context, then │ │ │ │ +destruct the session_proxy object.

    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    ~session()

    │ │ │ │ +
    │ │ │ │ +~session ();
    │ │ │ │ +
    │ │ │ │ +

    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 apply_settings().

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    abort()

    │ │ │ │ +
    │ │ │ │ +session_proxy abort ();
    │ │ │ │ +
    │ │ │ │ +

    In case you want to destruct the session asynchronously, 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:

    │ │ │ │ +
    │ │ │ │ +struct session_proxy {};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    session_handle

    │ │ │ │ +

    Declared in "libtorrent/session_handle.hpp"

    │ │ │ │ +

    this class provides a non-owning handle to a session and a subset of the │ │ │ │ +interface of the session class. If the underlying session is destructed │ │ │ │ +any handle to it will no longer be valid. is_valid() will return false and │ │ │ │ +any operation on it will throw a system_error exception, with error code │ │ │ │ +invalid_session_handle.

    │ │ │ │ +
    │ │ │ │ +struct session_handle
    │ │ │ │ +{
    │ │ │ │ +   bool is_valid () const;
    │ │ │ │ +   session_params session_state (save_state_flags_t flags = save_state_flags_t::all()) const;
    │ │ │ │ +   std::vector<torrent_status> get_torrent_status (
    │ │ │ │ +      std::function<bool(torrent_status const&)> const& pred
    │ │ │ │ +      , status_flags_t flags = {}) const;
    │ │ │ │ +   void refresh_torrent_status (std::vector<torrent_status>* ret
    │ │ │ │ +      , status_flags_t flags = {}) const;
    │ │ │ │ +   void post_torrent_updates (status_flags_t flags = status_flags_t::all());
    │ │ │ │ +   void post_session_stats ();
    │ │ │ │ +   void post_dht_stats ();
    │ │ │ │ +   void set_dht_state (dht::dht_state const& st);
    │ │ │ │ +   void set_dht_state (dht::dht_state&& st);
    │ │ │ │ +   torrent_handle find_torrent (sha1_hash const& info_hash) const;
    │ │ │ │ +   std::vector<torrent_handle> get_torrents () const;
    │ │ │ │ +   torrent_handle add_torrent (add_torrent_params const& params, error_code& ec);
    │ │ │ │ +   torrent_handle add_torrent (add_torrent_params const& params);
    │ │ │ │ +   torrent_handle add_torrent (add_torrent_params&& params);
    │ │ │ │ +   void async_add_torrent (add_torrent_params&& params);
    │ │ │ │ +   void async_add_torrent (add_torrent_params const& params);
    │ │ │ │ +   torrent_handle add_torrent (add_torrent_params&& params, error_code& ec);
    │ │ │ │ +   bool is_paused () const;
    │ │ │ │ +   void pause ();
    │ │ │ │ +   void resume ();
    │ │ │ │ +   bool is_dht_running () const;
    │ │ │ │ +   void set_dht_storage (dht::dht_storage_constructor_type sc);
    │ │ │ │ +   void add_dht_node (std::pair<std::string, int> const& node);
    │ │ │ │ +   void dht_get_item (sha1_hash const& target);
    │ │ │ │ +   void dht_get_item (std::array<char, 32> key
    │ │ │ │ +      , std::string salt = std::string());
    │ │ │ │ +   sha1_hash dht_put_item (entry data);
    │ │ │ │ +   void dht_put_item (std::array<char, 32> key
    │ │ │ │ +      , std::function<void(entry&, std::array<char, 64>&
    │ │ │ │ +      , std::int64_t&, std::string const&)> cb
    │ │ │ │ +      , std::string salt = std::string());
    │ │ │ │ +   void dht_get_peers (sha1_hash const& info_hash);
    │ │ │ │ +   void dht_announce (sha1_hash const& info_hash, int port = 0, dht::announce_flags_t flags = {});
    │ │ │ │ +   void dht_live_nodes (sha1_hash const& nid);
    │ │ │ │ +   void dht_sample_infohashes (udp::endpoint const& ep, sha1_hash const& target);
    │ │ │ │ +   void dht_direct_request (udp::endpoint const& ep, entry const& e, client_data_t userdata = {});
    │ │ │ │ +   void add_extension (std::function<std::shared_ptr<torrent_plugin>(
    │ │ │ │ +      torrent_handle const&, client_data_t)> ext);
    │ │ │ │ +   void add_extension (std::shared_ptr<plugin> ext);
    │ │ │ │ +   ip_filter get_ip_filter () const;
    │ │ │ │ +   void set_ip_filter (ip_filter f);
    │ │ │ │ +   void set_port_filter (port_filter const& f);
    │ │ │ │ +   unsigned short listen_port () const;
    │ │ │ │ +   unsigned short ssl_listen_port () const;
    │ │ │ │ +   bool is_listening () const;
    │ │ │ │ +   ip_filter get_peer_class_filter () const;
    │ │ │ │ +   void set_peer_class_filter (ip_filter const& f);
    │ │ │ │ +   peer_class_type_filter get_peer_class_type_filter () const;
    │ │ │ │ +   void set_peer_class_type_filter (peer_class_type_filter const& f);
    │ │ │ │ +   peer_class_t create_peer_class (char const* name);
    │ │ │ │ +   void delete_peer_class (peer_class_t cid);
    │ │ │ │ +   peer_class_info get_peer_class (peer_class_t cid) const;
    │ │ │ │ +   void set_peer_class (peer_class_t cid, peer_class_info const& pci);
    │ │ │ │ +   void remove_torrent (const torrent_handle&, remove_flags_t = {});
    │ │ │ │ +   void apply_settings (settings_pack&&);
    │ │ │ │ +   void apply_settings (settings_pack const&);
    │ │ │ │ +   settings_pack get_settings () const;
    │ │ │ │ +   void pop_alerts (std::vector<alert*>* alerts);
    │ │ │ │ +   alert* wait_for_alert (time_duration max_wait);
    │ │ │ │ +   void set_alert_notify (std::function<void()> const& fun);
    │ │ │ │ +   void delete_port_mapping (port_mapping_t handle);
    │ │ │ │ +   std::vector<port_mapping_t> add_port_mapping (portmap_protocol t, int external_port, int local_port);
    │ │ │ │ +   void reopen_network_sockets (reopen_network_flags_t options = reopen_map_ports);
    │ │ │ │ +   std::shared_ptr<aux::session_impl> native_handle () const;
    │ │ │ │ +
    │ │ │ │ +   static constexpr save_state_flags_t save_settings  = 0_bit;
    │ │ │ │ +   static constexpr save_state_flags_t save_dht_state  = 2_bit;
    │ │ │ │ +   static constexpr save_state_flags_t save_extension_state  = 11_bit;
    │ │ │ │ +   static constexpr save_state_flags_t save_ip_filter  = 12_bit;
    │ │ │ │ +   static constexpr peer_class_t global_peer_class_id {0};
    │ │ │ │ +   static constexpr peer_class_t tcp_peer_class_id {1};
    │ │ │ │ +   static constexpr peer_class_t local_peer_class_id {2};
    │ │ │ │ +   static constexpr remove_flags_t delete_files  = 0_bit;
    │ │ │ │ +   static constexpr remove_flags_t delete_partfile  = 1_bit;
    │ │ │ │ +   static constexpr session_flags_t paused  = 2_bit;
    │ │ │ │ +   static constexpr portmap_protocol udp  = portmap_protocol::udp;
    │ │ │ │ +   static constexpr portmap_protocol tcp  = portmap_protocol::tcp;
    │ │ │ │ +   static constexpr reopen_network_flags_t reopen_map_ports  = 0_bit;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +

    is_valid()

    │ │ │ │ +
    │ │ │ │ +bool is_valid () const;
    │ │ │ │ +
    │ │ │ │ +

    returns true if this handle refers to a valid session object. If the │ │ │ │ +session has been destroyed, all session_handle objects will expire and │ │ │ │ +not be valid.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    session_state()

    │ │ │ │ +
    │ │ │ │ +session_params session_state (save_state_flags_t flags = save_state_flags_t::all()) const;
    │ │ │ │ +
    │ │ │ │ +

    returns the current session state. This can be passed to │ │ │ │ +write_session_params() to save the state to disk and restored using │ │ │ │ +read_session_params() when constructing a new session. The kind of │ │ │ │ +state that's included is all settings, the DHT routing table, possibly │ │ │ │ +plugin-specific state. │ │ │ │ +the flags parameter can be used to only save certain parts of the │ │ │ │ +session state

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    get_torrent_status() refresh_torrent_status()

    │ │ │ │ +
    │ │ │ │ +std::vector<torrent_status> get_torrent_status (
    │ │ │ │ +      std::function<bool(torrent_status const&)> const& pred
    │ │ │ │ +      , status_flags_t flags = {}) const;
    │ │ │ │ +void refresh_torrent_status (std::vector<torrent_status>* ret
    │ │ │ │ +      , status_flags_t flags = {}) const;
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    Note

    │ │ │ │ +

    these calls are potentially expensive and won't scale well with │ │ │ │ +lots of torrents. If you're concerned about performance, consider │ │ │ │ +using post_torrent_updates() instead.

    │ │ │ │ +
    │ │ │ │ +

    get_torrent_status returns a vector of the torrent_status for │ │ │ │ +every torrent which satisfies pred, which is a predicate function │ │ │ │ +which determines if a torrent should be included in the returned set │ │ │ │ +or not. Returning true means it should be included and false means │ │ │ │ +excluded. The flags argument is the same as to │ │ │ │ +torrent_handle::status(). Since pred is guaranteed to be │ │ │ │ +called for every torrent, it may be used to count the number of │ │ │ │ +torrents of different categories as well.

    │ │ │ │ +

    refresh_torrent_status takes a vector of torrent_status structs │ │ │ │ +(for instance the same vector that was returned by │ │ │ │ +get_torrent_status() ) and refreshes the status based on the │ │ │ │ +handle member. It is possible to use this function by first │ │ │ │ +setting up a vector of default constructed torrent_status objects, │ │ │ │ +only initializing the handle member, in order to request the │ │ │ │ +torrent status for multiple torrents in a single call. This can save a │ │ │ │ +significant amount of time if you have a lot of torrents.

    │ │ │ │ +

    Any torrent_status object whose handle member is not referring to │ │ │ │ +a valid torrent are ignored.

    │ │ │ │ +

    The intended use of these functions is to start off by calling │ │ │ │ +get_torrent_status() to get a list of all torrents that match your │ │ │ │ +criteria. Then call refresh_torrent_status() on that list. This │ │ │ │ +will only refresh the status for the torrents in your list, and thus │ │ │ │ +ignore all other torrents you might be running. This may save a │ │ │ │ +significant amount of time, especially if the number of torrents you're │ │ │ │ +interested in is small. In order to keep your list of interested │ │ │ │ +torrents up to date, you can either call get_torrent_status() from │ │ │ │ +time to time, to include torrents you might have become interested in │ │ │ │ +since the last time. In order to stop refreshing a certain torrent, │ │ │ │ +simply remove it from the list.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    post_torrent_updates()

    │ │ │ │ +
    │ │ │ │ +void post_torrent_updates (status_flags_t flags = status_flags_t::all());
    │ │ │ │ +
    │ │ │ │ +

    This functions instructs the session to post the state_update_alert, │ │ │ │ +containing the status of all torrents whose state changed since the │ │ │ │ +last time this function was called.

    │ │ │ │ +

    Only torrents who has the state subscription flag set will be │ │ │ │ +included. This flag is on by default. See add_torrent_params. │ │ │ │ +the flags argument is the same as for torrent_handle::status(). │ │ │ │ +see status_flags_t in torrent_handle.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    post_session_stats()

    │ │ │ │ +
    │ │ │ │ +void post_session_stats ();
    │ │ │ │ +
    │ │ │ │ +

    This function will post a session_stats_alert object, containing a │ │ │ │ +snapshot of the performance counters from the internals of libtorrent. │ │ │ │ +To interpret these counters, query the session via │ │ │ │ +session_stats_metrics().

    │ │ │ │ +

    For more information, see the session statistics section.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    post_dht_stats()

    │ │ │ │ +
    │ │ │ │ +void post_dht_stats ();
    │ │ │ │ +
    │ │ │ │ +

    This will cause a dht_stats_alert to be posted.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_dht_state()

    │ │ │ │ +
    │ │ │ │ +void set_dht_state (dht::dht_state const& st);
    │ │ │ │ +void set_dht_state (dht::dht_state&& st);
    │ │ │ │ +
    │ │ │ │ +

    set the DHT state for the session. This will be taken into account the │ │ │ │ +next time the DHT is started, as if it had been passed in via the │ │ │ │ +session_params on startup.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    find_torrent() get_torrents()

    │ │ │ │ +
    │ │ │ │ +torrent_handle find_torrent (sha1_hash const& info_hash) const;
    │ │ │ │ +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.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    add_torrent() async_add_torrent()

    │ │ │ │ +
    │ │ │ │ +torrent_handle add_torrent (add_torrent_params const& params, error_code& ec);
    │ │ │ │ +torrent_handle add_torrent (add_torrent_params const& params);
    │ │ │ │ +torrent_handle add_torrent (add_torrent_params&& params);
    │ │ │ │ +void async_add_torrent (add_torrent_params&& params);
    │ │ │ │ +void async_add_torrent (add_torrent_params const& params);
    │ │ │ │ +torrent_handle add_torrent (add_torrent_params&& params, error_code& ec);
    │ │ │ │ +
    │ │ │ │ +

    You add torrents through the add_torrent() function where you give an │ │ │ │ +object with all the parameters. The add_torrent() overloads will block │ │ │ │ +until the torrent has been added (or failed to be added) and returns │ │ │ │ +an error code and a torrent_handle. In order to add torrents more │ │ │ │ +efficiently, consider using async_add_torrent() which returns │ │ │ │ +immediately, without waiting for the torrent to add. Notification of │ │ │ │ +the torrent being added is sent as add_torrent_alert.

    │ │ │ │ +

    The save_path field in add_torrent_params must be set to a valid │ │ │ │ +path where the files for the torrent will be saved. Even when using a │ │ │ │ +custom storage, this needs to be set to something. If the save_path │ │ │ │ +is empty, the call to add_torrent() will throw a system_error │ │ │ │ +exception.

    │ │ │ │ +

    The overload that does not take an error_code throws an exception on │ │ │ │ +error and is not available when building without exception support. │ │ │ │ +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.

    │ │ │ │ +

    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 system_error which derives from │ │ │ │ +std::exception unless duplicate_is_error is set to false. In that │ │ │ │ +case, add_torrent() will return the handle to the existing torrent.

    │ │ │ │ +

    The add_torrent_params class has a flags field. It can be used to │ │ │ │ +control what state the new torrent will be added in. Common flags to │ │ │ │ +want to control are torrent_flags::paused and │ │ │ │ +torrent_flags::auto_managed. In order to add a magnet link that will │ │ │ │ +just download the metadata, but no payload, set the │ │ │ │ +torrent_flags::upload_mode flag.

    │ │ │ │ +

    Special consideration has to be taken when adding hybrid torrents │ │ │ │ +(i.e. torrents that are BitTorrent v2 torrents that are backwards │ │ │ │ +compatible with v1). For more details, see BitTorrent v2 torrents.

    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    resume() pause() is_paused()

    │ │ │ │ +
    │ │ │ │ +bool is_paused () const;
    │ │ │ │ +void pause ();
    │ │ │ │ +void resume ();
    │ │ │ │ +
    │ │ │ │ +

    Pausing the session has the same effect as pausing every torrent in │ │ │ │ +it, except that torrents will not be resumed by the auto-manage │ │ │ │ +mechanism. Resuming will restore the torrents to their previous paused │ │ │ │ +state. i.e. the session pause state is separate from the torrent pause │ │ │ │ +state. A torrent is inactive if it is paused or if the session is │ │ │ │ +paused.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    is_dht_running()

    │ │ │ │ +
    │ │ │ │ +bool is_dht_running () const;
    │ │ │ │ +
    │ │ │ │ +

    is_dht_running() returns true if the DHT support has been started │ │ │ │ +and false otherwise.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_dht_storage()

    │ │ │ │ +
    │ │ │ │ +void set_dht_storage (dht::dht_storage_constructor_type sc);
    │ │ │ │ +
    │ │ │ │ +

    set_dht_storage set a dht custom storage constructor function │ │ │ │ +to be used internally when the dht is created.

    │ │ │ │ +

    Since the dht storage is a critical component for the dht behavior, │ │ │ │ +this function will only be effective the next time the dht is started. │ │ │ │ +If you never touch this feature, a default map-memory based storage │ │ │ │ +is used.

    │ │ │ │ +

    If you want to make sure the dht is initially created with your │ │ │ │ +custom storage, create a session with the setting │ │ │ │ +settings_pack::enable_dht to false, set your constructor function │ │ │ │ +and call apply_settings with settings_pack::enable_dht to true.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    add_dht_node()

    │ │ │ │ +
    │ │ │ │ +void add_dht_node (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.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    dht_get_item()

    │ │ │ │ +
    │ │ │ │ +void dht_get_item (sha1_hash const& target);
    │ │ │ │ +
    │ │ │ │ +

    query the DHT for an immutable item at the target hash. │ │ │ │ +the result is posted as a dht_immutable_item_alert.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    dht_get_item()

    │ │ │ │ +
    │ │ │ │ +void dht_get_item (std::array<char, 32> key
    │ │ │ │ +      , std::string salt = std::string());
    │ │ │ │ +
    │ │ │ │ +

    query the DHT for a mutable item under the public key key. │ │ │ │ +this is an ed25519 key. salt is optional and may be left │ │ │ │ +as an empty string if no salt is to be used. │ │ │ │ +if the item is found in the DHT, a dht_mutable_item_alert is │ │ │ │ +posted.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    dht_put_item()

    │ │ │ │ +
    │ │ │ │ +sha1_hash dht_put_item (entry data);
    │ │ │ │ +
    │ │ │ │ +

    store the given bencoded data as an immutable item in the DHT. │ │ │ │ +the returned hash is the key that is to be used to look the item │ │ │ │ +up again. It's just the SHA-1 hash of the bencoded form of the │ │ │ │ +structure.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    dht_put_item()

    │ │ │ │ +
    │ │ │ │ +void dht_put_item (std::array<char, 32> key
    │ │ │ │ +      , std::function<void(entry&, std::array<char, 64>&
    │ │ │ │ +      , std::int64_t&, std::string const&)> cb
    │ │ │ │ +      , std::string salt = std::string());
    │ │ │ │ +
    │ │ │ │ +

    store a mutable item. The key is the public key the blob is │ │ │ │ +to be stored under. The optional salt argument is a string that │ │ │ │ +is to be mixed in with the key when determining where in the DHT │ │ │ │ +the value is to be stored. The callback function is called from within │ │ │ │ +the libtorrent network thread once we've found where to store the blob, │ │ │ │ +possibly with the current value stored under the key. │ │ │ │ +The values passed to the callback functions are:

    │ │ │ │ +
    │ │ │ │ +
    entry& value
    │ │ │ │ +
    the current value stored under the key (may be empty). Also expected │ │ │ │ +to be set to the value to be stored by the function.
    │ │ │ │ +
    std::array<char,64>& signature
    │ │ │ │ +
    the signature authenticating the current value. This may be zeros │ │ │ │ +if there is currently no value stored. The function is expected to │ │ │ │ +fill in this buffer with the signature of the new value to store. │ │ │ │ +To generate the signature, you may want to use the │ │ │ │ +sign_mutable_item function.
    │ │ │ │ +
    std::int64_t& seq
    │ │ │ │ +
    current sequence number. May be zero if there is no current value. │ │ │ │ +The function is expected to set this to the new sequence number of │ │ │ │ +the value that is to be stored. Sequence numbers must be monotonically │ │ │ │ +increasing. Attempting to overwrite a value with a lower or equal │ │ │ │ +sequence number will fail, even if the signature is correct.
    │ │ │ │ +
    std::string const& salt
    │ │ │ │ +
    this is the salt that was used for this put call.
    │ │ │ │ +
    │ │ │ │ +

    Since the callback function cb is called from within libtorrent, │ │ │ │ +it is critical to not perform any blocking operations. Ideally not │ │ │ │ +even locking a mutex. Pass any data required for this function along │ │ │ │ +with the function object's context and make the function entirely │ │ │ │ +self-contained. The only reason data blob's value is computed │ │ │ │ +via a function instead of just passing in the new value is to avoid │ │ │ │ +race conditions. If you want to update the value in the DHT, you │ │ │ │ +must first retrieve it, then modify it, then write it back. The way │ │ │ │ +the DHT works, it is natural to always do a lookup before storing and │ │ │ │ +calling the callback in between is convenient.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    dht_announce() dht_get_peers()

    │ │ │ │ +
    │ │ │ │ +void dht_get_peers (sha1_hash const& info_hash);
    │ │ │ │ +void dht_announce (sha1_hash const& info_hash, int port = 0, dht::announce_flags_t flags = {});
    │ │ │ │ +
    │ │ │ │ +

    dht_get_peers() will issue a DHT get_peer request to the DHT for the │ │ │ │ +specified info-hash. The response (the peers) will be posted back in a │ │ │ │ +dht_get_peers_reply_alert.

    │ │ │ │ +

    dht_announce() will issue a DHT announce request to the DHT to the │ │ │ │ +specified info-hash, advertising the specified port. If the port is │ │ │ │ +left at its default, 0, the port will be implied by the DHT message's │ │ │ │ +source port (which may improve connectivity through a NAT). │ │ │ │ +dht_announce() is not affected by the announce_port override setting.

    │ │ │ │ +

    Both these functions are exposed for advanced custom use of the DHT. │ │ │ │ +All torrents eligible to be announce to the DHT will be automatically, │ │ │ │ +by libtorrent.

    │ │ │ │ +

    For possible flags, see announce_flags_t.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    dht_live_nodes()

    │ │ │ │ +
    │ │ │ │ +void dht_live_nodes (sha1_hash const& nid);
    │ │ │ │ +
    │ │ │ │ +

    Retrieve all the live DHT (identified by nid) nodes. All the │ │ │ │ +nodes id and endpoint will be returned in the list of nodes in the │ │ │ │ +alert dht_live_nodes_alert. │ │ │ │ +Since this alert is a response to an explicit call, it will always be │ │ │ │ +posted, regardless of the alert mask.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    dht_sample_infohashes()

    │ │ │ │ +
    │ │ │ │ +void dht_sample_infohashes (udp::endpoint const& ep, sha1_hash const& target);
    │ │ │ │ +
    │ │ │ │ +

    Query the DHT node specified by ep to retrieve a sample of the │ │ │ │ +info-hashes that the node currently have in their storage. │ │ │ │ +The target is included for iterative lookups so that indexing nodes │ │ │ │ +can perform a key space traversal with a single RPC per node by adjusting │ │ │ │ +the target value for each RPC. It has no effect on the returned sample value. │ │ │ │ +The result is posted as a dht_sample_infohashes_alert.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    dht_direct_request()

    │ │ │ │ +
    │ │ │ │ +void dht_direct_request (udp::endpoint const& ep, entry const& e, client_data_t userdata = {});
    │ │ │ │ +
    │ │ │ │ +

    Send an arbitrary DHT request directly to the specified endpoint. This │ │ │ │ +function is intended for use by plugins. When a response is received │ │ │ │ +or the request times out, a dht_direct_response_alert will be posted │ │ │ │ +with the response (if any) and the userdata pointer passed in here. │ │ │ │ +Since this alert is a response to an explicit call, it will always be │ │ │ │ +posted, regardless of the alert mask.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    add_extension()

    │ │ │ │ +
    │ │ │ │ +void add_extension (std::function<std::shared_ptr<torrent_plugin>(
    │ │ │ │ +      torrent_handle const&, client_data_t)> ext);
    │ │ │ │ +void add_extension (std::shared_ptr<plugin> ext);
    │ │ │ │ +
    │ │ │ │ +

    This function adds an extension to this session. The argument is a │ │ │ │ +function object that is called with a torrent_handle and which should │ │ │ │ +return a std::shared_ptr<torrent_plugin>. To write custom │ │ │ │ +plugins, see libtorrent plugins. For the typical bittorrent client │ │ │ │ +all of these extensions should be added. The main plugins implemented │ │ │ │ +in libtorrent are:

    │ │ │ │ +
    │ │ │ │ +
    uTorrent metadata
    │ │ │ │ +
    Allows peers to download the metadata (.torrent files) from the swarm │ │ │ │ +directly. Makes it possible to join a swarm with just a tracker and │ │ │ │ +info-hash.
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +#include <libtorrent/extensions/ut_metadata.hpp>
    │ │ │ │ +ses.add_extension(&lt::create_ut_metadata_plugin);
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    uTorrent peer exchange
    │ │ │ │ +
    Exchanges peers between clients.
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +#include <libtorrent/extensions/ut_pex.hpp>
    │ │ │ │ +ses.add_extension(&lt::create_ut_pex_plugin);
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    smart ban plugin
    │ │ │ │ +
    A plugin that, with a small overhead, can ban peers │ │ │ │ +that sends bad data with very high accuracy. Should │ │ │ │ +eliminate most problems on poisoned torrents.
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +#include <libtorrent/extensions/smart_ban.hpp>
    │ │ │ │ +ses.add_extension(&lt::create_smart_ban_plugin);
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_ip_filter() get_ip_filter()

    │ │ │ │ +
    │ │ │ │ +ip_filter get_ip_filter () const;
    │ │ │ │ +void set_ip_filter (ip_filter f);
    │ │ │ │ +
    │ │ │ │ +

    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. get_ip_filter() Returns the │ │ │ │ +ip_filter currently in the session. See ip_filter.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_port_filter()

    │ │ │ │ +
    │ │ │ │ +void set_port_filter (port_filter const& f);
    │ │ │ │ +
    │ │ │ │ +

    apply port_filter f to incoming and outgoing peers. a port filter │ │ │ │ +will reject making outgoing peer connections to certain remote ports. │ │ │ │ +The main intention is to be able to avoid triggering certain │ │ │ │ +anti-virus software by connecting to SMTP, FTP ports.

    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    ssl_listen_port() listen_port() is_listening()

    │ │ │ │ +
    │ │ │ │ +unsigned short listen_port () const;
    │ │ │ │ +unsigned short ssl_listen_port () const;
    │ │ │ │ +bool is_listening () const;
    │ │ │ │ +
    │ │ │ │ +

    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 set a new │ │ │ │ +settings_pack::listen_interfaces to try another interface and port to │ │ │ │ +bind to.

    │ │ │ │ +

    listen_port() returns the port we ended up listening on.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    get_peer_class_filter() set_peer_class_filter()

    │ │ │ │ +
    │ │ │ │ +ip_filter get_peer_class_filter () const;
    │ │ │ │ +void set_peer_class_filter (ip_filter const& f);
    │ │ │ │ +
    │ │ │ │ +

    Sets the peer class filter for this session. All new peer connections │ │ │ │ +will take this into account and be added to the peer classes specified │ │ │ │ +by this filter, based on the peer's IP address.

    │ │ │ │ +

    The ip-filter essentially maps an IP -> uint32. Each bit in that 32 │ │ │ │ +bit integer represents a peer class. The least significant bit │ │ │ │ +represents class 0, the next bit class 1 and so on.

    │ │ │ │ +

    For more info, see ip_filter.

    │ │ │ │ +

    For example, to make all peers in the range 200.1.1.0 - 200.1.255.255 │ │ │ │ +belong to their own peer class, apply the following filter:

    │ │ │ │ +
    │ │ │ │ +ip_filter f = ses.get_peer_class_filter();
    │ │ │ │ +peer_class_t my_class = ses.create_peer_class("200.1.x.x IP range");
    │ │ │ │ +f.add_rule(make_address("200.1.1.0"), make_address("200.1.255.255")
    │ │ │ │ +        , 1 << static_cast<std::uint32_t>(my_class));
    │ │ │ │ +ses.set_peer_class_filter(f);
    │ │ │ │ +
    │ │ │ │ +

    This setting only applies to new connections, it won't affect existing │ │ │ │ +peer connections.

    │ │ │ │ +

    This function is limited to only peer class 0-31, since there are only │ │ │ │ +32 bits in the IP range mapping. Only the set bits matter; no peer │ │ │ │ +class will be removed from a peer as a result of this call, peer │ │ │ │ +classes are only added.

    │ │ │ │ +

    The peer_class argument cannot be greater than 31. The bitmasks │ │ │ │ +representing peer classes in the peer_class_filter are 32 bits.

    │ │ │ │ +

    The get_peer_class_filter() function returns the current filter.

    │ │ │ │ +

    For more information, see peer classes.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    get_peer_class_type_filter() set_peer_class_type_filter()

    │ │ │ │ +
    │ │ │ │ +peer_class_type_filter get_peer_class_type_filter () const;
    │ │ │ │ +void set_peer_class_type_filter (peer_class_type_filter const& f);
    │ │ │ │ +
    │ │ │ │ +

    Sets and gets the peer class type filter. This is controls automatic │ │ │ │ +peer class assignments to peers based on what kind of socket it is.

    │ │ │ │ +

    It does not only support assigning peer classes, it also supports │ │ │ │ +removing peer classes based on socket type.

    │ │ │ │ +

    The order of these rules being applied are:

    │ │ │ │ +
      │ │ │ │ +
    1. peer-class IP filter
    2. │ │ │ │ +
    3. peer-class type filter, removing classes
    4. │ │ │ │ +
    5. peer-class type filter, adding classes
    6. │ │ │ │ +
    │ │ │ │ +

    For more information, see peer classes.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    create_peer_class()

    │ │ │ │ +
    │ │ │ │ +peer_class_t create_peer_class (char const* name);
    │ │ │ │ +
    │ │ │ │ +

    Creates a new peer class (see peer classes) with the given name. The │ │ │ │ +returned integer is the new peer class identifier. Peer classes may │ │ │ │ +have the same name, so each invocation of this function creates a new │ │ │ │ +class and returns a unique identifier.

    │ │ │ │ +

    Identifiers are assigned from low numbers to higher. So if you plan on │ │ │ │ +using certain peer classes in a call to set_peer_class_filter(), │ │ │ │ +make sure to create those early on, to get low identifiers.

    │ │ │ │ +

    For more information on peer classes, see peer classes.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    delete_peer_class()

    │ │ │ │ +
    │ │ │ │ +void delete_peer_class (peer_class_t cid);
    │ │ │ │ +
    │ │ │ │ +

    This call dereferences the reference count of the specified peer │ │ │ │ +class. When creating a peer class it's automatically referenced by 1. │ │ │ │ +If you want to recycle a peer class, you may call this function. You │ │ │ │ +may only call this function once per peer class you create. │ │ │ │ +Calling it more than once for the same class will lead to memory │ │ │ │ +corruption.

    │ │ │ │ +

    Since peer classes are reference counted, this function will not │ │ │ │ +remove the peer class if it's still assigned to torrents or peers. It │ │ │ │ +will however remove it once the last peer and torrent drops their │ │ │ │ +references to it.

    │ │ │ │ +

    There is no need to call this function for custom peer classes. All │ │ │ │ +peer classes will be properly destructed when the session object │ │ │ │ +destructs.

    │ │ │ │ +

    For more information on peer classes, see peer classes.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    get_peer_class() set_peer_class()

    │ │ │ │ +
    │ │ │ │ +peer_class_info get_peer_class (peer_class_t cid) const;
    │ │ │ │ +void set_peer_class (peer_class_t cid, peer_class_info const& pci);
    │ │ │ │ +
    │ │ │ │ +

    These functions queries information from a peer class and updates the │ │ │ │ +configuration of a peer class, respectively.

    │ │ │ │ +

    cid must refer to an existing peer class. If it does not, the │ │ │ │ +return value of get_peer_class() is undefined.

    │ │ │ │ +

    set_peer_class() sets all the information in the │ │ │ │ +peer_class_info object in the specified peer class. There is no │ │ │ │ +option to only update a single property.

    │ │ │ │ +

    A peer or torrent belonging to more than one class, the highest │ │ │ │ +priority among any of its classes is the one that is taken into │ │ │ │ +account.

    │ │ │ │ +

    For more information, see peer classes.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    remove_torrent()

    │ │ │ │ +
    │ │ │ │ +void remove_torrent (const torrent_handle&, remove_flags_t = {});
    │ │ │ │ +
    │ │ │ │ +

    remove_torrent() will close all peer connections associated with │ │ │ │ +the torrent and tell the tracker that we've stopped participating in │ │ │ │ +the swarm. This operation cannot fail. When it completes, you will │ │ │ │ +receive a torrent_removed_alert.

    │ │ │ │ +

    remove_torrent() is non-blocking, but will remove the torrent from the │ │ │ │ +session synchronously. Calling session_handle::add_torrent() immediately │ │ │ │ +afterward with the same torrent will succeed. Note that this creates a │ │ │ │ +new handle which is not equal to the removed one.

    │ │ │ │ +

    The optional second argument options can be used to delete all the │ │ │ │ +files downloaded by this torrent. To do so, pass in the value │ │ │ │ +session_handle::delete_files. Once the torrent is deleted, a │ │ │ │ +torrent_deleted_alert is posted.

    │ │ │ │ +

    The torrent_handle remains valid for some time after remove_torrent() is │ │ │ │ +called. It will become invalid only after all libtorrent tasks (such as │ │ │ │ +I/O tasks) release their references to the torrent. Until this happens, │ │ │ │ +torrent_handle::is_valid() will return true, and other calls such │ │ │ │ +as torrent_handle::status() will succeed. Because of this, and because │ │ │ │ +remove_torrent() is non-blocking, the following sequence usually │ │ │ │ +succeeds (does not throw system_error): │ │ │ │ +.. code:: c++

    │ │ │ │ +
    │ │ │ │ +session.remove_handle(handle); │ │ │ │ +handle.save_resume_data();
    │ │ │ │ +

    Note that when a queued or downloading torrent is removed, its position │ │ │ │ +in the download queue is vacated and every subsequent torrent in the │ │ │ │ +queue has their queue positions updated. This can potentially cause a │ │ │ │ +large state_update to be posted. When removing all torrents, it is │ │ │ │ +advised to remove them from the back of the queue, to minimize the │ │ │ │ +shifting.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    get_settings() apply_settings()

    │ │ │ │ +
    │ │ │ │ +void apply_settings (settings_pack&&);
    │ │ │ │ +void apply_settings (settings_pack const&);
    │ │ │ │ +settings_pack get_settings () const;
    │ │ │ │ +
    │ │ │ │ +

    Applies the settings specified by the settings_pack s. This is an │ │ │ │ +asynchronous operation that will return immediately and actually apply │ │ │ │ +the settings to the main thread of libtorrent some time later.

    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    wait_for_alert() pop_alerts() set_alert_notify()

    │ │ │ │ +
    │ │ │ │ +void pop_alerts (std::vector<alert*>* alerts);
    │ │ │ │ +alert* wait_for_alert (time_duration max_wait);
    │ │ │ │ +void set_alert_notify (std::function<void()> const& fun);
    │ │ │ │ +
    │ │ │ │ +

    Alerts is the main mechanism for libtorrent to report errors and │ │ │ │ +events. pop_alerts fills in the vector passed to it with pointers │ │ │ │ +to new alerts. The session still owns these alerts and they will stay │ │ │ │ +valid until the next time pop_alerts is called. You may not delete │ │ │ │ +the alert objects.

    │ │ │ │ +

    It is safe to call pop_alerts from multiple different threads, as │ │ │ │ +long as the alerts themselves are not accessed once another thread │ │ │ │ +calls pop_alerts. Doing this requires manual synchronization │ │ │ │ +between the popping threads.

    │ │ │ │ +

    wait_for_alert will block the current thread for max_wait time │ │ │ │ +duration, or until another alert is posted. If an alert is available │ │ │ │ +at the time of the call, it returns immediately. The returned alert │ │ │ │ +pointer is the head of the alert queue. wait_for_alert does not │ │ │ │ +pop alerts from the queue, it merely peeks at it. The returned alert │ │ │ │ +will stay valid until pop_alerts is called twice. The first time │ │ │ │ +will pop it and the second will free it.

    │ │ │ │ +

    If there is no alert in the queue and no alert arrives within the │ │ │ │ +specified timeout, wait_for_alert returns nullptr.

    │ │ │ │ +

    In the python binding, wait_for_alert takes the number of │ │ │ │ +milliseconds to wait as an integer.

    │ │ │ │ +

    The alert queue in the session will not grow indefinitely. Make sure │ │ │ │ +to pop periodically to not miss notifications. To control the max │ │ │ │ +number of alerts that's queued by the session, see │ │ │ │ +settings_pack::alert_queue_size.

    │ │ │ │ +

    Some alerts are considered so important that they are posted even when │ │ │ │ +the alert queue is full. Some alerts are considered mandatory and cannot │ │ │ │ +be disabled by the alert_mask. For instance, │ │ │ │ +save_resume_data_alert and save_resume_data_failed_alert are always │ │ │ │ +posted, regardless of the alert mask.

    │ │ │ │ +

    To control which alerts are posted, set the alert_mask │ │ │ │ +(settings_pack::alert_mask).

    │ │ │ │ +

    If the alert queue fills up to the point where alerts are dropped, this │ │ │ │ +will be indicated by a alerts_dropped_alert, which contains a bitmask │ │ │ │ +of which types of alerts were dropped. Generally it is a good idea to │ │ │ │ +make sure the alert queue is large enough, the alert_mask doesn't have │ │ │ │ +unnecessary categories enabled and to call pop_alert() frequently, to │ │ │ │ +avoid alerts being dropped.

    │ │ │ │ +

    the set_alert_notify function lets the client set a function object │ │ │ │ +to be invoked every time the alert queue goes from having 0 alerts to │ │ │ │ +1 alert. This function is called from within libtorrent, it may be the │ │ │ │ +main thread, or it may be from within a user call. The intention of │ │ │ │ +of the function is that the client wakes up its main thread, to poll │ │ │ │ +for more alerts using pop_alerts(). If the notify function fails │ │ │ │ +to do so, it won't be called again, until pop_alerts is called for │ │ │ │ +some other reason. For instance, it could signal an eventfd, post a │ │ │ │ +message to an HWND or some other main message pump. The actual │ │ │ │ +retrieval of alerts should not be done in the callback. In fact, the │ │ │ │ +callback should not block. It should not perform any expensive work. │ │ │ │ +It really should just notify the main application thread.

    │ │ │ │ +

    The type of an alert is returned by the polymorphic function │ │ │ │ +alert::type() but can also be queries from a concrete type via │ │ │ │ +T::alert_type, as a static constant.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    delete_port_mapping() add_port_mapping()

    │ │ │ │ +
    │ │ │ │ +void delete_port_mapping (port_mapping_t handle);
    │ │ │ │ +std::vector<port_mapping_t> add_port_mapping (portmap_protocol t, int external_port, int local_port);
    │ │ │ │ +
    │ │ │ │ +

    add_port_mapping adds one or more port forwards on UPnP and/or NAT-PMP, │ │ │ │ +whichever is enabled. A mapping is created for each listen socket │ │ │ │ +in the session. The return values are all handles referring to the │ │ │ │ +port mappings that were just created. Pass them to delete_port_mapping() │ │ │ │ +to remove them.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    reopen_network_sockets()

    │ │ │ │ +
    │ │ │ │ +void reopen_network_sockets (reopen_network_flags_t options = reopen_map_ports);
    │ │ │ │ +
    │ │ │ │ +

    Instructs the session to reopen all listen and outgoing sockets.

    │ │ │ │ +

    It's useful in the case your platform doesn't support the built in │ │ │ │ +IP notifier mechanism, or if you have a better more reliable way to │ │ │ │ +detect changes in the IP routing table.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    native_handle()

    │ │ │ │ +
    │ │ │ │ +std::shared_ptr<aux::session_impl> native_handle () const;
    │ │ │ │ +
    │ │ │ │ +

    This function is intended only for use by plugins. This type does │ │ │ │ +not have a stable API and should be relied on as little as possible.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    save_settings
    │ │ │ │ +
    saves settings (i.e. the settings_pack)
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    save_dht_state
    │ │ │ │ +
    saves dht state such as nodes and node-id, possibly accelerating │ │ │ │ +joining the DHT if provided at next session startup.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    save_extension_state
    │ │ │ │ +
    load or save state from plugins
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    save_ip_filter
    │ │ │ │ +
    load or save the IP filter set on the session
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    global_peer_class_id tcp_peer_class_id local_peer_class_id
    │ │ │ │ +
    built-in peer classes
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    delete_files
    │ │ │ │ +
    delete the files belonging to the torrent from disk. │ │ │ │ +including the part-file, if there is one
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    delete_partfile
    │ │ │ │ +
    delete just the part-file associated with this torrent
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    paused
    │ │ │ │ +
    when set, the session will start paused. Call │ │ │ │ +session_handle::resume() to start
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    udp tcp
    │ │ │ │ +
    protocols used by add_port_mapping()
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    reopen_map_ports
    │ │ │ │ +
    This option indicates if the ports are mapped using natpmp │ │ │ │ +and upnp. If mapping was already made, they are deleted and added │ │ │ │ +again. This only works if natpmp and/or upnp are configured to be │ │ │ │ +enable.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    session_params

    │ │ │ │ +

    Declared in "libtorrent/session_params.hpp"

    │ │ │ │ +

    The session_params is a parameters pack for configuring the session │ │ │ │ +before it's started.

    │ │ │ │ +
    │ │ │ │ +struct session_params
    │ │ │ │ +{
    │ │ │ │ +   session_params (settings_pack const& sp);
    │ │ │ │ +   session_params ();
    │ │ │ │ +   session_params (settings_pack&& sp);
    │ │ │ │ +   session_params (settings_pack&& sp
    │ │ │ │ +      , std::vector<std::shared_ptr<plugin>> exts);
    │ │ │ │ +   session_params (settings_pack const& sp
    │ │ │ │ +      , std::vector<std::shared_ptr<plugin>> exts);
    │ │ │ │ +
    │ │ │ │ +   settings_pack settings;
    │ │ │ │ +   std::vector<std::shared_ptr<plugin>> extensions;
    │ │ │ │ +   dht::dht_state dht_state;
    │ │ │ │ +   dht::dht_storage_constructor_type dht_storage_constructor;
    │ │ │ │ +   disk_io_constructor_type disk_io_constructor;
    │ │ │ │ +   std::map<std::string, std::string> ext_state;
    │ │ │ │ +   libtorrent::ip_filter ip_filter;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +

    session_params()

    │ │ │ │ +
    │ │ │ │ +session_params (settings_pack const& sp);
    │ │ │ │ +session_params ();
    │ │ │ │ +session_params (settings_pack&& sp);
    │ │ │ │ +
    │ │ │ │ +

    This constructor can be used to start with the default plugins │ │ │ │ +(ut_metadata, ut_pex and smart_ban). Pass a settings_pack to set the │ │ │ │ +initial settings when the session starts.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    session_params()

    │ │ │ │ +
    │ │ │ │ +session_params (settings_pack&& sp
    │ │ │ │ +      , std::vector<std::shared_ptr<plugin>> exts);
    │ │ │ │ +session_params (settings_pack const& sp
    │ │ │ │ +      , std::vector<std::shared_ptr<plugin>> exts);
    │ │ │ │ +
    │ │ │ │ +

    This constructor helps to configure the set of initial plugins │ │ │ │ +to be added to the session before it's started.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    settings
    │ │ │ │ +
    The settings to configure the session with
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    extensions
    │ │ │ │ +
    the plugins to add to the session as it is constructed
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    dht_state
    │ │ │ │ +
    DHT node ID and node addresses to bootstrap the DHT with.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    dht_storage_constructor
    │ │ │ │ +
    function object to construct the storage object for DHT items.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    disk_io_constructor
    │ │ │ │ +
    function object to create the disk I/O subsystem. Defaults to │ │ │ │ +default_disk_io_constructor.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    ext_state
    │ │ │ │ +
    this container can be used by extensions/plugins to store settings. It's │ │ │ │ +primarily here to make it convenient to save and restore state across │ │ │ │ +sessions, using read_session_params() and write_session_params().
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    ip_filter
    │ │ │ │ +
    the IP filter to use for the session. This restricts which peers are allowed │ │ │ │ +to connect. As if passed to set_ip_filter().
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    write_session_params_buf() write_session_params() read_session_params()

    │ │ │ │ +

    Declared in "libtorrent/session_params.hpp"

    │ │ │ │ +
    │ │ │ │ +session_params read_session_params (bdecode_node const& e
    │ │ │ │ +   , save_state_flags_t flags = save_state_flags_t::all());
    │ │ │ │ +session_params read_session_params (span<char const> buf
    │ │ │ │ +   , save_state_flags_t flags = save_state_flags_t::all());
    │ │ │ │ +entry write_session_params (session_params const& sp
    │ │ │ │ +   , save_state_flags_t flags = save_state_flags_t::all());
    │ │ │ │ +std::vector<char> write_session_params_buf (session_params const& sp
    │ │ │ │ +   , save_state_flags_t flags = save_state_flags_t::all());
    │ │ │ │ +
    │ │ │ │ +

    These functions serialize and de-serialize a session_params object to and │ │ │ │ +from bencoded form. The session_params object is used to initialize a new │ │ │ │ +session using the state from a previous one (or by programmatically configure │ │ │ │ +the session up-front). │ │ │ │ +The flags parameter can be used to only save and load certain aspects of the │ │ │ │ +session's state. │ │ │ │ +The _buf suffix indicates the function operates on buffer rather than the │ │ │ │ +bencoded structure. │ │ │ │ +The torrents in a session are not part of the session_params state, they have │ │ │ │ +to be restored separately.

    │ │ │ │

    libtorrent has a plugin interface for implementing extensions to the protocol. │ │ │ │ These can be general extensions for transferring metadata or peer exchange │ │ │ │ extensions, or it could be used to provide a way to customize the protocol │ │ │ │ to fit a particular (closed) network.

    │ │ │ │

    In short, the plugin interface makes it possible to:

    │ │ │ │
      │ │ │ │
    • register extension messages (sent in the extension handshake), see │ │ │ │ @@ -10518,84 +9961,14 @@ │ │ │ │ expected.

      │ │ │ │

      The static category is required for checking whether or not the category │ │ │ │ for a specific alert is enabled or not, without instantiating the alert. │ │ │ │ The category virtual function is the run-time equivalence.

      │ │ │ │

      The what() virtual function may simply be a string literal of the class │ │ │ │ name of your alert.

      │ │ │ │

      For more information, see the alert section.

      │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    peer_connection_handle

    │ │ │ │ -

    Declared in "libtorrent/peer_connection_handle.hpp"

    │ │ │ │ -

    the peer_connection_handle class provides a handle to the internal peer │ │ │ │ -connection object, to be used by plugins. This is a low level interface that │ │ │ │ -may not be stable across libtorrent versions

    │ │ │ │ -
    │ │ │ │ -struct peer_connection_handle
    │ │ │ │ -{
    │ │ │ │ -   explicit peer_connection_handle (std::weak_ptr<peer_connection> impl);
    │ │ │ │ -   connection_type type () const;
    │ │ │ │ -   peer_plugin const* find_plugin (string_view type) const;
    │ │ │ │ -   void add_extension (std::shared_ptr<peer_plugin>);
    │ │ │ │ -   bool is_seed () const;
    │ │ │ │ -   bool upload_only () const;
    │ │ │ │ -   bool has_piece (piece_index_t i) const;
    │ │ │ │ -   peer_id const& pid () const;
    │ │ │ │ -   bool is_interesting () const;
    │ │ │ │ -   bool is_choked () const;
    │ │ │ │ -   bool is_peer_interested () const;
    │ │ │ │ -   bool has_peer_choked () const;
    │ │ │ │ -   void choke_this_peer ();
    │ │ │ │ -   void maybe_unchoke_this_peer ();
    │ │ │ │ -   void get_peer_info (peer_info& p) const;
    │ │ │ │ -   torrent_handle associated_torrent () const;
    │ │ │ │ -   tcp::endpoint const& remote () const;
    │ │ │ │ -   tcp::endpoint local_endpoint () const;
    │ │ │ │ -   bool is_disconnecting () const;
    │ │ │ │ -   bool is_connecting () const;
    │ │ │ │ -   bool is_outgoing () const;
    │ │ │ │ -   void disconnect (error_code const& ec, operation_t op
    │ │ │ │ -      , disconnect_severity_t = peer_connection_interface::normal);
    │ │ │ │ -   bool ignore_unchoke_slots () const;
    │ │ │ │ -   bool on_local_network () const;
    │ │ │ │ -   bool failed () const;
    │ │ │ │ -   void peer_log (peer_log_alert::direction_t direction
    │ │ │ │ -      , char const* event, char const* fmt = "", ...) const TORRENT_FORMAT(4,5);
    │ │ │ │ -   bool should_log (peer_log_alert::direction_t direction) const;
    │ │ │ │ -   bool can_disconnect (error_code const& ec) const;
    │ │ │ │ -   bool has_metadata () const;
    │ │ │ │ -   bool in_handshake () const;
    │ │ │ │ -   void send_buffer (char const* begin, int size);
    │ │ │ │ -   std::time_t last_seen_complete () const;
    │ │ │ │ -   time_point time_of_last_unchoke () const;
    │ │ │ │ -   bool operator!= (peer_connection_handle const& o) const;
    │ │ │ │ -   bool operator< (peer_connection_handle const& o) const;
    │ │ │ │ -   bool operator== (peer_connection_handle const& o) const;
    │ │ │ │ -   std::shared_ptr<peer_connection> native_handle () const;
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    bt_peer_connection_handle

    │ │ │ │ -

    Declared in "libtorrent/peer_connection_handle.hpp"

    │ │ │ │ -

    The bt_peer_connection_handle provides a handle to the internal bittorrent │ │ │ │ -peer connection object to plugins. It's low level and may not be a stable API │ │ │ │ -across libtorrent versions.

    │ │ │ │ -
    │ │ │ │ -struct bt_peer_connection_handle : peer_connection_handle
    │ │ │ │ -{
    │ │ │ │ -   explicit bt_peer_connection_handle (peer_connection_handle pc);
    │ │ │ │ -   bool support_extensions () const;
    │ │ │ │ -   bool packet_finished () const;
    │ │ │ │ -   bool supports_encryption () const;
    │ │ │ │ -   void switch_recv_crypto (std::shared_ptr<crypto_plugin> crypto);
    │ │ │ │ -   void switch_send_crypto (std::shared_ptr<crypto_plugin> crypto);
    │ │ │ │ -   std::shared_ptr<bt_peer_connection> native_handle () const;
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    plugin

    │ │ │ │

    Declared in "libtorrent/extensions.hpp"

    │ │ │ │

    this is the base class for a session plugin. One primary feature │ │ │ │ is that it is notified of all torrents that are added to the session, │ │ │ │ and can add its own torrent_plugins.

    │ │ │ │ @@ -10632,15 +10005,15 @@ │ │ │ │

    This function is expected to return a bitmask indicating which features │ │ │ │ this plugin implements. Some callbacks on this object may not be called │ │ │ │ unless the corresponding feature flag is returned here. Note that │ │ │ │ callbacks may still be called even if the corresponding feature is not │ │ │ │ specified in the return value here. See feature_flags_t for possible │ │ │ │ flags to return.

    │ │ │ │ [report issue]
    │ │ │ │ -
    │ │ │ │ +
    │ │ │ │

    new_torrent()

    │ │ │ │
    │ │ │ │  virtual std::shared_ptr<torrent_plugin> new_torrent (torrent_handle const&, client_data_t);
    │ │ │ │  
    │ │ │ │

    this is called by the session every time a new torrent is added. │ │ │ │ The torrent* points to the internal torrent object created │ │ │ │ for the new torrent. The client_data_t is the userdata pointer as │ │ │ │ @@ -10652,15 +10025,15 @@ │ │ │ │

    │ │ │ │

    added()

    │ │ │ │
    │ │ │ │  virtual void added (session_handle const&);
    │ │ │ │  
    │ │ │ │

    called when plugin is added to a session

    │ │ │ │ [report issue]
    │ │ │ │ -
    │ │ │ │ +
    │ │ │ │

    abort()

    │ │ │ │
    │ │ │ │  virtual void abort ();
    │ │ │ │  
    │ │ │ │

    called when the session is aborted │ │ │ │ the plugin should perform any cleanup necessary to allow the session's │ │ │ │ destruction (e.g. cancel outstanding async operations)

    │ │ │ │ @@ -10755,19 +10128,19 @@ │ │ │ │

    Torrent plugins are associated with a single torrent and have a number │ │ │ │ of functions called at certain events. Many of its functions have the │ │ │ │ ability to change or override the default libtorrent behavior.

    │ │ │ │
    │ │ │ │  struct torrent_plugin
    │ │ │ │  {
    │ │ │ │     virtual std::shared_ptr<peer_plugin> new_connection (peer_connection_handle const&);
    │ │ │ │ -   virtual void on_piece_pass (piece_index_t);
    │ │ │ │     virtual void on_piece_failed (piece_index_t);
    │ │ │ │ +   virtual void on_piece_pass (piece_index_t);
    │ │ │ │     virtual void tick ();
    │ │ │ │ -   virtual bool on_resume ();
    │ │ │ │     virtual bool on_pause ();
    │ │ │ │ +   virtual bool on_resume ();
    │ │ │ │     virtual void on_files_checked ();
    │ │ │ │     virtual void on_state (torrent_status::state_t);
    │ │ │ │     virtual void on_add_peer (tcp::endpoint const&,
    │ │ │ │        peer_source_flags_t, add_peer_flags_t);
    │ │ │ │  
    │ │ │ │     static constexpr add_peer_flags_t first_time  = 1_bit;
    │ │ │ │     static constexpr add_peer_flags_t filtered  = 2_bit;
    │ │ │ │ @@ -10791,16 +10164,16 @@
    │ │ │ │  to it, use weak_ptr.

    │ │ │ │

    If this function throws an exception, the connection will be closed.

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    on_piece_pass() on_piece_failed()

    │ │ │ │
    │ │ │ │ -virtual void on_piece_pass (piece_index_t);
    │ │ │ │  virtual void on_piece_failed (piece_index_t);
    │ │ │ │ +virtual void on_piece_pass (piece_index_t);
    │ │ │ │  
    │ │ │ │

    These hooks are called when a piece passes the hash check or fails the hash │ │ │ │ check, respectively. The index is the piece index that was downloaded. │ │ │ │ It is possible to access the list of peers that participated in sending the │ │ │ │ piece through the torrent and the piece_picker.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │ @@ -10811,16 +10184,16 @@ │ │ │ │

    This hook is called approximately once per second. It is a way of making it │ │ │ │ easy for plugins to do timed events, for sending messages or whatever.

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    on_resume() on_pause()

    │ │ │ │
    │ │ │ │ -virtual bool on_resume ();
    │ │ │ │  virtual bool on_pause ();
    │ │ │ │ +virtual bool on_resume ();
    │ │ │ │  
    │ │ │ │

    These hooks are called when the torrent is paused and resumed respectively. │ │ │ │ The return value indicates if the event was handled. A return value of │ │ │ │ true indicates that it was handled, and no other plugin after this one │ │ │ │ will have this hook function called, and the standard handler will also not be │ │ │ │ invoked. So, returning true effectively overrides the standard behavior of │ │ │ │ pause or resume.

    │ │ │ │ @@ -10885,51 +10258,51 @@ │ │ │ │ { │ │ │ │ virtual string_view type () const; │ │ │ │ virtual void add_handshake (entry&); │ │ │ │ virtual void on_disconnect (error_code const&); │ │ │ │ virtual void on_connected (); │ │ │ │ virtual bool on_handshake (span<char const>); │ │ │ │ virtual bool on_extension_handshake (bdecode_node const&); │ │ │ │ - virtual bool on_have_all (); │ │ │ │ virtual bool on_dont_have (piece_index_t); │ │ │ │ - virtual bool on_have_none (); │ │ │ │ virtual bool on_bitfield (bitfield const& /*bitfield*/); │ │ │ │ - virtual bool on_choke (); │ │ │ │ + virtual bool on_have_all (); │ │ │ │ virtual bool on_unchoke (); │ │ │ │ - virtual bool on_request (peer_request const&); │ │ │ │ - virtual bool on_interested (); │ │ │ │ - virtual bool on_not_interested (); │ │ │ │ + virtual bool on_choke (); │ │ │ │ + virtual bool on_have_none (); │ │ │ │ virtual bool on_have (piece_index_t); │ │ │ │ + virtual bool on_interested (); │ │ │ │ virtual bool on_allowed_fast (piece_index_t); │ │ │ │ + virtual bool on_not_interested (); │ │ │ │ + virtual bool on_request (peer_request const&); │ │ │ │ virtual bool on_piece (peer_request const& /*piece*/ │ │ │ │ , span<char const> /*buf*/); │ │ │ │ virtual bool on_reject (peer_request const&); │ │ │ │ - virtual bool on_suggest (piece_index_t); │ │ │ │ virtual bool on_cancel (peer_request const&); │ │ │ │ - virtual void sent_have_all (); │ │ │ │ + virtual bool on_suggest (piece_index_t); │ │ │ │ + virtual void sent_reject_request (peer_request const&); │ │ │ │ virtual void sent_suggest (piece_index_t); │ │ │ │ - virtual void sent_allow_fast (piece_index_t); │ │ │ │ - virtual void sent_cancel (peer_request const&); │ │ │ │ + virtual void sent_have_all (); │ │ │ │ + virtual void sent_have_none (); │ │ │ │ virtual void sent_request (peer_request const&); │ │ │ │ + virtual void sent_cancel (peer_request const&); │ │ │ │ virtual void sent_choke (); │ │ │ │ - virtual void sent_reject_request (peer_request const&); │ │ │ │ - virtual void sent_have_none (); │ │ │ │ - virtual void sent_not_interested (); │ │ │ │ - virtual void sent_interested (); │ │ │ │ + virtual void sent_allow_fast (piece_index_t); │ │ │ │ virtual void sent_piece (peer_request const&); │ │ │ │ virtual void sent_unchoke (); │ │ │ │ + virtual void sent_not_interested (); │ │ │ │ virtual void sent_have (piece_index_t); │ │ │ │ + virtual void sent_interested (); │ │ │ │ virtual void sent_payload (int /* bytes */); │ │ │ │ virtual bool can_disconnect (error_code const& /*ec*/); │ │ │ │ virtual bool on_extended (int /*length*/, int /*msg*/, │ │ │ │ span<char const> /*body*/); │ │ │ │ virtual bool on_unknown_message (int /*length*/, int /*msg*/, │ │ │ │ span<char const> /*body*/); │ │ │ │ - virtual void on_piece_pass (piece_index_t); │ │ │ │ virtual void on_piece_failed (piece_index_t); │ │ │ │ + virtual void on_piece_pass (piece_index_t); │ │ │ │ virtual void tick (); │ │ │ │ virtual bool write_request (peer_request const&); │ │ │ │ }; │ │ │ │
    │ │ │ │ [report issue]
    │ │ │ │

    type()

    │ │ │ │
    │ │ │ │ @@ -10979,39 +10352,39 @@
    │ │ │ │  virtual bool on_extension_handshake (bdecode_node const&);
    │ │ │ │  
    │ │ │ │

    called when the extension handshake from the other end is received │ │ │ │ if this returns false, it means that this extension isn't │ │ │ │ supported by this peer. It will result in this peer_plugin │ │ │ │ being removed from the peer_connection and destructed. │ │ │ │ this is not called for web seeds

    │ │ │ │ - │ │ │ │ - │ │ │ │ │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    on_dont_have() on_bitfield() on_interested() on_have_all() on_allowed_fast() on_unchoke() on_not_interested() on_request() on_choke() on_have() on_have_none()

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    on_interested() on_choke() on_bitfield() on_have_none() on_have_all() on_dont_have() on_have() on_allowed_fast() on_unchoke() on_not_interested() on_request()

    │ │ │ │
    │ │ │ │ -virtual bool on_have_all ();
    │ │ │ │  virtual bool on_dont_have (piece_index_t);
    │ │ │ │ -virtual bool on_have_none ();
    │ │ │ │  virtual bool on_bitfield (bitfield const& /*bitfield*/);
    │ │ │ │ -virtual bool on_choke ();
    │ │ │ │ +virtual bool on_have_all ();
    │ │ │ │  virtual bool on_unchoke ();
    │ │ │ │ -virtual bool on_request (peer_request const&);
    │ │ │ │ -virtual bool on_interested ();
    │ │ │ │ -virtual bool on_not_interested ();
    │ │ │ │ +virtual bool on_choke ();
    │ │ │ │ +virtual bool on_have_none ();
    │ │ │ │  virtual bool on_have (piece_index_t);
    │ │ │ │ +virtual bool on_interested ();
    │ │ │ │  virtual bool on_allowed_fast (piece_index_t);
    │ │ │ │ +virtual bool on_not_interested ();
    │ │ │ │ +virtual bool on_request (peer_request const&);
    │ │ │ │  
    │ │ │ │

    returning true from any of the message handlers │ │ │ │ indicates that the plugin has handled the message. │ │ │ │ it will break the plugin chain traversing and not let │ │ │ │ anyone else handle the message, including the default │ │ │ │ handler.

    │ │ │ │ [report issue]
    │ │ │ │ @@ -11024,26 +10397,26 @@ │ │ │ │

    This function is called when the peer connection is receiving │ │ │ │ a piece. buf points (non-owning pointer) to the data in an │ │ │ │ internal immutable disk buffer. The length of the data is specified │ │ │ │ in the length member of the piece parameter. │ │ │ │ returns true to indicate that the piece is handled and the │ │ │ │ rest of the logic should be ignored.

    │ │ │ │ │ │ │ │ - │ │ │ │ │ │ │ │ + │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    sent_unchoke() sent_piece() sent_have() sent_not_interested() sent_interested()

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    sent_unchoke() sent_have() sent_piece() sent_not_interested() sent_interested()

    │ │ │ │
    │ │ │ │ -virtual void sent_not_interested ();
    │ │ │ │ -virtual void sent_interested ();
    │ │ │ │  virtual void sent_piece (peer_request const&);
    │ │ │ │  virtual void sent_unchoke ();
    │ │ │ │ +virtual void sent_not_interested ();
    │ │ │ │  virtual void sent_have (piece_index_t);
    │ │ │ │ +virtual void sent_interested ();
    │ │ │ │  
    │ │ │ │

    called after a choke message has been sent to the peer

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    sent_payload()

    │ │ │ │
    │ │ │ │  virtual void sent_payload (int /* bytes */);
    │ │ │ │ @@ -11084,16 +10457,16 @@
    │ │ │ │  
    │ │ │ │

    this is not called for web seeds

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    on_piece_pass() on_piece_failed()

    │ │ │ │
    │ │ │ │ -virtual void on_piece_pass (piece_index_t);
    │ │ │ │  virtual void on_piece_failed (piece_index_t);
    │ │ │ │ +virtual void on_piece_pass (piece_index_t);
    │ │ │ │  
    │ │ │ │

    called when a piece that this peer participated in either │ │ │ │ fails or passes the hash_check

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    tick()

    │ │ │ │
    │ │ │ │ @@ -11113,16 +10486,16 @@
    │ │ │ │  
    │ │ │ │
    │ │ │ │

    crypto_plugin

    │ │ │ │

    Declared in "libtorrent/extensions.hpp"

    │ │ │ │
    │ │ │ │  struct crypto_plugin
    │ │ │ │  {
    │ │ │ │ -   virtual void set_outgoing_key (span<char const> key) = 0;
    │ │ │ │     virtual void set_incoming_key (span<char const> key) = 0;
    │ │ │ │ +   virtual void set_outgoing_key (span<char const> key) = 0;
    │ │ │ │     encrypt (span<span<char>> /*send_vec*/) = 0;
    │ │ │ │     virtual std::tuple<int, int, int> decrypt (span<span<char>> /*receive_vec*/) = 0;
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ [report issue]
    │ │ │ │

    decrypt()

    │ │ │ │
    │ │ │ │ @@ -11133,42 +10506,112 @@
    │ │ │ │  (consume, produce, packet_size)

    │ │ │ │

    consume is set to the number of bytes which should be trimmed from the │ │ │ │ head of the buffers, default is 0

    │ │ │ │

    produce is set to the number of bytes of payload which are now ready to │ │ │ │ be sent to the upper layer. default is the number of bytes passed in receive_vec

    │ │ │ │

    packet_size is set to the minimum number of bytes which must be read to │ │ │ │ advance the next step of decryption. default is 0

    │ │ │ │ -[report issue]
    │ │ │ │ +[report issue]
    │ │ │ │
    │ │ │ │ -
    │ │ │ │ -

    create_smart_ban_plugin()

    │ │ │ │ -

    Declared in "libtorrent/extensions/smart_ban.hpp"

    │ │ │ │ +
    │ │ │ │ +

    peer_connection_handle

    │ │ │ │ +

    Declared in "libtorrent/peer_connection_handle.hpp"

    │ │ │ │ +

    the peer_connection_handle class provides a handle to the internal peer │ │ │ │ +connection object, to be used by plugins. This is a low level interface that │ │ │ │ +may not be stable across libtorrent versions

    │ │ │ │
    │ │ │ │ -std::shared_ptr<torrent_plugin> create_smart_ban_plugin (torrent_handle const&, client_data_t);
    │ │ │ │ +struct peer_connection_handle
    │ │ │ │ +{
    │ │ │ │ +   explicit peer_connection_handle (std::weak_ptr<peer_connection> impl);
    │ │ │ │ +   connection_type type () const;
    │ │ │ │ +   void add_extension (std::shared_ptr<peer_plugin>);
    │ │ │ │ +   peer_plugin const* find_plugin (string_view type) const;
    │ │ │ │ +   bool is_seed () const;
    │ │ │ │ +   bool upload_only () const;
    │ │ │ │ +   bool has_piece (piece_index_t i) const;
    │ │ │ │ +   peer_id const& pid () const;
    │ │ │ │ +   bool is_interesting () const;
    │ │ │ │ +   bool is_choked () const;
    │ │ │ │ +   bool is_peer_interested () const;
    │ │ │ │ +   bool has_peer_choked () const;
    │ │ │ │ +   void maybe_unchoke_this_peer ();
    │ │ │ │ +   void choke_this_peer ();
    │ │ │ │ +   void get_peer_info (peer_info& p) const;
    │ │ │ │ +   torrent_handle associated_torrent () const;
    │ │ │ │ +   tcp::endpoint const& remote () const;
    │ │ │ │ +   tcp::endpoint local_endpoint () const;
    │ │ │ │ +   void disconnect (error_code const& ec, operation_t op
    │ │ │ │ +      , disconnect_severity_t = peer_connection_interface::normal);
    │ │ │ │ +   bool is_outgoing () const;
    │ │ │ │ +   bool is_disconnecting () const;
    │ │ │ │ +   bool is_connecting () const;
    │ │ │ │ +   bool on_local_network () const;
    │ │ │ │ +   bool ignore_unchoke_slots () const;
    │ │ │ │ +   bool failed () const;
    │ │ │ │ +   bool should_log (peer_log_alert::direction_t direction) const;
    │ │ │ │ +   void peer_log (peer_log_alert::direction_t direction
    │ │ │ │ +      , char const* event, char const* fmt = "", ...) const TORRENT_FORMAT(4,5);
    │ │ │ │ +   bool can_disconnect (error_code const& ec) const;
    │ │ │ │ +   bool has_metadata () const;
    │ │ │ │ +   bool in_handshake () const;
    │ │ │ │ +   void send_buffer (char const* begin, int size);
    │ │ │ │ +   std::time_t last_seen_complete () const;
    │ │ │ │ +   time_point time_of_last_unchoke () const;
    │ │ │ │ +   bool operator< (peer_connection_handle const& o) const;
    │ │ │ │ +   bool operator!= (peer_connection_handle const& o) const;
    │ │ │ │ +   bool operator== (peer_connection_handle const& o) const;
    │ │ │ │ +   std::shared_ptr<peer_connection> native_handle () const;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    bt_peer_connection_handle

    │ │ │ │ +

    Declared in "libtorrent/peer_connection_handle.hpp"

    │ │ │ │ +

    The bt_peer_connection_handle provides a handle to the internal bittorrent │ │ │ │ +peer connection object to plugins. It's low level and may not be a stable API │ │ │ │ +across libtorrent versions.

    │ │ │ │ +
    │ │ │ │ +struct bt_peer_connection_handle : peer_connection_handle
    │ │ │ │ +{
    │ │ │ │ +   explicit bt_peer_connection_handle (peer_connection_handle pc);
    │ │ │ │ +   bool support_extensions () const;
    │ │ │ │ +   bool packet_finished () const;
    │ │ │ │ +   bool supports_encryption () const;
    │ │ │ │ +   void switch_recv_crypto (std::shared_ptr<crypto_plugin> crypto);
    │ │ │ │ +   void switch_send_crypto (std::shared_ptr<crypto_plugin> crypto);
    │ │ │ │ +   std::shared_ptr<bt_peer_connection> native_handle () const;
    │ │ │ │ +};
    │ │ │ │  
    │ │ │ │ -

    constructor function for the smart ban extension. The extension keeps │ │ │ │ -track of the data peers have sent us for failing pieces and once the │ │ │ │ -piece completes and passes the hash check bans the peers that turned │ │ │ │ -out to have sent corrupt data. │ │ │ │ -This function can either be passed in the add_torrent_params::extensions │ │ │ │ -field, or via torrent_handle::add_extension().

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    create_ut_pex_plugin()

    │ │ │ │

    Declared in "libtorrent/extensions/ut_pex.hpp"

    │ │ │ │
    │ │ │ │  std::shared_ptr<torrent_plugin> create_ut_pex_plugin (torrent_handle const&, client_data_t);
    │ │ │ │  
    │ │ │ │

    constructor function for the ut_pex extension. The ut_pex │ │ │ │ extension allows peers to gossip about their connections, allowing │ │ │ │ the swarm stay well connected and peers aware of more peers in the │ │ │ │ swarm. This extension is enabled by default unless explicitly disabled in │ │ │ │ the session constructor.

    │ │ │ │

    This can either be passed in the add_torrent_params::extensions field, or │ │ │ │ via torrent_handle::add_extension().

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    create_smart_ban_plugin()

    │ │ │ │ +

    Declared in "libtorrent/extensions/smart_ban.hpp"

    │ │ │ │ +
    │ │ │ │ +std::shared_ptr<torrent_plugin> create_smart_ban_plugin (torrent_handle const&, client_data_t);
    │ │ │ │ +
    │ │ │ │ +

    constructor function for the smart ban extension. The extension keeps │ │ │ │ +track of the data peers have sent us for failing pieces and once the │ │ │ │ +piece completes and passes the hash check bans the peers that turned │ │ │ │ +out to have sent corrupt data. │ │ │ │ +This function can either be passed in the add_torrent_params::extensions │ │ │ │ +field, or via torrent_handle::add_extension().

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    create_ut_metadata_plugin()

    │ │ │ │

    Declared in "libtorrent/extensions/ut_metadata.hpp"

    │ │ │ │
    │ │ │ │  std::shared_ptr<torrent_plugin> create_ut_metadata_plugin (torrent_handle const&, client_data_t);
    │ │ │ │  
    │ │ │ │ @@ -11176,651 +10619,1275 @@ │ │ │ │ extension allows peers to request the .torrent file (or more │ │ │ │ specifically the info-dictionary of the .torrent file) from each │ │ │ │ other. This is the main building block in making magnet links work. │ │ │ │ This extension is enabled by default unless explicitly disabled in │ │ │ │ the session constructor.

    │ │ │ │

    This can either be passed in the add_torrent_params::extensions field, or │ │ │ │ via torrent_handle::add_extension().

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    torrent_status

    │ │ │ │ -

    Declared in "libtorrent/torrent_status.hpp"

    │ │ │ │ -

    holds a snapshot of the status of a torrent, as queried by │ │ │ │ -torrent_handle::status().

    │ │ │ │ +

    This section describes the functions and classes that are used │ │ │ │ +to create torrent files. It is a layered API with low level classes │ │ │ │ +and higher level convenience functions. A torrent is created in 4 │ │ │ │ +steps:

    │ │ │ │ +
      │ │ │ │ +
    1. first the files that will be part of the torrent are determined.
    2. │ │ │ │ +
    3. the torrent properties are set, such as tracker url, web seeds, │ │ │ │ +DHT nodes etc.
    4. │ │ │ │ +
    5. Read through all the files in the torrent, SHA-1 all the data │ │ │ │ +and set the piece hashes.
    6. │ │ │ │ +
    7. The torrent is bencoded into a file or buffer.
    8. │ │ │ │ +
    │ │ │ │ +

    If there are a lot of files and or deep directory hierarchies to │ │ │ │ +traverse, step one can be time consuming.

    │ │ │ │ +

    Typically step 3 is by far the most time consuming step, since it │ │ │ │ +requires to read all the bytes from all the files in the torrent.

    │ │ │ │ +

    All of these classes and functions are declared by including │ │ │ │ +libtorrent/create_torrent.hpp.

    │ │ │ │ +

    example:

    │ │ │ │ +
    │ │ │ │ +file_storage fs;
    │ │ │ │ +
    │ │ │ │ +// recursively adds files in directories
    │ │ │ │ +add_files(fs, "./my_torrent");
    │ │ │ │ +
    │ │ │ │ +create_torrent t(fs);
    │ │ │ │ +t.add_tracker("http://my.tracker.com/announce");
    │ │ │ │ +t.set_creator("libtorrent example");
    │ │ │ │ +
    │ │ │ │ +// reads the files and calculates the hashes
    │ │ │ │ +set_piece_hashes(t, ".");
    │ │ │ │ +
    │ │ │ │ +ofstream out("my_torrent.torrent", std::ios_base::binary);
    │ │ │ │ +std::vector<char> buf = t.generate_buf();
    │ │ │ │ +out.write(buf.data(), buf.size());
    │ │ │ │ +
    │ │ │ │ +// alternatively, generate an entry and encode it directly to an ostream
    │ │ │ │ +// iterator
    │ │ │ │ +bencode(std::ostream_iterator<char>(out), t.generate());
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    create_torrent

    │ │ │ │ +

    Declared in "libtorrent/create_torrent.hpp"

    │ │ │ │ +

    This class holds state for creating a torrent. After having added │ │ │ │ +all information to it, call create_torrent::generate() to generate │ │ │ │ +the torrent. The entry that's returned can then be bencoded into a │ │ │ │ +.torrent file using bencode().

    │ │ │ │
    │ │ │ │ -struct torrent_status
    │ │ │ │ +struct create_torrent
    │ │ │ │  {
    │ │ │ │ -   bool operator== (torrent_status const& st) const;
    │ │ │ │ +   explicit create_torrent (torrent_info const& ti);
    │ │ │ │ +   explicit create_torrent (file_storage& fs, int piece_size = 0
    │ │ │ │ +      , create_flags_t flags = {});
    │ │ │ │ +   entry generate () const;
    │ │ │ │ +   std::vector<char> generate_buf () const;
    │ │ │ │ +   file_storage const& files () const;
    │ │ │ │ +   void set_comment (char const* str);
    │ │ │ │ +   void set_creator (char const* str);
    │ │ │ │ +   void set_creation_date (std::time_t timestamp);
    │ │ │ │ +   void set_hash (piece_index_t index, sha1_hash const& h);
    │ │ │ │ +   void set_hash2 (file_index_t file, piece_index_t::diff_type piece, sha256_hash const& h);
    │ │ │ │ +   void add_url_seed (string_view url);
    │ │ │ │ +   void add_http_seed (string_view url);
    │ │ │ │ +   void add_node (std::pair<std::string, int> node);
    │ │ │ │ +   void add_tracker (string_view url, int tier = 0);
    │ │ │ │ +   void set_root_cert (string_view cert);
    │ │ │ │ +   bool priv () const;
    │ │ │ │ +   void set_priv (bool p);
    │ │ │ │ +   bool is_v1_only () const;
    │ │ │ │ +   bool is_v2_only () const;
    │ │ │ │ +   int num_pieces () const;
    │ │ │ │ +   piece_index_t end_piece () const;
    │ │ │ │ +   index_range<piece_index_t> piece_range () const noexcept;
    │ │ │ │ +   file_index_t end_file () const;
    │ │ │ │ +   index_range<file_index_t> file_range () const noexcept;
    │ │ │ │ +   index_range<piece_index_t::diff_type> file_piece_range (file_index_t f);
    │ │ │ │ +   std::int64_t total_size () const;
    │ │ │ │ +   int piece_size (piece_index_t i) const;
    │ │ │ │ +   int piece_length () const;
    │ │ │ │ +   void add_similar_torrent (sha1_hash ih);
    │ │ │ │ +   void add_collection (string_view c);
    │ │ │ │  
    │ │ │ │ -   enum state_t
    │ │ │ │ +   static constexpr create_flags_t modification_time  = 2_bit;
    │ │ │ │ +   static constexpr create_flags_t symlinks  = 3_bit;
    │ │ │ │ +   static constexpr create_flags_t v2_only  = 5_bit;
    │ │ │ │ +   static constexpr create_flags_t v1_only  = 6_bit;
    │ │ │ │ +   static constexpr create_flags_t canonical_files  = 7_bit;
    │ │ │ │ +   static constexpr create_flags_t no_attributes  = 8_bit;
    │ │ │ │ +   static constexpr create_flags_t canonical_files_no_tail_padding  = 9_bit;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +

    create_torrent()

    │ │ │ │ +
    │ │ │ │ +explicit create_torrent (torrent_info const& ti);
    │ │ │ │ +explicit create_torrent (file_storage& fs, int piece_size = 0
    │ │ │ │ +      , create_flags_t flags = {});
    │ │ │ │ +
    │ │ │ │ +

    The piece_size is the size of each piece in bytes. It must be a │ │ │ │ +power of 2 and a minimum of 16 kiB. If a piece size of 0 is │ │ │ │ +specified, a piece_size will be set automatically. │ │ │ │ +Piece sizes greater than 128 MiB are considered unreasonable and will │ │ │ │ +be rejected (with an lt::system_error exception).

    │ │ │ │ +

    The flags arguments specifies options for the torrent creation. It can │ │ │ │ +be any combination of the flags defined by create_flags_t.

    │ │ │ │ +

    The file_storage (fs) parameter defines the files, sizes and │ │ │ │ +their properties for the torrent to be created. Set this up first, │ │ │ │ +before passing it to the create_torrent constructor.

    │ │ │ │ +

    The overload that takes a torrent_info object will make a verbatim │ │ │ │ +copy of its info dictionary (to preserve the info-hash). The copy of │ │ │ │ +the info dictionary will be used by create_torrent::generate(). This means │ │ │ │ +that none of the member functions of create_torrent that affects │ │ │ │ +the content of the info dictionary (such as set_hash()), will │ │ │ │ +have any affect. Instead of using this overload, consider using │ │ │ │ +write_torrent_file() instead.

    │ │ │ │ +
    │ │ │ │ +

    Warning

    │ │ │ │ +

    The file_storage and torrent_info objects must stay alive for the │ │ │ │ +entire duration of the create_torrent object.

    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    generate() generate_buf()

    │ │ │ │ +
    │ │ │ │ +entry generate () const;
    │ │ │ │ +std::vector<char> generate_buf () const;
    │ │ │ │ +
    │ │ │ │ +

    This function will generate the .torrent file as a bencode tree, or a │ │ │ │ +bencoded into a buffer. │ │ │ │ +In order to encode the entry into a flat file, use the bencode() function.

    │ │ │ │ +

    The function returning an entry may be useful to add custom entries │ │ │ │ +to the torrent file before bencoding it and saving it to disk.

    │ │ │ │ +

    Whether the resulting torrent object is v1, v2 or hybrid depends on │ │ │ │ +whether any of the v1_only or v2_only flags were set on the │ │ │ │ +constructor. If neither were set, the resulting torrent depends on │ │ │ │ +which hashes were set. If both v1 and v2 hashes were set, a hybrid │ │ │ │ +torrent is created.

    │ │ │ │ +

    Any failure will cause this function to throw system_error, with an │ │ │ │ +appropriate error message. These are the reasons this call may throw:

    │ │ │ │ +
      │ │ │ │ +
    • the file storage has 0 files
    • │ │ │ │ +
    • the total size of the file storage is 0 bytes (i.e. it only has │ │ │ │ +empty files)
    • │ │ │ │ +
    • not all v1 hashes (set_hash()) and not all v2 hashes (set_hash2()) │ │ │ │ +were set
    • │ │ │ │ +
    • for v2 torrents, you may not have a directory with the same name as │ │ │ │ +a file. If that's encountered in the file storage, generate() │ │ │ │ +fails.
    • │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    files()

    │ │ │ │ +
    │ │ │ │ +file_storage const& files () const;
    │ │ │ │ +
    │ │ │ │ +

    returns an immutable reference to the file_storage used to create │ │ │ │ +the torrent from.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_comment()

    │ │ │ │ +
    │ │ │ │ +void set_comment (char const* str);
    │ │ │ │ +
    │ │ │ │ +

    Sets the comment for the torrent. The string str should be utf-8 encoded. │ │ │ │ +The comment in a torrent file is optional.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_creator()

    │ │ │ │ +
    │ │ │ │ +void set_creator (char const* str);
    │ │ │ │ +
    │ │ │ │ +

    Sets the creator of the torrent. The string str should be utf-8 encoded. │ │ │ │ +This is optional.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_creation_date()

    │ │ │ │ +
    │ │ │ │ +void set_creation_date (std::time_t timestamp);
    │ │ │ │ +
    │ │ │ │ +

    sets the "creation time" field. Defaults to the system clock at the │ │ │ │ +time of construction of the create_torrent object. The timestamp is │ │ │ │ +specified in seconds, posix time. If the creation date is set to 0, │ │ │ │ +the "creation date" field will be omitted from the generated torrent.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_hash()

    │ │ │ │ +
    │ │ │ │ +void set_hash (piece_index_t index, sha1_hash const& h);
    │ │ │ │ +
    │ │ │ │ +

    This sets the SHA-1 hash for the specified piece (index). You are required │ │ │ │ +to set the hash for every piece in the torrent before generating it. If you have │ │ │ │ +the files on disk, you can use the high level convenience function to do this. │ │ │ │ +See set_piece_hashes(). │ │ │ │ +A SHA-1 hash of all zeros is internally used to indicate a hash that │ │ │ │ +has not been set. Setting such hash will not be considered set when │ │ │ │ +calling generate(). │ │ │ │ +This function will throw std::system_error if it is called on an │ │ │ │ +object constructed with the v2_only flag.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_hash2()

    │ │ │ │ +
    │ │ │ │ +void set_hash2 (file_index_t file, piece_index_t::diff_type piece, sha256_hash const& h);
    │ │ │ │ +
    │ │ │ │ +

    sets the bittorrent v2 hash for file file of the piece piece. │ │ │ │ +piece is relative to the first piece of the file, starting at 0. The │ │ │ │ +first piece in the file can be computed with │ │ │ │ +file_storage::file_index_at_piece(). │ │ │ │ +The hash, h, is the root of the merkle tree formed by the piece's │ │ │ │ +16 kiB blocks. Note that piece sizes must be powers-of-2, so all │ │ │ │ +per-piece merkle trees are complete. │ │ │ │ +A SHA-256 hash of all zeros is internally used to indicate a hash │ │ │ │ +that has not been set. Setting such hash will not be considered set │ │ │ │ +when calling generate(). │ │ │ │ +This function will throw std::system_error if it is called on an │ │ │ │ +object constructed with the v1_only flag.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    add_http_seed() add_url_seed()

    │ │ │ │ +
    │ │ │ │ +void add_url_seed (string_view url);
    │ │ │ │ +void add_http_seed (string_view url);
    │ │ │ │ +
    │ │ │ │ +

    This adds a url seed to the torrent. You can have any number of url seeds. For a │ │ │ │ +single file torrent, this should be an HTTP url, pointing to a file with identical │ │ │ │ +content as the file of the torrent. For a multi-file torrent, it should point to │ │ │ │ +a directory containing a directory with the same name as this torrent, and all the │ │ │ │ +files of the torrent in it.

    │ │ │ │ +

    The second function, add_http_seed() adds an HTTP seed instead.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    add_node()

    │ │ │ │ +
    │ │ │ │ +void add_node (std::pair<std::string, int> node);
    │ │ │ │ +
    │ │ │ │ +

    This adds a DHT node to the torrent. This especially useful if you're creating a │ │ │ │ +tracker less torrent. It can be used by clients to bootstrap their DHT node from. │ │ │ │ +The node is a hostname and a port number where there is a DHT node running. │ │ │ │ +You can have any number of DHT nodes in a torrent.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    add_tracker()

    │ │ │ │ +
    │ │ │ │ +void add_tracker (string_view url, int tier = 0);
    │ │ │ │ +
    │ │ │ │ +

    Adds a tracker to the torrent. This is not strictly required, but most torrents │ │ │ │ +use a tracker as their main source of peers. The url should be an http:// or udp:// │ │ │ │ +url to a machine running a bittorrent tracker that accepts announces for this torrent's │ │ │ │ +info-hash. The tier is the fallback priority of the tracker. All trackers with tier 0 are │ │ │ │ +tried first (in any order). If all fail, trackers with tier 1 are tried. If all of those │ │ │ │ +fail, trackers with tier 2 are tried, and so on.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_root_cert()

    │ │ │ │ +
    │ │ │ │ +void set_root_cert (string_view cert);
    │ │ │ │ +
    │ │ │ │ +

    This function sets an X.509 certificate in PEM format to the torrent. This makes the │ │ │ │ +torrent an SSL torrent. An SSL torrent requires that each peer has a valid certificate │ │ │ │ +signed by this root certificate. For SSL torrents, all peers are connecting over SSL │ │ │ │ +connections. For more information, see the section on ssl torrents.

    │ │ │ │ +

    The string is not the path to the cert, it's the actual content of the │ │ │ │ +certificate.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    priv() set_priv()

    │ │ │ │ +
    │ │ │ │ +bool priv () const;
    │ │ │ │ +void set_priv (bool p);
    │ │ │ │ +
    │ │ │ │ +

    Sets and queries the private flag of the torrent. │ │ │ │ +Torrents with the private flag set ask the client to not use any other │ │ │ │ +sources than the tracker for peers, and to not use DHT to advertise itself publicly, │ │ │ │ +only the tracker.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    num_pieces()

    │ │ │ │ +
    │ │ │ │ +int num_pieces () const;
    │ │ │ │ +
    │ │ │ │ +

    returns the number of pieces in the associated file_storage object.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    piece_range()

    │ │ │ │ +
    │ │ │ │ +index_range<piece_index_t> piece_range () const noexcept;
    │ │ │ │ +
    │ │ │ │ +

    all piece indices in the torrent to be created

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    file_range()

    │ │ │ │ +
    │ │ │ │ +index_range<file_index_t> file_range () const noexcept;
    │ │ │ │ +
    │ │ │ │ +

    all file indices in the torrent to be created

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    file_piece_range()

    │ │ │ │ +
    │ │ │ │ +index_range<piece_index_t::diff_type> file_piece_range (file_index_t f);
    │ │ │ │ +
    │ │ │ │ +

    for v2 and hybrid torrents only, the pieces in the │ │ │ │ +specified file, specified as delta from the first piece in the file. │ │ │ │ +i.e. the first index is 0.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    total_size()

    │ │ │ │ +
    │ │ │ │ +std::int64_t total_size () const;
    │ │ │ │ +
    │ │ │ │ +

    the total number of bytes of all files and pad files

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    piece_size() piece_length()

    │ │ │ │ +
    │ │ │ │ +int piece_size (piece_index_t i) const;
    │ │ │ │ +int piece_length () const;
    │ │ │ │ +
    │ │ │ │ +

    piece_length() returns the piece size of all pieces but the │ │ │ │ +last one. piece_size() returns the size of the specified piece. │ │ │ │ +these functions are just forwarding to the associated file_storage.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    add_similar_torrent() add_collection()

    │ │ │ │ +
    │ │ │ │ +void add_similar_torrent (sha1_hash ih);
    │ │ │ │ +void add_collection (string_view c);
    │ │ │ │ +
    │ │ │ │ +

    Add similar torrents (by info-hash) or collections of similar torrents. │ │ │ │ +Similar torrents are expected to share some files with this torrent. │ │ │ │ +Torrents sharing a collection name with this torrent are also expected │ │ │ │ +to share files with this torrent. A torrent may have more than one │ │ │ │ +collection and more than one similar torrents. For more information, │ │ │ │ +see BEP 38.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    modification_time
    │ │ │ │ +
    This will include the file modification time as part of the torrent. │ │ │ │ +This is not enabled by default, as it might cause problems when you │ │ │ │ +create a torrent from separate files with the same content, hoping to │ │ │ │ +yield the same info-hash. If the files have different modification times, │ │ │ │ +with this option enabled, you would get different info-hashes for the │ │ │ │ +files.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    symlinks
    │ │ │ │ +
    If this flag is set, files that are symlinks get a symlink attribute │ │ │ │ +set on them and their data will not be included in the torrent. This │ │ │ │ +is useful if you need to reconstruct a file hierarchy which contains │ │ │ │ +symlinks.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    v2_only
    │ │ │ │ +
    Do not generate v1 metadata. The resulting torrent will only be usable by │ │ │ │ +clients which support v2. This requires setting all v2 hashes, with │ │ │ │ +set_hash2() before calling generate(). Setting v1 hashes (with │ │ │ │ +set_hash()) is an error with this flag set.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    v1_only
    │ │ │ │ +
    do not generate v2 metadata or enforce v2 alignment and padding rules │ │ │ │ +this is mainly for tests, not recommended for production use. This │ │ │ │ +requires setting all v1 hashes, with set_hash(), before calling │ │ │ │ +generate(). Setting v2 hashes (with set_hash2()) is an error with │ │ │ │ +this flag set.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    canonical_files
    │ │ │ │ +
    This flag only affects v1-only torrents, and is only relevant │ │ │ │ +together with the v1_only_flag. This flag will force the │ │ │ │ +same file order and padding as a v2 (or hybrid) torrent would have. │ │ │ │ +It has the effect of ordering files and inserting pad files to align │ │ │ │ +them with piece boundaries.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    no_attributes
    │ │ │ │ +
    passing this flag to add_files() will ignore file attributes (such as │ │ │ │ +executable or hidden) when adding the files to the file storage. │ │ │ │ +Since not all filesystems and operating systems support all file │ │ │ │ +attributes the resulting torrent may differ depending on where it's │ │ │ │ +created. If it's important for torrents to be created consistently │ │ │ │ +across systems, this flag should be set.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    canonical_files_no_tail_padding
    │ │ │ │ +
    this flag enforces the file layout to be canonical according to the │ │ │ │ +bittorrent v2 specification (just like the canonical_files flag) │ │ │ │ +with the one exception that tail padding is not added to the last │ │ │ │ +file. │ │ │ │ +This behavior deviates from the specification but was the way │ │ │ │ +libtorrent created torrents in version up to and including 2.0.7. │ │ │ │ +This flag is here for backwards compatibility.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    add_files()

    │ │ │ │ +

    Declared in "libtorrent/create_torrent.hpp"

    │ │ │ │ +
    │ │ │ │ +void add_files (file_storage& fs, std::string const& file
    │ │ │ │ +   , std::function<bool(std::string)> p, create_flags_t flags = {});
    │ │ │ │ +void add_files (file_storage& fs, std::string const& file
    │ │ │ │ +   , create_flags_t flags = {});
    │ │ │ │ +
    │ │ │ │ +

    Adds the file specified by path to the file_storage object. In case path │ │ │ │ +refers to a directory, files will be added recursively from the directory.

    │ │ │ │ +

    If specified, the predicate p is called once for every file and directory that │ │ │ │ +is encountered. Files for which p returns true are added, and directories for │ │ │ │ +which p returns true are traversed. p must have the following signature:

    │ │ │ │ +
    │ │ │ │ +bool Pred(std::string const& p);
    │ │ │ │ +
    │ │ │ │ +

    The path that is passed in to the predicate is the full path of the file or │ │ │ │ +directory. If no predicate is specified, all files are added, and all directories │ │ │ │ +are traversed.

    │ │ │ │ +

    The ".." directory is never traversed.

    │ │ │ │ +

    The flags argument should be the same as the flags passed to the create_torrent │ │ │ │ +constructor.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_piece_hashes()

    │ │ │ │ +

    Declared in "libtorrent/create_torrent.hpp"

    │ │ │ │ +
    │ │ │ │ +void set_piece_hashes (create_torrent& t, std::string const& p
    │ │ │ │ +   , std::function<void(piece_index_t)> const& f, error_code& ec);
    │ │ │ │ +inline void set_piece_hashes (create_torrent& t, std::string const& p, error_code& ec);
    │ │ │ │ +void set_piece_hashes (create_torrent& t, std::string const& p
    │ │ │ │ +   , settings_interface const& settings, disk_io_constructor_type disk_io
    │ │ │ │ +   , std::function<void(piece_index_t)> const& f, error_code& ec);
    │ │ │ │ +void set_piece_hashes (create_torrent& t, std::string const& p
    │ │ │ │ +   , settings_interface const& settings
    │ │ │ │ +   , std::function<void(piece_index_t)> const& f, error_code& ec);
    │ │ │ │ +inline void set_piece_hashes (create_torrent& t, std::string const& p
    │ │ │ │ +   , std::function<void(piece_index_t)> const& f);
    │ │ │ │ +inline void set_piece_hashes (create_torrent& t, std::string const& p);
    │ │ │ │ +inline void set_piece_hashes (create_torrent& t, std::string const& p
    │ │ │ │ +   , settings_interface const& settings
    │ │ │ │ +   , std::function<void(piece_index_t)> const& f);
    │ │ │ │ +
    │ │ │ │ +

    This function will assume that the files added to the torrent file exists at path │ │ │ │ +p, read those files and hash the content and set the hashes in the create_torrent │ │ │ │ +object. The optional function f is called in between every hash that is set. f │ │ │ │ +must have the following signature:

    │ │ │ │ +
    │ │ │ │ +void Fun(piece_index_t);
    │ │ │ │ +
    │ │ │ │ +

    The overloads taking a settings_pack may be used to configure the │ │ │ │ +underlying disk access. Such as settings_pack::aio_threads.

    │ │ │ │ +

    The overloads that don't take an error_code& may throw an exception in case of a │ │ │ │ +file error, the other overloads sets the error code to reflect the error, if any.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    ip_filter

    │ │ │ │ +

    Declared in "libtorrent/ip_filter.hpp"

    │ │ │ │ +

    The ip_filter class is a set of rules that uniquely categorizes all │ │ │ │ +ip addresses as allowed or disallowed. The default constructor creates │ │ │ │ +a single rule that allows all addresses (0.0.0.0 - 255.255.255.255 for │ │ │ │ +the IPv4 range, and the equivalent range covering all addresses for the │ │ │ │ +IPv6 range).

    │ │ │ │ +

    A default constructed ip_filter does not filter any address.

    │ │ │ │ +
    │ │ │ │ +struct ip_filter
    │ │ │ │ +{
    │ │ │ │ +   ip_filter (ip_filter&&);
    │ │ │ │ +   ~ip_filter ();
    │ │ │ │ +   ip_filter& operator= (ip_filter&&);
    │ │ │ │ +   ip_filter& operator= (ip_filter const&);
    │ │ │ │ +   ip_filter ();
    │ │ │ │ +   ip_filter (ip_filter const&);
    │ │ │ │ +   bool empty () const;
    │ │ │ │ +   void add_rule (address const& first, address const& last, std::uint32_t flags);
    │ │ │ │ +   std::uint32_t access (address const& addr) const;
    │ │ │ │ +   filter_tuple_t export_filter () const;
    │ │ │ │ +
    │ │ │ │ +   enum access_flags
    │ │ │ │     {
    │ │ │ │ -      checking_files,
    │ │ │ │ -      downloading_metadata,
    │ │ │ │ -      downloading,
    │ │ │ │ -      finished,
    │ │ │ │ -      seeding,
    │ │ │ │ -      unused_enum_for_backwards_compatibility_allocating,
    │ │ │ │ -      checking_resume_data,
    │ │ │ │ +      blocked,
    │ │ │ │     };
    │ │ │ │ -
    │ │ │ │ -   torrent_handle handle;
    │ │ │ │ -   error_code errc;
    │ │ │ │ -   file_index_t error_file  = torrent_status::error_file_none;
    │ │ │ │ -   static constexpr file_index_t error_file_none {-1};
    │ │ │ │ -   static constexpr file_index_t error_file_ssl_ctx {-3};
    │ │ │ │ -   static constexpr file_index_t error_file_metadata {-4};
    │ │ │ │ -   static constexpr file_index_t error_file_exception {-5};
    │ │ │ │ -   static constexpr file_index_t error_file_partfile {-6};
    │ │ │ │ -   std::string save_path;
    │ │ │ │ -   std::string name;
    │ │ │ │ -   std::weak_ptr<const torrent_info> torrent_file;
    │ │ │ │ -   time_duration next_announce  = seconds{0};
    │ │ │ │ -   std::string current_tracker;
    │ │ │ │ -   std::int64_t total_download  = 0;
    │ │ │ │ -   std::int64_t total_upload  = 0;
    │ │ │ │ -   std::int64_t total_payload_download  = 0;
    │ │ │ │ -   std::int64_t total_payload_upload  = 0;
    │ │ │ │ -   std::int64_t total_failed_bytes  = 0;
    │ │ │ │ -   std::int64_t total_redundant_bytes  = 0;
    │ │ │ │ -   typed_bitfield<piece_index_t> pieces;
    │ │ │ │ -   typed_bitfield<piece_index_t> verified_pieces;
    │ │ │ │ -   std::int64_t total_done  = 0;
    │ │ │ │ -   std::int64_t total  = 0;
    │ │ │ │ -   std::int64_t total_wanted_done  = 0;
    │ │ │ │ -   std::int64_t total_wanted  = 0;
    │ │ │ │ -   std::int64_t all_time_upload  = 0;
    │ │ │ │ -   std::int64_t all_time_download  = 0;
    │ │ │ │ -   std::time_t added_time  = 0;
    │ │ │ │ -   std::time_t completed_time  = 0;
    │ │ │ │ -   std::time_t last_seen_complete  = 0;
    │ │ │ │ -   storage_mode_t storage_mode  = storage_mode_sparse;
    │ │ │ │ -   float progress  = 0.f;
    │ │ │ │ -   int progress_ppm  = 0;
    │ │ │ │ -   queue_position_t queue_position {};
    │ │ │ │ -   int download_rate  = 0;
    │ │ │ │ -   int upload_rate  = 0;
    │ │ │ │ -   int download_payload_rate  = 0;
    │ │ │ │ -   int upload_payload_rate  = 0;
    │ │ │ │ -   int num_seeds  = 0;
    │ │ │ │ -   int num_peers  = 0;
    │ │ │ │ -   int num_complete  = -1;
    │ │ │ │ -   int num_incomplete  = -1;
    │ │ │ │ -   int list_seeds  = 0;
    │ │ │ │ -   int list_peers  = 0;
    │ │ │ │ -   int connect_candidates  = 0;
    │ │ │ │ -   int num_pieces  = 0;
    │ │ │ │ -   int distributed_full_copies  = 0;
    │ │ │ │ -   int distributed_fraction  = 0;
    │ │ │ │ -   float distributed_copies  = 0.f;
    │ │ │ │ -   int block_size  = 0;
    │ │ │ │ -   int num_uploads  = 0;
    │ │ │ │ -   int num_connections  = 0;
    │ │ │ │ -   int uploads_limit  = 0;
    │ │ │ │ -   int connections_limit  = 0;
    │ │ │ │ -   int up_bandwidth_queue  = 0;
    │ │ │ │ -   int down_bandwidth_queue  = 0;
    │ │ │ │ -   int seed_rank  = 0;
    │ │ │ │ -   state_t state  = checking_resume_data;
    │ │ │ │ -   bool need_save_resume  = false;
    │ │ │ │ -   bool is_seeding  = false;
    │ │ │ │ -   bool is_finished  = false;
    │ │ │ │ -   bool has_metadata  = false;
    │ │ │ │ -   bool has_incoming  = false;
    │ │ │ │ -   bool moving_storage  = false;
    │ │ │ │ -   bool announcing_to_trackers  = false;
    │ │ │ │ -   bool announcing_to_lsd  = false;
    │ │ │ │ -   bool announcing_to_dht  = false;
    │ │ │ │ -   info_hash_t info_hashes;
    │ │ │ │ -   time_point last_upload;
    │ │ │ │ -   time_point last_download;
    │ │ │ │ -   seconds active_duration;
    │ │ │ │ -   seconds finished_duration;
    │ │ │ │ -   seconds seeding_duration;
    │ │ │ │ -   torrent_flags_t flags {};
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ -[report issue]
    │ │ │ │ -

    operator==()

    │ │ │ │ +[report issue]
    │ │ │ │ +

    empty()

    │ │ │ │
    │ │ │ │ -bool operator== (torrent_status const& st) const;
    │ │ │ │ +bool empty () const;
    │ │ │ │  
    │ │ │ │ -

    compares if the torrent status objects come from the same torrent. i.e. │ │ │ │ -only the torrent_handle field is compared.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum state_t

    │ │ │ │ -

    Declared in "libtorrent/torrent_status.hpp"

    │ │ │ │ +

    returns true if the filter does not contain any rules

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    add_rule()

    │ │ │ │ +
    │ │ │ │ +void add_rule (address const& first, address const& last, std::uint32_t flags);
    │ │ │ │ +
    │ │ │ │ +

    Adds a rule to the filter. first and last defines a range of │ │ │ │ +ip addresses that will be marked with the given flags. The flags │ │ │ │ +can currently be 0, which means allowed, or ip_filter::blocked, which │ │ │ │ +means disallowed.

    │ │ │ │ +

    precondition: │ │ │ │ +first.is_v4() == last.is_v4() && first.is_v6() == last.is_v6()

    │ │ │ │ +

    postcondition: │ │ │ │ +access(x) == flags for every x in the range [first, last]

    │ │ │ │ +

    This means that in a case of overlapping ranges, the last one applied takes │ │ │ │ +precedence.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    access()

    │ │ │ │ +
    │ │ │ │ +std::uint32_t access (address const& addr) const;
    │ │ │ │ +
    │ │ │ │ +

    Returns the access permissions for the given address (addr). The permission │ │ │ │ +can currently be 0 or ip_filter::blocked. The complexity of this operation │ │ │ │ +is O(log n), where n is the minimum number of non-overlapping ranges to describe │ │ │ │ +the current filter.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    export_filter()

    │ │ │ │ +
    │ │ │ │ +filter_tuple_t export_filter () const;
    │ │ │ │ +
    │ │ │ │ +

    This function will return the current state of the filter in the minimum number of │ │ │ │ +ranges possible. They are sorted from ranges in low addresses to high addresses. Each │ │ │ │ +entry in the returned vector is a range with the access control specified in its │ │ │ │ +flags field.

    │ │ │ │ +

    The return value is a tuple containing two range-lists. One for IPv4 addresses │ │ │ │ +and one for IPv6 addresses.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum access_flags

    │ │ │ │ +

    Declared in "libtorrent/ip_filter.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ +
    namevaluedescription
    checking_files
    blocked1The torrent has not started its download yet, and is │ │ │ │ -currently checking existing files.
    downloading_metadata2The torrent is trying to download metadata from peers. │ │ │ │ -This implies the ut_metadata extension is in use.indicates that IPs in this range should not be connected │ │ │ │ +to nor accepted as incoming connections
    downloading3The 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.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    port_filter

    │ │ │ │ +

    Declared in "libtorrent/ip_filter.hpp"

    │ │ │ │ +

    the port filter maps non-overlapping port ranges to flags. This │ │ │ │ +is primarily used to indicate whether a range of ports should │ │ │ │ +be connected to or not. The default is to have the full port │ │ │ │ +range (0-65535) set to flag 0.

    │ │ │ │ +
    │ │ │ │ +class port_filter
    │ │ │ │ +{
    │ │ │ │ +   port_filter (port_filter&&);
    │ │ │ │ +   port_filter& operator= (port_filter&&);
    │ │ │ │ +   port_filter& operator= (port_filter const&);
    │ │ │ │ +   ~port_filter ();
    │ │ │ │ +   port_filter ();
    │ │ │ │ +   port_filter (port_filter const&);
    │ │ │ │ +   void add_rule (std::uint16_t first, std::uint16_t last, std::uint32_t flags);
    │ │ │ │ +   std::uint32_t access (std::uint16_t port) const;
    │ │ │ │ +
    │ │ │ │ +   enum access_flags
    │ │ │ │ +   {
    │ │ │ │ +      blocked,
    │ │ │ │ +   };
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +

    add_rule()

    │ │ │ │ +
    │ │ │ │ +void add_rule (std::uint16_t first, std::uint16_t last, std::uint32_t flags);
    │ │ │ │ +
    │ │ │ │ +

    set the flags for the specified port range (first, last) to │ │ │ │ +flags overwriting any existing rule for those ports. The range │ │ │ │ +is inclusive, i.e. the port last also has the flag set on it.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    access()

    │ │ │ │ +
    │ │ │ │ +std::uint32_t access (std::uint16_t port) const;
    │ │ │ │ +
    │ │ │ │ +

    test the specified port (port) for whether it is blocked │ │ │ │ +or not. The returned value is the flags set for this port. │ │ │ │ +see access_flags.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum access_flags

    │ │ │ │ +

    Declared in "libtorrent/ip_filter.hpp"

    │ │ │ │ + │ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ +
    namevaluedescription
    finished4In 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.
    blocked1this flag indicates that destination ports in the │ │ │ │ +range should not be connected to
    seeding5In this state the torrent has finished downloading and │ │ │ │ -is a pure seeder.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    web_seed_entry

    │ │ │ │ +

    Declared in "libtorrent/torrent_info.hpp"

    │ │ │ │ +

    the web_seed_entry holds information about a web seed (also known │ │ │ │ +as URL seed or HTTP seed). It is essentially a URL with some state │ │ │ │ +associated with it. For more information, see BEP 17 and BEP 19.

    │ │ │ │ +
    │ │ │ │ +struct web_seed_entry
    │ │ │ │ +{
    │ │ │ │ +   bool operator== (web_seed_entry const& e) const;
    │ │ │ │ +   bool operator< (web_seed_entry const& e) const;
    │ │ │ │ +
    │ │ │ │ +   enum type_t
    │ │ │ │ +   {
    │ │ │ │ +      url_seed,
    │ │ │ │ +      http_seed,
    │ │ │ │ +   };
    │ │ │ │ +
    │ │ │ │ +   std::string url;
    │ │ │ │ +   std::string auth;
    │ │ │ │ +   headers_t extra_headers;
    │ │ │ │ +   std::uint8_t type;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +

    operator==()

    │ │ │ │ +
    │ │ │ │ +bool operator== (web_seed_entry const& e) const;
    │ │ │ │ +
    │ │ │ │ +

    URL and type comparison

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    operator<()

    │ │ │ │ +
    │ │ │ │ +bool operator< (web_seed_entry const& e) const;
    │ │ │ │ +
    │ │ │ │ +

    URL and type less-than comparison

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum type_t

    │ │ │ │ +

    Declared in "libtorrent/torrent_info.hpp"

    │ │ │ │ + │ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │
    namevaluedescription
    unused_enum_for_backwards_compatibility_allocating6If the torrent was started in full allocation mode, this │ │ │ │ -indicates that the (disk) storage for the torrent is │ │ │ │ -allocated.
    url_seed0 
    checking_resume_data7The torrent is currently checking the fast resume data and │ │ │ │ -comparing it to the files on disk. This is typically │ │ │ │ -completed in a fraction of a second, but if you add a │ │ │ │ -large number of torrents at once, they will queue up.
    http_seed1 
    │ │ │ │ -[report issue]
    │ │ │ │ -
    handle
    │ │ │ │ -
    a handle to the torrent whose status the object represents.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    errc
    │ │ │ │ -
    may be set to an error code describing why the torrent was paused, in │ │ │ │ -case it was paused by an error. If the torrent is not paused or if it's │ │ │ │ -paused but not because of an error, this error_code is not set. │ │ │ │ -if the error is attributed specifically to a file, error_file is set to │ │ │ │ -the index of that file in the .torrent file.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    error_file
    │ │ │ │ -
    if the torrent is stopped because of an disk I/O error, this field │ │ │ │ -contains the index of the file in the torrent that encountered the │ │ │ │ -error. If the error did not originate in a file in the torrent, there │ │ │ │ -are a few special values this can be set to: error_file_none, │ │ │ │ -error_file_ssl_ctx, error_file_exception, error_file_partfile or │ │ │ │ -error_file_metadata;
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    error_file_none
    │ │ │ │ -
    special values for error_file to describe which file or component │ │ │ │ -encountered the error (errc). │ │ │ │ -the error did not occur on a file
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    error_file_ssl_ctx
    │ │ │ │ -
    the error occurred setting up the SSL context
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    error_file_metadata
    │ │ │ │ -
    the error occurred while loading the metadata for the torrent
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    error_file_exception
    │ │ │ │ -
    there was a serious error reported in this torrent. The error code │ │ │ │ -or a torrent log alert may provide more information.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    error_file_partfile
    │ │ │ │ -
    the error occurred with the partfile
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    save_path
    │ │ │ │ -
    the path to the directory where this torrent's files are stored. │ │ │ │ -It's typically the path as was given to async_add_torrent() or │ │ │ │ -add_torrent() when this torrent was started. This field is only │ │ │ │ -included if the torrent status is queried with │ │ │ │ -torrent_handle::query_save_path.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    name
    │ │ │ │ -
    the name of the torrent. Typically this is derived from the │ │ │ │ -.torrent file. 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. │ │ │ │ -This field is only included if the torrent status is queried │ │ │ │ -with torrent_handle::query_name.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    torrent_file
    │ │ │ │ -
    set to point to the torrent_info object for this torrent. It's │ │ │ │ -only included if the torrent status is queried with │ │ │ │ -torrent_handle::query_torrent_file.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    next_announce
    │ │ │ │ -
    the time until the torrent will announce itself to the tracker.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    current_tracker
    │ │ │ │ -
    the URL of the last working tracker. If no tracker request has │ │ │ │ -been successful yet, it's set to an empty string.
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    total_download total_upload
    │ │ │ │ -
    the number of bytes downloaded and uploaded to all peers, accumulated, │ │ │ │ -this session only. The session is considered to restart when a │ │ │ │ -torrent is paused and restarted again. When a torrent is paused, these │ │ │ │ -counters are reset to 0. If you want complete, persistent, stats, see │ │ │ │ -all_time_upload and all_time_download.
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    total_payload_download 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. The session is considered to restart │ │ │ │ -when a torrent is paused and restarted again. When a torrent is │ │ │ │ -paused, these counters are reset to 0.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    total_failed_bytes
    │ │ │ │ -
    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 since the torrent was last started. If a torrent is │ │ │ │ -paused and then restarted again, this counter will be reset.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    total_redundant_bytes
    │ │ │ │ -
    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. This only counts bytes since the torrent was last │ │ │ │ -started. If a torrent is paused and then restarted again, this counter │ │ │ │ -will be reset.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    pieces
    │ │ │ │ -
    a 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.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    verified_pieces
    │ │ │ │ -
    a bitmask representing which pieces has had their hash checked. This │ │ │ │ -only applies to torrents in seed mode. If the torrent is not in seed │ │ │ │ -mode, this bitmask may be empty.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    total_done
    │ │ │ │ -
    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).
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    total
    │ │ │ │ -
    the total number of bytes to download for this torrent. This │ │ │ │ -may be less than the size of the torrent in case there are │ │ │ │ -pad files. This number only counts bytes that will actually │ │ │ │ -be requested from peers.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    total_wanted_done
    │ │ │ │ -
    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 have priority 0 (i.e. not wanted). │ │ │ │ -Once a torrent becomes seed, any piece- and file priorities are │ │ │ │ -forgotten and all bytes are considered "wanted".
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    total_wanted
    │ │ │ │ -
    The total number of bytes we want to download. This may be smaller │ │ │ │ -than the total torrent size in case any pieces are prioritized to 0, │ │ │ │ -i.e. not wanted. │ │ │ │ -Once a torrent becomes seed, any piece- and file priorities are │ │ │ │ -forgotten and all bytes are considered "wanted".
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    all_time_upload all_time_download
    │ │ │ │ -
    are accumulated upload and download payload byte counters. They are │ │ │ │ -saved in and restored from resume data to keep totals across sessions.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    added_time
    │ │ │ │ -
    the posix-time when this torrent was added. i.e. what time(nullptr) │ │ │ │ -returned at the time.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    completed_time
    │ │ │ │ -
    the posix-time when this torrent was finished. If the torrent is not │ │ │ │ -yet finished, this is 0.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    last_seen_complete
    │ │ │ │ -
    the time when we, or one of our peers, last saw a complete copy of │ │ │ │ -this torrent.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    storage_mode
    │ │ │ │ -
    The allocation mode for the torrent. See storage_mode_t for the │ │ │ │ -options. For more information, see storage allocation.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    progress
    │ │ │ │ -
    a value in the range [0, 1], that represents the progress of the │ │ │ │ -torrent's current task. It may be checking files or downloading.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    progress_ppm
    │ │ │ │ -

    progress parts per million (progress * 1000000) when disabling │ │ │ │ -floating point operations, this is the only option to query progress

    │ │ │ │ -

    reflects the same value as progress, but instead in a range [0, │ │ │ │ -1000000] (ppm = parts per million). When floating point operations are │ │ │ │ -disabled, this is the only alternative to the floating point value in │ │ │ │ -progress.

    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    queue_position
    │ │ │ │ -
    the position this torrent has in the download │ │ │ │ -queue. If the torrent is a seed or finished, this is -1.
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    download_rate upload_rate
    │ │ │ │ -
    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.
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    download_payload_rate upload_payload_rate
    │ │ │ │ -
    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.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    num_seeds
    │ │ │ │ -
    the number of peers that are seeding that this client is │ │ │ │ -currently connected to.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    num_peers
    │ │ │ │ -
    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().
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    num_complete num_incomplete
    │ │ │ │ -
    if the tracker sends scrape info in its announce reply, these fields │ │ │ │ -will be set to the total number of peers that have the whole file and │ │ │ │ -the total number of peers that are still downloading. set to -1 if the │ │ │ │ -tracker did not send any scrape data in its announce reply.
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    list_seeds list_peers
    │ │ │ │ -
    the number of seeds in our peer list and the total number of peers │ │ │ │ -(including seeds). 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.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    connect_candidates
    │ │ │ │ -
    the number of peers in this torrent's peer list that is a candidate to │ │ │ │ -be connected to. i.e. It has fewer connect attempts than the max fail │ │ │ │ -count, it is not a seed if we are a seed, it is not banned etc. If │ │ │ │ -this is 0, it means we don't know of any more peers that we can try.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    num_pieces
    │ │ │ │ -
    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. │ │ │ │ -Note that these pieces have not necessarily been written to disk yet, │ │ │ │ -and there is a risk the write to disk will fail.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    distributed_full_copies
    │ │ │ │ -
    the number of distributed copies of the torrent. Note that one copy │ │ │ │ -may be spread out among many peers. It tells how many copies there are │ │ │ │ -currently of the rarest piece(s) among the peers this client is │ │ │ │ -connected to.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    distributed_fraction
    │ │ │ │ -

    tells the share of pieces that have more copies than the rarest │ │ │ │ -piece(s). Divide this number by 1000 to get the fraction.

    │ │ │ │ -

    For example, if distributed_full_copies is 2 and │ │ │ │ -distributed_fraction is 500, it means 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 members are set to -1.

    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    distributed_copies
    │ │ │ │ -

    the number of distributed copies of the file. note that one copy may │ │ │ │ -be spread out among many peers. This is a floating point │ │ │ │ -representation of the distributed copies.

    │ │ │ │ -
    │ │ │ │ -
    the integer part tells how many copies
    │ │ │ │ -
    there are of the rarest piece(s)
    │ │ │ │ -
    the fractional part tells the fraction of pieces that
    │ │ │ │ -
    have more copies than the rarest piece(s).
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    block_size
    │ │ │ │ -
    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 │ │ │ │ -smaller, if the pieces are smaller.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    num_uploads
    │ │ │ │ -
    the number of unchoked peers in this torrent.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    num_connections
    │ │ │ │ -
    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.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    uploads_limit
    │ │ │ │ -
    the set limit of upload slots (unchoked peers) for this torrent.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    connections_limit
    │ │ │ │ -
    the set limit of number of connections for this torrent.
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    up_bandwidth_queue down_bandwidth_queue
    │ │ │ │ -
    the number of peers in this torrent that are waiting for more │ │ │ │ -bandwidth quota from the torrent rate limiter. This can determine if │ │ │ │ -the rate you get from this torrent is bound by the torrents limit or │ │ │ │ -not. If there is no limit set on this torrent, the peers might still │ │ │ │ -be waiting for bandwidth quota from the global limiter, but then they │ │ │ │ -are counted in the session_status object.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    seed_rank
    │ │ │ │ -
    A rank of how important it is to seed the torrent, it is used to │ │ │ │ -determine which torrents to seed and which to queue. It is based on │ │ │ │ -the peer to seed ratio from the tracker scrape. For more information, │ │ │ │ -see queuing. Higher value means more important to seed
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    state
    │ │ │ │ -
    the main state the torrent is in. See torrent_status::state_t.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    need_save_resume
    │ │ │ │ -
    true if this torrent has unsaved changes │ │ │ │ -to its download state and statistics since the last resume data │ │ │ │ -was saved.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    is_seeding
    │ │ │ │ -
    true if all pieces have been downloaded.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    is_finished
    │ │ │ │ -
    true if all pieces that have a priority > 0 are downloaded. There is │ │ │ │ -only a distinction between finished and seeding if some pieces or │ │ │ │ -files have been set to priority 0, i.e. are not downloaded.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    has_metadata
    │ │ │ │ -
    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 be false is when the torrent was started torrent-less │ │ │ │ -(i.e. with just an info-hash and tracker ip, a magnet link for │ │ │ │ -instance).
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    has_incoming
    │ │ │ │ -
    true if there has ever been an incoming connection attempt to this │ │ │ │ -torrent.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    moving_storage
    │ │ │ │ -
    this is true if this torrent's storage is currently being moved from │ │ │ │ -one location to another. This may potentially be a long operation │ │ │ │ -if a large file ends up being copied from one drive to another.
    │ │ │ │ -
    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    announcing_to_trackers announcing_to_lsd announcing_to_dht
    │ │ │ │ -
    these are set to true if this torrent is allowed to announce to the │ │ │ │ -respective peer source. Whether they are true or false is determined by │ │ │ │ -the queue logic/auto manager. Torrents that are not auto managed will │ │ │ │ -always be allowed to announce to all peer sources.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    info_hashes
    │ │ │ │ -
    the info-hash for this torrent
    │ │ │ │ +[report issue]
    │ │ │ │ +
    url
    │ │ │ │ +
    The URL of the web seed
    │ │ │ │
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    last_upload last_download
    │ │ │ │ -
    the timestamps of the last time this torrent uploaded or downloaded │ │ │ │ -payload to any peer.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    auth
    │ │ │ │ +
    Optional authentication. If this is set, it's passed │ │ │ │ +in as HTTP basic auth to the web seed. The format is: │ │ │ │ +username:password.
    │ │ │ │
    │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    active_duration finished_duration seeding_duration
    │ │ │ │ -
    these are cumulative counters of for how long the torrent has been in │ │ │ │ -different states. active means not paused and added to session. Whether │ │ │ │ -it has found any peers or not is not relevant. │ │ │ │ -finished means all selected files/pieces were downloaded and available │ │ │ │ -to other peers (this is always a subset of active time). │ │ │ │ -seeding means all files/pieces were downloaded and available to │ │ │ │ -peers. Being available to peers does not imply there are other peers │ │ │ │ -asking for the payload.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    extra_headers
    │ │ │ │ +
    Any extra HTTP headers that need to be passed to the web seed
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    flags
    │ │ │ │ -
    reflects several of the torrent's flags. For more │ │ │ │ -information, see torrent_handle::flags().
    │ │ │ │ +[report issue]
    │ │ │ │ +
    type
    │ │ │ │ +
    The type of web seed (see type_t)
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ +[report issue]
    │ │ │ │
    │ │ │ │ -
    │ │ │ │ -

    peer_class_info

    │ │ │ │ -

    Declared in "libtorrent/peer_class.hpp"

    │ │ │ │ -

    holds settings for a peer class. Used in set_peer_class() and │ │ │ │ -get_peer_class() calls.

    │ │ │ │ +
    │ │ │ │ +

    load_torrent_limits

    │ │ │ │ +

    Declared in "libtorrent/torrent_info.hpp"

    │ │ │ │ +

    this object holds configuration options for limits to use when loading │ │ │ │ +torrents. They are meant to prevent loading potentially malicious torrents │ │ │ │ +that cause excessive memory allocations.

    │ │ │ │
    │ │ │ │ -struct peer_class_info
    │ │ │ │ +struct load_torrent_limits
    │ │ │ │  {
    │ │ │ │ -   bool ignore_unchoke_slots;
    │ │ │ │ -   int connection_limit_factor;
    │ │ │ │ -   std::string label;
    │ │ │ │ -   int upload_limit;
    │ │ │ │ -   int download_limit;
    │ │ │ │ -   int upload_priority;
    │ │ │ │ -   int download_priority;
    │ │ │ │ +   int max_buffer_size  = 10000000;
    │ │ │ │ +   int max_pieces  = 0x200000;
    │ │ │ │ +   int max_decode_depth  = 100;
    │ │ │ │ +   int max_decode_tokens  = 3000000;
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ -[report issue]
    │ │ │ │ -
    ignore_unchoke_slots
    │ │ │ │ -
    ignore_unchoke_slots determines whether peers should always │ │ │ │ -unchoke a peer, regardless of the choking algorithm, or if it should │ │ │ │ -honor the unchoke slot limits. It's used for local peers by default. │ │ │ │ -If any of the peer classes a peer belongs to has this set to true, │ │ │ │ -that peer will be unchoked at all times.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    connection_limit_factor
    │ │ │ │ -
    adjusts the connection limit (global and per torrent) that applies to │ │ │ │ -this peer class. By default, local peers are allowed to exceed the │ │ │ │ -normal connection limit for instance. This is specified as a percent │ │ │ │ -factor. 100 makes the peer class apply normally to the limit. 200 │ │ │ │ -means as long as there are fewer connections than twice the limit, we │ │ │ │ -accept this peer. This factor applies both to the global connection │ │ │ │ -limit and the per-torrent limit. Note that if not used carefully one │ │ │ │ -peer class can potentially completely starve out all other over time.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    max_buffer_size
    │ │ │ │ +
    the max size of a .torrent file to load into RAM
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    label
    │ │ │ │ -
    not used by libtorrent. It's intended as a potentially user-facing │ │ │ │ -identifier of this peer class.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    max_pieces
    │ │ │ │ +
    the max number of pieces allowed in the torrent
    │ │ │ │
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    upload_limit download_limit
    │ │ │ │ -
    transfer rates limits for the whole peer class. They are specified in │ │ │ │ -bytes per second and apply to the sum of all peers that are members of │ │ │ │ -this class.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    max_decode_depth
    │ │ │ │ +
    the max recursion depth in the bdecoded structure
    │ │ │ │
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    upload_priority download_priority
    │ │ │ │ -
    relative priorities used by the bandwidth allocator in the rate │ │ │ │ -limiter. If no rate limits are in use, the priority is not used │ │ │ │ -either. Priorities start at 1 (0 is not a valid priority) and may not │ │ │ │ -exceed 255.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    max_decode_tokens
    │ │ │ │ +
    the max number of bdecode tokens
    │ │ │ │
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    torrent_info

    │ │ │ │ +

    Declared in "libtorrent/torrent_info.hpp"

    │ │ │ │ +

    the torrent_info class holds the information found in a .torrent file.

    │ │ │ │ +
    │ │ │ │ +class torrent_info
    │ │ │ │ +{
    │ │ │ │ +   explicit torrent_info (span<char const> buffer, from_span_t);
    │ │ │ │ +   torrent_info (std::string const& filename, error_code& ec);
    │ │ │ │ +   explicit torrent_info (bdecode_node const& torrent_file);
    │ │ │ │ +   torrent_info (span<char const> buffer, error_code& ec, from_span_t);
    │ │ │ │ +   torrent_info (char const* buffer, int size);
    │ │ │ │ +   torrent_info (bdecode_node const& torrent_file, load_torrent_limits const& cfg);
    │ │ │ │ +   torrent_info (torrent_info const& t);
    │ │ │ │ +   explicit torrent_info (info_hash_t const& info_hash);
    │ │ │ │ +   explicit torrent_info (std::string const& filename);
    │ │ │ │ +   torrent_info (bdecode_node const& torrent_file, error_code& ec);
    │ │ │ │ +   torrent_info (span<char const> buffer, load_torrent_limits const& cfg, from_span_t);
    │ │ │ │ +   torrent_info (char const* buffer, int size, error_code& ec);
    │ │ │ │ +   torrent_info (std::string const& filename, load_torrent_limits const& cfg);
    │ │ │ │ +   ~torrent_info ();
    │ │ │ │ +   file_storage const& orig_files () const;
    │ │ │ │ +   file_storage const& files () const;
    │ │ │ │ +   void rename_file (file_index_t index, std::string const& new_filename);
    │ │ │ │ +   void remap_files (file_storage const& f);
    │ │ │ │ +   void add_tracker (std::string const& url, int tier = 0);
    │ │ │ │ +   void clear_trackers ();
    │ │ │ │ +   void add_tracker (std::string const& url, int tier
    │ │ │ │ +      , announce_entry::tracker_source source);
    │ │ │ │ +   std::vector<announce_entry> const& trackers () const;
    │ │ │ │ +   std::vector<sha1_hash> similar_torrents () const;
    │ │ │ │ +   std::vector<std::string> collections () const;
    │ │ │ │ +   void set_web_seeds (std::vector<web_seed_entry> seeds);
    │ │ │ │ +   void add_url_seed (std::string const& url
    │ │ │ │ +      , std::string const& ext_auth = std::string()
    │ │ │ │ +      , web_seed_entry::headers_t const& ext_headers = web_seed_entry::headers_t());
    │ │ │ │ +   void add_http_seed (std::string const& url
    │ │ │ │ +      , std::string const& extern_auth = std::string()
    │ │ │ │ +      , web_seed_entry::headers_t const& extra_headers = web_seed_entry::headers_t());
    │ │ │ │ +   std::vector<web_seed_entry> const& web_seeds () const;
    │ │ │ │ +   std::int64_t total_size () const;
    │ │ │ │ +   int num_pieces () const;
    │ │ │ │ +   int piece_length () const;
    │ │ │ │ +   int blocks_per_piece () const;
    │ │ │ │ +   piece_index_t last_piece () const;
    │ │ │ │ +   index_range<piece_index_t> piece_range () const;
    │ │ │ │ +   piece_index_t end_piece () const;
    │ │ │ │ +   info_hash_t const& info_hashes () const;
    │ │ │ │ +   sha1_hash info_hash () const noexcept;
    │ │ │ │ +   bool v1 () const;
    │ │ │ │ +   bool v2 () const;
    │ │ │ │ +   int num_files () const;
    │ │ │ │ +   std::vector<file_slice> map_block (piece_index_t const piece
    │ │ │ │ +      , std::int64_t offset, int size) const;
    │ │ │ │ +   peer_request map_file (file_index_t const file, std::int64_t offset, int size) const;
    │ │ │ │ +   string_view ssl_cert () const;
    │ │ │ │ +   bool is_valid () const;
    │ │ │ │ +   bool priv () const;
    │ │ │ │ +   bool is_i2p () const;
    │ │ │ │ +   int piece_size (piece_index_t index) const;
    │ │ │ │ +   char const* hash_for_piece_ptr (piece_index_t const index) const;
    │ │ │ │ +   sha1_hash hash_for_piece (piece_index_t index) const;
    │ │ │ │ +   bool is_loaded () const;
    │ │ │ │ +   const std::string& name () const;
    │ │ │ │ +   std::time_t creation_date () const;
    │ │ │ │ +   const std::string& creator () const;
    │ │ │ │ +   const std::string& comment () const;
    │ │ │ │ +   std::vector<std::pair<std::string, int>> const& nodes () const;
    │ │ │ │ +   void add_node (std::pair<std::string, int> const& node);
    │ │ │ │ +   bool parse_info_section (bdecode_node const& info, error_code& ec, int max_pieces);
    │ │ │ │ +   bdecode_node info (char const* key) const;
    │ │ │ │ +   span<char const> info_section () const;
    │ │ │ │ +   span<char const> piece_layer (file_index_t) const;
    │ │ │ │ +   void free_piece_layers ();
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +

    torrent_info()

    │ │ │ │ +
    │ │ │ │ +explicit torrent_info (span<char const> buffer, from_span_t);
    │ │ │ │ +torrent_info (std::string const& filename, error_code& ec);
    │ │ │ │ +explicit torrent_info (bdecode_node const& torrent_file);
    │ │ │ │ +torrent_info (span<char const> buffer, error_code& ec, from_span_t);
    │ │ │ │ +torrent_info (char const* buffer, int size);
    │ │ │ │ +torrent_info (bdecode_node const& torrent_file, load_torrent_limits const& cfg);
    │ │ │ │ +torrent_info (torrent_info const& t);
    │ │ │ │ +explicit torrent_info (info_hash_t const& info_hash);
    │ │ │ │ +explicit torrent_info (std::string const& filename);
    │ │ │ │ +torrent_info (bdecode_node const& torrent_file, error_code& ec);
    │ │ │ │ +torrent_info (span<char const> buffer, load_torrent_limits const& cfg, from_span_t);
    │ │ │ │ +torrent_info (char const* buffer, int size, error_code& ec);
    │ │ │ │ +torrent_info (std::string const& filename, load_torrent_limits const& cfg);
    │ │ │ │ +
    │ │ │ │ +

    The constructor that takes an info-hash will initialize the info-hash │ │ │ │ +to the given value, but leave all other fields empty. 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 constructor that takes a bdecode_node will create a torrent_info │ │ │ │ +object from the information found in the given torrent_file. The │ │ │ │ +bdecode_node represents a tree node in an bencoded file. To load an │ │ │ │ +ordinary .torrent file into a bdecode_node, use bdecode().

    │ │ │ │ +

    The version that takes a buffer pointer and a size will decode it as a │ │ │ │ +.torrent file and initialize the torrent_info object for you.

    │ │ │ │ +

    The version that takes a filename will simply load the torrent file │ │ │ │ +and decode it inside the constructor, for convenience. This might not │ │ │ │ +be the most suitable for applications that want to be able to report │ │ │ │ +detailed errors on what might go wrong.

    │ │ │ │ +

    There is an upper limit on the size of the torrent file that will be │ │ │ │ +loaded by the overload taking a filename. If it's important that even │ │ │ │ +very large torrent files are loaded, use one of the other overloads.

    │ │ │ │ +

    The overloads that takes an error_code const& never throws if an │ │ │ │ +error occur, they will simply set the error code to describe what went │ │ │ │ +wrong and not fully initialize the torrent_info object. The overloads │ │ │ │ +that do not take the extra error_code parameter will always throw if │ │ │ │ +an error occurs. These overloads are not available when building │ │ │ │ +without exception support.

    │ │ │ │ +

    The overload that takes a span also needs an extra parameter of │ │ │ │ +type from_span_t to disambiguate the std::string overload for │ │ │ │ +string literals. There is an object in the libtorrent namespace of this │ │ │ │ +type called from_span.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    ~torrent_info()

    │ │ │ │ +
    │ │ │ │ +~torrent_info ();
    │ │ │ │ +
    │ │ │ │ +

    frees all storage associated with this torrent_info object

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    files() orig_files()

    │ │ │ │ +
    │ │ │ │ +file_storage const& orig_files () const;
    │ │ │ │ +file_storage const& files () const;
    │ │ │ │ +
    │ │ │ │ +

    The file_storage object contains the information on how to map the │ │ │ │ +pieces to files. It is separated from the torrent_info object because │ │ │ │ +when creating torrents a storage object needs to be created without │ │ │ │ +having a torrent file. When renaming files in a storage, the storage │ │ │ │ +needs to make its own copy of the file_storage in order to make its │ │ │ │ +mapping differ from the one in the torrent file.

    │ │ │ │ +

    orig_files() returns the original (unmodified) file storage for │ │ │ │ +this torrent. This is used by the web server connection, which needs │ │ │ │ +to request files with the original names. Filename may be changed using │ │ │ │ +torrent_info::rename_file().

    │ │ │ │ +

    For more information on the file_storage object, see the separate │ │ │ │ +document on how to create torrents.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    rename_file()

    │ │ │ │ +
    │ │ │ │ +void rename_file (file_index_t index, std::string const& new_filename);
    │ │ │ │ +
    │ │ │ │ +

    Renames the file with the specified index to the new name. The new │ │ │ │ +filename is reflected by the file_storage returned by files() │ │ │ │ +but not by the one returned by orig_files().

    │ │ │ │ +

    If you want to rename the base name of the torrent (for a multi file │ │ │ │ +torrent), you can copy the file_storage (see files() and │ │ │ │ +orig_files() ), change the name, and then use remap_files().

    │ │ │ │ +

    The new_filename can both be a relative path, in which case the │ │ │ │ +file name is relative to the save_path of the torrent. If the │ │ │ │ +new_filename is an absolute path (i.e. is_complete(new_filename) │ │ │ │ +== true), then the file is detached from the save_path of the │ │ │ │ +torrent. In this case the file is not moved when move_storage() is │ │ │ │ +invoked.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    remap_files()

    │ │ │ │ +
    │ │ │ │ +void remap_files (file_storage const& f);
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    Warning

    │ │ │ │ +

    Using remap_files() is discouraged as it's incompatible with v2 │ │ │ │ +torrents. This is because the piece boundaries and piece hashes in │ │ │ │ +v2 torrents are intimately tied to the file boundaries. Instead, │ │ │ │ +just rename individual files, or implement a custom disk_interface │ │ │ │ +to customize how to store files.

    │ │ │ │ +
    │ │ │ │ +

    Remaps the file storage to a new file layout. This can be used to, for │ │ │ │ +instance, download all data in a torrent to a single file, or to a │ │ │ │ +number of fixed size sector aligned files, regardless of the number │ │ │ │ +and sizes of the files in the torrent.

    │ │ │ │ +

    The new specified file_storage must have the exact same size as │ │ │ │ +the current one.

    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    trackers() clear_trackers() add_tracker()

    │ │ │ │ +
    │ │ │ │ +void add_tracker (std::string const& url, int tier = 0);
    │ │ │ │ +void clear_trackers ();
    │ │ │ │ +void add_tracker (std::string const& url, int tier
    │ │ │ │ +      , announce_entry::tracker_source source);
    │ │ │ │ +std::vector<announce_entry> const& trackers () const;
    │ │ │ │ +
    │ │ │ │ +

    add_tracker() adds a tracker to the announce-list. The tier │ │ │ │ +determines the order in which the trackers are to be tried. │ │ │ │ +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. For more information, see announce_entry.

    │ │ │ │ +

    trackers() returns all entries from announce-list.

    │ │ │ │ +

    clear_trackers() removes all trackers from announce-list.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    collections() similar_torrents()

    │ │ │ │ +
    │ │ │ │ +std::vector<sha1_hash> similar_torrents () const;
    │ │ │ │ +std::vector<std::string> collections () const;
    │ │ │ │ +
    │ │ │ │ +

    These two functions are related to BEP 38 (mutable torrents). The │ │ │ │ +vectors returned from these correspond to the "similar" and │ │ │ │ +"collections" keys in the .torrent file. Both info-hashes and │ │ │ │ +collections from within the info-dict and from outside of it are │ │ │ │ +included.

    │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_web_seeds() web_seeds() add_http_seed() add_url_seed()

    │ │ │ │ +
    │ │ │ │ +void set_web_seeds (std::vector<web_seed_entry> seeds);
    │ │ │ │ +void add_url_seed (std::string const& url
    │ │ │ │ +      , std::string const& ext_auth = std::string()
    │ │ │ │ +      , web_seed_entry::headers_t const& ext_headers = web_seed_entry::headers_t());
    │ │ │ │ +void add_http_seed (std::string const& url
    │ │ │ │ +      , std::string const& extern_auth = std::string()
    │ │ │ │ +      , web_seed_entry::headers_t const& extra_headers = web_seed_entry::headers_t());
    │ │ │ │ +std::vector<web_seed_entry> const& web_seeds () const;
    │ │ │ │ +
    │ │ │ │ +

    web_seeds() returns all url seeds and http seeds in the torrent. │ │ │ │ +Each entry is a web_seed_entry and may refer to either a url seed │ │ │ │ +or http seed.

    │ │ │ │ +

    add_url_seed() and add_http_seed() adds one url to the list of │ │ │ │ +url/http seeds.

    │ │ │ │ +

    set_web_seeds() replaces all web seeds with the ones specified in │ │ │ │ +the seeds vector.

    │ │ │ │ +

    The extern_auth argument can be used for other authorization │ │ │ │ +schemes than basic HTTP authorization. If set, it will override any │ │ │ │ +username and password found in the URL itself. The string will be sent │ │ │ │ +as the HTTP authorization header's value (without specifying "Basic").

    │ │ │ │ +

    The extra_headers argument defaults to an empty list, but can be │ │ │ │ +used to insert custom HTTP headers in the requests to a specific web │ │ │ │ +seed.

    │ │ │ │ +

    See http seeding for more information.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    total_size()

    │ │ │ │ +
    │ │ │ │ +std::int64_t total_size () const;
    │ │ │ │ +
    │ │ │ │ +

    total_size() returns the total number of bytes the torrent-file │ │ │ │ +represents. Note that this is the number of pieces times the piece │ │ │ │ +size (modulo the last piece possibly being smaller). With pad files, │ │ │ │ +the total size will be larger than the sum of all (regular) file │ │ │ │ +sizes.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    num_pieces() piece_length()

    │ │ │ │ +
    │ │ │ │ +int num_pieces () const;
    │ │ │ │ +int piece_length () const;
    │ │ │ │ +
    │ │ │ │ +

    piece_length() and num_pieces() returns 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.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    blocks_per_piece()

    │ │ │ │ +
    │ │ │ │ +int blocks_per_piece () const;
    │ │ │ │ +
    │ │ │ │ +

    returns the number of blocks there are in the typical piece. There │ │ │ │ +may be fewer in the last piece)

    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    last_piece() piece_range() end_piece()

    │ │ │ │ +
    │ │ │ │ +piece_index_t last_piece () const;
    │ │ │ │ +index_range<piece_index_t> piece_range () const;
    │ │ │ │ +piece_index_t end_piece () const;
    │ │ │ │ +
    │ │ │ │ +

    last_piece() returns the index to the last piece in the torrent and │ │ │ │ +end_piece() returns the index to the one-past-end piece in the │ │ │ │ +torrent │ │ │ │ +piece_range() returns an implementation-defined type that can be │ │ │ │ +used as the container in a range-for loop. Where the values are the │ │ │ │ +indices of all pieces in the file_storage.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    info_hashes() info_hash()

    │ │ │ │ +
    │ │ │ │ +info_hash_t const& info_hashes () const;
    │ │ │ │ +sha1_hash info_hash () const noexcept;
    │ │ │ │ +
    │ │ │ │ +

    returns the info-hash of the torrent. For BitTorrent v2 support, use │ │ │ │ +info_hashes() to get an object that may hold both a v1 and v2 │ │ │ │ +info-hash

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    v1() v2()

    │ │ │ │ +
    │ │ │ │ +bool v1 () const;
    │ │ │ │ +bool v2 () const;
    │ │ │ │ +
    │ │ │ │ +

    returns whether this torrent has v1 and/or v2 metadata, respectively. │ │ │ │ +Hybrid torrents have both. These are shortcuts for │ │ │ │ +info_hashes().has_v1() and info_hashes().has_v2() calls.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    num_files()

    │ │ │ │ +
    │ │ │ │ +int num_files () const;
    │ │ │ │ +
    │ │ │ │ +

    If you need index-access to files you can use the num_files() along │ │ │ │ +with the file_path(), file_size()-family of functions to access │ │ │ │ +files using indices.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    map_block()

    │ │ │ │ +
    │ │ │ │ +std::vector<file_slice> map_block (piece_index_t const piece
    │ │ │ │ +      , std::int64_t offset, int size) 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. See file_slice.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    map_file()

    │ │ │ │ +
    │ │ │ │ +peer_request map_file (file_index_t const file, std::int64_t offset, int size) 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. See peer_request.

    │ │ │ │ +

    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().

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    ssl_cert()

    │ │ │ │ +
    │ │ │ │ +string_view ssl_cert () const;
    │ │ │ │ +
    │ │ │ │ +

    Returns the SSL root certificate for the torrent, if it is an SSL │ │ │ │ +torrent. Otherwise returns an empty string. The certificate is │ │ │ │ +the public certificate in x509 format.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    is_valid()

    │ │ │ │ +
    │ │ │ │ +bool is_valid () const;
    │ │ │ │ +
    │ │ │ │ +

    returns true if this torrent_info object has a torrent loaded. │ │ │ │ +This is primarily used to determine if a magnet link has had its │ │ │ │ +metadata resolved yet or not.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    priv()

    │ │ │ │ +
    │ │ │ │ +bool priv () const;
    │ │ │ │ +
    │ │ │ │ +

    returns true if this torrent is private. i.e., the client should not │ │ │ │ +advertise itself on the trackerless network (the Kademlia DHT) for this torrent.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    is_i2p()

    │ │ │ │ +
    │ │ │ │ +bool is_i2p () const;
    │ │ │ │ +
    │ │ │ │ +

    returns true if this is an i2p torrent. This is determined by whether │ │ │ │ +or not it has a tracker whose URL domain name ends with ".i2p". i2p │ │ │ │ +torrents disable the DHT and local peer discovery as well as talking │ │ │ │ +to peers over anything other than the i2p network.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    piece_size()

    │ │ │ │ +
    │ │ │ │ +int piece_size (piece_index_t index) const;
    │ │ │ │ +
    │ │ │ │ +

    returns the piece size of file with index. This will be the same as piece_length(), │ │ │ │ +except for the last piece, which may be shorter.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    hash_for_piece_ptr() hash_for_piece()

    │ │ │ │ +
    │ │ │ │ +char const* hash_for_piece_ptr (piece_index_t const index) const;
    │ │ │ │ +sha1_hash hash_for_piece (piece_index_t 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. │ │ │ │ +hash_for_piece_ptr() returns a pointer to the 20 byte sha1 digest │ │ │ │ +for the piece. Note that the string is not 0-terminated.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    name()

    │ │ │ │ +
    │ │ │ │ +const std::string& name () const;
    │ │ │ │ +
    │ │ │ │ +

    name() returns the name of the torrent. │ │ │ │ +name contains UTF-8 encoded string.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    creation_date()

    │ │ │ │ +
    │ │ │ │ +std::time_t creation_date () const;
    │ │ │ │ +
    │ │ │ │ +

    creation_date() returns the creation date of the torrent as time_t │ │ │ │ +(posix time). If there's no time stamp in the torrent file, 0 is │ │ │ │ +returned. │ │ │ │ +.. posix time: http://www.opengroup.org/onlinepubs/009695399/functions/time.html

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    creator()

    │ │ │ │ +
    │ │ │ │ +const std::string& creator () const;
    │ │ │ │ +
    │ │ │ │ +

    creator() returns the creator string in the torrent. If there is │ │ │ │ +no creator string it will return an empty string.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    comment()

    │ │ │ │ +
    │ │ │ │ +const std::string& comment () const;
    │ │ │ │ +
    │ │ │ │ +

    comment() returns the comment associated with the torrent. If │ │ │ │ +there's no comment, it will return an empty string. │ │ │ │ +comment contains UTF-8 encoded string.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    nodes()

    │ │ │ │ +
    │ │ │ │ +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).

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    add_node()

    │ │ │ │ +
    │ │ │ │ +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.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    parse_info_section()

    │ │ │ │ +
    │ │ │ │ +bool parse_info_section (bdecode_node const& info, error_code& ec, int max_pieces);
    │ │ │ │ +
    │ │ │ │ +

    populates the torrent_info by providing just the info-dict buffer. │ │ │ │ +This is used when loading a torrent from a magnet link for instance, │ │ │ │ +where we only have the info-dict. The bdecode_node e points to a │ │ │ │ +parsed info-dictionary. ec returns an error code if something │ │ │ │ +fails (typically if the info dictionary is malformed). │ │ │ │ +The max_pieces parameter allows limiting the amount of memory │ │ │ │ +dedicated to loading the torrent, and fails for torrents that exceed │ │ │ │ +the limit. To load large torrents, this limit may also need to be │ │ │ │ +raised in settings_pack::max_piece_count and in calls to │ │ │ │ +read_resume_data().

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    info()

    │ │ │ │ +
    │ │ │ │ +bdecode_node info (char const* key) const;
    │ │ │ │ +
    │ │ │ │ +

    This function looks up keys from the info-dictionary of the loaded │ │ │ │ +torrent file. It can be used to access extension values put in the │ │ │ │ +.torrent file. If the specified key cannot be found, it returns nullptr.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    info_section()

    │ │ │ │ +
    │ │ │ │ +span<char const> info_section () const;
    │ │ │ │ +
    │ │ │ │ +

    returns a the raw info section of the torrent file. │ │ │ │ +The underlying buffer is still owned by the torrent_info object

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    piece_layer()

    │ │ │ │ +
    │ │ │ │ +span<char const> piece_layer (file_index_t) const;
    │ │ │ │ +
    │ │ │ │ +

    return the bytes of the piece layer hashes for the specified file. If │ │ │ │ +the file doesn't have a piece layer, an empty span is returned. │ │ │ │ +The span size is divisible by 32, the size of a SHA-256 hash. │ │ │ │ +If the size of the file is smaller than or equal to the piece size, │ │ │ │ +the files "root hash" is the hash of the file and is not saved │ │ │ │ +separately in the "piece layers" field, but this function still │ │ │ │ +returns the root hash of the file in that case.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    free_piece_layers()

    │ │ │ │ +
    │ │ │ │ +void free_piece_layers ();
    │ │ │ │ +
    │ │ │ │ +

    clears the piece layers from the torrent_info. This is done by the │ │ │ │ +session when a torrent is added, to avoid storing it twice. The piece │ │ │ │ +layer (or other hashes part of the merkle tree) are stored in the │ │ │ │ +internal torrent object.

    │ │ │ │ [report issue]
    │ │ │ │ +
    │ │ │ │
    │ │ │ │

    peer_class_type_filter

    │ │ │ │

    Declared in "libtorrent/peer_class_type_filter.hpp"

    │ │ │ │

    peer_class_type_filter is a simple container for rules for adding and subtracting │ │ │ │ peer-classes from peers. It is applied after the peer class filter is applied (which │ │ │ │ is based on the peer's IP address).

    │ │ │ │
    │ │ │ │ @@ -11915,604 +11982,1763 @@
    │ │ │ │  
    │ │ │ │  num_socket_types
    │ │ │ │  5
    │ │ │ │   
    │ │ │ │  
    │ │ │ │  
    │ │ │ │  
    │ │ │ │ -

    You have some control over session configuration through the session::apply_settings() │ │ │ │ -member function. To change one or more configuration options, create a settings_pack │ │ │ │ -object and fill it with the settings to be set and pass it in to session::apply_settings().

    │ │ │ │ -

    The settings_pack object is a collection of settings updates that are applied │ │ │ │ -to the session when passed to session::apply_settings(). It's empty when │ │ │ │ -constructed.

    │ │ │ │ -

    You have control over proxy and authorization settings and also the user-agent │ │ │ │ -that will be sent to the tracker. The user-agent will also be used to identify the │ │ │ │ -client with other peers.

    │ │ │ │ -

    Each configuration option is named with an enum value inside the │ │ │ │ -settings_pack class. These are the available settings:

    │ │ │ │ -[report issue]
    │ │ │ │ +[report issue]
    │ │ │ │
    │ │ │ │ -
    │ │ │ │ -

    disk_observer

    │ │ │ │ -

    Declared in "libtorrent/disk_observer.hpp"

    │ │ │ │ +
    │ │ │ │ +

    peer_class_info

    │ │ │ │ +

    Declared in "libtorrent/peer_class.hpp"

    │ │ │ │ +

    holds settings for a peer class. Used in set_peer_class() and │ │ │ │ +get_peer_class() calls.

    │ │ │ │
    │ │ │ │ -struct disk_observer
    │ │ │ │ +struct peer_class_info
    │ │ │ │  {
    │ │ │ │ -   virtual void on_disk () = 0;
    │ │ │ │ +   bool ignore_unchoke_slots;
    │ │ │ │ +   int connection_limit_factor;
    │ │ │ │ +   std::string label;
    │ │ │ │ +   int upload_limit;
    │ │ │ │ +   int download_limit;
    │ │ │ │ +   int upload_priority;
    │ │ │ │ +   int download_priority;
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ -[report issue]
    │ │ │ │ -

    on_disk()

    │ │ │ │ +[report issue]
    │ │ │ │ +
    ignore_unchoke_slots
    │ │ │ │ +
    ignore_unchoke_slots determines whether peers should always │ │ │ │ +unchoke a peer, regardless of the choking algorithm, or if it should │ │ │ │ +honor the unchoke slot limits. It's used for local peers by default. │ │ │ │ +If any of the peer classes a peer belongs to has this set to true, │ │ │ │ +that peer will be unchoked at all times.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    connection_limit_factor
    │ │ │ │ +
    adjusts the connection limit (global and per torrent) that applies to │ │ │ │ +this peer class. By default, local peers are allowed to exceed the │ │ │ │ +normal connection limit for instance. This is specified as a percent │ │ │ │ +factor. 100 makes the peer class apply normally to the limit. 200 │ │ │ │ +means as long as there are fewer connections than twice the limit, we │ │ │ │ +accept this peer. This factor applies both to the global connection │ │ │ │ +limit and the per-torrent limit. Note that if not used carefully one │ │ │ │ +peer class can potentially completely starve out all other over time.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    label
    │ │ │ │ +
    not used by libtorrent. It's intended as a potentially user-facing │ │ │ │ +identifier of this peer class.
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    upload_limit download_limit
    │ │ │ │ +
    transfer rates limits for the whole peer class. They are specified in │ │ │ │ +bytes per second and apply to the sum of all peers that are members of │ │ │ │ +this class.
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    upload_priority download_priority
    │ │ │ │ +
    relative priorities used by the bandwidth allocator in the rate │ │ │ │ +limiter. If no rate limits are in use, the priority is not used │ │ │ │ +either. Priorities start at 1 (0 is not a valid priority) and may not │ │ │ │ +exceed 255.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    bitfield

    │ │ │ │ +

    Declared in "libtorrent/bitfield.hpp"

    │ │ │ │ +

    The bitfield type stores any number of bits as a bitfield │ │ │ │ +in a heap allocated array.

    │ │ │ │
    │ │ │ │ -virtual void on_disk () = 0;
    │ │ │ │ +struct bitfield
    │ │ │ │ +{
    │ │ │ │ +   bitfield (bitfield&& rhs) noexcept = default;
    │ │ │ │ +   bitfield (char const* b, int bits);
    │ │ │ │ +   explicit bitfield (int bits);
    │ │ │ │ +   bitfield () noexcept = default;
    │ │ │ │ +   bitfield (int bits, bool val);
    │ │ │ │ +   bitfield (bitfield const& rhs);
    │ │ │ │ +   void assign (char const* b, int const bits);
    │ │ │ │ +   bool operator[] (int index) const noexcept;
    │ │ │ │ +   bool get_bit (int index) const noexcept;
    │ │ │ │ +   void set_bit (int index) noexcept;
    │ │ │ │ +   void clear_bit (int index) noexcept;
    │ │ │ │ +   bool all_set () const noexcept;
    │ │ │ │ +   bool none_set () const noexcept;
    │ │ │ │ +   int size () const noexcept;
    │ │ │ │ +   int num_words () const noexcept;
    │ │ │ │ +   int num_bytes () const noexcept;
    │ │ │ │ +   bool empty () const noexcept;
    │ │ │ │ +   char const* data () const noexcept;
    │ │ │ │ +   char* data () noexcept;
    │ │ │ │ +   void swap (bitfield& rhs) noexcept;
    │ │ │ │ +   int count () const noexcept;
    │ │ │ │ +   int find_first_set () const noexcept;
    │ │ │ │ +   int find_last_clear () const noexcept;
    │ │ │ │ +   bool operator== (lt::bitfield const& rhs) const;
    │ │ │ │ +};
    │ │ │ │  
    │ │ │ │ -

    called when the disk cache size has dropped │ │ │ │ -below the low watermark again and we can │ │ │ │ -resume downloading from peers

    │ │ │ │ -[report issue]
    │ │ │ │ +[report issue]
    │ │ │ │ +

    bitfield()

    │ │ │ │ +
    │ │ │ │ +bitfield (bitfield&& rhs) noexcept = default;
    │ │ │ │ +bitfield (char const* b, int bits);
    │ │ │ │ +explicit bitfield (int bits);
    │ │ │ │ +bitfield () noexcept = default;
    │ │ │ │ +bitfield (int bits, bool val);
    │ │ │ │ +bitfield (bitfield const& rhs);
    │ │ │ │ +
    │ │ │ │ +

    constructs a new bitfield. The default constructor creates an empty │ │ │ │ +bitfield. bits is the size of the bitfield (specified in bits). │ │ │ │ +val is the value to initialize the bits to. If not specified │ │ │ │ +all bits are initialized to 0.

    │ │ │ │ +

    The constructor taking a pointer b and bits copies a bitfield │ │ │ │ +from the specified buffer, and bits number of bits (rounded up to │ │ │ │ +the nearest byte boundary).

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    assign()

    │ │ │ │ +
    │ │ │ │ +void assign (char const* b, int const bits);
    │ │ │ │ +
    │ │ │ │ +

    copy bitfield from buffer b of bits number of bits, rounded up to │ │ │ │ +the nearest byte boundary.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    operator[]() get_bit()

    │ │ │ │ +
    │ │ │ │ +bool operator[] (int index) const noexcept;
    │ │ │ │ +bool get_bit (int index) const noexcept;
    │ │ │ │ +
    │ │ │ │ +

    query bit at index. Returns true if bit is 1, otherwise false.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_bit() clear_bit()

    │ │ │ │ +
    │ │ │ │ +void set_bit (int index) noexcept;
    │ │ │ │ +void clear_bit (int index) noexcept;
    │ │ │ │ +
    │ │ │ │ +

    set bit at index to 0 (clear_bit) or 1 (set_bit).

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    all_set()

    │ │ │ │ +
    │ │ │ │ +bool all_set () const noexcept;
    │ │ │ │ +
    │ │ │ │ +

    returns true if all bits in the bitfield are set

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    none_set()

    │ │ │ │ +
    │ │ │ │ +bool none_set () const noexcept;
    │ │ │ │ +
    │ │ │ │ +

    returns true if no bit in the bitfield is set

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    size()

    │ │ │ │ +
    │ │ │ │ +int size () const noexcept;
    │ │ │ │ +
    │ │ │ │ +

    returns the size of the bitfield in bits.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    num_words()

    │ │ │ │ +
    │ │ │ │ +int num_words () const noexcept;
    │ │ │ │ +
    │ │ │ │ +

    returns the number of 32 bit words are needed to represent all bits in │ │ │ │ +this bitfield.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    num_bytes()

    │ │ │ │ +
    │ │ │ │ +int num_bytes () const noexcept;
    │ │ │ │ +
    │ │ │ │ +

    returns the number of bytes needed to represent all bits in this │ │ │ │ +bitfield

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    empty()

    │ │ │ │ +
    │ │ │ │ +bool empty () const noexcept;
    │ │ │ │ +
    │ │ │ │ +

    returns true if the bitfield has zero size.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    data()

    │ │ │ │ +
    │ │ │ │ +char const* data () const noexcept;
    │ │ │ │ +char* data () noexcept;
    │ │ │ │ +
    │ │ │ │ +

    returns a pointer to the internal buffer of the bitfield, or │ │ │ │ +nullptr if it's empty.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    swap()

    │ │ │ │ +
    │ │ │ │ +void swap (bitfield& rhs) noexcept;
    │ │ │ │ +
    │ │ │ │ +

    swaps the bit-fields two variables refer to

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    count()

    │ │ │ │ +
    │ │ │ │ +int count () const noexcept;
    │ │ │ │ +
    │ │ │ │ +

    count the number of bits in the bitfield that are set to 1.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    find_first_set()

    │ │ │ │ +
    │ │ │ │ +int find_first_set () const noexcept;
    │ │ │ │ +
    │ │ │ │ +

    returns the index of the first set bit in the bitfield, i.e. 1 bit.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    find_last_clear()

    │ │ │ │ +
    │ │ │ │ +int find_last_clear () const noexcept;
    │ │ │ │ +
    │ │ │ │ +

    returns the index to the last cleared bit in the bitfield, i.e. 0 bit.

    │ │ │ │ +[report issue]
    │ │ │ │
    │ │ │ │ -
    │ │ │ │ -

    open_file_state

    │ │ │ │ -

    Declared in "libtorrent/disk_interface.hpp"

    │ │ │ │ -

    this contains information about a file that's currently open by the │ │ │ │ -libtorrent disk I/O subsystem. It's associated with a single torrent.

    │ │ │ │ +
    │ │ │ │ +

    hasher

    │ │ │ │ +

    Declared in "libtorrent/hasher.hpp"

    │ │ │ │ +

    this is a SHA-1 hash class.

    │ │ │ │ +

    You use it by first instantiating it, then call update() to feed it │ │ │ │ +with data. i.e. you don't have to keep the entire buffer of which you want to │ │ │ │ +create the hash in memory. You can feed the hasher parts of it at a time. When │ │ │ │ +You have fed the hasher with all the data, you call final() and it │ │ │ │ +will return the sha1-hash of the data.

    │ │ │ │ +

    The constructor that takes a char const* and an integer will construct the │ │ │ │ +sha1 context and feed it the data passed in.

    │ │ │ │ +

    If you want to reuse the hasher object once you have created a hash, you have to │ │ │ │ +call reset() to reinitialize it.

    │ │ │ │ +

    The built-in software version of sha1-algorithm was implemented │ │ │ │ +by Steve Reid and released as public domain. │ │ │ │ +For more info, see src/sha1.cpp.

    │ │ │ │
    │ │ │ │ -struct open_file_state
    │ │ │ │ +class hasher
    │ │ │ │  {
    │ │ │ │ -   file_index_t file_index;
    │ │ │ │ -   file_open_mode_t open_mode;
    │ │ │ │ -   time_point last_use;
    │ │ │ │ +   hasher ();
    │ │ │ │ +   hasher (hasher const&);
    │ │ │ │ +   hasher (char const* data, int len);
    │ │ │ │ +   hasher& operator= (hasher const&) &;
    │ │ │ │ +   explicit hasher (span<char const> data);
    │ │ │ │ +   hasher& update (char const* data, int len);
    │ │ │ │ +   hasher& update (span<char const> data);
    │ │ │ │ +   sha1_hash final ();
    │ │ │ │ +   void reset ();
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ -[report issue]
    │ │ │ │ -
    file_index
    │ │ │ │ -
    the index of the file this entry refers to into the file_storage │ │ │ │ -file list of this torrent. This starts indexing at 0.
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    hasher() operator=()

    │ │ │ │ +
    │ │ │ │ +hasher (hasher const&);
    │ │ │ │ +hasher (char const* data, int len);
    │ │ │ │ +hasher& operator= (hasher const&) &;
    │ │ │ │ +explicit hasher (span<char const> data);
    │ │ │ │ +
    │ │ │ │ +

    this is the same as default constructing followed by a call to │ │ │ │ +update(data, len).

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    update()

    │ │ │ │ +
    │ │ │ │ +hasher& update (char const* data, int len);
    │ │ │ │ +hasher& update (span<char const> data);
    │ │ │ │ +
    │ │ │ │ +

    append the following bytes to what is being hashed

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    final()

    │ │ │ │ +
    │ │ │ │ +sha1_hash final ();
    │ │ │ │ +
    │ │ │ │ +

    returns the SHA-1 digest of the buffers previously passed to │ │ │ │ +update() and the hasher constructor.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    reset()

    │ │ │ │ +
    │ │ │ │ +void reset ();
    │ │ │ │ +
    │ │ │ │ +

    restore the hasher state to be as if the hasher has just been │ │ │ │ +default constructed.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    hasher256

    │ │ │ │ +

    Declared in "libtorrent/hasher.hpp"

    │ │ │ │ +
    │ │ │ │ +class hasher256
    │ │ │ │ +{
    │ │ │ │ +   hasher256 ();
    │ │ │ │ +   explicit hasher256 (span<char const> data);
    │ │ │ │ +   hasher256 (hasher256 const&);
    │ │ │ │ +   hasher256& operator= (hasher256 const&) &;
    │ │ │ │ +   hasher256 (char const* data, int len);
    │ │ │ │ +   hasher256& update (char const* data, int len);
    │ │ │ │ +   hasher256& update (span<char const> data);
    │ │ │ │ +   sha256_hash final ();
    │ │ │ │ +   void reset ();
    │ │ │ │ +   ~hasher256 ();
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    operator=() hasher256()

    │ │ │ │ +
    │ │ │ │ +explicit hasher256 (span<char const> data);
    │ │ │ │ +hasher256 (hasher256 const&);
    │ │ │ │ +hasher256& operator= (hasher256 const&) &;
    │ │ │ │ +hasher256 (char const* data, int len);
    │ │ │ │ +
    │ │ │ │ +

    this is the same as default constructing followed by a call to │ │ │ │ +update(data, len).

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    update()

    │ │ │ │ +
    │ │ │ │ +hasher256& update (char const* data, int len);
    │ │ │ │ +hasher256& update (span<char const> data);
    │ │ │ │ +
    │ │ │ │ +

    append the following bytes to what is being hashed

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    final()

    │ │ │ │ +
    │ │ │ │ +sha256_hash final ();
    │ │ │ │ +
    │ │ │ │ +

    returns the SHA-1 digest of the buffers previously passed to │ │ │ │ +update() and the hasher constructor.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    reset()

    │ │ │ │ +
    │ │ │ │ +void reset ();
    │ │ │ │ +
    │ │ │ │ +

    restore the hasher state to be as if the hasher has just been │ │ │ │ +default constructed.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    block_info

    │ │ │ │ +

    Declared in "libtorrent/torrent_handle.hpp"

    │ │ │ │ +

    holds the state of a block in a piece. Who we requested │ │ │ │ +it from and how far along we are at downloading it.

    │ │ │ │ +
    │ │ │ │ +struct block_info
    │ │ │ │ +{
    │ │ │ │ +   tcp::endpoint peer () const;
    │ │ │ │ +   void set_peer (tcp::endpoint const& ep);
    │ │ │ │ +
    │ │ │ │ +   enum block_state_t
    │ │ │ │ +   {
    │ │ │ │ +      none,
    │ │ │ │ +      requested,
    │ │ │ │ +      writing,
    │ │ │ │ +      finished,
    │ │ │ │ +   };
    │ │ │ │ +
    │ │ │ │ +   unsigned bytes_progress:15;
    │ │ │ │ +   unsigned block_size:15;
    │ │ │ │ +   unsigned state:2;
    │ │ │ │ +   unsigned num_peers:14;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    peer() set_peer()

    │ │ │ │ +
    │ │ │ │ +tcp::endpoint peer () const;
    │ │ │ │ +void set_peer (tcp::endpoint const& ep);
    │ │ │ │ +
    │ │ │ │ +

    The peer is the ip address of the peer this block was downloaded from.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum block_state_t

    │ │ │ │ +

    Declared in "libtorrent/torrent_handle.hpp"

    │ │ │ │ + │ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ +│ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +
    namevaluedescription
    none0This block has not been downloaded or requested form any peer.
    requested1The block has been requested, but not completely downloaded yet.
    writing2The block has been downloaded and is currently queued for being │ │ │ │ +written to disk.
    finished3The block has been written to disk.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    bytes_progress
    │ │ │ │ +
    the number of bytes that have been received for this block
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    open_mode
    │ │ │ │ -

    open_mode is a bitmask of the file flags this file is currently │ │ │ │ -opened with. For possible flags, see file_open_mode_t.

    │ │ │ │ -

    Note that the read/write mode is not a bitmask. The two least significant bits are used │ │ │ │ -to represent the read/write mode. Those bits can be masked out using the rw_mask constant.

    │ │ │ │ -
    │ │ │ │ +[report issue]
    │ │ │ │ +
    block_size
    │ │ │ │ +
    the total number of bytes in this block.
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    last_use
    │ │ │ │ -
    a (high precision) timestamp of when the file was last used.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    state
    │ │ │ │ +
    the state this block is in (see block_state_t)
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    disk_interface

    │ │ │ │ -

    Declared in "libtorrent/disk_interface.hpp"

    │ │ │ │ -

    The disk_interface is the customization point for disk I/O in libtorrent. │ │ │ │ -implement this interface and provide a factory function to the session constructor │ │ │ │ -use custom disk I/O. All functions on the disk subsystem (implementing │ │ │ │ -disk_interface) are called from within libtorrent's network thread. For │ │ │ │ -disk I/O to be performed in a separate thread, the disk subsystem has to │ │ │ │ -manage that itself.

    │ │ │ │ -

    Although the functions are called async_*, they do not technically │ │ │ │ -have to be asynchronous, but they support being asynchronous, by │ │ │ │ -expecting the result passed back into a callback. The callbacks must be │ │ │ │ -posted back onto the network thread via the io_context object passed into │ │ │ │ -the constructor. The callbacks will be run in the network thread.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    num_peers
    │ │ │ │ +
    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.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    partial_piece_info

    │ │ │ │ +

    Declared in "libtorrent/torrent_handle.hpp"

    │ │ │ │ +

    This class holds information about pieces that have outstanding requests │ │ │ │ +or outstanding writes

    │ │ │ │ +
    │ │ │ │ +struct partial_piece_info
    │ │ │ │ +{
    │ │ │ │ +   piece_index_t piece_index;
    │ │ │ │ +   int blocks_in_piece;
    │ │ │ │ +   int finished;
    │ │ │ │ +   int writing;
    │ │ │ │ +   int requested;
    │ │ │ │ +   block_info const* blocks;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    piece_index
    │ │ │ │ +
    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.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    blocks_in_piece
    │ │ │ │ +
    the number of blocks in this piece
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    finished
    │ │ │ │ +
    the number of blocks that are in the finished state
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    writing
    │ │ │ │ +
    the number of blocks that are in the writing state
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    requested
    │ │ │ │ +
    the number of blocks that are in the requested state
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    blocks
    │ │ │ │ +

    this is an array of blocks_in_piece number of │ │ │ │ +items. One for each block in the piece.

    │ │ │ │ +
    │ │ │ │ +

    Warning

    │ │ │ │ +

    This is a pointer that points to an array │ │ │ │ +that's owned by the session object. The next time │ │ │ │ +get_download_queue() is called, it will be invalidated. │ │ │ │ +In the case of piece_info_alert, these pointers point into the alert │ │ │ │ +object itself, and will be invalidated when the alert destruct.

    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    torrent_handle

    │ │ │ │ +

    Declared in "libtorrent/torrent_handle.hpp"

    │ │ │ │ +

    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.

    │ │ │ │ +
    │ │ │ │ +

    Warning

    │ │ │ │ +

    Any member function that returns a value or fills in a value has to be │ │ │ │ +made synchronously. This means it has to wait for the main thread to │ │ │ │ +complete the query before it can return. This might potentially be │ │ │ │ +expensive if done from within a GUI thread that needs to stay │ │ │ │ +responsive. Try to avoid querying for information you don't need, and │ │ │ │ +try to do it in as few calls as possible. You can get most of the │ │ │ │ +interesting information about a torrent from the │ │ │ │ +torrent_handle::status() call.

    │ │ │ │ +
    │ │ │ │ +

    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 system_error │ │ │ │ +exception, in case the handle is no longer referring to a torrent. │ │ │ │ +There is one exception 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.

    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +struct torrent_handle
    │ │ │ │ +{
    │ │ │ │ +   friend std::size_t hash_value (torrent_handle const& th);
    │ │ │ │ +   torrent_handle () noexcept = default;
    │ │ │ │ +   void add_piece (piece_index_t piece, char const* data, add_piece_flags_t flags = {}) const;
    │ │ │ │ +   void add_piece (piece_index_t piece, std::vector<char> data, add_piece_flags_t flags = {}) const;
    │ │ │ │ +   void read_piece (piece_index_t piece) const;
    │ │ │ │ +   bool have_piece (piece_index_t piece) const;
    │ │ │ │ +   void post_peer_info () const;
    │ │ │ │ +   void get_peer_info (std::vector<peer_info>& v) const;
    │ │ │ │ +   torrent_status status (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │ +   void post_status (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │ +   std::vector<partial_piece_info> get_download_queue () const;
    │ │ │ │ +   void get_download_queue (std::vector<partial_piece_info>& queue) const;
    │ │ │ │ +   void post_download_queue () const;
    │ │ │ │ +   void set_piece_deadline (piece_index_t index, int deadline, deadline_flags_t flags = {}) const;
    │ │ │ │ +   void reset_piece_deadline (piece_index_t index) const;
    │ │ │ │ +   void clear_piece_deadlines () const;
    │ │ │ │ +   std::vector<std::int64_t> file_progress (file_progress_flags_t flags = {}) const;
    │ │ │ │ +   void file_progress (std::vector<std::int64_t>& progress, file_progress_flags_t flags = {}) const;
    │ │ │ │ +   void post_file_progress (file_progress_flags_t flags) const;
    │ │ │ │ +   std::vector<open_file_state> file_status () const;
    │ │ │ │ +   void clear_error () const;
    │ │ │ │ +   void post_trackers () const;
    │ │ │ │ +   void add_tracker (announce_entry const&) const;
    │ │ │ │ +   std::vector<announce_entry> trackers () const;
    │ │ │ │ +   void replace_trackers (std::vector<announce_entry> const&) const;
    │ │ │ │ +   std::set<std::string> url_seeds () const;
    │ │ │ │ +   void add_url_seed (std::string const& url) const;
    │ │ │ │ +   void remove_url_seed (std::string const& url) const;
    │ │ │ │ +   std::set<std::string> http_seeds () const;
    │ │ │ │ +   void add_http_seed (std::string const& url) const;
    │ │ │ │ +   void remove_http_seed (std::string const& url) const;
    │ │ │ │ +   void add_extension (
    │ │ │ │ +      std::function<std::shared_ptr<torrent_plugin>(torrent_handle const&, client_data_t)> const& ext
    │ │ │ │ +      , client_data_t userdata = client_data_t{});
    │ │ │ │ +   bool set_metadata (span<char const> metadata) const;
    │ │ │ │ +   bool is_valid () const;
    │ │ │ │ +   void pause (pause_flags_t flags = {}) const;
    │ │ │ │ +   void resume () const;
    │ │ │ │ +   torrent_flags_t flags () const;
    │ │ │ │ +   void set_flags (torrent_flags_t flags, torrent_flags_t mask) const;
    │ │ │ │ +   void set_flags (torrent_flags_t flags) const;
    │ │ │ │ +   void unset_flags (torrent_flags_t flags) const;
    │ │ │ │ +   void flush_cache () const;
    │ │ │ │ +   void force_recheck () const;
    │ │ │ │ +   void save_resume_data (resume_data_flags_t flags = {}) const;
    │ │ │ │ +   bool need_save_resume_data (resume_data_flags_t flags) const;
    │ │ │ │ +   bool need_save_resume_data () const;
    │ │ │ │ +   void queue_position_bottom () const;
    │ │ │ │ +   void queue_position_down () const;
    │ │ │ │ +   void queue_position_top () const;
    │ │ │ │ +   void queue_position_up () const;
    │ │ │ │ +   queue_position_t queue_position () const;
    │ │ │ │ +   void queue_position_set (queue_position_t p) const;
    │ │ │ │ +   void set_ssl_certificate_buffer (std::string const& certificate
    │ │ │ │ +      , std::string const& private_key
    │ │ │ │ +      , std::string const& dh_params);
    │ │ │ │ +   void set_ssl_certificate (std::string const& certificate
    │ │ │ │ +      , std::string const& private_key
    │ │ │ │ +      , std::string const& dh_params
    │ │ │ │ +      , std::string const& passphrase = "");
    │ │ │ │ +   std::shared_ptr<torrent_info> torrent_file_with_hashes () const;
    │ │ │ │ +   std::shared_ptr<const torrent_info> torrent_file () const;
    │ │ │ │ +   std::vector<std::vector<sha256_hash>> piece_layers () const;
    │ │ │ │ +   void piece_availability (std::vector<int>& avail) const;
    │ │ │ │ +   void post_piece_availability () const;
    │ │ │ │ +   void prioritize_pieces (std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces) const;
    │ │ │ │ +   download_priority_t piece_priority (piece_index_t index) const;
    │ │ │ │ +   void piece_priority (piece_index_t index, download_priority_t priority) const;
    │ │ │ │ +   std::vector<download_priority_t> get_piece_priorities () const;
    │ │ │ │ +   void prioritize_pieces (std::vector<download_priority_t> const& pieces) const;
    │ │ │ │ +   void prioritize_files (std::vector<download_priority_t> const& files) const;
    │ │ │ │ +   void file_priority (file_index_t index, download_priority_t priority) const;
    │ │ │ │ +   download_priority_t file_priority (file_index_t index) const;
    │ │ │ │ +   std::vector<download_priority_t> get_file_priorities () const;
    │ │ │ │ +   void force_reannounce (int seconds = 0, int idx = -1, reannounce_flags_t = {}) const;
    │ │ │ │ +   void force_lsd_announce () const;
    │ │ │ │ +   void force_dht_announce () const;
    │ │ │ │ +   void scrape_tracker (int idx = -1) const;
    │ │ │ │ +   void set_upload_limit (int limit) const;
    │ │ │ │ +   void set_download_limit (int limit) const;
    │ │ │ │ +   int download_limit () const;
    │ │ │ │ +   int upload_limit () const;
    │ │ │ │ +   void connect_peer (tcp::endpoint const& adr, peer_source_flags_t source = {}
    │ │ │ │ +      , pex_flags_t flags = pex_encryption | pex_utp | pex_holepunch) const;
    │ │ │ │ +   void clear_peers ();
    │ │ │ │ +   void set_max_uploads (int max_uploads) const;
    │ │ │ │ +   int max_uploads () const;
    │ │ │ │ +   void set_max_connections (int max_connections) const;
    │ │ │ │ +   int max_connections () const;
    │ │ │ │ +   void move_storage (std::string const& save_path
    │ │ │ │ +      , move_flags_t flags = move_flags_t::always_replace_files
    │ │ │ │ +      ) const;
    │ │ │ │ +   void rename_file (file_index_t index, std::string const& new_name) const;
    │ │ │ │ +   sha1_hash info_hash () const;
    │ │ │ │ +   info_hash_t info_hashes () const;
    │ │ │ │ +   bool operator== (const torrent_handle& h) const;
    │ │ │ │ +   bool operator!= (const torrent_handle& h) const;
    │ │ │ │ +   bool operator< (const torrent_handle& h) const;
    │ │ │ │ +   std::uint32_t id () const;
    │ │ │ │ +   std::shared_ptr<torrent> native_handle () const;
    │ │ │ │ +   client_data_t userdata () const;
    │ │ │ │ +   bool in_session () const;
    │ │ │ │ +
    │ │ │ │ +   static constexpr add_piece_flags_t overwrite_existing  = 0_bit;
    │ │ │ │ +   static constexpr status_flags_t query_distributed_copies  = 0_bit;
    │ │ │ │ +   static constexpr status_flags_t query_accurate_download_counters  = 1_bit;
    │ │ │ │ +   static constexpr status_flags_t query_last_seen_complete  = 2_bit;
    │ │ │ │ +   static constexpr status_flags_t query_pieces  = 3_bit;
    │ │ │ │ +   static constexpr status_flags_t query_verified_pieces  = 4_bit;
    │ │ │ │ +   static constexpr status_flags_t query_torrent_file  = 5_bit;
    │ │ │ │ +   static constexpr status_flags_t query_name  = 6_bit;
    │ │ │ │ +   static constexpr status_flags_t query_save_path  = 7_bit;
    │ │ │ │ +   static constexpr deadline_flags_t alert_when_available  = 0_bit;
    │ │ │ │ +   static constexpr file_progress_flags_t piece_granularity  = 0_bit;
    │ │ │ │ +   static constexpr pause_flags_t graceful_pause  = 0_bit;
    │ │ │ │ +   static constexpr resume_data_flags_t flush_disk_cache  = 0_bit;
    │ │ │ │ +   static constexpr resume_data_flags_t save_info_dict  = 1_bit;
    │ │ │ │ +   static constexpr resume_data_flags_t only_if_modified  = 2_bit;
    │ │ │ │ +   static constexpr resume_data_flags_t if_counters_changed  = 3_bit;
    │ │ │ │ +   static constexpr resume_data_flags_t if_download_progress  = 4_bit;
    │ │ │ │ +   static constexpr resume_data_flags_t if_config_changed  = 5_bit;
    │ │ │ │ +   static constexpr resume_data_flags_t if_state_changed  = 6_bit;
    │ │ │ │ +   static constexpr resume_data_flags_t if_metadata_changed  = 7_bit;
    │ │ │ │ +   static constexpr reannounce_flags_t ignore_min_interval  = 0_bit;
    │ │ │ │ +};
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +

    torrent_handle()

    │ │ │ │ +
    │ │ │ │ +torrent_handle () noexcept = default;
    │ │ │ │ +
    │ │ │ │ +

    constructs a torrent handle that does not refer to a torrent. │ │ │ │ +i.e. is_valid() will return false.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    add_piece()

    │ │ │ │ +
    │ │ │ │ +void add_piece (piece_index_t piece, char const* data, add_piece_flags_t flags = {}) const;
    │ │ │ │ +void add_piece (piece_index_t piece, std::vector<char> data, add_piece_flags_t flags = {}) const;
    │ │ │ │ +
    │ │ │ │ +

    This function will write data to the storage as piece piece, │ │ │ │ +as if it had been downloaded from a peer.

    │ │ │ │ +

    By default, data that's already been downloaded is not overwritten by │ │ │ │ +this buffer. If you trust this data to be correct (and pass the piece │ │ │ │ +hash check) you may pass the overwrite_existing flag. This will │ │ │ │ +instruct libtorrent to overwrite any data that may already have been │ │ │ │ +downloaded with this data.

    │ │ │ │ +

    Since the data is written asynchronously, you may know that is passed │ │ │ │ +or failed the hash check by waiting for piece_finished_alert or │ │ │ │ +hash_failed_alert.

    │ │ │ │ +

    Adding pieces while the torrent is being checked (i.e. in │ │ │ │ +torrent_status::checking_files state) is not supported.

    │ │ │ │ +

    The overload taking a raw pointer to the data is a blocking call. It │ │ │ │ +won't return until the libtorrent thread has copied the data into its │ │ │ │ +disk write buffer. data is expected to point to a buffer of as │ │ │ │ +many bytes as the size of the specified piece. See │ │ │ │ +file_storage::piece_size().

    │ │ │ │ +

    The data in the buffer is copied and passed on to the disk IO thread │ │ │ │ +to be written at a later point.

    │ │ │ │ +

    The overload taking a std::vector<char> is not blocking, it will │ │ │ │ +send the buffer to the main thread and return immediately.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    read_piece()

    │ │ │ │ +
    │ │ │ │ +void read_piece (piece_index_t piece) const;
    │ │ │ │ +
    │ │ │ │ +

    This function starts an asynchronous read operation of the specified │ │ │ │ +piece from this torrent. You must have completed the download of the │ │ │ │ +specified piece before calling this function.

    │ │ │ │ +

    When the read operation is completed, it is passed back through an │ │ │ │ +alert, read_piece_alert. Since this alert is a response to an explicit │ │ │ │ +call, it will always be posted, regardless of the alert mask.

    │ │ │ │ +

    Note that if you read multiple pieces, the read operations are not │ │ │ │ +guaranteed to finish in the same order as you initiated them.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    have_piece()

    │ │ │ │ +
    │ │ │ │ +bool have_piece (piece_index_t piece) const;
    │ │ │ │ +
    │ │ │ │ +

    Returns true if this piece has been completely downloaded and written │ │ │ │ +to disk, and false otherwise.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    post_peer_info() get_peer_info()

    │ │ │ │ +
    │ │ │ │ +void post_peer_info () const;
    │ │ │ │ +void get_peer_info (std::vector<peer_info>& v) const;
    │ │ │ │ +
    │ │ │ │ +

    Query information about connected peers for this torrent. If the │ │ │ │ +torrent_handle is invalid, it will throw a system_error exception.

    │ │ │ │ +

    post_peer_info() is asynchronous and will trigger the posting of │ │ │ │ +a peer_info_alert. The alert contain a list of peer_info objects, one │ │ │ │ +for each connected peer.

    │ │ │ │ +

    get_peer_info() is synchronous and 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. Each entry in │ │ │ │ +the vector contains information about that particular peer. See │ │ │ │ +peer_info.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    post_status() status()

    │ │ │ │ +
    │ │ │ │ +torrent_status status (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │ +void post_status (status_flags_t flags = status_flags_t::all()) const;
    │ │ │ │ +
    │ │ │ │ +

    status() will return a structure with information about the status │ │ │ │ +of this torrent. If the torrent_handle is invalid, it will throw │ │ │ │ +system_error exception. See torrent_status. The flags │ │ │ │ +argument filters what information is returned in the torrent_status. │ │ │ │ +Some information in there is relatively expensive to calculate, and if │ │ │ │ +you're not interested in it (and see performance issues), you can │ │ │ │ +filter them out.

    │ │ │ │ +

    The status() function will block until the internal libtorrent │ │ │ │ +thread responds with the torrent_status object. To avoid blocking, │ │ │ │ +instead call post_status(). It will trigger posting of a │ │ │ │ +state_update_alert with a single torrent_status object for this │ │ │ │ +torrent.

    │ │ │ │ +

    In order to get regular updates for torrents whose status changes, │ │ │ │ +consider calling session::post_torrent_updates()`` instead.

    │ │ │ │ +

    By default everything is included. The flags you can use to decide │ │ │ │ +what to include are defined in this class.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    get_download_queue() post_download_queue()

    │ │ │ │ +
    │ │ │ │ +std::vector<partial_piece_info> get_download_queue () const;
    │ │ │ │ +void get_download_queue (std::vector<partial_piece_info>& queue) const;
    │ │ │ │ +void post_download_queue () const;
    │ │ │ │ +
    │ │ │ │ +

    post_download_queue() triggers a download_queue_alert to be │ │ │ │ +posted. │ │ │ │ +get_download_queue() is a synchronous call and returns a vector │ │ │ │ +with information about pieces that are partially downloaded or not │ │ │ │ +downloaded but partially requested. See partial_piece_info for the │ │ │ │ +fields in the returned vector.

    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    reset_piece_deadline() clear_piece_deadlines() set_piece_deadline()

    │ │ │ │ +
    │ │ │ │ +void set_piece_deadline (piece_index_t index, int deadline, deadline_flags_t flags = {}) const;
    │ │ │ │ +void reset_piece_deadline (piece_index_t index) const;
    │ │ │ │ +void clear_piece_deadlines () const;
    │ │ │ │ +
    │ │ │ │ +

    This function sets or resets the deadline associated with a specific │ │ │ │ +piece index (index). libtorrent will attempt to download this │ │ │ │ +entire piece before the deadline expires. This is not necessarily │ │ │ │ +possible, but pieces with a more recent deadline will always be │ │ │ │ +prioritized over pieces with a deadline further ahead in time. The │ │ │ │ +deadline (and flags) of a piece can be changed by calling this │ │ │ │ +function again.

    │ │ │ │ +

    If the piece is already downloaded when this call is made, nothing │ │ │ │ +happens, unless the alert_when_available flag is set, in which case it │ │ │ │ +will have the same effect as calling read_piece() for index.

    │ │ │ │ +

    deadline is the number of milliseconds until this piece should be │ │ │ │ +completed.

    │ │ │ │ +

    reset_piece_deadline removes the deadline from the piece. If it │ │ │ │ +hasn't already been downloaded, it will no longer be considered a │ │ │ │ +priority.

    │ │ │ │ +

    clear_piece_deadlines() removes deadlines on all pieces in │ │ │ │ +the torrent. As if reset_piece_deadline() was called on all pieces.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    file_progress() post_file_progress()

    │ │ │ │ +
    │ │ │ │ +std::vector<std::int64_t> file_progress (file_progress_flags_t flags = {}) const;
    │ │ │ │ +void file_progress (std::vector<std::int64_t>& progress, file_progress_flags_t flags = {}) const;
    │ │ │ │ +void post_file_progress (file_progress_flags_t flags) const;
    │ │ │ │ +
    │ │ │ │ +

    This function fills in the supplied vector, or returns a vector, with │ │ │ │ +the number of bytes downloaded 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. Its complexity is O(n + mj). │ │ │ │ +Where n is the number of files, m is the number of currently │ │ │ │ +downloading pieces and j is the number of blocks in a piece.

    │ │ │ │ +

    The flags parameter can be used to specify the granularity of the │ │ │ │ +file progress. If left at the default value of 0, the progress will be │ │ │ │ +as accurate as possible, but also more expensive to calculate. If │ │ │ │ +torrent_handle::piece_granularity is specified, the progress will │ │ │ │ +be specified in piece granularity. i.e. only pieces that have been │ │ │ │ +fully downloaded and passed the hash check count. When specifying │ │ │ │ +piece granularity, the operation is a lot cheaper, since libtorrent │ │ │ │ +already keeps track of this internally and no calculation is required.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    file_status()

    │ │ │ │ +
    │ │ │ │ +std::vector<open_file_state> file_status () const;
    │ │ │ │ +
    │ │ │ │ +

    This function returns a vector with status about files │ │ │ │ +that are open for this torrent. Any file that is not open │ │ │ │ +will not be reported in the vector, i.e. it's possible that │ │ │ │ +the vector is empty when returning, if none of the files in the │ │ │ │ +torrent are currently open.

    │ │ │ │ +

    See open_file_state

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    clear_error()

    │ │ │ │ +
    │ │ │ │ +void clear_error () const;
    │ │ │ │ +
    │ │ │ │ +

    If the torrent is in an error state (i.e. torrent_status::error is │ │ │ │ +non-empty), this will clear the error and start the torrent again.

    │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    add_tracker() trackers() post_trackers() replace_trackers()

    │ │ │ │ +
    │ │ │ │ +void post_trackers () const;
    │ │ │ │ +void add_tracker (announce_entry const&) const;
    │ │ │ │ +std::vector<announce_entry> trackers () const;
    │ │ │ │ +void replace_trackers (std::vector<announce_entry> const&) const;
    │ │ │ │ +
    │ │ │ │ +

    trackers() returns 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(). See │ │ │ │ +announce_entry.

    │ │ │ │ +

    post_trackers() is the asynchronous version of trackers(). It │ │ │ │ +will trigger a tracker_list_alert to be posted.

    │ │ │ │ +

    add_tracker() will look if the specified tracker is already in the │ │ │ │ +set. If it is, it doesn't do anything. If it's not in the current set │ │ │ │ +of trackers, it will insert it in the tier specified in the │ │ │ │ +announce_entry.

    │ │ │ │ +

    The updated set of trackers will be saved in the resume data, and when │ │ │ │ +a torrent is started with resume data, the trackers from the resume │ │ │ │ +data will replace the original ones.

    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    url_seeds() remove_url_seed() add_url_seed()

    │ │ │ │ +
    │ │ │ │ +std::set<std::string> url_seeds () const;
    │ │ │ │ +void add_url_seed (std::string const& url) const;
    │ │ │ │ +void remove_url_seed (std::string const& url) 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.

    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    remove_http_seed() add_http_seed() http_seeds()

    │ │ │ │ +
    │ │ │ │ +std::set<std::string> http_seeds () const;
    │ │ │ │ +void add_http_seed (std::string const& url) const;
    │ │ │ │ +void remove_http_seed (std::string const& url) const;
    │ │ │ │ +
    │ │ │ │ +

    These functions are identical as the *_url_seed() variants, but │ │ │ │ +they operate on BEP 17 web seeds instead of BEP 19.

    │ │ │ │ +

    See http seeding for more information.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    add_extension()

    │ │ │ │
    │ │ │ │ -struct disk_interface
    │ │ │ │ -{
    │ │ │ │ -   virtual storage_holder new_torrent (storage_params const& p
    │ │ │ │ -      , std::shared_ptr<void> const& torrent) = 0;
    │ │ │ │ -   virtual void remove_torrent (storage_index_t) = 0;
    │ │ │ │ -   virtual bool async_write (storage_index_t storage, peer_request const& r
    │ │ │ │ -      , char const* buf, std::shared_ptr<disk_observer> o
    │ │ │ │ -      , std::function<void(storage_error const&)> handler
    │ │ │ │ -      , disk_job_flags_t flags = {}) = 0;
    │ │ │ │ -   virtual void async_read (storage_index_t storage, peer_request const& r
    │ │ │ │ -      , std::function<void(disk_buffer_holder, storage_error const&)> handler
    │ │ │ │ -      , disk_job_flags_t flags = {}) = 0;
    │ │ │ │ -   virtual void async_hash (storage_index_t storage, piece_index_t piece, span<sha256_hash> v2
    │ │ │ │ -      , disk_job_flags_t flags
    │ │ │ │ -      , std::function<void(piece_index_t, sha1_hash const&, storage_error const&)> handler) = 0;
    │ │ │ │ -   virtual void async_hash2 (storage_index_t storage, piece_index_t piece, int offset, disk_job_flags_t flags
    │ │ │ │ -      , std::function<void(piece_index_t, sha256_hash const&, storage_error const&)> handler) = 0;
    │ │ │ │ -   virtual void async_move_storage (storage_index_t storage, std::string p, move_flags_t flags
    │ │ │ │ -      , std::function<void(status_t, std::string const&, storage_error const&)> handler) = 0;
    │ │ │ │ -   virtual void async_release_files (storage_index_t storage
    │ │ │ │ -      , std::function<void()> handler = std::function<void()>()) = 0;
    │ │ │ │ -   virtual void async_check_files (storage_index_t storage
    │ │ │ │ -      , add_torrent_params const* resume_data
    │ │ │ │ -      , aux::vector<std::string, file_index_t> links
    │ │ │ │ -      , std::function<void(status_t, storage_error const&)> handler) = 0;
    │ │ │ │ -   virtual void async_stop_torrent (storage_index_t storage
    │ │ │ │ -      , std::function<void()> handler = std::function<void()>()) = 0;
    │ │ │ │ -   virtual void async_rename_file (storage_index_t storage
    │ │ │ │ -      , file_index_t index, std::string name
    │ │ │ │ -      , std::function<void(std::string const&, file_index_t, storage_error const&)> handler) = 0;
    │ │ │ │ -   virtual void async_delete_files (storage_index_t storage, remove_flags_t options
    │ │ │ │ -      , std::function<void(storage_error const&)> handler) = 0;
    │ │ │ │ -   virtual void async_set_file_priority (storage_index_t storage
    │ │ │ │ -      , aux::vector<download_priority_t, file_index_t> prio
    │ │ │ │ -      , std::function<void(storage_error const&
    │ │ │ │ -      , aux::vector<download_priority_t, file_index_t>)> handler) = 0;
    │ │ │ │ -   virtual void async_clear_piece (storage_index_t storage, piece_index_t index
    │ │ │ │ -      , std::function<void(piece_index_t)> handler) = 0;
    │ │ │ │ -   virtual void update_stats_counters (counters& c) const = 0;
    │ │ │ │ -   virtual std::vector<open_file_state> get_status (storage_index_t) const = 0;
    │ │ │ │ -   virtual void abort (bool wait) = 0;
    │ │ │ │ -   virtual void submit_jobs () = 0;
    │ │ │ │ -   virtual void settings_updated () = 0;
    │ │ │ │ -
    │ │ │ │ -   static constexpr disk_job_flags_t force_copy  = 0_bit;
    │ │ │ │ -   static constexpr disk_job_flags_t sequential_access  = 3_bit;
    │ │ │ │ -   static constexpr disk_job_flags_t volatile_read  = 4_bit;
    │ │ │ │ -   static constexpr disk_job_flags_t v1_hash  = 5_bit;
    │ │ │ │ -   static constexpr disk_job_flags_t flush_piece  = 7_bit;
    │ │ │ │ -};
    │ │ │ │ +void add_extension (
    │ │ │ │ +      std::function<std::shared_ptr<torrent_plugin>(torrent_handle const&, client_data_t)> const& ext
    │ │ │ │ +      , client_data_t userdata = client_data_t{});
    │ │ │ │  
    │ │ │ │ -[report issue]
    │ │ │ │ -

    new_torrent()

    │ │ │ │ +

    add the specified extension to this torrent. The ext argument is │ │ │ │ +a function that will be called from within libtorrent's context │ │ │ │ +passing in the internal torrent object and the specified userdata │ │ │ │ +pointer. The function is expected to return a shared pointer to │ │ │ │ +a torrent_plugin instance.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_metadata()

    │ │ │ │
    │ │ │ │ -virtual storage_holder new_torrent (storage_params const& p
    │ │ │ │ -      , std::shared_ptr<void> const& torrent) = 0;
    │ │ │ │ +bool set_metadata (span<char const> metadata) const;
    │ │ │ │  
    │ │ │ │ -

    this is called when a new torrent is added. The shared_ptr can be │ │ │ │ -used to hold the internal torrent object alive as long as there are │ │ │ │ -outstanding disk operations on the storage. │ │ │ │ -The returned storage_holder is an owning reference to the underlying │ │ │ │ -storage that was just created. It is fundamentally a storage_index_t

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    remove_torrent()

    │ │ │ │ +

    set_metadata expects the info section of metadata. i.e. The │ │ │ │ +buffer passed in will be hashed and verified against the info-hash. If │ │ │ │ +it fails, a metadata_failed_alert will be generated. If it passes, │ │ │ │ +a metadata_received_alert is generated. The function returns true │ │ │ │ +if the metadata is successfully set on the torrent, and false │ │ │ │ +otherwise. If the torrent already has metadata, this function will not │ │ │ │ +affect the torrent, and false will be returned.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    is_valid()

    │ │ │ │
    │ │ │ │ -virtual void remove_torrent (storage_index_t) = 0;
    │ │ │ │ +bool is_valid () const;
    │ │ │ │  
    │ │ │ │ -

    remove the storage with the specified index. This is not expected to │ │ │ │ -delete any files from disk, just to clean up any resources associated │ │ │ │ -with the specified storage.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    async_write() async_read()

    │ │ │ │ +

    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 │ │ │ │ +removed from the session AND destructed.

    │ │ │ │ +

    To tell if the torrent_handle is in the session, use │ │ │ │ +torrent_handle::in_session(). This will return true before │ │ │ │ +session_handle::remove_torrent() is called, and false │ │ │ │ +afterward.

    │ │ │ │ +

    Clients should only use is_valid() to determine if the result of │ │ │ │ +session::find_torrent() was successful.

    │ │ │ │ +

    Unlike other member functions which return a value, is_valid() │ │ │ │ +completes immediately, without blocking on a result from the │ │ │ │ +network thread. Also unlike other functions, it never throws │ │ │ │ +the system_error exception.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    resume() pause()

    │ │ │ │
    │ │ │ │ -virtual bool async_write (storage_index_t storage, peer_request const& r
    │ │ │ │ -      , char const* buf, std::shared_ptr<disk_observer> o
    │ │ │ │ -      , std::function<void(storage_error const&)> handler
    │ │ │ │ -      , disk_job_flags_t flags = {}) = 0;
    │ │ │ │ -virtual void async_read (storage_index_t storage, peer_request const& r
    │ │ │ │ -      , std::function<void(disk_buffer_holder, storage_error const&)> handler
    │ │ │ │ -      , disk_job_flags_t flags = {}) = 0;
    │ │ │ │ +void pause (pause_flags_t flags = {}) const;
    │ │ │ │ +void resume () const;
    │ │ │ │  
    │ │ │ │ -

    perform a read or write operation from/to the specified storage │ │ │ │ -index and the specified request. When the operation completes, call │ │ │ │ -handler possibly with a disk_buffer_holder, holding the buffer with │ │ │ │ -the result. Flags may be set to affect the read operation. See │ │ │ │ -disk_job_flags_t.

    │ │ │ │ -

    The disk_observer is a callback to indicate that │ │ │ │ -the store buffer/disk write queue is below the watermark to let peers │ │ │ │ -start writing buffers to disk again. When async_write() returns │ │ │ │ -true, indicating the write queue is full, the peer will stop │ │ │ │ -further writes and wait for the passed-in disk_observer to be │ │ │ │ -notified before resuming.

    │ │ │ │ -

    Note that for async_read, the peer_request (r) is not │ │ │ │ -necessarily aligned to blocks (but it is most of the time). However, │ │ │ │ -all writes (passed to async_write) are guaranteed to be block │ │ │ │ -aligned.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    async_hash()

    │ │ │ │ +

    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. Torrents may be paused automatically if there is a │ │ │ │ +file error (e.g. disk full) or something similar. See │ │ │ │ +file_error_alert.

    │ │ │ │ +

    For possible values of the flags parameter, see pause_flags_t.

    │ │ │ │ +

    To know if a torrent is paused or not, call │ │ │ │ +torrent_handle::flags() and check for the │ │ │ │ +torrent_status::paused flag.

    │ │ │ │ +
    │ │ │ │ +

    Note

    │ │ │ │ +

    Torrents that are auto-managed may be automatically resumed again. It │ │ │ │ +does not make sense to pause an auto-managed torrent without making it │ │ │ │ +not auto-managed first. Torrents are auto-managed by default when added │ │ │ │ +to the session. For more information, see queuing.

    │ │ │ │ +
    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_flags() flags() unset_flags()

    │ │ │ │
    │ │ │ │ -virtual void async_hash (storage_index_t storage, piece_index_t piece, span<sha256_hash> v2
    │ │ │ │ -      , disk_job_flags_t flags
    │ │ │ │ -      , std::function<void(piece_index_t, sha1_hash const&, storage_error const&)> handler) = 0;
    │ │ │ │ +torrent_flags_t flags () const;
    │ │ │ │ +void set_flags (torrent_flags_t flags, torrent_flags_t mask) const;
    │ │ │ │ +void set_flags (torrent_flags_t flags) const;
    │ │ │ │ +void unset_flags (torrent_flags_t flags) const;
    │ │ │ │  
    │ │ │ │ -

    Compute hash(es) for the specified piece. Unless the v1_hash flag is │ │ │ │ -set (in flags), the SHA-1 hash of the whole piece does not need │ │ │ │ -to be computed.

    │ │ │ │ -

    The v2 span is optional and can be empty, which means v2 hashes │ │ │ │ -should not be computed. If v2 is non-empty it must be at least large │ │ │ │ -enough to hold all v2 blocks in the piece, and this function will │ │ │ │ -fill in the span with the SHA-256 block hashes of the piece.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    async_hash2()

    │ │ │ │ +

    sets and gets the torrent state flags. See torrent_flags_t. │ │ │ │ +The set_flags overload that take a mask will affect all │ │ │ │ +flags part of the mask, and set their values to what the │ │ │ │ +flags argument is set to. This allows clearing and │ │ │ │ +setting flags in a single function call. │ │ │ │ +The set_flags overload that just takes flags, sets all │ │ │ │ +the specified flags and leave any other flags unchanged. │ │ │ │ +unset_flags clears the specified flags, while leaving │ │ │ │ +any other flags unchanged.

    │ │ │ │ +

    The seed_mode flag is special, it can only be cleared once the │ │ │ │ +torrent has been added, and it can only be set as part of the │ │ │ │ +add_torrent_params flags, when adding the torrent.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    flush_cache()

    │ │ │ │
    │ │ │ │ -virtual void async_hash2 (storage_index_t storage, piece_index_t piece, int offset, disk_job_flags_t flags
    │ │ │ │ -      , std::function<void(piece_index_t, sha256_hash const&, storage_error const&)> handler) = 0;
    │ │ │ │ +void flush_cache () const;
    │ │ │ │  
    │ │ │ │ -

    computes the v2 hash (SHA-256) of a single block. The block at │ │ │ │ -offset in piece piece.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    async_move_storage()

    │ │ │ │ +

    Instructs libtorrent to flush all the disk caches for this torrent and │ │ │ │ +close all file handles. This is done asynchronously and you will be │ │ │ │ +notified that it's complete through cache_flushed_alert.

    │ │ │ │ +

    Note that by the time you get the alert, libtorrent may have cached │ │ │ │ +more data for the torrent, but you are guaranteed that whatever cached │ │ │ │ +data libtorrent had by the time you called │ │ │ │ +torrent_handle::flush_cache() has been written to disk.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    force_recheck()

    │ │ │ │
    │ │ │ │ -virtual void async_move_storage (storage_index_t storage, std::string p, move_flags_t flags
    │ │ │ │ -      , std::function<void(status_t, std::string const&, storage_error const&)> handler) = 0;
    │ │ │ │ +void force_recheck () const;
    │ │ │ │  
    │ │ │ │ -

    called to request the files for the specified storage/torrent be │ │ │ │ -moved to a new location. It is the disk I/O object's responsibility │ │ │ │ -to synchronize this with any currently outstanding disk operations to │ │ │ │ -the storage. Whether files are replaced at the destination path or │ │ │ │ -not is controlled by flags (see move_flags_t).

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    async_release_files()

    │ │ │ │ +

    force_recheck puts the torrent back in a state where it assumes to │ │ │ │ +have no resume data. All peers will be disconnected and the torrent │ │ │ │ +will stop announcing to the tracker. The torrent will be added to the │ │ │ │ +checking queue, and will be checked (all the files will be read and │ │ │ │ +compared to the piece hashes). Once the check is complete, the torrent │ │ │ │ +will start connecting to peers again, as normal. │ │ │ │ +The torrent will be placed last in queue, i.e. its queue position │ │ │ │ +will be the highest of all torrents in the session.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    save_resume_data()

    │ │ │ │
    │ │ │ │ -virtual void async_release_files (storage_index_t storage
    │ │ │ │ -      , std::function<void()> handler = std::function<void()>()) = 0;
    │ │ │ │ +void save_resume_data (resume_data_flags_t flags = {}) const;
    │ │ │ │  
    │ │ │ │ -

    This is called on disk I/O objects to request they close all open │ │ │ │ -files for the specified storage/torrent. If file handles are not │ │ │ │ -pooled/cached, it can be a no-op. For truly asynchronous disk I/O, │ │ │ │ -this should provide at least one point in time when all files are │ │ │ │ -closed. It is possible that later asynchronous operations will │ │ │ │ -re-open some of the files, by the time this completion handler is │ │ │ │ -called, that's fine.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    async_check_files()

    │ │ │ │ +

    save_resume_data() asks libtorrent to generate fast-resume data for │ │ │ │ +this torrent. The fast resume data (stored in an add_torrent_params │ │ │ │ +object) can be used to resume a torrent in the next session without │ │ │ │ +having to check all files for which pieces have been downloaded. It │ │ │ │ +can also be used to save a .torrent file for a torrent_handle.

    │ │ │ │ +

    This operation is asynchronous, save_resume_data will return │ │ │ │ +immediately. The resume data is delivered when it's done through a │ │ │ │ +save_resume_data_alert.

    │ │ │ │ +

    The operation will fail, and post a save_resume_data_failed_alert │ │ │ │ +instead, in the following cases:

    │ │ │ │ +
    │ │ │ │ +
      │ │ │ │ +
    1. The torrent is in the process of being removed.
    2. │ │ │ │ +
    3. No torrent state has changed since the last saving of resume │ │ │ │ +data, and the only_if_modified flag is set. │ │ │ │ +metadata (see libtorrent's metadata from peers extension)
    4. │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    Note that some counters may be outdated by the time you receive the fast resume data

    │ │ │ │ +

    When saving resume data because of shutting down, make sure not to │ │ │ │ +remove_torrent() before you receive the save_resume_data_alert. │ │ │ │ +There's no need to pause the session or torrent when saving resume │ │ │ │ +data.

    │ │ │ │ +

    The paused state of a torrent is saved in the resume data, so pausing │ │ │ │ +all torrents before saving resume data will all torrents be restored │ │ │ │ +in a paused state.

    │ │ │ │ +
    │ │ │ │ +

    Note

    │ │ │ │ +

    It is typically a good idea to save resume data whenever a torrent │ │ │ │ +is completed or paused. If you save resume data for torrents when they are │ │ │ │ +paused, you can accelerate the shutdown process by not saving resume │ │ │ │ +data again for those torrents. Completed torrents should have their │ │ │ │ +resume data saved when they complete and on exit, since their │ │ │ │ +statistics might be updated.

    │ │ │ │ +
    │ │ │ │ +

    Example code to pause and save resume data for all torrents and wait │ │ │ │ +for the alerts:

    │ │ │ │ +
    │ │ │ │ +extern int outstanding_resume_data; // global counter of outstanding resume data
    │ │ │ │ +std::vector<torrent_handle> handles = ses.get_torrents();
    │ │ │ │ +for (torrent_handle const& h : handles) try
    │ │ │ │ +{
    │ │ │ │ +        h.save_resume_data(torrent_handle::only_if_modified);
    │ │ │ │ +        ++outstanding_resume_data;
    │ │ │ │ +}
    │ │ │ │ +catch (lt::system_error const& e)
    │ │ │ │ +{
    │ │ │ │ +        // the handle was invalid, ignore this one and move to the next
    │ │ │ │ +}
    │ │ │ │ +
    │ │ │ │ +while (outstanding_resume_data > 0)
    │ │ │ │ +{
    │ │ │ │ +        alert const* a = ses.wait_for_alert(seconds(30));
    │ │ │ │ +
    │ │ │ │ +        // if we don't get an alert within 30 seconds, abort
    │ │ │ │ +        if (a == nullptr) break;
    │ │ │ │ +
    │ │ │ │ +        std::vector<alert*> alerts;
    │ │ │ │ +        ses.pop_alerts(&alerts);
    │ │ │ │ +
    │ │ │ │ +        for (alert* i : alerts)
    │ │ │ │ +        {
    │ │ │ │ +                if (alert_cast<save_resume_data_failed_alert>(i))
    │ │ │ │ +                {
    │ │ │ │ +                        process_alert(i);
    │ │ │ │ +                        --outstanding_resume_data;
    │ │ │ │ +                        continue;
    │ │ │ │ +                }
    │ │ │ │ +
    │ │ │ │ +                save_resume_data_alert const* rd = alert_cast<save_resume_data_alert>(i);
    │ │ │ │ +                if (rd == nullptr)
    │ │ │ │ +                {
    │ │ │ │ +                        process_alert(i);
    │ │ │ │ +                        continue;
    │ │ │ │ +                }
    │ │ │ │ +
    │ │ │ │ +                std::ofstream out((rd->params.save_path
    │ │ │ │ +                        + "/" + rd->params.name + ".fastresume").c_str()
    │ │ │ │ +                        , std::ios_base::binary);
    │ │ │ │ +                std::vector<char> buf = write_resume_data_buf(rd->params);
    │ │ │ │ +                out.write(buf.data(), buf.size());
    │ │ │ │ +                --outstanding_resume_data;
    │ │ │ │ +        }
    │ │ │ │ +}
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    Note

    │ │ │ │ +

    Note how outstanding_resume_data is a global counter in this │ │ │ │ +example. This is deliberate, otherwise there is a race condition for │ │ │ │ +torrents that was just asked to save their resume data, they posted │ │ │ │ +the alert, but it has not been received yet. Those torrents would │ │ │ │ +report that they don't need to save resume data again, and skipped by │ │ │ │ +the initial loop, and thwart the counter otherwise.

    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    need_save_resume_data()

    │ │ │ │
    │ │ │ │ -virtual void async_check_files (storage_index_t storage
    │ │ │ │ -      , add_torrent_params const* resume_data
    │ │ │ │ -      , aux::vector<std::string, file_index_t> links
    │ │ │ │ -      , std::function<void(status_t, storage_error const&)> handler) = 0;
    │ │ │ │ +bool need_save_resume_data (resume_data_flags_t flags) const;
    │ │ │ │ +bool need_save_resume_data () const;
    │ │ │ │  
    │ │ │ │ -

    this is called when torrents are added to validate their resume data │ │ │ │ -against the files on disk. This function is expected to do a few things:

    │ │ │ │ -

    if links is non-empty, it contains a string for each file in the │ │ │ │ -torrent. The string being a path to an existing identical file. The │ │ │ │ -default behavior is to create hard links of those files into the │ │ │ │ -storage of the new torrent (specified by storage). An empty │ │ │ │ -string indicates that there is no known identical file. This is part │ │ │ │ -of the "mutable torrent" feature, where files can be reused from │ │ │ │ -other torrents.

    │ │ │ │ -

    The resume_data points the resume data passed in by the client.

    │ │ │ │ -

    If the resume_data->flags field has the seed_mode flag set, all │ │ │ │ -files/pieces are expected to be on disk already. This should be │ │ │ │ -verified. Not just the existence of the file, but also that it has │ │ │ │ -the correct size.

    │ │ │ │ -

    Any file with a piece set in the resume_data->have_pieces bitmask │ │ │ │ -should exist on disk, this should be verified. Pad files and files │ │ │ │ -with zero priority may be skipped.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    async_stop_torrent()

    │ │ │ │ +

    This function returns true if anything that is stored in the resume │ │ │ │ +data has changed since the last time resume data was saved. │ │ │ │ +The overload that takes flags let you ask if specific categories │ │ │ │ +of properties have changed. These flags have the same behavior as in │ │ │ │ +the save_resume_data() call.

    │ │ │ │ +

    This is a blocking call. It will wait for a response from │ │ │ │ +libtorrent's main thread. A way to avoid blocking is to instead │ │ │ │ +call save_resume_data() directly, specifying the conditions under │ │ │ │ +which resume data should be saved.

    │ │ │ │ +
    │ │ │ │ +

    Note

    │ │ │ │ +

    A torrent's resume data is considered saved as soon as the │ │ │ │ +save_resume_data_alert is posted. It is important to make sure this │ │ │ │ +alert is received and handled in order for this function to be │ │ │ │ +meaningful.

    │ │ │ │ +
    │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    queue_position() queue_position_bottom() queue_position_down() queue_position_up() queue_position_top()

    │ │ │ │
    │ │ │ │ -virtual void async_stop_torrent (storage_index_t storage
    │ │ │ │ -      , std::function<void()> handler = std::function<void()>()) = 0;
    │ │ │ │ +void queue_position_bottom () const;
    │ │ │ │ +void queue_position_down () const;
    │ │ │ │ +void queue_position_top () const;
    │ │ │ │ +void queue_position_up () const;
    │ │ │ │ +queue_position_t queue_position () const;
    │ │ │ │  
    │ │ │ │ -

    This is called when a torrent is stopped. It gives the disk I/O │ │ │ │ -object an opportunity to flush any data to disk that's currently kept │ │ │ │ -cached. This function should at least do the same thing as │ │ │ │ -async_release_files().

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    async_rename_file()

    │ │ │ │ +

    Every torrent that is added is assigned a queue position exactly one │ │ │ │ +greater than the greatest queue position of all existing torrents. │ │ │ │ +Torrents that are being seeded have -1 as their queue position, since │ │ │ │ +they're no longer in line to be downloaded.

    │ │ │ │ +

    When a torrent is removed or turns into a seed, all torrents with │ │ │ │ +greater queue positions have their positions decreased to fill in the │ │ │ │ +space in the sequence.

    │ │ │ │ +

    queue_position() returns the torrent's position in the download │ │ │ │ +queue. The torrents with the smallest numbers are the ones that are │ │ │ │ +being downloaded. The smaller number, the closer the torrent is to the │ │ │ │ +front of the line to be started.

    │ │ │ │ +

    The queue position is also available in the torrent_status.

    │ │ │ │ +

    The queue_position_*() functions adjust the torrents position in │ │ │ │ +the queue. Up means closer to the front and down means closer to the │ │ │ │ +back of the queue. Top and bottom refers to the front and the back of │ │ │ │ +the queue respectively.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    queue_position_set()

    │ │ │ │
    │ │ │ │ -virtual void async_rename_file (storage_index_t storage
    │ │ │ │ -      , file_index_t index, std::string name
    │ │ │ │ -      , std::function<void(std::string const&, file_index_t, storage_error const&)> handler) = 0;
    │ │ │ │ +void queue_position_set (queue_position_t p) const;
    │ │ │ │  
    │ │ │ │ -

    This function is called when the name of a file in the specified │ │ │ │ -storage has been requested to be renamed. The disk I/O object is │ │ │ │ -responsible for renaming the file without racing with other │ │ │ │ -potentially outstanding operations against the file (such as read, │ │ │ │ -write, move, etc.).

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    async_delete_files()

    │ │ │ │ +

    updates the position in the queue for this torrent. The relative order │ │ │ │ +of all other torrents remain intact but their numerical queue position │ │ │ │ +shifts to make space for this torrent's new position

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_ssl_certificate() set_ssl_certificate_buffer()

    │ │ │ │
    │ │ │ │ -virtual void async_delete_files (storage_index_t storage, remove_flags_t options
    │ │ │ │ -      , std::function<void(storage_error const&)> handler) = 0;
    │ │ │ │ +void set_ssl_certificate_buffer (std::string const& certificate
    │ │ │ │ +      , std::string const& private_key
    │ │ │ │ +      , std::string const& dh_params);
    │ │ │ │ +void set_ssl_certificate (std::string const& certificate
    │ │ │ │ +      , std::string const& private_key
    │ │ │ │ +      , std::string const& dh_params
    │ │ │ │ +      , std::string const& passphrase = "");
    │ │ │ │  
    │ │ │ │ -

    This function is called when some file(s) on disk have been requested │ │ │ │ -to be removed by the client. storage indicates which torrent is │ │ │ │ -referred to. See session_handle for remove_flags_t flags │ │ │ │ -indicating which files are to be removed. │ │ │ │ -e.g. session_handle::delete_files - delete all files │ │ │ │ -session_handle::delete_partfile - only delete part file.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    async_set_file_priority()

    │ │ │ │ +

    For SSL torrents, use this to specify a path to a .pem file to use as │ │ │ │ +this client's certificate. The certificate must be signed by the │ │ │ │ +certificate in the .torrent file to be valid.

    │ │ │ │ +

    The set_ssl_certificate_buffer() overload takes the actual certificate, │ │ │ │ +private key and DH params as strings, rather than paths to files.

    │ │ │ │ +

    cert is a path to the (signed) certificate in .pem format │ │ │ │ +corresponding to this torrent.

    │ │ │ │ +

    private_key is a path to the private key for the specified │ │ │ │ +certificate. This must be in .pem format.

    │ │ │ │ +

    dh_params is a path to the Diffie-Hellman parameter file, which │ │ │ │ +needs to be in .pem format. You can generate this file using the │ │ │ │ +openssl command like this: openssl dhparam -outform PEM -out │ │ │ │ +dhparams.pem 512.

    │ │ │ │ +

    passphrase may be specified if the private key is encrypted and │ │ │ │ +requires a passphrase to be decrypted.

    │ │ │ │ +

    Note that when a torrent first starts up, and it needs a certificate, │ │ │ │ +it will suspend connecting to any peers until it has one. It's │ │ │ │ +typically desirable to resume the torrent after setting the SSL │ │ │ │ +certificate.

    │ │ │ │ +

    If you receive a torrent_need_cert_alert, you need to call this to │ │ │ │ +provide a valid cert. If you don't have a cert you won't be allowed to │ │ │ │ +connect to any peers.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    torrent_file() torrent_file_with_hashes()

    │ │ │ │
    │ │ │ │ -virtual void async_set_file_priority (storage_index_t storage
    │ │ │ │ -      , aux::vector<download_priority_t, file_index_t> prio
    │ │ │ │ -      , std::function<void(storage_error const&
    │ │ │ │ -      , aux::vector<download_priority_t, file_index_t>)> handler) = 0;
    │ │ │ │ +std::shared_ptr<torrent_info> torrent_file_with_hashes () const;
    │ │ │ │ +std::shared_ptr<const torrent_info> torrent_file () const;
    │ │ │ │  
    │ │ │ │ -

    This is called to set the priority of some or all files. Changing the │ │ │ │ -priority from or to 0 may involve moving data to and from the │ │ │ │ -partfile. The disk I/O object is responsible for correctly │ │ │ │ -synchronizing this work to not race with any potentially outstanding │ │ │ │ -asynchronous operations affecting these files.

    │ │ │ │ -

    prio is a vector of the file priority for all files. If it's │ │ │ │ -shorter than the total number of files in the torrent, they are │ │ │ │ -assumed to be set to the default priority.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    async_clear_piece()

    │ │ │ │ +

    torrent_file() returns a pointer to the torrent_info object │ │ │ │ +associated with this torrent. The torrent_info object may be a copy │ │ │ │ +of the internal object. If the torrent doesn't have metadata, the │ │ │ │ +pointer will not be initialized (i.e. a nullptr). The torrent may be │ │ │ │ +in a state without metadata only if it was started without a .torrent │ │ │ │ +file, e.g. by being added by magnet link.

    │ │ │ │ +

    Note that the torrent_info object returned here may be a different │ │ │ │ +instance than the one added to the session, with different attributes │ │ │ │ +like piece layers, dht nodes and trackers. A torrent_info object does │ │ │ │ +not round-trip cleanly when added to a session.

    │ │ │ │ +

    If you want to save a .torrent file from the torrent_handle, instead │ │ │ │ +call save_resume_data() and write_torrent_file() the │ │ │ │ +add_torrent_params object passed back in the alert.

    │ │ │ │ +

    torrent_file_with_hashes() returns a copy of the internal │ │ │ │ +torrent_info and piece layer hashes (if it's a v2 torrent). The piece │ │ │ │ +layers will only be included if they are available. If this torrent │ │ │ │ +was added from a .torrent file with piece layers or if it's seeding, │ │ │ │ +the piece layers are available. This function is more expensive than │ │ │ │ +torrent_file() since it needs to make copies of this information.

    │ │ │ │ +

    The torrent_file_with_hashes() is here for backwards compatibility │ │ │ │ +when constructing a create_torrent object from a torrent_info that's │ │ │ │ +in a session. Prefer save_resume_data() + write_torrent_file().

    │ │ │ │ +

    Note that a torrent added from a magnet link may not have the full │ │ │ │ +merkle trees for all files, and hence not have the complete piece │ │ │ │ +layers. In that state, you cannot create a .torrent file even from │ │ │ │ +the torrent_info returned from torrent_file_with_hashes(). Once the │ │ │ │ +torrent completes downloading all files, becoming a seed, you can │ │ │ │ +make a .torrent file from it.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    piece_layers()

    │ │ │ │
    │ │ │ │ -virtual void async_clear_piece (storage_index_t storage, piece_index_t index
    │ │ │ │ -      , std::function<void(piece_index_t)> handler) = 0;
    │ │ │ │ +std::vector<std::vector<sha256_hash>> piece_layers () const;
    │ │ │ │  
    │ │ │ │ -

    This is called when a piece fails the hash check, to ensure there are │ │ │ │ -no outstanding disk operations to the piece before blocks are │ │ │ │ -re-requested from peers to overwrite the existing blocks. The disk I/O │ │ │ │ -object does not need to perform any action other than synchronize │ │ │ │ -with all outstanding disk operations to the specified piece before │ │ │ │ -posting the result back.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    update_stats_counters()

    │ │ │ │ +

    returns the piece layers for all files in the torrent. If this is a │ │ │ │ +v1 torrent (and doesn't have any piece layers) it returns an empty │ │ │ │ +vector. This is a blocking call that will synchronize with the │ │ │ │ +libtorrent network thread.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    post_piece_availability() piece_availability()

    │ │ │ │
    │ │ │ │ -virtual void update_stats_counters (counters& c) const = 0;
    │ │ │ │ +void piece_availability (std::vector<int>& avail) const;
    │ │ │ │ +void post_piece_availability () const;
    │ │ │ │  
    │ │ │ │ -

    update_stats_counters() is called to give the disk storage an │ │ │ │ -opportunity to update gauges in the c stats counters, that aren't │ │ │ │ -updated continuously as operations are performed. This is called │ │ │ │ -before a snapshot of the counters are passed to the client.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    get_status()

    │ │ │ │ +

    The piece availability is the number of peers that we are connected │ │ │ │ +that has advertised having a particular piece. This is the information │ │ │ │ +that libtorrent uses in order to prefer picking rare pieces.

    │ │ │ │ +

    post_piece_availability() will trigger a piece_availability_alert │ │ │ │ +to be posted.

    │ │ │ │ +

    piece_availability() fills the specified std::vector<int> │ │ │ │ +with the availability for each piece in this torrent. libtorrent does │ │ │ │ +not keep track of availability for seeds, so if the torrent is │ │ │ │ +seeding the availability for all pieces is reported as 0.

    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    get_piece_priorities() piece_priority() prioritize_pieces()

    │ │ │ │
    │ │ │ │ -virtual std::vector<open_file_state> get_status (storage_index_t) const = 0;
    │ │ │ │ +void prioritize_pieces (std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces) const;
    │ │ │ │ +download_priority_t piece_priority (piece_index_t index) const;
    │ │ │ │ +void piece_priority (piece_index_t index, download_priority_t priority) const;
    │ │ │ │ +std::vector<download_priority_t> get_piece_priorities () const;
    │ │ │ │ +void prioritize_pieces (std::vector<download_priority_t> const& pieces) const;
    │ │ │ │  
    │ │ │ │ -

    Return a list of all the files that are currently open for the │ │ │ │ -specified storage/torrent. This is is just used for the client to │ │ │ │ -query the currently open files, and which modes those files are open │ │ │ │ -in.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    abort()

    │ │ │ │ +

    These functions are used to set and get the priority of individual │ │ │ │ +pieces. By default all pieces have priority 4. 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 │ │ │ │ +priority levels. 0 means not to download the piece at all. Otherwise, │ │ │ │ +lower priority values means less likely to be picked. Piece priority │ │ │ │ +takes precedence over piece availability. Every piece with priority 7 │ │ │ │ +will be attempted to be picked before a priority 6 piece and so on.

    │ │ │ │ +

    The default priority of pieces is 4.

    │ │ │ │ +

    Piece priorities can not be changed for torrents that have not │ │ │ │ +downloaded the metadata yet. Magnet links won't have metadata │ │ │ │ +immediately. see the metadata_received_alert.

    │ │ │ │ +

    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. │ │ │ │ +The second overload of prioritize_pieces that takes a vector of pairs │ │ │ │ +will update the priorities of only select pieces, and leave all other │ │ │ │ +unaffected. Each pair is (piece, priority). That is, the first item is │ │ │ │ +the piece index and the second item is the priority of that piece. │ │ │ │ +Invalid entries, where the piece index or priority is out of range, are │ │ │ │ +not allowed.

    │ │ │ │ +

    get_piece_priorities returns a vector with one element for each piece │ │ │ │ +in the torrent. Each element is the current priority of that piece.

    │ │ │ │ +

    It's possible to cancel the effect of file priorities by setting the │ │ │ │ +priorities for the affected pieces. Care has to be taken when mixing │ │ │ │ +usage of file- and piece priorities.

    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    prioritize_files() get_file_priorities() file_priority()

    │ │ │ │
    │ │ │ │ -virtual void abort (bool wait) = 0;
    │ │ │ │ +void prioritize_files (std::vector<download_priority_t> const& files) const;
    │ │ │ │ +void file_priority (file_index_t index, download_priority_t priority) const;
    │ │ │ │ +download_priority_t file_priority (file_index_t index) const;
    │ │ │ │ +std::vector<download_priority_t> get_file_priorities () const;
    │ │ │ │  
    │ │ │ │ -

    this is called when the session is starting to shut down. The disk │ │ │ │ -I/O object is expected to flush any outstanding write jobs, cancel │ │ │ │ -hash jobs and initiate tearing down of any internal threads. If │ │ │ │ -wait is true, this should be asynchronous. i.e. this call should │ │ │ │ -not return until all threads have stopped and all jobs have either │ │ │ │ -been aborted or completed and the disk I/O object is ready to be │ │ │ │ -destructed.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    submit_jobs()

    │ │ │ │ +

    index must be in the range [0, number_of_files).

    │ │ │ │ +

    file_priority() queries or sets the priority of file index.

    │ │ │ │ +

    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.

    │ │ │ │ +

    get_file_priorities() returns a vector with the priorities of all │ │ │ │ +files.

    │ │ │ │ +

    The priority values are the same as for piece_priority(). See │ │ │ │ +download_priority_t.

    │ │ │ │ +

    Whenever a file priority is changed, all other piece priorities are │ │ │ │ +reset to match the file priorities. In order to maintain special │ │ │ │ +priorities for particular pieces, piece_priority() has to be called │ │ │ │ +again for those pieces.

    │ │ │ │ +

    You cannot set the file priorities on a torrent that does not yet have │ │ │ │ +metadata or a torrent that is a seed. file_priority(int, int) and │ │ │ │ +prioritize_files() are both no-ops for such torrents.

    │ │ │ │ +

    Since changing file priorities may involve disk operations (of moving │ │ │ │ +files in- and out of the part file), the internal accounting of file │ │ │ │ +priorities happen asynchronously. i.e. setting file priorities and then │ │ │ │ +immediately querying them may not yield the same priorities just set. │ │ │ │ +To synchronize with the priorities taking effect, wait for the │ │ │ │ +file_prio_alert.

    │ │ │ │ +

    When combining file- and piece priorities, the resume file will record │ │ │ │ +both. When loading the resume data, the file priorities will be applied │ │ │ │ +first, then the piece priorities.

    │ │ │ │ +

    Moving data from a file into the part file is currently not │ │ │ │ +supported. If a file has its priority set to 0 after it has already │ │ │ │ +been created, it will not be moved into the partfile.

    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    force_lsd_announce() force_dht_announce() force_reannounce()

    │ │ │ │
    │ │ │ │ -virtual void submit_jobs () = 0;
    │ │ │ │ +void force_reannounce (int seconds = 0, int idx = -1, reannounce_flags_t = {}) const;
    │ │ │ │ +void force_lsd_announce () const;
    │ │ │ │ +void force_dht_announce () const;
    │ │ │ │  
    │ │ │ │ -

    This will be called after a batch of disk jobs has been issues (via │ │ │ │ -the async_* ). It gives the disk I/O object an opportunity to │ │ │ │ -notify any potential condition variables to wake up the disk │ │ │ │ -thread(s). The async_* calls can of course also notify condition │ │ │ │ -variables, but doing it in this call allows for batching jobs, by │ │ │ │ -issuing the notification once for a collection of jobs.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    settings_updated()

    │ │ │ │ +

    force_reannounce() will force this torrent to do another tracker │ │ │ │ +request, to receive new peers. The seconds argument specifies how │ │ │ │ +many seconds from now to issue the tracker announces.

    │ │ │ │ +

    If the tracker's min_interval has not passed since the last │ │ │ │ +announce, the forced announce will be scheduled to happen immediately │ │ │ │ +as the min_interval expires. This is to honor trackers minimum │ │ │ │ +re-announce interval settings.

    │ │ │ │ +

    The tracker_index argument specifies which tracker to re-announce. │ │ │ │ +If set to -1 (which is the default), all trackers are re-announce.

    │ │ │ │ +

    The flags argument can be used to affect the re-announce. See │ │ │ │ +ignore_min_interval.

    │ │ │ │ +

    force_dht_announce will announce the torrent to the DHT │ │ │ │ +immediately.

    │ │ │ │ +

    force_lsd_announce will announce the torrent on LSD │ │ │ │ +immediately.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    scrape_tracker()

    │ │ │ │
    │ │ │ │ -virtual void settings_updated () = 0;
    │ │ │ │ +void scrape_tracker (int idx = -1) const;
    │ │ │ │  
    │ │ │ │ -

    This is called to notify the disk I/O object that the settings have │ │ │ │ -been updated. In the disk io constructor, a settings_interface │ │ │ │ -reference is passed in. Whenever these settings are updated, this │ │ │ │ -function is called to allow the disk I/O object to react to any │ │ │ │ -changed settings relevant to its operations.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    force_copy
    │ │ │ │ -
    force making a copy of the cached block, rather than getting a │ │ │ │ -reference to a block already in the cache. This is used the block is │ │ │ │ -expected to be overwritten very soon, by async_write()`, and we need │ │ │ │ -access to the previous content.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    sequential_access
    │ │ │ │ -
    hint that there may be more disk operations with sequential access to │ │ │ │ -the file
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    volatile_read
    │ │ │ │ -
    don't keep the read block in cache. This is a hint that this block is │ │ │ │ -unlikely to be read again anytime soon, and caching it would be │ │ │ │ -wasteful.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    v1_hash
    │ │ │ │ -
    compute a v1 piece hash. This is only used by the async_hash() call. │ │ │ │ -If this flag is not set in the async_hash() call, the SHA-1 piece │ │ │ │ -hash does not need to be computed.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    flush_piece
    │ │ │ │ -
    this flag instructs a hash job that we just completed this piece, and │ │ │ │ -it should be flushed to disk
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    storage_holder

    │ │ │ │ -

    Declared in "libtorrent/disk_interface.hpp"

    │ │ │ │ -

    a unique, owning, reference to the storage of a torrent in a disk io │ │ │ │ -subsystem (class that implements disk_interface). This is held by the │ │ │ │ -internal libtorrent torrent object to tie the storage object allocated │ │ │ │ -for a torrent to the lifetime of the internal torrent object. When a │ │ │ │ -torrent is removed from the session, this holder is destructed and will │ │ │ │ -inform the disk object.

    │ │ │ │ +

    scrape_tracker() will send a scrape request to a tracker. By │ │ │ │ +default (idx = -1) it will scrape the last working tracker. If │ │ │ │ +idx is >= 0, the tracker with the specified index will scraped.

    │ │ │ │ +

    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.

    │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    set_upload_limit() upload_limit() set_download_limit() download_limit()

    │ │ │ │
    │ │ │ │ -struct storage_holder
    │ │ │ │ -{
    │ │ │ │ -   storage_holder () = default;
    │ │ │ │ -   storage_holder (storage_index_t idx, disk_interface& disk_io);
    │ │ │ │ -   ~storage_holder ();
    │ │ │ │ -   explicit operator bool () const;
    │ │ │ │ -   operator storage_index_t () const;
    │ │ │ │ -   void reset ();
    │ │ │ │ -   storage_holder& operator= (storage_holder const&) = delete;
    │ │ │ │ -   storage_holder (storage_holder const&) = delete;
    │ │ │ │ -   storage_holder (storage_holder&& rhs) noexcept;
    │ │ │ │ -   storage_holder& operator= (storage_holder&& rhs) noexcept;
    │ │ │ │ -};
    │ │ │ │ +void set_upload_limit (int limit) const;
    │ │ │ │ +void set_download_limit (int limit) const;
    │ │ │ │ +int download_limit () const;
    │ │ │ │ +int upload_limit () const;
    │ │ │ │  
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    settings_interface

    │ │ │ │ -

    Declared in "libtorrent/settings_pack.hpp"

    │ │ │ │ -

    the common interface to settings_pack and the internal representation of │ │ │ │ -settings.

    │ │ │ │ +

    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 │ │ │ │ +(settings_pack::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.

    │ │ │ │ +

    Local peers are not rate limited by default. see peer classes.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    connect_peer()

    │ │ │ │
    │ │ │ │ -struct settings_interface
    │ │ │ │ -{
    │ │ │ │ -   virtual void set_int (int name, int val) = 0;
    │ │ │ │ -   virtual void set_str (int name, std::string val) = 0;
    │ │ │ │ -   virtual void set_bool (int name, bool val) = 0;
    │ │ │ │ -   virtual bool has_val (int name) const = 0;
    │ │ │ │ -   virtual int get_int (int name) const = 0;
    │ │ │ │ -   virtual bool get_bool (int name) const = 0;
    │ │ │ │ -   virtual std::string const& get_str (int name) const = 0;
    │ │ │ │ -};
    │ │ │ │ +void connect_peer (tcp::endpoint const& adr, peer_source_flags_t source = {}
    │ │ │ │ +      , pex_flags_t flags = pex_encryption | pex_utp | pex_holepunch) const;
    │ │ │ │  
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    buffer_allocator_interface

    │ │ │ │ -

    Declared in "libtorrent/disk_buffer_holder.hpp"

    │ │ │ │ -

    the interface for freeing disk buffers, used by the disk_buffer_holder. │ │ │ │ -when implementing disk_interface, this must also be implemented in order │ │ │ │ -to return disk buffers back to libtorrent

    │ │ │ │ +

    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 system_error. The second (optional) │ │ │ │ +argument will be bitwise 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.

    │ │ │ │ +

    For possible values of flags, see pex_flags_t.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    clear_peers()

    │ │ │ │
    │ │ │ │ -struct buffer_allocator_interface
    │ │ │ │ -{
    │ │ │ │ -   virtual void free_disk_buffer (char* b) = 0;
    │ │ │ │ -};
    │ │ │ │ +void clear_peers ();
    │ │ │ │  
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    disk_buffer_holder

    │ │ │ │ -

    Declared in "libtorrent/disk_buffer_holder.hpp"

    │ │ │ │ -

    The disk buffer holder acts like a unique_ptr that frees a disk buffer │ │ │ │ -when it's destructed

    │ │ │ │ -

    If this buffer holder is moved-from, default constructed or reset, │ │ │ │ -data() will return nullptr.

    │ │ │ │ +

    This will disconnect all peers and clear the peer list for this │ │ │ │ +torrent. New peers will have to be acquired before resuming, from │ │ │ │ +trackers, DHT or local service discovery, for example.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    max_uploads() set_max_uploads()

    │ │ │ │
    │ │ │ │ -struct disk_buffer_holder
    │ │ │ │ -{
    │ │ │ │ -   disk_buffer_holder (disk_buffer_holder&&) noexcept;
    │ │ │ │ -   disk_buffer_holder& operator= (disk_buffer_holder&&) & noexcept;
    │ │ │ │ -   disk_buffer_holder (disk_buffer_holder const&) = delete;
    │ │ │ │ -   disk_buffer_holder& operator= (disk_buffer_holder const&) = delete;
    │ │ │ │ -   disk_buffer_holder (buffer_allocator_interface& alloc
    │ │ │ │ -      , char* buf, int sz) noexcept;
    │ │ │ │ -   disk_buffer_holder () noexcept = default;
    │ │ │ │ -   ~disk_buffer_holder ();
    │ │ │ │ -   char* data () const noexcept;
    │ │ │ │ -   void reset ();
    │ │ │ │ -   void swap (disk_buffer_holder& h) noexcept;
    │ │ │ │ -   bool is_mutable () const noexcept;
    │ │ │ │ -   explicit operator bool () const noexcept;
    │ │ │ │ -   std::ptrdiff_t size () const;
    │ │ │ │ -};
    │ │ │ │ +void set_max_uploads (int max_uploads) const;
    │ │ │ │ +int max_uploads () const;
    │ │ │ │  
    │ │ │ │ -[report issue]
    │ │ │ │ -

    disk_buffer_holder()

    │ │ │ │ +

    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. This defaults to infinite. The primary setting controlling │ │ │ │ +this is the global unchoke slots limit, set by unchoke_slots_limit in │ │ │ │ +settings_pack.

    │ │ │ │ +

    max_uploads() returns the current settings.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    max_connections() set_max_connections()

    │ │ │ │
    │ │ │ │ -disk_buffer_holder (buffer_allocator_interface& alloc
    │ │ │ │ -      , char* buf, int sz) noexcept;
    │ │ │ │ +void set_max_connections (int max_connections) const;
    │ │ │ │ +int max_connections () const;
    │ │ │ │  
    │ │ │ │ -

    construct a buffer holder that will free the held buffer │ │ │ │ -using a disk buffer pool directly (there's only one │ │ │ │ -disk_buffer_pool per session)

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    disk_buffer_holder()

    │ │ │ │ +

    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. There is also a │ │ │ │ +global limit of the number of connections, set by │ │ │ │ +connections_limit in settings_pack.

    │ │ │ │ +

    max_connections() returns the current settings.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    move_storage()

    │ │ │ │
    │ │ │ │ -disk_buffer_holder () noexcept = default;
    │ │ │ │ +void move_storage (std::string const& save_path
    │ │ │ │ +      , move_flags_t flags = move_flags_t::always_replace_files
    │ │ │ │ +      ) const;
    │ │ │ │  
    │ │ │ │ -

    default construct a holder that does not own any buffer

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    ~disk_buffer_holder()

    │ │ │ │ +

    Moves the file(s) that this torrent are currently seeding from or │ │ │ │ +downloading to. If the given save_path is not located on the same │ │ │ │ +drive as the original save path, the files will be copied to the new │ │ │ │ +drive and removed from their original location. This will block all │ │ │ │ +other disk IO, and other torrents download and upload rates may drop │ │ │ │ +while copying the file.

    │ │ │ │ +

    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. If the move fails for some reason, │ │ │ │ +storage_moved_failed_alert is generated instead, containing the │ │ │ │ +error message.

    │ │ │ │ +

    The flags argument determines the behavior of the copying/moving │ │ │ │ +of the files in the torrent. see move_flags_t.

    │ │ │ │ +

    always_replace_files is the default and replaces any file that │ │ │ │ +exist in both the source directory and the target directory.

    │ │ │ │ +

    fail_if_exist first check to see that none of the copy operations │ │ │ │ +would cause an overwrite. If it would, it will fail. Otherwise it will │ │ │ │ +proceed as if it was in always_replace_files mode. Note that there │ │ │ │ +is an inherent race condition here. If the files in the target │ │ │ │ +directory appear after the check but before the copy or move │ │ │ │ +completes, they will be overwritten. When failing because of files │ │ │ │ +already existing in the target path, the error of │ │ │ │ +move_storage_failed_alert is set to │ │ │ │ +boost::system::errc::file_exists.

    │ │ │ │ +

    The intention is that a client may use this as a probe, and if it │ │ │ │ +fails, ask the user which mode to use. The client may then re-issue │ │ │ │ +the move_storage call with one of the other modes.

    │ │ │ │ +

    dont_replace always keeps the existing file in the target │ │ │ │ +directory, if there is one. The source files will still be removed in │ │ │ │ +that case. Note that it won't automatically re-check files. If an │ │ │ │ +incomplete torrent is moved into a directory with the complete files, │ │ │ │ +pause, move, force-recheck and resume. Without the re-checking, the │ │ │ │ +torrent will keep downloading and files in the new download directory │ │ │ │ +will be overwritten.

    │ │ │ │ +

    Files that have been renamed to have absolute paths are not moved by │ │ │ │ +this function. Keep in mind that files that don't belong to the │ │ │ │ +torrent but are stored in the torrent's directory may be moved as │ │ │ │ +well. This goes for files that have been renamed to absolute paths │ │ │ │ +that still end up inside the save path.

    │ │ │ │ +

    When copying files, sparse regions are not likely to be preserved. │ │ │ │ +This makes it proportionally more expensive to move a large torrent │ │ │ │ +when only few pieces have been downloaded, since the files are then │ │ │ │ +allocated with zeros in the destination directory.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    rename_file()

    │ │ │ │
    │ │ │ │ -~disk_buffer_holder ();
    │ │ │ │ +void rename_file (file_index_t index, std::string const& new_name) const;
    │ │ │ │  
    │ │ │ │ -

    frees disk buffer held by this object

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    data()

    │ │ │ │ +

    Renames the file with the given index asynchronously. The rename │ │ │ │ +operation is complete when either a file_renamed_alert or │ │ │ │ +file_rename_failed_alert is posted.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    info_hashes() info_hash()

    │ │ │ │
    │ │ │ │ -char* data () const noexcept;
    │ │ │ │ +sha1_hash info_hash () const;
    │ │ │ │ +info_hash_t info_hashes () const;
    │ │ │ │  
    │ │ │ │ -

    return a pointer to the held buffer, if any. Otherwise returns nullptr.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    reset()

    │ │ │ │ +

    returns the info-hash(es) of the torrent. If this handle is to a │ │ │ │ +torrent that hasn't loaded yet (for instance by being added) by a │ │ │ │ +URL, the returned value is undefined. │ │ │ │ +The info_hash() returns the SHA-1 info-hash for v1 torrents and a │ │ │ │ +truncated hash for v2 torrents. For the full v2 info-hash, use │ │ │ │ +info_hashes() instead.

    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    operator<() operator==() operator!=()

    │ │ │ │
    │ │ │ │ -void reset ();
    │ │ │ │ +bool operator== (const torrent_handle& h) const;
    │ │ │ │ +bool operator!= (const torrent_handle& h) const;
    │ │ │ │ +bool operator< (const torrent_handle& h) const;
    │ │ │ │  
    │ │ │ │ -

    free the held disk buffer, if any, and clear the holder. This sets the │ │ │ │ -holder object to a default-constructed state

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    swap()

    │ │ │ │ +

    comparison operators. The order of the torrents is unspecified │ │ │ │ +but stable.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    id()

    │ │ │ │
    │ │ │ │ -void swap (disk_buffer_holder& h) noexcept;
    │ │ │ │ +std::uint32_t id () const;
    │ │ │ │  
    │ │ │ │ -

    swap pointers of two disk buffer holders.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    is_mutable()

    │ │ │ │ +

    returns a unique identifier for this torrent. It's not a dense index. │ │ │ │ +It's not preserved across sessions.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    native_handle()

    │ │ │ │
    │ │ │ │ -bool is_mutable () const noexcept;
    │ │ │ │ +std::shared_ptr<torrent> native_handle () const;
    │ │ │ │  
    │ │ │ │ -

    if this returns true, the buffer may not be modified in place

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    bool()

    │ │ │ │ +

    This function is intended only for use by plugins and the alert │ │ │ │ +dispatch function. This type does not have a stable ABI and should │ │ │ │ +be relied on as little as possible. Accessing the handle returned by │ │ │ │ +this function is not thread safe outside of libtorrent's internal │ │ │ │ +thread (which is used to invoke plugin callbacks). │ │ │ │ +The torrent class is not only eligible for changing ABI across │ │ │ │ +minor versions of libtorrent, its layout is also dependent on build │ │ │ │ +configuration. This adds additional requirements on a client to be │ │ │ │ +built with the exact same build configuration as libtorrent itself. │ │ │ │ +i.e. the TORRENT_ macros must match between libtorrent and the │ │ │ │ +client builds.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    userdata()

    │ │ │ │
    │ │ │ │ -explicit operator bool () const noexcept;
    │ │ │ │ +client_data_t userdata () const;
    │ │ │ │  
    │ │ │ │ -

    implicitly convertible to true if the object is currently holding a │ │ │ │ -buffer

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    file_open_mode_t

    │ │ │ │ -

    Declared in "libtorrent/disk_interface.hpp"

    │ │ │ │ -
    │ │ │ │ -
    read_only
    │ │ │ │ -
    open the file for reading only
    │ │ │ │ +

    returns the userdata pointer as set in add_torrent_params

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    in_session()

    │ │ │ │ +
    │ │ │ │ +bool in_session () const;
    │ │ │ │ +
    │ │ │ │ +

    Returns true if the torrent is in the session. It returns true before │ │ │ │ +session::remove_torrent() is called, and false afterward.

    │ │ │ │ +

    Note that this is a blocking function, unlike torrent_handle::is_valid() │ │ │ │ +which returns immediately.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    overwrite_existing
    │ │ │ │ +
    instruct libtorrent to overwrite any data that may already have been │ │ │ │ +downloaded with the data of the new piece being added. Using this │ │ │ │ +flag when adding a piece that is actively being downloaded from other │ │ │ │ +peers may have some unexpected consequences, as blocks currently │ │ │ │ +being downloaded from peers may not be replaced.
    │ │ │ │
    │ │ │ │ -
    │ │ │ │ -
    write_only
    │ │ │ │ -
    open the file for writing only
    │ │ │ │ +[report issue]
    │ │ │ │ +
    query_distributed_copies
    │ │ │ │ +
    calculates distributed_copies, distributed_full_copies and │ │ │ │ +distributed_fraction.
    │ │ │ │
    │ │ │ │ -
    │ │ │ │ -
    read_write
    │ │ │ │ -
    open the file for reading and writing
    │ │ │ │ +[report issue]
    │ │ │ │ +
    query_accurate_download_counters
    │ │ │ │ +
    includes partial downloaded blocks in total_done and │ │ │ │ +total_wanted_done.
    │ │ │ │
    │ │ │ │ -
    │ │ │ │ -
    rw_mask
    │ │ │ │ -
    the mask for the bits determining read or write mode
    │ │ │ │ +[report issue]
    │ │ │ │ +
    query_last_seen_complete
    │ │ │ │ +
    includes last_seen_complete.
    │ │ │ │
    │ │ │ │ -
    │ │ │ │ -
    sparse
    │ │ │ │ -
    open the file in sparse mode (if supported by the │ │ │ │ -filesystem).
    │ │ │ │ +[report issue]
    │ │ │ │ +
    query_pieces
    │ │ │ │ +
    populate the pieces field in torrent_status.
    │ │ │ │
    │ │ │ │ -
    │ │ │ │ -
    no_atime
    │ │ │ │ -
    don't update the access timestamps on the file (if │ │ │ │ -supported by the operating system and filesystem). │ │ │ │ -this generally improves disk performance.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    query_verified_pieces
    │ │ │ │ +
    includes verified_pieces (only applies to torrents in seed │ │ │ │ +mode).
    │ │ │ │
    │ │ │ │ -
    │ │ │ │ -
    random_access
    │ │ │ │ -
    When this is not set, the kernel is hinted that access to this file will │ │ │ │ -be made sequentially.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    query_torrent_file
    │ │ │ │ +
    includes torrent_file, which is all the static information from │ │ │ │ +the .torrent file.
    │ │ │ │
    │ │ │ │ -
    │ │ │ │ -
    mmapped
    │ │ │ │ -
    the file is memory mapped
    │ │ │ │ +[report issue]
    │ │ │ │ +
    query_name
    │ │ │ │ +
    includes name, the name of the torrent. This is either derived │ │ │ │ +from the .torrent file, or from the &dn= magnet link argument │ │ │ │ +or possibly some other source. If the name of the torrent is not │ │ │ │ +known, this is an empty string.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    query_save_path
    │ │ │ │ +
    includes save_path, the path to the directory the files of the │ │ │ │ +torrent are saved to.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    alert_when_available
    │ │ │ │ +
    used to ask libtorrent to send an alert once the piece has been │ │ │ │ +downloaded, by passing alert_when_available. When set, the │ │ │ │ +read_piece_alert alert will be delivered, with the piece data, when │ │ │ │ +it's downloaded.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    piece_granularity
    │ │ │ │ +
    only calculate file progress at piece granularity. This makes │ │ │ │ +the file_progress() call cheaper and also only takes bytes that │ │ │ │ +have passed the hash check into account, so progress cannot │ │ │ │ +regress in this mode.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    graceful_pause
    │ │ │ │ +
    will delay the disconnect of peers that we're still downloading │ │ │ │ +outstanding requests from. The torrent will not accept any more │ │ │ │ +requests and will disconnect all idle peers. As soon as a peer is done │ │ │ │ +transferring the blocks that were requested from it, it is │ │ │ │ +disconnected. This is a graceful shut down of the torrent in the sense │ │ │ │ +that no downloaded bytes are wasted.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    flush_disk_cache
    │ │ │ │ +
    the disk cache will be flushed before creating the resume data. │ │ │ │ +This avoids a problem with file timestamps in the resume data in │ │ │ │ +case the cache hasn't been flushed yet.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    save_info_dict
    │ │ │ │ +
    the resume data will contain the metadata from the torrent file as │ │ │ │ +well. This is useful for clients that don't keep .torrent files │ │ │ │ +around separately, or for torrents that were added via a magnet link.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    only_if_modified
    │ │ │ │ +
    this flag has the same behavior as the combination of: │ │ │ │ +if_counters_changed | if_download_progress | if_config_changed | │ │ │ │ +if_state_changed | if_metadata_changed
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    if_counters_changed
    │ │ │ │ +
    save resume data if any counters has changed since the last time │ │ │ │ +resume data was saved. This includes upload/download counters, active │ │ │ │ +time counters and scrape data. A torrent that is not paused will have │ │ │ │ +its active time counters incremented continuously.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    if_download_progress
    │ │ │ │ +
    save the resume data if any blocks have been downloaded since the │ │ │ │ +last time resume data was saved. This includes: │ │ │ │ +* checking existing files on disk │ │ │ │ +* downloading a block from a peer
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    if_config_changed
    │ │ │ │ +
    save the resume data if configuration options changed since last time │ │ │ │ +the resume data was saved. This includes: │ │ │ │ +* file- or piece priorities │ │ │ │ +* upload- and download rate limits │ │ │ │ +* change max-uploads (unchoke slots) │ │ │ │ +* change max connection limit │ │ │ │ +* enable/disable peer-exchange, local service discovery or DHT │ │ │ │ +* enable/disable apply IP-filter │ │ │ │ +* enable/disable auto-managed │ │ │ │ +* enable/disable share-mode │ │ │ │ +* enable/disable sequential-mode │ │ │ │ +* files renamed │ │ │ │ +* storage moved (save_path changed)
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    if_state_changed
    │ │ │ │ +
    save the resume data if torrent state has changed since last time the │ │ │ │ +resume data was saved. This includes: │ │ │ │ +* upload mode │ │ │ │ +* paused state │ │ │ │ +* super-seeding │ │ │ │ +* seed-mode
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    if_metadata_changed
    │ │ │ │ +
    save the resume data if any metadata changed since the last time │ │ │ │ +resume data was saved. This includes: │ │ │ │ +* add/remove web seeds │ │ │ │ +* add/remove trackers │ │ │ │ +* receiving metadata for a magnet link
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    ignore_min_interval
    │ │ │ │ +
    by default, force-reannounce will still honor the min-interval │ │ │ │ +published by the tracker. If this flag is set, it will be ignored │ │ │ │ +and the tracker is announced immediately.
    │ │ │ │
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    hash_value()

    │ │ │ │ +

    Declared in "libtorrent/torrent_handle.hpp"

    │ │ │ │ +
    │ │ │ │ +std::size_t hash_value (torrent_handle const& h);
    │ │ │ │ +
    │ │ │ │ +

    for std::hash (and to support using this type in unordered_map etc.)

    │ │ │ │

    You have some control over session configuration through the session::apply_settings() │ │ │ │ member function. To change one or more configuration options, create a settings_pack │ │ │ │ object and fill it with the settings to be set and pass it in to session::apply_settings().

    │ │ │ │

    The settings_pack object is a collection of settings updates that are applied │ │ │ │ to the session when passed to session::apply_settings(). It's empty when │ │ │ │ constructed.

    │ │ │ │

    You have control over proxy and authorization settings and also the user-agent │ │ │ │ @@ -17053,22 +18279,22 @@ │ │ │ │

    │ │ │ │  struct settings_pack final : settings_interface
    │ │ │ │  {
    │ │ │ │     friend  void apply_pack_impl (settings_pack const*
    │ │ │ │        , aux::session_settings_single_thread&
    │ │ │ │        , std::vector<void(aux::session_impl::*)()>*);
    │ │ │ │     void set_bool (int name, bool val) override;
    │ │ │ │ -   void set_str (int name, std::string val) override;
    │ │ │ │ -   void set_int (int name, int val) override;
    │ │ │ │     void set_int (int name, flags::bitfield_flag<Type, Tag> const val);
    │ │ │ │ +   void set_int (int name, int val) override;
    │ │ │ │ +   void set_str (int name, std::string val) override;
    │ │ │ │     bool has_val (int name) const override;
    │ │ │ │     void clear ();
    │ │ │ │     void clear (int name);
    │ │ │ │ -   bool get_bool (int name) const override;
    │ │ │ │     std::string const& get_str (int name) const override;
    │ │ │ │ +   bool get_bool (int name) const override;
    │ │ │ │     int get_int (int name) const override;
    │ │ │ │     void for_each (Fun&& f) const;
    │ │ │ │  
    │ │ │ │     enum type_bases
    │ │ │ │     {
    │ │ │ │        string_type_base,
    │ │ │ │        int_type_base,
    │ │ │ │ @@ -17139,23 +18365,23 @@
    │ │ │ │        socks5,
    │ │ │ │        socks5_pw,
    │ │ │ │        http,
    │ │ │ │        http_pw,
    │ │ │ │     };
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ - │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -

    set_int() set_bool() set_str()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +

    set_bool() set_str() set_int()

    │ │ │ │
    │ │ │ │  void set_bool (int name, bool val) override;
    │ │ │ │ -void set_str (int name, std::string val) override;
    │ │ │ │ -void set_int (int name, int val) override;
    │ │ │ │  void set_int (int name, flags::bitfield_flag<Type, Tag> const val);
    │ │ │ │ +void set_int (int name, int val) override;
    │ │ │ │ +void set_str (int name, std::string val) override;
    │ │ │ │  
    │ │ │ │

    set a configuration option in the settings_pack. name is one of │ │ │ │ the enum values from string_types, int_types or bool_types. They must │ │ │ │ match the respective type of the set_* function.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    has_val()

    │ │ │ │ @@ -17181,16 +18407,16 @@ │ │ │ │

    clear a specific setting from the pack

    │ │ │ │ │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    get_str() get_bool() get_int()

    │ │ │ │
    │ │ │ │ -bool get_bool (int name) const override;
    │ │ │ │  std::string const& get_str (int name) const override;
    │ │ │ │ +bool get_bool (int name) const override;
    │ │ │ │  int get_int (int name) const override;
    │ │ │ │  
    │ │ │ │

    queries the current configuration option from the settings_pack. │ │ │ │ name is one of the enumeration values from string_types, int_types │ │ │ │ or bool_types. The enum value must match the type of the get_* │ │ │ │ function. If the specified setting field has not been set, the default │ │ │ │ value is returned.

    │ │ │ │ @@ -17550,19 +18776,19 @@ │ │ │ │ http_pw │ │ │ │ 5 │ │ │ │ The server is assumed to be an HTTP proxy that requires user │ │ │ │ authorization. The username and password will be sent to the proxy. │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │
    │ │ │ │ -
    │ │ │ │ -

    min_memory_usage() high_performance_seed()

    │ │ │ │ +
    │ │ │ │ +

    high_performance_seed() min_memory_usage()

    │ │ │ │

    Declared in "libtorrent/session.hpp"

    │ │ │ │
    │ │ │ │  settings_pack min_memory_usage ();
    │ │ │ │  settings_pack high_performance_seed ();
    │ │ │ │  
    │ │ │ │

    The default values of the session settings are set for a regular │ │ │ │ bittorrent client running on a desktop system. There are functions that │ │ │ │ @@ -17580,14 +18806,33 @@ │ │ │ │ pieces, instead of reading it all into memory before hashing.

    │ │ │ │

    This configuration is intended to be the starting point for embedded │ │ │ │ devices. It will significantly reduce memory usage.

    │ │ │ │

    high_performance_seed returns settings optimized for a seed box, │ │ │ │ serving many peers and that doesn't do any downloading. It has a 128 MB │ │ │ │ disk cache and has a limit of 400 files in its file pool. It support fast │ │ │ │ upload rates by allowing large send buffers.

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    setting_by_name() name_for_setting()

    │ │ │ │ +

    Declared in "libtorrent/settings_pack.hpp"

    │ │ │ │ +
    │ │ │ │ +int setting_by_name (string_view name);
    │ │ │ │ +char const* name_for_setting (int s);
    │ │ │ │ +
    │ │ │ │ +

    converts a setting integer (from the enums string_types, int_types or │ │ │ │ +bool_types) to a string, and vice versa.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    default_settings()

    │ │ │ │ +

    Declared in "libtorrent/settings_pack.hpp"

    │ │ │ │ +
    │ │ │ │ +settings_pack default_settings ();
    │ │ │ │ +
    │ │ │ │ +

    returns a settings_pack with every setting set to its default value

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    generate_fingerprint()

    │ │ │ │

    Declared in "libtorrent/fingerprint.hpp"

    │ │ │ │
    │ │ │ │  std::string generate_fingerprint (std::string name
    │ │ │ │     , int major, int minor = 0, int revision = 0, int tag = 0);
    │ │ │ │ @@ -17637,1383 +18882,305 @@
    │ │ │ │  Tribler
    │ │ │ │  
    │ │ │ │  
    │ │ │ │  
    │ │ │ │  

    There's an informal directory of client id's here.

    │ │ │ │

    The major, minor, revision and tag parameters are used to │ │ │ │ identify the version of your client.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    setting_by_name() name_for_setting()

    │ │ │ │ -

    Declared in "libtorrent/settings_pack.hpp"

    │ │ │ │ -
    │ │ │ │ -char const* name_for_setting (int s);
    │ │ │ │ -int setting_by_name (string_view name);
    │ │ │ │ -
    │ │ │ │ -

    converts a setting integer (from the enums string_types, int_types or │ │ │ │ -bool_types) to a string, and vice versa.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    default_settings()

    │ │ │ │ -

    Declared in "libtorrent/settings_pack.hpp"

    │ │ │ │ -
    │ │ │ │ -settings_pack default_settings ();
    │ │ │ │ -
    │ │ │ │ -

    returns a settings_pack with every setting set to its default value

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    storage_error

    │ │ │ │ -

    Declared in "libtorrent/error_code.hpp"

    │ │ │ │ -

    used by storage to return errors │ │ │ │ -also includes which underlying file the │ │ │ │ -error happened on

    │ │ │ │ +

    Bencoding is a common representation in bittorrent used for dictionary, │ │ │ │ +list, int and string hierarchies. It's used to encode .torrent files and │ │ │ │ +some messages in the network protocol. libtorrent also uses it to store │ │ │ │ +settings, resume data and other session state.

    │ │ │ │ +

    Strings in bencoded structures do not necessarily represent text. │ │ │ │ +Strings are raw byte buffers of a certain length. If a string is meant to be │ │ │ │ +interpreted as text, it is required to be UTF-8 encoded. See BEP 3.

    │ │ │ │ +

    The function for decoding bencoded data bdecode(), returning a bdecode_node. │ │ │ │ +This function builds a tree that points back into the original buffer. The │ │ │ │ +returned bdecode_node will not be valid once the buffer it was parsed out of │ │ │ │ +is discarded.

    │ │ │ │ +

    It's possible to construct an entry from a bdecode_node, if a structure needs │ │ │ │ +to be altered and re-encoded.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    entry

    │ │ │ │ +

    Declared in "libtorrent/entry.hpp"

    │ │ │ │ +

    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.

    │ │ │ │
    │ │ │ │ -struct storage_error
    │ │ │ │ +class entry
    │ │ │ │  {
    │ │ │ │ -   explicit operator bool () const;
    │ │ │ │ -   void file (file_index_t f);
    │ │ │ │ -   file_index_t file () const;
    │ │ │ │ +   data_type type () const;
    │ │ │ │ +   entry (preformatted_type);
    │ │ │ │ +   entry (span<char const>);
    │ │ │ │ +   entry (integer_type);
    │ │ │ │ +   entry (list_type);
    │ │ │ │ +   entry (dictionary_type);
    │ │ │ │ +   entry (U v);
    │ │ │ │ +   entry (data_type t);
    │ │ │ │ +   entry (bdecode_node const& n);
    │ │ │ │ +   entry& operator= (entry&&) & noexcept;
    │ │ │ │ +   entry& operator= (span<char const>) &;
    │ │ │ │ +   entry& operator= (integer_type) &;
    │ │ │ │ +   entry& operator= (dictionary_type) &;
    │ │ │ │ +   entry& operator= (preformatted_type) &;
    │ │ │ │ +   entry& operator= (bdecode_node const&) &;
    │ │ │ │ +   entry& operator= (list_type) &;
    │ │ │ │ +   entry& operator= (entry const&) &;
    │ │ │ │ +   entry& operator= (U v) &;
    │ │ │ │ +   string_type& string ();
    │ │ │ │ +   dictionary_type const& dict () const;
    │ │ │ │ +   string_type const& string () const;
    │ │ │ │ +   dictionary_type& dict ();
    │ │ │ │ +   list_type& list ();
    │ │ │ │ +   preformatted_type& preformatted ();
    │ │ │ │ +   list_type const& list () const;
    │ │ │ │ +   integer_type& integer ();
    │ │ │ │ +   preformatted_type const& preformatted () const;
    │ │ │ │ +   integer_type const& integer () const;
    │ │ │ │ +   void swap (entry& e);
    │ │ │ │ +   entry& operator[] (string_view key);
    │ │ │ │ +   entry const& operator[] (string_view key) const;
    │ │ │ │ +   entry const* find_key (string_view key) const;
    │ │ │ │ +   entry* find_key (string_view key);
    │ │ │ │ +   std::string to_string (bool single_line = false) const;
    │ │ │ │  
    │ │ │ │ -   error_code ec;
    │ │ │ │ -   operation_t operation;
    │ │ │ │ +   enum data_type
    │ │ │ │ +   {
    │ │ │ │ +      int_t,
    │ │ │ │ +      string_t,
    │ │ │ │ +      list_t,
    │ │ │ │ +      dictionary_t,
    │ │ │ │ +      undefined_t,
    │ │ │ │ +      preformatted_t,
    │ │ │ │ +   };
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ -[report issue]
    │ │ │ │ -

    bool()

    │ │ │ │ +[report issue]
    │ │ │ │ +

    type()

    │ │ │ │
    │ │ │ │ -explicit operator bool () const;
    │ │ │ │ +data_type type () const;
    │ │ │ │  
    │ │ │ │ -

    explicitly converts to true if this object represents an error, and │ │ │ │ -false if it does not.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    file()

    │ │ │ │ +

    returns the concrete type of the entry

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    entry()

    │ │ │ │
    │ │ │ │ -void file (file_index_t f);
    │ │ │ │ -file_index_t file () const;
    │ │ │ │ +entry (preformatted_type);
    │ │ │ │ +entry (span<char const>);
    │ │ │ │ +entry (integer_type);
    │ │ │ │ +entry (list_type);
    │ │ │ │ +entry (dictionary_type);
    │ │ │ │  
    │ │ │ │ -

    set and query the index (in the torrent) of the file this error │ │ │ │ -occurred on. This may also have special values defined in │ │ │ │ -torrent_status.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    ec
    │ │ │ │ -
    the error that occurred
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    operation
    │ │ │ │ -
    A code from operation_t enum, indicating what │ │ │ │ -kind of operation failed.
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    libtorrent_category()

    │ │ │ │ -

    Declared in "libtorrent/error_code.hpp"

    │ │ │ │ +

    constructors directly from a specific type. │ │ │ │ +The content of the argument is copied into the │ │ │ │ +newly constructed entry

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    entry()

    │ │ │ │
    │ │ │ │ -boost::system::error_category& libtorrent_category ();
    │ │ │ │ +entry (data_type t);
    │ │ │ │  
    │ │ │ │ -

    return the instance of the libtorrent_error_category which │ │ │ │ -maps libtorrent error codes to human readable error messages.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    http_category()

    │ │ │ │ -

    Declared in "libtorrent/error_code.hpp"

    │ │ │ │ +

    construct an empty entry of the specified type. │ │ │ │ +see data_type enum.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    entry()

    │ │ │ │
    │ │ │ │ -boost::system::error_category& http_category ();
    │ │ │ │ +entry (bdecode_node const& n);
    │ │ │ │  
    │ │ │ │ -

    returns the error_category for HTTP errors

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    i2p_category()

    │ │ │ │ -

    Declared in "libtorrent/i2p_stream.hpp"

    │ │ │ │ +

    construct from bdecode_node parsed form (see bdecode())

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    operator=()

    │ │ │ │
    │ │ │ │ -boost::system::error_category& i2p_category ();
    │ │ │ │ +entry& operator= (entry&&) & noexcept;
    │ │ │ │ +entry& operator= (span<char const>) &;
    │ │ │ │ +entry& operator= (integer_type) &;
    │ │ │ │ +entry& operator= (dictionary_type) &;
    │ │ │ │ +entry& operator= (preformatted_type) &;
    │ │ │ │ +entry& operator= (bdecode_node const&) &;
    │ │ │ │ +entry& operator= (list_type) &;
    │ │ │ │ +entry& operator= (entry const&) &;
    │ │ │ │  
    │ │ │ │ -

    returns the error category for I2P errors

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    bdecode_category()

    │ │ │ │ -

    Declared in "libtorrent/bdecode.hpp"

    │ │ │ │ +

    copies the structure of the right hand side into this │ │ │ │ +entry.

    │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    integer() dict() preformatted() string() list()

    │ │ │ │
    │ │ │ │ -boost::system::error_category& bdecode_category ();
    │ │ │ │ +string_type& string ();
    │ │ │ │ +dictionary_type const& dict () const;
    │ │ │ │ +string_type const& string () const;
    │ │ │ │ +dictionary_type& dict ();
    │ │ │ │ +list_type& list ();
    │ │ │ │ +preformatted_type& preformatted ();
    │ │ │ │ +list_type const& list () const;
    │ │ │ │ +integer_type& integer ();
    │ │ │ │ +preformatted_type const& preformatted () const;
    │ │ │ │ +integer_type const& integer () const;
    │ │ │ │  
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    pcp_category()

    │ │ │ │ -

    Declared in "libtorrent/natpmp.hpp"

    │ │ │ │ +

    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 │ │ │ │ +system_error. You can ask an entry for its type through the │ │ │ │ +type() function.

    │ │ │ │ +

    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.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    swap()

    │ │ │ │
    │ │ │ │ -boost::system::error_category& pcp_category ();
    │ │ │ │ +void swap (entry& e);
    │ │ │ │  
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    socks_category()

    │ │ │ │ -

    Declared in "libtorrent/socks5_stream.hpp"

    │ │ │ │ +

    swaps the content of this with e.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    operator[]()

    │ │ │ │
    │ │ │ │ -boost::system::error_category& socks_category ();
    │ │ │ │ +entry& operator[] (string_view key);
    │ │ │ │ +entry const& operator[] (string_view key) const;
    │ │ │ │  
    │ │ │ │ -

    returns the error_category for SOCKS5 errors

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    gzip_category()

    │ │ │ │ -

    Declared in "libtorrent/gzip.hpp"

    │ │ │ │ +

    All of these functions requires the entry to be a dictionary, if it │ │ │ │ +isn't they will throw system_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 system_error.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    find_key()

    │ │ │ │
    │ │ │ │ -boost::system::error_category& gzip_category ();
    │ │ │ │ +entry const* find_key (string_view key) const;
    │ │ │ │ +entry* find_key (string_view key);
    │ │ │ │  
    │ │ │ │ -

    get the error_category for zip errors

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    upnp_category()

    │ │ │ │ -

    Declared in "libtorrent/upnp.hpp"

    │ │ │ │ +

    These functions requires the entry to be a dictionary, if it isn't │ │ │ │ +they will throw system_error.

    │ │ │ │ +

    They will look for an element at the given key in the dictionary, if │ │ │ │ +the element cannot be found, they will return nullptr. If an element │ │ │ │ +with the given key is found, the return a pointer to it.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    to_string()

    │ │ │ │
    │ │ │ │ -boost::system::error_category& upnp_category ();
    │ │ │ │ +std::string to_string (bool single_line = false) const;
    │ │ │ │  
    │ │ │ │ -

    the boost.system error category for UPnP errors

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum error_code_enum

    │ │ │ │ -

    Declared in "libtorrent/error_code.hpp"

    │ │ │ │ - │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -
    namevaluedescription
    no_error0Not an error
    file_collision1Two torrents has files which end up overwriting each other
    failed_hash_check2A piece did not match its piece hash
    torrent_is_no_dict3The .torrent file does not contain a bencoded dictionary at │ │ │ │ -its top level
    torrent_missing_info4The .torrent file does not have an info dictionary
    torrent_info_no_dict5The .torrent file's info entry is not a dictionary
    torrent_missing_piece_length6The .torrent file does not have a piece length entry
    torrent_missing_name7The .torrent file does not have a name entry
    torrent_invalid_name8The .torrent file's name entry is invalid
    torrent_invalid_length9The length of a file, or of the whole .torrent file is invalid. │ │ │ │ -Either negative or not an integer
    torrent_file_parse_failed10Failed to parse a file entry in the .torrent
    torrent_missing_pieces11The pieces field is missing or invalid in the .torrent file
    torrent_invalid_hashes12The pieces string has incorrect length
    too_many_pieces_in_torrent13The .torrent file has more pieces than is supported by libtorrent
    invalid_swarm_metadata14The metadata (.torrent file) that was received from the swarm │ │ │ │ -matched the info-hash, but failed to be parsed
    invalid_bencoding15The file or buffer is not correctly bencoded
    no_files_in_torrent16The .torrent file does not contain any files
    invalid_escaped_string17The string was not properly url-encoded as expected
    session_is_closing18Operation is not permitted since the session is shutting down
    duplicate_torrent19There's already a torrent with that info-hash added to the │ │ │ │ -session
    invalid_torrent_handle20The supplied torrent_handle is not referring to a valid torrent
    invalid_entry_type21The type requested from the entry did not match its type
    missing_info_hash_in_uri22The specified URI does not contain a valid info-hash
    file_too_short23One of the files in the torrent was unexpectedly small. This │ │ │ │ -might be caused by files being changed by an external process
    unsupported_url_protocol24The URL used an unknown protocol. Currently http and │ │ │ │ -https (if built with openssl support) are recognized. For │ │ │ │ -trackers udp is recognized as well.
    url_parse_error25The URL did not conform to URL syntax and failed to be parsed
    peer_sent_empty_piece26The peer sent a piece message of length 0
    parse_failed27A bencoded structure was corrupt and failed to be parsed
    invalid_file_tag28The fast resume file was missing or had an invalid file version │ │ │ │ -tag
    missing_info_hash29The fast resume file was missing or had an invalid info-hash
    mismatching_info_hash30The info-hash did not match the torrent
    invalid_hostname31The URL contained an invalid hostname
    invalid_port32The URL had an invalid port
    port_blocked33The port is blocked by the port-filter, and prevented the │ │ │ │ -connection
    expected_close_bracket_in_address34The IPv6 address was expected to end with "]"
    destructing_torrent35The torrent is being destructed, preventing the operation to │ │ │ │ -succeed
    timed_out36The connection timed out
    upload_upload_connection37The peer is upload only, and we are upload only. There's no point │ │ │ │ -in keeping the connection
    uninteresting_upload_peer38The peer is upload only, and we're not interested in it. There's │ │ │ │ -no point in keeping the connection
    invalid_info_hash39The peer sent an unknown info-hash
    torrent_paused40The torrent is paused, preventing the operation from succeeding
    invalid_have41The peer sent an invalid have message, either wrong size or │ │ │ │ -referring to a piece that doesn't exist in the torrent
    invalid_bitfield_size42The bitfield message had the incorrect size
    too_many_requests_when_choked43The peer kept requesting pieces after it was choked, possible │ │ │ │ -abuse attempt.
    invalid_piece44The peer sent a piece message that does not correspond to a │ │ │ │ -piece request sent by the client
    no_memory45memory allocation failed
    torrent_aborted46The torrent is aborted, preventing the operation to succeed
    self_connection47The peer is a connection to ourself, no point in keeping it
    invalid_piece_size48The peer sent a piece message with invalid size, either negative │ │ │ │ -or greater than one block
    timed_out_no_interest49The peer has not been interesting or interested in us for too │ │ │ │ -long, no point in keeping it around
    timed_out_inactivity50The peer has not said anything in a long time, possibly dead
    timed_out_no_handshake51The peer did not send a handshake within a reasonable amount of │ │ │ │ -time, it might not be a bittorrent peer
    timed_out_no_request52The peer has been unchoked for too long without requesting any │ │ │ │ -data. It might be lying about its interest in us
    invalid_choke53The peer sent an invalid choke message
    invalid_unchoke54The peer send an invalid unchoke message
    invalid_interested55The peer sent an invalid interested message
    invalid_not_interested56The peer sent an invalid not-interested message
    invalid_request57The peer sent an invalid piece request message
    invalid_hash_list58The peer sent an invalid hash-list message (this is part of the │ │ │ │ -merkle-torrent extension)
    invalid_hash_piece59The peer sent an invalid hash-piece message (this is part of the │ │ │ │ -merkle-torrent extension)
    invalid_cancel60The peer sent an invalid cancel message
    invalid_dht_port61The peer sent an invalid DHT port-message
    invalid_suggest62The peer sent an invalid suggest piece-message
    invalid_have_all63The peer sent an invalid have all-message
    invalid_have_none64The peer sent an invalid have none-message
    invalid_reject65The peer sent an invalid reject message
    invalid_allow_fast66The peer sent an invalid allow fast-message
    invalid_extended67The peer sent an invalid extension message ID
    invalid_message68The peer sent an invalid message ID
    sync_hash_not_found69The synchronization hash was not found in the encrypted handshake
    invalid_encryption_constant70The encryption constant in the handshake is invalid
    no_plaintext_mode71The peer does not support plain text, which is the selected mode
    no_rc4_mode72The peer does not support RC4, which is the selected mode
    unsupported_encryption_mode73The peer does not support any of the encryption modes that the │ │ │ │ -client supports
    unsupported_encryption_mode_selected74The peer selected an encryption mode that the client did not │ │ │ │ -advertise and does not support
    invalid_pad_size75The pad size used in the encryption handshake is of invalid size
    invalid_encrypt_handshake76The encryption handshake is invalid
    no_incoming_encrypted77The client is set to not support incoming encrypted connections │ │ │ │ -and this is an encrypted connection
    no_incoming_regular78The client is set to not support incoming regular bittorrent │ │ │ │ -connections, and this is a regular connection
    duplicate_peer_id79The client is already connected to this peer-ID
    torrent_removed80Torrent was removed
    packet_too_large81The packet size exceeded the upper sanity check-limit
    reserved82 
    http_error83The web server responded with an error
    missing_location84The web server response is missing a location header
    invalid_redirection85The web seed redirected to a path that no longer matches the │ │ │ │ -.torrent directory structure
    redirecting86The connection was closed because it redirected to a different │ │ │ │ -URL
    invalid_range87The HTTP range header is invalid
    no_content_length88The HTTP response did not have a content length
    banned_by_ip_filter89The IP is blocked by the IP filter
    too_many_connections90At the connection limit
    peer_banned91The peer is marked as banned
    stopping_torrent92The torrent is stopping, causing the operation to fail
    too_many_corrupt_pieces93The peer has sent too many corrupt pieces and is banned
    torrent_not_ready94The torrent is not ready to receive peers
    peer_not_constructed95The peer is not completely constructed yet
    session_closing96The session is closing, causing the operation to fail
    optimistic_disconnect97The peer was disconnected in order to leave room for a │ │ │ │ -potentially better peer
    torrent_finished98The torrent is finished
    no_router99No UPnP router found
    metadata_too_large100The metadata message says the metadata exceeds the limit
    invalid_metadata_request101The peer sent an invalid metadata request message
    invalid_metadata_size102The peer advertised an invalid metadata size
    invalid_metadata_offset103The peer sent a message with an invalid metadata offset
    invalid_metadata_message104The peer sent an invalid metadata message
    pex_message_too_large105The peer sent a peer exchange message that was too large
    invalid_pex_message106The peer sent an invalid peer exchange message
    invalid_lt_tracker_message107The peer sent an invalid tracker exchange message
    too_frequent_pex108The peer sent an pex messages too often. This is a possible │ │ │ │ -attempt of and attack
    no_metadata109The operation failed because it requires the torrent to have │ │ │ │ -the metadata (.torrent file) and it doesn't have it yet. │ │ │ │ -This happens for magnet links before they have downloaded the │ │ │ │ -metadata, and also torrents added by URL.
    invalid_dont_have110The peer sent an invalid dont_have message. The don't have │ │ │ │ -message is an extension to allow peers to advertise that the │ │ │ │ -no longer has a piece they previously had.
    requires_ssl_connection111The peer tried to connect to an SSL torrent without connecting │ │ │ │ -over SSL.
    invalid_ssl_cert112The peer tried to connect to a torrent with a certificate │ │ │ │ -for a different torrent.
    not_an_ssl_torrent113the torrent is not an SSL torrent, and the operation requires │ │ │ │ -an SSL torrent
    banned_by_port_filter114peer was banned because its listen port is within a banned port │ │ │ │ -range, as specified by the port_filter.
    invalid_session_handle115The session_handle is not referring to a valid session_impl
    invalid_listen_socket116the listen socket associated with this request was closed
    invalid_hash_request117 
    invalid_hashes118 
    invalid_hash_reject119 
    deprecated_120120 
    deprecated_121121 
    deprecated_122122 
    deprecated_123123 
    deprecated_124124 
    missing_file_sizes130The resume data file is missing the file sizes entry
    no_files_in_resume_data131The resume data file file sizes entry is empty
    missing_pieces132The resume data file is missing the pieces and slots entry
    mismatching_number_of_files133The number of files in the resume data does not match the number │ │ │ │ -of files in the torrent
    mismatching_file_size134One of the files on disk has a different size than in the fast │ │ │ │ -resume file
    mismatching_file_timestamp135One of the files on disk has a different timestamp than in the │ │ │ │ -fast resume file
    not_a_dictionary136The resume data file is not a dictionary
    invalid_blocks_per_piece137The blocks per piece entry is invalid in the resume data file
    missing_slots138The resume file is missing the slots entry, which is required │ │ │ │ -for torrents with compact allocation. DEPRECATED
    too_many_slots139The resume file contains more slots than the torrent
    invalid_slot_list140The slot entry is invalid in the resume data
    invalid_piece_index141One index in the slot list is invalid
    pieces_need_reorder142The pieces on disk needs to be re-ordered for the specified │ │ │ │ -allocation mode. This happens if you specify sparse allocation │ │ │ │ -and the files on disk are using compact storage. The pieces needs │ │ │ │ -to be moved to their right position. DEPRECATED
    resume_data_not_modified143this error is returned when asking to save resume data and │ │ │ │ -specifying the flag to only save when there's anything new to save │ │ │ │ -(torrent_handle::only_if_modified) and there wasn't anything changed.
    invalid_save_path144the save_path in add_torrent_params is not valid
    http_parse_error150The HTTP header was not correctly formatted
    http_missing_location151The HTTP response was in the 300-399 range but lacked a location │ │ │ │ -header
    http_failed_decompress152The HTTP response was encoded with gzip or deflate but │ │ │ │ -decompressing it failed
    no_i2p_router160The URL specified an i2p address, but no i2p router is configured
    no_i2p_endpoint161i2p acceptor is not available yet, can't announce without endpoint
    scrape_not_available170The tracker URL doesn't support transforming it into a scrape │ │ │ │ -URL. i.e. it doesn't contain "announce.
    invalid_tracker_response171invalid tracker response
    invalid_peer_dict172invalid peer dictionary entry. Not a dictionary
    tracker_failure173tracker sent a failure message
    invalid_files_entry174missing or invalid files entry
    invalid_hash_entry175missing or invalid hash entry
    invalid_peers_entry176missing or invalid peers and peers6 entry
    invalid_tracker_response_length177UDP tracker response packet has invalid size
    invalid_tracker_transaction_id178invalid transaction id in UDP tracker response
    invalid_tracker_action179invalid action field in UDP tracker response
    announce_skipped180skipped announce (because it's assumed to be unreachable over the │ │ │ │ -given source network interface)
    no_entropy200random number generation failed
    ssrf_mitigation201blocked by SSRF mitigation
    blocked_by_idna202blocked because IDNA host names are banned
    torrent_unknown_version210the torrent file has an unknown meta version
    torrent_missing_file_tree211the v2 torrent file has no file tree
    torrent_missing_meta_version212the torrent contains v2 keys but does not specify meta version 2
    torrent_inconsistent_files213the v1 and v2 file metadata does not match
    torrent_missing_piece_layer214one or more files are missing piece layer hashes
    torrent_invalid_piece_layer215a piece layer has the wrong size or failed hash check
    torrent_missing_pieces_root216a v2 file entry has no root hash
    torrent_inconsistent_hashes217the v1 and v2 hashes do not describe the same data
    torrent_invalid_pad_file218a file in the v2 metadata has the pad attribute set
    error_code_max219the number of error codes
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum http_errors

    │ │ │ │ -

    Declared in "libtorrent/error_code.hpp"

    │ │ │ │ - │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -
    namevaluedescription
    cont100 
    ok200 
    created201 
    accepted202 
    no_content204 
    multiple_choices300 
    moved_permanently301 
    moved_temporarily302 
    not_modified304 
    bad_request400 
    unauthorized401 
    forbidden403 
    not_found404 
    internal_server_error500 
    not_implemented501 
    bad_gateway502 
    service_unavailable503 
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum i2p_error_code

    │ │ │ │ -

    Declared in "libtorrent/i2p_stream.hpp"

    │ │ │ │ +

    returns a pretty-printed string representation │ │ │ │ +of the bencoded structure, with JSON-style syntax

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum data_type

    │ │ │ │ +

    Declared in "libtorrent/entry.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ -│ │ │ │ +│ │ │ │ │ │ │ │ -│ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -
    namevaluedescription
    no_error0 
    parse_failed1 
    cant_reach_peer2 
    i2p_error3 
    invalid_key4 
    invalid_id5 
    timeout6 
    key_not_found7 
    duplicated_id8 
    num_errors9 
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum error_code_enum

    │ │ │ │ -

    Declared in "libtorrent/bdecode.hpp"

    │ │ │ │ - │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -
    namevaluedescription
    no_error0Not an error
    expected_digit1expected digit in bencoded string
    expected_colon2expected colon in bencoded string
    unexpected_eof3unexpected end of file in bencoded string
    expected_value4expected value (list, dict, int or string) in bencoded string
    depth_exceeded5bencoded recursion depth limit exceeded
    limit_exceeded6bencoded item count limit exceeded
    overflow7integer overflow
    error_code_max8the number of error codes
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum pcp_errors

    │ │ │ │ -

    Declared in "libtorrent/natpmp.hpp"

    │ │ │ │ - │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -
    namevaluedescription
    pcp_success0 
    pcp_unsupp_version1 
    pcp_not_authorized2 
    pcp_malformed_request3 
    pcp_unsupp_opcode4 
    pcp_unsupp_option5 
    pcp_malformed_option6 
    pcp_network_failure7 
    pcp_no_resources8 
    pcp_unsupp_protocol9 
    pcp_user_ex_quota10 
    pcp_cannot_provide_external11 
    pcp_address_mismatch12 
    pcp_excessive_remote_peers13 
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum socks_error_code

    │ │ │ │ -

    Declared in "libtorrent/socks5_stream.hpp"

    │ │ │ │ - │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ +│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -
    namevaluedescription
    no_error
    int_t0 
    unsupported_version
    string_t1 
    unsupported_authentication_method
    list_t2 
    unsupported_authentication_version
    dictionary_t3 
    authentication_error
    undefined_t4 
    username_required
    preformatted_t5 
    general_failure6 
    command_not_supported7 
    no_identd8 
    identd_error9 
    num_errors10 
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum error_code_enum

    │ │ │ │ -

    Declared in "libtorrent/gzip.hpp"

    │ │ │ │ - │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -
    namevaluedescription
    no_error0Not an error
    invalid_gzip_header1the supplied gzip buffer has invalid header
    inflated_data_too_large2the gzip buffer would inflate to more bytes than the specified │ │ │ │ -maximum size, and was rejected.
    data_did_not_terminate3available inflate data did not terminate
    space_exhausted4output space exhausted before completing inflate
    invalid_block_type5invalid block type (type == 3)
    invalid_stored_block_length6stored block length did not match one's complement
    too_many_length_or_distance_codes7dynamic block code description: too many length or distance codes
    code_lengths_codes_incomplete8dynamic block code description: code lengths codes incomplete
    repeat_lengths_with_no_first_length9dynamic block code description: repeat lengths with no first length
    repeat_more_than_specified_lengths10dynamic block code description: repeat more than specified lengths
    invalid_literal_length_code_lengths11dynamic block code description: invalid literal/length code lengths
    invalid_distance_code_lengths12dynamic block code description: invalid distance code lengths
    invalid_literal_code_in_block13invalid literal/length or distance code in fixed or dynamic block
    distance_too_far_back_in_block14distance is too far back in fixed or dynamic block
    unknown_gzip_error15an unknown error occurred during gzip inflation
    error_code_max16the number of error codes
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum error_code_enum

    │ │ │ │ -

    Declared in "libtorrent/upnp.hpp"

    │ │ │ │ - │ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ -│ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ │ │ │ │
    namevaluedescription
    no_error0No error
    invalid_argument402One of the arguments in the request is invalid
    action_failed501The request failed
    value_not_in_array714The specified value does not exist in the array
    source_ip_cannot_be_wildcarded715The source IP address cannot be wild-carded, but │ │ │ │ -must be fully specified
    external_port_cannot_be_wildcarded716The external port cannot be a wildcard, but must │ │ │ │ -be specified
    port_mapping_conflict718The port mapping entry specified conflicts with a │ │ │ │ -mapping assigned previously to another client
    internal_port_must_match_external724Internal and external port value must be the same
    only_permanent_leases_supported725The NAT implementation only supports permanent │ │ │ │ -lease times on port mappings
    remote_host_must_be_wildcard726RemoteHost must be a wildcard and cannot be a │ │ │ │ -specific IP address or DNS name
    external_port_must_be_wildcard727ExternalPort must be a wildcard and cannot be a │ │ │ │ -specific port
    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +

    operator<<()

    │ │ │ │ +

    Declared in "libtorrent/entry.hpp"

    │ │ │ │ +
    │ │ │ │ +inline std::ostream& operator<< (std::ostream& os, const entry& e);
    │ │ │ │ +
    │ │ │ │ +

    prints the bencoded structure to the ostream as a JSON-style structure.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    bencode()

    │ │ │ │ +

    Declared in "libtorrent/bencode.hpp"

    │ │ │ │ +
    │ │ │ │ +template<class OutIt> int bencode (OutIt out, const entry& e);
    │ │ │ │ +
    │ │ │ │ +

    This function will encode data to bencoded form.

    │ │ │ │ +

    The entry class is the internal representation of the bencoded data │ │ │ │ +and it can be used to retrieve information, an entry can also be build by │ │ │ │ +the program and given to bencode() to encode it into the OutIt │ │ │ │ +iterator.

    │ │ │ │ +

    OutIt is an OutputIterator. It's a template and usually │ │ │ │ +instantiated as ostream_iterator or back_insert_iterator. This │ │ │ │ +function assumes the value_type of the iterator is a char. │ │ │ │ +In order to encode entry e into a buffer, do:

    │ │ │ │ +
    │ │ │ │ +std::vector<char> buf;
    │ │ │ │ +bencode(std::back_inserter(buf), e);
    │ │ │ │ +
    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    bdecode_node

    │ │ │ │

    Declared in "libtorrent/bdecode.hpp"

    │ │ │ │

    Sometimes it's important to get a non-owning reference to the root node ( │ │ │ │ to be able to copy it as a reference for instance). For that, use the │ │ │ │ non_owning() member function.

    │ │ │ │ @@ -19025,38 +19192,38 @@ │ │ │ │ bdecode_node& operator= (bdecode_node&&) & = default; │ │ │ │ bdecode_node (bdecode_node const&); │ │ │ │ bdecode_node (bdecode_node&&) noexcept; │ │ │ │ bdecode_node& operator= (bdecode_node const&) &; │ │ │ │ type_t type () const noexcept; │ │ │ │ explicit operator bool () const noexcept; │ │ │ │ bdecode_node non_owning () const; │ │ │ │ - span<char const> data_section () const noexcept; │ │ │ │ std::ptrdiff_t data_offset () const noexcept; │ │ │ │ + span<char const> data_section () const noexcept; │ │ │ │ string_view list_string_value_at (int i │ │ │ │ , string_view default_val = string_view()) const; │ │ │ │ bdecode_node list_at (int i) const; │ │ │ │ int list_size () const; │ │ │ │ std::int64_t list_int_value_at (int i │ │ │ │ , std::int64_t default_val = 0) const; │ │ │ │ + std::int64_t dict_find_int_value (string_view key │ │ │ │ + , std::int64_t default_val = 0) const; │ │ │ │ int dict_size () const; │ │ │ │ - bdecode_node dict_find (string_view key) const; │ │ │ │ - bdecode_node dict_find_list (string_view key) const; │ │ │ │ + std::pair<string_view, bdecode_node> dict_at (int i) const; │ │ │ │ bdecode_node dict_find_dict (string_view key) const; │ │ │ │ bdecode_node dict_find_int (string_view key) const; │ │ │ │ + bdecode_node dict_find_string (string_view key) const; │ │ │ │ string_view dict_find_string_value (string_view key │ │ │ │ , string_view default_value = string_view()) const; │ │ │ │ - bdecode_node dict_find_string (string_view key) const; │ │ │ │ - std::int64_t dict_find_int_value (string_view key │ │ │ │ - , std::int64_t default_val = 0) const; │ │ │ │ + bdecode_node dict_find (string_view key) const; │ │ │ │ + bdecode_node dict_find_list (string_view key) const; │ │ │ │ std::pair<bdecode_node, bdecode_node> dict_at_node (int i) const; │ │ │ │ - std::pair<string_view, bdecode_node> dict_at (int i) const; │ │ │ │ std::int64_t int_value () const; │ │ │ │ - int string_length () const; │ │ │ │ string_view string_value () const; │ │ │ │ std::ptrdiff_t string_offset () const; │ │ │ │ + int string_length () const; │ │ │ │ char const* string_ptr () const; │ │ │ │ void clear (); │ │ │ │ void swap (bdecode_node& n); │ │ │ │ void reserve (int tokens); │ │ │ │ void switch_underlying_buffer (char const* buf) noexcept; │ │ │ │ bool has_soft_error (span<char> error) const; │ │ │ │ │ │ │ │ @@ -19085,92 +19252,92 @@ │ │ │ │ bdecode_node (bdecode_node const&); │ │ │ │ bdecode_node (bdecode_node&&) noexcept; │ │ │ │ bdecode_node& operator= (bdecode_node const&) &; │ │ │ │ │ │ │ │

    For owning nodes, the copy will create a copy of the tree, but the │ │ │ │ underlying buffer remains the same.

    │ │ │ │ [report issue]
    │ │ │ │ -
    │ │ │ │ +
    │ │ │ │

    type()

    │ │ │ │
    │ │ │ │  type_t type () const noexcept;
    │ │ │ │  
    │ │ │ │

    the type of this node. See type_t.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    bool()

    │ │ │ │
    │ │ │ │  explicit operator bool () const noexcept;
    │ │ │ │  
    │ │ │ │ -

    returns true if type() != none_t.

    │ │ │ │ +

    returns true if type() != none_t.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    non_owning()

    │ │ │ │
    │ │ │ │  bdecode_node non_owning () const;
    │ │ │ │  
    │ │ │ │

    return a non-owning reference to this node. This is useful to refer to │ │ │ │ the root node without copying it in assignments.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    data_section() data_offset()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    data_offset() data_section()

    │ │ │ │
    │ │ │ │ -span<char const> data_section () const noexcept;
    │ │ │ │  std::ptrdiff_t data_offset () const noexcept;
    │ │ │ │ +span<char const> data_section () const noexcept;
    │ │ │ │  
    │ │ │ │

    returns the buffer and length of the section in the original bencoded │ │ │ │ buffer where this node is defined. For a dictionary for instance, this │ │ │ │ starts with d and ends with e, and has all the content of the │ │ │ │ dictionary in between. │ │ │ │ the data_offset() function returns the byte-offset to this node in, │ │ │ │ starting from the beginning of the buffer that was parsed.

    │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    list_int_value_at() list_string_value_at() list_size() list_at()

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    list_int_value_at() list_at() list_size() list_string_value_at()

    │ │ │ │
    │ │ │ │  string_view list_string_value_at (int i
    │ │ │ │        , string_view default_val = string_view()) const;
    │ │ │ │  bdecode_node list_at (int i) const;
    │ │ │ │  int list_size () const;
    │ │ │ │  std::int64_t list_int_value_at (int i
    │ │ │ │        , std::int64_t default_val = 0) const;
    │ │ │ │  
    │ │ │ │

    functions with the list_ prefix operate on lists. These functions are │ │ │ │ only valid if type() == list_t. list_at() returns the item │ │ │ │ in the list at index i. i may not be greater than or equal to the │ │ │ │ size of the list. size() returns the size of the list.

    │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    dict_size() dict_find_string_value() dict_find_int_value() dict_find_int() dict_at() dict_find_list() dict_find_string() dict_find_dict() dict_at_node() dict_find()

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    dict_at() dict_find_string() dict_size() dict_find_int_value() dict_at_node() dict_find_int() dict_find_string_value() dict_find() dict_find_dict() dict_find_list()

    │ │ │ │
    │ │ │ │ +std::int64_t dict_find_int_value (string_view key
    │ │ │ │ +      , std::int64_t default_val = 0) const;
    │ │ │ │  int dict_size () const;
    │ │ │ │ -bdecode_node dict_find (string_view key) const;
    │ │ │ │ -bdecode_node dict_find_list (string_view key) const;
    │ │ │ │ +std::pair<string_view, bdecode_node> dict_at (int i) const;
    │ │ │ │  bdecode_node dict_find_dict (string_view key) const;
    │ │ │ │  bdecode_node dict_find_int (string_view key) const;
    │ │ │ │ +bdecode_node dict_find_string (string_view key) const;
    │ │ │ │  string_view dict_find_string_value (string_view key
    │ │ │ │        , string_view default_value = string_view()) const;
    │ │ │ │ -bdecode_node dict_find_string (string_view key) const;
    │ │ │ │ -std::int64_t dict_find_int_value (string_view key
    │ │ │ │ -      , std::int64_t default_val = 0) const;
    │ │ │ │ +bdecode_node dict_find (string_view key) const;
    │ │ │ │ +bdecode_node dict_find_list (string_view key) const;
    │ │ │ │  std::pair<bdecode_node, bdecode_node> dict_at_node (int i) const;
    │ │ │ │ -std::pair<string_view, bdecode_node> dict_at (int i) const;
    │ │ │ │  
    │ │ │ │

    Functions with the dict_ prefix operates on dictionaries. They are │ │ │ │ only valid if type() == dict_t. In case a key you're looking up │ │ │ │ contains a 0 byte, you cannot use the 0-terminated string overloads, │ │ │ │ but have to use string_view instead. dict_find_list will return a │ │ │ │ valid bdecode_node if the key is found _and_ it is a list. Otherwise │ │ │ │ it will return a default-constructed bdecode_node.

    │ │ │ │ @@ -19185,24 +19352,24 @@ │ │ │ │
    │ │ │ │

    int_value()

    │ │ │ │
    │ │ │ │  std::int64_t int_value () const;
    │ │ │ │  
    │ │ │ │

    this function is only valid if type() == int_t. It returns the │ │ │ │ value of the integer.

    │ │ │ │ - │ │ │ │ │ │ │ │ │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    string_length() string_value() string_ptr() string_offset()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    string_value() string_ptr() string_length() string_offset()

    │ │ │ │
    │ │ │ │ -int string_length () const;
    │ │ │ │  string_view string_value () const;
    │ │ │ │  std::ptrdiff_t string_offset () const;
    │ │ │ │ +int string_length () const;
    │ │ │ │  char const* string_ptr () const;
    │ │ │ │  
    │ │ │ │

    these functions are only valid if type() == string_t. They return │ │ │ │ the string values. Note that string_ptr() is not 0-terminated. │ │ │ │ string_length() returns the number of bytes in the string. │ │ │ │ string_offset() returns the byte offset from the start of the parsed │ │ │ │ bencoded buffer this string can be found.

    │ │ │ │ @@ -19211,15 +19378,15 @@ │ │ │ │

    clear()

    │ │ │ │
    │ │ │ │  void clear ();
    │ │ │ │  
    │ │ │ │

    resets the bdecoded_node to a default constructed state. If this is │ │ │ │ an owning node, the tree is freed and all child nodes are invalidated.

    │ │ │ │ [report issue]
    │ │ │ │ -
    │ │ │ │ +
    │ │ │ │

    swap()

    │ │ │ │
    │ │ │ │  void swap (bdecode_node& n);
    │ │ │ │  
    │ │ │ │

    Swap contents.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │ @@ -19301,20 +19468,20 @@ │ │ │ │

    print the bencoded structure in a human-readable format to a string │ │ │ │ that's returned.

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    bdecode()

    │ │ │ │

    Declared in "libtorrent/bdecode.hpp"

    │ │ │ │
    │ │ │ │ +bdecode_node bdecode (span<char const> buffer
    │ │ │ │ +   , int depth_limit = 100, int token_limit = 2000000);
    │ │ │ │  int bdecode (char const* start, char const* end, bdecode_node& ret
    │ │ │ │     , error_code& ec, int* error_pos = nullptr, int depth_limit = 100
    │ │ │ │     , int token_limit = 2000000);
    │ │ │ │  bdecode_node bdecode (span<char const> buffer
    │ │ │ │ -   , int depth_limit = 100, int token_limit = 2000000);
    │ │ │ │ -bdecode_node bdecode (span<char const> buffer
    │ │ │ │     , error_code& ec, int* error_pos = nullptr, int depth_limit = 100
    │ │ │ │     , int token_limit = 2000000);
    │ │ │ │  
    │ │ │ │

    This function decodes/parses bdecoded data (for example a .torrent file). │ │ │ │ The data structure is returned in the ret argument. the buffer to parse │ │ │ │ is specified by the start of the buffer as well as the end, i.e. one │ │ │ │ byte past the end. If the buffer fails to parse, the function returns a │ │ │ │ @@ -19331,761 +19498,594 @@ │ │ │ │ those bdecode_node objects will simply have references to the root or │ │ │ │ owning bdecode_node. If the root node is destructed, all other nodes │ │ │ │ that refer to anything in that tree become invalid.

    │ │ │ │

    However, the underlying buffer passed in to this function (start, end) │ │ │ │ must also remain valid while the bdecoded tree is used. The parsed tree │ │ │ │ produced by this function does not copy any data out of the buffer, but │ │ │ │ simply produces references back into it.

    │ │ │ │ -

    Bencoding is a common representation in bittorrent used for dictionary, │ │ │ │ -list, int and string hierarchies. It's used to encode .torrent files and │ │ │ │ -some messages in the network protocol. libtorrent also uses it to store │ │ │ │ -settings, resume data and other session state.

    │ │ │ │ -

    Strings in bencoded structures do not necessarily represent text. │ │ │ │ -Strings are raw byte buffers of a certain length. If a string is meant to be │ │ │ │ -interpreted as text, it is required to be UTF-8 encoded. See BEP 3.

    │ │ │ │ -

    The function for decoding bencoded data bdecode(), returning a bdecode_node. │ │ │ │ -This function builds a tree that points back into the original buffer. The │ │ │ │ -returned bdecode_node will not be valid once the buffer it was parsed out of │ │ │ │ -is discarded.

    │ │ │ │ -

    It's possible to construct an entry from a bdecode_node, if a structure needs │ │ │ │ -to be altered and re-encoded.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    entry

    │ │ │ │ -

    Declared in "libtorrent/entry.hpp"

    │ │ │ │ -

    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.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    torrent_status

    │ │ │ │ +

    Declared in "libtorrent/torrent_status.hpp"

    │ │ │ │ +

    holds a snapshot of the status of a torrent, as queried by │ │ │ │ +torrent_handle::status().

    │ │ │ │
    │ │ │ │ -class entry
    │ │ │ │ +struct torrent_status
    │ │ │ │  {
    │ │ │ │ -   data_type type () const;
    │ │ │ │ -   entry (list_type);
    │ │ │ │ -   entry (integer_type);
    │ │ │ │ -   entry (dictionary_type);
    │ │ │ │ -   entry (span<char const>);
    │ │ │ │ -   entry (preformatted_type);
    │ │ │ │ -   entry (U v);
    │ │ │ │ -   entry (data_type t);
    │ │ │ │ -   entry (bdecode_node const& n);
    │ │ │ │ -   entry& operator= (preformatted_type) &;
    │ │ │ │ -   entry& operator= (entry const&) &;
    │ │ │ │ -   entry& operator= (bdecode_node const&) &;
    │ │ │ │ -   entry& operator= (dictionary_type) &;
    │ │ │ │ -   entry& operator= (integer_type) &;
    │ │ │ │ -   entry& operator= (list_type) &;
    │ │ │ │ -   entry& operator= (entry&&) & noexcept;
    │ │ │ │ -   entry& operator= (span<char const>) &;
    │ │ │ │ -   entry& operator= (U v) &;
    │ │ │ │ -   string_type& string ();
    │ │ │ │ -   integer_type const& integer () const;
    │ │ │ │ -   list_type const& list () const;
    │ │ │ │ -   list_type& list ();
    │ │ │ │ -   preformatted_type& preformatted ();
    │ │ │ │ -   dictionary_type& dict ();
    │ │ │ │ -   string_type const& string () const;
    │ │ │ │ -   preformatted_type const& preformatted () const;
    │ │ │ │ -   dictionary_type const& dict () const;
    │ │ │ │ -   integer_type& integer ();
    │ │ │ │ -   void swap (entry& e);
    │ │ │ │ -   entry& operator[] (string_view key);
    │ │ │ │ -   entry const& operator[] (string_view key) const;
    │ │ │ │ -   entry const* find_key (string_view key) const;
    │ │ │ │ -   entry* find_key (string_view key);
    │ │ │ │ -   std::string to_string (bool single_line = false) const;
    │ │ │ │ +   bool operator== (torrent_status const& st) const;
    │ │ │ │  
    │ │ │ │ -   enum data_type
    │ │ │ │ +   enum state_t
    │ │ │ │     {
    │ │ │ │ -      int_t,
    │ │ │ │ -      string_t,
    │ │ │ │ -      list_t,
    │ │ │ │ -      dictionary_t,
    │ │ │ │ -      undefined_t,
    │ │ │ │ -      preformatted_t,
    │ │ │ │ +      checking_files,
    │ │ │ │ +      downloading_metadata,
    │ │ │ │ +      downloading,
    │ │ │ │ +      finished,
    │ │ │ │ +      seeding,
    │ │ │ │ +      unused_enum_for_backwards_compatibility_allocating,
    │ │ │ │ +      checking_resume_data,
    │ │ │ │     };
    │ │ │ │ +
    │ │ │ │ +   torrent_handle handle;
    │ │ │ │ +   error_code errc;
    │ │ │ │ +   file_index_t error_file  = torrent_status::error_file_none;
    │ │ │ │ +   static constexpr file_index_t error_file_none {-1};
    │ │ │ │ +   static constexpr file_index_t error_file_ssl_ctx {-3};
    │ │ │ │ +   static constexpr file_index_t error_file_metadata {-4};
    │ │ │ │ +   static constexpr file_index_t error_file_exception {-5};
    │ │ │ │ +   static constexpr file_index_t error_file_partfile {-6};
    │ │ │ │ +   std::string save_path;
    │ │ │ │ +   std::string name;
    │ │ │ │ +   std::weak_ptr<const torrent_info> torrent_file;
    │ │ │ │ +   time_duration next_announce  = seconds{0};
    │ │ │ │ +   std::string current_tracker;
    │ │ │ │ +   std::int64_t total_download  = 0;
    │ │ │ │ +   std::int64_t total_upload  = 0;
    │ │ │ │ +   std::int64_t total_payload_download  = 0;
    │ │ │ │ +   std::int64_t total_payload_upload  = 0;
    │ │ │ │ +   std::int64_t total_failed_bytes  = 0;
    │ │ │ │ +   std::int64_t total_redundant_bytes  = 0;
    │ │ │ │ +   typed_bitfield<piece_index_t> pieces;
    │ │ │ │ +   typed_bitfield<piece_index_t> verified_pieces;
    │ │ │ │ +   std::int64_t total_done  = 0;
    │ │ │ │ +   std::int64_t total  = 0;
    │ │ │ │ +   std::int64_t total_wanted_done  = 0;
    │ │ │ │ +   std::int64_t total_wanted  = 0;
    │ │ │ │ +   std::int64_t all_time_upload  = 0;
    │ │ │ │ +   std::int64_t all_time_download  = 0;
    │ │ │ │ +   std::time_t added_time  = 0;
    │ │ │ │ +   std::time_t completed_time  = 0;
    │ │ │ │ +   std::time_t last_seen_complete  = 0;
    │ │ │ │ +   storage_mode_t storage_mode  = storage_mode_sparse;
    │ │ │ │ +   float progress  = 0.f;
    │ │ │ │ +   int progress_ppm  = 0;
    │ │ │ │ +   queue_position_t queue_position {};
    │ │ │ │ +   int download_rate  = 0;
    │ │ │ │ +   int upload_rate  = 0;
    │ │ │ │ +   int download_payload_rate  = 0;
    │ │ │ │ +   int upload_payload_rate  = 0;
    │ │ │ │ +   int num_seeds  = 0;
    │ │ │ │ +   int num_peers  = 0;
    │ │ │ │ +   int num_complete  = -1;
    │ │ │ │ +   int num_incomplete  = -1;
    │ │ │ │ +   int list_seeds  = 0;
    │ │ │ │ +   int list_peers  = 0;
    │ │ │ │ +   int connect_candidates  = 0;
    │ │ │ │ +   int num_pieces  = 0;
    │ │ │ │ +   int distributed_full_copies  = 0;
    │ │ │ │ +   int distributed_fraction  = 0;
    │ │ │ │ +   float distributed_copies  = 0.f;
    │ │ │ │ +   int block_size  = 0;
    │ │ │ │ +   int num_uploads  = 0;
    │ │ │ │ +   int num_connections  = 0;
    │ │ │ │ +   int uploads_limit  = 0;
    │ │ │ │ +   int connections_limit  = 0;
    │ │ │ │ +   int up_bandwidth_queue  = 0;
    │ │ │ │ +   int down_bandwidth_queue  = 0;
    │ │ │ │ +   int seed_rank  = 0;
    │ │ │ │ +   state_t state  = checking_resume_data;
    │ │ │ │ +   bool need_save_resume  = false;
    │ │ │ │ +   bool is_seeding  = false;
    │ │ │ │ +   bool is_finished  = false;
    │ │ │ │ +   bool has_metadata  = false;
    │ │ │ │ +   bool has_incoming  = false;
    │ │ │ │ +   bool moving_storage  = false;
    │ │ │ │ +   bool announcing_to_trackers  = false;
    │ │ │ │ +   bool announcing_to_lsd  = false;
    │ │ │ │ +   bool announcing_to_dht  = false;
    │ │ │ │ +   info_hash_t info_hashes;
    │ │ │ │ +   time_point last_upload;
    │ │ │ │ +   time_point last_download;
    │ │ │ │ +   seconds active_duration;
    │ │ │ │ +   seconds finished_duration;
    │ │ │ │ +   seconds seeding_duration;
    │ │ │ │ +   torrent_flags_t flags {};
    │ │ │ │  };
    │ │ │ │  
    │ │ │ │ -[report issue]
    │ │ │ │ -

    type()

    │ │ │ │ -
    │ │ │ │ -data_type type () const;
    │ │ │ │ -
    │ │ │ │ -

    returns the concrete type of the entry

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    entry()

    │ │ │ │ -
    │ │ │ │ -entry (list_type);
    │ │ │ │ -entry (integer_type);
    │ │ │ │ -entry (dictionary_type);
    │ │ │ │ -entry (span<char const>);
    │ │ │ │ -entry (preformatted_type);
    │ │ │ │ -
    │ │ │ │ -

    constructors directly from a specific type. │ │ │ │ -The content of the argument is copied into the │ │ │ │ -newly constructed entry

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    entry()

    │ │ │ │ -
    │ │ │ │ -entry (data_type t);
    │ │ │ │ -
    │ │ │ │ -

    construct an empty entry of the specified type. │ │ │ │ -see data_type enum.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    entry()

    │ │ │ │ -
    │ │ │ │ -entry (bdecode_node const& n);
    │ │ │ │ -
    │ │ │ │ -

    construct from bdecode_node parsed form (see bdecode())

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    operator=()

    │ │ │ │ -
    │ │ │ │ -entry& operator= (preformatted_type) &;
    │ │ │ │ -entry& operator= (entry const&) &;
    │ │ │ │ -entry& operator= (bdecode_node const&) &;
    │ │ │ │ -entry& operator= (dictionary_type) &;
    │ │ │ │ -entry& operator= (integer_type) &;
    │ │ │ │ -entry& operator= (list_type) &;
    │ │ │ │ -entry& operator= (entry&&) & noexcept;
    │ │ │ │ -entry& operator= (span<char const>) &;
    │ │ │ │ -
    │ │ │ │ -

    copies the structure of the right hand side into this │ │ │ │ -entry.

    │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    list() dict() integer() preformatted() string()

    │ │ │ │ -
    │ │ │ │ -string_type& string ();
    │ │ │ │ -integer_type const& integer () const;
    │ │ │ │ -list_type const& list () const;
    │ │ │ │ -list_type& list ();
    │ │ │ │ -preformatted_type& preformatted ();
    │ │ │ │ -dictionary_type& dict ();
    │ │ │ │ -string_type const& string () const;
    │ │ │ │ -preformatted_type const& preformatted () const;
    │ │ │ │ -dictionary_type const& dict () const;
    │ │ │ │ -integer_type& integer ();
    │ │ │ │ -
    │ │ │ │ -

    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 │ │ │ │ -system_error. You can ask an entry for its type through the │ │ │ │ -type() function.

    │ │ │ │ -

    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.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    swap()

    │ │ │ │ -
    │ │ │ │ -void swap (entry& e);
    │ │ │ │ -
    │ │ │ │ -

    swaps the content of this with e.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    operator[]()

    │ │ │ │ -
    │ │ │ │ -entry& operator[] (string_view key);
    │ │ │ │ -entry const& operator[] (string_view key) const;
    │ │ │ │ -
    │ │ │ │ -

    All of these functions requires the entry to be a dictionary, if it │ │ │ │ -isn't they will throw system_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 system_error.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    find_key()

    │ │ │ │ -
    │ │ │ │ -entry const* find_key (string_view key) const;
    │ │ │ │ -entry* find_key (string_view key);
    │ │ │ │ -
    │ │ │ │ -

    These functions requires the entry to be a dictionary, if it isn't │ │ │ │ -they will throw system_error.

    │ │ │ │ -

    They will look for an element at the given key in the dictionary, if │ │ │ │ -the element cannot be found, they will return nullptr. If an element │ │ │ │ -with the given key is found, the return a pointer to it.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    to_string()

    │ │ │ │ +[report issue]
    │ │ │ │ +

    operator==()

    │ │ │ │
    │ │ │ │ -std::string to_string (bool single_line = false) const;
    │ │ │ │ +bool operator== (torrent_status const& st) const;
    │ │ │ │  
    │ │ │ │ -

    returns a pretty-printed string representation │ │ │ │ -of the bencoded structure, with JSON-style syntax

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    enum data_type

    │ │ │ │ -

    Declared in "libtorrent/entry.hpp"

    │ │ │ │ +

    compares if the torrent status objects come from the same torrent. i.e. │ │ │ │ +only the torrent_handle field is compared.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    enum state_t

    │ │ │ │ +

    Declared in "libtorrent/torrent_status.hpp"

    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ -│ │ │ │ -│ │ │ │ +│ │ │ │ +│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │ - │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ + │ │ │ │ │ │ │ │ │ │ │ │
    namevaluedescription
    int_t0 
    string_t
    checking_files1 The torrent has not started its download yet, and is │ │ │ │ +currently checking existing files.
    list_t
    downloading_metadata2 The torrent is trying to download metadata from peers. │ │ │ │ +This implies the ut_metadata extension is in use.
    dictionary_t
    downloading3 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.
    undefined_t
    finished4 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.
    preformatted_t
    seeding5 In this state the torrent has finished downloading and │ │ │ │ +is a pure seeder.
    unused_enum_for_backwards_compatibility_allocating6If the torrent was started in full allocation mode, this │ │ │ │ +indicates that the (disk) storage for the torrent is │ │ │ │ +allocated.
    checking_resume_data7The torrent is currently checking the fast resume data and │ │ │ │ +comparing it to the files on disk. This is typically │ │ │ │ +completed in a fraction of a second, but if you add a │ │ │ │ +large number of torrents at once, they will queue up.
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    bencode()

    │ │ │ │ -

    Declared in "libtorrent/bencode.hpp"

    │ │ │ │ -
    │ │ │ │ -template<class OutIt> int bencode (OutIt out, const entry& e);
    │ │ │ │ -
    │ │ │ │ -

    This function will encode data to bencoded form.

    │ │ │ │ -

    The entry class is the internal representation of the bencoded data │ │ │ │ -and it can be used to retrieve information, an entry can also be build by │ │ │ │ -the program and given to bencode() to encode it into the OutIt │ │ │ │ -iterator.

    │ │ │ │ -

    OutIt is an OutputIterator. It's a template and usually │ │ │ │ -instantiated as ostream_iterator or back_insert_iterator. This │ │ │ │ -function assumes the value_type of the iterator is a char. │ │ │ │ -In order to encode entry e into a buffer, do:

    │ │ │ │ -
    │ │ │ │ -std::vector<char> buf;
    │ │ │ │ -bencode(std::back_inserter(buf), e);
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    operator<<()

    │ │ │ │ -

    Declared in "libtorrent/entry.hpp"

    │ │ │ │ -
    │ │ │ │ -inline std::ostream& operator<< (std::ostream& os, const entry& e);
    │ │ │ │ -
    │ │ │ │ -

    prints the bencoded structure to the ostream as a JSON-style structure.

    │ │ │ │ -

    This section describes the functions and classes that are used │ │ │ │ -to create torrent files. It is a layered API with low level classes │ │ │ │ -and higher level convenience functions. A torrent is created in 4 │ │ │ │ -steps:

    │ │ │ │ -
      │ │ │ │ -
    1. first the files that will be part of the torrent are determined.
    2. │ │ │ │ -
    3. the torrent properties are set, such as tracker url, web seeds, │ │ │ │ -DHT nodes etc.
    4. │ │ │ │ -
    5. Read through all the files in the torrent, SHA-1 all the data │ │ │ │ -and set the piece hashes.
    6. │ │ │ │ -
    7. The torrent is bencoded into a file or buffer.
    8. │ │ │ │ -
    │ │ │ │ -

    If there are a lot of files and or deep directory hierarchies to │ │ │ │ -traverse, step one can be time consuming.

    │ │ │ │ -

    Typically step 3 is by far the most time consuming step, since it │ │ │ │ -requires to read all the bytes from all the files in the torrent.

    │ │ │ │ -

    All of these classes and functions are declared by including │ │ │ │ -libtorrent/create_torrent.hpp.

    │ │ │ │ -

    example:

    │ │ │ │ -
    │ │ │ │ -file_storage fs;
    │ │ │ │ -
    │ │ │ │ -// recursively adds files in directories
    │ │ │ │ -add_files(fs, "./my_torrent");
    │ │ │ │ -
    │ │ │ │ -create_torrent t(fs);
    │ │ │ │ -t.add_tracker("http://my.tracker.com/announce");
    │ │ │ │ -t.set_creator("libtorrent example");
    │ │ │ │ -
    │ │ │ │ -// reads the files and calculates the hashes
    │ │ │ │ -set_piece_hashes(t, ".");
    │ │ │ │ -
    │ │ │ │ -ofstream out("my_torrent.torrent", std::ios_base::binary);
    │ │ │ │ -std::vector<char> buf = t.generate_buf();
    │ │ │ │ -out.write(buf.data(), buf.size());
    │ │ │ │ -
    │ │ │ │ -// alternatively, generate an entry and encode it directly to an ostream
    │ │ │ │ -// iterator
    │ │ │ │ -bencode(std::ostream_iterator<char>(out), t.generate());
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    create_torrent

    │ │ │ │ -

    Declared in "libtorrent/create_torrent.hpp"

    │ │ │ │ -

    This class holds state for creating a torrent. After having added │ │ │ │ -all information to it, call create_torrent::generate() to generate │ │ │ │ -the torrent. The entry that's returned can then be bencoded into a │ │ │ │ -.torrent file using bencode().

    │ │ │ │ -
    │ │ │ │ -struct create_torrent
    │ │ │ │ -{
    │ │ │ │ -   explicit create_torrent (file_storage& fs, int piece_size = 0
    │ │ │ │ -      , create_flags_t flags = {});
    │ │ │ │ -   explicit create_torrent (torrent_info const& ti);
    │ │ │ │ -   entry generate () const;
    │ │ │ │ -   std::vector<char> generate_buf () const;
    │ │ │ │ -   file_storage const& files () const;
    │ │ │ │ -   void set_comment (char const* str);
    │ │ │ │ -   void set_creator (char const* str);
    │ │ │ │ -   void set_creation_date (std::time_t timestamp);
    │ │ │ │ -   void set_hash (piece_index_t index, sha1_hash const& h);
    │ │ │ │ -   void set_hash2 (file_index_t file, piece_index_t::diff_type piece, sha256_hash const& h);
    │ │ │ │ -   void add_http_seed (string_view url);
    │ │ │ │ -   void add_url_seed (string_view url);
    │ │ │ │ -   void add_node (std::pair<std::string, int> node);
    │ │ │ │ -   void add_tracker (string_view url, int tier = 0);
    │ │ │ │ -   void set_root_cert (string_view cert);
    │ │ │ │ -   void set_priv (bool p);
    │ │ │ │ -   bool priv () const;
    │ │ │ │ -   bool is_v1_only () const;
    │ │ │ │ -   bool is_v2_only () const;
    │ │ │ │ -   int num_pieces () const;
    │ │ │ │ -   piece_index_t end_piece () const;
    │ │ │ │ -   index_range<piece_index_t> piece_range () const noexcept;
    │ │ │ │ -   file_index_t end_file () const;
    │ │ │ │ -   index_range<file_index_t> file_range () const noexcept;
    │ │ │ │ -   index_range<piece_index_t::diff_type> file_piece_range (file_index_t f);
    │ │ │ │ -   std::int64_t total_size () const;
    │ │ │ │ -   int piece_length () const;
    │ │ │ │ -   int piece_size (piece_index_t i) const;
    │ │ │ │ -   void add_similar_torrent (sha1_hash ih);
    │ │ │ │ -   void add_collection (string_view c);
    │ │ │ │ -
    │ │ │ │ -   static constexpr create_flags_t modification_time  = 2_bit;
    │ │ │ │ -   static constexpr create_flags_t symlinks  = 3_bit;
    │ │ │ │ -   static constexpr create_flags_t v2_only  = 5_bit;
    │ │ │ │ -   static constexpr create_flags_t v1_only  = 6_bit;
    │ │ │ │ -   static constexpr create_flags_t canonical_files  = 7_bit;
    │ │ │ │ -   static constexpr create_flags_t no_attributes  = 8_bit;
    │ │ │ │ -   static constexpr create_flags_t canonical_files_no_tail_padding  = 9_bit;
    │ │ │ │ -};
    │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -

    create_torrent()

    │ │ │ │ -
    │ │ │ │ -explicit create_torrent (file_storage& fs, int piece_size = 0
    │ │ │ │ -      , create_flags_t flags = {});
    │ │ │ │ -explicit create_torrent (torrent_info const& ti);
    │ │ │ │ -
    │ │ │ │ -

    The piece_size is the size of each piece in bytes. It must be a │ │ │ │ -power of 2 and a minimum of 16 kiB. If a piece size of 0 is │ │ │ │ -specified, a piece_size will be set automatically. │ │ │ │ -Piece sizes greater than 128 MiB are considered unreasonable and will │ │ │ │ -be rejected (with an lt::system_error exception).

    │ │ │ │ -

    The flags arguments specifies options for the torrent creation. It can │ │ │ │ -be any combination of the flags defined by create_flags_t.

    │ │ │ │ -

    The file_storage (fs) parameter defines the files, sizes and │ │ │ │ -their properties for the torrent to be created. Set this up first, │ │ │ │ -before passing it to the create_torrent constructor.

    │ │ │ │ -

    The overload that takes a torrent_info object will make a verbatim │ │ │ │ -copy of its info dictionary (to preserve the info-hash). The copy of │ │ │ │ -the info dictionary will be used by create_torrent::generate(). This means │ │ │ │ -that none of the member functions of create_torrent that affects │ │ │ │ -the content of the info dictionary (such as set_hash()), will │ │ │ │ -have any affect. Instead of using this overload, consider using │ │ │ │ -write_torrent_file() instead.

    │ │ │ │ -
    │ │ │ │ -

    Warning

    │ │ │ │ -

    The file_storage and torrent_info objects must stay alive for the │ │ │ │ -entire duration of the create_torrent object.

    │ │ │ │ -
    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    generate() generate_buf()

    │ │ │ │ -
    │ │ │ │ -entry generate () const;
    │ │ │ │ -std::vector<char> generate_buf () const;
    │ │ │ │ -
    │ │ │ │ -

    This function will generate the .torrent file as a bencode tree, or a │ │ │ │ -bencoded into a buffer. │ │ │ │ -In order to encode the entry into a flat file, use the bencode() function.

    │ │ │ │ -

    The function returning an entry may be useful to add custom entries │ │ │ │ -to the torrent file before bencoding it and saving it to disk.

    │ │ │ │ -

    Whether the resulting torrent object is v1, v2 or hybrid depends on │ │ │ │ -whether any of the v1_only or v2_only flags were set on the │ │ │ │ -constructor. If neither were set, the resulting torrent depends on │ │ │ │ -which hashes were set. If both v1 and v2 hashes were set, a hybrid │ │ │ │ -torrent is created.

    │ │ │ │ -

    Any failure will cause this function to throw system_error, with an │ │ │ │ -appropriate error message. These are the reasons this call may throw:

    │ │ │ │ -
      │ │ │ │ -
    • the file storage has 0 files
    • │ │ │ │ -
    • the total size of the file storage is 0 bytes (i.e. it only has │ │ │ │ -empty files)
    • │ │ │ │ -
    • not all v1 hashes (set_hash()) and not all v2 hashes (set_hash2()) │ │ │ │ -were set
    • │ │ │ │ -
    • for v2 torrents, you may not have a directory with the same name as │ │ │ │ -a file. If that's encountered in the file storage, generate() │ │ │ │ -fails.
    • │ │ │ │ -
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    files()

    │ │ │ │ -
    │ │ │ │ -file_storage const& files () const;
    │ │ │ │ -
    │ │ │ │ -

    returns an immutable reference to the file_storage used to create │ │ │ │ -the torrent from.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_comment()

    │ │ │ │ -
    │ │ │ │ -void set_comment (char const* str);
    │ │ │ │ -
    │ │ │ │ -

    Sets the comment for the torrent. The string str should be utf-8 encoded. │ │ │ │ -The comment in a torrent file is optional.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_creator()

    │ │ │ │ -
    │ │ │ │ -void set_creator (char const* str);
    │ │ │ │ -
    │ │ │ │ -

    Sets the creator of the torrent. The string str should be utf-8 encoded. │ │ │ │ -This is optional.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_creation_date()

    │ │ │ │ -
    │ │ │ │ -void set_creation_date (std::time_t timestamp);
    │ │ │ │ -
    │ │ │ │ -

    sets the "creation time" field. Defaults to the system clock at the │ │ │ │ -time of construction of the create_torrent object. The timestamp is │ │ │ │ -specified in seconds, posix time. If the creation date is set to 0, │ │ │ │ -the "creation date" field will be omitted from the generated torrent.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_hash()

    │ │ │ │ -
    │ │ │ │ -void set_hash (piece_index_t index, sha1_hash const& h);
    │ │ │ │ -
    │ │ │ │ -

    This sets the SHA-1 hash for the specified piece (index). You are required │ │ │ │ -to set the hash for every piece in the torrent before generating it. If you have │ │ │ │ -the files on disk, you can use the high level convenience function to do this. │ │ │ │ -See set_piece_hashes(). │ │ │ │ -A SHA-1 hash of all zeros is internally used to indicate a hash that │ │ │ │ -has not been set. Setting such hash will not be considered set when │ │ │ │ -calling generate(). │ │ │ │ -This function will throw std::system_error if it is called on an │ │ │ │ -object constructed with the v2_only flag.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_hash2()

    │ │ │ │ -
    │ │ │ │ -void set_hash2 (file_index_t file, piece_index_t::diff_type piece, sha256_hash const& h);
    │ │ │ │ -
    │ │ │ │ -

    sets the bittorrent v2 hash for file file of the piece piece. │ │ │ │ -piece is relative to the first piece of the file, starting at 0. The │ │ │ │ -first piece in the file can be computed with │ │ │ │ -file_storage::file_index_at_piece(). │ │ │ │ -The hash, h, is the root of the merkle tree formed by the piece's │ │ │ │ -16 kiB blocks. Note that piece sizes must be powers-of-2, so all │ │ │ │ -per-piece merkle trees are complete. │ │ │ │ -A SHA-256 hash of all zeros is internally used to indicate a hash │ │ │ │ -that has not been set. Setting such hash will not be considered set │ │ │ │ -when calling generate(). │ │ │ │ -This function will throw std::system_error if it is called on an │ │ │ │ -object constructed with the v1_only flag.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    add_url_seed() add_http_seed()

    │ │ │ │ -
    │ │ │ │ -void add_http_seed (string_view url);
    │ │ │ │ -void add_url_seed (string_view url);
    │ │ │ │ -
    │ │ │ │ -

    This adds a url seed to the torrent. You can have any number of url seeds. For a │ │ │ │ -single file torrent, this should be an HTTP url, pointing to a file with identical │ │ │ │ -content as the file of the torrent. For a multi-file torrent, it should point to │ │ │ │ -a directory containing a directory with the same name as this torrent, and all the │ │ │ │ -files of the torrent in it.

    │ │ │ │ -

    The second function, add_http_seed() adds an HTTP seed instead.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    add_node()

    │ │ │ │ -
    │ │ │ │ -void add_node (std::pair<std::string, int> node);
    │ │ │ │ -
    │ │ │ │ -

    This adds a DHT node to the torrent. This especially useful if you're creating a │ │ │ │ -tracker less torrent. It can be used by clients to bootstrap their DHT node from. │ │ │ │ -The node is a hostname and a port number where there is a DHT node running. │ │ │ │ -You can have any number of DHT nodes in a torrent.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    add_tracker()

    │ │ │ │ -
    │ │ │ │ -void add_tracker (string_view url, int tier = 0);
    │ │ │ │ -
    │ │ │ │ -

    Adds a tracker to the torrent. This is not strictly required, but most torrents │ │ │ │ -use a tracker as their main source of peers. The url should be an http:// or udp:// │ │ │ │ -url to a machine running a bittorrent tracker that accepts announces for this torrent's │ │ │ │ -info-hash. The tier is the fallback priority of the tracker. All trackers with tier 0 are │ │ │ │ -tried first (in any order). If all fail, trackers with tier 1 are tried. If all of those │ │ │ │ -fail, trackers with tier 2 are tried, and so on.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_root_cert()

    │ │ │ │ -
    │ │ │ │ -void set_root_cert (string_view cert);
    │ │ │ │ -
    │ │ │ │ -

    This function sets an X.509 certificate in PEM format to the torrent. This makes the │ │ │ │ -torrent an SSL torrent. An SSL torrent requires that each peer has a valid certificate │ │ │ │ -signed by this root certificate. For SSL torrents, all peers are connecting over SSL │ │ │ │ -connections. For more information, see the section on ssl torrents.

    │ │ │ │ -

    The string is not the path to the cert, it's the actual content of the │ │ │ │ -certificate.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    priv() set_priv()

    │ │ │ │ -
    │ │ │ │ -void set_priv (bool p);
    │ │ │ │ -bool priv () const;
    │ │ │ │ -
    │ │ │ │ -

    Sets and queries the private flag of the torrent. │ │ │ │ -Torrents with the private flag set ask the client to not use any other │ │ │ │ -sources than the tracker for peers, and to not use DHT to advertise itself publicly, │ │ │ │ -only the tracker.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    num_pieces()

    │ │ │ │ -
    │ │ │ │ -int num_pieces () const;
    │ │ │ │ -
    │ │ │ │ -

    returns the number of pieces in the associated file_storage object.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    piece_range()

    │ │ │ │ -
    │ │ │ │ -index_range<piece_index_t> piece_range () const noexcept;
    │ │ │ │ -
    │ │ │ │ -

    all piece indices in the torrent to be created

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    file_range()

    │ │ │ │ -
    │ │ │ │ -index_range<file_index_t> file_range () const noexcept;
    │ │ │ │ -
    │ │ │ │ -

    all file indices in the torrent to be created

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    file_piece_range()

    │ │ │ │ -
    │ │ │ │ -index_range<piece_index_t::diff_type> file_piece_range (file_index_t f);
    │ │ │ │ -
    │ │ │ │ -

    for v2 and hybrid torrents only, the pieces in the │ │ │ │ -specified file, specified as delta from the first piece in the file. │ │ │ │ -i.e. the first index is 0.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    total_size()

    │ │ │ │ -
    │ │ │ │ -std::int64_t total_size () const;
    │ │ │ │ -
    │ │ │ │ -

    the total number of bytes of all files and pad files

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    piece_size() piece_length()

    │ │ │ │ -
    │ │ │ │ -int piece_length () const;
    │ │ │ │ -int piece_size (piece_index_t i) const;
    │ │ │ │ -
    │ │ │ │ -

    piece_length() returns the piece size of all pieces but the │ │ │ │ -last one. piece_size() returns the size of the specified piece. │ │ │ │ -these functions are just forwarding to the associated file_storage.

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    add_similar_torrent() add_collection()

    │ │ │ │ -
    │ │ │ │ -void add_similar_torrent (sha1_hash ih);
    │ │ │ │ -void add_collection (string_view c);
    │ │ │ │ -
    │ │ │ │ -

    Add similar torrents (by info-hash) or collections of similar torrents. │ │ │ │ -Similar torrents are expected to share some files with this torrent. │ │ │ │ -Torrents sharing a collection name with this torrent are also expected │ │ │ │ -to share files with this torrent. A torrent may have more than one │ │ │ │ -collection and more than one similar torrents. For more information, │ │ │ │ -see BEP 38.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    modification_time
    │ │ │ │ -
    This will include the file modification time as part of the torrent. │ │ │ │ -This is not enabled by default, as it might cause problems when you │ │ │ │ -create a torrent from separate files with the same content, hoping to │ │ │ │ -yield the same info-hash. If the files have different modification times, │ │ │ │ -with this option enabled, you would get different info-hashes for the │ │ │ │ -files.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    handle
    │ │ │ │ +
    a handle to the torrent whose status the object represents.
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    symlinks
    │ │ │ │ -
    If this flag is set, files that are symlinks get a symlink attribute │ │ │ │ -set on them and their data will not be included in the torrent. This │ │ │ │ -is useful if you need to reconstruct a file hierarchy which contains │ │ │ │ -symlinks.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    errc
    │ │ │ │ +
    may be set to an error code describing why the torrent was paused, in │ │ │ │ +case it was paused by an error. If the torrent is not paused or if it's │ │ │ │ +paused but not because of an error, this error_code is not set. │ │ │ │ +if the error is attributed specifically to a file, error_file is set to │ │ │ │ +the index of that file in the .torrent file.
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    v2_only
    │ │ │ │ -
    Do not generate v1 metadata. The resulting torrent will only be usable by │ │ │ │ -clients which support v2. This requires setting all v2 hashes, with │ │ │ │ -set_hash2() before calling generate(). Setting v1 hashes (with │ │ │ │ -set_hash()) is an error with this flag set.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    error_file
    │ │ │ │ +
    if the torrent is stopped because of an disk I/O error, this field │ │ │ │ +contains the index of the file in the torrent that encountered the │ │ │ │ +error. If the error did not originate in a file in the torrent, there │ │ │ │ +are a few special values this can be set to: error_file_none, │ │ │ │ +error_file_ssl_ctx, error_file_exception, error_file_partfile or │ │ │ │ +error_file_metadata;
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    v1_only
    │ │ │ │ -
    do not generate v2 metadata or enforce v2 alignment and padding rules │ │ │ │ -this is mainly for tests, not recommended for production use. This │ │ │ │ -requires setting all v1 hashes, with set_hash(), before calling │ │ │ │ -generate(). Setting v2 hashes (with set_hash2()) is an error with │ │ │ │ -this flag set.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    error_file_none
    │ │ │ │ +
    special values for error_file to describe which file or component │ │ │ │ +encountered the error (errc). │ │ │ │ +the error did not occur on a file
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    canonical_files
    │ │ │ │ -
    This flag only affects v1-only torrents, and is only relevant │ │ │ │ -together with the v1_only_flag. This flag will force the │ │ │ │ -same file order and padding as a v2 (or hybrid) torrent would have. │ │ │ │ -It has the effect of ordering files and inserting pad files to align │ │ │ │ -them with piece boundaries.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    error_file_ssl_ctx
    │ │ │ │ +
    the error occurred setting up the SSL context
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    no_attributes
    │ │ │ │ -
    passing this flag to add_files() will ignore file attributes (such as │ │ │ │ -executable or hidden) when adding the files to the file storage. │ │ │ │ -Since not all filesystems and operating systems support all file │ │ │ │ -attributes the resulting torrent may differ depending on where it's │ │ │ │ -created. If it's important for torrents to be created consistently │ │ │ │ -across systems, this flag should be set.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    error_file_metadata
    │ │ │ │ +
    the error occurred while loading the metadata for the torrent
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    canonical_files_no_tail_padding
    │ │ │ │ -
    this flag enforces the file layout to be canonical according to the │ │ │ │ -bittorrent v2 specification (just like the canonical_files flag) │ │ │ │ -with the one exception that tail padding is not added to the last │ │ │ │ -file. │ │ │ │ -This behavior deviates from the specification but was the way │ │ │ │ -libtorrent created torrents in version up to and including 2.0.7. │ │ │ │ -This flag is here for backwards compatibility.
    │ │ │ │ +[report issue]
    │ │ │ │ +
    error_file_exception
    │ │ │ │ +
    there was a serious error reported in this torrent. The error code │ │ │ │ +or a torrent log alert may provide more information.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    error_file_partfile
    │ │ │ │ +
    the error occurred with the partfile
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    save_path
    │ │ │ │ +
    the path to the directory where this torrent's files are stored. │ │ │ │ +It's typically the path as was given to async_add_torrent() or │ │ │ │ +add_torrent() when this torrent was started. This field is only │ │ │ │ +included if the torrent status is queried with │ │ │ │ +torrent_handle::query_save_path.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    name
    │ │ │ │ +
    the name of the torrent. Typically this is derived from the │ │ │ │ +.torrent file. 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. │ │ │ │ +This field is only included if the torrent status is queried │ │ │ │ +with torrent_handle::query_name.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    torrent_file
    │ │ │ │ +
    set to point to the torrent_info object for this torrent. It's │ │ │ │ +only included if the torrent status is queried with │ │ │ │ +torrent_handle::query_torrent_file.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    next_announce
    │ │ │ │ +
    the time until the torrent will announce itself to the tracker.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    current_tracker
    │ │ │ │ +
    the URL of the last working tracker. If no tracker request has │ │ │ │ +been successful yet, it's set to an empty string.
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    total_download total_upload
    │ │ │ │ +
    the number of bytes downloaded and uploaded to all peers, accumulated, │ │ │ │ +this session only. The session is considered to restart when a │ │ │ │ +torrent is paused and restarted again. When a torrent is paused, these │ │ │ │ +counters are reset to 0. If you want complete, persistent, stats, see │ │ │ │ +all_time_upload and all_time_download.
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    total_payload_download 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. The session is considered to restart │ │ │ │ +when a torrent is paused and restarted again. When a torrent is │ │ │ │ +paused, these counters are reset to 0.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    total_failed_bytes
    │ │ │ │ +
    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 since the torrent was last started. If a torrent is │ │ │ │ +paused and then restarted again, this counter will be reset.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    total_redundant_bytes
    │ │ │ │ +
    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. This only counts bytes since the torrent was last │ │ │ │ +started. If a torrent is paused and then restarted again, this counter │ │ │ │ +will be reset.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    pieces
    │ │ │ │ +
    a 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.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    verified_pieces
    │ │ │ │ +
    a bitmask representing which pieces has had their hash checked. This │ │ │ │ +only applies to torrents in seed mode. If the torrent is not in seed │ │ │ │ +mode, this bitmask may be empty.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    total_done
    │ │ │ │ +
    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).
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    total
    │ │ │ │ +
    the total number of bytes to download for this torrent. This │ │ │ │ +may be less than the size of the torrent in case there are │ │ │ │ +pad files. This number only counts bytes that will actually │ │ │ │ +be requested from peers.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    total_wanted_done
    │ │ │ │ +
    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 have priority 0 (i.e. not wanted). │ │ │ │ +Once a torrent becomes seed, any piece- and file priorities are │ │ │ │ +forgotten and all bytes are considered "wanted".
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    total_wanted
    │ │ │ │ +
    The total number of bytes we want to download. This may be smaller │ │ │ │ +than the total torrent size in case any pieces are prioritized to 0, │ │ │ │ +i.e. not wanted. │ │ │ │ +Once a torrent becomes seed, any piece- and file priorities are │ │ │ │ +forgotten and all bytes are considered "wanted".
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    all_time_upload all_time_download
    │ │ │ │ +
    are accumulated upload and download payload byte counters. They are │ │ │ │ +saved in and restored from resume data to keep totals across sessions.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    added_time
    │ │ │ │ +
    the posix-time when this torrent was added. i.e. what time(nullptr) │ │ │ │ +returned at the time.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    completed_time
    │ │ │ │ +
    the posix-time when this torrent was finished. If the torrent is not │ │ │ │ +yet finished, this is 0.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    last_seen_complete
    │ │ │ │ +
    the time when we, or one of our peers, last saw a complete copy of │ │ │ │ +this torrent.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    storage_mode
    │ │ │ │ +
    The allocation mode for the torrent. See storage_mode_t for the │ │ │ │ +options. For more information, see storage allocation.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    progress
    │ │ │ │ +
    a value in the range [0, 1], that represents the progress of the │ │ │ │ +torrent's current task. It may be checking files or downloading.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    progress_ppm
    │ │ │ │ +

    progress parts per million (progress * 1000000) when disabling │ │ │ │ +floating point operations, this is the only option to query progress

    │ │ │ │ +

    reflects the same value as progress, but instead in a range [0, │ │ │ │ +1000000] (ppm = parts per million). When floating point operations are │ │ │ │ +disabled, this is the only alternative to the floating point value in │ │ │ │ +progress.

    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    queue_position
    │ │ │ │ +
    the position this torrent has in the download │ │ │ │ +queue. If the torrent is a seed or finished, this is -1.
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    download_rate upload_rate
    │ │ │ │ +
    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.
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    download_payload_rate upload_payload_rate
    │ │ │ │ +
    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.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    num_seeds
    │ │ │ │ +
    the number of peers that are seeding that this client is │ │ │ │ +currently connected to.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    num_peers
    │ │ │ │ +
    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().
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    num_complete num_incomplete
    │ │ │ │ +
    if the tracker sends scrape info in its announce reply, these fields │ │ │ │ +will be set to the total number of peers that have the whole file and │ │ │ │ +the total number of peers that are still downloading. set to -1 if the │ │ │ │ +tracker did not send any scrape data in its announce reply.
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    list_seeds list_peers
    │ │ │ │ +
    the number of seeds in our peer list and the total number of peers │ │ │ │ +(including seeds). 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.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    connect_candidates
    │ │ │ │ +
    the number of peers in this torrent's peer list that is a candidate to │ │ │ │ +be connected to. i.e. It has fewer connect attempts than the max fail │ │ │ │ +count, it is not a seed if we are a seed, it is not banned etc. If │ │ │ │ +this is 0, it means we don't know of any more peers that we can try.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    num_pieces
    │ │ │ │ +
    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. │ │ │ │ +Note that these pieces have not necessarily been written to disk yet, │ │ │ │ +and there is a risk the write to disk will fail.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    distributed_full_copies
    │ │ │ │ +
    the number of distributed copies of the torrent. Note that one copy │ │ │ │ +may be spread out among many peers. It tells how many copies there are │ │ │ │ +currently of the rarest piece(s) among the peers this client is │ │ │ │ +connected to.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    distributed_fraction
    │ │ │ │ +

    tells the share of pieces that have more copies than the rarest │ │ │ │ +piece(s). Divide this number by 1000 to get the fraction.

    │ │ │ │ +

    For example, if distributed_full_copies is 2 and │ │ │ │ +distributed_fraction is 500, it means 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 members are set to -1.

    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    distributed_copies
    │ │ │ │ +

    the number of distributed copies of the file. note that one copy may │ │ │ │ +be spread out among many peers. This is a floating point │ │ │ │ +representation of the distributed copies.

    │ │ │ │ +
    │ │ │ │ +
    the integer part tells how many copies
    │ │ │ │ +
    there are of the rarest piece(s)
    │ │ │ │ +
    the fractional part tells the fraction of pieces that
    │ │ │ │ +
    have more copies than the rarest piece(s).
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    block_size
    │ │ │ │ +
    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 │ │ │ │ +smaller, if the pieces are smaller.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    num_uploads
    │ │ │ │ +
    the number of unchoked peers in this torrent.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    num_connections
    │ │ │ │ +
    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.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    uploads_limit
    │ │ │ │ +
    the set limit of upload slots (unchoked peers) for this torrent.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    connections_limit
    │ │ │ │ +
    the set limit of number of connections for this torrent.
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    up_bandwidth_queue down_bandwidth_queue
    │ │ │ │ +
    the number of peers in this torrent that are waiting for more │ │ │ │ +bandwidth quota from the torrent rate limiter. This can determine if │ │ │ │ +the rate you get from this torrent is bound by the torrents limit or │ │ │ │ +not. If there is no limit set on this torrent, the peers might still │ │ │ │ +be waiting for bandwidth quota from the global limiter, but then they │ │ │ │ +are counted in the session_status object.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    seed_rank
    │ │ │ │ +
    A rank of how important it is to seed the torrent, it is used to │ │ │ │ +determine which torrents to seed and which to queue. It is based on │ │ │ │ +the peer to seed ratio from the tracker scrape. For more information, │ │ │ │ +see queuing. Higher value means more important to seed
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    state
    │ │ │ │ +
    the main state the torrent is in. See torrent_status::state_t.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    need_save_resume
    │ │ │ │ +
    true if this torrent has unsaved changes │ │ │ │ +to its download state and statistics since the last resume data │ │ │ │ +was saved.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    is_seeding
    │ │ │ │ +
    true if all pieces have been downloaded.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    is_finished
    │ │ │ │ +
    true if all pieces that have a priority > 0 are downloaded. There is │ │ │ │ +only a distinction between finished and seeding if some pieces or │ │ │ │ +files have been set to priority 0, i.e. are not downloaded.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    has_metadata
    │ │ │ │ +
    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 be false is when the torrent was started torrent-less │ │ │ │ +(i.e. with just an info-hash and tracker ip, a magnet link for │ │ │ │ +instance).
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    has_incoming
    │ │ │ │ +
    true if there has ever been an incoming connection attempt to this │ │ │ │ +torrent.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    moving_storage
    │ │ │ │ +
    this is true if this torrent's storage is currently being moved from │ │ │ │ +one location to another. This may potentially be a long operation │ │ │ │ +if a large file ends up being copied from one drive to another.
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    announcing_to_trackers announcing_to_lsd announcing_to_dht
    │ │ │ │ +
    these are set to true if this torrent is allowed to announce to the │ │ │ │ +respective peer source. Whether they are true or false is determined by │ │ │ │ +the queue logic/auto manager. Torrents that are not auto managed will │ │ │ │ +always be allowed to announce to all peer sources.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    info_hashes
    │ │ │ │ +
    the info-hash for this torrent
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    last_upload last_download
    │ │ │ │ +
    the timestamps of the last time this torrent uploaded or downloaded │ │ │ │ +payload to any peer.
    │ │ │ │ +
    │ │ │ │ + │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    active_duration finished_duration seeding_duration
    │ │ │ │ +
    these are cumulative counters of for how long the torrent has been in │ │ │ │ +different states. active means not paused and added to session. Whether │ │ │ │ +it has found any peers or not is not relevant. │ │ │ │ +finished means all selected files/pieces were downloaded and available │ │ │ │ +to other peers (this is always a subset of active time). │ │ │ │ +seeding means all files/pieces were downloaded and available to │ │ │ │ +peers. Being available to peers does not imply there are other peers │ │ │ │ +asking for the payload.
    │ │ │ │ +
    │ │ │ │ +[report issue]
    │ │ │ │ +
    flags
    │ │ │ │ +
    reflects several of the torrent's flags. For more │ │ │ │ +information, see torrent_handle::flags().
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -

    add_files()

    │ │ │ │ -

    Declared in "libtorrent/create_torrent.hpp"

    │ │ │ │ -
    │ │ │ │ -void add_files (file_storage& fs, std::string const& file
    │ │ │ │ -   , create_flags_t flags = {});
    │ │ │ │ -void add_files (file_storage& fs, std::string const& file
    │ │ │ │ -   , std::function<bool(std::string)> p, create_flags_t flags = {});
    │ │ │ │ -
    │ │ │ │ -

    Adds the file specified by path to the file_storage object. In case path │ │ │ │ -refers to a directory, files will be added recursively from the directory.

    │ │ │ │ -

    If specified, the predicate p is called once for every file and directory that │ │ │ │ -is encountered. Files for which p returns true are added, and directories for │ │ │ │ -which p returns true are traversed. p must have the following signature:

    │ │ │ │ -
    │ │ │ │ -bool Pred(std::string const& p);
    │ │ │ │ -
    │ │ │ │ -

    The path that is passed in to the predicate is the full path of the file or │ │ │ │ -directory. If no predicate is specified, all files are added, and all directories │ │ │ │ -are traversed.

    │ │ │ │ -

    The ".." directory is never traversed.

    │ │ │ │ -

    The flags argument should be the same as the flags passed to the create_torrent │ │ │ │ -constructor.

    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    set_piece_hashes()

    │ │ │ │ -

    Declared in "libtorrent/create_torrent.hpp"

    │ │ │ │ -
    │ │ │ │ -void set_piece_hashes (create_torrent& t, std::string const& p
    │ │ │ │ -   , settings_interface const& settings, disk_io_constructor_type disk_io
    │ │ │ │ -   , std::function<void(piece_index_t)> const& f, error_code& ec);
    │ │ │ │ -inline void set_piece_hashes (create_torrent& t, std::string const& p, error_code& ec);
    │ │ │ │ -inline void set_piece_hashes (create_torrent& t, std::string const& p
    │ │ │ │ -   , std::function<void(piece_index_t)> const& f);
    │ │ │ │ -inline void set_piece_hashes (create_torrent& t, std::string const& p);
    │ │ │ │ -inline void set_piece_hashes (create_torrent& t, std::string const& p
    │ │ │ │ -   , settings_interface const& settings
    │ │ │ │ -   , std::function<void(piece_index_t)> const& f);
    │ │ │ │ -void set_piece_hashes (create_torrent& t, std::string const& p
    │ │ │ │ -   , settings_interface const& settings
    │ │ │ │ -   , std::function<void(piece_index_t)> const& f, error_code& ec);
    │ │ │ │ -void set_piece_hashes (create_torrent& t, std::string const& p
    │ │ │ │ -   , std::function<void(piece_index_t)> const& f, error_code& ec);
    │ │ │ │ -
    │ │ │ │ -

    This function will assume that the files added to the torrent file exists at path │ │ │ │ -p, read those files and hash the content and set the hashes in the create_torrent │ │ │ │ -object. The optional function f is called in between every hash that is set. f │ │ │ │ -must have the following signature:

    │ │ │ │ -
    │ │ │ │ -void Fun(piece_index_t);
    │ │ │ │ -
    │ │ │ │ -

    The overloads taking a settings_pack may be used to configure the │ │ │ │ -underlying disk access. Such as settings_pack::aio_threads.

    │ │ │ │ -

    The overloads that don't take an error_code& may throw an exception in case of a │ │ │ │ -file error, the other overloads sets the error code to reflect the error, if any.

    │ │ │ │ [report issue]
    │ │ │ │ +
    │ │ │ │
    │ │ │ │

    dht_storage_counters

    │ │ │ │

    Declared in "libtorrent/kademlia/dht_storage.hpp"

    │ │ │ │

    This structure hold the relevant counters for the storage

    │ │ │ │
    │ │ │ │  struct dht_storage_counters
    │ │ │ │  {
    │ │ │ │ @@ -20382,74 +20382,74 @@
    │ │ │ │  your source UDP port as your listen port, rather than the one specified in
    │ │ │ │  the message. This may improve the chances of traversing NATs when using uTP.
    │ │ │ │  
    │ │ │ │  
    │ │ │ │
    ssl_torrent
    │ │ │ │
    Specify the port number for the SSL listen socket in the DHT announce.
    │ │ │ │
    │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    read_resume_data()

    │ │ │ │ -

    Declared in "libtorrent/read_resume_data.hpp"

    │ │ │ │ -
    │ │ │ │ -add_torrent_params read_resume_data (bdecode_node const& rd
    │ │ │ │ -   , error_code& ec, int piece_limit = 0x200000);
    │ │ │ │ -add_torrent_params read_resume_data (span<char const> buffer
    │ │ │ │ -   , error_code& ec, load_torrent_limits const& cfg = {});
    │ │ │ │ -add_torrent_params read_resume_data (bdecode_node const& rd
    │ │ │ │ -   , int piece_limit = 0x200000);
    │ │ │ │ -add_torrent_params read_resume_data (span<char const> buffer
    │ │ │ │ -   , load_torrent_limits const& cfg = {});
    │ │ │ │ -
    │ │ │ │ -

    these functions are used to parse resume data and populate the appropriate │ │ │ │ -fields in an add_torrent_params object. This object can then be used to add │ │ │ │ -the actual torrent_info object to and pass to session::add_torrent() or │ │ │ │ -session::async_add_torrent().

    │ │ │ │ -

    If the client wants to override any field that was loaded from the resume │ │ │ │ -data, e.g. save_path, those fields must be changed after loading resume │ │ │ │ -data but before adding the torrent.

    │ │ │ │ -

    The piece_limit parameter determines the largest number of pieces │ │ │ │ -allowed in the torrent that may be loaded as part of the resume data, if │ │ │ │ -it contains an info field. The overloads that take a flat buffer are │ │ │ │ -instead configured with limits on torrent sizes via load_torrent limits.

    │ │ │ │ -

    In order to support large torrents, it may also be necessary to raise the │ │ │ │ -settings_pack::max_piece_count setting and pass a higher limit to calls │ │ │ │ -to torrent_info::parse_info_section().

    │ │ │ │ │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    write_resume_data() write_resume_data_buf()

    │ │ │ │

    Declared in "libtorrent/write_resume_data.hpp"

    │ │ │ │
    │ │ │ │  std::vector<char> write_resume_data_buf (add_torrent_params const& atp);
    │ │ │ │  entry write_resume_data (add_torrent_params const& atp);
    │ │ │ │  
    │ │ │ │

    this function turns the resume data in an add_torrent_params object │ │ │ │ into a bencoded structure

    │ │ │ │ - │ │ │ │ -[report issue]
    │ │ │ │ -
    │ │ │ │ -

    write_torrent_file_buf() write_torrent_file()

    │ │ │ │ + │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    write_torrent_file() write_torrent_file_buf()

    │ │ │ │

    Declared in "libtorrent/write_resume_data.hpp"

    │ │ │ │
    │ │ │ │ -entry write_torrent_file (add_torrent_params const& atp);
    │ │ │ │ +entry write_torrent_file (add_torrent_params const& atp, write_torrent_flags_t flags);
    │ │ │ │  std::vector<char> write_torrent_file_buf (add_torrent_params const& atp
    │ │ │ │     , write_torrent_flags_t flags);
    │ │ │ │ -entry write_torrent_file (add_torrent_params const& atp, write_torrent_flags_t flags);
    │ │ │ │ +entry write_torrent_file (add_torrent_params const& atp);
    │ │ │ │  
    │ │ │ │

    writes only the fields to create a .torrent file. This function may fail │ │ │ │ with a std::system_error exception if:

    │ │ │ │
      │ │ │ │
    • The add_torrent_params object passed to this function does not contain the │ │ │ │ info dictionary (the ti field)
    • │ │ │ │
    • The piece layers are not complete for all files that need them
    • │ │ │ │
    │ │ │ │

    The write_torrent_file_buf() overload returns the torrent file in │ │ │ │ bencoded buffer form. This overload may be faster at the expense of lost │ │ │ │ flexibility to add custom fields.

    │ │ │ │ +[report issue]
    │ │ │ │ +
    │ │ │ │ +

    read_resume_data()

    │ │ │ │ +

    Declared in "libtorrent/read_resume_data.hpp"

    │ │ │ │ +
    │ │ │ │ +add_torrent_params read_resume_data (span<char const> buffer
    │ │ │ │ +   , error_code& ec, load_torrent_limits const& cfg = {});
    │ │ │ │ +add_torrent_params read_resume_data (bdecode_node const& rd
    │ │ │ │ +   , int piece_limit = 0x200000);
    │ │ │ │ +add_torrent_params read_resume_data (bdecode_node const& rd
    │ │ │ │ +   , error_code& ec, int piece_limit = 0x200000);
    │ │ │ │ +add_torrent_params read_resume_data (span<char const> buffer
    │ │ │ │ +   , load_torrent_limits const& cfg = {});
    │ │ │ │ +
    │ │ │ │ +

    these functions are used to parse resume data and populate the appropriate │ │ │ │ +fields in an add_torrent_params object. This object can then be used to add │ │ │ │ +the actual torrent_info object to and pass to session::add_torrent() or │ │ │ │ +session::async_add_torrent().

    │ │ │ │ +

    If the client wants to override any field that was loaded from the resume │ │ │ │ +data, e.g. save_path, those fields must be changed after loading resume │ │ │ │ +data but before adding the torrent.

    │ │ │ │ +

    The piece_limit parameter determines the largest number of pieces │ │ │ │ +allowed in the torrent that may be loaded as part of the resume data, if │ │ │ │ +it contains an info field. The overloads that take a flat buffer are │ │ │ │ +instead configured with limits on torrent sizes via load_torrent limits.

    │ │ │ │ +

    In order to support large torrents, it may also be necessary to raise the │ │ │ │ +settings_pack::max_piece_count setting and pass a higher limit to calls │ │ │ │ +to torrent_info::parse_info_section().

    │ │ │ │ [report issue]
    │ │ │ │
    │ │ │ │

    write_torrent_flags_t

    │ │ │ │

    Declared in "libtorrent/write_resume_data.hpp"

    │ │ │ │
    │ │ │ │
    allow_missing_piece_layer
    │ │ │ │
    this makes write_torrent_file() not fail when attempting to write a │ │ │ │ ├── html2text {} │ │ │ │ │ @@ -1,225 +1,66 @@ │ │ │ │ │ > │ │ │ │ │ _[_l_i_b_t_o_r_r_e_n_t_ _l_o_g_o_] │ │ │ │ │ VVeerrssiioonn:: 2.0.11 │ │ │ │ │ _h_o_m_e │ │ │ │ │ Table of contents │ │ │ │ │ - * _p_i_e_c_e___b_l_o_c_k │ │ │ │ │ + * _s_t_o_r_a_g_e___e_r_r_o_r │ │ │ │ │ + o _b_o_o_l_(_) │ │ │ │ │ + o _f_i_l_e_(_) │ │ │ │ │ + * _i_2_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ + * _l_i_b_t_o_r_r_e_n_t___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ + * _h_t_t_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ + * _u_p_n_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ + * _g_z_i_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ + * _p_c_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ + * _s_o_c_k_s___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ + * _b_d_e_c_o_d_e___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ + * _e_n_u_m_ _i_2_p___e_r_r_o_r___c_o_d_e │ │ │ │ │ + * _e_n_u_m_ _e_r_r_o_r___c_o_d_e___e_n_u_m │ │ │ │ │ + * _e_n_u_m_ _h_t_t_p___e_r_r_o_r_s │ │ │ │ │ + * _e_n_u_m_ _e_r_r_o_r___c_o_d_e___e_n_u_m │ │ │ │ │ + * _e_n_u_m_ _e_r_r_o_r___c_o_d_e___e_n_u_m │ │ │ │ │ + * _e_n_u_m_ _p_c_p___e_r_r_o_r_s │ │ │ │ │ + * _e_n_u_m_ _s_o_c_k_s___e_r_r_o_r___c_o_d_e │ │ │ │ │ + * _e_n_u_m_ _e_r_r_o_r___c_o_d_e___e_n_u_m │ │ │ │ │ * _i_n_f_o___h_a_s_h___t │ │ │ │ │ o _i_n_f_o___h_a_s_h___t_(_) │ │ │ │ │ - o _h_a_s___v_2_(_)_ _h_a_s_(_)_ _h_a_s___v_1_(_) │ │ │ │ │ + o _h_a_s___v_1_(_)_ _h_a_s_(_)_ _h_a_s___v_2_(_) │ │ │ │ │ o _g_e_t_(_) │ │ │ │ │ o _g_e_t___b_e_s_t_(_) │ │ │ │ │ o _f_o_r___e_a_c_h_(_) │ │ │ │ │ * _p_e_e_r___i_n_f_o │ │ │ │ │ o _i_2_p___d_e_s_t_i_n_a_t_i_o_n_(_) │ │ │ │ │ * _p_e_e_r___r_e_q_u_e_s_t │ │ │ │ │ o _o_p_e_r_a_t_o_r_=_=_(_) │ │ │ │ │ + * _p_i_e_c_e___b_l_o_c_k │ │ │ │ │ + * _l_o_a_d___t_o_r_r_e_n_t___b_u_f_f_e_r_(_)_ _l_o_a_d___t_o_r_r_e_n_t___f_i_l_e_(_)_ _l_o_a_d___t_o_r_r_e_n_t___p_a_r_s_e_d_(_) │ │ │ │ │ * _t_o_r_r_e_n_t___p_e_e_r___e_q_u_a_l_(_) │ │ │ │ │ + * _v_e_r_s_i_o_n_(_) │ │ │ │ │ * _m_a_k_e___m_a_g_n_e_t___u_r_i_(_) │ │ │ │ │ * _p_a_r_s_e___m_a_g_n_e_t___u_r_i_(_) │ │ │ │ │ * _t_r_u_n_c_a_t_e___f_i_l_e_s_(_) │ │ │ │ │ - * _v_e_r_s_i_o_n_(_) │ │ │ │ │ - * _l_o_a_d___t_o_r_r_e_n_t___b_u_f_f_e_r_(_)_ _l_o_a_d___t_o_r_r_e_n_t___f_i_l_e_(_)_ _l_o_a_d___t_o_r_r_e_n_t___p_a_r_s_e_d_(_) │ │ │ │ │ * _e_n_u_m_ _p_r_o_t_o_c_o_l___v_e_r_s_i_o_n │ │ │ │ │ + * _e_n_u_m_ _c_o_n_n_e_c_t_i_o_n___t_y_p_e │ │ │ │ │ * _e_n_u_m_ _s_o_c_k_e_t___t_y_p_e___t │ │ │ │ │ + * _e_n_u_m_ _e_v_e_n_t___t │ │ │ │ │ * _e_n_u_m_ _p_o_r_t_m_a_p___t_r_a_n_s_p_o_r_t │ │ │ │ │ * _e_n_u_m_ _p_o_r_t_m_a_p___p_r_o_t_o_c_o_l │ │ │ │ │ - * _e_n_u_m_ _e_v_e_n_t___t │ │ │ │ │ - * _e_n_u_m_ _c_o_n_n_e_c_t_i_o_n___t_y_p_e │ │ │ │ │ - * _t_o_r_r_e_n_t___f_l_a_g_s___t │ │ │ │ │ - * _p_e_x___f_l_a_g_s___t │ │ │ │ │ - * _d_o_w_n_l_o_a_d___p_r_i_o_r_i_t_y___t │ │ │ │ │ * _i_n_t │ │ │ │ │ * _c_h_a_r_ _c_o_n_s_t_* │ │ │ │ │ * _s_t_d_:_:_u_i_n_t_6_4___t │ │ │ │ │ - * _b_l_o_c_k___i_n_f_o │ │ │ │ │ - o _s_e_t___p_e_e_r_(_)_ _p_e_e_r_(_) │ │ │ │ │ - o _e_n_u_m_ _b_l_o_c_k___s_t_a_t_e___t │ │ │ │ │ - * _p_a_r_t_i_a_l___p_i_e_c_e___i_n_f_o │ │ │ │ │ - * _t_o_r_r_e_n_t___h_a_n_d_l_e │ │ │ │ │ - o _t_o_r_r_e_n_t___h_a_n_d_l_e_(_) │ │ │ │ │ - o _a_d_d___p_i_e_c_e_(_) │ │ │ │ │ - o _r_e_a_d___p_i_e_c_e_(_) │ │ │ │ │ - o _h_a_v_e___p_i_e_c_e_(_) │ │ │ │ │ - o _p_o_s_t___p_e_e_r___i_n_f_o_(_)_ _g_e_t___p_e_e_r___i_n_f_o_(_) │ │ │ │ │ - o _s_t_a_t_u_s_(_)_ _p_o_s_t___s_t_a_t_u_s_(_) │ │ │ │ │ - o _g_e_t___d_o_w_n_l_o_a_d___q_u_e_u_e_(_)_ _p_o_s_t___d_o_w_n_l_o_a_d___q_u_e_u_e_(_) │ │ │ │ │ - o _s_e_t___p_i_e_c_e___d_e_a_d_l_i_n_e_(_)_ _c_l_e_a_r___p_i_e_c_e___d_e_a_d_l_i_n_e_s_(_)_ _r_e_s_e_t___p_i_e_c_e___d_e_a_d_l_i_n_e_(_) │ │ │ │ │ - o _f_i_l_e___p_r_o_g_r_e_s_s_(_)_ _p_o_s_t___f_i_l_e___p_r_o_g_r_e_s_s_(_) │ │ │ │ │ - o _f_i_l_e___s_t_a_t_u_s_(_) │ │ │ │ │ - o _c_l_e_a_r___e_r_r_o_r_(_) │ │ │ │ │ - o _t_r_a_c_k_e_r_s_(_)_ _a_d_d___t_r_a_c_k_e_r_(_)_ _r_e_p_l_a_c_e___t_r_a_c_k_e_r_s_(_)_ _p_o_s_t___t_r_a_c_k_e_r_s_(_) │ │ │ │ │ - o _a_d_d___u_r_l___s_e_e_d_(_)_ _r_e_m_o_v_e___u_r_l___s_e_e_d_(_)_ _u_r_l___s_e_e_d_s_(_) │ │ │ │ │ - o _r_e_m_o_v_e___h_t_t_p___s_e_e_d_(_)_ _a_d_d___h_t_t_p___s_e_e_d_(_)_ _h_t_t_p___s_e_e_d_s_(_) │ │ │ │ │ - o _a_d_d___e_x_t_e_n_s_i_o_n_(_) │ │ │ │ │ - o _s_e_t___m_e_t_a_d_a_t_a_(_) │ │ │ │ │ - o _i_s___v_a_l_i_d_(_) │ │ │ │ │ - o _p_a_u_s_e_(_)_ _r_e_s_u_m_e_(_) │ │ │ │ │ - o _u_n_s_e_t___f_l_a_g_s_(_)_ _s_e_t___f_l_a_g_s_(_)_ _f_l_a_g_s_(_) │ │ │ │ │ - o _f_l_u_s_h___c_a_c_h_e_(_) │ │ │ │ │ - o _f_o_r_c_e___r_e_c_h_e_c_k_(_) │ │ │ │ │ - o _s_a_v_e___r_e_s_u_m_e___d_a_t_a_(_) │ │ │ │ │ - o _n_e_e_d___s_a_v_e___r_e_s_u_m_e___d_a_t_a_(_) │ │ │ │ │ - o _q_u_e_u_e___p_o_s_i_t_i_o_n___t_o_p_(_)_ _q_u_e_u_e___p_o_s_i_t_i_o_n___u_p_(_)_ _q_u_e_u_e___p_o_s_i_t_i_o_n_(_) │ │ │ │ │ - _q_u_e_u_e___p_o_s_i_t_i_o_n___d_o_w_n_(_)_ _q_u_e_u_e___p_o_s_i_t_i_o_n___b_o_t_t_o_m_(_) │ │ │ │ │ - o _q_u_e_u_e___p_o_s_i_t_i_o_n___s_e_t_(_) │ │ │ │ │ - o _s_e_t___s_s_l___c_e_r_t_i_f_i_c_a_t_e___b_u_f_f_e_r_(_)_ _s_e_t___s_s_l___c_e_r_t_i_f_i_c_a_t_e_(_) │ │ │ │ │ - o _t_o_r_r_e_n_t___f_i_l_e___w_i_t_h___h_a_s_h_e_s_(_)_ _t_o_r_r_e_n_t___f_i_l_e_(_) │ │ │ │ │ - o _p_i_e_c_e___l_a_y_e_r_s_(_) │ │ │ │ │ - o _p_i_e_c_e___a_v_a_i_l_a_b_i_l_i_t_y_(_)_ _p_o_s_t___p_i_e_c_e___a_v_a_i_l_a_b_i_l_i_t_y_(_) │ │ │ │ │ - o _p_r_i_o_r_i_t_i_z_e___p_i_e_c_e_s_(_)_ _p_i_e_c_e___p_r_i_o_r_i_t_y_(_)_ _g_e_t___p_i_e_c_e___p_r_i_o_r_i_t_i_e_s_(_) │ │ │ │ │ - o _f_i_l_e___p_r_i_o_r_i_t_y_(_)_ _g_e_t___f_i_l_e___p_r_i_o_r_i_t_i_e_s_(_)_ _p_r_i_o_r_i_t_i_z_e___f_i_l_e_s_(_) │ │ │ │ │ - o _f_o_r_c_e___d_h_t___a_n_n_o_u_n_c_e_(_)_ _f_o_r_c_e___r_e_a_n_n_o_u_n_c_e_(_)_ _f_o_r_c_e___l_s_d___a_n_n_o_u_n_c_e_(_) │ │ │ │ │ - o _s_c_r_a_p_e___t_r_a_c_k_e_r_(_) │ │ │ │ │ - o _d_o_w_n_l_o_a_d___l_i_m_i_t_(_)_ _s_e_t___d_o_w_n_l_o_a_d___l_i_m_i_t_(_)_ _u_p_l_o_a_d___l_i_m_i_t_(_) │ │ │ │ │ - _s_e_t___u_p_l_o_a_d___l_i_m_i_t_(_) │ │ │ │ │ - o _c_o_n_n_e_c_t___p_e_e_r_(_) │ │ │ │ │ - o _c_l_e_a_r___p_e_e_r_s_(_) │ │ │ │ │ - o _m_a_x___u_p_l_o_a_d_s_(_)_ _s_e_t___m_a_x___u_p_l_o_a_d_s_(_) │ │ │ │ │ - o _s_e_t___m_a_x___c_o_n_n_e_c_t_i_o_n_s_(_)_ _m_a_x___c_o_n_n_e_c_t_i_o_n_s_(_) │ │ │ │ │ - o _m_o_v_e___s_t_o_r_a_g_e_(_) │ │ │ │ │ - o _r_e_n_a_m_e___f_i_l_e_(_) │ │ │ │ │ - o _i_n_f_o___h_a_s_h_(_)_ _i_n_f_o___h_a_s_h_e_s_(_) │ │ │ │ │ - o _o_p_e_r_a_t_o_r_!_=_(_)_ _o_p_e_r_a_t_o_r_<_(_)_ _o_p_e_r_a_t_o_r_=_=_(_) │ │ │ │ │ - o _i_d_(_) │ │ │ │ │ - o _n_a_t_i_v_e___h_a_n_d_l_e_(_) │ │ │ │ │ - o _u_s_e_r_d_a_t_a_(_) │ │ │ │ │ - o _i_n___s_e_s_s_i_o_n_(_) │ │ │ │ │ - * _h_a_s_h___v_a_l_u_e_(_) │ │ │ │ │ - * _w_e_b___s_e_e_d___e_n_t_r_y │ │ │ │ │ - o _o_p_e_r_a_t_o_r_=_=_(_) │ │ │ │ │ - o _o_p_e_r_a_t_o_r_<_(_) │ │ │ │ │ - o _e_n_u_m_ _t_y_p_e___t │ │ │ │ │ - * _l_o_a_d___t_o_r_r_e_n_t___l_i_m_i_t_s │ │ │ │ │ - * _t_o_r_r_e_n_t___i_n_f_o │ │ │ │ │ - o _t_o_r_r_e_n_t___i_n_f_o_(_) │ │ │ │ │ - o _~_t_o_r_r_e_n_t___i_n_f_o_(_) │ │ │ │ │ - o _o_r_i_g___f_i_l_e_s_(_)_ _f_i_l_e_s_(_) │ │ │ │ │ - o _r_e_n_a_m_e___f_i_l_e_(_) │ │ │ │ │ - o _r_e_m_a_p___f_i_l_e_s_(_) │ │ │ │ │ - o _t_r_a_c_k_e_r_s_(_)_ _a_d_d___t_r_a_c_k_e_r_(_)_ _c_l_e_a_r___t_r_a_c_k_e_r_s_(_) │ │ │ │ │ - o _s_i_m_i_l_a_r___t_o_r_r_e_n_t_s_(_)_ _c_o_l_l_e_c_t_i_o_n_s_(_) │ │ │ │ │ - o _s_e_t___w_e_b___s_e_e_d_s_(_)_ _w_e_b___s_e_e_d_s_(_)_ _a_d_d___u_r_l___s_e_e_d_(_)_ _a_d_d___h_t_t_p___s_e_e_d_(_) │ │ │ │ │ - o _t_o_t_a_l___s_i_z_e_(_) │ │ │ │ │ - o _p_i_e_c_e___l_e_n_g_t_h_(_)_ _n_u_m___p_i_e_c_e_s_(_) │ │ │ │ │ - o _b_l_o_c_k_s___p_e_r___p_i_e_c_e_(_) │ │ │ │ │ - o _l_a_s_t___p_i_e_c_e_(_)_ _p_i_e_c_e___r_a_n_g_e_(_)_ _e_n_d___p_i_e_c_e_(_) │ │ │ │ │ - o _i_n_f_o___h_a_s_h_(_)_ _i_n_f_o___h_a_s_h_e_s_(_) │ │ │ │ │ - o _v_1_(_)_ _v_2_(_) │ │ │ │ │ - o _n_u_m___f_i_l_e_s_(_) │ │ │ │ │ - o _m_a_p___b_l_o_c_k_(_) │ │ │ │ │ - o _m_a_p___f_i_l_e_(_) │ │ │ │ │ - o _s_s_l___c_e_r_t_(_) │ │ │ │ │ - o _i_s___v_a_l_i_d_(_) │ │ │ │ │ - o _p_r_i_v_(_) │ │ │ │ │ - o _i_s___i_2_p_(_) │ │ │ │ │ - o _p_i_e_c_e___s_i_z_e_(_) │ │ │ │ │ - o _h_a_s_h___f_o_r___p_i_e_c_e___p_t_r_(_)_ _h_a_s_h___f_o_r___p_i_e_c_e_(_) │ │ │ │ │ - o _n_a_m_e_(_) │ │ │ │ │ - o _c_r_e_a_t_i_o_n___d_a_t_e_(_) │ │ │ │ │ - o _c_r_e_a_t_o_r_(_) │ │ │ │ │ - o _c_o_m_m_e_n_t_(_) │ │ │ │ │ - o _n_o_d_e_s_(_) │ │ │ │ │ - o _a_d_d___n_o_d_e_(_) │ │ │ │ │ - o _p_a_r_s_e___i_n_f_o___s_e_c_t_i_o_n_(_) │ │ │ │ │ - o _i_n_f_o_(_) │ │ │ │ │ - o _i_n_f_o___s_e_c_t_i_o_n_(_) │ │ │ │ │ - o _p_i_e_c_e___l_a_y_e_r_(_) │ │ │ │ │ - o _f_r_e_e___p_i_e_c_e___l_a_y_e_r_s_(_) │ │ │ │ │ - * _h_a_s_h_e_r │ │ │ │ │ - o _h_a_s_h_e_r_(_)_ _o_p_e_r_a_t_o_r_=_(_) │ │ │ │ │ - o _u_p_d_a_t_e_(_) │ │ │ │ │ - o _f_i_n_a_l_(_) │ │ │ │ │ - o _r_e_s_e_t_(_) │ │ │ │ │ - * _h_a_s_h_e_r_2_5_6 │ │ │ │ │ - o _h_a_s_h_e_r_2_5_6_(_)_ _o_p_e_r_a_t_o_r_=_(_) │ │ │ │ │ - o _u_p_d_a_t_e_(_) │ │ │ │ │ - o _f_i_n_a_l_(_) │ │ │ │ │ - o _r_e_s_e_t_(_) │ │ │ │ │ - * _b_i_t_f_i_e_l_d │ │ │ │ │ - o _b_i_t_f_i_e_l_d_(_) │ │ │ │ │ - o _a_s_s_i_g_n_(_) │ │ │ │ │ - o _g_e_t___b_i_t_(_)_ _o_p_e_r_a_t_o_r_[_]_(_) │ │ │ │ │ - o _s_e_t___b_i_t_(_)_ _c_l_e_a_r___b_i_t_(_) │ │ │ │ │ - o _a_l_l___s_e_t_(_) │ │ │ │ │ - o _n_o_n_e___s_e_t_(_) │ │ │ │ │ - o _s_i_z_e_(_) │ │ │ │ │ - o _n_u_m___w_o_r_d_s_(_) │ │ │ │ │ - o _n_u_m___b_y_t_e_s_(_) │ │ │ │ │ - o _e_m_p_t_y_(_) │ │ │ │ │ - o _d_a_t_a_(_) │ │ │ │ │ - o _s_w_a_p_(_) │ │ │ │ │ - o _c_o_u_n_t_(_) │ │ │ │ │ - o _f_i_n_d___f_i_r_s_t___s_e_t_(_) │ │ │ │ │ - o _f_i_n_d___l_a_s_t___c_l_e_a_r_(_) │ │ │ │ │ - * _s_e_s_s_i_o_n___p_r_o_x_y │ │ │ │ │ - o _s_e_s_s_i_o_n___p_r_o_x_y_(_)_ _~_s_e_s_s_i_o_n___p_r_o_x_y_(_)_ _o_p_e_r_a_t_o_r_=_(_) │ │ │ │ │ - * _s_e_s_s_i_o_n │ │ │ │ │ - o _s_e_s_s_i_o_n_(_) │ │ │ │ │ - o _s_e_s_s_i_o_n_(_) │ │ │ │ │ - o _~_s_e_s_s_i_o_n_(_) │ │ │ │ │ - o _a_b_o_r_t_(_) │ │ │ │ │ - * _s_e_s_s_i_o_n___p_a_r_a_m_s │ │ │ │ │ - o _s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ - o _s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ - * _s_e_s_s_i_o_n___h_a_n_d_l_e │ │ │ │ │ - o _i_s___v_a_l_i_d_(_) │ │ │ │ │ - o _s_e_s_s_i_o_n___s_t_a_t_e_(_) │ │ │ │ │ - o _g_e_t___t_o_r_r_e_n_t___s_t_a_t_u_s_(_)_ _r_e_f_r_e_s_h___t_o_r_r_e_n_t___s_t_a_t_u_s_(_) │ │ │ │ │ - o _p_o_s_t___t_o_r_r_e_n_t___u_p_d_a_t_e_s_(_) │ │ │ │ │ - o _p_o_s_t___s_e_s_s_i_o_n___s_t_a_t_s_(_) │ │ │ │ │ - o _p_o_s_t___d_h_t___s_t_a_t_s_(_) │ │ │ │ │ - o _s_e_t___d_h_t___s_t_a_t_e_(_) │ │ │ │ │ - o _g_e_t___t_o_r_r_e_n_t_s_(_)_ _f_i_n_d___t_o_r_r_e_n_t_(_) │ │ │ │ │ - o _a_s_y_n_c___a_d_d___t_o_r_r_e_n_t_(_)_ _a_d_d___t_o_r_r_e_n_t_(_) │ │ │ │ │ - o _p_a_u_s_e_(_)_ _r_e_s_u_m_e_(_)_ _i_s___p_a_u_s_e_d_(_) │ │ │ │ │ - o _i_s___d_h_t___r_u_n_n_i_n_g_(_) │ │ │ │ │ - o _s_e_t___d_h_t___s_t_o_r_a_g_e_(_) │ │ │ │ │ - o _a_d_d___d_h_t___n_o_d_e_(_) │ │ │ │ │ - o _d_h_t___g_e_t___i_t_e_m_(_) │ │ │ │ │ - o _d_h_t___g_e_t___i_t_e_m_(_) │ │ │ │ │ - o _d_h_t___p_u_t___i_t_e_m_(_) │ │ │ │ │ - o _d_h_t___p_u_t___i_t_e_m_(_) │ │ │ │ │ - o _d_h_t___a_n_n_o_u_n_c_e_(_)_ _d_h_t___g_e_t___p_e_e_r_s_(_) │ │ │ │ │ - o _d_h_t___l_i_v_e___n_o_d_e_s_(_) │ │ │ │ │ - o _d_h_t___s_a_m_p_l_e___i_n_f_o_h_a_s_h_e_s_(_) │ │ │ │ │ - o _d_h_t___d_i_r_e_c_t___r_e_q_u_e_s_t_(_) │ │ │ │ │ - o _a_d_d___e_x_t_e_n_s_i_o_n_(_) │ │ │ │ │ - o _s_e_t___i_p___f_i_l_t_e_r_(_)_ _g_e_t___i_p___f_i_l_t_e_r_(_) │ │ │ │ │ - o _s_e_t___p_o_r_t___f_i_l_t_e_r_(_) │ │ │ │ │ - o _s_s_l___l_i_s_t_e_n___p_o_r_t_(_)_ _l_i_s_t_e_n___p_o_r_t_(_)_ _i_s___l_i_s_t_e_n_i_n_g_(_) │ │ │ │ │ - o _g_e_t___p_e_e_r___c_l_a_s_s___f_i_l_t_e_r_(_)_ _s_e_t___p_e_e_r___c_l_a_s_s___f_i_l_t_e_r_(_) │ │ │ │ │ - o _s_e_t___p_e_e_r___c_l_a_s_s___t_y_p_e___f_i_l_t_e_r_(_)_ _g_e_t___p_e_e_r___c_l_a_s_s___t_y_p_e___f_i_l_t_e_r_(_) │ │ │ │ │ - o _c_r_e_a_t_e___p_e_e_r___c_l_a_s_s_(_) │ │ │ │ │ - o _d_e_l_e_t_e___p_e_e_r___c_l_a_s_s_(_) │ │ │ │ │ - o _s_e_t___p_e_e_r___c_l_a_s_s_(_)_ _g_e_t___p_e_e_r___c_l_a_s_s_(_) │ │ │ │ │ - o _r_e_m_o_v_e___t_o_r_r_e_n_t_(_) │ │ │ │ │ - o _a_p_p_l_y___s_e_t_t_i_n_g_s_(_)_ _g_e_t___s_e_t_t_i_n_g_s_(_) │ │ │ │ │ - o _p_o_p___a_l_e_r_t_s_(_)_ _w_a_i_t___f_o_r___a_l_e_r_t_(_)_ _s_e_t___a_l_e_r_t___n_o_t_i_f_y_(_) │ │ │ │ │ - o _a_d_d___p_o_r_t___m_a_p_p_i_n_g_(_)_ _d_e_l_e_t_e___p_o_r_t___m_a_p_p_i_n_g_(_) │ │ │ │ │ - o _r_e_o_p_e_n___n_e_t_w_o_r_k___s_o_c_k_e_t_s_(_) │ │ │ │ │ - o _n_a_t_i_v_e___h_a_n_d_l_e_(_) │ │ │ │ │ - * _w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s___b_u_f_(_)_ _w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s_(_)_ _r_e_a_d___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ + * _t_o_r_r_e_n_t___f_l_a_g_s___t │ │ │ │ │ + * _d_o_w_n_l_o_a_d___p_r_i_o_r_i_t_y___t │ │ │ │ │ + * _p_e_x___f_l_a_g_s___t │ │ │ │ │ * _s_t_a_t_s___m_e_t_r_i_c │ │ │ │ │ * _c_o_u_n_t_e_r_s │ │ │ │ │ - o _i_n_c___s_t_a_t_s___c_o_u_n_t_e_r_(_)_ _o_p_e_r_a_t_o_r_[_]_(_) │ │ │ │ │ + o _o_p_e_r_a_t_o_r_[_]_(_)_ _i_n_c___s_t_a_t_s___c_o_u_n_t_e_r_(_) │ │ │ │ │ * _s_e_s_s_i_o_n___s_t_a_t_s___m_e_t_r_i_c_s_(_) │ │ │ │ │ * _f_i_n_d___m_e_t_r_i_c___i_d_x_(_) │ │ │ │ │ * _e_n_u_m_ _m_e_t_r_i_c___t_y_p_e___t │ │ │ │ │ - * _i_p___f_i_l_t_e_r │ │ │ │ │ - o _e_m_p_t_y_(_) │ │ │ │ │ - o _a_d_d___r_u_l_e_(_) │ │ │ │ │ - o _a_c_c_e_s_s_(_) │ │ │ │ │ - o _e_x_p_o_r_t___f_i_l_t_e_r_(_) │ │ │ │ │ - o _e_n_u_m_ _a_c_c_e_s_s___f_l_a_g_s │ │ │ │ │ - * _p_o_r_t___f_i_l_t_e_r │ │ │ │ │ - o _a_d_d___r_u_l_e_(_) │ │ │ │ │ - o _a_c_c_e_s_s_(_) │ │ │ │ │ - o _e_n_u_m_ _a_c_c_e_s_s___f_l_a_g_s │ │ │ │ │ * _c_l_i_e_n_t___d_a_t_a___t │ │ │ │ │ o _c_l_i_e_n_t___d_a_t_a___t_(_) │ │ │ │ │ o _c_o_n_s_t_*_(_)_ _o_p_e_r_a_t_o_r_=_(_)_ _v_o_i_d_*_(_) │ │ │ │ │ * _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s │ │ │ │ │ * _a_n_n_o_u_n_c_e___i_n_f_o_h_a_s_h │ │ │ │ │ * _a_n_n_o_u_n_c_e___e_n_d_p_o_i_n_t │ │ │ │ │ * _a_n_n_o_u_n_c_e___e_n_t_r_y │ │ │ │ │ @@ -269,15 +110,15 @@ │ │ │ │ │ * _p_i_e_c_e___f_i_n_i_s_h_e_d___a_l_e_r_t │ │ │ │ │ * _r_e_q_u_e_s_t___d_r_o_p_p_e_d___a_l_e_r_t │ │ │ │ │ * _b_l_o_c_k___t_i_m_e_o_u_t___a_l_e_r_t │ │ │ │ │ * _b_l_o_c_k___f_i_n_i_s_h_e_d___a_l_e_r_t │ │ │ │ │ * _b_l_o_c_k___d_o_w_n_l_o_a_d_i_n_g___a_l_e_r_t │ │ │ │ │ * _u_n_w_a_n_t_e_d___b_l_o_c_k___a_l_e_r_t │ │ │ │ │ * _s_t_o_r_a_g_e___m_o_v_e_d___a_l_e_r_t │ │ │ │ │ - o _o_l_d___p_a_t_h_(_)_ _s_t_o_r_a_g_e___p_a_t_h_(_) │ │ │ │ │ + o _s_t_o_r_a_g_e___p_a_t_h_(_)_ _o_l_d___p_a_t_h_(_) │ │ │ │ │ * _s_t_o_r_a_g_e___m_o_v_e_d___f_a_i_l_e_d___a_l_e_r_t │ │ │ │ │ o _f_i_l_e___p_a_t_h_(_) │ │ │ │ │ * _t_o_r_r_e_n_t___d_e_l_e_t_e_d___a_l_e_r_t │ │ │ │ │ * _t_o_r_r_e_n_t___d_e_l_e_t_e___f_a_i_l_e_d___a_l_e_r_t │ │ │ │ │ * _s_a_v_e___r_e_s_u_m_e___d_a_t_a___a_l_e_r_t │ │ │ │ │ * _s_a_v_e___r_e_s_u_m_e___d_a_t_a___f_a_i_l_e_d___a_l_e_r_t │ │ │ │ │ * _t_o_r_r_e_n_t___p_a_u_s_e_d___a_l_e_r_t │ │ │ │ │ @@ -345,83 +186,164 @@ │ │ │ │ │ * _d_h_t___d_i_r_e_c_t___r_e_s_p_o_n_s_e___a_l_e_r_t │ │ │ │ │ * _p_i_c_k_e_r___l_o_g___a_l_e_r_t │ │ │ │ │ * _s_e_s_s_i_o_n___e_r_r_o_r___a_l_e_r_t │ │ │ │ │ * _d_h_t___l_i_v_e___n_o_d_e_s___a_l_e_r_t │ │ │ │ │ o _n_o_d_e_s_(_)_ _n_u_m___n_o_d_e_s_(_) │ │ │ │ │ * _s_e_s_s_i_o_n___s_t_a_t_s___h_e_a_d_e_r___a_l_e_r_t │ │ │ │ │ * _d_h_t___s_a_m_p_l_e___i_n_f_o_h_a_s_h_e_s___a_l_e_r_t │ │ │ │ │ - o _s_a_m_p_l_e_s_(_)_ _n_u_m___s_a_m_p_l_e_s_(_) │ │ │ │ │ + o _n_u_m___s_a_m_p_l_e_s_(_)_ _s_a_m_p_l_e_s_(_) │ │ │ │ │ o _n_u_m___n_o_d_e_s_(_) │ │ │ │ │ o _n_o_d_e_s_(_) │ │ │ │ │ * _b_l_o_c_k___u_p_l_o_a_d_e_d___a_l_e_r_t │ │ │ │ │ * _a_l_e_r_t_s___d_r_o_p_p_e_d___a_l_e_r_t │ │ │ │ │ * _s_o_c_k_s_5___a_l_e_r_t │ │ │ │ │ * _f_i_l_e___p_r_i_o___a_l_e_r_t │ │ │ │ │ * _o_v_e_r_s_i_z_e_d___f_i_l_e___a_l_e_r_t │ │ │ │ │ * _t_o_r_r_e_n_t___c_o_n_f_l_i_c_t___a_l_e_r_t │ │ │ │ │ * _p_e_e_r___i_n_f_o___a_l_e_r_t │ │ │ │ │ * _f_i_l_e___p_r_o_g_r_e_s_s___a_l_e_r_t │ │ │ │ │ * _p_i_e_c_e___i_n_f_o___a_l_e_r_t │ │ │ │ │ * _p_i_e_c_e___a_v_a_i_l_a_b_i_l_i_t_y___a_l_e_r_t │ │ │ │ │ * _t_r_a_c_k_e_r___l_i_s_t___a_l_e_r_t │ │ │ │ │ - * _a_l_e_r_t___c_a_s_t_(_) │ │ │ │ │ * _o_p_e_r_a_t_i_o_n___n_a_m_e_(_) │ │ │ │ │ + * _a_l_e_r_t___c_a_s_t_(_) │ │ │ │ │ * _e_n_u_m_ _o_p_e_r_a_t_i_o_n___t │ │ │ │ │ * _a_l_e_r_t___c_a_t_e_g_o_r_y___t │ │ │ │ │ * _i_n_t │ │ │ │ │ + * _d_i_s_k___o_b_s_e_r_v_e_r │ │ │ │ │ + o _o_n___d_i_s_k_(_) │ │ │ │ │ + * _o_p_e_n___f_i_l_e___s_t_a_t_e │ │ │ │ │ + * _d_i_s_k___i_n_t_e_r_f_a_c_e │ │ │ │ │ + o _n_e_w___t_o_r_r_e_n_t_(_) │ │ │ │ │ + o _r_e_m_o_v_e___t_o_r_r_e_n_t_(_) │ │ │ │ │ + o _a_s_y_n_c___w_r_i_t_e_(_)_ _a_s_y_n_c___r_e_a_d_(_) │ │ │ │ │ + o _a_s_y_n_c___h_a_s_h_(_) │ │ │ │ │ + o _a_s_y_n_c___h_a_s_h_2_(_) │ │ │ │ │ + o _a_s_y_n_c___m_o_v_e___s_t_o_r_a_g_e_(_) │ │ │ │ │ + o _a_s_y_n_c___r_e_l_e_a_s_e___f_i_l_e_s_(_) │ │ │ │ │ + o _a_s_y_n_c___c_h_e_c_k___f_i_l_e_s_(_) │ │ │ │ │ + o _a_s_y_n_c___s_t_o_p___t_o_r_r_e_n_t_(_) │ │ │ │ │ + o _a_s_y_n_c___r_e_n_a_m_e___f_i_l_e_(_) │ │ │ │ │ + o _a_s_y_n_c___d_e_l_e_t_e___f_i_l_e_s_(_) │ │ │ │ │ + o _a_s_y_n_c___s_e_t___f_i_l_e___p_r_i_o_r_i_t_y_(_) │ │ │ │ │ + o _a_s_y_n_c___c_l_e_a_r___p_i_e_c_e_(_) │ │ │ │ │ + o _u_p_d_a_t_e___s_t_a_t_s___c_o_u_n_t_e_r_s_(_) │ │ │ │ │ + o _g_e_t___s_t_a_t_u_s_(_) │ │ │ │ │ + o _a_b_o_r_t_(_) │ │ │ │ │ + o _s_u_b_m_i_t___j_o_b_s_(_) │ │ │ │ │ + o _s_e_t_t_i_n_g_s___u_p_d_a_t_e_d_(_) │ │ │ │ │ + * _s_t_o_r_a_g_e___h_o_l_d_e_r │ │ │ │ │ + * _b_u_f_f_e_r___a_l_l_o_c_a_t_o_r___i_n_t_e_r_f_a_c_e │ │ │ │ │ + * _d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r │ │ │ │ │ + o _d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r_(_) │ │ │ │ │ + o _d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r_(_) │ │ │ │ │ + o _~_d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r_(_) │ │ │ │ │ + o _d_a_t_a_(_) │ │ │ │ │ + o _r_e_s_e_t_(_) │ │ │ │ │ + o _s_w_a_p_(_) │ │ │ │ │ + o _i_s___m_u_t_a_b_l_e_(_) │ │ │ │ │ + o _b_o_o_l_(_) │ │ │ │ │ + * _s_e_t_t_i_n_g_s___i_n_t_e_r_f_a_c_e │ │ │ │ │ + * _f_i_l_e___o_p_e_n___m_o_d_e___t │ │ │ │ │ * _s_t_o_r_a_g_e___p_a_r_a_m_s │ │ │ │ │ * _f_i_l_e___s_l_i_c_e │ │ │ │ │ * _f_i_l_e___s_t_o_r_a_g_e │ │ │ │ │ o _i_s___v_a_l_i_d_(_) │ │ │ │ │ o _r_e_s_e_r_v_e_(_) │ │ │ │ │ - o _a_d_d___f_i_l_e_(_)_ _a_d_d___f_i_l_e___b_o_r_r_o_w_(_) │ │ │ │ │ + o _a_d_d___f_i_l_e___b_o_r_r_o_w_(_)_ _a_d_d___f_i_l_e_(_) │ │ │ │ │ o _r_e_n_a_m_e___f_i_l_e_(_) │ │ │ │ │ o _m_a_p___b_l_o_c_k_(_) │ │ │ │ │ o _m_a_p___f_i_l_e_(_) │ │ │ │ │ o _n_u_m___f_i_l_e_s_(_) │ │ │ │ │ o _e_n_d___f_i_l_e_(_) │ │ │ │ │ o _f_i_l_e___r_a_n_g_e_(_) │ │ │ │ │ o _t_o_t_a_l___s_i_z_e_(_) │ │ │ │ │ - o _s_e_t___n_u_m___p_i_e_c_e_s_(_)_ _n_u_m___p_i_e_c_e_s_(_) │ │ │ │ │ + o _n_u_m___p_i_e_c_e_s_(_)_ _s_e_t___n_u_m___p_i_e_c_e_s_(_) │ │ │ │ │ o _e_n_d___p_i_e_c_e_(_) │ │ │ │ │ o _l_a_s_t___p_i_e_c_e_(_) │ │ │ │ │ o _p_i_e_c_e___r_a_n_g_e_(_) │ │ │ │ │ o _s_e_t___p_i_e_c_e___l_e_n_g_t_h_(_)_ _p_i_e_c_e___l_e_n_g_t_h_(_) │ │ │ │ │ o _p_i_e_c_e___s_i_z_e_(_) │ │ │ │ │ o _p_i_e_c_e___s_i_z_e_2_(_) │ │ │ │ │ o _b_l_o_c_k_s___i_n___p_i_e_c_e_2_(_) │ │ │ │ │ o _b_l_o_c_k_s___p_e_r___p_i_e_c_e_(_) │ │ │ │ │ o _s_e_t___n_a_m_e_(_)_ _n_a_m_e_(_) │ │ │ │ │ o _s_w_a_p_(_) │ │ │ │ │ o _c_a_n_o_n_i_c_a_l_i_z_e_(_) │ │ │ │ │ - o _p_a_d___f_i_l_e___a_t_(_)_ _r_o_o_t___p_t_r_(_)_ _f_i_l_e___o_f_f_s_e_t_(_)_ _r_o_o_t_(_)_ _f_i_l_e___s_i_z_e_(_)_ _s_y_m_l_i_n_k_(_) │ │ │ │ │ - _h_a_s_h_(_)_ _f_i_l_e___n_a_m_e_(_)_ _m_t_i_m_e_(_)_ _f_i_l_e___p_a_t_h_(_) │ │ │ │ │ - o _f_i_l_e___n_u_m___b_l_o_c_k_s_(_)_ _f_i_l_e___p_i_e_c_e___r_a_n_g_e_(_)_ _f_i_l_e___n_u_m___p_i_e_c_e_s_(_) │ │ │ │ │ + o _f_i_l_e___o_f_f_s_e_t_(_)_ _m_t_i_m_e_(_)_ _r_o_o_t___p_t_r_(_)_ _f_i_l_e___s_i_z_e_(_)_ _h_a_s_h_(_)_ _f_i_l_e___p_a_t_h_(_) │ │ │ │ │ + _p_a_d___f_i_l_e___a_t_(_)_ _f_i_l_e___n_a_m_e_(_)_ _r_o_o_t_(_)_ _s_y_m_l_i_n_k_(_) │ │ │ │ │ + o _f_i_l_e___p_i_e_c_e___r_a_n_g_e_(_)_ _f_i_l_e___n_u_m___b_l_o_c_k_s_(_)_ _f_i_l_e___n_u_m___p_i_e_c_e_s_(_) │ │ │ │ │ o _f_i_l_e___f_i_r_s_t___b_l_o_c_k___n_o_d_e_(_)_ _f_i_l_e___f_i_r_s_t___p_i_e_c_e___n_o_d_e_(_) │ │ │ │ │ o _f_i_l_e___p_a_t_h___h_a_s_h_(_) │ │ │ │ │ o _a_l_l___p_a_t_h___h_a_s_h_e_s_(_) │ │ │ │ │ o _f_i_l_e___f_l_a_g_s_(_) │ │ │ │ │ o _f_i_l_e___a_b_s_o_l_u_t_e___p_a_t_h_(_) │ │ │ │ │ o _f_i_l_e___i_n_d_e_x___a_t___o_f_f_s_e_t_(_)_ _f_i_l_e___i_n_d_e_x___a_t___p_i_e_c_e_(_) │ │ │ │ │ o _f_i_l_e___i_n_d_e_x___f_o_r___r_o_o_t_(_) │ │ │ │ │ o _p_i_e_c_e___i_n_d_e_x___a_t___f_i_l_e_(_) │ │ │ │ │ o _s_a_n_i_t_i_z_e___s_y_m_l_i_n_k_s_(_) │ │ │ │ │ o _v_2_(_) │ │ │ │ │ + * _m_m_a_p___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ * _d_e_f_a_u_l_t___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ - * _p_o_s_i_x___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ * _d_i_s_a_b_l_e_d___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ - * _m_m_a_p___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ + * _p_o_s_i_x___d_i_s_k___i_o___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ * _e_n_u_m_ _s_t_o_r_a_g_e___m_o_d_e___t │ │ │ │ │ * _e_n_u_m_ _s_t_a_t_u_s___t │ │ │ │ │ * _e_n_u_m_ _m_o_v_e___f_l_a_g_s___t │ │ │ │ │ + * _s_e_s_s_i_o_n___p_r_o_x_y │ │ │ │ │ + o _~_s_e_s_s_i_o_n___p_r_o_x_y_(_)_ _s_e_s_s_i_o_n___p_r_o_x_y_(_)_ _o_p_e_r_a_t_o_r_=_(_) │ │ │ │ │ + * _s_e_s_s_i_o_n │ │ │ │ │ + o _s_e_s_s_i_o_n_(_) │ │ │ │ │ + o _s_e_s_s_i_o_n_(_) │ │ │ │ │ + o _~_s_e_s_s_i_o_n_(_) │ │ │ │ │ + o _a_b_o_r_t_(_) │ │ │ │ │ + * _s_e_s_s_i_o_n___h_a_n_d_l_e │ │ │ │ │ + o _i_s___v_a_l_i_d_(_) │ │ │ │ │ + o _s_e_s_s_i_o_n___s_t_a_t_e_(_) │ │ │ │ │ + o _g_e_t___t_o_r_r_e_n_t___s_t_a_t_u_s_(_)_ _r_e_f_r_e_s_h___t_o_r_r_e_n_t___s_t_a_t_u_s_(_) │ │ │ │ │ + o _p_o_s_t___t_o_r_r_e_n_t___u_p_d_a_t_e_s_(_) │ │ │ │ │ + o _p_o_s_t___s_e_s_s_i_o_n___s_t_a_t_s_(_) │ │ │ │ │ + o _p_o_s_t___d_h_t___s_t_a_t_s_(_) │ │ │ │ │ + o _s_e_t___d_h_t___s_t_a_t_e_(_) │ │ │ │ │ + o _f_i_n_d___t_o_r_r_e_n_t_(_)_ _g_e_t___t_o_r_r_e_n_t_s_(_) │ │ │ │ │ + o _a_d_d___t_o_r_r_e_n_t_(_)_ _a_s_y_n_c___a_d_d___t_o_r_r_e_n_t_(_) │ │ │ │ │ + o _r_e_s_u_m_e_(_)_ _p_a_u_s_e_(_)_ _i_s___p_a_u_s_e_d_(_) │ │ │ │ │ + o _i_s___d_h_t___r_u_n_n_i_n_g_(_) │ │ │ │ │ + o _s_e_t___d_h_t___s_t_o_r_a_g_e_(_) │ │ │ │ │ + o _a_d_d___d_h_t___n_o_d_e_(_) │ │ │ │ │ + o _d_h_t___g_e_t___i_t_e_m_(_) │ │ │ │ │ + o _d_h_t___g_e_t___i_t_e_m_(_) │ │ │ │ │ + o _d_h_t___p_u_t___i_t_e_m_(_) │ │ │ │ │ + o _d_h_t___p_u_t___i_t_e_m_(_) │ │ │ │ │ + o _d_h_t___a_n_n_o_u_n_c_e_(_)_ _d_h_t___g_e_t___p_e_e_r_s_(_) │ │ │ │ │ + o _d_h_t___l_i_v_e___n_o_d_e_s_(_) │ │ │ │ │ + o _d_h_t___s_a_m_p_l_e___i_n_f_o_h_a_s_h_e_s_(_) │ │ │ │ │ + o _d_h_t___d_i_r_e_c_t___r_e_q_u_e_s_t_(_) │ │ │ │ │ + o _a_d_d___e_x_t_e_n_s_i_o_n_(_) │ │ │ │ │ + o _s_e_t___i_p___f_i_l_t_e_r_(_)_ _g_e_t___i_p___f_i_l_t_e_r_(_) │ │ │ │ │ + o _s_e_t___p_o_r_t___f_i_l_t_e_r_(_) │ │ │ │ │ + o _s_s_l___l_i_s_t_e_n___p_o_r_t_(_)_ _l_i_s_t_e_n___p_o_r_t_(_)_ _i_s___l_i_s_t_e_n_i_n_g_(_) │ │ │ │ │ + o _g_e_t___p_e_e_r___c_l_a_s_s___f_i_l_t_e_r_(_)_ _s_e_t___p_e_e_r___c_l_a_s_s___f_i_l_t_e_r_(_) │ │ │ │ │ + o _g_e_t___p_e_e_r___c_l_a_s_s___t_y_p_e___f_i_l_t_e_r_(_)_ _s_e_t___p_e_e_r___c_l_a_s_s___t_y_p_e___f_i_l_t_e_r_(_) │ │ │ │ │ + o _c_r_e_a_t_e___p_e_e_r___c_l_a_s_s_(_) │ │ │ │ │ + o _d_e_l_e_t_e___p_e_e_r___c_l_a_s_s_(_) │ │ │ │ │ + o _g_e_t___p_e_e_r___c_l_a_s_s_(_)_ _s_e_t___p_e_e_r___c_l_a_s_s_(_) │ │ │ │ │ + o _r_e_m_o_v_e___t_o_r_r_e_n_t_(_) │ │ │ │ │ + o _g_e_t___s_e_t_t_i_n_g_s_(_)_ _a_p_p_l_y___s_e_t_t_i_n_g_s_(_) │ │ │ │ │ + o _w_a_i_t___f_o_r___a_l_e_r_t_(_)_ _p_o_p___a_l_e_r_t_s_(_)_ _s_e_t___a_l_e_r_t___n_o_t_i_f_y_(_) │ │ │ │ │ + o _d_e_l_e_t_e___p_o_r_t___m_a_p_p_i_n_g_(_)_ _a_d_d___p_o_r_t___m_a_p_p_i_n_g_(_) │ │ │ │ │ + o _r_e_o_p_e_n___n_e_t_w_o_r_k___s_o_c_k_e_t_s_(_) │ │ │ │ │ + o _n_a_t_i_v_e___h_a_n_d_l_e_(_) │ │ │ │ │ + * _s_e_s_s_i_o_n___p_a_r_a_m_s │ │ │ │ │ + o _s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ + o _s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ + * _w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s___b_u_f_(_)_ _w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s_(_)_ _r_e_a_d___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ * _a_ _w_o_r_d_ _o_f_ _c_a_u_t_i_o_n │ │ │ │ │ * _p_l_u_g_i_n_-_i_n_t_e_r_f_a_c_e │ │ │ │ │ * _c_u_s_t_o_m_ _a_l_e_r_t_s │ │ │ │ │ - * _p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e │ │ │ │ │ - * _b_t___p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e │ │ │ │ │ * _p_l_u_g_i_n │ │ │ │ │ o _i_m_p_l_e_m_e_n_t_e_d___f_e_a_t_u_r_e_s_(_) │ │ │ │ │ o _n_e_w___t_o_r_r_e_n_t_(_) │ │ │ │ │ o _a_d_d_e_d_(_) │ │ │ │ │ o _a_b_o_r_t_(_) │ │ │ │ │ o _o_n___d_h_t___r_e_q_u_e_s_t_(_) │ │ │ │ │ o _o_n___a_l_e_r_t_(_) │ │ │ │ │ @@ -440,173 +362,251 @@ │ │ │ │ │ * _p_e_e_r___p_l_u_g_i_n │ │ │ │ │ o _t_y_p_e_(_) │ │ │ │ │ o _a_d_d___h_a_n_d_s_h_a_k_e_(_) │ │ │ │ │ o _o_n___d_i_s_c_o_n_n_e_c_t_(_) │ │ │ │ │ o _o_n___c_o_n_n_e_c_t_e_d_(_) │ │ │ │ │ o _o_n___h_a_n_d_s_h_a_k_e_(_) │ │ │ │ │ o _o_n___e_x_t_e_n_s_i_o_n___h_a_n_d_s_h_a_k_e_(_) │ │ │ │ │ - o _o_n___d_o_n_t___h_a_v_e_(_)_ _o_n___b_i_t_f_i_e_l_d_(_)_ _o_n___i_n_t_e_r_e_s_t_e_d_(_)_ _o_n___h_a_v_e___a_l_l_(_) │ │ │ │ │ - _o_n___a_l_l_o_w_e_d___f_a_s_t_(_)_ _o_n___u_n_c_h_o_k_e_(_)_ _o_n___n_o_t___i_n_t_e_r_e_s_t_e_d_(_)_ _o_n___r_e_q_u_e_s_t_(_) │ │ │ │ │ - _o_n___c_h_o_k_e_(_)_ _o_n___h_a_v_e_(_)_ _o_n___h_a_v_e___n_o_n_e_(_) │ │ │ │ │ + o _o_n___i_n_t_e_r_e_s_t_e_d_(_)_ _o_n___c_h_o_k_e_(_)_ _o_n___b_i_t_f_i_e_l_d_(_)_ _o_n___h_a_v_e___n_o_n_e_(_)_ _o_n___h_a_v_e___a_l_l │ │ │ │ │ + _(_)_ _o_n___d_o_n_t___h_a_v_e_(_)_ _o_n___h_a_v_e_(_)_ _o_n___a_l_l_o_w_e_d___f_a_s_t_(_)_ _o_n___u_n_c_h_o_k_e_(_) │ │ │ │ │ + _o_n___n_o_t___i_n_t_e_r_e_s_t_e_d_(_)_ _o_n___r_e_q_u_e_s_t_(_) │ │ │ │ │ o _o_n___p_i_e_c_e_(_) │ │ │ │ │ - o _s_e_n_t___u_n_c_h_o_k_e_(_)_ _s_e_n_t___p_i_e_c_e_(_)_ _s_e_n_t___h_a_v_e_(_)_ _s_e_n_t___n_o_t___i_n_t_e_r_e_s_t_e_d_(_) │ │ │ │ │ + o _s_e_n_t___u_n_c_h_o_k_e_(_)_ _s_e_n_t___h_a_v_e_(_)_ _s_e_n_t___p_i_e_c_e_(_)_ _s_e_n_t___n_o_t___i_n_t_e_r_e_s_t_e_d_(_) │ │ │ │ │ _s_e_n_t___i_n_t_e_r_e_s_t_e_d_(_) │ │ │ │ │ o _s_e_n_t___p_a_y_l_o_a_d_(_) │ │ │ │ │ o _c_a_n___d_i_s_c_o_n_n_e_c_t_(_) │ │ │ │ │ o _o_n___e_x_t_e_n_d_e_d_(_) │ │ │ │ │ o _o_n___u_n_k_n_o_w_n___m_e_s_s_a_g_e_(_) │ │ │ │ │ o _o_n___p_i_e_c_e___p_a_s_s_(_)_ _o_n___p_i_e_c_e___f_a_i_l_e_d_(_) │ │ │ │ │ o _t_i_c_k_(_) │ │ │ │ │ o _w_r_i_t_e___r_e_q_u_e_s_t_(_) │ │ │ │ │ * _c_r_y_p_t_o___p_l_u_g_i_n │ │ │ │ │ o _d_e_c_r_y_p_t_(_) │ │ │ │ │ - * _c_r_e_a_t_e___s_m_a_r_t___b_a_n___p_l_u_g_i_n_(_) │ │ │ │ │ + * _p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e │ │ │ │ │ + * _b_t___p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e │ │ │ │ │ * _c_r_e_a_t_e___u_t___p_e_x___p_l_u_g_i_n_(_) │ │ │ │ │ + * _c_r_e_a_t_e___s_m_a_r_t___b_a_n___p_l_u_g_i_n_(_) │ │ │ │ │ * _c_r_e_a_t_e___u_t___m_e_t_a_d_a_t_a___p_l_u_g_i_n_(_) │ │ │ │ │ - * _t_o_r_r_e_n_t___s_t_a_t_u_s │ │ │ │ │ + * _c_r_e_a_t_e___t_o_r_r_e_n_t │ │ │ │ │ + o _c_r_e_a_t_e___t_o_r_r_e_n_t_(_) │ │ │ │ │ + o _g_e_n_e_r_a_t_e_(_)_ _g_e_n_e_r_a_t_e___b_u_f_(_) │ │ │ │ │ + o _f_i_l_e_s_(_) │ │ │ │ │ + o _s_e_t___c_o_m_m_e_n_t_(_) │ │ │ │ │ + o _s_e_t___c_r_e_a_t_o_r_(_) │ │ │ │ │ + o _s_e_t___c_r_e_a_t_i_o_n___d_a_t_e_(_) │ │ │ │ │ + o _s_e_t___h_a_s_h_(_) │ │ │ │ │ + o _s_e_t___h_a_s_h_2_(_) │ │ │ │ │ + o _a_d_d___h_t_t_p___s_e_e_d_(_)_ _a_d_d___u_r_l___s_e_e_d_(_) │ │ │ │ │ + o _a_d_d___n_o_d_e_(_) │ │ │ │ │ + o _a_d_d___t_r_a_c_k_e_r_(_) │ │ │ │ │ + o _s_e_t___r_o_o_t___c_e_r_t_(_) │ │ │ │ │ + o _p_r_i_v_(_)_ _s_e_t___p_r_i_v_(_) │ │ │ │ │ + o _n_u_m___p_i_e_c_e_s_(_) │ │ │ │ │ + o _p_i_e_c_e___r_a_n_g_e_(_) │ │ │ │ │ + o _f_i_l_e___r_a_n_g_e_(_) │ │ │ │ │ + o _f_i_l_e___p_i_e_c_e___r_a_n_g_e_(_) │ │ │ │ │ + o _t_o_t_a_l___s_i_z_e_(_) │ │ │ │ │ + o _p_i_e_c_e___s_i_z_e_(_)_ _p_i_e_c_e___l_e_n_g_t_h_(_) │ │ │ │ │ + o _a_d_d___s_i_m_i_l_a_r___t_o_r_r_e_n_t_(_)_ _a_d_d___c_o_l_l_e_c_t_i_o_n_(_) │ │ │ │ │ + * _a_d_d___f_i_l_e_s_(_) │ │ │ │ │ + * _s_e_t___p_i_e_c_e___h_a_s_h_e_s_(_) │ │ │ │ │ + * _i_p___f_i_l_t_e_r │ │ │ │ │ + o _e_m_p_t_y_(_) │ │ │ │ │ + o _a_d_d___r_u_l_e_(_) │ │ │ │ │ + o _a_c_c_e_s_s_(_) │ │ │ │ │ + o _e_x_p_o_r_t___f_i_l_t_e_r_(_) │ │ │ │ │ + o _e_n_u_m_ _a_c_c_e_s_s___f_l_a_g_s │ │ │ │ │ + * _p_o_r_t___f_i_l_t_e_r │ │ │ │ │ + o _a_d_d___r_u_l_e_(_) │ │ │ │ │ + o _a_c_c_e_s_s_(_) │ │ │ │ │ + o _e_n_u_m_ _a_c_c_e_s_s___f_l_a_g_s │ │ │ │ │ + * _w_e_b___s_e_e_d___e_n_t_r_y │ │ │ │ │ o _o_p_e_r_a_t_o_r_=_=_(_) │ │ │ │ │ - o _e_n_u_m_ _s_t_a_t_e___t │ │ │ │ │ - * _p_e_e_r___c_l_a_s_s___i_n_f_o │ │ │ │ │ + o _o_p_e_r_a_t_o_r_<_(_) │ │ │ │ │ + o _e_n_u_m_ _t_y_p_e___t │ │ │ │ │ + * _l_o_a_d___t_o_r_r_e_n_t___l_i_m_i_t_s │ │ │ │ │ + * _t_o_r_r_e_n_t___i_n_f_o │ │ │ │ │ + o _t_o_r_r_e_n_t___i_n_f_o_(_) │ │ │ │ │ + o _~_t_o_r_r_e_n_t___i_n_f_o_(_) │ │ │ │ │ + o _f_i_l_e_s_(_)_ _o_r_i_g___f_i_l_e_s_(_) │ │ │ │ │ + o _r_e_n_a_m_e___f_i_l_e_(_) │ │ │ │ │ + o _r_e_m_a_p___f_i_l_e_s_(_) │ │ │ │ │ + o _t_r_a_c_k_e_r_s_(_)_ _c_l_e_a_r___t_r_a_c_k_e_r_s_(_)_ _a_d_d___t_r_a_c_k_e_r_(_) │ │ │ │ │ + o _c_o_l_l_e_c_t_i_o_n_s_(_)_ _s_i_m_i_l_a_r___t_o_r_r_e_n_t_s_(_) │ │ │ │ │ + o _s_e_t___w_e_b___s_e_e_d_s_(_)_ _w_e_b___s_e_e_d_s_(_)_ _a_d_d___h_t_t_p___s_e_e_d_(_)_ _a_d_d___u_r_l___s_e_e_d_(_) │ │ │ │ │ + o _t_o_t_a_l___s_i_z_e_(_) │ │ │ │ │ + o _n_u_m___p_i_e_c_e_s_(_)_ _p_i_e_c_e___l_e_n_g_t_h_(_) │ │ │ │ │ + o _b_l_o_c_k_s___p_e_r___p_i_e_c_e_(_) │ │ │ │ │ + o _l_a_s_t___p_i_e_c_e_(_)_ _p_i_e_c_e___r_a_n_g_e_(_)_ _e_n_d___p_i_e_c_e_(_) │ │ │ │ │ + o _i_n_f_o___h_a_s_h_e_s_(_)_ _i_n_f_o___h_a_s_h_(_) │ │ │ │ │ + o _v_1_(_)_ _v_2_(_) │ │ │ │ │ + o _n_u_m___f_i_l_e_s_(_) │ │ │ │ │ + o _m_a_p___b_l_o_c_k_(_) │ │ │ │ │ + o _m_a_p___f_i_l_e_(_) │ │ │ │ │ + o _s_s_l___c_e_r_t_(_) │ │ │ │ │ + o _i_s___v_a_l_i_d_(_) │ │ │ │ │ + o _p_r_i_v_(_) │ │ │ │ │ + o _i_s___i_2_p_(_) │ │ │ │ │ + o _p_i_e_c_e___s_i_z_e_(_) │ │ │ │ │ + o _h_a_s_h___f_o_r___p_i_e_c_e___p_t_r_(_)_ _h_a_s_h___f_o_r___p_i_e_c_e_(_) │ │ │ │ │ + o _n_a_m_e_(_) │ │ │ │ │ + o _c_r_e_a_t_i_o_n___d_a_t_e_(_) │ │ │ │ │ + o _c_r_e_a_t_o_r_(_) │ │ │ │ │ + o _c_o_m_m_e_n_t_(_) │ │ │ │ │ + o _n_o_d_e_s_(_) │ │ │ │ │ + o _a_d_d___n_o_d_e_(_) │ │ │ │ │ + o _p_a_r_s_e___i_n_f_o___s_e_c_t_i_o_n_(_) │ │ │ │ │ + o _i_n_f_o_(_) │ │ │ │ │ + o _i_n_f_o___s_e_c_t_i_o_n_(_) │ │ │ │ │ + o _p_i_e_c_e___l_a_y_e_r_(_) │ │ │ │ │ + o _f_r_e_e___p_i_e_c_e___l_a_y_e_r_s_(_) │ │ │ │ │ * _p_e_e_r___c_l_a_s_s___t_y_p_e___f_i_l_t_e_r │ │ │ │ │ o _a_d_d_(_)_ _r_e_m_o_v_e_(_) │ │ │ │ │ o _a_l_l_o_w_(_)_ _d_i_s_a_l_l_o_w_(_) │ │ │ │ │ o _a_p_p_l_y_(_) │ │ │ │ │ o _e_n_u_m_ _s_o_c_k_e_t___t_y_p_e___t │ │ │ │ │ - * _d_i_s_k___o_b_s_e_r_v_e_r │ │ │ │ │ - o _o_n___d_i_s_k_(_) │ │ │ │ │ - * _o_p_e_n___f_i_l_e___s_t_a_t_e │ │ │ │ │ - * _d_i_s_k___i_n_t_e_r_f_a_c_e │ │ │ │ │ - o _n_e_w___t_o_r_r_e_n_t_(_) │ │ │ │ │ - o _r_e_m_o_v_e___t_o_r_r_e_n_t_(_) │ │ │ │ │ - o _a_s_y_n_c___w_r_i_t_e_(_)_ _a_s_y_n_c___r_e_a_d_(_) │ │ │ │ │ - o _a_s_y_n_c___h_a_s_h_(_) │ │ │ │ │ - o _a_s_y_n_c___h_a_s_h_2_(_) │ │ │ │ │ - o _a_s_y_n_c___m_o_v_e___s_t_o_r_a_g_e_(_) │ │ │ │ │ - o _a_s_y_n_c___r_e_l_e_a_s_e___f_i_l_e_s_(_) │ │ │ │ │ - o _a_s_y_n_c___c_h_e_c_k___f_i_l_e_s_(_) │ │ │ │ │ - o _a_s_y_n_c___s_t_o_p___t_o_r_r_e_n_t_(_) │ │ │ │ │ - o _a_s_y_n_c___r_e_n_a_m_e___f_i_l_e_(_) │ │ │ │ │ - o _a_s_y_n_c___d_e_l_e_t_e___f_i_l_e_s_(_) │ │ │ │ │ - o _a_s_y_n_c___s_e_t___f_i_l_e___p_r_i_o_r_i_t_y_(_) │ │ │ │ │ - o _a_s_y_n_c___c_l_e_a_r___p_i_e_c_e_(_) │ │ │ │ │ - o _u_p_d_a_t_e___s_t_a_t_s___c_o_u_n_t_e_r_s_(_) │ │ │ │ │ - o _g_e_t___s_t_a_t_u_s_(_) │ │ │ │ │ - o _a_b_o_r_t_(_) │ │ │ │ │ - o _s_u_b_m_i_t___j_o_b_s_(_) │ │ │ │ │ - o _s_e_t_t_i_n_g_s___u_p_d_a_t_e_d_(_) │ │ │ │ │ - * _s_t_o_r_a_g_e___h_o_l_d_e_r │ │ │ │ │ - * _s_e_t_t_i_n_g_s___i_n_t_e_r_f_a_c_e │ │ │ │ │ - * _b_u_f_f_e_r___a_l_l_o_c_a_t_o_r___i_n_t_e_r_f_a_c_e │ │ │ │ │ - * _d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r │ │ │ │ │ - o _d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r_(_) │ │ │ │ │ - o _d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r_(_) │ │ │ │ │ - o _~_d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r_(_) │ │ │ │ │ + * _p_e_e_r___c_l_a_s_s___i_n_f_o │ │ │ │ │ + * _b_i_t_f_i_e_l_d │ │ │ │ │ + o _b_i_t_f_i_e_l_d_(_) │ │ │ │ │ + o _a_s_s_i_g_n_(_) │ │ │ │ │ + o _o_p_e_r_a_t_o_r_[_]_(_)_ _g_e_t___b_i_t_(_) │ │ │ │ │ + o _s_e_t___b_i_t_(_)_ _c_l_e_a_r___b_i_t_(_) │ │ │ │ │ + o _a_l_l___s_e_t_(_) │ │ │ │ │ + o _n_o_n_e___s_e_t_(_) │ │ │ │ │ + o _s_i_z_e_(_) │ │ │ │ │ + o _n_u_m___w_o_r_d_s_(_) │ │ │ │ │ + o _n_u_m___b_y_t_e_s_(_) │ │ │ │ │ + o _e_m_p_t_y_(_) │ │ │ │ │ o _d_a_t_a_(_) │ │ │ │ │ - o _r_e_s_e_t_(_) │ │ │ │ │ o _s_w_a_p_(_) │ │ │ │ │ - o _i_s___m_u_t_a_b_l_e_(_) │ │ │ │ │ - o _b_o_o_l_(_) │ │ │ │ │ - * _f_i_l_e___o_p_e_n___m_o_d_e___t │ │ │ │ │ + o _c_o_u_n_t_(_) │ │ │ │ │ + o _f_i_n_d___f_i_r_s_t___s_e_t_(_) │ │ │ │ │ + o _f_i_n_d___l_a_s_t___c_l_e_a_r_(_) │ │ │ │ │ + * _h_a_s_h_e_r │ │ │ │ │ + o _h_a_s_h_e_r_(_)_ _o_p_e_r_a_t_o_r_=_(_) │ │ │ │ │ + o _u_p_d_a_t_e_(_) │ │ │ │ │ + o _f_i_n_a_l_(_) │ │ │ │ │ + o _r_e_s_e_t_(_) │ │ │ │ │ + * _h_a_s_h_e_r_2_5_6 │ │ │ │ │ + o _o_p_e_r_a_t_o_r_=_(_)_ _h_a_s_h_e_r_2_5_6_(_) │ │ │ │ │ + o _u_p_d_a_t_e_(_) │ │ │ │ │ + o _f_i_n_a_l_(_) │ │ │ │ │ + o _r_e_s_e_t_(_) │ │ │ │ │ + * _b_l_o_c_k___i_n_f_o │ │ │ │ │ + o _p_e_e_r_(_)_ _s_e_t___p_e_e_r_(_) │ │ │ │ │ + o _e_n_u_m_ _b_l_o_c_k___s_t_a_t_e___t │ │ │ │ │ + * _p_a_r_t_i_a_l___p_i_e_c_e___i_n_f_o │ │ │ │ │ + * _t_o_r_r_e_n_t___h_a_n_d_l_e │ │ │ │ │ + o _t_o_r_r_e_n_t___h_a_n_d_l_e_(_) │ │ │ │ │ + o _a_d_d___p_i_e_c_e_(_) │ │ │ │ │ + o _r_e_a_d___p_i_e_c_e_(_) │ │ │ │ │ + o _h_a_v_e___p_i_e_c_e_(_) │ │ │ │ │ + o _p_o_s_t___p_e_e_r___i_n_f_o_(_)_ _g_e_t___p_e_e_r___i_n_f_o_(_) │ │ │ │ │ + o _p_o_s_t___s_t_a_t_u_s_(_)_ _s_t_a_t_u_s_(_) │ │ │ │ │ + o _g_e_t___d_o_w_n_l_o_a_d___q_u_e_u_e_(_)_ _p_o_s_t___d_o_w_n_l_o_a_d___q_u_e_u_e_(_) │ │ │ │ │ + o _r_e_s_e_t___p_i_e_c_e___d_e_a_d_l_i_n_e_(_)_ _c_l_e_a_r___p_i_e_c_e___d_e_a_d_l_i_n_e_s_(_)_ _s_e_t___p_i_e_c_e___d_e_a_d_l_i_n_e_(_) │ │ │ │ │ + o _f_i_l_e___p_r_o_g_r_e_s_s_(_)_ _p_o_s_t___f_i_l_e___p_r_o_g_r_e_s_s_(_) │ │ │ │ │ + o _f_i_l_e___s_t_a_t_u_s_(_) │ │ │ │ │ + o _c_l_e_a_r___e_r_r_o_r_(_) │ │ │ │ │ + o _a_d_d___t_r_a_c_k_e_r_(_)_ _t_r_a_c_k_e_r_s_(_)_ _p_o_s_t___t_r_a_c_k_e_r_s_(_)_ _r_e_p_l_a_c_e___t_r_a_c_k_e_r_s_(_) │ │ │ │ │ + o _u_r_l___s_e_e_d_s_(_)_ _r_e_m_o_v_e___u_r_l___s_e_e_d_(_)_ _a_d_d___u_r_l___s_e_e_d_(_) │ │ │ │ │ + o _r_e_m_o_v_e___h_t_t_p___s_e_e_d_(_)_ _a_d_d___h_t_t_p___s_e_e_d_(_)_ _h_t_t_p___s_e_e_d_s_(_) │ │ │ │ │ + o _a_d_d___e_x_t_e_n_s_i_o_n_(_) │ │ │ │ │ + o _s_e_t___m_e_t_a_d_a_t_a_(_) │ │ │ │ │ + o _i_s___v_a_l_i_d_(_) │ │ │ │ │ + o _r_e_s_u_m_e_(_)_ _p_a_u_s_e_(_) │ │ │ │ │ + o _s_e_t___f_l_a_g_s_(_)_ _f_l_a_g_s_(_)_ _u_n_s_e_t___f_l_a_g_s_(_) │ │ │ │ │ + o _f_l_u_s_h___c_a_c_h_e_(_) │ │ │ │ │ + o _f_o_r_c_e___r_e_c_h_e_c_k_(_) │ │ │ │ │ + o _s_a_v_e___r_e_s_u_m_e___d_a_t_a_(_) │ │ │ │ │ + o _n_e_e_d___s_a_v_e___r_e_s_u_m_e___d_a_t_a_(_) │ │ │ │ │ + o _q_u_e_u_e___p_o_s_i_t_i_o_n_(_)_ _q_u_e_u_e___p_o_s_i_t_i_o_n___b_o_t_t_o_m_(_)_ _q_u_e_u_e___p_o_s_i_t_i_o_n___d_o_w_n_(_) │ │ │ │ │ + _q_u_e_u_e___p_o_s_i_t_i_o_n___u_p_(_)_ _q_u_e_u_e___p_o_s_i_t_i_o_n___t_o_p_(_) │ │ │ │ │ + o _q_u_e_u_e___p_o_s_i_t_i_o_n___s_e_t_(_) │ │ │ │ │ + o _s_e_t___s_s_l___c_e_r_t_i_f_i_c_a_t_e_(_)_ _s_e_t___s_s_l___c_e_r_t_i_f_i_c_a_t_e___b_u_f_f_e_r_(_) │ │ │ │ │ + o _t_o_r_r_e_n_t___f_i_l_e_(_)_ _t_o_r_r_e_n_t___f_i_l_e___w_i_t_h___h_a_s_h_e_s_(_) │ │ │ │ │ + o _p_i_e_c_e___l_a_y_e_r_s_(_) │ │ │ │ │ + o _p_o_s_t___p_i_e_c_e___a_v_a_i_l_a_b_i_l_i_t_y_(_)_ _p_i_e_c_e___a_v_a_i_l_a_b_i_l_i_t_y_(_) │ │ │ │ │ + o _g_e_t___p_i_e_c_e___p_r_i_o_r_i_t_i_e_s_(_)_ _p_i_e_c_e___p_r_i_o_r_i_t_y_(_)_ _p_r_i_o_r_i_t_i_z_e___p_i_e_c_e_s_(_) │ │ │ │ │ + o _p_r_i_o_r_i_t_i_z_e___f_i_l_e_s_(_)_ _g_e_t___f_i_l_e___p_r_i_o_r_i_t_i_e_s_(_)_ _f_i_l_e___p_r_i_o_r_i_t_y_(_) │ │ │ │ │ + o _f_o_r_c_e___l_s_d___a_n_n_o_u_n_c_e_(_)_ _f_o_r_c_e___d_h_t___a_n_n_o_u_n_c_e_(_)_ _f_o_r_c_e___r_e_a_n_n_o_u_n_c_e_(_) │ │ │ │ │ + o _s_c_r_a_p_e___t_r_a_c_k_e_r_(_) │ │ │ │ │ + o _s_e_t___u_p_l_o_a_d___l_i_m_i_t_(_)_ _u_p_l_o_a_d___l_i_m_i_t_(_)_ _s_e_t___d_o_w_n_l_o_a_d___l_i_m_i_t_(_) │ │ │ │ │ + _d_o_w_n_l_o_a_d___l_i_m_i_t_(_) │ │ │ │ │ + o _c_o_n_n_e_c_t___p_e_e_r_(_) │ │ │ │ │ + o _c_l_e_a_r___p_e_e_r_s_(_) │ │ │ │ │ + o _m_a_x___u_p_l_o_a_d_s_(_)_ _s_e_t___m_a_x___u_p_l_o_a_d_s_(_) │ │ │ │ │ + o _m_a_x___c_o_n_n_e_c_t_i_o_n_s_(_)_ _s_e_t___m_a_x___c_o_n_n_e_c_t_i_o_n_s_(_) │ │ │ │ │ + o _m_o_v_e___s_t_o_r_a_g_e_(_) │ │ │ │ │ + o _r_e_n_a_m_e___f_i_l_e_(_) │ │ │ │ │ + o _i_n_f_o___h_a_s_h_e_s_(_)_ _i_n_f_o___h_a_s_h_(_) │ │ │ │ │ + o _o_p_e_r_a_t_o_r_<_(_)_ _o_p_e_r_a_t_o_r_=_=_(_)_ _o_p_e_r_a_t_o_r_!_=_(_) │ │ │ │ │ + o _i_d_(_) │ │ │ │ │ + o _n_a_t_i_v_e___h_a_n_d_l_e_(_) │ │ │ │ │ + o _u_s_e_r_d_a_t_a_(_) │ │ │ │ │ + o _i_n___s_e_s_s_i_o_n_(_) │ │ │ │ │ + * _h_a_s_h___v_a_l_u_e_(_) │ │ │ │ │ * _s_e_t_t_i_n_g_s___p_a_c_k │ │ │ │ │ - o _s_e_t___i_n_t_(_)_ _s_e_t___b_o_o_l_(_)_ _s_e_t___s_t_r_(_) │ │ │ │ │ + o _s_e_t___b_o_o_l_(_)_ _s_e_t___s_t_r_(_)_ _s_e_t___i_n_t_(_) │ │ │ │ │ o _h_a_s___v_a_l_(_) │ │ │ │ │ o _c_l_e_a_r_(_) │ │ │ │ │ o _c_l_e_a_r_(_) │ │ │ │ │ o _g_e_t___s_t_r_(_)_ _g_e_t___b_o_o_l_(_)_ _g_e_t___i_n_t_(_) │ │ │ │ │ o _e_n_u_m_ _t_y_p_e___b_a_s_e_s │ │ │ │ │ o _e_n_u_m_ _m_m_a_p___w_r_i_t_e___m_o_d_e___t │ │ │ │ │ o _e_n_u_m_ _s_u_g_g_e_s_t___m_o_d_e___t │ │ │ │ │ o _e_n_u_m_ _c_h_o_k_i_n_g___a_l_g_o_r_i_t_h_m___t │ │ │ │ │ o _e_n_u_m_ _s_e_e_d___c_h_o_k_i_n_g___a_l_g_o_r_i_t_h_m___t │ │ │ │ │ o _e_n_u_m_ _i_o___b_u_f_f_e_r___m_o_d_e___t │ │ │ │ │ o _e_n_u_m_ _b_a_n_d_w_i_d_t_h___m_i_x_e_d___a_l_g_o___t │ │ │ │ │ o _e_n_u_m_ _e_n_c___p_o_l_i_c_y │ │ │ │ │ o _e_n_u_m_ _e_n_c___l_e_v_e_l │ │ │ │ │ o _e_n_u_m_ _p_r_o_x_y___t_y_p_e___t │ │ │ │ │ - * _m_i_n___m_e_m_o_r_y___u_s_a_g_e_(_)_ _h_i_g_h___p_e_r_f_o_r_m_a_n_c_e___s_e_e_d_(_) │ │ │ │ │ - * _g_e_n_e_r_a_t_e___f_i_n_g_e_r_p_r_i_n_t_(_) │ │ │ │ │ + * _h_i_g_h___p_e_r_f_o_r_m_a_n_c_e___s_e_e_d_(_)_ _m_i_n___m_e_m_o_r_y___u_s_a_g_e_(_) │ │ │ │ │ * _s_e_t_t_i_n_g___b_y___n_a_m_e_(_)_ _n_a_m_e___f_o_r___s_e_t_t_i_n_g_(_) │ │ │ │ │ * _d_e_f_a_u_l_t___s_e_t_t_i_n_g_s_(_) │ │ │ │ │ - * _s_t_o_r_a_g_e___e_r_r_o_r │ │ │ │ │ - o _b_o_o_l_(_) │ │ │ │ │ - o _f_i_l_e_(_) │ │ │ │ │ - * _l_i_b_t_o_r_r_e_n_t___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ - * _h_t_t_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ - * _i_2_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ - * _b_d_e_c_o_d_e___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ - * _p_c_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ - * _s_o_c_k_s___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ - * _g_z_i_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ - * _u_p_n_p___c_a_t_e_g_o_r_y_(_) │ │ │ │ │ - * _e_n_u_m_ _e_r_r_o_r___c_o_d_e___e_n_u_m │ │ │ │ │ - * _e_n_u_m_ _h_t_t_p___e_r_r_o_r_s │ │ │ │ │ - * _e_n_u_m_ _i_2_p___e_r_r_o_r___c_o_d_e │ │ │ │ │ - * _e_n_u_m_ _e_r_r_o_r___c_o_d_e___e_n_u_m │ │ │ │ │ - * _e_n_u_m_ _p_c_p___e_r_r_o_r_s │ │ │ │ │ - * _e_n_u_m_ _s_o_c_k_s___e_r_r_o_r___c_o_d_e │ │ │ │ │ - * _e_n_u_m_ _e_r_r_o_r___c_o_d_e___e_n_u_m │ │ │ │ │ - * _e_n_u_m_ _e_r_r_o_r___c_o_d_e___e_n_u_m │ │ │ │ │ + * _g_e_n_e_r_a_t_e___f_i_n_g_e_r_p_r_i_n_t_(_) │ │ │ │ │ + * _e_n_t_r_y │ │ │ │ │ + o _t_y_p_e_(_) │ │ │ │ │ + o _e_n_t_r_y_(_) │ │ │ │ │ + o _e_n_t_r_y_(_) │ │ │ │ │ + o _e_n_t_r_y_(_) │ │ │ │ │ + o _o_p_e_r_a_t_o_r_=_(_) │ │ │ │ │ + o _i_n_t_e_g_e_r_(_)_ _d_i_c_t_(_)_ _p_r_e_f_o_r_m_a_t_t_e_d_(_)_ _s_t_r_i_n_g_(_)_ _l_i_s_t_(_) │ │ │ │ │ + o _s_w_a_p_(_) │ │ │ │ │ + o _o_p_e_r_a_t_o_r_[_]_(_) │ │ │ │ │ + o _f_i_n_d___k_e_y_(_) │ │ │ │ │ + o _t_o___s_t_r_i_n_g_(_) │ │ │ │ │ + o _e_n_u_m_ _d_a_t_a___t_y_p_e │ │ │ │ │ + * _o_p_e_r_a_t_o_r_<_<_(_) │ │ │ │ │ + * _b_e_n_c_o_d_e_(_) │ │ │ │ │ * _b_d_e_c_o_d_e___n_o_d_e │ │ │ │ │ o _b_d_e_c_o_d_e___n_o_d_e_(_) │ │ │ │ │ o _o_p_e_r_a_t_o_r_=_(_)_ _b_d_e_c_o_d_e___n_o_d_e_(_) │ │ │ │ │ o _t_y_p_e_(_) │ │ │ │ │ o _b_o_o_l_(_) │ │ │ │ │ o _n_o_n___o_w_n_i_n_g_(_) │ │ │ │ │ - o _d_a_t_a___s_e_c_t_i_o_n_(_)_ _d_a_t_a___o_f_f_s_e_t_(_) │ │ │ │ │ - o _l_i_s_t___i_n_t___v_a_l_u_e___a_t_(_)_ _l_i_s_t___s_t_r_i_n_g___v_a_l_u_e___a_t_(_)_ _l_i_s_t___s_i_z_e_(_)_ _l_i_s_t___a_t_(_) │ │ │ │ │ - o _d_i_c_t___s_i_z_e_(_)_ _d_i_c_t___f_i_n_d___s_t_r_i_n_g___v_a_l_u_e_(_)_ _d_i_c_t___f_i_n_d___i_n_t___v_a_l_u_e_(_) │ │ │ │ │ - _d_i_c_t___f_i_n_d___i_n_t_(_)_ _d_i_c_t___a_t_(_)_ _d_i_c_t___f_i_n_d___l_i_s_t_(_)_ _d_i_c_t___f_i_n_d___s_t_r_i_n_g_(_) │ │ │ │ │ - _d_i_c_t___f_i_n_d___d_i_c_t_(_)_ _d_i_c_t___a_t___n_o_d_e_(_)_ _d_i_c_t___f_i_n_d_(_) │ │ │ │ │ + o _d_a_t_a___o_f_f_s_e_t_(_)_ _d_a_t_a___s_e_c_t_i_o_n_(_) │ │ │ │ │ + o _l_i_s_t___i_n_t___v_a_l_u_e___a_t_(_)_ _l_i_s_t___a_t_(_)_ _l_i_s_t___s_i_z_e_(_)_ _l_i_s_t___s_t_r_i_n_g___v_a_l_u_e___a_t_(_) │ │ │ │ │ + o _d_i_c_t___a_t_(_)_ _d_i_c_t___f_i_n_d___s_t_r_i_n_g_(_)_ _d_i_c_t___s_i_z_e_(_)_ _d_i_c_t___f_i_n_d___i_n_t___v_a_l_u_e_(_) │ │ │ │ │ + _d_i_c_t___a_t___n_o_d_e_(_)_ _d_i_c_t___f_i_n_d___i_n_t_(_)_ _d_i_c_t___f_i_n_d___s_t_r_i_n_g___v_a_l_u_e_(_)_ _d_i_c_t___f_i_n_d_(_) │ │ │ │ │ + _d_i_c_t___f_i_n_d___d_i_c_t_(_)_ _d_i_c_t___f_i_n_d___l_i_s_t_(_) │ │ │ │ │ o _i_n_t___v_a_l_u_e_(_) │ │ │ │ │ - o _s_t_r_i_n_g___l_e_n_g_t_h_(_)_ _s_t_r_i_n_g___v_a_l_u_e_(_)_ _s_t_r_i_n_g___p_t_r_(_)_ _s_t_r_i_n_g___o_f_f_s_e_t_(_) │ │ │ │ │ + o _s_t_r_i_n_g___v_a_l_u_e_(_)_ _s_t_r_i_n_g___p_t_r_(_)_ _s_t_r_i_n_g___l_e_n_g_t_h_(_)_ _s_t_r_i_n_g___o_f_f_s_e_t_(_) │ │ │ │ │ o _c_l_e_a_r_(_) │ │ │ │ │ o _s_w_a_p_(_) │ │ │ │ │ o _r_e_s_e_r_v_e_(_) │ │ │ │ │ o _s_w_i_t_c_h___u_n_d_e_r_l_y_i_n_g___b_u_f_f_e_r_(_) │ │ │ │ │ o _h_a_s___s_o_f_t___e_r_r_o_r_(_) │ │ │ │ │ o _e_n_u_m_ _t_y_p_e___t │ │ │ │ │ * _p_r_i_n_t___e_n_t_r_y_(_) │ │ │ │ │ * _b_d_e_c_o_d_e_(_) │ │ │ │ │ - * _e_n_t_r_y │ │ │ │ │ - o _t_y_p_e_(_) │ │ │ │ │ - o _e_n_t_r_y_(_) │ │ │ │ │ - o _e_n_t_r_y_(_) │ │ │ │ │ - o _e_n_t_r_y_(_) │ │ │ │ │ - o _o_p_e_r_a_t_o_r_=_(_) │ │ │ │ │ - o _l_i_s_t_(_)_ _d_i_c_t_(_)_ _i_n_t_e_g_e_r_(_)_ _p_r_e_f_o_r_m_a_t_t_e_d_(_)_ _s_t_r_i_n_g_(_) │ │ │ │ │ - o _s_w_a_p_(_) │ │ │ │ │ - o _o_p_e_r_a_t_o_r_[_]_(_) │ │ │ │ │ - o _f_i_n_d___k_e_y_(_) │ │ │ │ │ - o _t_o___s_t_r_i_n_g_(_) │ │ │ │ │ - o _e_n_u_m_ _d_a_t_a___t_y_p_e │ │ │ │ │ - * _b_e_n_c_o_d_e_(_) │ │ │ │ │ - * _o_p_e_r_a_t_o_r_<_<_(_) │ │ │ │ │ - * _c_r_e_a_t_e___t_o_r_r_e_n_t │ │ │ │ │ - o _c_r_e_a_t_e___t_o_r_r_e_n_t_(_) │ │ │ │ │ - o _g_e_n_e_r_a_t_e_(_)_ _g_e_n_e_r_a_t_e___b_u_f_(_) │ │ │ │ │ - o _f_i_l_e_s_(_) │ │ │ │ │ - o _s_e_t___c_o_m_m_e_n_t_(_) │ │ │ │ │ - o _s_e_t___c_r_e_a_t_o_r_(_) │ │ │ │ │ - o _s_e_t___c_r_e_a_t_i_o_n___d_a_t_e_(_) │ │ │ │ │ - o _s_e_t___h_a_s_h_(_) │ │ │ │ │ - o _s_e_t___h_a_s_h_2_(_) │ │ │ │ │ - o _a_d_d___u_r_l___s_e_e_d_(_)_ _a_d_d___h_t_t_p___s_e_e_d_(_) │ │ │ │ │ - o _a_d_d___n_o_d_e_(_) │ │ │ │ │ - o _a_d_d___t_r_a_c_k_e_r_(_) │ │ │ │ │ - o _s_e_t___r_o_o_t___c_e_r_t_(_) │ │ │ │ │ - o _p_r_i_v_(_)_ _s_e_t___p_r_i_v_(_) │ │ │ │ │ - o _n_u_m___p_i_e_c_e_s_(_) │ │ │ │ │ - o _p_i_e_c_e___r_a_n_g_e_(_) │ │ │ │ │ - o _f_i_l_e___r_a_n_g_e_(_) │ │ │ │ │ - o _f_i_l_e___p_i_e_c_e___r_a_n_g_e_(_) │ │ │ │ │ - o _t_o_t_a_l___s_i_z_e_(_) │ │ │ │ │ - o _p_i_e_c_e___s_i_z_e_(_)_ _p_i_e_c_e___l_e_n_g_t_h_(_) │ │ │ │ │ - o _a_d_d___s_i_m_i_l_a_r___t_o_r_r_e_n_t_(_)_ _a_d_d___c_o_l_l_e_c_t_i_o_n_(_) │ │ │ │ │ - * _a_d_d___f_i_l_e_s_(_) │ │ │ │ │ - * _s_e_t___p_i_e_c_e___h_a_s_h_e_s_(_) │ │ │ │ │ + * _t_o_r_r_e_n_t___s_t_a_t_u_s │ │ │ │ │ + o _o_p_e_r_a_t_o_r_=_=_(_) │ │ │ │ │ + o _e_n_u_m_ _s_t_a_t_e___t │ │ │ │ │ * _d_h_t___s_t_o_r_a_g_e___c_o_u_n_t_e_r_s │ │ │ │ │ o _r_e_s_e_t_(_) │ │ │ │ │ * _d_h_t___s_t_o_r_a_g_e___i_n_t_e_r_f_a_c_e │ │ │ │ │ o _u_p_d_a_t_e___n_o_d_e___i_d_s_(_) │ │ │ │ │ o _g_e_t___p_e_e_r_s_(_) │ │ │ │ │ o _a_n_n_o_u_n_c_e___p_e_e_r_(_) │ │ │ │ │ o _g_e_t___i_m_m_u_t_a_b_l_e___i_t_e_m_(_) │ │ │ │ │ @@ -617,55 +617,644 @@ │ │ │ │ │ o _g_e_t___i_n_f_o_h_a_s_h_e_s___s_a_m_p_l_e_(_) │ │ │ │ │ o _t_i_c_k_(_) │ │ │ │ │ o _c_o_u_n_t_e_r_s_(_) │ │ │ │ │ * _d_h_t___s_t_a_t_e │ │ │ │ │ * _d_h_t___d_e_f_a_u_l_t___s_t_o_r_a_g_e___c_o_n_s_t_r_u_c_t_o_r_(_) │ │ │ │ │ * _s_i_g_n___m_u_t_a_b_l_e___i_t_e_m_(_) │ │ │ │ │ * _a_n_n_o_u_n_c_e___f_l_a_g_s___t │ │ │ │ │ - * _r_e_a_d___r_e_s_u_m_e___d_a_t_a_(_) │ │ │ │ │ * _w_r_i_t_e___r_e_s_u_m_e___d_a_t_a_(_)_ _w_r_i_t_e___r_e_s_u_m_e___d_a_t_a___b_u_f_(_) │ │ │ │ │ - * _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e___b_u_f_(_)_ _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e_(_) │ │ │ │ │ + * _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e_(_)_ _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e___b_u_f_(_) │ │ │ │ │ + * _r_e_a_d___r_e_s_u_m_e___d_a_t_a_(_) │ │ │ │ │ * _w_r_i_t_e___t_o_r_r_e_n_t___f_l_a_g_s___t │ │ │ │ │ * _e_d_2_5_5_1_9___c_r_e_a_t_e___s_e_e_d_(_) │ │ │ │ │ * _e_d_2_5_5_1_9___c_r_e_a_t_e___k_e_y_p_a_i_r_(_) │ │ │ │ │ * _e_d_2_5_5_1_9___s_i_g_n_(_) │ │ │ │ │ * _e_d_2_5_5_1_9___v_e_r_i_f_y_(_) │ │ │ │ │ * _e_d_2_5_5_1_9___a_d_d___s_c_a_l_a_r_(_) │ │ │ │ │ * _e_d_2_5_5_1_9___k_e_y___e_x_c_h_a_n_g_e_(_) │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ppiieeccee__bblloocckk ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_i_e_c_e___b_l_o_c_k_._h_p_p" │ │ │ │ │ -struct piece_block │ │ │ │ │ +************ ssttoorraaggee__eerrrroorr ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_r_r_o_r___c_o_d_e_._h_p_p" │ │ │ │ │ +used by storage to return errors also includes which underlying file the error │ │ │ │ │ +happened on │ │ │ │ │ +struct storage_error │ │ │ │ │ { │ │ │ │ │ - ppiieeccee__bblloocckk () = default; │ │ │ │ │ - ppiieeccee__bblloocckk (piece_index_t p_index, int b_index); │ │ │ │ │ - bool ooppeerraattoorr<< (piece_block const& b) const; │ │ │ │ │ - bool ooppeerraattoorr==== (piece_block const& b) const; │ │ │ │ │ - bool ooppeerraattoorr!!== (piece_block const& b) const; │ │ │ │ │ + explicit operator bbooooll () const; │ │ │ │ │ + void ffiillee (file_index_t f); │ │ │ │ │ + file_index_t ffiillee () const; │ │ │ │ │ │ │ │ │ │ - static const piece_block invalid; │ │ │ │ │ - piece_index_t piece_index {0}; │ │ │ │ │ - int bblloocckk__iinnddeexx = 0; │ │ │ │ │ + error_code ec; │ │ │ │ │ + operation_t operation; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** bbooooll(()) ********** │ │ │ │ │ +explicit operator bbooooll () const; │ │ │ │ │ +explicitly converts to true if this object represents an error, and false if it │ │ │ │ │ +does not. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ffiillee(()) ********** │ │ │ │ │ +void ffiillee (file_index_t f); │ │ │ │ │ +file_index_t ffiillee () const; │ │ │ │ │ +set and query the index (in the torrent) of the file this error occurred on. │ │ │ │ │ +This may also have special values defined in _t_o_r_r_e_n_t___s_t_a_t_u_s. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + ec │ │ │ │ │ + the error that occurred │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + operation │ │ │ │ │ + A code from _o_p_e_r_a_t_i_o_n___t enum, indicating what kind of operation failed. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ii22pp__ccaatteeggoorryy(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_i_2_p___s_t_r_e_a_m_._h_p_p" │ │ │ │ │ +boost::system::error_category& ii22pp__ccaatteeggoorryy (); │ │ │ │ │ +returns the error category for I2P errors │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ lliibbttoorrrreenntt__ccaatteeggoorryy(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_r_r_o_r___c_o_d_e_._h_p_p" │ │ │ │ │ +boost::system::error_category& lliibbttoorrrreenntt__ccaatteeggoorryy (); │ │ │ │ │ +return the instance of the libtorrent_error_category which maps libtorrent │ │ │ │ │ +error codes to human readable error messages. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ hhttttpp__ccaatteeggoorryy(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_r_r_o_r___c_o_d_e_._h_p_p" │ │ │ │ │ +boost::system::error_category& hhttttpp__ccaatteeggoorryy (); │ │ │ │ │ +returns the error_category for HTTP errors │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ uuppnnpp__ccaatteeggoorryy(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_u_p_n_p_._h_p_p" │ │ │ │ │ +boost::system::error_category& uuppnnpp__ccaatteeggoorryy (); │ │ │ │ │ +the boost.system error category for UPnP errors │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ggzziipp__ccaatteeggoorryy(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_g_z_i_p_._h_p_p" │ │ │ │ │ +boost::system::error_category& ggzziipp__ccaatteeggoorryy (); │ │ │ │ │ +get the error_category for zip errors │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ppccpp__ccaatteeggoorryy(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_n_a_t_p_m_p_._h_p_p" │ │ │ │ │ +boost::system::error_category& ppccpp__ccaatteeggoorryy (); │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ssoocckkss__ccaatteeggoorryy(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_o_c_k_s_5___s_t_r_e_a_m_._h_p_p" │ │ │ │ │ +boost::system::error_category& ssoocckkss__ccaatteeggoorryy (); │ │ │ │ │ +returns the error_category for SOCKS5 errors │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ bbddeeccooddee__ccaatteeggoorryy(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_b_d_e_c_o_d_e_._h_p_p" │ │ │ │ │ +boost::system::error_category& bbddeeccooddee__ccaatteeggoorryy (); │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ eennuumm ii22pp__eerrrroorr__ccooddee ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_i_2_p___s_t_r_e_a_m_._h_p_p" │ │ │ │ │ + _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ +|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ +|_n_o___e_r_r_o_r_ _ _ _ _ _ _ _|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_a_r_s_e___f_a_i_l_e_d_ _ _ _|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_c_a_n_t___r_e_a_c_h___p_e_e_r_|_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_i_2_p___e_r_r_o_r_ _ _ _ _ _ _|_3_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_i_n_v_a_l_i_d___k_e_y_ _ _ _ _|_4_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_i_n_v_a_l_i_d___i_d_ _ _ _ _ _|_5_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_t_i_m_e_o_u_t_ _ _ _ _ _ _ _ _|_6_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_k_e_y___n_o_t___f_o_u_n_d_ _ _|_7_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_d_u_p_l_i_c_a_t_e_d___i_d_ _ _|_8_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_n_u_m___e_r_r_o_r_s_ _ _ _ _ _|_9_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ eennuumm eerrrroorr__ccooddee__eennuumm ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_r_r_o_r___c_o_d_e_._h_p_p" │ │ │ │ │ + _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ +|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_n_o___e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_0_ _ _ _ _|_N_o_t_ _a_n_ _e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|file_collision |1 |Two torrents has files which end | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_u_p_ _o_v_e_r_w_r_i_t_i_n_g_ _e_a_c_h_ _o_t_h_e_r_ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|failed_hash_check |2 |A piece did not match its piece | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_h_a_s_h_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The .torrent file does not contain| │ │ │ │ │ +|torrent_is_no_dict |3 |a bencoded dictionary at its top | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_l_e_v_e_l_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|torrent_missing_info |4 |The .torrent file does not have an| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_f_o_ _d_i_c_t_i_o_n_a_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|torrent_info_no_dict |5 |The .torrent file's info _e_n_t_r_y is | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_n_o_t_ _a_ _d_i_c_t_i_o_n_a_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|torrent_missing_piece_length |6 |The .torrent file does not have a | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_i_e_c_e_ _l_e_n_g_t_h_ _e_n_t_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|torrent_missing_name |7 |The .torrent file does not have a | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_n_a_m_e_ _e_n_t_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|torrent_invalid_name |8 |The .torrent file's name _e_n_t_r_y is | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The length of a file, or of the | │ │ │ │ │ +|torrent_invalid_length |9 |whole .torrent file is invalid. | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_E_i_t_h_e_r_ _n_e_g_a_t_i_v_e_ _o_r_ _n_o_t_ _a_n_ _i_n_t_e_g_e_r_ | │ │ │ │ │ +|torrent_file_parse_failed |10 |Failed to parse a file _e_n_t_r_y in | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_ _._t_o_r_r_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|torrent_missing_pieces |11 |The pieces field is missing or | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _i_n_ _t_h_e_ _._t_o_r_r_e_n_t_ _f_i_l_e_ _ _ _ _ _ | │ │ │ │ │ +|torrent_invalid_hashes |12 |The pieces string has incorrect | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_l_e_n_g_t_h_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|too_many_pieces_in_torrent |13 |The .torrent file has more pieces | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_a_n_ _i_s_ _s_u_p_p_o_r_t_e_d_ _b_y_ _l_i_b_t_o_r_r_e_n_t_ _ _ | │ │ │ │ │ +| | |The metadata (.torrent file) that | │ │ │ │ │ +|invalid_swarm_metadata |14 |was received from the swarm | │ │ │ │ │ +| | |matched the info-hash, but failed | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_o_ _b_e_ _p_a_r_s_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_bencoding |15 |The file or buffer is not | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_o_r_r_e_c_t_l_y_ _b_e_n_c_o_d_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|no_files_in_torrent |16 |The .torrent file does not contain| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_n_y_ _f_i_l_e_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_escaped_string |17 |The string was not properly url- | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_n_c_o_d_e_d_ _a_s_ _e_x_p_e_c_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|session_is_closing |18 |Operation is not permitted since | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_ _s_e_s_s_i_o_n_ _i_s_ _s_h_u_t_t_i_n_g_ _d_o_w_n_ _ _ _ _ _ | │ │ │ │ │ +| | |There's already a torrent with | │ │ │ │ │ +|duplicate_torrent |19 |that info-hash added to the | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_e_s_s_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_torrent_handle |20 |The supplied _t_o_r_r_e_n_t___h_a_n_d_l_e is not| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_f_e_r_r_i_n_g_ _t_o_ _a_ _v_a_l_i_d_ _t_o_r_r_e_n_t_ _ _ _ _ _ | │ │ │ │ │ +|invalid_entry_type |21 |The type requested from the _e_n_t_r_y | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_d_i_d_ _n_o_t_ _m_a_t_c_h_ _i_t_s_ _t_y_p_e_ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|missing_info_hash_in_uri |22 |The specified URI does not contain| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_ _v_a_l_i_d_ _i_n_f_o_-_h_a_s_h_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |One of the files in the torrent | │ │ │ │ │ +|file_too_short |23 |was unexpectedly small. This might| │ │ │ │ │ +| | |be caused by files being changed | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_b_y_ _a_n_ _e_x_t_e_r_n_a_l_ _p_r_o_c_e_s_s_ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The URL used an unknown protocol. | │ │ │ │ │ +| | |Currently http and https (if built| │ │ │ │ │ +|unsupported_url_protocol |24 |with openssl support) are | │ │ │ │ │ +| | |recognized. For trackers udp is | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_c_o_g_n_i_z_e_d_ _a_s_ _w_e_l_l_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|url_parse_error |25 |The URL did not conform to URL | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_y_n_t_a_x_ _a_n_d_ _f_a_i_l_e_d_ _t_o_ _b_e_ _p_a_r_s_e_d_ _ _ _ | │ │ │ │ │ +|peer_sent_empty_piece |26 |The peer sent a piece message of | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_l_e_n_g_t_h_ _0_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|parse_failed |27 |A bencoded structure was corrupt | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_n_d_ _f_a_i_l_e_d_ _t_o_ _b_e_ _p_a_r_s_e_d_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_file_tag |28 |The fast resume file was missing | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_r_ _h_a_d_ _a_n_ _i_n_v_a_l_i_d_ _f_i_l_e_ _v_e_r_s_i_o_n_ _t_a_g| │ │ │ │ │ +|missing_info_hash |29 |The fast resume file was missing | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_r_ _h_a_d_ _a_n_ _i_n_v_a_l_i_d_ _i_n_f_o_-_h_a_s_h_ _ _ _ _ _ _ | │ │ │ │ │ +|mismatching_info_hash |30 |The info-hash did not match the | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_o_r_r_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_hostname |31 |The URL contained an invalid | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_h_o_s_t_n_a_m_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_i_n_v_a_l_i_d___p_o_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_3_2_ _ _ _|_T_h_e_ _U_R_L_ _h_a_d_ _a_n_ _i_n_v_a_l_i_d_ _p_o_r_t_ _ _ _ _ _ _ | │ │ │ │ │ +| | |The port is blocked by the port- | │ │ │ │ │ +|port_blocked |33 |filter, and prevented the | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_o_n_n_e_c_t_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|expected_close_bracket_in_address |34 |The IPv6 address was expected to | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_n_d_ _w_i_t_h_ _"_]_"_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The torrent is being destructed, | │ │ │ │ │ +|destructing_torrent |35 |preventing the operation to | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_u_c_c_e_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_t_i_m_e_d___o_u_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_3_6_ _ _ _|_T_h_e_ _c_o_n_n_e_c_t_i_o_n_ _t_i_m_e_d_ _o_u_t_ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The peer is upload only, and we | │ │ │ │ │ +|upload_upload_connection |37 |are upload only. There's no point | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_ _k_e_e_p_i_n_g_ _t_h_e_ _c_o_n_n_e_c_t_i_o_n_ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The peer is upload only, and we're| │ │ │ │ │ +|uninteresting_upload_peer |38 |not interested in it. There's no | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_o_i_n_t_ _i_n_ _k_e_e_p_i_n_g_ _t_h_e_ _c_o_n_n_e_c_t_i_o_n_ _ _ | │ │ │ │ │ +|_i_n_v_a_l_i_d___i_n_f_o___h_a_s_h_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_3_9_ _ _ _|_T_h_e_ _p_e_e_r_ _s_e_n_t_ _a_n_ _u_n_k_n_o_w_n_ _i_n_f_o_-_h_a_s_h| │ │ │ │ │ +|torrent_paused |40 |The torrent is paused, preventing | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_ _o_p_e_r_a_t_i_o_n_ _f_r_o_m_ _s_u_c_c_e_e_d_i_n_g_ _ _ _ _ | │ │ │ │ │ +| | |The peer sent an invalid have | │ │ │ │ │ +|invalid_have |41 |message, either wrong size or | │ │ │ │ │ +| | |referring to a piece that doesn't | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_x_i_s_t_ _i_n_ _t_h_e_ _t_o_r_r_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_bitfield_size |42 |The _b_i_t_f_i_e_l_d message had the | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_c_o_r_r_e_c_t_ _s_i_z_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The peer kept requesting pieces | │ │ │ │ │ +|too_many_requests_when_choked |43 |after it was choked, possible | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_b_u_s_e_ _a_t_t_e_m_p_t_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The peer sent a piece message that| │ │ │ │ │ +|invalid_piece |44 |does not correspond to a piece | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_q_u_e_s_t_ _s_e_n_t_ _b_y_ _t_h_e_ _c_l_i_e_n_t_ _ _ _ _ _ _ _ | │ │ │ │ │ +|_n_o___m_e_m_o_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_4_5_ _ _ _|_m_e_m_o_r_y_ _a_l_l_o_c_a_t_i_o_n_ _f_a_i_l_e_d_ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|torrent_aborted |46 |The torrent is aborted, preventing| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_ _o_p_e_r_a_t_i_o_n_ _t_o_ _s_u_c_c_e_e_d_ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|self_connection |47 |The peer is a connection to | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_u_r_s_e_l_f_,_ _n_o_ _p_o_i_n_t_ _i_n_ _k_e_e_p_i_n_g_ _i_t_ _ _ | │ │ │ │ │ +| | |The peer sent a piece message with| │ │ │ │ │ +|invalid_piece_size |48 |invalid size, either negative or | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_g_r_e_a_t_e_r_ _t_h_a_n_ _o_n_e_ _b_l_o_c_k_ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The peer has not been interesting | │ │ │ │ │ +|timed_out_no_interest |49 |or interested in us for too long, | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_n_o_ _p_o_i_n_t_ _i_n_ _k_e_e_p_i_n_g_ _i_t_ _a_r_o_u_n_d_ _ _ _ _ | │ │ │ │ │ +|timed_out_inactivity |50 |The peer has not said anything in | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_ _l_o_n_g_ _t_i_m_e_,_ _p_o_s_s_i_b_l_y_ _d_e_a_d_ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The peer did not send a handshake | │ │ │ │ │ +|timed_out_no_handshake |51 |within a reasonable amount of | │ │ │ │ │ +| | |time, it might not be a bittorrent| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_e_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The peer has been unchoked for too| │ │ │ │ │ +|timed_out_no_request |52 |long without requesting any data. | │ │ │ │ │ +| | |It might be lying about its | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_t_e_r_e_s_t_ _i_n_ _u_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_choke |53 |The peer sent an invalid choke | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_unchoke |54 |The peer send an invalid unchoke | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_interested |55 |The peer sent an invalid | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_t_e_r_e_s_t_e_d_ _m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_not_interested |56 |The peer sent an invalid not- | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_t_e_r_e_s_t_e_d_ _m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_request |57 |The peer sent an invalid piece | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_q_u_e_s_t_ _m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The peer sent an invalid hash-list| │ │ │ │ │ +|invalid_hash_list |58 |message (this is part of the | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_r_k_l_e_-_t_o_r_r_e_n_t_ _e_x_t_e_n_s_i_o_n_)_ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The peer sent an invalid hash- | │ │ │ │ │ +|invalid_hash_piece |59 |piece message (this is part of the| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_r_k_l_e_-_t_o_r_r_e_n_t_ _e_x_t_e_n_s_i_o_n_)_ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_cancel |60 |The peer sent an invalid cancel | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_dht_port |61 |The peer sent an invalid DHT port-| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_suggest |62 |The peer sent an invalid suggest | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_i_e_c_e_-_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_have_all |63 |The peer sent an invalid have all-| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_have_none |64 |The peer sent an invalid have | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_n_o_n_e_-_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_reject |65 |The peer sent an invalid reject | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_allow_fast |66 |The peer sent an invalid allow | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_f_a_s_t_-_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_extended |67 |The peer sent an invalid extension| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _I_D_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_message |68 |The peer sent an invalid message | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_I_D_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|sync_hash_not_found |69 |The synchronization hash was not | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_f_o_u_n_d_ _i_n_ _t_h_e_ _e_n_c_r_y_p_t_e_d_ _h_a_n_d_s_h_a_k_e_ _ | │ │ │ │ │ +|invalid_encryption_constant |70 |The encryption constant in the | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_h_a_n_d_s_h_a_k_e_ _i_s_ _i_n_v_a_l_i_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|no_plaintext_mode |71 |The peer does not support plain | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_e_x_t_,_ _w_h_i_c_h_ _i_s_ _t_h_e_ _s_e_l_e_c_t_e_d_ _m_o_d_e_ _ | │ │ │ │ │ +|no_rc4_mode |72 |The peer does not support RC4, | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_w_h_i_c_h_ _i_s_ _t_h_e_ _s_e_l_e_c_t_e_d_ _m_o_d_e_ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The peer does not support any of | │ │ │ │ │ +|unsupported_encryption_mode |73 |the encryption modes that the | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_l_i_e_n_t_ _s_u_p_p_o_r_t_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The peer selected an encryption | │ │ │ │ │ +|unsupported_encryption_mode_selected|74 |mode that the client did not | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_d_v_e_r_t_i_s_e_ _a_n_d_ _d_o_e_s_ _n_o_t_ _s_u_p_p_o_r_t_ _ _ _ | │ │ │ │ │ +| | |The pad size used in the | │ │ │ │ │ +|invalid_pad_size |75 |encryption handshake is of invalid| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_i_z_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_encrypt_handshake |76 |The encryption handshake is | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The client is set to not support | │ │ │ │ │ +|no_incoming_encrypted |77 |incoming encrypted connections and| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_i_s_ _i_s_ _a_n_ _e_n_c_r_y_p_t_e_d_ _c_o_n_n_e_c_t_i_o_n_ _ _ | │ │ │ │ │ +| | |The client is set to not support | │ │ │ │ │ +|no_incoming_regular |78 |incoming regular bittorrent | │ │ │ │ │ +| | |connections, and this is a regular| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_o_n_n_e_c_t_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|duplicate_peer_id |79 |The client is already connected to| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_i_s_ _p_e_e_r_-_I_D_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_t_o_r_r_e_n_t___r_e_m_o_v_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_8_0_ _ _ _|_T_o_r_r_e_n_t_ _w_a_s_ _r_e_m_o_v_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|packet_too_large |81 |The packet size exceeded the upper| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_a_n_i_t_y_ _c_h_e_c_k_-_l_i_m_i_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_s_e_r_v_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_8_2_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|http_error |83 |The web server responded with an | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|missing_location |84 |The web server response is missing| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_ _l_o_c_a_t_i_o_n_ _h_e_a_d_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The web seed redirected to a path | │ │ │ │ │ +|invalid_redirection |85 |that no longer matches the | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_._t_o_r_r_e_n_t_ _d_i_r_e_c_t_o_r_y_ _s_t_r_u_c_t_u_r_e_ _ _ _ _ _ | │ │ │ │ │ +|redirecting |86 |The connection was closed because | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_t_ _r_e_d_i_r_e_c_t_e_d_ _t_o_ _a_ _d_i_f_f_e_r_e_n_t_ _U_R_L_ _ | │ │ │ │ │ +|_i_n_v_a_l_i_d___r_a_n_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_8_7_ _ _ _|_T_h_e_ _H_T_T_P_ _r_a_n_g_e_ _h_e_a_d_e_r_ _i_s_ _i_n_v_a_l_i_d_ _ | │ │ │ │ │ +|no_content_length |88 |The HTTP response did not have a | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_o_n_t_e_n_t_ _l_e_n_g_t_h_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_b_a_n_n_e_d___b_y___i_p___f_i_l_t_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_8_9_ _ _ _|_T_h_e_ _I_P_ _i_s_ _b_l_o_c_k_e_d_ _b_y_ _t_h_e_ _I_P_ _f_i_l_t_e_r| │ │ │ │ │ +|_t_o_o___m_a_n_y___c_o_n_n_e_c_t_i_o_n_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_9_0_ _ _ _|_A_t_ _t_h_e_ _c_o_n_n_e_c_t_i_o_n_ _l_i_m_i_t_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_e_e_r___b_a_n_n_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_9_1_ _ _ _|_T_h_e_ _p_e_e_r_ _i_s_ _m_a_r_k_e_d_ _a_s_ _b_a_n_n_e_d_ _ _ _ _ _ | │ │ │ │ │ +|stopping_torrent |92 |The torrent is stopping, causing | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_ _o_p_e_r_a_t_i_o_n_ _t_o_ _f_a_i_l_ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|too_many_corrupt_pieces |93 |The peer has sent too many corrupt| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_i_e_c_e_s_ _a_n_d_ _i_s_ _b_a_n_n_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|torrent_not_ready |94 |The torrent is not ready to | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_c_e_i_v_e_ _p_e_e_r_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|peer_not_constructed |95 |The peer is not completely | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_o_n_s_t_r_u_c_t_e_d_ _y_e_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|session_closing |96 |The _s_e_s_s_i_o_n is closing, causing | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_ _o_p_e_r_a_t_i_o_n_ _t_o_ _f_a_i_l_ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The peer was disconnected in order| │ │ │ │ │ +|optimistic_disconnect |97 |to leave room for a potentially | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_b_e_t_t_e_r_ _p_e_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_t_o_r_r_e_n_t___f_i_n_i_s_h_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_9_8_ _ _ _|_T_h_e_ _t_o_r_r_e_n_t_ _i_s_ _f_i_n_i_s_h_e_d_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_n_o___r_o_u_t_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_9_9_ _ _ _|_N_o_ _U_P_n_P_ _r_o_u_t_e_r_ _f_o_u_n_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|metadata_too_large |100 |The metadata message says the | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_t_a_d_a_t_a_ _e_x_c_e_e_d_s_ _t_h_e_ _l_i_m_i_t_ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_metadata_request |101 |The peer sent an invalid metadata | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_q_u_e_s_t_ _m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_metadata_size |102 |The peer advertised an invalid | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_t_a_d_a_t_a_ _s_i_z_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_metadata_offset |103 |The peer sent a message with an | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _m_e_t_a_d_a_t_a_ _o_f_f_s_e_t_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_metadata_message |104 |The peer sent an invalid metadata | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|pex_message_too_large |105 |The peer sent a peer exchange | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _t_h_a_t_ _w_a_s_ _t_o_o_ _l_a_r_g_e_ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_pex_message |106 |The peer sent an invalid peer | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_x_c_h_a_n_g_e_ _m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_lt_tracker_message |107 |The peer sent an invalid tracker | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_x_c_h_a_n_g_e_ _m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The peer sent an pex messages too | │ │ │ │ │ +|too_frequent_pex |108 |often. This is a possible attempt | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_f_ _a_n_d_ _a_t_t_a_c_k_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The operation failed because it | │ │ │ │ │ +| | |requires the torrent to have the | │ │ │ │ │ +| | |metadata (.torrent file) and it | │ │ │ │ │ +|no_metadata |109 |doesn't have it yet. This happens | │ │ │ │ │ +| | |for magnet links before they have | │ │ │ │ │ +| | |downloaded the metadata, and also | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_o_r_r_e_n_t_s_ _a_d_d_e_d_ _b_y_ _U_R_L_._ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The peer sent an invalid dont_have| │ │ │ │ │ +| | |message. The don't have message is| │ │ │ │ │ +|invalid_dont_have |110 |an extension to allow peers to | │ │ │ │ │ +| | |advertise that the no longer has a| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_i_e_c_e_ _t_h_e_y_ _p_r_e_v_i_o_u_s_l_y_ _h_a_d_._ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The peer tried to connect to an | │ │ │ │ │ +|requires_ssl_connection |111 |SSL torrent without connecting | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_v_e_r_ _S_S_L_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The peer tried to connect to a | │ │ │ │ │ +|invalid_ssl_cert |112 |torrent with a certificate for a | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_d_i_f_f_e_r_e_n_t_ _t_o_r_r_e_n_t_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |the torrent is not an SSL torrent,| │ │ │ │ │ +|not_an_ssl_torrent |113 |and the operation requires an SSL | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_o_r_r_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |peer was banned because its listen| │ │ │ │ │ +|banned_by_port_filter |114 |port is within a banned port | │ │ │ │ │ +| | |range, as specified by the | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_o_r_t___f_i_l_t_e_r_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_session_handle |115 |The _s_e_s_s_i_o_n___h_a_n_d_l_e is not | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_f_e_r_r_i_n_g_ _t_o_ _a_ _v_a_l_i_d_ _s_e_s_s_i_o_n___i_m_p_l_ | │ │ │ │ │ +|invalid_listen_socket |116 |the listen socket associated with | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_i_s_ _r_e_q_u_e_s_t_ _w_a_s_ _c_l_o_s_e_d_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_i_n_v_a_l_i_d___h_a_s_h___r_e_q_u_e_s_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_1_7_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_i_n_v_a_l_i_d___h_a_s_h_e_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_1_8_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_i_n_v_a_l_i_d___h_a_s_h___r_e_j_e_c_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_1_9_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_d_e_p_r_e_c_a_t_e_d___1_2_0_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_2_0_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_d_e_p_r_e_c_a_t_e_d___1_2_1_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_2_1_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_d_e_p_r_e_c_a_t_e_d___1_2_2_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_2_2_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_d_e_p_r_e_c_a_t_e_d___1_2_3_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_2_3_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_d_e_p_r_e_c_a_t_e_d___1_2_4_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|missing_file_sizes |130 |The resume data file is missing | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_ _f_i_l_e_ _s_i_z_e_s_ _e_n_t_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|no_files_in_resume_data |131 |The resume data file file sizes | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_n_t_r_y_ _i_s_ _e_m_p_t_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|missing_pieces |132 |The resume data file is missing | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_ _p_i_e_c_e_s_ _a_n_d_ _s_l_o_t_s_ _e_n_t_r_y_ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The number of files in the resume | │ │ │ │ │ +|mismatching_number_of_files |133 |data does not match the number of | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_f_i_l_e_s_ _i_n_ _t_h_e_ _t_o_r_r_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |One of the files on disk has a | │ │ │ │ │ +|mismatching_file_size |134 |different size than in the fast | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_s_u_m_e_ _f_i_l_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |One of the files on disk has a | │ │ │ │ │ +|mismatching_file_timestamp |135 |different timestamp than in the | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_f_a_s_t_ _r_e_s_u_m_e_ _f_i_l_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|not_a_dictionary |136 |The resume data file is not a | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_d_i_c_t_i_o_n_a_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_blocks_per_piece |137 |The blocks per piece _e_n_t_r_y is | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _i_n_ _t_h_e_ _r_e_s_u_m_e_ _d_a_t_a_ _f_i_l_e_ _ _ | │ │ │ │ │ +| | |The resume file is missing the | │ │ │ │ │ +|missing_slots |138 |slots _e_n_t_r_y, which is required for| │ │ │ │ │ +| | |torrents with compact allocation. | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_DD_EE_PP_RR_EE_CC_AA_TT_EE_DD_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|too_many_slots |139 |The resume file contains more | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_l_o_t_s_ _t_h_a_n_ _t_h_e_ _t_o_r_r_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_slot_list |140 |The slot _e_n_t_r_y is invalid in the | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_s_u_m_e_ _d_a_t_a_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_piece_index |141 |One index in the slot list is | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The pieces on disk needs to be re-| │ │ │ │ │ +| | |ordered for the specified | │ │ │ │ │ +| | |allocation mode. This happens if | │ │ │ │ │ +|pieces_need_reorder |142 |you specify sparse allocation and | │ │ │ │ │ +| | |the files on disk are using | │ │ │ │ │ +| | |compact storage. The pieces needs | │ │ │ │ │ +| | |to be moved to their right | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_o_s_i_t_i_o_n_._ _DD_EE_PP_RR_EE_CC_AA_TT_EE_DD_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |this error is returned when asking| │ │ │ │ │ +| | |to save resume data and specifying| │ │ │ │ │ +|resume_data_not_modified |143 |the flag to only save when there's| │ │ │ │ │ +| | |anything new to save | │ │ │ │ │ +| | |(_t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_o_n_l_y___i_f___m_o_d_i_f_i_e_d)| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_n_d_ _t_h_e_r_e_ _w_a_s_n_'_t_ _a_n_y_t_h_i_n_g_ _c_h_a_n_g_e_d_.| │ │ │ │ │ +|invalid_save_path |144 |the save_path in | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s_ _i_s_ _n_o_t_ _v_a_l_i_d_ _ _ | │ │ │ │ │ +|http_parse_error |150 |The HTTP header was not correctly | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_f_o_r_m_a_t_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The HTTP response was in the 300- | │ │ │ │ │ +|http_missing_location |151 |399 range but lacked a location | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_h_e_a_d_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The HTTP response was encoded with| │ │ │ │ │ +|http_failed_decompress |152 |gzip or deflate but decompressing | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_t_ _f_a_i_l_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|no_i2p_router |160 |The URL specified an i2p address, | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_b_u_t_ _n_o_ _i_2_p_ _r_o_u_t_e_r_ _i_s_ _c_o_n_f_i_g_u_r_e_d_ _ _ | │ │ │ │ │ +|no_i2p_endpoint |161 |i2p acceptor is not available yet,| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_a_n_'_t_ _a_n_n_o_u_n_c_e_ _w_i_t_h_o_u_t_ _e_n_d_p_o_i_n_t_ _ _ | │ │ │ │ │ +| | |The tracker URL doesn't support | │ │ │ │ │ +|scrape_not_available |170 |transforming it into a scrape URL.| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_._e_._ _i_t_ _d_o_e_s_n_'_t_ _c_o_n_t_a_i_n_ _"_a_n_n_o_u_n_c_e_.| │ │ │ │ │ +|_i_n_v_a_l_i_d___t_r_a_c_k_e_r___r_e_s_p_o_n_s_e_ _ _ _ _ _ _ _ _ _ _ _ _|_1_7_1_ _ _|_i_n_v_a_l_i_d_ _t_r_a_c_k_e_r_ _r_e_s_p_o_n_s_e_ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_peer_dict |172 |invalid peer dictionary _e_n_t_r_y. Not| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_ _d_i_c_t_i_o_n_a_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_t_r_a_c_k_e_r___f_a_i_l_u_r_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_7_3_ _ _|_t_r_a_c_k_e_r_ _s_e_n_t_ _a_ _f_a_i_l_u_r_e_ _m_e_s_s_a_g_e_ _ _ _ | │ │ │ │ │ +|_i_n_v_a_l_i_d___f_i_l_e_s___e_n_t_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_7_4_ _ _|_m_i_s_s_i_n_g_ _o_r_ _i_n_v_a_l_i_d_ _f_i_l_e_s_ _e_n_t_r_y_ _ _ _ | │ │ │ │ │ +|_i_n_v_a_l_i_d___h_a_s_h___e_n_t_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_7_5_ _ _|_m_i_s_s_i_n_g_ _o_r_ _i_n_v_a_l_i_d_ _h_a_s_h_ _e_n_t_r_y_ _ _ _ _ | │ │ │ │ │ +|invalid_peers_entry |176 |missing or invalid peers and | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_e_e_r_s_6_ _e_n_t_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_tracker_response_length |177 |UDP tracker response packet has | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _s_i_z_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_tracker_transaction_id |178 |invalid transaction id in UDP | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_r_a_c_k_e_r_ _r_e_s_p_o_n_s_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_tracker_action |179 |invalid action field in UDP | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_r_a_c_k_e_r_ _r_e_s_p_o_n_s_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |skipped announce (because it's | │ │ │ │ │ +|announce_skipped |180 |assumed to be unreachable over the| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_g_i_v_e_n_ _s_o_u_r_c_e_ _n_e_t_w_o_r_k_ _i_n_t_e_r_f_a_c_e_)_ _ _ | │ │ │ │ │ +|_n_o___e_n_t_r_o_p_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_2_0_0_ _ _|_r_a_n_d_o_m_ _n_u_m_b_e_r_ _g_e_n_e_r_a_t_i_o_n_ _f_a_i_l_e_d_ _ _ | │ │ │ │ │ +|_s_s_r_f___m_i_t_i_g_a_t_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_2_0_1_ _ _|_b_l_o_c_k_e_d_ _b_y_ _S_S_R_F_ _m_i_t_i_g_a_t_i_o_n_ _ _ _ _ _ _ _ | │ │ │ │ │ +|blocked_by_idna |202 |blocked because IDNA host names | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_r_e_ _b_a_n_n_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|torrent_unknown_version |210 |the torrent file has an unknown | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_t_a_ _v_e_r_s_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|torrent_missing_file_tree |211 |the v2 torrent file has no file | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_r_e_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|torrent_missing_meta_version |212 |the torrent contains v2 keys but | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_d_o_e_s_ _n_o_t_ _s_p_e_c_i_f_y_ _m_e_t_a_ _v_e_r_s_i_o_n_ _2_ _ _ | │ │ │ │ │ +|torrent_inconsistent_files |213 |the v1 and v2 file metadata does | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_n_o_t_ _m_a_t_c_h_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|torrent_missing_piece_layer |214 |one or more files are missing | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_i_e_c_e_ _l_a_y_e_r_ _h_a_s_h_e_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|torrent_invalid_piece_layer |215 |a piece layer has the wrong size | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_r_ _f_a_i_l_e_d_ _h_a_s_h_ _c_h_e_c_k_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_t_o_r_r_e_n_t___m_i_s_s_i_n_g___p_i_e_c_e_s___r_o_o_t_ _ _ _ _ _ _ _ _ _|_2_1_6_ _ _|_a_ _v_2_ _f_i_l_e_ _e_n_t_r_y_ _h_a_s_ _n_o_ _r_o_o_t_ _h_a_s_h_ _ | │ │ │ │ │ +|torrent_inconsistent_hashes |217 |the v1 and v2 hashes do not | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_d_e_s_c_r_i_b_e_ _t_h_e_ _s_a_m_e_ _d_a_t_a_ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|torrent_invalid_pad_file |218 |a file in the v2 metadata has the | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_a_d_ _a_t_t_r_i_b_u_t_e_ _s_e_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_e_r_r_o_r___c_o_d_e___m_a_x_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_2_1_9_ _ _|_t_h_e_ _n_u_m_b_e_r_ _o_f_ _e_r_r_o_r_ _c_o_d_e_s_ _ _ _ _ _ _ _ _ | │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ eennuumm hhttttpp__eerrrroorrss ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_r_r_o_r___c_o_d_e_._h_p_p" │ │ │ │ │ + _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ +|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ +|_c_o_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_0_0_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_o_k_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_2_0_0_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_c_r_e_a_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_2_0_1_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_a_c_c_e_p_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _|_2_0_2_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_n_o___c_o_n_t_e_n_t_ _ _ _ _ _ _ _ _ _ _ _|_2_0_4_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_m_u_l_t_i_p_l_e___c_h_o_i_c_e_s_ _ _ _ _ _|_3_0_0_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_m_o_v_e_d___p_e_r_m_a_n_e_n_t_l_y_ _ _ _ _|_3_0_1_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_m_o_v_e_d___t_e_m_p_o_r_a_r_i_l_y_ _ _ _ _|_3_0_2_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_n_o_t___m_o_d_i_f_i_e_d_ _ _ _ _ _ _ _ _ _|_3_0_4_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_b_a_d___r_e_q_u_e_s_t_ _ _ _ _ _ _ _ _ _ _|_4_0_0_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_u_n_a_u_t_h_o_r_i_z_e_d_ _ _ _ _ _ _ _ _ _|_4_0_1_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_f_o_r_b_i_d_d_e_n_ _ _ _ _ _ _ _ _ _ _ _ _|_4_0_3_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_n_o_t___f_o_u_n_d_ _ _ _ _ _ _ _ _ _ _ _ _|_4_0_4_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_i_n_t_e_r_n_a_l___s_e_r_v_e_r___e_r_r_o_r_|_5_0_0_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_n_o_t___i_m_p_l_e_m_e_n_t_e_d_ _ _ _ _ _ _|_5_0_1_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_b_a_d___g_a_t_e_w_a_y_ _ _ _ _ _ _ _ _ _ _|_5_0_2_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_s_e_r_v_i_c_e___u_n_a_v_a_i_l_a_b_l_e_ _ _|_5_0_3_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ eennuumm eerrrroorr__ccooddee__eennuumm ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_u_p_n_p_._h_p_p" │ │ │ │ │ + _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ +|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_n_o___e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_0_ _ _ _ _|_N_o_ _e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_argument |402 |One of the arguments in the request | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_s_ _i_n_v_a_l_i_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_a_c_t_i_o_n___f_a_i_l_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_5_0_1_ _ _|_T_h_e_ _r_e_q_u_e_s_t_ _f_a_i_l_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|value_not_in_array |714 |The specified value does not exist | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_ _t_h_e_ _a_r_r_a_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The source IP address cannot be | │ │ │ │ │ +|source_ip_cannot_be_wildcarded |715 |wild-carded, but must be fully | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_p_e_c_i_f_i_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|external_port_cannot_be_wildcarded|716 |The external port cannot be a | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_w_i_l_d_c_a_r_d_,_ _b_u_t_ _m_u_s_t_ _b_e_ _s_p_e_c_i_f_i_e_d_ _ _ _ _ | │ │ │ │ │ +| | |The port mapping _e_n_t_r_y specified | │ │ │ │ │ +|port_mapping_conflict |718 |conflicts with a mapping assigned | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_r_e_v_i_o_u_s_l_y_ _t_o_ _a_n_o_t_h_e_r_ _c_l_i_e_n_t_ _ _ _ _ _ _ _ | │ │ │ │ │ +|internal_port_must_match_external |724 |Internal and external port value | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_u_s_t_ _b_e_ _t_h_e_ _s_a_m_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The NAT implementation only supports| │ │ │ │ │ +|only_permanent_leases_supported |725 |permanent lease times on port | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_a_p_p_i_n_g_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |RemoteHost must be a wildcard and | │ │ │ │ │ +|remote_host_must_be_wildcard |726 |cannot be a specific IP address or | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_D_N_S_ _n_a_m_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|external_port_must_be_wildcard |727 |ExternalPort must be a wildcard and | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_a_n_n_o_t_ _b_e_ _a_ _s_p_e_c_i_f_i_c_ _p_o_r_t_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ eennuumm eerrrroorr__ccooddee__eennuumm ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_g_z_i_p_._h_p_p" │ │ │ │ │ + _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ +|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_n_o___e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_0_ _ _ _ _|_N_o_t_ _a_n_ _e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|invalid_gzip_header |1 |the supplied gzip buffer has | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _h_e_a_d_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |the gzip buffer would inflate to | │ │ │ │ │ +|inflated_data_too_large |2 |more bytes than the specified | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_a_x_i_m_u_m_ _s_i_z_e_,_ _a_n_d_ _w_a_s_ _r_e_j_e_c_t_e_d_._ _ _ _ | │ │ │ │ │ +|data_did_not_terminate |3 |available inflate data did not | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_e_r_m_i_n_a_t_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|space_exhausted |4 |output space exhausted before | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_o_m_p_l_e_t_i_n_g_ _i_n_f_l_a_t_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_i_n_v_a_l_i_d___b_l_o_c_k___t_y_p_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_5_ _ _ _ _|_i_n_v_a_l_i_d_ _b_l_o_c_k_ _t_y_p_e_ _(_t_y_p_e_ _=_=_ _3_)_ _ _ _ _ | │ │ │ │ │ +|invalid_stored_block_length |6 |stored block length did not match | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_n_e_'_s_ _c_o_m_p_l_e_m_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|too_many_length_or_distance_codes |7 |dynamic block code description: too| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_a_n_y_ _l_e_n_g_t_h_ _o_r_ _d_i_s_t_a_n_c_e_ _c_o_d_e_s_ _ _ _ _ _ | │ │ │ │ │ +|code_lengths_codes_incomplete |8 |dynamic block code description: | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_o_d_e_ _l_e_n_g_t_h_s_ _c_o_d_e_s_ _i_n_c_o_m_p_l_e_t_e_ _ _ _ _ _ | │ │ │ │ │ +|repeat_lengths_with_no_first_length|9 |dynamic block code description: | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_p_e_a_t_ _l_e_n_g_t_h_s_ _w_i_t_h_ _n_o_ _f_i_r_s_t_ _l_e_n_g_t_h| │ │ │ │ │ +|repeat_more_than_specified_lengths |10 |dynamic block code description: | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_p_e_a_t_ _m_o_r_e_ _t_h_a_n_ _s_p_e_c_i_f_i_e_d_ _l_e_n_g_t_h_s_ | │ │ │ │ │ +|invalid_literal_length_code_lengths|11 |dynamic block code description: | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _l_i_t_e_r_a_l_/_l_e_n_g_t_h_ _c_o_d_e_ _l_e_n_g_t_h_s| │ │ │ │ │ +|invalid_distance_code_lengths |12 |dynamic block code description: | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _d_i_s_t_a_n_c_e_ _c_o_d_e_ _l_e_n_g_t_h_s_ _ _ _ _ _ | │ │ │ │ │ +|invalid_literal_code_in_block |13 |invalid literal/length or distance | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_o_d_e_ _i_n_ _f_i_x_e_d_ _o_r_ _d_y_n_a_m_i_c_ _b_l_o_c_k_ _ _ _ _ | │ │ │ │ │ +|distance_too_far_back_in_block |14 |distance is too far back in fixed | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_r_ _d_y_n_a_m_i_c_ _b_l_o_c_k_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|unknown_gzip_error |15 |an unknown error occurred during | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_g_z_i_p_ _i_n_f_l_a_t_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_e_r_r_o_r___c_o_d_e___m_a_x_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_6_ _ _ _|_t_h_e_ _n_u_m_b_e_r_ _o_f_ _e_r_r_o_r_ _c_o_d_e_s_ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ eennuumm ppccpp__eerrrroorrss ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_n_a_t_p_m_p_._h_p_p" │ │ │ │ │ + _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ +|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ +|_p_c_p___s_u_c_c_e_s_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_c_p___u_n_s_u_p_p___v_e_r_s_i_o_n_ _ _ _ _ _ _ _ _ _|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_c_p___n_o_t___a_u_t_h_o_r_i_z_e_d_ _ _ _ _ _ _ _ _ _|_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_c_p___m_a_l_f_o_r_m_e_d___r_e_q_u_e_s_t_ _ _ _ _ _ _|_3_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_c_p___u_n_s_u_p_p___o_p_c_o_d_e_ _ _ _ _ _ _ _ _ _ _|_4_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_c_p___u_n_s_u_p_p___o_p_t_i_o_n_ _ _ _ _ _ _ _ _ _ _|_5_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_c_p___m_a_l_f_o_r_m_e_d___o_p_t_i_o_n_ _ _ _ _ _ _ _|_6_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_c_p___n_e_t_w_o_r_k___f_a_i_l_u_r_e_ _ _ _ _ _ _ _ _|_7_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_c_p___n_o___r_e_s_o_u_r_c_e_s_ _ _ _ _ _ _ _ _ _ _ _|_8_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_c_p___u_n_s_u_p_p___p_r_o_t_o_c_o_l_ _ _ _ _ _ _ _ _|_9_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_c_p___u_s_e_r___e_x___q_u_o_t_a_ _ _ _ _ _ _ _ _ _ _|_1_0_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_c_p___c_a_n_n_o_t___p_r_o_v_i_d_e___e_x_t_e_r_n_a_l_|_1_1_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_c_p___a_d_d_r_e_s_s___m_i_s_m_a_t_c_h_ _ _ _ _ _ _ _|_1_2_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_c_p___e_x_c_e_s_s_i_v_e___r_e_m_o_t_e___p_e_e_r_s_ _|_1_3_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ eennuumm ssoocckkss__eerrrroorr__ccooddee ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_o_c_k_s_5___s_t_r_e_a_m_._h_p_p" │ │ │ │ │ + _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ +|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ +|_n_o___e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_u_n_s_u_p_p_o_r_t_e_d___v_e_r_s_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_u_n_s_u_p_p_o_r_t_e_d___a_u_t_h_e_n_t_i_c_a_t_i_o_n___m_e_t_h_o_d_ _|_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_u_n_s_u_p_p_o_r_t_e_d___a_u_t_h_e_n_t_i_c_a_t_i_o_n___v_e_r_s_i_o_n_|_3_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_a_u_t_h_e_n_t_i_c_a_t_i_o_n___e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_4_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_u_s_e_r_n_a_m_e___r_e_q_u_i_r_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_5_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_g_e_n_e_r_a_l___f_a_i_l_u_r_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_6_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_c_o_m_m_a_n_d___n_o_t___s_u_p_p_o_r_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _|_7_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_n_o___i_d_e_n_t_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_8_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_i_d_e_n_t_d___e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_9_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_n_u_m___e_r_r_o_r_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_0_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ eennuumm eerrrroorr__ccooddee__eennuumm ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_b_d_e_c_o_d_e_._h_p_p" │ │ │ │ │ + _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ +|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_n_o___e_r_r_o_r_ _ _ _ _ _ _|_0_ _ _ _ _|_N_o_t_ _a_n_ _e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_e_x_p_e_c_t_e_d___d_i_g_i_t_|_1_ _ _ _ _|_e_x_p_e_c_t_e_d_ _d_i_g_i_t_ _i_n_ _b_e_n_c_o_d_e_d_ _s_t_r_i_n_g_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_e_x_p_e_c_t_e_d___c_o_l_o_n_|_2_ _ _ _ _|_e_x_p_e_c_t_e_d_ _c_o_l_o_n_ _i_n_ _b_e_n_c_o_d_e_d_ _s_t_r_i_n_g_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_u_n_e_x_p_e_c_t_e_d___e_o_f_|_3_ _ _ _ _|_u_n_e_x_p_e_c_t_e_d_ _e_n_d_ _o_f_ _f_i_l_e_ _i_n_ _b_e_n_c_o_d_e_d_ _s_t_r_i_n_g_ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|expected_value|4 |expected value (list, dict, _i_n_t or string) in bencoded| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_t_r_i_n_g_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_d_e_p_t_h___e_x_c_e_e_d_e_d_|_5_ _ _ _ _|_b_e_n_c_o_d_e_d_ _r_e_c_u_r_s_i_o_n_ _d_e_p_t_h_ _l_i_m_i_t_ _e_x_c_e_e_d_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_l_i_m_i_t___e_x_c_e_e_d_e_d_|_6_ _ _ _ _|_b_e_n_c_o_d_e_d_ _i_t_e_m_ _c_o_u_n_t_ _l_i_m_i_t_ _e_x_c_e_e_d_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_o_v_e_r_f_l_o_w_ _ _ _ _ _ _|_7_ _ _ _ _|_i_n_t_e_g_e_r_ _o_v_e_r_f_l_o_w_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_e_r_r_o_r___c_o_d_e___m_a_x_|_8_ _ _ _ _|_t_h_e_ _n_u_m_b_e_r_ _o_f_ _e_r_r_o_r_ _c_o_d_e_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ iinnffoo__hhaasshh__tt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_i_n_f_o___h_a_s_h_._h_p_p" │ │ │ │ │ class holding the info-hash of a torrent. It can hold a v1 info-hash (SHA-1) or │ │ │ │ │ a v2 info-hash (SHA-256) or both. │ │ │ │ │ Note │ │ │ │ │ If has_v2() is false then the v1 hash might actually be a truncated v2 hash │ │ │ │ │ struct info_hash_t │ │ │ │ │ { │ │ │ │ │ iinnffoo__hhaasshh__tt () noexcept = default; │ │ │ │ │ explicit iinnffoo__hhaasshh__tt (sha256_hash h2) noexcept; │ │ │ │ │ iinnffoo__hhaasshh__tt (sha1_hash h1, sha256_hash h2) noexcept; │ │ │ │ │ explicit iinnffoo__hhaasshh__tt (sha1_hash h1) noexcept; │ │ │ │ │ - bool hhaass__vv11 () const; │ │ │ │ │ - bool hhaass (protocol_version v) const; │ │ │ │ │ bool hhaass__vv22 () const; │ │ │ │ │ + bool hhaass (protocol_version v) const; │ │ │ │ │ + bool hhaass__vv11 () const; │ │ │ │ │ sha1_hash ggeett (protocol_version v) const; │ │ │ │ │ sha1_hash ggeett__bbeesstt () const; │ │ │ │ │ friend bool ooppeerraattoorr!!== (info_hash_t const& lhs, info_hash_t const& rhs); │ │ │ │ │ friend bool ooppeerraattoorr==== (info_hash_t const& lhs, info_hash_t const& rhs) │ │ │ │ │ noexcept; │ │ │ │ │ template void ffoorr__eeaacchh (F f) const; │ │ │ │ │ bool ooppeerraattoorr<< (info_hash_t const& o) const; │ │ │ │ │ @@ -681,18 +1270,18 @@ │ │ │ │ │ iinnffoo__hhaasshh__tt (sha1_hash h1, sha256_hash h2) noexcept; │ │ │ │ │ explicit iinnffoo__hhaasshh__tt (sha1_hash h1) noexcept; │ │ │ │ │ The default constructor creates an object that has neither a v1 or v2 hash. │ │ │ │ │ For backwards compatibility, make it possible to construct directly from a v1 │ │ │ │ │ hash. This constructor allows iimmpplliicciitt conversion from a v1 hash, but the │ │ │ │ │ implicitness is deprecated. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** hhaass__vv22(()) hhaass(()) hhaass__vv11(()) ********** │ │ │ │ │ -bool hhaass__vv11 () const; │ │ │ │ │ -bool hhaass (protocol_version v) const; │ │ │ │ │ +********** hhaass__vv11(()) hhaass(()) hhaass__vv22(()) ********** │ │ │ │ │ bool hhaass__vv22 () const; │ │ │ │ │ +bool hhaass (protocol_version v) const; │ │ │ │ │ +bool hhaass__vv11 () const; │ │ │ │ │ returns true if the corresponding info hash is present in this object. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ggeett(()) ********** │ │ │ │ │ sha1_hash ggeett (protocol_version v) const; │ │ │ │ │ returns the has for the specified protocol version │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ggeett__bbeesstt(()) ********** │ │ │ │ │ @@ -1105,24 +1694,67 @@ │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ start │ │ │ │ │ The byte offset within that piece where the range starts. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ length │ │ │ │ │ The size of the range, in bytes. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ppiieeccee__bblloocckk ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_i_e_c_e___b_l_o_c_k_._h_p_p" │ │ │ │ │ +struct piece_block │ │ │ │ │ +{ │ │ │ │ │ + ppiieeccee__bblloocckk (piece_index_t p_index, int b_index); │ │ │ │ │ + ppiieeccee__bblloocckk () = default; │ │ │ │ │ + bool ooppeerraattoorr<< (piece_block const& b) const; │ │ │ │ │ + bool ooppeerraattoorr==== (piece_block const& b) const; │ │ │ │ │ + bool ooppeerraattoorr!!== (piece_block const& b) const; │ │ │ │ │ + │ │ │ │ │ + static const piece_block invalid; │ │ │ │ │ + piece_index_t piece_index {0}; │ │ │ │ │ + int bblloocckk__iinnddeexx = 0; │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ llooaadd__ttoorrrreenntt__bbuuffffeerr(()) llooaadd__ttoorrrreenntt__ffiillee(()) llooaadd__ttoorrrreenntt__ppaarrsseedd(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_l_o_a_d___t_o_r_r_e_n_t_._h_p_p" │ │ │ │ │ +add_torrent_params llooaadd__ttoorrrreenntt__bbuuffffeerr ( │ │ │ │ │ + span buffer, load_torrent_limits const& cfg); │ │ │ │ │ +add_torrent_params llooaadd__ttoorrrreenntt__ppaarrsseedd ( │ │ │ │ │ + bdecode_node const& torrent_file, load_torrent_limits const& cfg); │ │ │ │ │ +add_torrent_params llooaadd__ttoorrrreenntt__ffiillee ( │ │ │ │ │ + std::string const& filename, load_torrent_limits const& cfg); │ │ │ │ │ +add_torrent_params llooaadd__ttoorrrreenntt__ffiillee ( │ │ │ │ │ + std::string const& filename); │ │ │ │ │ +add_torrent_params llooaadd__ttoorrrreenntt__bbuuffffeerr ( │ │ │ │ │ + span buffer); │ │ │ │ │ +add_torrent_params llooaadd__ttoorrrreenntt__ppaarrsseedd ( │ │ │ │ │ + bdecode_node const& torrent_file); │ │ │ │ │ +These functions load the content of a .torrent file into an _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s │ │ │ │ │ +object. The immutable part of a torrent file (the info-dictionary) is stored in │ │ │ │ │ +the ti field in the _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s object (as a _t_o_r_r_e_n_t___i_n_f_o object). The │ │ │ │ │ +returned object is suitable to be: │ │ │ │ │ + * added to a _s_e_s_s_i_o_n via _a_d_d___t_o_r_r_e_n_t_(_) or _a_s_y_n_c___a_d_d___t_o_r_r_e_n_t_(_) │ │ │ │ │ + * saved as a .torrent_file via _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e_(_) │ │ │ │ │ + * turned into a magnet link via _m_a_k_e___m_a_g_n_e_t___u_r_i_(_) │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ttoorrrreenntt__ppeeeerr__eeqquuaall(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___p_e_e_r_._h_p_p" │ │ │ │ │ inline bool ttoorrrreenntt__ppeeeerr__eeqquuaall (torrent_peer const* lhs, torrent_peer const* │ │ │ │ │ rhs); │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ vveerrssiioonn(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_v_e_r_s_i_o_n_._h_p_p" │ │ │ │ │ +char const* vveerrssiioonn (); │ │ │ │ │ +returns the libtorrent version as string form in this format: │ │ │ │ │ +"..." │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ mmaakkee__mmaaggnneett__uurrii(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_m_a_g_n_e_t___u_r_i_._h_p_p" │ │ │ │ │ -std::string mmaakkee__mmaaggnneett__uurrii (torrent_info const& info); │ │ │ │ │ std::string mmaakkee__mmaaggnneett__uurrii (torrent_handle const& handle); │ │ │ │ │ std::string mmaakkee__mmaaggnneett__uurrii (add_torrent_params const& atp); │ │ │ │ │ +std::string mmaakkee__mmaaggnneett__uurrii (torrent_info const& info); │ │ │ │ │ Generates a magnet URI from the specified torrent. │ │ │ │ │ Several fields from the _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s objects are recorded in the magnet │ │ │ │ │ link. In order to not include them, they have to be cleared before calling │ │ │ │ │ _m_a_k_e___m_a_g_n_e_t___u_r_i_(_). These fields are used: │ │ │ │ │ ti, info_hashes, url_seeds, dht_nodes, file_priorities, trackers, │ │ │ │ │ name, peers. │ │ │ │ │ Depending on what the use case for the resulting magnet link is, clearing peers │ │ │ │ │ @@ -1137,80 +1769,70 @@ │ │ │ │ │ The overload that takes a _t_o_r_r_e_n_t___h_a_n_d_l_e will make blocking calls to query │ │ │ │ │ information about the torrent. If the torrent handle is invalid, an empty │ │ │ │ │ string is returned. │ │ │ │ │ For more information about magnet links, see _m_a_g_n_e_t_ _l_i_n_k_s. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ppaarrssee__mmaaggnneett__uurrii(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_m_a_g_n_e_t___u_r_i_._h_p_p" │ │ │ │ │ -add_torrent_params ppaarrssee__mmaaggnneett__uurrii (string_view uri); │ │ │ │ │ -add_torrent_params ppaarrssee__mmaaggnneett__uurrii (string_view uri, error_code& ec); │ │ │ │ │ void ppaarrssee__mmaaggnneett__uurrii (string_view uri, add_torrent_params& p, error_code& ec); │ │ │ │ │ +add_torrent_params ppaarrssee__mmaaggnneett__uurrii (string_view uri, error_code& ec); │ │ │ │ │ +add_torrent_params ppaarrssee__mmaaggnneett__uurrii (string_view uri); │ │ │ │ │ This function parses out information from the magnet link and populates the │ │ │ │ │ _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s object. The overload that does not take an error_code │ │ │ │ │ reference will throw a system_error on error The overload taking an │ │ │ │ │ add_torrent_params reference will fill in the fields specified in the magnet │ │ │ │ │ URI. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ttrruunnccaattee__ffiilleess(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_r_u_n_c_a_t_e_._h_p_p" │ │ │ │ │ void ttrruunnccaattee__ffiilleess (file_storage const& fs, std::string const& save_path, │ │ │ │ │ storage_error& ec); │ │ │ │ │ Truncates files larger than specified in the _f_i_l_e___s_t_o_r_a_g_e, saved under the │ │ │ │ │ specified save_path. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ vveerrssiioonn(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_v_e_r_s_i_o_n_._h_p_p" │ │ │ │ │ -char const* vveerrssiioonn (); │ │ │ │ │ -returns the libtorrent version as string form in this format: │ │ │ │ │ -"..." │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ llooaadd__ttoorrrreenntt__bbuuffffeerr(()) llooaadd__ttoorrrreenntt__ffiillee(()) llooaadd__ttoorrrreenntt__ppaarrsseedd(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_l_o_a_d___t_o_r_r_e_n_t_._h_p_p" │ │ │ │ │ -add_torrent_params llooaadd__ttoorrrreenntt__ffiillee ( │ │ │ │ │ - std::string const& filename, load_torrent_limits const& cfg); │ │ │ │ │ -add_torrent_params llooaadd__ttoorrrreenntt__bbuuffffeerr ( │ │ │ │ │ - span buffer); │ │ │ │ │ -add_torrent_params llooaadd__ttoorrrreenntt__ppaarrsseedd ( │ │ │ │ │ - bdecode_node const& torrent_file, load_torrent_limits const& cfg); │ │ │ │ │ -add_torrent_params llooaadd__ttoorrrreenntt__ppaarrsseedd ( │ │ │ │ │ - bdecode_node const& torrent_file); │ │ │ │ │ -add_torrent_params llooaadd__ttoorrrreenntt__ffiillee ( │ │ │ │ │ - std::string const& filename); │ │ │ │ │ -add_torrent_params llooaadd__ttoorrrreenntt__bbuuffffeerr ( │ │ │ │ │ - span buffer, load_torrent_limits const& cfg); │ │ │ │ │ -These functions load the content of a .torrent file into an _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s │ │ │ │ │ -object. The immutable part of a torrent file (the info-dictionary) is stored in │ │ │ │ │ -the ti field in the _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s object (as a _t_o_r_r_e_n_t___i_n_f_o object). The │ │ │ │ │ -returned object is suitable to be: │ │ │ │ │ - * added to a _s_e_s_s_i_o_n via _a_d_d___t_o_r_r_e_n_t_(_) or _a_s_y_n_c___a_d_d___t_o_r_r_e_n_t_(_) │ │ │ │ │ - * saved as a .torrent_file via _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e_(_) │ │ │ │ │ - * turned into a magnet link via _m_a_k_e___m_a_g_n_e_t___u_r_i_(_) │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ eennuumm pprroottooccooll__vveerrssiioonn ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_i_n_f_o___h_a_s_h_._h_p_p" │ │ │ │ │ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ |_nn_aa_mm_ee_|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_V_1_ _ _|_0_ _ _ _ _|_T_h_e_ _o_r_i_g_i_n_a_l_ _B_i_t_T_o_r_r_e_n_t_ _v_e_r_s_i_o_n_,_ _u_s_i_n_g_ _S_H_A_-_1_ _h_a_s_h_e_s_ _ _ _ _ _ _ | │ │ │ │ │ |_V_2_ _ _|_1_ _ _ _ _|_V_e_r_s_i_o_n_ _2_ _o_f_ _t_h_e_ _B_i_t_T_o_r_r_e_n_t_ _p_r_o_t_o_c_o_l_,_ _u_s_i_n_g_ _S_H_A_-_2_5_6_ _h_a_s_h_e_s| │ │ │ │ │ |_N_U_M_ _|_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ eennuumm ccoonnnneeccttiioonn__ttyyppee ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._h_p_p" │ │ │ │ │ + _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ +|_nn_aa_mm_ee_ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ +|_b_i_t_t_o_r_r_e_n_t_|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_u_r_l___s_e_e_d_ _ _|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_h_t_t_p___s_e_e_d_ _|_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ eennuumm ssoocckkeett__ttyyppee__tt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_o_c_k_e_t___t_y_p_e_._h_p_p" │ │ │ │ │ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ |_nn_aa_mm_ee_ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ |_t_c_p_ _ _ _ _ _ _ _|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_s_o_c_k_s_5_ _ _ _ _|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_h_t_t_p_ _ _ _ _ _ _|_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_u_t_p_ _ _ _ _ _ _ _|_3_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_i_2_p_ _ _ _ _ _ _ _|_4_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_t_c_p___s_s_l_ _ _ _|_5_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_s_o_c_k_s_5___s_s_l_|_6_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_h_t_t_p___s_s_l_ _ _|_7_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_u_t_p___s_s_l_ _ _ _|_8_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ eennuumm eevveenntt__tt ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_r_a_c_k_e_r___m_a_n_a_g_e_r_._h_p_p" │ │ │ │ │ + _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ +|_nn_aa_mm_ee_ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ +|_n_o_n_e_ _ _ _ _ _|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_c_o_m_p_l_e_t_e_d_|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_s_t_a_r_t_e_d_ _ _|_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_s_t_o_p_p_e_d_ _ _|_3_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_a_u_s_e_d_ _ _ _|_4_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ eennuumm ppoorrttmmaapp__ttrraannssppoorrtt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_o_r_t_m_a_p_._h_p_p" │ │ │ │ │ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ |_nn_aa_mm_ee_ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_n_a_t_p_m_p_|_0_ _ _ _ _|_n_a_t_p_m_p_ _c_a_n_ _b_e_ _N_A_T_-_P_M_P_ _o_r_ _P_C_P| │ │ │ │ │ |_u_p_n_p_ _ _|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ @@ -1218,31 +1840,32 @@ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_o_r_t_m_a_p_._h_p_p" │ │ │ │ │ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ |_nn_aa_mm_ee_|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ |_n_o_n_e_|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_t_c_p_ _|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_u_d_p_ _|_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ eennuumm eevveenntt__tt ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_r_a_c_k_e_r___m_a_n_a_g_e_r_._h_p_p" │ │ │ │ │ - _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ -|_nn_aa_mm_ee_ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ -|_n_o_n_e_ _ _ _ _ _|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_c_o_m_p_l_e_t_e_d_|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_s_t_a_r_t_e_d_ _ _|_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_s_t_o_p_p_e_d_ _ _|_3_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_a_u_s_e_d_ _ _ _|_4_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +************ iinntt ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_v_e_r_s_i_o_n_._h_p_p" │ │ │ │ │ + version_major │ │ │ │ │ + the major, minor and tiny versions of libtorrent │ │ │ │ │ + version_minor │ │ │ │ │ + the major, minor and tiny versions of libtorrent │ │ │ │ │ + version_tiny │ │ │ │ │ + the major, minor and tiny versions of libtorrent │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ eennuumm ccoonnnneeccttiioonn__ttyyppee ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._h_p_p" │ │ │ │ │ - _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ -|_nn_aa_mm_ee_ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ -|_b_i_t_t_o_r_r_e_n_t_|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_u_r_l___s_e_e_d_ _ _|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_h_t_t_p___s_e_e_d_ _|_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +************ cchhaarr ccoonnsstt** ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_v_e_r_s_i_o_n_._h_p_p" │ │ │ │ │ + version_str │ │ │ │ │ + the libtorrent version in string form │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ssttdd::::uuiinntt6644__tt ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_v_e_r_s_i_o_n_._h_p_p" │ │ │ │ │ + version_revision │ │ │ │ │ + the git commit of this libtorrent version │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ttoorrrreenntt__ffllaaggss__tt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___f_l_a_g_s_._h_p_p" │ │ │ │ │ seed_mode │ │ │ │ │ If seed_mode is set, libtorrent will assume that all files are present │ │ │ │ │ for this torrent and that they all match the hashes in the torrent file. │ │ │ │ │ Each time a peer requests to download a block, the piece is verified │ │ │ │ │ @@ -1412,14 +2035,26 @@ │ │ │ │ │ This flag is set automatically when adding a torrent that has at least │ │ │ │ │ one tracker whose hostname ends with .i2p. It's also set by │ │ │ │ │ _p_a_r_s_e___m_a_g_n_e_t___u_r_i_(_) if the tracker list contains such URL. │ │ │ │ │ all │ │ │ │ │ all torrent flags combined. Can conveniently be used when creating masks │ │ │ │ │ for flags │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ddoowwnnllooaadd__pprriioorriittyy__tt ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_o_w_n_l_o_a_d___p_r_i_o_r_i_t_y_._h_p_p" │ │ │ │ │ + dont_download │ │ │ │ │ + Don't download the file or piece. Partial pieces may still be downloaded │ │ │ │ │ + when setting file priorities. │ │ │ │ │ + default_priority │ │ │ │ │ + The default priority for files and pieces. │ │ │ │ │ + low_priority │ │ │ │ │ + The lowest priority for files and pieces. │ │ │ │ │ + top_priority │ │ │ │ │ + The highest priority for files and pieces. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ppeexx__ffllaaggss__tt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_e_x___f_l_a_g_s_._h_p_p" │ │ │ │ │ pex_encryption │ │ │ │ │ the peer supports protocol encryption │ │ │ │ │ pex_seed │ │ │ │ │ the peer is a seed │ │ │ │ │ pex_utp │ │ │ │ │ @@ -1427,2604 +2062,14 @@ │ │ │ │ │ pex_holepunch │ │ │ │ │ the peer supports the holepunch extension If this flag is received from a │ │ │ │ │ peer, it can be used as a rendezvous point in case direct connections to │ │ │ │ │ the peer fail │ │ │ │ │ pex_lt_v2 │ │ │ │ │ protocol v2 this is not a standard flag, it is only used internally │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ddoowwnnllooaadd__pprriioorriittyy__tt ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_o_w_n_l_o_a_d___p_r_i_o_r_i_t_y_._h_p_p" │ │ │ │ │ - dont_download │ │ │ │ │ - Don't download the file or piece. Partial pieces may still be downloaded │ │ │ │ │ - when setting file priorities. │ │ │ │ │ - default_priority │ │ │ │ │ - The default priority for files and pieces. │ │ │ │ │ - low_priority │ │ │ │ │ - The lowest priority for files and pieces. │ │ │ │ │ - top_priority │ │ │ │ │ - The highest priority for files and pieces. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ iinntt ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_v_e_r_s_i_o_n_._h_p_p" │ │ │ │ │ - version_major │ │ │ │ │ - the major, minor and tiny versions of libtorrent │ │ │ │ │ - version_minor │ │ │ │ │ - the major, minor and tiny versions of libtorrent │ │ │ │ │ - version_tiny │ │ │ │ │ - the major, minor and tiny versions of libtorrent │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ cchhaarr ccoonnsstt** ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_v_e_r_s_i_o_n_._h_p_p" │ │ │ │ │ - version_str │ │ │ │ │ - the libtorrent version in string form │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ssttdd::::uuiinntt6644__tt ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_v_e_r_s_i_o_n_._h_p_p" │ │ │ │ │ - version_revision │ │ │ │ │ - the git commit of this libtorrent version │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ bblloocckk__iinnffoo ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ -holds the state of a block in a piece. Who we requested it from and how far │ │ │ │ │ -along we are at downloading it. │ │ │ │ │ -struct block_info │ │ │ │ │ -{ │ │ │ │ │ - _t_c_p_:_:_e_n_d_p_o_i_n_t ppeeeerr () const; │ │ │ │ │ - void sseett__ppeeeerr (tcp::endpoint const& ep); │ │ │ │ │ - │ │ │ │ │ - enum block_state_t │ │ │ │ │ - { │ │ │ │ │ - none, │ │ │ │ │ - requested, │ │ │ │ │ - writing, │ │ │ │ │ - finished, │ │ │ │ │ - }; │ │ │ │ │ - │ │ │ │ │ - unsigned bytes_progress:15; │ │ │ │ │ - unsigned block_size:15; │ │ │ │ │ - unsigned state:2; │ │ │ │ │ - unsigned num_peers:14; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__ppeeeerr(()) ppeeeerr(()) ********** │ │ │ │ │ -_t_c_p_:_:_e_n_d_p_o_i_n_t ppeeeerr () const; │ │ │ │ │ -void sseett__ppeeeerr (tcp::endpoint const& ep); │ │ │ │ │ -The peer is the ip address of the peer this block was downloaded from. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** eennuumm bblloocckk__ssttaattee__tt ********** │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ - _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ -|_nn_aa_mm_ee_ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|none |0 |This block has not been downloaded or requested form any | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_e_e_r_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|requested|1 |The block has been requested, but not completely downloaded| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_y_e_t_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|writing |2 |The block has been downloaded and is currently queued for | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_b_e_i_n_g_ _w_r_i_t_t_e_n_ _t_o_ _d_i_s_k_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_f_i_n_i_s_h_e_d_ _|_3_ _ _ _ _|_T_h_e_ _b_l_o_c_k_ _h_a_s_ _b_e_e_n_ _w_r_i_t_t_e_n_ _t_o_ _d_i_s_k_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - bytes_progress │ │ │ │ │ - the number of bytes that have been received for this block │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - block_size │ │ │ │ │ - the total number of bytes in this block. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - state │ │ │ │ │ - the state this block is in (see _b_l_o_c_k___s_t_a_t_e___t) │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - num_peers │ │ │ │ │ - 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. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ppaarrttiiaall__ppiieeccee__iinnffoo ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ -This class holds information about pieces that have outstanding requests or │ │ │ │ │ -outstanding writes │ │ │ │ │ -struct partial_piece_info │ │ │ │ │ -{ │ │ │ │ │ - piece_index_t piece_index; │ │ │ │ │ - int blocks_in_piece; │ │ │ │ │ - int finished; │ │ │ │ │ - int writing; │ │ │ │ │ - int requested; │ │ │ │ │ - block_info const* blocks; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - piece_index │ │ │ │ │ - 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. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - blocks_in_piece │ │ │ │ │ - the number of blocks in this piece │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - finished │ │ │ │ │ - the number of blocks that are in the finished state │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - writing │ │ │ │ │ - the number of blocks that are in the writing state │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - requested │ │ │ │ │ - the number of blocks that are in the requested state │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - blocks │ │ │ │ │ - this is an array of blocks_in_piece number of items. One for each block │ │ │ │ │ - in the piece. │ │ │ │ │ - Warning │ │ │ │ │ - This is a pointer that points to an array that's owned by the _s_e_s_s_i_o_n │ │ │ │ │ - object. The next time _g_e_t___d_o_w_n_l_o_a_d___q_u_e_u_e_(_) is called, it will be │ │ │ │ │ - invalidated. In the case of _p_i_e_c_e___i_n_f_o___a_l_e_r_t, these pointers point into │ │ │ │ │ - the _a_l_e_r_t object itself, and will be invalidated when the _a_l_e_r_t destruct. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ttoorrrreenntt__hhaannddllee ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ -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. │ │ │ │ │ -Warning │ │ │ │ │ -Any member function that returns a value or fills in a value has to be made │ │ │ │ │ -synchronously. This means it has to wait for the main thread to complete the │ │ │ │ │ -query before it can return. This might potentially be expensive if done from │ │ │ │ │ -within a GUI thread that needs to stay responsive. Try to avoid querying for │ │ │ │ │ -information you don't need, and try to do it in as few calls as possible. You │ │ │ │ │ -can get most of the interesting information about a torrent from the │ │ │ │ │ -_t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_s_t_a_t_u_s_(_) call. │ │ │ │ │ -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 _t_o_r_r_e_n_t___h_a_n_d_l_e may throw system_error exception, in case │ │ │ │ │ -the handle is no longer referring to a torrent. There is one exception _i_s___v_a_l_i_d │ │ │ │ │ -_(_) 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. │ │ │ │ │ -struct torrent_handle │ │ │ │ │ -{ │ │ │ │ │ - friend std::size_t hhaasshh__vvaalluuee (torrent_handle const& th); │ │ │ │ │ - ttoorrrreenntt__hhaannddllee () noexcept = default; │ │ │ │ │ - void aadddd__ppiieeccee (piece_index_t piece, std::vector data, │ │ │ │ │ -add_piece_flags_t flags = {}) const; │ │ │ │ │ - void aadddd__ppiieeccee (piece_index_t piece, char const* data, add_piece_flags_t │ │ │ │ │ -flags = {}) const; │ │ │ │ │ - void rreeaadd__ppiieeccee (piece_index_t piece) const; │ │ │ │ │ - bool hhaavvee__ppiieeccee (piece_index_t piece) const; │ │ │ │ │ - void ppoosstt__ppeeeerr__iinnffoo () const; │ │ │ │ │ - void ggeett__ppeeeerr__iinnffoo (std::vector& v) const; │ │ │ │ │ - torrent_status ssttaattuuss (status_flags_t flags = status_flags_t::all()) const; │ │ │ │ │ - void ppoosstt__ssttaattuuss (status_flags_t flags = status_flags_t::all()) const; │ │ │ │ │ - void ggeett__ddoowwnnllooaadd__qquueeuuee (std::vector& queue) const; │ │ │ │ │ - void ppoosstt__ddoowwnnllooaadd__qquueeuuee () const; │ │ │ │ │ - std::vector ggeett__ddoowwnnllooaadd__qquueeuuee () const; │ │ │ │ │ - void cclleeaarr__ppiieeccee__ddeeaaddlliinneess () const; │ │ │ │ │ - void rreesseett__ppiieeccee__ddeeaaddlliinnee (piece_index_t index) const; │ │ │ │ │ - void sseett__ppiieeccee__ddeeaaddlliinnee (piece_index_t index, int deadline, deadline_flags_t │ │ │ │ │ -flags = {}) const; │ │ │ │ │ - void ffiillee__pprrooggrreessss (std::vector& progress, │ │ │ │ │ -file_progress_flags_t flags = {}) const; │ │ │ │ │ - std::vector ffiillee__pprrooggrreessss (file_progress_flags_t flags = {}) │ │ │ │ │ -const; │ │ │ │ │ - void ppoosstt__ffiillee__pprrooggrreessss (file_progress_flags_t flags) const; │ │ │ │ │ - std::vector ffiillee__ssttaattuuss () const; │ │ │ │ │ - void cclleeaarr__eerrrroorr () const; │ │ │ │ │ - void ppoosstt__ttrraacckkeerrss () const; │ │ │ │ │ - void rreeppllaaccee__ttrraacckkeerrss (std::vector const&) const; │ │ │ │ │ - std::vector ttrraacckkeerrss () const; │ │ │ │ │ - void aadddd__ttrraacckkeerr (announce_entry const&) const; │ │ │ │ │ - std::set uurrll__sseeeeddss () const; │ │ │ │ │ - void aadddd__uurrll__sseeeedd (std::string const& url) const; │ │ │ │ │ - void rreemmoovvee__uurrll__sseeeedd (std::string const& url) const; │ │ │ │ │ - std::set hhttttpp__sseeeeddss () const; │ │ │ │ │ - void aadddd__hhttttpp__sseeeedd (std::string const& url) const; │ │ │ │ │ - void rreemmoovvee__hhttttpp__sseeeedd (std::string const& url) const; │ │ │ │ │ - void aadddd__eexxtteennssiioonn ( │ │ │ │ │ - std::function(torrent_handle const&, │ │ │ │ │ -client_data_t)> const& ext │ │ │ │ │ - , client_data_t userdata = client_data_t{}); │ │ │ │ │ - bool sseett__mmeettaaddaattaa (span metadata) const; │ │ │ │ │ - bool iiss__vvaalliidd () const; │ │ │ │ │ - void rreessuummee () const; │ │ │ │ │ - void ppaauussee (pause_flags_t flags = {}) const; │ │ │ │ │ - void uunnsseett__ffllaaggss (torrent_flags_t flags) const; │ │ │ │ │ - void sseett__ffllaaggss (torrent_flags_t flags, torrent_flags_t mask) const; │ │ │ │ │ - void sseett__ffllaaggss (torrent_flags_t flags) const; │ │ │ │ │ - torrent_flags_t ffllaaggss () const; │ │ │ │ │ - void fflluusshh__ccaacchhee () const; │ │ │ │ │ - void ffoorrccee__rreecchheecckk () const; │ │ │ │ │ - void ssaavvee__rreessuummee__ddaattaa (resume_data_flags_t flags = {}) const; │ │ │ │ │ - bool nneeeedd__ssaavvee__rreessuummee__ddaattaa (resume_data_flags_t flags) const; │ │ │ │ │ - bool nneeeedd__ssaavvee__rreessuummee__ddaattaa () const; │ │ │ │ │ - queue_position_t qquueeuuee__ppoossiittiioonn () const; │ │ │ │ │ - void qquueeuuee__ppoossiittiioonn__bboottttoomm () const; │ │ │ │ │ - void qquueeuuee__ppoossiittiioonn__ttoopp () const; │ │ │ │ │ - void qquueeuuee__ppoossiittiioonn__ddoowwnn () const; │ │ │ │ │ - void qquueeuuee__ppoossiittiioonn__uupp () const; │ │ │ │ │ - void qquueeuuee__ppoossiittiioonn__sseett (queue_position_t p) const; │ │ │ │ │ - void sseett__ssssll__cceerrttiiffiiccaattee__bbuuffffeerr (std::string const& certificate │ │ │ │ │ - , std::string const& private_key │ │ │ │ │ - , std::string const& dh_params); │ │ │ │ │ - void sseett__ssssll__cceerrttiiffiiccaattee (std::string const& certificate │ │ │ │ │ - , std::string const& private_key │ │ │ │ │ - , std::string const& dh_params │ │ │ │ │ - , std::string const& passphrase = ""); │ │ │ │ │ - std::shared_ptr ttoorrrreenntt__ffiillee__wwiitthh__hhaasshheess () const; │ │ │ │ │ - std::shared_ptr ttoorrrreenntt__ffiillee () const; │ │ │ │ │ - std::vector> ppiieeccee__llaayyeerrss () const; │ │ │ │ │ - void ppoosstt__ppiieeccee__aavvaaiillaabbiilliittyy () const; │ │ │ │ │ - void ppiieeccee__aavvaaiillaabbiilliittyy (std::vector& avail) const; │ │ │ │ │ - void pprriioorriittiizzee__ppiieecceess (std::vector const& pieces) │ │ │ │ │ -const; │ │ │ │ │ - void pprriioorriittiizzee__ppiieecceess (std::vector> const& pieces) const; │ │ │ │ │ - std::vector ggeett__ppiieeccee__pprriioorriittiieess () const; │ │ │ │ │ - download_priority_t ppiieeccee__pprriioorriittyy (piece_index_t index) const; │ │ │ │ │ - void ppiieeccee__pprriioorriittyy (piece_index_t index, download_priority_t priority) │ │ │ │ │ -const; │ │ │ │ │ - std::vector ggeett__ffiillee__pprriioorriittiieess () const; │ │ │ │ │ - download_priority_t ffiillee__pprriioorriittyy (file_index_t index) const; │ │ │ │ │ - void ffiillee__pprriioorriittyy (file_index_t index, download_priority_t priority) const; │ │ │ │ │ - void pprriioorriittiizzee__ffiilleess (std::vector const& files) const; │ │ │ │ │ - void ffoorrccee__rreeaannnnoouunnccee (int seconds = 0, int idx = -1, reannounce_flags_t = │ │ │ │ │ -{}) const; │ │ │ │ │ - void ffoorrccee__ddhhtt__aannnnoouunnccee () const; │ │ │ │ │ - void ffoorrccee__llssdd__aannnnoouunnccee () const; │ │ │ │ │ - void ssccrraappee__ttrraacckkeerr (int idx = -1) const; │ │ │ │ │ - int uuppllooaadd__lliimmiitt () const; │ │ │ │ │ - int ddoowwnnllooaadd__lliimmiitt () const; │ │ │ │ │ - void sseett__uuppllooaadd__lliimmiitt (int limit) const; │ │ │ │ │ - void sseett__ddoowwnnllooaadd__lliimmiitt (int limit) const; │ │ │ │ │ - void ccoonnnneecctt__ppeeeerr (tcp::endpoint const& adr, peer_source_flags_t source = {} │ │ │ │ │ - , pex_flags_t flags = pex_encryption | pex_utp | pex_holepunch) const; │ │ │ │ │ - void cclleeaarr__ppeeeerrss (); │ │ │ │ │ - int mmaaxx__uuppllooaaddss () const; │ │ │ │ │ - void sseett__mmaaxx__uuppllooaaddss (int max_uploads) const; │ │ │ │ │ - int mmaaxx__ccoonnnneeccttiioonnss () const; │ │ │ │ │ - void sseett__mmaaxx__ccoonnnneeccttiioonnss (int max_connections) const; │ │ │ │ │ - void mmoovvee__ssttoorraaggee (std::string const& save_path │ │ │ │ │ - , move_flags_t flags = move_flags_t::always_replace_files │ │ │ │ │ - ) const; │ │ │ │ │ - void rreennaammee__ffiillee (file_index_t index, std::string const& new_name) const; │ │ │ │ │ - sha1_hash iinnffoo__hhaasshh () const; │ │ │ │ │ - info_hash_t iinnffoo__hhaasshheess () const; │ │ │ │ │ - bool ooppeerraattoorr<< (const torrent_handle& h) const; │ │ │ │ │ - bool ooppeerraattoorr==== (const torrent_handle& h) const; │ │ │ │ │ - bool ooppeerraattoorr!!== (const torrent_handle& h) const; │ │ │ │ │ - std::uint32_t iidd () const; │ │ │ │ │ - std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ - client_data_t uusseerrddaattaa () const; │ │ │ │ │ - bool iinn__sseessssiioonn () const; │ │ │ │ │ - │ │ │ │ │ - static constexpr add_piece_flags_t oovveerrwwrriittee__eexxiissttiinngg = 0_bit; │ │ │ │ │ - static constexpr status_flags_t qquueerryy__ddiissttrriibbuutteedd__ccooppiieess = 0_bit; │ │ │ │ │ - static constexpr status_flags_t qquueerryy__aaccccuurraattee__ddoowwnnllooaadd__ccoouunntteerrss = 1_bit; │ │ │ │ │ - static constexpr status_flags_t qquueerryy__llaasstt__sseeeenn__ccoommpplleettee = 2_bit; │ │ │ │ │ - static constexpr status_flags_t qquueerryy__ppiieecceess = 3_bit; │ │ │ │ │ - static constexpr status_flags_t qquueerryy__vveerriiffiieedd__ppiieecceess = 4_bit; │ │ │ │ │ - static constexpr status_flags_t qquueerryy__ttoorrrreenntt__ffiillee = 5_bit; │ │ │ │ │ - static constexpr status_flags_t qquueerryy__nnaammee = 6_bit; │ │ │ │ │ - static constexpr status_flags_t qquueerryy__ssaavvee__ppaatthh = 7_bit; │ │ │ │ │ - static constexpr deadline_flags_t aalleerrtt__wwhheenn__aavvaaiillaabbllee = 0_bit; │ │ │ │ │ - static constexpr file_progress_flags_t ppiieeccee__ggrraannuullaarriittyy = 0_bit; │ │ │ │ │ - static constexpr pause_flags_t ggrraacceeffuull__ppaauussee = 0_bit; │ │ │ │ │ - static constexpr resume_data_flags_t fflluusshh__ddiisskk__ccaacchhee = 0_bit; │ │ │ │ │ - static constexpr resume_data_flags_t ssaavvee__iinnffoo__ddiicctt = 1_bit; │ │ │ │ │ - static constexpr resume_data_flags_t oonnllyy__iiff__mmooddiiffiieedd = 2_bit; │ │ │ │ │ - static constexpr resume_data_flags_t iiff__ccoouunntteerrss__cchhaannggeedd = 3_bit; │ │ │ │ │ - static constexpr resume_data_flags_t iiff__ddoowwnnllooaadd__pprrooggrreessss = 4_bit; │ │ │ │ │ - static constexpr resume_data_flags_t iiff__ccoonnffiigg__cchhaannggeedd = 5_bit; │ │ │ │ │ - static constexpr resume_data_flags_t iiff__ssttaattee__cchhaannggeedd = 6_bit; │ │ │ │ │ - static constexpr resume_data_flags_t iiff__mmeettaaddaattaa__cchhaannggeedd = 7_bit; │ │ │ │ │ - static constexpr reannounce_flags_t iiggnnoorree__mmiinn__iinntteerrvvaall = 0_bit; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ttoorrrreenntt__hhaannddllee(()) ********** │ │ │ │ │ -ttoorrrreenntt__hhaannddllee () noexcept = default; │ │ │ │ │ -constructs a torrent handle that does not refer to a torrent. i.e. _i_s___v_a_l_i_d_(_) │ │ │ │ │ -will return false. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aadddd__ppiieeccee(()) ********** │ │ │ │ │ -void aadddd__ppiieeccee (piece_index_t piece, std::vector data, add_piece_flags_t │ │ │ │ │ -flags = {}) const; │ │ │ │ │ -void aadddd__ppiieeccee (piece_index_t piece, char const* data, add_piece_flags_t flags │ │ │ │ │ -= {}) const; │ │ │ │ │ -This function will write data to the storage as piece piece, as if it had been │ │ │ │ │ -downloaded from a peer. │ │ │ │ │ -By default, data that's already been downloaded is not overwritten by this │ │ │ │ │ -buffer. If you trust this data to be correct (and pass the piece hash check) │ │ │ │ │ -you may pass the overwrite_existing flag. This will instruct libtorrent to │ │ │ │ │ -overwrite any data that may already have been downloaded with this data. │ │ │ │ │ -Since the data is written asynchronously, you may know that is passed or failed │ │ │ │ │ -the hash check by waiting for _p_i_e_c_e___f_i_n_i_s_h_e_d___a_l_e_r_t or _h_a_s_h___f_a_i_l_e_d___a_l_e_r_t. │ │ │ │ │ -Adding pieces while the torrent is being checked (i.e. in _t_o_r_r_e_n_t___s_t_a_t_u_s_:_: │ │ │ │ │ -_c_h_e_c_k_i_n_g___f_i_l_e_s state) is not supported. │ │ │ │ │ -The overload taking a raw pointer to the data is a blocking call. It won't │ │ │ │ │ -return until the libtorrent thread has copied the data into its disk write │ │ │ │ │ -buffer. data is expected to point to a buffer of as many bytes as the size of │ │ │ │ │ -the specified piece. See _f_i_l_e___s_t_o_r_a_g_e_:_:_p_i_e_c_e___s_i_z_e_(_). │ │ │ │ │ -The data in the buffer is copied and passed on to the disk IO thread to be │ │ │ │ │ -written at a later point. │ │ │ │ │ -The overload taking a std::vector is not blocking, it will send the │ │ │ │ │ -buffer to the main thread and return immediately. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** rreeaadd__ppiieeccee(()) ********** │ │ │ │ │ -void rreeaadd__ppiieeccee (piece_index_t piece) const; │ │ │ │ │ -This function starts an asynchronous read operation of the specified piece from │ │ │ │ │ -this torrent. You must have completed the download of the specified piece │ │ │ │ │ -before calling this function. │ │ │ │ │ -When the read operation is completed, it is passed back through an _a_l_e_r_t, │ │ │ │ │ -_r_e_a_d___p_i_e_c_e___a_l_e_r_t. Since this _a_l_e_r_t is a response to an explicit call, it will │ │ │ │ │ -always be posted, regardless of the _a_l_e_r_t mask. │ │ │ │ │ -Note that if you read multiple pieces, the read operations are not guaranteed │ │ │ │ │ -to finish in the same order as you initiated them. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** hhaavvee__ppiieeccee(()) ********** │ │ │ │ │ -bool hhaavvee__ppiieeccee (piece_index_t piece) const; │ │ │ │ │ -Returns true if this piece has been completely downloaded and written to disk, │ │ │ │ │ -and false otherwise. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppoosstt__ppeeeerr__iinnffoo(()) ggeett__ppeeeerr__iinnffoo(()) ********** │ │ │ │ │ -void ppoosstt__ppeeeerr__iinnffoo () const; │ │ │ │ │ -void ggeett__ppeeeerr__iinnffoo (std::vector& v) const; │ │ │ │ │ -Query information about connected peers for this torrent. If the _t_o_r_r_e_n_t___h_a_n_d_l_e │ │ │ │ │ -is invalid, it will throw a system_error exception. │ │ │ │ │ -post_peer_info() is asynchronous and will trigger the posting of a │ │ │ │ │ -_p_e_e_r___i_n_f_o___a_l_e_r_t. The _a_l_e_r_t contain a list of _p_e_e_r___i_n_f_o objects, one for each │ │ │ │ │ -connected peer. │ │ │ │ │ -get_peer_info() is synchronous and takes a reference to a vector that will be │ │ │ │ │ -cleared and filled with one _e_n_t_r_y for each peer connected to this torrent, │ │ │ │ │ -given the handle is valid. Each _e_n_t_r_y in the vector contains information about │ │ │ │ │ -that particular peer. See _p_e_e_r___i_n_f_o. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ssttaattuuss(()) ppoosstt__ssttaattuuss(()) ********** │ │ │ │ │ -torrent_status ssttaattuuss (status_flags_t flags = status_flags_t::all()) const; │ │ │ │ │ -void ppoosstt__ssttaattuuss (status_flags_t flags = status_flags_t::all()) const; │ │ │ │ │ -status() will return a structure with information about the status of this │ │ │ │ │ -torrent. If the _t_o_r_r_e_n_t___h_a_n_d_l_e is invalid, it will throw system_error │ │ │ │ │ -exception. See _t_o_r_r_e_n_t___s_t_a_t_u_s. The flags argument filters what information is │ │ │ │ │ -returned in the _t_o_r_r_e_n_t___s_t_a_t_u_s. Some information in there is relatively │ │ │ │ │ -expensive to calculate, and if you're not interested in it (and see performance │ │ │ │ │ -issues), you can filter them out. │ │ │ │ │ -The status() function will block until the internal libtorrent thread responds │ │ │ │ │ -with the _t_o_r_r_e_n_t___s_t_a_t_u_s object. To avoid blocking, instead call post_status(). │ │ │ │ │ -It will trigger posting of a _s_t_a_t_e___u_p_d_a_t_e___a_l_e_r_t with a single _t_o_r_r_e_n_t___s_t_a_t_u_s │ │ │ │ │ -object for this torrent. │ │ │ │ │ -In order to get regular updates for torrents whose status changes, consider │ │ │ │ │ -calling session::post_torrent_updates()`` instead. │ │ │ │ │ -By default everything is included. The flags you can use to decide what to │ │ │ │ │ -iinncclluuddee are defined in this class. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ggeett__ddoowwnnllooaadd__qquueeuuee(()) ppoosstt__ddoowwnnllooaadd__qquueeuuee(()) ********** │ │ │ │ │ -void ggeett__ddoowwnnllooaadd__qquueeuuee (std::vector& queue) const; │ │ │ │ │ -void ppoosstt__ddoowwnnllooaadd__qquueeuuee () const; │ │ │ │ │ -std::vector ggeett__ddoowwnnllooaadd__qquueeuuee () const; │ │ │ │ │ -post_download_queue() triggers a download_queue_alert to be posted. │ │ │ │ │ -get_download_queue() is a synchronous call and returns a vector with │ │ │ │ │ -information about pieces that are partially downloaded or not downloaded but │ │ │ │ │ -partially requested. See _p_a_r_t_i_a_l___p_i_e_c_e___i_n_f_o for the fields in the returned │ │ │ │ │ -vector. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__ppiieeccee__ddeeaaddlliinnee(()) cclleeaarr__ppiieeccee__ddeeaaddlliinneess(()) rreesseett__ppiieeccee__ddeeaaddlliinnee(()) ********** │ │ │ │ │ -void cclleeaarr__ppiieeccee__ddeeaaddlliinneess () const; │ │ │ │ │ -void rreesseett__ppiieeccee__ddeeaaddlliinnee (piece_index_t index) const; │ │ │ │ │ -void sseett__ppiieeccee__ddeeaaddlliinnee (piece_index_t index, int deadline, deadline_flags_t │ │ │ │ │ -flags = {}) const; │ │ │ │ │ -This function sets or resets the deadline associated with a specific piece │ │ │ │ │ -index (index). libtorrent will attempt to download this entire piece before the │ │ │ │ │ -deadline expires. This is not necessarily possible, but pieces with a more │ │ │ │ │ -recent deadline will always be prioritized over pieces with a deadline further │ │ │ │ │ -ahead in time. The deadline (and flags) of a piece can be changed by calling │ │ │ │ │ -this function again. │ │ │ │ │ -If the piece is already downloaded when this call is made, nothing happens, │ │ │ │ │ -unless the alert_when_available flag is set, in which case it will have the │ │ │ │ │ -same effect as calling _r_e_a_d___p_i_e_c_e_(_) for index. │ │ │ │ │ -deadline is the number of milliseconds until this piece should be completed. │ │ │ │ │ -reset_piece_deadline removes the deadline from the piece. If it hasn't already │ │ │ │ │ -been downloaded, it will no longer be considered a priority. │ │ │ │ │ -clear_piece_deadlines() removes deadlines on all pieces in the torrent. As if │ │ │ │ │ -_r_e_s_e_t___p_i_e_c_e___d_e_a_d_l_i_n_e_(_) was called on all pieces. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiillee__pprrooggrreessss(()) ppoosstt__ffiillee__pprrooggrreessss(()) ********** │ │ │ │ │ -void ffiillee__pprrooggrreessss (std::vector& progress, file_progress_flags_t │ │ │ │ │ -flags = {}) const; │ │ │ │ │ -std::vector ffiillee__pprrooggrreessss (file_progress_flags_t flags = {}) │ │ │ │ │ -const; │ │ │ │ │ -void ppoosstt__ffiillee__pprrooggrreessss (file_progress_flags_t flags) const; │ │ │ │ │ -This function fills in the supplied vector, or returns a vector, with the │ │ │ │ │ -number of bytes downloaded of each file in this torrent. The progress values │ │ │ │ │ -are ordered the same as the files in the _t_o_r_r_e_n_t___i_n_f_o. │ │ │ │ │ -This operation is not very cheap. Its complexity is OO((nn ++ mmjj)). Where nn is the │ │ │ │ │ -number of files, mm is the number of currently downloading pieces and jj is the │ │ │ │ │ -number of blocks in a piece. │ │ │ │ │ -The flags parameter can be used to specify the granularity of the file │ │ │ │ │ -progress. If left at the default value of 0, the progress will be as accurate │ │ │ │ │ -as possible, but also more expensive to calculate. If torrent_handle:: │ │ │ │ │ -piece_granularity is specified, the progress will be specified in piece │ │ │ │ │ -granularity. i.e. only pieces that have been fully downloaded and passed the │ │ │ │ │ -hash check count. When specifying piece granularity, the operation is a lot │ │ │ │ │ -cheaper, since libtorrent already keeps track of this internally and no │ │ │ │ │ -calculation is required. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiillee__ssttaattuuss(()) ********** │ │ │ │ │ -std::vector ffiillee__ssttaattuuss () const; │ │ │ │ │ -This function returns a vector with status about files that are open for this │ │ │ │ │ -torrent. Any file that is not open will not be reported in the vector, i.e. │ │ │ │ │ -it's possible that the vector is empty when returning, if none of the files in │ │ │ │ │ -the torrent are currently open. │ │ │ │ │ -See _o_p_e_n___f_i_l_e___s_t_a_t_e │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** cclleeaarr__eerrrroorr(()) ********** │ │ │ │ │ -void cclleeaarr__eerrrroorr () const; │ │ │ │ │ -If the torrent is in an error state (i.e. torrent_status::error is non-empty), │ │ │ │ │ -this will clear the error and start the torrent again. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ttrraacckkeerrss(()) aadddd__ttrraacckkeerr(()) rreeppllaaccee__ttrraacckkeerrss(()) ppoosstt__ttrraacckkeerrss(()) ********** │ │ │ │ │ -void ppoosstt__ttrraacckkeerrss () const; │ │ │ │ │ -void rreeppllaaccee__ttrraacckkeerrss (std::vector const&) const; │ │ │ │ │ -std::vector ttrraacckkeerrss () const; │ │ │ │ │ -void aadddd__ttrraacckkeerr (announce_entry const&) const; │ │ │ │ │ -trackers() returns the list of trackers for this torrent. The announce _e_n_t_r_y │ │ │ │ │ -contains both a string url which specify the announce url for the tracker as │ │ │ │ │ -well as an _i_n_t 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 _f_o_r_c_e___r_e_a_n_n_o_u_n_c_e_(_). See _a_n_n_o_u_n_c_e___e_n_t_r_y. │ │ │ │ │ -post_trackers() is the asynchronous version of trackers(). It will trigger a │ │ │ │ │ -_t_r_a_c_k_e_r___l_i_s_t___a_l_e_r_t to be posted. │ │ │ │ │ -add_tracker() will look if the specified tracker is already in the set. If it │ │ │ │ │ -is, it doesn't do anything. If it's not in the current set of trackers, it will │ │ │ │ │ -insert it in the tier specified in the _a_n_n_o_u_n_c_e___e_n_t_r_y. │ │ │ │ │ -The updated set of trackers will be saved in the resume data, and when a │ │ │ │ │ -torrent is started with resume data, the trackers from the resume data will │ │ │ │ │ -replace the original ones. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aadddd__uurrll__sseeeedd(()) rreemmoovvee__uurrll__sseeeedd(()) uurrll__sseeeeddss(()) ********** │ │ │ │ │ -std::set uurrll__sseeeeddss () const; │ │ │ │ │ -void aadddd__uurrll__sseeeedd (std::string const& url) const; │ │ │ │ │ -void rreemmoovvee__uurrll__sseeeedd (std::string const& url) 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 _h_t_t_p_ _s_e_e_d_i_n_g for more information. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** rreemmoovvee__hhttttpp__sseeeedd(()) aadddd__hhttttpp__sseeeedd(()) hhttttpp__sseeeeddss(()) ********** │ │ │ │ │ -std::set hhttttpp__sseeeeddss () const; │ │ │ │ │ -void aadddd__hhttttpp__sseeeedd (std::string const& url) const; │ │ │ │ │ -void rreemmoovvee__hhttttpp__sseeeedd (std::string const& url) const; │ │ │ │ │ -These functions are identical as the *_url_seed() variants, but they operate on │ │ │ │ │ -_B_E_P_ _1_7 web seeds instead of _B_E_P_ _1_9. │ │ │ │ │ -See _h_t_t_p_ _s_e_e_d_i_n_g for more information. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aadddd__eexxtteennssiioonn(()) ********** │ │ │ │ │ -void aadddd__eexxtteennssiioonn ( │ │ │ │ │ - std::function(torrent_handle const&, │ │ │ │ │ -client_data_t)> const& ext │ │ │ │ │ - , client_data_t userdata = client_data_t{}); │ │ │ │ │ -add the specified extension to this torrent. The ext argument is a function │ │ │ │ │ -that will be called from within libtorrent's context passing in the internal │ │ │ │ │ -torrent object and the specified userdata pointer. The function is expected to │ │ │ │ │ -return a shared pointer to a _t_o_r_r_e_n_t___p_l_u_g_i_n instance. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__mmeettaaddaattaa(()) ********** │ │ │ │ │ -bool sseett__mmeettaaddaattaa (span metadata) const; │ │ │ │ │ -set_metadata expects the iinnffoo section of metadata. i.e. The buffer passed in │ │ │ │ │ -will be hashed and verified against the info-hash. If it fails, a │ │ │ │ │ -metadata_failed_alert will be generated. If it passes, a │ │ │ │ │ -metadata_received_alert is generated. The function returns true if the metadata │ │ │ │ │ -is successfully set on the torrent, and false otherwise. If the torrent already │ │ │ │ │ -has metadata, this function will not affect the torrent, and false will be │ │ │ │ │ -returned. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** iiss__vvaalliidd(()) ********** │ │ │ │ │ -bool iiss__vvaalliidd () 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 removed from the │ │ │ │ │ -_s_e_s_s_i_o_n AND destructed. │ │ │ │ │ -To tell if the _t_o_r_r_e_n_t___h_a_n_d_l_e is in the _s_e_s_s_i_o_n, use _t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_i_n___s_e_s_s_i_o_n │ │ │ │ │ -_(_). This will return true before _s_e_s_s_i_o_n___h_a_n_d_l_e_:_:_r_e_m_o_v_e___t_o_r_r_e_n_t_(_) is called, │ │ │ │ │ -and false afterward. │ │ │ │ │ -Clients should only use _i_s___v_a_l_i_d_(_) to determine if the result of session:: │ │ │ │ │ -find_torrent() was successful. │ │ │ │ │ -Unlike other member functions which return a value, _i_s___v_a_l_i_d_(_) completes │ │ │ │ │ -immediately, without blocking on a result from the network thread. Also unlike │ │ │ │ │ -other functions, it never throws the system_error exception. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppaauussee(()) rreessuummee(()) ********** │ │ │ │ │ -void rreessuummee () const; │ │ │ │ │ -void ppaauussee (pause_flags_t flags = {}) 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. Torrents │ │ │ │ │ -may be paused automatically if there is a file error (e.g. disk full) or │ │ │ │ │ -something similar. See _f_i_l_e___e_r_r_o_r___a_l_e_r_t. │ │ │ │ │ -For possible values of the flags parameter, see pause_flags_t. │ │ │ │ │ -To know if a torrent is paused or not, call torrent_handle::flags() and check │ │ │ │ │ -for the torrent_status::paused flag. │ │ │ │ │ -Note │ │ │ │ │ -Torrents that are auto-managed may be automatically resumed again. It does not │ │ │ │ │ -make sense to pause an auto-managed torrent without making it not auto-managed │ │ │ │ │ -first. Torrents are auto-managed by default when added to the _s_e_s_s_i_o_n. For more │ │ │ │ │ -information, see _q_u_e_u_i_n_g. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** uunnsseett__ffllaaggss(()) sseett__ffllaaggss(()) ffllaaggss(()) ********** │ │ │ │ │ -void uunnsseett__ffllaaggss (torrent_flags_t flags) const; │ │ │ │ │ -void sseett__ffllaaggss (torrent_flags_t flags, torrent_flags_t mask) const; │ │ │ │ │ -void sseett__ffllaaggss (torrent_flags_t flags) const; │ │ │ │ │ -torrent_flags_t ffllaaggss () const; │ │ │ │ │ -sets and gets the torrent state flags. See _t_o_r_r_e_n_t___f_l_a_g_s___t. The set_flags │ │ │ │ │ -overload that take a mask will affect all flags part of the mask, and set their │ │ │ │ │ -values to what the flags argument is set to. This allows clearing and setting │ │ │ │ │ -flags in a single function call. The set_flags overload that just takes flags, │ │ │ │ │ -sets all the specified flags and leave any other flags unchanged. unset_flags │ │ │ │ │ -clears the specified flags, while leaving any other flags unchanged. │ │ │ │ │ -Theseed_modeflag is special, it can only be cleared once the torrent has been │ │ │ │ │ -added, and it can only be set as part of the _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s flags, when │ │ │ │ │ -adding the torrent. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** fflluusshh__ccaacchhee(()) ********** │ │ │ │ │ -void fflluusshh__ccaacchhee () const; │ │ │ │ │ -Instructs libtorrent to flush all the disk caches for this torrent and close │ │ │ │ │ -all file handles. This is done asynchronously and you will be notified that │ │ │ │ │ -it's complete through _c_a_c_h_e___f_l_u_s_h_e_d___a_l_e_r_t. │ │ │ │ │ -Note that by the time you get the _a_l_e_r_t, libtorrent may have cached more data │ │ │ │ │ -for the torrent, but you are guaranteed that whatever cached data libtorrent │ │ │ │ │ -had by the time you called torrent_handle::flush_cache() has been written to │ │ │ │ │ -disk. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffoorrccee__rreecchheecckk(()) ********** │ │ │ │ │ -void ffoorrccee__rreecchheecckk () const; │ │ │ │ │ -force_recheck puts the torrent back in a state where it assumes to have no │ │ │ │ │ -resume data. All peers will be disconnected and the torrent will stop │ │ │ │ │ -announcing to the tracker. The torrent will be added to the checking queue, and │ │ │ │ │ -will be checked (all the files will be read and compared to the piece hashes). │ │ │ │ │ -Once the check is complete, the torrent will start connecting to peers again, │ │ │ │ │ -as normal. The torrent will be placed last in queue, i.e. its queue position │ │ │ │ │ -will be the highest of all torrents in the _s_e_s_s_i_o_n. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ssaavvee__rreessuummee__ddaattaa(()) ********** │ │ │ │ │ -void ssaavvee__rreessuummee__ddaattaa (resume_data_flags_t flags = {}) const; │ │ │ │ │ -save_resume_data() asks libtorrent to generate fast-resume data for this │ │ │ │ │ -torrent. The fast resume data (stored in an _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s object) can be │ │ │ │ │ -used to resume a torrent in the next _s_e_s_s_i_o_n without having to check all files │ │ │ │ │ -for which pieces have been downloaded. It can also be used to save a .torrent │ │ │ │ │ -file for a _t_o_r_r_e_n_t___h_a_n_d_l_e. │ │ │ │ │ -This operation is asynchronous, save_resume_data will return immediately. The │ │ │ │ │ -resume data is delivered when it's done through a _s_a_v_e___r_e_s_u_m_e___d_a_t_a___a_l_e_r_t. │ │ │ │ │ -The operation will fail, and post a _s_a_v_e___r_e_s_u_m_e___d_a_t_a___f_a_i_l_e_d___a_l_e_r_t instead, in │ │ │ │ │ -the following cases: │ │ │ │ │ - 1. The torrent is in the process of being removed. │ │ │ │ │ - 2. No torrent state has changed since the last saving of resume │ │ │ │ │ - data, and the only_if_modified flag is set. metadata (see │ │ │ │ │ - libtorrent's _m_e_t_a_d_a_t_a_ _f_r_o_m_ _p_e_e_r_s extension) │ │ │ │ │ -Note that some _c_o_u_n_t_e_r_s may be outdated by the time you receive the fast resume │ │ │ │ │ -data │ │ │ │ │ -When saving resume data because of shutting down, make sure not to │ │ │ │ │ -_r_e_m_o_v_e___t_o_r_r_e_n_t_(_) before you receive the _s_a_v_e___r_e_s_u_m_e___d_a_t_a___a_l_e_r_t. There's no need │ │ │ │ │ -to pause the _s_e_s_s_i_o_n or torrent when saving resume data. │ │ │ │ │ -The paused state of a torrent is saved in the resume data, so pausing all │ │ │ │ │ -torrents before saving resume data will all torrents be restored in a paused │ │ │ │ │ -state. │ │ │ │ │ -Note │ │ │ │ │ -It is typically a good idea to save resume data whenever a torrent is completed │ │ │ │ │ -or paused. If you save resume data for torrents when they are paused, you can │ │ │ │ │ -accelerate the shutdown process by not saving resume data again for those │ │ │ │ │ -torrents. Completed torrents should have their resume data saved when they │ │ │ │ │ -complete and on exit, since their statistics might be updated. │ │ │ │ │ -Example code to pause and save resume data for all torrents and wait for the │ │ │ │ │ -alerts: │ │ │ │ │ -extern int outstanding_resume_data; // global counter of outstanding resume │ │ │ │ │ -data │ │ │ │ │ -std::vector handles = ses.get_torrents(); │ │ │ │ │ -for (torrent_handle const& h : handles) try │ │ │ │ │ -{ │ │ │ │ │ - h.save_resume_data(torrent_handle::only_if_modified); │ │ │ │ │ - ++outstanding_resume_data; │ │ │ │ │ -} │ │ │ │ │ -catch (lt::system_error const& e) │ │ │ │ │ -{ │ │ │ │ │ - // the handle was invalid, ignore this one and move to the next │ │ │ │ │ -} │ │ │ │ │ - │ │ │ │ │ -while (outstanding_resume_data > 0) │ │ │ │ │ -{ │ │ │ │ │ - alert const* a = ses.wait_for_alert(seconds(30)); │ │ │ │ │ - │ │ │ │ │ - // if we don't get an alert within 30 seconds, abort │ │ │ │ │ - if (a == nullptr) break; │ │ │ │ │ - │ │ │ │ │ - std::vector alerts; │ │ │ │ │ - ses.pop_alerts(&alerts); │ │ │ │ │ - │ │ │ │ │ - for (alert* i : alerts) │ │ │ │ │ - { │ │ │ │ │ - if (alert_cast(i)) │ │ │ │ │ - { │ │ │ │ │ - process_alert(i); │ │ │ │ │ - --outstanding_resume_data; │ │ │ │ │ - continue; │ │ │ │ │ - } │ │ │ │ │ - │ │ │ │ │ - save_resume_data_alert const* rd = │ │ │ │ │ -alert_cast(i); │ │ │ │ │ - if (rd == nullptr) │ │ │ │ │ - { │ │ │ │ │ - process_alert(i); │ │ │ │ │ - continue; │ │ │ │ │ - } │ │ │ │ │ - │ │ │ │ │ - std::ofstream out((rd->params.save_path │ │ │ │ │ - + "/" + rd->params.name + ".fastresume").c_str() │ │ │ │ │ - , std::ios_base::binary); │ │ │ │ │ - std::vector buf = write_resume_data_buf(rd->params); │ │ │ │ │ - out.write(buf.data(), buf.size()); │ │ │ │ │ - --outstanding_resume_data; │ │ │ │ │ - } │ │ │ │ │ -} │ │ │ │ │ -Note │ │ │ │ │ -Note how outstanding_resume_data is a global counter in this example. This is │ │ │ │ │ -deliberate, otherwise there is a race condition for torrents that was just │ │ │ │ │ -asked to save their resume data, they posted the _a_l_e_r_t, but it has not been │ │ │ │ │ -received yet. Those torrents would report that they don't need to save resume │ │ │ │ │ -data again, and skipped by the initial loop, and thwart the counter otherwise. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** nneeeedd__ssaavvee__rreessuummee__ddaattaa(()) ********** │ │ │ │ │ -bool nneeeedd__ssaavvee__rreessuummee__ddaattaa (resume_data_flags_t flags) const; │ │ │ │ │ -bool nneeeedd__ssaavvee__rreessuummee__ddaattaa () const; │ │ │ │ │ -This function returns true if anything that is stored in the resume data has │ │ │ │ │ -changed since the last time resume data was saved. The overload that takes │ │ │ │ │ -flags let you ask if specific categories of properties have changed. These │ │ │ │ │ -flags have the same behavior as in the _s_a_v_e___r_e_s_u_m_e___d_a_t_a_(_) call. │ │ │ │ │ -This is a bblloocckkiinngg call. It will wait for a response from libtorrent's main │ │ │ │ │ -thread. A way to avoid blocking is to instead call _s_a_v_e___r_e_s_u_m_e___d_a_t_a_(_) directly, │ │ │ │ │ -specifying the conditions under which resume data should be saved. │ │ │ │ │ -Note │ │ │ │ │ -A torrent's resume data is considered saved as soon as the │ │ │ │ │ -_s_a_v_e___r_e_s_u_m_e___d_a_t_a___a_l_e_r_t is posted. It is important to make sure this _a_l_e_r_t is │ │ │ │ │ -received and handled in order for this function to be meaningful. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** qquueeuuee__ppoossiittiioonn__ttoopp(()) qquueeuuee__ppoossiittiioonn__uupp(()) qquueeuuee__ppoossiittiioonn(()) │ │ │ │ │ -qquueeuuee__ppoossiittiioonn__ddoowwnn(()) qquueeuuee__ppoossiittiioonn__bboottttoomm(()) ********** │ │ │ │ │ -queue_position_t qquueeuuee__ppoossiittiioonn () const; │ │ │ │ │ -void qquueeuuee__ppoossiittiioonn__bboottttoomm () const; │ │ │ │ │ -void qquueeuuee__ppoossiittiioonn__ttoopp () const; │ │ │ │ │ -void qquueeuuee__ppoossiittiioonn__ddoowwnn () const; │ │ │ │ │ -void qquueeuuee__ppoossiittiioonn__uupp () const; │ │ │ │ │ -Every torrent that is added is assigned a queue position exactly one greater │ │ │ │ │ -than the greatest queue position of all existing torrents. Torrents that are │ │ │ │ │ -being seeded have -1 as their queue position, since they're no longer in line │ │ │ │ │ -to be downloaded. │ │ │ │ │ -When a torrent is removed or turns into a seed, all torrents with greater queue │ │ │ │ │ -positions have their positions decreased to fill in the space in the sequence. │ │ │ │ │ -queue_position() returns the torrent's position in the download queue. The │ │ │ │ │ -torrents with the smallest numbers are the ones that are being downloaded. The │ │ │ │ │ -smaller number, the closer the torrent is to the front of the line to be │ │ │ │ │ -started. │ │ │ │ │ -The queue position is also available in the _t_o_r_r_e_n_t___s_t_a_t_u_s. │ │ │ │ │ -The queue_position_*() functions adjust the torrents position in the queue. Up │ │ │ │ │ -means closer to the front and down means closer to the back of the queue. Top │ │ │ │ │ -and bottom refers to the front and the back of the queue respectively. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** qquueeuuee__ppoossiittiioonn__sseett(()) ********** │ │ │ │ │ -void qquueeuuee__ppoossiittiioonn__sseett (queue_position_t p) const; │ │ │ │ │ -updates the position in the queue for this torrent. The relative order of all │ │ │ │ │ -other torrents remain intact but their numerical queue position shifts to make │ │ │ │ │ -space for this torrent's new position │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__ssssll__cceerrttiiffiiccaattee__bbuuffffeerr(()) sseett__ssssll__cceerrttiiffiiccaattee(()) ********** │ │ │ │ │ -void sseett__ssssll__cceerrttiiffiiccaattee__bbuuffffeerr (std::string const& certificate │ │ │ │ │ - , std::string const& private_key │ │ │ │ │ - , std::string const& dh_params); │ │ │ │ │ -void sseett__ssssll__cceerrttiiffiiccaattee (std::string const& certificate │ │ │ │ │ - , std::string const& private_key │ │ │ │ │ - , std::string const& dh_params │ │ │ │ │ - , std::string const& passphrase = ""); │ │ │ │ │ -For SSL torrents, use this to specify a path to a .pem file to use as this │ │ │ │ │ -client's certificate. The certificate must be signed by the certificate in the │ │ │ │ │ -.torrent file to be valid. │ │ │ │ │ -The _s_e_t___s_s_l___c_e_r_t_i_f_i_c_a_t_e___b_u_f_f_e_r_(_) overload takes the actual certificate, private │ │ │ │ │ -key and DH params as strings, rather than paths to files. │ │ │ │ │ -cert is a path to the (signed) certificate in .pem format corresponding to this │ │ │ │ │ -torrent. │ │ │ │ │ -private_key is a path to the private key for the specified certificate. This │ │ │ │ │ -must be in .pem format. │ │ │ │ │ -dh_params is a path to the Diffie-Hellman parameter file, which needs to be in │ │ │ │ │ -.pem format. You can generate this file using the openssl command like this: │ │ │ │ │ -openssl dhparam -outform PEM -out dhparams.pem 512. │ │ │ │ │ -passphrase may be specified if the private key is encrypted and requires a │ │ │ │ │ -passphrase to be decrypted. │ │ │ │ │ -Note that when a torrent first starts up, and it needs a certificate, it will │ │ │ │ │ -suspend connecting to any peers until it has one. It's typically desirable to │ │ │ │ │ -resume the torrent after setting the SSL certificate. │ │ │ │ │ -If you receive a _t_o_r_r_e_n_t___n_e_e_d___c_e_r_t___a_l_e_r_t, you need to call this to provide a │ │ │ │ │ -valid cert. If you don't have a cert you won't be allowed to connect to any │ │ │ │ │ -peers. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ttoorrrreenntt__ffiillee__wwiitthh__hhaasshheess(()) ttoorrrreenntt__ffiillee(()) ********** │ │ │ │ │ -std::shared_ptr ttoorrrreenntt__ffiillee__wwiitthh__hhaasshheess () const; │ │ │ │ │ -std::shared_ptr ttoorrrreenntt__ffiillee () const; │ │ │ │ │ -_t_o_r_r_e_n_t___f_i_l_e_(_) returns a pointer to the _t_o_r_r_e_n_t___i_n_f_o object associated with │ │ │ │ │ -this torrent. The _t_o_r_r_e_n_t___i_n_f_o object may be a copy of the internal object. If │ │ │ │ │ -the torrent doesn't have metadata, the pointer will not be initialized (i.e. a │ │ │ │ │ -nullptr). The torrent may be in a state without metadata only if it was started │ │ │ │ │ -without a .torrent file, e.g. by being added by magnet link. │ │ │ │ │ -Note that the _t_o_r_r_e_n_t___i_n_f_o object returned here may be a different instance │ │ │ │ │ -than the one added to the _s_e_s_s_i_o_n, with different attributes like piece layers, │ │ │ │ │ -dht nodes and trackers. A _t_o_r_r_e_n_t___i_n_f_o object does not round-trip cleanly when │ │ │ │ │ -added to a _s_e_s_s_i_o_n. │ │ │ │ │ -If you want to save a .torrent file from the _t_o_r_r_e_n_t___h_a_n_d_l_e, instead call │ │ │ │ │ -_s_a_v_e___r_e_s_u_m_e___d_a_t_a_(_) and _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e_(_) the _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s object │ │ │ │ │ -passed back in the _a_l_e_r_t. │ │ │ │ │ -_t_o_r_r_e_n_t___f_i_l_e___w_i_t_h___h_a_s_h_e_s_(_) returns a ccooppyy of the internal _t_o_r_r_e_n_t___i_n_f_o and │ │ │ │ │ -piece layer hashes (if it's a v2 torrent). The piece layers will only be │ │ │ │ │ -included if they are available. If this torrent was added from a .torrent file │ │ │ │ │ -with piece layers or if it's seeding, the piece layers are available. This │ │ │ │ │ -function is more expensive than _t_o_r_r_e_n_t___f_i_l_e_(_) since it needs to make copies of │ │ │ │ │ -this information. │ │ │ │ │ -The _t_o_r_r_e_n_t___f_i_l_e___w_i_t_h___h_a_s_h_e_s_(_) is here for backwards compatibility when │ │ │ │ │ -constructing a _c_r_e_a_t_e___t_o_r_r_e_n_t object from a _t_o_r_r_e_n_t___i_n_f_o that's in a _s_e_s_s_i_o_n. │ │ │ │ │ -Prefer _s_a_v_e___r_e_s_u_m_e___d_a_t_a_(_) + _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e_(_). │ │ │ │ │ -Note that a torrent added from a magnet link may not have the full merkle trees │ │ │ │ │ -for all files, and hence not have the complete piece layers. In that state, you │ │ │ │ │ -cannot create a .torrent file even from the _t_o_r_r_e_n_t___i_n_f_o returned from │ │ │ │ │ -_t_o_r_r_e_n_t___f_i_l_e___w_i_t_h___h_a_s_h_e_s_(_). Once the torrent completes downloading all files, │ │ │ │ │ -becoming a seed, you can make a .torrent file from it. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppiieeccee__llaayyeerrss(()) ********** │ │ │ │ │ -std::vector> ppiieeccee__llaayyeerrss () const; │ │ │ │ │ -returns the piece layers for all files in the torrent. If this is a v1 torrent │ │ │ │ │ -(and doesn't have any piece layers) it returns an empty vector. This is a │ │ │ │ │ -blocking call that will synchronize with the libtorrent network thread. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppiieeccee__aavvaaiillaabbiilliittyy(()) ppoosstt__ppiieeccee__aavvaaiillaabbiilliittyy(()) ********** │ │ │ │ │ -void ppoosstt__ppiieeccee__aavvaaiillaabbiilliittyy () const; │ │ │ │ │ -void ppiieeccee__aavvaaiillaabbiilliittyy (std::vector& avail) const; │ │ │ │ │ -The piece availability is the number of peers that we are connected that has │ │ │ │ │ -advertised having a particular piece. This is the information that libtorrent │ │ │ │ │ -uses in order to prefer picking rare pieces. │ │ │ │ │ -post_piece_availability() will trigger a _p_i_e_c_e___a_v_a_i_l_a_b_i_l_i_t_y___a_l_e_r_t to be posted. │ │ │ │ │ -piece_availability() fills the specified std::vector with the availability │ │ │ │ │ -for each piece in this torrent. libtorrent does not keep track of availability │ │ │ │ │ -for seeds, so if the torrent is seeding the availability for all pieces is │ │ │ │ │ -reported as 0. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** pprriioorriittiizzee__ppiieecceess(()) ppiieeccee__pprriioorriittyy(()) ggeett__ppiieeccee__pprriioorriittiieess(()) ********** │ │ │ │ │ -void pprriioorriittiizzee__ppiieecceess (std::vector const& pieces) const; │ │ │ │ │ -void pprriioorriittiizzee__ppiieecceess (std::vector> const& pieces) const; │ │ │ │ │ -std::vector ggeett__ppiieeccee__pprriioorriittiieess () const; │ │ │ │ │ -download_priority_t ppiieeccee__pprriioorriittyy (piece_index_t index) const; │ │ │ │ │ -void ppiieeccee__pprriioorriittyy (piece_index_t index, download_priority_t priority) const; │ │ │ │ │ -These functions are used to set and get the priority of individual pieces. By │ │ │ │ │ -default all pieces have priority 4. 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 priority levels. 0 means not to │ │ │ │ │ -download the piece at all. Otherwise, lower priority values means less likely │ │ │ │ │ -to be picked. Piece priority takes precedence over piece availability. Every │ │ │ │ │ -piece with priority 7 will be attempted to be picked before a priority 6 piece │ │ │ │ │ -and so on. │ │ │ │ │ -The default priority of pieces is 4. │ │ │ │ │ -Piece priorities can not be changed for torrents that have not downloaded the │ │ │ │ │ -metadata yet. Magnet links won't have metadata immediately. see the │ │ │ │ │ -_m_e_t_a_d_a_t_a___r_e_c_e_i_v_e_d___a_l_e_r_t. │ │ │ │ │ -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. The second overload of prioritize_pieces that takes a vector of pairs │ │ │ │ │ -will update the priorities of only select pieces, and leave all other │ │ │ │ │ -unaffected. Each pair is (piece, priority). That is, the first item is the │ │ │ │ │ -piece index and the second item is the priority of that piece. Invalid entries, │ │ │ │ │ -where the piece index or priority is out of range, are not allowed. │ │ │ │ │ -get_piece_priorities returns a vector with one element for each piece in the │ │ │ │ │ -torrent. Each element is the current priority of that piece. │ │ │ │ │ -It's possible to cancel the effect of ffiillee priorities by setting the priorities │ │ │ │ │ -for the affected pieces. Care has to be taken when mixing usage of file- and │ │ │ │ │ -piece priorities. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiillee__pprriioorriittyy(()) ggeett__ffiillee__pprriioorriittiieess(()) pprriioorriittiizzee__ffiilleess(()) ********** │ │ │ │ │ -std::vector ggeett__ffiillee__pprriioorriittiieess () const; │ │ │ │ │ -download_priority_t ffiillee__pprriioorriittyy (file_index_t index) const; │ │ │ │ │ -void ffiillee__pprriioorriittyy (file_index_t index, download_priority_t priority) const; │ │ │ │ │ -void pprriioorriittiizzee__ffiilleess (std::vector const& files) const; │ │ │ │ │ -index must be in the range [0, number_of_files). │ │ │ │ │ -file_priority() queries or sets the priority of file index. │ │ │ │ │ -prioritize_files() takes a vector that has at as many elements as there are │ │ │ │ │ -files in the torrent. Each _e_n_t_r_y is the priority of that file. The function │ │ │ │ │ -sets the priorities of all the pieces in the torrent based on the vector. │ │ │ │ │ -get_file_priorities() returns a vector with the priorities of all files. │ │ │ │ │ -The priority values are the same as for _p_i_e_c_e___p_r_i_o_r_i_t_y_(_). See │ │ │ │ │ -_d_o_w_n_l_o_a_d___p_r_i_o_r_i_t_y___t. │ │ │ │ │ -Whenever a file priority is changed, all other piece priorities are reset to │ │ │ │ │ -match the file priorities. In order to maintain special priorities for │ │ │ │ │ -particular pieces, _p_i_e_c_e___p_r_i_o_r_i_t_y_(_) has to be called again for those pieces. │ │ │ │ │ -You cannot set the file priorities on a torrent that does not yet have metadata │ │ │ │ │ -or a torrent that is a seed. file_priority(int, int) and _p_r_i_o_r_i_t_i_z_e___f_i_l_e_s_(_) are │ │ │ │ │ -both no-ops for such torrents. │ │ │ │ │ -Since changing file priorities may involve disk operations (of moving files in- │ │ │ │ │ -and out of the part file), the internal accounting of file priorities happen │ │ │ │ │ -asynchronously. i.e. setting file priorities and then immediately querying them │ │ │ │ │ -may not yield the same priorities just set. To synchronize with the priorities │ │ │ │ │ -taking effect, wait for the _f_i_l_e___p_r_i_o___a_l_e_r_t. │ │ │ │ │ -When combining file- and piece priorities, the resume file will record both. │ │ │ │ │ -When loading the resume data, the file priorities will be applied first, then │ │ │ │ │ -the piece priorities. │ │ │ │ │ -Moving data from a file into the part file is currently not supported. If a │ │ │ │ │ -file has its priority set to 0 aafftteerr it has already been created, it will not │ │ │ │ │ -be moved into the partfile. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffoorrccee__ddhhtt__aannnnoouunnccee(()) ffoorrccee__rreeaannnnoouunnccee(()) ffoorrccee__llssdd__aannnnoouunnccee(()) ********** │ │ │ │ │ -void ffoorrccee__rreeaannnnoouunnccee (int seconds = 0, int idx = -1, reannounce_flags_t = {}) │ │ │ │ │ -const; │ │ │ │ │ -void ffoorrccee__ddhhtt__aannnnoouunnccee () const; │ │ │ │ │ -void ffoorrccee__llssdd__aannnnoouunnccee () const; │ │ │ │ │ -force_reannounce() will force this torrent to do another tracker request, to │ │ │ │ │ -receive new peers. The seconds argument specifies how many seconds from now to │ │ │ │ │ -issue the tracker announces. │ │ │ │ │ -If the tracker's min_interval has not passed since the last announce, the │ │ │ │ │ -forced announce will be scheduled to happen immediately as the min_interval │ │ │ │ │ -expires. This is to honor trackers minimum re-announce interval settings. │ │ │ │ │ -The tracker_index argument specifies which tracker to re-announce. If set to - │ │ │ │ │ -1 (which is the default), all trackers are re-announce. │ │ │ │ │ -The flags argument can be used to affect the re-announce. See │ │ │ │ │ -ignore_min_interval. │ │ │ │ │ -force_dht_announce will announce the torrent to the DHT immediately. │ │ │ │ │ -force_lsd_announce will announce the torrent on LSD immediately. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ssccrraappee__ttrraacckkeerr(()) ********** │ │ │ │ │ -void ssccrraappee__ttrraacckkeerr (int idx = -1) const; │ │ │ │ │ -scrape_tracker() will send a scrape request to a tracker. By default (idx = -1) │ │ │ │ │ -it will scrape the last working tracker. If idx is >= 0, the tracker with the │ │ │ │ │ -specified index will scraped. │ │ │ │ │ -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 _t_o_r_r_e_n_t___s_t_a_t_u_s struct once it completes. When it completes, it │ │ │ │ │ -will generate a _s_c_r_a_p_e___r_e_p_l_y___a_l_e_r_t. If it fails, it will generate a │ │ │ │ │ -_s_c_r_a_p_e___f_a_i_l_e_d___a_l_e_r_t. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddoowwnnllooaadd__lliimmiitt(()) sseett__ddoowwnnllooaadd__lliimmiitt(()) uuppllooaadd__lliimmiitt(()) sseett__uuppllooaadd__lliimmiitt(()) │ │ │ │ │ -********** │ │ │ │ │ -int uuppllooaadd__lliimmiitt () const; │ │ │ │ │ -int ddoowwnnllooaadd__lliimmiitt () const; │ │ │ │ │ -void sseett__uuppllooaadd__lliimmiitt (int limit) const; │ │ │ │ │ -void sseett__ddoowwnnllooaadd__lliimmiitt (int 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 (settings_pack::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. │ │ │ │ │ -Local peers are not rate limited by default. see _p_e_e_r_ _c_l_a_s_s_e_s. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ccoonnnneecctt__ppeeeerr(()) ********** │ │ │ │ │ -void ccoonnnneecctt__ppeeeerr (tcp::endpoint const& adr, peer_source_flags_t source = {} │ │ │ │ │ - , pex_flags_t flags = pex_encryption | pex_utp | pex_holepunch) 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 system_error. The │ │ │ │ │ -second (optional) argument will be bitwise ORed into the source mask of this │ │ │ │ │ -peer. Typically this is one of the source flags in _p_e_e_r___i_n_f_o. i.e. tracker, │ │ │ │ │ -pex, dht etc. │ │ │ │ │ -For possible values of flags, see _p_e_x___f_l_a_g_s___t. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** cclleeaarr__ppeeeerrss(()) ********** │ │ │ │ │ -void cclleeaarr__ppeeeerrss (); │ │ │ │ │ -This will disconnect all peers and clear the peer list for this torrent. New │ │ │ │ │ -peers will have to be acquired before resuming, from trackers, DHT or local │ │ │ │ │ -service discovery, for example. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** mmaaxx__uuppllooaaddss(()) sseett__mmaaxx__uuppllooaaddss(()) ********** │ │ │ │ │ -int mmaaxx__uuppllooaaddss () const; │ │ │ │ │ -void sseett__mmaaxx__uuppllooaaddss (int max_uploads) 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. This │ │ │ │ │ -defaults to infinite. The primary setting controlling this is the global │ │ │ │ │ -unchoke slots limit, set by unchoke_slots_limit in _s_e_t_t_i_n_g_s___p_a_c_k. │ │ │ │ │ -max_uploads() returns the current settings. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__mmaaxx__ccoonnnneeccttiioonnss(()) mmaaxx__ccoonnnneeccttiioonnss(()) ********** │ │ │ │ │ -int mmaaxx__ccoonnnneeccttiioonnss () const; │ │ │ │ │ -void sseett__mmaaxx__ccoonnnneeccttiioonnss (int max_connections) const; │ │ │ │ │ -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. There is also a global limit of the number of connections, set by │ │ │ │ │ -connections_limit in _s_e_t_t_i_n_g_s___p_a_c_k. │ │ │ │ │ -max_connections() returns the current settings. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** mmoovvee__ssttoorraaggee(()) ********** │ │ │ │ │ -void mmoovvee__ssttoorraaggee (std::string const& save_path │ │ │ │ │ - , move_flags_t flags = move_flags_t::always_replace_files │ │ │ │ │ - ) const; │ │ │ │ │ -Moves the file(s) that this torrent are currently seeding from or downloading │ │ │ │ │ -to. If the given save_path is not located on the same drive as the original │ │ │ │ │ -save path, the files will be copied to the new drive and removed from their │ │ │ │ │ -original location. This will block all other disk IO, and other torrents │ │ │ │ │ -download and upload rates may drop while copying the file. │ │ │ │ │ -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. If the move fails for some reason, │ │ │ │ │ -storage_moved_failed_alert is generated instead, containing the error message. │ │ │ │ │ -The flags argument determines the behavior of the copying/moving of the files │ │ │ │ │ -in the torrent. see _m_o_v_e___f_l_a_g_s___t. │ │ │ │ │ -always_replace_files is the default and replaces any file that exist in both │ │ │ │ │ -the source directory and the target directory. │ │ │ │ │ -fail_if_exist first check to see that none of the copy operations would cause │ │ │ │ │ -an overwrite. If it would, it will fail. Otherwise it will proceed as if it was │ │ │ │ │ -in always_replace_files mode. Note that there is an inherent race condition │ │ │ │ │ -here. If the files in the target directory appear after the check but before │ │ │ │ │ -the copy or move completes, they will be overwritten. When failing because of │ │ │ │ │ -files already existing in the target path, the error of │ │ │ │ │ -move_storage_failed_alert is set to boost::system::errc::file_exists. │ │ │ │ │ -The intention is that a client may use this as a probe, and if it fails, ask │ │ │ │ │ -the user which mode to use. The client may then re-issue the move_storage call │ │ │ │ │ -with one of the other modes. │ │ │ │ │ -dont_replace always keeps the existing file in the target directory, if there │ │ │ │ │ -is one. The source files will still be removed in that case. Note that it won't │ │ │ │ │ -automatically re-check files. If an incomplete torrent is moved into a │ │ │ │ │ -directory with the complete files, pause, move, force-recheck and resume. │ │ │ │ │ -Without the re-checking, the torrent will keep downloading and files in the new │ │ │ │ │ -download directory will be overwritten. │ │ │ │ │ -Files that have been renamed to have absolute paths are not moved by this │ │ │ │ │ -function. Keep in mind that files that don't belong to the torrent but are │ │ │ │ │ -stored in the torrent's directory may be moved as well. This goes for files │ │ │ │ │ -that have been renamed to absolute paths that still end up inside the save │ │ │ │ │ -path. │ │ │ │ │ -When copying files, sparse regions are not likely to be preserved. This makes │ │ │ │ │ -it proportionally more expensive to move a large torrent when only few pieces │ │ │ │ │ -have been downloaded, since the files are then allocated with zeros in the │ │ │ │ │ -destination directory. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** rreennaammee__ffiillee(()) ********** │ │ │ │ │ -void rreennaammee__ffiillee (file_index_t index, std::string const& new_name) const; │ │ │ │ │ -Renames the file with the given index asynchronously. The rename operation is │ │ │ │ │ -complete when either a _f_i_l_e___r_e_n_a_m_e_d___a_l_e_r_t or _f_i_l_e___r_e_n_a_m_e___f_a_i_l_e_d___a_l_e_r_t is │ │ │ │ │ -posted. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** iinnffoo__hhaasshh(()) iinnffoo__hhaasshheess(()) ********** │ │ │ │ │ -sha1_hash iinnffoo__hhaasshh () const; │ │ │ │ │ -info_hash_t iinnffoo__hhaasshheess () const; │ │ │ │ │ -returns the info-hash(es) of the torrent. If this handle is to a torrent that │ │ │ │ │ -hasn't loaded yet (for instance by being added) by a URL, the returned value is │ │ │ │ │ -undefined. The info_hash() returns the SHA-1 info-hash for v1 torrents and a │ │ │ │ │ -truncated hash for v2 torrents. For the full v2 info-hash, use info_hashes() │ │ │ │ │ -instead. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ooppeerraattoorr!!==(()) ooppeerraattoorr<<(()) ooppeerraattoorr====(()) ********** │ │ │ │ │ -bool ooppeerraattoorr<< (const torrent_handle& h) const; │ │ │ │ │ -bool ooppeerraattoorr==== (const torrent_handle& h) const; │ │ │ │ │ -bool ooppeerraattoorr!!== (const torrent_handle& h) const; │ │ │ │ │ -comparison operators. The order of the torrents is unspecified but stable. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** iidd(()) ********** │ │ │ │ │ -std::uint32_t iidd () const; │ │ │ │ │ -returns a unique identifier for this torrent. It's not a dense index. It's not │ │ │ │ │ -preserved across sessions. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** nnaattiivvee__hhaannddllee(()) ********** │ │ │ │ │ -std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ -This function is intended only for use by plugins and the _a_l_e_r_t dispatch │ │ │ │ │ -function. This type does not have a stable ABI and should be relied on as │ │ │ │ │ -little as possible. Accessing the handle returned by this function is not │ │ │ │ │ -thread safe outside of libtorrent's internal thread (which is used to invoke │ │ │ │ │ -_p_l_u_g_i_n callbacks). The torrent class is not only eligible for changing ABI │ │ │ │ │ -across minor versions of libtorrent, its layout is also dependent on build │ │ │ │ │ -configuration. This adds additional requirements on a client to be built with │ │ │ │ │ -the exact same build configuration as libtorrent itself. i.e. the TORRENT_ │ │ │ │ │ -macros must match between libtorrent and the client builds. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** uusseerrddaattaa(()) ********** │ │ │ │ │ -client_data_t uusseerrddaattaa () const; │ │ │ │ │ -returns the userdata pointer as set in _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** iinn__sseessssiioonn(()) ********** │ │ │ │ │ -bool iinn__sseessssiioonn () const; │ │ │ │ │ -Returns true if the torrent is in the _s_e_s_s_i_o_n. It returns true before session:: │ │ │ │ │ -remove_torrent() is called, and false afterward. │ │ │ │ │ -Note that this is a blocking function, unlike _t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_i_s___v_a_l_i_d_(_) which │ │ │ │ │ -returns immediately. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - overwrite_existing │ │ │ │ │ - instruct libtorrent to overwrite any data that may already have been │ │ │ │ │ - downloaded with the data of the new piece being added. Using this flag │ │ │ │ │ - when adding a piece that is actively being downloaded from other peers │ │ │ │ │ - may have some unexpected consequences, as blocks currently being │ │ │ │ │ - downloaded from peers may not be replaced. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - query_distributed_copies │ │ │ │ │ - calculates distributed_copies, distributed_full_copies and │ │ │ │ │ - distributed_fraction. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - query_accurate_download_counters │ │ │ │ │ - includes partial downloaded blocks in total_done and total_wanted_done. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - query_last_seen_complete │ │ │ │ │ - includes last_seen_complete. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - query_pieces │ │ │ │ │ - populate the pieces field in _t_o_r_r_e_n_t___s_t_a_t_u_s. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - query_verified_pieces │ │ │ │ │ - includes verified_pieces (only applies to torrents in sseeeedd mmooddee). │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - query_torrent_file │ │ │ │ │ - includes torrent_file, which is all the static information from the │ │ │ │ │ - .torrent file. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - query_name │ │ │ │ │ - includes name, the name of the torrent. This is either derived from the │ │ │ │ │ - .torrent file, or from the &dn= magnet link argument or possibly some │ │ │ │ │ - other source. If the name of the torrent is not known, this is an empty │ │ │ │ │ - string. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - query_save_path │ │ │ │ │ - includes save_path, the path to the directory the files of the torrent │ │ │ │ │ - are saved to. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - alert_when_available │ │ │ │ │ - used to ask libtorrent to send an _a_l_e_r_t once the piece has been │ │ │ │ │ - downloaded, by passing alert_when_available. When set, the │ │ │ │ │ - _r_e_a_d___p_i_e_c_e___a_l_e_r_t _a_l_e_r_t will be delivered, with the piece data, when it's │ │ │ │ │ - downloaded. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - piece_granularity │ │ │ │ │ - only calculate file progress at piece granularity. This makes the │ │ │ │ │ - _f_i_l_e___p_r_o_g_r_e_s_s_(_) call cheaper and also only takes bytes that have passed │ │ │ │ │ - the hash check into account, so progress cannot regress in this mode. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - graceful_pause │ │ │ │ │ - will delay the disconnect of peers that we're still downloading │ │ │ │ │ - outstanding requests from. The torrent will not accept any more requests │ │ │ │ │ - and will disconnect all idle peers. As soon as a peer is done │ │ │ │ │ - transferring the blocks that were requested from it, it is disconnected. │ │ │ │ │ - This is a graceful shut down of the torrent in the sense that no │ │ │ │ │ - downloaded bytes are wasted. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - flush_disk_cache │ │ │ │ │ - the disk cache will be flushed before creating the resume data. This │ │ │ │ │ - avoids a problem with file timestamps in the resume data in case the │ │ │ │ │ - cache hasn't been flushed yet. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - save_info_dict │ │ │ │ │ - the resume data will contain the metadata from the torrent file as well. │ │ │ │ │ - This is useful for clients that don't keep .torrent files around │ │ │ │ │ - separately, or for torrents that were added via a magnet link. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - only_if_modified │ │ │ │ │ - this flag has the same behavior as the combination of: │ │ │ │ │ - if_counters_changed | if_download_progress | if_config_changed | │ │ │ │ │ - if_state_changed | if_metadata_changed │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - if_counters_changed │ │ │ │ │ - save resume data if any _c_o_u_n_t_e_r_s has changed since the last time resume │ │ │ │ │ - data was saved. This includes upload/download _c_o_u_n_t_e_r_s, active time │ │ │ │ │ - _c_o_u_n_t_e_r_s and scrape data. A torrent that is not paused will have its │ │ │ │ │ - active time _c_o_u_n_t_e_r_s incremented continuously. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - if_download_progress │ │ │ │ │ - save the resume data if any blocks have been downloaded since the last │ │ │ │ │ - time resume data was saved. This includes: * checking existing files on │ │ │ │ │ - disk * downloading a block from a peer │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - if_config_changed │ │ │ │ │ - save the resume data if configuration options changed since last time the │ │ │ │ │ - resume data was saved. This includes: * file- or piece priorities * │ │ │ │ │ - upload- and download rate limits * change max-uploads (unchoke slots) * │ │ │ │ │ - change max connection limit * enable/disable peer-exchange, local service │ │ │ │ │ - discovery or DHT * enable/disable apply IP-filter * enable/disable auto- │ │ │ │ │ - managed * enable/disable share-mode * enable/disable sequential-mode * │ │ │ │ │ - files renamed * storage moved (save_path changed) │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - if_state_changed │ │ │ │ │ - save the resume data if torrent state has changed since last time the │ │ │ │ │ - resume data was saved. This includes: * upload mode * paused state * │ │ │ │ │ - super-seeding * seed-mode │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - if_metadata_changed │ │ │ │ │ - save the resume data if any mmeettaaddaattaa changed since the last time resume │ │ │ │ │ - data was saved. This includes: * add/remove web seeds * add/remove │ │ │ │ │ - trackers * receiving metadata for a magnet link │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - ignore_min_interval │ │ │ │ │ - by default, force-reannounce will still honor the min-interval published │ │ │ │ │ - by the tracker. If this flag is set, it will be ignored and the tracker │ │ │ │ │ - is announced immediately. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ hhaasshh__vvaalluuee(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ -std::size_t hhaasshh__vvaalluuee (torrent_handle const& h); │ │ │ │ │ -for std::hash (and to support using this type in unordered_map etc.) │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ wweebb__sseeeedd__eennttrryy ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___i_n_f_o_._h_p_p" │ │ │ │ │ -the _w_e_b___s_e_e_d___e_n_t_r_y holds information about a web seed (also known as URL seed │ │ │ │ │ -or HTTP seed). It is essentially a URL with some state associated with it. For │ │ │ │ │ -more information, see _B_E_P_ _1_7 and _B_E_P_ _1_9. │ │ │ │ │ -struct web_seed_entry │ │ │ │ │ -{ │ │ │ │ │ - bool ooppeerraattoorr==== (web_seed_entry const& e) const; │ │ │ │ │ - bool ooppeerraattoorr<< (web_seed_entry const& e) const; │ │ │ │ │ - │ │ │ │ │ - enum type_t │ │ │ │ │ - { │ │ │ │ │ - url_seed, │ │ │ │ │ - http_seed, │ │ │ │ │ - }; │ │ │ │ │ - │ │ │ │ │ - std::string url; │ │ │ │ │ - std::string auth; │ │ │ │ │ - headers_t extra_headers; │ │ │ │ │ - std::uint8_t type; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ooppeerraattoorr====(()) ********** │ │ │ │ │ -bool ooppeerraattoorr==== (web_seed_entry const& e) const; │ │ │ │ │ -URL and type comparison │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ooppeerraattoorr<<(()) ********** │ │ │ │ │ -bool ooppeerraattoorr<< (web_seed_entry const& e) const; │ │ │ │ │ -URL and type less-than comparison │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** eennuumm ttyyppee__tt ********** │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___i_n_f_o_._h_p_p" │ │ │ │ │ - _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ -|_nn_aa_mm_ee_ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ -|_u_r_l___s_e_e_d_ _|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_h_t_t_p___s_e_e_d_|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - url │ │ │ │ │ - The URL of the web seed │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - auth │ │ │ │ │ - Optional authentication. If this is set, it's passed in as HTTP basic │ │ │ │ │ - auth to the web seed. The format is: username:password. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - extra_headers │ │ │ │ │ - Any extra HTTP headers that need to be passed to the web seed │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - type │ │ │ │ │ - The type of web seed (see _t_y_p_e___t) │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ llooaadd__ttoorrrreenntt__lliimmiittss ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___i_n_f_o_._h_p_p" │ │ │ │ │ -this object holds configuration options for limits to use when loading │ │ │ │ │ -torrents. They are meant to prevent loading potentially malicious torrents that │ │ │ │ │ -cause excessive memory allocations. │ │ │ │ │ -struct load_torrent_limits │ │ │ │ │ -{ │ │ │ │ │ - int mmaaxx__bbuuffffeerr__ssiizzee = 10000000; │ │ │ │ │ - int mmaaxx__ppiieecceess = 0x200000; │ │ │ │ │ - int mmaaxx__ddeeccooddee__ddeepptthh = 100; │ │ │ │ │ - int mmaaxx__ddeeccooddee__ttookkeennss = 3000000; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - max_buffer_size │ │ │ │ │ - the max size of a .torrent file to load into RAM │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - max_pieces │ │ │ │ │ - the max number of pieces allowed in the torrent │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - max_decode_depth │ │ │ │ │ - the max recursion depth in the bdecoded structure │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - max_decode_tokens │ │ │ │ │ - the max number of bdecode tokens │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ttoorrrreenntt__iinnffoo ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___i_n_f_o_._h_p_p" │ │ │ │ │ -the _t_o_r_r_e_n_t___i_n_f_o class holds the information found in a .torrent file. │ │ │ │ │ -class torrent_info │ │ │ │ │ -{ │ │ │ │ │ - ttoorrrreenntt__iinnffoo (char const* buffer, int size, error_code& ec); │ │ │ │ │ - ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file, error_code& ec); │ │ │ │ │ - ttoorrrreenntt__iinnffoo (span buffer, error_code& ec, from_span_t); │ │ │ │ │ - explicit ttoorrrreenntt__iinnffoo (span buffer, from_span_t); │ │ │ │ │ - explicit ttoorrrreenntt__iinnffoo (info_hash_t const& info_hash); │ │ │ │ │ - explicit ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file); │ │ │ │ │ - ttoorrrreenntt__iinnffoo (std::string const& filename, error_code& ec); │ │ │ │ │ - ttoorrrreenntt__iinnffoo (torrent_info const& t); │ │ │ │ │ - explicit ttoorrrreenntt__iinnffoo (std::string const& filename); │ │ │ │ │ - ttoorrrreenntt__iinnffoo (std::string const& filename, load_torrent_limits const& cfg); │ │ │ │ │ - ttoorrrreenntt__iinnffoo (span buffer, load_torrent_limits const& cfg, │ │ │ │ │ -from_span_t); │ │ │ │ │ - ttoorrrreenntt__iinnffoo (char const* buffer, int size); │ │ │ │ │ - ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file, load_torrent_limits const& │ │ │ │ │ -cfg); │ │ │ │ │ - ~~ttoorrrreenntt__iinnffoo (); │ │ │ │ │ - file_storage const& ffiilleess () const; │ │ │ │ │ - file_storage const& oorriigg__ffiilleess () const; │ │ │ │ │ - void rreennaammee__ffiillee (file_index_t index, std::string const& new_filename); │ │ │ │ │ - void rreemmaapp__ffiilleess (file_storage const& f); │ │ │ │ │ - std::vector const& ttrraacckkeerrss () const; │ │ │ │ │ - void aadddd__ttrraacckkeerr (std::string const& url, int tier = 0); │ │ │ │ │ - void cclleeaarr__ttrraacckkeerrss (); │ │ │ │ │ - void aadddd__ttrraacckkeerr (std::string const& url, int tier │ │ │ │ │ - , announce_entry::tracker_source source); │ │ │ │ │ - std::vector ssiimmiillaarr__ttoorrrreennttss () const; │ │ │ │ │ - std::vector ccoolllleeccttiioonnss () const; │ │ │ │ │ - void aadddd__uurrll__sseeeedd (std::string const& url │ │ │ │ │ - , std::string const& ext_auth = std::string() │ │ │ │ │ - , web_seed_entry::headers_t const& ext_headers = web_seed_entry:: │ │ │ │ │ -headers_t()); │ │ │ │ │ - std::vector const& wweebb__sseeeeddss () const; │ │ │ │ │ - void sseett__wweebb__sseeeeddss (std::vector seeds); │ │ │ │ │ - void aadddd__hhttttpp__sseeeedd (std::string const& url │ │ │ │ │ - , std::string const& extern_auth = std::string() │ │ │ │ │ - , web_seed_entry::headers_t const& extra_headers = web_seed_entry:: │ │ │ │ │ -headers_t()); │ │ │ │ │ - std::int64_t ttoottaall__ssiizzee () const; │ │ │ │ │ - int ppiieeccee__lleennggtthh () const; │ │ │ │ │ - int nnuumm__ppiieecceess () const; │ │ │ │ │ - int bblloocckkss__ppeerr__ppiieeccee () const; │ │ │ │ │ - index_range ppiieeccee__rraannggee () const; │ │ │ │ │ - piece_index_t llaasstt__ppiieeccee () const; │ │ │ │ │ - piece_index_t eenndd__ppiieeccee () const; │ │ │ │ │ - info_hash_t const& iinnffoo__hhaasshheess () const; │ │ │ │ │ - sha1_hash iinnffoo__hhaasshh () const noexcept; │ │ │ │ │ - bool vv22 () const; │ │ │ │ │ - bool vv11 () const; │ │ │ │ │ - int nnuumm__ffiilleess () const; │ │ │ │ │ - std::vector mmaapp__bblloocckk (piece_index_t const piece │ │ │ │ │ - , std::int64_t offset, int size) const; │ │ │ │ │ - peer_request mmaapp__ffiillee (file_index_t const file, std::int64_t offset, int │ │ │ │ │ -size) const; │ │ │ │ │ - string_view ssssll__cceerrtt () const; │ │ │ │ │ - bool iiss__vvaalliidd () const; │ │ │ │ │ - bool pprriivv () const; │ │ │ │ │ - bool iiss__ii22pp () const; │ │ │ │ │ - int ppiieeccee__ssiizzee (piece_index_t index) const; │ │ │ │ │ - char const* hhaasshh__ffoorr__ppiieeccee__ppttrr (piece_index_t const index) const; │ │ │ │ │ - sha1_hash hhaasshh__ffoorr__ppiieeccee (piece_index_t index) const; │ │ │ │ │ - bool iiss__llooaaddeedd () const; │ │ │ │ │ - const std::string& nnaammee () const; │ │ │ │ │ - std::time_t ccrreeaattiioonn__ddaattee () const; │ │ │ │ │ - const std::string& ccrreeaattoorr () const; │ │ │ │ │ - const std::string& ccoommmmeenntt () const; │ │ │ │ │ - std::vector> const& nnooddeess () const; │ │ │ │ │ - void aadddd__nnooddee (std::pair const& node); │ │ │ │ │ - bool ppaarrssee__iinnffoo__sseeccttiioonn (bdecode_node const& info, error_code& ec, int │ │ │ │ │ -max_pieces); │ │ │ │ │ - bdecode_node iinnffoo (char const* key) const; │ │ │ │ │ - span iinnffoo__sseeccttiioonn () const; │ │ │ │ │ - span ppiieeccee__llaayyeerr (file_index_t) const; │ │ │ │ │ - void ffrreeee__ppiieeccee__llaayyeerrss (); │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ttoorrrreenntt__iinnffoo(()) ********** │ │ │ │ │ -ttoorrrreenntt__iinnffoo (char const* buffer, int size, error_code& ec); │ │ │ │ │ -ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file, error_code& ec); │ │ │ │ │ -ttoorrrreenntt__iinnffoo (span buffer, error_code& ec, from_span_t); │ │ │ │ │ -explicit ttoorrrreenntt__iinnffoo (span buffer, from_span_t); │ │ │ │ │ -explicit ttoorrrreenntt__iinnffoo (info_hash_t const& info_hash); │ │ │ │ │ -explicit ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file); │ │ │ │ │ -ttoorrrreenntt__iinnffoo (std::string const& filename, error_code& ec); │ │ │ │ │ -ttoorrrreenntt__iinnffoo (torrent_info const& t); │ │ │ │ │ -explicit ttoorrrreenntt__iinnffoo (std::string const& filename); │ │ │ │ │ -ttoorrrreenntt__iinnffoo (std::string const& filename, load_torrent_limits const& cfg); │ │ │ │ │ -ttoorrrreenntt__iinnffoo (span buffer, load_torrent_limits const& cfg, │ │ │ │ │ -from_span_t); │ │ │ │ │ -ttoorrrreenntt__iinnffoo (char const* buffer, int size); │ │ │ │ │ -ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file, load_torrent_limits const& │ │ │ │ │ -cfg); │ │ │ │ │ -The constructor that takes an info-hash will initialize the info-hash to the │ │ │ │ │ -given value, but leave all other fields empty. 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 constructor that takes a _b_d_e_c_o_d_e___n_o_d_e will create a _t_o_r_r_e_n_t___i_n_f_o object │ │ │ │ │ -from the information found in the given torrent_file. The _b_d_e_c_o_d_e___n_o_d_e │ │ │ │ │ -represents a tree node in an bencoded file. To load an ordinary .torrent file │ │ │ │ │ -into a _b_d_e_c_o_d_e___n_o_d_e, use _b_d_e_c_o_d_e_(_). │ │ │ │ │ -The version that takes a buffer pointer and a size will decode it as a .torrent │ │ │ │ │ -file and initialize the _t_o_r_r_e_n_t___i_n_f_o object for you. │ │ │ │ │ -The version that takes a filename will simply load the torrent file and decode │ │ │ │ │ -it inside the constructor, for convenience. This might not be the most suitable │ │ │ │ │ -for applications that want to be able to report detailed errors on what might │ │ │ │ │ -go wrong. │ │ │ │ │ -There is an upper limit on the size of the torrent file that will be loaded by │ │ │ │ │ -the overload taking a filename. If it's important that even very large torrent │ │ │ │ │ -files are loaded, use one of the other overloads. │ │ │ │ │ -The overloads that takes an error_code const& never throws if an error occur, │ │ │ │ │ -they will simply set the error code to describe what went wrong and not fully │ │ │ │ │ -initialize the _t_o_r_r_e_n_t___i_n_f_o object. The overloads that do not take the extra │ │ │ │ │ -error_code parameter will always throw if an error occurs. These overloads are │ │ │ │ │ -not available when building without exception support. │ │ │ │ │ -The overload that takes a span also needs an extra parameter of type │ │ │ │ │ -from_span_t to disambiguate the std::string overload for string literals. There │ │ │ │ │ -is an object in the libtorrent namespace of this type called from_span. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ~~ttoorrrreenntt__iinnffoo(()) ********** │ │ │ │ │ -~~ttoorrrreenntt__iinnffoo (); │ │ │ │ │ -frees all storage associated with this _t_o_r_r_e_n_t___i_n_f_o object │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** oorriigg__ffiilleess(()) ffiilleess(()) ********** │ │ │ │ │ -file_storage const& ffiilleess () const; │ │ │ │ │ -file_storage const& oorriigg__ffiilleess () const; │ │ │ │ │ -The _f_i_l_e___s_t_o_r_a_g_e object contains the information on how to map the pieces to │ │ │ │ │ -files. It is separated from the _t_o_r_r_e_n_t___i_n_f_o object because when creating │ │ │ │ │ -torrents a storage object needs to be created without having a torrent file. │ │ │ │ │ -When renaming files in a storage, the storage needs to make its own copy of the │ │ │ │ │ -_f_i_l_e___s_t_o_r_a_g_e in order to make its mapping differ from the one in the torrent │ │ │ │ │ -file. │ │ │ │ │ -orig_files() returns the original (unmodified) file storage for this torrent. │ │ │ │ │ -This is used by the web server connection, which needs to request files with │ │ │ │ │ -the original names. Filename may be changed using torrent_info::rename_file(). │ │ │ │ │ -For more information on the _f_i_l_e___s_t_o_r_a_g_e object, see the separate document on │ │ │ │ │ -how to create torrents. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** rreennaammee__ffiillee(()) ********** │ │ │ │ │ -void rreennaammee__ffiillee (file_index_t index, std::string const& new_filename); │ │ │ │ │ -Renames the file with the specified index to the new name. The new filename is │ │ │ │ │ -reflected by the file_storage returned by files() but not by the one returned │ │ │ │ │ -by orig_files(). │ │ │ │ │ -If you want to rename the base name of the torrent (for a multi file torrent), │ │ │ │ │ -you can copy the file_storage (see _f_i_l_e_s_(_) and _o_r_i_g___f_i_l_e_s_(_) ), change the name, │ │ │ │ │ -and then use _r_e_m_a_p___f_i_l_e_s_(_). │ │ │ │ │ -The new_filename can both be a relative path, in which case the file name is │ │ │ │ │ -relative to the save_path of the torrent. If the new_filename is an absolute │ │ │ │ │ -path (i.e. is_complete(new_filename) == true), then the file is detached from │ │ │ │ │ -the save_path of the torrent. In this case the file is not moved when │ │ │ │ │ -_m_o_v_e___s_t_o_r_a_g_e_(_) is invoked. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** rreemmaapp__ffiilleess(()) ********** │ │ │ │ │ -void rreemmaapp__ffiilleess (file_storage const& f); │ │ │ │ │ -Warning │ │ │ │ │ -Usingremap_files()is discouraged as it's incompatible with v2 torrents. This is │ │ │ │ │ -because the piece boundaries and piece hashes in v2 torrents are intimately │ │ │ │ │ -tied to the file boundaries. Instead, just rename individual files, or │ │ │ │ │ -implement a custom _d_i_s_k___i_n_t_e_r_f_a_c_e to customize how to store files. │ │ │ │ │ -Remaps the file storage to a new file layout. This can be used to, for │ │ │ │ │ -instance, download all data in a torrent to a single file, or to a number of │ │ │ │ │ -fixed size sector aligned files, regardless of the number and sizes of the │ │ │ │ │ -files in the torrent. │ │ │ │ │ -The new specified file_storage must have the exact same size as the current │ │ │ │ │ -one. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ttrraacckkeerrss(()) aadddd__ttrraacckkeerr(()) cclleeaarr__ttrraacckkeerrss(()) ********** │ │ │ │ │ -std::vector const& ttrraacckkeerrss () const; │ │ │ │ │ -void aadddd__ttrraacckkeerr (std::string const& url, int tier = 0); │ │ │ │ │ -void cclleeaarr__ttrraacckkeerrss (); │ │ │ │ │ -void aadddd__ttrraacckkeerr (std::string const& url, int tier │ │ │ │ │ - , announce_entry::tracker_source source); │ │ │ │ │ -add_tracker() adds a tracker to the announce-list. The tier determines the │ │ │ │ │ -order in which the trackers are to be tried. The trackers() function will │ │ │ │ │ -return a sorted vector of _a_n_n_o_u_n_c_e___e_n_t_r_y. Each announce _e_n_t_r_y 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. For more │ │ │ │ │ -information, see _a_n_n_o_u_n_c_e___e_n_t_r_y. │ │ │ │ │ -trackers() returns all entries from announce-list. │ │ │ │ │ -clear_trackers() removes all trackers from announce-list. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ssiimmiillaarr__ttoorrrreennttss(()) ccoolllleeccttiioonnss(()) ********** │ │ │ │ │ -std::vector ssiimmiillaarr__ttoorrrreennttss () const; │ │ │ │ │ -std::vector ccoolllleeccttiioonnss () const; │ │ │ │ │ -These two functions are related to _B_E_P_ _3_8 (mutable torrents). The vectors │ │ │ │ │ -returned from these correspond to the "similar" and "collections" keys in the │ │ │ │ │ -.torrent file. Both info-hashes and collections from within the info-dict and │ │ │ │ │ -from outside of it are included. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__wweebb__sseeeeddss(()) wweebb__sseeeeddss(()) aadddd__uurrll__sseeeedd(()) aadddd__hhttttpp__sseeeedd(()) ********** │ │ │ │ │ -void aadddd__uurrll__sseeeedd (std::string const& url │ │ │ │ │ - , std::string const& ext_auth = std::string() │ │ │ │ │ - , web_seed_entry::headers_t const& ext_headers = web_seed_entry:: │ │ │ │ │ -headers_t()); │ │ │ │ │ -std::vector const& wweebb__sseeeeddss () const; │ │ │ │ │ -void sseett__wweebb__sseeeeddss (std::vector seeds); │ │ │ │ │ -void aadddd__hhttttpp__sseeeedd (std::string const& url │ │ │ │ │ - , std::string const& extern_auth = std::string() │ │ │ │ │ - , web_seed_entry::headers_t const& extra_headers = web_seed_entry:: │ │ │ │ │ -headers_t()); │ │ │ │ │ -web_seeds() returns all url seeds and http seeds in the torrent. Each _e_n_t_r_y is │ │ │ │ │ -a web_seed_entry and may refer to either a url seed or http seed. │ │ │ │ │ -add_url_seed() and add_http_seed() adds one url to the list of url/http seeds. │ │ │ │ │ -set_web_seeds() replaces all web seeds with the ones specified in the seeds │ │ │ │ │ -vector. │ │ │ │ │ -The extern_auth argument can be used for other authorization schemes than basic │ │ │ │ │ -HTTP authorization. If set, it will override any username and password found in │ │ │ │ │ -the URL itself. The string will be sent as the HTTP authorization header's │ │ │ │ │ -value (without specifying "Basic"). │ │ │ │ │ -The extra_headers argument defaults to an empty list, but can be used to insert │ │ │ │ │ -custom HTTP headers in the requests to a specific web seed. │ │ │ │ │ -See _h_t_t_p_ _s_e_e_d_i_n_g for more information. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ttoottaall__ssiizzee(()) ********** │ │ │ │ │ -std::int64_t ttoottaall__ssiizzee () const; │ │ │ │ │ -total_size() returns the total number of bytes the torrent-file represents. │ │ │ │ │ -Note that this is the number of pieces times the piece size (modulo the last │ │ │ │ │ -piece possibly being smaller). With pad files, the total size will be larger │ │ │ │ │ -than the sum of all (regular) file sizes. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppiieeccee__lleennggtthh(()) nnuumm__ppiieecceess(()) ********** │ │ │ │ │ -int ppiieeccee__lleennggtthh () const; │ │ │ │ │ -int nnuumm__ppiieecceess () const; │ │ │ │ │ -piece_length() and num_pieces() returns 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. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** bblloocckkss__ppeerr__ppiieeccee(()) ********** │ │ │ │ │ -int bblloocckkss__ppeerr__ppiieeccee () const; │ │ │ │ │ -returns the number of blocks there are in the typical piece. There may be fewer │ │ │ │ │ -in the last piece) │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** llaasstt__ppiieeccee(()) ppiieeccee__rraannggee(()) eenndd__ppiieeccee(()) ********** │ │ │ │ │ -index_range ppiieeccee__rraannggee () const; │ │ │ │ │ -piece_index_t llaasstt__ppiieeccee () const; │ │ │ │ │ -piece_index_t eenndd__ppiieeccee () const; │ │ │ │ │ -last_piece() returns the index to the last piece in the torrent and end_piece() │ │ │ │ │ -returns the index to the one-past-end piece in the torrent piece_range() │ │ │ │ │ -returns an implementation-defined type that can be used as the container in a │ │ │ │ │ -range-for loop. Where the values are the indices of all pieces in the │ │ │ │ │ -_f_i_l_e___s_t_o_r_a_g_e. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** iinnffoo__hhaasshh(()) iinnffoo__hhaasshheess(()) ********** │ │ │ │ │ -info_hash_t const& iinnffoo__hhaasshheess () const; │ │ │ │ │ -sha1_hash iinnffoo__hhaasshh () const noexcept; │ │ │ │ │ -returns the info-hash of the torrent. For BitTorrent v2 support, use │ │ │ │ │ -info_hashes() to get an object that may hold both a v1 and v2 info-hash │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** vv11(()) vv22(()) ********** │ │ │ │ │ -bool vv22 () const; │ │ │ │ │ -bool vv11 () const; │ │ │ │ │ -returns whether this torrent has v1 and/or v2 metadata, respectively. Hybrid │ │ │ │ │ -torrents have both. These are shortcuts for info_hashes().has_v1() and │ │ │ │ │ -info_hashes().has_v2() calls. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** nnuumm__ffiilleess(()) ********** │ │ │ │ │ -int nnuumm__ffiilleess () const; │ │ │ │ │ -If you need index-access to files you can use the num_files() along with the │ │ │ │ │ -file_path(), file_size()-family of functions to access files using indices. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** mmaapp__bblloocckk(()) ********** │ │ │ │ │ -std::vector mmaapp__bblloocckk (piece_index_t const piece │ │ │ │ │ - , std::int64_t offset, int size) 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. See _f_i_l_e___s_l_i_c_e. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** mmaapp__ffiillee(()) ********** │ │ │ │ │ -peer_request mmaapp__ffiillee (file_index_t const file, std::int64_t offset, int size) │ │ │ │ │ -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. See _p_e_e_r___r_e_q_u_e_s_t. │ │ │ │ │ -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(). │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ssssll__cceerrtt(()) ********** │ │ │ │ │ -string_view ssssll__cceerrtt () const; │ │ │ │ │ -Returns the SSL root certificate for the torrent, if it is an SSL torrent. │ │ │ │ │ -Otherwise returns an empty string. The certificate is the public certificate in │ │ │ │ │ -x509 format. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** iiss__vvaalliidd(()) ********** │ │ │ │ │ -bool iiss__vvaalliidd () const; │ │ │ │ │ -returns true if this _t_o_r_r_e_n_t___i_n_f_o object has a torrent loaded. This is │ │ │ │ │ -primarily used to determine if a magnet link has had its metadata resolved yet │ │ │ │ │ -or not. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** pprriivv(()) ********** │ │ │ │ │ -bool pprriivv () const; │ │ │ │ │ -returns true if this torrent is private. i.e., the client should not advertise │ │ │ │ │ -itself on the trackerless network (the Kademlia DHT) for this torrent. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** iiss__ii22pp(()) ********** │ │ │ │ │ -bool iiss__ii22pp () const; │ │ │ │ │ -returns true if this is an i2p torrent. This is determined by whether or not it │ │ │ │ │ -has a tracker whose URL domain name ends with ".i2p". i2p torrents disable the │ │ │ │ │ -DHT and local peer discovery as well as talking to peers over anything other │ │ │ │ │ -than the i2p network. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppiieeccee__ssiizzee(()) ********** │ │ │ │ │ -int ppiieeccee__ssiizzee (piece_index_t index) const; │ │ │ │ │ -returns the piece size of file with index. This will be the same as │ │ │ │ │ -_p_i_e_c_e___l_e_n_g_t_h_(_), except for the last piece, which may be shorter. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** hhaasshh__ffoorr__ppiieeccee__ppttrr(()) hhaasshh__ffoorr__ppiieeccee(()) ********** │ │ │ │ │ -char const* hhaasshh__ffoorr__ppiieeccee__ppttrr (piece_index_t const index) const; │ │ │ │ │ -sha1_hash hhaasshh__ffoorr__ppiieeccee (piece_index_t 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. hash_for_piece_ptr() returns a pointer to the 20 byte sha1 │ │ │ │ │ -digest for the piece. Note that the string is not 0-terminated. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** nnaammee(()) ********** │ │ │ │ │ -const std::string& nnaammee () const; │ │ │ │ │ -name() returns the name of the torrent. name contains UTF-8 encoded string. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ccrreeaattiioonn__ddaattee(()) ********** │ │ │ │ │ -std::time_t ccrreeaattiioonn__ddaattee () const; │ │ │ │ │ -creation_date() returns the creation date of the torrent as time_t (_p_o_s_i_x │ │ │ │ │ -_t_i_m_e). If there's no time stamp in the torrent file, 0 is returned. .. posix │ │ │ │ │ -time: _h_t_t_p_:_/_/_w_w_w_._o_p_e_n_g_r_o_u_p_._o_r_g_/_o_n_l_i_n_e_p_u_b_s_/_0_0_9_6_9_5_3_9_9_/_f_u_n_c_t_i_o_n_s_/_t_i_m_e_._h_t_m_l │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ccrreeaattoorr(()) ********** │ │ │ │ │ -const std::string& ccrreeaattoorr () const; │ │ │ │ │ -creator() returns the creator string in the torrent. If there is no creator │ │ │ │ │ -string it will return an empty string. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ccoommmmeenntt(()) ********** │ │ │ │ │ -const std::string& ccoommmmeenntt () const; │ │ │ │ │ -comment() returns the comment associated with the torrent. If there's no │ │ │ │ │ -comment, it will return an empty string. comment contains UTF-8 encoded string. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** nnooddeess(()) ********** │ │ │ │ │ -std::vector> const& nnooddeess () const; │ │ │ │ │ -If this torrent contains any DHT nodes, they are put in this vector in their │ │ │ │ │ -original form (host name and port number). │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aadddd__nnooddee(()) ********** │ │ │ │ │ -void aadddd__nnooddee (std::pair 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. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppaarrssee__iinnffoo__sseeccttiioonn(()) ********** │ │ │ │ │ -bool ppaarrssee__iinnffoo__sseeccttiioonn (bdecode_node const& info, error_code& ec, int │ │ │ │ │ -max_pieces); │ │ │ │ │ -populates the _t_o_r_r_e_n_t___i_n_f_o by providing just the info-dict buffer. This is used │ │ │ │ │ -when loading a torrent from a magnet link for instance, where we only have the │ │ │ │ │ -info-dict. The _b_d_e_c_o_d_e___n_o_d_e e points to a parsed info-dictionary. ec returns an │ │ │ │ │ -error code if something fails (typically if the info dictionary is malformed). │ │ │ │ │ -Themax_piecesparameter allows limiting the amount of memory dedicated to │ │ │ │ │ -loading the torrent, and fails for torrents that exceed the limit. To load │ │ │ │ │ -large torrents, this limit may also need to be raised in _s_e_t_t_i_n_g_s___p_a_c_k_:_: │ │ │ │ │ -_m_a_x___p_i_e_c_e___c_o_u_n_t and in calls to _r_e_a_d___r_e_s_u_m_e___d_a_t_a_(_). │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** iinnffoo(()) ********** │ │ │ │ │ -bdecode_node iinnffoo (char const* key) const; │ │ │ │ │ -This function looks up keys from the info-dictionary of the loaded torrent │ │ │ │ │ -file. It can be used to access extension values put in the .torrent file. If │ │ │ │ │ -the specified key cannot be found, it returns nullptr. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** iinnffoo__sseeccttiioonn(()) ********** │ │ │ │ │ -span iinnffoo__sseeccttiioonn () const; │ │ │ │ │ -returns a the raw info section of the torrent file. The underlying buffer is │ │ │ │ │ -still owned by the _t_o_r_r_e_n_t___i_n_f_o object │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppiieeccee__llaayyeerr(()) ********** │ │ │ │ │ -span ppiieeccee__llaayyeerr (file_index_t) const; │ │ │ │ │ -return the bytes of the piece layer hashes for the specified file. If the file │ │ │ │ │ -doesn't have a piece layer, an empty span is returned. The span size is │ │ │ │ │ -divisible by 32, the size of a SHA-256 hash. If the size of the file is smaller │ │ │ │ │ -than or equal to the piece size, the files "root hash" is the hash of the file │ │ │ │ │ -and is not saved separately in the "piece layers" field, but this function │ │ │ │ │ -still returns the root hash of the file in that case. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffrreeee__ppiieeccee__llaayyeerrss(()) ********** │ │ │ │ │ -void ffrreeee__ppiieeccee__llaayyeerrss (); │ │ │ │ │ -clears the piece layers from the _t_o_r_r_e_n_t___i_n_f_o. This is done by the _s_e_s_s_i_o_n when │ │ │ │ │ -a torrent is added, to avoid storing it twice. The piece layer (or other hashes │ │ │ │ │ -part of the merkle tree) are stored in the internal torrent object. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ hhaasshheerr ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_h_a_s_h_e_r_._h_p_p" │ │ │ │ │ -this is a SHA-1 hash class. │ │ │ │ │ -You use it by first instantiating it, then call update() to feed it with data. │ │ │ │ │ -i.e. you don't have to keep the entire buffer of which you want to create the │ │ │ │ │ -hash in memory. You can feed the _h_a_s_h_e_r parts of it at a time. When You have │ │ │ │ │ -fed the _h_a_s_h_e_r with all the data, you call final() and it will return the sha1- │ │ │ │ │ -hash of the data. │ │ │ │ │ -The constructor that takes a char const* and an integer will construct the sha1 │ │ │ │ │ -context and feed it the data passed in. │ │ │ │ │ -If you want to reuse the _h_a_s_h_e_r object once you have created a hash, you have │ │ │ │ │ -to call reset() to reinitialize it. │ │ │ │ │ -The built-in software version of sha1-algorithm was implemented by Steve Reid │ │ │ │ │ -and released as public domain. For more info, see src/sha1.cpp. │ │ │ │ │ -class hasher │ │ │ │ │ -{ │ │ │ │ │ - hhaasshheerr (); │ │ │ │ │ - explicit hhaasshheerr (span data); │ │ │ │ │ - hhaasshheerr (hasher const&); │ │ │ │ │ - hhaasshheerr (char const* data, int len); │ │ │ │ │ - hasher& ooppeerraattoorr== (hasher const&) &; │ │ │ │ │ - hasher& uuppddaattee (char const* data, int len); │ │ │ │ │ - hasher& uuppddaattee (span data); │ │ │ │ │ - sha1_hash ffiinnaall (); │ │ │ │ │ - void rreesseett (); │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** hhaasshheerr(()) ooppeerraattoorr==(()) ********** │ │ │ │ │ -explicit hhaasshheerr (span data); │ │ │ │ │ -hhaasshheerr (hasher const&); │ │ │ │ │ -hhaasshheerr (char const* data, int len); │ │ │ │ │ -hasher& ooppeerraattoorr== (hasher const&) &; │ │ │ │ │ -this is the same as default constructing followed by a call to update(data, │ │ │ │ │ -len). │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** uuppddaattee(()) ********** │ │ │ │ │ -hasher& uuppddaattee (char const* data, int len); │ │ │ │ │ -hasher& uuppddaattee (span data); │ │ │ │ │ -append the following bytes to what is being hashed │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiinnaall(()) ********** │ │ │ │ │ -sha1_hash ffiinnaall (); │ │ │ │ │ -returns the SHA-1 digest of the buffers previously passed to _u_p_d_a_t_e_(_) and the │ │ │ │ │ -_h_a_s_h_e_r constructor. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** rreesseett(()) ********** │ │ │ │ │ -void rreesseett (); │ │ │ │ │ -restore the _h_a_s_h_e_r state to be as if the _h_a_s_h_e_r has just been default │ │ │ │ │ -constructed. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ hhaasshheerr225566 ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_h_a_s_h_e_r_._h_p_p" │ │ │ │ │ -class hasher256 │ │ │ │ │ -{ │ │ │ │ │ - hhaasshheerr225566 (); │ │ │ │ │ - hhaasshheerr225566 (hasher256 const&); │ │ │ │ │ - hhaasshheerr225566 (char const* data, int len); │ │ │ │ │ - explicit hhaasshheerr225566 (span data); │ │ │ │ │ - hasher256& ooppeerraattoorr== (hasher256 const&) &; │ │ │ │ │ - hasher256& uuppddaattee (span data); │ │ │ │ │ - hasher256& uuppddaattee (char const* data, int len); │ │ │ │ │ - sha256_hash ffiinnaall (); │ │ │ │ │ - void rreesseett (); │ │ │ │ │ - ~~hhaasshheerr225566 (); │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** hhaasshheerr225566(()) ooppeerraattoorr==(()) ********** │ │ │ │ │ -hhaasshheerr225566 (hasher256 const&); │ │ │ │ │ -hhaasshheerr225566 (char const* data, int len); │ │ │ │ │ -explicit hhaasshheerr225566 (span data); │ │ │ │ │ -hasher256& ooppeerraattoorr== (hasher256 const&) &; │ │ │ │ │ -this is the same as default constructing followed by a call to update(data, │ │ │ │ │ -len). │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** uuppddaattee(()) ********** │ │ │ │ │ -hasher256& uuppddaattee (span data); │ │ │ │ │ -hasher256& uuppddaattee (char const* data, int len); │ │ │ │ │ -append the following bytes to what is being hashed │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiinnaall(()) ********** │ │ │ │ │ -sha256_hash ffiinnaall (); │ │ │ │ │ -returns the SHA-1 digest of the buffers previously passed to _u_p_d_a_t_e_(_) and the │ │ │ │ │ -_h_a_s_h_e_r constructor. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** rreesseett(()) ********** │ │ │ │ │ -void rreesseett (); │ │ │ │ │ -restore the _h_a_s_h_e_r state to be as if the _h_a_s_h_e_r has just been default │ │ │ │ │ -constructed. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ bbiittffiieelldd ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_b_i_t_f_i_e_l_d_._h_p_p" │ │ │ │ │ -The _b_i_t_f_i_e_l_d type stores any number of bits as a _b_i_t_f_i_e_l_d in a heap allocated │ │ │ │ │ -array. │ │ │ │ │ -struct bitfield │ │ │ │ │ -{ │ │ │ │ │ - bbiittffiieelldd (char const* b, int bits); │ │ │ │ │ - bbiittffiieelldd (int bits, bool val); │ │ │ │ │ - explicit bbiittffiieelldd (int bits); │ │ │ │ │ - bbiittffiieelldd () noexcept = default; │ │ │ │ │ - bbiittffiieelldd (bitfield const& rhs); │ │ │ │ │ - bbiittffiieelldd (bitfield&& rhs) noexcept = default; │ │ │ │ │ - void aassssiiggnn (char const* b, int const bits); │ │ │ │ │ - bool ooppeerraattoorr[[]] (int index) const noexcept; │ │ │ │ │ - bool ggeett__bbiitt (int index) const noexcept; │ │ │ │ │ - void cclleeaarr__bbiitt (int index) noexcept; │ │ │ │ │ - void sseett__bbiitt (int index) noexcept; │ │ │ │ │ - bool aallll__sseett () const noexcept; │ │ │ │ │ - bool nnoonnee__sseett () const noexcept; │ │ │ │ │ - int ssiizzee () const noexcept; │ │ │ │ │ - int nnuumm__wwoorrddss () const noexcept; │ │ │ │ │ - int nnuumm__bbyytteess () const noexcept; │ │ │ │ │ - bool eemmppttyy () const noexcept; │ │ │ │ │ - char const* ddaattaa () const noexcept; │ │ │ │ │ - char* ddaattaa () noexcept; │ │ │ │ │ - void sswwaapp (bitfield& rhs) noexcept; │ │ │ │ │ - int ccoouunntt () const noexcept; │ │ │ │ │ - int ffiinndd__ffiirrsstt__sseett () const noexcept; │ │ │ │ │ - int ffiinndd__llaasstt__cclleeaarr () const noexcept; │ │ │ │ │ - bool ooppeerraattoorr==== (lt::bitfield const& rhs) const; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** bbiittffiieelldd(()) ********** │ │ │ │ │ -bbiittffiieelldd (char const* b, int bits); │ │ │ │ │ -bbiittffiieelldd (int bits, bool val); │ │ │ │ │ -explicit bbiittffiieelldd (int bits); │ │ │ │ │ -bbiittffiieelldd () noexcept = default; │ │ │ │ │ -bbiittffiieelldd (bitfield const& rhs); │ │ │ │ │ -bbiittffiieelldd (bitfield&& rhs) noexcept = default; │ │ │ │ │ -constructs a new _b_i_t_f_i_e_l_d. The default constructor creates an empty _b_i_t_f_i_e_l_d. │ │ │ │ │ -bits is the size of the _b_i_t_f_i_e_l_d (specified in bits). val is the value to │ │ │ │ │ -initialize the bits to. If not specified all bits are initialized to 0. │ │ │ │ │ -The constructor taking a pointer b and bits copies a _b_i_t_f_i_e_l_d from the │ │ │ │ │ -specified buffer, and bits number of bits (rounded up to the nearest byte │ │ │ │ │ -boundary). │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aassssiiggnn(()) ********** │ │ │ │ │ -void aassssiiggnn (char const* b, int const bits); │ │ │ │ │ -copy _b_i_t_f_i_e_l_d from buffer b of bits number of bits, rounded up to the nearest │ │ │ │ │ -byte boundary. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ggeett__bbiitt(()) ooppeerraattoorr[[]](()) ********** │ │ │ │ │ -bool ooppeerraattoorr[[]] (int index) const noexcept; │ │ │ │ │ -bool ggeett__bbiitt (int index) const noexcept; │ │ │ │ │ -query bit at index. Returns true if bit is 1, otherwise false. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__bbiitt(()) cclleeaarr__bbiitt(()) ********** │ │ │ │ │ -void cclleeaarr__bbiitt (int index) noexcept; │ │ │ │ │ -void sseett__bbiitt (int index) noexcept; │ │ │ │ │ -set bit at index to 0 (clear_bit) or 1 (set_bit). │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aallll__sseett(()) ********** │ │ │ │ │ -bool aallll__sseett () const noexcept; │ │ │ │ │ -returns true if all bits in the _b_i_t_f_i_e_l_d are set │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** nnoonnee__sseett(()) ********** │ │ │ │ │ -bool nnoonnee__sseett () const noexcept; │ │ │ │ │ -returns true if no bit in the _b_i_t_f_i_e_l_d is set │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ssiizzee(()) ********** │ │ │ │ │ -int ssiizzee () const noexcept; │ │ │ │ │ -returns the size of the _b_i_t_f_i_e_l_d in bits. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** nnuumm__wwoorrddss(()) ********** │ │ │ │ │ -int nnuumm__wwoorrddss () const noexcept; │ │ │ │ │ -returns the number of 32 bit words are needed to represent all bits in this │ │ │ │ │ -_b_i_t_f_i_e_l_d. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** nnuumm__bbyytteess(()) ********** │ │ │ │ │ -int nnuumm__bbyytteess () const noexcept; │ │ │ │ │ -returns the number of bytes needed to represent all bits in this _b_i_t_f_i_e_l_d │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** eemmppttyy(()) ********** │ │ │ │ │ -bool eemmppttyy () const noexcept; │ │ │ │ │ -returns true if the _b_i_t_f_i_e_l_d has zero size. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddaattaa(()) ********** │ │ │ │ │ -char const* ddaattaa () const noexcept; │ │ │ │ │ -char* ddaattaa () noexcept; │ │ │ │ │ -returns a pointer to the internal buffer of the _b_i_t_f_i_e_l_d, or nullptr if it's │ │ │ │ │ -empty. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sswwaapp(()) ********** │ │ │ │ │ -void sswwaapp (bitfield& rhs) noexcept; │ │ │ │ │ -swaps the bit-fields two variables refer to │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ccoouunntt(()) ********** │ │ │ │ │ -int ccoouunntt () const noexcept; │ │ │ │ │ -count the number of bits in the _b_i_t_f_i_e_l_d that are set to 1. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiinndd__ffiirrsstt__sseett(()) ********** │ │ │ │ │ -int ffiinndd__ffiirrsstt__sseett () const noexcept; │ │ │ │ │ -returns the index of the first set bit in the _b_i_t_f_i_e_l_d, i.e. 1 bit. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiinndd__llaasstt__cclleeaarr(()) ********** │ │ │ │ │ -int ffiinndd__llaasstt__cclleeaarr () const noexcept; │ │ │ │ │ -returns the index to the last cleared bit in the _b_i_t_f_i_e_l_d, i.e. 0 bit. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ sseessssiioonn__pprrooxxyy ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n_._h_p_p" │ │ │ │ │ -this is a holder for the internal _s_e_s_s_i_o_n implementation object. Once the │ │ │ │ │ -_s_e_s_s_i_o_n destruction is explicitly initiated, this holder is used to synchronize │ │ │ │ │ -the completion of the shutdown. The lifetime of this object may outlive │ │ │ │ │ -_s_e_s_s_i_o_n, causing the _s_e_s_s_i_o_n destructor to not block. The _s_e_s_s_i_o_n___p_r_o_x_y │ │ │ │ │ -destructor will block however, until the underlying _s_e_s_s_i_o_n is done shutting │ │ │ │ │ -down. │ │ │ │ │ -struct session_proxy │ │ │ │ │ -{ │ │ │ │ │ - session_proxy& ooppeerraattoorr== (session_proxy const&) &; │ │ │ │ │ - ~~sseessssiioonn__pprrooxxyy (); │ │ │ │ │ - sseessssiioonn__pprrooxxyy (session_proxy const&); │ │ │ │ │ - session_proxy& ooppeerraattoorr== (session_proxy&&) & noexcept; │ │ │ │ │ - sseessssiioonn__pprrooxxyy (); │ │ │ │ │ - sseessssiioonn__pprrooxxyy (session_proxy&&) noexcept; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseessssiioonn__pprrooxxyy(()) ~~sseessssiioonn__pprrooxxyy(()) ooppeerraattoorr==(()) ********** │ │ │ │ │ -session_proxy& ooppeerraattoorr== (session_proxy const&) &; │ │ │ │ │ -~~sseessssiioonn__pprrooxxyy (); │ │ │ │ │ -sseessssiioonn__pprrooxxyy (session_proxy const&); │ │ │ │ │ -session_proxy& ooppeerraattoorr== (session_proxy&&) & noexcept; │ │ │ │ │ -sseessssiioonn__pprrooxxyy (); │ │ │ │ │ -sseessssiioonn__pprrooxxyy (session_proxy&&) noexcept; │ │ │ │ │ -default constructor, does not refer to any _s_e_s_s_i_o_n implementation object. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ sseessssiioonn ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n_._h_p_p" │ │ │ │ │ -The _s_e_s_s_i_o_n holds all state that spans multiple torrents. Among other things it │ │ │ │ │ -runs the network loop and manages all torrents. Once it's created, the _s_e_s_s_i_o_n │ │ │ │ │ -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. │ │ │ │ │ -You have some control over _s_e_s_s_i_o_n configuration through the session_handle:: │ │ │ │ │ -apply_settings() member function. To change one or more configuration options, │ │ │ │ │ -create a _s_e_t_t_i_n_g_s___p_a_c_k. object and fill it with the settings to be set and pass │ │ │ │ │ -it in to session::apply_settings(). │ │ │ │ │ -see _a_p_p_l_y___s_e_t_t_i_n_g_s_(_). │ │ │ │ │ -struct session : session_handle │ │ │ │ │ -{ │ │ │ │ │ - sseessssiioonn (session_params const& params, session_flags_t flags); │ │ │ │ │ - sseessssiioonn (); │ │ │ │ │ - sseessssiioonn (session_params&& params, session_flags_t flags); │ │ │ │ │ - explicit sseessssiioonn (session_params const& params); │ │ │ │ │ - explicit sseessssiioonn (session_params&& params); │ │ │ │ │ - sseessssiioonn (session_params const& params, io_context& ios); │ │ │ │ │ - sseessssiioonn (session_params&& params, io_context& ios); │ │ │ │ │ - sseessssiioonn (session_params&& params, io_context& ios, session_flags_t); │ │ │ │ │ - sseessssiioonn (session_params const& params, io_context& ios, session_flags_t); │ │ │ │ │ - ~~sseessssiioonn (); │ │ │ │ │ - session_proxy aabboorrtt (); │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseessssiioonn(()) ********** │ │ │ │ │ -sseessssiioonn (session_params const& params, session_flags_t flags); │ │ │ │ │ -sseessssiioonn (); │ │ │ │ │ -sseessssiioonn (session_params&& params, session_flags_t flags); │ │ │ │ │ -explicit sseessssiioonn (session_params const& params); │ │ │ │ │ -explicit sseessssiioonn (session_params&& params); │ │ │ │ │ -Constructs the _s_e_s_s_i_o_n objects which acts as the container of torrents. In │ │ │ │ │ -order to avoid a race condition between starting the _s_e_s_s_i_o_n and configuring │ │ │ │ │ -it, you can pass in a _s_e_s_s_i_o_n___p_a_r_a_m_s object. Its settings will take effect │ │ │ │ │ -before the _s_e_s_s_i_o_n starts up. │ │ │ │ │ -The overloads taking flags can be used to start a _s_e_s_s_i_o_n in paused mode (by │ │ │ │ │ -passing in session::paused). Note that add_default_plugins do not have an │ │ │ │ │ -affect on constructors that take a _s_e_s_s_i_o_n___p_a_r_a_m_s object. It already contains │ │ │ │ │ -the plugins to use. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseessssiioonn(()) ********** │ │ │ │ │ -sseessssiioonn (session_params const& params, io_context& ios); │ │ │ │ │ -sseessssiioonn (session_params&& params, io_context& ios); │ │ │ │ │ -sseessssiioonn (session_params&& params, io_context& ios, session_flags_t); │ │ │ │ │ -sseessssiioonn (session_params const& params, io_context& ios, session_flags_t); │ │ │ │ │ -Overload of the constructor that takes an external io_context to run the │ │ │ │ │ -_s_e_s_s_i_o_n object on. This is primarily useful for tests that may want to run │ │ │ │ │ -multiple sessions on a single io_context, or low resource systems where │ │ │ │ │ -additional threads are expensive and sharing an io_context with other events is │ │ │ │ │ -fine. │ │ │ │ │ -Warning │ │ │ │ │ -The _s_e_s_s_i_o_n object does not cleanly terminate with an external io_context. The │ │ │ │ │ -io_context::run() call mmuusstt have returned before it's safe to destruct the │ │ │ │ │ -_s_e_s_s_i_o_n. Which means you MMUUSSTT call _s_e_s_s_i_o_n_:_:_a_b_o_r_t_(_) and save the _s_e_s_s_i_o_n___p_r_o_x_y │ │ │ │ │ -first, then destruct the _s_e_s_s_i_o_n object, then sync with the io_context, then │ │ │ │ │ -destruct the _s_e_s_s_i_o_n___p_r_o_x_y object. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ~~sseessssiioonn(()) ********** │ │ │ │ │ -~~sseessssiioonn (); │ │ │ │ │ -The destructor of _s_e_s_s_i_o_n 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 _s_e_s_s_i_o_n returns. So, it's advised that any kind of interface │ │ │ │ │ -(such as windows) are closed before destructing the _s_e_s_s_i_o_n object. Because it │ │ │ │ │ -can take a few second for it to finish. The timeout can be set with │ │ │ │ │ -_a_p_p_l_y___s_e_t_t_i_n_g_s_(_). │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aabboorrtt(()) ********** │ │ │ │ │ -session_proxy aabboorrtt (); │ │ │ │ │ -In case you want to destruct the _s_e_s_s_i_o_n asynchronously, you can request a │ │ │ │ │ -_s_e_s_s_i_o_n destruction proxy. If you don't do this, the destructor of the _s_e_s_s_i_o_n │ │ │ │ │ -object will block while the trackers are contacted. If you keep one │ │ │ │ │ -session_proxy to the _s_e_s_s_i_o_n when destructing it, the destructor will not │ │ │ │ │ -block, but start to close down the _s_e_s_s_i_o_n, the destructor of the proxy will │ │ │ │ │ -then synchronize the threads. So, the destruction of the _s_e_s_s_i_o_n 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 _s_e_s_s_i_o_n is being │ │ │ │ │ -closed down, no operations are allowed on it). The only valid operation is │ │ │ │ │ -calling the destructor: │ │ │ │ │ -struct session_proxy {}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ sseessssiioonn__ppaarraammss ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n___p_a_r_a_m_s_._h_p_p" │ │ │ │ │ -The _s_e_s_s_i_o_n___p_a_r_a_m_s is a parameters pack for configuring the _s_e_s_s_i_o_n before it's │ │ │ │ │ -started. │ │ │ │ │ -struct session_params │ │ │ │ │ -{ │ │ │ │ │ - sseessssiioonn__ppaarraammss (settings_pack&& sp); │ │ │ │ │ - sseessssiioonn__ppaarraammss (settings_pack const& sp); │ │ │ │ │ - sseessssiioonn__ppaarraammss (); │ │ │ │ │ - sseessssiioonn__ppaarraammss (settings_pack&& sp │ │ │ │ │ - , std::vector> exts); │ │ │ │ │ - sseessssiioonn__ppaarraammss (settings_pack const& sp │ │ │ │ │ - , std::vector> exts); │ │ │ │ │ - │ │ │ │ │ - settings_pack settings; │ │ │ │ │ - std::vector> extensions; │ │ │ │ │ - dht::dht_state dht_state; │ │ │ │ │ - dht::dht_storage_constructor_type dht_storage_constructor; │ │ │ │ │ - disk_io_constructor_type disk_io_constructor; │ │ │ │ │ - std::map ext_state; │ │ │ │ │ - libtorrent::ip_filter ip_filter; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseessssiioonn__ppaarraammss(()) ********** │ │ │ │ │ -sseessssiioonn__ppaarraammss (settings_pack&& sp); │ │ │ │ │ -sseessssiioonn__ppaarraammss (settings_pack const& sp); │ │ │ │ │ -sseessssiioonn__ppaarraammss (); │ │ │ │ │ -This constructor can be used to start with the default plugins (ut_metadata, │ │ │ │ │ -ut_pex and smart_ban). Pass a _s_e_t_t_i_n_g_s___p_a_c_k to set the initial settings when │ │ │ │ │ -the _s_e_s_s_i_o_n starts. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseessssiioonn__ppaarraammss(()) ********** │ │ │ │ │ -sseessssiioonn__ppaarraammss (settings_pack&& sp │ │ │ │ │ - , std::vector> exts); │ │ │ │ │ -sseessssiioonn__ppaarraammss (settings_pack const& sp │ │ │ │ │ - , std::vector> exts); │ │ │ │ │ -This constructor helps to configure the set of initial plugins to be added to │ │ │ │ │ -the _s_e_s_s_i_o_n before it's started. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - settings │ │ │ │ │ - The settings to configure the _s_e_s_s_i_o_n with │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - extensions │ │ │ │ │ - the plugins to add to the _s_e_s_s_i_o_n as it is constructed │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - dht_state │ │ │ │ │ - DHT node ID and node addresses to bootstrap the DHT with. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - dht_storage_constructor │ │ │ │ │ - function object to construct the storage object for DHT items. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - disk_io_constructor │ │ │ │ │ - function object to create the disk I/O subsystem. Defaults to │ │ │ │ │ - default_disk_io_constructor. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - ext_state │ │ │ │ │ - this container can be used by extensions/plugins to store settings. It's │ │ │ │ │ - primarily here to make it convenient to save and restore state across │ │ │ │ │ - sessions, using _r_e_a_d___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) and _w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s_(_). │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - ip_filter │ │ │ │ │ - the IP filter to use for the _s_e_s_s_i_o_n. This restricts which peers are │ │ │ │ │ - allowed to connect. As if passed to _s_e_t___i_p___f_i_l_t_e_r_(_). │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ sseessssiioonn__hhaannddllee ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ -this class provides a non-owning handle to a _s_e_s_s_i_o_n and a subset of the │ │ │ │ │ -interface of the _s_e_s_s_i_o_n class. If the underlying _s_e_s_s_i_o_n is destructed any │ │ │ │ │ -handle to it will no longer be valid. _i_s___v_a_l_i_d_(_) will return false and any │ │ │ │ │ -operation on it will throw a system_error exception, with error code │ │ │ │ │ -invalid_session_handle. │ │ │ │ │ -struct session_handle │ │ │ │ │ -{ │ │ │ │ │ - bool iiss__vvaalliidd () const; │ │ │ │ │ - session_params sseessssiioonn__ssttaattee (save_state_flags_t flags = │ │ │ │ │ -save_state_flags_t::all()) const; │ │ │ │ │ - std::vector ggeett__ttoorrrreenntt__ssttaattuuss ( │ │ │ │ │ - std::function const& pred │ │ │ │ │ - , status_flags_t flags = {}) const; │ │ │ │ │ - void rreeffrreesshh__ttoorrrreenntt__ssttaattuuss (std::vector* ret │ │ │ │ │ - , status_flags_t flags = {}) const; │ │ │ │ │ - void ppoosstt__ttoorrrreenntt__uuppddaatteess (status_flags_t flags = status_flags_t::all()); │ │ │ │ │ - void ppoosstt__sseessssiioonn__ssttaattss (); │ │ │ │ │ - void ppoosstt__ddhhtt__ssttaattss (); │ │ │ │ │ - void sseett__ddhhtt__ssttaattee (dht::dht_state const& st); │ │ │ │ │ - void sseett__ddhhtt__ssttaattee (dht::dht_state&& st); │ │ │ │ │ - std::vector ggeett__ttoorrrreennttss () const; │ │ │ │ │ - torrent_handle ffiinndd__ttoorrrreenntt (sha1_hash const& info_hash) const; │ │ │ │ │ - void aassyynncc__aadddd__ttoorrrreenntt (add_torrent_params const& params); │ │ │ │ │ - torrent_handle aadddd__ttoorrrreenntt (add_torrent_params const& params); │ │ │ │ │ - void aassyynncc__aadddd__ttoorrrreenntt (add_torrent_params&& params); │ │ │ │ │ - torrent_handle aadddd__ttoorrrreenntt (add_torrent_params&& params, error_code& ec); │ │ │ │ │ - torrent_handle aadddd__ttoorrrreenntt (add_torrent_params&& params); │ │ │ │ │ - torrent_handle aadddd__ttoorrrreenntt (add_torrent_params const& params, error_code& │ │ │ │ │ -ec); │ │ │ │ │ - void ppaauussee (); │ │ │ │ │ - bool iiss__ppaauusseedd () const; │ │ │ │ │ - void rreessuummee (); │ │ │ │ │ - bool iiss__ddhhtt__rruunnnniinngg () const; │ │ │ │ │ - void sseett__ddhhtt__ssttoorraaggee (dht::dht_storage_constructor_type sc); │ │ │ │ │ - void aadddd__ddhhtt__nnooddee (std::pair const& node); │ │ │ │ │ - void ddhhtt__ggeett__iitteemm (sha1_hash const& target); │ │ │ │ │ - void ddhhtt__ggeett__iitteemm (std::array key │ │ │ │ │ - , std::string salt = std::string()); │ │ │ │ │ - sha1_hash ddhhtt__ppuutt__iitteemm (entry data); │ │ │ │ │ - void ddhhtt__ppuutt__iitteemm (std::array key │ │ │ │ │ - , std::function& │ │ │ │ │ - , std::int64_t&, std::string const&)> cb │ │ │ │ │ - , std::string salt = std::string()); │ │ │ │ │ - void ddhhtt__aannnnoouunnccee (sha1_hash const& info_hash, int port = 0, dht:: │ │ │ │ │ -announce_flags_t flags = {}); │ │ │ │ │ - void ddhhtt__ggeett__ppeeeerrss (sha1_hash const& info_hash); │ │ │ │ │ - void ddhhtt__lliivvee__nnooddeess (sha1_hash const& nid); │ │ │ │ │ - void ddhhtt__ssaammppllee__iinnffoohhaasshheess (udp::endpoint const& ep, sha1_hash const& │ │ │ │ │ -target); │ │ │ │ │ - void ddhhtt__ddiirreecctt__rreeqquueesstt (udp::endpoint const& ep, entry const& e, │ │ │ │ │ -client_data_t userdata = {}); │ │ │ │ │ - void aadddd__eexxtteennssiioonn (std::function( │ │ │ │ │ - torrent_handle const&, client_data_t)> ext); │ │ │ │ │ - void aadddd__eexxtteennssiioonn (std::shared_ptr ext); │ │ │ │ │ - ip_filter ggeett__iipp__ffiilltteerr () const; │ │ │ │ │ - void sseett__iipp__ffiilltteerr (ip_filter f); │ │ │ │ │ - void sseett__ppoorrtt__ffiilltteerr (port_filter const& f); │ │ │ │ │ - bool iiss__lliisstteenniinngg () const; │ │ │ │ │ - unsigned short ssssll__lliisstteenn__ppoorrtt () const; │ │ │ │ │ - unsigned short lliisstteenn__ppoorrtt () const; │ │ │ │ │ - ip_filter ggeett__ppeeeerr__ccllaassss__ffiilltteerr () const; │ │ │ │ │ - void sseett__ppeeeerr__ccllaassss__ffiilltteerr (ip_filter const& f); │ │ │ │ │ - void sseett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr (peer_class_type_filter const& f); │ │ │ │ │ - peer_class_type_filter ggeett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr () const; │ │ │ │ │ - peer_class_t ccrreeaattee__ppeeeerr__ccllaassss (char const* name); │ │ │ │ │ - void ddeelleettee__ppeeeerr__ccllaassss (peer_class_t cid); │ │ │ │ │ - void sseett__ppeeeerr__ccllaassss (peer_class_t cid, peer_class_info const& pci); │ │ │ │ │ - peer_class_info ggeett__ppeeeerr__ccllaassss (peer_class_t cid) const; │ │ │ │ │ - void rreemmoovvee__ttoorrrreenntt (const torrent_handle&, remove_flags_t = {}); │ │ │ │ │ - void aappppllyy__sseettttiinnggss (settings_pack&&); │ │ │ │ │ - settings_pack ggeett__sseettttiinnggss () const; │ │ │ │ │ - void aappppllyy__sseettttiinnggss (settings_pack const&); │ │ │ │ │ - void ppoopp__aalleerrttss (std::vector* alerts); │ │ │ │ │ - alert* wwaaiitt__ffoorr__aalleerrtt (time_duration max_wait); │ │ │ │ │ - void sseett__aalleerrtt__nnoottiiffyy (std::function const& fun); │ │ │ │ │ - void ddeelleettee__ppoorrtt__mmaappppiinngg (port_mapping_t handle); │ │ │ │ │ - std::vector aadddd__ppoorrtt__mmaappppiinngg (portmap_protocol t, int │ │ │ │ │ -external_port, int local_port); │ │ │ │ │ - void rreeooppeenn__nneettwwoorrkk__ssoocckkeettss (reopen_network_flags_t options = │ │ │ │ │ -reopen_map_ports); │ │ │ │ │ - std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ - │ │ │ │ │ - static constexpr save_state_flags_t ssaavvee__sseettttiinnggss = 0_bit; │ │ │ │ │ - static constexpr save_state_flags_t ssaavvee__ddhhtt__ssttaattee = 2_bit; │ │ │ │ │ - static constexpr save_state_flags_t ssaavvee__eexxtteennssiioonn__ssttaattee = 11_bit; │ │ │ │ │ - static constexpr save_state_flags_t ssaavvee__iipp__ffiilltteerr = 12_bit; │ │ │ │ │ - static constexpr peer_class_t gglloobbaall__ppeeeerr__ccllaassss__iidd {0}; │ │ │ │ │ - static constexpr peer_class_t ttccpp__ppeeeerr__ccllaassss__iidd {1}; │ │ │ │ │ - static constexpr peer_class_t llooccaall__ppeeeerr__ccllaassss__iidd {2}; │ │ │ │ │ - static constexpr remove_flags_t ddeelleettee__ffiilleess = 0_bit; │ │ │ │ │ - static constexpr remove_flags_t ddeelleettee__ppaarrttffiillee = 1_bit; │ │ │ │ │ - static constexpr session_flags_t ppaauusseedd = 2_bit; │ │ │ │ │ - static constexpr portmap_protocol uuddpp = portmap_protocol::udp; │ │ │ │ │ - static constexpr portmap_protocol ttccpp = portmap_protocol::tcp; │ │ │ │ │ - static constexpr reopen_network_flags_t rreeooppeenn__mmaapp__ppoorrttss = 0_bit; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** iiss__vvaalliidd(()) ********** │ │ │ │ │ -bool iiss__vvaalliidd () const; │ │ │ │ │ -returns true if this handle refers to a valid _s_e_s_s_i_o_n object. If the _s_e_s_s_i_o_n │ │ │ │ │ -has been destroyed, all _s_e_s_s_i_o_n___h_a_n_d_l_e objects will expire and not be valid. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseessssiioonn__ssttaattee(()) ********** │ │ │ │ │ -session_params sseessssiioonn__ssttaattee (save_state_flags_t flags = save_state_flags_t:: │ │ │ │ │ -all()) const; │ │ │ │ │ -returns the current _s_e_s_s_i_o_n state. This can be passed to _w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ -to save the state to disk and restored using _r_e_a_d___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) when │ │ │ │ │ -constructing a new _s_e_s_s_i_o_n. The kind of state that's included is all settings, │ │ │ │ │ -the DHT routing table, possibly plugin-specific state. the flags parameter can │ │ │ │ │ -be used to only save certain parts of the _s_e_s_s_i_o_n state │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ggeett__ttoorrrreenntt__ssttaattuuss(()) rreeffrreesshh__ttoorrrreenntt__ssttaattuuss(()) ********** │ │ │ │ │ -std::vector ggeett__ttoorrrreenntt__ssttaattuuss ( │ │ │ │ │ - std::function const& pred │ │ │ │ │ - , status_flags_t flags = {}) const; │ │ │ │ │ -void rreeffrreesshh__ttoorrrreenntt__ssttaattuuss (std::vector* ret │ │ │ │ │ - , status_flags_t flags = {}) const; │ │ │ │ │ -Note │ │ │ │ │ -these calls are potentially expensive and won't scale well with lots of │ │ │ │ │ -torrents. If you're concerned about performance, consider using │ │ │ │ │ -post_torrent_updates() instead. │ │ │ │ │ -get_torrent_status returns a vector of the _t_o_r_r_e_n_t___s_t_a_t_u_s for every torrent │ │ │ │ │ -which satisfies pred, which is a predicate function which determines if a │ │ │ │ │ -torrent should be included in the returned set or not. Returning true means it │ │ │ │ │ -should be included and false means excluded. The flags argument is the same as │ │ │ │ │ -to _t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_s_t_a_t_u_s_(_). Since pred is guaranteed to be called for every │ │ │ │ │ -torrent, it may be used to count the number of torrents of different categories │ │ │ │ │ -as well. │ │ │ │ │ -refresh_torrent_status takes a vector of _t_o_r_r_e_n_t___s_t_a_t_u_s structs (for instance │ │ │ │ │ -the same vector that was returned by _g_e_t___t_o_r_r_e_n_t___s_t_a_t_u_s_(_) ) and refreshes the │ │ │ │ │ -status based on the handle member. It is possible to use this function by first │ │ │ │ │ -setting up a vector of default constructed torrent_status objects, only │ │ │ │ │ -initializing the handle member, in order to request the torrent status for │ │ │ │ │ -multiple torrents in a single call. This can save a significant amount of time │ │ │ │ │ -if you have a lot of torrents. │ │ │ │ │ -Any _t_o_r_r_e_n_t___s_t_a_t_u_s object whose handle member is not referring to a valid │ │ │ │ │ -torrent are ignored. │ │ │ │ │ -The intended use of these functions is to start off by calling │ │ │ │ │ -get_torrent_status() to get a list of all torrents that match your criteria. │ │ │ │ │ -Then call refresh_torrent_status() on that list. This will only refresh the │ │ │ │ │ -status for the torrents in your list, and thus ignore all other torrents you │ │ │ │ │ -might be running. This may save a significant amount of time, especially if the │ │ │ │ │ -number of torrents you're interested in is small. In order to keep your list of │ │ │ │ │ -interested torrents up to date, you can either call get_torrent_status() from │ │ │ │ │ -time to time, to include torrents you might have become interested in since the │ │ │ │ │ -last time. In order to stop refreshing a certain torrent, simply remove it from │ │ │ │ │ -the list. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppoosstt__ttoorrrreenntt__uuppddaatteess(()) ********** │ │ │ │ │ -void ppoosstt__ttoorrrreenntt__uuppddaatteess (status_flags_t flags = status_flags_t::all()); │ │ │ │ │ -This functions instructs the _s_e_s_s_i_o_n to post the _s_t_a_t_e___u_p_d_a_t_e___a_l_e_r_t, containing │ │ │ │ │ -the status of all torrents whose state changed since the last time this │ │ │ │ │ -function was called. │ │ │ │ │ -Only torrents who has the state subscription flag set will be included. This │ │ │ │ │ -flag is on by default. See _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s. the flags argument is the same │ │ │ │ │ -as for _t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_s_t_a_t_u_s_(_). see status_flags_t in _t_o_r_r_e_n_t___h_a_n_d_l_e. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppoosstt__sseessssiioonn__ssttaattss(()) ********** │ │ │ │ │ -void ppoosstt__sseessssiioonn__ssttaattss (); │ │ │ │ │ -This function will post a _s_e_s_s_i_o_n___s_t_a_t_s___a_l_e_r_t object, containing a snapshot of │ │ │ │ │ -the performance _c_o_u_n_t_e_r_s from the internals of libtorrent. To interpret these │ │ │ │ │ -_c_o_u_n_t_e_r_s, query the _s_e_s_s_i_o_n via _s_e_s_s_i_o_n___s_t_a_t_s___m_e_t_r_i_c_s_(_). │ │ │ │ │ -For more information, see the _s_e_s_s_i_o_n_ _s_t_a_t_i_s_t_i_c_s section. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppoosstt__ddhhtt__ssttaattss(()) ********** │ │ │ │ │ -void ppoosstt__ddhhtt__ssttaattss (); │ │ │ │ │ -This will cause a _d_h_t___s_t_a_t_s___a_l_e_r_t to be posted. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__ddhhtt__ssttaattee(()) ********** │ │ │ │ │ -void sseett__ddhhtt__ssttaattee (dht::dht_state const& st); │ │ │ │ │ -void sseett__ddhhtt__ssttaattee (dht::dht_state&& st); │ │ │ │ │ -set the DHT state for the _s_e_s_s_i_o_n. This will be taken into account the next │ │ │ │ │ -time the DHT is started, as if it had been passed in via the _s_e_s_s_i_o_n___p_a_r_a_m_s on │ │ │ │ │ -startup. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ggeett__ttoorrrreennttss(()) ffiinndd__ttoorrrreenntt(()) ********** │ │ │ │ │ -std::vector ggeett__ttoorrrreennttss () const; │ │ │ │ │ -torrent_handle ffiinndd__ttoorrrreenntt (sha1_hash const& info_hash) const; │ │ │ │ │ -find_torrent() looks for a torrent with the given info-hash. In case there is │ │ │ │ │ -such a torrent in the _s_e_s_s_i_o_n, a _t_o_r_r_e_n_t___h_a_n_d_l_e to that torrent is returned. In │ │ │ │ │ -case the torrent cannot be found, an invalid _t_o_r_r_e_n_t___h_a_n_d_l_e 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 _s_e_s_s_i_o_n. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aassyynncc__aadddd__ttoorrrreenntt(()) aadddd__ttoorrrreenntt(()) ********** │ │ │ │ │ -void aassyynncc__aadddd__ttoorrrreenntt (add_torrent_params const& params); │ │ │ │ │ -torrent_handle aadddd__ttoorrrreenntt (add_torrent_params const& params); │ │ │ │ │ -void aassyynncc__aadddd__ttoorrrreenntt (add_torrent_params&& params); │ │ │ │ │ -torrent_handle aadddd__ttoorrrreenntt (add_torrent_params&& params, error_code& ec); │ │ │ │ │ -torrent_handle aadddd__ttoorrrreenntt (add_torrent_params&& params); │ │ │ │ │ -torrent_handle aadddd__ttoorrrreenntt (add_torrent_params const& params, error_code& ec); │ │ │ │ │ -You add torrents through the _a_d_d___t_o_r_r_e_n_t_(_) function where you give an object │ │ │ │ │ -with all the parameters. The _a_d_d___t_o_r_r_e_n_t_(_) overloads will block until the │ │ │ │ │ -torrent has been added (or failed to be added) and returns an error code and a │ │ │ │ │ -_t_o_r_r_e_n_t___h_a_n_d_l_e. In order to add torrents more efficiently, consider using │ │ │ │ │ -_a_s_y_n_c___a_d_d___t_o_r_r_e_n_t_(_) which returns immediately, without waiting for the torrent │ │ │ │ │ -to add. Notification of the torrent being added is sent as _a_d_d___t_o_r_r_e_n_t___a_l_e_r_t. │ │ │ │ │ -The save_path field in _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s must be set to a valid path where the │ │ │ │ │ -files for the torrent will be saved. Even when using a custom storage, this │ │ │ │ │ -needs to be set to something. If the save_path is empty, the call to │ │ │ │ │ -_a_d_d___t_o_r_r_e_n_t_(_) will throw a system_error exception. │ │ │ │ │ -The overload that does not take an error_code throws an exception on error and │ │ │ │ │ -is not available when building without exception support. The _t_o_r_r_e_n_t___h_a_n_d_l_e │ │ │ │ │ -returned by _a_d_d___t_o_r_r_e_n_t_(_) can be used to retrieve information about the │ │ │ │ │ -torrent's progress, its peers etc. It is also used to abort a torrent. │ │ │ │ │ -If the torrent you are trying to add already exists in the _s_e_s_s_i_o_n (is either │ │ │ │ │ -queued for checking, being checked or downloading) add_torrent() will throw │ │ │ │ │ -system_error which derives from std::exception unless duplicate_is_error is set │ │ │ │ │ -to false. In that case, _a_d_d___t_o_r_r_e_n_t_(_) will return the handle to the existing │ │ │ │ │ -torrent. │ │ │ │ │ -The _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s class has a flags field. It can be used to control what │ │ │ │ │ -state the new torrent will be added in. Common flags to want to control are │ │ │ │ │ -torrent_flags::paused and torrent_flags::auto_managed. In order to add a magnet │ │ │ │ │ -link that will just download the metadata, but no payload, set the │ │ │ │ │ -torrent_flags::upload_mode flag. │ │ │ │ │ -Special consideration has to be taken when adding hybrid torrents (i.e. │ │ │ │ │ -torrents that are BitTorrent v2 torrents that are backwards compatible with │ │ │ │ │ -v1). For more details, see _B_i_t_T_o_r_r_e_n_t_ _v_2_ _t_o_r_r_e_n_t_s. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppaauussee(()) rreessuummee(()) iiss__ppaauusseedd(()) ********** │ │ │ │ │ -void ppaauussee (); │ │ │ │ │ -bool iiss__ppaauusseedd () const; │ │ │ │ │ -void rreessuummee (); │ │ │ │ │ -Pausing the _s_e_s_s_i_o_n has the same effect as pausing every torrent in it, except │ │ │ │ │ -that torrents will not be resumed by the auto-manage mechanism. Resuming will │ │ │ │ │ -restore the torrents to their previous paused state. i.e. the _s_e_s_s_i_o_n pause │ │ │ │ │ -state is separate from the torrent pause state. A torrent is inactive if it is │ │ │ │ │ -paused or if the _s_e_s_s_i_o_n is paused. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** iiss__ddhhtt__rruunnnniinngg(()) ********** │ │ │ │ │ -bool iiss__ddhhtt__rruunnnniinngg () const; │ │ │ │ │ -is_dht_running() returns true if the DHT support has been started and false │ │ │ │ │ -otherwise. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__ddhhtt__ssttoorraaggee(()) ********** │ │ │ │ │ -void sseett__ddhhtt__ssttoorraaggee (dht::dht_storage_constructor_type sc); │ │ │ │ │ -set_dht_storage set a dht custom storage constructor function to be used │ │ │ │ │ -internally when the dht is created. │ │ │ │ │ -Since the dht storage is a critical component for the dht behavior, this │ │ │ │ │ -function will only be effective the next time the dht is started. If you never │ │ │ │ │ -touch this feature, a default map-memory based storage is used. │ │ │ │ │ -If you want to make sure the dht is initially created with your custom storage, │ │ │ │ │ -create a _s_e_s_s_i_o_n with the setting settings_pack::enable_dht to false, set your │ │ │ │ │ -constructor function and call apply_settings with settings_pack::enable_dht to │ │ │ │ │ -true. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aadddd__ddhhtt__nnooddee(()) ********** │ │ │ │ │ -void aadddd__ddhhtt__nnooddee (std::pair 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. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddhhtt__ggeett__iitteemm(()) ********** │ │ │ │ │ -void ddhhtt__ggeett__iitteemm (sha1_hash const& target); │ │ │ │ │ -query the DHT for an immutable item at the target hash. the result is posted as │ │ │ │ │ -a _d_h_t___i_m_m_u_t_a_b_l_e___i_t_e_m___a_l_e_r_t. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddhhtt__ggeett__iitteemm(()) ********** │ │ │ │ │ -void ddhhtt__ggeett__iitteemm (std::array key │ │ │ │ │ - , std::string salt = std::string()); │ │ │ │ │ -query the DHT for a mutable item under the public key key. this is an ed25519 │ │ │ │ │ -key. salt is optional and may be left as an empty string if no salt is to be │ │ │ │ │ -used. if the item is found in the DHT, a _d_h_t___m_u_t_a_b_l_e___i_t_e_m___a_l_e_r_t is posted. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddhhtt__ppuutt__iitteemm(()) ********** │ │ │ │ │ -sha1_hash ddhhtt__ppuutt__iitteemm (entry data); │ │ │ │ │ -store the given bencoded data as an immutable item in the DHT. the returned │ │ │ │ │ -hash is the key that is to be used to look the item up again. It's just the │ │ │ │ │ -SHA-1 hash of the bencoded form of the structure. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddhhtt__ppuutt__iitteemm(()) ********** │ │ │ │ │ -void ddhhtt__ppuutt__iitteemm (std::array key │ │ │ │ │ - , std::function& │ │ │ │ │ - , std::int64_t&, std::string const&)> cb │ │ │ │ │ - , std::string salt = std::string()); │ │ │ │ │ -store a mutable item. The key is the public key the blob is to be stored under. │ │ │ │ │ -The optional salt argument is a string that is to be mixed in with the key when │ │ │ │ │ -determining where in the DHT the value is to be stored. The callback function │ │ │ │ │ -is called from within the libtorrent network thread once we've found where to │ │ │ │ │ -store the blob, possibly with the current value stored under the key. The │ │ │ │ │ -values passed to the callback functions are: │ │ │ │ │ - entry& value │ │ │ │ │ - the current value stored under the key (may be empty). Also expected to │ │ │ │ │ - be set to the value to be stored by the function. │ │ │ │ │ - std::array& signature │ │ │ │ │ - the signature authenticating the current value. This may be zeros if │ │ │ │ │ - there is currently no value stored. The function is expected to fill in │ │ │ │ │ - this buffer with the signature of the new value to store. To generate the │ │ │ │ │ - signature, you may want to use the sign_mutable_item function. │ │ │ │ │ - std::int64_t& seq │ │ │ │ │ - current sequence number. May be zero if there is no current value. The │ │ │ │ │ - function is expected to set this to the new sequence number of the value │ │ │ │ │ - that is to be stored. Sequence numbers must be monotonically increasing. │ │ │ │ │ - Attempting to overwrite a value with a lower or equal sequence number │ │ │ │ │ - will fail, even if the signature is correct. │ │ │ │ │ - std::string const& salt │ │ │ │ │ - this is the salt that was used for this put call. │ │ │ │ │ -Since the callback function cb is called from within libtorrent, it is critical │ │ │ │ │ -to not perform any blocking operations. Ideally not even locking a mutex. Pass │ │ │ │ │ -any data required for this function along with the function object's context │ │ │ │ │ -and make the function entirely self-contained. The only reason data blob's │ │ │ │ │ -value is computed via a function instead of just passing in the new value is to │ │ │ │ │ -avoid race conditions. If you want to uuppddaattee the value in the DHT, you must │ │ │ │ │ -first retrieve it, then modify it, then write it back. The way the DHT works, │ │ │ │ │ -it is natural to always do a lookup before storing and calling the callback in │ │ │ │ │ -between is convenient. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddhhtt__aannnnoouunnccee(()) ddhhtt__ggeett__ppeeeerrss(()) ********** │ │ │ │ │ -void ddhhtt__aannnnoouunnccee (sha1_hash const& info_hash, int port = 0, dht:: │ │ │ │ │ -announce_flags_t flags = {}); │ │ │ │ │ -void ddhhtt__ggeett__ppeeeerrss (sha1_hash const& info_hash); │ │ │ │ │ -dht_get_peers() will issue a DHT get_peer request to the DHT for the specified │ │ │ │ │ -info-hash. The response (the peers) will be posted back in a │ │ │ │ │ -_d_h_t___g_e_t___p_e_e_r_s___r_e_p_l_y___a_l_e_r_t. │ │ │ │ │ -dht_announce() will issue a DHT announce request to the DHT to the specified │ │ │ │ │ -info-hash, advertising the specified port. If the port is left at its default, │ │ │ │ │ -0, the port will be implied by the DHT message's source port (which may improve │ │ │ │ │ -connectivity through a NAT). dht_announce() is not affected by the │ │ │ │ │ -announce_port override setting. │ │ │ │ │ -Both these functions are exposed for advanced custom use of the DHT. All │ │ │ │ │ -torrents eligible to be announce to the DHT will be automatically, by │ │ │ │ │ -libtorrent. │ │ │ │ │ -For possible flags, see _a_n_n_o_u_n_c_e___f_l_a_g_s___t. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddhhtt__lliivvee__nnooddeess(()) ********** │ │ │ │ │ -void ddhhtt__lliivvee__nnooddeess (sha1_hash const& nid); │ │ │ │ │ -Retrieve all the live DHT (identified by nid) nodes. All the nodes id and │ │ │ │ │ -endpoint will be returned in the list of nodes in the _a_l_e_r_t │ │ │ │ │ -dht_live_nodes_alert. Since this _a_l_e_r_t is a response to an explicit call, it │ │ │ │ │ -will always be posted, regardless of the _a_l_e_r_t mask. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddhhtt__ssaammppllee__iinnffoohhaasshheess(()) ********** │ │ │ │ │ -void ddhhtt__ssaammppllee__iinnffoohhaasshheess (udp::endpoint const& ep, sha1_hash const& target); │ │ │ │ │ -Query the DHT node specified by ep to retrieve a sample of the info-hashes that │ │ │ │ │ -the node currently have in their storage. The target is included for iterative │ │ │ │ │ -lookups so that indexing nodes can perform a key space traversal with a single │ │ │ │ │ -RPC per node by adjusting the target value for each RPC. It has no effect on │ │ │ │ │ -the returned sample value. The result is posted as a │ │ │ │ │ -dht_sample_infohashes_alert. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddhhtt__ddiirreecctt__rreeqquueesstt(()) ********** │ │ │ │ │ -void ddhhtt__ddiirreecctt__rreeqquueesstt (udp::endpoint const& ep, entry const& e, client_data_t │ │ │ │ │ -userdata = {}); │ │ │ │ │ -Send an arbitrary DHT request directly to the specified endpoint. This function │ │ │ │ │ -is intended for use by plugins. When a response is received or the request │ │ │ │ │ -times out, a _d_h_t___d_i_r_e_c_t___r_e_s_p_o_n_s_e___a_l_e_r_t will be posted with the response (if │ │ │ │ │ -any) and the userdata pointer passed in here. Since this _a_l_e_r_t is a response to │ │ │ │ │ -an explicit call, it will always be posted, regardless of the _a_l_e_r_t mask. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aadddd__eexxtteennssiioonn(()) ********** │ │ │ │ │ -void aadddd__eexxtteennssiioonn (std::function( │ │ │ │ │ - torrent_handle const&, client_data_t)> ext); │ │ │ │ │ -void aadddd__eexxtteennssiioonn (std::shared_ptr ext); │ │ │ │ │ -This function adds an extension to this _s_e_s_s_i_o_n. The argument is a function │ │ │ │ │ -object that is called with a torrent_handle and which should return a std:: │ │ │ │ │ -shared_ptr. To write custom plugins, see _l_i_b_t_o_r_r_e_n_t_ _p_l_u_g_i_n_s. │ │ │ │ │ -For the typical bittorrent client all of these extensions should be added. The │ │ │ │ │ -main plugins implemented in libtorrent are: │ │ │ │ │ - uTorrent metadata │ │ │ │ │ - Allows peers to download the metadata (.torrent files) from the swarm │ │ │ │ │ - directly. Makes it possible to join a swarm with just a tracker and info- │ │ │ │ │ - hash. │ │ │ │ │ -#include │ │ │ │ │ -ses.add_extension(<::create_ut_metadata_plugin); │ │ │ │ │ - uTorrent peer exchange │ │ │ │ │ - Exchanges peers between clients. │ │ │ │ │ -#include │ │ │ │ │ -ses.add_extension(<::create_ut_pex_plugin); │ │ │ │ │ - smart ban _p_l_u_g_i_n │ │ │ │ │ - A _p_l_u_g_i_n that, with a small overhead, can ban peers that sends bad data │ │ │ │ │ - with very high accuracy. Should eliminate most problems on poisoned │ │ │ │ │ - torrents. │ │ │ │ │ -#include │ │ │ │ │ -ses.add_extension(<::create_smart_ban_plugin); │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__iipp__ffiilltteerr(()) ggeett__iipp__ffiilltteerr(()) ********** │ │ │ │ │ -ip_filter ggeett__iipp__ffiilltteerr () const; │ │ │ │ │ -void sseett__iipp__ffiilltteerr (ip_filter f); │ │ │ │ │ -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 _i_p___f_i_l_t_e_r. │ │ │ │ │ -Each time a peer is blocked because of the IP filter, a _p_e_e_r___b_l_o_c_k_e_d___a_l_e_r_t is │ │ │ │ │ -generated. get_ip_filter() Returns the _i_p___f_i_l_t_e_r currently in the _s_e_s_s_i_o_n. See │ │ │ │ │ -_i_p___f_i_l_t_e_r. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__ppoorrtt__ffiilltteerr(()) ********** │ │ │ │ │ -void sseett__ppoorrtt__ffiilltteerr (port_filter const& f); │ │ │ │ │ -apply _p_o_r_t___f_i_l_t_e_r f to incoming and outgoing peers. a port filter will reject │ │ │ │ │ -making outgoing peer connections to certain remote ports. The main intention is │ │ │ │ │ -to be able to avoid triggering certain anti-virus software by connecting to │ │ │ │ │ -SMTP, FTP ports. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ssssll__lliisstteenn__ppoorrtt(()) lliisstteenn__ppoorrtt(()) iiss__lliisstteenniinngg(()) ********** │ │ │ │ │ -bool iiss__lliisstteenniinngg () const; │ │ │ │ │ -unsigned short ssssll__lliisstteenn__ppoorrtt () const; │ │ │ │ │ -unsigned short lliisstteenn__ppoorrtt () const; │ │ │ │ │ -is_listening() will tell you whether or not the _s_e_s_s_i_o_n has successfully opened │ │ │ │ │ -a listening port. If it hasn't, this function will return false, and then you │ │ │ │ │ -can set a new _s_e_t_t_i_n_g_s___p_a_c_k_:_:_l_i_s_t_e_n___i_n_t_e_r_f_a_c_e_s to try another interface and │ │ │ │ │ -port to bind to. │ │ │ │ │ -listen_port() returns the port we ended up listening on. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ggeett__ppeeeerr__ccllaassss__ffiilltteerr(()) sseett__ppeeeerr__ccllaassss__ffiilltteerr(()) ********** │ │ │ │ │ -ip_filter ggeett__ppeeeerr__ccllaassss__ffiilltteerr () const; │ │ │ │ │ -void sseett__ppeeeerr__ccllaassss__ffiilltteerr (ip_filter const& f); │ │ │ │ │ -Sets the peer class filter for this _s_e_s_s_i_o_n. All new peer connections will take │ │ │ │ │ -this into account and be added to the peer classes specified by this filter, │ │ │ │ │ -based on the peer's IP address. │ │ │ │ │ -The ip-filter essentially maps an IP -> uint32. Each bit in that 32 bit integer │ │ │ │ │ -represents a peer class. The least significant bit represents class 0, the next │ │ │ │ │ -bit class 1 and so on. │ │ │ │ │ -For more info, see _i_p___f_i_l_t_e_r. │ │ │ │ │ -For example, to make all peers in the range 200.1.1.0 - 200.1.255.255 belong to │ │ │ │ │ -their own peer class, apply the following filter: │ │ │ │ │ -ip_filter f = ses.get_peer_class_filter(); │ │ │ │ │ -peer_class_t my_class = ses.create_peer_class("200.1.x.x IP range"); │ │ │ │ │ -f.add_rule(make_address("200.1.1.0"), make_address("200.1.255.255") │ │ │ │ │ - , 1 << static_cast(my_class)); │ │ │ │ │ -ses.set_peer_class_filter(f); │ │ │ │ │ -This setting only applies to new connections, it won't affect existing peer │ │ │ │ │ -connections. │ │ │ │ │ -This function is limited to only peer class 0-31, since there are only 32 bits │ │ │ │ │ -in the IP range mapping. Only the set bits matter; no peer class will be │ │ │ │ │ -removed from a peer as a result of this call, peer classes are only added. │ │ │ │ │ -The peer_class argument cannot be greater than 31. The bitmasks representing │ │ │ │ │ -peer classes in the peer_class_filter are 32 bits. │ │ │ │ │ -The get_peer_class_filter() function returns the current filter. │ │ │ │ │ -For more information, see _p_e_e_r_ _c_l_a_s_s_e_s. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr(()) ggeett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr(()) ********** │ │ │ │ │ -void sseett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr (peer_class_type_filter const& f); │ │ │ │ │ -peer_class_type_filter ggeett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr () const; │ │ │ │ │ -Sets and gets the ppeeeerr ccllaassss ttyyppee ffiilltteerr. This is controls automatic peer class │ │ │ │ │ -assignments to peers based on what kind of socket it is. │ │ │ │ │ -It does not only support assigning peer classes, it also supports removing peer │ │ │ │ │ -classes based on socket type. │ │ │ │ │ -The order of these rules being applied are: │ │ │ │ │ - 1. peer-class IP filter │ │ │ │ │ - 2. peer-class type filter, removing classes │ │ │ │ │ - 3. peer-class type filter, adding classes │ │ │ │ │ -For more information, see _p_e_e_r_ _c_l_a_s_s_e_s. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ccrreeaattee__ppeeeerr__ccllaassss(()) ********** │ │ │ │ │ -peer_class_t ccrreeaattee__ppeeeerr__ccllaassss (char const* name); │ │ │ │ │ -Creates a new peer class (see _p_e_e_r_ _c_l_a_s_s_e_s) with the given name. The returned │ │ │ │ │ -integer is the new peer class identifier. Peer classes may have the same name, │ │ │ │ │ -so each invocation of this function creates a new class and returns a unique │ │ │ │ │ -identifier. │ │ │ │ │ -Identifiers are assigned from low numbers to higher. So if you plan on using │ │ │ │ │ -certain peer classes in a call to _s_e_t___p_e_e_r___c_l_a_s_s___f_i_l_t_e_r_(_), make sure to create │ │ │ │ │ -those early on, to get low identifiers. │ │ │ │ │ -For more information on peer classes, see _p_e_e_r_ _c_l_a_s_s_e_s. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddeelleettee__ppeeeerr__ccllaassss(()) ********** │ │ │ │ │ -void ddeelleettee__ppeeeerr__ccllaassss (peer_class_t cid); │ │ │ │ │ -This call dereferences the reference count of the specified peer class. When │ │ │ │ │ -creating a peer class it's automatically referenced by 1. If you want to │ │ │ │ │ -recycle a peer class, you may call this function. You may only call this │ │ │ │ │ -function oonnccee per peer class you create. Calling it more than once for the same │ │ │ │ │ -class will lead to memory corruption. │ │ │ │ │ -Since peer classes are reference counted, this function will not remove the │ │ │ │ │ -peer class if it's still assigned to torrents or peers. It will however remove │ │ │ │ │ -it once the last peer and torrent drops their references to it. │ │ │ │ │ -There is no need to call this function for custom peer classes. All peer │ │ │ │ │ -classes will be properly destructed when the _s_e_s_s_i_o_n object destructs. │ │ │ │ │ -For more information on peer classes, see _p_e_e_r_ _c_l_a_s_s_e_s. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__ppeeeerr__ccllaassss(()) ggeett__ppeeeerr__ccllaassss(()) ********** │ │ │ │ │ -void sseett__ppeeeerr__ccllaassss (peer_class_t cid, peer_class_info const& pci); │ │ │ │ │ -peer_class_info ggeett__ppeeeerr__ccllaassss (peer_class_t cid) const; │ │ │ │ │ -These functions queries information from a peer class and updates the │ │ │ │ │ -configuration of a peer class, respectively. │ │ │ │ │ -cid must refer to an existing peer class. If it does not, the return value of │ │ │ │ │ -get_peer_class() is undefined. │ │ │ │ │ -set_peer_class() sets all the information in the _p_e_e_r___c_l_a_s_s___i_n_f_o object in the │ │ │ │ │ -specified peer class. There is no option to only update a single property. │ │ │ │ │ -A peer or torrent belonging to more than one class, the highest priority among │ │ │ │ │ -any of its classes is the one that is taken into account. │ │ │ │ │ -For more information, see _p_e_e_r_ _c_l_a_s_s_e_s. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** rreemmoovvee__ttoorrrreenntt(()) ********** │ │ │ │ │ -void rreemmoovvee__ttoorrrreenntt (const torrent_handle&, remove_flags_t = {}); │ │ │ │ │ -remove_torrent() will close all peer connections associated with the torrent │ │ │ │ │ -and tell the tracker that we've stopped participating in the swarm. This │ │ │ │ │ -operation cannot fail. When it completes, you will receive a │ │ │ │ │ -_t_o_r_r_e_n_t___r_e_m_o_v_e_d___a_l_e_r_t. │ │ │ │ │ -_r_e_m_o_v_e___t_o_r_r_e_n_t_(_) is non-blocking, but will remove the torrent from the _s_e_s_s_i_o_n │ │ │ │ │ -synchronously. Calling _s_e_s_s_i_o_n___h_a_n_d_l_e_:_:_a_d_d___t_o_r_r_e_n_t_(_) immediately afterward with │ │ │ │ │ -the same torrent will succeed. Note that this creates a new handle which is not │ │ │ │ │ -equal to the removed one. │ │ │ │ │ -The optional second argument options can be used to delete all the files │ │ │ │ │ -downloaded by this torrent. To do so, pass in the value session_handle:: │ │ │ │ │ -delete_files. Once the torrent is deleted, a _t_o_r_r_e_n_t___d_e_l_e_t_e_d___a_l_e_r_t is posted. │ │ │ │ │ -The _t_o_r_r_e_n_t___h_a_n_d_l_e remains valid for some time after _r_e_m_o_v_e___t_o_r_r_e_n_t_(_) is │ │ │ │ │ -called. It will become invalid only after all libtorrent tasks (such as I/ │ │ │ │ │ -O tasks) release their references to the torrent. Until this happens, │ │ │ │ │ -_t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_i_s___v_a_l_i_d_(_) will return true, and other calls such as │ │ │ │ │ -_t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_s_t_a_t_u_s_(_) will succeed. Because of this, and because │ │ │ │ │ -_r_e_m_o_v_e___t_o_r_r_e_n_t_(_) is non-blocking, the following sequence usually succeeds (does │ │ │ │ │ -not throw system_error): .. code:: c++ │ │ │ │ │ - session.remove_handle(handle); handle.save_resume_data(); │ │ │ │ │ -Note that when a queued or downloading torrent is removed, its position in the │ │ │ │ │ -download queue is vacated and every subsequent torrent in the queue has their │ │ │ │ │ -queue positions updated. This can potentially cause a large state_update to be │ │ │ │ │ -posted. When removing all torrents, it is advised to remove them from the back │ │ │ │ │ -of the queue, to minimize the shifting. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aappppllyy__sseettttiinnggss(()) ggeett__sseettttiinnggss(()) ********** │ │ │ │ │ -void aappppllyy__sseettttiinnggss (settings_pack&&); │ │ │ │ │ -settings_pack ggeett__sseettttiinnggss () const; │ │ │ │ │ -void aappppllyy__sseettttiinnggss (settings_pack const&); │ │ │ │ │ -Applies the settings specified by the _s_e_t_t_i_n_g_s___p_a_c_k s. This is an asynchronous │ │ │ │ │ -operation that will return immediately and actually apply the settings to the │ │ │ │ │ -main thread of libtorrent some time later. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppoopp__aalleerrttss(()) wwaaiitt__ffoorr__aalleerrtt(()) sseett__aalleerrtt__nnoottiiffyy(()) ********** │ │ │ │ │ -void ppoopp__aalleerrttss (std::vector* alerts); │ │ │ │ │ -alert* wwaaiitt__ffoorr__aalleerrtt (time_duration max_wait); │ │ │ │ │ -void sseett__aalleerrtt__nnoottiiffyy (std::function const& fun); │ │ │ │ │ -Alerts is the main mechanism for libtorrent to report errors and events. │ │ │ │ │ -pop_alerts fills in the vector passed to it with pointers to new alerts. The │ │ │ │ │ -_s_e_s_s_i_o_n still owns these alerts and they will stay valid until the next time │ │ │ │ │ -pop_alerts is called. You may not delete the _a_l_e_r_t objects. │ │ │ │ │ -It is safe to call pop_alerts from multiple different threads, as long as the │ │ │ │ │ -alerts themselves are not accessed once another thread calls pop_alerts. Doing │ │ │ │ │ -this requires manual synchronization between the popping threads. │ │ │ │ │ -wait_for_alert will block the current thread for max_wait time duration, or │ │ │ │ │ -until another _a_l_e_r_t is posted. If an _a_l_e_r_t is available at the time of the │ │ │ │ │ -call, it returns immediately. The returned _a_l_e_r_t pointer is the head of the │ │ │ │ │ -_a_l_e_r_t queue. wait_for_alert does not pop alerts from the queue, it merely peeks │ │ │ │ │ -at it. The returned _a_l_e_r_t will stay valid until pop_alerts is called twice. The │ │ │ │ │ -first time will pop it and the second will free it. │ │ │ │ │ -If there is no _a_l_e_r_t in the queue and no _a_l_e_r_t arrives within the specified │ │ │ │ │ -timeout, wait_for_alert returns nullptr. │ │ │ │ │ -In the python binding, wait_for_alert takes the number of milliseconds to wait │ │ │ │ │ -as an integer. │ │ │ │ │ -The _a_l_e_r_t queue in the _s_e_s_s_i_o_n will not grow indefinitely. Make sure to pop │ │ │ │ │ -periodically to not miss notifications. To control the max number of alerts │ │ │ │ │ -that's queued by the _s_e_s_s_i_o_n, see settings_pack::alert_queue_size. │ │ │ │ │ -Some alerts are considered so important that they are posted even when the │ │ │ │ │ -_a_l_e_r_t queue is full. Some alerts are considered mandatory and cannot be │ │ │ │ │ -disabled by the alert_mask. For instance, _s_a_v_e___r_e_s_u_m_e___d_a_t_a___a_l_e_r_t and │ │ │ │ │ -_s_a_v_e___r_e_s_u_m_e___d_a_t_a___f_a_i_l_e_d___a_l_e_r_t are always posted, regardless of the _a_l_e_r_t mask. │ │ │ │ │ -To control which alerts are posted, set the alert_mask (_s_e_t_t_i_n_g_s___p_a_c_k_:_: │ │ │ │ │ -_a_l_e_r_t___m_a_s_k). │ │ │ │ │ -If the _a_l_e_r_t queue fills up to the point where alerts are dropped, this will be │ │ │ │ │ -indicated by a _a_l_e_r_t_s___d_r_o_p_p_e_d___a_l_e_r_t, which contains a bitmask of which types of │ │ │ │ │ -alerts were dropped. Generally it is a good idea to make sure the _a_l_e_r_t queue │ │ │ │ │ -is large enough, the alert_mask doesn't have unnecessary categories enabled and │ │ │ │ │ -to call pop_alert() frequently, to avoid alerts being dropped. │ │ │ │ │ -the set_alert_notify function lets the client set a function object to be │ │ │ │ │ -invoked every time the _a_l_e_r_t queue goes from having 0 alerts to 1 _a_l_e_r_t. This │ │ │ │ │ -function is called from within libtorrent, it may be the main thread, or it may │ │ │ │ │ -be from within a user call. The intention of of the function is that the client │ │ │ │ │ -wakes up its main thread, to poll for more alerts using pop_alerts(). If the │ │ │ │ │ -notify function fails to do so, it won't be called again, until pop_alerts is │ │ │ │ │ -called for some other reason. For instance, it could signal an eventfd, post a │ │ │ │ │ -message to an HWND or some other main message pump. The actual retrieval of │ │ │ │ │ -alerts should not be done in the callback. In fact, the callback should not │ │ │ │ │ -block. It should not perform any expensive work. It really should just notify │ │ │ │ │ -the main application thread. │ │ │ │ │ -The type of an _a_l_e_r_t is returned by the polymorphic function alert::type() but │ │ │ │ │ -can also be queries from a concrete type via T::alert_type, as a static │ │ │ │ │ -constant. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aadddd__ppoorrtt__mmaappppiinngg(()) ddeelleettee__ppoorrtt__mmaappppiinngg(()) ********** │ │ │ │ │ -void ddeelleettee__ppoorrtt__mmaappppiinngg (port_mapping_t handle); │ │ │ │ │ -std::vector aadddd__ppoorrtt__mmaappppiinngg (portmap_protocol t, int │ │ │ │ │ -external_port, int local_port); │ │ │ │ │ -add_port_mapping adds one or more port forwards on UPnP and/or NAT-PMP, │ │ │ │ │ -whichever is enabled. A mapping is created for each listen socket in the │ │ │ │ │ -_s_e_s_s_i_o_n. The return values are all handles referring to the port mappings that │ │ │ │ │ -were just created. Pass them to _d_e_l_e_t_e___p_o_r_t___m_a_p_p_i_n_g_(_) to remove them. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** rreeooppeenn__nneettwwoorrkk__ssoocckkeettss(()) ********** │ │ │ │ │ -void rreeooppeenn__nneettwwoorrkk__ssoocckkeettss (reopen_network_flags_t options = │ │ │ │ │ -reopen_map_ports); │ │ │ │ │ -Instructs the _s_e_s_s_i_o_n to reopen all listen and outgoing sockets. │ │ │ │ │ -It's useful in the case your platform doesn't support the built in IP notifier │ │ │ │ │ -mechanism, or if you have a better more reliable way to detect changes in the │ │ │ │ │ -IP routing table. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** nnaattiivvee__hhaannddllee(()) ********** │ │ │ │ │ -std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ -This function is intended only for use by plugins. This type does not have a │ │ │ │ │ -stable API and should be relied on as little as possible. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - save_settings │ │ │ │ │ - saves settings (i.e. the _s_e_t_t_i_n_g_s___p_a_c_k) │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - save_dht_state │ │ │ │ │ - saves dht state such as nodes and node-id, possibly accelerating joining │ │ │ │ │ - the DHT if provided at next _s_e_s_s_i_o_n startup. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - save_extension_state │ │ │ │ │ - load or save state from plugins │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - save_ip_filter │ │ │ │ │ - load or save the IP filter set on the _s_e_s_s_i_o_n │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - global_peer_class_id tcp_peer_class_id local_peer_class_id │ │ │ │ │ - built-in peer classes │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - delete_files │ │ │ │ │ - delete the files belonging to the torrent from disk. including the part- │ │ │ │ │ - file, if there is one │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - delete_partfile │ │ │ │ │ - delete just the part-file associated with this torrent │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - paused │ │ │ │ │ - when set, the _s_e_s_s_i_o_n will start paused. Call _s_e_s_s_i_o_n___h_a_n_d_l_e_:_:_r_e_s_u_m_e_(_) to │ │ │ │ │ - start │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - udp tcp │ │ │ │ │ - protocols used by _a_d_d___p_o_r_t___m_a_p_p_i_n_g_(_) │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - reopen_map_ports │ │ │ │ │ - This option indicates if the ports are mapped using natpmp and upnp. If │ │ │ │ │ - mapping was already made, they are deleted and added again. This only │ │ │ │ │ - works if natpmp and/or upnp are configured to be enable. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ wwrriittee__sseessssiioonn__ppaarraammss__bbuuff(()) wwrriittee__sseessssiioonn__ppaarraammss(()) rreeaadd__sseessssiioonn__ppaarraammss(()) │ │ │ │ │ -************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n___p_a_r_a_m_s_._h_p_p" │ │ │ │ │ -session_params rreeaadd__sseessssiioonn__ppaarraammss (bdecode_node const& e │ │ │ │ │ - , save_state_flags_t flags = save_state_flags_t::all()); │ │ │ │ │ -std::vector wwrriittee__sseessssiioonn__ppaarraammss__bbuuff (session_params const& sp │ │ │ │ │ - , save_state_flags_t flags = save_state_flags_t::all()); │ │ │ │ │ -session_params rreeaadd__sseessssiioonn__ppaarraammss (span buf │ │ │ │ │ - , save_state_flags_t flags = save_state_flags_t::all()); │ │ │ │ │ -entry wwrriittee__sseessssiioonn__ppaarraammss (session_params const& sp │ │ │ │ │ - , save_state_flags_t flags = save_state_flags_t::all()); │ │ │ │ │ -These functions serialize and de-serialize a session_params object to and from │ │ │ │ │ -bencoded form. The _s_e_s_s_i_o_n___p_a_r_a_m_s object is used to initialize a new _s_e_s_s_i_o_n │ │ │ │ │ -using the state from a previous one (or by programmatically configure the │ │ │ │ │ -_s_e_s_s_i_o_n up-front). The flags parameter can be used to only save and load │ │ │ │ │ -certain aspects of the session's state. The _buf suffix indicates the function │ │ │ │ │ -operates on buffer rather than the bencoded structure. The torrents in a │ │ │ │ │ -_s_e_s_s_i_o_n are not part of the _s_e_s_s_i_o_n___p_a_r_a_m_s state, they have to be restored │ │ │ │ │ -separately. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ssttaattss__mmeettrriicc ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n___s_t_a_t_s_._h_p_p" │ │ │ │ │ describes one statistics metric from the _s_e_s_s_i_o_n. For more information, see the │ │ │ │ │ _s_e_s_s_i_o_n_ _s_t_a_t_i_s_t_i_c_s section. │ │ │ │ │ struct stats_metric │ │ │ │ │ { │ │ │ │ │ char const* name; │ │ │ │ │ @@ -4043,23 +2088,23 @@ │ │ │ │ │ ************ ccoouunntteerrss ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_e_r_f_o_r_m_a_n_c_e___c_o_u_n_t_e_r_s_._h_p_p" │ │ │ │ │ struct counters │ │ │ │ │ { │ │ │ │ │ ccoouunntteerrss () ; │ │ │ │ │ ccoouunntteerrss (counters const&) ; │ │ │ │ │ counters& ooppeerraattoorr== (counters const&) & ; │ │ │ │ │ - std::int64_t ooppeerraattoorr[[]] (int i) const ; │ │ │ │ │ std::int64_t iinncc__ssttaattss__ccoouunntteerr (int c, std::int64_t value = 1) ; │ │ │ │ │ - void bblleenndd__ssttaattss__ccoouunntteerr (int c, std::int64_t value, int ratio) ; │ │ │ │ │ + std::int64_t ooppeerraattoorr[[]] (int i) const ; │ │ │ │ │ void sseett__vvaalluuee (int c, std::int64_t value) ; │ │ │ │ │ + void bblleenndd__ssttaattss__ccoouunntteerr (int c, std::int64_t value, int ratio) ; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** iinncc__ssttaattss__ccoouunntteerr(()) ooppeerraattoorr[[]](()) ********** │ │ │ │ │ -std::int64_t ooppeerraattoorr[[]] (int i) const ; │ │ │ │ │ +********** ooppeerraattoorr[[]](()) iinncc__ssttaattss__ccoouunntteerr(()) ********** │ │ │ │ │ std::int64_t iinncc__ssttaattss__ccoouunntteerr (int c, std::int64_t value = 1) ; │ │ │ │ │ +std::int64_t ooppeerraattoorr[[]] (int i) const ; │ │ │ │ │ returns the new value │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ sseessssiioonn__ssttaattss__mmeettrriiccss(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n___s_t_a_t_s_._h_p_p" │ │ │ │ │ std::vector sseessssiioonn__ssttaattss__mmeettrriiccss (); │ │ │ │ │ This free function returns the list of available metrics exposed by │ │ │ │ │ libtorrent's statistics API. Each metric has a name and a vvaalluuee iinnddeexx. The │ │ │ │ │ @@ -4077,147 +2122,42 @@ │ │ │ │ │ ************ eennuumm mmeettrriicc__ttyyppee__tt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n___s_t_a_t_s_._h_p_p" │ │ │ │ │ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ |_nn_aa_mm_ee_ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ |_c_o_u_n_t_e_r_|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_g_a_u_g_e_ _ _|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ iipp__ffiilltteerr ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_i_p___f_i_l_t_e_r_._h_p_p" │ │ │ │ │ -The ip_filter class is a set of rules that uniquely categorizes all ip │ │ │ │ │ -addresses as allowed or disallowed. The default constructor creates a single │ │ │ │ │ -rule that allows all addresses (0.0.0.0 - 255.255.255.255 for the IPv4 range, │ │ │ │ │ -and the equivalent range covering all addresses for the IPv6 range). │ │ │ │ │ -A default constructed _i_p___f_i_l_t_e_r does not filter any address. │ │ │ │ │ -struct ip_filter │ │ │ │ │ -{ │ │ │ │ │ - iipp__ffiilltteerr (ip_filter const&); │ │ │ │ │ - ip_filter& ooppeerraattoorr== (ip_filter&&); │ │ │ │ │ - ~~iipp__ffiilltteerr (); │ │ │ │ │ - ip_filter& ooppeerraattoorr== (ip_filter const&); │ │ │ │ │ - iipp__ffiilltteerr (ip_filter&&); │ │ │ │ │ - iipp__ffiilltteerr (); │ │ │ │ │ - bool eemmppttyy () const; │ │ │ │ │ - void aadddd__rruullee (address const& first, address const& last, std::uint32_t │ │ │ │ │ -flags); │ │ │ │ │ - std::uint32_t aacccceessss (address const& addr) const; │ │ │ │ │ - filter_tuple_t eexxppoorrtt__ffiilltteerr () const; │ │ │ │ │ - │ │ │ │ │ - enum access_flags │ │ │ │ │ - { │ │ │ │ │ - blocked, │ │ │ │ │ - }; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** eemmppttyy(()) ********** │ │ │ │ │ -bool eemmppttyy () const; │ │ │ │ │ -returns true if the filter does not contain any rules │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aadddd__rruullee(()) ********** │ │ │ │ │ -void aadddd__rruullee (address const& first, address const& last, std::uint32_t flags); │ │ │ │ │ -Adds a rule to the filter. first and last defines a range of ip addresses that │ │ │ │ │ -will be marked with the given flags. The flags can currently be 0, which means │ │ │ │ │ -allowed, or ip_filter::blocked, which means disallowed. │ │ │ │ │ -precondition: first.is_v4() == last.is_v4() && first.is_v6() == last.is_v6() │ │ │ │ │ -postcondition: access(x) == flags for every x in the range [first, last] │ │ │ │ │ -This means that in a case of overlapping ranges, the last one applied takes │ │ │ │ │ -precedence. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aacccceessss(()) ********** │ │ │ │ │ -std::uint32_t aacccceessss (address const& addr) const; │ │ │ │ │ -Returns the access permissions for the given address (addr). The permission can │ │ │ │ │ -currently be 0 or ip_filter::blocked. The complexity of this operation is O(log │ │ │ │ │ -n), where n is the minimum number of non-overlapping ranges to describe the │ │ │ │ │ -current filter. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** eexxppoorrtt__ffiilltteerr(()) ********** │ │ │ │ │ -filter_tuple_t eexxppoorrtt__ffiilltteerr () const; │ │ │ │ │ -This function will return the current state of the filter in the minimum number │ │ │ │ │ -of ranges possible. They are sorted from ranges in low addresses to high │ │ │ │ │ -addresses. Each _e_n_t_r_y in the returned vector is a range with the access control │ │ │ │ │ -specified in its flags field. │ │ │ │ │ -The return value is a tuple containing two range-lists. One for IPv4 addresses │ │ │ │ │ -and one for IPv6 addresses. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** eennuumm aacccceessss__ffllaaggss ********** │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_i_p___f_i_l_t_e_r_._h_p_p" │ │ │ │ │ - _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ -|_nn_aa_mm_ee_ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|blocked|1 |indicates that IPs in this range should not be connected to nor| │ │ │ │ │ -|_ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_c_c_e_p_t_e_d_ _a_s_ _i_n_c_o_m_i_n_g_ _c_o_n_n_e_c_t_i_o_n_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ppoorrtt__ffiilltteerr ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_i_p___f_i_l_t_e_r_._h_p_p" │ │ │ │ │ -the port filter maps non-overlapping port ranges to flags. This is primarily │ │ │ │ │ -used to indicate whether a range of ports should be connected to or not. The │ │ │ │ │ -default is to have the full port range (0-65535) set to flag 0. │ │ │ │ │ -class port_filter │ │ │ │ │ -{ │ │ │ │ │ - ppoorrtt__ffiilltteerr (port_filter&&); │ │ │ │ │ - ppoorrtt__ffiilltteerr (port_filter const&); │ │ │ │ │ - ppoorrtt__ffiilltteerr (); │ │ │ │ │ - ~~ppoorrtt__ffiilltteerr (); │ │ │ │ │ - port_filter& ooppeerraattoorr== (port_filter const&); │ │ │ │ │ - port_filter& ooppeerraattoorr== (port_filter&&); │ │ │ │ │ - void aadddd__rruullee (std::uint16_t first, std::uint16_t last, std::uint32_t │ │ │ │ │ -flags); │ │ │ │ │ - std::uint32_t aacccceessss (std::uint16_t port) const; │ │ │ │ │ - │ │ │ │ │ - enum access_flags │ │ │ │ │ - { │ │ │ │ │ - blocked, │ │ │ │ │ - }; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aadddd__rruullee(()) ********** │ │ │ │ │ -void aadddd__rruullee (std::uint16_t first, std::uint16_t last, std::uint32_t flags); │ │ │ │ │ -set the flags for the specified port range (first, last) to flags overwriting │ │ │ │ │ -any existing rule for those ports. The range is inclusive, i.e. the port last │ │ │ │ │ -also has the flag set on it. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aacccceessss(()) ********** │ │ │ │ │ -std::uint32_t aacccceessss (std::uint16_t port) const; │ │ │ │ │ -test the specified port (port) for whether it is blocked or not. The returned │ │ │ │ │ -value is the flags set for this port. see _a_c_c_e_s_s___f_l_a_g_s. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** eennuumm aacccceessss__ffllaaggss ********** │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_i_p___f_i_l_t_e_r_._h_p_p" │ │ │ │ │ - _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ -|_nn_aa_mm_ee_ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|blocked|1 |this flag indicates that destination ports in the range should| │ │ │ │ │ -|_ _ _ _ _ _ _ _|_ _ _ _ _ _|_n_o_t_ _b_e_ _c_o_n_n_e_c_t_e_d_ _t_o_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ cclliieenntt__ddaattaa__tt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_c_l_i_e_n_t___d_a_t_a_._h_p_p" │ │ │ │ │ A thin wrapper around a void pointer used as "user data". i.e. an opaque cookie │ │ │ │ │ passed in to libtorrent and returned on demand. It adds type-safety by │ │ │ │ │ requiring the same type be requested out of it as was assigned to it. │ │ │ │ │ struct client_data_t │ │ │ │ │ { │ │ │ │ │ cclliieenntt__ddaattaa__tt () = default; │ │ │ │ │ explicit cclliieenntt__ddaattaa__tt (T* v); │ │ │ │ │ client_data_t& ooppeerraattoorr== (T* v); │ │ │ │ │ T* ggeett () const; │ │ │ │ │ explicit operator TT () const; │ │ │ │ │ - operator vvooiidd** () const = delete; │ │ │ │ │ client_data_t& ooppeerraattoorr== (void*) = delete; │ │ │ │ │ + operator vvooiidd** () const = delete; │ │ │ │ │ client_data_t& ooppeerraattoorr== (void const*) = delete; │ │ │ │ │ operator void ccoonnsstt** () const = delete; │ │ │ │ │ │ │ │ │ │ template ::value>::type> │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** cclliieenntt__ddaattaa__tt(()) ********** │ │ │ │ │ cclliieenntt__ddaattaa__tt () = default; │ │ │ │ │ construct a nullptr client data │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ccoonnsstt**(()) ooppeerraattoorr==(()) vvooiidd**(()) ********** │ │ │ │ │ -operator vvooiidd** () const = delete; │ │ │ │ │ client_data_t& ooppeerraattoorr== (void*) = delete; │ │ │ │ │ +operator vvooiidd** () const = delete; │ │ │ │ │ client_data_t& ooppeerraattoorr== (void const*) = delete; │ │ │ │ │ operator void ccoonnsstt** () const = delete; │ │ │ │ │ we don't allow type-unsafe operations │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ aadddd__ttoorrrreenntt__ppaarraammss ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s_._h_p_p" │ │ │ │ │ The _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s contains all the information in a .torrent file along │ │ │ │ │ @@ -4543,19 +2483,19 @@ │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ aannnnoouunnccee__eennttrryy ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_a_n_n_o_u_n_c_e___e_n_t_r_y_._h_p_p" │ │ │ │ │ this class holds information about one bittorrent tracker, as it relates to a │ │ │ │ │ specific torrent. │ │ │ │ │ struct announce_entry │ │ │ │ │ { │ │ │ │ │ + aannnnoouunnccee__eennttrryy (); │ │ │ │ │ explicit aannnnoouunnccee__eennttrryy (string_view u); │ │ │ │ │ aannnnoouunnccee__eennttrryy (announce_entry const&); │ │ │ │ │ ~~aannnnoouunnccee__eennttrryy (); │ │ │ │ │ announce_entry& ooppeerraattoorr== (announce_entry const&) &; │ │ │ │ │ - aannnnoouunnccee__eennttrryy (); │ │ │ │ │ │ │ │ │ │ enum tracker_source │ │ │ │ │ { │ │ │ │ │ source_torrent, │ │ │ │ │ source_client, │ │ │ │ │ source_magnet_link, │ │ │ │ │ source_tex, │ │ │ │ │ @@ -4567,19 +2507,19 @@ │ │ │ │ │ std::uint8_t ttiieerr = 0; │ │ │ │ │ std::uint8_t ffaaiill__lliimmiitt = 0; │ │ │ │ │ std::uint8_t source:4; │ │ │ │ │ bool verified:1; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** aannnnoouunnccee__eennttrryy(()) ooppeerraattoorr==(()) ~~aannnnoouunnccee__eennttrryy(()) ********** │ │ │ │ │ +aannnnoouunnccee__eennttrryy (); │ │ │ │ │ explicit aannnnoouunnccee__eennttrryy (string_view u); │ │ │ │ │ aannnnoouunnccee__eennttrryy (announce_entry const&); │ │ │ │ │ ~~aannnnoouunnccee__eennttrryy (); │ │ │ │ │ announce_entry& ooppeerraattoorr== (announce_entry const&) &; │ │ │ │ │ -aannnnoouunnccee__eennttrryy (); │ │ │ │ │ constructs a tracker announce _e_n_t_r_y with u as the URL. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** eennuumm ttrraacckkeerr__ssoouurrccee ********** │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_a_n_n_o_u_n_c_e___e_n_t_r_y_._h_p_p" │ │ │ │ │ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ |_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_s_o_u_r_c_e___t_o_r_r_e_n_t_ _ _ _ _|_1_ _ _ _ _|_t_h_e_ _t_r_a_c_k_e_r_ _w_a_s_ _p_a_r_t_ _o_f_ _t_h_e_ _._t_o_r_r_e_n_t_ _f_i_l_e_ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ @@ -5501,24 +3441,24 @@ │ │ │ │ │ The storage_moved_alert is generated when all the disk IO has completed and the │ │ │ │ │ files have been moved, as an effect of a call to torrent_handle::move_storage. │ │ │ │ │ This is useful to synchronize with the actual disk. The storage_path() member │ │ │ │ │ return the new path of the storage. │ │ │ │ │ struct storage_moved_alert final : torrent_alert │ │ │ │ │ { │ │ │ │ │ std::string mmeessssaaggee () const override; │ │ │ │ │ - char const* ssttoorraaggee__ppaatthh () const; │ │ │ │ │ char const* oolldd__ppaatthh () const; │ │ │ │ │ + char const* ssttoorraaggee__ppaatthh () const; │ │ │ │ │ │ │ │ │ │ static constexpr alert_category_t ssttaattiicc__ccaatteeggoorryy = alert_category:: │ │ │ │ │ storage; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** oolldd__ppaatthh(()) ssttoorraaggee__ppaatthh(()) ********** │ │ │ │ │ -char const* ssttoorraaggee__ppaatthh () const; │ │ │ │ │ +********** ssttoorraaggee__ppaatthh(()) oolldd__ppaatthh(()) ********** │ │ │ │ │ char const* oolldd__ppaatthh () const; │ │ │ │ │ +char const* ssttoorraaggee__ppaatthh () const; │ │ │ │ │ the path the torrent was moved to and from, respectively. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ssttoorraaggee__mmoovveedd__ffaaiilleedd__aalleerrtt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_a_l_e_r_t___t_y_p_e_s_._h_p_p" │ │ │ │ │ The storage_moved_failed_alert is generated when an attempt to move the │ │ │ │ │ storage, via _t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_m_o_v_e___s_t_o_r_a_g_e_(_), fails. │ │ │ │ │ struct storage_moved_failed_alert final : torrent_alert │ │ │ │ │ @@ -6792,30 +4732,30 @@ │ │ │ │ │ ************ ddhhtt__ssaammppllee__iinnffoohhaasshheess__aalleerrtt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_a_l_e_r_t___t_y_p_e_s_._h_p_p" │ │ │ │ │ posted as a response to a call to session::dht_sample_infohashes() with the │ │ │ │ │ information from the DHT response message. │ │ │ │ │ struct dht_sample_infohashes_alert final : alert │ │ │ │ │ { │ │ │ │ │ std::string mmeessssaaggee () const override; │ │ │ │ │ - int nnuumm__ssaammpplleess () const; │ │ │ │ │ std::vector ssaammpplleess () const; │ │ │ │ │ + int nnuumm__ssaammpplleess () const; │ │ │ │ │ int nnuumm__nnooddeess () const; │ │ │ │ │ std::vector> nnooddeess () const; │ │ │ │ │ │ │ │ │ │ static constexpr alert_category_t ssttaattiicc__ccaatteeggoorryy = alert_category:: │ │ │ │ │ dht_operation; │ │ │ │ │ sha1_hash node_id; │ │ │ │ │ aux::noexcept_movable endpoint; │ │ │ │ │ time_duration const interval; │ │ │ │ │ int const num_infohashes; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ssaammpplleess(()) nnuumm__ssaammpplleess(()) ********** │ │ │ │ │ -int nnuumm__ssaammpplleess () const; │ │ │ │ │ +********** nnuumm__ssaammpplleess(()) ssaammpplleess(()) ********** │ │ │ │ │ std::vector ssaammpplleess () const; │ │ │ │ │ +int nnuumm__ssaammpplleess () const; │ │ │ │ │ returns the number of info-hashes returned by the node, as well as the actual │ │ │ │ │ info-hashes. num_samples() is more efficient than samples().size(). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** nnuumm__nnooddeess(()) ********** │ │ │ │ │ int nnuumm__nnooddeess () const; │ │ │ │ │ The total number of nodes returned by nodes(). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ @@ -7038,29 +4978,29 @@ │ │ │ │ │ static constexpr alert_category_t ssttaattiicc__ccaatteeggoorryy = alert_category::status; │ │ │ │ │ std::vector trackers; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ trackers │ │ │ │ │ list of trackers and their status for the torrent │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ooppeerraattiioonn__nnaammee(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_o_p_e_r_a_t_i_o_n_s_._h_p_p" │ │ │ │ │ +char const* ooppeerraattiioonn__nnaammee (operation_t op); │ │ │ │ │ +maps an operation id (from _p_e_e_r___e_r_r_o_r___a_l_e_r_t and _p_e_e_r___d_i_s_c_o_n_n_e_c_t_e_d___a_l_e_r_t) to its │ │ │ │ │ +name. See _o_p_e_r_a_t_i_o_n___t for the constants │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ aalleerrtt__ccaasstt(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_a_l_e_r_t_._h_p_p" │ │ │ │ │ template T* aalleerrtt__ccaasstt (alert* a); │ │ │ │ │ template T const* aalleerrtt__ccaasstt (alert const* a); │ │ │ │ │ When you get an _a_l_e_r_t, you can use alert_cast<> to attempt to cast the pointer │ │ │ │ │ to a specific _a_l_e_r_t type, in order to query it for more information. │ │ │ │ │ Note │ │ │ │ │ alert_cast<> can only cast to an exact _a_l_e_r_t type, not a base class │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ooppeerraattiioonn__nnaammee(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_o_p_e_r_a_t_i_o_n_s_._h_p_p" │ │ │ │ │ -char const* ooppeerraattiioonn__nnaammee (operation_t op); │ │ │ │ │ -maps an operation id (from _p_e_e_r___e_r_r_o_r___a_l_e_r_t and _p_e_e_r___d_i_s_c_o_n_n_e_c_t_e_d___a_l_e_r_t) to its │ │ │ │ │ -name. See _o_p_e_r_a_t_i_o_n___t for the constants │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ eennuumm ooppeerraattiioonn__tt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_o_p_e_r_a_t_i_o_n_s_._h_p_p" │ │ │ │ │ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ |_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |unknown |0 |the error was unexpected and it is unknown which | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_p_e_r_a_t_i_o_n_ _c_a_u_s_e_d_ _i_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |bittorrent |1 |this is used when the bittorrent logic determines | │ │ │ │ │ @@ -7199,132 +5139,588 @@ │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ iinntt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_a_l_e_r_t___t_y_p_e_s_._h_p_p" │ │ │ │ │ user_alert_id │ │ │ │ │ user defined alerts should use IDs greater than this │ │ │ │ │ num_alert_types │ │ │ │ │ this constant represents "max_alert_index" + 1 │ │ │ │ │ +You have some control over _s_e_s_s_i_o_n configuration through the session:: │ │ │ │ │ +apply_settings() member function. To change one or more configuration options, │ │ │ │ │ +create a _s_e_t_t_i_n_g_s___p_a_c_k object and fill it with the settings to be set and pass │ │ │ │ │ +it in to session::apply_settings(). │ │ │ │ │ +The _s_e_t_t_i_n_g_s___p_a_c_k object is a collection of settings updates that are applied │ │ │ │ │ +to the _s_e_s_s_i_o_n when passed to session::apply_settings(). It's empty when │ │ │ │ │ +constructed. │ │ │ │ │ +You have control over proxy and authorization settings and also the user-agent │ │ │ │ │ +that will be sent to the tracker. The user-agent will also be used to identify │ │ │ │ │ +the client with other peers. │ │ │ │ │ +Each configuration option is named with an enum value inside the _s_e_t_t_i_n_g_s___p_a_c_k │ │ │ │ │ +class. These are the available settings: │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ssttoorraaggee__ppaarraammss ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_t_o_r_a_g_e___d_e_f_s_._h_p_p" │ │ │ │ │ -a parameter pack used to construct the storage for a torrent, used in │ │ │ │ │ -_d_i_s_k___i_n_t_e_r_f_a_c_e │ │ │ │ │ -struct storage_params │ │ │ │ │ +************ ddiisskk__oobbsseerrvveerr ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___o_b_s_e_r_v_e_r_._h_p_p" │ │ │ │ │ +struct disk_observer │ │ │ │ │ { │ │ │ │ │ - ssttoorraaggee__ppaarraammss (file_storage const& f, file_storage const* mf │ │ │ │ │ - , std::string const& sp, storage_mode_t const sm │ │ │ │ │ - , aux::vector const& prio │ │ │ │ │ - , sha1_hash const& ih); │ │ │ │ │ - │ │ │ │ │ - file_storage const& files; │ │ │ │ │ - file_storage const* mmaappppeedd__ffiilleess = nullptr; │ │ │ │ │ - std::string const& path; │ │ │ │ │ - storage_mode_t mmooddee {storage_mode_sparse}; │ │ │ │ │ - aux::vector const& priorities; │ │ │ │ │ - sha1_hash info_hash; │ │ │ │ │ + virtual void oonn__ddiisskk () = 0; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ffiillee__sslliiccee ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_f_i_l_e___s_t_o_r_a_g_e_._h_p_p" │ │ │ │ │ -represents a window of a file in a torrent. │ │ │ │ │ -The file_index refers to the index of the file (in the _t_o_r_r_e_n_t___i_n_f_o). To get │ │ │ │ │ -the path and filename, use file_path() 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. │ │ │ │ │ -struct file_slice │ │ │ │ │ +********** oonn__ddiisskk(()) ********** │ │ │ │ │ +virtual void oonn__ddiisskk () = 0; │ │ │ │ │ +called when the disk cache size has dropped below the low watermark again and │ │ │ │ │ +we can resume downloading from peers │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ooppeenn__ffiillee__ssttaattee ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___i_n_t_e_r_f_a_c_e_._h_p_p" │ │ │ │ │ +this contains information about a file that's currently open by the libtorrent │ │ │ │ │ +disk I/O subsystem. It's associated with a single torrent. │ │ │ │ │ +struct open_file_state │ │ │ │ │ { │ │ │ │ │ file_index_t file_index; │ │ │ │ │ - std::int64_t offset; │ │ │ │ │ - std::int64_t size; │ │ │ │ │ + file_open_mode_t open_mode; │ │ │ │ │ + time_point last_use; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ file_index │ │ │ │ │ - the index of the file │ │ │ │ │ + the index of the file this _e_n_t_r_y refers to into the file_storage file │ │ │ │ │ + list of this torrent. This starts indexing at 0. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - offset │ │ │ │ │ - the offset from the start of the file, in bytes │ │ │ │ │ + open_mode │ │ │ │ │ + open_mode is a bitmask of the file flags this file is currently opened │ │ │ │ │ + with. For possible flags, see _f_i_l_e___o_p_e_n___m_o_d_e___t. │ │ │ │ │ + Note that the read/write mode is not a bitmask. The two least significant │ │ │ │ │ + bits are used to represent the read/write mode. Those bits can be masked │ │ │ │ │ + out using the rw_mask constant. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - size │ │ │ │ │ - the size of the window, in bytes │ │ │ │ │ + last_use │ │ │ │ │ + a (high precision) timestamp of when the file was last used. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ffiillee__ssttoorraaggee ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_f_i_l_e___s_t_o_r_a_g_e_._h_p_p" │ │ │ │ │ -The file_storage class represents a file list and the piece size. Everything │ │ │ │ │ -necessary to interpret a regular bittorrent storage file structure. │ │ │ │ │ -class file_storage │ │ │ │ │ +************ ddiisskk__iinntteerrffaaccee ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___i_n_t_e_r_f_a_c_e_._h_p_p" │ │ │ │ │ +The _d_i_s_k___i_n_t_e_r_f_a_c_e is the customization point for disk I/O in libtorrent. │ │ │ │ │ +implement this interface and provide a factory function to the _s_e_s_s_i_o_n │ │ │ │ │ +constructor use custom disk I/O. All functions on the disk subsystem │ │ │ │ │ +(implementing _d_i_s_k___i_n_t_e_r_f_a_c_e) are called from within libtorrent's network │ │ │ │ │ +thread. For disk I/O to be performed in a separate thread, the disk subsystem │ │ │ │ │ +has to manage that itself. │ │ │ │ │ +Although the functions are called async_*, they do not technically hhaavvee to be │ │ │ │ │ +asynchronous, but they support being asynchronous, by expecting the result │ │ │ │ │ +passed back into a callback. The callbacks must be posted back onto the network │ │ │ │ │ +thread via the io_context object passed into the constructor. The callbacks │ │ │ │ │ +will be run in the network thread. │ │ │ │ │ +struct disk_interface │ │ │ │ │ { │ │ │ │ │ - bool iiss__vvaalliidd () const; │ │ │ │ │ - void rreesseerrvvee (int num_files); │ │ │ │ │ - void aadddd__ffiillee__bboorrrrooww (error_code& ec, string_view filename │ │ │ │ │ - , std::string const& path, std::int64_t file_size │ │ │ │ │ - , file_flags_t file_flags = {}, char const* filehash = nullptr │ │ │ │ │ - , std::int64_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ - , char const* root_hash = nullptr); │ │ │ │ │ - void aadddd__ffiillee (error_code& ec, std::string const& path, std::int64_t │ │ │ │ │ -file_size │ │ │ │ │ - , file_flags_t file_flags = {} │ │ │ │ │ - , std::time_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ - , char const* root_hash = nullptr); │ │ │ │ │ - void aadddd__ffiillee (std::string const& path, std::int64_t file_size │ │ │ │ │ - , file_flags_t file_flags = {} │ │ │ │ │ - , std::time_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ - , char const* root_hash = nullptr); │ │ │ │ │ - void aadddd__ffiillee__bboorrrrooww (string_view filename │ │ │ │ │ - , std::string const& path, std::int64_t file_size │ │ │ │ │ - , file_flags_t file_flags = {}, char const* filehash = nullptr │ │ │ │ │ - , std::int64_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ - , char const* root_hash = nullptr); │ │ │ │ │ - void rreennaammee__ffiillee (file_index_t index, std::string const& new_filename); │ │ │ │ │ - std::vector mmaapp__bblloocckk (piece_index_t piece, std::int64_t offset │ │ │ │ │ - , std::int64_t size) const; │ │ │ │ │ - peer_request mmaapp__ffiillee (file_index_t file, std::int64_t offset, int size) │ │ │ │ │ -const; │ │ │ │ │ - int nnuumm__ffiilleess () const noexcept; │ │ │ │ │ - file_index_t eenndd__ffiillee () const noexcept; │ │ │ │ │ - index_range ffiillee__rraannggee () const noexcept; │ │ │ │ │ - std::int64_t ttoottaall__ssiizzee () const; │ │ │ │ │ - void sseett__nnuumm__ppiieecceess (int n); │ │ │ │ │ - int nnuumm__ppiieecceess () const; │ │ │ │ │ - piece_index_t eenndd__ppiieeccee () const; │ │ │ │ │ - piece_index_t llaasstt__ppiieeccee () const; │ │ │ │ │ - index_range ppiieeccee__rraannggee () const noexcept; │ │ │ │ │ - int ppiieeccee__lleennggtthh () const; │ │ │ │ │ - void sseett__ppiieeccee__lleennggtthh (int l); │ │ │ │ │ - int ppiieeccee__ssiizzee (piece_index_t index) const; │ │ │ │ │ - int ppiieeccee__ssiizzee22 (piece_index_t index) const; │ │ │ │ │ - int bblloocckkss__iinn__ppiieeccee22 (piece_index_t index) const; │ │ │ │ │ - int bblloocckkss__ppeerr__ppiieeccee () const; │ │ │ │ │ - void sseett__nnaammee (std::string const& n); │ │ │ │ │ - std::string const& nnaammee () const; │ │ │ │ │ - void sswwaapp (file_storage& ti) noexcept; │ │ │ │ │ - void ccaannoonniiccaalliizzee (); │ │ │ │ │ - bool ppaadd__ffiillee__aatt (file_index_t index) const; │ │ │ │ │ - string_view ffiillee__nnaammee (file_index_t index) const; │ │ │ │ │ - std::time_t mmttiimmee (file_index_t index) const; │ │ │ │ │ - char const* rroooott__ppttrr (file_index_t const index) const; │ │ │ │ │ - sha1_hash hhaasshh (file_index_t index) const; │ │ │ │ │ - sha256_hash rroooott (file_index_t index) const; │ │ │ │ │ - std::int64_t ffiillee__ooffffsseett (file_index_t index) const; │ │ │ │ │ - std::string ssyymmlliinnkk (file_index_t index) const; │ │ │ │ │ - std::int64_t ffiillee__ssiizzee (file_index_t index) const; │ │ │ │ │ - std::string ffiillee__ppaatthh (file_index_t index, std::string const& save_path = │ │ │ │ │ -"") const; │ │ │ │ │ - int ffiillee__nnuumm__bblloocckkss (file_index_t index) const; │ │ │ │ │ - index_range ffiillee__ppiieeccee__rraannggee (file_index_t) const; │ │ │ │ │ - int ffiillee__nnuumm__ppiieecceess (file_index_t index) const; │ │ │ │ │ - int ffiillee__ffiirrsstt__bblloocckk__nnooddee (file_index_t index) const; │ │ │ │ │ - int ffiillee__ffiirrsstt__ppiieeccee__nnooddee (file_index_t index) const; │ │ │ │ │ + virtual storage_holder nneeww__ttoorrrreenntt (storage_params const& p │ │ │ │ │ + , std::shared_ptr const& torrent) = 0; │ │ │ │ │ + virtual void rreemmoovvee__ttoorrrreenntt (storage_index_t) = 0; │ │ │ │ │ + virtual bool aassyynncc__wwrriittee (storage_index_t storage, peer_request const& r │ │ │ │ │ + , char const* buf, std::shared_ptr o │ │ │ │ │ + , std::function handler │ │ │ │ │ + , disk_job_flags_t flags = {}) = 0; │ │ │ │ │ + virtual void aassyynncc__rreeaadd (storage_index_t storage, peer_request const& r │ │ │ │ │ + , std::function handler │ │ │ │ │ + , disk_job_flags_t flags = {}) = 0; │ │ │ │ │ + virtual void aassyynncc__hhaasshh (storage_index_t storage, piece_index_t piece, │ │ │ │ │ +span v2 │ │ │ │ │ + , disk_job_flags_t flags │ │ │ │ │ + , std::function handler) = 0; │ │ │ │ │ + virtual void aassyynncc__hhaasshh22 (storage_index_t storage, piece_index_t piece, int │ │ │ │ │ +offset, disk_job_flags_t flags │ │ │ │ │ + , std::function handler) = 0; │ │ │ │ │ + virtual void aassyynncc__mmoovvee__ssttoorraaggee (storage_index_t storage, std::string p, │ │ │ │ │ +move_flags_t flags │ │ │ │ │ + , std::function │ │ │ │ │ +handler) = 0; │ │ │ │ │ + virtual void aassyynncc__rreelleeaassee__ffiilleess (storage_index_t storage │ │ │ │ │ + , std::function handler = std::function()) = 0; │ │ │ │ │ + virtual void aassyynncc__cchheecckk__ffiilleess (storage_index_t storage │ │ │ │ │ + , add_torrent_params const* resume_data │ │ │ │ │ + , aux::vector links │ │ │ │ │ + , std::function handler) = 0; │ │ │ │ │ + virtual void aassyynncc__ssttoopp__ttoorrrreenntt (storage_index_t storage │ │ │ │ │ + , std::function handler = std::function()) = 0; │ │ │ │ │ + virtual void aassyynncc__rreennaammee__ffiillee (storage_index_t storage │ │ │ │ │ + , file_index_t index, std::string name │ │ │ │ │ + , std::function handler) = 0; │ │ │ │ │ + virtual void aassyynncc__ddeelleettee__ffiilleess (storage_index_t storage, remove_flags_t │ │ │ │ │ +options │ │ │ │ │ + , std::function handler) = 0; │ │ │ │ │ + virtual void aassyynncc__sseett__ffiillee__pprriioorriittyy (storage_index_t storage │ │ │ │ │ + , aux::vector prio │ │ │ │ │ + , std::function)> handler) = 0; │ │ │ │ │ + virtual void aassyynncc__cclleeaarr__ppiieeccee (storage_index_t storage, piece_index_t index │ │ │ │ │ + , std::function handler) = 0; │ │ │ │ │ + virtual void uuppddaattee__ssttaattss__ccoouunntteerrss (counters& c) const = 0; │ │ │ │ │ + virtual std::vector ggeett__ssttaattuuss (storage_index_t) const = 0; │ │ │ │ │ + virtual void aabboorrtt (bool wait) = 0; │ │ │ │ │ + virtual void ssuubbmmiitt__jjoobbss () = 0; │ │ │ │ │ + virtual void sseettttiinnggss__uuppddaatteedd () = 0; │ │ │ │ │ + │ │ │ │ │ + static constexpr disk_job_flags_t ffoorrccee__ccooppyy = 0_bit; │ │ │ │ │ + static constexpr disk_job_flags_t sseeqquueennttiiaall__aacccceessss = 3_bit; │ │ │ │ │ + static constexpr disk_job_flags_t vvoollaattiillee__rreeaadd = 4_bit; │ │ │ │ │ + static constexpr disk_job_flags_t vv11__hhaasshh = 5_bit; │ │ │ │ │ + static constexpr disk_job_flags_t fflluusshh__ppiieeccee = 7_bit; │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** nneeww__ttoorrrreenntt(()) ********** │ │ │ │ │ +virtual storage_holder nneeww__ttoorrrreenntt (storage_params const& p │ │ │ │ │ + , std::shared_ptr const& torrent) = 0; │ │ │ │ │ +this is called when a new torrent is added. The shared_ptr can be used to hold │ │ │ │ │ +the internal torrent object alive as long as there are outstanding disk │ │ │ │ │ +operations on the storage. The returned _s_t_o_r_a_g_e___h_o_l_d_e_r is an owning reference │ │ │ │ │ +to the underlying storage that was just created. It is fundamentally a │ │ │ │ │ +storage_index_t │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** rreemmoovvee__ttoorrrreenntt(()) ********** │ │ │ │ │ +virtual void rreemmoovvee__ttoorrrreenntt (storage_index_t) = 0; │ │ │ │ │ +remove the storage with the specified index. This is not expected to delete any │ │ │ │ │ +files from disk, just to clean up any resources associated with the specified │ │ │ │ │ +storage. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aassyynncc__wwrriittee(()) aassyynncc__rreeaadd(()) ********** │ │ │ │ │ +virtual bool aassyynncc__wwrriittee (storage_index_t storage, peer_request const& r │ │ │ │ │ + , char const* buf, std::shared_ptr o │ │ │ │ │ + , std::function handler │ │ │ │ │ + , disk_job_flags_t flags = {}) = 0; │ │ │ │ │ +virtual void aassyynncc__rreeaadd (storage_index_t storage, peer_request const& r │ │ │ │ │ + , std::function handler │ │ │ │ │ + , disk_job_flags_t flags = {}) = 0; │ │ │ │ │ +perform a read or write operation from/to the specified storage index and the │ │ │ │ │ +specified request. When the operation completes, call handler possibly with a │ │ │ │ │ +_d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r, holding the buffer with the result. Flags may be set to │ │ │ │ │ +affect the read operation. See disk_job_flags_t. │ │ │ │ │ +The _d_i_s_k___o_b_s_e_r_v_e_r is a callback to indicate that the store buffer/disk write │ │ │ │ │ +queue is below the watermark to let peers start writing buffers to disk again. │ │ │ │ │ +When async_write() returns true, indicating the write queue is full, the peer │ │ │ │ │ +will stop further writes and wait for the passed-in disk_observer to be │ │ │ │ │ +notified before resuming. │ │ │ │ │ +Note that for async_read, the _p_e_e_r___r_e_q_u_e_s_t (r) is not necessarily aligned to │ │ │ │ │ +blocks (but it is most of the time). However, all writes (passed to │ │ │ │ │ +async_write) are guaranteed to be block aligned. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aassyynncc__hhaasshh(()) ********** │ │ │ │ │ +virtual void aassyynncc__hhaasshh (storage_index_t storage, piece_index_t piece, │ │ │ │ │ +span v2 │ │ │ │ │ + , disk_job_flags_t flags │ │ │ │ │ + , std::function handler) = 0; │ │ │ │ │ +Compute hash(es) for the specified piece. Unless the v1_hash flag is set (in │ │ │ │ │ +flags), the SHA-1 hash of the whole piece does not need to be computed. │ │ │ │ │ +Thev2span is optional and can be empty, which means v2 hashes should not be │ │ │ │ │ +computed. If v2 is non-empty it must be at least large enough to hold all v2 │ │ │ │ │ +blocks in the piece, and this function will fill in the span with the SHA-256 │ │ │ │ │ +block hashes of the piece. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aassyynncc__hhaasshh22(()) ********** │ │ │ │ │ +virtual void aassyynncc__hhaasshh22 (storage_index_t storage, piece_index_t piece, int │ │ │ │ │ +offset, disk_job_flags_t flags │ │ │ │ │ + , std::function handler) = 0; │ │ │ │ │ +computes the v2 hash (SHA-256) of a single block. The block at offset in piece │ │ │ │ │ +piece. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aassyynncc__mmoovvee__ssttoorraaggee(()) ********** │ │ │ │ │ +virtual void aassyynncc__mmoovvee__ssttoorraaggee (storage_index_t storage, std::string p, │ │ │ │ │ +move_flags_t flags │ │ │ │ │ + , std::function │ │ │ │ │ +handler) = 0; │ │ │ │ │ +called to request the files for the specified storage/torrent be moved to a new │ │ │ │ │ +location. It is the disk I/O object's responsibility to synchronize this with │ │ │ │ │ +any currently outstanding disk operations to the storage. Whether files are │ │ │ │ │ +replaced at the destination path or not is controlled by flags (see │ │ │ │ │ +_m_o_v_e___f_l_a_g_s___t). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aassyynncc__rreelleeaassee__ffiilleess(()) ********** │ │ │ │ │ +virtual void aassyynncc__rreelleeaassee__ffiilleess (storage_index_t storage │ │ │ │ │ + , std::function handler = std::function()) = 0; │ │ │ │ │ +This is called on disk I/O objects to request they close all open files for the │ │ │ │ │ +specified storage/torrent. If file handles are not pooled/cached, it can be a │ │ │ │ │ +no-op. For truly asynchronous disk I/O, this should provide at least one point │ │ │ │ │ +in time when all files are closed. It is possible that later asynchronous │ │ │ │ │ +operations will re-open some of the files, by the time this completion handler │ │ │ │ │ +is called, that's fine. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aassyynncc__cchheecckk__ffiilleess(()) ********** │ │ │ │ │ +virtual void aassyynncc__cchheecckk__ffiilleess (storage_index_t storage │ │ │ │ │ + , add_torrent_params const* resume_data │ │ │ │ │ + , aux::vector links │ │ │ │ │ + , std::function handler) = 0; │ │ │ │ │ +this is called when torrents are added to validate their resume data against │ │ │ │ │ +the files on disk. This function is expected to do a few things: │ │ │ │ │ +if links is non-empty, it contains a string for each file in the torrent. The │ │ │ │ │ +string being a path to an existing identical file. The default behavior is to │ │ │ │ │ +create hard links of those files into the storage of the new torrent (specified │ │ │ │ │ +by storage). An empty string indicates that there is no known identical file. │ │ │ │ │ +This is part of the "mutable torrent" feature, where files can be reused from │ │ │ │ │ +other torrents. │ │ │ │ │ +The resume_data points the resume data passed in by the client. │ │ │ │ │ +If the resume_data->flags field has the seed_mode flag set, all files/pieces │ │ │ │ │ +are expected to be on disk already. This should be verified. Not just the │ │ │ │ │ +existence of the file, but also that it has the correct size. │ │ │ │ │ +Any file with a piece set in the resume_data->have_pieces bitmask should exist │ │ │ │ │ +on disk, this should be verified. Pad files and files with zero priority may be │ │ │ │ │ +skipped. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aassyynncc__ssttoopp__ttoorrrreenntt(()) ********** │ │ │ │ │ +virtual void aassyynncc__ssttoopp__ttoorrrreenntt (storage_index_t storage │ │ │ │ │ + , std::function handler = std::function()) = 0; │ │ │ │ │ +This is called when a torrent is stopped. It gives the disk I/O object an │ │ │ │ │ +opportunity to flush any data to disk that's currently kept cached. This │ │ │ │ │ +function should at least do the same thing as _a_s_y_n_c___r_e_l_e_a_s_e___f_i_l_e_s_(_). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aassyynncc__rreennaammee__ffiillee(()) ********** │ │ │ │ │ +virtual void aassyynncc__rreennaammee__ffiillee (storage_index_t storage │ │ │ │ │ + , file_index_t index, std::string name │ │ │ │ │ + , std::function handler) = 0; │ │ │ │ │ +This function is called when the name of a file in the specified storage has │ │ │ │ │ +been requested to be renamed. The disk I/O object is responsible for renaming │ │ │ │ │ +the file without racing with other potentially outstanding operations against │ │ │ │ │ +the file (such as read, write, move, etc.). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aassyynncc__ddeelleettee__ffiilleess(()) ********** │ │ │ │ │ +virtual void aassyynncc__ddeelleettee__ffiilleess (storage_index_t storage, remove_flags_t │ │ │ │ │ +options │ │ │ │ │ + , std::function handler) = 0; │ │ │ │ │ +This function is called when some file(s) on disk have been requested to be │ │ │ │ │ +removed by the client. storage indicates which torrent is referred to. See │ │ │ │ │ +_s_e_s_s_i_o_n___h_a_n_d_l_e for remove_flags_t flags indicating which files are to be │ │ │ │ │ +removed. e.g. _s_e_s_s_i_o_n___h_a_n_d_l_e_:_:_d_e_l_e_t_e___f_i_l_e_s - delete all files _s_e_s_s_i_o_n___h_a_n_d_l_e_:_: │ │ │ │ │ +_d_e_l_e_t_e___p_a_r_t_f_i_l_e - only delete part file. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aassyynncc__sseett__ffiillee__pprriioorriittyy(()) ********** │ │ │ │ │ +virtual void aassyynncc__sseett__ffiillee__pprriioorriittyy (storage_index_t storage │ │ │ │ │ + , aux::vector prio │ │ │ │ │ + , std::function)> handler) = 0; │ │ │ │ │ +This is called to set the priority of some or all files. Changing the priority │ │ │ │ │ +from or to 0 may involve moving data to and from the partfile. The disk I/ │ │ │ │ │ +O object is responsible for correctly synchronizing this work to not race with │ │ │ │ │ +any potentially outstanding asynchronous operations affecting these files. │ │ │ │ │ +prio is a vector of the file priority for all files. If it's shorter than the │ │ │ │ │ +total number of files in the torrent, they are assumed to be set to the default │ │ │ │ │ +priority. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aassyynncc__cclleeaarr__ppiieeccee(()) ********** │ │ │ │ │ +virtual void aassyynncc__cclleeaarr__ppiieeccee (storage_index_t storage, piece_index_t index │ │ │ │ │ + , std::function handler) = 0; │ │ │ │ │ +This is called when a piece fails the hash check, to ensure there are no │ │ │ │ │ +outstanding disk operations to the piece before blocks are re-requested from │ │ │ │ │ +peers to overwrite the existing blocks. The disk I/O object does not need to │ │ │ │ │ +perform any action other than synchronize with all outstanding disk operations │ │ │ │ │ +to the specified piece before posting the result back. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** uuppddaattee__ssttaattss__ccoouunntteerrss(()) ********** │ │ │ │ │ +virtual void uuppddaattee__ssttaattss__ccoouunntteerrss (counters& c) const = 0; │ │ │ │ │ +_u_p_d_a_t_e___s_t_a_t_s___c_o_u_n_t_e_r_s_(_) is called to give the disk storage an opportunity to │ │ │ │ │ +update gauges in the c stats _c_o_u_n_t_e_r_s, that aren't updated continuously as │ │ │ │ │ +operations are performed. This is called before a snapshot of the _c_o_u_n_t_e_r_s are │ │ │ │ │ +passed to the client. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ggeett__ssttaattuuss(()) ********** │ │ │ │ │ +virtual std::vector ggeett__ssttaattuuss (storage_index_t) const = 0; │ │ │ │ │ +Return a list of all the files that are currently open for the specified │ │ │ │ │ +storage/torrent. This is is just used for the client to query the currently │ │ │ │ │ +open files, and which modes those files are open in. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aabboorrtt(()) ********** │ │ │ │ │ +virtual void aabboorrtt (bool wait) = 0; │ │ │ │ │ +this is called when the _s_e_s_s_i_o_n is starting to shut down. The disk I/O object │ │ │ │ │ +is expected to flush any outstanding write jobs, cancel hash jobs and initiate │ │ │ │ │ +tearing down of any internal threads. If wait is true, this should be │ │ │ │ │ +asynchronous. i.e. this call should not return until all threads have stopped │ │ │ │ │ +and all jobs have either been aborted or completed and the disk I/O object is │ │ │ │ │ +ready to be destructed. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ssuubbmmiitt__jjoobbss(()) ********** │ │ │ │ │ +virtual void ssuubbmmiitt__jjoobbss () = 0; │ │ │ │ │ +This will be called after a batch of disk jobs has been issues (via the async_* │ │ │ │ │ +). It gives the disk I/O object an opportunity to notify any potential │ │ │ │ │ +condition variables to wake up the disk thread(s). The async_* calls can of │ │ │ │ │ +course also notify condition variables, but doing it in this call allows for │ │ │ │ │ +batching jobs, by issuing the notification once for a collection of jobs. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** sseettttiinnggss__uuppddaatteedd(()) ********** │ │ │ │ │ +virtual void sseettttiinnggss__uuppddaatteedd () = 0; │ │ │ │ │ +This is called to notify the disk I/O object that the settings have been │ │ │ │ │ +updated. In the disk io constructor, a _s_e_t_t_i_n_g_s___i_n_t_e_r_f_a_c_e reference is passed │ │ │ │ │ +in. Whenever these settings are updated, this function is called to allow the │ │ │ │ │ +disk I/O object to react to any changed settings relevant to its operations. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + force_copy │ │ │ │ │ + force making a copy of the cached block, rather than getting a reference │ │ │ │ │ + to a block already in the cache. This is used the block is expected to be │ │ │ │ │ + overwritten very soon, by async_write()`, and we need access to the │ │ │ │ │ + previous content. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + sequential_access │ │ │ │ │ + hint that there may be more disk operations with sequential access to the │ │ │ │ │ + file │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + volatile_read │ │ │ │ │ + don't keep the read block in cache. This is a hint that this block is │ │ │ │ │ + unlikely to be read again anytime soon, and caching it would be wasteful. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + v1_hash │ │ │ │ │ + compute a v1 piece hash. This is only used by the _a_s_y_n_c___h_a_s_h_(_) call. If │ │ │ │ │ + this flag is not set in the _a_s_y_n_c___h_a_s_h_(_) call, the SHA-1 piece hash does │ │ │ │ │ + not need to be computed. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + flush_piece │ │ │ │ │ + this flag instructs a hash job that we just completed this piece, and it │ │ │ │ │ + should be flushed to disk │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ssttoorraaggee__hhoollddeerr ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___i_n_t_e_r_f_a_c_e_._h_p_p" │ │ │ │ │ +a unique, owning, reference to the storage of a torrent in a disk io subsystem │ │ │ │ │ +(class that implements _d_i_s_k___i_n_t_e_r_f_a_c_e). This is held by the internal libtorrent │ │ │ │ │ +torrent object to tie the storage object allocated for a torrent to the │ │ │ │ │ +lifetime of the internal torrent object. When a torrent is removed from the │ │ │ │ │ +_s_e_s_s_i_o_n, this holder is destructed and will inform the disk object. │ │ │ │ │ +struct storage_holder │ │ │ │ │ +{ │ │ │ │ │ + ssttoorraaggee__hhoollddeerr (storage_index_t idx, disk_interface& disk_io); │ │ │ │ │ + ~~ssttoorraaggee__hhoollddeerr (); │ │ │ │ │ + ssttoorraaggee__hhoollddeerr () = default; │ │ │ │ │ + explicit operator bbooooll () const; │ │ │ │ │ + operator ssttoorraaggee__iinnddeexx__tt () const; │ │ │ │ │ + void rreesseett (); │ │ │ │ │ + storage_holder& ooppeerraattoorr== (storage_holder const&) = delete; │ │ │ │ │ + ssttoorraaggee__hhoollddeerr (storage_holder const&) = delete; │ │ │ │ │ + ssttoorraaggee__hhoollddeerr (storage_holder&& rhs) noexcept; │ │ │ │ │ + storage_holder& ooppeerraattoorr== (storage_holder&& rhs) noexcept; │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ bbuuffffeerr__aallllooccaattoorr__iinntteerrffaaccee ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r_._h_p_p" │ │ │ │ │ +the interface for freeing disk buffers, used by the _d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r. when │ │ │ │ │ +implementing _d_i_s_k___i_n_t_e_r_f_a_c_e, this must also be implemented in order to return │ │ │ │ │ +disk buffers back to libtorrent │ │ │ │ │ +struct buffer_allocator_interface │ │ │ │ │ +{ │ │ │ │ │ + virtual void ffrreeee__ddiisskk__bbuuffffeerr (char* b) = 0; │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ddiisskk__bbuuffffeerr__hhoollddeerr ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r_._h_p_p" │ │ │ │ │ +The disk buffer holder acts like a unique_ptr that frees a disk buffer when │ │ │ │ │ +it's destructed │ │ │ │ │ +If this buffer holder is moved-from, default constructed or reset, data() will │ │ │ │ │ +return nullptr. │ │ │ │ │ +struct disk_buffer_holder │ │ │ │ │ +{ │ │ │ │ │ + disk_buffer_holder& ooppeerraattoorr== (disk_buffer_holder&&) & noexcept; │ │ │ │ │ + ddiisskk__bbuuffffeerr__hhoollddeerr (disk_buffer_holder&&) noexcept; │ │ │ │ │ + ddiisskk__bbuuffffeerr__hhoollddeerr (disk_buffer_holder const&) = delete; │ │ │ │ │ + disk_buffer_holder& ooppeerraattoorr== (disk_buffer_holder const&) = delete; │ │ │ │ │ + ddiisskk__bbuuffffeerr__hhoollddeerr (buffer_allocator_interface& alloc │ │ │ │ │ + , char* buf, int sz) noexcept; │ │ │ │ │ + ddiisskk__bbuuffffeerr__hhoollddeerr () noexcept = default; │ │ │ │ │ + ~~ddiisskk__bbuuffffeerr__hhoollddeerr (); │ │ │ │ │ + char* ddaattaa () const noexcept; │ │ │ │ │ + void rreesseett (); │ │ │ │ │ + void sswwaapp (disk_buffer_holder& h) noexcept; │ │ │ │ │ + bool iiss__mmuuttaabbllee () const noexcept; │ │ │ │ │ + explicit operator bbooooll () const noexcept; │ │ │ │ │ + std::ptrdiff_t ssiizzee () const; │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ddiisskk__bbuuffffeerr__hhoollddeerr(()) ********** │ │ │ │ │ +ddiisskk__bbuuffffeerr__hhoollddeerr (buffer_allocator_interface& alloc │ │ │ │ │ + , char* buf, int sz) noexcept; │ │ │ │ │ +construct a buffer holder that will free the held buffer using a disk buffer │ │ │ │ │ +pool directly (there's only one disk_buffer_pool per _s_e_s_s_i_o_n) │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ddiisskk__bbuuffffeerr__hhoollddeerr(()) ********** │ │ │ │ │ +ddiisskk__bbuuffffeerr__hhoollddeerr () noexcept = default; │ │ │ │ │ +default construct a holder that does not own any buffer │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ~~ddiisskk__bbuuffffeerr__hhoollddeerr(()) ********** │ │ │ │ │ +~~ddiisskk__bbuuffffeerr__hhoollddeerr (); │ │ │ │ │ +frees disk buffer held by this object │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ddaattaa(()) ********** │ │ │ │ │ +char* ddaattaa () const noexcept; │ │ │ │ │ +return a pointer to the held buffer, if any. Otherwise returns nullptr. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** rreesseett(()) ********** │ │ │ │ │ +void rreesseett (); │ │ │ │ │ +free the held disk buffer, if any, and clear the holder. This sets the holder │ │ │ │ │ +object to a default-constructed state │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** sswwaapp(()) ********** │ │ │ │ │ +void sswwaapp (disk_buffer_holder& h) noexcept; │ │ │ │ │ +swap pointers of two disk buffer holders. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** iiss__mmuuttaabbllee(()) ********** │ │ │ │ │ +bool iiss__mmuuttaabbllee () const noexcept; │ │ │ │ │ +if this returns true, the buffer may not be modified in place │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** bbooooll(()) ********** │ │ │ │ │ +explicit operator bbooooll () const noexcept; │ │ │ │ │ +implicitly convertible to true if the object is currently holding a buffer │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ sseettttiinnggss__iinntteerrffaaccee ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_t_t_i_n_g_s___p_a_c_k_._h_p_p" │ │ │ │ │ +the common interface to _s_e_t_t_i_n_g_s___p_a_c_k and the internal representation of │ │ │ │ │ +settings. │ │ │ │ │ +struct settings_interface │ │ │ │ │ +{ │ │ │ │ │ + virtual void sseett__iinntt (int name, int val) = 0; │ │ │ │ │ + virtual bool hhaass__vvaall (int name) const = 0; │ │ │ │ │ + virtual void sseett__ssttrr (int name, std::string val) = 0; │ │ │ │ │ + virtual void sseett__bbooooll (int name, bool val) = 0; │ │ │ │ │ + virtual bool ggeett__bbooooll (int name) const = 0; │ │ │ │ │ + virtual int ggeett__iinntt (int name) const = 0; │ │ │ │ │ + virtual std::string const& ggeett__ssttrr (int name) const = 0; │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ffiillee__ooppeenn__mmooddee__tt ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___i_n_t_e_r_f_a_c_e_._h_p_p" │ │ │ │ │ + read_only │ │ │ │ │ + open the file for reading only │ │ │ │ │ + write_only │ │ │ │ │ + open the file for writing only │ │ │ │ │ + read_write │ │ │ │ │ + open the file for reading and writing │ │ │ │ │ + rw_mask │ │ │ │ │ + the mask for the bits determining read or write mode │ │ │ │ │ + sparse │ │ │ │ │ + open the file in sparse mode (if supported by the filesystem). │ │ │ │ │ + no_atime │ │ │ │ │ + don't update the access timestamps on the file (if supported by the │ │ │ │ │ + operating system and filesystem). this generally improves disk │ │ │ │ │ + performance. │ │ │ │ │ + random_access │ │ │ │ │ + When this is not set, the kernel is hinted that access to this file will │ │ │ │ │ + be made sequentially. │ │ │ │ │ + mmapped │ │ │ │ │ + the file is memory mapped │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ssttoorraaggee__ppaarraammss ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_t_o_r_a_g_e___d_e_f_s_._h_p_p" │ │ │ │ │ +a parameter pack used to construct the storage for a torrent, used in │ │ │ │ │ +_d_i_s_k___i_n_t_e_r_f_a_c_e │ │ │ │ │ +struct storage_params │ │ │ │ │ +{ │ │ │ │ │ + ssttoorraaggee__ppaarraammss (file_storage const& f, file_storage const* mf │ │ │ │ │ + , std::string const& sp, storage_mode_t const sm │ │ │ │ │ + , aux::vector const& prio │ │ │ │ │ + , sha1_hash const& ih); │ │ │ │ │ + │ │ │ │ │ + file_storage const& files; │ │ │ │ │ + file_storage const* mmaappppeedd__ffiilleess = nullptr; │ │ │ │ │ + std::string const& path; │ │ │ │ │ + storage_mode_t mmooddee {storage_mode_sparse}; │ │ │ │ │ + aux::vector const& priorities; │ │ │ │ │ + sha1_hash info_hash; │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ffiillee__sslliiccee ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_f_i_l_e___s_t_o_r_a_g_e_._h_p_p" │ │ │ │ │ +represents a window of a file in a torrent. │ │ │ │ │ +The file_index refers to the index of the file (in the _t_o_r_r_e_n_t___i_n_f_o). To get │ │ │ │ │ +the path and filename, use file_path() 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. │ │ │ │ │ +struct file_slice │ │ │ │ │ +{ │ │ │ │ │ + file_index_t file_index; │ │ │ │ │ + std::int64_t offset; │ │ │ │ │ + std::int64_t size; │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + file_index │ │ │ │ │ + the index of the file │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + offset │ │ │ │ │ + the offset from the start of the file, in bytes │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + size │ │ │ │ │ + the size of the window, in bytes │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ffiillee__ssttoorraaggee ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_f_i_l_e___s_t_o_r_a_g_e_._h_p_p" │ │ │ │ │ +The file_storage class represents a file list and the piece size. Everything │ │ │ │ │ +necessary to interpret a regular bittorrent storage file structure. │ │ │ │ │ +class file_storage │ │ │ │ │ +{ │ │ │ │ │ + bool iiss__vvaalliidd () const; │ │ │ │ │ + void rreesseerrvvee (int num_files); │ │ │ │ │ + void aadddd__ffiillee__bboorrrrooww (error_code& ec, string_view filename │ │ │ │ │ + , std::string const& path, std::int64_t file_size │ │ │ │ │ + , file_flags_t file_flags = {}, char const* filehash = nullptr │ │ │ │ │ + , std::int64_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ + , char const* root_hash = nullptr); │ │ │ │ │ + void aadddd__ffiillee (error_code& ec, std::string const& path, std::int64_t │ │ │ │ │ +file_size │ │ │ │ │ + , file_flags_t file_flags = {} │ │ │ │ │ + , std::time_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ + , char const* root_hash = nullptr); │ │ │ │ │ + void aadddd__ffiillee (std::string const& path, std::int64_t file_size │ │ │ │ │ + , file_flags_t file_flags = {} │ │ │ │ │ + , std::time_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ + , char const* root_hash = nullptr); │ │ │ │ │ + void aadddd__ffiillee__bboorrrrooww (string_view filename │ │ │ │ │ + , std::string const& path, std::int64_t file_size │ │ │ │ │ + , file_flags_t file_flags = {}, char const* filehash = nullptr │ │ │ │ │ + , std::int64_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ + , char const* root_hash = nullptr); │ │ │ │ │ + void rreennaammee__ffiillee (file_index_t index, std::string const& new_filename); │ │ │ │ │ + std::vector mmaapp__bblloocckk (piece_index_t piece, std::int64_t offset │ │ │ │ │ + , std::int64_t size) const; │ │ │ │ │ + peer_request mmaapp__ffiillee (file_index_t file, std::int64_t offset, int size) │ │ │ │ │ +const; │ │ │ │ │ + int nnuumm__ffiilleess () const noexcept; │ │ │ │ │ + file_index_t eenndd__ffiillee () const noexcept; │ │ │ │ │ + index_range ffiillee__rraannggee () const noexcept; │ │ │ │ │ + std::int64_t ttoottaall__ssiizzee () const; │ │ │ │ │ + int nnuumm__ppiieecceess () const; │ │ │ │ │ + void sseett__nnuumm__ppiieecceess (int n); │ │ │ │ │ + piece_index_t eenndd__ppiieeccee () const; │ │ │ │ │ + piece_index_t llaasstt__ppiieeccee () const; │ │ │ │ │ + index_range ppiieeccee__rraannggee () const noexcept; │ │ │ │ │ + void sseett__ppiieeccee__lleennggtthh (int l); │ │ │ │ │ + int ppiieeccee__lleennggtthh () const; │ │ │ │ │ + int ppiieeccee__ssiizzee (piece_index_t index) const; │ │ │ │ │ + int ppiieeccee__ssiizzee22 (piece_index_t index) const; │ │ │ │ │ + int bblloocckkss__iinn__ppiieeccee22 (piece_index_t index) const; │ │ │ │ │ + int bblloocckkss__ppeerr__ppiieeccee () const; │ │ │ │ │ + std::string const& nnaammee () const; │ │ │ │ │ + void sseett__nnaammee (std::string const& n); │ │ │ │ │ + void sswwaapp (file_storage& ti) noexcept; │ │ │ │ │ + void ccaannoonniiccaalliizzee (); │ │ │ │ │ + sha256_hash rroooott (file_index_t index) const; │ │ │ │ │ + std::string ssyymmlliinnkk (file_index_t index) const; │ │ │ │ │ + char const* rroooott__ppttrr (file_index_t const index) const; │ │ │ │ │ + std::int64_t ffiillee__ooffffsseett (file_index_t index) const; │ │ │ │ │ + bool ppaadd__ffiillee__aatt (file_index_t index) const; │ │ │ │ │ + std::int64_t ffiillee__ssiizzee (file_index_t index) const; │ │ │ │ │ + sha1_hash hhaasshh (file_index_t index) const; │ │ │ │ │ + string_view ffiillee__nnaammee (file_index_t index) const; │ │ │ │ │ + std::string ffiillee__ppaatthh (file_index_t index, std::string const& save_path = │ │ │ │ │ +"") const; │ │ │ │ │ + std::time_t mmttiimmee (file_index_t index) const; │ │ │ │ │ + int ffiillee__nnuumm__ppiieecceess (file_index_t index) const; │ │ │ │ │ + index_range ffiillee__ppiieeccee__rraannggee (file_index_t) const; │ │ │ │ │ + int ffiillee__nnuumm__bblloocckkss (file_index_t index) const; │ │ │ │ │ + int ffiillee__ffiirrsstt__ppiieeccee__nnooddee (file_index_t index) const; │ │ │ │ │ + int ffiillee__ffiirrsstt__bblloocckk__nnooddee (file_index_t index) const; │ │ │ │ │ std::uint32_t ffiillee__ppaatthh__hhaasshh (file_index_t index, std::string const& │ │ │ │ │ save_path) const; │ │ │ │ │ void aallll__ppaatthh__hhaasshheess (std::unordered_set& table) const; │ │ │ │ │ file_flags_t ffiillee__ffllaaggss (file_index_t index) const; │ │ │ │ │ bool ffiillee__aabbssoolluuttee__ppaatthh (file_index_t index) const; │ │ │ │ │ - file_index_t ffiillee__iinnddeexx__aatt__ppiieeccee (piece_index_t piece) const; │ │ │ │ │ file_index_t ffiillee__iinnddeexx__aatt__ooffffsseett (std::int64_t offset) const; │ │ │ │ │ + file_index_t ffiillee__iinnddeexx__aatt__ppiieeccee (piece_index_t piece) const; │ │ │ │ │ file_index_t ffiillee__iinnddeexx__ffoorr__rroooott (sha256_hash const& root_hash) const; │ │ │ │ │ piece_index_t ppiieeccee__iinnddeexx__aatt__ffiillee (file_index_t f) const; │ │ │ │ │ void ssaanniittiizzee__ssyymmlliinnkkss (); │ │ │ │ │ bool vv22 () const; │ │ │ │ │ │ │ │ │ │ static constexpr file_flags_t ffllaagg__ppaadd__ffiillee = 0_bit; │ │ │ │ │ static constexpr file_flags_t ffllaagg__hhiiddddeenn = 1_bit; │ │ │ │ │ @@ -7340,15 +5736,15 @@ │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** rreesseerrvvee(()) ********** │ │ │ │ │ void rreesseerrvvee (int num_files); │ │ │ │ │ allocates space for num_files in the internal file list. This can be used to │ │ │ │ │ avoid reallocating the internal file list when the number of files to be added │ │ │ │ │ is known up-front. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aadddd__ffiillee(()) aadddd__ffiillee__bboorrrrooww(()) ********** │ │ │ │ │ +********** aadddd__ffiillee__bboorrrrooww(()) aadddd__ffiillee(()) ********** │ │ │ │ │ void aadddd__ffiillee__bboorrrrooww (error_code& ec, string_view filename │ │ │ │ │ , std::string const& path, std::int64_t file_size │ │ │ │ │ , file_flags_t file_flags = {}, char const* filehash = nullptr │ │ │ │ │ , std::int64_t mtime = 0, string_view symlink_path = string_view() │ │ │ │ │ , char const* root_hash = nullptr); │ │ │ │ │ void aadddd__ffiillee (error_code& ec, std::string const& path, std::int64_t file_size │ │ │ │ │ , file_flags_t file_flags = {} │ │ │ │ │ @@ -7435,17 +5831,17 @@ │ │ │ │ │ range-for loop. Where the values are the indices of all files in the │ │ │ │ │ _f_i_l_e___s_t_o_r_a_g_e. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ttoottaall__ssiizzee(()) ********** │ │ │ │ │ std::int64_t ttoottaall__ssiizzee () const; │ │ │ │ │ returns the total number of bytes all the files in this torrent spans │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__nnuumm__ppiieecceess(()) nnuumm__ppiieecceess(()) ********** │ │ │ │ │ -void sseett__nnuumm__ppiieecceess (int n); │ │ │ │ │ +********** nnuumm__ppiieecceess(()) sseett__nnuumm__ppiieecceess(()) ********** │ │ │ │ │ int nnuumm__ppiieecceess () const; │ │ │ │ │ +void sseett__nnuumm__ppiieecceess (int n); │ │ │ │ │ set and get the number of pieces in the torrent │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** eenndd__ppiieeccee(()) ********** │ │ │ │ │ piece_index_t eenndd__ppiieeccee () const; │ │ │ │ │ returns the index of the one-past-end piece in the file storage │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** llaasstt__ppiieeccee(()) ********** │ │ │ │ │ @@ -7457,16 +5853,16 @@ │ │ │ │ │ ********** ppiieeccee__rraannggee(()) ********** │ │ │ │ │ index_range ppiieeccee__rraannggee () const noexcept; │ │ │ │ │ returns an implementation-defined type that can be used as the container in a │ │ │ │ │ range-for loop. Where the values are the indices of all pieces in the │ │ │ │ │ _f_i_l_e___s_t_o_r_a_g_e. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** sseett__ppiieeccee__lleennggtthh(()) ppiieeccee__lleennggtthh(()) ********** │ │ │ │ │ -int ppiieeccee__lleennggtthh () const; │ │ │ │ │ void sseett__ppiieeccee__lleennggtthh (int l); │ │ │ │ │ +int ppiieeccee__lleennggtthh () const; │ │ │ │ │ set and get the size of each piece in this torrent. It must be a power of two │ │ │ │ │ and at least 16 kiB. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ppiieeccee__ssiizzee(()) ********** │ │ │ │ │ int ppiieeccee__ssiizzee (piece_index_t index) const; │ │ │ │ │ returns the piece size of index. This will be the same as _p_i_e_c_e___l_e_n_g_t_h_(_), │ │ │ │ │ except for the last piece, which may be shorter. │ │ │ │ │ @@ -7484,40 +5880,40 @@ │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** bblloocckkss__ppeerr__ppiieeccee(()) ********** │ │ │ │ │ int bblloocckkss__ppeerr__ppiieeccee () const; │ │ │ │ │ returns the number of blocks there are in the typical piece. There may be fewer │ │ │ │ │ in the last piece) │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** sseett__nnaammee(()) nnaammee(()) ********** │ │ │ │ │ -void sseett__nnaammee (std::string const& n); │ │ │ │ │ std::string const& nnaammee () const; │ │ │ │ │ +void sseett__nnaammee (std::string const& n); │ │ │ │ │ set and get the name of this torrent. For multi-file torrents, this is also the │ │ │ │ │ name of the root directory all the files are stored in. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** sswwaapp(()) ********** │ │ │ │ │ void sswwaapp (file_storage& ti) noexcept; │ │ │ │ │ swap all content of tthhiiss with ttii. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ccaannoonniiccaalliizzee(()) ********** │ │ │ │ │ void ccaannoonniiccaalliizzee (); │ │ │ │ │ arrange files and padding to match the canonical form required by BEP 52 │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppaadd__ffiillee__aatt(()) rroooott__ppttrr(()) ffiillee__ooffffsseett(()) rroooott(()) ffiillee__ssiizzee(()) ssyymmlliinnkk(()) hhaasshh │ │ │ │ │ -(()) ffiillee__nnaammee(()) mmttiimmee(()) ffiillee__ppaatthh(()) ********** │ │ │ │ │ -bool ppaadd__ffiillee__aatt (file_index_t index) const; │ │ │ │ │ -string_view ffiillee__nnaammee (file_index_t index) const; │ │ │ │ │ -std::time_t mmttiimmee (file_index_t index) const; │ │ │ │ │ -char const* rroooott__ppttrr (file_index_t const index) const; │ │ │ │ │ -sha1_hash hhaasshh (file_index_t index) const; │ │ │ │ │ +********** ffiillee__ooffffsseett(()) mmttiimmee(()) rroooott__ppttrr(()) ffiillee__ssiizzee(()) hhaasshh(()) ffiillee__ppaatthh(()) │ │ │ │ │ +ppaadd__ffiillee__aatt(()) ffiillee__nnaammee(()) rroooott(()) ssyymmlliinnkk(()) ********** │ │ │ │ │ sha256_hash rroooott (file_index_t index) const; │ │ │ │ │ -std::int64_t ffiillee__ooffffsseett (file_index_t index) const; │ │ │ │ │ std::string ssyymmlliinnkk (file_index_t index) const; │ │ │ │ │ +char const* rroooott__ppttrr (file_index_t const index) const; │ │ │ │ │ +std::int64_t ffiillee__ooffffsseett (file_index_t index) const; │ │ │ │ │ +bool ppaadd__ffiillee__aatt (file_index_t index) const; │ │ │ │ │ std::int64_t ffiillee__ssiizzee (file_index_t index) const; │ │ │ │ │ +sha1_hash hhaasshh (file_index_t index) const; │ │ │ │ │ +string_view ffiillee__nnaammee (file_index_t index) const; │ │ │ │ │ std::string ffiillee__ppaatthh (file_index_t index, std::string const& save_path = "") │ │ │ │ │ const; │ │ │ │ │ +std::time_t mmttiimmee (file_index_t index) const; │ │ │ │ │ These functions are used to query attributes of files at a given index. │ │ │ │ │ The hash() is a SHA-1 hash of the file, or 0 if none was provided in the │ │ │ │ │ torrent file. This can potentially be used to join a bittorrent network with │ │ │ │ │ other file sharing networks. │ │ │ │ │ root() returns the SHA-256 merkle tree root of the specified file, in case this │ │ │ │ │ is a v2 torrent. Otherwise returns zeros. root_ptr() returns a pointer to the │ │ │ │ │ SHA-256 merkle tree root hash for the specified file. The pointer points into │ │ │ │ │ @@ -7530,26 +5926,26 @@ │ │ │ │ │ file_size() returns the size of a file. │ │ │ │ │ pad_file_at() returns true if the file at the given index is a pad-file. │ │ │ │ │ file_name() returns jjuusstt the name of the file, whereas file_path() returns the │ │ │ │ │ path (inside the torrent file) with the filename appended. │ │ │ │ │ file_offset() returns the byte offset within the torrent file where this file │ │ │ │ │ starts. It can be used to map the file to a piece index (given the piece size). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiillee__nnuumm__bblloocckkss(()) ffiillee__ppiieeccee__rraannggee(()) ffiillee__nnuumm__ppiieecceess(()) ********** │ │ │ │ │ -int ffiillee__nnuumm__bblloocckkss (file_index_t index) const; │ │ │ │ │ -index_range ffiillee__ppiieeccee__rraannggee (file_index_t) const; │ │ │ │ │ +********** ffiillee__ppiieeccee__rraannggee(()) ffiillee__nnuumm__bblloocckkss(()) ffiillee__nnuumm__ppiieecceess(()) ********** │ │ │ │ │ int ffiillee__nnuumm__ppiieecceess (file_index_t index) const; │ │ │ │ │ +index_range ffiillee__ppiieeccee__rraannggee (file_index_t) const; │ │ │ │ │ +int ffiillee__nnuumm__bblloocckkss (file_index_t index) const; │ │ │ │ │ Returns the number of pieces or blocks the file atindexspans, under the │ │ │ │ │ assumption that the file is aligned to the start of a piece. This is only │ │ │ │ │ meaningful for v2 torrents, where files are guaranteed such alignment. These │ │ │ │ │ numbers are used to size and navigate the merkle hash tree for each file. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ffiillee__ffiirrsstt__bblloocckk__nnooddee(()) ffiillee__ffiirrsstt__ppiieeccee__nnooddee(()) ********** │ │ │ │ │ -int ffiillee__ffiirrsstt__bblloocckk__nnooddee (file_index_t index) const; │ │ │ │ │ int ffiillee__ffiirrsstt__ppiieeccee__nnooddee (file_index_t index) const; │ │ │ │ │ +int ffiillee__ffiirrsstt__bblloocckk__nnooddee (file_index_t index) const; │ │ │ │ │ index of first piece node in the merkle tree │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ffiillee__ppaatthh__hhaasshh(()) ********** │ │ │ │ │ std::uint32_t ffiillee__ppaatthh__hhaasshh (file_index_t index, std::string const& save_path) │ │ │ │ │ const; │ │ │ │ │ returns the crc32 hash of file_path(index) │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ @@ -7567,16 +5963,16 @@ │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ffiillee__aabbssoolluuttee__ppaatthh(()) ********** │ │ │ │ │ bool ffiillee__aabbssoolluuttee__ppaatthh (file_index_t index) const; │ │ │ │ │ returns true if the file at the specified index has been renamed to have an │ │ │ │ │ absolute path, i.e. is not anchored in the save path of the torrent. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ffiillee__iinnddeexx__aatt__ooffffsseett(()) ffiillee__iinnddeexx__aatt__ppiieeccee(()) ********** │ │ │ │ │ -file_index_t ffiillee__iinnddeexx__aatt__ppiieeccee (piece_index_t piece) const; │ │ │ │ │ file_index_t ffiillee__iinnddeexx__aatt__ooffffsseett (std::int64_t offset) const; │ │ │ │ │ +file_index_t ffiillee__iinnddeexx__aatt__ppiieeccee (piece_index_t piece) const; │ │ │ │ │ returns the index of the file at the given offset in the torrent │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ffiillee__iinnddeexx__ffoorr__rroooott(()) ********** │ │ │ │ │ file_index_t ffiillee__iinnddeexx__ffoorr__rroooott (sha256_hash const& root_hash) const; │ │ │ │ │ finds the file with the given root hash and returns its index if there is no │ │ │ │ │ file with the root hash, file_index_t{-1} is returned │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ @@ -7605,42 +6001,42 @@ │ │ │ │ │ flag_executable │ │ │ │ │ this file has the executable attribute set. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ flag_symlink │ │ │ │ │ this file is a symbolic link. It should have a link target string │ │ │ │ │ associated with it. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ mmmmaapp__ddiisskk__iioo__ccoonnssttrruuccttoorr(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_m_m_a_p___d_i_s_k___i_o_._h_p_p" │ │ │ │ │ +std::unique_ptr mmmmaapp__ddiisskk__iioo__ccoonnssttrruuccttoorr ( │ │ │ │ │ + io_context& ios, settings_interface const&, counters& cnt); │ │ │ │ │ +constructs a memory mapped file disk I/O object. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ddeeffaauulltt__ddiisskk__iioo__ccoonnssttrruuccttoorr(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n_._h_p_p" │ │ │ │ │ std::unique_ptr ddeeffaauulltt__ddiisskk__iioo__ccoonnssttrruuccttoorr ( │ │ │ │ │ io_context& ios, settings_interface const&, counters& cnt); │ │ │ │ │ the constructor function for the default storage. On systems that support │ │ │ │ │ memory mapped files (and a 64 bit address space) the memory mapped storage will │ │ │ │ │ be constructed, otherwise the portable posix storage. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ppoossiixx__ddiisskk__iioo__ccoonnssttrruuccttoorr(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_o_s_i_x___d_i_s_k___i_o_._h_p_p" │ │ │ │ │ -std::unique_ptr ppoossiixx__ddiisskk__iioo__ccoonnssttrruuccttoorr ( │ │ │ │ │ - io_context& ios, settings_interface const&, counters& cnt); │ │ │ │ │ -this is a simple posix disk I/O back-end, used for systems that don't have a 64 │ │ │ │ │ -bit virtual address space or don't support memory mapped files. It's │ │ │ │ │ -implemented using portable C file functions and is single-threaded. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ddiissaabblleedd__ddiisskk__iioo__ccoonnssttrruuccttoorr(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_a_b_l_e_d___d_i_s_k___i_o_._h_p_p" │ │ │ │ │ std::unique_ptr ddiissaabblleedd__ddiisskk__iioo__ccoonnssttrruuccttoorr ( │ │ │ │ │ io_context& ios, settings_interface const&, counters& cnt); │ │ │ │ │ creates a disk io object that discards all data written to it, and only returns │ │ │ │ │ zero-buffers when read from. May be useful for testing and benchmarking. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ mmmmaapp__ddiisskk__iioo__ccoonnssttrruuccttoorr(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_m_m_a_p___d_i_s_k___i_o_._h_p_p" │ │ │ │ │ -std::unique_ptr mmmmaapp__ddiisskk__iioo__ccoonnssttrruuccttoorr ( │ │ │ │ │ +************ ppoossiixx__ddiisskk__iioo__ccoonnssttrruuccttoorr(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_o_s_i_x___d_i_s_k___i_o_._h_p_p" │ │ │ │ │ +std::unique_ptr ppoossiixx__ddiisskk__iioo__ccoonnssttrruuccttoorr ( │ │ │ │ │ io_context& ios, settings_interface const&, counters& cnt); │ │ │ │ │ -constructs a memory mapped file disk I/O object. │ │ │ │ │ +this is a simple posix disk I/O back-end, used for systems that don't have a 64 │ │ │ │ │ +bit virtual address space or don't support memory mapped files. It's │ │ │ │ │ +implemented using portable C file functions and is single-threaded. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ eennuumm ssttoorraaggee__mmooddee__tt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_t_o_r_a_g_e___d_e_f_s_._h_p_p" │ │ │ │ │ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ |_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ | | |All pieces will be written to their final | │ │ │ │ │ | | |position, all files will be allocated in full | │ │ │ │ │ @@ -7684,14 +6080,831 @@ │ │ │ │ │ |dont_replace |2 |files instead of the ones we may have in the | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_o_u_r_c_e_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ | | |don't move any source files, just forget | │ │ │ │ │ |reset_save_path |3 |about them and begin checking files at new | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_a_v_e_ _p_a_t_h_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |reset_save_path_unchecked|4 |don't move any source files, just change save| │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_a_t_h_ _a_n_d_ _c_o_n_t_i_n_u_e_ _w_o_r_k_i_n_g_ _w_i_t_h_o_u_t_ _a_n_y_ _c_h_e_c_k_s_ | │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ sseessssiioonn__pprrooxxyy ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n_._h_p_p" │ │ │ │ │ +this is a holder for the internal _s_e_s_s_i_o_n implementation object. Once the │ │ │ │ │ +_s_e_s_s_i_o_n destruction is explicitly initiated, this holder is used to synchronize │ │ │ │ │ +the completion of the shutdown. The lifetime of this object may outlive │ │ │ │ │ +_s_e_s_s_i_o_n, causing the _s_e_s_s_i_o_n destructor to not block. The _s_e_s_s_i_o_n___p_r_o_x_y │ │ │ │ │ +destructor will block however, until the underlying _s_e_s_s_i_o_n is done shutting │ │ │ │ │ +down. │ │ │ │ │ +struct session_proxy │ │ │ │ │ +{ │ │ │ │ │ + session_proxy& ooppeerraattoorr== (session_proxy const&) &; │ │ │ │ │ + session_proxy& ooppeerraattoorr== (session_proxy&&) & noexcept; │ │ │ │ │ + sseessssiioonn__pprrooxxyy (session_proxy&&) noexcept; │ │ │ │ │ + sseessssiioonn__pprrooxxyy (); │ │ │ │ │ + ~~sseessssiioonn__pprrooxxyy (); │ │ │ │ │ + sseessssiioonn__pprrooxxyy (session_proxy const&); │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ~~sseessssiioonn__pprrooxxyy(()) sseessssiioonn__pprrooxxyy(()) ooppeerraattoorr==(()) ********** │ │ │ │ │ +session_proxy& ooppeerraattoorr== (session_proxy const&) &; │ │ │ │ │ +session_proxy& ooppeerraattoorr== (session_proxy&&) & noexcept; │ │ │ │ │ +sseessssiioonn__pprrooxxyy (session_proxy&&) noexcept; │ │ │ │ │ +sseessssiioonn__pprrooxxyy (); │ │ │ │ │ +~~sseessssiioonn__pprrooxxyy (); │ │ │ │ │ +sseessssiioonn__pprrooxxyy (session_proxy const&); │ │ │ │ │ +default constructor, does not refer to any _s_e_s_s_i_o_n implementation object. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ sseessssiioonn ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n_._h_p_p" │ │ │ │ │ +The _s_e_s_s_i_o_n holds all state that spans multiple torrents. Among other things it │ │ │ │ │ +runs the network loop and manages all torrents. Once it's created, the _s_e_s_s_i_o_n │ │ │ │ │ +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. │ │ │ │ │ +You have some control over _s_e_s_s_i_o_n configuration through the session_handle:: │ │ │ │ │ +apply_settings() member function. To change one or more configuration options, │ │ │ │ │ +create a _s_e_t_t_i_n_g_s___p_a_c_k. object and fill it with the settings to be set and pass │ │ │ │ │ +it in to session::apply_settings(). │ │ │ │ │ +see _a_p_p_l_y___s_e_t_t_i_n_g_s_(_). │ │ │ │ │ +struct session : session_handle │ │ │ │ │ +{ │ │ │ │ │ + explicit sseessssiioonn (session_params const& params); │ │ │ │ │ + sseessssiioonn (session_params&& params, session_flags_t flags); │ │ │ │ │ + sseessssiioonn (); │ │ │ │ │ + sseessssiioonn (session_params const& params, session_flags_t flags); │ │ │ │ │ + explicit sseessssiioonn (session_params&& params); │ │ │ │ │ + sseessssiioonn (session_params&& params, io_context& ios); │ │ │ │ │ + sseessssiioonn (session_params const& params, io_context& ios); │ │ │ │ │ + sseessssiioonn (session_params&& params, io_context& ios, session_flags_t); │ │ │ │ │ + sseessssiioonn (session_params const& params, io_context& ios, session_flags_t); │ │ │ │ │ + ~~sseessssiioonn (); │ │ │ │ │ + session_proxy aabboorrtt (); │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** sseessssiioonn(()) ********** │ │ │ │ │ +explicit sseessssiioonn (session_params const& params); │ │ │ │ │ +sseessssiioonn (session_params&& params, session_flags_t flags); │ │ │ │ │ +sseessssiioonn (); │ │ │ │ │ +sseessssiioonn (session_params const& params, session_flags_t flags); │ │ │ │ │ +explicit sseessssiioonn (session_params&& params); │ │ │ │ │ +Constructs the _s_e_s_s_i_o_n objects which acts as the container of torrents. In │ │ │ │ │ +order to avoid a race condition between starting the _s_e_s_s_i_o_n and configuring │ │ │ │ │ +it, you can pass in a _s_e_s_s_i_o_n___p_a_r_a_m_s object. Its settings will take effect │ │ │ │ │ +before the _s_e_s_s_i_o_n starts up. │ │ │ │ │ +The overloads taking flags can be used to start a _s_e_s_s_i_o_n in paused mode (by │ │ │ │ │ +passing in session::paused). Note that add_default_plugins do not have an │ │ │ │ │ +affect on constructors that take a _s_e_s_s_i_o_n___p_a_r_a_m_s object. It already contains │ │ │ │ │ +the plugins to use. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** sseessssiioonn(()) ********** │ │ │ │ │ +sseessssiioonn (session_params&& params, io_context& ios); │ │ │ │ │ +sseessssiioonn (session_params const& params, io_context& ios); │ │ │ │ │ +sseessssiioonn (session_params&& params, io_context& ios, session_flags_t); │ │ │ │ │ +sseessssiioonn (session_params const& params, io_context& ios, session_flags_t); │ │ │ │ │ +Overload of the constructor that takes an external io_context to run the │ │ │ │ │ +_s_e_s_s_i_o_n object on. This is primarily useful for tests that may want to run │ │ │ │ │ +multiple sessions on a single io_context, or low resource systems where │ │ │ │ │ +additional threads are expensive and sharing an io_context with other events is │ │ │ │ │ +fine. │ │ │ │ │ +Warning │ │ │ │ │ +The _s_e_s_s_i_o_n object does not cleanly terminate with an external io_context. The │ │ │ │ │ +io_context::run() call mmuusstt have returned before it's safe to destruct the │ │ │ │ │ +_s_e_s_s_i_o_n. Which means you MMUUSSTT call _s_e_s_s_i_o_n_:_:_a_b_o_r_t_(_) and save the _s_e_s_s_i_o_n___p_r_o_x_y │ │ │ │ │ +first, then destruct the _s_e_s_s_i_o_n object, then sync with the io_context, then │ │ │ │ │ +destruct the _s_e_s_s_i_o_n___p_r_o_x_y object. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ~~sseessssiioonn(()) ********** │ │ │ │ │ +~~sseessssiioonn (); │ │ │ │ │ +The destructor of _s_e_s_s_i_o_n 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 _s_e_s_s_i_o_n returns. So, it's advised that any kind of interface │ │ │ │ │ +(such as windows) are closed before destructing the _s_e_s_s_i_o_n object. Because it │ │ │ │ │ +can take a few second for it to finish. The timeout can be set with │ │ │ │ │ +_a_p_p_l_y___s_e_t_t_i_n_g_s_(_). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aabboorrtt(()) ********** │ │ │ │ │ +session_proxy aabboorrtt (); │ │ │ │ │ +In case you want to destruct the _s_e_s_s_i_o_n asynchronously, you can request a │ │ │ │ │ +_s_e_s_s_i_o_n destruction proxy. If you don't do this, the destructor of the _s_e_s_s_i_o_n │ │ │ │ │ +object will block while the trackers are contacted. If you keep one │ │ │ │ │ +session_proxy to the _s_e_s_s_i_o_n when destructing it, the destructor will not │ │ │ │ │ +block, but start to close down the _s_e_s_s_i_o_n, the destructor of the proxy will │ │ │ │ │ +then synchronize the threads. So, the destruction of the _s_e_s_s_i_o_n 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 _s_e_s_s_i_o_n is being │ │ │ │ │ +closed down, no operations are allowed on it). The only valid operation is │ │ │ │ │ +calling the destructor: │ │ │ │ │ +struct session_proxy {}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ sseessssiioonn__hhaannddllee ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ +this class provides a non-owning handle to a _s_e_s_s_i_o_n and a subset of the │ │ │ │ │ +interface of the _s_e_s_s_i_o_n class. If the underlying _s_e_s_s_i_o_n is destructed any │ │ │ │ │ +handle to it will no longer be valid. _i_s___v_a_l_i_d_(_) will return false and any │ │ │ │ │ +operation on it will throw a system_error exception, with error code │ │ │ │ │ +invalid_session_handle. │ │ │ │ │ +struct session_handle │ │ │ │ │ +{ │ │ │ │ │ + bool iiss__vvaalliidd () const; │ │ │ │ │ + session_params sseessssiioonn__ssttaattee (save_state_flags_t flags = │ │ │ │ │ +save_state_flags_t::all()) const; │ │ │ │ │ + std::vector ggeett__ttoorrrreenntt__ssttaattuuss ( │ │ │ │ │ + std::function const& pred │ │ │ │ │ + , status_flags_t flags = {}) const; │ │ │ │ │ + void rreeffrreesshh__ttoorrrreenntt__ssttaattuuss (std::vector* ret │ │ │ │ │ + , status_flags_t flags = {}) const; │ │ │ │ │ + void ppoosstt__ttoorrrreenntt__uuppddaatteess (status_flags_t flags = status_flags_t::all()); │ │ │ │ │ + void ppoosstt__sseessssiioonn__ssttaattss (); │ │ │ │ │ + void ppoosstt__ddhhtt__ssttaattss (); │ │ │ │ │ + void sseett__ddhhtt__ssttaattee (dht::dht_state const& st); │ │ │ │ │ + void sseett__ddhhtt__ssttaattee (dht::dht_state&& st); │ │ │ │ │ + torrent_handle ffiinndd__ttoorrrreenntt (sha1_hash const& info_hash) const; │ │ │ │ │ + std::vector ggeett__ttoorrrreennttss () const; │ │ │ │ │ + torrent_handle aadddd__ttoorrrreenntt (add_torrent_params const& params, error_code& │ │ │ │ │ +ec); │ │ │ │ │ + torrent_handle aadddd__ttoorrrreenntt (add_torrent_params const& params); │ │ │ │ │ + torrent_handle aadddd__ttoorrrreenntt (add_torrent_params&& params); │ │ │ │ │ + void aassyynncc__aadddd__ttoorrrreenntt (add_torrent_params&& params); │ │ │ │ │ + void aassyynncc__aadddd__ttoorrrreenntt (add_torrent_params const& params); │ │ │ │ │ + torrent_handle aadddd__ttoorrrreenntt (add_torrent_params&& params, error_code& ec); │ │ │ │ │ + bool iiss__ppaauusseedd () const; │ │ │ │ │ + void ppaauussee (); │ │ │ │ │ + void rreessuummee (); │ │ │ │ │ + bool iiss__ddhhtt__rruunnnniinngg () const; │ │ │ │ │ + void sseett__ddhhtt__ssttoorraaggee (dht::dht_storage_constructor_type sc); │ │ │ │ │ + void aadddd__ddhhtt__nnooddee (std::pair const& node); │ │ │ │ │ + void ddhhtt__ggeett__iitteemm (sha1_hash const& target); │ │ │ │ │ + void ddhhtt__ggeett__iitteemm (std::array key │ │ │ │ │ + , std::string salt = std::string()); │ │ │ │ │ + sha1_hash ddhhtt__ppuutt__iitteemm (entry data); │ │ │ │ │ + void ddhhtt__ppuutt__iitteemm (std::array key │ │ │ │ │ + , std::function& │ │ │ │ │ + , std::int64_t&, std::string const&)> cb │ │ │ │ │ + , std::string salt = std::string()); │ │ │ │ │ + void ddhhtt__ggeett__ppeeeerrss (sha1_hash const& info_hash); │ │ │ │ │ + void ddhhtt__aannnnoouunnccee (sha1_hash const& info_hash, int port = 0, dht:: │ │ │ │ │ +announce_flags_t flags = {}); │ │ │ │ │ + void ddhhtt__lliivvee__nnooddeess (sha1_hash const& nid); │ │ │ │ │ + void ddhhtt__ssaammppllee__iinnffoohhaasshheess (udp::endpoint const& ep, sha1_hash const& │ │ │ │ │ +target); │ │ │ │ │ + void ddhhtt__ddiirreecctt__rreeqquueesstt (udp::endpoint const& ep, entry const& e, │ │ │ │ │ +client_data_t userdata = {}); │ │ │ │ │ + void aadddd__eexxtteennssiioonn (std::function( │ │ │ │ │ + torrent_handle const&, client_data_t)> ext); │ │ │ │ │ + void aadddd__eexxtteennssiioonn (std::shared_ptr ext); │ │ │ │ │ + ip_filter ggeett__iipp__ffiilltteerr () const; │ │ │ │ │ + void sseett__iipp__ffiilltteerr (ip_filter f); │ │ │ │ │ + void sseett__ppoorrtt__ffiilltteerr (port_filter const& f); │ │ │ │ │ + unsigned short lliisstteenn__ppoorrtt () const; │ │ │ │ │ + unsigned short ssssll__lliisstteenn__ppoorrtt () const; │ │ │ │ │ + bool iiss__lliisstteenniinngg () const; │ │ │ │ │ + ip_filter ggeett__ppeeeerr__ccllaassss__ffiilltteerr () const; │ │ │ │ │ + void sseett__ppeeeerr__ccllaassss__ffiilltteerr (ip_filter const& f); │ │ │ │ │ + peer_class_type_filter ggeett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr () const; │ │ │ │ │ + void sseett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr (peer_class_type_filter const& f); │ │ │ │ │ + peer_class_t ccrreeaattee__ppeeeerr__ccllaassss (char const* name); │ │ │ │ │ + void ddeelleettee__ppeeeerr__ccllaassss (peer_class_t cid); │ │ │ │ │ + peer_class_info ggeett__ppeeeerr__ccllaassss (peer_class_t cid) const; │ │ │ │ │ + void sseett__ppeeeerr__ccllaassss (peer_class_t cid, peer_class_info const& pci); │ │ │ │ │ + void rreemmoovvee__ttoorrrreenntt (const torrent_handle&, remove_flags_t = {}); │ │ │ │ │ + void aappppllyy__sseettttiinnggss (settings_pack&&); │ │ │ │ │ + void aappppllyy__sseettttiinnggss (settings_pack const&); │ │ │ │ │ + settings_pack ggeett__sseettttiinnggss () const; │ │ │ │ │ + void ppoopp__aalleerrttss (std::vector* alerts); │ │ │ │ │ + alert* wwaaiitt__ffoorr__aalleerrtt (time_duration max_wait); │ │ │ │ │ + void sseett__aalleerrtt__nnoottiiffyy (std::function const& fun); │ │ │ │ │ + void ddeelleettee__ppoorrtt__mmaappppiinngg (port_mapping_t handle); │ │ │ │ │ + std::vector aadddd__ppoorrtt__mmaappppiinngg (portmap_protocol t, int │ │ │ │ │ +external_port, int local_port); │ │ │ │ │ + void rreeooppeenn__nneettwwoorrkk__ssoocckkeettss (reopen_network_flags_t options = │ │ │ │ │ +reopen_map_ports); │ │ │ │ │ + std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ + │ │ │ │ │ + static constexpr save_state_flags_t ssaavvee__sseettttiinnggss = 0_bit; │ │ │ │ │ + static constexpr save_state_flags_t ssaavvee__ddhhtt__ssttaattee = 2_bit; │ │ │ │ │ + static constexpr save_state_flags_t ssaavvee__eexxtteennssiioonn__ssttaattee = 11_bit; │ │ │ │ │ + static constexpr save_state_flags_t ssaavvee__iipp__ffiilltteerr = 12_bit; │ │ │ │ │ + static constexpr peer_class_t gglloobbaall__ppeeeerr__ccllaassss__iidd {0}; │ │ │ │ │ + static constexpr peer_class_t ttccpp__ppeeeerr__ccllaassss__iidd {1}; │ │ │ │ │ + static constexpr peer_class_t llooccaall__ppeeeerr__ccllaassss__iidd {2}; │ │ │ │ │ + static constexpr remove_flags_t ddeelleettee__ffiilleess = 0_bit; │ │ │ │ │ + static constexpr remove_flags_t ddeelleettee__ppaarrttffiillee = 1_bit; │ │ │ │ │ + static constexpr session_flags_t ppaauusseedd = 2_bit; │ │ │ │ │ + static constexpr portmap_protocol uuddpp = portmap_protocol::udp; │ │ │ │ │ + static constexpr portmap_protocol ttccpp = portmap_protocol::tcp; │ │ │ │ │ + static constexpr reopen_network_flags_t rreeooppeenn__mmaapp__ppoorrttss = 0_bit; │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** iiss__vvaalliidd(()) ********** │ │ │ │ │ +bool iiss__vvaalliidd () const; │ │ │ │ │ +returns true if this handle refers to a valid _s_e_s_s_i_o_n object. If the _s_e_s_s_i_o_n │ │ │ │ │ +has been destroyed, all _s_e_s_s_i_o_n___h_a_n_d_l_e objects will expire and not be valid. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** sseessssiioonn__ssttaattee(()) ********** │ │ │ │ │ +session_params sseessssiioonn__ssttaattee (save_state_flags_t flags = save_state_flags_t:: │ │ │ │ │ +all()) const; │ │ │ │ │ +returns the current _s_e_s_s_i_o_n state. This can be passed to _w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) │ │ │ │ │ +to save the state to disk and restored using _r_e_a_d___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) when │ │ │ │ │ +constructing a new _s_e_s_s_i_o_n. The kind of state that's included is all settings, │ │ │ │ │ +the DHT routing table, possibly plugin-specific state. the flags parameter can │ │ │ │ │ +be used to only save certain parts of the _s_e_s_s_i_o_n state │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ggeett__ttoorrrreenntt__ssttaattuuss(()) rreeffrreesshh__ttoorrrreenntt__ssttaattuuss(()) ********** │ │ │ │ │ +std::vector ggeett__ttoorrrreenntt__ssttaattuuss ( │ │ │ │ │ + std::function const& pred │ │ │ │ │ + , status_flags_t flags = {}) const; │ │ │ │ │ +void rreeffrreesshh__ttoorrrreenntt__ssttaattuuss (std::vector* ret │ │ │ │ │ + , status_flags_t flags = {}) const; │ │ │ │ │ +Note │ │ │ │ │ +these calls are potentially expensive and won't scale well with lots of │ │ │ │ │ +torrents. If you're concerned about performance, consider using │ │ │ │ │ +post_torrent_updates() instead. │ │ │ │ │ +get_torrent_status returns a vector of the _t_o_r_r_e_n_t___s_t_a_t_u_s for every torrent │ │ │ │ │ +which satisfies pred, which is a predicate function which determines if a │ │ │ │ │ +torrent should be included in the returned set or not. Returning true means it │ │ │ │ │ +should be included and false means excluded. The flags argument is the same as │ │ │ │ │ +to _t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_s_t_a_t_u_s_(_). Since pred is guaranteed to be called for every │ │ │ │ │ +torrent, it may be used to count the number of torrents of different categories │ │ │ │ │ +as well. │ │ │ │ │ +refresh_torrent_status takes a vector of _t_o_r_r_e_n_t___s_t_a_t_u_s structs (for instance │ │ │ │ │ +the same vector that was returned by _g_e_t___t_o_r_r_e_n_t___s_t_a_t_u_s_(_) ) and refreshes the │ │ │ │ │ +status based on the handle member. It is possible to use this function by first │ │ │ │ │ +setting up a vector of default constructed torrent_status objects, only │ │ │ │ │ +initializing the handle member, in order to request the torrent status for │ │ │ │ │ +multiple torrents in a single call. This can save a significant amount of time │ │ │ │ │ +if you have a lot of torrents. │ │ │ │ │ +Any _t_o_r_r_e_n_t___s_t_a_t_u_s object whose handle member is not referring to a valid │ │ │ │ │ +torrent are ignored. │ │ │ │ │ +The intended use of these functions is to start off by calling │ │ │ │ │ +get_torrent_status() to get a list of all torrents that match your criteria. │ │ │ │ │ +Then call refresh_torrent_status() on that list. This will only refresh the │ │ │ │ │ +status for the torrents in your list, and thus ignore all other torrents you │ │ │ │ │ +might be running. This may save a significant amount of time, especially if the │ │ │ │ │ +number of torrents you're interested in is small. In order to keep your list of │ │ │ │ │ +interested torrents up to date, you can either call get_torrent_status() from │ │ │ │ │ +time to time, to include torrents you might have become interested in since the │ │ │ │ │ +last time. In order to stop refreshing a certain torrent, simply remove it from │ │ │ │ │ +the list. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ppoosstt__ttoorrrreenntt__uuppddaatteess(()) ********** │ │ │ │ │ +void ppoosstt__ttoorrrreenntt__uuppddaatteess (status_flags_t flags = status_flags_t::all()); │ │ │ │ │ +This functions instructs the _s_e_s_s_i_o_n to post the _s_t_a_t_e___u_p_d_a_t_e___a_l_e_r_t, containing │ │ │ │ │ +the status of all torrents whose state changed since the last time this │ │ │ │ │ +function was called. │ │ │ │ │ +Only torrents who has the state subscription flag set will be included. This │ │ │ │ │ +flag is on by default. See _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s. the flags argument is the same │ │ │ │ │ +as for _t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_s_t_a_t_u_s_(_). see status_flags_t in _t_o_r_r_e_n_t___h_a_n_d_l_e. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ppoosstt__sseessssiioonn__ssttaattss(()) ********** │ │ │ │ │ +void ppoosstt__sseessssiioonn__ssttaattss (); │ │ │ │ │ +This function will post a _s_e_s_s_i_o_n___s_t_a_t_s___a_l_e_r_t object, containing a snapshot of │ │ │ │ │ +the performance _c_o_u_n_t_e_r_s from the internals of libtorrent. To interpret these │ │ │ │ │ +_c_o_u_n_t_e_r_s, query the _s_e_s_s_i_o_n via _s_e_s_s_i_o_n___s_t_a_t_s___m_e_t_r_i_c_s_(_). │ │ │ │ │ +For more information, see the _s_e_s_s_i_o_n_ _s_t_a_t_i_s_t_i_c_s section. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ppoosstt__ddhhtt__ssttaattss(()) ********** │ │ │ │ │ +void ppoosstt__ddhhtt__ssttaattss (); │ │ │ │ │ +This will cause a _d_h_t___s_t_a_t_s___a_l_e_r_t to be posted. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** sseett__ddhhtt__ssttaattee(()) ********** │ │ │ │ │ +void sseett__ddhhtt__ssttaattee (dht::dht_state const& st); │ │ │ │ │ +void sseett__ddhhtt__ssttaattee (dht::dht_state&& st); │ │ │ │ │ +set the DHT state for the _s_e_s_s_i_o_n. This will be taken into account the next │ │ │ │ │ +time the DHT is started, as if it had been passed in via the _s_e_s_s_i_o_n___p_a_r_a_m_s on │ │ │ │ │ +startup. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ffiinndd__ttoorrrreenntt(()) ggeett__ttoorrrreennttss(()) ********** │ │ │ │ │ +torrent_handle ffiinndd__ttoorrrreenntt (sha1_hash const& info_hash) const; │ │ │ │ │ +std::vector ggeett__ttoorrrreennttss () const; │ │ │ │ │ +find_torrent() looks for a torrent with the given info-hash. In case there is │ │ │ │ │ +such a torrent in the _s_e_s_s_i_o_n, a _t_o_r_r_e_n_t___h_a_n_d_l_e to that torrent is returned. In │ │ │ │ │ +case the torrent cannot be found, an invalid _t_o_r_r_e_n_t___h_a_n_d_l_e 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 _s_e_s_s_i_o_n. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aadddd__ttoorrrreenntt(()) aassyynncc__aadddd__ttoorrrreenntt(()) ********** │ │ │ │ │ +torrent_handle aadddd__ttoorrrreenntt (add_torrent_params const& params, error_code& ec); │ │ │ │ │ +torrent_handle aadddd__ttoorrrreenntt (add_torrent_params const& params); │ │ │ │ │ +torrent_handle aadddd__ttoorrrreenntt (add_torrent_params&& params); │ │ │ │ │ +void aassyynncc__aadddd__ttoorrrreenntt (add_torrent_params&& params); │ │ │ │ │ +void aassyynncc__aadddd__ttoorrrreenntt (add_torrent_params const& params); │ │ │ │ │ +torrent_handle aadddd__ttoorrrreenntt (add_torrent_params&& params, error_code& ec); │ │ │ │ │ +You add torrents through the _a_d_d___t_o_r_r_e_n_t_(_) function where you give an object │ │ │ │ │ +with all the parameters. The _a_d_d___t_o_r_r_e_n_t_(_) overloads will block until the │ │ │ │ │ +torrent has been added (or failed to be added) and returns an error code and a │ │ │ │ │ +_t_o_r_r_e_n_t___h_a_n_d_l_e. In order to add torrents more efficiently, consider using │ │ │ │ │ +_a_s_y_n_c___a_d_d___t_o_r_r_e_n_t_(_) which returns immediately, without waiting for the torrent │ │ │ │ │ +to add. Notification of the torrent being added is sent as _a_d_d___t_o_r_r_e_n_t___a_l_e_r_t. │ │ │ │ │ +The save_path field in _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s must be set to a valid path where the │ │ │ │ │ +files for the torrent will be saved. Even when using a custom storage, this │ │ │ │ │ +needs to be set to something. If the save_path is empty, the call to │ │ │ │ │ +_a_d_d___t_o_r_r_e_n_t_(_) will throw a system_error exception. │ │ │ │ │ +The overload that does not take an error_code throws an exception on error and │ │ │ │ │ +is not available when building without exception support. The _t_o_r_r_e_n_t___h_a_n_d_l_e │ │ │ │ │ +returned by _a_d_d___t_o_r_r_e_n_t_(_) can be used to retrieve information about the │ │ │ │ │ +torrent's progress, its peers etc. It is also used to abort a torrent. │ │ │ │ │ +If the torrent you are trying to add already exists in the _s_e_s_s_i_o_n (is either │ │ │ │ │ +queued for checking, being checked or downloading) add_torrent() will throw │ │ │ │ │ +system_error which derives from std::exception unless duplicate_is_error is set │ │ │ │ │ +to false. In that case, _a_d_d___t_o_r_r_e_n_t_(_) will return the handle to the existing │ │ │ │ │ +torrent. │ │ │ │ │ +The _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s class has a flags field. It can be used to control what │ │ │ │ │ +state the new torrent will be added in. Common flags to want to control are │ │ │ │ │ +torrent_flags::paused and torrent_flags::auto_managed. In order to add a magnet │ │ │ │ │ +link that will just download the metadata, but no payload, set the │ │ │ │ │ +torrent_flags::upload_mode flag. │ │ │ │ │ +Special consideration has to be taken when adding hybrid torrents (i.e. │ │ │ │ │ +torrents that are BitTorrent v2 torrents that are backwards compatible with │ │ │ │ │ +v1). For more details, see _B_i_t_T_o_r_r_e_n_t_ _v_2_ _t_o_r_r_e_n_t_s. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** rreessuummee(()) ppaauussee(()) iiss__ppaauusseedd(()) ********** │ │ │ │ │ +bool iiss__ppaauusseedd () const; │ │ │ │ │ +void ppaauussee (); │ │ │ │ │ +void rreessuummee (); │ │ │ │ │ +Pausing the _s_e_s_s_i_o_n has the same effect as pausing every torrent in it, except │ │ │ │ │ +that torrents will not be resumed by the auto-manage mechanism. Resuming will │ │ │ │ │ +restore the torrents to their previous paused state. i.e. the _s_e_s_s_i_o_n pause │ │ │ │ │ +state is separate from the torrent pause state. A torrent is inactive if it is │ │ │ │ │ +paused or if the _s_e_s_s_i_o_n is paused. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** iiss__ddhhtt__rruunnnniinngg(()) ********** │ │ │ │ │ +bool iiss__ddhhtt__rruunnnniinngg () const; │ │ │ │ │ +is_dht_running() returns true if the DHT support has been started and false │ │ │ │ │ +otherwise. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** sseett__ddhhtt__ssttoorraaggee(()) ********** │ │ │ │ │ +void sseett__ddhhtt__ssttoorraaggee (dht::dht_storage_constructor_type sc); │ │ │ │ │ +set_dht_storage set a dht custom storage constructor function to be used │ │ │ │ │ +internally when the dht is created. │ │ │ │ │ +Since the dht storage is a critical component for the dht behavior, this │ │ │ │ │ +function will only be effective the next time the dht is started. If you never │ │ │ │ │ +touch this feature, a default map-memory based storage is used. │ │ │ │ │ +If you want to make sure the dht is initially created with your custom storage, │ │ │ │ │ +create a _s_e_s_s_i_o_n with the setting settings_pack::enable_dht to false, set your │ │ │ │ │ +constructor function and call apply_settings with settings_pack::enable_dht to │ │ │ │ │ +true. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aadddd__ddhhtt__nnooddee(()) ********** │ │ │ │ │ +void aadddd__ddhhtt__nnooddee (std::pair 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. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ddhhtt__ggeett__iitteemm(()) ********** │ │ │ │ │ +void ddhhtt__ggeett__iitteemm (sha1_hash const& target); │ │ │ │ │ +query the DHT for an immutable item at the target hash. the result is posted as │ │ │ │ │ +a _d_h_t___i_m_m_u_t_a_b_l_e___i_t_e_m___a_l_e_r_t. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ddhhtt__ggeett__iitteemm(()) ********** │ │ │ │ │ +void ddhhtt__ggeett__iitteemm (std::array key │ │ │ │ │ + , std::string salt = std::string()); │ │ │ │ │ +query the DHT for a mutable item under the public key key. this is an ed25519 │ │ │ │ │ +key. salt is optional and may be left as an empty string if no salt is to be │ │ │ │ │ +used. if the item is found in the DHT, a _d_h_t___m_u_t_a_b_l_e___i_t_e_m___a_l_e_r_t is posted. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ddhhtt__ppuutt__iitteemm(()) ********** │ │ │ │ │ +sha1_hash ddhhtt__ppuutt__iitteemm (entry data); │ │ │ │ │ +store the given bencoded data as an immutable item in the DHT. the returned │ │ │ │ │ +hash is the key that is to be used to look the item up again. It's just the │ │ │ │ │ +SHA-1 hash of the bencoded form of the structure. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ddhhtt__ppuutt__iitteemm(()) ********** │ │ │ │ │ +void ddhhtt__ppuutt__iitteemm (std::array key │ │ │ │ │ + , std::function& │ │ │ │ │ + , std::int64_t&, std::string const&)> cb │ │ │ │ │ + , std::string salt = std::string()); │ │ │ │ │ +store a mutable item. The key is the public key the blob is to be stored under. │ │ │ │ │ +The optional salt argument is a string that is to be mixed in with the key when │ │ │ │ │ +determining where in the DHT the value is to be stored. The callback function │ │ │ │ │ +is called from within the libtorrent network thread once we've found where to │ │ │ │ │ +store the blob, possibly with the current value stored under the key. The │ │ │ │ │ +values passed to the callback functions are: │ │ │ │ │ + entry& value │ │ │ │ │ + the current value stored under the key (may be empty). Also expected to │ │ │ │ │ + be set to the value to be stored by the function. │ │ │ │ │ + std::array& signature │ │ │ │ │ + the signature authenticating the current value. This may be zeros if │ │ │ │ │ + there is currently no value stored. The function is expected to fill in │ │ │ │ │ + this buffer with the signature of the new value to store. To generate the │ │ │ │ │ + signature, you may want to use the sign_mutable_item function. │ │ │ │ │ + std::int64_t& seq │ │ │ │ │ + current sequence number. May be zero if there is no current value. The │ │ │ │ │ + function is expected to set this to the new sequence number of the value │ │ │ │ │ + that is to be stored. Sequence numbers must be monotonically increasing. │ │ │ │ │ + Attempting to overwrite a value with a lower or equal sequence number │ │ │ │ │ + will fail, even if the signature is correct. │ │ │ │ │ + std::string const& salt │ │ │ │ │ + this is the salt that was used for this put call. │ │ │ │ │ +Since the callback function cb is called from within libtorrent, it is critical │ │ │ │ │ +to not perform any blocking operations. Ideally not even locking a mutex. Pass │ │ │ │ │ +any data required for this function along with the function object's context │ │ │ │ │ +and make the function entirely self-contained. The only reason data blob's │ │ │ │ │ +value is computed via a function instead of just passing in the new value is to │ │ │ │ │ +avoid race conditions. If you want to uuppddaattee the value in the DHT, you must │ │ │ │ │ +first retrieve it, then modify it, then write it back. The way the DHT works, │ │ │ │ │ +it is natural to always do a lookup before storing and calling the callback in │ │ │ │ │ +between is convenient. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ddhhtt__aannnnoouunnccee(()) ddhhtt__ggeett__ppeeeerrss(()) ********** │ │ │ │ │ +void ddhhtt__ggeett__ppeeeerrss (sha1_hash const& info_hash); │ │ │ │ │ +void ddhhtt__aannnnoouunnccee (sha1_hash const& info_hash, int port = 0, dht:: │ │ │ │ │ +announce_flags_t flags = {}); │ │ │ │ │ +dht_get_peers() will issue a DHT get_peer request to the DHT for the specified │ │ │ │ │ +info-hash. The response (the peers) will be posted back in a │ │ │ │ │ +_d_h_t___g_e_t___p_e_e_r_s___r_e_p_l_y___a_l_e_r_t. │ │ │ │ │ +dht_announce() will issue a DHT announce request to the DHT to the specified │ │ │ │ │ +info-hash, advertising the specified port. If the port is left at its default, │ │ │ │ │ +0, the port will be implied by the DHT message's source port (which may improve │ │ │ │ │ +connectivity through a NAT). dht_announce() is not affected by the │ │ │ │ │ +announce_port override setting. │ │ │ │ │ +Both these functions are exposed for advanced custom use of the DHT. All │ │ │ │ │ +torrents eligible to be announce to the DHT will be automatically, by │ │ │ │ │ +libtorrent. │ │ │ │ │ +For possible flags, see _a_n_n_o_u_n_c_e___f_l_a_g_s___t. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ddhhtt__lliivvee__nnooddeess(()) ********** │ │ │ │ │ +void ddhhtt__lliivvee__nnooddeess (sha1_hash const& nid); │ │ │ │ │ +Retrieve all the live DHT (identified by nid) nodes. All the nodes id and │ │ │ │ │ +endpoint will be returned in the list of nodes in the _a_l_e_r_t │ │ │ │ │ +dht_live_nodes_alert. Since this _a_l_e_r_t is a response to an explicit call, it │ │ │ │ │ +will always be posted, regardless of the _a_l_e_r_t mask. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ddhhtt__ssaammppllee__iinnffoohhaasshheess(()) ********** │ │ │ │ │ +void ddhhtt__ssaammppllee__iinnffoohhaasshheess (udp::endpoint const& ep, sha1_hash const& target); │ │ │ │ │ +Query the DHT node specified by ep to retrieve a sample of the info-hashes that │ │ │ │ │ +the node currently have in their storage. The target is included for iterative │ │ │ │ │ +lookups so that indexing nodes can perform a key space traversal with a single │ │ │ │ │ +RPC per node by adjusting the target value for each RPC. It has no effect on │ │ │ │ │ +the returned sample value. The result is posted as a │ │ │ │ │ +dht_sample_infohashes_alert. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ddhhtt__ddiirreecctt__rreeqquueesstt(()) ********** │ │ │ │ │ +void ddhhtt__ddiirreecctt__rreeqquueesstt (udp::endpoint const& ep, entry const& e, client_data_t │ │ │ │ │ +userdata = {}); │ │ │ │ │ +Send an arbitrary DHT request directly to the specified endpoint. This function │ │ │ │ │ +is intended for use by plugins. When a response is received or the request │ │ │ │ │ +times out, a _d_h_t___d_i_r_e_c_t___r_e_s_p_o_n_s_e___a_l_e_r_t will be posted with the response (if │ │ │ │ │ +any) and the userdata pointer passed in here. Since this _a_l_e_r_t is a response to │ │ │ │ │ +an explicit call, it will always be posted, regardless of the _a_l_e_r_t mask. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aadddd__eexxtteennssiioonn(()) ********** │ │ │ │ │ +void aadddd__eexxtteennssiioonn (std::function( │ │ │ │ │ + torrent_handle const&, client_data_t)> ext); │ │ │ │ │ +void aadddd__eexxtteennssiioonn (std::shared_ptr ext); │ │ │ │ │ +This function adds an extension to this _s_e_s_s_i_o_n. The argument is a function │ │ │ │ │ +object that is called with a torrent_handle and which should return a std:: │ │ │ │ │ +shared_ptr. To write custom plugins, see _l_i_b_t_o_r_r_e_n_t_ _p_l_u_g_i_n_s. │ │ │ │ │ +For the typical bittorrent client all of these extensions should be added. The │ │ │ │ │ +main plugins implemented in libtorrent are: │ │ │ │ │ + uTorrent metadata │ │ │ │ │ + Allows peers to download the metadata (.torrent files) from the swarm │ │ │ │ │ + directly. Makes it possible to join a swarm with just a tracker and info- │ │ │ │ │ + hash. │ │ │ │ │ +#include │ │ │ │ │ +ses.add_extension(<::create_ut_metadata_plugin); │ │ │ │ │ + uTorrent peer exchange │ │ │ │ │ + Exchanges peers between clients. │ │ │ │ │ +#include │ │ │ │ │ +ses.add_extension(<::create_ut_pex_plugin); │ │ │ │ │ + smart ban _p_l_u_g_i_n │ │ │ │ │ + A _p_l_u_g_i_n that, with a small overhead, can ban peers that sends bad data │ │ │ │ │ + with very high accuracy. Should eliminate most problems on poisoned │ │ │ │ │ + torrents. │ │ │ │ │ +#include │ │ │ │ │ +ses.add_extension(<::create_smart_ban_plugin); │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** sseett__iipp__ffiilltteerr(()) ggeett__iipp__ffiilltteerr(()) ********** │ │ │ │ │ +ip_filter ggeett__iipp__ffiilltteerr () const; │ │ │ │ │ +void sseett__iipp__ffiilltteerr (ip_filter f); │ │ │ │ │ +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 _i_p___f_i_l_t_e_r. │ │ │ │ │ +Each time a peer is blocked because of the IP filter, a _p_e_e_r___b_l_o_c_k_e_d___a_l_e_r_t is │ │ │ │ │ +generated. get_ip_filter() Returns the _i_p___f_i_l_t_e_r currently in the _s_e_s_s_i_o_n. See │ │ │ │ │ +_i_p___f_i_l_t_e_r. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** sseett__ppoorrtt__ffiilltteerr(()) ********** │ │ │ │ │ +void sseett__ppoorrtt__ffiilltteerr (port_filter const& f); │ │ │ │ │ +apply _p_o_r_t___f_i_l_t_e_r f to incoming and outgoing peers. a port filter will reject │ │ │ │ │ +making outgoing peer connections to certain remote ports. The main intention is │ │ │ │ │ +to be able to avoid triggering certain anti-virus software by connecting to │ │ │ │ │ +SMTP, FTP ports. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ssssll__lliisstteenn__ppoorrtt(()) lliisstteenn__ppoorrtt(()) iiss__lliisstteenniinngg(()) ********** │ │ │ │ │ +unsigned short lliisstteenn__ppoorrtt () const; │ │ │ │ │ +unsigned short ssssll__lliisstteenn__ppoorrtt () const; │ │ │ │ │ +bool iiss__lliisstteenniinngg () const; │ │ │ │ │ +is_listening() will tell you whether or not the _s_e_s_s_i_o_n has successfully opened │ │ │ │ │ +a listening port. If it hasn't, this function will return false, and then you │ │ │ │ │ +can set a new _s_e_t_t_i_n_g_s___p_a_c_k_:_:_l_i_s_t_e_n___i_n_t_e_r_f_a_c_e_s to try another interface and │ │ │ │ │ +port to bind to. │ │ │ │ │ +listen_port() returns the port we ended up listening on. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ggeett__ppeeeerr__ccllaassss__ffiilltteerr(()) sseett__ppeeeerr__ccllaassss__ffiilltteerr(()) ********** │ │ │ │ │ +ip_filter ggeett__ppeeeerr__ccllaassss__ffiilltteerr () const; │ │ │ │ │ +void sseett__ppeeeerr__ccllaassss__ffiilltteerr (ip_filter const& f); │ │ │ │ │ +Sets the peer class filter for this _s_e_s_s_i_o_n. All new peer connections will take │ │ │ │ │ +this into account and be added to the peer classes specified by this filter, │ │ │ │ │ +based on the peer's IP address. │ │ │ │ │ +The ip-filter essentially maps an IP -> uint32. Each bit in that 32 bit integer │ │ │ │ │ +represents a peer class. The least significant bit represents class 0, the next │ │ │ │ │ +bit class 1 and so on. │ │ │ │ │ +For more info, see _i_p___f_i_l_t_e_r. │ │ │ │ │ +For example, to make all peers in the range 200.1.1.0 - 200.1.255.255 belong to │ │ │ │ │ +their own peer class, apply the following filter: │ │ │ │ │ +ip_filter f = ses.get_peer_class_filter(); │ │ │ │ │ +peer_class_t my_class = ses.create_peer_class("200.1.x.x IP range"); │ │ │ │ │ +f.add_rule(make_address("200.1.1.0"), make_address("200.1.255.255") │ │ │ │ │ + , 1 << static_cast(my_class)); │ │ │ │ │ +ses.set_peer_class_filter(f); │ │ │ │ │ +This setting only applies to new connections, it won't affect existing peer │ │ │ │ │ +connections. │ │ │ │ │ +This function is limited to only peer class 0-31, since there are only 32 bits │ │ │ │ │ +in the IP range mapping. Only the set bits matter; no peer class will be │ │ │ │ │ +removed from a peer as a result of this call, peer classes are only added. │ │ │ │ │ +The peer_class argument cannot be greater than 31. The bitmasks representing │ │ │ │ │ +peer classes in the peer_class_filter are 32 bits. │ │ │ │ │ +The get_peer_class_filter() function returns the current filter. │ │ │ │ │ +For more information, see _p_e_e_r_ _c_l_a_s_s_e_s. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ggeett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr(()) sseett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr(()) ********** │ │ │ │ │ +peer_class_type_filter ggeett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr () const; │ │ │ │ │ +void sseett__ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr (peer_class_type_filter const& f); │ │ │ │ │ +Sets and gets the ppeeeerr ccllaassss ttyyppee ffiilltteerr. This is controls automatic peer class │ │ │ │ │ +assignments to peers based on what kind of socket it is. │ │ │ │ │ +It does not only support assigning peer classes, it also supports removing peer │ │ │ │ │ +classes based on socket type. │ │ │ │ │ +The order of these rules being applied are: │ │ │ │ │ + 1. peer-class IP filter │ │ │ │ │ + 2. peer-class type filter, removing classes │ │ │ │ │ + 3. peer-class type filter, adding classes │ │ │ │ │ +For more information, see _p_e_e_r_ _c_l_a_s_s_e_s. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ccrreeaattee__ppeeeerr__ccllaassss(()) ********** │ │ │ │ │ +peer_class_t ccrreeaattee__ppeeeerr__ccllaassss (char const* name); │ │ │ │ │ +Creates a new peer class (see _p_e_e_r_ _c_l_a_s_s_e_s) with the given name. The returned │ │ │ │ │ +integer is the new peer class identifier. Peer classes may have the same name, │ │ │ │ │ +so each invocation of this function creates a new class and returns a unique │ │ │ │ │ +identifier. │ │ │ │ │ +Identifiers are assigned from low numbers to higher. So if you plan on using │ │ │ │ │ +certain peer classes in a call to _s_e_t___p_e_e_r___c_l_a_s_s___f_i_l_t_e_r_(_), make sure to create │ │ │ │ │ +those early on, to get low identifiers. │ │ │ │ │ +For more information on peer classes, see _p_e_e_r_ _c_l_a_s_s_e_s. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ddeelleettee__ppeeeerr__ccllaassss(()) ********** │ │ │ │ │ +void ddeelleettee__ppeeeerr__ccllaassss (peer_class_t cid); │ │ │ │ │ +This call dereferences the reference count of the specified peer class. When │ │ │ │ │ +creating a peer class it's automatically referenced by 1. If you want to │ │ │ │ │ +recycle a peer class, you may call this function. You may only call this │ │ │ │ │ +function oonnccee per peer class you create. Calling it more than once for the same │ │ │ │ │ +class will lead to memory corruption. │ │ │ │ │ +Since peer classes are reference counted, this function will not remove the │ │ │ │ │ +peer class if it's still assigned to torrents or peers. It will however remove │ │ │ │ │ +it once the last peer and torrent drops their references to it. │ │ │ │ │ +There is no need to call this function for custom peer classes. All peer │ │ │ │ │ +classes will be properly destructed when the _s_e_s_s_i_o_n object destructs. │ │ │ │ │ +For more information on peer classes, see _p_e_e_r_ _c_l_a_s_s_e_s. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ggeett__ppeeeerr__ccllaassss(()) sseett__ppeeeerr__ccllaassss(()) ********** │ │ │ │ │ +peer_class_info ggeett__ppeeeerr__ccllaassss (peer_class_t cid) const; │ │ │ │ │ +void sseett__ppeeeerr__ccllaassss (peer_class_t cid, peer_class_info const& pci); │ │ │ │ │ +These functions queries information from a peer class and updates the │ │ │ │ │ +configuration of a peer class, respectively. │ │ │ │ │ +cid must refer to an existing peer class. If it does not, the return value of │ │ │ │ │ +get_peer_class() is undefined. │ │ │ │ │ +set_peer_class() sets all the information in the _p_e_e_r___c_l_a_s_s___i_n_f_o object in the │ │ │ │ │ +specified peer class. There is no option to only update a single property. │ │ │ │ │ +A peer or torrent belonging to more than one class, the highest priority among │ │ │ │ │ +any of its classes is the one that is taken into account. │ │ │ │ │ +For more information, see _p_e_e_r_ _c_l_a_s_s_e_s. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** rreemmoovvee__ttoorrrreenntt(()) ********** │ │ │ │ │ +void rreemmoovvee__ttoorrrreenntt (const torrent_handle&, remove_flags_t = {}); │ │ │ │ │ +remove_torrent() will close all peer connections associated with the torrent │ │ │ │ │ +and tell the tracker that we've stopped participating in the swarm. This │ │ │ │ │ +operation cannot fail. When it completes, you will receive a │ │ │ │ │ +_t_o_r_r_e_n_t___r_e_m_o_v_e_d___a_l_e_r_t. │ │ │ │ │ +_r_e_m_o_v_e___t_o_r_r_e_n_t_(_) is non-blocking, but will remove the torrent from the _s_e_s_s_i_o_n │ │ │ │ │ +synchronously. Calling _s_e_s_s_i_o_n___h_a_n_d_l_e_:_:_a_d_d___t_o_r_r_e_n_t_(_) immediately afterward with │ │ │ │ │ +the same torrent will succeed. Note that this creates a new handle which is not │ │ │ │ │ +equal to the removed one. │ │ │ │ │ +The optional second argument options can be used to delete all the files │ │ │ │ │ +downloaded by this torrent. To do so, pass in the value session_handle:: │ │ │ │ │ +delete_files. Once the torrent is deleted, a _t_o_r_r_e_n_t___d_e_l_e_t_e_d___a_l_e_r_t is posted. │ │ │ │ │ +The _t_o_r_r_e_n_t___h_a_n_d_l_e remains valid for some time after _r_e_m_o_v_e___t_o_r_r_e_n_t_(_) is │ │ │ │ │ +called. It will become invalid only after all libtorrent tasks (such as I/ │ │ │ │ │ +O tasks) release their references to the torrent. Until this happens, │ │ │ │ │ +_t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_i_s___v_a_l_i_d_(_) will return true, and other calls such as │ │ │ │ │ +_t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_s_t_a_t_u_s_(_) will succeed. Because of this, and because │ │ │ │ │ +_r_e_m_o_v_e___t_o_r_r_e_n_t_(_) is non-blocking, the following sequence usually succeeds (does │ │ │ │ │ +not throw system_error): .. code:: c++ │ │ │ │ │ + session.remove_handle(handle); handle.save_resume_data(); │ │ │ │ │ +Note that when a queued or downloading torrent is removed, its position in the │ │ │ │ │ +download queue is vacated and every subsequent torrent in the queue has their │ │ │ │ │ +queue positions updated. This can potentially cause a large state_update to be │ │ │ │ │ +posted. When removing all torrents, it is advised to remove them from the back │ │ │ │ │ +of the queue, to minimize the shifting. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ggeett__sseettttiinnggss(()) aappppllyy__sseettttiinnggss(()) ********** │ │ │ │ │ +void aappppllyy__sseettttiinnggss (settings_pack&&); │ │ │ │ │ +void aappppllyy__sseettttiinnggss (settings_pack const&); │ │ │ │ │ +settings_pack ggeett__sseettttiinnggss () const; │ │ │ │ │ +Applies the settings specified by the _s_e_t_t_i_n_g_s___p_a_c_k s. This is an asynchronous │ │ │ │ │ +operation that will return immediately and actually apply the settings to the │ │ │ │ │ +main thread of libtorrent some time later. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** wwaaiitt__ffoorr__aalleerrtt(()) ppoopp__aalleerrttss(()) sseett__aalleerrtt__nnoottiiffyy(()) ********** │ │ │ │ │ +void ppoopp__aalleerrttss (std::vector* alerts); │ │ │ │ │ +alert* wwaaiitt__ffoorr__aalleerrtt (time_duration max_wait); │ │ │ │ │ +void sseett__aalleerrtt__nnoottiiffyy (std::function const& fun); │ │ │ │ │ +Alerts is the main mechanism for libtorrent to report errors and events. │ │ │ │ │ +pop_alerts fills in the vector passed to it with pointers to new alerts. The │ │ │ │ │ +_s_e_s_s_i_o_n still owns these alerts and they will stay valid until the next time │ │ │ │ │ +pop_alerts is called. You may not delete the _a_l_e_r_t objects. │ │ │ │ │ +It is safe to call pop_alerts from multiple different threads, as long as the │ │ │ │ │ +alerts themselves are not accessed once another thread calls pop_alerts. Doing │ │ │ │ │ +this requires manual synchronization between the popping threads. │ │ │ │ │ +wait_for_alert will block the current thread for max_wait time duration, or │ │ │ │ │ +until another _a_l_e_r_t is posted. If an _a_l_e_r_t is available at the time of the │ │ │ │ │ +call, it returns immediately. The returned _a_l_e_r_t pointer is the head of the │ │ │ │ │ +_a_l_e_r_t queue. wait_for_alert does not pop alerts from the queue, it merely peeks │ │ │ │ │ +at it. The returned _a_l_e_r_t will stay valid until pop_alerts is called twice. The │ │ │ │ │ +first time will pop it and the second will free it. │ │ │ │ │ +If there is no _a_l_e_r_t in the queue and no _a_l_e_r_t arrives within the specified │ │ │ │ │ +timeout, wait_for_alert returns nullptr. │ │ │ │ │ +In the python binding, wait_for_alert takes the number of milliseconds to wait │ │ │ │ │ +as an integer. │ │ │ │ │ +The _a_l_e_r_t queue in the _s_e_s_s_i_o_n will not grow indefinitely. Make sure to pop │ │ │ │ │ +periodically to not miss notifications. To control the max number of alerts │ │ │ │ │ +that's queued by the _s_e_s_s_i_o_n, see settings_pack::alert_queue_size. │ │ │ │ │ +Some alerts are considered so important that they are posted even when the │ │ │ │ │ +_a_l_e_r_t queue is full. Some alerts are considered mandatory and cannot be │ │ │ │ │ +disabled by the alert_mask. For instance, _s_a_v_e___r_e_s_u_m_e___d_a_t_a___a_l_e_r_t and │ │ │ │ │ +_s_a_v_e___r_e_s_u_m_e___d_a_t_a___f_a_i_l_e_d___a_l_e_r_t are always posted, regardless of the _a_l_e_r_t mask. │ │ │ │ │ +To control which alerts are posted, set the alert_mask (_s_e_t_t_i_n_g_s___p_a_c_k_:_: │ │ │ │ │ +_a_l_e_r_t___m_a_s_k). │ │ │ │ │ +If the _a_l_e_r_t queue fills up to the point where alerts are dropped, this will be │ │ │ │ │ +indicated by a _a_l_e_r_t_s___d_r_o_p_p_e_d___a_l_e_r_t, which contains a bitmask of which types of │ │ │ │ │ +alerts were dropped. Generally it is a good idea to make sure the _a_l_e_r_t queue │ │ │ │ │ +is large enough, the alert_mask doesn't have unnecessary categories enabled and │ │ │ │ │ +to call pop_alert() frequently, to avoid alerts being dropped. │ │ │ │ │ +the set_alert_notify function lets the client set a function object to be │ │ │ │ │ +invoked every time the _a_l_e_r_t queue goes from having 0 alerts to 1 _a_l_e_r_t. This │ │ │ │ │ +function is called from within libtorrent, it may be the main thread, or it may │ │ │ │ │ +be from within a user call. The intention of of the function is that the client │ │ │ │ │ +wakes up its main thread, to poll for more alerts using pop_alerts(). If the │ │ │ │ │ +notify function fails to do so, it won't be called again, until pop_alerts is │ │ │ │ │ +called for some other reason. For instance, it could signal an eventfd, post a │ │ │ │ │ +message to an HWND or some other main message pump. The actual retrieval of │ │ │ │ │ +alerts should not be done in the callback. In fact, the callback should not │ │ │ │ │ +block. It should not perform any expensive work. It really should just notify │ │ │ │ │ +the main application thread. │ │ │ │ │ +The type of an _a_l_e_r_t is returned by the polymorphic function alert::type() but │ │ │ │ │ +can also be queries from a concrete type via T::alert_type, as a static │ │ │ │ │ +constant. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ddeelleettee__ppoorrtt__mmaappppiinngg(()) aadddd__ppoorrtt__mmaappppiinngg(()) ********** │ │ │ │ │ +void ddeelleettee__ppoorrtt__mmaappppiinngg (port_mapping_t handle); │ │ │ │ │ +std::vector aadddd__ppoorrtt__mmaappppiinngg (portmap_protocol t, int │ │ │ │ │ +external_port, int local_port); │ │ │ │ │ +add_port_mapping adds one or more port forwards on UPnP and/or NAT-PMP, │ │ │ │ │ +whichever is enabled. A mapping is created for each listen socket in the │ │ │ │ │ +_s_e_s_s_i_o_n. The return values are all handles referring to the port mappings that │ │ │ │ │ +were just created. Pass them to _d_e_l_e_t_e___p_o_r_t___m_a_p_p_i_n_g_(_) to remove them. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** rreeooppeenn__nneettwwoorrkk__ssoocckkeettss(()) ********** │ │ │ │ │ +void rreeooppeenn__nneettwwoorrkk__ssoocckkeettss (reopen_network_flags_t options = │ │ │ │ │ +reopen_map_ports); │ │ │ │ │ +Instructs the _s_e_s_s_i_o_n to reopen all listen and outgoing sockets. │ │ │ │ │ +It's useful in the case your platform doesn't support the built in IP notifier │ │ │ │ │ +mechanism, or if you have a better more reliable way to detect changes in the │ │ │ │ │ +IP routing table. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** nnaattiivvee__hhaannddllee(()) ********** │ │ │ │ │ +std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ +This function is intended only for use by plugins. This type does not have a │ │ │ │ │ +stable API and should be relied on as little as possible. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + save_settings │ │ │ │ │ + saves settings (i.e. the _s_e_t_t_i_n_g_s___p_a_c_k) │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + save_dht_state │ │ │ │ │ + saves dht state such as nodes and node-id, possibly accelerating joining │ │ │ │ │ + the DHT if provided at next _s_e_s_s_i_o_n startup. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + save_extension_state │ │ │ │ │ + load or save state from plugins │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + save_ip_filter │ │ │ │ │ + load or save the IP filter set on the _s_e_s_s_i_o_n │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + global_peer_class_id tcp_peer_class_id local_peer_class_id │ │ │ │ │ + built-in peer classes │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + delete_files │ │ │ │ │ + delete the files belonging to the torrent from disk. including the part- │ │ │ │ │ + file, if there is one │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + delete_partfile │ │ │ │ │ + delete just the part-file associated with this torrent │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + paused │ │ │ │ │ + when set, the _s_e_s_s_i_o_n will start paused. Call _s_e_s_s_i_o_n___h_a_n_d_l_e_:_:_r_e_s_u_m_e_(_) to │ │ │ │ │ + start │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + udp tcp │ │ │ │ │ + protocols used by _a_d_d___p_o_r_t___m_a_p_p_i_n_g_(_) │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + reopen_map_ports │ │ │ │ │ + This option indicates if the ports are mapped using natpmp and upnp. If │ │ │ │ │ + mapping was already made, they are deleted and added again. This only │ │ │ │ │ + works if natpmp and/or upnp are configured to be enable. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ sseessssiioonn__ppaarraammss ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n___p_a_r_a_m_s_._h_p_p" │ │ │ │ │ +The _s_e_s_s_i_o_n___p_a_r_a_m_s is a parameters pack for configuring the _s_e_s_s_i_o_n before it's │ │ │ │ │ +started. │ │ │ │ │ +struct session_params │ │ │ │ │ +{ │ │ │ │ │ + sseessssiioonn__ppaarraammss (settings_pack const& sp); │ │ │ │ │ + sseessssiioonn__ppaarraammss (); │ │ │ │ │ + sseessssiioonn__ppaarraammss (settings_pack&& sp); │ │ │ │ │ + sseessssiioonn__ppaarraammss (settings_pack&& sp │ │ │ │ │ + , std::vector> exts); │ │ │ │ │ + sseessssiioonn__ppaarraammss (settings_pack const& sp │ │ │ │ │ + , std::vector> exts); │ │ │ │ │ + │ │ │ │ │ + settings_pack settings; │ │ │ │ │ + std::vector> extensions; │ │ │ │ │ + dht::dht_state dht_state; │ │ │ │ │ + dht::dht_storage_constructor_type dht_storage_constructor; │ │ │ │ │ + disk_io_constructor_type disk_io_constructor; │ │ │ │ │ + std::map ext_state; │ │ │ │ │ + libtorrent::ip_filter ip_filter; │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** sseessssiioonn__ppaarraammss(()) ********** │ │ │ │ │ +sseessssiioonn__ppaarraammss (settings_pack const& sp); │ │ │ │ │ +sseessssiioonn__ppaarraammss (); │ │ │ │ │ +sseessssiioonn__ppaarraammss (settings_pack&& sp); │ │ │ │ │ +This constructor can be used to start with the default plugins (ut_metadata, │ │ │ │ │ +ut_pex and smart_ban). Pass a _s_e_t_t_i_n_g_s___p_a_c_k to set the initial settings when │ │ │ │ │ +the _s_e_s_s_i_o_n starts. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** sseessssiioonn__ppaarraammss(()) ********** │ │ │ │ │ +sseessssiioonn__ppaarraammss (settings_pack&& sp │ │ │ │ │ + , std::vector> exts); │ │ │ │ │ +sseessssiioonn__ppaarraammss (settings_pack const& sp │ │ │ │ │ + , std::vector> exts); │ │ │ │ │ +This constructor helps to configure the set of initial plugins to be added to │ │ │ │ │ +the _s_e_s_s_i_o_n before it's started. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + settings │ │ │ │ │ + The settings to configure the _s_e_s_s_i_o_n with │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + extensions │ │ │ │ │ + the plugins to add to the _s_e_s_s_i_o_n as it is constructed │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + dht_state │ │ │ │ │ + DHT node ID and node addresses to bootstrap the DHT with. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + dht_storage_constructor │ │ │ │ │ + function object to construct the storage object for DHT items. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + disk_io_constructor │ │ │ │ │ + function object to create the disk I/O subsystem. Defaults to │ │ │ │ │ + default_disk_io_constructor. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + ext_state │ │ │ │ │ + this container can be used by extensions/plugins to store settings. It's │ │ │ │ │ + primarily here to make it convenient to save and restore state across │ │ │ │ │ + sessions, using _r_e_a_d___s_e_s_s_i_o_n___p_a_r_a_m_s_(_) and _w_r_i_t_e___s_e_s_s_i_o_n___p_a_r_a_m_s_(_). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + ip_filter │ │ │ │ │ + the IP filter to use for the _s_e_s_s_i_o_n. This restricts which peers are │ │ │ │ │ + allowed to connect. As if passed to _s_e_t___i_p___f_i_l_t_e_r_(_). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ wwrriittee__sseessssiioonn__ppaarraammss__bbuuff(()) wwrriittee__sseessssiioonn__ppaarraammss(()) rreeaadd__sseessssiioonn__ppaarraammss(()) │ │ │ │ │ +************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n___p_a_r_a_m_s_._h_p_p" │ │ │ │ │ +session_params rreeaadd__sseessssiioonn__ppaarraammss (bdecode_node const& e │ │ │ │ │ + , save_state_flags_t flags = save_state_flags_t::all()); │ │ │ │ │ +session_params rreeaadd__sseessssiioonn__ppaarraammss (span buf │ │ │ │ │ + , save_state_flags_t flags = save_state_flags_t::all()); │ │ │ │ │ +entry wwrriittee__sseessssiioonn__ppaarraammss (session_params const& sp │ │ │ │ │ + , save_state_flags_t flags = save_state_flags_t::all()); │ │ │ │ │ +std::vector wwrriittee__sseessssiioonn__ppaarraammss__bbuuff (session_params const& sp │ │ │ │ │ + , save_state_flags_t flags = save_state_flags_t::all()); │ │ │ │ │ +These functions serialize and de-serialize a session_params object to and from │ │ │ │ │ +bencoded form. The _s_e_s_s_i_o_n___p_a_r_a_m_s object is used to initialize a new _s_e_s_s_i_o_n │ │ │ │ │ +using the state from a previous one (or by programmatically configure the │ │ │ │ │ +_s_e_s_s_i_o_n up-front). The flags parameter can be used to only save and load │ │ │ │ │ +certain aspects of the session's state. The _buf suffix indicates the function │ │ │ │ │ +operates on buffer rather than the bencoded structure. The torrents in a │ │ │ │ │ +_s_e_s_s_i_o_n are not part of the _s_e_s_s_i_o_n___p_a_r_a_m_s state, they have to be restored │ │ │ │ │ +separately. │ │ │ │ │ libtorrent has a _p_l_u_g_i_n interface for implementing extensions to the protocol. │ │ │ │ │ These can be general extensions for transferring metadata or peer exchange │ │ │ │ │ extensions, or it could be used to provide a way to customize the protocol to │ │ │ │ │ fit a particular (closed) network. │ │ │ │ │ In short, the _p_l_u_g_i_n interface makes it possible to: │ │ │ │ │ * register extension messages (sent in the extension handshake), see │ │ │ │ │ _e_x_t_e_n_s_i_o_n_s. │ │ │ │ │ @@ -7767,79 +6980,14 @@ │ │ │ │ │ The static category is required for checking whether or not the category for a │ │ │ │ │ specific _a_l_e_r_t is enabled or not, without instantiating the _a_l_e_r_t. The category │ │ │ │ │ virtual function is the run-time equivalence. │ │ │ │ │ The what() virtual function may simply be a string literal of the class name of │ │ │ │ │ your _a_l_e_r_t. │ │ │ │ │ For more information, see the _a_l_e_r_t_ _s_e_c_t_i_o_n. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ppeeeerr__ccoonnnneeccttiioonn__hhaannddllee ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ -the _p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e class provides a handle to the internal peer │ │ │ │ │ -connection object, to be used by plugins. This is a low level interface that │ │ │ │ │ -may not be stable across libtorrent versions │ │ │ │ │ -struct peer_connection_handle │ │ │ │ │ -{ │ │ │ │ │ - explicit ppeeeerr__ccoonnnneeccttiioonn__hhaannddllee (std::weak_ptr impl); │ │ │ │ │ - connection_type ttyyppee () const; │ │ │ │ │ - peer_plugin const* ffiinndd__pplluuggiinn (string_view type) const; │ │ │ │ │ - void aadddd__eexxtteennssiioonn (std::shared_ptr); │ │ │ │ │ - bool iiss__sseeeedd () const; │ │ │ │ │ - bool uuppllooaadd__oonnllyy () const; │ │ │ │ │ - bool hhaass__ppiieeccee (piece_index_t i) const; │ │ │ │ │ - peer_id const& ppiidd () const; │ │ │ │ │ - bool iiss__iinntteerreessttiinngg () const; │ │ │ │ │ - bool iiss__cchhookkeedd () const; │ │ │ │ │ - bool iiss__ppeeeerr__iinntteerreesstteedd () const; │ │ │ │ │ - bool hhaass__ppeeeerr__cchhookkeedd () const; │ │ │ │ │ - void cchhookkee__tthhiiss__ppeeeerr (); │ │ │ │ │ - void mmaayybbee__uunncchhookkee__tthhiiss__ppeeeerr (); │ │ │ │ │ - void ggeett__ppeeeerr__iinnffoo (peer_info& p) const; │ │ │ │ │ - torrent_handle aassssoocciiaatteedd__ttoorrrreenntt () const; │ │ │ │ │ - _t_c_p_:_:_e_n_d_p_o_i_n_t const& rreemmoottee () const; │ │ │ │ │ - _t_c_p_:_:_e_n_d_p_o_i_n_t llooccaall__eennddppooiinntt () const; │ │ │ │ │ - bool iiss__ddiissccoonnnneeccttiinngg () const; │ │ │ │ │ - bool iiss__ccoonnnneeccttiinngg () const; │ │ │ │ │ - bool iiss__oouuttggooiinngg () const; │ │ │ │ │ - void ddiissccoonnnneecctt (error_code const& ec, operation_t op │ │ │ │ │ - , disconnect_severity_t = peer_connection_interface::normal); │ │ │ │ │ - bool iiggnnoorree__uunncchhookkee__sslloottss () const; │ │ │ │ │ - bool oonn__llooccaall__nneettwwoorrkk () const; │ │ │ │ │ - bool ffaaiilleedd () const; │ │ │ │ │ - void ppeeeerr__lloogg (peer_log_alert::direction_t direction │ │ │ │ │ - , char const* event, char const* fmt = "", ...) const TORRENT_FORMAT │ │ │ │ │ -(4,5); │ │ │ │ │ - bool sshhoouulldd__lloogg (peer_log_alert::direction_t direction) const; │ │ │ │ │ - bool ccaann__ddiissccoonnnneecctt (error_code const& ec) const; │ │ │ │ │ - bool hhaass__mmeettaaddaattaa () const; │ │ │ │ │ - bool iinn__hhaannddsshhaakkee () const; │ │ │ │ │ - void sseenndd__bbuuffffeerr (char const* begin, int size); │ │ │ │ │ - std::time_t llaasstt__sseeeenn__ccoommpplleettee () const; │ │ │ │ │ - time_point ttiimmee__ooff__llaasstt__uunncchhookkee () const; │ │ │ │ │ - bool ooppeerraattoorr!!== (peer_connection_handle const& o) const; │ │ │ │ │ - bool ooppeerraattoorr<< (peer_connection_handle const& o) const; │ │ │ │ │ - bool ooppeerraattoorr==== (peer_connection_handle const& o) const; │ │ │ │ │ - std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ bbtt__ppeeeerr__ccoonnnneeccttiioonn__hhaannddllee ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ -The _b_t___p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e provides a handle to the internal bittorrent peer │ │ │ │ │ -connection object to plugins. It's low level and may not be a stable API across │ │ │ │ │ -libtorrent versions. │ │ │ │ │ -struct bt_peer_connection_handle : peer_connection_handle │ │ │ │ │ -{ │ │ │ │ │ - explicit bbtt__ppeeeerr__ccoonnnneeccttiioonn__hhaannddllee (peer_connection_handle pc); │ │ │ │ │ - bool ssuuppppoorrtt__eexxtteennssiioonnss () const; │ │ │ │ │ - bool ppaacckkeett__ffiinniisshheedd () const; │ │ │ │ │ - bool ssuuppppoorrttss__eennccrryyppttiioonn () const; │ │ │ │ │ - void sswwiittcchh__rreeccvv__ccrryyppttoo (std::shared_ptr crypto); │ │ │ │ │ - void sswwiittcchh__sseenndd__ccrryyppttoo (std::shared_ptr crypto); │ │ │ │ │ - std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ -}; │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ pplluuggiinn ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_x_t_e_n_s_i_o_n_s_._h_p_p" │ │ │ │ │ this is the base class for a _s_e_s_s_i_o_n _p_l_u_g_i_n. One primary feature is that it is │ │ │ │ │ notified of all torrents that are added to the _s_e_s_s_i_o_n, and can add its own │ │ │ │ │ torrent_plugins. │ │ │ │ │ struct plugin │ │ │ │ │ { │ │ │ │ │ @@ -7957,19 +7105,19 @@ │ │ │ │ │ Torrent plugins are associated with a single torrent and have a number of │ │ │ │ │ functions called at certain events. Many of its functions have the ability to │ │ │ │ │ change or override the default libtorrent behavior. │ │ │ │ │ struct torrent_plugin │ │ │ │ │ { │ │ │ │ │ virtual std::shared_ptr nneeww__ccoonnnneeccttiioonn (peer_connection_handle │ │ │ │ │ const&); │ │ │ │ │ - virtual void oonn__ppiieeccee__ppaassss (piece_index_t); │ │ │ │ │ virtual void oonn__ppiieeccee__ffaaiilleedd (piece_index_t); │ │ │ │ │ + virtual void oonn__ppiieeccee__ppaassss (piece_index_t); │ │ │ │ │ virtual void ttiicckk (); │ │ │ │ │ - virtual bool oonn__rreessuummee (); │ │ │ │ │ virtual bool oonn__ppaauussee (); │ │ │ │ │ + virtual bool oonn__rreessuummee (); │ │ │ │ │ virtual void oonn__ffiilleess__cchheecckkeedd (); │ │ │ │ │ virtual void oonn__ssttaattee (torrent_status::state_t); │ │ │ │ │ virtual void oonn__aadddd__ppeeeerr (tcp::endpoint const&, │ │ │ │ │ peer_source_flags_t, add_peer_flags_t); │ │ │ │ │ │ │ │ │ │ static constexpr add_peer_flags_t ffiirrsstt__ttiimmee = 1_bit; │ │ │ │ │ static constexpr add_peer_flags_t ffiilltteerreedd = 2_bit; │ │ │ │ │ @@ -7987,29 +7135,29 @@ │ │ │ │ │ The peer_connection_handle will be valid as long as the shared_ptr is being │ │ │ │ │ held by the torrent object. So, it is generally a good idea to not keep a │ │ │ │ │ shared_ptr to your own _p_e_e_r___p_l_u_g_i_n. If you want to keep references to it, use │ │ │ │ │ weak_ptr. │ │ │ │ │ If this function throws an exception, the connection will be closed. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** oonn__ppiieeccee__ppaassss(()) oonn__ppiieeccee__ffaaiilleedd(()) ********** │ │ │ │ │ -virtual void oonn__ppiieeccee__ppaassss (piece_index_t); │ │ │ │ │ virtual void oonn__ppiieeccee__ffaaiilleedd (piece_index_t); │ │ │ │ │ +virtual void oonn__ppiieeccee__ppaassss (piece_index_t); │ │ │ │ │ These hooks are called when a piece passes the hash check or fails the hash │ │ │ │ │ check, respectively. The index is the piece index that was downloaded. It is │ │ │ │ │ possible to access the list of peers that participated in sending the piece │ │ │ │ │ through the torrent and the piece_picker. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ttiicckk(()) ********** │ │ │ │ │ virtual void ttiicckk (); │ │ │ │ │ This hook is called approximately once per second. It is a way of making it │ │ │ │ │ easy for plugins to do timed events, for sending messages or whatever. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** oonn__rreessuummee(()) oonn__ppaauussee(()) ********** │ │ │ │ │ -virtual bool oonn__rreessuummee (); │ │ │ │ │ virtual bool oonn__ppaauussee (); │ │ │ │ │ +virtual bool oonn__rreessuummee (); │ │ │ │ │ These hooks are called when the torrent is paused and resumed respectively. The │ │ │ │ │ return value indicates if the event was handled. A return value of true │ │ │ │ │ indicates that it was handled, and no other _p_l_u_g_i_n after this one will have │ │ │ │ │ this hook function called, and the standard handler will also not be invoked. │ │ │ │ │ So, returning true effectively overrides the standard behavior of pause or │ │ │ │ │ resume. │ │ │ │ │ Note that if you call pause() or resume() on the torrent from your handler it │ │ │ │ │ @@ -8055,51 +7203,51 @@ │ │ │ │ │ { │ │ │ │ │ virtual string_view ttyyppee () const; │ │ │ │ │ virtual void aadddd__hhaannddsshhaakkee (entry&); │ │ │ │ │ virtual void oonn__ddiissccoonnnneecctt (error_code const&); │ │ │ │ │ virtual void oonn__ccoonnnneecctteedd (); │ │ │ │ │ virtual bool oonn__hhaannddsshhaakkee (span); │ │ │ │ │ virtual bool oonn__eexxtteennssiioonn__hhaannddsshhaakkee (bdecode_node const&); │ │ │ │ │ - virtual bool oonn__hhaavvee__aallll (); │ │ │ │ │ virtual bool oonn__ddoonntt__hhaavvee (piece_index_t); │ │ │ │ │ - virtual bool oonn__hhaavvee__nnoonnee (); │ │ │ │ │ virtual bool oonn__bbiittffiieelldd (bitfield const& //**bbiittffiieelldd**//); │ │ │ │ │ - virtual bool oonn__cchhookkee (); │ │ │ │ │ + virtual bool oonn__hhaavvee__aallll (); │ │ │ │ │ virtual bool oonn__uunncchhookkee (); │ │ │ │ │ - virtual bool oonn__rreeqquueesstt (peer_request const&); │ │ │ │ │ - virtual bool oonn__iinntteerreesstteedd (); │ │ │ │ │ - virtual bool oonn__nnoott__iinntteerreesstteedd (); │ │ │ │ │ + virtual bool oonn__cchhookkee (); │ │ │ │ │ + virtual bool oonn__hhaavvee__nnoonnee (); │ │ │ │ │ virtual bool oonn__hhaavvee (piece_index_t); │ │ │ │ │ + virtual bool oonn__iinntteerreesstteedd (); │ │ │ │ │ virtual bool oonn__aalllloowweedd__ffaasstt (piece_index_t); │ │ │ │ │ + virtual bool oonn__nnoott__iinntteerreesstteedd (); │ │ │ │ │ + virtual bool oonn__rreeqquueesstt (peer_request const&); │ │ │ │ │ virtual bool oonn__ppiieeccee (peer_request const& //**ppiieeccee**// │ │ │ │ │ , span //**bbuuff**//); │ │ │ │ │ virtual bool oonn__rreejjeecctt (peer_request const&); │ │ │ │ │ - virtual bool oonn__ssuuggggeesstt (piece_index_t); │ │ │ │ │ virtual bool oonn__ccaanncceell (peer_request const&); │ │ │ │ │ - virtual void sseenntt__hhaavvee__aallll (); │ │ │ │ │ + virtual bool oonn__ssuuggggeesstt (piece_index_t); │ │ │ │ │ + virtual void sseenntt__rreejjeecctt__rreeqquueesstt (peer_request const&); │ │ │ │ │ virtual void sseenntt__ssuuggggeesstt (piece_index_t); │ │ │ │ │ - virtual void sseenntt__aallllooww__ffaasstt (piece_index_t); │ │ │ │ │ - virtual void sseenntt__ccaanncceell (peer_request const&); │ │ │ │ │ + virtual void sseenntt__hhaavvee__aallll (); │ │ │ │ │ + virtual void sseenntt__hhaavvee__nnoonnee (); │ │ │ │ │ virtual void sseenntt__rreeqquueesstt (peer_request const&); │ │ │ │ │ + virtual void sseenntt__ccaanncceell (peer_request const&); │ │ │ │ │ virtual void sseenntt__cchhookkee (); │ │ │ │ │ - virtual void sseenntt__rreejjeecctt__rreeqquueesstt (peer_request const&); │ │ │ │ │ - virtual void sseenntt__hhaavvee__nnoonnee (); │ │ │ │ │ - virtual void sseenntt__nnoott__iinntteerreesstteedd (); │ │ │ │ │ - virtual void sseenntt__iinntteerreesstteedd (); │ │ │ │ │ + virtual void sseenntt__aallllooww__ffaasstt (piece_index_t); │ │ │ │ │ virtual void sseenntt__ppiieeccee (peer_request const&); │ │ │ │ │ virtual void sseenntt__uunncchhookkee (); │ │ │ │ │ + virtual void sseenntt__nnoott__iinntteerreesstteedd (); │ │ │ │ │ virtual void sseenntt__hhaavvee (piece_index_t); │ │ │ │ │ + virtual void sseenntt__iinntteerreesstteedd (); │ │ │ │ │ virtual void sseenntt__ppaayyllooaadd (int //** bbyytteess **//); │ │ │ │ │ virtual bool ccaann__ddiissccoonnnneecctt (error_code const& //**eecc**//); │ │ │ │ │ virtual bool oonn__eexxtteennddeedd (int //**lleennggtthh**//, int //**mmssgg**//, │ │ │ │ │ span //**bbooddyy**//); │ │ │ │ │ virtual bool oonn__uunnkknnoowwnn__mmeessssaaggee (int //**lleennggtthh**//, int //**mmssgg**//, │ │ │ │ │ span //**bbooddyy**//); │ │ │ │ │ - virtual void oonn__ppiieeccee__ppaassss (piece_index_t); │ │ │ │ │ virtual void oonn__ppiieeccee__ffaaiilleedd (piece_index_t); │ │ │ │ │ + virtual void oonn__ppiieeccee__ppaassss (piece_index_t); │ │ │ │ │ virtual void ttiicckk (); │ │ │ │ │ virtual bool wwrriittee__rreeqquueesstt (peer_request const&); │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ttyyppee(()) ********** │ │ │ │ │ virtual string_view ttyyppee () const; │ │ │ │ │ This function is expected to return the name of the _p_l_u_g_i_n. │ │ │ │ │ @@ -8127,48 +7275,48 @@ │ │ │ │ │ ********** oonn__eexxtteennssiioonn__hhaannddsshhaakkee(()) ********** │ │ │ │ │ virtual bool oonn__eexxtteennssiioonn__hhaannddsshhaakkee (bdecode_node const&); │ │ │ │ │ called when the extension handshake from the other end is received if this │ │ │ │ │ returns false, it means that this extension isn't supported by this peer. It │ │ │ │ │ will result in this _p_e_e_r___p_l_u_g_i_n being removed from the peer_connection and │ │ │ │ │ destructed. this is not called for web seeds │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** oonn__ddoonntt__hhaavvee(()) oonn__bbiittffiieelldd(()) oonn__iinntteerreesstteedd(()) oonn__hhaavvee__aallll(()) │ │ │ │ │ -oonn__aalllloowweedd__ffaasstt(()) oonn__uunncchhookkee(()) oonn__nnoott__iinntteerreesstteedd(()) oonn__rreeqquueesstt(()) oonn__cchhookkee(()) │ │ │ │ │ -oonn__hhaavvee(()) oonn__hhaavvee__nnoonnee(()) ********** │ │ │ │ │ -virtual bool oonn__hhaavvee__aallll (); │ │ │ │ │ +********** oonn__iinntteerreesstteedd(()) oonn__cchhookkee(()) oonn__bbiittffiieelldd(()) oonn__hhaavvee__nnoonnee(()) oonn__hhaavvee__aallll(()) │ │ │ │ │ +oonn__ddoonntt__hhaavvee(()) oonn__hhaavvee(()) oonn__aalllloowweedd__ffaasstt(()) oonn__uunncchhookkee(()) oonn__nnoott__iinntteerreesstteedd(()) │ │ │ │ │ +oonn__rreeqquueesstt(()) ********** │ │ │ │ │ virtual bool oonn__ddoonntt__hhaavvee (piece_index_t); │ │ │ │ │ -virtual bool oonn__hhaavvee__nnoonnee (); │ │ │ │ │ virtual bool oonn__bbiittffiieelldd (bitfield const& //**bbiittffiieelldd**//); │ │ │ │ │ -virtual bool oonn__cchhookkee (); │ │ │ │ │ +virtual bool oonn__hhaavvee__aallll (); │ │ │ │ │ virtual bool oonn__uunncchhookkee (); │ │ │ │ │ -virtual bool oonn__rreeqquueesstt (peer_request const&); │ │ │ │ │ -virtual bool oonn__iinntteerreesstteedd (); │ │ │ │ │ -virtual bool oonn__nnoott__iinntteerreesstteedd (); │ │ │ │ │ +virtual bool oonn__cchhookkee (); │ │ │ │ │ +virtual bool oonn__hhaavvee__nnoonnee (); │ │ │ │ │ virtual bool oonn__hhaavvee (piece_index_t); │ │ │ │ │ +virtual bool oonn__iinntteerreesstteedd (); │ │ │ │ │ virtual bool oonn__aalllloowweedd__ffaasstt (piece_index_t); │ │ │ │ │ +virtual bool oonn__nnoott__iinntteerreesstteedd (); │ │ │ │ │ +virtual bool oonn__rreeqquueesstt (peer_request const&); │ │ │ │ │ returning true from any of the message handlers indicates that the _p_l_u_g_i_n has │ │ │ │ │ handled the message. it will break the _p_l_u_g_i_n chain traversing and not let │ │ │ │ │ anyone else handle the message, including the default handler. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** oonn__ppiieeccee(()) ********** │ │ │ │ │ virtual bool oonn__ppiieeccee (peer_request const& //**ppiieeccee**// │ │ │ │ │ , span //**bbuuff**//); │ │ │ │ │ This function is called when the peer connection is receiving a piece. buf │ │ │ │ │ points (non-owning pointer) to the data in an internal immutable disk buffer. │ │ │ │ │ The length of the data is specified in the length member of the piece │ │ │ │ │ parameter. returns true to indicate that the piece is handled and the rest of │ │ │ │ │ the logic should be ignored. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseenntt__uunncchhookkee(()) sseenntt__ppiieeccee(()) sseenntt__hhaavvee(()) sseenntt__nnoott__iinntteerreesstteedd(()) │ │ │ │ │ +********** sseenntt__uunncchhookkee(()) sseenntt__hhaavvee(()) sseenntt__ppiieeccee(()) sseenntt__nnoott__iinntteerreesstteedd(()) │ │ │ │ │ sseenntt__iinntteerreesstteedd(()) ********** │ │ │ │ │ -virtual void sseenntt__nnoott__iinntteerreesstteedd (); │ │ │ │ │ -virtual void sseenntt__iinntteerreesstteedd (); │ │ │ │ │ virtual void sseenntt__ppiieeccee (peer_request const&); │ │ │ │ │ virtual void sseenntt__uunncchhookkee (); │ │ │ │ │ +virtual void sseenntt__nnoott__iinntteerreesstteedd (); │ │ │ │ │ virtual void sseenntt__hhaavvee (piece_index_t); │ │ │ │ │ +virtual void sseenntt__iinntteerreesstteedd (); │ │ │ │ │ called after a choke message has been sent to the peer │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** sseenntt__ppaayyllooaadd(()) ********** │ │ │ │ │ virtual void sseenntt__ppaayyllooaadd (int //** bbyytteess **//); │ │ │ │ │ called after piece data has been sent to the peer this can be used for stats │ │ │ │ │ book keeping │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ @@ -8192,16 +7340,16 @@ │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** oonn__uunnkknnoowwnn__mmeessssaaggee(()) ********** │ │ │ │ │ virtual bool oonn__uunnkknnoowwnn__mmeessssaaggee (int //**lleennggtthh**//, int //**mmssgg**//, │ │ │ │ │ span //**bbooddyy**//); │ │ │ │ │ this is not called for web seeds │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** oonn__ppiieeccee__ppaassss(()) oonn__ppiieeccee__ffaaiilleedd(()) ********** │ │ │ │ │ -virtual void oonn__ppiieeccee__ppaassss (piece_index_t); │ │ │ │ │ virtual void oonn__ppiieeccee__ffaaiilleedd (piece_index_t); │ │ │ │ │ +virtual void oonn__ppiieeccee__ppaassss (piece_index_t); │ │ │ │ │ called when a piece that this peer participated in either fails or passes the │ │ │ │ │ hash_check │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ttiicckk(()) ********** │ │ │ │ │ virtual void ttiicckk (); │ │ │ │ │ called approximately once every second │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ @@ -8211,16 +7359,16 @@ │ │ │ │ │ original request message won't be sent and no other _p_l_u_g_i_n will have this │ │ │ │ │ function called. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ccrryyppttoo__pplluuggiinn ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_x_t_e_n_s_i_o_n_s_._h_p_p" │ │ │ │ │ struct crypto_plugin │ │ │ │ │ { │ │ │ │ │ - virtual void sseett__oouuttggooiinngg__kkeeyy (span key) = 0; │ │ │ │ │ virtual void sseett__iinnccoommiinngg__kkeeyy (span key) = 0; │ │ │ │ │ + virtual void sseett__oouuttggooiinngg__kkeeyy (span key) = 0; │ │ │ │ │ eennccrryypptt (span> //**sseenndd__vveecc**//) = 0; │ │ │ │ │ virtual std::tuple ddeeccrryypptt (span> //**rreecceeiivvee__vveecc**// │ │ │ │ │ ) = 0; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ddeeccrryypptt(()) ********** │ │ │ │ │ virtual std::tuple ddeeccrryypptt (span> //**rreecceeiivvee__vveecc**//) = │ │ │ │ │ @@ -8230,571 +7378,1031 @@ │ │ │ │ │ consume is set to the number of bytes which should be trimmed from the head of │ │ │ │ │ the buffers, default is 0 │ │ │ │ │ produce is set to the number of bytes of payload which are now ready to be sent │ │ │ │ │ to the upper layer. default is the number of bytes passed in receive_vec │ │ │ │ │ packet_size is set to the minimum number of bytes which must be read to advance │ │ │ │ │ the next step of decryption. default is 0 │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ccrreeaattee__ssmmaarrtt__bbaann__pplluuggiinn(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_x_t_e_n_s_i_o_n_s_/_s_m_a_r_t___b_a_n_._h_p_p" │ │ │ │ │ -std::shared_ptr ccrreeaattee__ssmmaarrtt__bbaann__pplluuggiinn (torrent_handle const&, │ │ │ │ │ -client_data_t); │ │ │ │ │ -constructor function for the smart ban extension. The extension keeps track of │ │ │ │ │ -the data peers have sent us for failing pieces and once the piece completes and │ │ │ │ │ -passes the hash check bans the peers that turned out to have sent corrupt data. │ │ │ │ │ -This function can either be passed in the add_torrent_params::extensions field, │ │ │ │ │ -or via _t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_a_d_d___e_x_t_e_n_s_i_o_n_(_). │ │ │ │ │ +************ ppeeeerr__ccoonnnneeccttiioonn__hhaannddllee ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ +the _p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e class provides a handle to the internal peer │ │ │ │ │ +connection object, to be used by plugins. This is a low level interface that │ │ │ │ │ +may not be stable across libtorrent versions │ │ │ │ │ +struct peer_connection_handle │ │ │ │ │ +{ │ │ │ │ │ + explicit ppeeeerr__ccoonnnneeccttiioonn__hhaannddllee (std::weak_ptr impl); │ │ │ │ │ + connection_type ttyyppee () const; │ │ │ │ │ + void aadddd__eexxtteennssiioonn (std::shared_ptr); │ │ │ │ │ + peer_plugin const* ffiinndd__pplluuggiinn (string_view type) const; │ │ │ │ │ + bool iiss__sseeeedd () const; │ │ │ │ │ + bool uuppllooaadd__oonnllyy () const; │ │ │ │ │ + bool hhaass__ppiieeccee (piece_index_t i) const; │ │ │ │ │ + peer_id const& ppiidd () const; │ │ │ │ │ + bool iiss__iinntteerreessttiinngg () const; │ │ │ │ │ + bool iiss__cchhookkeedd () const; │ │ │ │ │ + bool iiss__ppeeeerr__iinntteerreesstteedd () const; │ │ │ │ │ + bool hhaass__ppeeeerr__cchhookkeedd () const; │ │ │ │ │ + void mmaayybbee__uunncchhookkee__tthhiiss__ppeeeerr (); │ │ │ │ │ + void cchhookkee__tthhiiss__ppeeeerr (); │ │ │ │ │ + void ggeett__ppeeeerr__iinnffoo (peer_info& p) const; │ │ │ │ │ + torrent_handle aassssoocciiaatteedd__ttoorrrreenntt () const; │ │ │ │ │ + _t_c_p_:_:_e_n_d_p_o_i_n_t const& rreemmoottee () const; │ │ │ │ │ + _t_c_p_:_:_e_n_d_p_o_i_n_t llooccaall__eennddppooiinntt () const; │ │ │ │ │ + void ddiissccoonnnneecctt (error_code const& ec, operation_t op │ │ │ │ │ + , disconnect_severity_t = peer_connection_interface::normal); │ │ │ │ │ + bool iiss__oouuttggooiinngg () const; │ │ │ │ │ + bool iiss__ddiissccoonnnneeccttiinngg () const; │ │ │ │ │ + bool iiss__ccoonnnneeccttiinngg () const; │ │ │ │ │ + bool oonn__llooccaall__nneettwwoorrkk () const; │ │ │ │ │ + bool iiggnnoorree__uunncchhookkee__sslloottss () const; │ │ │ │ │ + bool ffaaiilleedd () const; │ │ │ │ │ + bool sshhoouulldd__lloogg (peer_log_alert::direction_t direction) const; │ │ │ │ │ + void ppeeeerr__lloogg (peer_log_alert::direction_t direction │ │ │ │ │ + , char const* event, char const* fmt = "", ...) const TORRENT_FORMAT │ │ │ │ │ +(4,5); │ │ │ │ │ + bool ccaann__ddiissccoonnnneecctt (error_code const& ec) const; │ │ │ │ │ + bool hhaass__mmeettaaddaattaa () const; │ │ │ │ │ + bool iinn__hhaannddsshhaakkee () const; │ │ │ │ │ + void sseenndd__bbuuffffeerr (char const* begin, int size); │ │ │ │ │ + std::time_t llaasstt__sseeeenn__ccoommpplleettee () const; │ │ │ │ │ + time_point ttiimmee__ooff__llaasstt__uunncchhookkee () const; │ │ │ │ │ + bool ooppeerraattoorr<< (peer_connection_handle const& o) const; │ │ │ │ │ + bool ooppeerraattoorr!!== (peer_connection_handle const& o) const; │ │ │ │ │ + bool ooppeerraattoorr==== (peer_connection_handle const& o) const; │ │ │ │ │ + std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ +}; │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ bbtt__ppeeeerr__ccoonnnneeccttiioonn__hhaannddllee ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ +The _b_t___p_e_e_r___c_o_n_n_e_c_t_i_o_n___h_a_n_d_l_e provides a handle to the internal bittorrent peer │ │ │ │ │ +connection object to plugins. It's low level and may not be a stable API across │ │ │ │ │ +libtorrent versions. │ │ │ │ │ +struct bt_peer_connection_handle : peer_connection_handle │ │ │ │ │ +{ │ │ │ │ │ + explicit bbtt__ppeeeerr__ccoonnnneeccttiioonn__hhaannddllee (peer_connection_handle pc); │ │ │ │ │ + bool ssuuppppoorrtt__eexxtteennssiioonnss () const; │ │ │ │ │ + bool ppaacckkeett__ffiinniisshheedd () const; │ │ │ │ │ + bool ssuuppppoorrttss__eennccrryyppttiioonn () const; │ │ │ │ │ + void sswwiittcchh__rreeccvv__ccrryyppttoo (std::shared_ptr crypto); │ │ │ │ │ + void sswwiittcchh__sseenndd__ccrryyppttoo (std::shared_ptr crypto); │ │ │ │ │ + std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ +}; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ccrreeaattee__uutt__ppeexx__pplluuggiinn(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_x_t_e_n_s_i_o_n_s_/_u_t___p_e_x_._h_p_p" │ │ │ │ │ std::shared_ptr ccrreeaattee__uutt__ppeexx__pplluuggiinn (torrent_handle const&, │ │ │ │ │ client_data_t); │ │ │ │ │ constructor function for the ut_pex extension. The ut_pex extension allows │ │ │ │ │ peers to gossip about their connections, allowing the swarm stay well connected │ │ │ │ │ and peers aware of more peers in the swarm. This extension is enabled by │ │ │ │ │ default unless explicitly disabled in the _s_e_s_s_i_o_n constructor. │ │ │ │ │ This can either be passed in the add_torrent_params::extensions field, or via │ │ │ │ │ _t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_a_d_d___e_x_t_e_n_s_i_o_n_(_). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ccrreeaattee__ssmmaarrtt__bbaann__pplluuggiinn(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_x_t_e_n_s_i_o_n_s_/_s_m_a_r_t___b_a_n_._h_p_p" │ │ │ │ │ +std::shared_ptr ccrreeaattee__ssmmaarrtt__bbaann__pplluuggiinn (torrent_handle const&, │ │ │ │ │ +client_data_t); │ │ │ │ │ +constructor function for the smart ban extension. The extension keeps track of │ │ │ │ │ +the data peers have sent us for failing pieces and once the piece completes and │ │ │ │ │ +passes the hash check bans the peers that turned out to have sent corrupt data. │ │ │ │ │ +This function can either be passed in the add_torrent_params::extensions field, │ │ │ │ │ +or via _t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_a_d_d___e_x_t_e_n_s_i_o_n_(_). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ccrreeaattee__uutt__mmeettaaddaattaa__pplluuggiinn(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_x_t_e_n_s_i_o_n_s_/_u_t___m_e_t_a_d_a_t_a_._h_p_p" │ │ │ │ │ std::shared_ptr ccrreeaattee__uutt__mmeettaaddaattaa__pplluuggiinn (torrent_handle │ │ │ │ │ const&, client_data_t); │ │ │ │ │ constructor function for the ut_metadata extension. The ut_metadata extension │ │ │ │ │ allows peers to request the .torrent file (or more specifically the info- │ │ │ │ │ dictionary of the .torrent file) from each other. This is the main building │ │ │ │ │ block in making magnet links work. This extension is enabled by default unless │ │ │ │ │ explicitly disabled in the _s_e_s_s_i_o_n constructor. │ │ │ │ │ This can either be passed in the add_torrent_params::extensions field, or via │ │ │ │ │ _t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_a_d_d___e_x_t_e_n_s_i_o_n_(_). │ │ │ │ │ +This section describes the functions and classes that are used to create │ │ │ │ │ +torrent files. It is a layered API with low level classes and higher level │ │ │ │ │ +convenience functions. A torrent is created in 4 steps: │ │ │ │ │ + 1. first the files that will be part of the torrent are determined. │ │ │ │ │ + 2. the torrent properties are set, such as tracker url, web seeds, DHT nodes │ │ │ │ │ + etc. │ │ │ │ │ + 3. Read through all the files in the torrent, SHA-1 all the data and set the │ │ │ │ │ + piece hashes. │ │ │ │ │ + 4. The torrent is bencoded into a file or buffer. │ │ │ │ │ +If there are a lot of files and or deep directory hierarchies to traverse, step │ │ │ │ │ +one can be time consuming. │ │ │ │ │ +Typically step 3 is by far the most time consuming step, since it requires to │ │ │ │ │ +read all the bytes from all the files in the torrent. │ │ │ │ │ +All of these classes and functions are declared by including libtorrent/ │ │ │ │ │ +create_torrent.hpp. │ │ │ │ │ +example: │ │ │ │ │ +file_storage fs; │ │ │ │ │ + │ │ │ │ │ +// recursively adds files in directories │ │ │ │ │ +add_files(fs, "./my_torrent"); │ │ │ │ │ + │ │ │ │ │ +create_torrent t(fs); │ │ │ │ │ +t.add_tracker("http://my.tracker.com/announce"); │ │ │ │ │ +t.set_creator("libtorrent example"); │ │ │ │ │ + │ │ │ │ │ +// reads the files and calculates the hashes │ │ │ │ │ +set_piece_hashes(t, "."); │ │ │ │ │ + │ │ │ │ │ +ofstream out("my_torrent.torrent", std::ios_base::binary); │ │ │ │ │ +std::vector buf = t.generate_buf(); │ │ │ │ │ +out.write(buf.data(), buf.size()); │ │ │ │ │ + │ │ │ │ │ +// alternatively, generate an entry and encode it directly to an ostream │ │ │ │ │ +// iterator │ │ │ │ │ +bencode(std::ostream_iterator(out), t.generate()); │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ttoorrrreenntt__ssttaattuuss ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___s_t_a_t_u_s_._h_p_p" │ │ │ │ │ -holds a snapshot of the status of a torrent, as queried by _t_o_r_r_e_n_t___h_a_n_d_l_e_:_: │ │ │ │ │ -_s_t_a_t_u_s_(_). │ │ │ │ │ -struct torrent_status │ │ │ │ │ +************ ccrreeaattee__ttoorrrreenntt ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_c_r_e_a_t_e___t_o_r_r_e_n_t_._h_p_p" │ │ │ │ │ +This class holds state for creating a torrent. After having added all │ │ │ │ │ +information to it, call _c_r_e_a_t_e___t_o_r_r_e_n_t_:_:_g_e_n_e_r_a_t_e_(_) to generate the torrent. The │ │ │ │ │ +_e_n_t_r_y that's returned can then be bencoded into a .torrent file using _b_e_n_c_o_d_e │ │ │ │ │ +_(_). │ │ │ │ │ +struct create_torrent │ │ │ │ │ { │ │ │ │ │ - bool ooppeerraattoorr==== (torrent_status const& st) const; │ │ │ │ │ - │ │ │ │ │ - enum state_t │ │ │ │ │ - { │ │ │ │ │ - checking_files, │ │ │ │ │ - downloading_metadata, │ │ │ │ │ - downloading, │ │ │ │ │ - finished, │ │ │ │ │ - seeding, │ │ │ │ │ - unused_enum_for_backwards_compatibility_allocating, │ │ │ │ │ - checking_resume_data, │ │ │ │ │ - }; │ │ │ │ │ + explicit ccrreeaattee__ttoorrrreenntt (torrent_info const& ti); │ │ │ │ │ + explicit ccrreeaattee__ttoorrrreenntt (file_storage& fs, int piece_size = 0 │ │ │ │ │ + , create_flags_t flags = {}); │ │ │ │ │ + entry ggeenneerraattee () const; │ │ │ │ │ + std::vector ggeenneerraattee__bbuuff () const; │ │ │ │ │ + file_storage const& ffiilleess () const; │ │ │ │ │ + void sseett__ccoommmmeenntt (char const* str); │ │ │ │ │ + void sseett__ccrreeaattoorr (char const* str); │ │ │ │ │ + void sseett__ccrreeaattiioonn__ddaattee (std::time_t timestamp); │ │ │ │ │ + void sseett__hhaasshh (piece_index_t index, sha1_hash const& h); │ │ │ │ │ + void sseett__hhaasshh22 (file_index_t file, piece_index_t::diff_type piece, │ │ │ │ │ +sha256_hash const& h); │ │ │ │ │ + void aadddd__uurrll__sseeeedd (string_view url); │ │ │ │ │ + void aadddd__hhttttpp__sseeeedd (string_view url); │ │ │ │ │ + void aadddd__nnooddee (std::pair node); │ │ │ │ │ + void aadddd__ttrraacckkeerr (string_view url, int tier = 0); │ │ │ │ │ + void sseett__rroooott__cceerrtt (string_view cert); │ │ │ │ │ + bool pprriivv () const; │ │ │ │ │ + void sseett__pprriivv (bool p); │ │ │ │ │ + bool iiss__vv11__oonnllyy () const; │ │ │ │ │ + bool iiss__vv22__oonnllyy () const; │ │ │ │ │ + int nnuumm__ppiieecceess () const; │ │ │ │ │ + piece_index_t eenndd__ppiieeccee () const; │ │ │ │ │ + index_range ppiieeccee__rraannggee () const noexcept; │ │ │ │ │ + file_index_t eenndd__ffiillee () const; │ │ │ │ │ + index_range ffiillee__rraannggee () const noexcept; │ │ │ │ │ + index_range ffiillee__ppiieeccee__rraannggee (file_index_t f); │ │ │ │ │ + std::int64_t ttoottaall__ssiizzee () const; │ │ │ │ │ + int ppiieeccee__ssiizzee (piece_index_t i) const; │ │ │ │ │ + int ppiieeccee__lleennggtthh () const; │ │ │ │ │ + void aadddd__ssiimmiillaarr__ttoorrrreenntt (sha1_hash ih); │ │ │ │ │ + void aadddd__ccoolllleeccttiioonn (string_view c); │ │ │ │ │ │ │ │ │ │ - torrent_handle handle; │ │ │ │ │ - error_code errc; │ │ │ │ │ - file_index_t eerrrroorr__ffiillee = torrent_status::error_file_none; │ │ │ │ │ - static constexpr file_index_t eerrrroorr__ffiillee__nnoonnee {-1}; │ │ │ │ │ - static constexpr file_index_t eerrrroorr__ffiillee__ssssll__ccttxx {-3}; │ │ │ │ │ - static constexpr file_index_t eerrrroorr__ffiillee__mmeettaaddaattaa {-4}; │ │ │ │ │ - static constexpr file_index_t eerrrroorr__ffiillee__eexxcceeppttiioonn {-5}; │ │ │ │ │ - static constexpr file_index_t eerrrroorr__ffiillee__ppaarrttffiillee {-6}; │ │ │ │ │ - std::string save_path; │ │ │ │ │ - std::string name; │ │ │ │ │ - std::weak_ptr torrent_file; │ │ │ │ │ - time_duration nneexxtt__aannnnoouunnccee = seconds{0}; │ │ │ │ │ - std::string current_tracker; │ │ │ │ │ - std::int64_t ttoottaall__ddoowwnnllooaadd = 0; │ │ │ │ │ - std::int64_t ttoottaall__uuppllooaadd = 0; │ │ │ │ │ - std::int64_t ttoottaall__ppaayyllooaadd__ddoowwnnllooaadd = 0; │ │ │ │ │ - std::int64_t ttoottaall__ppaayyllooaadd__uuppllooaadd = 0; │ │ │ │ │ - std::int64_t ttoottaall__ffaaiilleedd__bbyytteess = 0; │ │ │ │ │ - std::int64_t ttoottaall__rreedduunnddaanntt__bbyytteess = 0; │ │ │ │ │ - typed_bitfield pieces; │ │ │ │ │ - typed_bitfield verified_pieces; │ │ │ │ │ - std::int64_t ttoottaall__ddoonnee = 0; │ │ │ │ │ - std::int64_t ttoottaall = 0; │ │ │ │ │ - std::int64_t ttoottaall__wwaanntteedd__ddoonnee = 0; │ │ │ │ │ - std::int64_t ttoottaall__wwaanntteedd = 0; │ │ │ │ │ - std::int64_t aallll__ttiimmee__uuppllooaadd = 0; │ │ │ │ │ - std::int64_t aallll__ttiimmee__ddoowwnnllooaadd = 0; │ │ │ │ │ - std::time_t aaddddeedd__ttiimmee = 0; │ │ │ │ │ - std::time_t ccoommpplleetteedd__ttiimmee = 0; │ │ │ │ │ - std::time_t llaasstt__sseeeenn__ccoommpplleettee = 0; │ │ │ │ │ - storage_mode_t ssttoorraaggee__mmooddee = storage_mode_sparse; │ │ │ │ │ - float pprrooggrreessss = 0.f; │ │ │ │ │ - int pprrooggrreessss__ppppmm = 0; │ │ │ │ │ - queue_position_t qquueeuuee__ppoossiittiioonn {}; │ │ │ │ │ - int ddoowwnnllooaadd__rraattee = 0; │ │ │ │ │ - int uuppllooaadd__rraattee = 0; │ │ │ │ │ - int ddoowwnnllooaadd__ppaayyllooaadd__rraattee = 0; │ │ │ │ │ - int uuppllooaadd__ppaayyllooaadd__rraattee = 0; │ │ │ │ │ - int nnuumm__sseeeeddss = 0; │ │ │ │ │ - int nnuumm__ppeeeerrss = 0; │ │ │ │ │ - int nnuumm__ccoommpplleettee = -1; │ │ │ │ │ - int nnuumm__iinnccoommpplleettee = -1; │ │ │ │ │ - int lliisstt__sseeeeddss = 0; │ │ │ │ │ - int lliisstt__ppeeeerrss = 0; │ │ │ │ │ - int ccoonnnneecctt__ccaannddiiddaatteess = 0; │ │ │ │ │ - int nnuumm__ppiieecceess = 0; │ │ │ │ │ - int ddiissttrriibbuutteedd__ffuullll__ccooppiieess = 0; │ │ │ │ │ - int ddiissttrriibbuutteedd__ffrraaccttiioonn = 0; │ │ │ │ │ - float ddiissttrriibbuutteedd__ccooppiieess = 0.f; │ │ │ │ │ - int bblloocckk__ssiizzee = 0; │ │ │ │ │ - int nnuumm__uuppllooaaddss = 0; │ │ │ │ │ - int nnuumm__ccoonnnneeccttiioonnss = 0; │ │ │ │ │ - int uuppllooaaddss__lliimmiitt = 0; │ │ │ │ │ - int ccoonnnneeccttiioonnss__lliimmiitt = 0; │ │ │ │ │ - int uupp__bbaannddwwiiddtthh__qquueeuuee = 0; │ │ │ │ │ - int ddoowwnn__bbaannddwwiiddtthh__qquueeuuee = 0; │ │ │ │ │ - int sseeeedd__rraannkk = 0; │ │ │ │ │ - state_t ssttaattee = checking_resume_data; │ │ │ │ │ - bool nneeeedd__ssaavvee__rreessuummee = false; │ │ │ │ │ - bool iiss__sseeeeddiinngg = false; │ │ │ │ │ - bool iiss__ffiinniisshheedd = false; │ │ │ │ │ - bool hhaass__mmeettaaddaattaa = false; │ │ │ │ │ - bool hhaass__iinnccoommiinngg = false; │ │ │ │ │ - bool mmoovviinngg__ssttoorraaggee = false; │ │ │ │ │ - bool aannnnoouunncciinngg__ttoo__ttrraacckkeerrss = false; │ │ │ │ │ - bool aannnnoouunncciinngg__ttoo__llssdd = false; │ │ │ │ │ - bool aannnnoouunncciinngg__ttoo__ddhhtt = false; │ │ │ │ │ - info_hash_t info_hashes; │ │ │ │ │ - time_point last_upload; │ │ │ │ │ - time_point last_download; │ │ │ │ │ - seconds active_duration; │ │ │ │ │ - seconds finished_duration; │ │ │ │ │ - seconds seeding_duration; │ │ │ │ │ - torrent_flags_t ffllaaggss {}; │ │ │ │ │ + static constexpr create_flags_t mmooddiiffiiccaattiioonn__ttiimmee = 2_bit; │ │ │ │ │ + static constexpr create_flags_t ssyymmlliinnkkss = 3_bit; │ │ │ │ │ + static constexpr create_flags_t vv22__oonnllyy = 5_bit; │ │ │ │ │ + static constexpr create_flags_t vv11__oonnllyy = 6_bit; │ │ │ │ │ + static constexpr create_flags_t ccaannoonniiccaall__ffiilleess = 7_bit; │ │ │ │ │ + static constexpr create_flags_t nnoo__aattttrriibbuutteess = 8_bit; │ │ │ │ │ + static constexpr create_flags_t ccaannoonniiccaall__ffiilleess__nnoo__ttaaiill__ppaaddddiinngg = 9_bit; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ooppeerraattoorr====(()) ********** │ │ │ │ │ -bool ooppeerraattoorr==== (torrent_status const& st) const; │ │ │ │ │ -compares if the torrent status objects come from the same torrent. i.e. only │ │ │ │ │ -the _t_o_r_r_e_n_t___h_a_n_d_l_e field is compared. │ │ │ │ │ +********** ccrreeaattee__ttoorrrreenntt(()) ********** │ │ │ │ │ +explicit ccrreeaattee__ttoorrrreenntt (torrent_info const& ti); │ │ │ │ │ +explicit ccrreeaattee__ttoorrrreenntt (file_storage& fs, int piece_size = 0 │ │ │ │ │ + , create_flags_t flags = {}); │ │ │ │ │ +The piece_size is the size of each piece in bytes. It must be a power of 2 and │ │ │ │ │ +a minimum of 16 kiB. If a piece size of 0 is specified, a piece_size will be │ │ │ │ │ +set automatically. Piece sizes greater than 128 MiB are considered unreasonable │ │ │ │ │ +and will be rejected (with an lt::system_error exception). │ │ │ │ │ +The flags arguments specifies options for the torrent creation. It can be any │ │ │ │ │ +combination of the flags defined by create_flags_t. │ │ │ │ │ +The _f_i_l_e___s_t_o_r_a_g_e (fs) parameter defines the files, sizes and their properties │ │ │ │ │ +for the torrent to be created. Set this up first, before passing it to the │ │ │ │ │ +_c_r_e_a_t_e___t_o_r_r_e_n_t constructor. │ │ │ │ │ +The overload that takes a torrent_info object will make a verbatim copy of its │ │ │ │ │ +info dictionary (to preserve the info-hash). The copy of the info dictionary │ │ │ │ │ +will be used by _c_r_e_a_t_e___t_o_r_r_e_n_t_:_:_g_e_n_e_r_a_t_e_(_). This means that none of the member │ │ │ │ │ +functions of _c_r_e_a_t_e___t_o_r_r_e_n_t that affects the content of the info dictionary │ │ │ │ │ +(such as _s_e_t___h_a_s_h_(_)), will have any affect. Instead of using this overload, │ │ │ │ │ +consider using _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e_(_) instead. │ │ │ │ │ +Warning │ │ │ │ │ +The _f_i_l_e___s_t_o_r_a_g_e and _t_o_r_r_e_n_t___i_n_f_o objects must stay alive for the entire │ │ │ │ │ +duration of the _c_r_e_a_t_e___t_o_r_r_e_n_t object. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** eennuumm ssttaattee__tt ********** │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___s_t_a_t_u_s_._h_p_p" │ │ │ │ │ - _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ -|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The torrent has not | │ │ │ │ │ -| | |started its download| │ │ │ │ │ -|checking_files |1 |yet, and is | │ │ │ │ │ -| | |currently checking | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_x_i_s_t_i_n_g_ _f_i_l_e_s_._ _ _ _ _ | │ │ │ │ │ -| | |The torrent is | │ │ │ │ │ -| | |trying to download | │ │ │ │ │ -|downloading_metadata |2 |metadata from peers.| │ │ │ │ │ -| | |This implies the | │ │ │ │ │ -| | |ut_metadata | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_x_t_e_n_s_i_o_n_ _i_s_ _i_n_ _u_s_e_.| │ │ │ │ │ -| | |The torrent is being| │ │ │ │ │ -| | |downloaded. This is | │ │ │ │ │ -| | |the state most | │ │ │ │ │ -| | |torrents will be in | │ │ │ │ │ -|downloading |3 |most of the time. | │ │ │ │ │ -| | |The progress meter | │ │ │ │ │ -| | |will tell how much | │ │ │ │ │ -| | |of the files that | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_h_a_s_ _b_e_e_n_ _d_o_w_n_l_o_a_d_e_d_.| │ │ │ │ │ -| | |In this state the | │ │ │ │ │ -| | |torrent has finished| │ │ │ │ │ -| | |downloading but | │ │ │ │ │ -|finished |4 |still doesn't have | │ │ │ │ │ -| | |the entire torrent. | │ │ │ │ │ -| | |i.e. some pieces are| │ │ │ │ │ -| | |filtered and won't | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_g_e_t_ _d_o_w_n_l_o_a_d_e_d_._ _ _ _ _ | │ │ │ │ │ -| | |In this state the | │ │ │ │ │ -|seeding |5 |torrent has finished| │ │ │ │ │ -| | |downloading and is a| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_u_r_e_ _s_e_e_d_e_r_._ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |If the torrent was | │ │ │ │ │ -| | |started in full | │ │ │ │ │ -| | |allocation mode, | │ │ │ │ │ -|unused_enum_for_backwards_compatibility_allocating|6 |this indicates that | │ │ │ │ │ -| | |the (disk) storage | │ │ │ │ │ -| | |for the torrent is | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_l_l_o_c_a_t_e_d_._ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The torrent is | │ │ │ │ │ -| | |currently checking | │ │ │ │ │ -| | |the fast resume data| │ │ │ │ │ -| | |and comparing it to | │ │ │ │ │ -| | |the files on disk. | │ │ │ │ │ -|checking_resume_data |7 |This is typically | │ │ │ │ │ -| | |completed in a | │ │ │ │ │ -| | |fraction of a | │ │ │ │ │ -| | |second, but if you | │ │ │ │ │ -| | |add a large number | │ │ │ │ │ -| | |of torrents at once,| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_y_ _w_i_l_l_ _q_u_e_u_e_ _u_p_._ | │ │ │ │ │ +********** ggeenneerraattee(()) ggeenneerraattee__bbuuff(()) ********** │ │ │ │ │ +entry ggeenneerraattee () const; │ │ │ │ │ +std::vector ggeenneerraattee__bbuuff () const; │ │ │ │ │ +This function will generate the .torrent file as a bencode tree, or a bencoded │ │ │ │ │ +into a buffer. In order to encode the _e_n_t_r_y into a flat file, use the _b_e_n_c_o_d_e_(_) │ │ │ │ │ +function. │ │ │ │ │ +The function returning an _e_n_t_r_y may be useful to add custom entries to the │ │ │ │ │ +torrent file before bencoding it and saving it to disk. │ │ │ │ │ +Whether the resulting torrent object is v1, v2 or hybrid depends on whether any │ │ │ │ │ +of the v1_only or v2_only flags were set on the constructor. If neither were │ │ │ │ │ +set, the resulting torrent depends on which hashes were set. If both v1 and v2 │ │ │ │ │ +hashes were set, a hybrid torrent is created. │ │ │ │ │ +Any failure will cause this function to throw system_error, with an appropriate │ │ │ │ │ +error message. These are the reasons this call may throw: │ │ │ │ │ + * the file storage has 0 files │ │ │ │ │ + * the total size of the file storage is 0 bytes (i.e. it only has empty │ │ │ │ │ + files) │ │ │ │ │ + * not all v1 hashes (_s_e_t___h_a_s_h_(_)) and not all v2 hashes (_s_e_t___h_a_s_h_2_(_)) were │ │ │ │ │ + set │ │ │ │ │ + * for v2 torrents, you may not have a directory with the same name as a │ │ │ │ │ + file. If that's encountered in the file storage, _g_e_n_e_r_a_t_e_(_) fails. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - handle │ │ │ │ │ - a handle to the torrent whose status the object represents. │ │ │ │ │ +********** ffiilleess(()) ********** │ │ │ │ │ +file_storage const& ffiilleess () const; │ │ │ │ │ +returns an immutable reference to the _f_i_l_e___s_t_o_r_a_g_e used to create the torrent │ │ │ │ │ +from. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - errc │ │ │ │ │ - may be set to an error code describing why the torrent was paused, in │ │ │ │ │ - case it was paused by an error. If the torrent is not paused or if it's │ │ │ │ │ - paused but not because of an error, this error_code is not set. if the │ │ │ │ │ - error is attributed specifically to a file, error_file is set to the │ │ │ │ │ - index of that file in the .torrent file. │ │ │ │ │ +********** sseett__ccoommmmeenntt(()) ********** │ │ │ │ │ +void sseett__ccoommmmeenntt (char const* str); │ │ │ │ │ +Sets the comment for the torrent. The string str should be utf-8 encoded. The │ │ │ │ │ +comment in a torrent file is optional. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - error_file │ │ │ │ │ - if the torrent is stopped because of an disk I/O error, this field │ │ │ │ │ - contains the index of the file in the torrent that encountered the error. │ │ │ │ │ - If the error did not originate in a file in the torrent, there are a few │ │ │ │ │ - special values this can be set to: error_file_none, error_file_ssl_ctx, │ │ │ │ │ - error_file_exception, error_file_partfile or error_file_metadata; │ │ │ │ │ +********** sseett__ccrreeaattoorr(()) ********** │ │ │ │ │ +void sseett__ccrreeaattoorr (char const* str); │ │ │ │ │ +Sets the creator of the torrent. The string str should be utf-8 encoded. This │ │ │ │ │ +is optional. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - error_file_none │ │ │ │ │ - special values for error_file to describe which file or component │ │ │ │ │ - encountered the error (errc). the error did not occur on a file │ │ │ │ │ +********** sseett__ccrreeaattiioonn__ddaattee(()) ********** │ │ │ │ │ +void sseett__ccrreeaattiioonn__ddaattee (std::time_t timestamp); │ │ │ │ │ +sets the "creation time" field. Defaults to the system clock at the time of │ │ │ │ │ +construction of the _c_r_e_a_t_e___t_o_r_r_e_n_t object. The timestamp is specified in │ │ │ │ │ +seconds, posix time. If the creation date is set to 0, the "creation date" │ │ │ │ │ +field will be omitted from the generated torrent. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - error_file_ssl_ctx │ │ │ │ │ - the error occurred setting up the SSL context │ │ │ │ │ +********** sseett__hhaasshh(()) ********** │ │ │ │ │ +void sseett__hhaasshh (piece_index_t index, sha1_hash const& h); │ │ │ │ │ +This sets the SHA-1 hash for the specified piece (index). You are required to │ │ │ │ │ +set the hash for every piece in the torrent before generating it. If you have │ │ │ │ │ +the files on disk, you can use the high level convenience function to do this. │ │ │ │ │ +See _s_e_t___p_i_e_c_e___h_a_s_h_e_s_(_). A SHA-1 hash of all zeros is internally used to │ │ │ │ │ +indicate a hash that has not been set. Setting such hash will not be considered │ │ │ │ │ +set when calling _g_e_n_e_r_a_t_e_(_). This function will throw std::system_error if it │ │ │ │ │ +is called on an object constructed with the v2_only flag. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - error_file_metadata │ │ │ │ │ - the error occurred while loading the metadata for the torrent │ │ │ │ │ +********** sseett__hhaasshh22(()) ********** │ │ │ │ │ +void sseett__hhaasshh22 (file_index_t file, piece_index_t::diff_type piece, sha256_hash │ │ │ │ │ +const& h); │ │ │ │ │ +sets the bittorrent v2 hash for filefileof the piecepiece.pieceis relative to │ │ │ │ │ +the first piece of the file, starting at 0. The first piece in the file can be │ │ │ │ │ +computed with _f_i_l_e___s_t_o_r_a_g_e_:_:_f_i_l_e___i_n_d_e_x___a_t___p_i_e_c_e_(_). The hash,h, is the root of │ │ │ │ │ +the merkle tree formed by the piece's 16 kiB blocks. Note that piece sizes must │ │ │ │ │ +be powers-of-2, so all per-piece merkle trees are complete. A SHA-256 hash of │ │ │ │ │ +all zeros is internally used to indicate a hash that has not been set. Setting │ │ │ │ │ +such hash will not be considered set when calling _g_e_n_e_r_a_t_e_(_). This function │ │ │ │ │ +will throw std::system_error if it is called on an object constructed with the │ │ │ │ │ +v1_only flag. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - error_file_exception │ │ │ │ │ - there was a serious error reported in this torrent. The error code or a │ │ │ │ │ - torrent log _a_l_e_r_t may provide more information. │ │ │ │ │ +********** aadddd__hhttttpp__sseeeedd(()) aadddd__uurrll__sseeeedd(()) ********** │ │ │ │ │ +void aadddd__uurrll__sseeeedd (string_view url); │ │ │ │ │ +void aadddd__hhttttpp__sseeeedd (string_view url); │ │ │ │ │ +This adds a url seed to the torrent. You can have any number of url seeds. For │ │ │ │ │ +a single file torrent, this should be an HTTP url, pointing to a file with │ │ │ │ │ +identical content as the file of the torrent. For a multi-file torrent, it │ │ │ │ │ +should point to a directory containing a directory with the same name as this │ │ │ │ │ +torrent, and all the files of the torrent in it. │ │ │ │ │ +The second function, add_http_seed() adds an HTTP seed instead. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - error_file_partfile │ │ │ │ │ - the error occurred with the partfile │ │ │ │ │ +********** aadddd__nnooddee(()) ********** │ │ │ │ │ +void aadddd__nnooddee (std::pair node); │ │ │ │ │ +This adds a DHT node to the torrent. This especially useful if you're creating │ │ │ │ │ +a tracker less torrent. It can be used by clients to bootstrap their DHT node │ │ │ │ │ +from. The node is a hostname and a port number where there is a DHT node │ │ │ │ │ +running. You can have any number of DHT nodes in a torrent. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - save_path │ │ │ │ │ - the path to the directory where this torrent's files are stored. It's │ │ │ │ │ - typically the path as was given to _a_s_y_n_c___a_d_d___t_o_r_r_e_n_t_(_) or _a_d_d___t_o_r_r_e_n_t_(_) │ │ │ │ │ - when this torrent was started. This field is only included if the torrent │ │ │ │ │ - status is queried with torrent_handle::query_save_path. │ │ │ │ │ +********** aadddd__ttrraacckkeerr(()) ********** │ │ │ │ │ +void aadddd__ttrraacckkeerr (string_view url, int tier = 0); │ │ │ │ │ +Adds a tracker to the torrent. This is not strictly required, but most torrents │ │ │ │ │ +use a tracker as their main source of peers. The url should be an _h_t_t_p_:_/_/ or │ │ │ │ │ +udp:// url to a machine running a bittorrent tracker that accepts announces for │ │ │ │ │ +this torrent's info-hash. The tier is the fallback priority of the tracker. All │ │ │ │ │ +trackers with tier 0 are tried first (in any order). If all fail, trackers with │ │ │ │ │ +tier 1 are tried. If all of those fail, trackers with tier 2 are tried, and so │ │ │ │ │ +on. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - name │ │ │ │ │ - the name of the torrent. Typically this is derived from the .torrent │ │ │ │ │ - file. 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 _s_e_s_s_i_o_n. See session::add_torrent. This field is only included if the │ │ │ │ │ - torrent status is queried with torrent_handle::query_name. │ │ │ │ │ +********** sseett__rroooott__cceerrtt(()) ********** │ │ │ │ │ +void sseett__rroooott__cceerrtt (string_view cert); │ │ │ │ │ +This function sets an X.509 certificate in PEM format to the torrent. This │ │ │ │ │ +makes the torrent an SSSSLL ttoorrrreenntt. An SSL torrent requires that each peer has a │ │ │ │ │ +valid certificate signed by this root certificate. For SSL torrents, all peers │ │ │ │ │ +are connecting over SSL connections. For more information, see the section on │ │ │ │ │ +_s_s_l_ _t_o_r_r_e_n_t_s. │ │ │ │ │ +The string is not the path to the cert, it's the actual content of the │ │ │ │ │ +certificate. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - torrent_file │ │ │ │ │ - set to point to the torrent_info object for this torrent. It's only │ │ │ │ │ - included if the torrent status is queried with torrent_handle:: │ │ │ │ │ - query_torrent_file. │ │ │ │ │ +********** pprriivv(()) sseett__pprriivv(()) ********** │ │ │ │ │ +bool pprriivv () const; │ │ │ │ │ +void sseett__pprriivv (bool p); │ │ │ │ │ +Sets and queries the private flag of the torrent. Torrents with the private │ │ │ │ │ +flag set ask the client to not use any other sources than the tracker for │ │ │ │ │ +peers, and to not use DHT to advertise itself publicly, only the tracker. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - next_announce │ │ │ │ │ - the time until the torrent will announce itself to the tracker. │ │ │ │ │ +********** nnuumm__ppiieecceess(()) ********** │ │ │ │ │ +int nnuumm__ppiieecceess () const; │ │ │ │ │ +returns the number of pieces in the associated _f_i_l_e___s_t_o_r_a_g_e object. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - current_tracker │ │ │ │ │ - the URL of the last working tracker. If no tracker request has been │ │ │ │ │ - successful yet, it's set to an empty string. │ │ │ │ │ +********** ppiieeccee__rraannggee(()) ********** │ │ │ │ │ +index_range ppiieeccee__rraannggee () const noexcept; │ │ │ │ │ +all piece indices in the torrent to be created │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - total_download total_upload │ │ │ │ │ - the number of bytes downloaded and uploaded to all peers, accumulated, │ │ │ │ │ - tthhiiss sseessssiioonn only. The _s_e_s_s_i_o_n is considered to restart when a torrent is │ │ │ │ │ - paused and restarted again. When a torrent is paused, these _c_o_u_n_t_e_r_s are │ │ │ │ │ - reset to 0. If you want complete, persistent, stats, see all_time_upload │ │ │ │ │ - and all_time_download. │ │ │ │ │ +********** ffiillee__rraannggee(()) ********** │ │ │ │ │ +index_range ffiillee__rraannggee () const noexcept; │ │ │ │ │ +all file indices in the torrent to be created │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - total_payload_download total_payload_upload │ │ │ │ │ - counts the amount of bytes send and received this _s_e_s_s_i_o_n, but only the │ │ │ │ │ - actual payload data (i.e the interesting data), these _c_o_u_n_t_e_r_s ignore any │ │ │ │ │ - protocol overhead. The _s_e_s_s_i_o_n is considered to restart when a torrent is │ │ │ │ │ - paused and restarted again. When a torrent is paused, these _c_o_u_n_t_e_r_s are │ │ │ │ │ - reset to 0. │ │ │ │ │ +********** ffiillee__ppiieeccee__rraannggee(()) ********** │ │ │ │ │ +index_range ffiillee__ppiieeccee__rraannggee (file_index_t f); │ │ │ │ │ +for v2 and hybrid torrents only, the pieces in the specified file, specified as │ │ │ │ │ +delta from the first piece in the file. i.e. the first index is 0. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - total_failed_bytes │ │ │ │ │ - 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 since the torrent was last started. If a torrent is paused and │ │ │ │ │ - then restarted again, this counter will be reset. │ │ │ │ │ +********** ttoottaall__ssiizzee(()) ********** │ │ │ │ │ +std::int64_t ttoottaall__ssiizzee () const; │ │ │ │ │ +the total number of bytes of all files and pad files │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - total_redundant_bytes │ │ │ │ │ - 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. This │ │ │ │ │ - only counts bytes since the torrent was last started. If a torrent is │ │ │ │ │ - paused and then restarted again, this counter will be reset. │ │ │ │ │ +********** ppiieeccee__ssiizzee(()) ppiieeccee__lleennggtthh(()) ********** │ │ │ │ │ +int ppiieeccee__ssiizzee (piece_index_t i) const; │ │ │ │ │ +int ppiieeccee__lleennggtthh () const; │ │ │ │ │ +piece_length() returns the piece size of all pieces but the last one. │ │ │ │ │ +piece_size() returns the size of the specified piece. these functions are just │ │ │ │ │ +forwarding to the associated _f_i_l_e___s_t_o_r_a_g_e. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - pieces │ │ │ │ │ - a 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. │ │ │ │ │ +********** aadddd__ssiimmiillaarr__ttoorrrreenntt(()) aadddd__ccoolllleeccttiioonn(()) ********** │ │ │ │ │ +void aadddd__ssiimmiillaarr__ttoorrrreenntt (sha1_hash ih); │ │ │ │ │ +void aadddd__ccoolllleeccttiioonn (string_view c); │ │ │ │ │ +Add similar torrents (by info-hash) or collections of similar torrents. Similar │ │ │ │ │ +torrents are expected to share some files with this torrent. Torrents sharing a │ │ │ │ │ +collection name with this torrent are also expected to share files with this │ │ │ │ │ +torrent. A torrent may have more than one collection and more than one similar │ │ │ │ │ +torrents. For more information, see _B_E_P_ _3_8. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - verified_pieces │ │ │ │ │ - a bitmask representing which pieces has had their hash checked. This only │ │ │ │ │ - applies to torrents in sseeeedd mmooddee. If the torrent is not in seed mode, │ │ │ │ │ - this bitmask may be empty. │ │ │ │ │ + modification_time │ │ │ │ │ + This will include the file modification time as part of the torrent. This │ │ │ │ │ + is not enabled by default, as it might cause problems when you create a │ │ │ │ │ + torrent from separate files with the same content, hoping to yield the │ │ │ │ │ + same info-hash. If the files have different modification times, with this │ │ │ │ │ + option enabled, you would get different info-hashes for the files. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - total_done │ │ │ │ │ - the total number of bytes of the file(s) that we have. All this does not │ │ │ │ │ - necessarily has to be downloaded during this _s_e_s_s_i_o_n (that's │ │ │ │ │ - total_payload_download). │ │ │ │ │ + symlinks │ │ │ │ │ + If this flag is set, files that are symlinks get a symlink attribute set │ │ │ │ │ + on them and their data will not be included in the torrent. This is │ │ │ │ │ + useful if you need to reconstruct a file hierarchy which contains │ │ │ │ │ + symlinks. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - total │ │ │ │ │ - the total number of bytes to download for this torrent. This may be less │ │ │ │ │ - than the size of the torrent in case there are pad files. This number │ │ │ │ │ - only counts bytes that will actually be requested from peers. │ │ │ │ │ + v2_only │ │ │ │ │ + Do not generate v1 metadata. The resulting torrent will only be usable by │ │ │ │ │ + clients which support v2. This requires setting all v2 hashes, with │ │ │ │ │ + _s_e_t___h_a_s_h_2_(_) before calling _g_e_n_e_r_a_t_e_(_). Setting v1 hashes (with _s_e_t___h_a_s_h │ │ │ │ │ + _(_)) is an error with this flag set. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - total_wanted_done │ │ │ │ │ - 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 │ │ │ │ │ - have priority 0 (i.e. not wanted). Once a torrent becomes seed, any │ │ │ │ │ - piece- and file priorities are forgotten and all bytes are considered │ │ │ │ │ - "wanted". │ │ │ │ │ + v1_only │ │ │ │ │ + do not generate v2 metadata or enforce v2 alignment and padding rules │ │ │ │ │ + this is mainly for tests, not recommended for production use. This │ │ │ │ │ + requires setting all v1 hashes, with _s_e_t___h_a_s_h_(_), before calling _g_e_n_e_r_a_t_e │ │ │ │ │ + _(_). Setting v2 hashes (with _s_e_t___h_a_s_h_2_(_)) is an error with this flag set. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - total_wanted │ │ │ │ │ - The total number of bytes we want to download. This may be smaller than │ │ │ │ │ - the total torrent size in case any pieces are prioritized to 0, i.e. not │ │ │ │ │ - wanted. Once a torrent becomes seed, any piece- and file priorities are │ │ │ │ │ - forgotten and all bytes are considered "wanted". │ │ │ │ │ + canonical_files │ │ │ │ │ + This flag only affects v1-only torrents, and is only relevant together │ │ │ │ │ + with the v1_only_flag. This flag will force the same file order and │ │ │ │ │ + padding as a v2 (or hybrid) torrent would have. It has the effect of │ │ │ │ │ + ordering files and inserting pad files to align them with piece │ │ │ │ │ + boundaries. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - all_time_upload all_time_download │ │ │ │ │ - are accumulated upload and download payload byte _c_o_u_n_t_e_r_s. They are saved │ │ │ │ │ - in and restored from resume data to keep totals across sessions. │ │ │ │ │ + no_attributes │ │ │ │ │ + passing this flag to _a_d_d___f_i_l_e_s_(_) will ignore file attributes (such as │ │ │ │ │ + executable or hidden) when adding the files to the file storage. Since │ │ │ │ │ + not all filesystems and operating systems support all file attributes the │ │ │ │ │ + resulting torrent may differ depending on where it's created. If it's │ │ │ │ │ + important for torrents to be created consistently across systems, this │ │ │ │ │ + flag should be set. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - added_time │ │ │ │ │ - the posix-time when this torrent was added. i.e. what time(nullptr) │ │ │ │ │ - returned at the time. │ │ │ │ │ + canonical_files_no_tail_padding │ │ │ │ │ + this flag enforces the file layout to be canonical according to the │ │ │ │ │ + bittorrent v2 specification (just like the canonical_files flag) with the │ │ │ │ │ + one exception that tail padding is not added to the last file. This │ │ │ │ │ + behavior deviates from the specification but was the way libtorrent │ │ │ │ │ + created torrents in version up to and including 2.0.7. This flag is here │ │ │ │ │ + for backwards compatibility. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - completed_time │ │ │ │ │ - the posix-time when this torrent was finished. If the torrent is not yet │ │ │ │ │ - finished, this is 0. │ │ │ │ │ +************ aadddd__ffiilleess(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_c_r_e_a_t_e___t_o_r_r_e_n_t_._h_p_p" │ │ │ │ │ +void aadddd__ffiilleess (file_storage& fs, std::string const& file │ │ │ │ │ + , std::function p, create_flags_t flags = {}); │ │ │ │ │ +void aadddd__ffiilleess (file_storage& fs, std::string const& file │ │ │ │ │ + , create_flags_t flags = {}); │ │ │ │ │ +Adds the file specified by path to the _f_i_l_e___s_t_o_r_a_g_e object. In case path refers │ │ │ │ │ +to a directory, files will be added recursively from the directory. │ │ │ │ │ +If specified, the predicate p is called once for every file and directory that │ │ │ │ │ +is encountered. Files for which p returns true are added, and directories for │ │ │ │ │ +which p returns true are traversed. p must have the following signature: │ │ │ │ │ +bool Pred(std::string const& p); │ │ │ │ │ +The path that is passed in to the predicate is the full path of the file or │ │ │ │ │ +directory. If no predicate is specified, all files are added, and all │ │ │ │ │ +directories are traversed. │ │ │ │ │ +The ".." directory is never traversed. │ │ │ │ │ +The flags argument should be the same as the flags passed to the _c_r_e_a_t_e___t_o_r_r_e_n_t │ │ │ │ │ +constructor. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - last_seen_complete │ │ │ │ │ - the time when we, or one of our peers, last saw a complete copy of this │ │ │ │ │ - torrent. │ │ │ │ │ +************ sseett__ppiieeccee__hhaasshheess(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_c_r_e_a_t_e___t_o_r_r_e_n_t_._h_p_p" │ │ │ │ │ +void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p │ │ │ │ │ + , std::function const& f, error_code& ec); │ │ │ │ │ +inline void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p, │ │ │ │ │ +error_code& ec); │ │ │ │ │ +void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p │ │ │ │ │ + , settings_interface const& settings, disk_io_constructor_type disk_io │ │ │ │ │ + , std::function const& f, error_code& ec); │ │ │ │ │ +void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p │ │ │ │ │ + , settings_interface const& settings │ │ │ │ │ + , std::function const& f, error_code& ec); │ │ │ │ │ +inline void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p │ │ │ │ │ + , std::function const& f); │ │ │ │ │ +inline void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p); │ │ │ │ │ +inline void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p │ │ │ │ │ + , settings_interface const& settings │ │ │ │ │ + , std::function const& f); │ │ │ │ │ +This function will assume that the files added to the torrent file exists at │ │ │ │ │ +path p, read those files and hash the content and set the hashes in the │ │ │ │ │ +create_torrent object. The optional function f is called in between every hash │ │ │ │ │ +that is set. f must have the following signature: │ │ │ │ │ +void Fun(piece_index_t); │ │ │ │ │ +The overloads taking a _s_e_t_t_i_n_g_s___p_a_c_k may be used to configure the underlying │ │ │ │ │ +disk access. Such as settings_pack::aio_threads. │ │ │ │ │ +The overloads that don't take an error_code& may throw an exception in case of │ │ │ │ │ +a file error, the other overloads sets the error code to reflect the error, if │ │ │ │ │ +any. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - storage_mode │ │ │ │ │ - The allocation mode for the torrent. See _s_t_o_r_a_g_e___m_o_d_e___t for the options. │ │ │ │ │ - For more information, see _s_t_o_r_a_g_e_ _a_l_l_o_c_a_t_i_o_n. │ │ │ │ │ +************ iipp__ffiilltteerr ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_i_p___f_i_l_t_e_r_._h_p_p" │ │ │ │ │ +The ip_filter class is a set of rules that uniquely categorizes all ip │ │ │ │ │ +addresses as allowed or disallowed. The default constructor creates a single │ │ │ │ │ +rule that allows all addresses (0.0.0.0 - 255.255.255.255 for the IPv4 range, │ │ │ │ │ +and the equivalent range covering all addresses for the IPv6 range). │ │ │ │ │ +A default constructed _i_p___f_i_l_t_e_r does not filter any address. │ │ │ │ │ +struct ip_filter │ │ │ │ │ +{ │ │ │ │ │ + iipp__ffiilltteerr (ip_filter&&); │ │ │ │ │ + ~~iipp__ffiilltteerr (); │ │ │ │ │ + ip_filter& ooppeerraattoorr== (ip_filter&&); │ │ │ │ │ + ip_filter& ooppeerraattoorr== (ip_filter const&); │ │ │ │ │ + iipp__ffiilltteerr (); │ │ │ │ │ + iipp__ffiilltteerr (ip_filter const&); │ │ │ │ │ + bool eemmppttyy () const; │ │ │ │ │ + void aadddd__rruullee (address const& first, address const& last, std::uint32_t │ │ │ │ │ +flags); │ │ │ │ │ + std::uint32_t aacccceessss (address const& addr) const; │ │ │ │ │ + filter_tuple_t eexxppoorrtt__ffiilltteerr () const; │ │ │ │ │ + │ │ │ │ │ + enum access_flags │ │ │ │ │ + { │ │ │ │ │ + blocked, │ │ │ │ │ + }; │ │ │ │ │ +}; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - progress │ │ │ │ │ - a value in the range [0, 1], that represents the progress of the │ │ │ │ │ - torrent's current task. It may be checking files or downloading. │ │ │ │ │ +********** eemmppttyy(()) ********** │ │ │ │ │ +bool eemmppttyy () const; │ │ │ │ │ +returns true if the filter does not contain any rules │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - progress_ppm │ │ │ │ │ - progress parts per million (progress * 1000000) when disabling floating │ │ │ │ │ - point operations, this is the only option to query progress │ │ │ │ │ - reflects the same value as progress, but instead in a range [0, 1000000] │ │ │ │ │ - (ppm = parts per million). When floating point operations are disabled, │ │ │ │ │ - this is the only alternative to the floating point value in progress. │ │ │ │ │ +********** aadddd__rruullee(()) ********** │ │ │ │ │ +void aadddd__rruullee (address const& first, address const& last, std::uint32_t flags); │ │ │ │ │ +Adds a rule to the filter. first and last defines a range of ip addresses that │ │ │ │ │ +will be marked with the given flags. The flags can currently be 0, which means │ │ │ │ │ +allowed, or ip_filter::blocked, which means disallowed. │ │ │ │ │ +precondition: first.is_v4() == last.is_v4() && first.is_v6() == last.is_v6() │ │ │ │ │ +postcondition: access(x) == flags for every x in the range [first, last] │ │ │ │ │ +This means that in a case of overlapping ranges, the last one applied takes │ │ │ │ │ +precedence. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - queue_position │ │ │ │ │ - the position this torrent has in the download queue. If the torrent is a │ │ │ │ │ - seed or finished, this is -1. │ │ │ │ │ +********** aacccceessss(()) ********** │ │ │ │ │ +std::uint32_t aacccceessss (address const& addr) const; │ │ │ │ │ +Returns the access permissions for the given address (addr). The permission can │ │ │ │ │ +currently be 0 or ip_filter::blocked. The complexity of this operation is O(log │ │ │ │ │ +n), where n is the minimum number of non-overlapping ranges to describe the │ │ │ │ │ +current filter. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - download_rate upload_rate │ │ │ │ │ - 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. │ │ │ │ │ +********** eexxppoorrtt__ffiilltteerr(()) ********** │ │ │ │ │ +filter_tuple_t eexxppoorrtt__ffiilltteerr () const; │ │ │ │ │ +This function will return the current state of the filter in the minimum number │ │ │ │ │ +of ranges possible. They are sorted from ranges in low addresses to high │ │ │ │ │ +addresses. Each _e_n_t_r_y in the returned vector is a range with the access control │ │ │ │ │ +specified in its flags field. │ │ │ │ │ +The return value is a tuple containing two range-lists. One for IPv4 addresses │ │ │ │ │ +and one for IPv6 addresses. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - download_payload_rate upload_payload_rate │ │ │ │ │ - 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. │ │ │ │ │ +********** eennuumm aacccceessss__ffllaaggss ********** │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_i_p___f_i_l_t_e_r_._h_p_p" │ │ │ │ │ + _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ +|_nn_aa_mm_ee_ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|blocked|1 |indicates that IPs in this range should not be connected to nor| │ │ │ │ │ +|_ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_c_c_e_p_t_e_d_ _a_s_ _i_n_c_o_m_i_n_g_ _c_o_n_n_e_c_t_i_o_n_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - num_seeds │ │ │ │ │ - the number of peers that are seeding that this client is currently │ │ │ │ │ - connected to. │ │ │ │ │ +************ ppoorrtt__ffiilltteerr ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_i_p___f_i_l_t_e_r_._h_p_p" │ │ │ │ │ +the port filter maps non-overlapping port ranges to flags. This is primarily │ │ │ │ │ +used to indicate whether a range of ports should be connected to or not. The │ │ │ │ │ +default is to have the full port range (0-65535) set to flag 0. │ │ │ │ │ +class port_filter │ │ │ │ │ +{ │ │ │ │ │ + ppoorrtt__ffiilltteerr (port_filter&&); │ │ │ │ │ + port_filter& ooppeerraattoorr== (port_filter&&); │ │ │ │ │ + port_filter& ooppeerraattoorr== (port_filter const&); │ │ │ │ │ + ~~ppoorrtt__ffiilltteerr (); │ │ │ │ │ + ppoorrtt__ffiilltteerr (); │ │ │ │ │ + ppoorrtt__ffiilltteerr (port_filter const&); │ │ │ │ │ + void aadddd__rruullee (std::uint16_t first, std::uint16_t last, std::uint32_t │ │ │ │ │ +flags); │ │ │ │ │ + std::uint32_t aacccceessss (std::uint16_t port) const; │ │ │ │ │ + │ │ │ │ │ + enum access_flags │ │ │ │ │ + { │ │ │ │ │ + blocked, │ │ │ │ │ + }; │ │ │ │ │ +}; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - num_peers │ │ │ │ │ - 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 _g_e_t___p_e_e_r___i_n_f_o_(_). │ │ │ │ │ +********** aadddd__rruullee(()) ********** │ │ │ │ │ +void aadddd__rruullee (std::uint16_t first, std::uint16_t last, std::uint32_t flags); │ │ │ │ │ +set the flags for the specified port range (first, last) to flags overwriting │ │ │ │ │ +any existing rule for those ports. The range is inclusive, i.e. the port last │ │ │ │ │ +also has the flag set on it. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - num_complete num_incomplete │ │ │ │ │ - if the tracker sends scrape info in its announce reply, these fields will │ │ │ │ │ - be set to the total number of peers that have the whole file and the │ │ │ │ │ - total number of peers that are still downloading. set to -1 if the │ │ │ │ │ - tracker did not send any scrape data in its announce reply. │ │ │ │ │ +********** aacccceessss(()) ********** │ │ │ │ │ +std::uint32_t aacccceessss (std::uint16_t port) const; │ │ │ │ │ +test the specified port (port) for whether it is blocked or not. The returned │ │ │ │ │ +value is the flags set for this port. see _a_c_c_e_s_s___f_l_a_g_s. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - list_seeds list_peers │ │ │ │ │ - the number of seeds in our peer list and the total number of peers │ │ │ │ │ - (including seeds). 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. │ │ │ │ │ +********** eennuumm aacccceessss__ffllaaggss ********** │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_i_p___f_i_l_t_e_r_._h_p_p" │ │ │ │ │ + _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ +|_nn_aa_mm_ee_ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|blocked|1 |this flag indicates that destination ports in the range should| │ │ │ │ │ +|_ _ _ _ _ _ _ _|_ _ _ _ _ _|_n_o_t_ _b_e_ _c_o_n_n_e_c_t_e_d_ _t_o_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - connect_candidates │ │ │ │ │ - the number of peers in this torrent's peer list that is a candidate to be │ │ │ │ │ - connected to. i.e. It has fewer connect attempts than the max fail count, │ │ │ │ │ - it is not a seed if we are a seed, it is not banned etc. If this is 0, it │ │ │ │ │ - means we don't know of any more peers that we can try. │ │ │ │ │ +************ wweebb__sseeeedd__eennttrryy ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___i_n_f_o_._h_p_p" │ │ │ │ │ +the _w_e_b___s_e_e_d___e_n_t_r_y holds information about a web seed (also known as URL seed │ │ │ │ │ +or HTTP seed). It is essentially a URL with some state associated with it. For │ │ │ │ │ +more information, see _B_E_P_ _1_7 and _B_E_P_ _1_9. │ │ │ │ │ +struct web_seed_entry │ │ │ │ │ +{ │ │ │ │ │ + bool ooppeerraattoorr==== (web_seed_entry const& e) const; │ │ │ │ │ + bool ooppeerraattoorr<< (web_seed_entry const& e) const; │ │ │ │ │ + │ │ │ │ │ + enum type_t │ │ │ │ │ + { │ │ │ │ │ + url_seed, │ │ │ │ │ + http_seed, │ │ │ │ │ + }; │ │ │ │ │ + │ │ │ │ │ + std::string url; │ │ │ │ │ + std::string auth; │ │ │ │ │ + headers_t extra_headers; │ │ │ │ │ + std::uint8_t type; │ │ │ │ │ +}; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - num_pieces │ │ │ │ │ - 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. Note that these │ │ │ │ │ - pieces have not necessarily been written to disk yet, and there is a risk │ │ │ │ │ - the write to disk will fail. │ │ │ │ │ +********** ooppeerraattoorr====(()) ********** │ │ │ │ │ +bool ooppeerraattoorr==== (web_seed_entry const& e) const; │ │ │ │ │ +URL and type comparison │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - distributed_full_copies │ │ │ │ │ - the number of distributed copies of the torrent. Note that one copy may │ │ │ │ │ - be spread out among many peers. It tells how many copies there are │ │ │ │ │ - currently of the rarest piece(s) among the peers this client is connected │ │ │ │ │ - to. │ │ │ │ │ +********** ooppeerraattoorr<<(()) ********** │ │ │ │ │ +bool ooppeerraattoorr<< (web_seed_entry const& e) const; │ │ │ │ │ +URL and type less-than comparison │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - distributed_fraction │ │ │ │ │ - tells the share of pieces that have more copies than the rarest piece(s). │ │ │ │ │ - Divide this number by 1000 to get the fraction. │ │ │ │ │ - For example, if distributed_full_copies is 2 and distributed_fraction is │ │ │ │ │ - 500, it means 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 members are set to -1. │ │ │ │ │ +********** eennuumm ttyyppee__tt ********** │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___i_n_f_o_._h_p_p" │ │ │ │ │ + _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ +|_nn_aa_mm_ee_ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ +|_u_r_l___s_e_e_d_ _|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_h_t_t_p___s_e_e_d_|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - distributed_copies │ │ │ │ │ - the number of distributed copies of the file. note that one copy may be │ │ │ │ │ - spread out among many peers. This is a floating point representation of │ │ │ │ │ - the distributed copies. │ │ │ │ │ - the integer part tells how many copies │ │ │ │ │ - there are of the rarest piece(s) │ │ │ │ │ - the fractional part tells the fraction of pieces that │ │ │ │ │ - have more copies than the rarest piece(s). │ │ │ │ │ + url │ │ │ │ │ + The URL of the web seed │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - block_size │ │ │ │ │ - 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 │ │ │ │ │ - _g_e_t___d_o_w_n_l_o_a_d___q_u_e_u_e_(_). This is typically 16 kB, but it may be smaller, if │ │ │ │ │ - the pieces are smaller. │ │ │ │ │ + auth │ │ │ │ │ + Optional authentication. If this is set, it's passed in as HTTP basic │ │ │ │ │ + auth to the web seed. The format is: username:password. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - num_uploads │ │ │ │ │ - the number of unchoked peers in this torrent. │ │ │ │ │ + extra_headers │ │ │ │ │ + Any extra HTTP headers that need to be passed to the web seed │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - num_connections │ │ │ │ │ - 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. │ │ │ │ │ + type │ │ │ │ │ + The type of web seed (see _t_y_p_e___t) │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - uploads_limit │ │ │ │ │ - the set limit of upload slots (unchoked peers) for this torrent. │ │ │ │ │ +************ llooaadd__ttoorrrreenntt__lliimmiittss ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___i_n_f_o_._h_p_p" │ │ │ │ │ +this object holds configuration options for limits to use when loading │ │ │ │ │ +torrents. They are meant to prevent loading potentially malicious torrents that │ │ │ │ │ +cause excessive memory allocations. │ │ │ │ │ +struct load_torrent_limits │ │ │ │ │ +{ │ │ │ │ │ + int mmaaxx__bbuuffffeerr__ssiizzee = 10000000; │ │ │ │ │ + int mmaaxx__ppiieecceess = 0x200000; │ │ │ │ │ + int mmaaxx__ddeeccooddee__ddeepptthh = 100; │ │ │ │ │ + int mmaaxx__ddeeccooddee__ttookkeennss = 3000000; │ │ │ │ │ +}; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - connections_limit │ │ │ │ │ - the set limit of number of connections for this torrent. │ │ │ │ │ + max_buffer_size │ │ │ │ │ + the max size of a .torrent file to load into RAM │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - up_bandwidth_queue down_bandwidth_queue │ │ │ │ │ - the number of peers in this torrent that are waiting for more bandwidth │ │ │ │ │ - quota from the torrent rate limiter. This can determine if the rate you │ │ │ │ │ - get from this torrent is bound by the torrents limit or not. If there is │ │ │ │ │ - no limit set on this torrent, the peers might still be waiting for │ │ │ │ │ - bandwidth quota from the global limiter, but then they are counted in the │ │ │ │ │ - session_status object. │ │ │ │ │ + max_pieces │ │ │ │ │ + the max number of pieces allowed in the torrent │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - seed_rank │ │ │ │ │ - A rank of how important it is to seed the torrent, it is used to │ │ │ │ │ - determine which torrents to seed and which to queue. It is based on the │ │ │ │ │ - peer to seed ratio from the tracker scrape. For more information, see │ │ │ │ │ - _q_u_e_u_i_n_g. Higher value means more important to seed │ │ │ │ │ + max_decode_depth │ │ │ │ │ + the max recursion depth in the bdecoded structure │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - state │ │ │ │ │ - the main state the torrent is in. See _t_o_r_r_e_n_t___s_t_a_t_u_s_:_:_s_t_a_t_e___t. │ │ │ │ │ + max_decode_tokens │ │ │ │ │ + the max number of bdecode tokens │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - need_save_resume │ │ │ │ │ - true if this torrent has unsaved changes to its download state and │ │ │ │ │ - statistics since the last resume data was saved. │ │ │ │ │ +************ ttoorrrreenntt__iinnffoo ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___i_n_f_o_._h_p_p" │ │ │ │ │ +the _t_o_r_r_e_n_t___i_n_f_o class holds the information found in a .torrent file. │ │ │ │ │ +class torrent_info │ │ │ │ │ +{ │ │ │ │ │ + explicit ttoorrrreenntt__iinnffoo (span buffer, from_span_t); │ │ │ │ │ + ttoorrrreenntt__iinnffoo (std::string const& filename, error_code& ec); │ │ │ │ │ + explicit ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file); │ │ │ │ │ + ttoorrrreenntt__iinnffoo (span buffer, error_code& ec, from_span_t); │ │ │ │ │ + ttoorrrreenntt__iinnffoo (char const* buffer, int size); │ │ │ │ │ + ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file, load_torrent_limits const& │ │ │ │ │ +cfg); │ │ │ │ │ + ttoorrrreenntt__iinnffoo (torrent_info const& t); │ │ │ │ │ + explicit ttoorrrreenntt__iinnffoo (info_hash_t const& info_hash); │ │ │ │ │ + explicit ttoorrrreenntt__iinnffoo (std::string const& filename); │ │ │ │ │ + ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file, error_code& ec); │ │ │ │ │ + ttoorrrreenntt__iinnffoo (span buffer, load_torrent_limits const& cfg, │ │ │ │ │ +from_span_t); │ │ │ │ │ + ttoorrrreenntt__iinnffoo (char const* buffer, int size, error_code& ec); │ │ │ │ │ + ttoorrrreenntt__iinnffoo (std::string const& filename, load_torrent_limits const& cfg); │ │ │ │ │ + ~~ttoorrrreenntt__iinnffoo (); │ │ │ │ │ + file_storage const& oorriigg__ffiilleess () const; │ │ │ │ │ + file_storage const& ffiilleess () const; │ │ │ │ │ + void rreennaammee__ffiillee (file_index_t index, std::string const& new_filename); │ │ │ │ │ + void rreemmaapp__ffiilleess (file_storage const& f); │ │ │ │ │ + void aadddd__ttrraacckkeerr (std::string const& url, int tier = 0); │ │ │ │ │ + void cclleeaarr__ttrraacckkeerrss (); │ │ │ │ │ + void aadddd__ttrraacckkeerr (std::string const& url, int tier │ │ │ │ │ + , announce_entry::tracker_source source); │ │ │ │ │ + std::vector const& ttrraacckkeerrss () const; │ │ │ │ │ + std::vector ssiimmiillaarr__ttoorrrreennttss () const; │ │ │ │ │ + std::vector ccoolllleeccttiioonnss () const; │ │ │ │ │ + void sseett__wweebb__sseeeeddss (std::vector seeds); │ │ │ │ │ + void aadddd__uurrll__sseeeedd (std::string const& url │ │ │ │ │ + , std::string const& ext_auth = std::string() │ │ │ │ │ + , web_seed_entry::headers_t const& ext_headers = web_seed_entry:: │ │ │ │ │ +headers_t()); │ │ │ │ │ + void aadddd__hhttttpp__sseeeedd (std::string const& url │ │ │ │ │ + , std::string const& extern_auth = std::string() │ │ │ │ │ + , web_seed_entry::headers_t const& extra_headers = web_seed_entry:: │ │ │ │ │ +headers_t()); │ │ │ │ │ + std::vector const& wweebb__sseeeeddss () const; │ │ │ │ │ + std::int64_t ttoottaall__ssiizzee () const; │ │ │ │ │ + int nnuumm__ppiieecceess () const; │ │ │ │ │ + int ppiieeccee__lleennggtthh () const; │ │ │ │ │ + int bblloocckkss__ppeerr__ppiieeccee () const; │ │ │ │ │ + piece_index_t llaasstt__ppiieeccee () const; │ │ │ │ │ + index_range ppiieeccee__rraannggee () const; │ │ │ │ │ + piece_index_t eenndd__ppiieeccee () const; │ │ │ │ │ + info_hash_t const& iinnffoo__hhaasshheess () const; │ │ │ │ │ + sha1_hash iinnffoo__hhaasshh () const noexcept; │ │ │ │ │ + bool vv11 () const; │ │ │ │ │ + bool vv22 () const; │ │ │ │ │ + int nnuumm__ffiilleess () const; │ │ │ │ │ + std::vector mmaapp__bblloocckk (piece_index_t const piece │ │ │ │ │ + , std::int64_t offset, int size) const; │ │ │ │ │ + peer_request mmaapp__ffiillee (file_index_t const file, std::int64_t offset, int │ │ │ │ │ +size) const; │ │ │ │ │ + string_view ssssll__cceerrtt () const; │ │ │ │ │ + bool iiss__vvaalliidd () const; │ │ │ │ │ + bool pprriivv () const; │ │ │ │ │ + bool iiss__ii22pp () const; │ │ │ │ │ + int ppiieeccee__ssiizzee (piece_index_t index) const; │ │ │ │ │ + char const* hhaasshh__ffoorr__ppiieeccee__ppttrr (piece_index_t const index) const; │ │ │ │ │ + sha1_hash hhaasshh__ffoorr__ppiieeccee (piece_index_t index) const; │ │ │ │ │ + bool iiss__llooaaddeedd () const; │ │ │ │ │ + const std::string& nnaammee () const; │ │ │ │ │ + std::time_t ccrreeaattiioonn__ddaattee () const; │ │ │ │ │ + const std::string& ccrreeaattoorr () const; │ │ │ │ │ + const std::string& ccoommmmeenntt () const; │ │ │ │ │ + std::vector> const& nnooddeess () const; │ │ │ │ │ + void aadddd__nnooddee (std::pair const& node); │ │ │ │ │ + bool ppaarrssee__iinnffoo__sseeccttiioonn (bdecode_node const& info, error_code& ec, int │ │ │ │ │ +max_pieces); │ │ │ │ │ + bdecode_node iinnffoo (char const* key) const; │ │ │ │ │ + span iinnffoo__sseeccttiioonn () const; │ │ │ │ │ + span ppiieeccee__llaayyeerr (file_index_t) const; │ │ │ │ │ + void ffrreeee__ppiieeccee__llaayyeerrss (); │ │ │ │ │ +}; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - is_seeding │ │ │ │ │ - true if all pieces have been downloaded. │ │ │ │ │ +********** ttoorrrreenntt__iinnffoo(()) ********** │ │ │ │ │ +explicit ttoorrrreenntt__iinnffoo (span buffer, from_span_t); │ │ │ │ │ +ttoorrrreenntt__iinnffoo (std::string const& filename, error_code& ec); │ │ │ │ │ +explicit ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file); │ │ │ │ │ +ttoorrrreenntt__iinnffoo (span buffer, error_code& ec, from_span_t); │ │ │ │ │ +ttoorrrreenntt__iinnffoo (char const* buffer, int size); │ │ │ │ │ +ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file, load_torrent_limits const& │ │ │ │ │ +cfg); │ │ │ │ │ +ttoorrrreenntt__iinnffoo (torrent_info const& t); │ │ │ │ │ +explicit ttoorrrreenntt__iinnffoo (info_hash_t const& info_hash); │ │ │ │ │ +explicit ttoorrrreenntt__iinnffoo (std::string const& filename); │ │ │ │ │ +ttoorrrreenntt__iinnffoo (bdecode_node const& torrent_file, error_code& ec); │ │ │ │ │ +ttoorrrreenntt__iinnffoo (span buffer, load_torrent_limits const& cfg, │ │ │ │ │ +from_span_t); │ │ │ │ │ +ttoorrrreenntt__iinnffoo (char const* buffer, int size, error_code& ec); │ │ │ │ │ +ttoorrrreenntt__iinnffoo (std::string const& filename, load_torrent_limits const& cfg); │ │ │ │ │ +The constructor that takes an info-hash will initialize the info-hash to the │ │ │ │ │ +given value, but leave all other fields empty. 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 constructor that takes a _b_d_e_c_o_d_e___n_o_d_e will create a _t_o_r_r_e_n_t___i_n_f_o object │ │ │ │ │ +from the information found in the given torrent_file. The _b_d_e_c_o_d_e___n_o_d_e │ │ │ │ │ +represents a tree node in an bencoded file. To load an ordinary .torrent file │ │ │ │ │ +into a _b_d_e_c_o_d_e___n_o_d_e, use _b_d_e_c_o_d_e_(_). │ │ │ │ │ +The version that takes a buffer pointer and a size will decode it as a .torrent │ │ │ │ │ +file and initialize the _t_o_r_r_e_n_t___i_n_f_o object for you. │ │ │ │ │ +The version that takes a filename will simply load the torrent file and decode │ │ │ │ │ +it inside the constructor, for convenience. This might not be the most suitable │ │ │ │ │ +for applications that want to be able to report detailed errors on what might │ │ │ │ │ +go wrong. │ │ │ │ │ +There is an upper limit on the size of the torrent file that will be loaded by │ │ │ │ │ +the overload taking a filename. If it's important that even very large torrent │ │ │ │ │ +files are loaded, use one of the other overloads. │ │ │ │ │ +The overloads that takes an error_code const& never throws if an error occur, │ │ │ │ │ +they will simply set the error code to describe what went wrong and not fully │ │ │ │ │ +initialize the _t_o_r_r_e_n_t___i_n_f_o object. The overloads that do not take the extra │ │ │ │ │ +error_code parameter will always throw if an error occurs. These overloads are │ │ │ │ │ +not available when building without exception support. │ │ │ │ │ +The overload that takes a span also needs an extra parameter of type │ │ │ │ │ +from_span_t to disambiguate the std::string overload for string literals. There │ │ │ │ │ +is an object in the libtorrent namespace of this type called from_span. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - is_finished │ │ │ │ │ - true if all pieces that have a priority > 0 are downloaded. There is only │ │ │ │ │ - a distinction between finished and seeding if some pieces or files have │ │ │ │ │ - been set to priority 0, i.e. are not downloaded. │ │ │ │ │ +********** ~~ttoorrrreenntt__iinnffoo(()) ********** │ │ │ │ │ +~~ttoorrrreenntt__iinnffoo (); │ │ │ │ │ +frees all storage associated with this _t_o_r_r_e_n_t___i_n_f_o object │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - has_metadata │ │ │ │ │ - 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 be false is when the torrent was started torrent-less (i.e. with just │ │ │ │ │ - an info-hash and tracker ip, a magnet link for instance). │ │ │ │ │ +********** ffiilleess(()) oorriigg__ffiilleess(()) ********** │ │ │ │ │ +file_storage const& oorriigg__ffiilleess () const; │ │ │ │ │ +file_storage const& ffiilleess () const; │ │ │ │ │ +The _f_i_l_e___s_t_o_r_a_g_e object contains the information on how to map the pieces to │ │ │ │ │ +files. It is separated from the _t_o_r_r_e_n_t___i_n_f_o object because when creating │ │ │ │ │ +torrents a storage object needs to be created without having a torrent file. │ │ │ │ │ +When renaming files in a storage, the storage needs to make its own copy of the │ │ │ │ │ +_f_i_l_e___s_t_o_r_a_g_e in order to make its mapping differ from the one in the torrent │ │ │ │ │ +file. │ │ │ │ │ +orig_files() returns the original (unmodified) file storage for this torrent. │ │ │ │ │ +This is used by the web server connection, which needs to request files with │ │ │ │ │ +the original names. Filename may be changed using torrent_info::rename_file(). │ │ │ │ │ +For more information on the _f_i_l_e___s_t_o_r_a_g_e object, see the separate document on │ │ │ │ │ +how to create torrents. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - has_incoming │ │ │ │ │ - true if there has ever been an incoming connection attempt to this │ │ │ │ │ - torrent. │ │ │ │ │ +********** rreennaammee__ffiillee(()) ********** │ │ │ │ │ +void rreennaammee__ffiillee (file_index_t index, std::string const& new_filename); │ │ │ │ │ +Renames the file with the specified index to the new name. The new filename is │ │ │ │ │ +reflected by the file_storage returned by files() but not by the one returned │ │ │ │ │ +by orig_files(). │ │ │ │ │ +If you want to rename the base name of the torrent (for a multi file torrent), │ │ │ │ │ +you can copy the file_storage (see _f_i_l_e_s_(_) and _o_r_i_g___f_i_l_e_s_(_) ), change the name, │ │ │ │ │ +and then use _r_e_m_a_p___f_i_l_e_s_(_). │ │ │ │ │ +The new_filename can both be a relative path, in which case the file name is │ │ │ │ │ +relative to the save_path of the torrent. If the new_filename is an absolute │ │ │ │ │ +path (i.e. is_complete(new_filename) == true), then the file is detached from │ │ │ │ │ +the save_path of the torrent. In this case the file is not moved when │ │ │ │ │ +_m_o_v_e___s_t_o_r_a_g_e_(_) is invoked. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - moving_storage │ │ │ │ │ - this is true if this torrent's storage is currently being moved from one │ │ │ │ │ - location to another. This may potentially be a long operation if a large │ │ │ │ │ - file ends up being copied from one drive to another. │ │ │ │ │ +********** rreemmaapp__ffiilleess(()) ********** │ │ │ │ │ +void rreemmaapp__ffiilleess (file_storage const& f); │ │ │ │ │ +Warning │ │ │ │ │ +Usingremap_files()is discouraged as it's incompatible with v2 torrents. This is │ │ │ │ │ +because the piece boundaries and piece hashes in v2 torrents are intimately │ │ │ │ │ +tied to the file boundaries. Instead, just rename individual files, or │ │ │ │ │ +implement a custom _d_i_s_k___i_n_t_e_r_f_a_c_e to customize how to store files. │ │ │ │ │ +Remaps the file storage to a new file layout. This can be used to, for │ │ │ │ │ +instance, download all data in a torrent to a single file, or to a number of │ │ │ │ │ +fixed size sector aligned files, regardless of the number and sizes of the │ │ │ │ │ +files in the torrent. │ │ │ │ │ +The new specified file_storage must have the exact same size as the current │ │ │ │ │ +one. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - announcing_to_trackers announcing_to_lsd announcing_to_dht │ │ │ │ │ - these are set to true if this torrent is allowed to announce to the │ │ │ │ │ - respective peer source. Whether they are true or false is determined by │ │ │ │ │ - the queue logic/auto manager. Torrents that are not auto managed will │ │ │ │ │ - always be allowed to announce to all peer sources. │ │ │ │ │ +********** ttrraacckkeerrss(()) cclleeaarr__ttrraacckkeerrss(()) aadddd__ttrraacckkeerr(()) ********** │ │ │ │ │ +void aadddd__ttrraacckkeerr (std::string const& url, int tier = 0); │ │ │ │ │ +void cclleeaarr__ttrraacckkeerrss (); │ │ │ │ │ +void aadddd__ttrraacckkeerr (std::string const& url, int tier │ │ │ │ │ + , announce_entry::tracker_source source); │ │ │ │ │ +std::vector const& ttrraacckkeerrss () const; │ │ │ │ │ +add_tracker() adds a tracker to the announce-list. The tier determines the │ │ │ │ │ +order in which the trackers are to be tried. The trackers() function will │ │ │ │ │ +return a sorted vector of _a_n_n_o_u_n_c_e___e_n_t_r_y. Each announce _e_n_t_r_y 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. For more │ │ │ │ │ +information, see _a_n_n_o_u_n_c_e___e_n_t_r_y. │ │ │ │ │ +trackers() returns all entries from announce-list. │ │ │ │ │ +clear_trackers() removes all trackers from announce-list. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - info_hashes │ │ │ │ │ - the info-hash for this torrent │ │ │ │ │ +********** ccoolllleeccttiioonnss(()) ssiimmiillaarr__ttoorrrreennttss(()) ********** │ │ │ │ │ +std::vector ssiimmiillaarr__ttoorrrreennttss () const; │ │ │ │ │ +std::vector ccoolllleeccttiioonnss () const; │ │ │ │ │ +These two functions are related to _B_E_P_ _3_8 (mutable torrents). The vectors │ │ │ │ │ +returned from these correspond to the "similar" and "collections" keys in the │ │ │ │ │ +.torrent file. Both info-hashes and collections from within the info-dict and │ │ │ │ │ +from outside of it are included. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - last_upload last_download │ │ │ │ │ - the timestamps of the last time this torrent uploaded or downloaded │ │ │ │ │ - payload to any peer. │ │ │ │ │ +********** sseett__wweebb__sseeeeddss(()) wweebb__sseeeeddss(()) aadddd__hhttttpp__sseeeedd(()) aadddd__uurrll__sseeeedd(()) ********** │ │ │ │ │ +void sseett__wweebb__sseeeeddss (std::vector seeds); │ │ │ │ │ +void aadddd__uurrll__sseeeedd (std::string const& url │ │ │ │ │ + , std::string const& ext_auth = std::string() │ │ │ │ │ + , web_seed_entry::headers_t const& ext_headers = web_seed_entry:: │ │ │ │ │ +headers_t()); │ │ │ │ │ +void aadddd__hhttttpp__sseeeedd (std::string const& url │ │ │ │ │ + , std::string const& extern_auth = std::string() │ │ │ │ │ + , web_seed_entry::headers_t const& extra_headers = web_seed_entry:: │ │ │ │ │ +headers_t()); │ │ │ │ │ +std::vector const& wweebb__sseeeeddss () const; │ │ │ │ │ +web_seeds() returns all url seeds and http seeds in the torrent. Each _e_n_t_r_y is │ │ │ │ │ +a web_seed_entry and may refer to either a url seed or http seed. │ │ │ │ │ +add_url_seed() and add_http_seed() adds one url to the list of url/http seeds. │ │ │ │ │ +set_web_seeds() replaces all web seeds with the ones specified in the seeds │ │ │ │ │ +vector. │ │ │ │ │ +The extern_auth argument can be used for other authorization schemes than basic │ │ │ │ │ +HTTP authorization. If set, it will override any username and password found in │ │ │ │ │ +the URL itself. The string will be sent as the HTTP authorization header's │ │ │ │ │ +value (without specifying "Basic"). │ │ │ │ │ +The extra_headers argument defaults to an empty list, but can be used to insert │ │ │ │ │ +custom HTTP headers in the requests to a specific web seed. │ │ │ │ │ +See _h_t_t_p_ _s_e_e_d_i_n_g for more information. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - active_duration finished_duration seeding_duration │ │ │ │ │ - these are cumulative _c_o_u_n_t_e_r_s of for how long the torrent has been in │ │ │ │ │ - different states. active means not paused and added to _s_e_s_s_i_o_n. Whether │ │ │ │ │ - it has found any peers or not is not relevant. finished means all │ │ │ │ │ - selected files/pieces were downloaded and available to other peers (this │ │ │ │ │ - is always a subset of active time). seeding means all files/pieces were │ │ │ │ │ - downloaded and available to peers. Being available to peers does not │ │ │ │ │ - imply there are other peers asking for the payload. │ │ │ │ │ +********** ttoottaall__ssiizzee(()) ********** │ │ │ │ │ +std::int64_t ttoottaall__ssiizzee () const; │ │ │ │ │ +total_size() returns the total number of bytes the torrent-file represents. │ │ │ │ │ +Note that this is the number of pieces times the piece size (modulo the last │ │ │ │ │ +piece possibly being smaller). With pad files, the total size will be larger │ │ │ │ │ +than the sum of all (regular) file sizes. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - flags │ │ │ │ │ - reflects several of the torrent's flags. For more information, see │ │ │ │ │ - torrent_handle::flags(). │ │ │ │ │ +********** nnuumm__ppiieecceess(()) ppiieeccee__lleennggtthh(()) ********** │ │ │ │ │ +int nnuumm__ppiieecceess () const; │ │ │ │ │ +int ppiieeccee__lleennggtthh () const; │ │ │ │ │ +piece_length() and num_pieces() returns 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. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ppeeeerr__ccllaassss__iinnffoo ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_e_e_r___c_l_a_s_s_._h_p_p" │ │ │ │ │ -holds settings for a peer class. Used in _s_e_t___p_e_e_r___c_l_a_s_s_(_) and _g_e_t___p_e_e_r___c_l_a_s_s_(_) │ │ │ │ │ -calls. │ │ │ │ │ -struct peer_class_info │ │ │ │ │ -{ │ │ │ │ │ - bool ignore_unchoke_slots; │ │ │ │ │ - int connection_limit_factor; │ │ │ │ │ - std::string label; │ │ │ │ │ - int upload_limit; │ │ │ │ │ - int download_limit; │ │ │ │ │ - int upload_priority; │ │ │ │ │ - int download_priority; │ │ │ │ │ -}; │ │ │ │ │ +********** bblloocckkss__ppeerr__ppiieeccee(()) ********** │ │ │ │ │ +int bblloocckkss__ppeerr__ppiieeccee () const; │ │ │ │ │ +returns the number of blocks there are in the typical piece. There may be fewer │ │ │ │ │ +in the last piece) │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - ignore_unchoke_slots │ │ │ │ │ - ignore_unchoke_slots determines whether peers should always unchoke a │ │ │ │ │ - peer, regardless of the choking algorithm, or if it should honor the │ │ │ │ │ - unchoke slot limits. It's used for local peers by default. If aannyy of the │ │ │ │ │ - peer classes a peer belongs to has this set to true, that peer will be │ │ │ │ │ - unchoked at all times. │ │ │ │ │ +********** llaasstt__ppiieeccee(()) ppiieeccee__rraannggee(()) eenndd__ppiieeccee(()) ********** │ │ │ │ │ +piece_index_t llaasstt__ppiieeccee () const; │ │ │ │ │ +index_range ppiieeccee__rraannggee () const; │ │ │ │ │ +piece_index_t eenndd__ppiieeccee () const; │ │ │ │ │ +last_piece() returns the index to the last piece in the torrent and end_piece() │ │ │ │ │ +returns the index to the one-past-end piece in the torrent piece_range() │ │ │ │ │ +returns an implementation-defined type that can be used as the container in a │ │ │ │ │ +range-for loop. Where the values are the indices of all pieces in the │ │ │ │ │ +_f_i_l_e___s_t_o_r_a_g_e. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - connection_limit_factor │ │ │ │ │ - adjusts the connection limit (global and per torrent) that applies to │ │ │ │ │ - this peer class. By default, local peers are allowed to exceed the normal │ │ │ │ │ - connection limit for instance. This is specified as a percent factor. 100 │ │ │ │ │ - makes the peer class apply normally to the limit. 200 means as long as │ │ │ │ │ - there are fewer connections than twice the limit, we accept this peer. │ │ │ │ │ - This factor applies both to the global connection limit and the per- │ │ │ │ │ - torrent limit. Note that if not used carefully one peer class can │ │ │ │ │ - potentially completely starve out all other over time. │ │ │ │ │ +********** iinnffoo__hhaasshheess(()) iinnffoo__hhaasshh(()) ********** │ │ │ │ │ +info_hash_t const& iinnffoo__hhaasshheess () const; │ │ │ │ │ +sha1_hash iinnffoo__hhaasshh () const noexcept; │ │ │ │ │ +returns the info-hash of the torrent. For BitTorrent v2 support, use │ │ │ │ │ +info_hashes() to get an object that may hold both a v1 and v2 info-hash │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - label │ │ │ │ │ - not used by libtorrent. It's intended as a potentially user-facing │ │ │ │ │ - identifier of this peer class. │ │ │ │ │ +********** vv11(()) vv22(()) ********** │ │ │ │ │ +bool vv11 () const; │ │ │ │ │ +bool vv22 () const; │ │ │ │ │ +returns whether this torrent has v1 and/or v2 metadata, respectively. Hybrid │ │ │ │ │ +torrents have both. These are shortcuts for info_hashes().has_v1() and │ │ │ │ │ +info_hashes().has_v2() calls. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - upload_limit download_limit │ │ │ │ │ - transfer rates limits for the whole peer class. They are specified in │ │ │ │ │ - bytes per second and apply to the sum of all peers that are members of │ │ │ │ │ - this class. │ │ │ │ │ +********** nnuumm__ffiilleess(()) ********** │ │ │ │ │ +int nnuumm__ffiilleess () const; │ │ │ │ │ +If you need index-access to files you can use the num_files() along with the │ │ │ │ │ +file_path(), file_size()-family of functions to access files using indices. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - upload_priority download_priority │ │ │ │ │ - relative priorities used by the bandwidth allocator in the rate limiter. │ │ │ │ │ - If no rate limits are in use, the priority is not used either. Priorities │ │ │ │ │ - start at 1 (0 is not a valid priority) and may not exceed 255. │ │ │ │ │ +********** mmaapp__bblloocckk(()) ********** │ │ │ │ │ +std::vector mmaapp__bblloocckk (piece_index_t const piece │ │ │ │ │ + , std::int64_t offset, int size) 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. See _f_i_l_e___s_l_i_c_e. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** mmaapp__ffiillee(()) ********** │ │ │ │ │ +peer_request mmaapp__ffiillee (file_index_t const file, std::int64_t offset, int size) │ │ │ │ │ +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. See _p_e_e_r___r_e_q_u_e_s_t. │ │ │ │ │ +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(). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ssssll__cceerrtt(()) ********** │ │ │ │ │ +string_view ssssll__cceerrtt () const; │ │ │ │ │ +Returns the SSL root certificate for the torrent, if it is an SSL torrent. │ │ │ │ │ +Otherwise returns an empty string. The certificate is the public certificate in │ │ │ │ │ +x509 format. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** iiss__vvaalliidd(()) ********** │ │ │ │ │ +bool iiss__vvaalliidd () const; │ │ │ │ │ +returns true if this _t_o_r_r_e_n_t___i_n_f_o object has a torrent loaded. This is │ │ │ │ │ +primarily used to determine if a magnet link has had its metadata resolved yet │ │ │ │ │ +or not. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** pprriivv(()) ********** │ │ │ │ │ +bool pprriivv () const; │ │ │ │ │ +returns true if this torrent is private. i.e., the client should not advertise │ │ │ │ │ +itself on the trackerless network (the Kademlia DHT) for this torrent. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** iiss__ii22pp(()) ********** │ │ │ │ │ +bool iiss__ii22pp () const; │ │ │ │ │ +returns true if this is an i2p torrent. This is determined by whether or not it │ │ │ │ │ +has a tracker whose URL domain name ends with ".i2p". i2p torrents disable the │ │ │ │ │ +DHT and local peer discovery as well as talking to peers over anything other │ │ │ │ │ +than the i2p network. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ppiieeccee__ssiizzee(()) ********** │ │ │ │ │ +int ppiieeccee__ssiizzee (piece_index_t index) const; │ │ │ │ │ +returns the piece size of file with index. This will be the same as │ │ │ │ │ +_p_i_e_c_e___l_e_n_g_t_h_(_), except for the last piece, which may be shorter. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** hhaasshh__ffoorr__ppiieeccee__ppttrr(()) hhaasshh__ffoorr__ppiieeccee(()) ********** │ │ │ │ │ +char const* hhaasshh__ffoorr__ppiieeccee__ppttrr (piece_index_t const index) const; │ │ │ │ │ +sha1_hash hhaasshh__ffoorr__ppiieeccee (piece_index_t 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. hash_for_piece_ptr() returns a pointer to the 20 byte sha1 │ │ │ │ │ +digest for the piece. Note that the string is not 0-terminated. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** nnaammee(()) ********** │ │ │ │ │ +const std::string& nnaammee () const; │ │ │ │ │ +name() returns the name of the torrent. name contains UTF-8 encoded string. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ccrreeaattiioonn__ddaattee(()) ********** │ │ │ │ │ +std::time_t ccrreeaattiioonn__ddaattee () const; │ │ │ │ │ +creation_date() returns the creation date of the torrent as time_t (_p_o_s_i_x │ │ │ │ │ +_t_i_m_e). If there's no time stamp in the torrent file, 0 is returned. .. posix │ │ │ │ │ +time: _h_t_t_p_:_/_/_w_w_w_._o_p_e_n_g_r_o_u_p_._o_r_g_/_o_n_l_i_n_e_p_u_b_s_/_0_0_9_6_9_5_3_9_9_/_f_u_n_c_t_i_o_n_s_/_t_i_m_e_._h_t_m_l │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ccrreeaattoorr(()) ********** │ │ │ │ │ +const std::string& ccrreeaattoorr () const; │ │ │ │ │ +creator() returns the creator string in the torrent. If there is no creator │ │ │ │ │ +string it will return an empty string. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ccoommmmeenntt(()) ********** │ │ │ │ │ +const std::string& ccoommmmeenntt () const; │ │ │ │ │ +comment() returns the comment associated with the torrent. If there's no │ │ │ │ │ +comment, it will return an empty string. comment contains UTF-8 encoded string. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** nnooddeess(()) ********** │ │ │ │ │ +std::vector> const& nnooddeess () const; │ │ │ │ │ +If this torrent contains any DHT nodes, they are put in this vector in their │ │ │ │ │ +original form (host name and port number). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aadddd__nnooddee(()) ********** │ │ │ │ │ +void aadddd__nnooddee (std::pair 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. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ppaarrssee__iinnffoo__sseeccttiioonn(()) ********** │ │ │ │ │ +bool ppaarrssee__iinnffoo__sseeccttiioonn (bdecode_node const& info, error_code& ec, int │ │ │ │ │ +max_pieces); │ │ │ │ │ +populates the _t_o_r_r_e_n_t___i_n_f_o by providing just the info-dict buffer. This is used │ │ │ │ │ +when loading a torrent from a magnet link for instance, where we only have the │ │ │ │ │ +info-dict. The _b_d_e_c_o_d_e___n_o_d_e e points to a parsed info-dictionary. ec returns an │ │ │ │ │ +error code if something fails (typically if the info dictionary is malformed). │ │ │ │ │ +Themax_piecesparameter allows limiting the amount of memory dedicated to │ │ │ │ │ +loading the torrent, and fails for torrents that exceed the limit. To load │ │ │ │ │ +large torrents, this limit may also need to be raised in _s_e_t_t_i_n_g_s___p_a_c_k_:_: │ │ │ │ │ +_m_a_x___p_i_e_c_e___c_o_u_n_t and in calls to _r_e_a_d___r_e_s_u_m_e___d_a_t_a_(_). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** iinnffoo(()) ********** │ │ │ │ │ +bdecode_node iinnffoo (char const* key) const; │ │ │ │ │ +This function looks up keys from the info-dictionary of the loaded torrent │ │ │ │ │ +file. It can be used to access extension values put in the .torrent file. If │ │ │ │ │ +the specified key cannot be found, it returns nullptr. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** iinnffoo__sseeccttiioonn(()) ********** │ │ │ │ │ +span iinnffoo__sseeccttiioonn () const; │ │ │ │ │ +returns a the raw info section of the torrent file. The underlying buffer is │ │ │ │ │ +still owned by the _t_o_r_r_e_n_t___i_n_f_o object │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ppiieeccee__llaayyeerr(()) ********** │ │ │ │ │ +span ppiieeccee__llaayyeerr (file_index_t) const; │ │ │ │ │ +return the bytes of the piece layer hashes for the specified file. If the file │ │ │ │ │ +doesn't have a piece layer, an empty span is returned. The span size is │ │ │ │ │ +divisible by 32, the size of a SHA-256 hash. If the size of the file is smaller │ │ │ │ │ +than or equal to the piece size, the files "root hash" is the hash of the file │ │ │ │ │ +and is not saved separately in the "piece layers" field, but this function │ │ │ │ │ +still returns the root hash of the file in that case. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ffrreeee__ppiieeccee__llaayyeerrss(()) ********** │ │ │ │ │ +void ffrreeee__ppiieeccee__llaayyeerrss (); │ │ │ │ │ +clears the piece layers from the _t_o_r_r_e_n_t___i_n_f_o. This is done by the _s_e_s_s_i_o_n when │ │ │ │ │ +a torrent is added, to avoid storing it twice. The piece layer (or other hashes │ │ │ │ │ +part of the merkle tree) are stored in the internal torrent object. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ppeeeerr__ccllaassss__ttyyppee__ffiilltteerr ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_e_e_r___c_l_a_s_s___t_y_p_e___f_i_l_t_e_r_._h_p_p" │ │ │ │ │ peer_class_type_filter is a simple container for rules for adding and │ │ │ │ │ subtracting peer-classes from peers. It is applied aafftteerr the peer class filter │ │ │ │ │ is applied (which is based on the peer's IP address). │ │ │ │ │ struct peer_class_type_filter │ │ │ │ │ @@ -8844,470 +8452,1339 @@ │ │ │ │ │ |tcp_socket |0 |these match the socket types from socket_type.hpp| │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_h_i_f_t_e_d_ _o_n_e_ _d_o_w_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_u_t_p___s_o_c_k_e_t_ _ _ _ _ _ _|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_s_s_l___t_c_p___s_o_c_k_e_t_ _ _|_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_s_s_l___u_t_p___s_o_c_k_e_t_ _ _|_3_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_i_2_p___s_o_c_k_e_t_ _ _ _ _ _ _|_4_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_n_u_m___s_o_c_k_e_t___t_y_p_e_s_|_5_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -You have some control over _s_e_s_s_i_o_n configuration through the session:: │ │ │ │ │ -apply_settings() member function. To change one or more configuration options, │ │ │ │ │ -create a _s_e_t_t_i_n_g_s___p_a_c_k object and fill it with the settings to be set and pass │ │ │ │ │ -it in to session::apply_settings(). │ │ │ │ │ -The _s_e_t_t_i_n_g_s___p_a_c_k object is a collection of settings updates that are applied │ │ │ │ │ -to the _s_e_s_s_i_o_n when passed to session::apply_settings(). It's empty when │ │ │ │ │ -constructed. │ │ │ │ │ -You have control over proxy and authorization settings and also the user-agent │ │ │ │ │ -that will be sent to the tracker. The user-agent will also be used to identify │ │ │ │ │ -the client with other peers. │ │ │ │ │ -Each configuration option is named with an enum value inside the _s_e_t_t_i_n_g_s___p_a_c_k │ │ │ │ │ -class. These are the available settings: │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ddiisskk__oobbsseerrvveerr ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___o_b_s_e_r_v_e_r_._h_p_p" │ │ │ │ │ -struct disk_observer │ │ │ │ │ +************ ppeeeerr__ccllaassss__iinnffoo ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_p_e_e_r___c_l_a_s_s_._h_p_p" │ │ │ │ │ +holds settings for a peer class. Used in _s_e_t___p_e_e_r___c_l_a_s_s_(_) and _g_e_t___p_e_e_r___c_l_a_s_s_(_) │ │ │ │ │ +calls. │ │ │ │ │ +struct peer_class_info │ │ │ │ │ { │ │ │ │ │ - virtual void oonn__ddiisskk () = 0; │ │ │ │ │ + bool ignore_unchoke_slots; │ │ │ │ │ + int connection_limit_factor; │ │ │ │ │ + std::string label; │ │ │ │ │ + int upload_limit; │ │ │ │ │ + int download_limit; │ │ │ │ │ + int upload_priority; │ │ │ │ │ + int download_priority; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** oonn__ddiisskk(()) ********** │ │ │ │ │ -virtual void oonn__ddiisskk () = 0; │ │ │ │ │ -called when the disk cache size has dropped below the low watermark again and │ │ │ │ │ -we can resume downloading from peers │ │ │ │ │ + ignore_unchoke_slots │ │ │ │ │ + ignore_unchoke_slots determines whether peers should always unchoke a │ │ │ │ │ + peer, regardless of the choking algorithm, or if it should honor the │ │ │ │ │ + unchoke slot limits. It's used for local peers by default. If aannyy of the │ │ │ │ │ + peer classes a peer belongs to has this set to true, that peer will be │ │ │ │ │ + unchoked at all times. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ooppeenn__ffiillee__ssttaattee ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___i_n_t_e_r_f_a_c_e_._h_p_p" │ │ │ │ │ -this contains information about a file that's currently open by the libtorrent │ │ │ │ │ -disk I/O subsystem. It's associated with a single torrent. │ │ │ │ │ -struct open_file_state │ │ │ │ │ -{ │ │ │ │ │ - file_index_t file_index; │ │ │ │ │ - file_open_mode_t open_mode; │ │ │ │ │ - time_point last_use; │ │ │ │ │ -}; │ │ │ │ │ + connection_limit_factor │ │ │ │ │ + adjusts the connection limit (global and per torrent) that applies to │ │ │ │ │ + this peer class. By default, local peers are allowed to exceed the normal │ │ │ │ │ + connection limit for instance. This is specified as a percent factor. 100 │ │ │ │ │ + makes the peer class apply normally to the limit. 200 means as long as │ │ │ │ │ + there are fewer connections than twice the limit, we accept this peer. │ │ │ │ │ + This factor applies both to the global connection limit and the per- │ │ │ │ │ + torrent limit. Note that if not used carefully one peer class can │ │ │ │ │ + potentially completely starve out all other over time. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - file_index │ │ │ │ │ - the index of the file this _e_n_t_r_y refers to into the file_storage file │ │ │ │ │ - list of this torrent. This starts indexing at 0. │ │ │ │ │ + label │ │ │ │ │ + not used by libtorrent. It's intended as a potentially user-facing │ │ │ │ │ + identifier of this peer class. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - open_mode │ │ │ │ │ - open_mode is a bitmask of the file flags this file is currently opened │ │ │ │ │ - with. For possible flags, see _f_i_l_e___o_p_e_n___m_o_d_e___t. │ │ │ │ │ - Note that the read/write mode is not a bitmask. The two least significant │ │ │ │ │ - bits are used to represent the read/write mode. Those bits can be masked │ │ │ │ │ - out using the rw_mask constant. │ │ │ │ │ + upload_limit download_limit │ │ │ │ │ + transfer rates limits for the whole peer class. They are specified in │ │ │ │ │ + bytes per second and apply to the sum of all peers that are members of │ │ │ │ │ + this class. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - last_use │ │ │ │ │ - a (high precision) timestamp of when the file was last used. │ │ │ │ │ + upload_priority download_priority │ │ │ │ │ + relative priorities used by the bandwidth allocator in the rate limiter. │ │ │ │ │ + If no rate limits are in use, the priority is not used either. Priorities │ │ │ │ │ + start at 1 (0 is not a valid priority) and may not exceed 255. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ddiisskk__iinntteerrffaaccee ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___i_n_t_e_r_f_a_c_e_._h_p_p" │ │ │ │ │ -The _d_i_s_k___i_n_t_e_r_f_a_c_e is the customization point for disk I/O in libtorrent. │ │ │ │ │ -implement this interface and provide a factory function to the _s_e_s_s_i_o_n │ │ │ │ │ -constructor use custom disk I/O. All functions on the disk subsystem │ │ │ │ │ -(implementing _d_i_s_k___i_n_t_e_r_f_a_c_e) are called from within libtorrent's network │ │ │ │ │ -thread. For disk I/O to be performed in a separate thread, the disk subsystem │ │ │ │ │ -has to manage that itself. │ │ │ │ │ -Although the functions are called async_*, they do not technically hhaavvee to be │ │ │ │ │ -asynchronous, but they support being asynchronous, by expecting the result │ │ │ │ │ -passed back into a callback. The callbacks must be posted back onto the network │ │ │ │ │ -thread via the io_context object passed into the constructor. The callbacks │ │ │ │ │ -will be run in the network thread. │ │ │ │ │ -struct disk_interface │ │ │ │ │ +************ bbiittffiieelldd ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_b_i_t_f_i_e_l_d_._h_p_p" │ │ │ │ │ +The _b_i_t_f_i_e_l_d type stores any number of bits as a _b_i_t_f_i_e_l_d in a heap allocated │ │ │ │ │ +array. │ │ │ │ │ +struct bitfield │ │ │ │ │ { │ │ │ │ │ - virtual storage_holder nneeww__ttoorrrreenntt (storage_params const& p │ │ │ │ │ - , std::shared_ptr const& torrent) = 0; │ │ │ │ │ - virtual void rreemmoovvee__ttoorrrreenntt (storage_index_t) = 0; │ │ │ │ │ - virtual bool aassyynncc__wwrriittee (storage_index_t storage, peer_request const& r │ │ │ │ │ - , char const* buf, std::shared_ptr o │ │ │ │ │ - , std::function handler │ │ │ │ │ - , disk_job_flags_t flags = {}) = 0; │ │ │ │ │ - virtual void aassyynncc__rreeaadd (storage_index_t storage, peer_request const& r │ │ │ │ │ - , std::function handler │ │ │ │ │ - , disk_job_flags_t flags = {}) = 0; │ │ │ │ │ - virtual void aassyynncc__hhaasshh (storage_index_t storage, piece_index_t piece, │ │ │ │ │ -span v2 │ │ │ │ │ - , disk_job_flags_t flags │ │ │ │ │ - , std::function handler) = 0; │ │ │ │ │ - virtual void aassyynncc__hhaasshh22 (storage_index_t storage, piece_index_t piece, int │ │ │ │ │ -offset, disk_job_flags_t flags │ │ │ │ │ - , std::function handler) = 0; │ │ │ │ │ - virtual void aassyynncc__mmoovvee__ssttoorraaggee (storage_index_t storage, std::string p, │ │ │ │ │ -move_flags_t flags │ │ │ │ │ - , std::function │ │ │ │ │ -handler) = 0; │ │ │ │ │ - virtual void aassyynncc__rreelleeaassee__ffiilleess (storage_index_t storage │ │ │ │ │ - , std::function handler = std::function()) = 0; │ │ │ │ │ - virtual void aassyynncc__cchheecckk__ffiilleess (storage_index_t storage │ │ │ │ │ - , add_torrent_params const* resume_data │ │ │ │ │ - , aux::vector links │ │ │ │ │ - , std::function handler) = 0; │ │ │ │ │ - virtual void aassyynncc__ssttoopp__ttoorrrreenntt (storage_index_t storage │ │ │ │ │ - , std::function handler = std::function()) = 0; │ │ │ │ │ - virtual void aassyynncc__rreennaammee__ffiillee (storage_index_t storage │ │ │ │ │ - , file_index_t index, std::string name │ │ │ │ │ - , std::function handler) = 0; │ │ │ │ │ - virtual void aassyynncc__ddeelleettee__ffiilleess (storage_index_t storage, remove_flags_t │ │ │ │ │ -options │ │ │ │ │ - , std::function handler) = 0; │ │ │ │ │ - virtual void aassyynncc__sseett__ffiillee__pprriioorriittyy (storage_index_t storage │ │ │ │ │ - , aux::vector prio │ │ │ │ │ - , std::function)> handler) = 0; │ │ │ │ │ - virtual void aassyynncc__cclleeaarr__ppiieeccee (storage_index_t storage, piece_index_t index │ │ │ │ │ - , std::function handler) = 0; │ │ │ │ │ - virtual void uuppddaattee__ssttaattss__ccoouunntteerrss (counters& c) const = 0; │ │ │ │ │ - virtual std::vector ggeett__ssttaattuuss (storage_index_t) const = 0; │ │ │ │ │ - virtual void aabboorrtt (bool wait) = 0; │ │ │ │ │ - virtual void ssuubbmmiitt__jjoobbss () = 0; │ │ │ │ │ - virtual void sseettttiinnggss__uuppddaatteedd () = 0; │ │ │ │ │ - │ │ │ │ │ - static constexpr disk_job_flags_t ffoorrccee__ccooppyy = 0_bit; │ │ │ │ │ - static constexpr disk_job_flags_t sseeqquueennttiiaall__aacccceessss = 3_bit; │ │ │ │ │ - static constexpr disk_job_flags_t vvoollaattiillee__rreeaadd = 4_bit; │ │ │ │ │ - static constexpr disk_job_flags_t vv11__hhaasshh = 5_bit; │ │ │ │ │ - static constexpr disk_job_flags_t fflluusshh__ppiieeccee = 7_bit; │ │ │ │ │ + bbiittffiieelldd (bitfield&& rhs) noexcept = default; │ │ │ │ │ + bbiittffiieelldd (char const* b, int bits); │ │ │ │ │ + explicit bbiittffiieelldd (int bits); │ │ │ │ │ + bbiittffiieelldd () noexcept = default; │ │ │ │ │ + bbiittffiieelldd (int bits, bool val); │ │ │ │ │ + bbiittffiieelldd (bitfield const& rhs); │ │ │ │ │ + void aassssiiggnn (char const* b, int const bits); │ │ │ │ │ + bool ooppeerraattoorr[[]] (int index) const noexcept; │ │ │ │ │ + bool ggeett__bbiitt (int index) const noexcept; │ │ │ │ │ + void sseett__bbiitt (int index) noexcept; │ │ │ │ │ + void cclleeaarr__bbiitt (int index) noexcept; │ │ │ │ │ + bool aallll__sseett () const noexcept; │ │ │ │ │ + bool nnoonnee__sseett () const noexcept; │ │ │ │ │ + int ssiizzee () const noexcept; │ │ │ │ │ + int nnuumm__wwoorrddss () const noexcept; │ │ │ │ │ + int nnuumm__bbyytteess () const noexcept; │ │ │ │ │ + bool eemmppttyy () const noexcept; │ │ │ │ │ + char const* ddaattaa () const noexcept; │ │ │ │ │ + char* ddaattaa () noexcept; │ │ │ │ │ + void sswwaapp (bitfield& rhs) noexcept; │ │ │ │ │ + int ccoouunntt () const noexcept; │ │ │ │ │ + int ffiinndd__ffiirrsstt__sseett () const noexcept; │ │ │ │ │ + int ffiinndd__llaasstt__cclleeaarr () const noexcept; │ │ │ │ │ + bool ooppeerraattoorr==== (lt::bitfield const& rhs) const; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** nneeww__ttoorrrreenntt(()) ********** │ │ │ │ │ -virtual storage_holder nneeww__ttoorrrreenntt (storage_params const& p │ │ │ │ │ - , std::shared_ptr const& torrent) = 0; │ │ │ │ │ -this is called when a new torrent is added. The shared_ptr can be used to hold │ │ │ │ │ -the internal torrent object alive as long as there are outstanding disk │ │ │ │ │ -operations on the storage. The returned _s_t_o_r_a_g_e___h_o_l_d_e_r is an owning reference │ │ │ │ │ -to the underlying storage that was just created. It is fundamentally a │ │ │ │ │ -storage_index_t │ │ │ │ │ +********** bbiittffiieelldd(()) ********** │ │ │ │ │ +bbiittffiieelldd (bitfield&& rhs) noexcept = default; │ │ │ │ │ +bbiittffiieelldd (char const* b, int bits); │ │ │ │ │ +explicit bbiittffiieelldd (int bits); │ │ │ │ │ +bbiittffiieelldd () noexcept = default; │ │ │ │ │ +bbiittffiieelldd (int bits, bool val); │ │ │ │ │ +bbiittffiieelldd (bitfield const& rhs); │ │ │ │ │ +constructs a new _b_i_t_f_i_e_l_d. The default constructor creates an empty _b_i_t_f_i_e_l_d. │ │ │ │ │ +bits is the size of the _b_i_t_f_i_e_l_d (specified in bits). val is the value to │ │ │ │ │ +initialize the bits to. If not specified all bits are initialized to 0. │ │ │ │ │ +The constructor taking a pointer b and bits copies a _b_i_t_f_i_e_l_d from the │ │ │ │ │ +specified buffer, and bits number of bits (rounded up to the nearest byte │ │ │ │ │ +boundary). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** rreemmoovvee__ttoorrrreenntt(()) ********** │ │ │ │ │ -virtual void rreemmoovvee__ttoorrrreenntt (storage_index_t) = 0; │ │ │ │ │ -remove the storage with the specified index. This is not expected to delete any │ │ │ │ │ -files from disk, just to clean up any resources associated with the specified │ │ │ │ │ -storage. │ │ │ │ │ +********** aassssiiggnn(()) ********** │ │ │ │ │ +void aassssiiggnn (char const* b, int const bits); │ │ │ │ │ +copy _b_i_t_f_i_e_l_d from buffer b of bits number of bits, rounded up to the nearest │ │ │ │ │ +byte boundary. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aassyynncc__wwrriittee(()) aassyynncc__rreeaadd(()) ********** │ │ │ │ │ -virtual bool aassyynncc__wwrriittee (storage_index_t storage, peer_request const& r │ │ │ │ │ - , char const* buf, std::shared_ptr o │ │ │ │ │ - , std::function handler │ │ │ │ │ - , disk_job_flags_t flags = {}) = 0; │ │ │ │ │ -virtual void aassyynncc__rreeaadd (storage_index_t storage, peer_request const& r │ │ │ │ │ - , std::function handler │ │ │ │ │ - , disk_job_flags_t flags = {}) = 0; │ │ │ │ │ -perform a read or write operation from/to the specified storage index and the │ │ │ │ │ -specified request. When the operation completes, call handler possibly with a │ │ │ │ │ -_d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r, holding the buffer with the result. Flags may be set to │ │ │ │ │ -affect the read operation. See disk_job_flags_t. │ │ │ │ │ -The _d_i_s_k___o_b_s_e_r_v_e_r is a callback to indicate that the store buffer/disk write │ │ │ │ │ -queue is below the watermark to let peers start writing buffers to disk again. │ │ │ │ │ -When async_write() returns true, indicating the write queue is full, the peer │ │ │ │ │ -will stop further writes and wait for the passed-in disk_observer to be │ │ │ │ │ -notified before resuming. │ │ │ │ │ -Note that for async_read, the _p_e_e_r___r_e_q_u_e_s_t (r) is not necessarily aligned to │ │ │ │ │ -blocks (but it is most of the time). However, all writes (passed to │ │ │ │ │ -async_write) are guaranteed to be block aligned. │ │ │ │ │ +********** ooppeerraattoorr[[]](()) ggeett__bbiitt(()) ********** │ │ │ │ │ +bool ooppeerraattoorr[[]] (int index) const noexcept; │ │ │ │ │ +bool ggeett__bbiitt (int index) const noexcept; │ │ │ │ │ +query bit at index. Returns true if bit is 1, otherwise false. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aassyynncc__hhaasshh(()) ********** │ │ │ │ │ -virtual void aassyynncc__hhaasshh (storage_index_t storage, piece_index_t piece, │ │ │ │ │ -span v2 │ │ │ │ │ - , disk_job_flags_t flags │ │ │ │ │ - , std::function handler) = 0; │ │ │ │ │ -Compute hash(es) for the specified piece. Unless the v1_hash flag is set (in │ │ │ │ │ -flags), the SHA-1 hash of the whole piece does not need to be computed. │ │ │ │ │ -Thev2span is optional and can be empty, which means v2 hashes should not be │ │ │ │ │ -computed. If v2 is non-empty it must be at least large enough to hold all v2 │ │ │ │ │ -blocks in the piece, and this function will fill in the span with the SHA-256 │ │ │ │ │ -block hashes of the piece. │ │ │ │ │ +********** sseett__bbiitt(()) cclleeaarr__bbiitt(()) ********** │ │ │ │ │ +void sseett__bbiitt (int index) noexcept; │ │ │ │ │ +void cclleeaarr__bbiitt (int index) noexcept; │ │ │ │ │ +set bit at index to 0 (clear_bit) or 1 (set_bit). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aassyynncc__hhaasshh22(()) ********** │ │ │ │ │ -virtual void aassyynncc__hhaasshh22 (storage_index_t storage, piece_index_t piece, int │ │ │ │ │ -offset, disk_job_flags_t flags │ │ │ │ │ - , std::function handler) = 0; │ │ │ │ │ -computes the v2 hash (SHA-256) of a single block. The block at offset in piece │ │ │ │ │ -piece. │ │ │ │ │ +********** aallll__sseett(()) ********** │ │ │ │ │ +bool aallll__sseett () const noexcept; │ │ │ │ │ +returns true if all bits in the _b_i_t_f_i_e_l_d are set │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aassyynncc__mmoovvee__ssttoorraaggee(()) ********** │ │ │ │ │ -virtual void aassyynncc__mmoovvee__ssttoorraaggee (storage_index_t storage, std::string p, │ │ │ │ │ -move_flags_t flags │ │ │ │ │ - , std::function │ │ │ │ │ -handler) = 0; │ │ │ │ │ -called to request the files for the specified storage/torrent be moved to a new │ │ │ │ │ -location. It is the disk I/O object's responsibility to synchronize this with │ │ │ │ │ -any currently outstanding disk operations to the storage. Whether files are │ │ │ │ │ -replaced at the destination path or not is controlled by flags (see │ │ │ │ │ -_m_o_v_e___f_l_a_g_s___t). │ │ │ │ │ +********** nnoonnee__sseett(()) ********** │ │ │ │ │ +bool nnoonnee__sseett () const noexcept; │ │ │ │ │ +returns true if no bit in the _b_i_t_f_i_e_l_d is set │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aassyynncc__rreelleeaassee__ffiilleess(()) ********** │ │ │ │ │ -virtual void aassyynncc__rreelleeaassee__ffiilleess (storage_index_t storage │ │ │ │ │ - , std::function handler = std::function()) = 0; │ │ │ │ │ -This is called on disk I/O objects to request they close all open files for the │ │ │ │ │ -specified storage/torrent. If file handles are not pooled/cached, it can be a │ │ │ │ │ -no-op. For truly asynchronous disk I/O, this should provide at least one point │ │ │ │ │ -in time when all files are closed. It is possible that later asynchronous │ │ │ │ │ -operations will re-open some of the files, by the time this completion handler │ │ │ │ │ -is called, that's fine. │ │ │ │ │ +********** ssiizzee(()) ********** │ │ │ │ │ +int ssiizzee () const noexcept; │ │ │ │ │ +returns the size of the _b_i_t_f_i_e_l_d in bits. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aassyynncc__cchheecckk__ffiilleess(()) ********** │ │ │ │ │ -virtual void aassyynncc__cchheecckk__ffiilleess (storage_index_t storage │ │ │ │ │ - , add_torrent_params const* resume_data │ │ │ │ │ - , aux::vector links │ │ │ │ │ - , std::function handler) = 0; │ │ │ │ │ -this is called when torrents are added to validate their resume data against │ │ │ │ │ -the files on disk. This function is expected to do a few things: │ │ │ │ │ -if links is non-empty, it contains a string for each file in the torrent. The │ │ │ │ │ -string being a path to an existing identical file. The default behavior is to │ │ │ │ │ -create hard links of those files into the storage of the new torrent (specified │ │ │ │ │ -by storage). An empty string indicates that there is no known identical file. │ │ │ │ │ -This is part of the "mutable torrent" feature, where files can be reused from │ │ │ │ │ -other torrents. │ │ │ │ │ -The resume_data points the resume data passed in by the client. │ │ │ │ │ -If the resume_data->flags field has the seed_mode flag set, all files/pieces │ │ │ │ │ -are expected to be on disk already. This should be verified. Not just the │ │ │ │ │ -existence of the file, but also that it has the correct size. │ │ │ │ │ -Any file with a piece set in the resume_data->have_pieces bitmask should exist │ │ │ │ │ -on disk, this should be verified. Pad files and files with zero priority may be │ │ │ │ │ -skipped. │ │ │ │ │ +********** nnuumm__wwoorrddss(()) ********** │ │ │ │ │ +int nnuumm__wwoorrddss () const noexcept; │ │ │ │ │ +returns the number of 32 bit words are needed to represent all bits in this │ │ │ │ │ +_b_i_t_f_i_e_l_d. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aassyynncc__ssttoopp__ttoorrrreenntt(()) ********** │ │ │ │ │ -virtual void aassyynncc__ssttoopp__ttoorrrreenntt (storage_index_t storage │ │ │ │ │ - , std::function handler = std::function()) = 0; │ │ │ │ │ -This is called when a torrent is stopped. It gives the disk I/O object an │ │ │ │ │ -opportunity to flush any data to disk that's currently kept cached. This │ │ │ │ │ -function should at least do the same thing as _a_s_y_n_c___r_e_l_e_a_s_e___f_i_l_e_s_(_). │ │ │ │ │ +********** nnuumm__bbyytteess(()) ********** │ │ │ │ │ +int nnuumm__bbyytteess () const noexcept; │ │ │ │ │ +returns the number of bytes needed to represent all bits in this _b_i_t_f_i_e_l_d │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aassyynncc__rreennaammee__ffiillee(()) ********** │ │ │ │ │ -virtual void aassyynncc__rreennaammee__ffiillee (storage_index_t storage │ │ │ │ │ - , file_index_t index, std::string name │ │ │ │ │ - , std::function handler) = 0; │ │ │ │ │ -This function is called when the name of a file in the specified storage has │ │ │ │ │ -been requested to be renamed. The disk I/O object is responsible for renaming │ │ │ │ │ -the file without racing with other potentially outstanding operations against │ │ │ │ │ -the file (such as read, write, move, etc.). │ │ │ │ │ +********** eemmppttyy(()) ********** │ │ │ │ │ +bool eemmppttyy () const noexcept; │ │ │ │ │ +returns true if the _b_i_t_f_i_e_l_d has zero size. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aassyynncc__ddeelleettee__ffiilleess(()) ********** │ │ │ │ │ -virtual void aassyynncc__ddeelleettee__ffiilleess (storage_index_t storage, remove_flags_t │ │ │ │ │ -options │ │ │ │ │ - , std::function handler) = 0; │ │ │ │ │ -This function is called when some file(s) on disk have been requested to be │ │ │ │ │ -removed by the client. storage indicates which torrent is referred to. See │ │ │ │ │ -_s_e_s_s_i_o_n___h_a_n_d_l_e for remove_flags_t flags indicating which files are to be │ │ │ │ │ -removed. e.g. _s_e_s_s_i_o_n___h_a_n_d_l_e_:_:_d_e_l_e_t_e___f_i_l_e_s - delete all files _s_e_s_s_i_o_n___h_a_n_d_l_e_:_: │ │ │ │ │ -_d_e_l_e_t_e___p_a_r_t_f_i_l_e - only delete part file. │ │ │ │ │ +********** ddaattaa(()) ********** │ │ │ │ │ +char const* ddaattaa () const noexcept; │ │ │ │ │ +char* ddaattaa () noexcept; │ │ │ │ │ +returns a pointer to the internal buffer of the _b_i_t_f_i_e_l_d, or nullptr if it's │ │ │ │ │ +empty. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aassyynncc__sseett__ffiillee__pprriioorriittyy(()) ********** │ │ │ │ │ -virtual void aassyynncc__sseett__ffiillee__pprriioorriittyy (storage_index_t storage │ │ │ │ │ - , aux::vector prio │ │ │ │ │ - , std::function)> handler) = 0; │ │ │ │ │ -This is called to set the priority of some or all files. Changing the priority │ │ │ │ │ -from or to 0 may involve moving data to and from the partfile. The disk I/ │ │ │ │ │ -O object is responsible for correctly synchronizing this work to not race with │ │ │ │ │ -any potentially outstanding asynchronous operations affecting these files. │ │ │ │ │ -prio is a vector of the file priority for all files. If it's shorter than the │ │ │ │ │ -total number of files in the torrent, they are assumed to be set to the default │ │ │ │ │ -priority. │ │ │ │ │ +********** sswwaapp(()) ********** │ │ │ │ │ +void sswwaapp (bitfield& rhs) noexcept; │ │ │ │ │ +swaps the bit-fields two variables refer to │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aassyynncc__cclleeaarr__ppiieeccee(()) ********** │ │ │ │ │ -virtual void aassyynncc__cclleeaarr__ppiieeccee (storage_index_t storage, piece_index_t index │ │ │ │ │ - , std::function handler) = 0; │ │ │ │ │ -This is called when a piece fails the hash check, to ensure there are no │ │ │ │ │ -outstanding disk operations to the piece before blocks are re-requested from │ │ │ │ │ -peers to overwrite the existing blocks. The disk I/O object does not need to │ │ │ │ │ -perform any action other than synchronize with all outstanding disk operations │ │ │ │ │ -to the specified piece before posting the result back. │ │ │ │ │ +********** ccoouunntt(()) ********** │ │ │ │ │ +int ccoouunntt () const noexcept; │ │ │ │ │ +count the number of bits in the _b_i_t_f_i_e_l_d that are set to 1. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** uuppddaattee__ssttaattss__ccoouunntteerrss(()) ********** │ │ │ │ │ -virtual void uuppddaattee__ssttaattss__ccoouunntteerrss (counters& c) const = 0; │ │ │ │ │ -_u_p_d_a_t_e___s_t_a_t_s___c_o_u_n_t_e_r_s_(_) is called to give the disk storage an opportunity to │ │ │ │ │ -update gauges in the c stats _c_o_u_n_t_e_r_s, that aren't updated continuously as │ │ │ │ │ -operations are performed. This is called before a snapshot of the _c_o_u_n_t_e_r_s are │ │ │ │ │ -passed to the client. │ │ │ │ │ +********** ffiinndd__ffiirrsstt__sseett(()) ********** │ │ │ │ │ +int ffiinndd__ffiirrsstt__sseett () const noexcept; │ │ │ │ │ +returns the index of the first set bit in the _b_i_t_f_i_e_l_d, i.e. 1 bit. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ggeett__ssttaattuuss(()) ********** │ │ │ │ │ -virtual std::vector ggeett__ssttaattuuss (storage_index_t) const = 0; │ │ │ │ │ -Return a list of all the files that are currently open for the specified │ │ │ │ │ -storage/torrent. This is is just used for the client to query the currently │ │ │ │ │ -open files, and which modes those files are open in. │ │ │ │ │ +********** ffiinndd__llaasstt__cclleeaarr(()) ********** │ │ │ │ │ +int ffiinndd__llaasstt__cclleeaarr () const noexcept; │ │ │ │ │ +returns the index to the last cleared bit in the _b_i_t_f_i_e_l_d, i.e. 0 bit. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aabboorrtt(()) ********** │ │ │ │ │ -virtual void aabboorrtt (bool wait) = 0; │ │ │ │ │ -this is called when the _s_e_s_s_i_o_n is starting to shut down. The disk I/O object │ │ │ │ │ -is expected to flush any outstanding write jobs, cancel hash jobs and initiate │ │ │ │ │ -tearing down of any internal threads. If wait is true, this should be │ │ │ │ │ -asynchronous. i.e. this call should not return until all threads have stopped │ │ │ │ │ -and all jobs have either been aborted or completed and the disk I/O object is │ │ │ │ │ -ready to be destructed. │ │ │ │ │ +************ hhaasshheerr ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_h_a_s_h_e_r_._h_p_p" │ │ │ │ │ +this is a SHA-1 hash class. │ │ │ │ │ +You use it by first instantiating it, then call update() to feed it with data. │ │ │ │ │ +i.e. you don't have to keep the entire buffer of which you want to create the │ │ │ │ │ +hash in memory. You can feed the _h_a_s_h_e_r parts of it at a time. When You have │ │ │ │ │ +fed the _h_a_s_h_e_r with all the data, you call final() and it will return the sha1- │ │ │ │ │ +hash of the data. │ │ │ │ │ +The constructor that takes a char const* and an integer will construct the sha1 │ │ │ │ │ +context and feed it the data passed in. │ │ │ │ │ +If you want to reuse the _h_a_s_h_e_r object once you have created a hash, you have │ │ │ │ │ +to call reset() to reinitialize it. │ │ │ │ │ +The built-in software version of sha1-algorithm was implemented by Steve Reid │ │ │ │ │ +and released as public domain. For more info, see src/sha1.cpp. │ │ │ │ │ +class hasher │ │ │ │ │ +{ │ │ │ │ │ + hhaasshheerr (); │ │ │ │ │ + hhaasshheerr (hasher const&); │ │ │ │ │ + hhaasshheerr (char const* data, int len); │ │ │ │ │ + hasher& ooppeerraattoorr== (hasher const&) &; │ │ │ │ │ + explicit hhaasshheerr (span data); │ │ │ │ │ + hasher& uuppddaattee (char const* data, int len); │ │ │ │ │ + hasher& uuppddaattee (span data); │ │ │ │ │ + sha1_hash ffiinnaall (); │ │ │ │ │ + void rreesseett (); │ │ │ │ │ +}; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ssuubbmmiitt__jjoobbss(()) ********** │ │ │ │ │ -virtual void ssuubbmmiitt__jjoobbss () = 0; │ │ │ │ │ -This will be called after a batch of disk jobs has been issues (via the async_* │ │ │ │ │ -). It gives the disk I/O object an opportunity to notify any potential │ │ │ │ │ -condition variables to wake up the disk thread(s). The async_* calls can of │ │ │ │ │ -course also notify condition variables, but doing it in this call allows for │ │ │ │ │ -batching jobs, by issuing the notification once for a collection of jobs. │ │ │ │ │ +********** hhaasshheerr(()) ooppeerraattoorr==(()) ********** │ │ │ │ │ +hhaasshheerr (hasher const&); │ │ │ │ │ +hhaasshheerr (char const* data, int len); │ │ │ │ │ +hasher& ooppeerraattoorr== (hasher const&) &; │ │ │ │ │ +explicit hhaasshheerr (span data); │ │ │ │ │ +this is the same as default constructing followed by a call to update(data, │ │ │ │ │ +len). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseettttiinnggss__uuppddaatteedd(()) ********** │ │ │ │ │ -virtual void sseettttiinnggss__uuppddaatteedd () = 0; │ │ │ │ │ -This is called to notify the disk I/O object that the settings have been │ │ │ │ │ -updated. In the disk io constructor, a _s_e_t_t_i_n_g_s___i_n_t_e_r_f_a_c_e reference is passed │ │ │ │ │ -in. Whenever these settings are updated, this function is called to allow the │ │ │ │ │ -disk I/O object to react to any changed settings relevant to its operations. │ │ │ │ │ +********** uuppddaattee(()) ********** │ │ │ │ │ +hasher& uuppddaattee (char const* data, int len); │ │ │ │ │ +hasher& uuppddaattee (span data); │ │ │ │ │ +append the following bytes to what is being hashed │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - force_copy │ │ │ │ │ - force making a copy of the cached block, rather than getting a reference │ │ │ │ │ - to a block already in the cache. This is used the block is expected to be │ │ │ │ │ - overwritten very soon, by async_write()`, and we need access to the │ │ │ │ │ - previous content. │ │ │ │ │ +********** ffiinnaall(()) ********** │ │ │ │ │ +sha1_hash ffiinnaall (); │ │ │ │ │ +returns the SHA-1 digest of the buffers previously passed to _u_p_d_a_t_e_(_) and the │ │ │ │ │ +_h_a_s_h_e_r constructor. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - sequential_access │ │ │ │ │ - hint that there may be more disk operations with sequential access to the │ │ │ │ │ - file │ │ │ │ │ +********** rreesseett(()) ********** │ │ │ │ │ +void rreesseett (); │ │ │ │ │ +restore the _h_a_s_h_e_r state to be as if the _h_a_s_h_e_r has just been default │ │ │ │ │ +constructed. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - volatile_read │ │ │ │ │ - don't keep the read block in cache. This is a hint that this block is │ │ │ │ │ - unlikely to be read again anytime soon, and caching it would be wasteful. │ │ │ │ │ +************ hhaasshheerr225566 ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_h_a_s_h_e_r_._h_p_p" │ │ │ │ │ +class hasher256 │ │ │ │ │ +{ │ │ │ │ │ + hhaasshheerr225566 (); │ │ │ │ │ + explicit hhaasshheerr225566 (span data); │ │ │ │ │ + hhaasshheerr225566 (hasher256 const&); │ │ │ │ │ + hasher256& ooppeerraattoorr== (hasher256 const&) &; │ │ │ │ │ + hhaasshheerr225566 (char const* data, int len); │ │ │ │ │ + hasher256& uuppddaattee (char const* data, int len); │ │ │ │ │ + hasher256& uuppddaattee (span data); │ │ │ │ │ + sha256_hash ffiinnaall (); │ │ │ │ │ + void rreesseett (); │ │ │ │ │ + ~~hhaasshheerr225566 (); │ │ │ │ │ +}; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - v1_hash │ │ │ │ │ - compute a v1 piece hash. This is only used by the _a_s_y_n_c___h_a_s_h_(_) call. If │ │ │ │ │ - this flag is not set in the _a_s_y_n_c___h_a_s_h_(_) call, the SHA-1 piece hash does │ │ │ │ │ - not need to be computed. │ │ │ │ │ +********** ooppeerraattoorr==(()) hhaasshheerr225566(()) ********** │ │ │ │ │ +explicit hhaasshheerr225566 (span data); │ │ │ │ │ +hhaasshheerr225566 (hasher256 const&); │ │ │ │ │ +hasher256& ooppeerraattoorr== (hasher256 const&) &; │ │ │ │ │ +hhaasshheerr225566 (char const* data, int len); │ │ │ │ │ +this is the same as default constructing followed by a call to update(data, │ │ │ │ │ +len). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - flush_piece │ │ │ │ │ - this flag instructs a hash job that we just completed this piece, and it │ │ │ │ │ - should be flushed to disk │ │ │ │ │ +********** uuppddaattee(()) ********** │ │ │ │ │ +hasher256& uuppddaattee (char const* data, int len); │ │ │ │ │ +hasher256& uuppddaattee (span data); │ │ │ │ │ +append the following bytes to what is being hashed │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ssttoorraaggee__hhoollddeerr ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___i_n_t_e_r_f_a_c_e_._h_p_p" │ │ │ │ │ -a unique, owning, reference to the storage of a torrent in a disk io subsystem │ │ │ │ │ -(class that implements _d_i_s_k___i_n_t_e_r_f_a_c_e). This is held by the internal libtorrent │ │ │ │ │ -torrent object to tie the storage object allocated for a torrent to the │ │ │ │ │ -lifetime of the internal torrent object. When a torrent is removed from the │ │ │ │ │ -_s_e_s_s_i_o_n, this holder is destructed and will inform the disk object. │ │ │ │ │ -struct storage_holder │ │ │ │ │ +********** ffiinnaall(()) ********** │ │ │ │ │ +sha256_hash ffiinnaall (); │ │ │ │ │ +returns the SHA-1 digest of the buffers previously passed to _u_p_d_a_t_e_(_) and the │ │ │ │ │ +_h_a_s_h_e_r constructor. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** rreesseett(()) ********** │ │ │ │ │ +void rreesseett (); │ │ │ │ │ +restore the _h_a_s_h_e_r state to be as if the _h_a_s_h_e_r has just been default │ │ │ │ │ +constructed. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ bblloocckk__iinnffoo ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ +holds the state of a block in a piece. Who we requested it from and how far │ │ │ │ │ +along we are at downloading it. │ │ │ │ │ +struct block_info │ │ │ │ │ { │ │ │ │ │ - ssttoorraaggee__hhoollddeerr () = default; │ │ │ │ │ - ssttoorraaggee__hhoollddeerr (storage_index_t idx, disk_interface& disk_io); │ │ │ │ │ - ~~ssttoorraaggee__hhoollddeerr (); │ │ │ │ │ - explicit operator bbooooll () const; │ │ │ │ │ - operator ssttoorraaggee__iinnddeexx__tt () const; │ │ │ │ │ - void rreesseett (); │ │ │ │ │ - storage_holder& ooppeerraattoorr== (storage_holder const&) = delete; │ │ │ │ │ - ssttoorraaggee__hhoollddeerr (storage_holder const&) = delete; │ │ │ │ │ - ssttoorraaggee__hhoollddeerr (storage_holder&& rhs) noexcept; │ │ │ │ │ - storage_holder& ooppeerraattoorr== (storage_holder&& rhs) noexcept; │ │ │ │ │ + _t_c_p_:_:_e_n_d_p_o_i_n_t ppeeeerr () const; │ │ │ │ │ + void sseett__ppeeeerr (tcp::endpoint const& ep); │ │ │ │ │ + │ │ │ │ │ + enum block_state_t │ │ │ │ │ + { │ │ │ │ │ + none, │ │ │ │ │ + requested, │ │ │ │ │ + writing, │ │ │ │ │ + finished, │ │ │ │ │ + }; │ │ │ │ │ + │ │ │ │ │ + unsigned bytes_progress:15; │ │ │ │ │ + unsigned block_size:15; │ │ │ │ │ + unsigned state:2; │ │ │ │ │ + unsigned num_peers:14; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ sseettttiinnggss__iinntteerrffaaccee ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_t_t_i_n_g_s___p_a_c_k_._h_p_p" │ │ │ │ │ -the common interface to _s_e_t_t_i_n_g_s___p_a_c_k and the internal representation of │ │ │ │ │ -settings. │ │ │ │ │ -struct settings_interface │ │ │ │ │ +********** ppeeeerr(()) sseett__ppeeeerr(()) ********** │ │ │ │ │ +_t_c_p_:_:_e_n_d_p_o_i_n_t ppeeeerr () const; │ │ │ │ │ +void sseett__ppeeeerr (tcp::endpoint const& ep); │ │ │ │ │ +The peer is the ip address of the peer this block was downloaded from. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** eennuumm bblloocckk__ssttaattee__tt ********** │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ + _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ +|_nn_aa_mm_ee_ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|none |0 |This block has not been downloaded or requested form any | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_e_e_r_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|requested|1 |The block has been requested, but not completely downloaded| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_y_e_t_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|writing |2 |The block has been downloaded and is currently queued for | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_b_e_i_n_g_ _w_r_i_t_t_e_n_ _t_o_ _d_i_s_k_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_f_i_n_i_s_h_e_d_ _|_3_ _ _ _ _|_T_h_e_ _b_l_o_c_k_ _h_a_s_ _b_e_e_n_ _w_r_i_t_t_e_n_ _t_o_ _d_i_s_k_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + bytes_progress │ │ │ │ │ + the number of bytes that have been received for this block │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + block_size │ │ │ │ │ + the total number of bytes in this block. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + state │ │ │ │ │ + the state this block is in (see _b_l_o_c_k___s_t_a_t_e___t) │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + num_peers │ │ │ │ │ + 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. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ppaarrttiiaall__ppiieeccee__iinnffoo ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ +This class holds information about pieces that have outstanding requests or │ │ │ │ │ +outstanding writes │ │ │ │ │ +struct partial_piece_info │ │ │ │ │ { │ │ │ │ │ - virtual void sseett__iinntt (int name, int val) = 0; │ │ │ │ │ - virtual void sseett__ssttrr (int name, std::string val) = 0; │ │ │ │ │ - virtual void sseett__bbooooll (int name, bool val) = 0; │ │ │ │ │ - virtual bool hhaass__vvaall (int name) const = 0; │ │ │ │ │ - virtual int ggeett__iinntt (int name) const = 0; │ │ │ │ │ - virtual bool ggeett__bbooooll (int name) const = 0; │ │ │ │ │ - virtual std::string const& ggeett__ssttrr (int name) const = 0; │ │ │ │ │ + piece_index_t piece_index; │ │ │ │ │ + int blocks_in_piece; │ │ │ │ │ + int finished; │ │ │ │ │ + int writing; │ │ │ │ │ + int requested; │ │ │ │ │ + block_info const* blocks; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ bbuuffffeerr__aallllooccaattoorr__iinntteerrffaaccee ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r_._h_p_p" │ │ │ │ │ -the interface for freeing disk buffers, used by the _d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r. when │ │ │ │ │ -implementing _d_i_s_k___i_n_t_e_r_f_a_c_e, this must also be implemented in order to return │ │ │ │ │ -disk buffers back to libtorrent │ │ │ │ │ -struct buffer_allocator_interface │ │ │ │ │ + piece_index │ │ │ │ │ + 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. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + blocks_in_piece │ │ │ │ │ + the number of blocks in this piece │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + finished │ │ │ │ │ + the number of blocks that are in the finished state │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + writing │ │ │ │ │ + the number of blocks that are in the writing state │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + requested │ │ │ │ │ + the number of blocks that are in the requested state │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + blocks │ │ │ │ │ + this is an array of blocks_in_piece number of items. One for each block │ │ │ │ │ + in the piece. │ │ │ │ │ + Warning │ │ │ │ │ + This is a pointer that points to an array that's owned by the _s_e_s_s_i_o_n │ │ │ │ │ + object. The next time _g_e_t___d_o_w_n_l_o_a_d___q_u_e_u_e_(_) is called, it will be │ │ │ │ │ + invalidated. In the case of _p_i_e_c_e___i_n_f_o___a_l_e_r_t, these pointers point into │ │ │ │ │ + the _a_l_e_r_t object itself, and will be invalidated when the _a_l_e_r_t destruct. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ttoorrrreenntt__hhaannddllee ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ +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. │ │ │ │ │ +Warning │ │ │ │ │ +Any member function that returns a value or fills in a value has to be made │ │ │ │ │ +synchronously. This means it has to wait for the main thread to complete the │ │ │ │ │ +query before it can return. This might potentially be expensive if done from │ │ │ │ │ +within a GUI thread that needs to stay responsive. Try to avoid querying for │ │ │ │ │ +information you don't need, and try to do it in as few calls as possible. You │ │ │ │ │ +can get most of the interesting information about a torrent from the │ │ │ │ │ +_t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_s_t_a_t_u_s_(_) call. │ │ │ │ │ +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 _t_o_r_r_e_n_t___h_a_n_d_l_e may throw system_error exception, in case │ │ │ │ │ +the handle is no longer referring to a torrent. There is one exception _i_s___v_a_l_i_d │ │ │ │ │ +_(_) 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. │ │ │ │ │ +struct torrent_handle │ │ │ │ │ { │ │ │ │ │ - virtual void ffrreeee__ddiisskk__bbuuffffeerr (char* b) = 0; │ │ │ │ │ + friend std::size_t hhaasshh__vvaalluuee (torrent_handle const& th); │ │ │ │ │ + ttoorrrreenntt__hhaannddllee () noexcept = default; │ │ │ │ │ + void aadddd__ppiieeccee (piece_index_t piece, char const* data, add_piece_flags_t │ │ │ │ │ +flags = {}) const; │ │ │ │ │ + void aadddd__ppiieeccee (piece_index_t piece, std::vector data, │ │ │ │ │ +add_piece_flags_t flags = {}) const; │ │ │ │ │ + void rreeaadd__ppiieeccee (piece_index_t piece) const; │ │ │ │ │ + bool hhaavvee__ppiieeccee (piece_index_t piece) const; │ │ │ │ │ + void ppoosstt__ppeeeerr__iinnffoo () const; │ │ │ │ │ + void ggeett__ppeeeerr__iinnffoo (std::vector& v) const; │ │ │ │ │ + torrent_status ssttaattuuss (status_flags_t flags = status_flags_t::all()) const; │ │ │ │ │ + void ppoosstt__ssttaattuuss (status_flags_t flags = status_flags_t::all()) const; │ │ │ │ │ + std::vector ggeett__ddoowwnnllooaadd__qquueeuuee () const; │ │ │ │ │ + void ggeett__ddoowwnnllooaadd__qquueeuuee (std::vector& queue) const; │ │ │ │ │ + void ppoosstt__ddoowwnnllooaadd__qquueeuuee () const; │ │ │ │ │ + void sseett__ppiieeccee__ddeeaaddlliinnee (piece_index_t index, int deadline, deadline_flags_t │ │ │ │ │ +flags = {}) const; │ │ │ │ │ + void rreesseett__ppiieeccee__ddeeaaddlliinnee (piece_index_t index) const; │ │ │ │ │ + void cclleeaarr__ppiieeccee__ddeeaaddlliinneess () const; │ │ │ │ │ + std::vector ffiillee__pprrooggrreessss (file_progress_flags_t flags = {}) │ │ │ │ │ +const; │ │ │ │ │ + void ffiillee__pprrooggrreessss (std::vector& progress, │ │ │ │ │ +file_progress_flags_t flags = {}) const; │ │ │ │ │ + void ppoosstt__ffiillee__pprrooggrreessss (file_progress_flags_t flags) const; │ │ │ │ │ + std::vector ffiillee__ssttaattuuss () const; │ │ │ │ │ + void cclleeaarr__eerrrroorr () const; │ │ │ │ │ + void ppoosstt__ttrraacckkeerrss () const; │ │ │ │ │ + void aadddd__ttrraacckkeerr (announce_entry const&) const; │ │ │ │ │ + std::vector ttrraacckkeerrss () const; │ │ │ │ │ + void rreeppllaaccee__ttrraacckkeerrss (std::vector const&) const; │ │ │ │ │ + std::set uurrll__sseeeeddss () const; │ │ │ │ │ + void aadddd__uurrll__sseeeedd (std::string const& url) const; │ │ │ │ │ + void rreemmoovvee__uurrll__sseeeedd (std::string const& url) const; │ │ │ │ │ + std::set hhttttpp__sseeeeddss () const; │ │ │ │ │ + void aadddd__hhttttpp__sseeeedd (std::string const& url) const; │ │ │ │ │ + void rreemmoovvee__hhttttpp__sseeeedd (std::string const& url) const; │ │ │ │ │ + void aadddd__eexxtteennssiioonn ( │ │ │ │ │ + std::function(torrent_handle const&, │ │ │ │ │ +client_data_t)> const& ext │ │ │ │ │ + , client_data_t userdata = client_data_t{}); │ │ │ │ │ + bool sseett__mmeettaaddaattaa (span metadata) const; │ │ │ │ │ + bool iiss__vvaalliidd () const; │ │ │ │ │ + void ppaauussee (pause_flags_t flags = {}) const; │ │ │ │ │ + void rreessuummee () const; │ │ │ │ │ + torrent_flags_t ffllaaggss () const; │ │ │ │ │ + void sseett__ffllaaggss (torrent_flags_t flags, torrent_flags_t mask) const; │ │ │ │ │ + void sseett__ffllaaggss (torrent_flags_t flags) const; │ │ │ │ │ + void uunnsseett__ffllaaggss (torrent_flags_t flags) const; │ │ │ │ │ + void fflluusshh__ccaacchhee () const; │ │ │ │ │ + void ffoorrccee__rreecchheecckk () const; │ │ │ │ │ + void ssaavvee__rreessuummee__ddaattaa (resume_data_flags_t flags = {}) const; │ │ │ │ │ + bool nneeeedd__ssaavvee__rreessuummee__ddaattaa (resume_data_flags_t flags) const; │ │ │ │ │ + bool nneeeedd__ssaavvee__rreessuummee__ddaattaa () const; │ │ │ │ │ + void qquueeuuee__ppoossiittiioonn__bboottttoomm () const; │ │ │ │ │ + void qquueeuuee__ppoossiittiioonn__ddoowwnn () const; │ │ │ │ │ + void qquueeuuee__ppoossiittiioonn__ttoopp () const; │ │ │ │ │ + void qquueeuuee__ppoossiittiioonn__uupp () const; │ │ │ │ │ + queue_position_t qquueeuuee__ppoossiittiioonn () const; │ │ │ │ │ + void qquueeuuee__ppoossiittiioonn__sseett (queue_position_t p) const; │ │ │ │ │ + void sseett__ssssll__cceerrttiiffiiccaattee__bbuuffffeerr (std::string const& certificate │ │ │ │ │ + , std::string const& private_key │ │ │ │ │ + , std::string const& dh_params); │ │ │ │ │ + void sseett__ssssll__cceerrttiiffiiccaattee (std::string const& certificate │ │ │ │ │ + , std::string const& private_key │ │ │ │ │ + , std::string const& dh_params │ │ │ │ │ + , std::string const& passphrase = ""); │ │ │ │ │ + std::shared_ptr ttoorrrreenntt__ffiillee__wwiitthh__hhaasshheess () const; │ │ │ │ │ + std::shared_ptr ttoorrrreenntt__ffiillee () const; │ │ │ │ │ + std::vector> ppiieeccee__llaayyeerrss () const; │ │ │ │ │ + void ppiieeccee__aavvaaiillaabbiilliittyy (std::vector& avail) const; │ │ │ │ │ + void ppoosstt__ppiieeccee__aavvaaiillaabbiilliittyy () const; │ │ │ │ │ + void pprriioorriittiizzee__ppiieecceess (std::vector> const& pieces) const; │ │ │ │ │ + download_priority_t ppiieeccee__pprriioorriittyy (piece_index_t index) const; │ │ │ │ │ + void ppiieeccee__pprriioorriittyy (piece_index_t index, download_priority_t priority) │ │ │ │ │ +const; │ │ │ │ │ + std::vector ggeett__ppiieeccee__pprriioorriittiieess () const; │ │ │ │ │ + void pprriioorriittiizzee__ppiieecceess (std::vector const& pieces) │ │ │ │ │ +const; │ │ │ │ │ + void pprriioorriittiizzee__ffiilleess (std::vector const& files) const; │ │ │ │ │ + void ffiillee__pprriioorriittyy (file_index_t index, download_priority_t priority) const; │ │ │ │ │ + download_priority_t ffiillee__pprriioorriittyy (file_index_t index) const; │ │ │ │ │ + std::vector ggeett__ffiillee__pprriioorriittiieess () const; │ │ │ │ │ + void ffoorrccee__rreeaannnnoouunnccee (int seconds = 0, int idx = -1, reannounce_flags_t = │ │ │ │ │ +{}) const; │ │ │ │ │ + void ffoorrccee__llssdd__aannnnoouunnccee () const; │ │ │ │ │ + void ffoorrccee__ddhhtt__aannnnoouunnccee () const; │ │ │ │ │ + void ssccrraappee__ttrraacckkeerr (int idx = -1) const; │ │ │ │ │ + void sseett__uuppllooaadd__lliimmiitt (int limit) const; │ │ │ │ │ + void sseett__ddoowwnnllooaadd__lliimmiitt (int limit) const; │ │ │ │ │ + int ddoowwnnllooaadd__lliimmiitt () const; │ │ │ │ │ + int uuppllooaadd__lliimmiitt () const; │ │ │ │ │ + void ccoonnnneecctt__ppeeeerr (tcp::endpoint const& adr, peer_source_flags_t source = {} │ │ │ │ │ + , pex_flags_t flags = pex_encryption | pex_utp | pex_holepunch) const; │ │ │ │ │ + void cclleeaarr__ppeeeerrss (); │ │ │ │ │ + void sseett__mmaaxx__uuppllooaaddss (int max_uploads) const; │ │ │ │ │ + int mmaaxx__uuppllooaaddss () const; │ │ │ │ │ + void sseett__mmaaxx__ccoonnnneeccttiioonnss (int max_connections) const; │ │ │ │ │ + int mmaaxx__ccoonnnneeccttiioonnss () const; │ │ │ │ │ + void mmoovvee__ssttoorraaggee (std::string const& save_path │ │ │ │ │ + , move_flags_t flags = move_flags_t::always_replace_files │ │ │ │ │ + ) const; │ │ │ │ │ + void rreennaammee__ffiillee (file_index_t index, std::string const& new_name) const; │ │ │ │ │ + sha1_hash iinnffoo__hhaasshh () const; │ │ │ │ │ + info_hash_t iinnffoo__hhaasshheess () const; │ │ │ │ │ + bool ooppeerraattoorr==== (const torrent_handle& h) const; │ │ │ │ │ + bool ooppeerraattoorr!!== (const torrent_handle& h) const; │ │ │ │ │ + bool ooppeerraattoorr<< (const torrent_handle& h) const; │ │ │ │ │ + std::uint32_t iidd () const; │ │ │ │ │ + std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ + client_data_t uusseerrddaattaa () const; │ │ │ │ │ + bool iinn__sseessssiioonn () const; │ │ │ │ │ + │ │ │ │ │ + static constexpr add_piece_flags_t oovveerrwwrriittee__eexxiissttiinngg = 0_bit; │ │ │ │ │ + static constexpr status_flags_t qquueerryy__ddiissttrriibbuutteedd__ccooppiieess = 0_bit; │ │ │ │ │ + static constexpr status_flags_t qquueerryy__aaccccuurraattee__ddoowwnnllooaadd__ccoouunntteerrss = 1_bit; │ │ │ │ │ + static constexpr status_flags_t qquueerryy__llaasstt__sseeeenn__ccoommpplleettee = 2_bit; │ │ │ │ │ + static constexpr status_flags_t qquueerryy__ppiieecceess = 3_bit; │ │ │ │ │ + static constexpr status_flags_t qquueerryy__vveerriiffiieedd__ppiieecceess = 4_bit; │ │ │ │ │ + static constexpr status_flags_t qquueerryy__ttoorrrreenntt__ffiillee = 5_bit; │ │ │ │ │ + static constexpr status_flags_t qquueerryy__nnaammee = 6_bit; │ │ │ │ │ + static constexpr status_flags_t qquueerryy__ssaavvee__ppaatthh = 7_bit; │ │ │ │ │ + static constexpr deadline_flags_t aalleerrtt__wwhheenn__aavvaaiillaabbllee = 0_bit; │ │ │ │ │ + static constexpr file_progress_flags_t ppiieeccee__ggrraannuullaarriittyy = 0_bit; │ │ │ │ │ + static constexpr pause_flags_t ggrraacceeffuull__ppaauussee = 0_bit; │ │ │ │ │ + static constexpr resume_data_flags_t fflluusshh__ddiisskk__ccaacchhee = 0_bit; │ │ │ │ │ + static constexpr resume_data_flags_t ssaavvee__iinnffoo__ddiicctt = 1_bit; │ │ │ │ │ + static constexpr resume_data_flags_t oonnllyy__iiff__mmooddiiffiieedd = 2_bit; │ │ │ │ │ + static constexpr resume_data_flags_t iiff__ccoouunntteerrss__cchhaannggeedd = 3_bit; │ │ │ │ │ + static constexpr resume_data_flags_t iiff__ddoowwnnllooaadd__pprrooggrreessss = 4_bit; │ │ │ │ │ + static constexpr resume_data_flags_t iiff__ccoonnffiigg__cchhaannggeedd = 5_bit; │ │ │ │ │ + static constexpr resume_data_flags_t iiff__ssttaattee__cchhaannggeedd = 6_bit; │ │ │ │ │ + static constexpr resume_data_flags_t iiff__mmeettaaddaattaa__cchhaannggeedd = 7_bit; │ │ │ │ │ + static constexpr reannounce_flags_t iiggnnoorree__mmiinn__iinntteerrvvaall = 0_bit; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ddiisskk__bbuuffffeerr__hhoollddeerr ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___b_u_f_f_e_r___h_o_l_d_e_r_._h_p_p" │ │ │ │ │ -The disk buffer holder acts like a unique_ptr that frees a disk buffer when │ │ │ │ │ -it's destructed │ │ │ │ │ -If this buffer holder is moved-from, default constructed or reset, data() will │ │ │ │ │ -return nullptr. │ │ │ │ │ -struct disk_buffer_holder │ │ │ │ │ +********** ttoorrrreenntt__hhaannddllee(()) ********** │ │ │ │ │ +ttoorrrreenntt__hhaannddllee () noexcept = default; │ │ │ │ │ +constructs a torrent handle that does not refer to a torrent. i.e. _i_s___v_a_l_i_d_(_) │ │ │ │ │ +will return false. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aadddd__ppiieeccee(()) ********** │ │ │ │ │ +void aadddd__ppiieeccee (piece_index_t piece, char const* data, add_piece_flags_t flags │ │ │ │ │ += {}) const; │ │ │ │ │ +void aadddd__ppiieeccee (piece_index_t piece, std::vector data, add_piece_flags_t │ │ │ │ │ +flags = {}) const; │ │ │ │ │ +This function will write data to the storage as piece piece, as if it had been │ │ │ │ │ +downloaded from a peer. │ │ │ │ │ +By default, data that's already been downloaded is not overwritten by this │ │ │ │ │ +buffer. If you trust this data to be correct (and pass the piece hash check) │ │ │ │ │ +you may pass the overwrite_existing flag. This will instruct libtorrent to │ │ │ │ │ +overwrite any data that may already have been downloaded with this data. │ │ │ │ │ +Since the data is written asynchronously, you may know that is passed or failed │ │ │ │ │ +the hash check by waiting for _p_i_e_c_e___f_i_n_i_s_h_e_d___a_l_e_r_t or _h_a_s_h___f_a_i_l_e_d___a_l_e_r_t. │ │ │ │ │ +Adding pieces while the torrent is being checked (i.e. in _t_o_r_r_e_n_t___s_t_a_t_u_s_:_: │ │ │ │ │ +_c_h_e_c_k_i_n_g___f_i_l_e_s state) is not supported. │ │ │ │ │ +The overload taking a raw pointer to the data is a blocking call. It won't │ │ │ │ │ +return until the libtorrent thread has copied the data into its disk write │ │ │ │ │ +buffer. data is expected to point to a buffer of as many bytes as the size of │ │ │ │ │ +the specified piece. See _f_i_l_e___s_t_o_r_a_g_e_:_:_p_i_e_c_e___s_i_z_e_(_). │ │ │ │ │ +The data in the buffer is copied and passed on to the disk IO thread to be │ │ │ │ │ +written at a later point. │ │ │ │ │ +The overload taking a std::vector is not blocking, it will send the │ │ │ │ │ +buffer to the main thread and return immediately. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** rreeaadd__ppiieeccee(()) ********** │ │ │ │ │ +void rreeaadd__ppiieeccee (piece_index_t piece) const; │ │ │ │ │ +This function starts an asynchronous read operation of the specified piece from │ │ │ │ │ +this torrent. You must have completed the download of the specified piece │ │ │ │ │ +before calling this function. │ │ │ │ │ +When the read operation is completed, it is passed back through an _a_l_e_r_t, │ │ │ │ │ +_r_e_a_d___p_i_e_c_e___a_l_e_r_t. Since this _a_l_e_r_t is a response to an explicit call, it will │ │ │ │ │ +always be posted, regardless of the _a_l_e_r_t mask. │ │ │ │ │ +Note that if you read multiple pieces, the read operations are not guaranteed │ │ │ │ │ +to finish in the same order as you initiated them. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** hhaavvee__ppiieeccee(()) ********** │ │ │ │ │ +bool hhaavvee__ppiieeccee (piece_index_t piece) const; │ │ │ │ │ +Returns true if this piece has been completely downloaded and written to disk, │ │ │ │ │ +and false otherwise. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ppoosstt__ppeeeerr__iinnffoo(()) ggeett__ppeeeerr__iinnffoo(()) ********** │ │ │ │ │ +void ppoosstt__ppeeeerr__iinnffoo () const; │ │ │ │ │ +void ggeett__ppeeeerr__iinnffoo (std::vector& v) const; │ │ │ │ │ +Query information about connected peers for this torrent. If the _t_o_r_r_e_n_t___h_a_n_d_l_e │ │ │ │ │ +is invalid, it will throw a system_error exception. │ │ │ │ │ +post_peer_info() is asynchronous and will trigger the posting of a │ │ │ │ │ +_p_e_e_r___i_n_f_o___a_l_e_r_t. The _a_l_e_r_t contain a list of _p_e_e_r___i_n_f_o objects, one for each │ │ │ │ │ +connected peer. │ │ │ │ │ +get_peer_info() is synchronous and takes a reference to a vector that will be │ │ │ │ │ +cleared and filled with one _e_n_t_r_y for each peer connected to this torrent, │ │ │ │ │ +given the handle is valid. Each _e_n_t_r_y in the vector contains information about │ │ │ │ │ +that particular peer. See _p_e_e_r___i_n_f_o. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ppoosstt__ssttaattuuss(()) ssttaattuuss(()) ********** │ │ │ │ │ +torrent_status ssttaattuuss (status_flags_t flags = status_flags_t::all()) const; │ │ │ │ │ +void ppoosstt__ssttaattuuss (status_flags_t flags = status_flags_t::all()) const; │ │ │ │ │ +status() will return a structure with information about the status of this │ │ │ │ │ +torrent. If the _t_o_r_r_e_n_t___h_a_n_d_l_e is invalid, it will throw system_error │ │ │ │ │ +exception. See _t_o_r_r_e_n_t___s_t_a_t_u_s. The flags argument filters what information is │ │ │ │ │ +returned in the _t_o_r_r_e_n_t___s_t_a_t_u_s. Some information in there is relatively │ │ │ │ │ +expensive to calculate, and if you're not interested in it (and see performance │ │ │ │ │ +issues), you can filter them out. │ │ │ │ │ +The status() function will block until the internal libtorrent thread responds │ │ │ │ │ +with the _t_o_r_r_e_n_t___s_t_a_t_u_s object. To avoid blocking, instead call post_status(). │ │ │ │ │ +It will trigger posting of a _s_t_a_t_e___u_p_d_a_t_e___a_l_e_r_t with a single _t_o_r_r_e_n_t___s_t_a_t_u_s │ │ │ │ │ +object for this torrent. │ │ │ │ │ +In order to get regular updates for torrents whose status changes, consider │ │ │ │ │ +calling session::post_torrent_updates()`` instead. │ │ │ │ │ +By default everything is included. The flags you can use to decide what to │ │ │ │ │ +iinncclluuddee are defined in this class. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ggeett__ddoowwnnllooaadd__qquueeuuee(()) ppoosstt__ddoowwnnllooaadd__qquueeuuee(()) ********** │ │ │ │ │ +std::vector ggeett__ddoowwnnllooaadd__qquueeuuee () const; │ │ │ │ │ +void ggeett__ddoowwnnllooaadd__qquueeuuee (std::vector& queue) const; │ │ │ │ │ +void ppoosstt__ddoowwnnllooaadd__qquueeuuee () const; │ │ │ │ │ +post_download_queue() triggers a download_queue_alert to be posted. │ │ │ │ │ +get_download_queue() is a synchronous call and returns a vector with │ │ │ │ │ +information about pieces that are partially downloaded or not downloaded but │ │ │ │ │ +partially requested. See _p_a_r_t_i_a_l___p_i_e_c_e___i_n_f_o for the fields in the returned │ │ │ │ │ +vector. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** rreesseett__ppiieeccee__ddeeaaddlliinnee(()) cclleeaarr__ppiieeccee__ddeeaaddlliinneess(()) sseett__ppiieeccee__ddeeaaddlliinnee(()) ********** │ │ │ │ │ +void sseett__ppiieeccee__ddeeaaddlliinnee (piece_index_t index, int deadline, deadline_flags_t │ │ │ │ │ +flags = {}) const; │ │ │ │ │ +void rreesseett__ppiieeccee__ddeeaaddlliinnee (piece_index_t index) const; │ │ │ │ │ +void cclleeaarr__ppiieeccee__ddeeaaddlliinneess () const; │ │ │ │ │ +This function sets or resets the deadline associated with a specific piece │ │ │ │ │ +index (index). libtorrent will attempt to download this entire piece before the │ │ │ │ │ +deadline expires. This is not necessarily possible, but pieces with a more │ │ │ │ │ +recent deadline will always be prioritized over pieces with a deadline further │ │ │ │ │ +ahead in time. The deadline (and flags) of a piece can be changed by calling │ │ │ │ │ +this function again. │ │ │ │ │ +If the piece is already downloaded when this call is made, nothing happens, │ │ │ │ │ +unless the alert_when_available flag is set, in which case it will have the │ │ │ │ │ +same effect as calling _r_e_a_d___p_i_e_c_e_(_) for index. │ │ │ │ │ +deadline is the number of milliseconds until this piece should be completed. │ │ │ │ │ +reset_piece_deadline removes the deadline from the piece. If it hasn't already │ │ │ │ │ +been downloaded, it will no longer be considered a priority. │ │ │ │ │ +clear_piece_deadlines() removes deadlines on all pieces in the torrent. As if │ │ │ │ │ +_r_e_s_e_t___p_i_e_c_e___d_e_a_d_l_i_n_e_(_) was called on all pieces. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ffiillee__pprrooggrreessss(()) ppoosstt__ffiillee__pprrooggrreessss(()) ********** │ │ │ │ │ +std::vector ffiillee__pprrooggrreessss (file_progress_flags_t flags = {}) │ │ │ │ │ +const; │ │ │ │ │ +void ffiillee__pprrooggrreessss (std::vector& progress, file_progress_flags_t │ │ │ │ │ +flags = {}) const; │ │ │ │ │ +void ppoosstt__ffiillee__pprrooggrreessss (file_progress_flags_t flags) const; │ │ │ │ │ +This function fills in the supplied vector, or returns a vector, with the │ │ │ │ │ +number of bytes downloaded of each file in this torrent. The progress values │ │ │ │ │ +are ordered the same as the files in the _t_o_r_r_e_n_t___i_n_f_o. │ │ │ │ │ +This operation is not very cheap. Its complexity is OO((nn ++ mmjj)). Where nn is the │ │ │ │ │ +number of files, mm is the number of currently downloading pieces and jj is the │ │ │ │ │ +number of blocks in a piece. │ │ │ │ │ +The flags parameter can be used to specify the granularity of the file │ │ │ │ │ +progress. If left at the default value of 0, the progress will be as accurate │ │ │ │ │ +as possible, but also more expensive to calculate. If torrent_handle:: │ │ │ │ │ +piece_granularity is specified, the progress will be specified in piece │ │ │ │ │ +granularity. i.e. only pieces that have been fully downloaded and passed the │ │ │ │ │ +hash check count. When specifying piece granularity, the operation is a lot │ │ │ │ │ +cheaper, since libtorrent already keeps track of this internally and no │ │ │ │ │ +calculation is required. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ffiillee__ssttaattuuss(()) ********** │ │ │ │ │ +std::vector ffiillee__ssttaattuuss () const; │ │ │ │ │ +This function returns a vector with status about files that are open for this │ │ │ │ │ +torrent. Any file that is not open will not be reported in the vector, i.e. │ │ │ │ │ +it's possible that the vector is empty when returning, if none of the files in │ │ │ │ │ +the torrent are currently open. │ │ │ │ │ +See _o_p_e_n___f_i_l_e___s_t_a_t_e │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** cclleeaarr__eerrrroorr(()) ********** │ │ │ │ │ +void cclleeaarr__eerrrroorr () const; │ │ │ │ │ +If the torrent is in an error state (i.e. torrent_status::error is non-empty), │ │ │ │ │ +this will clear the error and start the torrent again. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aadddd__ttrraacckkeerr(()) ttrraacckkeerrss(()) ppoosstt__ttrraacckkeerrss(()) rreeppllaaccee__ttrraacckkeerrss(()) ********** │ │ │ │ │ +void ppoosstt__ttrraacckkeerrss () const; │ │ │ │ │ +void aadddd__ttrraacckkeerr (announce_entry const&) const; │ │ │ │ │ +std::vector ttrraacckkeerrss () const; │ │ │ │ │ +void rreeppllaaccee__ttrraacckkeerrss (std::vector const&) const; │ │ │ │ │ +trackers() returns the list of trackers for this torrent. The announce _e_n_t_r_y │ │ │ │ │ +contains both a string url which specify the announce url for the tracker as │ │ │ │ │ +well as an _i_n_t 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 _f_o_r_c_e___r_e_a_n_n_o_u_n_c_e_(_). See _a_n_n_o_u_n_c_e___e_n_t_r_y. │ │ │ │ │ +post_trackers() is the asynchronous version of trackers(). It will trigger a │ │ │ │ │ +_t_r_a_c_k_e_r___l_i_s_t___a_l_e_r_t to be posted. │ │ │ │ │ +add_tracker() will look if the specified tracker is already in the set. If it │ │ │ │ │ +is, it doesn't do anything. If it's not in the current set of trackers, it will │ │ │ │ │ +insert it in the tier specified in the _a_n_n_o_u_n_c_e___e_n_t_r_y. │ │ │ │ │ +The updated set of trackers will be saved in the resume data, and when a │ │ │ │ │ +torrent is started with resume data, the trackers from the resume data will │ │ │ │ │ +replace the original ones. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** uurrll__sseeeeddss(()) rreemmoovvee__uurrll__sseeeedd(()) aadddd__uurrll__sseeeedd(()) ********** │ │ │ │ │ +std::set uurrll__sseeeeddss () const; │ │ │ │ │ +void aadddd__uurrll__sseeeedd (std::string const& url) const; │ │ │ │ │ +void rreemmoovvee__uurrll__sseeeedd (std::string const& url) 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 _h_t_t_p_ _s_e_e_d_i_n_g for more information. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** rreemmoovvee__hhttttpp__sseeeedd(()) aadddd__hhttttpp__sseeeedd(()) hhttttpp__sseeeeddss(()) ********** │ │ │ │ │ +std::set hhttttpp__sseeeeddss () const; │ │ │ │ │ +void aadddd__hhttttpp__sseeeedd (std::string const& url) const; │ │ │ │ │ +void rreemmoovvee__hhttttpp__sseeeedd (std::string const& url) const; │ │ │ │ │ +These functions are identical as the *_url_seed() variants, but they operate on │ │ │ │ │ +_B_E_P_ _1_7 web seeds instead of _B_E_P_ _1_9. │ │ │ │ │ +See _h_t_t_p_ _s_e_e_d_i_n_g for more information. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** aadddd__eexxtteennssiioonn(()) ********** │ │ │ │ │ +void aadddd__eexxtteennssiioonn ( │ │ │ │ │ + std::function(torrent_handle const&, │ │ │ │ │ +client_data_t)> const& ext │ │ │ │ │ + , client_data_t userdata = client_data_t{}); │ │ │ │ │ +add the specified extension to this torrent. The ext argument is a function │ │ │ │ │ +that will be called from within libtorrent's context passing in the internal │ │ │ │ │ +torrent object and the specified userdata pointer. The function is expected to │ │ │ │ │ +return a shared pointer to a _t_o_r_r_e_n_t___p_l_u_g_i_n instance. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** sseett__mmeettaaddaattaa(()) ********** │ │ │ │ │ +bool sseett__mmeettaaddaattaa (span metadata) const; │ │ │ │ │ +set_metadata expects the iinnffoo section of metadata. i.e. The buffer passed in │ │ │ │ │ +will be hashed and verified against the info-hash. If it fails, a │ │ │ │ │ +metadata_failed_alert will be generated. If it passes, a │ │ │ │ │ +metadata_received_alert is generated. The function returns true if the metadata │ │ │ │ │ +is successfully set on the torrent, and false otherwise. If the torrent already │ │ │ │ │ +has metadata, this function will not affect the torrent, and false will be │ │ │ │ │ +returned. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** iiss__vvaalliidd(()) ********** │ │ │ │ │ +bool iiss__vvaalliidd () 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 removed from the │ │ │ │ │ +_s_e_s_s_i_o_n AND destructed. │ │ │ │ │ +To tell if the _t_o_r_r_e_n_t___h_a_n_d_l_e is in the _s_e_s_s_i_o_n, use _t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_i_n___s_e_s_s_i_o_n │ │ │ │ │ +_(_). This will return true before _s_e_s_s_i_o_n___h_a_n_d_l_e_:_:_r_e_m_o_v_e___t_o_r_r_e_n_t_(_) is called, │ │ │ │ │ +and false afterward. │ │ │ │ │ +Clients should only use _i_s___v_a_l_i_d_(_) to determine if the result of session:: │ │ │ │ │ +find_torrent() was successful. │ │ │ │ │ +Unlike other member functions which return a value, _i_s___v_a_l_i_d_(_) completes │ │ │ │ │ +immediately, without blocking on a result from the network thread. Also unlike │ │ │ │ │ +other functions, it never throws the system_error exception. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** rreessuummee(()) ppaauussee(()) ********** │ │ │ │ │ +void ppaauussee (pause_flags_t flags = {}) const; │ │ │ │ │ +void rreessuummee () 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. Torrents │ │ │ │ │ +may be paused automatically if there is a file error (e.g. disk full) or │ │ │ │ │ +something similar. See _f_i_l_e___e_r_r_o_r___a_l_e_r_t. │ │ │ │ │ +For possible values of the flags parameter, see pause_flags_t. │ │ │ │ │ +To know if a torrent is paused or not, call torrent_handle::flags() and check │ │ │ │ │ +for the torrent_status::paused flag. │ │ │ │ │ +Note │ │ │ │ │ +Torrents that are auto-managed may be automatically resumed again. It does not │ │ │ │ │ +make sense to pause an auto-managed torrent without making it not auto-managed │ │ │ │ │ +first. Torrents are auto-managed by default when added to the _s_e_s_s_i_o_n. For more │ │ │ │ │ +information, see _q_u_e_u_i_n_g. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** sseett__ffllaaggss(()) ffllaaggss(()) uunnsseett__ffllaaggss(()) ********** │ │ │ │ │ +torrent_flags_t ffllaaggss () const; │ │ │ │ │ +void sseett__ffllaaggss (torrent_flags_t flags, torrent_flags_t mask) const; │ │ │ │ │ +void sseett__ffllaaggss (torrent_flags_t flags) const; │ │ │ │ │ +void uunnsseett__ffllaaggss (torrent_flags_t flags) const; │ │ │ │ │ +sets and gets the torrent state flags. See _t_o_r_r_e_n_t___f_l_a_g_s___t. The set_flags │ │ │ │ │ +overload that take a mask will affect all flags part of the mask, and set their │ │ │ │ │ +values to what the flags argument is set to. This allows clearing and setting │ │ │ │ │ +flags in a single function call. The set_flags overload that just takes flags, │ │ │ │ │ +sets all the specified flags and leave any other flags unchanged. unset_flags │ │ │ │ │ +clears the specified flags, while leaving any other flags unchanged. │ │ │ │ │ +Theseed_modeflag is special, it can only be cleared once the torrent has been │ │ │ │ │ +added, and it can only be set as part of the _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s flags, when │ │ │ │ │ +adding the torrent. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** fflluusshh__ccaacchhee(()) ********** │ │ │ │ │ +void fflluusshh__ccaacchhee () const; │ │ │ │ │ +Instructs libtorrent to flush all the disk caches for this torrent and close │ │ │ │ │ +all file handles. This is done asynchronously and you will be notified that │ │ │ │ │ +it's complete through _c_a_c_h_e___f_l_u_s_h_e_d___a_l_e_r_t. │ │ │ │ │ +Note that by the time you get the _a_l_e_r_t, libtorrent may have cached more data │ │ │ │ │ +for the torrent, but you are guaranteed that whatever cached data libtorrent │ │ │ │ │ +had by the time you called torrent_handle::flush_cache() has been written to │ │ │ │ │ +disk. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ffoorrccee__rreecchheecckk(()) ********** │ │ │ │ │ +void ffoorrccee__rreecchheecckk () const; │ │ │ │ │ +force_recheck puts the torrent back in a state where it assumes to have no │ │ │ │ │ +resume data. All peers will be disconnected and the torrent will stop │ │ │ │ │ +announcing to the tracker. The torrent will be added to the checking queue, and │ │ │ │ │ +will be checked (all the files will be read and compared to the piece hashes). │ │ │ │ │ +Once the check is complete, the torrent will start connecting to peers again, │ │ │ │ │ +as normal. The torrent will be placed last in queue, i.e. its queue position │ │ │ │ │ +will be the highest of all torrents in the _s_e_s_s_i_o_n. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ssaavvee__rreessuummee__ddaattaa(()) ********** │ │ │ │ │ +void ssaavvee__rreessuummee__ddaattaa (resume_data_flags_t flags = {}) const; │ │ │ │ │ +save_resume_data() asks libtorrent to generate fast-resume data for this │ │ │ │ │ +torrent. The fast resume data (stored in an _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s object) can be │ │ │ │ │ +used to resume a torrent in the next _s_e_s_s_i_o_n without having to check all files │ │ │ │ │ +for which pieces have been downloaded. It can also be used to save a .torrent │ │ │ │ │ +file for a _t_o_r_r_e_n_t___h_a_n_d_l_e. │ │ │ │ │ +This operation is asynchronous, save_resume_data will return immediately. The │ │ │ │ │ +resume data is delivered when it's done through a _s_a_v_e___r_e_s_u_m_e___d_a_t_a___a_l_e_r_t. │ │ │ │ │ +The operation will fail, and post a _s_a_v_e___r_e_s_u_m_e___d_a_t_a___f_a_i_l_e_d___a_l_e_r_t instead, in │ │ │ │ │ +the following cases: │ │ │ │ │ + 1. The torrent is in the process of being removed. │ │ │ │ │ + 2. No torrent state has changed since the last saving of resume │ │ │ │ │ + data, and the only_if_modified flag is set. metadata (see │ │ │ │ │ + libtorrent's _m_e_t_a_d_a_t_a_ _f_r_o_m_ _p_e_e_r_s extension) │ │ │ │ │ +Note that some _c_o_u_n_t_e_r_s may be outdated by the time you receive the fast resume │ │ │ │ │ +data │ │ │ │ │ +When saving resume data because of shutting down, make sure not to │ │ │ │ │ +_r_e_m_o_v_e___t_o_r_r_e_n_t_(_) before you receive the _s_a_v_e___r_e_s_u_m_e___d_a_t_a___a_l_e_r_t. There's no need │ │ │ │ │ +to pause the _s_e_s_s_i_o_n or torrent when saving resume data. │ │ │ │ │ +The paused state of a torrent is saved in the resume data, so pausing all │ │ │ │ │ +torrents before saving resume data will all torrents be restored in a paused │ │ │ │ │ +state. │ │ │ │ │ +Note │ │ │ │ │ +It is typically a good idea to save resume data whenever a torrent is completed │ │ │ │ │ +or paused. If you save resume data for torrents when they are paused, you can │ │ │ │ │ +accelerate the shutdown process by not saving resume data again for those │ │ │ │ │ +torrents. Completed torrents should have their resume data saved when they │ │ │ │ │ +complete and on exit, since their statistics might be updated. │ │ │ │ │ +Example code to pause and save resume data for all torrents and wait for the │ │ │ │ │ +alerts: │ │ │ │ │ +extern int outstanding_resume_data; // global counter of outstanding resume │ │ │ │ │ +data │ │ │ │ │ +std::vector handles = ses.get_torrents(); │ │ │ │ │ +for (torrent_handle const& h : handles) try │ │ │ │ │ { │ │ │ │ │ - ddiisskk__bbuuffffeerr__hhoollddeerr (disk_buffer_holder&&) noexcept; │ │ │ │ │ - disk_buffer_holder& ooppeerraattoorr== (disk_buffer_holder&&) & noexcept; │ │ │ │ │ - ddiisskk__bbuuffffeerr__hhoollddeerr (disk_buffer_holder const&) = delete; │ │ │ │ │ - disk_buffer_holder& ooppeerraattoorr== (disk_buffer_holder const&) = delete; │ │ │ │ │ - ddiisskk__bbuuffffeerr__hhoollddeerr (buffer_allocator_interface& alloc │ │ │ │ │ - , char* buf, int sz) noexcept; │ │ │ │ │ - ddiisskk__bbuuffffeerr__hhoollddeerr () noexcept = default; │ │ │ │ │ - ~~ddiisskk__bbuuffffeerr__hhoollddeerr (); │ │ │ │ │ - char* ddaattaa () const noexcept; │ │ │ │ │ - void rreesseett (); │ │ │ │ │ - void sswwaapp (disk_buffer_holder& h) noexcept; │ │ │ │ │ - bool iiss__mmuuttaabbllee () const noexcept; │ │ │ │ │ - explicit operator bbooooll () const noexcept; │ │ │ │ │ - std::ptrdiff_t ssiizzee () const; │ │ │ │ │ -}; │ │ │ │ │ + h.save_resume_data(torrent_handle::only_if_modified); │ │ │ │ │ + ++outstanding_resume_data; │ │ │ │ │ +} │ │ │ │ │ +catch (lt::system_error const& e) │ │ │ │ │ +{ │ │ │ │ │ + // the handle was invalid, ignore this one and move to the next │ │ │ │ │ +} │ │ │ │ │ + │ │ │ │ │ +while (outstanding_resume_data > 0) │ │ │ │ │ +{ │ │ │ │ │ + alert const* a = ses.wait_for_alert(seconds(30)); │ │ │ │ │ + │ │ │ │ │ + // if we don't get an alert within 30 seconds, abort │ │ │ │ │ + if (a == nullptr) break; │ │ │ │ │ + │ │ │ │ │ + std::vector alerts; │ │ │ │ │ + ses.pop_alerts(&alerts); │ │ │ │ │ + │ │ │ │ │ + for (alert* i : alerts) │ │ │ │ │ + { │ │ │ │ │ + if (alert_cast(i)) │ │ │ │ │ + { │ │ │ │ │ + process_alert(i); │ │ │ │ │ + --outstanding_resume_data; │ │ │ │ │ + continue; │ │ │ │ │ + } │ │ │ │ │ + │ │ │ │ │ + save_resume_data_alert const* rd = │ │ │ │ │ +alert_cast(i); │ │ │ │ │ + if (rd == nullptr) │ │ │ │ │ + { │ │ │ │ │ + process_alert(i); │ │ │ │ │ + continue; │ │ │ │ │ + } │ │ │ │ │ + │ │ │ │ │ + std::ofstream out((rd->params.save_path │ │ │ │ │ + + "/" + rd->params.name + ".fastresume").c_str() │ │ │ │ │ + , std::ios_base::binary); │ │ │ │ │ + std::vector buf = write_resume_data_buf(rd->params); │ │ │ │ │ + out.write(buf.data(), buf.size()); │ │ │ │ │ + --outstanding_resume_data; │ │ │ │ │ + } │ │ │ │ │ +} │ │ │ │ │ +Note │ │ │ │ │ +Note how outstanding_resume_data is a global counter in this example. This is │ │ │ │ │ +deliberate, otherwise there is a race condition for torrents that was just │ │ │ │ │ +asked to save their resume data, they posted the _a_l_e_r_t, but it has not been │ │ │ │ │ +received yet. Those torrents would report that they don't need to save resume │ │ │ │ │ +data again, and skipped by the initial loop, and thwart the counter otherwise. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddiisskk__bbuuffffeerr__hhoollddeerr(()) ********** │ │ │ │ │ -ddiisskk__bbuuffffeerr__hhoollddeerr (buffer_allocator_interface& alloc │ │ │ │ │ - , char* buf, int sz) noexcept; │ │ │ │ │ -construct a buffer holder that will free the held buffer using a disk buffer │ │ │ │ │ -pool directly (there's only one disk_buffer_pool per _s_e_s_s_i_o_n) │ │ │ │ │ +********** nneeeedd__ssaavvee__rreessuummee__ddaattaa(()) ********** │ │ │ │ │ +bool nneeeedd__ssaavvee__rreessuummee__ddaattaa (resume_data_flags_t flags) const; │ │ │ │ │ +bool nneeeedd__ssaavvee__rreessuummee__ddaattaa () const; │ │ │ │ │ +This function returns true if anything that is stored in the resume data has │ │ │ │ │ +changed since the last time resume data was saved. The overload that takes │ │ │ │ │ +flags let you ask if specific categories of properties have changed. These │ │ │ │ │ +flags have the same behavior as in the _s_a_v_e___r_e_s_u_m_e___d_a_t_a_(_) call. │ │ │ │ │ +This is a bblloocckkiinngg call. It will wait for a response from libtorrent's main │ │ │ │ │ +thread. A way to avoid blocking is to instead call _s_a_v_e___r_e_s_u_m_e___d_a_t_a_(_) directly, │ │ │ │ │ +specifying the conditions under which resume data should be saved. │ │ │ │ │ +Note │ │ │ │ │ +A torrent's resume data is considered saved as soon as the │ │ │ │ │ +_s_a_v_e___r_e_s_u_m_e___d_a_t_a___a_l_e_r_t is posted. It is important to make sure this _a_l_e_r_t is │ │ │ │ │ +received and handled in order for this function to be meaningful. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddiisskk__bbuuffffeerr__hhoollddeerr(()) ********** │ │ │ │ │ -ddiisskk__bbuuffffeerr__hhoollddeerr () noexcept = default; │ │ │ │ │ -default construct a holder that does not own any buffer │ │ │ │ │ +********** qquueeuuee__ppoossiittiioonn(()) qquueeuuee__ppoossiittiioonn__bboottttoomm(()) qquueeuuee__ppoossiittiioonn__ddoowwnn(()) │ │ │ │ │ +qquueeuuee__ppoossiittiioonn__uupp(()) qquueeuuee__ppoossiittiioonn__ttoopp(()) ********** │ │ │ │ │ +void qquueeuuee__ppoossiittiioonn__bboottttoomm () const; │ │ │ │ │ +void qquueeuuee__ppoossiittiioonn__ddoowwnn () const; │ │ │ │ │ +void qquueeuuee__ppoossiittiioonn__ttoopp () const; │ │ │ │ │ +void qquueeuuee__ppoossiittiioonn__uupp () const; │ │ │ │ │ +queue_position_t qquueeuuee__ppoossiittiioonn () const; │ │ │ │ │ +Every torrent that is added is assigned a queue position exactly one greater │ │ │ │ │ +than the greatest queue position of all existing torrents. Torrents that are │ │ │ │ │ +being seeded have -1 as their queue position, since they're no longer in line │ │ │ │ │ +to be downloaded. │ │ │ │ │ +When a torrent is removed or turns into a seed, all torrents with greater queue │ │ │ │ │ +positions have their positions decreased to fill in the space in the sequence. │ │ │ │ │ +queue_position() returns the torrent's position in the download queue. The │ │ │ │ │ +torrents with the smallest numbers are the ones that are being downloaded. The │ │ │ │ │ +smaller number, the closer the torrent is to the front of the line to be │ │ │ │ │ +started. │ │ │ │ │ +The queue position is also available in the _t_o_r_r_e_n_t___s_t_a_t_u_s. │ │ │ │ │ +The queue_position_*() functions adjust the torrents position in the queue. Up │ │ │ │ │ +means closer to the front and down means closer to the back of the queue. Top │ │ │ │ │ +and bottom refers to the front and the back of the queue respectively. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ~~ddiisskk__bbuuffffeerr__hhoollddeerr(()) ********** │ │ │ │ │ -~~ddiisskk__bbuuffffeerr__hhoollddeerr (); │ │ │ │ │ -frees disk buffer held by this object │ │ │ │ │ +********** qquueeuuee__ppoossiittiioonn__sseett(()) ********** │ │ │ │ │ +void qquueeuuee__ppoossiittiioonn__sseett (queue_position_t p) const; │ │ │ │ │ +updates the position in the queue for this torrent. The relative order of all │ │ │ │ │ +other torrents remain intact but their numerical queue position shifts to make │ │ │ │ │ +space for this torrent's new position │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddaattaa(()) ********** │ │ │ │ │ -char* ddaattaa () const noexcept; │ │ │ │ │ -return a pointer to the held buffer, if any. Otherwise returns nullptr. │ │ │ │ │ +********** sseett__ssssll__cceerrttiiffiiccaattee(()) sseett__ssssll__cceerrttiiffiiccaattee__bbuuffffeerr(()) ********** │ │ │ │ │ +void sseett__ssssll__cceerrttiiffiiccaattee__bbuuffffeerr (std::string const& certificate │ │ │ │ │ + , std::string const& private_key │ │ │ │ │ + , std::string const& dh_params); │ │ │ │ │ +void sseett__ssssll__cceerrttiiffiiccaattee (std::string const& certificate │ │ │ │ │ + , std::string const& private_key │ │ │ │ │ + , std::string const& dh_params │ │ │ │ │ + , std::string const& passphrase = ""); │ │ │ │ │ +For SSL torrents, use this to specify a path to a .pem file to use as this │ │ │ │ │ +client's certificate. The certificate must be signed by the certificate in the │ │ │ │ │ +.torrent file to be valid. │ │ │ │ │ +The _s_e_t___s_s_l___c_e_r_t_i_f_i_c_a_t_e___b_u_f_f_e_r_(_) overload takes the actual certificate, private │ │ │ │ │ +key and DH params as strings, rather than paths to files. │ │ │ │ │ +cert is a path to the (signed) certificate in .pem format corresponding to this │ │ │ │ │ +torrent. │ │ │ │ │ +private_key is a path to the private key for the specified certificate. This │ │ │ │ │ +must be in .pem format. │ │ │ │ │ +dh_params is a path to the Diffie-Hellman parameter file, which needs to be in │ │ │ │ │ +.pem format. You can generate this file using the openssl command like this: │ │ │ │ │ +openssl dhparam -outform PEM -out dhparams.pem 512. │ │ │ │ │ +passphrase may be specified if the private key is encrypted and requires a │ │ │ │ │ +passphrase to be decrypted. │ │ │ │ │ +Note that when a torrent first starts up, and it needs a certificate, it will │ │ │ │ │ +suspend connecting to any peers until it has one. It's typically desirable to │ │ │ │ │ +resume the torrent after setting the SSL certificate. │ │ │ │ │ +If you receive a _t_o_r_r_e_n_t___n_e_e_d___c_e_r_t___a_l_e_r_t, you need to call this to provide a │ │ │ │ │ +valid cert. If you don't have a cert you won't be allowed to connect to any │ │ │ │ │ +peers. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** rreesseett(()) ********** │ │ │ │ │ -void rreesseett (); │ │ │ │ │ -free the held disk buffer, if any, and clear the holder. This sets the holder │ │ │ │ │ -object to a default-constructed state │ │ │ │ │ +********** ttoorrrreenntt__ffiillee(()) ttoorrrreenntt__ffiillee__wwiitthh__hhaasshheess(()) ********** │ │ │ │ │ +std::shared_ptr ttoorrrreenntt__ffiillee__wwiitthh__hhaasshheess () const; │ │ │ │ │ +std::shared_ptr ttoorrrreenntt__ffiillee () const; │ │ │ │ │ +_t_o_r_r_e_n_t___f_i_l_e_(_) returns a pointer to the _t_o_r_r_e_n_t___i_n_f_o object associated with │ │ │ │ │ +this torrent. The _t_o_r_r_e_n_t___i_n_f_o object may be a copy of the internal object. If │ │ │ │ │ +the torrent doesn't have metadata, the pointer will not be initialized (i.e. a │ │ │ │ │ +nullptr). The torrent may be in a state without metadata only if it was started │ │ │ │ │ +without a .torrent file, e.g. by being added by magnet link. │ │ │ │ │ +Note that the _t_o_r_r_e_n_t___i_n_f_o object returned here may be a different instance │ │ │ │ │ +than the one added to the _s_e_s_s_i_o_n, with different attributes like piece layers, │ │ │ │ │ +dht nodes and trackers. A _t_o_r_r_e_n_t___i_n_f_o object does not round-trip cleanly when │ │ │ │ │ +added to a _s_e_s_s_i_o_n. │ │ │ │ │ +If you want to save a .torrent file from the _t_o_r_r_e_n_t___h_a_n_d_l_e, instead call │ │ │ │ │ +_s_a_v_e___r_e_s_u_m_e___d_a_t_a_(_) and _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e_(_) the _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s object │ │ │ │ │ +passed back in the _a_l_e_r_t. │ │ │ │ │ +_t_o_r_r_e_n_t___f_i_l_e___w_i_t_h___h_a_s_h_e_s_(_) returns a ccooppyy of the internal _t_o_r_r_e_n_t___i_n_f_o and │ │ │ │ │ +piece layer hashes (if it's a v2 torrent). The piece layers will only be │ │ │ │ │ +included if they are available. If this torrent was added from a .torrent file │ │ │ │ │ +with piece layers or if it's seeding, the piece layers are available. This │ │ │ │ │ +function is more expensive than _t_o_r_r_e_n_t___f_i_l_e_(_) since it needs to make copies of │ │ │ │ │ +this information. │ │ │ │ │ +The _t_o_r_r_e_n_t___f_i_l_e___w_i_t_h___h_a_s_h_e_s_(_) is here for backwards compatibility when │ │ │ │ │ +constructing a _c_r_e_a_t_e___t_o_r_r_e_n_t object from a _t_o_r_r_e_n_t___i_n_f_o that's in a _s_e_s_s_i_o_n. │ │ │ │ │ +Prefer _s_a_v_e___r_e_s_u_m_e___d_a_t_a_(_) + _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e_(_). │ │ │ │ │ +Note that a torrent added from a magnet link may not have the full merkle trees │ │ │ │ │ +for all files, and hence not have the complete piece layers. In that state, you │ │ │ │ │ +cannot create a .torrent file even from the _t_o_r_r_e_n_t___i_n_f_o returned from │ │ │ │ │ +_t_o_r_r_e_n_t___f_i_l_e___w_i_t_h___h_a_s_h_e_s_(_). Once the torrent completes downloading all files, │ │ │ │ │ +becoming a seed, you can make a .torrent file from it. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sswwaapp(()) ********** │ │ │ │ │ -void sswwaapp (disk_buffer_holder& h) noexcept; │ │ │ │ │ -swap pointers of two disk buffer holders. │ │ │ │ │ +********** ppiieeccee__llaayyeerrss(()) ********** │ │ │ │ │ +std::vector> ppiieeccee__llaayyeerrss () const; │ │ │ │ │ +returns the piece layers for all files in the torrent. If this is a v1 torrent │ │ │ │ │ +(and doesn't have any piece layers) it returns an empty vector. This is a │ │ │ │ │ +blocking call that will synchronize with the libtorrent network thread. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** iiss__mmuuttaabbllee(()) ********** │ │ │ │ │ -bool iiss__mmuuttaabbllee () const noexcept; │ │ │ │ │ -if this returns true, the buffer may not be modified in place │ │ │ │ │ +********** ppoosstt__ppiieeccee__aavvaaiillaabbiilliittyy(()) ppiieeccee__aavvaaiillaabbiilliittyy(()) ********** │ │ │ │ │ +void ppiieeccee__aavvaaiillaabbiilliittyy (std::vector& avail) const; │ │ │ │ │ +void ppoosstt__ppiieeccee__aavvaaiillaabbiilliittyy () const; │ │ │ │ │ +The piece availability is the number of peers that we are connected that has │ │ │ │ │ +advertised having a particular piece. This is the information that libtorrent │ │ │ │ │ +uses in order to prefer picking rare pieces. │ │ │ │ │ +post_piece_availability() will trigger a _p_i_e_c_e___a_v_a_i_l_a_b_i_l_i_t_y___a_l_e_r_t to be posted. │ │ │ │ │ +piece_availability() fills the specified std::vector with the availability │ │ │ │ │ +for each piece in this torrent. libtorrent does not keep track of availability │ │ │ │ │ +for seeds, so if the torrent is seeding the availability for all pieces is │ │ │ │ │ +reported as 0. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** bbooooll(()) ********** │ │ │ │ │ -explicit operator bbooooll () const noexcept; │ │ │ │ │ -implicitly convertible to true if the object is currently holding a buffer │ │ │ │ │ +********** ggeett__ppiieeccee__pprriioorriittiieess(()) ppiieeccee__pprriioorriittyy(()) pprriioorriittiizzee__ppiieecceess(()) ********** │ │ │ │ │ +void pprriioorriittiizzee__ppiieecceess (std::vector> const& pieces) const; │ │ │ │ │ +download_priority_t ppiieeccee__pprriioorriittyy (piece_index_t index) const; │ │ │ │ │ +void ppiieeccee__pprriioorriittyy (piece_index_t index, download_priority_t priority) const; │ │ │ │ │ +std::vector ggeett__ppiieeccee__pprriioorriittiieess () const; │ │ │ │ │ +void pprriioorriittiizzee__ppiieecceess (std::vector const& pieces) const; │ │ │ │ │ +These functions are used to set and get the priority of individual pieces. By │ │ │ │ │ +default all pieces have priority 4. 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 priority levels. 0 means not to │ │ │ │ │ +download the piece at all. Otherwise, lower priority values means less likely │ │ │ │ │ +to be picked. Piece priority takes precedence over piece availability. Every │ │ │ │ │ +piece with priority 7 will be attempted to be picked before a priority 6 piece │ │ │ │ │ +and so on. │ │ │ │ │ +The default priority of pieces is 4. │ │ │ │ │ +Piece priorities can not be changed for torrents that have not downloaded the │ │ │ │ │ +metadata yet. Magnet links won't have metadata immediately. see the │ │ │ │ │ +_m_e_t_a_d_a_t_a___r_e_c_e_i_v_e_d___a_l_e_r_t. │ │ │ │ │ +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. The second overload of prioritize_pieces that takes a vector of pairs │ │ │ │ │ +will update the priorities of only select pieces, and leave all other │ │ │ │ │ +unaffected. Each pair is (piece, priority). That is, the first item is the │ │ │ │ │ +piece index and the second item is the priority of that piece. Invalid entries, │ │ │ │ │ +where the piece index or priority is out of range, are not allowed. │ │ │ │ │ +get_piece_priorities returns a vector with one element for each piece in the │ │ │ │ │ +torrent. Each element is the current priority of that piece. │ │ │ │ │ +It's possible to cancel the effect of ffiillee priorities by setting the priorities │ │ │ │ │ +for the affected pieces. Care has to be taken when mixing usage of file- and │ │ │ │ │ +piece priorities. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ffiillee__ooppeenn__mmooddee__tt ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_d_i_s_k___i_n_t_e_r_f_a_c_e_._h_p_p" │ │ │ │ │ - read_only │ │ │ │ │ - open the file for reading only │ │ │ │ │ - write_only │ │ │ │ │ - open the file for writing only │ │ │ │ │ - read_write │ │ │ │ │ - open the file for reading and writing │ │ │ │ │ - rw_mask │ │ │ │ │ - the mask for the bits determining read or write mode │ │ │ │ │ - sparse │ │ │ │ │ - open the file in sparse mode (if supported by the filesystem). │ │ │ │ │ - no_atime │ │ │ │ │ - don't update the access timestamps on the file (if supported by the │ │ │ │ │ - operating system and filesystem). this generally improves disk │ │ │ │ │ - performance. │ │ │ │ │ - random_access │ │ │ │ │ - When this is not set, the kernel is hinted that access to this file will │ │ │ │ │ - be made sequentially. │ │ │ │ │ - mmapped │ │ │ │ │ - the file is memory mapped │ │ │ │ │ +********** pprriioorriittiizzee__ffiilleess(()) ggeett__ffiillee__pprriioorriittiieess(()) ffiillee__pprriioorriittyy(()) ********** │ │ │ │ │ +void pprriioorriittiizzee__ffiilleess (std::vector const& files) const; │ │ │ │ │ +void ffiillee__pprriioorriittyy (file_index_t index, download_priority_t priority) const; │ │ │ │ │ +download_priority_t ffiillee__pprriioorriittyy (file_index_t index) const; │ │ │ │ │ +std::vector ggeett__ffiillee__pprriioorriittiieess () const; │ │ │ │ │ +index must be in the range [0, number_of_files). │ │ │ │ │ +file_priority() queries or sets the priority of file index. │ │ │ │ │ +prioritize_files() takes a vector that has at as many elements as there are │ │ │ │ │ +files in the torrent. Each _e_n_t_r_y is the priority of that file. The function │ │ │ │ │ +sets the priorities of all the pieces in the torrent based on the vector. │ │ │ │ │ +get_file_priorities() returns a vector with the priorities of all files. │ │ │ │ │ +The priority values are the same as for _p_i_e_c_e___p_r_i_o_r_i_t_y_(_). See │ │ │ │ │ +_d_o_w_n_l_o_a_d___p_r_i_o_r_i_t_y___t. │ │ │ │ │ +Whenever a file priority is changed, all other piece priorities are reset to │ │ │ │ │ +match the file priorities. In order to maintain special priorities for │ │ │ │ │ +particular pieces, _p_i_e_c_e___p_r_i_o_r_i_t_y_(_) has to be called again for those pieces. │ │ │ │ │ +You cannot set the file priorities on a torrent that does not yet have metadata │ │ │ │ │ +or a torrent that is a seed. file_priority(int, int) and _p_r_i_o_r_i_t_i_z_e___f_i_l_e_s_(_) are │ │ │ │ │ +both no-ops for such torrents. │ │ │ │ │ +Since changing file priorities may involve disk operations (of moving files in- │ │ │ │ │ +and out of the part file), the internal accounting of file priorities happen │ │ │ │ │ +asynchronously. i.e. setting file priorities and then immediately querying them │ │ │ │ │ +may not yield the same priorities just set. To synchronize with the priorities │ │ │ │ │ +taking effect, wait for the _f_i_l_e___p_r_i_o___a_l_e_r_t. │ │ │ │ │ +When combining file- and piece priorities, the resume file will record both. │ │ │ │ │ +When loading the resume data, the file priorities will be applied first, then │ │ │ │ │ +the piece priorities. │ │ │ │ │ +Moving data from a file into the part file is currently not supported. If a │ │ │ │ │ +file has its priority set to 0 aafftteerr it has already been created, it will not │ │ │ │ │ +be moved into the partfile. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ffoorrccee__llssdd__aannnnoouunnccee(()) ffoorrccee__ddhhtt__aannnnoouunnccee(()) ffoorrccee__rreeaannnnoouunnccee(()) ********** │ │ │ │ │ +void ffoorrccee__rreeaannnnoouunnccee (int seconds = 0, int idx = -1, reannounce_flags_t = {}) │ │ │ │ │ +const; │ │ │ │ │ +void ffoorrccee__llssdd__aannnnoouunnccee () const; │ │ │ │ │ +void ffoorrccee__ddhhtt__aannnnoouunnccee () const; │ │ │ │ │ +force_reannounce() will force this torrent to do another tracker request, to │ │ │ │ │ +receive new peers. The seconds argument specifies how many seconds from now to │ │ │ │ │ +issue the tracker announces. │ │ │ │ │ +If the tracker's min_interval has not passed since the last announce, the │ │ │ │ │ +forced announce will be scheduled to happen immediately as the min_interval │ │ │ │ │ +expires. This is to honor trackers minimum re-announce interval settings. │ │ │ │ │ +The tracker_index argument specifies which tracker to re-announce. If set to - │ │ │ │ │ +1 (which is the default), all trackers are re-announce. │ │ │ │ │ +The flags argument can be used to affect the re-announce. See │ │ │ │ │ +ignore_min_interval. │ │ │ │ │ +force_dht_announce will announce the torrent to the DHT immediately. │ │ │ │ │ +force_lsd_announce will announce the torrent on LSD immediately. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ssccrraappee__ttrraacckkeerr(()) ********** │ │ │ │ │ +void ssccrraappee__ttrraacckkeerr (int idx = -1) const; │ │ │ │ │ +scrape_tracker() will send a scrape request to a tracker. By default (idx = -1) │ │ │ │ │ +it will scrape the last working tracker. If idx is >= 0, the tracker with the │ │ │ │ │ +specified index will scraped. │ │ │ │ │ +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 _t_o_r_r_e_n_t___s_t_a_t_u_s struct once it completes. When it completes, it │ │ │ │ │ +will generate a _s_c_r_a_p_e___r_e_p_l_y___a_l_e_r_t. If it fails, it will generate a │ │ │ │ │ +_s_c_r_a_p_e___f_a_i_l_e_d___a_l_e_r_t. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** sseett__uuppllooaadd__lliimmiitt(()) uuppllooaadd__lliimmiitt(()) sseett__ddoowwnnllooaadd__lliimmiitt(()) ddoowwnnllooaadd__lliimmiitt(()) │ │ │ │ │ +********** │ │ │ │ │ +void sseett__uuppllooaadd__lliimmiitt (int limit) const; │ │ │ │ │ +void sseett__ddoowwnnllooaadd__lliimmiitt (int limit) const; │ │ │ │ │ +int ddoowwnnllooaadd__lliimmiitt () const; │ │ │ │ │ +int uuppllooaadd__lliimmiitt () 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 (settings_pack::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. │ │ │ │ │ +Local peers are not rate limited by default. see _p_e_e_r_ _c_l_a_s_s_e_s. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ccoonnnneecctt__ppeeeerr(()) ********** │ │ │ │ │ +void ccoonnnneecctt__ppeeeerr (tcp::endpoint const& adr, peer_source_flags_t source = {} │ │ │ │ │ + , pex_flags_t flags = pex_encryption | pex_utp | pex_holepunch) 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 system_error. The │ │ │ │ │ +second (optional) argument will be bitwise ORed into the source mask of this │ │ │ │ │ +peer. Typically this is one of the source flags in _p_e_e_r___i_n_f_o. i.e. tracker, │ │ │ │ │ +pex, dht etc. │ │ │ │ │ +For possible values of flags, see _p_e_x___f_l_a_g_s___t. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** cclleeaarr__ppeeeerrss(()) ********** │ │ │ │ │ +void cclleeaarr__ppeeeerrss (); │ │ │ │ │ +This will disconnect all peers and clear the peer list for this torrent. New │ │ │ │ │ +peers will have to be acquired before resuming, from trackers, DHT or local │ │ │ │ │ +service discovery, for example. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** mmaaxx__uuppllooaaddss(()) sseett__mmaaxx__uuppllooaaddss(()) ********** │ │ │ │ │ +void sseett__mmaaxx__uuppllooaaddss (int max_uploads) const; │ │ │ │ │ +int mmaaxx__uuppllooaaddss () 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. This │ │ │ │ │ +defaults to infinite. The primary setting controlling this is the global │ │ │ │ │ +unchoke slots limit, set by unchoke_slots_limit in _s_e_t_t_i_n_g_s___p_a_c_k. │ │ │ │ │ +max_uploads() returns the current settings. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** mmaaxx__ccoonnnneeccttiioonnss(()) sseett__mmaaxx__ccoonnnneeccttiioonnss(()) ********** │ │ │ │ │ +void sseett__mmaaxx__ccoonnnneeccttiioonnss (int max_connections) const; │ │ │ │ │ +int mmaaxx__ccoonnnneeccttiioonnss () const; │ │ │ │ │ +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. There is also a global limit of the number of connections, set by │ │ │ │ │ +connections_limit in _s_e_t_t_i_n_g_s___p_a_c_k. │ │ │ │ │ +max_connections() returns the current settings. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** mmoovvee__ssttoorraaggee(()) ********** │ │ │ │ │ +void mmoovvee__ssttoorraaggee (std::string const& save_path │ │ │ │ │ + , move_flags_t flags = move_flags_t::always_replace_files │ │ │ │ │ + ) const; │ │ │ │ │ +Moves the file(s) that this torrent are currently seeding from or downloading │ │ │ │ │ +to. If the given save_path is not located on the same drive as the original │ │ │ │ │ +save path, the files will be copied to the new drive and removed from their │ │ │ │ │ +original location. This will block all other disk IO, and other torrents │ │ │ │ │ +download and upload rates may drop while copying the file. │ │ │ │ │ +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. If the move fails for some reason, │ │ │ │ │ +storage_moved_failed_alert is generated instead, containing the error message. │ │ │ │ │ +The flags argument determines the behavior of the copying/moving of the files │ │ │ │ │ +in the torrent. see _m_o_v_e___f_l_a_g_s___t. │ │ │ │ │ +always_replace_files is the default and replaces any file that exist in both │ │ │ │ │ +the source directory and the target directory. │ │ │ │ │ +fail_if_exist first check to see that none of the copy operations would cause │ │ │ │ │ +an overwrite. If it would, it will fail. Otherwise it will proceed as if it was │ │ │ │ │ +in always_replace_files mode. Note that there is an inherent race condition │ │ │ │ │ +here. If the files in the target directory appear after the check but before │ │ │ │ │ +the copy or move completes, they will be overwritten. When failing because of │ │ │ │ │ +files already existing in the target path, the error of │ │ │ │ │ +move_storage_failed_alert is set to boost::system::errc::file_exists. │ │ │ │ │ +The intention is that a client may use this as a probe, and if it fails, ask │ │ │ │ │ +the user which mode to use. The client may then re-issue the move_storage call │ │ │ │ │ +with one of the other modes. │ │ │ │ │ +dont_replace always keeps the existing file in the target directory, if there │ │ │ │ │ +is one. The source files will still be removed in that case. Note that it won't │ │ │ │ │ +automatically re-check files. If an incomplete torrent is moved into a │ │ │ │ │ +directory with the complete files, pause, move, force-recheck and resume. │ │ │ │ │ +Without the re-checking, the torrent will keep downloading and files in the new │ │ │ │ │ +download directory will be overwritten. │ │ │ │ │ +Files that have been renamed to have absolute paths are not moved by this │ │ │ │ │ +function. Keep in mind that files that don't belong to the torrent but are │ │ │ │ │ +stored in the torrent's directory may be moved as well. This goes for files │ │ │ │ │ +that have been renamed to absolute paths that still end up inside the save │ │ │ │ │ +path. │ │ │ │ │ +When copying files, sparse regions are not likely to be preserved. This makes │ │ │ │ │ +it proportionally more expensive to move a large torrent when only few pieces │ │ │ │ │ +have been downloaded, since the files are then allocated with zeros in the │ │ │ │ │ +destination directory. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** rreennaammee__ffiillee(()) ********** │ │ │ │ │ +void rreennaammee__ffiillee (file_index_t index, std::string const& new_name) const; │ │ │ │ │ +Renames the file with the given index asynchronously. The rename operation is │ │ │ │ │ +complete when either a _f_i_l_e___r_e_n_a_m_e_d___a_l_e_r_t or _f_i_l_e___r_e_n_a_m_e___f_a_i_l_e_d___a_l_e_r_t is │ │ │ │ │ +posted. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** iinnffoo__hhaasshheess(()) iinnffoo__hhaasshh(()) ********** │ │ │ │ │ +sha1_hash iinnffoo__hhaasshh () const; │ │ │ │ │ +info_hash_t iinnffoo__hhaasshheess () const; │ │ │ │ │ +returns the info-hash(es) of the torrent. If this handle is to a torrent that │ │ │ │ │ +hasn't loaded yet (for instance by being added) by a URL, the returned value is │ │ │ │ │ +undefined. The info_hash() returns the SHA-1 info-hash for v1 torrents and a │ │ │ │ │ +truncated hash for v2 torrents. For the full v2 info-hash, use info_hashes() │ │ │ │ │ +instead. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** ooppeerraattoorr<<(()) ooppeerraattoorr====(()) ooppeerraattoorr!!==(()) ********** │ │ │ │ │ +bool ooppeerraattoorr==== (const torrent_handle& h) const; │ │ │ │ │ +bool ooppeerraattoorr!!== (const torrent_handle& h) const; │ │ │ │ │ +bool ooppeerraattoorr<< (const torrent_handle& h) const; │ │ │ │ │ +comparison operators. The order of the torrents is unspecified but stable. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** iidd(()) ********** │ │ │ │ │ +std::uint32_t iidd () const; │ │ │ │ │ +returns a unique identifier for this torrent. It's not a dense index. It's not │ │ │ │ │ +preserved across sessions. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** nnaattiivvee__hhaannddllee(()) ********** │ │ │ │ │ +std::shared_ptr nnaattiivvee__hhaannddllee () const; │ │ │ │ │ +This function is intended only for use by plugins and the _a_l_e_r_t dispatch │ │ │ │ │ +function. This type does not have a stable ABI and should be relied on as │ │ │ │ │ +little as possible. Accessing the handle returned by this function is not │ │ │ │ │ +thread safe outside of libtorrent's internal thread (which is used to invoke │ │ │ │ │ +_p_l_u_g_i_n callbacks). The torrent class is not only eligible for changing ABI │ │ │ │ │ +across minor versions of libtorrent, its layout is also dependent on build │ │ │ │ │ +configuration. This adds additional requirements on a client to be built with │ │ │ │ │ +the exact same build configuration as libtorrent itself. i.e. the TORRENT_ │ │ │ │ │ +macros must match between libtorrent and the client builds. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** uusseerrddaattaa(()) ********** │ │ │ │ │ +client_data_t uusseerrddaattaa () const; │ │ │ │ │ +returns the userdata pointer as set in _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +********** iinn__sseessssiioonn(()) ********** │ │ │ │ │ +bool iinn__sseessssiioonn () const; │ │ │ │ │ +Returns true if the torrent is in the _s_e_s_s_i_o_n. It returns true before session:: │ │ │ │ │ +remove_torrent() is called, and false afterward. │ │ │ │ │ +Note that this is a blocking function, unlike _t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_i_s___v_a_l_i_d_(_) which │ │ │ │ │ +returns immediately. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + overwrite_existing │ │ │ │ │ + instruct libtorrent to overwrite any data that may already have been │ │ │ │ │ + downloaded with the data of the new piece being added. Using this flag │ │ │ │ │ + when adding a piece that is actively being downloaded from other peers │ │ │ │ │ + may have some unexpected consequences, as blocks currently being │ │ │ │ │ + downloaded from peers may not be replaced. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + query_distributed_copies │ │ │ │ │ + calculates distributed_copies, distributed_full_copies and │ │ │ │ │ + distributed_fraction. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + query_accurate_download_counters │ │ │ │ │ + includes partial downloaded blocks in total_done and total_wanted_done. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + query_last_seen_complete │ │ │ │ │ + includes last_seen_complete. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + query_pieces │ │ │ │ │ + populate the pieces field in _t_o_r_r_e_n_t___s_t_a_t_u_s. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + query_verified_pieces │ │ │ │ │ + includes verified_pieces (only applies to torrents in sseeeedd mmooddee). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + query_torrent_file │ │ │ │ │ + includes torrent_file, which is all the static information from the │ │ │ │ │ + .torrent file. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + query_name │ │ │ │ │ + includes name, the name of the torrent. This is either derived from the │ │ │ │ │ + .torrent file, or from the &dn= magnet link argument or possibly some │ │ │ │ │ + other source. If the name of the torrent is not known, this is an empty │ │ │ │ │ + string. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + query_save_path │ │ │ │ │ + includes save_path, the path to the directory the files of the torrent │ │ │ │ │ + are saved to. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + alert_when_available │ │ │ │ │ + used to ask libtorrent to send an _a_l_e_r_t once the piece has been │ │ │ │ │ + downloaded, by passing alert_when_available. When set, the │ │ │ │ │ + _r_e_a_d___p_i_e_c_e___a_l_e_r_t _a_l_e_r_t will be delivered, with the piece data, when it's │ │ │ │ │ + downloaded. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + piece_granularity │ │ │ │ │ + only calculate file progress at piece granularity. This makes the │ │ │ │ │ + _f_i_l_e___p_r_o_g_r_e_s_s_(_) call cheaper and also only takes bytes that have passed │ │ │ │ │ + the hash check into account, so progress cannot regress in this mode. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + graceful_pause │ │ │ │ │ + will delay the disconnect of peers that we're still downloading │ │ │ │ │ + outstanding requests from. The torrent will not accept any more requests │ │ │ │ │ + and will disconnect all idle peers. As soon as a peer is done │ │ │ │ │ + transferring the blocks that were requested from it, it is disconnected. │ │ │ │ │ + This is a graceful shut down of the torrent in the sense that no │ │ │ │ │ + downloaded bytes are wasted. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + flush_disk_cache │ │ │ │ │ + the disk cache will be flushed before creating the resume data. This │ │ │ │ │ + avoids a problem with file timestamps in the resume data in case the │ │ │ │ │ + cache hasn't been flushed yet. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + save_info_dict │ │ │ │ │ + the resume data will contain the metadata from the torrent file as well. │ │ │ │ │ + This is useful for clients that don't keep .torrent files around │ │ │ │ │ + separately, or for torrents that were added via a magnet link. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + only_if_modified │ │ │ │ │ + this flag has the same behavior as the combination of: │ │ │ │ │ + if_counters_changed | if_download_progress | if_config_changed | │ │ │ │ │ + if_state_changed | if_metadata_changed │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + if_counters_changed │ │ │ │ │ + save resume data if any _c_o_u_n_t_e_r_s has changed since the last time resume │ │ │ │ │ + data was saved. This includes upload/download _c_o_u_n_t_e_r_s, active time │ │ │ │ │ + _c_o_u_n_t_e_r_s and scrape data. A torrent that is not paused will have its │ │ │ │ │ + active time _c_o_u_n_t_e_r_s incremented continuously. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + if_download_progress │ │ │ │ │ + save the resume data if any blocks have been downloaded since the last │ │ │ │ │ + time resume data was saved. This includes: * checking existing files on │ │ │ │ │ + disk * downloading a block from a peer │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + if_config_changed │ │ │ │ │ + save the resume data if configuration options changed since last time the │ │ │ │ │ + resume data was saved. This includes: * file- or piece priorities * │ │ │ │ │ + upload- and download rate limits * change max-uploads (unchoke slots) * │ │ │ │ │ + change max connection limit * enable/disable peer-exchange, local service │ │ │ │ │ + discovery or DHT * enable/disable apply IP-filter * enable/disable auto- │ │ │ │ │ + managed * enable/disable share-mode * enable/disable sequential-mode * │ │ │ │ │ + files renamed * storage moved (save_path changed) │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + if_state_changed │ │ │ │ │ + save the resume data if torrent state has changed since last time the │ │ │ │ │ + resume data was saved. This includes: * upload mode * paused state * │ │ │ │ │ + super-seeding * seed-mode │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + if_metadata_changed │ │ │ │ │ + save the resume data if any mmeettaaddaattaa changed since the last time resume │ │ │ │ │ + data was saved. This includes: * add/remove web seeds * add/remove │ │ │ │ │ + trackers * receiving metadata for a magnet link │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + ignore_min_interval │ │ │ │ │ + by default, force-reannounce will still honor the min-interval published │ │ │ │ │ + by the tracker. If this flag is set, it will be ignored and the tracker │ │ │ │ │ + is announced immediately. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ hhaasshh__vvaalluuee(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___h_a_n_d_l_e_._h_p_p" │ │ │ │ │ +std::size_t hhaasshh__vvaalluuee (torrent_handle const& h); │ │ │ │ │ +for std::hash (and to support using this type in unordered_map etc.) │ │ │ │ │ You have some control over _s_e_s_s_i_o_n configuration through the session:: │ │ │ │ │ apply_settings() member function. To change one or more configuration options, │ │ │ │ │ create a _s_e_t_t_i_n_g_s___p_a_c_k object and fill it with the settings to be set and pass │ │ │ │ │ it in to session::apply_settings(). │ │ │ │ │ The _s_e_t_t_i_n_g_s___p_a_c_k object is a collection of settings updates that are applied │ │ │ │ │ to the _s_e_s_s_i_o_n when passed to session::apply_settings(). It's empty when │ │ │ │ │ constructed. │ │ │ │ │ @@ -10717,22 +11194,22 @@ │ │ │ │ │ of the actual local listening port. │ │ │ │ │ struct settings_pack final : settings_interface │ │ │ │ │ { │ │ │ │ │ friend void aappppllyy__ppaacckk__iimmppll (settings_pack const* │ │ │ │ │ , aux::session_settings_single_thread& │ │ │ │ │ , std::vector*); │ │ │ │ │ void sseett__bbooooll (int name, bool val) override; │ │ │ │ │ - void sseett__ssttrr (int name, std::string val) override; │ │ │ │ │ - void sseett__iinntt (int name, int val) override; │ │ │ │ │ void sseett__iinntt (int name, flags::bitfield_flag const val); │ │ │ │ │ + void sseett__iinntt (int name, int val) override; │ │ │ │ │ + void sseett__ssttrr (int name, std::string val) override; │ │ │ │ │ bool hhaass__vvaall (int name) const override; │ │ │ │ │ void cclleeaarr (); │ │ │ │ │ void cclleeaarr (int name); │ │ │ │ │ - bool ggeett__bbooooll (int name) const override; │ │ │ │ │ std::string const& ggeett__ssttrr (int name) const override; │ │ │ │ │ + bool ggeett__bbooooll (int name) const override; │ │ │ │ │ int ggeett__iinntt (int name) const override; │ │ │ │ │ void ffoorr__eeaacchh (Fun&& f) const; │ │ │ │ │ │ │ │ │ │ enum type_bases │ │ │ │ │ { │ │ │ │ │ string_type_base, │ │ │ │ │ int_type_base, │ │ │ │ │ @@ -10803,19 +11280,19 @@ │ │ │ │ │ socks5, │ │ │ │ │ socks5_pw, │ │ │ │ │ http, │ │ │ │ │ http_pw, │ │ │ │ │ }; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__iinntt(()) sseett__bbooooll(()) sseett__ssttrr(()) ********** │ │ │ │ │ +********** sseett__bbooooll(()) sseett__ssttrr(()) sseett__iinntt(()) ********** │ │ │ │ │ void sseett__bbooooll (int name, bool val) override; │ │ │ │ │ -void sseett__ssttrr (int name, std::string val) override; │ │ │ │ │ -void sseett__iinntt (int name, int val) override; │ │ │ │ │ void sseett__iinntt (int name, flags::bitfield_flag const val); │ │ │ │ │ +void sseett__iinntt (int name, int val) override; │ │ │ │ │ +void sseett__ssttrr (int name, std::string val) override; │ │ │ │ │ set a configuration option in the _s_e_t_t_i_n_g_s___p_a_c_k. name is one of the enum values │ │ │ │ │ from string_types, int_types or bool_types. They must match the respective type │ │ │ │ │ of the set_* function. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** hhaass__vvaall(()) ********** │ │ │ │ │ bool hhaass__vvaall (int name) const override; │ │ │ │ │ queries whether the specified configuration option has a value set in this │ │ │ │ │ @@ -10827,16 +11304,16 @@ │ │ │ │ │ clear the settings pack from all settings │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** cclleeaarr(()) ********** │ │ │ │ │ void cclleeaarr (int name); │ │ │ │ │ clear a specific setting from the pack │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** ggeett__ssttrr(()) ggeett__bbooooll(()) ggeett__iinntt(()) ********** │ │ │ │ │ -bool ggeett__bbooooll (int name) const override; │ │ │ │ │ std::string const& ggeett__ssttrr (int name) const override; │ │ │ │ │ +bool ggeett__bbooooll (int name) const override; │ │ │ │ │ int ggeett__iinntt (int name) const override; │ │ │ │ │ queries the current configuration option from the _s_e_t_t_i_n_g_s___p_a_c_k. name is one of │ │ │ │ │ the enumeration values from string_types, int_types or bool_types. The enum │ │ │ │ │ value must match the type of the get_* function. If the specified setting field │ │ │ │ │ has not been set, the default value is returned. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** eennuumm ttyyppee__bbaasseess ********** │ │ │ │ │ @@ -10964,15 +11441,15 @@ │ │ │ │ │ | | |trackers, a plain proxy will suffice. The proxy is assumed to| │ │ │ │ │ | | |not require authorization. The username and password will not| │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_b_e_ _u_s_e_d_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ | | |The server is assumed to be an HTTP proxy that requires user | │ │ │ │ │ |http_pw |5 |authorization. The username and password will be sent to the | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_r_o_x_y_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ mmiinn__mmeemmoorryy__uussaaggee(()) hhiigghh__ppeerrffoorrmmaannccee__sseeeedd(()) ************ │ │ │ │ │ +************ hhiigghh__ppeerrffoorrmmaannccee__sseeeedd(()) mmiinn__mmeemmoorryy__uussaaggee(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_s_s_i_o_n_._h_p_p" │ │ │ │ │ settings_pack mmiinn__mmeemmoorryy__uussaaggee (); │ │ │ │ │ settings_pack hhiigghh__ppeerrffoorrmmaannccee__sseeeedd (); │ │ │ │ │ The default values of the _s_e_s_s_i_o_n settings are set for a regular bittorrent │ │ │ │ │ client running on a desktop system. There are functions that can set the │ │ │ │ │ _s_e_s_s_i_o_n settings to pre set settings for other environments. These can be used │ │ │ │ │ for the basis, and should be tweaked to fit your needs better. │ │ │ │ │ @@ -10988,14 +11465,26 @@ │ │ │ │ │ This configuration is intended to be the starting point for embedded devices. │ │ │ │ │ It will significantly reduce memory usage. │ │ │ │ │ high_performance_seed returns settings optimized for a seed box, serving many │ │ │ │ │ peers and that doesn't do any downloading. It has a 128 MB disk cache and has a │ │ │ │ │ limit of 400 files in its file pool. It support fast upload rates by allowing │ │ │ │ │ large send buffers. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ sseettttiinngg__bbyy__nnaammee(()) nnaammee__ffoorr__sseettttiinngg(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_t_t_i_n_g_s___p_a_c_k_._h_p_p" │ │ │ │ │ +int sseettttiinngg__bbyy__nnaammee (string_view name); │ │ │ │ │ +char const* nnaammee__ffoorr__sseettttiinngg (int s); │ │ │ │ │ +converts a setting integer (from the enums string_types, int_types or │ │ │ │ │ +bool_types) to a string, and vice versa. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ ddeeffaauulltt__sseettttiinnggss(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_t_t_i_n_g_s___p_a_c_k_._h_p_p" │ │ │ │ │ +settings_pack ddeeffaauulltt__sseettttiinnggss (); │ │ │ │ │ +returns a _s_e_t_t_i_n_g_s___p_a_c_k with every setting set to its default value │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ggeenneerraattee__ffiinnggeerrpprriinntt(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_f_i_n_g_e_r_p_r_i_n_t_._h_p_p" │ │ │ │ │ std::string ggeenneerraattee__ffiinnggeerrpprriinntt (std::string name │ │ │ │ │ , int major, int minor = 0, int revision = 0, int tag = 0); │ │ │ │ │ This is a utility function to produce a client ID fingerprint formatted to the │ │ │ │ │ most common convention. The fingerprint can be set via the peer_fingerprint │ │ │ │ │ setting, in _s_e_t_t_i_n_g_s___p_a_c_k. │ │ │ │ │ @@ -11012,630 +11501,214 @@ │ │ │ │ │ |_B_T_ _ _ _ _ _ _|_B_i_t_T_o_r_r_e_n_t_ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_D_E_ _ _ _ _ _ _|_D_e_l_u_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_A_Z_ _ _ _ _ _ _|_A_z_u_r_e_u_s_ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_T_L_ _ _ _ _ _ _|_T_r_i_b_l_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ There's an informal directory of client id's _h_e_r_e. │ │ │ │ │ The major, minor, revision and tag parameters are used to identify the version │ │ │ │ │ of your client. │ │ │ │ │ +Bencoding is a common representation in bittorrent used for dictionary, list, │ │ │ │ │ +_i_n_t and string hierarchies. It's used to encode .torrent files and some │ │ │ │ │ +messages in the network protocol. libtorrent also uses it to store settings, │ │ │ │ │ +resume data and other _s_e_s_s_i_o_n state. │ │ │ │ │ +Strings in bencoded structures do not necessarily represent text. Strings are │ │ │ │ │ +raw byte buffers of a certain length. If a string is meant to be interpreted as │ │ │ │ │ +text, it is required to be UTF-8 encoded. See _B_E_P_ _3. │ │ │ │ │ +The function for decoding bencoded data _b_d_e_c_o_d_e_(_), returning a _b_d_e_c_o_d_e___n_o_d_e. │ │ │ │ │ +This function builds a tree that points back into the original buffer. The │ │ │ │ │ +returned _b_d_e_c_o_d_e___n_o_d_e will not be valid once the buffer it was parsed out of is │ │ │ │ │ +discarded. │ │ │ │ │ +It's possible to construct an _e_n_t_r_y from a _b_d_e_c_o_d_e___n_o_d_e, if a structure needs │ │ │ │ │ +to be altered and re-encoded. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ sseettttiinngg__bbyy__nnaammee(()) nnaammee__ffoorr__sseettttiinngg(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_t_t_i_n_g_s___p_a_c_k_._h_p_p" │ │ │ │ │ -char const* nnaammee__ffoorr__sseettttiinngg (int s); │ │ │ │ │ -int sseettttiinngg__bbyy__nnaammee (string_view name); │ │ │ │ │ -converts a setting integer (from the enums string_types, int_types or │ │ │ │ │ -bool_types) to a string, and vice versa. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ddeeffaauulltt__sseettttiinnggss(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_e_t_t_i_n_g_s___p_a_c_k_._h_p_p" │ │ │ │ │ -settings_pack ddeeffaauulltt__sseettttiinnggss (); │ │ │ │ │ -returns a _s_e_t_t_i_n_g_s___p_a_c_k with every setting set to its default value │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ssttoorraaggee__eerrrroorr ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_r_r_o_r___c_o_d_e_._h_p_p" │ │ │ │ │ -used by storage to return errors also includes which underlying file the error │ │ │ │ │ -happened on │ │ │ │ │ -struct storage_error │ │ │ │ │ +************ eennttrryy ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_n_t_r_y_._h_p_p" │ │ │ │ │ +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. │ │ │ │ │ +class entry │ │ │ │ │ { │ │ │ │ │ - explicit operator bbooooll () const; │ │ │ │ │ - void ffiillee (file_index_t f); │ │ │ │ │ - file_index_t ffiillee () const; │ │ │ │ │ + data_type ttyyppee () const; │ │ │ │ │ + eennttrryy (preformatted_type); │ │ │ │ │ + eennttrryy (span); │ │ │ │ │ + eennttrryy (integer_type); │ │ │ │ │ + eennttrryy (list_type); │ │ │ │ │ + eennttrryy (dictionary_type); │ │ │ │ │ + eennttrryy (U v); │ │ │ │ │ + eennttrryy (data_type t); │ │ │ │ │ + eennttrryy (bdecode_node const& n); │ │ │ │ │ + entry& ooppeerraattoorr== (entry&&) & noexcept; │ │ │ │ │ + entry& ooppeerraattoorr== (span) &; │ │ │ │ │ + entry& ooppeerraattoorr== (integer_type) &; │ │ │ │ │ + entry& ooppeerraattoorr== (dictionary_type) &; │ │ │ │ │ + entry& ooppeerraattoorr== (preformatted_type) &; │ │ │ │ │ + entry& ooppeerraattoorr== (bdecode_node const&) &; │ │ │ │ │ + entry& ooppeerraattoorr== (list_type) &; │ │ │ │ │ + entry& ooppeerraattoorr== (entry const&) &; │ │ │ │ │ + entry& ooppeerraattoorr== (U v) &; │ │ │ │ │ + string_type& ssttrriinngg (); │ │ │ │ │ + dictionary_type const& ddiicctt () const; │ │ │ │ │ + string_type const& ssttrriinngg () const; │ │ │ │ │ + dictionary_type& ddiicctt (); │ │ │ │ │ + list_type& lliisstt (); │ │ │ │ │ + preformatted_type& pprreeffoorrmmaatttteedd (); │ │ │ │ │ + list_type const& lliisstt () const; │ │ │ │ │ + integer_type& iinntteeggeerr (); │ │ │ │ │ + preformatted_type const& pprreeffoorrmmaatttteedd () const; │ │ │ │ │ + integer_type const& iinntteeggeerr () const; │ │ │ │ │ + void sswwaapp (entry& e); │ │ │ │ │ + entry& ooppeerraattoorr[[]] (string_view key); │ │ │ │ │ + entry const& ooppeerraattoorr[[]] (string_view key) const; │ │ │ │ │ + entry const* ffiinndd__kkeeyy (string_view key) const; │ │ │ │ │ + entry* ffiinndd__kkeeyy (string_view key); │ │ │ │ │ + std::string ttoo__ssttrriinngg (bool single_line = false) const; │ │ │ │ │ │ │ │ │ │ - error_code ec; │ │ │ │ │ - operation_t operation; │ │ │ │ │ + enum data_type │ │ │ │ │ + { │ │ │ │ │ + int_t, │ │ │ │ │ + string_t, │ │ │ │ │ + list_t, │ │ │ │ │ + dictionary_t, │ │ │ │ │ + undefined_t, │ │ │ │ │ + preformatted_t, │ │ │ │ │ + }; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** bbooooll(()) ********** │ │ │ │ │ -explicit operator bbooooll () const; │ │ │ │ │ -explicitly converts to true if this object represents an error, and false if it │ │ │ │ │ -does not. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiillee(()) ********** │ │ │ │ │ -void ffiillee (file_index_t f); │ │ │ │ │ -file_index_t ffiillee () const; │ │ │ │ │ -set and query the index (in the torrent) of the file this error occurred on. │ │ │ │ │ -This may also have special values defined in _t_o_r_r_e_n_t___s_t_a_t_u_s. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - ec │ │ │ │ │ - the error that occurred │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - operation │ │ │ │ │ - A code from _o_p_e_r_a_t_i_o_n___t enum, indicating what kind of operation failed. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ lliibbttoorrrreenntt__ccaatteeggoorryy(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_r_r_o_r___c_o_d_e_._h_p_p" │ │ │ │ │ -boost::system::error_category& lliibbttoorrrreenntt__ccaatteeggoorryy (); │ │ │ │ │ -return the instance of the libtorrent_error_category which maps libtorrent │ │ │ │ │ -error codes to human readable error messages. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ hhttttpp__ccaatteeggoorryy(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_r_r_o_r___c_o_d_e_._h_p_p" │ │ │ │ │ -boost::system::error_category& hhttttpp__ccaatteeggoorryy (); │ │ │ │ │ -returns the error_category for HTTP errors │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ii22pp__ccaatteeggoorryy(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_i_2_p___s_t_r_e_a_m_._h_p_p" │ │ │ │ │ -boost::system::error_category& ii22pp__ccaatteeggoorryy (); │ │ │ │ │ -returns the error category for I2P errors │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ bbddeeccooddee__ccaatteeggoorryy(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_b_d_e_c_o_d_e_._h_p_p" │ │ │ │ │ -boost::system::error_category& bbddeeccooddee__ccaatteeggoorryy (); │ │ │ │ │ +********** ttyyppee(()) ********** │ │ │ │ │ +data_type ttyyppee () const; │ │ │ │ │ +returns the concrete type of the _e_n_t_r_y │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ppccpp__ccaatteeggoorryy(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_n_a_t_p_m_p_._h_p_p" │ │ │ │ │ -boost::system::error_category& ppccpp__ccaatteeggoorryy (); │ │ │ │ │ +********** eennttrryy(()) ********** │ │ │ │ │ +eennttrryy (preformatted_type); │ │ │ │ │ +eennttrryy (span); │ │ │ │ │ +eennttrryy (integer_type); │ │ │ │ │ +eennttrryy (list_type); │ │ │ │ │ +eennttrryy (dictionary_type); │ │ │ │ │ +constructors directly from a specific type. The content of the argument is │ │ │ │ │ +copied into the newly constructed _e_n_t_r_y │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ssoocckkss__ccaatteeggoorryy(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_o_c_k_s_5___s_t_r_e_a_m_._h_p_p" │ │ │ │ │ -boost::system::error_category& ssoocckkss__ccaatteeggoorryy (); │ │ │ │ │ -returns the error_category for SOCKS5 errors │ │ │ │ │ +********** eennttrryy(()) ********** │ │ │ │ │ +eennttrryy (data_type t); │ │ │ │ │ +construct an empty _e_n_t_r_y of the specified type. see _d_a_t_a___t_y_p_e enum. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ggzziipp__ccaatteeggoorryy(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_g_z_i_p_._h_p_p" │ │ │ │ │ -boost::system::error_category& ggzziipp__ccaatteeggoorryy (); │ │ │ │ │ -get the error_category for zip errors │ │ │ │ │ +********** eennttrryy(()) ********** │ │ │ │ │ +eennttrryy (bdecode_node const& n); │ │ │ │ │ +construct from _b_d_e_c_o_d_e___n_o_d_e parsed form (see _b_d_e_c_o_d_e_(_)) │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ uuppnnpp__ccaatteeggoorryy(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_u_p_n_p_._h_p_p" │ │ │ │ │ -boost::system::error_category& uuppnnpp__ccaatteeggoorryy (); │ │ │ │ │ -the boost.system error category for UPnP errors │ │ │ │ │ +********** ooppeerraattoorr==(()) ********** │ │ │ │ │ +entry& ooppeerraattoorr== (entry&&) & noexcept; │ │ │ │ │ +entry& ooppeerraattoorr== (span) &; │ │ │ │ │ +entry& ooppeerraattoorr== (integer_type) &; │ │ │ │ │ +entry& ooppeerraattoorr== (dictionary_type) &; │ │ │ │ │ +entry& ooppeerraattoorr== (preformatted_type) &; │ │ │ │ │ +entry& ooppeerraattoorr== (bdecode_node const&) &; │ │ │ │ │ +entry& ooppeerraattoorr== (list_type) &; │ │ │ │ │ +entry& ooppeerraattoorr== (entry const&) &; │ │ │ │ │ +copies the structure of the right hand side into this _e_n_t_r_y. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ eennuumm eerrrroorr__ccooddee__eennuumm ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_r_r_o_r___c_o_d_e_._h_p_p" │ │ │ │ │ - _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ -|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_n_o___e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_0_ _ _ _ _|_N_o_t_ _a_n_ _e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|file_collision |1 |Two torrents has files which end | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_u_p_ _o_v_e_r_w_r_i_t_i_n_g_ _e_a_c_h_ _o_t_h_e_r_ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|failed_hash_check |2 |A piece did not match its piece | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_h_a_s_h_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The .torrent file does not contain| │ │ │ │ │ -|torrent_is_no_dict |3 |a bencoded dictionary at its top | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_l_e_v_e_l_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|torrent_missing_info |4 |The .torrent file does not have an| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_f_o_ _d_i_c_t_i_o_n_a_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|torrent_info_no_dict |5 |The .torrent file's info _e_n_t_r_y is | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_n_o_t_ _a_ _d_i_c_t_i_o_n_a_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|torrent_missing_piece_length |6 |The .torrent file does not have a | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_i_e_c_e_ _l_e_n_g_t_h_ _e_n_t_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|torrent_missing_name |7 |The .torrent file does not have a | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_n_a_m_e_ _e_n_t_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|torrent_invalid_name |8 |The .torrent file's name _e_n_t_r_y is | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The length of a file, or of the | │ │ │ │ │ -|torrent_invalid_length |9 |whole .torrent file is invalid. | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_E_i_t_h_e_r_ _n_e_g_a_t_i_v_e_ _o_r_ _n_o_t_ _a_n_ _i_n_t_e_g_e_r_ | │ │ │ │ │ -|torrent_file_parse_failed |10 |Failed to parse a file _e_n_t_r_y in | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_ _._t_o_r_r_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|torrent_missing_pieces |11 |The pieces field is missing or | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _i_n_ _t_h_e_ _._t_o_r_r_e_n_t_ _f_i_l_e_ _ _ _ _ _ | │ │ │ │ │ -|torrent_invalid_hashes |12 |The pieces string has incorrect | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_l_e_n_g_t_h_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|too_many_pieces_in_torrent |13 |The .torrent file has more pieces | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_a_n_ _i_s_ _s_u_p_p_o_r_t_e_d_ _b_y_ _l_i_b_t_o_r_r_e_n_t_ _ _ | │ │ │ │ │ -| | |The metadata (.torrent file) that | │ │ │ │ │ -|invalid_swarm_metadata |14 |was received from the swarm | │ │ │ │ │ -| | |matched the info-hash, but failed | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_o_ _b_e_ _p_a_r_s_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_bencoding |15 |The file or buffer is not | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_o_r_r_e_c_t_l_y_ _b_e_n_c_o_d_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|no_files_in_torrent |16 |The .torrent file does not contain| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_n_y_ _f_i_l_e_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_escaped_string |17 |The string was not properly url- | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_n_c_o_d_e_d_ _a_s_ _e_x_p_e_c_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|session_is_closing |18 |Operation is not permitted since | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_ _s_e_s_s_i_o_n_ _i_s_ _s_h_u_t_t_i_n_g_ _d_o_w_n_ _ _ _ _ _ | │ │ │ │ │ -| | |There's already a torrent with | │ │ │ │ │ -|duplicate_torrent |19 |that info-hash added to the | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_e_s_s_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_torrent_handle |20 |The supplied _t_o_r_r_e_n_t___h_a_n_d_l_e is not| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_f_e_r_r_i_n_g_ _t_o_ _a_ _v_a_l_i_d_ _t_o_r_r_e_n_t_ _ _ _ _ _ | │ │ │ │ │ -|invalid_entry_type |21 |The type requested from the _e_n_t_r_y | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_d_i_d_ _n_o_t_ _m_a_t_c_h_ _i_t_s_ _t_y_p_e_ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|missing_info_hash_in_uri |22 |The specified URI does not contain| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_ _v_a_l_i_d_ _i_n_f_o_-_h_a_s_h_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |One of the files in the torrent | │ │ │ │ │ -|file_too_short |23 |was unexpectedly small. This might| │ │ │ │ │ -| | |be caused by files being changed | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_b_y_ _a_n_ _e_x_t_e_r_n_a_l_ _p_r_o_c_e_s_s_ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The URL used an unknown protocol. | │ │ │ │ │ -| | |Currently http and https (if built| │ │ │ │ │ -|unsupported_url_protocol |24 |with openssl support) are | │ │ │ │ │ -| | |recognized. For trackers udp is | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_c_o_g_n_i_z_e_d_ _a_s_ _w_e_l_l_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|url_parse_error |25 |The URL did not conform to URL | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_y_n_t_a_x_ _a_n_d_ _f_a_i_l_e_d_ _t_o_ _b_e_ _p_a_r_s_e_d_ _ _ _ | │ │ │ │ │ -|peer_sent_empty_piece |26 |The peer sent a piece message of | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_l_e_n_g_t_h_ _0_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|parse_failed |27 |A bencoded structure was corrupt | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_n_d_ _f_a_i_l_e_d_ _t_o_ _b_e_ _p_a_r_s_e_d_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_file_tag |28 |The fast resume file was missing | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_r_ _h_a_d_ _a_n_ _i_n_v_a_l_i_d_ _f_i_l_e_ _v_e_r_s_i_o_n_ _t_a_g| │ │ │ │ │ -|missing_info_hash |29 |The fast resume file was missing | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_r_ _h_a_d_ _a_n_ _i_n_v_a_l_i_d_ _i_n_f_o_-_h_a_s_h_ _ _ _ _ _ _ | │ │ │ │ │ -|mismatching_info_hash |30 |The info-hash did not match the | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_o_r_r_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_hostname |31 |The URL contained an invalid | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_h_o_s_t_n_a_m_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_i_n_v_a_l_i_d___p_o_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_3_2_ _ _ _|_T_h_e_ _U_R_L_ _h_a_d_ _a_n_ _i_n_v_a_l_i_d_ _p_o_r_t_ _ _ _ _ _ _ | │ │ │ │ │ -| | |The port is blocked by the port- | │ │ │ │ │ -|port_blocked |33 |filter, and prevented the | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_o_n_n_e_c_t_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|expected_close_bracket_in_address |34 |The IPv6 address was expected to | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_n_d_ _w_i_t_h_ _"_]_"_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The torrent is being destructed, | │ │ │ │ │ -|destructing_torrent |35 |preventing the operation to | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_u_c_c_e_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_t_i_m_e_d___o_u_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_3_6_ _ _ _|_T_h_e_ _c_o_n_n_e_c_t_i_o_n_ _t_i_m_e_d_ _o_u_t_ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The peer is upload only, and we | │ │ │ │ │ -|upload_upload_connection |37 |are upload only. There's no point | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_ _k_e_e_p_i_n_g_ _t_h_e_ _c_o_n_n_e_c_t_i_o_n_ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The peer is upload only, and we're| │ │ │ │ │ -|uninteresting_upload_peer |38 |not interested in it. There's no | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_o_i_n_t_ _i_n_ _k_e_e_p_i_n_g_ _t_h_e_ _c_o_n_n_e_c_t_i_o_n_ _ _ | │ │ │ │ │ -|_i_n_v_a_l_i_d___i_n_f_o___h_a_s_h_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_3_9_ _ _ _|_T_h_e_ _p_e_e_r_ _s_e_n_t_ _a_n_ _u_n_k_n_o_w_n_ _i_n_f_o_-_h_a_s_h| │ │ │ │ │ -|torrent_paused |40 |The torrent is paused, preventing | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_ _o_p_e_r_a_t_i_o_n_ _f_r_o_m_ _s_u_c_c_e_e_d_i_n_g_ _ _ _ _ | │ │ │ │ │ -| | |The peer sent an invalid have | │ │ │ │ │ -|invalid_have |41 |message, either wrong size or | │ │ │ │ │ -| | |referring to a piece that doesn't | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_x_i_s_t_ _i_n_ _t_h_e_ _t_o_r_r_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_bitfield_size |42 |The _b_i_t_f_i_e_l_d message had the | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_c_o_r_r_e_c_t_ _s_i_z_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The peer kept requesting pieces | │ │ │ │ │ -|too_many_requests_when_choked |43 |after it was choked, possible | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_b_u_s_e_ _a_t_t_e_m_p_t_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The peer sent a piece message that| │ │ │ │ │ -|invalid_piece |44 |does not correspond to a piece | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_q_u_e_s_t_ _s_e_n_t_ _b_y_ _t_h_e_ _c_l_i_e_n_t_ _ _ _ _ _ _ _ | │ │ │ │ │ -|_n_o___m_e_m_o_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_4_5_ _ _ _|_m_e_m_o_r_y_ _a_l_l_o_c_a_t_i_o_n_ _f_a_i_l_e_d_ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|torrent_aborted |46 |The torrent is aborted, preventing| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_ _o_p_e_r_a_t_i_o_n_ _t_o_ _s_u_c_c_e_e_d_ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|self_connection |47 |The peer is a connection to | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_u_r_s_e_l_f_,_ _n_o_ _p_o_i_n_t_ _i_n_ _k_e_e_p_i_n_g_ _i_t_ _ _ | │ │ │ │ │ -| | |The peer sent a piece message with| │ │ │ │ │ -|invalid_piece_size |48 |invalid size, either negative or | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_g_r_e_a_t_e_r_ _t_h_a_n_ _o_n_e_ _b_l_o_c_k_ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The peer has not been interesting | │ │ │ │ │ -|timed_out_no_interest |49 |or interested in us for too long, | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_n_o_ _p_o_i_n_t_ _i_n_ _k_e_e_p_i_n_g_ _i_t_ _a_r_o_u_n_d_ _ _ _ _ | │ │ │ │ │ -|timed_out_inactivity |50 |The peer has not said anything in | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_ _l_o_n_g_ _t_i_m_e_,_ _p_o_s_s_i_b_l_y_ _d_e_a_d_ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The peer did not send a handshake | │ │ │ │ │ -|timed_out_no_handshake |51 |within a reasonable amount of | │ │ │ │ │ -| | |time, it might not be a bittorrent| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_e_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The peer has been unchoked for too| │ │ │ │ │ -|timed_out_no_request |52 |long without requesting any data. | │ │ │ │ │ -| | |It might be lying about its | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_t_e_r_e_s_t_ _i_n_ _u_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_choke |53 |The peer sent an invalid choke | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_unchoke |54 |The peer send an invalid unchoke | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_interested |55 |The peer sent an invalid | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_t_e_r_e_s_t_e_d_ _m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_not_interested |56 |The peer sent an invalid not- | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_t_e_r_e_s_t_e_d_ _m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_request |57 |The peer sent an invalid piece | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_q_u_e_s_t_ _m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The peer sent an invalid hash-list| │ │ │ │ │ -|invalid_hash_list |58 |message (this is part of the | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_r_k_l_e_-_t_o_r_r_e_n_t_ _e_x_t_e_n_s_i_o_n_)_ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The peer sent an invalid hash- | │ │ │ │ │ -|invalid_hash_piece |59 |piece message (this is part of the| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_r_k_l_e_-_t_o_r_r_e_n_t_ _e_x_t_e_n_s_i_o_n_)_ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_cancel |60 |The peer sent an invalid cancel | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_dht_port |61 |The peer sent an invalid DHT port-| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_suggest |62 |The peer sent an invalid suggest | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_i_e_c_e_-_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_have_all |63 |The peer sent an invalid have all-| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_have_none |64 |The peer sent an invalid have | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_n_o_n_e_-_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_reject |65 |The peer sent an invalid reject | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_allow_fast |66 |The peer sent an invalid allow | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_f_a_s_t_-_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_extended |67 |The peer sent an invalid extension| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _I_D_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_message |68 |The peer sent an invalid message | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_I_D_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|sync_hash_not_found |69 |The synchronization hash was not | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_f_o_u_n_d_ _i_n_ _t_h_e_ _e_n_c_r_y_p_t_e_d_ _h_a_n_d_s_h_a_k_e_ _ | │ │ │ │ │ -|invalid_encryption_constant |70 |The encryption constant in the | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_h_a_n_d_s_h_a_k_e_ _i_s_ _i_n_v_a_l_i_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|no_plaintext_mode |71 |The peer does not support plain | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_e_x_t_,_ _w_h_i_c_h_ _i_s_ _t_h_e_ _s_e_l_e_c_t_e_d_ _m_o_d_e_ _ | │ │ │ │ │ -|no_rc4_mode |72 |The peer does not support RC4, | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_w_h_i_c_h_ _i_s_ _t_h_e_ _s_e_l_e_c_t_e_d_ _m_o_d_e_ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The peer does not support any of | │ │ │ │ │ -|unsupported_encryption_mode |73 |the encryption modes that the | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_l_i_e_n_t_ _s_u_p_p_o_r_t_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The peer selected an encryption | │ │ │ │ │ -|unsupported_encryption_mode_selected|74 |mode that the client did not | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_d_v_e_r_t_i_s_e_ _a_n_d_ _d_o_e_s_ _n_o_t_ _s_u_p_p_o_r_t_ _ _ _ | │ │ │ │ │ -| | |The pad size used in the | │ │ │ │ │ -|invalid_pad_size |75 |encryption handshake is of invalid| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_i_z_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_encrypt_handshake |76 |The encryption handshake is | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The client is set to not support | │ │ │ │ │ -|no_incoming_encrypted |77 |incoming encrypted connections and| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_i_s_ _i_s_ _a_n_ _e_n_c_r_y_p_t_e_d_ _c_o_n_n_e_c_t_i_o_n_ _ _ | │ │ │ │ │ -| | |The client is set to not support | │ │ │ │ │ -|no_incoming_regular |78 |incoming regular bittorrent | │ │ │ │ │ -| | |connections, and this is a regular| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_o_n_n_e_c_t_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|duplicate_peer_id |79 |The client is already connected to| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_i_s_ _p_e_e_r_-_I_D_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_t_o_r_r_e_n_t___r_e_m_o_v_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_8_0_ _ _ _|_T_o_r_r_e_n_t_ _w_a_s_ _r_e_m_o_v_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|packet_too_large |81 |The packet size exceeded the upper| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_a_n_i_t_y_ _c_h_e_c_k_-_l_i_m_i_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_s_e_r_v_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_8_2_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|http_error |83 |The web server responded with an | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|missing_location |84 |The web server response is missing| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_ _l_o_c_a_t_i_o_n_ _h_e_a_d_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The web seed redirected to a path | │ │ │ │ │ -|invalid_redirection |85 |that no longer matches the | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_._t_o_r_r_e_n_t_ _d_i_r_e_c_t_o_r_y_ _s_t_r_u_c_t_u_r_e_ _ _ _ _ _ | │ │ │ │ │ -|redirecting |86 |The connection was closed because | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_t_ _r_e_d_i_r_e_c_t_e_d_ _t_o_ _a_ _d_i_f_f_e_r_e_n_t_ _U_R_L_ _ | │ │ │ │ │ -|_i_n_v_a_l_i_d___r_a_n_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_8_7_ _ _ _|_T_h_e_ _H_T_T_P_ _r_a_n_g_e_ _h_e_a_d_e_r_ _i_s_ _i_n_v_a_l_i_d_ _ | │ │ │ │ │ -|no_content_length |88 |The HTTP response did not have a | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_o_n_t_e_n_t_ _l_e_n_g_t_h_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_b_a_n_n_e_d___b_y___i_p___f_i_l_t_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_8_9_ _ _ _|_T_h_e_ _I_P_ _i_s_ _b_l_o_c_k_e_d_ _b_y_ _t_h_e_ _I_P_ _f_i_l_t_e_r| │ │ │ │ │ -|_t_o_o___m_a_n_y___c_o_n_n_e_c_t_i_o_n_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_9_0_ _ _ _|_A_t_ _t_h_e_ _c_o_n_n_e_c_t_i_o_n_ _l_i_m_i_t_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_e_e_r___b_a_n_n_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_9_1_ _ _ _|_T_h_e_ _p_e_e_r_ _i_s_ _m_a_r_k_e_d_ _a_s_ _b_a_n_n_e_d_ _ _ _ _ _ | │ │ │ │ │ -|stopping_torrent |92 |The torrent is stopping, causing | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_ _o_p_e_r_a_t_i_o_n_ _t_o_ _f_a_i_l_ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|too_many_corrupt_pieces |93 |The peer has sent too many corrupt| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_i_e_c_e_s_ _a_n_d_ _i_s_ _b_a_n_n_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|torrent_not_ready |94 |The torrent is not ready to | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_c_e_i_v_e_ _p_e_e_r_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|peer_not_constructed |95 |The peer is not completely | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_o_n_s_t_r_u_c_t_e_d_ _y_e_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|session_closing |96 |The _s_e_s_s_i_o_n is closing, causing | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_ _o_p_e_r_a_t_i_o_n_ _t_o_ _f_a_i_l_ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The peer was disconnected in order| │ │ │ │ │ -|optimistic_disconnect |97 |to leave room for a potentially | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_b_e_t_t_e_r_ _p_e_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_t_o_r_r_e_n_t___f_i_n_i_s_h_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_9_8_ _ _ _|_T_h_e_ _t_o_r_r_e_n_t_ _i_s_ _f_i_n_i_s_h_e_d_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_n_o___r_o_u_t_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_9_9_ _ _ _|_N_o_ _U_P_n_P_ _r_o_u_t_e_r_ _f_o_u_n_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|metadata_too_large |100 |The metadata message says the | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_t_a_d_a_t_a_ _e_x_c_e_e_d_s_ _t_h_e_ _l_i_m_i_t_ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_metadata_request |101 |The peer sent an invalid metadata | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_q_u_e_s_t_ _m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_metadata_size |102 |The peer advertised an invalid | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_t_a_d_a_t_a_ _s_i_z_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_metadata_offset |103 |The peer sent a message with an | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _m_e_t_a_d_a_t_a_ _o_f_f_s_e_t_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_metadata_message |104 |The peer sent an invalid metadata | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|pex_message_too_large |105 |The peer sent a peer exchange | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_s_s_a_g_e_ _t_h_a_t_ _w_a_s_ _t_o_o_ _l_a_r_g_e_ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_pex_message |106 |The peer sent an invalid peer | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_x_c_h_a_n_g_e_ _m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_lt_tracker_message |107 |The peer sent an invalid tracker | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_x_c_h_a_n_g_e_ _m_e_s_s_a_g_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The peer sent an pex messages too | │ │ │ │ │ -|too_frequent_pex |108 |often. This is a possible attempt | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_f_ _a_n_d_ _a_t_t_a_c_k_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The operation failed because it | │ │ │ │ │ -| | |requires the torrent to have the | │ │ │ │ │ -| | |metadata (.torrent file) and it | │ │ │ │ │ -|no_metadata |109 |doesn't have it yet. This happens | │ │ │ │ │ -| | |for magnet links before they have | │ │ │ │ │ -| | |downloaded the metadata, and also | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_o_r_r_e_n_t_s_ _a_d_d_e_d_ _b_y_ _U_R_L_._ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The peer sent an invalid dont_have| │ │ │ │ │ -| | |message. The don't have message is| │ │ │ │ │ -|invalid_dont_have |110 |an extension to allow peers to | │ │ │ │ │ -| | |advertise that the no longer has a| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_i_e_c_e_ _t_h_e_y_ _p_r_e_v_i_o_u_s_l_y_ _h_a_d_._ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The peer tried to connect to an | │ │ │ │ │ -|requires_ssl_connection |111 |SSL torrent without connecting | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_v_e_r_ _S_S_L_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The peer tried to connect to a | │ │ │ │ │ -|invalid_ssl_cert |112 |torrent with a certificate for a | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_d_i_f_f_e_r_e_n_t_ _t_o_r_r_e_n_t_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |the torrent is not an SSL torrent,| │ │ │ │ │ -|not_an_ssl_torrent |113 |and the operation requires an SSL | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_o_r_r_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |peer was banned because its listen| │ │ │ │ │ -|banned_by_port_filter |114 |port is within a banned port | │ │ │ │ │ -| | |range, as specified by the | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_o_r_t___f_i_l_t_e_r_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_session_handle |115 |The _s_e_s_s_i_o_n___h_a_n_d_l_e is not | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_f_e_r_r_i_n_g_ _t_o_ _a_ _v_a_l_i_d_ _s_e_s_s_i_o_n___i_m_p_l_ | │ │ │ │ │ -|invalid_listen_socket |116 |the listen socket associated with | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_i_s_ _r_e_q_u_e_s_t_ _w_a_s_ _c_l_o_s_e_d_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_i_n_v_a_l_i_d___h_a_s_h___r_e_q_u_e_s_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_1_7_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_i_n_v_a_l_i_d___h_a_s_h_e_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_1_8_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_i_n_v_a_l_i_d___h_a_s_h___r_e_j_e_c_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_1_9_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_d_e_p_r_e_c_a_t_e_d___1_2_0_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_2_0_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_d_e_p_r_e_c_a_t_e_d___1_2_1_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_2_1_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_d_e_p_r_e_c_a_t_e_d___1_2_2_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_2_2_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_d_e_p_r_e_c_a_t_e_d___1_2_3_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_2_3_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_d_e_p_r_e_c_a_t_e_d___1_2_4_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|missing_file_sizes |130 |The resume data file is missing | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_ _f_i_l_e_ _s_i_z_e_s_ _e_n_t_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|no_files_in_resume_data |131 |The resume data file file sizes | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_n_t_r_y_ _i_s_ _e_m_p_t_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|missing_pieces |132 |The resume data file is missing | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_ _p_i_e_c_e_s_ _a_n_d_ _s_l_o_t_s_ _e_n_t_r_y_ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The number of files in the resume | │ │ │ │ │ -|mismatching_number_of_files |133 |data does not match the number of | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_f_i_l_e_s_ _i_n_ _t_h_e_ _t_o_r_r_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |One of the files on disk has a | │ │ │ │ │ -|mismatching_file_size |134 |different size than in the fast | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_s_u_m_e_ _f_i_l_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |One of the files on disk has a | │ │ │ │ │ -|mismatching_file_timestamp |135 |different timestamp than in the | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_f_a_s_t_ _r_e_s_u_m_e_ _f_i_l_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|not_a_dictionary |136 |The resume data file is not a | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_d_i_c_t_i_o_n_a_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_blocks_per_piece |137 |The blocks per piece _e_n_t_r_y is | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _i_n_ _t_h_e_ _r_e_s_u_m_e_ _d_a_t_a_ _f_i_l_e_ _ _ | │ │ │ │ │ -| | |The resume file is missing the | │ │ │ │ │ -|missing_slots |138 |slots _e_n_t_r_y, which is required for| │ │ │ │ │ -| | |torrents with compact allocation. | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_DD_EE_PP_RR_EE_CC_AA_TT_EE_DD_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|too_many_slots |139 |The resume file contains more | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_l_o_t_s_ _t_h_a_n_ _t_h_e_ _t_o_r_r_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_slot_list |140 |The slot _e_n_t_r_y is invalid in the | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_s_u_m_e_ _d_a_t_a_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_piece_index |141 |One index in the slot list is | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The pieces on disk needs to be re-| │ │ │ │ │ -| | |ordered for the specified | │ │ │ │ │ -| | |allocation mode. This happens if | │ │ │ │ │ -|pieces_need_reorder |142 |you specify sparse allocation and | │ │ │ │ │ -| | |the files on disk are using | │ │ │ │ │ -| | |compact storage. The pieces needs | │ │ │ │ │ -| | |to be moved to their right | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_o_s_i_t_i_o_n_._ _DD_EE_PP_RR_EE_CC_AA_TT_EE_DD_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |this error is returned when asking| │ │ │ │ │ -| | |to save resume data and specifying| │ │ │ │ │ -|resume_data_not_modified |143 |the flag to only save when there's| │ │ │ │ │ -| | |anything new to save | │ │ │ │ │ -| | |(_t_o_r_r_e_n_t___h_a_n_d_l_e_:_:_o_n_l_y___i_f___m_o_d_i_f_i_e_d)| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_n_d_ _t_h_e_r_e_ _w_a_s_n_'_t_ _a_n_y_t_h_i_n_g_ _c_h_a_n_g_e_d_.| │ │ │ │ │ -|invalid_save_path |144 |the save_path in | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s_ _i_s_ _n_o_t_ _v_a_l_i_d_ _ _ | │ │ │ │ │ -|http_parse_error |150 |The HTTP header was not correctly | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_f_o_r_m_a_t_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The HTTP response was in the 300- | │ │ │ │ │ -|http_missing_location |151 |399 range but lacked a location | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_h_e_a_d_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The HTTP response was encoded with| │ │ │ │ │ -|http_failed_decompress |152 |gzip or deflate but decompressing | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_t_ _f_a_i_l_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|no_i2p_router |160 |The URL specified an i2p address, | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_b_u_t_ _n_o_ _i_2_p_ _r_o_u_t_e_r_ _i_s_ _c_o_n_f_i_g_u_r_e_d_ _ _ | │ │ │ │ │ -|no_i2p_endpoint |161 |i2p acceptor is not available yet,| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_a_n_'_t_ _a_n_n_o_u_n_c_e_ _w_i_t_h_o_u_t_ _e_n_d_p_o_i_n_t_ _ _ | │ │ │ │ │ -| | |The tracker URL doesn't support | │ │ │ │ │ -|scrape_not_available |170 |transforming it into a scrape URL.| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_._e_._ _i_t_ _d_o_e_s_n_'_t_ _c_o_n_t_a_i_n_ _"_a_n_n_o_u_n_c_e_.| │ │ │ │ │ -|_i_n_v_a_l_i_d___t_r_a_c_k_e_r___r_e_s_p_o_n_s_e_ _ _ _ _ _ _ _ _ _ _ _ _|_1_7_1_ _ _|_i_n_v_a_l_i_d_ _t_r_a_c_k_e_r_ _r_e_s_p_o_n_s_e_ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_peer_dict |172 |invalid peer dictionary _e_n_t_r_y. Not| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_ _d_i_c_t_i_o_n_a_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_t_r_a_c_k_e_r___f_a_i_l_u_r_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_7_3_ _ _|_t_r_a_c_k_e_r_ _s_e_n_t_ _a_ _f_a_i_l_u_r_e_ _m_e_s_s_a_g_e_ _ _ _ | │ │ │ │ │ -|_i_n_v_a_l_i_d___f_i_l_e_s___e_n_t_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_7_4_ _ _|_m_i_s_s_i_n_g_ _o_r_ _i_n_v_a_l_i_d_ _f_i_l_e_s_ _e_n_t_r_y_ _ _ _ | │ │ │ │ │ -|_i_n_v_a_l_i_d___h_a_s_h___e_n_t_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_7_5_ _ _|_m_i_s_s_i_n_g_ _o_r_ _i_n_v_a_l_i_d_ _h_a_s_h_ _e_n_t_r_y_ _ _ _ _ | │ │ │ │ │ -|invalid_peers_entry |176 |missing or invalid peers and | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_e_e_r_s_6_ _e_n_t_r_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_tracker_response_length |177 |UDP tracker response packet has | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _s_i_z_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_tracker_transaction_id |178 |invalid transaction id in UDP | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_r_a_c_k_e_r_ _r_e_s_p_o_n_s_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_tracker_action |179 |invalid action field in UDP | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_r_a_c_k_e_r_ _r_e_s_p_o_n_s_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |skipped announce (because it's | │ │ │ │ │ -|announce_skipped |180 |assumed to be unreachable over the| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_g_i_v_e_n_ _s_o_u_r_c_e_ _n_e_t_w_o_r_k_ _i_n_t_e_r_f_a_c_e_)_ _ _ | │ │ │ │ │ -|_n_o___e_n_t_r_o_p_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_2_0_0_ _ _|_r_a_n_d_o_m_ _n_u_m_b_e_r_ _g_e_n_e_r_a_t_i_o_n_ _f_a_i_l_e_d_ _ _ | │ │ │ │ │ -|_s_s_r_f___m_i_t_i_g_a_t_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_2_0_1_ _ _|_b_l_o_c_k_e_d_ _b_y_ _S_S_R_F_ _m_i_t_i_g_a_t_i_o_n_ _ _ _ _ _ _ _ | │ │ │ │ │ -|blocked_by_idna |202 |blocked because IDNA host names | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_r_e_ _b_a_n_n_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|torrent_unknown_version |210 |the torrent file has an unknown | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_e_t_a_ _v_e_r_s_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|torrent_missing_file_tree |211 |the v2 torrent file has no file | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_r_e_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|torrent_missing_meta_version |212 |the torrent contains v2 keys but | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_d_o_e_s_ _n_o_t_ _s_p_e_c_i_f_y_ _m_e_t_a_ _v_e_r_s_i_o_n_ _2_ _ _ | │ │ │ │ │ -|torrent_inconsistent_files |213 |the v1 and v2 file metadata does | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_n_o_t_ _m_a_t_c_h_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|torrent_missing_piece_layer |214 |one or more files are missing | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_i_e_c_e_ _l_a_y_e_r_ _h_a_s_h_e_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|torrent_invalid_piece_layer |215 |a piece layer has the wrong size | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_r_ _f_a_i_l_e_d_ _h_a_s_h_ _c_h_e_c_k_ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_t_o_r_r_e_n_t___m_i_s_s_i_n_g___p_i_e_c_e_s___r_o_o_t_ _ _ _ _ _ _ _ _ _|_2_1_6_ _ _|_a_ _v_2_ _f_i_l_e_ _e_n_t_r_y_ _h_a_s_ _n_o_ _r_o_o_t_ _h_a_s_h_ _ | │ │ │ │ │ -|torrent_inconsistent_hashes |217 |the v1 and v2 hashes do not | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_d_e_s_c_r_i_b_e_ _t_h_e_ _s_a_m_e_ _d_a_t_a_ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|torrent_invalid_pad_file |218 |a file in the v2 metadata has the | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_a_d_ _a_t_t_r_i_b_u_t_e_ _s_e_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_e_r_r_o_r___c_o_d_e___m_a_x_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_2_1_9_ _ _|_t_h_e_ _n_u_m_b_e_r_ _o_f_ _e_r_r_o_r_ _c_o_d_e_s_ _ _ _ _ _ _ _ _ | │ │ │ │ │ +********** iinntteeggeerr(()) ddiicctt(()) pprreeffoorrmmaatttteedd(()) ssttrriinngg(()) lliisstt(()) ********** │ │ │ │ │ +string_type& ssttrriinngg (); │ │ │ │ │ +dictionary_type const& ddiicctt () const; │ │ │ │ │ +string_type const& ssttrriinngg () const; │ │ │ │ │ +dictionary_type& ddiicctt (); │ │ │ │ │ +list_type& lliisstt (); │ │ │ │ │ +preformatted_type& pprreeffoorrmmaatttteedd (); │ │ │ │ │ +list_type const& lliisstt () const; │ │ │ │ │ +integer_type& iinntteeggeerr (); │ │ │ │ │ +preformatted_type const& pprreeffoorrmmaatttteedd () const; │ │ │ │ │ +integer_type const& iinntteeggeerr () 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 system_error. You can ask an entry for its type through the │ │ │ │ │ +type() function. │ │ │ │ │ +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 │ │ │ │ │ +_t_o_r_r_e_n_t___i_n_f_o exists. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ eennuumm hhttttpp__eerrrroorrss ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_r_r_o_r___c_o_d_e_._h_p_p" │ │ │ │ │ - _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ -|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ -|_c_o_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_0_0_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_o_k_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_2_0_0_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_c_r_e_a_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_2_0_1_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_a_c_c_e_p_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _|_2_0_2_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_n_o___c_o_n_t_e_n_t_ _ _ _ _ _ _ _ _ _ _ _|_2_0_4_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_m_u_l_t_i_p_l_e___c_h_o_i_c_e_s_ _ _ _ _ _|_3_0_0_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_m_o_v_e_d___p_e_r_m_a_n_e_n_t_l_y_ _ _ _ _|_3_0_1_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_m_o_v_e_d___t_e_m_p_o_r_a_r_i_l_y_ _ _ _ _|_3_0_2_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_n_o_t___m_o_d_i_f_i_e_d_ _ _ _ _ _ _ _ _ _|_3_0_4_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_b_a_d___r_e_q_u_e_s_t_ _ _ _ _ _ _ _ _ _ _|_4_0_0_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_u_n_a_u_t_h_o_r_i_z_e_d_ _ _ _ _ _ _ _ _ _|_4_0_1_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_f_o_r_b_i_d_d_e_n_ _ _ _ _ _ _ _ _ _ _ _ _|_4_0_3_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_n_o_t___f_o_u_n_d_ _ _ _ _ _ _ _ _ _ _ _ _|_4_0_4_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_i_n_t_e_r_n_a_l___s_e_r_v_e_r___e_r_r_o_r_|_5_0_0_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_n_o_t___i_m_p_l_e_m_e_n_t_e_d_ _ _ _ _ _ _|_5_0_1_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_b_a_d___g_a_t_e_w_a_y_ _ _ _ _ _ _ _ _ _ _|_5_0_2_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_s_e_r_v_i_c_e___u_n_a_v_a_i_l_a_b_l_e_ _ _|_5_0_3_ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +********** sswwaapp(()) ********** │ │ │ │ │ +void sswwaapp (entry& e); │ │ │ │ │ +swaps the content of tthhiiss with e. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ eennuumm ii22pp__eerrrroorr__ccooddee ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_i_2_p___s_t_r_e_a_m_._h_p_p" │ │ │ │ │ - _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ -|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ -|_n_o___e_r_r_o_r_ _ _ _ _ _ _ _|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_a_r_s_e___f_a_i_l_e_d_ _ _ _|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_c_a_n_t___r_e_a_c_h___p_e_e_r_|_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_i_2_p___e_r_r_o_r_ _ _ _ _ _ _|_3_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_i_n_v_a_l_i_d___k_e_y_ _ _ _ _|_4_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_i_n_v_a_l_i_d___i_d_ _ _ _ _ _|_5_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_t_i_m_e_o_u_t_ _ _ _ _ _ _ _ _|_6_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_k_e_y___n_o_t___f_o_u_n_d_ _ _|_7_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_d_u_p_l_i_c_a_t_e_d___i_d_ _ _|_8_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_n_u_m___e_r_r_o_r_s_ _ _ _ _ _|_9_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +********** ooppeerraattoorr[[]](()) ********** │ │ │ │ │ +entry& ooppeerraattoorr[[]] (string_view key); │ │ │ │ │ +entry const& ooppeerraattoorr[[]] (string_view key) const; │ │ │ │ │ +All of these functions requires the _e_n_t_r_y to be a dictionary, if it isn't they │ │ │ │ │ +will throw system_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 system_error. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ eennuumm eerrrroorr__ccooddee__eennuumm ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_b_d_e_c_o_d_e_._h_p_p" │ │ │ │ │ - _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ -|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_n_o___e_r_r_o_r_ _ _ _ _ _ _|_0_ _ _ _ _|_N_o_t_ _a_n_ _e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_e_x_p_e_c_t_e_d___d_i_g_i_t_|_1_ _ _ _ _|_e_x_p_e_c_t_e_d_ _d_i_g_i_t_ _i_n_ _b_e_n_c_o_d_e_d_ _s_t_r_i_n_g_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_e_x_p_e_c_t_e_d___c_o_l_o_n_|_2_ _ _ _ _|_e_x_p_e_c_t_e_d_ _c_o_l_o_n_ _i_n_ _b_e_n_c_o_d_e_d_ _s_t_r_i_n_g_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_u_n_e_x_p_e_c_t_e_d___e_o_f_|_3_ _ _ _ _|_u_n_e_x_p_e_c_t_e_d_ _e_n_d_ _o_f_ _f_i_l_e_ _i_n_ _b_e_n_c_o_d_e_d_ _s_t_r_i_n_g_ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|expected_value|4 |expected value (list, dict, _i_n_t or string) in bencoded| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_t_r_i_n_g_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_d_e_p_t_h___e_x_c_e_e_d_e_d_|_5_ _ _ _ _|_b_e_n_c_o_d_e_d_ _r_e_c_u_r_s_i_o_n_ _d_e_p_t_h_ _l_i_m_i_t_ _e_x_c_e_e_d_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_l_i_m_i_t___e_x_c_e_e_d_e_d_|_6_ _ _ _ _|_b_e_n_c_o_d_e_d_ _i_t_e_m_ _c_o_u_n_t_ _l_i_m_i_t_ _e_x_c_e_e_d_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_o_v_e_r_f_l_o_w_ _ _ _ _ _ _|_7_ _ _ _ _|_i_n_t_e_g_e_r_ _o_v_e_r_f_l_o_w_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_e_r_r_o_r___c_o_d_e___m_a_x_|_8_ _ _ _ _|_t_h_e_ _n_u_m_b_e_r_ _o_f_ _e_r_r_o_r_ _c_o_d_e_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +********** ffiinndd__kkeeyy(()) ********** │ │ │ │ │ +entry const* ffiinndd__kkeeyy (string_view key) const; │ │ │ │ │ +entry* ffiinndd__kkeeyy (string_view key); │ │ │ │ │ +These functions requires the _e_n_t_r_y to be a dictionary, if it isn't they will │ │ │ │ │ +throw system_error. │ │ │ │ │ +They will look for an element at the given key in the dictionary, if the │ │ │ │ │ +element cannot be found, they will return nullptr. If an element with the given │ │ │ │ │ +key is found, the return a pointer to it. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ eennuumm ppccpp__eerrrroorrss ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_n_a_t_p_m_p_._h_p_p" │ │ │ │ │ - _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ -|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ -|_p_c_p___s_u_c_c_e_s_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_c_p___u_n_s_u_p_p___v_e_r_s_i_o_n_ _ _ _ _ _ _ _ _ _|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_c_p___n_o_t___a_u_t_h_o_r_i_z_e_d_ _ _ _ _ _ _ _ _ _|_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_c_p___m_a_l_f_o_r_m_e_d___r_e_q_u_e_s_t_ _ _ _ _ _ _|_3_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_c_p___u_n_s_u_p_p___o_p_c_o_d_e_ _ _ _ _ _ _ _ _ _ _|_4_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_c_p___u_n_s_u_p_p___o_p_t_i_o_n_ _ _ _ _ _ _ _ _ _ _|_5_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_c_p___m_a_l_f_o_r_m_e_d___o_p_t_i_o_n_ _ _ _ _ _ _ _|_6_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_c_p___n_e_t_w_o_r_k___f_a_i_l_u_r_e_ _ _ _ _ _ _ _ _|_7_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_c_p___n_o___r_e_s_o_u_r_c_e_s_ _ _ _ _ _ _ _ _ _ _ _|_8_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_c_p___u_n_s_u_p_p___p_r_o_t_o_c_o_l_ _ _ _ _ _ _ _ _|_9_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_c_p___u_s_e_r___e_x___q_u_o_t_a_ _ _ _ _ _ _ _ _ _ _|_1_0_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_c_p___c_a_n_n_o_t___p_r_o_v_i_d_e___e_x_t_e_r_n_a_l_|_1_1_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_c_p___a_d_d_r_e_s_s___m_i_s_m_a_t_c_h_ _ _ _ _ _ _ _|_1_2_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_c_p___e_x_c_e_s_s_i_v_e___r_e_m_o_t_e___p_e_e_r_s_ _|_1_3_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +********** ttoo__ssttrriinngg(()) ********** │ │ │ │ │ +std::string ttoo__ssttrriinngg (bool single_line = false) const; │ │ │ │ │ +returns a pretty-printed string representation of the bencoded structure, with │ │ │ │ │ +JSON-style syntax │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ eennuumm ssoocckkss__eerrrroorr__ccooddee ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_s_o_c_k_s_5___s_t_r_e_a_m_._h_p_p" │ │ │ │ │ - _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ -|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ -|_n_o___e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_u_n_s_u_p_p_o_r_t_e_d___v_e_r_s_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_u_n_s_u_p_p_o_r_t_e_d___a_u_t_h_e_n_t_i_c_a_t_i_o_n___m_e_t_h_o_d_ _|_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_u_n_s_u_p_p_o_r_t_e_d___a_u_t_h_e_n_t_i_c_a_t_i_o_n___v_e_r_s_i_o_n_|_3_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_a_u_t_h_e_n_t_i_c_a_t_i_o_n___e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_4_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_u_s_e_r_n_a_m_e___r_e_q_u_i_r_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_5_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_g_e_n_e_r_a_l___f_a_i_l_u_r_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_6_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_c_o_m_m_a_n_d___n_o_t___s_u_p_p_o_r_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _|_7_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_n_o___i_d_e_n_t_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_8_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_i_d_e_n_t_d___e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_9_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_n_u_m___e_r_r_o_r_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_0_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +********** eennuumm ddaattaa__ttyyppee ********** │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_n_t_r_y_._h_p_p" │ │ │ │ │ + _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ +|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ +|_i_n_t___t_ _ _ _ _ _ _ _ _ _|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_s_t_r_i_n_g___t_ _ _ _ _ _ _|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_l_i_s_t___t_ _ _ _ _ _ _ _ _|_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_d_i_c_t_i_o_n_a_r_y___t_ _ _|_3_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_u_n_d_e_f_i_n_e_d___t_ _ _ _|_4_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_p_r_e_f_o_r_m_a_t_t_e_d___t_|_5_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ eennuumm eerrrroorr__ccooddee__eennuumm ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_g_z_i_p_._h_p_p" │ │ │ │ │ - _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ -|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_n_o___e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_0_ _ _ _ _|_N_o_t_ _a_n_ _e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_gzip_header |1 |the supplied gzip buffer has | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _h_e_a_d_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |the gzip buffer would inflate to | │ │ │ │ │ -|inflated_data_too_large |2 |more bytes than the specified | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_a_x_i_m_u_m_ _s_i_z_e_,_ _a_n_d_ _w_a_s_ _r_e_j_e_c_t_e_d_._ _ _ _ | │ │ │ │ │ -|data_did_not_terminate |3 |available inflate data did not | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_e_r_m_i_n_a_t_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|space_exhausted |4 |output space exhausted before | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_o_m_p_l_e_t_i_n_g_ _i_n_f_l_a_t_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_i_n_v_a_l_i_d___b_l_o_c_k___t_y_p_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_5_ _ _ _ _|_i_n_v_a_l_i_d_ _b_l_o_c_k_ _t_y_p_e_ _(_t_y_p_e_ _=_=_ _3_)_ _ _ _ _ | │ │ │ │ │ -|invalid_stored_block_length |6 |stored block length did not match | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_n_e_'_s_ _c_o_m_p_l_e_m_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|too_many_length_or_distance_codes |7 |dynamic block code description: too| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_a_n_y_ _l_e_n_g_t_h_ _o_r_ _d_i_s_t_a_n_c_e_ _c_o_d_e_s_ _ _ _ _ _ | │ │ │ │ │ -|code_lengths_codes_incomplete |8 |dynamic block code description: | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_o_d_e_ _l_e_n_g_t_h_s_ _c_o_d_e_s_ _i_n_c_o_m_p_l_e_t_e_ _ _ _ _ _ | │ │ │ │ │ -|repeat_lengths_with_no_first_length|9 |dynamic block code description: | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_p_e_a_t_ _l_e_n_g_t_h_s_ _w_i_t_h_ _n_o_ _f_i_r_s_t_ _l_e_n_g_t_h| │ │ │ │ │ -|repeat_more_than_specified_lengths |10 |dynamic block code description: | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_r_e_p_e_a_t_ _m_o_r_e_ _t_h_a_n_ _s_p_e_c_i_f_i_e_d_ _l_e_n_g_t_h_s_ | │ │ │ │ │ -|invalid_literal_length_code_lengths|11 |dynamic block code description: | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _l_i_t_e_r_a_l_/_l_e_n_g_t_h_ _c_o_d_e_ _l_e_n_g_t_h_s| │ │ │ │ │ -|invalid_distance_code_lengths |12 |dynamic block code description: | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_v_a_l_i_d_ _d_i_s_t_a_n_c_e_ _c_o_d_e_ _l_e_n_g_t_h_s_ _ _ _ _ _ | │ │ │ │ │ -|invalid_literal_code_in_block |13 |invalid literal/length or distance | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_o_d_e_ _i_n_ _f_i_x_e_d_ _o_r_ _d_y_n_a_m_i_c_ _b_l_o_c_k_ _ _ _ _ | │ │ │ │ │ -|distance_too_far_back_in_block |14 |distance is too far back in fixed | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_o_r_ _d_y_n_a_m_i_c_ _b_l_o_c_k_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|unknown_gzip_error |15 |an unknown error occurred during | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_g_z_i_p_ _i_n_f_l_a_t_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_e_r_r_o_r___c_o_d_e___m_a_x_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_1_6_ _ _ _|_t_h_e_ _n_u_m_b_e_r_ _o_f_ _e_r_r_o_r_ _c_o_d_e_s_ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +************ ooppeerraattoorr<<<<(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_n_t_r_y_._h_p_p" │ │ │ │ │ +inline std::ostream& ooppeerraattoorr<<<< (std::ostream& os, const entry& e); │ │ │ │ │ +prints the bencoded structure to the ostream as a JSON-style structure. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ eennuumm eerrrroorr__ccooddee__eennuumm ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_u_p_n_p_._h_p_p" │ │ │ │ │ - _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ -|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_n_o___e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_0_ _ _ _ _|_N_o_ _e_r_r_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|invalid_argument |402 |One of the arguments in the request | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_s_ _i_n_v_a_l_i_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_a_c_t_i_o_n___f_a_i_l_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_5_0_1_ _ _|_T_h_e_ _r_e_q_u_e_s_t_ _f_a_i_l_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|value_not_in_array |714 |The specified value does not exist | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_i_n_ _t_h_e_ _a_r_r_a_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The source IP address cannot be | │ │ │ │ │ -|source_ip_cannot_be_wildcarded |715 |wild-carded, but must be fully | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_s_p_e_c_i_f_i_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|external_port_cannot_be_wildcarded|716 |The external port cannot be a | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_w_i_l_d_c_a_r_d_,_ _b_u_t_ _m_u_s_t_ _b_e_ _s_p_e_c_i_f_i_e_d_ _ _ _ _ | │ │ │ │ │ -| | |The port mapping _e_n_t_r_y specified | │ │ │ │ │ -|port_mapping_conflict |718 |conflicts with a mapping assigned | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_r_e_v_i_o_u_s_l_y_ _t_o_ _a_n_o_t_h_e_r_ _c_l_i_e_n_t_ _ _ _ _ _ _ _ | │ │ │ │ │ -|internal_port_must_match_external |724 |Internal and external port value | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_u_s_t_ _b_e_ _t_h_e_ _s_a_m_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |The NAT implementation only supports| │ │ │ │ │ -|only_permanent_leases_supported |725 |permanent lease times on port | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_m_a_p_p_i_n_g_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |RemoteHost must be a wildcard and | │ │ │ │ │ -|remote_host_must_be_wildcard |726 |cannot be a specific IP address or | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_D_N_S_ _n_a_m_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|external_port_must_be_wildcard |727 |ExternalPort must be a wildcard and | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_c_a_n_n_o_t_ _b_e_ _a_ _s_p_e_c_i_f_i_c_ _p_o_r_t_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +************ bbeennccooddee(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_b_e_n_c_o_d_e_._h_p_p" │ │ │ │ │ +template int bbeennccooddee (OutIt out, const entry& e); │ │ │ │ │ +This function will encode data to bencoded form. │ │ │ │ │ +The _e_n_t_r_y class is the internal representation of the bencoded data and it can │ │ │ │ │ +be used to retrieve information, an _e_n_t_r_y can also be build by the program and │ │ │ │ │ +given to bencode() to encode it into the OutIt iterator. │ │ │ │ │ +OutIt is an _O_u_t_p_u_t_I_t_e_r_a_t_o_r. It's a template and usually instantiated as │ │ │ │ │ +_o_s_t_r_e_a_m___i_t_e_r_a_t_o_r or _b_a_c_k___i_n_s_e_r_t___i_t_e_r_a_t_o_r. This function assumes the value_type │ │ │ │ │ +of the iterator is a char. In order to encode _e_n_t_r_y e into a buffer, do: │ │ │ │ │ +std::vector buf; │ │ │ │ │ +bencode(std::back_inserter(buf), e); │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ bbddeeccooddee__nnooddee ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_b_d_e_c_o_d_e_._h_p_p" │ │ │ │ │ Sometimes it's important to get a non-owning reference to the root node ( to be │ │ │ │ │ able to copy it as a reference for instance). For that, use the _n_o_n___o_w_n_i_n_g_(_) │ │ │ │ │ member function. │ │ │ │ │ There are 5 different types of nodes, see _t_y_p_e___t. │ │ │ │ │ @@ -11645,38 +11718,38 @@ │ │ │ │ │ bdecode_node& ooppeerraattoorr== (bdecode_node&&) & = default; │ │ │ │ │ bbddeeccooddee__nnooddee (bdecode_node const&); │ │ │ │ │ bbddeeccooddee__nnooddee (bdecode_node&&) noexcept; │ │ │ │ │ bdecode_node& ooppeerraattoorr== (bdecode_node const&) &; │ │ │ │ │ type_t ttyyppee () const noexcept; │ │ │ │ │ explicit operator bbooooll () const noexcept; │ │ │ │ │ bdecode_node nnoonn__oowwnniinngg () const; │ │ │ │ │ - span ddaattaa__sseeccttiioonn () const noexcept; │ │ │ │ │ std::ptrdiff_t ddaattaa__ooffffsseett () const noexcept; │ │ │ │ │ + span ddaattaa__sseeccttiioonn () const noexcept; │ │ │ │ │ string_view lliisstt__ssttrriinngg__vvaalluuee__aatt (int i │ │ │ │ │ , string_view default_val = string_view()) const; │ │ │ │ │ bdecode_node lliisstt__aatt (int i) const; │ │ │ │ │ int lliisstt__ssiizzee () const; │ │ │ │ │ std::int64_t lliisstt__iinntt__vvaalluuee__aatt (int i │ │ │ │ │ , std::int64_t default_val = 0) const; │ │ │ │ │ + std::int64_t ddiicctt__ffiinndd__iinntt__vvaalluuee (string_view key │ │ │ │ │ + , std::int64_t default_val = 0) const; │ │ │ │ │ int ddiicctt__ssiizzee () const; │ │ │ │ │ - bdecode_node ddiicctt__ffiinndd (string_view key) const; │ │ │ │ │ - bdecode_node ddiicctt__ffiinndd__lliisstt (string_view key) const; │ │ │ │ │ + std::pair ddiicctt__aatt (int i) const; │ │ │ │ │ bdecode_node ddiicctt__ffiinndd__ddiicctt (string_view key) const; │ │ │ │ │ bdecode_node ddiicctt__ffiinndd__iinntt (string_view key) const; │ │ │ │ │ + bdecode_node ddiicctt__ffiinndd__ssttrriinngg (string_view key) const; │ │ │ │ │ string_view ddiicctt__ffiinndd__ssttrriinngg__vvaalluuee (string_view key │ │ │ │ │ , string_view default_value = string_view()) const; │ │ │ │ │ - bdecode_node ddiicctt__ffiinndd__ssttrriinngg (string_view key) const; │ │ │ │ │ - std::int64_t ddiicctt__ffiinndd__iinntt__vvaalluuee (string_view key │ │ │ │ │ - , std::int64_t default_val = 0) const; │ │ │ │ │ + bdecode_node ddiicctt__ffiinndd (string_view key) const; │ │ │ │ │ + bdecode_node ddiicctt__ffiinndd__lliisstt (string_view key) const; │ │ │ │ │ std::pair ddiicctt__aatt__nnooddee (int i) const; │ │ │ │ │ - std::pair ddiicctt__aatt (int i) const; │ │ │ │ │ std::int64_t iinntt__vvaalluuee () const; │ │ │ │ │ - int ssttrriinngg__lleennggtthh () const; │ │ │ │ │ string_view ssttrriinngg__vvaalluuee () const; │ │ │ │ │ std::ptrdiff_t ssttrriinngg__ooffffsseett () const; │ │ │ │ │ + int ssttrriinngg__lleennggtthh () const; │ │ │ │ │ char const* ssttrriinngg__ppttrr () const; │ │ │ │ │ void cclleeaarr (); │ │ │ │ │ void sswwaapp (bdecode_node& n); │ │ │ │ │ void rreesseerrvvee (int tokens); │ │ │ │ │ void sswwiittcchh__uunnddeerrllyyiinngg__bbuuffffeerr (char const* buf) noexcept; │ │ │ │ │ bool hhaass__ssoofftt__eerrrroorr (span error) const; │ │ │ │ │ │ │ │ │ │ @@ -11711,50 +11784,50 @@ │ │ │ │ │ returns true if _t_y_p_e_(_) != none_t. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** nnoonn__oowwnniinngg(()) ********** │ │ │ │ │ bdecode_node nnoonn__oowwnniinngg () const; │ │ │ │ │ return a non-owning reference to this node. This is useful to refer to the root │ │ │ │ │ node without copying it in assignments. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddaattaa__sseeccttiioonn(()) ddaattaa__ooffffsseett(()) ********** │ │ │ │ │ -span ddaattaa__sseeccttiioonn () const noexcept; │ │ │ │ │ +********** ddaattaa__ooffffsseett(()) ddaattaa__sseeccttiioonn(()) ********** │ │ │ │ │ std::ptrdiff_t ddaattaa__ooffffsseett () const noexcept; │ │ │ │ │ +span ddaattaa__sseeccttiioonn () const noexcept; │ │ │ │ │ returns the buffer and length of the section in the original bencoded buffer │ │ │ │ │ where this node is defined. For a dictionary for instance, this starts with d │ │ │ │ │ and ends with e, and has all the content of the dictionary in between. the │ │ │ │ │ data_offset() function returns the byte-offset to this node in, starting from │ │ │ │ │ the beginning of the buffer that was parsed. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** lliisstt__iinntt__vvaalluuee__aatt(()) lliisstt__ssttrriinngg__vvaalluuee__aatt(()) lliisstt__ssiizzee(()) lliisstt__aatt(()) ********** │ │ │ │ │ +********** lliisstt__iinntt__vvaalluuee__aatt(()) lliisstt__aatt(()) lliisstt__ssiizzee(()) lliisstt__ssttrriinngg__vvaalluuee__aatt(()) ********** │ │ │ │ │ string_view lliisstt__ssttrriinngg__vvaalluuee__aatt (int i │ │ │ │ │ , string_view default_val = string_view()) const; │ │ │ │ │ bdecode_node lliisstt__aatt (int i) const; │ │ │ │ │ int lliisstt__ssiizzee () const; │ │ │ │ │ std::int64_t lliisstt__iinntt__vvaalluuee__aatt (int i │ │ │ │ │ , std::int64_t default_val = 0) const; │ │ │ │ │ functions with the list_ prefix operate on lists. These functions are only │ │ │ │ │ valid if type() == list_t. list_at() returns the item in the list at index i. i │ │ │ │ │ may not be greater than or equal to the size of the list. size() returns the │ │ │ │ │ size of the list. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ddiicctt__ssiizzee(()) ddiicctt__ffiinndd__ssttrriinngg__vvaalluuee(()) ddiicctt__ffiinndd__iinntt__vvaalluuee(()) ddiicctt__ffiinndd__iinntt │ │ │ │ │ -(()) ddiicctt__aatt(()) ddiicctt__ffiinndd__lliisstt(()) ddiicctt__ffiinndd__ssttrriinngg(()) ddiicctt__ffiinndd__ddiicctt(()) ddiicctt__aatt__nnooddee │ │ │ │ │ -(()) ddiicctt__ffiinndd(()) ********** │ │ │ │ │ +********** ddiicctt__aatt(()) ddiicctt__ffiinndd__ssttrriinngg(()) ddiicctt__ssiizzee(()) ddiicctt__ffiinndd__iinntt__vvaalluuee(()) │ │ │ │ │ +ddiicctt__aatt__nnooddee(()) ddiicctt__ffiinndd__iinntt(()) ddiicctt__ffiinndd__ssttrriinngg__vvaalluuee(()) ddiicctt__ffiinndd(()) │ │ │ │ │ +ddiicctt__ffiinndd__ddiicctt(()) ddiicctt__ffiinndd__lliisstt(()) ********** │ │ │ │ │ +std::int64_t ddiicctt__ffiinndd__iinntt__vvaalluuee (string_view key │ │ │ │ │ + , std::int64_t default_val = 0) const; │ │ │ │ │ int ddiicctt__ssiizzee () const; │ │ │ │ │ -bdecode_node ddiicctt__ffiinndd (string_view key) const; │ │ │ │ │ -bdecode_node ddiicctt__ffiinndd__lliisstt (string_view key) const; │ │ │ │ │ +std::pair ddiicctt__aatt (int i) const; │ │ │ │ │ bdecode_node ddiicctt__ffiinndd__ddiicctt (string_view key) const; │ │ │ │ │ bdecode_node ddiicctt__ffiinndd__iinntt (string_view key) const; │ │ │ │ │ +bdecode_node ddiicctt__ffiinndd__ssttrriinngg (string_view key) const; │ │ │ │ │ string_view ddiicctt__ffiinndd__ssttrriinngg__vvaalluuee (string_view key │ │ │ │ │ , string_view default_value = string_view()) const; │ │ │ │ │ -bdecode_node ddiicctt__ffiinndd__ssttrriinngg (string_view key) const; │ │ │ │ │ -std::int64_t ddiicctt__ffiinndd__iinntt__vvaalluuee (string_view key │ │ │ │ │ - , std::int64_t default_val = 0) const; │ │ │ │ │ +bdecode_node ddiicctt__ffiinndd (string_view key) const; │ │ │ │ │ +bdecode_node ddiicctt__ffiinndd__lliisstt (string_view key) const; │ │ │ │ │ std::pair ddiicctt__aatt__nnooddee (int i) const; │ │ │ │ │ -std::pair ddiicctt__aatt (int i) const; │ │ │ │ │ Functions with the dict_ prefix operates on dictionaries. They are only valid │ │ │ │ │ if type() == dict_t. In case a key you're looking up contains a 0 byte, you │ │ │ │ │ cannot use the 0-terminated string overloads, but have to use string_view │ │ │ │ │ instead. dict_find_list will return a valid bdecode_node if the key is found │ │ │ │ │ _and_ it is a list. Otherwise it will return a default-constructed │ │ │ │ │ _b_d_e_c_o_d_e___n_o_d_e. │ │ │ │ │ Functions with the _value suffix return the value of the node directly, rather │ │ │ │ │ @@ -11766,18 +11839,18 @@ │ │ │ │ │ string). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** iinntt__vvaalluuee(()) ********** │ │ │ │ │ std::int64_t iinntt__vvaalluuee () const; │ │ │ │ │ this function is only valid if type() == int_t. It returns the value of the │ │ │ │ │ integer. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ssttrriinngg__lleennggtthh(()) ssttrriinngg__vvaalluuee(()) ssttrriinngg__ppttrr(()) ssttrriinngg__ooffffsseett(()) ********** │ │ │ │ │ -int ssttrriinngg__lleennggtthh () const; │ │ │ │ │ +********** ssttrriinngg__vvaalluuee(()) ssttrriinngg__ppttrr(()) ssttrriinngg__lleennggtthh(()) ssttrriinngg__ooffffsseett(()) ********** │ │ │ │ │ string_view ssttrriinngg__vvaalluuee () const; │ │ │ │ │ std::ptrdiff_t ssttrriinngg__ooffffsseett () const; │ │ │ │ │ +int ssttrriinngg__lleennggtthh () const; │ │ │ │ │ char const* ssttrriinngg__ppttrr () const; │ │ │ │ │ these functions are only valid if type() == string_t. They return the string │ │ │ │ │ values. Note that string_ptr() is nnoott 0-terminated. string_length() returns the │ │ │ │ │ number of bytes in the string. string_offset() returns the byte offset from the │ │ │ │ │ start of the parsed bencoded buffer this string can be found. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ********** cclleeaarr(()) ********** │ │ │ │ │ @@ -11822,20 +11895,20 @@ │ │ │ │ │ std::string pprriinntt__eennttrryy (bdecode_node const& e │ │ │ │ │ , bool single_line = false, int indent = 0); │ │ │ │ │ print the bencoded structure in a human-readable format to a string that's │ │ │ │ │ returned. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ bbddeeccooddee(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_b_d_e_c_o_d_e_._h_p_p" │ │ │ │ │ +bdecode_node bbddeeccooddee (span buffer │ │ │ │ │ + , int depth_limit = 100, int token_limit = 2000000); │ │ │ │ │ int bbddeeccooddee (char const* start, char const* end, bdecode_node& ret │ │ │ │ │ , error_code& ec, int* error_pos = nullptr, int depth_limit = 100 │ │ │ │ │ , int token_limit = 2000000); │ │ │ │ │ bdecode_node bbddeeccooddee (span buffer │ │ │ │ │ - , int depth_limit = 100, int token_limit = 2000000); │ │ │ │ │ -bdecode_node bbddeeccooddee (span buffer │ │ │ │ │ , error_code& ec, int* error_pos = nullptr, int depth_limit = 100 │ │ │ │ │ , int token_limit = 2000000); │ │ │ │ │ This function decodes/parses bdecoded data (for example a .torrent file). The │ │ │ │ │ data structure is returned in the ret argument. the buffer to parse is │ │ │ │ │ specified by the start of the buffer as well as the end, i.e. one byte past the │ │ │ │ │ end. If the buffer fails to parse, the function returns a non-zero value and │ │ │ │ │ fills in ec with the error code. The optional argument error_pos, if set to │ │ │ │ │ @@ -11851,566 +11924,493 @@ │ │ │ │ │ objects will simply have references to the root or owning bdecode_node. If the │ │ │ │ │ root node is destructed, all other nodes that refer to anything in that tree │ │ │ │ │ become invalid. │ │ │ │ │ However, the underlying buffer passed in to this function (start, end) must │ │ │ │ │ also remain valid while the bdecoded tree is used. The parsed tree produced by │ │ │ │ │ this function does not copy any data out of the buffer, but simply produces │ │ │ │ │ references back into it. │ │ │ │ │ -Bencoding is a common representation in bittorrent used for dictionary, list, │ │ │ │ │ -_i_n_t and string hierarchies. It's used to encode .torrent files and some │ │ │ │ │ -messages in the network protocol. libtorrent also uses it to store settings, │ │ │ │ │ -resume data and other _s_e_s_s_i_o_n state. │ │ │ │ │ -Strings in bencoded structures do not necessarily represent text. Strings are │ │ │ │ │ -raw byte buffers of a certain length. If a string is meant to be interpreted as │ │ │ │ │ -text, it is required to be UTF-8 encoded. See _B_E_P_ _3. │ │ │ │ │ -The function for decoding bencoded data _b_d_e_c_o_d_e_(_), returning a _b_d_e_c_o_d_e___n_o_d_e. │ │ │ │ │ -This function builds a tree that points back into the original buffer. The │ │ │ │ │ -returned _b_d_e_c_o_d_e___n_o_d_e will not be valid once the buffer it was parsed out of is │ │ │ │ │ -discarded. │ │ │ │ │ -It's possible to construct an _e_n_t_r_y from a _b_d_e_c_o_d_e___n_o_d_e, if a structure needs │ │ │ │ │ -to be altered and re-encoded. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ eennttrryy ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_n_t_r_y_._h_p_p" │ │ │ │ │ -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. │ │ │ │ │ -class entry │ │ │ │ │ +************ ttoorrrreenntt__ssttaattuuss ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___s_t_a_t_u_s_._h_p_p" │ │ │ │ │ +holds a snapshot of the status of a torrent, as queried by _t_o_r_r_e_n_t___h_a_n_d_l_e_:_: │ │ │ │ │ +_s_t_a_t_u_s_(_). │ │ │ │ │ +struct torrent_status │ │ │ │ │ { │ │ │ │ │ - data_type ttyyppee () const; │ │ │ │ │ - eennttrryy (list_type); │ │ │ │ │ - eennttrryy (integer_type); │ │ │ │ │ - eennttrryy (dictionary_type); │ │ │ │ │ - eennttrryy (span); │ │ │ │ │ - eennttrryy (preformatted_type); │ │ │ │ │ - eennttrryy (U v); │ │ │ │ │ - eennttrryy (data_type t); │ │ │ │ │ - eennttrryy (bdecode_node const& n); │ │ │ │ │ - entry& ooppeerraattoorr== (preformatted_type) &; │ │ │ │ │ - entry& ooppeerraattoorr== (entry const&) &; │ │ │ │ │ - entry& ooppeerraattoorr== (bdecode_node const&) &; │ │ │ │ │ - entry& ooppeerraattoorr== (dictionary_type) &; │ │ │ │ │ - entry& ooppeerraattoorr== (integer_type) &; │ │ │ │ │ - entry& ooppeerraattoorr== (list_type) &; │ │ │ │ │ - entry& ooppeerraattoorr== (entry&&) & noexcept; │ │ │ │ │ - entry& ooppeerraattoorr== (span) &; │ │ │ │ │ - entry& ooppeerraattoorr== (U v) &; │ │ │ │ │ - string_type& ssttrriinngg (); │ │ │ │ │ - integer_type const& iinntteeggeerr () const; │ │ │ │ │ - list_type const& lliisstt () const; │ │ │ │ │ - list_type& lliisstt (); │ │ │ │ │ - preformatted_type& pprreeffoorrmmaatttteedd (); │ │ │ │ │ - dictionary_type& ddiicctt (); │ │ │ │ │ - string_type const& ssttrriinngg () const; │ │ │ │ │ - preformatted_type const& pprreeffoorrmmaatttteedd () const; │ │ │ │ │ - dictionary_type const& ddiicctt () const; │ │ │ │ │ - integer_type& iinntteeggeerr (); │ │ │ │ │ - void sswwaapp (entry& e); │ │ │ │ │ - entry& ooppeerraattoorr[[]] (string_view key); │ │ │ │ │ - entry const& ooppeerraattoorr[[]] (string_view key) const; │ │ │ │ │ - entry const* ffiinndd__kkeeyy (string_view key) const; │ │ │ │ │ - entry* ffiinndd__kkeeyy (string_view key); │ │ │ │ │ - std::string ttoo__ssttrriinngg (bool single_line = false) const; │ │ │ │ │ + bool ooppeerraattoorr==== (torrent_status const& st) const; │ │ │ │ │ │ │ │ │ │ - enum data_type │ │ │ │ │ + enum state_t │ │ │ │ │ { │ │ │ │ │ - int_t, │ │ │ │ │ - string_t, │ │ │ │ │ - list_t, │ │ │ │ │ - dictionary_t, │ │ │ │ │ - undefined_t, │ │ │ │ │ - preformatted_t, │ │ │ │ │ + checking_files, │ │ │ │ │ + downloading_metadata, │ │ │ │ │ + downloading, │ │ │ │ │ + finished, │ │ │ │ │ + seeding, │ │ │ │ │ + unused_enum_for_backwards_compatibility_allocating, │ │ │ │ │ + checking_resume_data, │ │ │ │ │ }; │ │ │ │ │ + │ │ │ │ │ + torrent_handle handle; │ │ │ │ │ + error_code errc; │ │ │ │ │ + file_index_t eerrrroorr__ffiillee = torrent_status::error_file_none; │ │ │ │ │ + static constexpr file_index_t eerrrroorr__ffiillee__nnoonnee {-1}; │ │ │ │ │ + static constexpr file_index_t eerrrroorr__ffiillee__ssssll__ccttxx {-3}; │ │ │ │ │ + static constexpr file_index_t eerrrroorr__ffiillee__mmeettaaddaattaa {-4}; │ │ │ │ │ + static constexpr file_index_t eerrrroorr__ffiillee__eexxcceeppttiioonn {-5}; │ │ │ │ │ + static constexpr file_index_t eerrrroorr__ffiillee__ppaarrttffiillee {-6}; │ │ │ │ │ + std::string save_path; │ │ │ │ │ + std::string name; │ │ │ │ │ + std::weak_ptr torrent_file; │ │ │ │ │ + time_duration nneexxtt__aannnnoouunnccee = seconds{0}; │ │ │ │ │ + std::string current_tracker; │ │ │ │ │ + std::int64_t ttoottaall__ddoowwnnllooaadd = 0; │ │ │ │ │ + std::int64_t ttoottaall__uuppllooaadd = 0; │ │ │ │ │ + std::int64_t ttoottaall__ppaayyllooaadd__ddoowwnnllooaadd = 0; │ │ │ │ │ + std::int64_t ttoottaall__ppaayyllooaadd__uuppllooaadd = 0; │ │ │ │ │ + std::int64_t ttoottaall__ffaaiilleedd__bbyytteess = 0; │ │ │ │ │ + std::int64_t ttoottaall__rreedduunnddaanntt__bbyytteess = 0; │ │ │ │ │ + typed_bitfield pieces; │ │ │ │ │ + typed_bitfield verified_pieces; │ │ │ │ │ + std::int64_t ttoottaall__ddoonnee = 0; │ │ │ │ │ + std::int64_t ttoottaall = 0; │ │ │ │ │ + std::int64_t ttoottaall__wwaanntteedd__ddoonnee = 0; │ │ │ │ │ + std::int64_t ttoottaall__wwaanntteedd = 0; │ │ │ │ │ + std::int64_t aallll__ttiimmee__uuppllooaadd = 0; │ │ │ │ │ + std::int64_t aallll__ttiimmee__ddoowwnnllooaadd = 0; │ │ │ │ │ + std::time_t aaddddeedd__ttiimmee = 0; │ │ │ │ │ + std::time_t ccoommpplleetteedd__ttiimmee = 0; │ │ │ │ │ + std::time_t llaasstt__sseeeenn__ccoommpplleettee = 0; │ │ │ │ │ + storage_mode_t ssttoorraaggee__mmooddee = storage_mode_sparse; │ │ │ │ │ + float pprrooggrreessss = 0.f; │ │ │ │ │ + int pprrooggrreessss__ppppmm = 0; │ │ │ │ │ + queue_position_t qquueeuuee__ppoossiittiioonn {}; │ │ │ │ │ + int ddoowwnnllooaadd__rraattee = 0; │ │ │ │ │ + int uuppllooaadd__rraattee = 0; │ │ │ │ │ + int ddoowwnnllooaadd__ppaayyllooaadd__rraattee = 0; │ │ │ │ │ + int uuppllooaadd__ppaayyllooaadd__rraattee = 0; │ │ │ │ │ + int nnuumm__sseeeeddss = 0; │ │ │ │ │ + int nnuumm__ppeeeerrss = 0; │ │ │ │ │ + int nnuumm__ccoommpplleettee = -1; │ │ │ │ │ + int nnuumm__iinnccoommpplleettee = -1; │ │ │ │ │ + int lliisstt__sseeeeddss = 0; │ │ │ │ │ + int lliisstt__ppeeeerrss = 0; │ │ │ │ │ + int ccoonnnneecctt__ccaannddiiddaatteess = 0; │ │ │ │ │ + int nnuumm__ppiieecceess = 0; │ │ │ │ │ + int ddiissttrriibbuutteedd__ffuullll__ccooppiieess = 0; │ │ │ │ │ + int ddiissttrriibbuutteedd__ffrraaccttiioonn = 0; │ │ │ │ │ + float ddiissttrriibbuutteedd__ccooppiieess = 0.f; │ │ │ │ │ + int bblloocckk__ssiizzee = 0; │ │ │ │ │ + int nnuumm__uuppllooaaddss = 0; │ │ │ │ │ + int nnuumm__ccoonnnneeccttiioonnss = 0; │ │ │ │ │ + int uuppllooaaddss__lliimmiitt = 0; │ │ │ │ │ + int ccoonnnneeccttiioonnss__lliimmiitt = 0; │ │ │ │ │ + int uupp__bbaannddwwiiddtthh__qquueeuuee = 0; │ │ │ │ │ + int ddoowwnn__bbaannddwwiiddtthh__qquueeuuee = 0; │ │ │ │ │ + int sseeeedd__rraannkk = 0; │ │ │ │ │ + state_t ssttaattee = checking_resume_data; │ │ │ │ │ + bool nneeeedd__ssaavvee__rreessuummee = false; │ │ │ │ │ + bool iiss__sseeeeddiinngg = false; │ │ │ │ │ + bool iiss__ffiinniisshheedd = false; │ │ │ │ │ + bool hhaass__mmeettaaddaattaa = false; │ │ │ │ │ + bool hhaass__iinnccoommiinngg = false; │ │ │ │ │ + bool mmoovviinngg__ssttoorraaggee = false; │ │ │ │ │ + bool aannnnoouunncciinngg__ttoo__ttrraacckkeerrss = false; │ │ │ │ │ + bool aannnnoouunncciinngg__ttoo__llssdd = false; │ │ │ │ │ + bool aannnnoouunncciinngg__ttoo__ddhhtt = false; │ │ │ │ │ + info_hash_t info_hashes; │ │ │ │ │ + time_point last_upload; │ │ │ │ │ + time_point last_download; │ │ │ │ │ + seconds active_duration; │ │ │ │ │ + seconds finished_duration; │ │ │ │ │ + seconds seeding_duration; │ │ │ │ │ + torrent_flags_t ffllaaggss {}; │ │ │ │ │ }; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ttyyppee(()) ********** │ │ │ │ │ -data_type ttyyppee () const; │ │ │ │ │ -returns the concrete type of the _e_n_t_r_y │ │ │ │ │ +********** ooppeerraattoorr====(()) ********** │ │ │ │ │ +bool ooppeerraattoorr==== (torrent_status const& st) const; │ │ │ │ │ +compares if the torrent status objects come from the same torrent. i.e. only │ │ │ │ │ +the _t_o_r_r_e_n_t___h_a_n_d_l_e field is compared. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** eennttrryy(()) ********** │ │ │ │ │ -eennttrryy (list_type); │ │ │ │ │ -eennttrryy (integer_type); │ │ │ │ │ -eennttrryy (dictionary_type); │ │ │ │ │ -eennttrryy (span); │ │ │ │ │ -eennttrryy (preformatted_type); │ │ │ │ │ -constructors directly from a specific type. The content of the argument is │ │ │ │ │ -copied into the newly constructed _e_n_t_r_y │ │ │ │ │ +********** eennuumm ssttaattee__tt ********** │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_t_o_r_r_e_n_t___s_t_a_t_u_s_._h_p_p" │ │ │ │ │ + _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ +|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn_ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The torrent has not | │ │ │ │ │ +| | |started its download| │ │ │ │ │ +|checking_files |1 |yet, and is | │ │ │ │ │ +| | |currently checking | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_x_i_s_t_i_n_g_ _f_i_l_e_s_._ _ _ _ _ | │ │ │ │ │ +| | |The torrent is | │ │ │ │ │ +| | |trying to download | │ │ │ │ │ +|downloading_metadata |2 |metadata from peers.| │ │ │ │ │ +| | |This implies the | │ │ │ │ │ +| | |ut_metadata | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_e_x_t_e_n_s_i_o_n_ _i_s_ _i_n_ _u_s_e_.| │ │ │ │ │ +| | |The torrent is being| │ │ │ │ │ +| | |downloaded. This is | │ │ │ │ │ +| | |the state most | │ │ │ │ │ +| | |torrents will be in | │ │ │ │ │ +|downloading |3 |most of the time. | │ │ │ │ │ +| | |The progress meter | │ │ │ │ │ +| | |will tell how much | │ │ │ │ │ +| | |of the files that | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_h_a_s_ _b_e_e_n_ _d_o_w_n_l_o_a_d_e_d_.| │ │ │ │ │ +| | |In this state the | │ │ │ │ │ +| | |torrent has finished| │ │ │ │ │ +| | |downloading but | │ │ │ │ │ +|finished |4 |still doesn't have | │ │ │ │ │ +| | |the entire torrent. | │ │ │ │ │ +| | |i.e. some pieces are| │ │ │ │ │ +| | |filtered and won't | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_g_e_t_ _d_o_w_n_l_o_a_d_e_d_._ _ _ _ _ | │ │ │ │ │ +| | |In this state the | │ │ │ │ │ +|seeding |5 |torrent has finished| │ │ │ │ │ +| | |downloading and is a| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_p_u_r_e_ _s_e_e_d_e_r_._ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |If the torrent was | │ │ │ │ │ +| | |started in full | │ │ │ │ │ +| | |allocation mode, | │ │ │ │ │ +|unused_enum_for_backwards_compatibility_allocating|6 |this indicates that | │ │ │ │ │ +| | |the (disk) storage | │ │ │ │ │ +| | |for the torrent is | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_a_l_l_o_c_a_t_e_d_._ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |The torrent is | │ │ │ │ │ +| | |currently checking | │ │ │ │ │ +| | |the fast resume data| │ │ │ │ │ +| | |and comparing it to | │ │ │ │ │ +| | |the files on disk. | │ │ │ │ │ +|checking_resume_data |7 |This is typically | │ │ │ │ │ +| | |completed in a | │ │ │ │ │ +| | |fraction of a | │ │ │ │ │ +| | |second, but if you | │ │ │ │ │ +| | |add a large number | │ │ │ │ │ +| | |of torrents at once,| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _|_t_h_e_y_ _w_i_l_l_ _q_u_e_u_e_ _u_p_._ | │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** eennttrryy(()) ********** │ │ │ │ │ -eennttrryy (data_type t); │ │ │ │ │ -construct an empty _e_n_t_r_y of the specified type. see _d_a_t_a___t_y_p_e enum. │ │ │ │ │ + handle │ │ │ │ │ + a handle to the torrent whose status the object represents. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** eennttrryy(()) ********** │ │ │ │ │ -eennttrryy (bdecode_node const& n); │ │ │ │ │ -construct from _b_d_e_c_o_d_e___n_o_d_e parsed form (see _b_d_e_c_o_d_e_(_)) │ │ │ │ │ + errc │ │ │ │ │ + may be set to an error code describing why the torrent was paused, in │ │ │ │ │ + case it was paused by an error. If the torrent is not paused or if it's │ │ │ │ │ + paused but not because of an error, this error_code is not set. if the │ │ │ │ │ + error is attributed specifically to a file, error_file is set to the │ │ │ │ │ + index of that file in the .torrent file. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ooppeerraattoorr==(()) ********** │ │ │ │ │ -entry& ooppeerraattoorr== (preformatted_type) &; │ │ │ │ │ -entry& ooppeerraattoorr== (entry const&) &; │ │ │ │ │ -entry& ooppeerraattoorr== (bdecode_node const&) &; │ │ │ │ │ -entry& ooppeerraattoorr== (dictionary_type) &; │ │ │ │ │ -entry& ooppeerraattoorr== (integer_type) &; │ │ │ │ │ -entry& ooppeerraattoorr== (list_type) &; │ │ │ │ │ -entry& ooppeerraattoorr== (entry&&) & noexcept; │ │ │ │ │ -entry& ooppeerraattoorr== (span) &; │ │ │ │ │ -copies the structure of the right hand side into this _e_n_t_r_y. │ │ │ │ │ + error_file │ │ │ │ │ + if the torrent is stopped because of an disk I/O error, this field │ │ │ │ │ + contains the index of the file in the torrent that encountered the error. │ │ │ │ │ + If the error did not originate in a file in the torrent, there are a few │ │ │ │ │ + special values this can be set to: error_file_none, error_file_ssl_ctx, │ │ │ │ │ + error_file_exception, error_file_partfile or error_file_metadata; │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** lliisstt(()) ddiicctt(()) iinntteeggeerr(()) pprreeffoorrmmaatttteedd(()) ssttrriinngg(()) ********** │ │ │ │ │ -string_type& ssttrriinngg (); │ │ │ │ │ -integer_type const& iinntteeggeerr () const; │ │ │ │ │ -list_type const& lliisstt () const; │ │ │ │ │ -list_type& lliisstt (); │ │ │ │ │ -preformatted_type& pprreeffoorrmmaatttteedd (); │ │ │ │ │ -dictionary_type& ddiicctt (); │ │ │ │ │ -string_type const& ssttrriinngg () const; │ │ │ │ │ -preformatted_type const& pprreeffoorrmmaatttteedd () const; │ │ │ │ │ -dictionary_type const& ddiicctt () const; │ │ │ │ │ -integer_type& iinntteeggeerr (); │ │ │ │ │ -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 system_error. You can ask an entry for its type through the │ │ │ │ │ -type() function. │ │ │ │ │ -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 │ │ │ │ │ -_t_o_r_r_e_n_t___i_n_f_o exists. │ │ │ │ │ + error_file_none │ │ │ │ │ + special values for error_file to describe which file or component │ │ │ │ │ + encountered the error (errc). the error did not occur on a file │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sswwaapp(()) ********** │ │ │ │ │ -void sswwaapp (entry& e); │ │ │ │ │ -swaps the content of tthhiiss with e. │ │ │ │ │ + error_file_ssl_ctx │ │ │ │ │ + the error occurred setting up the SSL context │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ooppeerraattoorr[[]](()) ********** │ │ │ │ │ -entry& ooppeerraattoorr[[]] (string_view key); │ │ │ │ │ -entry const& ooppeerraattoorr[[]] (string_view key) const; │ │ │ │ │ -All of these functions requires the _e_n_t_r_y to be a dictionary, if it isn't they │ │ │ │ │ -will throw system_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 system_error. │ │ │ │ │ + error_file_metadata │ │ │ │ │ + the error occurred while loading the metadata for the torrent │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiinndd__kkeeyy(()) ********** │ │ │ │ │ -entry const* ffiinndd__kkeeyy (string_view key) const; │ │ │ │ │ -entry* ffiinndd__kkeeyy (string_view key); │ │ │ │ │ -These functions requires the _e_n_t_r_y to be a dictionary, if it isn't they will │ │ │ │ │ -throw system_error. │ │ │ │ │ -They will look for an element at the given key in the dictionary, if the │ │ │ │ │ -element cannot be found, they will return nullptr. If an element with the given │ │ │ │ │ -key is found, the return a pointer to it. │ │ │ │ │ + error_file_exception │ │ │ │ │ + there was a serious error reported in this torrent. The error code or a │ │ │ │ │ + torrent log _a_l_e_r_t may provide more information. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ttoo__ssttrriinngg(()) ********** │ │ │ │ │ -std::string ttoo__ssttrriinngg (bool single_line = false) const; │ │ │ │ │ -returns a pretty-printed string representation of the bencoded structure, with │ │ │ │ │ -JSON-style syntax │ │ │ │ │ + error_file_partfile │ │ │ │ │ + the error occurred with the partfile │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** eennuumm ddaattaa__ttyyppee ********** │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_n_t_r_y_._h_p_p" │ │ │ │ │ - _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ │ │ │ │ │ -|_nn_aa_mm_ee_ _ _ _ _ _ _ _ _ _ _|_vv_aa_ll_uu_ee_|_dd_ee_ss_cc_rr_ii_pp_tt_ii_oo_nn| │ │ │ │ │ -|_i_n_t___t_ _ _ _ _ _ _ _ _ _|_0_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_s_t_r_i_n_g___t_ _ _ _ _ _ _|_1_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_l_i_s_t___t_ _ _ _ _ _ _ _ _|_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_d_i_c_t_i_o_n_a_r_y___t_ _ _|_3_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_u_n_d_e_f_i_n_e_d___t_ _ _ _|_4_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_p_r_e_f_o_r_m_a_t_t_e_d___t_|_5_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ + save_path │ │ │ │ │ + the path to the directory where this torrent's files are stored. It's │ │ │ │ │ + typically the path as was given to _a_s_y_n_c___a_d_d___t_o_r_r_e_n_t_(_) or _a_d_d___t_o_r_r_e_n_t_(_) │ │ │ │ │ + when this torrent was started. This field is only included if the torrent │ │ │ │ │ + status is queried with torrent_handle::query_save_path. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ bbeennccooddee(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_b_e_n_c_o_d_e_._h_p_p" │ │ │ │ │ -template int bbeennccooddee (OutIt out, const entry& e); │ │ │ │ │ -This function will encode data to bencoded form. │ │ │ │ │ -The _e_n_t_r_y class is the internal representation of the bencoded data and it can │ │ │ │ │ -be used to retrieve information, an _e_n_t_r_y can also be build by the program and │ │ │ │ │ -given to bencode() to encode it into the OutIt iterator. │ │ │ │ │ -OutIt is an _O_u_t_p_u_t_I_t_e_r_a_t_o_r. It's a template and usually instantiated as │ │ │ │ │ -_o_s_t_r_e_a_m___i_t_e_r_a_t_o_r or _b_a_c_k___i_n_s_e_r_t___i_t_e_r_a_t_o_r. This function assumes the value_type │ │ │ │ │ -of the iterator is a char. In order to encode _e_n_t_r_y e into a buffer, do: │ │ │ │ │ -std::vector buf; │ │ │ │ │ -bencode(std::back_inserter(buf), e); │ │ │ │ │ + name │ │ │ │ │ + the name of the torrent. Typically this is derived from the .torrent │ │ │ │ │ + file. 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 _s_e_s_s_i_o_n. See session::add_torrent. This field is only included if the │ │ │ │ │ + torrent status is queried with torrent_handle::query_name. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ooppeerraattoorr<<<<(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_e_n_t_r_y_._h_p_p" │ │ │ │ │ -inline std::ostream& ooppeerraattoorr<<<< (std::ostream& os, const entry& e); │ │ │ │ │ -prints the bencoded structure to the ostream as a JSON-style structure. │ │ │ │ │ -This section describes the functions and classes that are used to create │ │ │ │ │ -torrent files. It is a layered API with low level classes and higher level │ │ │ │ │ -convenience functions. A torrent is created in 4 steps: │ │ │ │ │ - 1. first the files that will be part of the torrent are determined. │ │ │ │ │ - 2. the torrent properties are set, such as tracker url, web seeds, DHT nodes │ │ │ │ │ - etc. │ │ │ │ │ - 3. Read through all the files in the torrent, SHA-1 all the data and set the │ │ │ │ │ - piece hashes. │ │ │ │ │ - 4. The torrent is bencoded into a file or buffer. │ │ │ │ │ -If there are a lot of files and or deep directory hierarchies to traverse, step │ │ │ │ │ -one can be time consuming. │ │ │ │ │ -Typically step 3 is by far the most time consuming step, since it requires to │ │ │ │ │ -read all the bytes from all the files in the torrent. │ │ │ │ │ -All of these classes and functions are declared by including libtorrent/ │ │ │ │ │ -create_torrent.hpp. │ │ │ │ │ -example: │ │ │ │ │ -file_storage fs; │ │ │ │ │ - │ │ │ │ │ -// recursively adds files in directories │ │ │ │ │ -add_files(fs, "./my_torrent"); │ │ │ │ │ - │ │ │ │ │ -create_torrent t(fs); │ │ │ │ │ -t.add_tracker("http://my.tracker.com/announce"); │ │ │ │ │ -t.set_creator("libtorrent example"); │ │ │ │ │ - │ │ │ │ │ -// reads the files and calculates the hashes │ │ │ │ │ -set_piece_hashes(t, "."); │ │ │ │ │ - │ │ │ │ │ -ofstream out("my_torrent.torrent", std::ios_base::binary); │ │ │ │ │ -std::vector buf = t.generate_buf(); │ │ │ │ │ -out.write(buf.data(), buf.size()); │ │ │ │ │ - │ │ │ │ │ -// alternatively, generate an entry and encode it directly to an ostream │ │ │ │ │ -// iterator │ │ │ │ │ -bencode(std::ostream_iterator(out), t.generate()); │ │ │ │ │ + torrent_file │ │ │ │ │ + set to point to the torrent_info object for this torrent. It's only │ │ │ │ │ + included if the torrent status is queried with torrent_handle:: │ │ │ │ │ + query_torrent_file. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ ccrreeaattee__ttoorrrreenntt ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_c_r_e_a_t_e___t_o_r_r_e_n_t_._h_p_p" │ │ │ │ │ -This class holds state for creating a torrent. After having added all │ │ │ │ │ -information to it, call _c_r_e_a_t_e___t_o_r_r_e_n_t_:_:_g_e_n_e_r_a_t_e_(_) to generate the torrent. The │ │ │ │ │ -_e_n_t_r_y that's returned can then be bencoded into a .torrent file using _b_e_n_c_o_d_e │ │ │ │ │ -_(_). │ │ │ │ │ -struct create_torrent │ │ │ │ │ -{ │ │ │ │ │ - explicit ccrreeaattee__ttoorrrreenntt (file_storage& fs, int piece_size = 0 │ │ │ │ │ - , create_flags_t flags = {}); │ │ │ │ │ - explicit ccrreeaattee__ttoorrrreenntt (torrent_info const& ti); │ │ │ │ │ - entry ggeenneerraattee () const; │ │ │ │ │ - std::vector ggeenneerraattee__bbuuff () const; │ │ │ │ │ - file_storage const& ffiilleess () const; │ │ │ │ │ - void sseett__ccoommmmeenntt (char const* str); │ │ │ │ │ - void sseett__ccrreeaattoorr (char const* str); │ │ │ │ │ - void sseett__ccrreeaattiioonn__ddaattee (std::time_t timestamp); │ │ │ │ │ - void sseett__hhaasshh (piece_index_t index, sha1_hash const& h); │ │ │ │ │ - void sseett__hhaasshh22 (file_index_t file, piece_index_t::diff_type piece, │ │ │ │ │ -sha256_hash const& h); │ │ │ │ │ - void aadddd__hhttttpp__sseeeedd (string_view url); │ │ │ │ │ - void aadddd__uurrll__sseeeedd (string_view url); │ │ │ │ │ - void aadddd__nnooddee (std::pair node); │ │ │ │ │ - void aadddd__ttrraacckkeerr (string_view url, int tier = 0); │ │ │ │ │ - void sseett__rroooott__cceerrtt (string_view cert); │ │ │ │ │ - void sseett__pprriivv (bool p); │ │ │ │ │ - bool pprriivv () const; │ │ │ │ │ - bool iiss__vv11__oonnllyy () const; │ │ │ │ │ - bool iiss__vv22__oonnllyy () const; │ │ │ │ │ - int nnuumm__ppiieecceess () const; │ │ │ │ │ - piece_index_t eenndd__ppiieeccee () const; │ │ │ │ │ - index_range ppiieeccee__rraannggee () const noexcept; │ │ │ │ │ - file_index_t eenndd__ffiillee () const; │ │ │ │ │ - index_range ffiillee__rraannggee () const noexcept; │ │ │ │ │ - index_range ffiillee__ppiieeccee__rraannggee (file_index_t f); │ │ │ │ │ - std::int64_t ttoottaall__ssiizzee () const; │ │ │ │ │ - int ppiieeccee__lleennggtthh () const; │ │ │ │ │ - int ppiieeccee__ssiizzee (piece_index_t i) const; │ │ │ │ │ - void aadddd__ssiimmiillaarr__ttoorrrreenntt (sha1_hash ih); │ │ │ │ │ - void aadddd__ccoolllleeccttiioonn (string_view c); │ │ │ │ │ - │ │ │ │ │ - static constexpr create_flags_t mmooddiiffiiccaattiioonn__ttiimmee = 2_bit; │ │ │ │ │ - static constexpr create_flags_t ssyymmlliinnkkss = 3_bit; │ │ │ │ │ - static constexpr create_flags_t vv22__oonnllyy = 5_bit; │ │ │ │ │ - static constexpr create_flags_t vv11__oonnllyy = 6_bit; │ │ │ │ │ - static constexpr create_flags_t ccaannoonniiccaall__ffiilleess = 7_bit; │ │ │ │ │ - static constexpr create_flags_t nnoo__aattttrriibbuutteess = 8_bit; │ │ │ │ │ - static constexpr create_flags_t ccaannoonniiccaall__ffiilleess__nnoo__ttaaiill__ppaaddddiinngg = 9_bit; │ │ │ │ │ -}; │ │ │ │ │ + next_announce │ │ │ │ │ + the time until the torrent will announce itself to the tracker. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ccrreeaattee__ttoorrrreenntt(()) ********** │ │ │ │ │ -explicit ccrreeaattee__ttoorrrreenntt (file_storage& fs, int piece_size = 0 │ │ │ │ │ - , create_flags_t flags = {}); │ │ │ │ │ -explicit ccrreeaattee__ttoorrrreenntt (torrent_info const& ti); │ │ │ │ │ -The piece_size is the size of each piece in bytes. It must be a power of 2 and │ │ │ │ │ -a minimum of 16 kiB. If a piece size of 0 is specified, a piece_size will be │ │ │ │ │ -set automatically. Piece sizes greater than 128 MiB are considered unreasonable │ │ │ │ │ -and will be rejected (with an lt::system_error exception). │ │ │ │ │ -The flags arguments specifies options for the torrent creation. It can be any │ │ │ │ │ -combination of the flags defined by create_flags_t. │ │ │ │ │ -The _f_i_l_e___s_t_o_r_a_g_e (fs) parameter defines the files, sizes and their properties │ │ │ │ │ -for the torrent to be created. Set this up first, before passing it to the │ │ │ │ │ -_c_r_e_a_t_e___t_o_r_r_e_n_t constructor. │ │ │ │ │ -The overload that takes a torrent_info object will make a verbatim copy of its │ │ │ │ │ -info dictionary (to preserve the info-hash). The copy of the info dictionary │ │ │ │ │ -will be used by _c_r_e_a_t_e___t_o_r_r_e_n_t_:_:_g_e_n_e_r_a_t_e_(_). This means that none of the member │ │ │ │ │ -functions of _c_r_e_a_t_e___t_o_r_r_e_n_t that affects the content of the info dictionary │ │ │ │ │ -(such as _s_e_t___h_a_s_h_(_)), will have any affect. Instead of using this overload, │ │ │ │ │ -consider using _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e_(_) instead. │ │ │ │ │ -Warning │ │ │ │ │ -The _f_i_l_e___s_t_o_r_a_g_e and _t_o_r_r_e_n_t___i_n_f_o objects must stay alive for the entire │ │ │ │ │ -duration of the _c_r_e_a_t_e___t_o_r_r_e_n_t object. │ │ │ │ │ + current_tracker │ │ │ │ │ + the URL of the last working tracker. If no tracker request has been │ │ │ │ │ + successful yet, it's set to an empty string. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ggeenneerraattee(()) ggeenneerraattee__bbuuff(()) ********** │ │ │ │ │ -entry ggeenneerraattee () const; │ │ │ │ │ -std::vector ggeenneerraattee__bbuuff () const; │ │ │ │ │ -This function will generate the .torrent file as a bencode tree, or a bencoded │ │ │ │ │ -into a buffer. In order to encode the _e_n_t_r_y into a flat file, use the _b_e_n_c_o_d_e_(_) │ │ │ │ │ -function. │ │ │ │ │ -The function returning an _e_n_t_r_y may be useful to add custom entries to the │ │ │ │ │ -torrent file before bencoding it and saving it to disk. │ │ │ │ │ -Whether the resulting torrent object is v1, v2 or hybrid depends on whether any │ │ │ │ │ -of the v1_only or v2_only flags were set on the constructor. If neither were │ │ │ │ │ -set, the resulting torrent depends on which hashes were set. If both v1 and v2 │ │ │ │ │ -hashes were set, a hybrid torrent is created. │ │ │ │ │ -Any failure will cause this function to throw system_error, with an appropriate │ │ │ │ │ -error message. These are the reasons this call may throw: │ │ │ │ │ - * the file storage has 0 files │ │ │ │ │ - * the total size of the file storage is 0 bytes (i.e. it only has empty │ │ │ │ │ - files) │ │ │ │ │ - * not all v1 hashes (_s_e_t___h_a_s_h_(_)) and not all v2 hashes (_s_e_t___h_a_s_h_2_(_)) were │ │ │ │ │ - set │ │ │ │ │ - * for v2 torrents, you may not have a directory with the same name as a │ │ │ │ │ - file. If that's encountered in the file storage, _g_e_n_e_r_a_t_e_(_) fails. │ │ │ │ │ + total_download total_upload │ │ │ │ │ + the number of bytes downloaded and uploaded to all peers, accumulated, │ │ │ │ │ + tthhiiss sseessssiioonn only. The _s_e_s_s_i_o_n is considered to restart when a torrent is │ │ │ │ │ + paused and restarted again. When a torrent is paused, these _c_o_u_n_t_e_r_s are │ │ │ │ │ + reset to 0. If you want complete, persistent, stats, see all_time_upload │ │ │ │ │ + and all_time_download. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiilleess(()) ********** │ │ │ │ │ -file_storage const& ffiilleess () const; │ │ │ │ │ -returns an immutable reference to the _f_i_l_e___s_t_o_r_a_g_e used to create the torrent │ │ │ │ │ -from. │ │ │ │ │ + total_payload_download total_payload_upload │ │ │ │ │ + counts the amount of bytes send and received this _s_e_s_s_i_o_n, but only the │ │ │ │ │ + actual payload data (i.e the interesting data), these _c_o_u_n_t_e_r_s ignore any │ │ │ │ │ + protocol overhead. The _s_e_s_s_i_o_n is considered to restart when a torrent is │ │ │ │ │ + paused and restarted again. When a torrent is paused, these _c_o_u_n_t_e_r_s are │ │ │ │ │ + reset to 0. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__ccoommmmeenntt(()) ********** │ │ │ │ │ -void sseett__ccoommmmeenntt (char const* str); │ │ │ │ │ -Sets the comment for the torrent. The string str should be utf-8 encoded. The │ │ │ │ │ -comment in a torrent file is optional. │ │ │ │ │ + total_failed_bytes │ │ │ │ │ + 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 since the torrent was last started. If a torrent is paused and │ │ │ │ │ + then restarted again, this counter will be reset. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__ccrreeaattoorr(()) ********** │ │ │ │ │ -void sseett__ccrreeaattoorr (char const* str); │ │ │ │ │ -Sets the creator of the torrent. The string str should be utf-8 encoded. This │ │ │ │ │ -is optional. │ │ │ │ │ + total_redundant_bytes │ │ │ │ │ + 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. This │ │ │ │ │ + only counts bytes since the torrent was last started. If a torrent is │ │ │ │ │ + paused and then restarted again, this counter will be reset. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__ccrreeaattiioonn__ddaattee(()) ********** │ │ │ │ │ -void sseett__ccrreeaattiioonn__ddaattee (std::time_t timestamp); │ │ │ │ │ -sets the "creation time" field. Defaults to the system clock at the time of │ │ │ │ │ -construction of the _c_r_e_a_t_e___t_o_r_r_e_n_t object. The timestamp is specified in │ │ │ │ │ -seconds, posix time. If the creation date is set to 0, the "creation date" │ │ │ │ │ -field will be omitted from the generated torrent. │ │ │ │ │ + pieces │ │ │ │ │ + a 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. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__hhaasshh(()) ********** │ │ │ │ │ -void sseett__hhaasshh (piece_index_t index, sha1_hash const& h); │ │ │ │ │ -This sets the SHA-1 hash for the specified piece (index). You are required to │ │ │ │ │ -set the hash for every piece in the torrent before generating it. If you have │ │ │ │ │ -the files on disk, you can use the high level convenience function to do this. │ │ │ │ │ -See _s_e_t___p_i_e_c_e___h_a_s_h_e_s_(_). A SHA-1 hash of all zeros is internally used to │ │ │ │ │ -indicate a hash that has not been set. Setting such hash will not be considered │ │ │ │ │ -set when calling _g_e_n_e_r_a_t_e_(_). This function will throw std::system_error if it │ │ │ │ │ -is called on an object constructed with the v2_only flag. │ │ │ │ │ + verified_pieces │ │ │ │ │ + a bitmask representing which pieces has had their hash checked. This only │ │ │ │ │ + applies to torrents in sseeeedd mmooddee. If the torrent is not in seed mode, │ │ │ │ │ + this bitmask may be empty. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__hhaasshh22(()) ********** │ │ │ │ │ -void sseett__hhaasshh22 (file_index_t file, piece_index_t::diff_type piece, sha256_hash │ │ │ │ │ -const& h); │ │ │ │ │ -sets the bittorrent v2 hash for filefileof the piecepiece.pieceis relative to │ │ │ │ │ -the first piece of the file, starting at 0. The first piece in the file can be │ │ │ │ │ -computed with _f_i_l_e___s_t_o_r_a_g_e_:_:_f_i_l_e___i_n_d_e_x___a_t___p_i_e_c_e_(_). The hash,h, is the root of │ │ │ │ │ -the merkle tree formed by the piece's 16 kiB blocks. Note that piece sizes must │ │ │ │ │ -be powers-of-2, so all per-piece merkle trees are complete. A SHA-256 hash of │ │ │ │ │ -all zeros is internally used to indicate a hash that has not been set. Setting │ │ │ │ │ -such hash will not be considered set when calling _g_e_n_e_r_a_t_e_(_). This function │ │ │ │ │ -will throw std::system_error if it is called on an object constructed with the │ │ │ │ │ -v1_only flag. │ │ │ │ │ + total_done │ │ │ │ │ + the total number of bytes of the file(s) that we have. All this does not │ │ │ │ │ + necessarily has to be downloaded during this _s_e_s_s_i_o_n (that's │ │ │ │ │ + total_payload_download). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aadddd__uurrll__sseeeedd(()) aadddd__hhttttpp__sseeeedd(()) ********** │ │ │ │ │ -void aadddd__hhttttpp__sseeeedd (string_view url); │ │ │ │ │ -void aadddd__uurrll__sseeeedd (string_view url); │ │ │ │ │ -This adds a url seed to the torrent. You can have any number of url seeds. For │ │ │ │ │ -a single file torrent, this should be an HTTP url, pointing to a file with │ │ │ │ │ -identical content as the file of the torrent. For a multi-file torrent, it │ │ │ │ │ -should point to a directory containing a directory with the same name as this │ │ │ │ │ -torrent, and all the files of the torrent in it. │ │ │ │ │ -The second function, add_http_seed() adds an HTTP seed instead. │ │ │ │ │ + total │ │ │ │ │ + the total number of bytes to download for this torrent. This may be less │ │ │ │ │ + than the size of the torrent in case there are pad files. This number │ │ │ │ │ + only counts bytes that will actually be requested from peers. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aadddd__nnooddee(()) ********** │ │ │ │ │ -void aadddd__nnooddee (std::pair node); │ │ │ │ │ -This adds a DHT node to the torrent. This especially useful if you're creating │ │ │ │ │ -a tracker less torrent. It can be used by clients to bootstrap their DHT node │ │ │ │ │ -from. The node is a hostname and a port number where there is a DHT node │ │ │ │ │ -running. You can have any number of DHT nodes in a torrent. │ │ │ │ │ + total_wanted_done │ │ │ │ │ + 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 │ │ │ │ │ + have priority 0 (i.e. not wanted). Once a torrent becomes seed, any │ │ │ │ │ + piece- and file priorities are forgotten and all bytes are considered │ │ │ │ │ + "wanted". │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aadddd__ttrraacckkeerr(()) ********** │ │ │ │ │ -void aadddd__ttrraacckkeerr (string_view url, int tier = 0); │ │ │ │ │ -Adds a tracker to the torrent. This is not strictly required, but most torrents │ │ │ │ │ -use a tracker as their main source of peers. The url should be an _h_t_t_p_:_/_/ or │ │ │ │ │ -udp:// url to a machine running a bittorrent tracker that accepts announces for │ │ │ │ │ -this torrent's info-hash. The tier is the fallback priority of the tracker. All │ │ │ │ │ -trackers with tier 0 are tried first (in any order). If all fail, trackers with │ │ │ │ │ -tier 1 are tried. If all of those fail, trackers with tier 2 are tried, and so │ │ │ │ │ -on. │ │ │ │ │ + total_wanted │ │ │ │ │ + The total number of bytes we want to download. This may be smaller than │ │ │ │ │ + the total torrent size in case any pieces are prioritized to 0, i.e. not │ │ │ │ │ + wanted. Once a torrent becomes seed, any piece- and file priorities are │ │ │ │ │ + forgotten and all bytes are considered "wanted". │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** sseett__rroooott__cceerrtt(()) ********** │ │ │ │ │ -void sseett__rroooott__cceerrtt (string_view cert); │ │ │ │ │ -This function sets an X.509 certificate in PEM format to the torrent. This │ │ │ │ │ -makes the torrent an SSSSLL ttoorrrreenntt. An SSL torrent requires that each peer has a │ │ │ │ │ -valid certificate signed by this root certificate. For SSL torrents, all peers │ │ │ │ │ -are connecting over SSL connections. For more information, see the section on │ │ │ │ │ -_s_s_l_ _t_o_r_r_e_n_t_s. │ │ │ │ │ -The string is not the path to the cert, it's the actual content of the │ │ │ │ │ -certificate. │ │ │ │ │ + all_time_upload all_time_download │ │ │ │ │ + are accumulated upload and download payload byte _c_o_u_n_t_e_r_s. They are saved │ │ │ │ │ + in and restored from resume data to keep totals across sessions. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** pprriivv(()) sseett__pprriivv(()) ********** │ │ │ │ │ -void sseett__pprriivv (bool p); │ │ │ │ │ -bool pprriivv () const; │ │ │ │ │ -Sets and queries the private flag of the torrent. Torrents with the private │ │ │ │ │ -flag set ask the client to not use any other sources than the tracker for │ │ │ │ │ -peers, and to not use DHT to advertise itself publicly, only the tracker. │ │ │ │ │ + added_time │ │ │ │ │ + the posix-time when this torrent was added. i.e. what time(nullptr) │ │ │ │ │ + returned at the time. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** nnuumm__ppiieecceess(()) ********** │ │ │ │ │ -int nnuumm__ppiieecceess () const; │ │ │ │ │ -returns the number of pieces in the associated _f_i_l_e___s_t_o_r_a_g_e object. │ │ │ │ │ + completed_time │ │ │ │ │ + the posix-time when this torrent was finished. If the torrent is not yet │ │ │ │ │ + finished, this is 0. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppiieeccee__rraannggee(()) ********** │ │ │ │ │ -index_range ppiieeccee__rraannggee () const noexcept; │ │ │ │ │ -all piece indices in the torrent to be created │ │ │ │ │ + last_seen_complete │ │ │ │ │ + the time when we, or one of our peers, last saw a complete copy of this │ │ │ │ │ + torrent. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiillee__rraannggee(()) ********** │ │ │ │ │ -index_range ffiillee__rraannggee () const noexcept; │ │ │ │ │ -all file indices in the torrent to be created │ │ │ │ │ + storage_mode │ │ │ │ │ + The allocation mode for the torrent. See _s_t_o_r_a_g_e___m_o_d_e___t for the options. │ │ │ │ │ + For more information, see _s_t_o_r_a_g_e_ _a_l_l_o_c_a_t_i_o_n. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ffiillee__ppiieeccee__rraannggee(()) ********** │ │ │ │ │ -index_range ffiillee__ppiieeccee__rraannggee (file_index_t f); │ │ │ │ │ -for v2 and hybrid torrents only, the pieces in the specified file, specified as │ │ │ │ │ -delta from the first piece in the file. i.e. the first index is 0. │ │ │ │ │ + progress │ │ │ │ │ + a value in the range [0, 1], that represents the progress of the │ │ │ │ │ + torrent's current task. It may be checking files or downloading. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ttoottaall__ssiizzee(()) ********** │ │ │ │ │ -std::int64_t ttoottaall__ssiizzee () const; │ │ │ │ │ -the total number of bytes of all files and pad files │ │ │ │ │ + progress_ppm │ │ │ │ │ + progress parts per million (progress * 1000000) when disabling floating │ │ │ │ │ + point operations, this is the only option to query progress │ │ │ │ │ + reflects the same value as progress, but instead in a range [0, 1000000] │ │ │ │ │ + (ppm = parts per million). When floating point operations are disabled, │ │ │ │ │ + this is the only alternative to the floating point value in progress. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** ppiieeccee__ssiizzee(()) ppiieeccee__lleennggtthh(()) ********** │ │ │ │ │ -int ppiieeccee__lleennggtthh () const; │ │ │ │ │ -int ppiieeccee__ssiizzee (piece_index_t i) const; │ │ │ │ │ -piece_length() returns the piece size of all pieces but the last one. │ │ │ │ │ -piece_size() returns the size of the specified piece. these functions are just │ │ │ │ │ -forwarding to the associated _f_i_l_e___s_t_o_r_a_g_e. │ │ │ │ │ + queue_position │ │ │ │ │ + the position this torrent has in the download queue. If the torrent is a │ │ │ │ │ + seed or finished, this is -1. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -********** aadddd__ssiimmiillaarr__ttoorrrreenntt(()) aadddd__ccoolllleeccttiioonn(()) ********** │ │ │ │ │ -void aadddd__ssiimmiillaarr__ttoorrrreenntt (sha1_hash ih); │ │ │ │ │ -void aadddd__ccoolllleeccttiioonn (string_view c); │ │ │ │ │ -Add similar torrents (by info-hash) or collections of similar torrents. Similar │ │ │ │ │ -torrents are expected to share some files with this torrent. Torrents sharing a │ │ │ │ │ -collection name with this torrent are also expected to share files with this │ │ │ │ │ -torrent. A torrent may have more than one collection and more than one similar │ │ │ │ │ -torrents. For more information, see _B_E_P_ _3_8. │ │ │ │ │ + download_rate upload_rate │ │ │ │ │ + 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. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - modification_time │ │ │ │ │ - This will include the file modification time as part of the torrent. This │ │ │ │ │ - is not enabled by default, as it might cause problems when you create a │ │ │ │ │ - torrent from separate files with the same content, hoping to yield the │ │ │ │ │ - same info-hash. If the files have different modification times, with this │ │ │ │ │ - option enabled, you would get different info-hashes for the files. │ │ │ │ │ + download_payload_rate upload_payload_rate │ │ │ │ │ + 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. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - symlinks │ │ │ │ │ - If this flag is set, files that are symlinks get a symlink attribute set │ │ │ │ │ - on them and their data will not be included in the torrent. This is │ │ │ │ │ - useful if you need to reconstruct a file hierarchy which contains │ │ │ │ │ - symlinks. │ │ │ │ │ + num_seeds │ │ │ │ │ + the number of peers that are seeding that this client is currently │ │ │ │ │ + connected to. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - v2_only │ │ │ │ │ - Do not generate v1 metadata. The resulting torrent will only be usable by │ │ │ │ │ - clients which support v2. This requires setting all v2 hashes, with │ │ │ │ │ - _s_e_t___h_a_s_h_2_(_) before calling _g_e_n_e_r_a_t_e_(_). Setting v1 hashes (with _s_e_t___h_a_s_h │ │ │ │ │ - _(_)) is an error with this flag set. │ │ │ │ │ + num_peers │ │ │ │ │ + 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 _g_e_t___p_e_e_r___i_n_f_o_(_). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - v1_only │ │ │ │ │ - do not generate v2 metadata or enforce v2 alignment and padding rules │ │ │ │ │ - this is mainly for tests, not recommended for production use. This │ │ │ │ │ - requires setting all v1 hashes, with _s_e_t___h_a_s_h_(_), before calling _g_e_n_e_r_a_t_e │ │ │ │ │ - _(_). Setting v2 hashes (with _s_e_t___h_a_s_h_2_(_)) is an error with this flag set. │ │ │ │ │ + num_complete num_incomplete │ │ │ │ │ + if the tracker sends scrape info in its announce reply, these fields will │ │ │ │ │ + be set to the total number of peers that have the whole file and the │ │ │ │ │ + total number of peers that are still downloading. set to -1 if the │ │ │ │ │ + tracker did not send any scrape data in its announce reply. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - canonical_files │ │ │ │ │ - This flag only affects v1-only torrents, and is only relevant together │ │ │ │ │ - with the v1_only_flag. This flag will force the same file order and │ │ │ │ │ - padding as a v2 (or hybrid) torrent would have. It has the effect of │ │ │ │ │ - ordering files and inserting pad files to align them with piece │ │ │ │ │ - boundaries. │ │ │ │ │ + list_seeds list_peers │ │ │ │ │ + the number of seeds in our peer list and the total number of peers │ │ │ │ │ + (including seeds). 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. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - no_attributes │ │ │ │ │ - passing this flag to _a_d_d___f_i_l_e_s_(_) will ignore file attributes (such as │ │ │ │ │ - executable or hidden) when adding the files to the file storage. Since │ │ │ │ │ - not all filesystems and operating systems support all file attributes the │ │ │ │ │ - resulting torrent may differ depending on where it's created. If it's │ │ │ │ │ - important for torrents to be created consistently across systems, this │ │ │ │ │ - flag should be set. │ │ │ │ │ + connect_candidates │ │ │ │ │ + the number of peers in this torrent's peer list that is a candidate to be │ │ │ │ │ + connected to. i.e. It has fewer connect attempts than the max fail count, │ │ │ │ │ + it is not a seed if we are a seed, it is not banned etc. If this is 0, it │ │ │ │ │ + means we don't know of any more peers that we can try. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ - canonical_files_no_tail_padding │ │ │ │ │ - this flag enforces the file layout to be canonical according to the │ │ │ │ │ - bittorrent v2 specification (just like the canonical_files flag) with the │ │ │ │ │ - one exception that tail padding is not added to the last file. This │ │ │ │ │ - behavior deviates from the specification but was the way libtorrent │ │ │ │ │ - created torrents in version up to and including 2.0.7. This flag is here │ │ │ │ │ - for backwards compatibility. │ │ │ │ │ + num_pieces │ │ │ │ │ + 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. Note that these │ │ │ │ │ + pieces have not necessarily been written to disk yet, and there is a risk │ │ │ │ │ + the write to disk will fail. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ aadddd__ffiilleess(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_c_r_e_a_t_e___t_o_r_r_e_n_t_._h_p_p" │ │ │ │ │ -void aadddd__ffiilleess (file_storage& fs, std::string const& file │ │ │ │ │ - , create_flags_t flags = {}); │ │ │ │ │ -void aadddd__ffiilleess (file_storage& fs, std::string const& file │ │ │ │ │ - , std::function p, create_flags_t flags = {}); │ │ │ │ │ -Adds the file specified by path to the _f_i_l_e___s_t_o_r_a_g_e object. In case path refers │ │ │ │ │ -to a directory, files will be added recursively from the directory. │ │ │ │ │ -If specified, the predicate p is called once for every file and directory that │ │ │ │ │ -is encountered. Files for which p returns true are added, and directories for │ │ │ │ │ -which p returns true are traversed. p must have the following signature: │ │ │ │ │ -bool Pred(std::string const& p); │ │ │ │ │ -The path that is passed in to the predicate is the full path of the file or │ │ │ │ │ -directory. If no predicate is specified, all files are added, and all │ │ │ │ │ -directories are traversed. │ │ │ │ │ -The ".." directory is never traversed. │ │ │ │ │ -The flags argument should be the same as the flags passed to the _c_r_e_a_t_e___t_o_r_r_e_n_t │ │ │ │ │ -constructor. │ │ │ │ │ + distributed_full_copies │ │ │ │ │ + the number of distributed copies of the torrent. Note that one copy may │ │ │ │ │ + be spread out among many peers. It tells how many copies there are │ │ │ │ │ + currently of the rarest piece(s) among the peers this client is connected │ │ │ │ │ + to. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ sseett__ppiieeccee__hhaasshheess(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_c_r_e_a_t_e___t_o_r_r_e_n_t_._h_p_p" │ │ │ │ │ -void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p │ │ │ │ │ - , settings_interface const& settings, disk_io_constructor_type disk_io │ │ │ │ │ - , std::function const& f, error_code& ec); │ │ │ │ │ -inline void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p, │ │ │ │ │ -error_code& ec); │ │ │ │ │ -inline void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p │ │ │ │ │ - , std::function const& f); │ │ │ │ │ -inline void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p); │ │ │ │ │ -inline void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p │ │ │ │ │ - , settings_interface const& settings │ │ │ │ │ - , std::function const& f); │ │ │ │ │ -void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p │ │ │ │ │ - , settings_interface const& settings │ │ │ │ │ - , std::function const& f, error_code& ec); │ │ │ │ │ -void sseett__ppiieeccee__hhaasshheess (create_torrent& t, std::string const& p │ │ │ │ │ - , std::function const& f, error_code& ec); │ │ │ │ │ -This function will assume that the files added to the torrent file exists at │ │ │ │ │ -path p, read those files and hash the content and set the hashes in the │ │ │ │ │ -create_torrent object. The optional function f is called in between every hash │ │ │ │ │ -that is set. f must have the following signature: │ │ │ │ │ -void Fun(piece_index_t); │ │ │ │ │ -The overloads taking a _s_e_t_t_i_n_g_s___p_a_c_k may be used to configure the underlying │ │ │ │ │ -disk access. Such as settings_pack::aio_threads. │ │ │ │ │ -The overloads that don't take an error_code& may throw an exception in case of │ │ │ │ │ -a file error, the other overloads sets the error code to reflect the error, if │ │ │ │ │ -any. │ │ │ │ │ + distributed_fraction │ │ │ │ │ + tells the share of pieces that have more copies than the rarest piece(s). │ │ │ │ │ + Divide this number by 1000 to get the fraction. │ │ │ │ │ + For example, if distributed_full_copies is 2 and distributed_fraction is │ │ │ │ │ + 500, it means 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 members are set to -1. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + distributed_copies │ │ │ │ │ + the number of distributed copies of the file. note that one copy may be │ │ │ │ │ + spread out among many peers. This is a floating point representation of │ │ │ │ │ + the distributed copies. │ │ │ │ │ + the integer part tells how many copies │ │ │ │ │ + there are of the rarest piece(s) │ │ │ │ │ + the fractional part tells the fraction of pieces that │ │ │ │ │ + have more copies than the rarest piece(s). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + block_size │ │ │ │ │ + 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 │ │ │ │ │ + _g_e_t___d_o_w_n_l_o_a_d___q_u_e_u_e_(_). This is typically 16 kB, but it may be smaller, if │ │ │ │ │ + the pieces are smaller. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + num_uploads │ │ │ │ │ + the number of unchoked peers in this torrent. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + num_connections │ │ │ │ │ + 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. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + uploads_limit │ │ │ │ │ + the set limit of upload slots (unchoked peers) for this torrent. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + connections_limit │ │ │ │ │ + the set limit of number of connections for this torrent. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + up_bandwidth_queue down_bandwidth_queue │ │ │ │ │ + the number of peers in this torrent that are waiting for more bandwidth │ │ │ │ │ + quota from the torrent rate limiter. This can determine if the rate you │ │ │ │ │ + get from this torrent is bound by the torrents limit or not. If there is │ │ │ │ │ + no limit set on this torrent, the peers might still be waiting for │ │ │ │ │ + bandwidth quota from the global limiter, but then they are counted in the │ │ │ │ │ + session_status object. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + seed_rank │ │ │ │ │ + A rank of how important it is to seed the torrent, it is used to │ │ │ │ │ + determine which torrents to seed and which to queue. It is based on the │ │ │ │ │ + peer to seed ratio from the tracker scrape. For more information, see │ │ │ │ │ + _q_u_e_u_i_n_g. Higher value means more important to seed │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + state │ │ │ │ │ + the main state the torrent is in. See _t_o_r_r_e_n_t___s_t_a_t_u_s_:_:_s_t_a_t_e___t. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + need_save_resume │ │ │ │ │ + true if this torrent has unsaved changes to its download state and │ │ │ │ │ + statistics since the last resume data was saved. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + is_seeding │ │ │ │ │ + true if all pieces have been downloaded. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + is_finished │ │ │ │ │ + true if all pieces that have a priority > 0 are downloaded. There is only │ │ │ │ │ + a distinction between finished and seeding if some pieces or files have │ │ │ │ │ + been set to priority 0, i.e. are not downloaded. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + has_metadata │ │ │ │ │ + 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 be false is when the torrent was started torrent-less (i.e. with just │ │ │ │ │ + an info-hash and tracker ip, a magnet link for instance). │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + has_incoming │ │ │ │ │ + true if there has ever been an incoming connection attempt to this │ │ │ │ │ + torrent. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + moving_storage │ │ │ │ │ + this is true if this torrent's storage is currently being moved from one │ │ │ │ │ + location to another. This may potentially be a long operation if a large │ │ │ │ │ + file ends up being copied from one drive to another. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + announcing_to_trackers announcing_to_lsd announcing_to_dht │ │ │ │ │ + these are set to true if this torrent is allowed to announce to the │ │ │ │ │ + respective peer source. Whether they are true or false is determined by │ │ │ │ │ + the queue logic/auto manager. Torrents that are not auto managed will │ │ │ │ │ + always be allowed to announce to all peer sources. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + info_hashes │ │ │ │ │ + the info-hash for this torrent │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + last_upload last_download │ │ │ │ │ + the timestamps of the last time this torrent uploaded or downloaded │ │ │ │ │ + payload to any peer. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + active_duration finished_duration seeding_duration │ │ │ │ │ + these are cumulative _c_o_u_n_t_e_r_s of for how long the torrent has been in │ │ │ │ │ + different states. active means not paused and added to _s_e_s_s_i_o_n. Whether │ │ │ │ │ + it has found any peers or not is not relevant. finished means all │ │ │ │ │ + selected files/pieces were downloaded and available to other peers (this │ │ │ │ │ + is always a subset of active time). seeding means all files/pieces were │ │ │ │ │ + downloaded and available to peers. Being available to peers does not │ │ │ │ │ + imply there are other peers asking for the payload. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ + flags │ │ │ │ │ + reflects several of the torrent's flags. For more information, see │ │ │ │ │ + torrent_handle::flags(). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ ddhhtt__ssttoorraaggee__ccoouunntteerrss ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_k_a_d_e_m_l_i_a_/_d_h_t___s_t_o_r_a_g_e_._h_p_p" │ │ │ │ │ This structure hold the relevant _c_o_u_n_t_e_r_s for the storage │ │ │ │ │ struct dht_storage_counters │ │ │ │ │ { │ │ │ │ │ void rreesseett (); │ │ │ │ │ @@ -12630,22 +12630,45 @@ │ │ │ │ │ announce to DHT with the implied-port flag set. This tells the network to │ │ │ │ │ use your source UDP port as your listen port, rather than the one │ │ │ │ │ specified in the message. This may improve the chances of traversing NATs │ │ │ │ │ when using uTP. │ │ │ │ │ ssl_torrent │ │ │ │ │ Specify the port number for the SSL listen socket in the DHT announce. │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ wwrriittee__rreessuummee__ddaattaa(()) wwrriittee__rreessuummee__ddaattaa__bbuuff(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_w_r_i_t_e___r_e_s_u_m_e___d_a_t_a_._h_p_p" │ │ │ │ │ +std::vector wwrriittee__rreessuummee__ddaattaa__bbuuff (add_torrent_params const& atp); │ │ │ │ │ +entry wwrriittee__rreessuummee__ddaattaa (add_torrent_params const& atp); │ │ │ │ │ +this function turns the resume data in an add_torrent_params object into a │ │ │ │ │ +bencoded structure │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ +************ wwrriittee__ttoorrrreenntt__ffiillee(()) wwrriittee__ttoorrrreenntt__ffiillee__bbuuff(()) ************ │ │ │ │ │ +Declared in "_l_i_b_t_o_r_r_e_n_t_/_w_r_i_t_e___r_e_s_u_m_e___d_a_t_a_._h_p_p" │ │ │ │ │ +entry wwrriittee__ttoorrrreenntt__ffiillee (add_torrent_params const& atp, write_torrent_flags_t │ │ │ │ │ +flags); │ │ │ │ │ +std::vector wwrriittee__ttoorrrreenntt__ffiillee__bbuuff (add_torrent_params const& atp │ │ │ │ │ + , write_torrent_flags_t flags); │ │ │ │ │ +entry wwrriittee__ttoorrrreenntt__ffiillee (add_torrent_params const& atp); │ │ │ │ │ +writes only the fields to create a .torrent file. This function may fail with a │ │ │ │ │ +std::system_error exception if: │ │ │ │ │ + * The _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s object passed to this function does not contain │ │ │ │ │ + the info dictionary (the ti field) │ │ │ │ │ + * The piece layers are not complete for all files that need them │ │ │ │ │ +The write_torrent_file_buf() overload returns the torrent file in bencoded │ │ │ │ │ +buffer form. This overload may be faster at the expense of lost flexibility to │ │ │ │ │ +add custom fields. │ │ │ │ │ +[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ rreeaadd__rreessuummee__ddaattaa(()) ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_r_e_a_d___r_e_s_u_m_e___d_a_t_a_._h_p_p" │ │ │ │ │ -add_torrent_params rreeaadd__rreessuummee__ddaattaa (bdecode_node const& rd │ │ │ │ │ - , error_code& ec, int piece_limit = 0x200000); │ │ │ │ │ add_torrent_params rreeaadd__rreessuummee__ddaattaa (span buffer │ │ │ │ │ , error_code& ec, load_torrent_limits const& cfg = {}); │ │ │ │ │ add_torrent_params rreeaadd__rreessuummee__ddaattaa (bdecode_node const& rd │ │ │ │ │ , int piece_limit = 0x200000); │ │ │ │ │ +add_torrent_params rreeaadd__rreessuummee__ddaattaa (bdecode_node const& rd │ │ │ │ │ + , error_code& ec, int piece_limit = 0x200000); │ │ │ │ │ add_torrent_params rreeaadd__rreessuummee__ddaattaa (span buffer │ │ │ │ │ , load_torrent_limits const& cfg = {}); │ │ │ │ │ these functions are used to parse resume data and populate the appropriate │ │ │ │ │ fields in an _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s object. This object can then be used to add the │ │ │ │ │ actual _t_o_r_r_e_n_t___i_n_f_o object to and pass to session::add_torrent() or session:: │ │ │ │ │ async_add_torrent(). │ │ │ │ │ If the client wants to override any field that was loaded from the resume data, │ │ │ │ │ @@ -12655,37 +12678,14 @@ │ │ │ │ │ the torrent that may be loaded as part of the resume data, if it contains an │ │ │ │ │ info field. The overloads that take a flat buffer are instead configured with │ │ │ │ │ limits on torrent sizes via load_torrent limits. │ │ │ │ │ In order to support large torrents, it may also be necessary to raise the │ │ │ │ │ _s_e_t_t_i_n_g_s___p_a_c_k_:_:_m_a_x___p_i_e_c_e___c_o_u_n_t setting and pass a higher limit to calls to │ │ │ │ │ _t_o_r_r_e_n_t___i_n_f_o_:_:_p_a_r_s_e___i_n_f_o___s_e_c_t_i_o_n_(_). │ │ │ │ │ [_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ wwrriittee__rreessuummee__ddaattaa(()) wwrriittee__rreessuummee__ddaattaa__bbuuff(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_w_r_i_t_e___r_e_s_u_m_e___d_a_t_a_._h_p_p" │ │ │ │ │ -std::vector wwrriittee__rreessuummee__ddaattaa__bbuuff (add_torrent_params const& atp); │ │ │ │ │ -entry wwrriittee__rreessuummee__ddaattaa (add_torrent_params const& atp); │ │ │ │ │ -this function turns the resume data in an add_torrent_params object into a │ │ │ │ │ -bencoded structure │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ -************ wwrriittee__ttoorrrreenntt__ffiillee__bbuuff(()) wwrriittee__ttoorrrreenntt__ffiillee(()) ************ │ │ │ │ │ -Declared in "_l_i_b_t_o_r_r_e_n_t_/_w_r_i_t_e___r_e_s_u_m_e___d_a_t_a_._h_p_p" │ │ │ │ │ -entry wwrriittee__ttoorrrreenntt__ffiillee (add_torrent_params const& atp); │ │ │ │ │ -std::vector wwrriittee__ttoorrrreenntt__ffiillee__bbuuff (add_torrent_params const& atp │ │ │ │ │ - , write_torrent_flags_t flags); │ │ │ │ │ -entry wwrriittee__ttoorrrreenntt__ffiillee (add_torrent_params const& atp, write_torrent_flags_t │ │ │ │ │ -flags); │ │ │ │ │ -writes only the fields to create a .torrent file. This function may fail with a │ │ │ │ │ -std::system_error exception if: │ │ │ │ │ - * The _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s object passed to this function does not contain │ │ │ │ │ - the info dictionary (the ti field) │ │ │ │ │ - * The piece layers are not complete for all files that need them │ │ │ │ │ -The write_torrent_file_buf() overload returns the torrent file in bencoded │ │ │ │ │ -buffer form. This overload may be faster at the expense of lost flexibility to │ │ │ │ │ -add custom fields. │ │ │ │ │ -[_r_e_p_o_r_t_ _i_s_s_u_e] │ │ │ │ │ ************ wwrriittee__ttoorrrreenntt__ffllaaggss__tt ************ │ │ │ │ │ Declared in "_l_i_b_t_o_r_r_e_n_t_/_w_r_i_t_e___r_e_s_u_m_e___d_a_t_a_._h_p_p" │ │ │ │ │ allow_missing_piece_layer │ │ │ │ │ this makes _w_r_i_t_e___t_o_r_r_e_n_t___f_i_l_e_(_) not fail when attempting to write a v2 │ │ │ │ │ torrent file that does not have all the piece layers │ │ │ │ │ no_http_seeds │ │ │ │ │ don't include http seeds in the torrent file, even if some are present in │ │ │ ├── ./usr/share/doc/libtorrent-rasterbar-doc/html/todo.html │ │ │ │ @@ -459,306 +459,305 @@ │ │ │ │ auto o = rpc.allocate_observer<null_observer>(std::move(algo), source, node_id()); │ │ │ │ #if TORRENT_USE_ASSERTS │ │ │ │ o->m_in_constructor = false; │ │ │ │ #endif │ │ │ │ o->flags |= observer::flag_queried; │ │ │ │ rpc.invoke(req, source, o); │ │ │ │ │ │ │ │ -relevance 3../src/session_handle.cpp:691expose the sequence_number, public_key, secret_key and signature types to the client

    expose the sequence_number, public_key, secret_key and signature │ │ │ │ -types to the client

    ../src/session_handle.cpp:691

    	void session_handle::dht_get_item(sha1_hash const& target)
    │ │ │ │ -	{
    │ │ │ │ -#ifndef TORRENT_DISABLE_DHT
    │ │ │ │ -		async_call(&session_impl::dht_get_immutable_item, target);
    │ │ │ │ -#else
    │ │ │ │ -		TORRENT_UNUSED(target);
    │ │ │ │ -#endif
    │ │ │ │ -	}
    │ │ │ │ +
    relevance 3../src/torrent.cpp:419we could probably get away with just saving a few fields here

    we could probably get away with just saving a few fields here

    ../src/torrent.cpp:419

    		// --- V2 HASHES ---
    │ │ │ │  
    │ │ │ │ -	void session_handle::dht_get_item(std::array<char, 32> key
    │ │ │ │ -		, std::string salt)
    │ │ │ │ -	{
    │ │ │ │ -#ifndef TORRENT_DISABLE_DHT
    │ │ │ │ -		async_call(&session_impl::dht_get_mutable_item, key, salt);
    │ │ │ │ -#else
    │ │ │ │ -		TORRENT_UNUSED(key);
    │ │ │ │ -		TORRENT_UNUSED(salt);
    │ │ │ │ -#endif
    │ │ │ │ -	}
    │ │ │ │ +		if (m_torrent_file->is_valid() && m_torrent_file->info_hashes().has_v2())
    │ │ │ │ +		{
    │ │ │ │ +			if (!p.merkle_trees.empty())
    │ │ │ │ +				load_merkle_trees(
    │ │ │ │ +					std::move(p.merkle_trees)
    │ │ │ │ +					, std::move(p.merkle_tree_mask)
    │ │ │ │ +					, std::move(p.verified_leaf_hashes));
    │ │ │ │  
    │ │ │ │ -
    sha1_hash session_handle::dht_put_item(entry data) │ │ │ │ -
    { │ │ │ │ - std::vector<char> buf; │ │ │ │ - bencode(std::back_inserter(buf), data); │ │ │ │ - sha1_hash const ret = hasher(buf).final(); │ │ │ │ + // we really don't want to store extra copies of the trees │ │ │ │ + TORRENT_ASSERT(p.merkle_trees.empty()); │ │ │ │ + } │ │ │ │ │ │ │ │ -#ifndef TORRENT_DISABLE_DHT │ │ │ │ - async_call(&session_impl::dht_put_immutable_item, data, ret); │ │ │ │ -#endif │ │ │ │ - return ret; │ │ │ │ - } │ │ │ │ + if (valid_metadata()) │ │ │ │ + { │ │ │ │ + inc_stats_counter(counters::num_total_pieces_added │ │ │ │ + , m_torrent_file->num_pieces()); │ │ │ │ + } │ │ │ │ │ │ │ │ - void session_handle::dht_put_item(std::array<char, 32> key │ │ │ │ - , std::function<void(entry&, std::array<char,64>& │ │ │ │ - , std::int64_t&, std::string const&)> cb │ │ │ │ - , std::string salt) │ │ │ │ - { │ │ │ │ -#ifndef TORRENT_DISABLE_DHT │ │ │ │ - async_call(&session_impl::dht_put_mutable_item, key, cb, salt); │ │ │ │ -#else │ │ │ │ - TORRENT_UNUSED(key); │ │ │ │ - TORRENT_UNUSED(cb); │ │ │ │ - TORRENT_UNUSED(salt); │ │ │ │ -#endif │ │ │ │ - } │ │ │ │ +
    m_add_torrent_params = std::make_unique<add_torrent_params>(std::move(p)); │ │ │ │ +
    } │ │ │ │ │ │ │ │ - void session_handle::dht_get_peers(sha1_hash const& info_hash) │ │ │ │ + void torrent::load_merkle_trees( │ │ │ │ + aux::vector<std::vector<sha256_hash>, file_index_t> trees_import │ │ │ │ + , aux::vector<std::vector<bool>, file_index_t> mask │ │ │ │ + , aux::vector<std::vector<bool>, file_index_t> verified) │ │ │ │ { │ │ │ │ -#ifndef TORRENT_DISABLE_DHT │ │ │ │ - async_call(&session_impl::dht_get_peers, info_hash); │ │ │ │ -#else │ │ │ │ -
    relevance 3../src/web_peer_connection.cpp:199this should be an optional, piece index -1 should not be allowed

    this should be an optional, piece index -1 should │ │ │ │ -not be allowed

    ../src/web_peer_connection.cpp:199

    │ │ │ │ -			auto const range = aux::file_piece_range_inclusive(fs, i);
    │ │ │ │ -			for (piece_index_t k = std::get<0>(range); k < std::get<1>(range); ++k)
    │ │ │ │ -				have.clear_bit(k);
    │ │ │ │ -		}
    │ │ │ │ -		t->set_seed(peer_info_struct(), false);
    │ │ │ │ -		if (have.none_set())
    │ │ │ │ -		{
    │ │ │ │ -			incoming_have_none();
    │ │ │ │ -			m_web->interesting = false;
    │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -			peer_log(peer_log_alert::info, "WEB-SEED", "have no pieces, not interesting. %s", m_url.c_str());
    │ │ │ │ -#endif
    │ │ │ │ -		}
    │ │ │ │ -		else
    │ │ │ │ +		auto const& fs = m_torrent_file->orig_files();
    │ │ │ │ +
    │ │ │ │ +		std::vector<bool> const empty_verified;
    │ │ │ │ +		for (file_index_t i{0}; i < fs.end_file(); ++i)
    │ │ │ │  		{
    │ │ │ │ -			incoming_bitfield(have);
    │ │ │ │ -		}
    │ │ │ │ -	}
    │ │ │ │ +			if (fs.pad_file_at(i) || fs.file_size(i) == 0)
    │ │ │ │ +				continue;
    │ │ │ │  
    │ │ │ │ -
    if (m_web->restart_request.piece != piece_index_t(-1)) │ │ │ │ -
    { │ │ │ │ - // increase the chances of requesting the block │ │ │ │ - // we have partial data for already, to finish it │ │ │ │ - incoming_suggest(m_web->restart_request.piece); │ │ │ │ + if (i >= trees_import.end_index()) break; │ │ │ │ + std::vector<bool> const& verified_bitmask = (i >= verified.end_index()) ? empty_verified : verified[i]; │ │ │ │ + if (i < mask.end_index() && !mask[i].empty()) │ │ │ │ + { │ │ │ │ + mask[i].resize(m_merkle_trees[i].size(), false); │ │ │ │ + m_merkle_trees[i].load_sparse_tree(trees_import[i], mask[i], verified_bitmask); │ │ │ │ + } │ │ │ │ + else │ │ │ │ + { │ │ │ │ + m_merkle_trees[i].load_tree(trees_import[i], verified_bitmask); │ │ │ │ + } │ │ │ │ + } │ │ │ │ } │ │ │ │ - web_connection_base::on_connected(); │ │ │ │ -} │ │ │ │ │ │ │ │ -void web_peer_connection::disconnect(error_code const& ec │ │ │ │ - , operation_t op, disconnect_severity_t const error) │ │ │ │ -{ │ │ │ │ - if (is_disconnecting()) return; │ │ │ │ + void torrent::inc_stats_counter(int c, int value) │ │ │ │ +
    relevance 3../src/torrent.cpp:715assert there are no outstanding async operations on this torrent

    assert there are no outstanding async operations on this │ │ │ │ +torrent

    ../src/torrent.cpp:715

    #endif
    │ │ │ │  
    │ │ │ │ -	if (op == operation_t::sock_write && ec == boost::system::errc::broken_pipe)
    │ │ │ │ -	{
    │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -		// a write operation failed with broken-pipe. This typically happens
    │ │ │ │ -		// with HTTP 1.0 servers that close their incoming channel of the TCP
    │ │ │ │ -		// stream whenever they're done reading one full request. Instead of
    │ │ │ │ -		// us bailing out and failing the entire request just because our
    │ │ │ │ -		// write-end was closed, ignore it and keep reading until the read-end
    │ │ │ │ -		// also is closed.
    │ │ │ │ -		peer_log(peer_log_alert::info, "WRITE_DIRECTION", "CLOSED");
    │ │ │ │ -#endif
    │ │ │ │ +		if (!m_ses.dht()) return false;
    │ │ │ │ +		if (m_torrent_file->is_valid() && !m_files_checked) return false;
    │ │ │ │ +		if (!m_announce_to_dht) return false;
    │ │ │ │ +		if (m_paused) return false;
    │ │ │ │  
    │ │ │ │ -		// prevent the peer from trying to send anything more
    │ │ │ │ -		m_send_buffer.clear();
    │ │ │ │ +		// don't announce private torrents
    │ │ │ │ +		if (m_torrent_file->is_valid() && m_torrent_file->priv()) return false;
    │ │ │ │ +		if (m_trackers.empty()) return true;
    │ │ │ │ +		if (!settings().get_bool(settings_pack::use_dht_as_fallback)) return true;
    │ │ │ │  
    │ │ │ │ -		// when the web server closed our write-end of the socket (i.e. its
    │ │ │ │ -		// read-end), if it's an HTTP 1.0 server. we will stop sending more
    │ │ │ │ -
    relevance 3../src/web_peer_connection.cpp:419do we really need a special case here? wouldn't the multi-file case handle single file torrents correctly too?

    do we really need a special case here? wouldn't the multi-file │ │ │ │ -case handle single file torrents correctly too?

    ../src/web_peer_connection.cpp:419

    		size -= pr.length;
    │ │ │ │ +		return std::none_of(m_trackers.begin(), m_trackers.end()
    │ │ │ │ +			, [](aux::announce_entry const& tr) { return bool(tr.verified); });
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -	peer_log(peer_log_alert::outgoing_message, "REQUESTING", "(piece: %d start: %d) - (piece: %d end: %d)"
    │ │ │ │ -		, static_cast<int>(r.piece), r.start
    │ │ │ │ -		, static_cast<int>(pr.piece), pr.start + pr.length);
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │ -	bool const single_file_request = t->torrent_file().num_files() == 1;
    │ │ │ │ -	int const proxy_type = m_settings.get_int(settings_pack::proxy_type);
    │ │ │ │ -	bool const using_proxy = (proxy_type == settings_pack::http
    │ │ │ │ -		|| proxy_type == settings_pack::http_pw) && !m_ssl;
    │ │ │ │ +	torrent::~torrent()
    │ │ │ │ +	{
    │ │ │ │ +
    │ │ │ │ +
    #if TORRENT_USE_ASSERTS │ │ │ │ + for (torrent_list_index_t i{}; i != m_links.end_index(); ++i) │ │ │ │ + { │ │ │ │ + if (!m_links[i].in_list()) continue; │ │ │ │ + m_links[i].unlink(m_ses.torrent_list(i), i); │ │ │ │ + } │ │ │ │ +#endif │ │ │ │ │ │ │ │ - // the number of pad files that have been "requested". In case we _only_ │ │ │ │ - // request padfiles, we can't rely on handling them in the on_receive() │ │ │ │ - // callback (because we won't receive anything), instead we have to post a │ │ │ │ - // pretend read callback where we can deliver the zeroes for the partfile │ │ │ │ - int num_pad_files = 0; │ │ │ │ + // The invariant can't be maintained here, since the torrent │ │ │ │ + // is being destructed, all weak references to it have been │ │ │ │ + // reset, which means that all its peers already have an │ │ │ │ + // invalidated torrent pointer (so it cannot be verified to be correct) │ │ │ │ │ │ │ │ -
    if (single_file_request) │ │ │ │ -
    { │ │ │ │ - file_request_t file_req; │ │ │ │ - file_req.file_index = file_index_t(0); │ │ │ │ - file_req.start = std::int64_t(static_cast<int>(req.piece)) * info.piece_length() │ │ │ │ - + req.start; │ │ │ │ - file_req.length = req.length; │ │ │ │ + // i.e. the invariant can only be maintained if all connections have │ │ │ │ + // been closed by the time the torrent is destructed. And they are │ │ │ │ + // supposed to be closed. So we can still do the invariant check. │ │ │ │ │ │ │ │ - request += "GET "; │ │ │ │ - // do not encode single file paths, they are │ │ │ │ - // assumed to be encoded in the torrent file │ │ │ │ - request += using_proxy ? m_url : m_path; │ │ │ │ - request += " HTTP/1.1\r\n"; │ │ │ │ - add_headers(request, m_settings, using_proxy); │ │ │ │ - request += "\r\nRange: bytes="; │ │ │ │ - request += to_string(file_req.start).data(); │ │ │ │ - request += "-"; │ │ │ │ - request += to_string(file_req.start + file_req.length - 1).data(); │ │ │ │ - request += "\r\n\r\n"; │ │ │ │ - m_first_request = false; │ │ │ │ + // however, the torrent object may be destructed from the main │ │ │ │ + // thread when shutting down, if the disk cache has references to it. │ │ │ │ + // this means that the invariant check that this is called from the │ │ │ │ + // network thread cannot be maintained │ │ │ │ │ │ │ │ - m_file_requests.push_back(file_req); │ │ │ │ + TORRENT_ASSERT(m_peer_class == peer_class_t{0}); │ │ │ │ + TORRENT_ASSERT(m_connections.empty()); │ │ │ │ + // just in case, make sure the session accounting is kept right │ │ │ │ + for (auto p : m_connections) │ │ │ │ + m_ses.close_connection(p); │ │ │ │ } │ │ │ │ - else │ │ │ │ + │ │ │ │ + void torrent::read_piece(piece_index_t const piece) │ │ │ │ +
    relevance 3../src/torrent.cpp:1331there's some duplication between this function and peer_connection::incoming_piece(). is there a way to merge something?

    there's some duplication between this function and │ │ │ │ +peer_connection::incoming_piece(). is there a way to merge something?

    ../src/torrent.cpp:1331

    		piece_index_t m_piece;
    │ │ │ │ +		bool m_armed = true;
    │ │ │ │ +	};
    │ │ │ │ +
    │ │ │ │ +	void torrent::add_piece_async(piece_index_t const piece
    │ │ │ │ +		, std::vector<char> data, add_piece_flags_t const flags)
    │ │ │ │  	{
    │ │ │ │ -		std::vector<file_slice> files = info.orig_files().map_block(req.piece, req.start
    │ │ │ │ -			, req.length);
    │ │ │ │ +		TORRENT_ASSERT(is_single_thread());
    │ │ │ │  
    │ │ │ │ -		for (auto const &f : files)
    │ │ │ │ -		{
    │ │ │ │ -			file_request_t file_req;
    │ │ │ │ -
    relevance 3../src/web_peer_connection.cpp:504file_index_t should not allow negative values

    file_index_t should not allow negative values

    ../src/web_peer_connection.cpp:504

    					// with the correct slashes. Don't encode it again
    │ │ │ │ -					request += m_path;
    │ │ │ │ -				}
    │ │ │ │ +		// make sure the piece index is correct
    │ │ │ │ +		if (piece >= torrent_file().end_piece())
    │ │ │ │ +			return;
    │ │ │ │  
    │ │ │ │ -				request += escape_file_path(info.orig_files(), f.file_index);
    │ │ │ │ -			}
    │ │ │ │ -			request += " HTTP/1.1\r\n";
    │ │ │ │ -			add_headers(request, m_settings, using_proxy);
    │ │ │ │ -			request += "\r\nRange: bytes=";
    │ │ │ │ -			request += to_string(f.offset).data();
    │ │ │ │ -			request += "-";
    │ │ │ │ -			request += to_string(f.offset + f.size - 1).data();
    │ │ │ │ -			request += "\r\n\r\n";
    │ │ │ │ -			m_first_request = false;
    │ │ │ │ +		// make sure the piece size is correct
    │ │ │ │ +		if (data.size() != std::size_t(m_torrent_file->piece_size(piece)))
    │ │ │ │ +			return;
    │ │ │ │  
    │ │ │ │ -#if 0
    │ │ │ │ -			std::cerr << this << " SEND-REQUEST: f: " << f.file_index
    │ │ │ │ -				<< " s: " << f.offset
    │ │ │ │ -				<< " e: " << (f.offset + f.size - 1) << std::endl;
    │ │ │ │ -#endif
    │ │ │ │ -
    TORRENT_ASSERT(f.file_index >= file_index_t(0)); │ │ │ │ -
    │ │ │ │ - m_file_requests.push_back(file_req); │ │ │ │ - } │ │ │ │ + add_piece(piece, data.data(), flags); │ │ │ │ } │ │ │ │ │ │ │ │ - if (num_pad_files == int(m_file_requests.size())) │ │ │ │ +
    void torrent::add_piece(piece_index_t const piece, char const* data │ │ │ │ +
    , add_piece_flags_t const flags) │ │ │ │ { │ │ │ │ - post(get_context(), std::bind( │ │ │ │ - &web_peer_connection::on_receive_padfile, │ │ │ │ - std::static_pointer_cast<web_peer_connection>(self()))); │ │ │ │ - return; │ │ │ │ - } │ │ │ │ + TORRENT_ASSERT(is_single_thread()); │ │ │ │ │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - peer_log(peer_log_alert::outgoing_message, "REQUEST", "%s", request.c_str()); │ │ │ │ -#endif │ │ │ │ + // make sure the piece index is correct │ │ │ │ + if (piece >= torrent_file().end_piece()) │ │ │ │ + return; │ │ │ │ │ │ │ │ - send_buffer(request); │ │ │ │ -} │ │ │ │ + int const piece_size = m_torrent_file->piece_size(piece); │ │ │ │ + int const blocks_in_piece = (piece_size + block_size() - 1) / block_size(); │ │ │ │ │ │ │ │ -namespace { │ │ │ │ + if (m_deleted) return; │ │ │ │ │ │ │ │ - std::string get_peer_name(http_parser const& p, std::string const& host) │ │ │ │ + // avoid crash trying to access the picker when there is none │ │ │ │ + if (m_have_all && !has_picker()) return; │ │ │ │ + │ │ │ │ + // we don't support clobbering the piece picker while checking the │ │ │ │ + // files. We may end up having the same piece multiple times │ │ │ │ + TORRENT_ASSERT_PRECOND(state() != torrent_status::checking_files │ │ │ │ + && state() != torrent_status::checking_resume_data); │ │ │ │ + if (state() == torrent_status::checking_files │ │ │ │ + || state() == torrent_status::checking_resume_data) │ │ │ │ + return; │ │ │ │ + │ │ │ │ + need_picker(); │ │ │ │ + │ │ │ │ + if (picker().have_piece(piece) │ │ │ │ + && !(flags & torrent_handle::overwrite_existing)) │ │ │ │ + return; │ │ │ │ + │ │ │ │ +
    relevance 3../src/torrent.cpp:3966this could probably be pulled out into a free function

    this could probably be pulled out into a free function

    ../src/torrent.cpp:3966

    	std::int64_t calc_bytes(file_storage const& fs, piece_count const& pc)
    │ │ │ │  	{
    │ │ │ │ -		std::string const& server_version = p.header("server");
    │ │ │ │ -		if (!server_version.empty())
    │ │ │ │ -			return server_version;
    │ │ │ │ -		return host;
    │ │ │ │ +		// it's an impossible combination to have 0 pieces, but still have one of them be the last piece
    │ │ │ │ +		TORRENT_ASSERT(!(pc.num_pieces == 0 && pc.last_piece == true));
    │ │ │ │ +
    │ │ │ │ +		// if we have 0 pieces, we can't have any pad blocks either
    │ │ │ │ +		TORRENT_ASSERT(!(pc.num_pieces == 0 && pc.pad_bytes > 0));
    │ │ │ │ +
    │ │ │ │ +		// if we have all pieces, we must also have the last one
    │ │ │ │ +		TORRENT_ASSERT(!(pc.num_pieces == fs.num_pieces() && pc.last_piece == false));
    │ │ │ │ +
    │ │ │ │ +		// every block should not be a pad block
    │ │ │ │ +		TORRENT_ASSERT(pc.pad_bytes <= std::int64_t(pc.num_pieces) * fs.piece_length());
    │ │ │ │ +
    │ │ │ │ +		return std::int64_t(pc.num_pieces) * fs.piece_length()
    │ │ │ │ +			- (pc.last_piece ? fs.piece_length() - fs.piece_size(fs.last_piece()) : 0)
    │ │ │ │ +			- std::int64_t(pc.pad_bytes);
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ -
    relevance 3../src/web_peer_connection.cpp:695this could be made more efficient for the case when we use an HTTP proxy. Then we wouldn't need to add new web seeds to the torrent, we could just make the redirect table contain full URLs.

    this could be made more efficient for the case when we use an │ │ │ │ -HTTP proxy. Then we wouldn't need to add new web seeds to the torrent, │ │ │ │ -we could just make the redirect table contain full URLs.

    ../src/web_peer_connection.cpp:695

    	bool const single_file_request = !m_path.empty()
    │ │ │ │ -		&& m_path[m_path.size() - 1] != '/';
    │ │ │ │ +	// fills in total_wanted, total_wanted_done and total_done
    │ │ │ │ +
    void torrent::bytes_done(torrent_status& st, status_flags_t const flags) const │ │ │ │ +
    { │ │ │ │ + INVARIANT_CHECK; │ │ │ │ │ │ │ │ - // when SSRF mitigation is enabled, a web seed on the internet (is_global()) │ │ │ │ - // is not allowed to redirect to a server on the local network, so we set │ │ │ │ - // the no_local_ips flag │ │ │ │ - auto const web_seed_flags = torrent::ephemeral │ │ │ │ - | ((m_settings.get_bool(settings_pack::ssrf_mitigation) && aux::is_global(remote().address())) │ │ │ │ - ? torrent::no_local_ips : web_seed_flag_t{}); │ │ │ │ + st.total_done = 0; │ │ │ │ + st.total_wanted_done = 0; │ │ │ │ + st.total_wanted = m_size_on_disk; │ │ │ │ │ │ │ │ - // add the redirected url and remove the current one │ │ │ │ - if (!single_file_request) │ │ │ │ - { │ │ │ │ - TORRENT_ASSERT(!m_file_requests.empty()); │ │ │ │ - file_index_t const file_index = m_file_requests.front().file_index; │ │ │ │ + TORRENT_ASSERT(st.total_wanted <= m_torrent_file->total_size()); │ │ │ │ + TORRENT_ASSERT(st.total_wanted >= 0); │ │ │ │ │ │ │ │ - location = resolve_redirect_location(m_url, location); │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - peer_log(peer_log_alert::info, "LOCATION", "%s", location.c_str()); │ │ │ │ -#endif │ │ │ │ -
    std::string redirect_base; │ │ │ │ -
    std::string redirect_path; │ │ │ │ - error_code ec; │ │ │ │ - std::tie(redirect_base, redirect_path) = split_url(location, ec); │ │ │ │ + TORRENT_ASSERT(!valid_metadata() || m_torrent_file->num_pieces() > 0); │ │ │ │ + if (!valid_metadata()) return; │ │ │ │ │ │ │ │ - if (ec) │ │ │ │ + if (m_seed_mode || is_seed()) │ │ │ │ { │ │ │ │ - // we should not try this server again. │ │ │ │ - disconnect(errors::missing_location, operation_t::bittorrent, failure); │ │ │ │ + // once we're a seed and remove the piece picker, we stop tracking │ │ │ │ + // piece- and file priority. We consider everything as being │ │ │ │ + // "wanted" │ │ │ │ + st.total_done = m_torrent_file->total_size() - m_padding_bytes; │ │ │ │ + st.total_wanted_done = m_size_on_disk; │ │ │ │ + st.total_wanted = m_size_on_disk; │ │ │ │ + TORRENT_ASSERT(st.total_wanted <= st.total_done); │ │ │ │ + TORRENT_ASSERT(st.total_wanted_done <= st.total_wanted); │ │ │ │ + TORRENT_ASSERT(st.total_done <= m_torrent_file->total_size()); │ │ │ │ return; │ │ │ │ } │ │ │ │ + else if (!has_picker()) │ │ │ │ + { │ │ │ │ + st.total_done = 0; │ │ │ │ + st.total_wanted_done = 0; │ │ │ │ +
    relevance 3../src/torrent.cpp:4905should this alert have an error code in it?

    should this alert have an error code in it?

    ../src/torrent.cpp:4905

    		on_remove_peers();
    │ │ │ │ +		TORRENT_ASSERT(m_connections.empty());
    │ │ │ │  
    │ │ │ │ -		// add_web_seed won't add duplicates. If we have already added an entry
    │ │ │ │ -		// with this URL, we'll get back the existing entry
    │ │ │ │ +		// post a message to the main thread to destruct
    │ │ │ │ +		// the torrent object from there
    │ │ │ │ +		if (m_storage)
    │ │ │ │ +		{
    │ │ │ │ +			try {
    │ │ │ │ +				m_ses.disk_thread().async_stop_torrent(m_storage
    │ │ │ │ +					, std::bind(&torrent::on_torrent_aborted, shared_from_this()));
    │ │ │ │ +			}
    │ │ │ │ +			catch (std::exception const& e)
    │ │ │ │ +			{
    │ │ │ │ +				TORRENT_UNUSED(e);
    │ │ │ │ +				m_storage.reset();
    │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ +				debug_log("Failed to flush disk cache: %s", e.what());
    │ │ │ │ +#endif
    │ │ │ │ +				// clients may rely on this alert to be posted, so it's probably a
    │ │ │ │ +				// good idea to post it here, even though we failed
    │ │ │ │ +
    if (alerts().should_post<cache_flushed_alert>()) │ │ │ │ +
    alerts().emplace_alert<cache_flushed_alert>(get_handle()); │ │ │ │ + } │ │ │ │ + m_ses.deferred_submit_jobs(); │ │ │ │ + } │ │ │ │ + else │ │ │ │ + { │ │ │ │ + if (alerts().should_post<cache_flushed_alert>()) │ │ │ │ + alerts().emplace_alert<cache_flushed_alert>(get_handle()); │ │ │ │ + alerts().emplace_alert<torrent_removed_alert>(get_handle() │ │ │ │ + , info_hash(), get_userdata()); │ │ │ │ + } │ │ │ │ │ │ │ │ - // "ephemeral" flag should be set to avoid "web_seed_t" saving in resume data. │ │ │ │ - // E.g. original "web_seed_t" request url points to "http://example1.com/file1" and │ │ │ │ - // web server responses with redirect location "http://example2.com/subpath/file2". │ │ │ │ - // "handle_redirect" process this location to create new "web_seed_t" │ │ │ │ - // with base url=="http://example2.com/" and redirects[0]=="/subpath/file2"). │ │ │ │ - // If we try to load resume with such "web_seed_t" then "web_peer_connection" will send │ │ │ │ - // request with wrong path "http://example2.com/file1" (cause "redirects" map is not serialized in resume) │ │ │ │ - web_seed_t* web = t->add_web_seed(redirect_base, web_seed_entry::url_seed │ │ │ │ - , m_external_auth, m_extra_headers, web_seed_flags); │ │ │ │ - web->have_files.resize(t->torrent_file().num_files(), false); │ │ │ │ +
    relevance 3../src/torrent.cpp:4975this should return optional<>. piece index -1 should not be allowed

    this should return optional<>. piece index -1 should not be │ │ │ │ +allowed

    ../src/torrent.cpp:4975

    	}
    │ │ │ │  
    │ │ │ │ -		// the new web seed we're adding only has this file for now
    │ │ │ │ -		// we may add more files later
    │ │ │ │ -		web->redirects[file_index] = redirect_path;
    │ │ │ │ -		if (web->have_files.get_bit(file_index) == false)
    │ │ │ │ -		{
    │ │ │ │ -
    relevance 3../src/ut_metadata.cpp:268use the aux::write_* functions and the span here instead, it will fit better with send_buffer()

    use the aux::write_* functions and the span here instead, it │ │ │ │ -will fit better with send_buffer()

    ../src/ut_metadata.cpp:268

    			int metadata_piece_size = 0;
    │ │ │ │ +#ifndef TORRENT_DISABLE_SUPERSEEDING
    │ │ │ │ +	void torrent::set_super_seeding(bool const on)
    │ │ │ │ +	{
    │ │ │ │ +		if (on == m_super_seeding) return;
    │ │ │ │  
    │ │ │ │ -			if (m_torrent.valid_metadata())
    │ │ │ │ -				e["total_size"] = m_tp.metadata().size();
    │ │ │ │ +		m_super_seeding = on;
    │ │ │ │ +		set_need_save_resume(torrent_handle::if_state_changed);
    │ │ │ │ +		state_updated();
    │ │ │ │  
    │ │ │ │ -			if (type == msg_t::piece)
    │ │ │ │ -			{
    │ │ │ │ -				TORRENT_ASSERT(piece >= 0 && piece < (m_tp.metadata().size() + 16 * 1024 - 1) / (16 * 1024));
    │ │ │ │ -				TORRENT_ASSERT(m_pc.associated_torrent().lock()->valid_metadata());
    │ │ │ │ -				TORRENT_ASSERT(m_torrent.valid_metadata());
    │ │ │ │ +		if (m_super_seeding) return;
    │ │ │ │  
    │ │ │ │ -				int const offset = piece * 16 * 1024;
    │ │ │ │ -				metadata = m_tp.metadata().data() + offset;
    │ │ │ │ -				metadata_piece_size = std::min(
    │ │ │ │ -					int(m_tp.metadata().size()) - offset, 16 * 1024);
    │ │ │ │ -				TORRENT_ASSERT(metadata_piece_size > 0);
    │ │ │ │ -				TORRENT_ASSERT(offset >= 0);
    │ │ │ │ -				TORRENT_ASSERT(offset + metadata_piece_size <= m_tp.metadata().size());
    │ │ │ │ -			}
    │ │ │ │ +		// disable super seeding for all peers
    │ │ │ │ +		for (auto pc : *this)
    │ │ │ │ +		{
    │ │ │ │ +			pc->superseed_piece(piece_index_t(-1), piece_index_t(-1));
    │ │ │ │ +		}
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -
    char msg[200]; │ │ │ │ -
    char* header = msg; │ │ │ │ - char* p = &msg[6]; │ │ │ │ - int const len = bencode(p, e); │ │ │ │ - int const total_size = 2 + len + metadata_piece_size; │ │ │ │ - namespace io = aux; │ │ │ │ - io::write_uint32(total_size, header); │ │ │ │ - io::write_uint8(bt_peer_connection::msg_extended, header); │ │ │ │ - io::write_uint8(m_message_index, header); │ │ │ │ +
    piece_index_t torrent::get_piece_to_super_seed(typed_bitfield<piece_index_t> const& bits) │ │ │ │ +
    { │ │ │ │ + // return a piece with low availability that is not in │ │ │ │ + // the bitfield and that is not currently being super │ │ │ │ + // seeded by any peer │ │ │ │ + TORRENT_ASSERT(m_super_seeding); │ │ │ │ │ │ │ │ - m_pc.send_buffer({msg, len + 6}); │ │ │ │ + // do a linear search from the first piece │ │ │ │ + int min_availability = 9999; │ │ │ │ + std::vector<piece_index_t> avail_vec; │ │ │ │ + for (auto const i : m_torrent_file->piece_range()) │ │ │ │ + { │ │ │ │ + if (bits[i]) continue; │ │ │ │ + │ │ │ │ + int availability = 0; │ │ │ │ + for (auto pc : *this) │ │ │ │ + { │ │ │ │ + if (pc->super_seeded_piece(i)) │ │ │ │ + { │ │ │ │ + // avoid super-seeding the same piece to more than one │ │ │ │ + // peer if we can avoid it. Do this by artificially │ │ │ │ + // increase the availability │ │ │ │ + availability = 999; │ │ │ │ + break; │ │ │ │ + } │ │ │ │ + if (pc->has_piece(i)) ++availability; │ │ │ │ + } │ │ │ │ + if (availability > min_availability) continue; │ │ │ │ + if (availability == min_availability) │ │ │ │ + { │ │ │ │ + avail_vec.push_back(i); │ │ │ │
    relevance 3../src/session_impl.cpp:1142closing the udp sockets here means that the uTP connections cannot be closed gracefully

    closing the udp sockets here means that │ │ │ │ the uTP connections cannot be closed gracefully

    ../src/session_impl.cpp:1142

    #ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │  		session_log(" aborting all connections (%d)", int(m_connections.size()));
    │ │ │ │  #endif
    │ │ │ │  		// abort all connections
    │ │ │ │  		for (auto i = m_connections.begin(); i != m_connections.end();)
    │ │ │ │  		{
    │ │ │ │ @@ -1104,15 +1103,307 @@
    │ │ │ │  				alerts.emplace_alert<dht_put_alert>(pk.bytes, sig.bytes
    │ │ │ │  					, std::move(salt), seq.value, num);
    │ │ │ │  			}
    │ │ │ │  		}
    │ │ │ │  
    │ │ │ │  		void put_mutable_callback(dht::item& i
    │ │ │ │  			, std::function<void(entry&, std::array<char, 64>&
    │ │ │ │ -
    relevance 3../src/peer_connection.cpp:3133instead of having to ask the torrent whether it's in graceful pause mode or not, the peers should keep that state (and the torrent should update them when it enters graceful pause). When a peer enters graceful pause mode, it should cancel all outstanding requests and clear its request queue.

    instead of having to ask the torrent whether it's in graceful │ │ │ │ +relevance 3../src/web_peer_connection.cpp:199this should be an optional, piece index -1 should not be allowed

    this should be an optional, piece index -1 should │ │ │ │ +not be allowed

    ../src/web_peer_connection.cpp:199

    │ │ │ │ +			auto const range = aux::file_piece_range_inclusive(fs, i);
    │ │ │ │ +			for (piece_index_t k = std::get<0>(range); k < std::get<1>(range); ++k)
    │ │ │ │ +				have.clear_bit(k);
    │ │ │ │ +		}
    │ │ │ │ +		t->set_seed(peer_info_struct(), false);
    │ │ │ │ +		if (have.none_set())
    │ │ │ │ +		{
    │ │ │ │ +			incoming_have_none();
    │ │ │ │ +			m_web->interesting = false;
    │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ +			peer_log(peer_log_alert::info, "WEB-SEED", "have no pieces, not interesting. %s", m_url.c_str());
    │ │ │ │ +#endif
    │ │ │ │ +		}
    │ │ │ │ +		else
    │ │ │ │ +		{
    │ │ │ │ +			incoming_bitfield(have);
    │ │ │ │ +		}
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +
    if (m_web->restart_request.piece != piece_index_t(-1)) │ │ │ │ +
    { │ │ │ │ + // increase the chances of requesting the block │ │ │ │ + // we have partial data for already, to finish it │ │ │ │ + incoming_suggest(m_web->restart_request.piece); │ │ │ │ + } │ │ │ │ + web_connection_base::on_connected(); │ │ │ │ +} │ │ │ │ + │ │ │ │ +void web_peer_connection::disconnect(error_code const& ec │ │ │ │ + , operation_t op, disconnect_severity_t const error) │ │ │ │ +{ │ │ │ │ + if (is_disconnecting()) return; │ │ │ │ + │ │ │ │ + if (op == operation_t::sock_write && ec == boost::system::errc::broken_pipe) │ │ │ │ + { │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + // a write operation failed with broken-pipe. This typically happens │ │ │ │ + // with HTTP 1.0 servers that close their incoming channel of the TCP │ │ │ │ + // stream whenever they're done reading one full request. Instead of │ │ │ │ + // us bailing out and failing the entire request just because our │ │ │ │ + // write-end was closed, ignore it and keep reading until the read-end │ │ │ │ + // also is closed. │ │ │ │ + peer_log(peer_log_alert::info, "WRITE_DIRECTION", "CLOSED"); │ │ │ │ +#endif │ │ │ │ + │ │ │ │ + // prevent the peer from trying to send anything more │ │ │ │ + m_send_buffer.clear(); │ │ │ │ + │ │ │ │ + // when the web server closed our write-end of the socket (i.e. its │ │ │ │ + // read-end), if it's an HTTP 1.0 server. we will stop sending more │ │ │ │ +
    relevance 3../src/web_peer_connection.cpp:419do we really need a special case here? wouldn't the multi-file case handle single file torrents correctly too?

    do we really need a special case here? wouldn't the multi-file │ │ │ │ +case handle single file torrents correctly too?

    ../src/web_peer_connection.cpp:419

    		size -= pr.length;
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ +	peer_log(peer_log_alert::outgoing_message, "REQUESTING", "(piece: %d start: %d) - (piece: %d end: %d)"
    │ │ │ │ +		, static_cast<int>(r.piece), r.start
    │ │ │ │ +		, static_cast<int>(pr.piece), pr.start + pr.length);
    │ │ │ │ +#endif
    │ │ │ │ +
    │ │ │ │ +	bool const single_file_request = t->torrent_file().num_files() == 1;
    │ │ │ │ +	int const proxy_type = m_settings.get_int(settings_pack::proxy_type);
    │ │ │ │ +	bool const using_proxy = (proxy_type == settings_pack::http
    │ │ │ │ +		|| proxy_type == settings_pack::http_pw) && !m_ssl;
    │ │ │ │ +
    │ │ │ │ +	// the number of pad files that have been "requested". In case we _only_
    │ │ │ │ +	// request padfiles, we can't rely on handling them in the on_receive()
    │ │ │ │ +	// callback (because we won't receive anything), instead we have to post a
    │ │ │ │ +	// pretend read callback where we can deliver the zeroes for the partfile
    │ │ │ │ +	int num_pad_files = 0;
    │ │ │ │ +
    │ │ │ │ +
    if (single_file_request) │ │ │ │ +
    { │ │ │ │ + file_request_t file_req; │ │ │ │ + file_req.file_index = file_index_t(0); │ │ │ │ + file_req.start = std::int64_t(static_cast<int>(req.piece)) * info.piece_length() │ │ │ │ + + req.start; │ │ │ │ + file_req.length = req.length; │ │ │ │ + │ │ │ │ + request += "GET "; │ │ │ │ + // do not encode single file paths, they are │ │ │ │ + // assumed to be encoded in the torrent file │ │ │ │ + request += using_proxy ? m_url : m_path; │ │ │ │ + request += " HTTP/1.1\r\n"; │ │ │ │ + add_headers(request, m_settings, using_proxy); │ │ │ │ + request += "\r\nRange: bytes="; │ │ │ │ + request += to_string(file_req.start).data(); │ │ │ │ + request += "-"; │ │ │ │ + request += to_string(file_req.start + file_req.length - 1).data(); │ │ │ │ + request += "\r\n\r\n"; │ │ │ │ + m_first_request = false; │ │ │ │ + │ │ │ │ + m_file_requests.push_back(file_req); │ │ │ │ + } │ │ │ │ + else │ │ │ │ + { │ │ │ │ + std::vector<file_slice> files = info.orig_files().map_block(req.piece, req.start │ │ │ │ + , req.length); │ │ │ │ + │ │ │ │ + for (auto const &f : files) │ │ │ │ + { │ │ │ │ + file_request_t file_req; │ │ │ │ +
    relevance 3../src/web_peer_connection.cpp:504file_index_t should not allow negative values

    file_index_t should not allow negative values

    ../src/web_peer_connection.cpp:504

    					// with the correct slashes. Don't encode it again
    │ │ │ │ +					request += m_path;
    │ │ │ │ +				}
    │ │ │ │ +
    │ │ │ │ +				request += escape_file_path(info.orig_files(), f.file_index);
    │ │ │ │ +			}
    │ │ │ │ +			request += " HTTP/1.1\r\n";
    │ │ │ │ +			add_headers(request, m_settings, using_proxy);
    │ │ │ │ +			request += "\r\nRange: bytes=";
    │ │ │ │ +			request += to_string(f.offset).data();
    │ │ │ │ +			request += "-";
    │ │ │ │ +			request += to_string(f.offset + f.size - 1).data();
    │ │ │ │ +			request += "\r\n\r\n";
    │ │ │ │ +			m_first_request = false;
    │ │ │ │ +
    │ │ │ │ +#if 0
    │ │ │ │ +			std::cerr << this << " SEND-REQUEST: f: " << f.file_index
    │ │ │ │ +				<< " s: " << f.offset
    │ │ │ │ +				<< " e: " << (f.offset + f.size - 1) << std::endl;
    │ │ │ │ +#endif
    │ │ │ │ +
    TORRENT_ASSERT(f.file_index >= file_index_t(0)); │ │ │ │ +
    │ │ │ │ + m_file_requests.push_back(file_req); │ │ │ │ + } │ │ │ │ + } │ │ │ │ + │ │ │ │ + if (num_pad_files == int(m_file_requests.size())) │ │ │ │ + { │ │ │ │ + post(get_context(), std::bind( │ │ │ │ + &web_peer_connection::on_receive_padfile, │ │ │ │ + std::static_pointer_cast<web_peer_connection>(self()))); │ │ │ │ + return; │ │ │ │ + } │ │ │ │ + │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + peer_log(peer_log_alert::outgoing_message, "REQUEST", "%s", request.c_str()); │ │ │ │ +#endif │ │ │ │ + │ │ │ │ + send_buffer(request); │ │ │ │ +} │ │ │ │ + │ │ │ │ +namespace { │ │ │ │ + │ │ │ │ + std::string get_peer_name(http_parser const& p, std::string const& host) │ │ │ │ + { │ │ │ │ + std::string const& server_version = p.header("server"); │ │ │ │ + if (!server_version.empty()) │ │ │ │ + return server_version; │ │ │ │ + return host; │ │ │ │ + } │ │ │ │ + │ │ │ │ +
    relevance 3../src/web_peer_connection.cpp:695this could be made more efficient for the case when we use an HTTP proxy. Then we wouldn't need to add new web seeds to the torrent, we could just make the redirect table contain full URLs.

    this could be made more efficient for the case when we use an │ │ │ │ +HTTP proxy. Then we wouldn't need to add new web seeds to the torrent, │ │ │ │ +we could just make the redirect table contain full URLs.

    ../src/web_peer_connection.cpp:695

    	bool const single_file_request = !m_path.empty()
    │ │ │ │ +		&& m_path[m_path.size() - 1] != '/';
    │ │ │ │ +
    │ │ │ │ +	// when SSRF mitigation is enabled, a web seed on the internet (is_global())
    │ │ │ │ +	// is not allowed to redirect to a server on the local network, so we set
    │ │ │ │ +	// the no_local_ips flag
    │ │ │ │ +	auto const web_seed_flags = torrent::ephemeral
    │ │ │ │ +		| ((m_settings.get_bool(settings_pack::ssrf_mitigation) && aux::is_global(remote().address()))
    │ │ │ │ +			? torrent::no_local_ips : web_seed_flag_t{});
    │ │ │ │ +
    │ │ │ │ +	// add the redirected url and remove the current one
    │ │ │ │ +	if (!single_file_request)
    │ │ │ │ +	{
    │ │ │ │ +		TORRENT_ASSERT(!m_file_requests.empty());
    │ │ │ │ +		file_index_t const file_index = m_file_requests.front().file_index;
    │ │ │ │ +
    │ │ │ │ +		location = resolve_redirect_location(m_url, location);
    │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ +		peer_log(peer_log_alert::info, "LOCATION", "%s", location.c_str());
    │ │ │ │ +#endif
    │ │ │ │ +
    std::string redirect_base; │ │ │ │ +
    std::string redirect_path; │ │ │ │ + error_code ec; │ │ │ │ + std::tie(redirect_base, redirect_path) = split_url(location, ec); │ │ │ │ + │ │ │ │ + if (ec) │ │ │ │ + { │ │ │ │ + // we should not try this server again. │ │ │ │ + disconnect(errors::missing_location, operation_t::bittorrent, failure); │ │ │ │ + return; │ │ │ │ + } │ │ │ │ + │ │ │ │ + // add_web_seed won't add duplicates. If we have already added an entry │ │ │ │ + // with this URL, we'll get back the existing entry │ │ │ │ + │ │ │ │ + // "ephemeral" flag should be set to avoid "web_seed_t" saving in resume data. │ │ │ │ + // E.g. original "web_seed_t" request url points to "http://example1.com/file1" and │ │ │ │ + // web server responses with redirect location "http://example2.com/subpath/file2". │ │ │ │ + // "handle_redirect" process this location to create new "web_seed_t" │ │ │ │ + // with base url=="http://example2.com/" and redirects[0]=="/subpath/file2"). │ │ │ │ + // If we try to load resume with such "web_seed_t" then "web_peer_connection" will send │ │ │ │ + // request with wrong path "http://example2.com/file1" (cause "redirects" map is not serialized in resume) │ │ │ │ + web_seed_t* web = t->add_web_seed(redirect_base, web_seed_entry::url_seed │ │ │ │ + , m_external_auth, m_extra_headers, web_seed_flags); │ │ │ │ + web->have_files.resize(t->torrent_file().num_files(), false); │ │ │ │ + │ │ │ │ + // the new web seed we're adding only has this file for now │ │ │ │ + // we may add more files later │ │ │ │ + web->redirects[file_index] = redirect_path; │ │ │ │ + if (web->have_files.get_bit(file_index) == false) │ │ │ │ + { │ │ │ │ +
    relevance 3../src/ut_metadata.cpp:268use the aux::write_* functions and the span here instead, it will fit better with send_buffer()

    use the aux::write_* functions and the span here instead, it │ │ │ │ +will fit better with send_buffer()

    ../src/ut_metadata.cpp:268

    			int metadata_piece_size = 0;
    │ │ │ │ +
    │ │ │ │ +			if (m_torrent.valid_metadata())
    │ │ │ │ +				e["total_size"] = m_tp.metadata().size();
    │ │ │ │ +
    │ │ │ │ +			if (type == msg_t::piece)
    │ │ │ │ +			{
    │ │ │ │ +				TORRENT_ASSERT(piece >= 0 && piece < (m_tp.metadata().size() + 16 * 1024 - 1) / (16 * 1024));
    │ │ │ │ +				TORRENT_ASSERT(m_pc.associated_torrent().lock()->valid_metadata());
    │ │ │ │ +				TORRENT_ASSERT(m_torrent.valid_metadata());
    │ │ │ │ +
    │ │ │ │ +				int const offset = piece * 16 * 1024;
    │ │ │ │ +				metadata = m_tp.metadata().data() + offset;
    │ │ │ │ +				metadata_piece_size = std::min(
    │ │ │ │ +					int(m_tp.metadata().size()) - offset, 16 * 1024);
    │ │ │ │ +				TORRENT_ASSERT(metadata_piece_size > 0);
    │ │ │ │ +				TORRENT_ASSERT(offset >= 0);
    │ │ │ │ +				TORRENT_ASSERT(offset + metadata_piece_size <= m_tp.metadata().size());
    │ │ │ │ +			}
    │ │ │ │ +
    │ │ │ │ +
    char msg[200]; │ │ │ │ +
    char* header = msg; │ │ │ │ + char* p = &msg[6]; │ │ │ │ + int const len = bencode(p, e); │ │ │ │ + int const total_size = 2 + len + metadata_piece_size; │ │ │ │ + namespace io = aux; │ │ │ │ + io::write_uint32(total_size, header); │ │ │ │ + io::write_uint8(bt_peer_connection::msg_extended, header); │ │ │ │ + io::write_uint8(m_message_index, header); │ │ │ │ + │ │ │ │ + m_pc.send_buffer({msg, len + 6}); │ │ │ │ +
    relevance 3../src/session_handle.cpp:691expose the sequence_number, public_key, secret_key and signature types to the client

    expose the sequence_number, public_key, secret_key and signature │ │ │ │ +types to the client

    ../src/session_handle.cpp:691

    	void session_handle::dht_get_item(sha1_hash const& target)
    │ │ │ │ +	{
    │ │ │ │ +#ifndef TORRENT_DISABLE_DHT
    │ │ │ │ +		async_call(&session_impl::dht_get_immutable_item, target);
    │ │ │ │ +#else
    │ │ │ │ +		TORRENT_UNUSED(target);
    │ │ │ │ +#endif
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +	void session_handle::dht_get_item(std::array<char, 32> key
    │ │ │ │ +		, std::string salt)
    │ │ │ │ +	{
    │ │ │ │ +#ifndef TORRENT_DISABLE_DHT
    │ │ │ │ +		async_call(&session_impl::dht_get_mutable_item, key, salt);
    │ │ │ │ +#else
    │ │ │ │ +		TORRENT_UNUSED(key);
    │ │ │ │ +		TORRENT_UNUSED(salt);
    │ │ │ │ +#endif
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +
    sha1_hash session_handle::dht_put_item(entry data) │ │ │ │ +
    { │ │ │ │ + std::vector<char> buf; │ │ │ │ + bencode(std::back_inserter(buf), data); │ │ │ │ + sha1_hash const ret = hasher(buf).final(); │ │ │ │ + │ │ │ │ +#ifndef TORRENT_DISABLE_DHT │ │ │ │ + async_call(&session_impl::dht_put_immutable_item, data, ret); │ │ │ │ +#endif │ │ │ │ + return ret; │ │ │ │ + } │ │ │ │ + │ │ │ │ + void session_handle::dht_put_item(std::array<char, 32> key │ │ │ │ + , std::function<void(entry&, std::array<char,64>& │ │ │ │ + , std::int64_t&, std::string const&)> cb │ │ │ │ + , std::string salt) │ │ │ │ + { │ │ │ │ +#ifndef TORRENT_DISABLE_DHT │ │ │ │ + async_call(&session_impl::dht_put_mutable_item, key, cb, salt); │ │ │ │ +#else │ │ │ │ + TORRENT_UNUSED(key); │ │ │ │ + TORRENT_UNUSED(cb); │ │ │ │ + TORRENT_UNUSED(salt); │ │ │ │ +#endif │ │ │ │ + } │ │ │ │ + │ │ │ │ + void session_handle::dht_get_peers(sha1_hash const& info_hash) │ │ │ │ + { │ │ │ │ +#ifndef TORRENT_DISABLE_DHT │ │ │ │ + async_call(&session_impl::dht_get_peers, info_hash); │ │ │ │ +#else │ │ │ │ +
    relevance 3../src/peer_connection.cpp:3133instead of having to ask the torrent whether it's in graceful pause mode or not, the peers should keep that state (and the torrent should update them when it enters graceful pause). When a peer enters graceful pause mode, it should cancel all outstanding requests and clear its request queue.

    instead of having to ask the torrent whether it's in graceful │ │ │ │ pause mode or not, the peers should keep that state (and the torrent │ │ │ │ should update them when it enters graceful pause). When a peer enters │ │ │ │ graceful pause mode, it should cancel all outstanding requests and │ │ │ │ clear its request queue.

    ../src/peer_connection.cpp:3133

    		// to disk or are in the disk write cache
    │ │ │ │  		if (picker.is_piece_finished(p.piece) && !was_finished)
    │ │ │ │  		{
    │ │ │ │  #if TORRENT_USE_INVARIANT_CHECKS
    │ │ │ │ @@ -1159,15 +1450,15 @@
    │ │ │ │  		m_outstanding_writing_bytes -= p.length;
    │ │ │ │  
    │ │ │ │  		TORRENT_ASSERT(m_outstanding_writing_bytes >= 0);
    │ │ │ │  
    │ │ │ │  		// every peer is entitled to allocate a disk buffer if it has no writes outstanding
    │ │ │ │  		// see the comment in incoming_piece
    │ │ │ │  		if (m_outstanding_writing_bytes == 0
    │ │ │ │ -
    relevance 3../src/peer_connection.cpp:4044once peers are properly put in graceful pause mode, they can cancel all outstanding requests and this test can be removed.

    once peers are properly put in graceful pause mode, they can │ │ │ │ +relevance 3../src/peer_connection.cpp:4044once peers are properly put in graceful pause mode, they can cancel all outstanding requests and this test can be removed.

    once peers are properly put in graceful pause mode, they can │ │ │ │ cancel all outstanding requests and this test can be removed.

    ../src/peer_connection.cpp:4044

    │ │ │ │  			if (!p->m_deferred_send_block_requests)
    │ │ │ │  				return;
    │ │ │ │  
    │ │ │ │  			p->m_deferred_send_block_requests = false;
    │ │ │ │  			p->send_block_requests_impl();
    │ │ │ │  		});
    │ │ │ │ @@ -1211,15 +1502,15 @@
    │ │ │ │  			// out of sync with it
    │ │ │ │  			if (!t->has_picker()) continue;
    │ │ │ │  
    │ │ │ │  			// this can happen if a block times out, is re-requested and
    │ │ │ │  			// then arrives "unexpectedly"
    │ │ │ │  			if (t->picker().is_downloaded(block.block))
    │ │ │ │  			{
    │ │ │ │ -
    relevance 3../src/peer_connection.cpp:4730new_piece should be an optional. piece index -1 should not be allowed

    new_piece should be an optional. piece index -1 │ │ │ │ +relevance 3../src/peer_connection.cpp:4730new_piece should be an optional. piece index -1 should not be allowed

    new_piece should be an optional. piece index -1 │ │ │ │ should not be allowed

    ../src/peer_connection.cpp:4730

    │ │ │ │  		// pieces may be empty if we don't have metadata yet
    │ │ │ │  		if (p.pieces.empty())
    │ │ │ │  		{
    │ │ │ │  			p.progress = 0.f;
    │ │ │ │  			p.progress_ppm = 0;
    │ │ │ │  		}
    │ │ │ │ @@ -1263,305 +1554,14 @@
    │ │ │ │  
    │ │ │ │  			return;
    │ │ │ │  		}
    │ │ │ │  
    │ │ │ │  		TORRENT_ASSERT(!has_piece(new_piece));
    │ │ │ │  
    │ │ │ │  #ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -
    relevance 3../src/torrent.cpp:419we could probably get away with just saving a few fields here

    we could probably get away with just saving a few fields here

    ../src/torrent.cpp:419

    		// --- V2 HASHES ---
    │ │ │ │ -
    │ │ │ │ -		if (m_torrent_file->is_valid() && m_torrent_file->info_hashes().has_v2())
    │ │ │ │ -		{
    │ │ │ │ -			if (!p.merkle_trees.empty())
    │ │ │ │ -				load_merkle_trees(
    │ │ │ │ -					std::move(p.merkle_trees)
    │ │ │ │ -					, std::move(p.merkle_tree_mask)
    │ │ │ │ -					, std::move(p.verified_leaf_hashes));
    │ │ │ │ -
    │ │ │ │ -			// we really don't want to store extra copies of the trees
    │ │ │ │ -			TORRENT_ASSERT(p.merkle_trees.empty());
    │ │ │ │ -		}
    │ │ │ │ -
    │ │ │ │ -		if (valid_metadata())
    │ │ │ │ -		{
    │ │ │ │ -			inc_stats_counter(counters::num_total_pieces_added
    │ │ │ │ -				, m_torrent_file->num_pieces());
    │ │ │ │ -		}
    │ │ │ │ -
    │ │ │ │ -
    m_add_torrent_params = std::make_unique<add_torrent_params>(std::move(p)); │ │ │ │ -
    } │ │ │ │ - │ │ │ │ - void torrent::load_merkle_trees( │ │ │ │ - aux::vector<std::vector<sha256_hash>, file_index_t> trees_import │ │ │ │ - , aux::vector<std::vector<bool>, file_index_t> mask │ │ │ │ - , aux::vector<std::vector<bool>, file_index_t> verified) │ │ │ │ - { │ │ │ │ - auto const& fs = m_torrent_file->orig_files(); │ │ │ │ - │ │ │ │ - std::vector<bool> const empty_verified; │ │ │ │ - for (file_index_t i{0}; i < fs.end_file(); ++i) │ │ │ │ - { │ │ │ │ - if (fs.pad_file_at(i) || fs.file_size(i) == 0) │ │ │ │ - continue; │ │ │ │ - │ │ │ │ - if (i >= trees_import.end_index()) break; │ │ │ │ - std::vector<bool> const& verified_bitmask = (i >= verified.end_index()) ? empty_verified : verified[i]; │ │ │ │ - if (i < mask.end_index() && !mask[i].empty()) │ │ │ │ - { │ │ │ │ - mask[i].resize(m_merkle_trees[i].size(), false); │ │ │ │ - m_merkle_trees[i].load_sparse_tree(trees_import[i], mask[i], verified_bitmask); │ │ │ │ - } │ │ │ │ - else │ │ │ │ - { │ │ │ │ - m_merkle_trees[i].load_tree(trees_import[i], verified_bitmask); │ │ │ │ - } │ │ │ │ - } │ │ │ │ - } │ │ │ │ - │ │ │ │ - void torrent::inc_stats_counter(int c, int value) │ │ │ │ -
    relevance 3../src/torrent.cpp:715assert there are no outstanding async operations on this torrent

    assert there are no outstanding async operations on this │ │ │ │ -torrent

    ../src/torrent.cpp:715

    #endif
    │ │ │ │ -
    │ │ │ │ -		if (!m_ses.dht()) return false;
    │ │ │ │ -		if (m_torrent_file->is_valid() && !m_files_checked) return false;
    │ │ │ │ -		if (!m_announce_to_dht) return false;
    │ │ │ │ -		if (m_paused) return false;
    │ │ │ │ -
    │ │ │ │ -		// don't announce private torrents
    │ │ │ │ -		if (m_torrent_file->is_valid() && m_torrent_file->priv()) return false;
    │ │ │ │ -		if (m_trackers.empty()) return true;
    │ │ │ │ -		if (!settings().get_bool(settings_pack::use_dht_as_fallback)) return true;
    │ │ │ │ -
    │ │ │ │ -		return std::none_of(m_trackers.begin(), m_trackers.end()
    │ │ │ │ -			, [](aux::announce_entry const& tr) { return bool(tr.verified); });
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -#endif
    │ │ │ │ -
    │ │ │ │ -	torrent::~torrent()
    │ │ │ │ -	{
    │ │ │ │ -
    │ │ │ │ -
    #if TORRENT_USE_ASSERTS │ │ │ │ - for (torrent_list_index_t i{}; i != m_links.end_index(); ++i) │ │ │ │ - { │ │ │ │ - if (!m_links[i].in_list()) continue; │ │ │ │ - m_links[i].unlink(m_ses.torrent_list(i), i); │ │ │ │ - } │ │ │ │ -#endif │ │ │ │ - │ │ │ │ - // The invariant can't be maintained here, since the torrent │ │ │ │ - // is being destructed, all weak references to it have been │ │ │ │ - // reset, which means that all its peers already have an │ │ │ │ - // invalidated torrent pointer (so it cannot be verified to be correct) │ │ │ │ - │ │ │ │ - // i.e. the invariant can only be maintained if all connections have │ │ │ │ - // been closed by the time the torrent is destructed. And they are │ │ │ │ - // supposed to be closed. So we can still do the invariant check. │ │ │ │ - │ │ │ │ - // however, the torrent object may be destructed from the main │ │ │ │ - // thread when shutting down, if the disk cache has references to it. │ │ │ │ - // this means that the invariant check that this is called from the │ │ │ │ - // network thread cannot be maintained │ │ │ │ - │ │ │ │ - TORRENT_ASSERT(m_peer_class == peer_class_t{0}); │ │ │ │ - TORRENT_ASSERT(m_connections.empty()); │ │ │ │ - // just in case, make sure the session accounting is kept right │ │ │ │ - for (auto p : m_connections) │ │ │ │ - m_ses.close_connection(p); │ │ │ │ - } │ │ │ │ - │ │ │ │ - void torrent::read_piece(piece_index_t const piece) │ │ │ │ -
    relevance 3../src/torrent.cpp:1331there's some duplication between this function and peer_connection::incoming_piece(). is there a way to merge something?

    there's some duplication between this function and │ │ │ │ -peer_connection::incoming_piece(). is there a way to merge something?

    ../src/torrent.cpp:1331

    		piece_index_t m_piece;
    │ │ │ │ -		bool m_armed = true;
    │ │ │ │ -	};
    │ │ │ │ -
    │ │ │ │ -	void torrent::add_piece_async(piece_index_t const piece
    │ │ │ │ -		, std::vector<char> data, add_piece_flags_t const flags)
    │ │ │ │ -	{
    │ │ │ │ -		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ -
    │ │ │ │ -		// make sure the piece index is correct
    │ │ │ │ -		if (piece >= torrent_file().end_piece())
    │ │ │ │ -			return;
    │ │ │ │ -
    │ │ │ │ -		// make sure the piece size is correct
    │ │ │ │ -		if (data.size() != std::size_t(m_torrent_file->piece_size(piece)))
    │ │ │ │ -			return;
    │ │ │ │ -
    │ │ │ │ -		add_piece(piece, data.data(), flags);
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -
    void torrent::add_piece(piece_index_t const piece, char const* data │ │ │ │ -
    , add_piece_flags_t const flags) │ │ │ │ - { │ │ │ │ - TORRENT_ASSERT(is_single_thread()); │ │ │ │ - │ │ │ │ - // make sure the piece index is correct │ │ │ │ - if (piece >= torrent_file().end_piece()) │ │ │ │ - return; │ │ │ │ - │ │ │ │ - int const piece_size = m_torrent_file->piece_size(piece); │ │ │ │ - int const blocks_in_piece = (piece_size + block_size() - 1) / block_size(); │ │ │ │ - │ │ │ │ - if (m_deleted) return; │ │ │ │ - │ │ │ │ - // avoid crash trying to access the picker when there is none │ │ │ │ - if (m_have_all && !has_picker()) return; │ │ │ │ - │ │ │ │ - // we don't support clobbering the piece picker while checking the │ │ │ │ - // files. We may end up having the same piece multiple times │ │ │ │ - TORRENT_ASSERT_PRECOND(state() != torrent_status::checking_files │ │ │ │ - && state() != torrent_status::checking_resume_data); │ │ │ │ - if (state() == torrent_status::checking_files │ │ │ │ - || state() == torrent_status::checking_resume_data) │ │ │ │ - return; │ │ │ │ - │ │ │ │ - need_picker(); │ │ │ │ - │ │ │ │ - if (picker().have_piece(piece) │ │ │ │ - && !(flags & torrent_handle::overwrite_existing)) │ │ │ │ - return; │ │ │ │ - │ │ │ │ -
    relevance 3../src/torrent.cpp:3966this could probably be pulled out into a free function

    this could probably be pulled out into a free function

    ../src/torrent.cpp:3966

    	std::int64_t calc_bytes(file_storage const& fs, piece_count const& pc)
    │ │ │ │ -	{
    │ │ │ │ -		// it's an impossible combination to have 0 pieces, but still have one of them be the last piece
    │ │ │ │ -		TORRENT_ASSERT(!(pc.num_pieces == 0 && pc.last_piece == true));
    │ │ │ │ -
    │ │ │ │ -		// if we have 0 pieces, we can't have any pad blocks either
    │ │ │ │ -		TORRENT_ASSERT(!(pc.num_pieces == 0 && pc.pad_bytes > 0));
    │ │ │ │ -
    │ │ │ │ -		// if we have all pieces, we must also have the last one
    │ │ │ │ -		TORRENT_ASSERT(!(pc.num_pieces == fs.num_pieces() && pc.last_piece == false));
    │ │ │ │ -
    │ │ │ │ -		// every block should not be a pad block
    │ │ │ │ -		TORRENT_ASSERT(pc.pad_bytes <= std::int64_t(pc.num_pieces) * fs.piece_length());
    │ │ │ │ -
    │ │ │ │ -		return std::int64_t(pc.num_pieces) * fs.piece_length()
    │ │ │ │ -			- (pc.last_piece ? fs.piece_length() - fs.piece_size(fs.last_piece()) : 0)
    │ │ │ │ -			- std::int64_t(pc.pad_bytes);
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -	// fills in total_wanted, total_wanted_done and total_done
    │ │ │ │ -
    void torrent::bytes_done(torrent_status& st, status_flags_t const flags) const │ │ │ │ -
    { │ │ │ │ - INVARIANT_CHECK; │ │ │ │ - │ │ │ │ - st.total_done = 0; │ │ │ │ - st.total_wanted_done = 0; │ │ │ │ - st.total_wanted = m_size_on_disk; │ │ │ │ - │ │ │ │ - TORRENT_ASSERT(st.total_wanted <= m_torrent_file->total_size()); │ │ │ │ - TORRENT_ASSERT(st.total_wanted >= 0); │ │ │ │ - │ │ │ │ - TORRENT_ASSERT(!valid_metadata() || m_torrent_file->num_pieces() > 0); │ │ │ │ - if (!valid_metadata()) return; │ │ │ │ - │ │ │ │ - if (m_seed_mode || is_seed()) │ │ │ │ - { │ │ │ │ - // once we're a seed and remove the piece picker, we stop tracking │ │ │ │ - // piece- and file priority. We consider everything as being │ │ │ │ - // "wanted" │ │ │ │ - st.total_done = m_torrent_file->total_size() - m_padding_bytes; │ │ │ │ - st.total_wanted_done = m_size_on_disk; │ │ │ │ - st.total_wanted = m_size_on_disk; │ │ │ │ - TORRENT_ASSERT(st.total_wanted <= st.total_done); │ │ │ │ - TORRENT_ASSERT(st.total_wanted_done <= st.total_wanted); │ │ │ │ - TORRENT_ASSERT(st.total_done <= m_torrent_file->total_size()); │ │ │ │ - return; │ │ │ │ - } │ │ │ │ - else if (!has_picker()) │ │ │ │ - { │ │ │ │ - st.total_done = 0; │ │ │ │ - st.total_wanted_done = 0; │ │ │ │ -
    relevance 3../src/torrent.cpp:4905should this alert have an error code in it?

    should this alert have an error code in it?

    ../src/torrent.cpp:4905

    		on_remove_peers();
    │ │ │ │ -		TORRENT_ASSERT(m_connections.empty());
    │ │ │ │ -
    │ │ │ │ -		// post a message to the main thread to destruct
    │ │ │ │ -		// the torrent object from there
    │ │ │ │ -		if (m_storage)
    │ │ │ │ -		{
    │ │ │ │ -			try {
    │ │ │ │ -				m_ses.disk_thread().async_stop_torrent(m_storage
    │ │ │ │ -					, std::bind(&torrent::on_torrent_aborted, shared_from_this()));
    │ │ │ │ -			}
    │ │ │ │ -			catch (std::exception const& e)
    │ │ │ │ -			{
    │ │ │ │ -				TORRENT_UNUSED(e);
    │ │ │ │ -				m_storage.reset();
    │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -				debug_log("Failed to flush disk cache: %s", e.what());
    │ │ │ │ -#endif
    │ │ │ │ -				// clients may rely on this alert to be posted, so it's probably a
    │ │ │ │ -				// good idea to post it here, even though we failed
    │ │ │ │ -
    if (alerts().should_post<cache_flushed_alert>()) │ │ │ │ -
    alerts().emplace_alert<cache_flushed_alert>(get_handle()); │ │ │ │ - } │ │ │ │ - m_ses.deferred_submit_jobs(); │ │ │ │ - } │ │ │ │ - else │ │ │ │ - { │ │ │ │ - if (alerts().should_post<cache_flushed_alert>()) │ │ │ │ - alerts().emplace_alert<cache_flushed_alert>(get_handle()); │ │ │ │ - alerts().emplace_alert<torrent_removed_alert>(get_handle() │ │ │ │ - , info_hash(), get_userdata()); │ │ │ │ - } │ │ │ │ - │ │ │ │ -
    relevance 3../src/torrent.cpp:4975this should return optional<>. piece index -1 should not be allowed

    this should return optional<>. piece index -1 should not be │ │ │ │ -allowed

    ../src/torrent.cpp:4975

    	}
    │ │ │ │ -
    │ │ │ │ -#ifndef TORRENT_DISABLE_SUPERSEEDING
    │ │ │ │ -	void torrent::set_super_seeding(bool const on)
    │ │ │ │ -	{
    │ │ │ │ -		if (on == m_super_seeding) return;
    │ │ │ │ -
    │ │ │ │ -		m_super_seeding = on;
    │ │ │ │ -		set_need_save_resume(torrent_handle::if_state_changed);
    │ │ │ │ -		state_updated();
    │ │ │ │ -
    │ │ │ │ -		if (m_super_seeding) return;
    │ │ │ │ -
    │ │ │ │ -		// disable super seeding for all peers
    │ │ │ │ -		for (auto pc : *this)
    │ │ │ │ -		{
    │ │ │ │ -			pc->superseed_piece(piece_index_t(-1), piece_index_t(-1));
    │ │ │ │ -		}
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -
    piece_index_t torrent::get_piece_to_super_seed(typed_bitfield<piece_index_t> const& bits) │ │ │ │ -
    { │ │ │ │ - // return a piece with low availability that is not in │ │ │ │ - // the bitfield and that is not currently being super │ │ │ │ - // seeded by any peer │ │ │ │ - TORRENT_ASSERT(m_super_seeding); │ │ │ │ - │ │ │ │ - // do a linear search from the first piece │ │ │ │ - int min_availability = 9999; │ │ │ │ - std::vector<piece_index_t> avail_vec; │ │ │ │ - for (auto const i : m_torrent_file->piece_range()) │ │ │ │ - { │ │ │ │ - if (bits[i]) continue; │ │ │ │ - │ │ │ │ - int availability = 0; │ │ │ │ - for (auto pc : *this) │ │ │ │ - { │ │ │ │ - if (pc->super_seeded_piece(i)) │ │ │ │ - { │ │ │ │ - // avoid super-seeding the same piece to more than one │ │ │ │ - // peer if we can avoid it. Do this by artificially │ │ │ │ - // increase the availability │ │ │ │ - availability = 999; │ │ │ │ - break; │ │ │ │ - } │ │ │ │ - if (pc->has_piece(i)) ++availability; │ │ │ │ - } │ │ │ │ - if (availability > min_availability) continue; │ │ │ │ - if (availability == min_availability) │ │ │ │ - { │ │ │ │ - avail_vec.push_back(i); │ │ │ │
    relevance 3../src/kademlia/rpc_manager.cpp:71move this into it's own .cpp file

    move this into it's own .cpp file

    ../src/kademlia/rpc_manager.cpp:71

    #include <libtorrent/kademlia/get_item.hpp>
    │ │ │ │  #include <libtorrent/kademlia/sample_infohashes.hpp>
    │ │ │ │  #include <libtorrent/aux_/session_settings.hpp>
    │ │ │ │  
    │ │ │ │  #include <libtorrent/socket_io.hpp> // for print_endpoint
    │ │ │ │  #include <libtorrent/aux_/time.hpp> // for aux::time_now
    │ │ │ │  #include <libtorrent/aux_/aligned_union.hpp>
    │ │ │ │ @@ -1605,118 +1605,15 @@
    │ │ │ │  	}
    │ │ │ │  	else
    │ │ │ │  	{
    │ │ │ │  		flags &= ~flag_ipv6_address;
    │ │ │ │  		m_addr.v4 = ep.address().to_v4().to_bytes();
    │ │ │ │  	}
    │ │ │ │  }
    │ │ │ │ -
    relevance 3../include/libtorrent/torrent_handle.hpp:535unify url_seed and http_seed with just web_seed, using the web_seed_entry.

    unify url_seed and http_seed with just web_seed, using the │ │ │ │ -web_seed_entry.

    ../include/libtorrent/torrent_handle.hpp:535

    		// one returned from ``trackers()`` and will replace it. If you want an
    │ │ │ │ -		// immediate effect, you have to call force_reannounce(). See
    │ │ │ │ -		// announce_entry.
    │ │ │ │ -		//
    │ │ │ │ -		// ``post_trackers()`` is the asynchronous version of ``trackers()``. It
    │ │ │ │ -		// will trigger a tracker_list_alert to be posted.
    │ │ │ │ -		//
    │ │ │ │ -		// ``add_tracker()`` will look if the specified tracker is already in the
    │ │ │ │ -		// set. If it is, it doesn't do anything. If it's not in the current set
    │ │ │ │ -		// of trackers, it will insert it in the tier specified in the
    │ │ │ │ -		// announce_entry.
    │ │ │ │ -		//
    │ │ │ │ -		// The updated set of trackers will be saved in the resume data, and when
    │ │ │ │ -		// a torrent is started with resume data, the trackers from the resume
    │ │ │ │ -		// data will replace the original ones.
    │ │ │ │ -		std::vector<announce_entry> trackers() const;
    │ │ │ │ -		void replace_trackers(std::vector<announce_entry> const&) const;
    │ │ │ │ -		void add_tracker(announce_entry const&) const;
    │ │ │ │ -		void post_trackers() 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 add_url_seed(std::string const& url) const; │ │ │ │ - void remove_url_seed(std::string const& url) const; │ │ │ │ - std::set<std::string> url_seeds() const; │ │ │ │ - │ │ │ │ - // These functions are identical as the ``*_url_seed()`` variants, but │ │ │ │ - // they operate on `BEP 17`_ web seeds instead of `BEP 19`_. │ │ │ │ - // │ │ │ │ - // See http-seeding_ for more information. │ │ │ │ - void add_http_seed(std::string const& url) const; │ │ │ │ - void remove_http_seed(std::string const& url) const; │ │ │ │ - std::set<std::string> http_seeds() const; │ │ │ │ - │ │ │ │ - // add the specified extension to this torrent. The ``ext`` argument is │ │ │ │ - // a function that will be called from within libtorrent's context │ │ │ │ - // passing in the internal torrent object and the specified userdata │ │ │ │ - // pointer. The function is expected to return a shared pointer to │ │ │ │ - // a torrent_plugin instance. │ │ │ │ - void add_extension( │ │ │ │ - std::function<std::shared_ptr<torrent_plugin>(torrent_handle const&, client_data_t)> const& ext │ │ │ │ - , client_data_t userdata = client_data_t{}); │ │ │ │ -
    relevance 3../include/libtorrent/pe_crypto.hpp:72dh_key_exchange should probably move into its own file

    dh_key_exchange should probably move into its own file

    ../include/libtorrent/pe_crypto.hpp:72

    │ │ │ │ -#include <list>
    │ │ │ │ -#include <array>
    │ │ │ │ -#include <cstdint>
    │ │ │ │ -
    │ │ │ │ -namespace libtorrent {
    │ │ │ │ -
    │ │ │ │ -	namespace mp = boost::multiprecision;
    │ │ │ │ -
    │ │ │ │ -	using key_t = mp::number<mp::cpp_int_backend<768, 768, mp::unsigned_magnitude, mp::unchecked, void>>;
    │ │ │ │ -
    │ │ │ │ -	TORRENT_EXTRA_EXPORT std::array<char, 96> export_key(key_t const& k);
    │ │ │ │ -
    │ │ │ │ -	// RC4 state from libtomcrypt
    │ │ │ │ -	struct rc4 {
    │ │ │ │ -		int x;
    │ │ │ │ -		int y;
    │ │ │ │ -		aux::array<std::uint8_t, 256> buf;
    │ │ │ │ -	};
    │ │ │ │ -
    │ │ │ │ -
    class TORRENT_EXTRA_EXPORT dh_key_exchange │ │ │ │ -
    { │ │ │ │ - public: │ │ │ │ - dh_key_exchange(); │ │ │ │ - │ │ │ │ - // Get local public key │ │ │ │ - key_t const& get_local_key() const { return m_dh_local_key; } │ │ │ │ - │ │ │ │ - // read remote_pubkey, generate and store shared secret in │ │ │ │ - // m_dh_shared_secret. │ │ │ │ - void compute_secret(std::uint8_t const* remote_pubkey); │ │ │ │ - void compute_secret(key_t const& remote_pubkey); │ │ │ │ - │ │ │ │ - key_t const& get_secret() const { return m_dh_shared_secret; } │ │ │ │ - │ │ │ │ - sha1_hash const& get_hash_xor_mask() const { return m_xor_mask; } │ │ │ │ - │ │ │ │ - private: │ │ │ │ - │ │ │ │ - key_t m_dh_local_key; │ │ │ │ - key_t m_dh_local_secret; │ │ │ │ - key_t m_dh_shared_secret; │ │ │ │ - sha1_hash m_xor_mask; │ │ │ │ - }; │ │ │ │ - │ │ │ │ - struct TORRENT_EXTRA_EXPORT encryption_handler │ │ │ │ - { │ │ │ │ - std::tuple<int, span<span<char const>>> │ │ │ │ - encrypt(span<span<char>> iovec); │ │ │ │ - │ │ │ │ - int decrypt(aux::crypto_receive_buffer& recv_buffer │ │ │ │ -
    relevance 3../include/libtorrent/torrent.hpp:1423factor out predictive pieces and all operations on it into a separate class (to use as member here instead)

    factor out predictive pieces and all operations on it into a │ │ │ │ +relevance 3../include/libtorrent/torrent.hpp:1423factor out predictive pieces and all operations on it into a separate class (to use as member here instead)

    factor out predictive pieces and all operations on it into a │ │ │ │ separate class (to use as member here instead)

    ../include/libtorrent/torrent.hpp:1423

    #endif
    │ │ │ │  
    │ │ │ │  		std::string m_trackerid;
    │ │ │ │  #if TORRENT_ABI_VERSION == 1
    │ │ │ │  		// deprecated in 1.1
    │ │ │ │  		std::string m_username;
    │ │ │ │  		std::string m_password;
    │ │ │ │ @@ -1760,15 +1657,15 @@
    │ │ │ │  		// cycle, and not in the constructor. So we need to save if away here
    │ │ │ │  		std::unique_ptr<add_torrent_params> m_add_torrent_params;
    │ │ │ │  
    │ │ │ │  		// if the torrent is started without metadata, it may
    │ │ │ │  		// still be given a name until the metadata is received
    │ │ │ │  		// once the metadata is received this field will no
    │ │ │ │  		// longer be used and will be reset
    │ │ │ │ -
    relevance 3../include/libtorrent/torrent.hpp:1483factor out the links (as well as update_list() to a separate class that torrent can inherit)

    factor out the links (as well as update_list() to a separate │ │ │ │ +relevance 3../include/libtorrent/torrent.hpp:1483factor out the links (as well as update_list() to a separate class that torrent can inherit)

    factor out the links (as well as update_list() to a separate │ │ │ │ class that torrent can inherit)

    ../include/libtorrent/torrent.hpp:1483

    │ │ │ │  		// this was the last time _we_ saw a seed in this swarm
    │ │ │ │  		std::time_t m_last_seen_complete = 0;
    │ │ │ │  
    │ │ │ │  		// this is the time last any of our peers saw a seed
    │ │ │ │  		// in this swarm
    │ │ │ │  		std::time_t m_swarm_last_seen_complete = 0;
    │ │ │ │ @@ -1812,15 +1709,63 @@
    │ │ │ │  
    │ │ │ │  		// the number of pieces we completed the check of
    │ │ │ │  		piece_index_t m_num_checked_pieces{0};
    │ │ │ │  
    │ │ │ │  		// if the error occurred on a file, this is the index of that file
    │ │ │ │  		// there are a few special cases, when this is negative. See
    │ │ │ │  		// set_error()
    │ │ │ │ -
    relevance 3../include/libtorrent/stat.hpp:257everything but payload counters and rates could probably be removed from here

    everything but payload counters and rates could probably be │ │ │ │ +relevance 3../include/libtorrent/web_peer_connection.hpp:119if we make this be a disk_buffer_holder instead we would save a copy use allocate_disk_receive_buffer and release_disk_receive_buffer

    if we make this be a disk_buffer_holder instead │ │ │ │ +we would save a copy │ │ │ │ +use allocate_disk_receive_buffer and release_disk_receive_buffer

    ../include/libtorrent/web_peer_connection.hpp:119

    		piece_block_progress downloading_piece_progress() const override;
    │ │ │ │ +
    │ │ │ │ +		void handle_padfile();
    │ │ │ │ +
    │ │ │ │ +		// this has one entry per http-request
    │ │ │ │ +		// (might be more than the bt requests)
    │ │ │ │ +		struct file_request_t
    │ │ │ │ +		{
    │ │ │ │ +			file_index_t file_index;
    │ │ │ │ +			int length;
    │ │ │ │ +			std::int64_t start;
    │ │ │ │ +		};
    │ │ │ │ +		std::deque<file_request_t> m_file_requests;
    │ │ │ │ +
    │ │ │ │ +		std::string m_url;
    │ │ │ │ +
    │ │ │ │ +		web_seed_t* m_web;
    │ │ │ │ +
    │ │ │ │ +		// this is used for intermediate storage of pieces to be delivered to the
    │ │ │ │ +		// bittorrent engine
    │ │ │ │ +
    aux::vector<char> m_piece; │ │ │ │ +
    │ │ │ │ + // the number of bytes we've forwarded to the incoming_payload() function │ │ │ │ + // in the current HTTP response. used to know where in the buffer the │ │ │ │ + // next response starts │ │ │ │ + int m_received_body; │ │ │ │ + │ │ │ │ + // this is the offset inside the current receive │ │ │ │ + // buffer where the next chunk header will be. │ │ │ │ + // this is updated for each chunk header that's │ │ │ │ + // parsed. It does not necessarily point to a valid │ │ │ │ + // offset in the receive buffer, if we haven't received │ │ │ │ + // it yet. This offset never includes the HTTP header │ │ │ │ + int m_chunk_pos; │ │ │ │ + │ │ │ │ + // this is the number of bytes we've already received │ │ │ │ + // from the next chunk header we're waiting for │ │ │ │ + int m_partial_chunk_header; │ │ │ │ + │ │ │ │ + // the number of responses we've received so far on │ │ │ │ + // this connection │ │ │ │ + int m_num_responses; │ │ │ │ + }; │ │ │ │ +} │ │ │ │ + │ │ │ │ +#endif // TORRENT_WEB_PEER_CONNECTION_HPP_INCLUDED │ │ │ │ +
    relevance 3../include/libtorrent/stat.hpp:257everything but payload counters and rates could probably be removed from here

    everything but payload counters and rates could probably be │ │ │ │ removed from here

    ../include/libtorrent/stat.hpp:257

    		// peer_connection is opened and have some previous
    │ │ │ │  		// transfers from earlier connections.
    │ │ │ │  		void add_stat(std::int64_t downloaded, std::int64_t uploaded)
    │ │ │ │  		{
    │ │ │ │  			m_stat[download_payload].offset(downloaded);
    │ │ │ │  			m_stat[upload_payload].offset(uploaded);
    │ │ │ │  		}
    │ │ │ │ @@ -1862,63 +1807,15 @@
    │ │ │ │  
    │ │ │ │  		stat_channel m_stat[num_channels];
    │ │ │ │  	};
    │ │ │ │  
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │  #endif // TORRENT_STAT_HPP_INCLUDED
    │ │ │ │ -
    relevance 3../include/libtorrent/web_peer_connection.hpp:119if we make this be a disk_buffer_holder instead we would save a copy use allocate_disk_receive_buffer and release_disk_receive_buffer

    if we make this be a disk_buffer_holder instead │ │ │ │ -we would save a copy │ │ │ │ -use allocate_disk_receive_buffer and release_disk_receive_buffer

    ../include/libtorrent/web_peer_connection.hpp:119

    		piece_block_progress downloading_piece_progress() const override;
    │ │ │ │ -
    │ │ │ │ -		void handle_padfile();
    │ │ │ │ -
    │ │ │ │ -		// this has one entry per http-request
    │ │ │ │ -		// (might be more than the bt requests)
    │ │ │ │ -		struct file_request_t
    │ │ │ │ -		{
    │ │ │ │ -			file_index_t file_index;
    │ │ │ │ -			int length;
    │ │ │ │ -			std::int64_t start;
    │ │ │ │ -		};
    │ │ │ │ -		std::deque<file_request_t> m_file_requests;
    │ │ │ │ -
    │ │ │ │ -		std::string m_url;
    │ │ │ │ -
    │ │ │ │ -		web_seed_t* m_web;
    │ │ │ │ -
    │ │ │ │ -		// this is used for intermediate storage of pieces to be delivered to the
    │ │ │ │ -		// bittorrent engine
    │ │ │ │ -
    aux::vector<char> m_piece; │ │ │ │ -
    │ │ │ │ - // the number of bytes we've forwarded to the incoming_payload() function │ │ │ │ - // in the current HTTP response. used to know where in the buffer the │ │ │ │ - // next response starts │ │ │ │ - int m_received_body; │ │ │ │ - │ │ │ │ - // this is the offset inside the current receive │ │ │ │ - // buffer where the next chunk header will be. │ │ │ │ - // this is updated for each chunk header that's │ │ │ │ - // parsed. It does not necessarily point to a valid │ │ │ │ - // offset in the receive buffer, if we haven't received │ │ │ │ - // it yet. This offset never includes the HTTP header │ │ │ │ - int m_chunk_pos; │ │ │ │ - │ │ │ │ - // this is the number of bytes we've already received │ │ │ │ - // from the next chunk header we're waiting for │ │ │ │ - int m_partial_chunk_header; │ │ │ │ - │ │ │ │ - // the number of responses we've received so far on │ │ │ │ - // this connection │ │ │ │ - int m_num_responses; │ │ │ │ - }; │ │ │ │ -} │ │ │ │ - │ │ │ │ -#endif // TORRENT_WEB_PEER_CONNECTION_HPP_INCLUDED │ │ │ │ -
    relevance 3../include/libtorrent/enum_net.hpp:164use string_view for device_name

    use string_view for device_name

    ../include/libtorrent/enum_net.hpp:164

    	// return nullopt.
    │ │ │ │ +
    relevance 3../include/libtorrent/enum_net.hpp:164use string_view for device_name

    use string_view for device_name

    ../include/libtorrent/enum_net.hpp:164

    	// return nullopt.
    │ │ │ │  	TORRENT_EXTRA_EXPORT boost::optional<address> get_gateway(
    │ │ │ │  		ip_interface const& iface, span<ip_route const> routes);
    │ │ │ │  
    │ │ │ │  	// returns whether there is a route to the specified device for for any global
    │ │ │ │  	// internet address of the specified address family.
    │ │ │ │  	TORRENT_EXTRA_EXPORT bool has_internet_route(string_view device, int family
    │ │ │ │  		, span<ip_route const> routes);
    │ │ │ │ @@ -1961,14 +1858,117 @@
    │ │ │ │  		// try to use SO_BINDTODEVICE here, if that exists. If it fails,
    │ │ │ │  		// fall back to the mechanism we have below
    │ │ │ │  		aux::bind_device(sock, device_name, ec);
    │ │ │ │  		if (ec)
    │ │ │ │  #endif
    │ │ │ │  		{
    │ │ │ │  			ec.clear();
    │ │ │ │ +
    relevance 3../include/libtorrent/pe_crypto.hpp:72dh_key_exchange should probably move into its own file

    dh_key_exchange should probably move into its own file

    ../include/libtorrent/pe_crypto.hpp:72

    │ │ │ │ +#include <list>
    │ │ │ │ +#include <array>
    │ │ │ │ +#include <cstdint>
    │ │ │ │ +
    │ │ │ │ +namespace libtorrent {
    │ │ │ │ +
    │ │ │ │ +	namespace mp = boost::multiprecision;
    │ │ │ │ +
    │ │ │ │ +	using key_t = mp::number<mp::cpp_int_backend<768, 768, mp::unsigned_magnitude, mp::unchecked, void>>;
    │ │ │ │ +
    │ │ │ │ +	TORRENT_EXTRA_EXPORT std::array<char, 96> export_key(key_t const& k);
    │ │ │ │ +
    │ │ │ │ +	// RC4 state from libtomcrypt
    │ │ │ │ +	struct rc4 {
    │ │ │ │ +		int x;
    │ │ │ │ +		int y;
    │ │ │ │ +		aux::array<std::uint8_t, 256> buf;
    │ │ │ │ +	};
    │ │ │ │ +
    │ │ │ │ +
    class TORRENT_EXTRA_EXPORT dh_key_exchange │ │ │ │ +
    { │ │ │ │ + public: │ │ │ │ + dh_key_exchange(); │ │ │ │ + │ │ │ │ + // Get local public key │ │ │ │ + key_t const& get_local_key() const { return m_dh_local_key; } │ │ │ │ + │ │ │ │ + // read remote_pubkey, generate and store shared secret in │ │ │ │ + // m_dh_shared_secret. │ │ │ │ + void compute_secret(std::uint8_t const* remote_pubkey); │ │ │ │ + void compute_secret(key_t const& remote_pubkey); │ │ │ │ + │ │ │ │ + key_t const& get_secret() const { return m_dh_shared_secret; } │ │ │ │ + │ │ │ │ + sha1_hash const& get_hash_xor_mask() const { return m_xor_mask; } │ │ │ │ + │ │ │ │ + private: │ │ │ │ + │ │ │ │ + key_t m_dh_local_key; │ │ │ │ + key_t m_dh_local_secret; │ │ │ │ + key_t m_dh_shared_secret; │ │ │ │ + sha1_hash m_xor_mask; │ │ │ │ + }; │ │ │ │ + │ │ │ │ + struct TORRENT_EXTRA_EXPORT encryption_handler │ │ │ │ + { │ │ │ │ + std::tuple<int, span<span<char const>>> │ │ │ │ + encrypt(span<span<char>> iovec); │ │ │ │ + │ │ │ │ + int decrypt(aux::crypto_receive_buffer& recv_buffer │ │ │ │ +
    relevance 3../include/libtorrent/torrent_handle.hpp:535unify url_seed and http_seed with just web_seed, using the web_seed_entry.

    unify url_seed and http_seed with just web_seed, using the │ │ │ │ +web_seed_entry.

    ../include/libtorrent/torrent_handle.hpp:535

    		// one returned from ``trackers()`` and will replace it. If you want an
    │ │ │ │ +		// immediate effect, you have to call force_reannounce(). See
    │ │ │ │ +		// announce_entry.
    │ │ │ │ +		//
    │ │ │ │ +		// ``post_trackers()`` is the asynchronous version of ``trackers()``. It
    │ │ │ │ +		// will trigger a tracker_list_alert to be posted.
    │ │ │ │ +		//
    │ │ │ │ +		// ``add_tracker()`` will look if the specified tracker is already in the
    │ │ │ │ +		// set. If it is, it doesn't do anything. If it's not in the current set
    │ │ │ │ +		// of trackers, it will insert it in the tier specified in the
    │ │ │ │ +		// announce_entry.
    │ │ │ │ +		//
    │ │ │ │ +		// The updated set of trackers will be saved in the resume data, and when
    │ │ │ │ +		// a torrent is started with resume data, the trackers from the resume
    │ │ │ │ +		// data will replace the original ones.
    │ │ │ │ +		std::vector<announce_entry> trackers() const;
    │ │ │ │ +		void replace_trackers(std::vector<announce_entry> const&) const;
    │ │ │ │ +		void add_tracker(announce_entry const&) const;
    │ │ │ │ +		void post_trackers() 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 add_url_seed(std::string const& url) const; │ │ │ │ + void remove_url_seed(std::string const& url) const; │ │ │ │ + std::set<std::string> url_seeds() const; │ │ │ │ + │ │ │ │ + // These functions are identical as the ``*_url_seed()`` variants, but │ │ │ │ + // they operate on `BEP 17`_ web seeds instead of `BEP 19`_. │ │ │ │ + // │ │ │ │ + // See http-seeding_ for more information. │ │ │ │ + void add_http_seed(std::string const& url) const; │ │ │ │ + void remove_http_seed(std::string const& url) const; │ │ │ │ + std::set<std::string> http_seeds() const; │ │ │ │ + │ │ │ │ + // add the specified extension to this torrent. The ``ext`` argument is │ │ │ │ + // a function that will be called from within libtorrent's context │ │ │ │ + // passing in the internal torrent object and the specified userdata │ │ │ │ + // pointer. The function is expected to return a shared pointer to │ │ │ │ + // a torrent_plugin instance. │ │ │ │ + void add_extension( │ │ │ │ + std::function<std::shared_ptr<torrent_plugin>(torrent_handle const&, client_data_t)> const& ext │ │ │ │ + , client_data_t userdata = client_data_t{}); │ │ │ │
    relevance 3../include/libtorrent/kademlia/routing_table.hpp:153to improve memory locality and scanning performance, turn the routing table into a single vector with boundaries for the nodes instead. Perhaps replacement nodes should be in a separate vector.

    to improve memory locality and scanning performance, turn the │ │ │ │ routing table into a single vector with boundaries for the nodes instead. │ │ │ │ Perhaps replacement nodes should be in a separate vector.

    ../include/libtorrent/kademlia/routing_table.hpp:153

    // * Nodes are not marked as being stale, they keep a counter
    │ │ │ │  // 	that tells how many times in a row they have failed. When
    │ │ │ │  // 	a new node is to be inserted, the node that has failed
    │ │ │ │  // 	the most times is replaced. If none of the nodes in the
    │ │ │ │  // 	bucket has failed, then it is put in the replacement
    │ │ │ │ @@ -2066,15 +2066,16 @@
    │ │ │ │  
    │ │ │ │  	// deletes the files on fs from save_path according to options. Options may
    │ │ │ │  	// opt to only delete the partfile
    │ │ │ │  	TORRENT_EXTRA_EXPORT void
    │ │ │ │  	delete_files(file_storage const& fs, std::string const& save_path
    │ │ │ │  		, std::string const& part_file_name, remove_flags_t options, storage_error& ec);
    │ │ │ │  
    │ │ │ │ -
    relevance 2../test/test_storage.cpp:769split this test up into smaller parts

    split this test up into smaller parts

    ../test/test_storage.cpp:769

    	io->submit_jobs();
    │ │ │ │ +
    relevance 2../test/test_piece_picker.cpp:2870test picking with partial pieces and other peers present so that both backup_pieces and backup_pieces2 are used

    test picking with partial pieces and other peers present so that both │ │ │ │ +backup_pieces and backup_pieces2 are used

    ../test/test_piece_picker.cpp:2870

    relevance 2../test/test_storage.cpp:769split this test up into smaller parts

    split this test up into smaller parts

    ../test/test_storage.cpp:769

    	io->submit_jobs();
    │ │ │ │  	ios.restart();
    │ │ │ │  	run_until(ios, done);
    │ │ │ │  
    │ │ │ │  	TEST_EQUAL(oversized, bool(flags & test_oversized));
    │ │ │ │  
    │ │ │ │  	for (auto const i : info->piece_range())
    │ │ │ │  	{
    │ │ │ │ @@ -2117,15 +2118,15 @@
    │ │ │ │  
    │ │ │ │  	// File layout
    │ │ │ │  	// +-+--+++-------+-------+----------------------------------------------------------------------------------------+
    │ │ │ │  	// |1| 2||| file5 | file6 | file7                                                                                  |
    │ │ │ │  	// +-+--+++-------+-------+----------------------------------------------------------------------------------------+
    │ │ │ │  	// |                           |                           |                           |                           |
    │ │ │ │  	// | piece 0                   | piece 1                   | piece 2                   | piece 3                   |
    │ │ │ │ -
    relevance 2../test/test_dht.cpp:1642test num_global_nodes

    test num_global_nodes

    ../test/test_dht.cpp:1642

    relevance 2../test/test_dht.cpp:1643test need_refresh

    test need_refresh

    ../test/test_dht.cpp:1643

    │ │ │ │ +
    relevance 2../test/test_dht.cpp:1642test num_global_nodes

    test num_global_nodes

    ../test/test_dht.cpp:1642

    relevance 2../test/test_dht.cpp:1643test need_refresh

    test need_refresh

    ../test/test_dht.cpp:1643

    │ │ │ │  	s.set_bool(settings_pack::dht_restrict_routing_ips, false);
    │ │ │ │  
    │ │ │ │  	{
    │ │ │ │  		auto const ep = rand_udp_ep(rand_addr);
    │ │ │ │  		auto const id = generate_id_impl(ep.address(), 2);
    │ │ │ │  		table.node_seen(id, ep, 10);
    │ │ │ │  	}
    │ │ │ │ @@ -2168,15 +2169,15 @@
    │ │ │ │  		std::vector<node_entry> temp = table.find_node(id, {}, bucket_size * 2);
    │ │ │ │  		TEST_EQUAL(int(temp.size()), std::min(bucket_size * 2, int(nodes.size())));
    │ │ │ │  
    │ │ │ │  		std::sort(nodes.begin(), nodes.end(), std::bind(&compare_ref
    │ │ │ │  				, std::bind(&node_entry::id, _1)
    │ │ │ │  				, std::bind(&node_entry::id, _2), id));
    │ │ │ │  
    │ │ │ │ -
    relevance 2../test/test_dht.cpp:2828split this up into smaller test cases

    split this up into smaller test cases

    ../test/test_dht.cpp:2828

    │ │ │ │ +
    relevance 2../test/test_dht.cpp:2828split this up into smaller test cases

    split this up into smaller test cases

    ../test/test_dht.cpp:2828

    │ │ │ │  	TEST_EQUAL(aux::to_hex(sig.bytes)
    │ │ │ │  		, "6834284b6b24c3204eb2fea824d82f88883a3d95e8b4a21b8c0ded553d17d17d"
    │ │ │ │  		"df9a8a7104b1258f30bed3787e6cb896fca78c58f8e03b5f18f14951a87d9a08");
    │ │ │ │  
    │ │ │ │  	sha1_hash target_id = item_target_id(test_salt, pk);
    │ │ │ │  	TEST_EQUAL(aux::to_hex(target_id), "411eba73b6f087ca51a3795d9c8c938d365e32c1");
    │ │ │ │  }
    │ │ │ │ @@ -2219,16 +2220,274 @@
    │ │ │ │  	bool ret = verify_message(ent, msg_desc, msg_keys, error_string);
    │ │ │ │  	TEST_CHECK(ret);
    │ │ │ │  	TEST_CHECK(msg_keys[0]);
    │ │ │ │  	if (msg_keys[0]) TEST_EQUAL(msg_keys[0].string_value(), "test");
    │ │ │ │  	TEST_CHECK(msg_keys[1]);
    │ │ │ │  	TEST_CHECK(msg_keys[2]);
    │ │ │ │  	if (msg_keys[2]) TEST_EQUAL(msg_keys[2].string_value(), "test2");
    │ │ │ │ -
    relevance 2../test/test_piece_picker.cpp:2870test picking with partial pieces and other peers present so that both backup_pieces and backup_pieces2 are used

    test picking with partial pieces and other peers present so that both │ │ │ │ -backup_pieces and backup_pieces2 are used

    ../test/test_piece_picker.cpp:2870

    relevance 2../src/upnp.cpp:106use boost::asio::ip::network instead of netmask

    use boost::asio::ip::network instead of netmask

    ../src/upnp.cpp:106

    │ │ │ │ +
    relevance 2../src/torrent.cpp:504post alert

    post alert

    ../src/torrent.cpp:504

    		if (m_current_gauge_state != no_gauge_state)
    │ │ │ │ +			inc_stats_counter(m_current_gauge_state + counters::num_checking_torrents, -1);
    │ │ │ │ +		if (new_gauge_state != no_gauge_state)
    │ │ │ │ +			inc_stats_counter(new_gauge_state + counters::num_checking_torrents, 1);
    │ │ │ │ +
    │ │ │ │ +		TORRENT_ASSERT(new_gauge_state >= 0);
    │ │ │ │ +		TORRENT_ASSERT(new_gauge_state <= no_gauge_state);
    │ │ │ │ +		m_current_gauge_state = static_cast<std::uint32_t>(new_gauge_state);
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +	void torrent::leave_seed_mode(seed_mode_t const checking)
    │ │ │ │ +	{
    │ │ │ │ +		if (!m_seed_mode) return;
    │ │ │ │ +
    │ │ │ │ +		if (checking == seed_mode_t::check_files)
    │ │ │ │ +		{
    │ │ │ │ +			// this means the user promised we had all the
    │ │ │ │ +			// files, but it turned out we didn't. This is
    │ │ │ │ +			// an error.
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    #ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + debug_log("*** FAILED SEED MODE, rechecking"); │ │ │ │ +#endif │ │ │ │ + } │ │ │ │ + │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + debug_log("*** LEAVING SEED MODE (%s)" │ │ │ │ + , checking == seed_mode_t::skip_checking ? "as seed" : "as non-seed"); │ │ │ │ +#endif │ │ │ │ + m_seed_mode = false; │ │ │ │ + // seed is false if we turned out not │ │ │ │ + // to be a seed after all │ │ │ │ + if (checking == seed_mode_t::check_files │ │ │ │ + && state() != torrent_status::checking_resume_data) │ │ │ │ + { │ │ │ │ + m_have_all = false; │ │ │ │ + set_state(torrent_status::downloading); │ │ │ │ + force_recheck(); │ │ │ │ + } │ │ │ │ + m_num_verified = 0; │ │ │ │ + m_verified.clear(); │ │ │ │ + m_verifying.clear(); │ │ │ │ + │ │ │ │ + set_need_save_resume(torrent_handle::if_state_changed); │ │ │ │ + } │ │ │ │ + │ │ │ │ + void torrent::verified(piece_index_t const piece) │ │ │ │ + { │ │ │ │ + TORRENT_ASSERT(!m_verified.get_bit(piece)); │ │ │ │ + ++m_num_verified; │ │ │ │ +
    relevance 2../src/torrent.cpp:1852add a unit test where we don't have metadata, connect to a peer that sends a bitfield that's too large, then we get the metadata

    add a unit test where we don't have metadata, connect to a peer │ │ │ │ +that sends a bitfield that's too large, then we get the metadata

    ../src/torrent.cpp:1852

    			for (auto const& f : m_add_torrent_params->renamed_files)
    │ │ │ │ +			{
    │ │ │ │ +				if (f.first < file_index_t(0) || f.first >= fs.end_file()) continue;
    │ │ │ │ +				m_torrent_file->rename_file(file_index_t(f.first), f.second);
    │ │ │ │ +			}
    │ │ │ │ +		}
    │ │ │ │ +
    │ │ │ │ +		construct_storage();
    │ │ │ │ +
    │ │ │ │ +#ifndef TORRENT_DISABLE_SHARE_MODE
    │ │ │ │ +		if (m_share_mode && valid_metadata())
    │ │ │ │ +		{
    │ │ │ │ +			// in share mode, all pieces have their priorities initialized to 0
    │ │ │ │ +			m_file_priority.clear();
    │ │ │ │ +			m_file_priority.resize(m_torrent_file->num_files(), dont_download);
    │ │ │ │ +		}
    │ │ │ │ +#endif
    │ │ │ │ +
    │ │ │ │ +		// it's important to initialize the peers early, because this is what will
    │ │ │ │ +		// fix up their have-bitmasks to have the correct size
    │ │ │ │ +
    if (!m_connections_initialized) │ │ │ │ +
    { │ │ │ │ + m_connections_initialized = true; │ │ │ │ + // all peer connections have to initialize themselves now that the metadata │ │ │ │ + // is available │ │ │ │ + // copy the peer list since peers may disconnect and invalidate │ │ │ │ + // m_connections as we initialize them │ │ │ │ + for (auto c : m_connections) │ │ │ │ + { │ │ │ │ + auto pc = c->self(); │ │ │ │ + if (pc->is_disconnecting()) continue; │ │ │ │ + pc->on_metadata_impl(); │ │ │ │ + if (pc->is_disconnecting()) continue; │ │ │ │ + pc->init(); │ │ │ │ + } │ │ │ │ + } │ │ │ │ + │ │ │ │ + // in case file priorities were passed in via the add_torrent_params │ │ │ │ + // and also in the case of share mode, we need to update the priorities │ │ │ │ + // this has to be applied before piece priority │ │ │ │ + if (!m_file_priority.empty()) │ │ │ │ + { │ │ │ │ + // m_file_priority was loaded from the resume data, this doesn't │ │ │ │ + // alter any state that needs to be saved in the resume data │ │ │ │ + auto const ns = m_need_save_resume_data; │ │ │ │ + update_piece_priorities(m_file_priority); │ │ │ │ + m_need_save_resume_data = ns; │ │ │ │ + } │ │ │ │ + │ │ │ │ + if (m_add_torrent_params) │ │ │ │ + { │ │ │ │ +
    relevance 2../src/torrent.cpp:4492use chrono type for time duration

    use chrono type for time duration

    ../src/torrent.cpp:4492

    		}
    │ │ │ │ +
    │ │ │ │ +		m_picker->piece_passed(index);
    │ │ │ │ +		update_gauge();
    │ │ │ │ +		we_have(index);
    │ │ │ │ +
    │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ +		if (should_log())
    │ │ │ │ +			debug_log("we_have(%d) (num_have: %d)", int(index), num_have());
    │ │ │ │ +#endif
    │ │ │ │ +#ifndef TORRENT_DISABLE_STREAMING
    │ │ │ │ +		remove_time_critical_piece(index, true);
    │ │ │ │ +#endif
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +#ifndef TORRENT_DISABLE_PREDICTIVE_PIECES
    │ │ │ │ +	// we believe we will complete this piece very soon
    │ │ │ │ +	// announce it to peers ahead of time to eliminate the
    │ │ │ │ +	// round-trip times involved in announcing it, requesting it
    │ │ │ │ +	// and sending it
    │ │ │ │ +
    void torrent::predicted_have_piece(piece_index_t const index, int const milliseconds) │ │ │ │ +
    { │ │ │ │ + auto const i = std::lower_bound(m_predictive_pieces.begin() │ │ │ │ + , m_predictive_pieces.end(), index); │ │ │ │ + if (i != m_predictive_pieces.end() && *i == index) return; │ │ │ │ + │ │ │ │ + for (auto p : m_connections) │ │ │ │ + { │ │ │ │ + TORRENT_INCREMENT(m_iterating_connections); │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + p->peer_log(peer_log_alert::outgoing, "PREDICTIVE_HAVE", "piece: %d expected in %d ms" │ │ │ │ + , static_cast<int>(index), milliseconds); │ │ │ │ +#else │ │ │ │ + TORRENT_UNUSED(milliseconds); │ │ │ │ +#endif │ │ │ │ + p->announce_piece(index); │ │ │ │ + } │ │ │ │ + │ │ │ │ + m_predictive_pieces.insert(i, index); │ │ │ │ + } │ │ │ │ +#endif │ │ │ │ + │ │ │ │ + // blocks may contain the block indices of the blocks that failed (if this is │ │ │ │ + // a v2 torrent). │ │ │ │ + void torrent::piece_failed(piece_index_t const index, std::vector<int> blocks) │ │ │ │ + { │ │ │ │ + // if the last piece fails the peer connection will still │ │ │ │ + // think that it has received all of it until this function │ │ │ │ + // resets the download queue. So, we cannot do the │ │ │ │ + // invariant check here since it assumes: │ │ │ │ + // (total_done == m_torrent_file->total_size()) => is_seed() │ │ │ │ +
    relevance 2../src/torrent.cpp:4919abort lookups this torrent has made via the session host resolver interface

    abort lookups this torrent has made via the │ │ │ │ +session host resolver interface

    ../src/torrent.cpp:4919

    				TORRENT_UNUSED(e);
    │ │ │ │ +				m_storage.reset();
    │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ +				debug_log("Failed to flush disk cache: %s", e.what());
    │ │ │ │ +#endif
    │ │ │ │ +				// clients may rely on this alert to be posted, so it's probably a
    │ │ │ │ +				// good idea to post it here, even though we failed
    │ │ │ │ +				if (alerts().should_post<cache_flushed_alert>())
    │ │ │ │ +					alerts().emplace_alert<cache_flushed_alert>(get_handle());
    │ │ │ │ +			}
    │ │ │ │ +			m_ses.deferred_submit_jobs();
    │ │ │ │ +		}
    │ │ │ │ +		else
    │ │ │ │ +		{
    │ │ │ │ +			if (alerts().should_post<cache_flushed_alert>())
    │ │ │ │ +				alerts().emplace_alert<cache_flushed_alert>(get_handle());
    │ │ │ │ +			alerts().emplace_alert<torrent_removed_alert>(get_handle()
    │ │ │ │ +				, info_hash(), get_userdata());
    │ │ │ │ +		}
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    if (!m_apply_ip_filter) │ │ │ │ + { │ │ │ │ + inc_stats_counter(counters::non_filter_torrents, -1); │ │ │ │ + m_apply_ip_filter = true; │ │ │ │ + } │ │ │ │ + │ │ │ │ + m_paused = false; │ │ │ │ + m_auto_managed = false; │ │ │ │ + update_state_list(); │ │ │ │ + for (torrent_list_index_t i{}; i != m_links.end_index(); ++i) │ │ │ │ + { │ │ │ │ + if (!m_links[i].in_list()) continue; │ │ │ │ + m_links[i].unlink(m_ses.torrent_list(i), i); │ │ │ │ + } │ │ │ │ + // don't re-add this torrent to the state-update list │ │ │ │ + m_state_subscription = false; │ │ │ │ + } │ │ │ │ + │ │ │ │ + // this is called when we're destructing non-gracefully. i.e. we're _just_ │ │ │ │ + // destructing everything. │ │ │ │ + void torrent::panic() │ │ │ │ + { │ │ │ │ + m_storage.reset(); │ │ │ │ + // if there are any other peers allocated still, we need to clear them │ │ │ │ + // now. They can't be cleared later because the allocator will already │ │ │ │ + // have been destructed │ │ │ │ + if (m_peer_list) m_peer_list->clear(); │ │ │ │ + m_connections.clear(); │ │ │ │ + m_outgoing_pids.clear(); │ │ │ │ + m_peers_to_disconnect.clear(); │ │ │ │ +
    relevance 2../src/torrent.cpp:8032if peer is a really good peer, maybe we shouldn't disconnect it perhaps this logic should be disabled if we have too many idle peers (with some definition of idle)

    if peer is a really good peer, maybe we shouldn't disconnect it │ │ │ │ +perhaps this logic should be disabled if we have too many idle peers │ │ │ │ +(with some definition of idle)

    ../src/torrent.cpp:8032

    │ │ │ │ +		m_peers_to_disconnect.reserve(m_connections.size() + 1);
    │ │ │ │ +		m_connections.reserve(m_connections.size() + 1);
    │ │ │ │ +
    │ │ │ │ +#if TORRENT_USE_ASSERTS
    │ │ │ │ +		error_code ec;
    │ │ │ │ +		TORRENT_ASSERT(p->remote() == p->get_socket().remote_endpoint(ec) || ec);
    │ │ │ │ +#endif
    │ │ │ │ +
    │ │ │ │ +		TORRENT_ASSERT(p->peer_info_struct() != nullptr);
    │ │ │ │ +
    │ │ │ │ +		// we need to do this after we've added the peer to the peer_list
    │ │ │ │ +		// since that's when the peer is assigned its peer_info object,
    │ │ │ │ +		// which holds the rank
    │ │ │ │ +		if (maybe_replace_peer)
    │ │ │ │ +		{
    │ │ │ │ +			// now, find the lowest rank peer and disconnect that
    │ │ │ │ +			// if it's lower rank than the incoming connection
    │ │ │ │ +			peer_connection* peer = find_lowest_ranking_peer();
    │ │ │ │ +
    │ │ │ │ +
    if (peer != nullptr && peer->peer_rank() < p->peer_rank()) │ │ │ │ +
    { │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + if (should_log()) │ │ │ │ + { │ │ │ │ + debug_log("CLOSING CONNECTION \"%s\" peer list full (low peer rank) " │ │ │ │ + "connections: %d limit: %d" │ │ │ │ + , print_endpoint(peer->remote()).c_str() │ │ │ │ + , num_peers() │ │ │ │ + , m_max_connections); │ │ │ │ + } │ │ │ │ +#endif │ │ │ │ + peer->disconnect(errors::too_many_connections, operation_t::bittorrent); │ │ │ │ + p->peer_disconnected_other(); │ │ │ │ + } │ │ │ │ + else │ │ │ │ + { │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + if (should_log()) │ │ │ │ + { │ │ │ │ + debug_log("CLOSING CONNECTION \"%s\" peer list full (low peer rank) " │ │ │ │ + "connections: %d limit: %d" │ │ │ │ + , print_endpoint(p->remote()).c_str() │ │ │ │ + , num_peers() │ │ │ │ + , m_max_connections); │ │ │ │ + } │ │ │ │ +#endif │ │ │ │ + p->disconnect(errors::too_many_connections, operation_t::bittorrent); │ │ │ │ + // we have to do this here because from the peer's point of view │ │ │ │ + // it wasn't really attached to the torrent, but we do need │ │ │ │ + // to let peer_list know we're removing it │ │ │ │ +
    relevance 2../src/upnp.cpp:106use boost::asio::ip::network instead of netmask

    use boost::asio::ip::network instead of netmask

    ../src/upnp.cpp:106

    │ │ │ │  static error_code ignore_error;
    │ │ │ │  
    │ │ │ │  upnp::rootdevice::rootdevice() = default;
    │ │ │ │  
    │ │ │ │  #if TORRENT_USE_ASSERTS
    │ │ │ │  upnp::rootdevice::~rootdevice()
    │ │ │ │  {
    │ │ │ │ @@ -2271,120 +2530,66 @@
    │ │ │ │  #if TORRENT_USE_SSL
    │ │ │ │  	m_ssl_ctx.set_verify_mode(ssl::context::verify_none);
    │ │ │ │  #endif
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │  void upnp::start()
    │ │ │ │  {
    │ │ │ │ -
    relevance 2../src/bdecode.cpp:826attempt to simplify this implementation by embracing the span

    attempt to simplify this implementation by embracing the span

    ../src/bdecode.cpp:826

    	}
    │ │ │ │ -
    │ │ │ │ -	bdecode_node bdecode(span<char const> buffer
    │ │ │ │ -		, error_code& ec, int* error_pos, int depth_limit, int token_limit)
    │ │ │ │ -	{
    │ │ │ │ -		bdecode_node ret;
    │ │ │ │ -		ec.clear();
    │ │ │ │ +
    relevance 2../src/udp_tracker_connection.cpp:81support authentication here. tracker_req().auth

    support authentication here. tracker_req().auth

    ../src/udp_tracker_connection.cpp:81

    		udp_tracker_connection::m_connection_cache;
    │ │ │ │  
    │ │ │ │ -		if (buffer.size() > bdecode_token::max_offset)
    │ │ │ │ -		{
    │ │ │ │ -			if (error_pos) *error_pos = 0;
    │ │ │ │ -			ec = bdecode_errors::limit_exceeded;
    │ │ │ │ -			return ret;
    │ │ │ │ -		}
    │ │ │ │ +	std::mutex udp_tracker_connection::m_cache_mutex;
    │ │ │ │  
    │ │ │ │ -		// this is the stack of bdecode_token indices, into m_tokens.
    │ │ │ │ -		// sp is the stack pointer, as index into the array, stack
    │ │ │ │ -		int sp = 0;
    │ │ │ │ -		TORRENT_ALLOCA(stack, stack_frame, depth_limit);
    │ │ │ │ +	udp_tracker_connection::udp_tracker_connection(
    │ │ │ │ +		io_context& ios
    │ │ │ │ +		, tracker_manager& man
    │ │ │ │ +		, tracker_request const& req
    │ │ │ │ +		, std::weak_ptr<request_callback> c)
    │ │ │ │ +		: tracker_connection(man, req, ios, std::move(c))
    │ │ │ │ +		, m_transaction_id(0)
    │ │ │ │ +		, m_attempts(0)
    │ │ │ │ +		, m_state(action_t::error)
    │ │ │ │ +		, m_abort(false)
    │ │ │ │ +	{
    │ │ │ │ +		update_transaction_id();
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -
    char const* start = buffer.data(); │ │ │ │ -
    char const* end = start + buffer.size(); │ │ │ │ - char const* const orig_start = start; │ │ │ │ + void udp_tracker_connection::start() │ │ │ │ + { │ │ │ │ +
    std::string hostname; │ │ │ │ +
    std::string protocol; │ │ │ │ + int port; │ │ │ │ + error_code ec; │ │ │ │ │ │ │ │ - if (start == end) │ │ │ │ - TORRENT_FAIL_BDECODE(bdecode_errors::unexpected_eof); │ │ │ │ + std::tie(protocol, std::ignore, hostname, port, std::ignore) │ │ │ │ + = parse_url_components(tracker_req().url, ec); │ │ │ │ + if (port == -1) port = protocol == "http" ? 80 : 443; │ │ │ │ │ │ │ │ - while (start <= end) │ │ │ │ + if (ec) │ │ │ │ { │ │ │ │ - if (start >= end) TORRENT_FAIL_BDECODE(bdecode_errors::unexpected_eof); │ │ │ │ - │ │ │ │ - if (sp >= depth_limit) │ │ │ │ - TORRENT_FAIL_BDECODE(bdecode_errors::depth_exceeded); │ │ │ │ - │ │ │ │ - --token_limit; │ │ │ │ - if (token_limit < 0) │ │ │ │ - TORRENT_FAIL_BDECODE(bdecode_errors::limit_exceeded); │ │ │ │ - │ │ │ │ - // look for a new token │ │ │ │ - char const t = *start; │ │ │ │ - │ │ │ │ - int const current_frame = sp; │ │ │ │ - │ │ │ │ - // if we're currently parsing a dictionary, assert that │ │ │ │ - // every other node is a string. │ │ │ │ - if (current_frame > 0 │ │ │ │ - && ret.m_tokens[stack[current_frame - 1].token].type == bdecode_token::dict) │ │ │ │ - { │ │ │ │ - if (stack[current_frame - 1].state == 0) │ │ │ │ - { │ │ │ │ - // the current parent is a dict and we are parsing a key. │ │ │ │ -
    relevance 2../src/web_peer_connection.cpp:626just make this peer not have the pieces associated with the file we just requested. Only when it doesn't have any of the file do the following pad files will make it complicated

    just make this peer not have the pieces │ │ │ │ -associated with the file we just requested. Only │ │ │ │ -when it doesn't have any of the file do the following │ │ │ │ -pad files will make it complicated

    ../src/web_peer_connection.cpp:626

    │ │ │ │ -	peer_connection::received_invalid_data(index, single_peer);
    │ │ │ │ -
    │ │ │ │ -	// if we don't think we have any of the files, allow banning the web seed
    │ │ │ │ -	if (num_have_pieces() == 0) return true;
    │ │ │ │ -
    │ │ │ │ -	// don't disconnect, we won't request anything from this file again
    │ │ │ │ -	return false;
    │ │ │ │ -}
    │ │ │ │ -
    │ │ │ │ -void web_peer_connection::on_receive_padfile()
    │ │ │ │ -{
    │ │ │ │ -	handle_padfile();
    │ │ │ │ -}
    │ │ │ │ -
    │ │ │ │ -void web_peer_connection::handle_error(int const bytes_left)
    │ │ │ │ -{
    │ │ │ │ -	std::shared_ptr<torrent> t = associated_torrent().lock();
    │ │ │ │ -	TORRENT_ASSERT(t);
    │ │ │ │ +			tracker_connection::fail(ec, operation_t::parse_address);
    │ │ │ │ +			return;
    │ │ │ │ +		}
    │ │ │ │  
    │ │ │ │ -
    │ │ │ │ -
    // temporarily unavailable, retry later │ │ │ │ - t->retry_web_seed(this, m_parser.header_duration("retry-after")); │ │ │ │ - if (t->alerts().should_post<url_seed_alert>()) │ │ │ │ - { │ │ │ │ - std::string const error_msg = to_string(m_parser.status_code()).data() │ │ │ │ - + (" " + m_parser.message()); │ │ │ │ - t->alerts().emplace_alert<url_seed_alert>(t->get_handle(), m_url │ │ │ │ - , error_msg); │ │ │ │ - } │ │ │ │ - received_bytes(0, bytes_left); │ │ │ │ - disconnect(error_code(m_parser.status_code(), http_category()), operation_t::bittorrent, failure); │ │ │ │ -} │ │ │ │ + aux::session_settings const& settings = m_man.settings(); │ │ │ │ │ │ │ │ -void web_peer_connection::disable(error_code const& ec) │ │ │ │ -{ │ │ │ │ - // we should not try this server again. │ │ │ │ - m_web->disabled = true; │ │ │ │ - disconnect(ec, operation_t::bittorrent, peer_error); │ │ │ │ - if (m_web->ephemeral) │ │ │ │ - { │ │ │ │ - std::shared_ptr<torrent> t = associated_torrent().lock(); │ │ │ │ - TORRENT_ASSERT(t); │ │ │ │ - t->remove_web_seed_conn(this); │ │ │ │ - } │ │ │ │ - m_web = nullptr; │ │ │ │ - TORRENT_ASSERT(is_disconnecting()); │ │ │ │ -} │ │ │ │ + int const proxy_type = settings.get_int(settings_pack::proxy_type); │ │ │ │ │ │ │ │ -void web_peer_connection::handle_redirect(int const bytes_left) │ │ │ │ -{ │ │ │ │ -
    relevance 2../src/session_impl.cpp:599is there a reason not to move all of this into init()? and just post it to the io_context?

    is there a reason not to move all of this into init()? and just │ │ │ │ + if (settings.get_bool(settings_pack::proxy_hostnames) │ │ │ │ + && (proxy_type == settings_pack::socks5 │ │ │ │ + || proxy_type == settings_pack::socks5_pw)) │ │ │ │ + { │ │ │ │ + m_hostname = hostname; │ │ │ │ + m_target.port(std::uint16_t(port)); │ │ │ │ + start_announce(); │ │ │ │ + } │ │ │ │ + else │ │ │ │ + { │ │ │ │ + using namespace std::placeholders; │ │ │ │ + ADD_OUTSTANDING_ASYNC("udp_tracker_connection::name_lookup"); │ │ │ │ +relevance 2../src/session_impl.cpp:599is there a reason not to move all of this into init()? and just post it to the io_context?

    is there a reason not to move all of this into init()? and just │ │ │ │ post it to the io_context?

    ../src/session_impl.cpp:599

    	try
    │ │ │ │  #endif
    │ │ │ │  	{
    │ │ │ │  		(this->*f)(std::forward<Args>(a)...);
    │ │ │ │  	}
    │ │ │ │  #ifndef BOOST_NO_EXCEPTIONS
    │ │ │ │  	catch (system_error const& e) {
    │ │ │ │ @@ -2411,15 +2616,15 @@
    │ │ │ │  		error_code ec;
    │ │ │ │  		m_ssl_ctx.set_default_verify_paths(ec);
    │ │ │ │  #ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │  		if (ec) session_log("SSL set_default verify_paths failed: %s", ec.message().c_str());
    │ │ │ │  		ec.clear();
    │ │ │ │  #endif
    │ │ │ │  #if defined TORRENT_WINDOWS && defined TORRENT_USE_OPENSSL && !defined TORRENT_WINRT
    │ │ │ │ -
    relevance 2../src/session_impl.cpp:761the ip filter should probably be saved here too

    the ip filter should probably be saved here too

    ../src/session_impl.cpp:761

    		m_lsd_announce_timer.async_wait([this](error_code const& e) {
    │ │ │ │ +
    relevance 2../src/session_impl.cpp:761the ip filter should probably be saved here too

    the ip filter should probably be saved here too

    ../src/session_impl.cpp:761

    		m_lsd_announce_timer.async_wait([this](error_code const& e) {
    │ │ │ │  			wrap(&session_impl::on_lsd_announce, e); } );
    │ │ │ │  
    │ │ │ │  #ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │  		session_log(" done starting session");
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │  		// this applies unchoke settings from m_settings
    │ │ │ │ @@ -2462,15 +2667,15 @@
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │  #ifndef TORRENT_DISABLE_EXTENSIONS
    │ │ │ │  		for (auto const& ext : m_ses_extensions[plugins_all_idx])
    │ │ │ │  		{
    │ │ │ │  			ext->save_state(*eptr);
    │ │ │ │  		}
    │ │ │ │ -
    relevance 2../src/session_impl.cpp:3882make a list for torrents that want to be announced on the DHT so we don't have to loop over all torrents, just to find the ones that want to announce

    make a list for torrents that want to be announced on the DHT so we │ │ │ │ +relevance 2../src/session_impl.cpp:3882make a list for torrents that want to be announced on the DHT so we don't have to loop over all torrents, just to find the ones that want to announce

    make a list for torrents that want to be announced on the DHT so we │ │ │ │ don't have to loop over all torrents, just to find the ones that want to announce

    ../src/session_impl.cpp:3882

    		if (!m_dht_torrents.empty())
    │ │ │ │  		{
    │ │ │ │  			std::shared_ptr<torrent> t;
    │ │ │ │  			do
    │ │ │ │  			{
    │ │ │ │  				t = m_dht_torrents.front().lock();
    │ │ │ │  				m_dht_torrents.pop_front();
    │ │ │ │ @@ -2514,15 +2719,15 @@
    │ │ │ │  
    │ │ │ │  		if (m_next_lsd_torrent >= m_torrents.size())
    │ │ │ │  			m_next_lsd_torrent = 0;
    │ │ │ │  		m_torrents[m_next_lsd_torrent]->lsd_announce();
    │ │ │ │  		++m_next_lsd_torrent;
    │ │ │ │  		if (m_next_lsd_torrent >= m_torrents.size())
    │ │ │ │  			m_next_lsd_torrent = 0;
    │ │ │ │ -
    relevance 2../src/session_impl.cpp:5515this function should be removed and users need to deal with the more generic case of having multiple listen ports

    this function should be removed and users need to deal with the │ │ │ │ +relevance 2../src/session_impl.cpp:5515this function should be removed and users need to deal with the more generic case of having multiple listen ports

    this function should be removed and users need to deal with the │ │ │ │ more generic case of having multiple listen ports

    ../src/session_impl.cpp:5515

    #ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │  		if (!node_list.empty() && nodes.empty())
    │ │ │ │  		{
    │ │ │ │  			session_log("ERROR: failed to parse DHT bootstrap list: %s", node_list.c_str());
    │ │ │ │  		}
    │ │ │ │  #endif
    │ │ │ │  		for (auto const& n : nodes)
    │ │ │ │ @@ -2566,15 +2771,15 @@
    │ │ │ │  		for (auto const& s : m_listen_sockets)
    │ │ │ │  		{
    │ │ │ │  			if (!(s->flags & listen_socket_t::accept_incoming)) continue;
    │ │ │ │  			if (s->ssl == transport::plaintext)
    │ │ │ │  				return std::uint16_t(s->tcp_external_port());
    │ │ │ │  		}
    │ │ │ │  		return 0;
    │ │ │ │ -
    relevance 2../src/session_impl.cpp:5555this function should be removed and users need to deal with the more generic case of having multiple ssl ports

    this function should be removed and users need to deal with the │ │ │ │ +relevance 2../src/session_impl.cpp:5555this function should be removed and users need to deal with the more generic case of having multiple ssl ports

    this function should be removed and users need to deal with the │ │ │ │ more generic case of having multiple ssl ports

    ../src/session_impl.cpp:5555

    				return 0;
    │ │ │ │  
    │ │ │ │  			return std::uint16_t(sock->tcp_external_port());
    │ │ │ │  		}
    │ │ │ │  
    │ │ │ │  #ifdef TORRENT_SSL_PEERS
    │ │ │ │  		for (auto const& s : m_listen_sockets)
    │ │ │ │ @@ -2618,15 +2823,15 @@
    │ │ │ │  #else
    │ │ │ │  		TORRENT_UNUSED(sock);
    │ │ │ │  #endif
    │ │ │ │  		return 0;
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │  	int session_impl::get_listen_port(transport const ssl, aux::listen_socket_handle const& s)
    │ │ │ │ -
    relevance 2../src/session_impl.cpp:6390this should be factored into the udp socket, so we only have the code once

    this should be factored into the udp socket, so we only have the │ │ │ │ +relevance 2../src/session_impl.cpp:6390this should be factored into the udp socket, so we only have the code once

    this should be factored into the udp socket, so we only have the │ │ │ │ code once

    ../src/session_impl.cpp:6390

    		return upload_rate_limit(m_local_peer_class);
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │  	int session_impl::local_download_rate_limit() const
    │ │ │ │  	{
    │ │ │ │  		return download_rate_limit(m_local_peer_class);
    │ │ │ │  	}
    │ │ │ │ @@ -2670,118 +2875,69 @@
    │ │ │ │  
    │ │ │ │  #ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │  				if (should_log())
    │ │ │ │  				{
    │ │ │ │  					session_log(">>> SET_DSCP [ udp (%s %d) value: %x e: %s ]"
    │ │ │ │  						, l->udp_sock->sock.local_endpoint().address().to_string().c_str()
    │ │ │ │  						, l->udp_sock->sock.local_port()
    │ │ │ │ -
    relevance 2../src/udp_tracker_connection.cpp:81support authentication here. tracker_req().auth

    support authentication here. tracker_req().auth

    ../src/udp_tracker_connection.cpp:81

    		udp_tracker_connection::m_connection_cache;
    │ │ │ │ -
    │ │ │ │ -	std::mutex udp_tracker_connection::m_cache_mutex;
    │ │ │ │ -
    │ │ │ │ -	udp_tracker_connection::udp_tracker_connection(
    │ │ │ │ -		io_context& ios
    │ │ │ │ -		, tracker_manager& man
    │ │ │ │ -		, tracker_request const& req
    │ │ │ │ -		, std::weak_ptr<request_callback> c)
    │ │ │ │ -		: tracker_connection(man, req, ios, std::move(c))
    │ │ │ │ -		, m_transaction_id(0)
    │ │ │ │ -		, m_attempts(0)
    │ │ │ │ -		, m_state(action_t::error)
    │ │ │ │ -		, m_abort(false)
    │ │ │ │ -	{
    │ │ │ │ -		update_transaction_id();
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -	void udp_tracker_connection::start()
    │ │ │ │ -	{
    │ │ │ │ -
    std::string hostname; │ │ │ │ -
    std::string protocol; │ │ │ │ - int port; │ │ │ │ - error_code ec; │ │ │ │ - │ │ │ │ - std::tie(protocol, std::ignore, hostname, port, std::ignore) │ │ │ │ - = parse_url_components(tracker_req().url, ec); │ │ │ │ - if (port == -1) port = protocol == "http" ? 80 : 443; │ │ │ │ - │ │ │ │ - if (ec) │ │ │ │ - { │ │ │ │ - tracker_connection::fail(ec, operation_t::parse_address); │ │ │ │ - return; │ │ │ │ - } │ │ │ │ - │ │ │ │ - aux::session_settings const& settings = m_man.settings(); │ │ │ │ - │ │ │ │ - int const proxy_type = settings.get_int(settings_pack::proxy_type); │ │ │ │ - │ │ │ │ - if (settings.get_bool(settings_pack::proxy_hostnames) │ │ │ │ - && (proxy_type == settings_pack::socks5 │ │ │ │ - || proxy_type == settings_pack::socks5_pw)) │ │ │ │ - { │ │ │ │ - m_hostname = hostname; │ │ │ │ - m_target.port(std::uint16_t(port)); │ │ │ │ - start_announce(); │ │ │ │ - } │ │ │ │ - else │ │ │ │ - { │ │ │ │ - using namespace std::placeholders; │ │ │ │ - ADD_OUTSTANDING_ASYNC("udp_tracker_connection::name_lookup"); │ │ │ │ -
    relevance 2../src/alert_manager.cpp:80keep a count of the number of threads waiting. Only if it's > 0 notify them

    keep a count of the number of threads waiting. Only if it's │ │ │ │ -> 0 notify them

    ../src/alert_manager.cpp:80

    			return m_alerts[m_generation].front();
    │ │ │ │ -
    │ │ │ │ -		// this call can be interrupted prematurely by other signals
    │ │ │ │ -		m_condition.wait_for(lock, max_wait);
    │ │ │ │ -		if (!m_alerts[m_generation].empty())
    │ │ │ │ -			return m_alerts[m_generation].front();
    │ │ │ │ +
    relevance 2../src/web_peer_connection.cpp:626just make this peer not have the pieces associated with the file we just requested. Only when it doesn't have any of the file do the following pad files will make it complicated

    just make this peer not have the pieces │ │ │ │ +associated with the file we just requested. Only │ │ │ │ +when it doesn't have any of the file do the following │ │ │ │ +pad files will make it complicated

    ../src/web_peer_connection.cpp:626

    │ │ │ │ +	peer_connection::received_invalid_data(index, single_peer);
    │ │ │ │  
    │ │ │ │ -		return nullptr;
    │ │ │ │ -	}
    │ │ │ │ +	// if we don't think we have any of the files, allow banning the web seed
    │ │ │ │ +	if (num_have_pieces() == 0) return true;
    │ │ │ │  
    │ │ │ │ -	void alert_manager::maybe_notify(alert* a)
    │ │ │ │ -	{
    │ │ │ │ -		if (m_alerts[m_generation].size() == 1)
    │ │ │ │ -		{
    │ │ │ │ -			// we just posted to an empty queue. If anyone is waiting for
    │ │ │ │ -			// alerts, we need to notify them. Also (potentially) call the
    │ │ │ │ -			// user supplied m_notify callback to let the client wake up its
    │ │ │ │ -			// message loop to poll for alerts.
    │ │ │ │ -			if (m_notify) m_notify();
    │ │ │ │ +	// don't disconnect, we won't request anything from this file again
    │ │ │ │ +	return false;
    │ │ │ │ +}
    │ │ │ │  
    │ │ │ │ -
    m_condition.notify_all(); │ │ │ │ -
    } │ │ │ │ +void web_peer_connection::on_receive_padfile() │ │ │ │ +{ │ │ │ │ + handle_padfile(); │ │ │ │ +} │ │ │ │ │ │ │ │ -#ifndef TORRENT_DISABLE_EXTENSIONS │ │ │ │ - for (auto& e : m_ses_extensions) │ │ │ │ - e->on_alert(a); │ │ │ │ -#else │ │ │ │ - TORRENT_UNUSED(a); │ │ │ │ -#endif │ │ │ │ - } │ │ │ │ +void web_peer_connection::handle_error(int const bytes_left) │ │ │ │ +{ │ │ │ │ + std::shared_ptr<torrent> t = associated_torrent().lock(); │ │ │ │ + TORRENT_ASSERT(t); │ │ │ │ │ │ │ │ - void alert_manager::set_notify_function(std::function<void()> const& fun) │ │ │ │ +
    │ │ │ │ +
    // temporarily unavailable, retry later │ │ │ │ + t->retry_web_seed(this, m_parser.header_duration("retry-after")); │ │ │ │ + if (t->alerts().should_post<url_seed_alert>()) │ │ │ │ { │ │ │ │ - std::unique_lock<std::recursive_mutex> lock(m_mutex); │ │ │ │ - m_notify = fun; │ │ │ │ - if (!m_alerts[m_generation].empty()) │ │ │ │ - { │ │ │ │ - if (m_notify) m_notify(); │ │ │ │ - } │ │ │ │ + std::string const error_msg = to_string(m_parser.status_code()).data() │ │ │ │ + + (" " + m_parser.message()); │ │ │ │ + t->alerts().emplace_alert<url_seed_alert>(t->get_handle(), m_url │ │ │ │ + , error_msg); │ │ │ │ } │ │ │ │ + received_bytes(0, bytes_left); │ │ │ │ + disconnect(error_code(m_parser.status_code(), http_category()), operation_t::bittorrent, failure); │ │ │ │ +} │ │ │ │ │ │ │ │ -#ifndef TORRENT_DISABLE_EXTENSIONS │ │ │ │ - void alert_manager::add_extension(std::shared_ptr<plugin> ext) │ │ │ │ +void web_peer_connection::disable(error_code const& ec) │ │ │ │ +{ │ │ │ │ + // we should not try this server again. │ │ │ │ + m_web->disabled = true; │ │ │ │ + disconnect(ec, operation_t::bittorrent, peer_error); │ │ │ │ + if (m_web->ephemeral) │ │ │ │ { │ │ │ │ - m_ses_extensions.push_back(std::move(ext)); │ │ │ │ + std::shared_ptr<torrent> t = associated_torrent().lock(); │ │ │ │ + TORRENT_ASSERT(t); │ │ │ │ + t->remove_web_seed_conn(this); │ │ │ │ } │ │ │ │ -#endif │ │ │ │ + m_web = nullptr; │ │ │ │ + TORRENT_ASSERT(is_disconnecting()); │ │ │ │ +} │ │ │ │ │ │ │ │ - void alert_manager::get_all(std::vector<alert*>& alerts) │ │ │ │ - { │ │ │ │ - std::lock_guard<std::recursive_mutex> lock(m_mutex); │ │ │ │ -
    relevance 2../src/instantiate_connection.cpp:44peer_connection and tracker_connection should probably be flags

    peer_connection and tracker_connection should probably be flags

    ../src/instantiate_connection.cpp:44

    ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
    │ │ │ │ +void web_peer_connection::handle_redirect(int const bytes_left)
    │ │ │ │ +{
    │ │ │ │ +
    relevance 2../src/instantiate_connection.cpp:44peer_connection and tracker_connection should probably be flags

    peer_connection and tracker_connection should probably be flags

    ../src/instantiate_connection.cpp:44

    ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
    │ │ │ │  LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
    │ │ │ │  CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
    │ │ │ │  SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
    │ │ │ │  INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
    │ │ │ │  CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    │ │ │ │  ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    │ │ │ │  POSSIBILITY OF SUCH DAMAGE.
    │ │ │ │ @@ -2824,67 +2980,117 @@
    │ │ │ │  				s.set_impl(sm->new_utp_socket(&s));
    │ │ │ │  				return socket_type(std::move(s));
    │ │ │ │  			}
    │ │ │ │  		}
    │ │ │ │  #if TORRENT_USE_I2P
    │ │ │ │  		else if (ps.type == settings_pack::i2p_proxy)
    │ │ │ │  		{
    │ │ │ │ -
    relevance 2../src/alert.cpp:2021the salt here is allocated on the heap. It would be nice to allocate in the stack_allocator

    the salt here is allocated on the heap. It would be nice to │ │ │ │ -allocate in the stack_allocator

    ../src/alert.cpp:2021

    	}
    │ │ │ │ -
    │ │ │ │ -	dht_immutable_item_alert::dht_immutable_item_alert(aux::stack_allocator&
    │ │ │ │ -		, sha1_hash const& t, entry i)
    │ │ │ │ -		: target(t), item(std::move(i))
    │ │ │ │ -	{}
    │ │ │ │ +
    relevance 2../src/path.cpp:429test this on a FAT volume to see what error we get!

    test this on a FAT volume to see what error we get!

    ../src/path.cpp:429

    			// it's possible CreateHardLink will copy the file internally too,
    │ │ │ │ +			// if the filesystem does not support it.
    │ │ │ │ +			ec.assign(GetLastError(), system_category());
    │ │ │ │ +			return;
    │ │ │ │ +		}
    │ │ │ │  
    │ │ │ │ -	std::string dht_immutable_item_alert::message() const
    │ │ │ │ -	{
    │ │ │ │ -#ifdef TORRENT_DISABLE_ALERT_MSG
    │ │ │ │ -		return {};
    │ │ │ │ +		// fall back to making a copy
    │ │ │ │ +#endif
    │ │ │ │  #else
    │ │ │ │ -		char msg[1050];
    │ │ │ │ -		std::snprintf(msg, sizeof(msg), "DHT immutable item %s [ %s ]"
    │ │ │ │ -			, aux::to_hex(target).c_str()
    │ │ │ │ -			, item.to_string().c_str());
    │ │ │ │ -		return msg;
    │ │ │ │ +		// assume posix's link() function exists
    │ │ │ │ +		int ret = ::link(n_exist.c_str(), n_link.c_str());
    │ │ │ │ +
    │ │ │ │ +		if (ret == 0)
    │ │ │ │ +		{
    │ │ │ │ +			ec.clear();
    │ │ │ │ +			return;
    │ │ │ │ +		}
    │ │ │ │ +
    │ │ │ │ +		// most errors are passed through, except for the ones that indicate that
    │ │ │ │ +		// hard links are not supported and require a copy.
    │ │ │ │ +
    if (errno != EMLINK │ │ │ │ +
    && errno != EXDEV │ │ │ │ +#ifdef TORRENT_BEOS │ │ │ │ + // haiku returns EPERM when the filesystem doesn't support hard link │ │ │ │ + && errno != EPERM │ │ │ │ #endif │ │ │ │ - } │ │ │ │ + ) │ │ │ │ + { │ │ │ │ + // some error happened, report up to the caller │ │ │ │ + ec.assign(errno, system_category()); │ │ │ │ + return; │ │ │ │ + } │ │ │ │ │ │ │ │ -
    dht_mutable_item_alert::dht_mutable_item_alert(aux::stack_allocator& │ │ │ │ -
    , std::array<char, 32> const& k │ │ │ │ - , std::array<char, 64> const& sig │ │ │ │ - , std::int64_t sequence │ │ │ │ - , string_view s │ │ │ │ - , entry i │ │ │ │ - , bool a) │ │ │ │ - : key(k), signature(sig), seq(sequence), salt(s), item(std::move(i)), authoritative(a) │ │ │ │ - {} │ │ │ │ + // fall back to making a copy │ │ │ │ │ │ │ │ - std::string dht_mutable_item_alert::message() const │ │ │ │ - { │ │ │ │ -#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ - return {}; │ │ │ │ -#else │ │ │ │ - char msg[1050]; │ │ │ │ - std::snprintf(msg, sizeof(msg), "DHT mutable item (key=%s salt=%s seq=%" PRId64 " %s) [ %s ]" │ │ │ │ - , aux::to_hex(key).c_str() │ │ │ │ - , salt.c_str() │ │ │ │ - , seq │ │ │ │ - , authoritative ? "auth" : "non-auth" │ │ │ │ - , item.to_string().c_str()); │ │ │ │ - return msg; │ │ │ │ #endif │ │ │ │ + │ │ │ │ + // if we get here, we should copy the file │ │ │ │ + storage_error se; │ │ │ │ + aux::copy_file(file, link, se); │ │ │ │ + ec = se.ec; │ │ │ │ } │ │ │ │ │ │ │ │ - dht_put_alert::dht_put_alert(aux::stack_allocator&, sha1_hash const& t, int n) │ │ │ │ - : target(t) │ │ │ │ - , public_key() │ │ │ │ - , signature() │ │ │ │ - , salt() │ │ │ │ -
    relevance 2../src/storage_utils.cpp:294technically, this is where the transaction of moving the files is completed. This is where the new save_path should be committed. If there is an error in the code below, that should not prevent the new save path to be set. Maybe it would make sense to make the save_path an in-out parameter

    technically, this is where the transaction of moving the files │ │ │ │ + bool is_directory(std::string const& f, error_code& ec) │ │ │ │ + { │ │ │ │ + ec.clear(); │ │ │ │ + error_code e; │ │ │ │ + file_status s; │ │ │ │ + stat_file(f, &s, e); │ │ │ │ + if (!e && s.mode & file_status::directory) return true; │ │ │ │ + ec = e; │ │ │ │ +relevance 2../src/bdecode.cpp:826attempt to simplify this implementation by embracing the span

    attempt to simplify this implementation by embracing the span

    ../src/bdecode.cpp:826

    	}
    │ │ │ │ +
    │ │ │ │ +	bdecode_node bdecode(span<char const> buffer
    │ │ │ │ +		, error_code& ec, int* error_pos, int depth_limit, int token_limit)
    │ │ │ │ +	{
    │ │ │ │ +		bdecode_node ret;
    │ │ │ │ +		ec.clear();
    │ │ │ │ +
    │ │ │ │ +		if (buffer.size() > bdecode_token::max_offset)
    │ │ │ │ +		{
    │ │ │ │ +			if (error_pos) *error_pos = 0;
    │ │ │ │ +			ec = bdecode_errors::limit_exceeded;
    │ │ │ │ +			return ret;
    │ │ │ │ +		}
    │ │ │ │ +
    │ │ │ │ +		// this is the stack of bdecode_token indices, into m_tokens.
    │ │ │ │ +		// sp is the stack pointer, as index into the array, stack
    │ │ │ │ +		int sp = 0;
    │ │ │ │ +		TORRENT_ALLOCA(stack, stack_frame, depth_limit);
    │ │ │ │ +
    │ │ │ │ +
    char const* start = buffer.data(); │ │ │ │ +
    char const* end = start + buffer.size(); │ │ │ │ + char const* const orig_start = start; │ │ │ │ + │ │ │ │ + if (start == end) │ │ │ │ + TORRENT_FAIL_BDECODE(bdecode_errors::unexpected_eof); │ │ │ │ + │ │ │ │ + while (start <= end) │ │ │ │ + { │ │ │ │ + if (start >= end) TORRENT_FAIL_BDECODE(bdecode_errors::unexpected_eof); │ │ │ │ + │ │ │ │ + if (sp >= depth_limit) │ │ │ │ + TORRENT_FAIL_BDECODE(bdecode_errors::depth_exceeded); │ │ │ │ + │ │ │ │ + --token_limit; │ │ │ │ + if (token_limit < 0) │ │ │ │ + TORRENT_FAIL_BDECODE(bdecode_errors::limit_exceeded); │ │ │ │ + │ │ │ │ + // look for a new token │ │ │ │ + char const t = *start; │ │ │ │ + │ │ │ │ + int const current_frame = sp; │ │ │ │ + │ │ │ │ + // if we're currently parsing a dictionary, assert that │ │ │ │ + // every other node is a string. │ │ │ │ + if (current_frame > 0 │ │ │ │ + && ret.m_tokens[stack[current_frame - 1].token].type == bdecode_token::dict) │ │ │ │ + { │ │ │ │ + if (stack[current_frame - 1].state == 0) │ │ │ │ + { │ │ │ │ + // the current parent is a dict and we are parsing a key. │ │ │ │ +
    relevance 2../src/storage_utils.cpp:294technically, this is where the transaction of moving the files is completed. This is where the new save_path should be committed. If there is an error in the code below, that should not prevent the new save path to be set. Maybe it would make sense to make the save_path an in-out parameter

    technically, this is where the transaction of moving the files │ │ │ │ is completed. This is where the new save_path should be committed. If │ │ │ │ there is an error in the code below, that should not prevent the new │ │ │ │ save path to be set. Maybe it would make sense to make the save_path │ │ │ │ an in-out parameter

    ../src/storage_utils.cpp:294

    			while (--file_index >= file_index_t(0))
    │ │ │ │  			{
    │ │ │ │  				// files moved out to absolute paths are not moved
    │ │ │ │  				if (f.file_absolute_path(file_index)) continue;
    │ │ │ │ @@ -2931,15 +3137,15 @@
    │ │ │ │  		{
    │ │ │ │  			error_code err;
    │ │ │ │  			std::string subdir = combine_path(save_path, s);
    │ │ │ │  
    │ │ │ │  			while (!path_equal(subdir, save_path) && !err)
    │ │ │ │  			{
    │ │ │ │  				remove(subdir, err);
    │ │ │ │ -
    relevance 2../src/storage_utils.cpp:486is this risky? The upper layer will assume we have the whole file. Perhaps we should verify that at least the size of the file is correct

    is this risky? The upper layer will assume we have the │ │ │ │ +relevance 2../src/storage_utils.cpp:486is this risky? The upper layer will assume we have the whole file. Perhaps we should verify that at least the size of the file is correct

    is this risky? The upper layer will assume we have the │ │ │ │ whole file. Perhaps we should verify that at least the size │ │ │ │ of the file is correct

    ../src/storage_utils.cpp:486

    				{
    │ │ │ │  					// we create directories lazily, so it's possible it hasn't
    │ │ │ │  					// been created yet. Create the directories now and try
    │ │ │ │  					// again
    │ │ │ │  					create_directories(parent_path(file_path), err);
    │ │ │ │  
    │ │ │ │ @@ -2984,15 +3190,119 @@
    │ │ │ │  				// expected location, but is likely to be in a partfile. Just exempt it
    │ │ │ │  				// from checking
    │ │ │ │  				if (file_index < file_priority.end_index()
    │ │ │ │  					&& file_priority[file_index] == dont_download
    │ │ │ │  					&& !(rd.flags & torrent_flags::seed_mode))
    │ │ │ │  					continue;
    │ │ │ │  
    │ │ │ │ -
    relevance 2../src/escape_string.cpp:194this should probably be moved into string_util.cpp

    this should probably be moved into string_util.cpp

    ../src/escape_string.cpp:194

    	{
    │ │ │ │ +
    relevance 2../src/peer_list.cpp:539it would be nice if there was a way to iterate over these torrent_peer objects in the order they are allocated in the pool instead. It would probably be more efficient

    it would be nice if there was a way to iterate over these │ │ │ │ +torrent_peer objects in the order they are allocated in the pool │ │ │ │ +instead. It would probably be more efficient

    ../src/peer_list.cpp:539

    		, int session_time, torrent_state* state)
    │ │ │ │ +	{
    │ │ │ │ +		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ +		INVARIANT_CHECK;
    │ │ │ │ +
    │ │ │ │ +		const int candidate_count = 10;
    │ │ │ │ +		peers.reserve(candidate_count);
    │ │ │ │ +
    │ │ │ │ +		int erase_candidate = -1;
    │ │ │ │ +
    │ │ │ │ +		if (bool(m_finished) != state->is_finished)
    │ │ │ │ +			recalculate_connect_candidates(state);
    │ │ │ │ +
    │ │ │ │ +		external_ip const& external = state->ip;
    │ │ │ │ +		int external_port = state->port;
    │ │ │ │ +
    │ │ │ │ +		if (m_round_robin >= int(m_peers.size())) m_round_robin = 0;
    │ │ │ │ +
    │ │ │ │ +		int max_peerlist_size = state->max_peerlist_size;
    │ │ │ │ +
    │ │ │ │ +
    for (int iterations = std::min(int(m_peers.size()), 300); │ │ │ │ +
    iterations > 0; --iterations) │ │ │ │ + { │ │ │ │ + ++state->loop_counter; │ │ │ │ + │ │ │ │ + if (m_round_robin >= int(m_peers.size())) m_round_robin = 0; │ │ │ │ + │ │ │ │ + torrent_peer& pe = *m_peers[m_round_robin]; │ │ │ │ + TORRENT_ASSERT(pe.in_use); │ │ │ │ + int current = m_round_robin; │ │ │ │ + │ │ │ │ + // if the number of peers is growing large │ │ │ │ + // we need to start weeding. │ │ │ │ + │ │ │ │ + if (int(m_peers.size()) >= max_peerlist_size * 0.95 │ │ │ │ + && max_peerlist_size > 0) │ │ │ │ + { │ │ │ │ + if (is_erase_candidate(pe) │ │ │ │ + && (erase_candidate == -1 │ │ │ │ + || !compare_peer_erase(*m_peers[erase_candidate], pe))) │ │ │ │ + { │ │ │ │ + if (should_erase_immediately(pe)) │ │ │ │ + { │ │ │ │ + if (erase_candidate > current) --erase_candidate; │ │ │ │ + erase_peer(m_peers.begin() + current, state); │ │ │ │ + continue; │ │ │ │ + } │ │ │ │ + else │ │ │ │ + { │ │ │ │ + erase_candidate = current; │ │ │ │ + } │ │ │ │ +
    relevance 2../src/tracker_manager.cpp:369implement

    implement

    ../src/tracker_manager.cpp:369

    #ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ +			if (m_ses.should_log())
    │ │ │ │ +			{
    │ │ │ │ +				m_ses.session_log("incoming UDP tracker packet from %s has invalid "
    │ │ │ │ +					"transaction ID (%x)", print_endpoint(ep).c_str()
    │ │ │ │ +					, transaction);
    │ │ │ │ +			}
    │ │ │ │ +#endif
    │ │ │ │ +			return false;
    │ │ │ │ +		}
    │ │ │ │ +
    │ │ │ │ +		std::shared_ptr<udp_tracker_connection> const p = i->second;
    │ │ │ │ +		// on_receive() may remove the tracker connection from the list
    │ │ │ │ +		return p->on_receive(ep, buf);
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +	void tracker_manager::incoming_error(error_code const&
    │ │ │ │ +		, udp::endpoint const&)
    │ │ │ │ +	{
    │ │ │ │ +		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ +
    } │ │ │ │ +
    │ │ │ │ + bool tracker_manager::incoming_packet(string_view const hostname │ │ │ │ + , span<char const> const buf) │ │ │ │ + { │ │ │ │ + TORRENT_ASSERT(is_single_thread()); │ │ │ │ + // ignore packets smaller than 8 bytes │ │ │ │ + if (buf.size() < 16) return false; │ │ │ │ + │ │ │ │ + // the first word is the action, if it's not [0, 3] │ │ │ │ + // it's not a valid udp tracker response │ │ │ │ + span<const char> ptr = buf; │ │ │ │ + std::uint32_t const action = aux::read_uint32(ptr); │ │ │ │ + if (action > 3) return false; │ │ │ │ + │ │ │ │ + std::uint32_t const transaction = aux::read_uint32(ptr); │ │ │ │ + auto const i = m_udp_conns.find(transaction); │ │ │ │ + │ │ │ │ + if (i == m_udp_conns.end()) │ │ │ │ + { │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + // now, this may not have been meant to be a tracker response, │ │ │ │ + // but chances are pretty good, so it's probably worth logging │ │ │ │ + m_ses.session_log("incoming UDP tracker packet from %s has invalid " │ │ │ │ + "transaction ID (%x)", std::string(hostname).c_str(), int(transaction)); │ │ │ │ +#endif │ │ │ │ + return false; │ │ │ │ + } │ │ │ │ + │ │ │ │ + std::shared_ptr<udp_tracker_connection> const p = i->second; │ │ │ │ + // on_receive() may remove the tracker connection from the list │ │ │ │ +
    relevance 2../src/escape_string.cpp:194this should probably be moved into string_util.cpp

    this should probably be moved into string_util.cpp

    ../src/escape_string.cpp:194

    	{
    │ │ │ │  		return escape_string_impl(str.data(), int(str.size()), 10);
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │  	bool need_encoding(char const* str, int const len)
    │ │ │ │  	{
    │ │ │ │  		for (int i = 0; i < len; ++i)
    │ │ │ │  		{
    │ │ │ │ @@ -3035,229 +3345,67 @@
    │ │ │ │  		if (!need_encoding(path.c_str(), int(path.size())))
    │ │ │ │  			return url;
    │ │ │ │  
    │ │ │ │  		std::string msg;
    │ │ │ │  		std::string escaped_path { escape_path(path) };
    │ │ │ │  		// reserve enough space so further append will
    │ │ │ │  		// only copy values to existing location
    │ │ │ │ -
    relevance 2../src/peer_connection.cpp:2562this should probably be based on time instead of number of request messages. For a very high throughput connection, 300 may be a legitimate number of requests to have in flight when getting choked

    this should probably be based on time instead of number │ │ │ │ -of request messages. For a very high throughput connection, 300 │ │ │ │ -may be a legitimate number of requests to have in flight when │ │ │ │ -getting choked

    ../src/peer_connection.cpp:2562

    			}
    │ │ │ │ -#endif
    │ │ │ │ -
    │ │ │ │ -			write_reject_request(r);
    │ │ │ │ -			if (m_num_invalid_requests < std::numeric_limits<decltype(m_num_invalid_requests)>::max())
    │ │ │ │ -				++m_num_invalid_requests;
    │ │ │ │ -
    │ │ │ │ -			if (t->alerts().should_post<invalid_request_alert>())
    │ │ │ │ -			{
    │ │ │ │ -				// msvc 12 appears to deduce the rvalue reference template
    │ │ │ │ -				// incorrectly for bool temporaries. So, create a dummy instance
    │ │ │ │ -				bool const peer_interested = bool(m_peer_interested);
    │ │ │ │ -				t->alerts().emplace_alert<invalid_request_alert>(
    │ │ │ │ -					t->get_handle(), m_remote, m_peer_id, r
    │ │ │ │ -					, t->user_have_piece(r.piece), peer_interested, false);
    │ │ │ │ -			}
    │ │ │ │ -
    │ │ │ │ -			// every ten invalid request, remind the peer that it's choked
    │ │ │ │ -			if (!m_peer_interested && m_num_invalid_requests % 10 == 0 && m_choked)
    │ │ │ │ +
    relevance 2../src/http_tracker_connection.cpp:479returning a bool here is redundant. Instead this function should return the peer_entry

    returning a bool here is redundant. Instead this function should │ │ │ │ +return the peer_entry

    ../src/http_tracker_connection.cpp:479

    		{
    │ │ │ │ +			cb->tracker_scrape_response(tracker_req(), resp.complete
    │ │ │ │ +				, resp.incomplete, resp.downloaded, resp.downloaders);
    │ │ │ │ +		}
    │ │ │ │ +		else
    │ │ │ │ +		{
    │ │ │ │ +			std::list<address> ip_list;
    │ │ │ │ +			if (m_tracker_connection)
    │ │ │ │  			{
    │ │ │ │ -
    if (m_num_invalid_requests > 300 && !m_peer_choked │ │ │ │ -
    && can_disconnect(errors::too_many_requests_when_choked)) │ │ │ │ + for (auto const& endp : m_tracker_connection->endpoints()) │ │ │ │ { │ │ │ │ - disconnect(errors::too_many_requests_when_choked, operation_t::bittorrent, peer_error); │ │ │ │ - return; │ │ │ │ + ip_list.push_back(endp.address()); │ │ │ │ } │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - peer_log(peer_log_alert::outgoing_message, "CHOKE"); │ │ │ │ -#endif │ │ │ │ - write_choke(); │ │ │ │ } │ │ │ │ │ │ │ │ - return; │ │ │ │ + cb->tracker_response(tracker_req(), m_tracker_ip, ip_list, resp); │ │ │ │ } │ │ │ │ + close(); │ │ │ │ + } │ │ │ │ │ │ │ │ - // if we have choked the client │ │ │ │ - // ignore the request │ │ │ │ - int const blocks_per_piece = │ │ │ │ - (ti.piece_length() + t->block_size() - 1) / t->block_size(); │ │ │ │ - │ │ │ │ - // disconnect peers that downloads more than foo times an allowed │ │ │ │ - // fast piece │ │ │ │ - if (m_choked && fast_idx != -1 && m_accept_fast_piece_cnt[fast_idx] >= 3 * blocks_per_piece │ │ │ │ - && can_disconnect(errors::too_many_requests_when_choked)) │ │ │ │ +
    bool extract_peer_info(bdecode_node const& info, peer_entry& ret, error_code& ec) │ │ │ │ +
    { │ │ │ │ + // extract peer id (if any) │ │ │ │ + if (info.type() != bdecode_node::dict_t) │ │ │ │ { │ │ │ │ - disconnect(errors::too_many_requests_when_choked, operation_t::bittorrent, peer_error); │ │ │ │ - return; │ │ │ │ + ec = errors::invalid_peer_dict; │ │ │ │ + return false; │ │ │ │ } │ │ │ │ - │ │ │ │ - if (m_choked && fast_idx == -1) │ │ │ │ - { │ │ │ │ -
    relevance 2../src/peer_connection.cpp:3309since we throw away the queue entry once we issue the disk job, this may happen. Instead, we should keep the queue entry around, mark it as having been requested from disk and once the disk job comes back, discard it if it has been cancelled. Maybe even be able to cancel disk jobs?

    since we throw away the queue entry once we issue │ │ │ │ -the disk job, this may happen. Instead, we should keep the │ │ │ │ -queue entry around, mark it as having been requested from │ │ │ │ -disk and once the disk job comes back, discard it if it has │ │ │ │ -been cancelled. Maybe even be able to cancel disk jobs?

    ../src/peer_connection.cpp:3309

    │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -		peer_log(peer_log_alert::incoming_message, "CANCEL"
    │ │ │ │ -			, "piece: %d s: %x l: %x", static_cast<int>(r.piece), r.start, r.length);
    │ │ │ │ -#endif
    │ │ │ │ -
    │ │ │ │ -		auto const i = std::find(m_requests.begin(), m_requests.end(), r);
    │ │ │ │ -
    │ │ │ │ -		if (i != m_requests.end())
    │ │ │ │ +		bdecode_node i = info.dict_find_string("peer id");
    │ │ │ │ +		if (i && i.string_length() == 20)
    │ │ │ │  		{
    │ │ │ │ -			m_counters.inc_stats_counter(counters::cancelled_piece_requests);
    │ │ │ │ -			m_requests.erase(i);
    │ │ │ │ -
    │ │ │ │ -			if (m_requests.empty())
    │ │ │ │ -				m_counters.inc_stats_counter(counters::num_peers_up_requests, -1);
    │ │ │ │ -
    │ │ │ │ -			write_reject_request(r);
    │ │ │ │ +			std::copy(i.string_ptr(), i.string_ptr() + 20, ret.pid.begin());
    │ │ │ │  		}
    │ │ │ │  		else
    │ │ │ │  		{
    │ │ │ │ -
    #ifndef TORRENT_DISABLE_LOGGING │ │ │ │ -
    peer_log(peer_log_alert::info, "INVALID_CANCEL", "got cancel not in the queue"); │ │ │ │ -#endif │ │ │ │ - } │ │ │ │ - } │ │ │ │ - │ │ │ │ - // ----------------------------- │ │ │ │ - // --------- DHT PORT ---------- │ │ │ │ - // ----------------------------- │ │ │ │ - │ │ │ │ - void peer_connection::incoming_dht_port(int const listen_port) │ │ │ │ - { │ │ │ │ - TORRENT_ASSERT(is_single_thread()); │ │ │ │ - INVARIANT_CHECK; │ │ │ │ - │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - peer_log(peer_log_alert::incoming_message, "DHT_PORT", "p: %d", listen_port); │ │ │ │ -#endif │ │ │ │ -#ifndef TORRENT_DISABLE_DHT │ │ │ │ - m_ses.add_dht_node({m_remote.address(), std::uint16_t(listen_port)}); │ │ │ │ -#else │ │ │ │ - TORRENT_UNUSED(listen_port); │ │ │ │ -#endif │ │ │ │ - } │ │ │ │ - │ │ │ │ - // ----------------------------- │ │ │ │ - // --------- HAVE ALL ---------- │ │ │ │ - // ----------------------------- │ │ │ │ - │ │ │ │ - void peer_connection::incoming_have_all() │ │ │ │ - { │ │ │ │ -
    relevance 2../src/peer_connection.cpp:4975use a deadline_timer for timeouts. Don't rely on second_tick()! Hook this up to connect timeout as well. This would improve performance because of less work in second_tick(), and might let use remove ticking entirely eventually

    use a deadline_timer for timeouts. Don't rely on second_tick()! │ │ │ │ -Hook this up to connect timeout as well. This would improve performance │ │ │ │ -because of less work in second_tick(), and might let use remove ticking │ │ │ │ -entirely eventually

    ../src/peer_connection.cpp:4975

    			if (d > seconds(connect_timeout)
    │ │ │ │ -				&& can_disconnect(errors::timed_out))
    │ │ │ │ -			{
    │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -				peer_log(peer_log_alert::info, "CONNECT_FAILED", "waited %d seconds"
    │ │ │ │ -					, int(total_seconds(d)));
    │ │ │ │ -#endif
    │ │ │ │ -				connect_failed(errors::timed_out);
    │ │ │ │ -				return;
    │ │ │ │ -			}
    │ │ │ │ -		}
    │ │ │ │ -
    │ │ │ │ -		// if the bw_network flag isn't set, it means we are not even trying to
    │ │ │ │ -		// read from this peer's socket. Most likely because we're applying a
    │ │ │ │ -		// rate limit. If the peer is "slow" because we are rate limiting it,
    │ │ │ │ -		// don't enforce timeouts. However, as soon as we *do* read from the
    │ │ │ │ -		// socket, we expect to receive data, and not have timed out. Then we
    │ │ │ │ -		// can enforce the timeouts.
    │ │ │ │ -		bool const reading_socket = bool(m_channel_state[download_channel] & peer_info::bw_network);
    │ │ │ │ -
    │ │ │ │ -
    if (reading_socket && d > seconds(timeout()) && !m_connecting && m_reading_bytes == 0 │ │ │ │ -
    && can_disconnect(errors::timed_out_inactivity)) │ │ │ │ - { │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - peer_log(peer_log_alert::info, "LAST_ACTIVITY", "%d seconds ago" │ │ │ │ - , int(total_seconds(d))); │ │ │ │ -#endif │ │ │ │ - disconnect(errors::timed_out_inactivity, operation_t::bittorrent); │ │ │ │ - return; │ │ │ │ - } │ │ │ │ - │ │ │ │ - // do not stall waiting for a handshake │ │ │ │ - int timeout = m_settings.get_int (settings_pack::handshake_timeout); │ │ │ │ -#if TORRENT_USE_I2P │ │ │ │ - timeout *= is_i2p(m_socket) ? 4 : 1; │ │ │ │ -#endif │ │ │ │ - if (reading_socket │ │ │ │ - && !m_connecting │ │ │ │ - && in_handshake() │ │ │ │ - && d > seconds(timeout)) │ │ │ │ - { │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - peer_log(peer_log_alert::info, "NO_HANDSHAKE", "waited %d seconds" │ │ │ │ - , int(total_seconds(d))); │ │ │ │ -#endif │ │ │ │ - disconnect(errors::timed_out_no_handshake, operation_t::bittorrent); │ │ │ │ - return; │ │ │ │ - } │ │ │ │ - │ │ │ │ - // disconnect peers that we unchoked, but they didn't send a request in │ │ │ │ - // the last 60 seconds, and we haven't been working on servicing a request │ │ │ │ -
    relevance 2../src/tracker_manager.cpp:369implement

    implement

    ../src/tracker_manager.cpp:369

    #ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -			if (m_ses.should_log())
    │ │ │ │ -			{
    │ │ │ │ -				m_ses.session_log("incoming UDP tracker packet from %s has invalid "
    │ │ │ │ -					"transaction ID (%x)", print_endpoint(ep).c_str()
    │ │ │ │ -					, transaction);
    │ │ │ │ -			}
    │ │ │ │ -#endif
    │ │ │ │ -			return false;
    │ │ │ │ +			// if there's no peer_id, just initialize it to a bunch of zeroes
    │ │ │ │ +			ret.pid.clear();
    │ │ │ │  		}
    │ │ │ │  
    │ │ │ │ -		std::shared_ptr<udp_tracker_connection> const p = i->second;
    │ │ │ │ -		// on_receive() may remove the tracker connection from the list
    │ │ │ │ -		return p->on_receive(ep, buf);
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -	void tracker_manager::incoming_error(error_code const&
    │ │ │ │ -		, udp::endpoint const&)
    │ │ │ │ -	{
    │ │ │ │ -		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ -
    } │ │ │ │ -
    │ │ │ │ - bool tracker_manager::incoming_packet(string_view const hostname │ │ │ │ - , span<char const> const buf) │ │ │ │ - { │ │ │ │ - TORRENT_ASSERT(is_single_thread()); │ │ │ │ - // ignore packets smaller than 8 bytes │ │ │ │ - if (buf.size() < 16) return false; │ │ │ │ - │ │ │ │ - // the first word is the action, if it's not [0, 3] │ │ │ │ - // it's not a valid udp tracker response │ │ │ │ - span<const char> ptr = buf; │ │ │ │ - std::uint32_t const action = aux::read_uint32(ptr); │ │ │ │ - if (action > 3) return false; │ │ │ │ - │ │ │ │ - std::uint32_t const transaction = aux::read_uint32(ptr); │ │ │ │ - auto const i = m_udp_conns.find(transaction); │ │ │ │ - │ │ │ │ - if (i == m_udp_conns.end()) │ │ │ │ + // extract ip │ │ │ │ + i = info.dict_find_string("ip"); │ │ │ │ + if (!i) │ │ │ │ { │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - // now, this may not have been meant to be a tracker response, │ │ │ │ - // but chances are pretty good, so it's probably worth logging │ │ │ │ - m_ses.session_log("incoming UDP tracker packet from %s has invalid " │ │ │ │ - "transaction ID (%x)", std::string(hostname).c_str(), int(transaction)); │ │ │ │ -#endif │ │ │ │ + ec = errors::invalid_tracker_response; │ │ │ │ return false; │ │ │ │ } │ │ │ │ + ret.hostname = i.string_value().to_string(); │ │ │ │ │ │ │ │ - std::shared_ptr<udp_tracker_connection> const p = i->second; │ │ │ │ - // on_receive() may remove the tracker connection from the list │ │ │ │ -
    relevance 2../src/piece_picker.cpp:1996make the 2048 limit configurable

    make the 2048 limit configurable

    ../src/piece_picker.cpp:1996

    	// indicating which path thought the picker we took to arrive at the
    │ │ │ │ +		// extract port
    │ │ │ │ +		i = info.dict_find_int("port");
    │ │ │ │ +		if (!i)
    │ │ │ │ +
    relevance 2../src/piece_picker.cpp:1996make the 2048 limit configurable

    make the 2048 limit configurable

    ../src/piece_picker.cpp:1996

    	// indicating which path thought the picker we took to arrive at the
    │ │ │ │  	// returned block picks.
    │ │ │ │  	picker_flags_t piece_picker::pick_pieces(typed_bitfield<piece_index_t> const& pieces
    │ │ │ │  		, std::vector<piece_block>& interesting_blocks, int num_blocks
    │ │ │ │  		, int prefer_contiguous_blocks, torrent_peer* peer
    │ │ │ │  		, picker_options_t options, std::vector<piece_index_t> const& suggested_pieces
    │ │ │ │  		, int num_peers
    │ │ │ │  		, counters& pc
    │ │ │ │ @@ -3300,15 +3448,15 @@
    │ │ │ │  		TORRENT_ASSERT(!m_priority_boundaries.empty() || m_dirty);
    │ │ │ │  
    │ │ │ │  		// this will be filled with blocks that we should not request
    │ │ │ │  		// unless we can't find num_blocks among the other ones.
    │ │ │ │  		std::vector<piece_block> backup_blocks;
    │ │ │ │  		std::vector<piece_block> backup_blocks2;
    │ │ │ │  		std::vector<piece_index_t> ignored_pieces;
    │ │ │ │ -
    relevance 2../src/piece_picker.cpp:2594the first_block returned here is the largest free range, not the first-fit range, which would be better

    the first_block returned here is the largest free range, not │ │ │ │ +relevance 2../src/piece_picker.cpp:2594the first_block returned here is the largest free range, not the first-fit range, which would be better

    the first_block returned here is the largest free range, not │ │ │ │ the first-fit range, which would be better

    ../src/piece_picker.cpp:2594

    	{
    │ │ │ │  		for (auto const& b : m_block_info)
    │ │ │ │  		{
    │ │ │ │  			TORRENT_ASSERT(b.peer == nullptr || static_cast<torrent_peer*>(b.peer)->in_use);
    │ │ │ │  		}
    │ │ │ │  	}
    │ │ │ │  #endif
    │ │ │ │ @@ -3352,15 +3500,15 @@
    │ │ │ │  			}
    │ │ │ │  			contiguous_blocks = 0;
    │ │ │ │  			if (info.peer != peer)
    │ │ │ │  			{
    │ │ │ │  				exclusive = false;
    │ │ │ │  				if (info.state == piece_picker::block_info::state_requested
    │ │ │ │  					&& info.peer != nullptr)
    │ │ │ │ -
    relevance 2../src/piece_picker.cpp:3478it would be nice if this could be folded into lock_piece() the main distinction is that this also maintains the m_num_have counter and the passed_hash_check member Is there ever a case where we call write failed without also locking the piece? Perhaps write_failed() should imply locking it.

    it would be nice if this could be folded into lock_piece() │ │ │ │ +relevance 2../src/piece_picker.cpp:3478it would be nice if this could be folded into lock_piece() the main distinction is that this also maintains the m_num_have counter and the passed_hash_check member Is there ever a case where we call write failed without also locking the piece? Perhaps write_failed() should imply locking it.

    it would be nice if this could be folded into lock_piece() │ │ │ │ the main distinction is that this also maintains the m_num_have │ │ │ │ counter and the passed_hash_check member │ │ │ │ Is there ever a case where we call write failed without also locking │ │ │ │ the piece? Perhaps write_failed() should imply locking it.

    ../src/piece_picker.cpp:3478

    │ │ │ │  		auto const state = m_piece_map[piece].download_queue();
    │ │ │ │  		if (state == piece_pos::piece_open) return;
    │ │ │ │  		auto const i = find_dl_piece(state, piece);
    │ │ │ │ @@ -3407,429 +3555,281 @@
    │ │ │ │  
    │ │ │ │  		TORRENT_ASSERT(i->writing > 0);
    │ │ │ │  		TORRENT_ASSERT(info.state == block_info::state_writing);
    │ │ │ │  
    │ │ │ │  		if (info.state == block_info::state_finished) return;
    │ │ │ │  		if (info.state == block_info::state_writing) --i->writing;
    │ │ │ │  
    │ │ │ │ -
    relevance 2../src/torrent.cpp:504post alert

    post alert

    ../src/torrent.cpp:504

    		if (m_current_gauge_state != no_gauge_state)
    │ │ │ │ -			inc_stats_counter(m_current_gauge_state + counters::num_checking_torrents, -1);
    │ │ │ │ -		if (new_gauge_state != no_gauge_state)
    │ │ │ │ -			inc_stats_counter(new_gauge_state + counters::num_checking_torrents, 1);
    │ │ │ │ -
    │ │ │ │ -		TORRENT_ASSERT(new_gauge_state >= 0);
    │ │ │ │ -		TORRENT_ASSERT(new_gauge_state <= no_gauge_state);
    │ │ │ │ -		m_current_gauge_state = static_cast<std::uint32_t>(new_gauge_state);
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -	void torrent::leave_seed_mode(seed_mode_t const checking)
    │ │ │ │ -	{
    │ │ │ │ -		if (!m_seed_mode) return;
    │ │ │ │ -
    │ │ │ │ -		if (checking == seed_mode_t::check_files)
    │ │ │ │ -		{
    │ │ │ │ -			// this means the user promised we had all the
    │ │ │ │ -			// files, but it turned out we didn't. This is
    │ │ │ │ -			// an error.
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -
    #ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - debug_log("*** FAILED SEED MODE, rechecking"); │ │ │ │ -#endif │ │ │ │ - } │ │ │ │ - │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - debug_log("*** LEAVING SEED MODE (%s)" │ │ │ │ - , checking == seed_mode_t::skip_checking ? "as seed" : "as non-seed"); │ │ │ │ +
    relevance 2../src/peer_connection.cpp:2562this should probably be based on time instead of number of request messages. For a very high throughput connection, 300 may be a legitimate number of requests to have in flight when getting choked

    this should probably be based on time instead of number │ │ │ │ +of request messages. For a very high throughput connection, 300 │ │ │ │ +may be a legitimate number of requests to have in flight when │ │ │ │ +getting choked

    ../src/peer_connection.cpp:2562

    			}
    │ │ │ │  #endif
    │ │ │ │ -		m_seed_mode = false;
    │ │ │ │ -		// seed is false if we turned out not
    │ │ │ │ -		// to be a seed after all
    │ │ │ │ -		if (checking == seed_mode_t::check_files
    │ │ │ │ -			&& state() != torrent_status::checking_resume_data)
    │ │ │ │ -		{
    │ │ │ │ -			m_have_all = false;
    │ │ │ │ -			set_state(torrent_status::downloading);
    │ │ │ │ -			force_recheck();
    │ │ │ │ -		}
    │ │ │ │ -		m_num_verified = 0;
    │ │ │ │ -		m_verified.clear();
    │ │ │ │ -		m_verifying.clear();
    │ │ │ │  
    │ │ │ │ -		set_need_save_resume(torrent_handle::if_state_changed);
    │ │ │ │ -	}
    │ │ │ │ +			write_reject_request(r);
    │ │ │ │ +			if (m_num_invalid_requests < std::numeric_limits<decltype(m_num_invalid_requests)>::max())
    │ │ │ │ +				++m_num_invalid_requests;
    │ │ │ │  
    │ │ │ │ -	void torrent::verified(piece_index_t const piece)
    │ │ │ │ -	{
    │ │ │ │ -		TORRENT_ASSERT(!m_verified.get_bit(piece));
    │ │ │ │ -		++m_num_verified;
    │ │ │ │ -
    relevance 2../src/torrent.cpp:1852add a unit test where we don't have metadata, connect to a peer that sends a bitfield that's too large, then we get the metadata

    add a unit test where we don't have metadata, connect to a peer │ │ │ │ -that sends a bitfield that's too large, then we get the metadata

    ../src/torrent.cpp:1852

    			for (auto const& f : m_add_torrent_params->renamed_files)
    │ │ │ │ +			if (t->alerts().should_post<invalid_request_alert>())
    │ │ │ │  			{
    │ │ │ │ -				if (f.first < file_index_t(0) || f.first >= fs.end_file()) continue;
    │ │ │ │ -				m_torrent_file->rename_file(file_index_t(f.first), f.second);
    │ │ │ │ +				// msvc 12 appears to deduce the rvalue reference template
    │ │ │ │ +				// incorrectly for bool temporaries. So, create a dummy instance
    │ │ │ │ +				bool const peer_interested = bool(m_peer_interested);
    │ │ │ │ +				t->alerts().emplace_alert<invalid_request_alert>(
    │ │ │ │ +					t->get_handle(), m_remote, m_peer_id, r
    │ │ │ │ +					, t->user_have_piece(r.piece), peer_interested, false);
    │ │ │ │  			}
    │ │ │ │ -		}
    │ │ │ │ -
    │ │ │ │ -		construct_storage();
    │ │ │ │ -
    │ │ │ │ -#ifndef TORRENT_DISABLE_SHARE_MODE
    │ │ │ │ -		if (m_share_mode && valid_metadata())
    │ │ │ │ -		{
    │ │ │ │ -			// in share mode, all pieces have their priorities initialized to 0
    │ │ │ │ -			m_file_priority.clear();
    │ │ │ │ -			m_file_priority.resize(m_torrent_file->num_files(), dont_download);
    │ │ │ │ -		}
    │ │ │ │ -#endif
    │ │ │ │  
    │ │ │ │ -		// it's important to initialize the peers early, because this is what will
    │ │ │ │ -		// fix up their have-bitmasks to have the correct size
    │ │ │ │ -
    if (!m_connections_initialized) │ │ │ │ -
    { │ │ │ │ - m_connections_initialized = true; │ │ │ │ - // all peer connections have to initialize themselves now that the metadata │ │ │ │ - // is available │ │ │ │ - // copy the peer list since peers may disconnect and invalidate │ │ │ │ - // m_connections as we initialize them │ │ │ │ - for (auto c : m_connections) │ │ │ │ + // every ten invalid request, remind the peer that it's choked │ │ │ │ + if (!m_peer_interested && m_num_invalid_requests % 10 == 0 && m_choked) │ │ │ │ { │ │ │ │ - auto pc = c->self(); │ │ │ │ - if (pc->is_disconnecting()) continue; │ │ │ │ - pc->on_metadata_impl(); │ │ │ │ - if (pc->is_disconnecting()) continue; │ │ │ │ - pc->init(); │ │ │ │ +
    if (m_num_invalid_requests > 300 && !m_peer_choked │ │ │ │ +
    && can_disconnect(errors::too_many_requests_when_choked)) │ │ │ │ + { │ │ │ │ + disconnect(errors::too_many_requests_when_choked, operation_t::bittorrent, peer_error); │ │ │ │ + return; │ │ │ │ + } │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + peer_log(peer_log_alert::outgoing_message, "CHOKE"); │ │ │ │ +#endif │ │ │ │ + write_choke(); │ │ │ │ } │ │ │ │ + │ │ │ │ + return; │ │ │ │ } │ │ │ │ │ │ │ │ - // in case file priorities were passed in via the add_torrent_params │ │ │ │ - // and also in the case of share mode, we need to update the priorities │ │ │ │ - // this has to be applied before piece priority │ │ │ │ - if (!m_file_priority.empty()) │ │ │ │ + // if we have choked the client │ │ │ │ + // ignore the request │ │ │ │ + int const blocks_per_piece = │ │ │ │ + (ti.piece_length() + t->block_size() - 1) / t->block_size(); │ │ │ │ + │ │ │ │ + // disconnect peers that downloads more than foo times an allowed │ │ │ │ + // fast piece │ │ │ │ + if (m_choked && fast_idx != -1 && m_accept_fast_piece_cnt[fast_idx] >= 3 * blocks_per_piece │ │ │ │ + && can_disconnect(errors::too_many_requests_when_choked)) │ │ │ │ { │ │ │ │ - // m_file_priority was loaded from the resume data, this doesn't │ │ │ │ - // alter any state that needs to be saved in the resume data │ │ │ │ - auto const ns = m_need_save_resume_data; │ │ │ │ - update_piece_priorities(m_file_priority); │ │ │ │ - m_need_save_resume_data = ns; │ │ │ │ + disconnect(errors::too_many_requests_when_choked, operation_t::bittorrent, peer_error); │ │ │ │ + return; │ │ │ │ } │ │ │ │ │ │ │ │ - if (m_add_torrent_params) │ │ │ │ + if (m_choked && fast_idx == -1) │ │ │ │ { │ │ │ │ -
    relevance 2../src/torrent.cpp:4492use chrono type for time duration

    use chrono type for time duration

    ../src/torrent.cpp:4492

    		}
    │ │ │ │ -
    │ │ │ │ -		m_picker->piece_passed(index);
    │ │ │ │ -		update_gauge();
    │ │ │ │ -		we_have(index);
    │ │ │ │ -
    │ │ │ │ +
    relevance 2../src/peer_connection.cpp:3309since we throw away the queue entry once we issue the disk job, this may happen. Instead, we should keep the queue entry around, mark it as having been requested from disk and once the disk job comes back, discard it if it has been cancelled. Maybe even be able to cancel disk jobs?

    since we throw away the queue entry once we issue │ │ │ │ +the disk job, this may happen. Instead, we should keep the │ │ │ │ +queue entry around, mark it as having been requested from │ │ │ │ +disk and once the disk job comes back, discard it if it has │ │ │ │ +been cancelled. Maybe even be able to cancel disk jobs?

    ../src/peer_connection.cpp:3309

    │ │ │ │  #ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -		if (should_log())
    │ │ │ │ -			debug_log("we_have(%d) (num_have: %d)", int(index), num_have());
    │ │ │ │ -#endif
    │ │ │ │ -#ifndef TORRENT_DISABLE_STREAMING
    │ │ │ │ -		remove_time_critical_piece(index, true);
    │ │ │ │ +		peer_log(peer_log_alert::incoming_message, "CANCEL"
    │ │ │ │ +			, "piece: %d s: %x l: %x", static_cast<int>(r.piece), r.start, r.length);
    │ │ │ │  #endif
    │ │ │ │ -	}
    │ │ │ │  
    │ │ │ │ -#ifndef TORRENT_DISABLE_PREDICTIVE_PIECES
    │ │ │ │ -	// we believe we will complete this piece very soon
    │ │ │ │ -	// announce it to peers ahead of time to eliminate the
    │ │ │ │ -	// round-trip times involved in announcing it, requesting it
    │ │ │ │ -	// and sending it
    │ │ │ │ -
    void torrent::predicted_have_piece(piece_index_t const index, int const milliseconds) │ │ │ │ -
    { │ │ │ │ - auto const i = std::lower_bound(m_predictive_pieces.begin() │ │ │ │ - , m_predictive_pieces.end(), index); │ │ │ │ - if (i != m_predictive_pieces.end() && *i == index) return; │ │ │ │ + auto const i = std::find(m_requests.begin(), m_requests.end(), r); │ │ │ │ │ │ │ │ - for (auto p : m_connections) │ │ │ │ + if (i != m_requests.end()) │ │ │ │ { │ │ │ │ - TORRENT_INCREMENT(m_iterating_connections); │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - p->peer_log(peer_log_alert::outgoing, "PREDICTIVE_HAVE", "piece: %d expected in %d ms" │ │ │ │ - , static_cast<int>(index), milliseconds); │ │ │ │ -#else │ │ │ │ - TORRENT_UNUSED(milliseconds); │ │ │ │ -#endif │ │ │ │ - p->announce_piece(index); │ │ │ │ - } │ │ │ │ + m_counters.inc_stats_counter(counters::cancelled_piece_requests); │ │ │ │ + m_requests.erase(i); │ │ │ │ │ │ │ │ - m_predictive_pieces.insert(i, index); │ │ │ │ - } │ │ │ │ -#endif │ │ │ │ + if (m_requests.empty()) │ │ │ │ + m_counters.inc_stats_counter(counters::num_peers_up_requests, -1); │ │ │ │ │ │ │ │ - // blocks may contain the block indices of the blocks that failed (if this is │ │ │ │ - // a v2 torrent). │ │ │ │ - void torrent::piece_failed(piece_index_t const index, std::vector<int> blocks) │ │ │ │ - { │ │ │ │ - // if the last piece fails the peer connection will still │ │ │ │ - // think that it has received all of it until this function │ │ │ │ - // resets the download queue. So, we cannot do the │ │ │ │ - // invariant check here since it assumes: │ │ │ │ - // (total_done == m_torrent_file->total_size()) => is_seed() │ │ │ │ -
    relevance 2../src/torrent.cpp:4919abort lookups this torrent has made via the session host resolver interface

    abort lookups this torrent has made via the │ │ │ │ -session host resolver interface

    ../src/torrent.cpp:4919

    				TORRENT_UNUSED(e);
    │ │ │ │ -				m_storage.reset();
    │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -				debug_log("Failed to flush disk cache: %s", e.what());
    │ │ │ │ -#endif
    │ │ │ │ -				// clients may rely on this alert to be posted, so it's probably a
    │ │ │ │ -				// good idea to post it here, even though we failed
    │ │ │ │ -				if (alerts().should_post<cache_flushed_alert>())
    │ │ │ │ -					alerts().emplace_alert<cache_flushed_alert>(get_handle());
    │ │ │ │ -			}
    │ │ │ │ -			m_ses.deferred_submit_jobs();
    │ │ │ │ +			write_reject_request(r);
    │ │ │ │  		}
    │ │ │ │  		else
    │ │ │ │  		{
    │ │ │ │ -			if (alerts().should_post<cache_flushed_alert>())
    │ │ │ │ -				alerts().emplace_alert<cache_flushed_alert>(get_handle());
    │ │ │ │ -			alerts().emplace_alert<torrent_removed_alert>(get_handle()
    │ │ │ │ -				, info_hash(), get_userdata());
    │ │ │ │ -		}
    │ │ │ │ -
    │ │ │ │ -
    │ │ │ │ -
    if (!m_apply_ip_filter) │ │ │ │ - { │ │ │ │ - inc_stats_counter(counters::non_filter_torrents, -1); │ │ │ │ - m_apply_ip_filter = true; │ │ │ │ - } │ │ │ │ - │ │ │ │ - m_paused = false; │ │ │ │ - m_auto_managed = false; │ │ │ │ - update_state_list(); │ │ │ │ - for (torrent_list_index_t i{}; i != m_links.end_index(); ++i) │ │ │ │ - { │ │ │ │ - if (!m_links[i].in_list()) continue; │ │ │ │ - m_links[i].unlink(m_ses.torrent_list(i), i); │ │ │ │ +
    #ifndef TORRENT_DISABLE_LOGGING │ │ │ │ +
    peer_log(peer_log_alert::info, "INVALID_CANCEL", "got cancel not in the queue"); │ │ │ │ +#endif │ │ │ │ } │ │ │ │ - // don't re-add this torrent to the state-update list │ │ │ │ - m_state_subscription = false; │ │ │ │ } │ │ │ │ │ │ │ │ - // this is called when we're destructing non-gracefully. i.e. we're _just_ │ │ │ │ - // destructing everything. │ │ │ │ - void torrent::panic() │ │ │ │ + // ----------------------------- │ │ │ │ + // --------- DHT PORT ---------- │ │ │ │ + // ----------------------------- │ │ │ │ + │ │ │ │ + void peer_connection::incoming_dht_port(int const listen_port) │ │ │ │ { │ │ │ │ - m_storage.reset(); │ │ │ │ - // if there are any other peers allocated still, we need to clear them │ │ │ │ - // now. They can't be cleared later because the allocator will already │ │ │ │ - // have been destructed │ │ │ │ - if (m_peer_list) m_peer_list->clear(); │ │ │ │ - m_connections.clear(); │ │ │ │ - m_outgoing_pids.clear(); │ │ │ │ - m_peers_to_disconnect.clear(); │ │ │ │ -
    relevance 2../src/torrent.cpp:8032if peer is a really good peer, maybe we shouldn't disconnect it perhaps this logic should be disabled if we have too many idle peers (with some definition of idle)

    if peer is a really good peer, maybe we shouldn't disconnect it │ │ │ │ -perhaps this logic should be disabled if we have too many idle peers │ │ │ │ -(with some definition of idle)

    ../src/torrent.cpp:8032

    │ │ │ │ -		m_peers_to_disconnect.reserve(m_connections.size() + 1);
    │ │ │ │ -		m_connections.reserve(m_connections.size() + 1);
    │ │ │ │ +		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ +		INVARIANT_CHECK;
    │ │ │ │  
    │ │ │ │ -#if TORRENT_USE_ASSERTS
    │ │ │ │ -		error_code ec;
    │ │ │ │ -		TORRENT_ASSERT(p->remote() == p->get_socket().remote_endpoint(ec) || ec);
    │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ +		peer_log(peer_log_alert::incoming_message, "DHT_PORT", "p: %d", listen_port);
    │ │ │ │  #endif
    │ │ │ │ +#ifndef TORRENT_DISABLE_DHT
    │ │ │ │ +		m_ses.add_dht_node({m_remote.address(), std::uint16_t(listen_port)});
    │ │ │ │ +#else
    │ │ │ │ +		TORRENT_UNUSED(listen_port);
    │ │ │ │ +#endif
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -		TORRENT_ASSERT(p->peer_info_struct() != nullptr);
    │ │ │ │ -
    │ │ │ │ -		// we need to do this after we've added the peer to the peer_list
    │ │ │ │ -		// since that's when the peer is assigned its peer_info object,
    │ │ │ │ -		// which holds the rank
    │ │ │ │ -		if (maybe_replace_peer)
    │ │ │ │ -		{
    │ │ │ │ -			// now, find the lowest rank peer and disconnect that
    │ │ │ │ -			// if it's lower rank than the incoming connection
    │ │ │ │ -			peer_connection* peer = find_lowest_ranking_peer();
    │ │ │ │ +	// -----------------------------
    │ │ │ │ +	// --------- HAVE ALL ----------
    │ │ │ │ +	// -----------------------------
    │ │ │ │  
    │ │ │ │ -
    if (peer != nullptr && peer->peer_rank() < p->peer_rank()) │ │ │ │ -
    { │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - if (should_log()) │ │ │ │ - { │ │ │ │ - debug_log("CLOSING CONNECTION \"%s\" peer list full (low peer rank) " │ │ │ │ - "connections: %d limit: %d" │ │ │ │ - , print_endpoint(peer->remote()).c_str() │ │ │ │ - , num_peers() │ │ │ │ - , m_max_connections); │ │ │ │ - } │ │ │ │ -#endif │ │ │ │ - peer->disconnect(errors::too_many_connections, operation_t::bittorrent); │ │ │ │ - p->peer_disconnected_other(); │ │ │ │ - } │ │ │ │ - else │ │ │ │ + void peer_connection::incoming_have_all() │ │ │ │ + { │ │ │ │ +
    relevance 2../src/peer_connection.cpp:4975use a deadline_timer for timeouts. Don't rely on second_tick()! Hook this up to connect timeout as well. This would improve performance because of less work in second_tick(), and might let use remove ticking entirely eventually

    use a deadline_timer for timeouts. Don't rely on second_tick()! │ │ │ │ +Hook this up to connect timeout as well. This would improve performance │ │ │ │ +because of less work in second_tick(), and might let use remove ticking │ │ │ │ +entirely eventually

    ../src/peer_connection.cpp:4975

    			if (d > seconds(connect_timeout)
    │ │ │ │ +				&& can_disconnect(errors::timed_out))
    │ │ │ │  			{
    │ │ │ │  #ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -				if (should_log())
    │ │ │ │ -				{
    │ │ │ │ -					debug_log("CLOSING CONNECTION \"%s\" peer list full (low peer rank) "
    │ │ │ │ -						"connections: %d limit: %d"
    │ │ │ │ -						, print_endpoint(p->remote()).c_str()
    │ │ │ │ -						, num_peers()
    │ │ │ │ -						, m_max_connections);
    │ │ │ │ -				}
    │ │ │ │ +				peer_log(peer_log_alert::info, "CONNECT_FAILED", "waited %d seconds"
    │ │ │ │ +					, int(total_seconds(d)));
    │ │ │ │  #endif
    │ │ │ │ -				p->disconnect(errors::too_many_connections, operation_t::bittorrent);
    │ │ │ │ -				// we have to do this here because from the peer's point of view
    │ │ │ │ -				// it wasn't really attached to the torrent, but we do need
    │ │ │ │ -				// to let peer_list know we're removing it
    │ │ │ │ -
    relevance 2../src/http_tracker_connection.cpp:479returning a bool here is redundant. Instead this function should return the peer_entry

    returning a bool here is redundant. Instead this function should │ │ │ │ -return the peer_entry

    ../src/http_tracker_connection.cpp:479

    		{
    │ │ │ │ -			cb->tracker_scrape_response(tracker_req(), resp.complete
    │ │ │ │ -				, resp.incomplete, resp.downloaded, resp.downloaders);
    │ │ │ │ -		}
    │ │ │ │ -		else
    │ │ │ │ -		{
    │ │ │ │ -			std::list<address> ip_list;
    │ │ │ │ -			if (m_tracker_connection)
    │ │ │ │ -			{
    │ │ │ │ -				for (auto const& endp : m_tracker_connection->endpoints())
    │ │ │ │ -				{
    │ │ │ │ -					ip_list.push_back(endp.address());
    │ │ │ │ -				}
    │ │ │ │ +				connect_failed(errors::timed_out);
    │ │ │ │ +				return;
    │ │ │ │  			}
    │ │ │ │ -
    │ │ │ │ -			cb->tracker_response(tracker_req(), m_tracker_ip, ip_list, resp);
    │ │ │ │  		}
    │ │ │ │ -		close();
    │ │ │ │ -	}
    │ │ │ │  
    │ │ │ │ -
    bool extract_peer_info(bdecode_node const& info, peer_entry& ret, error_code& ec) │ │ │ │ -
    { │ │ │ │ - // extract peer id (if any) │ │ │ │ - if (info.type() != bdecode_node::dict_t) │ │ │ │ - { │ │ │ │ - ec = errors::invalid_peer_dict; │ │ │ │ - return false; │ │ │ │ - } │ │ │ │ - bdecode_node i = info.dict_find_string("peer id"); │ │ │ │ - if (i && i.string_length() == 20) │ │ │ │ - { │ │ │ │ - std::copy(i.string_ptr(), i.string_ptr() + 20, ret.pid.begin()); │ │ │ │ - } │ │ │ │ - else │ │ │ │ - { │ │ │ │ - // if there's no peer_id, just initialize it to a bunch of zeroes │ │ │ │ - ret.pid.clear(); │ │ │ │ - } │ │ │ │ + // if the bw_network flag isn't set, it means we are not even trying to │ │ │ │ + // read from this peer's socket. Most likely because we're applying a │ │ │ │ + // rate limit. If the peer is "slow" because we are rate limiting it, │ │ │ │ + // don't enforce timeouts. However, as soon as we *do* read from the │ │ │ │ + // socket, we expect to receive data, and not have timed out. Then we │ │ │ │ + // can enforce the timeouts. │ │ │ │ + bool const reading_socket = bool(m_channel_state[download_channel] & peer_info::bw_network); │ │ │ │ │ │ │ │ - // extract ip │ │ │ │ - i = info.dict_find_string("ip"); │ │ │ │ - if (!i) │ │ │ │ +
    if (reading_socket && d > seconds(timeout()) && !m_connecting && m_reading_bytes == 0 │ │ │ │ +
    && can_disconnect(errors::timed_out_inactivity)) │ │ │ │ { │ │ │ │ - ec = errors::invalid_tracker_response; │ │ │ │ - return false; │ │ │ │ - } │ │ │ │ - ret.hostname = i.string_value().to_string(); │ │ │ │ - │ │ │ │ - // extract port │ │ │ │ - i = info.dict_find_int("port"); │ │ │ │ - if (!i) │ │ │ │ -
    relevance 2../src/path.cpp:429test this on a FAT volume to see what error we get!

    test this on a FAT volume to see what error we get!

    ../src/path.cpp:429

    			// it's possible CreateHardLink will copy the file internally too,
    │ │ │ │ -			// if the filesystem does not support it.
    │ │ │ │ -			ec.assign(GetLastError(), system_category());
    │ │ │ │ -			return;
    │ │ │ │ -		}
    │ │ │ │ -
    │ │ │ │ -		// fall back to making a copy
    │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ +			peer_log(peer_log_alert::info, "LAST_ACTIVITY", "%d seconds ago"
    │ │ │ │ +				, int(total_seconds(d)));
    │ │ │ │  #endif
    │ │ │ │ -#else
    │ │ │ │ -		// assume posix's link() function exists
    │ │ │ │ -		int ret = ::link(n_exist.c_str(), n_link.c_str());
    │ │ │ │ -
    │ │ │ │ -		if (ret == 0)
    │ │ │ │ -		{
    │ │ │ │ -			ec.clear();
    │ │ │ │ +			disconnect(errors::timed_out_inactivity, operation_t::bittorrent);
    │ │ │ │  			return;
    │ │ │ │  		}
    │ │ │ │  
    │ │ │ │ -		// most errors are passed through, except for the ones that indicate that
    │ │ │ │ -		// hard links are not supported and require a copy.
    │ │ │ │ -
    if (errno != EMLINK │ │ │ │ -
    && errno != EXDEV │ │ │ │ -#ifdef TORRENT_BEOS │ │ │ │ - // haiku returns EPERM when the filesystem doesn't support hard link │ │ │ │ - && errno != EPERM │ │ │ │ + // do not stall waiting for a handshake │ │ │ │ + int timeout = m_settings.get_int (settings_pack::handshake_timeout); │ │ │ │ +#if TORRENT_USE_I2P │ │ │ │ + timeout *= is_i2p(m_socket) ? 4 : 1; │ │ │ │ #endif │ │ │ │ - ) │ │ │ │ + if (reading_socket │ │ │ │ + && !m_connecting │ │ │ │ + && in_handshake() │ │ │ │ + && d > seconds(timeout)) │ │ │ │ { │ │ │ │ - // some error happened, report up to the caller │ │ │ │ - ec.assign(errno, system_category()); │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + peer_log(peer_log_alert::info, "NO_HANDSHAKE", "waited %d seconds" │ │ │ │ + , int(total_seconds(d))); │ │ │ │ +#endif │ │ │ │ + disconnect(errors::timed_out_no_handshake, operation_t::bittorrent); │ │ │ │ return; │ │ │ │ } │ │ │ │ │ │ │ │ - // fall back to making a copy │ │ │ │ + // disconnect peers that we unchoked, but they didn't send a request in │ │ │ │ + // the last 60 seconds, and we haven't been working on servicing a request │ │ │ │ +
    relevance 2../src/alert_manager.cpp:80keep a count of the number of threads waiting. Only if it's > 0 notify them

    keep a count of the number of threads waiting. Only if it's │ │ │ │ +> 0 notify them

    ../src/alert_manager.cpp:80

    			return m_alerts[m_generation].front();
    │ │ │ │  
    │ │ │ │ -#endif
    │ │ │ │ +		// this call can be interrupted prematurely by other signals
    │ │ │ │ +		m_condition.wait_for(lock, max_wait);
    │ │ │ │ +		if (!m_alerts[m_generation].empty())
    │ │ │ │ +			return m_alerts[m_generation].front();
    │ │ │ │  
    │ │ │ │ -		// if we get here, we should copy the file
    │ │ │ │ -		storage_error se;
    │ │ │ │ -		aux::copy_file(file, link, se);
    │ │ │ │ -		ec = se.ec;
    │ │ │ │ +		return nullptr;
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ -	bool is_directory(std::string const& f, error_code& ec)
    │ │ │ │ -	{
    │ │ │ │ -		ec.clear();
    │ │ │ │ -		error_code e;
    │ │ │ │ -		file_status s;
    │ │ │ │ -		stat_file(f, &s, e);
    │ │ │ │ -		if (!e && s.mode & file_status::directory) return true;
    │ │ │ │ -		ec = e;
    │ │ │ │ -
    relevance 2../src/peer_list.cpp:539it would be nice if there was a way to iterate over these torrent_peer objects in the order they are allocated in the pool instead. It would probably be more efficient

    it would be nice if there was a way to iterate over these │ │ │ │ -torrent_peer objects in the order they are allocated in the pool │ │ │ │ -instead. It would probably be more efficient

    ../src/peer_list.cpp:539

    		, int session_time, torrent_state* state)
    │ │ │ │ +	void alert_manager::maybe_notify(alert* a)
    │ │ │ │  	{
    │ │ │ │ -		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ -		INVARIANT_CHECK;
    │ │ │ │ -
    │ │ │ │ -		const int candidate_count = 10;
    │ │ │ │ -		peers.reserve(candidate_count);
    │ │ │ │ +		if (m_alerts[m_generation].size() == 1)
    │ │ │ │ +		{
    │ │ │ │ +			// we just posted to an empty queue. If anyone is waiting for
    │ │ │ │ +			// alerts, we need to notify them. Also (potentially) call the
    │ │ │ │ +			// user supplied m_notify callback to let the client wake up its
    │ │ │ │ +			// message loop to poll for alerts.
    │ │ │ │ +			if (m_notify) m_notify();
    │ │ │ │  
    │ │ │ │ -		int erase_candidate = -1;
    │ │ │ │ +
    m_condition.notify_all(); │ │ │ │ +
    } │ │ │ │ │ │ │ │ - if (bool(m_finished) != state->is_finished) │ │ │ │ - recalculate_connect_candidates(state); │ │ │ │ +#ifndef TORRENT_DISABLE_EXTENSIONS │ │ │ │ + for (auto& e : m_ses_extensions) │ │ │ │ + e->on_alert(a); │ │ │ │ +#else │ │ │ │ + TORRENT_UNUSED(a); │ │ │ │ +#endif │ │ │ │ + } │ │ │ │ │ │ │ │ - external_ip const& external = state->ip; │ │ │ │ - int external_port = state->port; │ │ │ │ + void alert_manager::set_notify_function(std::function<void()> const& fun) │ │ │ │ + { │ │ │ │ + std::unique_lock<std::recursive_mutex> lock(m_mutex); │ │ │ │ + m_notify = fun; │ │ │ │ + if (!m_alerts[m_generation].empty()) │ │ │ │ + { │ │ │ │ + if (m_notify) m_notify(); │ │ │ │ + } │ │ │ │ + } │ │ │ │ │ │ │ │ - if (m_round_robin >= int(m_peers.size())) m_round_robin = 0; │ │ │ │ +#ifndef TORRENT_DISABLE_EXTENSIONS │ │ │ │ + void alert_manager::add_extension(std::shared_ptr<plugin> ext) │ │ │ │ + { │ │ │ │ + m_ses_extensions.push_back(std::move(ext)); │ │ │ │ + } │ │ │ │ +#endif │ │ │ │ │ │ │ │ - int max_peerlist_size = state->max_peerlist_size; │ │ │ │ + void alert_manager::get_all(std::vector<alert*>& alerts) │ │ │ │ + { │ │ │ │ + std::lock_guard<std::recursive_mutex> lock(m_mutex); │ │ │ │ +
    relevance 2../src/alert.cpp:2021the salt here is allocated on the heap. It would be nice to allocate in the stack_allocator

    the salt here is allocated on the heap. It would be nice to │ │ │ │ +allocate in the stack_allocator

    ../src/alert.cpp:2021

    	}
    │ │ │ │  
    │ │ │ │ -
    for (int iterations = std::min(int(m_peers.size()), 300); │ │ │ │ -
    iterations > 0; --iterations) │ │ │ │ - { │ │ │ │ - ++state->loop_counter; │ │ │ │ + dht_immutable_item_alert::dht_immutable_item_alert(aux::stack_allocator& │ │ │ │ + , sha1_hash const& t, entry i) │ │ │ │ + : target(t), item(std::move(i)) │ │ │ │ + {} │ │ │ │ │ │ │ │ - if (m_round_robin >= int(m_peers.size())) m_round_robin = 0; │ │ │ │ + std::string dht_immutable_item_alert::message() const │ │ │ │ + { │ │ │ │ +#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ + return {}; │ │ │ │ +#else │ │ │ │ + char msg[1050]; │ │ │ │ + std::snprintf(msg, sizeof(msg), "DHT immutable item %s [ %s ]" │ │ │ │ + , aux::to_hex(target).c_str() │ │ │ │ + , item.to_string().c_str()); │ │ │ │ + return msg; │ │ │ │ +#endif │ │ │ │ + } │ │ │ │ │ │ │ │ - torrent_peer& pe = *m_peers[m_round_robin]; │ │ │ │ - TORRENT_ASSERT(pe.in_use); │ │ │ │ - int current = m_round_robin; │ │ │ │ +
    dht_mutable_item_alert::dht_mutable_item_alert(aux::stack_allocator& │ │ │ │ +
    , std::array<char, 32> const& k │ │ │ │ + , std::array<char, 64> const& sig │ │ │ │ + , std::int64_t sequence │ │ │ │ + , string_view s │ │ │ │ + , entry i │ │ │ │ + , bool a) │ │ │ │ + : key(k), signature(sig), seq(sequence), salt(s), item(std::move(i)), authoritative(a) │ │ │ │ + {} │ │ │ │ │ │ │ │ - // if the number of peers is growing large │ │ │ │ - // we need to start weeding. │ │ │ │ + std::string dht_mutable_item_alert::message() const │ │ │ │ + { │ │ │ │ +#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ + return {}; │ │ │ │ +#else │ │ │ │ + char msg[1050]; │ │ │ │ + std::snprintf(msg, sizeof(msg), "DHT mutable item (key=%s salt=%s seq=%" PRId64 " %s) [ %s ]" │ │ │ │ + , aux::to_hex(key).c_str() │ │ │ │ + , salt.c_str() │ │ │ │ + , seq │ │ │ │ + , authoritative ? "auth" : "non-auth" │ │ │ │ + , item.to_string().c_str()); │ │ │ │ + return msg; │ │ │ │ +#endif │ │ │ │ + } │ │ │ │ │ │ │ │ - if (int(m_peers.size()) >= max_peerlist_size * 0.95 │ │ │ │ - && max_peerlist_size > 0) │ │ │ │ - { │ │ │ │ - if (is_erase_candidate(pe) │ │ │ │ - && (erase_candidate == -1 │ │ │ │ - || !compare_peer_erase(*m_peers[erase_candidate], pe))) │ │ │ │ - { │ │ │ │ - if (should_erase_immediately(pe)) │ │ │ │ - { │ │ │ │ - if (erase_candidate > current) --erase_candidate; │ │ │ │ - erase_peer(m_peers.begin() + current, state); │ │ │ │ - continue; │ │ │ │ - } │ │ │ │ - else │ │ │ │ - { │ │ │ │ - erase_candidate = current; │ │ │ │ - } │ │ │ │ + dht_put_alert::dht_put_alert(aux::stack_allocator&, sha1_hash const& t, int n) │ │ │ │ + : target(t) │ │ │ │ + , public_key() │ │ │ │ + , signature() │ │ │ │ + , salt() │ │ │ │
    relevance 2../src/kademlia/node.cpp:684it would be nice to have a bias towards node-id prefixes that are missing in the bucket

    it would be nice to have a bias towards node-id prefixes that │ │ │ │ are missing in the bucket

    ../src/kademlia/node.cpp:684

    	node_entry const* ne = m_table.next_refresh();
    │ │ │ │  	if (ne == nullptr) return;
    │ │ │ │  
    │ │ │ │  	// this shouldn't happen
    │ │ │ │  	TORRENT_ASSERT(m_id != ne->id);
    │ │ │ │  	if (ne->id == m_id) return;
    │ │ │ │ @@ -3925,66 +3925,15 @@
    │ │ │ │  entry write_nodes_entry(std::vector<node_entry> const& nodes)
    │ │ │ │  {
    │ │ │ │  	entry r;
    │ │ │ │  	std::back_insert_iterator<std::string> out(r.string());
    │ │ │ │  	for (auto const& n : nodes)
    │ │ │ │  	{
    │ │ │ │  		std::copy(n.id.begin(), n.id.end(), out);
    │ │ │ │ -
    relevance 2../src/kademlia/dht_storage.cpp:87make this configurable in dht_settings

    make this configurable in dht_settings

    ../src/kademlia/dht_storage.cpp:87

    		tcp::endpoint addr;
    │ │ │ │ -		bool seed = 0;
    │ │ │ │ -	};
    │ │ │ │ -
    │ │ │ │ -	// internal
    │ │ │ │ -	bool operator<(peer_entry const& lhs, peer_entry const& rhs)
    │ │ │ │ -	{
    │ │ │ │ -		return lhs.addr.address() == rhs.addr.address()
    │ │ │ │ -			? lhs.addr.port() < rhs.addr.port()
    │ │ │ │ -			: lhs.addr.address() < rhs.addr.address();
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -	// this is a group. It contains a set of group members
    │ │ │ │ -	struct torrent_entry
    │ │ │ │ -	{
    │ │ │ │ -		std::string name;
    │ │ │ │ -		std::vector<peer_entry> peers4;
    │ │ │ │ -		std::vector<peer_entry> peers6;
    │ │ │ │ -	};
    │ │ │ │ -
    │ │ │ │ -
    constexpr time_duration announce_interval = minutes(30); │ │ │ │ -
    │ │ │ │ - struct dht_immutable_item │ │ │ │ - { │ │ │ │ - // the actual value │ │ │ │ - std::unique_ptr<char[]> value; │ │ │ │ - // this counts the number of IPs we have seen │ │ │ │ - // announcing this item, this is used to determine │ │ │ │ - // popularity if we reach the limit of items to store │ │ │ │ - bloom_filter<128> ips; │ │ │ │ - // the last time we heard about this item │ │ │ │ - // the correct interpretation of this field │ │ │ │ - // requires a time reference │ │ │ │ - time_point last_seen; │ │ │ │ - // number of IPs in the bloom filter │ │ │ │ - int num_announcers = 0; │ │ │ │ - // size of malloced space pointed to by value │ │ │ │ - int size = 0; │ │ │ │ - }; │ │ │ │ - │ │ │ │ - struct dht_mutable_item : dht_immutable_item │ │ │ │ - { │ │ │ │ - signature sig{}; │ │ │ │ - sequence_number seq{}; │ │ │ │ - public_key key{}; │ │ │ │ - std::string salt; │ │ │ │ - }; │ │ │ │ - │ │ │ │ - void set_value(dht_immutable_item& item, span<char const> buf) │ │ │ │ - { │ │ │ │ - int const size = int(buf.size()); │ │ │ │ -
    relevance 2../src/kademlia/routing_table.cpp:305use the non deprecated function instead of this one

    use the non deprecated function instead of this one

    ../src/kademlia/routing_table.cpp:305

    	static const aux::array<int, 4> size_exceptions{{{16, 8, 4, 2}}};
    │ │ │ │ +
    relevance 2../src/kademlia/routing_table.cpp:305use the non deprecated function instead of this one

    use the non deprecated function instead of this one

    ../src/kademlia/routing_table.cpp:305

    	static const aux::array<int, 4> size_exceptions{{{16, 8, 4, 2}}};
    │ │ │ │  	if (bucket < size_exceptions.end_index())
    │ │ │ │  		return m_bucket_size * size_exceptions[bucket];
    │ │ │ │  	return m_bucket_size;
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │  void routing_table::status(std::vector<dht_routing_bucket>& s) const
    │ │ │ │  {
    │ │ │ │ @@ -4004,15 +3953,15 @@
    │ │ │ │  

    { │ │ │ │ int dht_nodes; │ │ │ │ int dht_node_cache; │ │ │ │ int ignore; │ │ │ │ std::tie(dht_nodes, dht_node_cache, ignore) = size(); │ │ │ │ s.dht_nodes += dht_nodes; │ │ │ │ s.dht_node_cache += dht_node_cache; │ │ │ │ -relevance 2../src/kademlia/routing_table.cpp:940move the lowest priority nodes to the replacement bucket

    move the lowest priority nodes to the replacement bucket

    ../src/kademlia/routing_table.cpp:940

    	bucket_t& rb = m_buckets[bucket_index].replacements;
    │ │ │ │ +
    relevance 2../src/kademlia/routing_table.cpp:940move the lowest priority nodes to the replacement bucket

    move the lowest priority nodes to the replacement bucket

    ../src/kademlia/routing_table.cpp:940

    	bucket_t& rb = m_buckets[bucket_index].replacements;
    │ │ │ │  
    │ │ │ │  	// move any node whose (160 - distance_exp(m_id, id)) >= (i - m_buckets.begin())
    │ │ │ │  	// to the new bucket
    │ │ │ │  	int const new_bucket_size = bucket_limit(bucket_index + 1);
    │ │ │ │  	for (auto j = b.begin(); j != b.end();)
    │ │ │ │  	{
    │ │ │ │  		int const d = distance_exp(m_id, j->id);
    │ │ │ │ @@ -4055,15 +4004,217 @@
    │ │ │ │  		{
    │ │ │ │  			// this entry belongs in the new bucket
    │ │ │ │  			if (j->pinged() && int(new_bucket.size()) < new_bucket_size)
    │ │ │ │  				new_bucket.push_back(*j);
    │ │ │ │  			else
    │ │ │ │  				new_replacement_bucket.push_back(*j);
    │ │ │ │  		}
    │ │ │ │ -
    relevance 2../include/libtorrent/piece_picker.hpp:668having 8 priority levels is probably excessive. It should probably be changed to 3 levels + dont-download

    having 8 priority levels is probably excessive. It should │ │ │ │ +relevance 2../src/kademlia/dht_storage.cpp:87make this configurable in dht_settings

    make this configurable in dht_settings

    ../src/kademlia/dht_storage.cpp:87

    		tcp::endpoint addr;
    │ │ │ │ +		bool seed = 0;
    │ │ │ │ +	};
    │ │ │ │ +
    │ │ │ │ +	// internal
    │ │ │ │ +	bool operator<(peer_entry const& lhs, peer_entry const& rhs)
    │ │ │ │ +	{
    │ │ │ │ +		return lhs.addr.address() == rhs.addr.address()
    │ │ │ │ +			? lhs.addr.port() < rhs.addr.port()
    │ │ │ │ +			: lhs.addr.address() < rhs.addr.address();
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +	// this is a group. It contains a set of group members
    │ │ │ │ +	struct torrent_entry
    │ │ │ │ +	{
    │ │ │ │ +		std::string name;
    │ │ │ │ +		std::vector<peer_entry> peers4;
    │ │ │ │ +		std::vector<peer_entry> peers6;
    │ │ │ │ +	};
    │ │ │ │ +
    │ │ │ │ +
    constexpr time_duration announce_interval = minutes(30); │ │ │ │ +
    │ │ │ │ + struct dht_immutable_item │ │ │ │ + { │ │ │ │ + // the actual value │ │ │ │ + std::unique_ptr<char[]> value; │ │ │ │ + // this counts the number of IPs we have seen │ │ │ │ + // announcing this item, this is used to determine │ │ │ │ + // popularity if we reach the limit of items to store │ │ │ │ + bloom_filter<128> ips; │ │ │ │ + // the last time we heard about this item │ │ │ │ + // the correct interpretation of this field │ │ │ │ + // requires a time reference │ │ │ │ + time_point last_seen; │ │ │ │ + // number of IPs in the bloom filter │ │ │ │ + int num_announcers = 0; │ │ │ │ + // size of malloced space pointed to by value │ │ │ │ + int size = 0; │ │ │ │ + }; │ │ │ │ + │ │ │ │ + struct dht_mutable_item : dht_immutable_item │ │ │ │ + { │ │ │ │ + signature sig{}; │ │ │ │ + sequence_number seq{}; │ │ │ │ + public_key key{}; │ │ │ │ + std::string salt; │ │ │ │ + }; │ │ │ │ + │ │ │ │ + void set_value(dht_immutable_item& item, span<char const> buf) │ │ │ │ + { │ │ │ │ + int const size = int(buf.size()); │ │ │ │ +
    relevance 2../include/libtorrent/peer_connection.hpp:996this should really be a circular buffer

    this should really be a circular buffer

    ../include/libtorrent/peer_connection.hpp:996

    		// it just serves as a queue to remember what we've sent, to avoid
    │ │ │ │ +		// re-sending suggests for the same piece
    │ │ │ │ +		// i.e. outgoing suggest pieces
    │ │ │ │ +		aux::vector<piece_index_t> m_suggest_pieces;
    │ │ │ │ +
    │ │ │ │ +		// the pieces we will send to the peer
    │ │ │ │ +		// if requested (regardless of choke state)
    │ │ │ │ +		std::vector<piece_index_t> m_accept_fast;
    │ │ │ │ +
    │ │ │ │ +		// a sent-piece counter for the allowed fast set
    │ │ │ │ +		// to avoid exploitation. Each slot is a counter
    │ │ │ │ +		// for one of the pieces from the allowed-fast set
    │ │ │ │ +		aux::vector<std::uint16_t> m_accept_fast_piece_cnt;
    │ │ │ │ +
    │ │ │ │ +		// the pieces the peer will send us if
    │ │ │ │ +		// requested (regardless of choke state)
    │ │ │ │ +		std::vector<piece_index_t> m_allowed_fast;
    │ │ │ │ +
    │ │ │ │ +		// pieces that has been suggested to be downloaded from this peer
    │ │ │ │ +		// i.e. incoming suggestions
    │ │ │ │ +
    aux::vector<piece_index_t> m_suggested_pieces; │ │ │ │ +
    │ │ │ │ + // the time when this peer last saw a complete copy │ │ │ │ + // of this torrent │ │ │ │ + time_t m_last_seen_complete = 0; │ │ │ │ + │ │ │ │ + // the block we're currently receiving. Or │ │ │ │ + // (-1, -1) if we're not receiving one │ │ │ │ + piece_block m_receiving_block = piece_block::invalid; │ │ │ │ + │ │ │ │ + // the local endpoint for this peer, i.e. our address │ │ │ │ + // and our port. If this is set for outgoing connections │ │ │ │ + // before the connection completes, it means we want to │ │ │ │ + // force the connection to be bound to the specified interface. │ │ │ │ + // if it ends up being bound to a different local IP, the connection │ │ │ │ + // is closed. │ │ │ │ + tcp::endpoint m_local; │ │ │ │ + │ │ │ │ + // remote peer's id │ │ │ │ + peer_id m_peer_id; │ │ │ │ + │ │ │ │ + protected: │ │ │ │ + │ │ │ │ + template <typename Fun, typename... Args> │ │ │ │ + void wrap(Fun f, Args&&... a); │ │ │ │ + │ │ │ │ + // statistics about upload and download speeds │ │ │ │ + // and total amount of uploads and downloads for │ │ │ │ + // this peer │ │ │ │ +
    relevance 2../include/libtorrent/peer_connection.hpp:1086rename this target queue size

    rename this target queue size

    ../include/libtorrent/peer_connection.hpp:1086

    		// this is the piece that is available to this peer. Only
    │ │ │ │ +		// these two pieces can be downloaded from us by this peer.
    │ │ │ │ +		// This will remain the current piece for this peer until
    │ │ │ │ +		// another peer sends us a have message for this piece
    │ │ │ │ +		std::array<piece_index_t, 2> m_superseed_piece = {{piece_index_t(-1), piece_index_t(-1)}};
    │ │ │ │ +#endif
    │ │ │ │ +
    │ │ │ │ +		// the number of bytes send to the disk-io
    │ │ │ │ +		// thread that hasn't yet been completely written.
    │ │ │ │ +		int m_outstanding_writing_bytes = 0;
    │ │ │ │ +
    │ │ │ │ +		// max transfer rates seen on this peer
    │ │ │ │ +		int m_download_rate_peak = 0;
    │ │ │ │ +		int m_upload_rate_peak = 0;
    │ │ │ │ +
    │ │ │ │ +		// stop sending data after this many bytes, INT_MAX = inf
    │ │ │ │ +		int m_send_barrier = INT_MAX;
    │ │ │ │ +
    │ │ │ │ +		// the number of request we should queue up
    │ │ │ │ +		// at the remote end.
    │ │ │ │ +
    std::uint16_t m_desired_queue_size = 4; │ │ │ │ +
    │ │ │ │ + // if set to non-zero, this peer will always prefer │ │ │ │ + // to request entire n pieces, rather than blocks. │ │ │ │ + // where n is the value of this variable. │ │ │ │ + // if it is 0, the download rate limit setting │ │ │ │ + // will be used to determine if whole pieces │ │ │ │ + // are preferred. │ │ │ │ + std::uint16_t m_prefer_contiguous_blocks = 0; │ │ │ │ + │ │ │ │ + // this is the number of times this peer has had │ │ │ │ + // a request rejected because of a disk I/O failure. │ │ │ │ + // once this reaches a certain threshold, the │ │ │ │ + // peer is disconnected in order to avoid infinite │ │ │ │ + // loops of consistent failures │ │ │ │ + std::uint8_t m_disk_read_failures = 0; │ │ │ │ + │ │ │ │ + // this is used in seed mode whenever we trigger a hash check │ │ │ │ + // for a piece, before we read it. It's used to throttle │ │ │ │ + // the hash checks to just a few per peer at a time. │ │ │ │ + std::uint8_t m_outstanding_piece_verification:3; │ │ │ │ + │ │ │ │ + // is true if it was we that connected to the peer │ │ │ │ + // and false if we got an incoming connection │ │ │ │ + // could be considered: true = local, false = remote │ │ │ │ + bool m_outgoing:1; │ │ │ │ + │ │ │ │ + // is true if we learn the incoming connections listening │ │ │ │ + // during the extended handshake │ │ │ │ + bool m_received_listen_port:1; │ │ │ │ + │ │ │ │ +
    relevance 2../include/libtorrent/socks5_stream.hpp:153add async_connect() that takes a hostname and port as well

    add async_connect() that takes a hostname and port as well

    ../include/libtorrent/socks5_stream.hpp:153

    		TORRENT_ASSERT(!aux::is_ip_address(host));
    │ │ │ │ +		m_dst_name = host;
    │ │ │ │ +		if (m_dst_name.size() > 255)
    │ │ │ │ +			m_dst_name.resize(255);
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +	void close(error_code& ec)
    │ │ │ │ +	{
    │ │ │ │ +		m_dst_name.clear();
    │ │ │ │ +		proxy_base::close(ec);
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +#ifndef BOOST_NO_EXCEPTIONS
    │ │ │ │ +	void close()
    │ │ │ │ +	{
    │ │ │ │ +		m_dst_name.clear();
    │ │ │ │ +		proxy_base::close();
    │ │ │ │ +	}
    │ │ │ │ +#endif
    │ │ │ │ +
    │ │ │ │ +
    template <class Handler> │ │ │ │ +
    void async_connect(endpoint_type const& endpoint, Handler handler) │ │ │ │ + { │ │ │ │ + // make sure we don't try to connect to INADDR_ANY. binding is fine, │ │ │ │ + // and using a hostname is fine on SOCKS version 5. │ │ │ │ + TORRENT_ASSERT(endpoint.address() != address() │ │ │ │ + || (!m_dst_name.empty() && m_version == 5)); │ │ │ │ + │ │ │ │ + m_remote_endpoint = endpoint; │ │ │ │ + │ │ │ │ + // the connect is split up in the following steps: │ │ │ │ + // 1. resolve name of proxy server │ │ │ │ + // 2. connect to proxy server │ │ │ │ + // 3. if version == 5: │ │ │ │ + // 3.1 send SOCKS5 authentication method message │ │ │ │ + // 3.2 read SOCKS5 authentication response │ │ │ │ + // 3.3 send username+password │ │ │ │ + // 4. send SOCKS command message │ │ │ │ + │ │ │ │ + ADD_OUTSTANDING_ASYNC("socks5_stream::name_lookup"); │ │ │ │ + m_resolver.async_resolve(m_hostname, to_string(m_port).data(), wrap_allocator( │ │ │ │ + [this](error_code const& ec, tcp::resolver::results_type ips, Handler hn) { │ │ │ │ + name_lookup(ec, std::move(ips), std::move(hn)); │ │ │ │ + }, std::move(handler))); │ │ │ │ + } │ │ │ │ + │ │ │ │ +private: │ │ │ │ + │ │ │ │ + template <typename Handler> │ │ │ │ + void name_lookup(error_code const& e, tcp::resolver::results_type ips │ │ │ │ + , Handler h) │ │ │ │ +
    relevance 2../include/libtorrent/piece_picker.hpp:668having 8 priority levels is probably excessive. It should probably be changed to 3 levels + dont-download

    having 8 priority levels is probably excessive. It should │ │ │ │ probably be changed to 3 levels + dont-download

    ../include/libtorrent/piece_picker.hpp:668

    				else if (state() == piece_full)
    │ │ │ │  						state(piece_full_reverse);
    │ │ │ │  			}
    │ │ │ │  
    │ │ │ │  			// the number of peers that has this piece
    │ │ │ │  			// (availability)
    │ │ │ │  			std::uint32_t peer_count : 26;
    │ │ │ │ @@ -4107,15 +4258,15 @@
    │ │ │ │  			// the priority value that means the piece is filtered
    │ │ │ │  			static constexpr std::uint32_t filter_priority = 0;
    │ │ │ │  
    │ │ │ │  			// the max number the peer count can hold
    │ │ │ │  			static constexpr std::uint32_t max_peer_count = 0xffff;
    │ │ │ │  
    │ │ │ │  			bool have() const { return index == we_have_index; }
    │ │ │ │ -
    relevance 2../include/libtorrent/enum_net.hpp:196this could be done more efficiently by just looking up the interface with the given name, maybe even with if_nametoindex()

    this could be done more efficiently by just looking up │ │ │ │ +relevance 2../include/libtorrent/enum_net.hpp:196this could be done more efficiently by just looking up the interface with the given name, maybe even with if_nametoindex()

    this could be done more efficiently by just looking up │ │ │ │ the interface with the given name, maybe even with if_nametoindex()

    ../include/libtorrent/enum_net.hpp:196

    			// IPv6 address. If we're asking to be bound to an IPv6 address and
    │ │ │ │  			// providing 0.0.0.0 as the device, turn it into "::"
    │ │ │ │  			if (ip == address_v4::any() && protocol == boost::asio::ip::tcp::v6())
    │ │ │ │  				ip = address_v6::any();
    │ │ │ │  			bind_ep.address(ip);
    │ │ │ │  			// it appears to be an IP. Just bind to that address
    │ │ │ │  			sock.bind(bind_ep, ec);
    │ │ │ │ @@ -4159,15 +4310,15 @@
    │ │ │ │  		}
    │ │ │ │  		sock.bind(bind_ep, ec);
    │ │ │ │  		return bind_ep.address();
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │  	// returns the device name whose local address is ``addr``. If
    │ │ │ │  	// no such device is found, an empty string is returned.
    │ │ │ │ -
    relevance 2../include/libtorrent/proxy_base.hpp:327use the resolver interface that has a built-in cache

    use the resolver interface that has a built-in cache

    ../include/libtorrent/proxy_base.hpp:327

    │ │ │ │ +
    relevance 2../include/libtorrent/proxy_base.hpp:327use the resolver interface that has a built-in cache

    use the resolver interface that has a built-in cache

    ../include/libtorrent/proxy_base.hpp:327

    │ │ │ │  	// The handler must be taken as lvalue reference here since we may not call
    │ │ │ │  	// it. But if we do, we want the call operator to own the function object.
    │ │ │ │  	template <typename Handler>
    │ │ │ │  	bool handle_error(error_code e, Handler&& h)
    │ │ │ │  	{
    │ │ │ │  		TORRENT_ASSERT(m_magic == 0x1337);
    │ │ │ │  		if (!e) return false;
    │ │ │ │ @@ -4210,166 +4361,66 @@
    │ │ │ │  	using allocator_type = typename boost::asio::associated_allocator<UnderlyingHandler>::type;
    │ │ │ │  	using executor_type = typename boost::asio::associated_executor<UnderlyingHandler>::type;
    │ │ │ │  
    │ │ │ │  	allocator_type get_allocator() const noexcept
    │ │ │ │  	{ return boost::asio::get_associated_allocator(m_underlying_handler); }
    │ │ │ │  
    │ │ │ │  	executor_type get_executor() const noexcept
    │ │ │ │ -
    relevance 2../include/libtorrent/peer_connection.hpp:996this should really be a circular buffer

    this should really be a circular buffer

    ../include/libtorrent/peer_connection.hpp:996

    		// it just serves as a queue to remember what we've sent, to avoid
    │ │ │ │ -		// re-sending suggests for the same piece
    │ │ │ │ -		// i.e. outgoing suggest pieces
    │ │ │ │ -		aux::vector<piece_index_t> m_suggest_pieces;
    │ │ │ │ -
    │ │ │ │ -		// the pieces we will send to the peer
    │ │ │ │ -		// if requested (regardless of choke state)
    │ │ │ │ -		std::vector<piece_index_t> m_accept_fast;
    │ │ │ │ -
    │ │ │ │ -		// a sent-piece counter for the allowed fast set
    │ │ │ │ -		// to avoid exploitation. Each slot is a counter
    │ │ │ │ -		// for one of the pieces from the allowed-fast set
    │ │ │ │ -		aux::vector<std::uint16_t> m_accept_fast_piece_cnt;
    │ │ │ │ -
    │ │ │ │ -		// the pieces the peer will send us if
    │ │ │ │ -		// requested (regardless of choke state)
    │ │ │ │ -		std::vector<piece_index_t> m_allowed_fast;
    │ │ │ │ -
    │ │ │ │ -		// pieces that has been suggested to be downloaded from this peer
    │ │ │ │ -		// i.e. incoming suggestions
    │ │ │ │ -
    aux::vector<piece_index_t> m_suggested_pieces; │ │ │ │ -
    │ │ │ │ - // the time when this peer last saw a complete copy │ │ │ │ - // of this torrent │ │ │ │ - time_t m_last_seen_complete = 0; │ │ │ │ - │ │ │ │ - // the block we're currently receiving. Or │ │ │ │ - // (-1, -1) if we're not receiving one │ │ │ │ - piece_block m_receiving_block = piece_block::invalid; │ │ │ │ - │ │ │ │ - // the local endpoint for this peer, i.e. our address │ │ │ │ - // and our port. If this is set for outgoing connections │ │ │ │ - // before the connection completes, it means we want to │ │ │ │ - // force the connection to be bound to the specified interface. │ │ │ │ - // if it ends up being bound to a different local IP, the connection │ │ │ │ - // is closed. │ │ │ │ - tcp::endpoint m_local; │ │ │ │ - │ │ │ │ - // remote peer's id │ │ │ │ - peer_id m_peer_id; │ │ │ │ +
    relevance 2../include/libtorrent/aux_/chained_buffer.hpp:59this type should probably be renamed to send_buffer

    this type should probably be renamed to send_buffer

    ../include/libtorrent/aux_/chained_buffer.hpp:59

    #include "libtorrent/aux_/buffer.hpp"
    │ │ │ │  
    │ │ │ │ -	protected:
    │ │ │ │ +#include <deque>
    │ │ │ │ +#include <vector>
    │ │ │ │  
    │ │ │ │ -		template <typename Fun, typename... Args>
    │ │ │ │ -		void wrap(Fun f, Args&&... a);
    │ │ │ │ +#include "libtorrent/aux_/disable_warnings_push.hpp"
    │ │ │ │ +#include <boost/asio/buffer.hpp>
    │ │ │ │ +#include "libtorrent/aux_/disable_warnings_pop.hpp"
    │ │ │ │  
    │ │ │ │ -		// statistics about upload and download speeds
    │ │ │ │ -		// and total amount of uploads and downloads for
    │ │ │ │ -		// this peer
    │ │ │ │ -
    relevance 2../include/libtorrent/peer_connection.hpp:1086rename this target queue size

    rename this target queue size

    ../include/libtorrent/peer_connection.hpp:1086

    		// this is the piece that is available to this peer. Only
    │ │ │ │ -		// these two pieces can be downloaded from us by this peer.
    │ │ │ │ -		// This will remain the current piece for this peer until
    │ │ │ │ -		// another peer sends us a have message for this piece
    │ │ │ │ -		std::array<piece_index_t, 2> m_superseed_piece = {{piece_index_t(-1), piece_index_t(-1)}};
    │ │ │ │ +#ifdef _MSC_VER
    │ │ │ │ +// visual studio requires the value in a deque to be copyable. C++11
    │ │ │ │ +// has looser requirements depending on which functions are actually used.
    │ │ │ │ +#define TORRENT_CPP98_DEQUE 1
    │ │ │ │ +#else
    │ │ │ │ +#define TORRENT_CPP98_DEQUE 0
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │ -		// the number of bytes send to the disk-io
    │ │ │ │ -		// thread that hasn't yet been completely written.
    │ │ │ │ -		int m_outstanding_writing_bytes = 0;
    │ │ │ │ -
    │ │ │ │ -		// max transfer rates seen on this peer
    │ │ │ │ -		int m_download_rate_peak = 0;
    │ │ │ │ -		int m_upload_rate_peak = 0;
    │ │ │ │ -
    │ │ │ │ -		// stop sending data after this many bytes, INT_MAX = inf
    │ │ │ │ -		int m_send_barrier = INT_MAX;
    │ │ │ │ -
    │ │ │ │ -		// the number of request we should queue up
    │ │ │ │ -		// at the remote end.
    │ │ │ │ -
    std::uint16_t m_desired_queue_size = 4; │ │ │ │ -
    │ │ │ │ - // if set to non-zero, this peer will always prefer │ │ │ │ - // to request entire n pieces, rather than blocks. │ │ │ │ - // where n is the value of this variable. │ │ │ │ - // if it is 0, the download rate limit setting │ │ │ │ - // will be used to determine if whole pieces │ │ │ │ - // are preferred. │ │ │ │ - std::uint16_t m_prefer_contiguous_blocks = 0; │ │ │ │ - │ │ │ │ - // this is the number of times this peer has had │ │ │ │ - // a request rejected because of a disk I/O failure. │ │ │ │ - // once this reaches a certain threshold, the │ │ │ │ - // peer is disconnected in order to avoid infinite │ │ │ │ - // loops of consistent failures │ │ │ │ - std::uint8_t m_disk_read_failures = 0; │ │ │ │ - │ │ │ │ - // this is used in seed mode whenever we trigger a hash check │ │ │ │ - // for a piece, before we read it. It's used to throttle │ │ │ │ - // the hash checks to just a few per peer at a time. │ │ │ │ - std::uint8_t m_outstanding_piece_verification:3; │ │ │ │ - │ │ │ │ - // is true if it was we that connected to the peer │ │ │ │ - // and false if we got an incoming connection │ │ │ │ - // could be considered: true = local, false = remote │ │ │ │ - bool m_outgoing:1; │ │ │ │ - │ │ │ │ - // is true if we learn the incoming connections listening │ │ │ │ - // during the extended handshake │ │ │ │ - bool m_received_listen_port:1; │ │ │ │ - │ │ │ │ -
    relevance 2../include/libtorrent/socks5_stream.hpp:153add async_connect() that takes a hostname and port as well

    add async_connect() that takes a hostname and port as well

    ../include/libtorrent/socks5_stream.hpp:153

    		TORRENT_ASSERT(!aux::is_ip_address(host));
    │ │ │ │ -		m_dst_name = host;
    │ │ │ │ -		if (m_dst_name.size() > 255)
    │ │ │ │ -			m_dst_name.resize(255);
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -	void close(error_code& ec)
    │ │ │ │ -	{
    │ │ │ │ -		m_dst_name.clear();
    │ │ │ │ -		proxy_base::close(ec);
    │ │ │ │ -	}
    │ │ │ │ +namespace libtorrent {
    │ │ │ │ +namespace aux {
    │ │ │ │  
    │ │ │ │ -#ifndef BOOST_NO_EXCEPTIONS
    │ │ │ │ -	void close()
    │ │ │ │ -	{
    │ │ │ │ -		m_dst_name.clear();
    │ │ │ │ -		proxy_base::close();
    │ │ │ │ -	}
    │ │ │ │ +
    struct TORRENT_EXTRA_EXPORT chained_buffer : private single_threaded │ │ │ │ +
    { │ │ │ │ + chained_buffer(): m_bytes(0), m_capacity(0) │ │ │ │ + { │ │ │ │ + thread_started(); │ │ │ │ +#if TORRENT_USE_ASSERTS │ │ │ │ + m_destructed = false; │ │ │ │ #endif │ │ │ │ + } │ │ │ │ │ │ │ │ -
    template <class Handler> │ │ │ │ -
    void async_connect(endpoint_type const& endpoint, Handler handler) │ │ │ │ - { │ │ │ │ - // make sure we don't try to connect to INADDR_ANY. binding is fine, │ │ │ │ - // and using a hostname is fine on SOCKS version 5. │ │ │ │ - TORRENT_ASSERT(endpoint.address() != address() │ │ │ │ - || (!m_dst_name.empty() && m_version == 5)); │ │ │ │ - │ │ │ │ - m_remote_endpoint = endpoint; │ │ │ │ - │ │ │ │ - // the connect is split up in the following steps: │ │ │ │ - // 1. resolve name of proxy server │ │ │ │ - // 2. connect to proxy server │ │ │ │ - // 3. if version == 5: │ │ │ │ - // 3.1 send SOCKS5 authentication method message │ │ │ │ - // 3.2 read SOCKS5 authentication response │ │ │ │ - // 3.3 send username+password │ │ │ │ - // 4. send SOCKS command message │ │ │ │ - │ │ │ │ - ADD_OUTSTANDING_ASYNC("socks5_stream::name_lookup"); │ │ │ │ - m_resolver.async_resolve(m_hostname, to_string(m_port).data(), wrap_allocator( │ │ │ │ - [this](error_code const& ec, tcp::resolver::results_type ips, Handler hn) { │ │ │ │ - name_lookup(ec, std::move(ips), std::move(hn)); │ │ │ │ - }, std::move(handler))); │ │ │ │ - } │ │ │ │ + private: │ │ │ │ │ │ │ │ -private: │ │ │ │ + // destructs/frees the holder object │ │ │ │ + using destruct_holder_fun = void (*)(void*); │ │ │ │ + using move_construct_holder_fun = void (*)(void*, void*); │ │ │ │ │ │ │ │ - template <typename Handler> │ │ │ │ - void name_lookup(error_code const& e, tcp::resolver::results_type ips │ │ │ │ - , Handler h) │ │ │ │ -
    relevance 2../include/libtorrent/aux_/session_interface.hpp:127make this interface a lot smaller. It could be split up into several smaller interfaces. Each subsystem could then limit the size of the mock object to test it.

    make this interface a lot smaller. It could be split up into │ │ │ │ + struct buffer_t │ │ │ │ + { │ │ │ │ + buffer_t() {} │ │ │ │ +#if TORRENT_CPP98_DEQUE │ │ │ │ + buffer_t(buffer_t&& rhs) noexcept │ │ │ │ + { │ │ │ │ + destruct_holder = rhs.destruct_holder; │ │ │ │ + move_holder = rhs.move_holder; │ │ │ │ + buf = rhs.buf; │ │ │ │ + size = rhs.size; │ │ │ │ + used_size = rhs.used_size; │ │ │ │ + move_holder(&holder, &rhs.holder); │ │ │ │ + } │ │ │ │ + buffer_t& operator=(buffer_t&& rhs) & noexcept │ │ │ │ + { │ │ │ │ +relevance 2../include/libtorrent/aux_/session_interface.hpp:127make this interface a lot smaller. It could be split up into several smaller interfaces. Each subsystem could then limit the size of the mock object to test it.

    make this interface a lot smaller. It could be split up into │ │ │ │ several smaller interfaces. Each subsystem could then limit the size │ │ │ │ of the mock object to test it.

    ../include/libtorrent/aux_/session_interface.hpp:127

    	// a release build with logging disabled (which is the default) will
    │ │ │ │  	// not have this class at all
    │ │ │ │  	struct TORRENT_EXTRA_EXPORT session_logger
    │ │ │ │  	{
    │ │ │ │  #ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │  		virtual bool should_log() const = 0;
    │ │ │ │ @@ -4389,15 +4440,15 @@
    │ │ │ │  
    │ │ │ │  
    struct TORRENT_EXTRA_EXPORT session_interface │ │ │ │
    #if !defined TORRENT_DISABLE_LOGGING || TORRENT_USE_ASSERTS │ │ │ │ : session_logger │ │ │ │ #endif │ │ │ │ { │ │ │ │ │ │ │ │ -
    relevance 2../include/libtorrent/aux_/session_interface.hpp:136the IP voting mechanism should be factored out to its own class, not part of the session and these constants should move too

    the IP voting mechanism should be factored out │ │ │ │ +relevance 2../include/libtorrent/aux_/session_interface.hpp:136the IP voting mechanism should be factored out to its own class, not part of the session and these constants should move too

    the IP voting mechanism should be factored out │ │ │ │ to its own class, not part of the session │ │ │ │ and these constants should move too

    ../include/libtorrent/aux_/session_interface.hpp:136

    		virtual void session_log(char const* fmt, ...) const TORRENT_FORMAT(2,3) = 0;
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │  #if TORRENT_USE_ASSERTS
    │ │ │ │  		virtual bool is_single_thread() const = 0;
    │ │ │ │  		virtual bool has_peer(peer_connection const* p) const = 0;
    │ │ │ │ @@ -4442,118 +4493,15 @@
    │ │ │ │  		virtual void remove_torrent(torrent_handle const& h, remove_flags_t options = {}) = 0;
    │ │ │ │  		virtual void remove_torrent_impl(std::shared_ptr<torrent> tptr, remove_flags_t options) = 0;
    │ │ │ │  
    │ │ │ │  		// port filter
    │ │ │ │  		virtual port_filter const& get_port_filter() const = 0;
    │ │ │ │  		virtual void ban_ip(address addr) = 0;
    │ │ │ │  
    │ │ │ │ -
    relevance 2../include/libtorrent/aux_/chained_buffer.hpp:59this type should probably be renamed to send_buffer

    this type should probably be renamed to send_buffer

    ../include/libtorrent/aux_/chained_buffer.hpp:59

    #include "libtorrent/aux_/buffer.hpp"
    │ │ │ │ -
    │ │ │ │ -#include <deque>
    │ │ │ │ -#include <vector>
    │ │ │ │ -
    │ │ │ │ -#include "libtorrent/aux_/disable_warnings_push.hpp"
    │ │ │ │ -#include <boost/asio/buffer.hpp>
    │ │ │ │ -#include "libtorrent/aux_/disable_warnings_pop.hpp"
    │ │ │ │ -
    │ │ │ │ -#ifdef _MSC_VER
    │ │ │ │ -// visual studio requires the value in a deque to be copyable. C++11
    │ │ │ │ -// has looser requirements depending on which functions are actually used.
    │ │ │ │ -#define TORRENT_CPP98_DEQUE 1
    │ │ │ │ -#else
    │ │ │ │ -#define TORRENT_CPP98_DEQUE 0
    │ │ │ │ -#endif
    │ │ │ │ -
    │ │ │ │ -namespace libtorrent {
    │ │ │ │ -namespace aux {
    │ │ │ │ -
    │ │ │ │ -
    struct TORRENT_EXTRA_EXPORT chained_buffer : private single_threaded │ │ │ │ -
    { │ │ │ │ - chained_buffer(): m_bytes(0), m_capacity(0) │ │ │ │ - { │ │ │ │ - thread_started(); │ │ │ │ -#if TORRENT_USE_ASSERTS │ │ │ │ - m_destructed = false; │ │ │ │ -#endif │ │ │ │ - } │ │ │ │ - │ │ │ │ - private: │ │ │ │ - │ │ │ │ - // destructs/frees the holder object │ │ │ │ - using destruct_holder_fun = void (*)(void*); │ │ │ │ - using move_construct_holder_fun = void (*)(void*, void*); │ │ │ │ - │ │ │ │ - struct buffer_t │ │ │ │ - { │ │ │ │ - buffer_t() {} │ │ │ │ -#if TORRENT_CPP98_DEQUE │ │ │ │ - buffer_t(buffer_t&& rhs) noexcept │ │ │ │ - { │ │ │ │ - destruct_holder = rhs.destruct_holder; │ │ │ │ - move_holder = rhs.move_holder; │ │ │ │ - buf = rhs.buf; │ │ │ │ - size = rhs.size; │ │ │ │ - used_size = rhs.used_size; │ │ │ │ - move_holder(&holder, &rhs.holder); │ │ │ │ - } │ │ │ │ - buffer_t& operator=(buffer_t&& rhs) & noexcept │ │ │ │ - { │ │ │ │ -
    relevance 1../src/session_impl.cpp:5707report the proper address of the router as the source IP of this vote of our external address, instead of the empty address

    report the proper address of the router as the source IP of │ │ │ │ -this vote of our external address, instead of the empty address

    ../src/session_impl.cpp:5707

    		, listen_socket_handle const& ls)
    │ │ │ │ -	{
    │ │ │ │ -		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ -
    │ │ │ │ -		listen_socket_t* listen_socket = ls.get();
    │ │ │ │ -
    │ │ │ │ -		// NOTE: don't assume that if ec != 0, the rest of the logic
    │ │ │ │ -		// is not necessary, the ports still need to be set, in other
    │ │ │ │ -		// words, don't early return without careful review of the
    │ │ │ │ -		// remaining logic
    │ │ │ │ -		if (ec && m_alerts.should_post<portmap_error_alert>())
    │ │ │ │ -		{
    │ │ │ │ -			m_alerts.emplace_alert<portmap_error_alert>(mapping
    │ │ │ │ -				, transport, ec, listen_socket ? listen_socket->local_endpoint.address() : address());
    │ │ │ │ -		}
    │ │ │ │ -
    │ │ │ │ -		if (!listen_socket) return;
    │ │ │ │ -
    │ │ │ │ -		if (!ec && !external_ip.is_unspecified())
    │ │ │ │ -		{
    │ │ │ │ -
    listen_socket->external_address.cast_vote(external_ip, source_router, address()); │ │ │ │ -
    } │ │ │ │ - │ │ │ │ - // need to check whether this mapping is for one of session ports (it could also be a user mapping) │ │ │ │ - if ((proto == portmap_protocol::tcp) && (listen_socket->tcp_port_mapping[transport].mapping == mapping)) │ │ │ │ - listen_socket->tcp_port_mapping[transport].port = port; │ │ │ │ - else if ((proto == portmap_protocol::udp) && (listen_socket->udp_port_mapping[transport].mapping == mapping)) │ │ │ │ - listen_socket->udp_port_mapping[transport].port = port; │ │ │ │ - │ │ │ │ - if (!ec && m_alerts.should_post<portmap_alert>()) │ │ │ │ - { │ │ │ │ - m_alerts.emplace_alert<portmap_alert>(mapping, port │ │ │ │ - , transport, proto, listen_socket->local_endpoint.address()); │ │ │ │ - } │ │ │ │ - } │ │ │ │ - │ │ │ │ -#if TORRENT_ABI_VERSION == 1 │ │ │ │ - session_status session_impl::status() const │ │ │ │ - { │ │ │ │ -// INVARIANT_CHECK; │ │ │ │ - TORRENT_ASSERT(is_single_thread()); │ │ │ │ - │ │ │ │ - session_status s; │ │ │ │ - │ │ │ │ - s.optimistic_unchoke_counter = m_optimistic_unchoke_time_scaler; │ │ │ │ - s.unchoke_counter = m_unchoke_time_scaler; │ │ │ │ - s.num_dead_peers = int(m_undead_peers.size()); │ │ │ │ - │ │ │ │ - s.num_peers = int(m_stats_counters[counters::num_peers_connected]); │ │ │ │ - s.num_unchoked = int(m_stats_counters[counters::num_peers_up_unchoked_all]); │ │ │ │ - s.allowed_upload_slots = int(m_stats_counters[counters::num_unchoke_slots]); │ │ │ │ -
    relevance 1../src/torrent.cpp:1126make this depend on the error and on the filesystem the files are being downloaded to. If the error is no_space_left_on_device and the filesystem doesn't support sparse files, only zero the priorities of the pieces that are at the tails of all files, leaving everything up to the highest written piece in each file

    make this depend on the error and on the filesystem the │ │ │ │ +relevance 1../src/torrent.cpp:1126make this depend on the error and on the filesystem the files are being downloaded to. If the error is no_space_left_on_device and the filesystem doesn't support sparse files, only zero the priorities of the pieces that are at the tails of all files, leaving everything up to the highest written piece in each file

    make this depend on the error and on the filesystem the │ │ │ │ files are being downloaded to. If the error is no_space_left_on_device │ │ │ │ and the filesystem doesn't support sparse files, only zero the priorities │ │ │ │ of the pieces that are at the tails of all files, leaving everything │ │ │ │ up to the highest written piece in each file

    ../src/torrent.cpp:1126

    │ │ │ │  		// notify the user of the error
    │ │ │ │  		if (alerts().should_post<file_error_alert>())
    │ │ │ │  			alerts().emplace_alert<file_error_alert>(error.ec
    │ │ │ │ @@ -4600,15 +4548,15 @@
    │ │ │ │  		pause();
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │  	void torrent::on_piece_fail_sync(piece_index_t const piece, piece_block) try
    │ │ │ │  	{
    │ │ │ │  		if (m_abort) return;
    │ │ │ │  
    │ │ │ │ -
    relevance 1../src/torrent.cpp:8398should disconnect all peers that have the pieces we have not just seeds. It would be pretty expensive to check all pieces for all peers though

    should disconnect all peers that have the pieces we have │ │ │ │ +relevance 1../src/torrent.cpp:8398should disconnect all peers that have the pieces we have not just seeds. It would be pretty expensive to check all pieces for all peers though

    should disconnect all peers that have the pieces we have │ │ │ │ not just seeds. It would be pretty expensive to check all pieces │ │ │ │ for all peers though

    ../src/torrent.cpp:8398

    │ │ │ │  		set_state(torrent_status::finished);
    │ │ │ │  		set_queue_position(no_pos);
    │ │ │ │  
    │ │ │ │  		m_became_finished = aux::time_now32();
    │ │ │ │  
    │ │ │ │ @@ -4653,14 +4601,66 @@
    │ │ │ │  			// we need to keep the object alive during this operation
    │ │ │ │  			m_ses.disk_thread().async_release_files(m_storage
    │ │ │ │  				, std::bind(&torrent::on_cache_flushed, shared_from_this(), false));
    │ │ │ │  			m_ses.deferred_submit_jobs();
    │ │ │ │  		}
    │ │ │ │  
    │ │ │ │  		// this torrent just completed downloads, which means it will fall
    │ │ │ │ +
    relevance 1../src/session_impl.cpp:5707report the proper address of the router as the source IP of this vote of our external address, instead of the empty address

    report the proper address of the router as the source IP of │ │ │ │ +this vote of our external address, instead of the empty address

    ../src/session_impl.cpp:5707

    		, listen_socket_handle const& ls)
    │ │ │ │ +	{
    │ │ │ │ +		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ +
    │ │ │ │ +		listen_socket_t* listen_socket = ls.get();
    │ │ │ │ +
    │ │ │ │ +		// NOTE: don't assume that if ec != 0, the rest of the logic
    │ │ │ │ +		// is not necessary, the ports still need to be set, in other
    │ │ │ │ +		// words, don't early return without careful review of the
    │ │ │ │ +		// remaining logic
    │ │ │ │ +		if (ec && m_alerts.should_post<portmap_error_alert>())
    │ │ │ │ +		{
    │ │ │ │ +			m_alerts.emplace_alert<portmap_error_alert>(mapping
    │ │ │ │ +				, transport, ec, listen_socket ? listen_socket->local_endpoint.address() : address());
    │ │ │ │ +		}
    │ │ │ │ +
    │ │ │ │ +		if (!listen_socket) return;
    │ │ │ │ +
    │ │ │ │ +		if (!ec && !external_ip.is_unspecified())
    │ │ │ │ +		{
    │ │ │ │ +
    listen_socket->external_address.cast_vote(external_ip, source_router, address()); │ │ │ │ +
    } │ │ │ │ + │ │ │ │ + // need to check whether this mapping is for one of session ports (it could also be a user mapping) │ │ │ │ + if ((proto == portmap_protocol::tcp) && (listen_socket->tcp_port_mapping[transport].mapping == mapping)) │ │ │ │ + listen_socket->tcp_port_mapping[transport].port = port; │ │ │ │ + else if ((proto == portmap_protocol::udp) && (listen_socket->udp_port_mapping[transport].mapping == mapping)) │ │ │ │ + listen_socket->udp_port_mapping[transport].port = port; │ │ │ │ + │ │ │ │ + if (!ec && m_alerts.should_post<portmap_alert>()) │ │ │ │ + { │ │ │ │ + m_alerts.emplace_alert<portmap_alert>(mapping, port │ │ │ │ + , transport, proto, listen_socket->local_endpoint.address()); │ │ │ │ + } │ │ │ │ + } │ │ │ │ + │ │ │ │ +#if TORRENT_ABI_VERSION == 1 │ │ │ │ + session_status session_impl::status() const │ │ │ │ + { │ │ │ │ +// INVARIANT_CHECK; │ │ │ │ + TORRENT_ASSERT(is_single_thread()); │ │ │ │ + │ │ │ │ + session_status s; │ │ │ │ + │ │ │ │ + s.optimistic_unchoke_counter = m_optimistic_unchoke_time_scaler; │ │ │ │ + s.unchoke_counter = m_unchoke_time_scaler; │ │ │ │ + s.num_dead_peers = int(m_undead_peers.size()); │ │ │ │ + │ │ │ │ + s.num_peers = int(m_stats_counters[counters::num_peers_connected]); │ │ │ │ + s.num_unchoked = int(m_stats_counters[counters::num_peers_up_unchoked_all]); │ │ │ │ + s.allowed_upload_slots = int(m_stats_counters[counters::num_unchoke_slots]); │ │ │ │
    relevance 1../include/libtorrent/ip_voter.hpp:130have one instance per possible subnet, 192.168.x.x, 10.x.x.x, etc.

    have one instance per possible subnet, 192.168.x.x, 10.x.x.x, etc.

    ../include/libtorrent/ip_voter.hpp:130

    	// stores one address for each combination of local/global and ipv4/ipv6
    │ │ │ │  	// use of this class should be avoided, get the IP from the appropriate
    │ │ │ │  	// listen interface wherever possible
    │ │ │ │  	struct TORRENT_EXTRA_EXPORT external_ip
    │ │ │ │  	{
    │ │ │ │  		external_ip()
    │ │ │ │  			: m_addresses{{address_v4(), address_v6()}, {address_v4(), address_v6()}}
    │ │ │ │ @@ -4679,190 +4679,268 @@
    │ │ │ │  		// [n][0] = IPv4 [n][1] = IPv6
    │ │ │ │  
    address m_addresses[2][2]; │ │ │ │
    }; │ │ │ │ │ │ │ │ } │ │ │ │ │ │ │ │ #endif │ │ │ │ -
    relevance 0../test/test_ssl.cpp:407test using a signed certificate with the wrong info-hash in DN

    test using a signed certificate with the wrong info-hash in DN

    ../test/test_ssl.cpp:407

    	// in verifying peers
    │ │ │ │ -	ctx.set_verify_mode(context::verify_none, ec);
    │ │ │ │ -	if (ec)
    │ │ │ │ -	{
    │ │ │ │ -		std::printf("Failed to set SSL verify mode: %s\n"
    │ │ │ │ -			, ec.message().c_str());
    │ │ │ │ -		TEST_CHECK(!ec);
    │ │ │ │ -		return false;
    │ │ │ │ -	}
    │ │ │ │ +
    relevance 0../test/test_peer_list.cpp:1241test erasing peers

    test erasing peers

    ../test/test_peer_list.cpp:1241

    relevance 0../test/test_peer_list.cpp:1242test update_peer_port with allow_multiple_connections_per_ip and without

    test update_peer_port with allow_multiple_connections_per_ip and without

    ../test/test_peer_list.cpp:1242

    relevance 0../test/test_peer_list.cpp:1243test add i2p peers

    test add i2p peers

    ../test/test_peer_list.cpp:1243

    relevance 0../test/test_peer_list.cpp:1244test allow_i2p_mixed

    test allow_i2p_mixed

    ../test/test_peer_list.cpp:1244

    relevance 0../test/test_peer_list.cpp:1245test insert_peer failing with all error conditions

    test insert_peer failing with all error conditions

    ../test/test_peer_list.cpp:1245

    relevance 0../test/test_peer_list.cpp:1246test IPv6

    test IPv6

    ../test/test_peer_list.cpp:1246

    relevance 0../test/test_peer_list.cpp:1247test connect_to_peer() failing

    test connect_to_peer() failing

    ../test/test_peer_list.cpp:1247

    relevance 0../test/test_peer_list.cpp:1248test connection_closed

    test connection_closed

    ../test/test_peer_list.cpp:1248

    relevance 0../test/test_peer_list.cpp:1249connect candidates recalculation when incrementing failcount

    connect candidates recalculation when incrementing failcount

    ../test/test_peer_list.cpp:1249

    relevance 0../test/test_transfer.cpp:173these settings_pack tests belong in their own test

    these settings_pack tests belong in their own test

    ../test/test_transfer.cpp:173

    	// to the time it will take to complete the test
    │ │ │ │ +	pack.set_int(settings_pack::min_reconnect_time, 0);
    │ │ │ │ +	pack.set_int(settings_pack::stop_tracker_timeout, 1);
    │ │ │ │ +	pack.set_bool(settings_pack::announce_to_all_trackers, true);
    │ │ │ │ +	pack.set_bool(settings_pack::announce_to_all_tiers, true);
    │ │ │ │  
    │ │ │ │ -	std::string certificate = combine_path("..", combine_path("ssl", "peer_certificate.pem"));
    │ │ │ │ -	std::string private_key = combine_path("..", combine_path("ssl", "peer_private_key.pem"));
    │ │ │ │ -	std::string dh_params = combine_path("..", combine_path("ssl", "dhparams.pem"));
    │ │ │ │ +	// make sure we announce to both http and udp trackers
    │ │ │ │ +	pack.set_bool(settings_pack::prefer_udp_trackers, false);
    │ │ │ │ +	pack.set_bool(settings_pack::enable_outgoing_utp, false);
    │ │ │ │ +	pack.set_bool(settings_pack::enable_incoming_utp, false);
    │ │ │ │ +	pack.set_bool(settings_pack::enable_lsd, false);
    │ │ │ │ +	pack.set_bool(settings_pack::enable_natpmp, false);
    │ │ │ │ +	pack.set_bool(settings_pack::enable_upnp, false);
    │ │ │ │ +	pack.set_bool(settings_pack::enable_dht, false);
    │ │ │ │  
    │ │ │ │ -	if (flags & invalid_certificate)
    │ │ │ │ -	{
    │ │ │ │ -		certificate = combine_path("..", combine_path("ssl", "invalid_peer_certificate.pem"));
    │ │ │ │ -		private_key = combine_path("..", combine_path("ssl", "invalid_peer_private_key.pem"));
    │ │ │ │ +	pack.set_int(settings_pack::out_enc_policy, settings_pack::pe_disabled);
    │ │ │ │ +	pack.set_int(settings_pack::in_enc_policy, settings_pack::pe_disabled);
    │ │ │ │ +
    │ │ │ │ +	pack.set_bool(settings_pack::allow_multiple_connections_per_ip, false);
    │ │ │ │ +
    │ │ │ │ +
    pack.set_int(settings_pack::unchoke_slots_limit, 0); │ │ │ │ +
    ses1.apply_settings(pack); │ │ │ │ + TEST_CHECK(ses1.get_settings().get_int(settings_pack::unchoke_slots_limit) == 0); │ │ │ │ + │ │ │ │ + pack.set_int(settings_pack::unchoke_slots_limit, -1); │ │ │ │ + ses1.apply_settings(pack); │ │ │ │ + TEST_CHECK(ses1.get_settings().get_int(settings_pack::unchoke_slots_limit) == -1); │ │ │ │ + │ │ │ │ + pack.set_int(settings_pack::unchoke_slots_limit, 8); │ │ │ │ + ses1.apply_settings(pack); │ │ │ │ + TEST_CHECK(ses1.get_settings().get_int(settings_pack::unchoke_slots_limit) == 8); │ │ │ │ + │ │ │ │ + ses2.apply_settings(pack); │ │ │ │ + │ │ │ │ + torrent_handle tor1; │ │ │ │ + torrent_handle tor2; │ │ │ │ + │ │ │ │ + create_directory("tmp1_transfer", ec); │ │ │ │ + std::ofstream file("tmp1_transfer/temporary"); │ │ │ │ + std::shared_ptr<torrent_info> t = ::create_torrent(&file, "temporary", 32 * 1024, 13, false); │ │ │ │ + file.close(); │ │ │ │ + │ │ │ │ + TEST_CHECK(exists(combine_path("tmp1_transfer", "temporary"))); │ │ │ │ + │ │ │ │ + add_torrent_params params; │ │ │ │ + params.storage_mode = storage_mode; │ │ │ │ + params.flags &= ~torrent_flags::paused; │ │ │ │ + params.flags &= ~torrent_flags::auto_managed; │ │ │ │ + │ │ │ │ + wait_for_listen(ses1, "ses1"); │ │ │ │ + wait_for_listen(ses2, "ses2"); │ │ │ │ +
    relevance 0../test/test_resume.cpp:582test what happens when loading a resume file with both piece priorities and file priorities (file prio should take precedence)

    test what happens when loading a resume file with both piece priorities │ │ │ │ +and file priorities (file prio should take precedence)

    ../test/test_resume.cpp:582

    		{
    │ │ │ │ +			TEST_EQUAL(pieces[i], true);
    │ │ │ │ +		}
    │ │ │ │  	}
    │ │ │ │ +}
    │ │ │ │ +
    │ │ │ │ +} // anonymous namespace
    │ │ │ │ +
    │ │ │ │ +TORRENT_TEST(piece_slots_seed)
    │ │ │ │ +{
    │ │ │ │ +	test_piece_slots_seed(settings());
    │ │ │ │ +}
    │ │ │ │ +
    │ │ │ │ +TORRENT_TEST(piece_slots_seed_suggest_cache)
    │ │ │ │ +{
    │ │ │ │ +	settings_pack sett = settings();
    │ │ │ │ +	sett.set_int(settings_pack::suggest_mode, settings_pack::suggest_read_cache);
    │ │ │ │ +	test_piece_slots_seed(sett);
    │ │ │ │ +}
    │ │ │ │  
    │ │ │ │  
    │ │ │ │ -
    if (flags & (valid_certificate | invalid_certificate)) │ │ │ │ - { │ │ │ │ - std::printf("set_password_callback\n"); │ │ │ │ - ctx.set_password_callback( │ │ │ │ - [](std::size_t, context::password_purpose) { return "test"; } │ │ │ │ - , ec); │ │ │ │ - if (ec) │ │ │ │ - { │ │ │ │ - std::printf("Failed to set certificate passphrase: %s\n" │ │ │ │ - , ec.message().c_str()); │ │ │ │ - TEST_CHECK(!ec); │ │ │ │ - return false; │ │ │ │ - } │ │ │ │ - std::printf("use_certificate_file \"%s\"\n", certificate.c_str()); │ │ │ │ - ctx.use_certificate_file(certificate, context::pem, ec); │ │ │ │ - if (ec) │ │ │ │ - { │ │ │ │ - std::printf("Failed to set certificate file: %s\n" │ │ │ │ - , ec.message().c_str()); │ │ │ │ - TEST_CHECK(!ec); │ │ │ │ - return false; │ │ │ │ +
    relevance 0../test/test_resume.cpp:585make sure a resume file only ever contain file priorities OR piece priorities. Never both.

    make sure a resume file only ever contain file priorities OR piece │ │ │ │ +priorities. Never both.

    ../test/test_resume.cpp:585

    			TEST_EQUAL(pieces[i], true);
    │ │ │ │  		}
    │ │ │ │ -		std::printf("use_private_key_file \"%s\"\n", private_key.c_str());
    │ │ │ │ -		ctx.use_private_key_file(private_key, context::pem, ec);
    │ │ │ │ -		if (ec)
    │ │ │ │ -		{
    │ │ │ │ -			std::printf("Failed to set private key: %s\n"
    │ │ │ │ -				, ec.message().c_str());
    │ │ │ │ -			TEST_CHECK(!ec);
    │ │ │ │ -			return false;
    │ │ │ │ -
    relevance 0../test/test_ssl.cpp:509also test using a hash that refers to a valid torrent but that differs from the SNI hash

    also test using a hash that refers to a valid torrent │ │ │ │ -but that differs from the SNI hash

    ../test/test_ssl.cpp:509

    	print_alerts(ses1, "ses1", true, true, &on_alert);
    │ │ │ │ -	if (ec)
    │ │ │ │ -	{
    │ │ │ │ -		std::printf("Failed SSL handshake: %s\n"
    │ │ │ │ -			, ec.message().c_str());
    │ │ │ │ -		return false;
    │ │ │ │  	}
    │ │ │ │ +}
    │ │ │ │  
    │ │ │ │ -	char handshake[] = "\x13" "BitTorrent protocol\0\0\0\0\0\0\0\x04"
    │ │ │ │ -		"                    " // space for info-hash
    │ │ │ │ -		"aaaaaaaaaaaaaaaaaaaa" // peer-id
    │ │ │ │ -		"\0\0\0\x01\x02"; // interested
    │ │ │ │ +} // anonymous namespace
    │ │ │ │  
    │ │ │ │ -	// fill in the info-hash
    │ │ │ │ -	if (flags & valid_bittorrent_hash)
    │ │ │ │ -	{
    │ │ │ │ -		std::memcpy(handshake + 28, &t->info_hashes().v1[0], 20);
    │ │ │ │ -	}
    │ │ │ │ -	else
    │ │ │ │ -	{
    │ │ │ │ -
    std::generate(handshake + 28, handshake + 48, &rand); │ │ │ │ -
    } │ │ │ │ +TORRENT_TEST(piece_slots_seed) │ │ │ │ +{ │ │ │ │ + test_piece_slots_seed(settings()); │ │ │ │ +} │ │ │ │ │ │ │ │ - // fill in the peer-id │ │ │ │ - std::generate(handshake + 48, handshake + 68, &rand); │ │ │ │ +TORRENT_TEST(piece_slots_seed_suggest_cache) │ │ │ │ +{ │ │ │ │ + settings_pack sett = settings(); │ │ │ │ + sett.set_int(settings_pack::suggest_mode, settings_pack::suggest_read_cache); │ │ │ │ + test_piece_slots_seed(sett); │ │ │ │ +} │ │ │ │ │ │ │ │ - std::printf("bittorrent handshake\n"); │ │ │ │ - boost::asio::write(ssl_sock, boost::asio::buffer(handshake, (sizeof(handshake) - 1)), ec); │ │ │ │ - print_alerts(ses1, "ses1", true, true, &on_alert); │ │ │ │ - if (ec) │ │ │ │ - { │ │ │ │ - std::printf("failed to write bittorrent handshake: %s\n" │ │ │ │ - , ec.message().c_str()); │ │ │ │ - return false; │ │ │ │ - } │ │ │ │ │ │ │ │ - char buf[68]; │ │ │ │ - std::printf("read bittorrent handshake\n"); │ │ │ │ - boost::asio::read(ssl_sock, boost::asio::buffer(buf, sizeof(buf)), ec); │ │ │ │ - print_alerts(ses1, "ses1", true, true, &on_alert); │ │ │ │ - if (ec) │ │ │ │ - { │ │ │ │ - std::printf("failed to read bittorrent handshake: %s\n" │ │ │ │ - , ec.message().c_str()); │ │ │ │ - return false; │ │ │ │ +
    │ │ │ │ +
    relevance 0../test/test_resume.cpp:588generally save

    generally save

    ../test/test_resume.cpp:588

    		}
    │ │ │ │  	}
    │ │ │ │ +}
    │ │ │ │  
    │ │ │ │ -	if (memcmp(buf, "\x13" "BitTorrent protocol", 20) != 0)
    │ │ │ │ -	{
    │ │ │ │ -		std::printf("invalid bittorrent handshake\n");
    │ │ │ │ -		return false;
    │ │ │ │ -
    relevance 0../test/test_upnp.cpp:156store the log and verify that some key messages are there

    store the log and verify that some key messages are there

    ../test/test_upnp.cpp:156

    			, portmap_protocol const protocol, error_code const& err
    │ │ │ │ -			, portmap_transport, aux::listen_socket_handle const&) override
    │ │ │ │ -		{
    │ │ │ │ -			callback_info info = {mapping, port, err};
    │ │ │ │ -			callbacks.push_back(info);
    │ │ │ │ -			std::cout << "mapping: " << static_cast<int>(mapping)
    │ │ │ │ -				<< ", port: " << port << ", IP: " << ip
    │ │ │ │ -				<< ", proto: " << static_cast<int>(protocol)
    │ │ │ │ -				<< ", error: \"" << err.message() << "\"\n";
    │ │ │ │ -		}
    │ │ │ │ -	#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -		bool should_log_portmap(portmap_transport) const override
    │ │ │ │ -		{
    │ │ │ │ -			return true;
    │ │ │ │ -		}
    │ │ │ │ +} // anonymous namespace
    │ │ │ │  
    │ │ │ │ -		void log_portmap(portmap_transport, char const* msg
    │ │ │ │ -			, aux::listen_socket_handle const&) const override
    │ │ │ │ -		{
    │ │ │ │ -			std::cout << "UPnP: " << msg << std::endl;
    │ │ │ │ -
    } │ │ │ │ -
    #endif │ │ │ │ - }; │ │ │ │ +TORRENT_TEST(piece_slots_seed) │ │ │ │ +{ │ │ │ │ + test_piece_slots_seed(settings()); │ │ │ │ +} │ │ │ │ │ │ │ │ -ip_interface pick_upnp_interface() │ │ │ │ +TORRENT_TEST(piece_slots_seed_suggest_cache) │ │ │ │ { │ │ │ │ - lt::io_context ios; │ │ │ │ - error_code ec; │ │ │ │ - std::vector<ip_route> const routes = enum_routes(ios, ec); │ │ │ │ - if (ec) │ │ │ │ - { │ │ │ │ - std::cerr << "failed to enumerate routes: " << ec.message() << '\n'; │ │ │ │ - TEST_CHECK(false); │ │ │ │ - return {}; │ │ │ │ - } │ │ │ │ - std::vector<ip_interface> const ifs = enum_net_interfaces(ios, ec); │ │ │ │ - if (ec) │ │ │ │ - { │ │ │ │ - std::cerr << "failed to enumerate network interfaces: " << ec.message() << '\n'; │ │ │ │ - TEST_CHECK(false); │ │ │ │ - return {}; │ │ │ │ - } │ │ │ │ - int idx = 0; │ │ │ │ - for (auto const& face : ifs) │ │ │ │ - { │ │ │ │ - if (!face.interface_address.is_v4()) continue; │ │ │ │ - std::cout << " - " << idx │ │ │ │ - << ' ' << face.interface_address.to_string() │ │ │ │ - << ' ' << int(static_cast<std::uint8_t>(face.state)) │ │ │ │ - << ' ' << static_cast<std::uint32_t>(face.flags) │ │ │ │ - << ' ' << face.name << '\n'; │ │ │ │ -
    relevance 0../test/test_bloom_filter.cpp:135test size()

    test size()

    ../test/test_bloom_filter.cpp:135

    relevance 0../test/test_bloom_filter.cpp:136test clear()

    test clear()

    ../test/test_bloom_filter.cpp:136

    	sha1_hash k("\x01\x00\x02\x00                ");
    │ │ │ │ -	TEST_CHECK(!filter.find(k));
    │ │ │ │ -	filter.set(k);
    │ │ │ │ -	TEST_CHECK(filter.find(k));
    │ │ │ │ +	settings_pack sett = settings();
    │ │ │ │ +	sett.set_int(settings_pack::suggest_mode, settings_pack::suggest_read_cache);
    │ │ │ │ +	test_piece_slots_seed(sett);
    │ │ │ │ +}
    │ │ │ │  
    │ │ │ │ -	std::uint8_t compare[4] = { 0x16, 0xff, 0x55, 0xaa};
    │ │ │ │  
    │ │ │ │ -	bits_out = filter.to_string();
    │ │ │ │ -	TEST_EQUAL(memcmp(compare, bits_out.c_str(), 4), 0);
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    #if TORRENT_ABI_VERSION == 1 │ │ │ │ +TORRENT_TEST(file_priorities_default_deprecated) │ │ │ │ +{ │ │ │ │ + lt::session ses(settings()); │ │ │ │ + std::vector<download_priority_t> file_priorities = test_resume_flags(ses │ │ │ │ + , {}, "", "", true).get_file_priorities(); │ │ │ │ + │ │ │ │ + TEST_EQUAL(file_priorities.size(), 3); │ │ │ │ + TEST_EQUAL(file_priorities[0], 4); │ │ │ │ + TEST_EQUAL(file_priorities[1], 4); │ │ │ │ + TEST_EQUAL(file_priorities[2], 4); │ │ │ │ } │ │ │ │ │ │ │ │ -} // anonymous namespace │ │ │ │ +// As long as the add_torrent_params priorities are empty, the file_priorities │ │ │ │ +// from the resume data should take effect │ │ │ │ +TORRENT_TEST(file_priorities_in_resume_deprecated) │ │ │ │ +{ │ │ │ │ + lt::session ses(settings()); │ │ │ │ + std::vector<download_priority_t> file_priorities = test_resume_flags(ses, {}, "", "123").get_file_priorities(); │ │ │ │ │ │ │ │ -TORRENT_TEST(bloom_filter) │ │ │ │ + TEST_EQUAL(file_priorities.size(), 3); │ │ │ │ + TEST_EQUAL(file_priorities[0], 1); │ │ │ │ + TEST_EQUAL(file_priorities[1], 2); │ │ │ │ + TEST_EQUAL(file_priorities[2], 3); │ │ │ │ +} │ │ │ │ + │ │ │ │ +// if both resume data and add_torrent_params has file_priorities, the │ │ │ │ +// add_torrent_params one take precedence │ │ │ │ +TORRENT_TEST(file_priorities_in_resume_and_params_deprecated) │ │ │ │ { │ │ │ │ - test_set_and_get(); │ │ │ │ - test_set_bits(); │ │ │ │ - test_count_zeroes(); │ │ │ │ - test_to_from_string(); │ │ │ │ +
    relevance 0../test/test_resume.cpp:911test all other resume flags here too. This would require returning more than just the torrent_status from test_resume_flags. Also http seeds and trackers for instance

    test all other resume flags here too. This would require returning │ │ │ │ +more than just the torrent_status from test_resume_flags. Also http seeds │ │ │ │ +and trackers for instance

    ../test/test_resume.cpp:911

    	TEST_EQUAL(s.connections_limit, 1345);
    │ │ │ │ +	TEST_EQUAL(s.uploads_limit, 1346);
    │ │ │ │ +}
    │ │ │ │ +
    │ │ │ │ +TORRENT_TEST(paused_deprecated)
    │ │ │ │ +{
    │ │ │ │ +	lt::session ses(settings());
    │ │ │ │ +	// resume data overrides the paused flag
    │ │ │ │ +	auto const now = lt::clock_type::now();
    │ │ │ │ +	torrent_status s = test_resume_flags(ses, torrent_flags::paused, "", "", true).status();
    │ │ │ │ +	default_tests(s, now);
    │ │ │ │ +#ifdef TORRENT_WINDOWS
    │ │ │ │ +	TEST_EQUAL(s.save_path, "c:\\add_torrent_params save_path");
    │ │ │ │ +#else
    │ │ │ │ +	TEST_EQUAL(s.save_path, "/add_torrent_params save_path");
    │ │ │ │ +#endif
    │ │ │ │ +	TEST_EQUAL(s.flags & flags_mask, torrent_flags_t{});
    │ │ │ │ +	TEST_EQUAL(s.connections_limit, 1345);
    │ │ │ │ +	TEST_EQUAL(s.uploads_limit, 1346);
    │ │ │ │ +
    │ │ │ │ +
    } │ │ │ │ +
    │ │ │ │ +TORRENT_TEST(url_seed_resume_data_deprecated) │ │ │ │ +{ │ │ │ │ + // merge url seeds with resume data │ │ │ │ + std::printf("flags: merge_resume_http_seeds\n"); │ │ │ │ + lt::session ses(settings()); │ │ │ │ + torrent_handle h = test_resume_flags(ses, │ │ │ │ + torrent_flags::merge_resume_http_seeds, "", "", true); │ │ │ │ + std::set<std::string> us = h.url_seeds(); │ │ │ │ + std::set<std::string> ws = h.http_seeds(); │ │ │ │ + │ │ │ │ + TEST_EQUAL(us.size(), 3); │ │ │ │ + TEST_EQUAL(std::count(us.begin(), us.end() │ │ │ │ + , "http://add_torrent_params_url_seed.com/"), 1); │ │ │ │ + TEST_EQUAL(std::count(us.begin(), us.end() │ │ │ │ + , "http://torrent_file_url_seed.com/"), 1); │ │ │ │ + TEST_EQUAL(std::count(us.begin(), us.end() │ │ │ │ + , "http://resume_data_url_seed.com/"), 1); │ │ │ │ + │ │ │ │ + TEST_EQUAL(ws.size(), 1); │ │ │ │ + TEST_EQUAL(std::count(ws.begin(), ws.end() │ │ │ │ + , "http://resume_data_http_seed.com"), 1); │ │ │ │ +} │ │ │ │ + │ │ │ │ +TORRENT_TEST(resume_override_torrent_deprecated) │ │ │ │ +{ │ │ │ │ + // resume data overrides the .torrent_file │ │ │ │ + std::printf("flags: no merge_resume_http_seed\n"); │ │ │ │ + lt::session ses(settings()); │ │ │ │ + torrent_handle h = test_resume_flags(ses, │ │ │ │ +
    relevance 0../test/test_resume.cpp:1683test all other resume flags here too. This would require returning more than just the torrent_status from test_resume_flags. Also http seeds and trackers for instance

    test all other resume flags here too. This would require returning │ │ │ │ +more than just the torrent_status from test_resume_flags. Also http seeds │ │ │ │ +and trackers for instance

    ../test/test_resume.cpp:1683

    	TEST_EQUAL(s.connections_limit, 1345);
    │ │ │ │ +	TEST_EQUAL(s.uploads_limit, 1346);
    │ │ │ │ +}
    │ │ │ │ +
    │ │ │ │ +TORRENT_TEST(paused)
    │ │ │ │ +{
    │ │ │ │ +	lt::session ses(settings());
    │ │ │ │ +	// resume data overrides the paused flag
    │ │ │ │ +	auto const now = lt::clock_type::now();
    │ │ │ │ +	torrent_status s = test_resume_flags(ses, torrent_flags::paused).status();
    │ │ │ │ +	default_tests(s, now);
    │ │ │ │ +#ifdef TORRENT_WINDOWS
    │ │ │ │ +	TEST_EQUAL(s.save_path, "c:\\add_torrent_params save_path");
    │ │ │ │ +#else
    │ │ │ │ +	TEST_EQUAL(s.save_path, "/add_torrent_params save_path");
    │ │ │ │ +#endif
    │ │ │ │ +	TEST_EQUAL(s.flags & flags_mask, torrent_flags::paused);
    │ │ │ │ +	TEST_EQUAL(s.connections_limit, 1345);
    │ │ │ │ +	TEST_EQUAL(s.uploads_limit, 1346);
    │ │ │ │  
    │ │ │ │  
    } │ │ │ │ -
    relevance 0../test/test_merkle_tree.cpp:233use structured bindings in C++17

    use structured bindings in C++17

    ../test/test_merkle_tree.cpp:233

    			mask[std::size_t(i)] = true;
    │ │ │ │ +
    │ │ │ │ +TORRENT_TEST(no_metadata) │ │ │ │ +{ │ │ │ │ + lt::session ses(settings()); │ │ │ │ + │ │ │ │ + add_torrent_params p; │ │ │ │ + p.info_hashes.v1 = sha1_hash("abababababababababab"); │ │ │ │ + p.save_path = "."; │ │ │ │ + p.name = "foobar"; │ │ │ │ + torrent_handle h = ses.add_torrent(p); │ │ │ │ + h.save_resume_data(torrent_handle::save_info_dict); │ │ │ │ + alert const* a = wait_for_alert(ses, save_resume_data_alert::alert_type); │ │ │ │ + TEST_CHECK(a); │ │ │ │ + save_resume_data_alert const* ra = alert_cast<save_resume_data_alert>(a); │ │ │ │ + TEST_CHECK(ra); │ │ │ │ + if (ra) │ │ │ │ + { │ │ │ │ + auto const& atp = ra->params; │ │ │ │ + TEST_EQUAL(atp.info_hashes, p.info_hashes); │ │ │ │ + TEST_EQUAL(atp.name, "foobar"); │ │ │ │ + } │ │ │ │ +} │ │ │ │ + │ │ │ │ +template <typename Fun> │ │ │ │ +void test_unfinished_pieces(Fun f) │ │ │ │ +{ │ │ │ │ + // create a torrent and complete files │ │ │ │ + std::shared_ptr<torrent_info> ti = generate_torrent(true, true); │ │ │ │ + │ │ │ │ + add_torrent_params p; │ │ │ │ +relevance 0../test/test_fast_extension.cpp:1135test sending invalid requests (out of bound piece index, offsets and sizes)

    test sending invalid requests (out of bound piece index, offsets and │ │ │ │ +sizes)

    ../test/test_fast_extension.cpp:1135

    relevance 0../test/test_merkle_tree.cpp:233use structured bindings in C++17

    use structured bindings in C++17

    ../test/test_merkle_tree.cpp:233

    			mask[std::size_t(i)] = true;
    │ │ │ │  		t.load_sparse_tree(span<sha256_hash const>(f).subspan(first_piece, num_pieces), mask, empty_verified);
    │ │ │ │  		int const end_piece_layer = first_piece + merkle_num_leafs(num_pieces);
    │ │ │ │  		for (int i = 0; i < end_piece_layer; ++i)
    │ │ │ │  		{
    │ │ │ │  			TEST_CHECK(t.has_node(i));
    │ │ │ │  			TEST_CHECK(t.compare_node(i, f[i]));
    │ │ │ │  		}
    │ │ │ │ @@ -4905,15 +4983,15 @@
    │ │ │ │  TORRENT_TEST(roundtrip_empty_tree)
    │ │ │ │  {
    │ │ │ │  	aux::merkle_tree t(num_blocks, 1, f[0].data());
    │ │ │ │  	test_roundtrip(t, num_blocks, 1);
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │  TORRENT_TEST(roundtrip_full_tree)
    │ │ │ │ -
    relevance 0../test/test_merkle_tree.cpp:938add test for load_piece_layer()

    add test for load_piece_layer()

    ../test/test_merkle_tree.cpp:938

    relevance 0../test/test_merkle_tree.cpp:939add test for add_hashes() with an odd number of blocks

    add test for add_hashes() with an odd number of blocks

    ../test/test_merkle_tree.cpp:939

    relevance 0../test/test_merkle_tree.cpp:940add test for set_block() (setting the last block) with an odd number of blocks

    add test for set_block() (setting the last block) with an odd number of blocks

    ../test/test_merkle_tree.cpp:940

    │ │ │ │ +
    relevance 0../test/test_merkle_tree.cpp:938add test for load_piece_layer()

    add test for load_piece_layer()

    ../test/test_merkle_tree.cpp:938

    relevance 0../test/test_merkle_tree.cpp:939add test for add_hashes() with an odd number of blocks

    add test for add_hashes() with an odd number of blocks

    ../test/test_merkle_tree.cpp:939

    relevance 0../test/test_merkle_tree.cpp:940add test for set_block() (setting the last block) with an odd number of blocks

    add test for set_block() (setting the last block) with an odd number of blocks

    ../test/test_merkle_tree.cpp:940

    │ │ │ │  		for (int i = 0; i < 7; ++i)
    │ │ │ │  			TEST_EQUAL(t[i], f[i]);
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │  	// use a proof that ties the first piece node 3 (since we don't need it all
    │ │ │ │  	// the way to the root).
    │ │ │ │  	auto const result = t.add_hashes(127, pdiff(1), range(f, 127, 4), build_proof(f, 31, 3));
    │ │ │ │ @@ -4926,17 +5004,17 @@
    │ │ │ │  	for (int i = 127; i < 127 + 4; ++i)
    │ │ │ │  		TEST_CHECK(t[i] == f[i]);
    │ │ │ │  
    │ │ │ │  	TEST_CHECK(t.verified_leafs() == none_set(num_blocks));
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │  
    │ │ │ │ -
    relevance 0../test/test_file_storage.cpp:1208test file attributes

    test file attributes

    ../test/test_file_storage.cpp:1208

    relevance 0../test/test_file_storage.cpp:1209test symlinks

    test symlinks

    ../test/test_file_storage.cpp:1209

    relevance 0../test/test_torrent_info.cpp:459test remap_files

    test remap_files

    ../test/test_torrent_info.cpp:459

    relevance 0../test/test_torrent_info.cpp:460torrent with 'p' (padfile) attribute

    torrent with 'p' (padfile) attribute

    ../test/test_torrent_info.cpp:460

    relevance 0../test/test_torrent_info.cpp:461torrent with 'h' (hidden) attribute

    torrent with 'h' (hidden) attribute

    ../test/test_torrent_info.cpp:461

    relevance 0../test/test_torrent_info.cpp:462torrent with 'x' (executable) attribute

    torrent with 'x' (executable) attribute

    ../test/test_torrent_info.cpp:462

    relevance 0../test/test_torrent_info.cpp:463torrent with 'l' (symlink) attribute

    torrent with 'l' (symlink) attribute

    ../test/test_torrent_info.cpp:463

    relevance 0../test/test_torrent_info.cpp:464torrent with multiple trackers in multiple tiers, making sure we shuffle them (how do you test shuffling?, load it multiple times and make sure it's in different order at least once)

    torrent with multiple trackers in multiple tiers, making sure we │ │ │ │ +

    relevance 0../test/test_file_storage.cpp:1208test file attributes

    test file attributes

    ../test/test_file_storage.cpp:1208

    relevance 0../test/test_file_storage.cpp:1209test symlinks

    test symlinks

    ../test/test_file_storage.cpp:1209

    relevance 0../test/test_torrent_info.cpp:459test remap_files

    test remap_files

    ../test/test_torrent_info.cpp:459

    relevance 0../test/test_torrent_info.cpp:460torrent with 'p' (padfile) attribute

    torrent with 'p' (padfile) attribute

    ../test/test_torrent_info.cpp:460

    relevance 0../test/test_torrent_info.cpp:461torrent with 'h' (hidden) attribute

    torrent with 'h' (hidden) attribute

    ../test/test_torrent_info.cpp:461

    relevance 0../test/test_torrent_info.cpp:462torrent with 'x' (executable) attribute

    torrent with 'x' (executable) attribute

    ../test/test_torrent_info.cpp:462

    relevance 0../test/test_torrent_info.cpp:463torrent with 'l' (symlink) attribute

    torrent with 'l' (symlink) attribute

    ../test/test_torrent_info.cpp:463

    relevance 0../test/test_torrent_info.cpp:464torrent with multiple trackers in multiple tiers, making sure we shuffle them (how do you test shuffling?, load it multiple times and make sure it's in different order at least once)

    torrent with multiple trackers in multiple tiers, making sure we │ │ │ │ shuffle them (how do you test shuffling?, load it multiple times and make │ │ │ │ -sure it's in different order at least once)

    ../test/test_torrent_info.cpp:464

    relevance 0../test/test_torrent_info.cpp:467torrents with a zero-length name

    torrents with a zero-length name

    ../test/test_torrent_info.cpp:467

    relevance 0../test/test_torrent_info.cpp:468torrent with a non-dictionary info-section

    torrent with a non-dictionary info-section

    ../test/test_torrent_info.cpp:468

    relevance 0../test/test_torrent_info.cpp:469torrents with DHT nodes

    torrents with DHT nodes

    ../test/test_torrent_info.cpp:469

    relevance 0../test/test_torrent_info.cpp:470torrent with url-list as a single string

    torrent with url-list as a single string

    ../test/test_torrent_info.cpp:470

    relevance 0../test/test_torrent_info.cpp:471torrent with http seed as a single string

    torrent with http seed as a single string

    ../test/test_torrent_info.cpp:471

    relevance 0../test/test_torrent_info.cpp:472torrent with a comment

    torrent with a comment

    ../test/test_torrent_info.cpp:472

    relevance 0../test/test_torrent_info.cpp:473torrent with an SSL cert

    torrent with an SSL cert

    ../test/test_torrent_info.cpp:473

    relevance 0../test/test_torrent_info.cpp:474torrent with attributes (executable and hidden)

    torrent with attributes (executable and hidden)

    ../test/test_torrent_info.cpp:474

    relevance 0../test/test_torrent_info.cpp:475torrent_info constructor that takes an invalid bencoded buffer

    torrent_info constructor that takes an invalid bencoded buffer

    ../test/test_torrent_info.cpp:475

    relevance 0../test/test_torrent_info.cpp:476verify_encoding with a string that triggers character replacement

    verify_encoding with a string that triggers character replacement

    ../test/test_torrent_info.cpp:476

    	{ "v2_non_multiple_piece_layer.torrent", errors::torrent_invalid_piece_layer},
    │ │ │ │ +sure it's in different order at least once)

    ../test/test_torrent_info.cpp:464

    relevance 0../test/test_torrent_info.cpp:467torrents with a zero-length name

    torrents with a zero-length name

    ../test/test_torrent_info.cpp:467

    relevance 0../test/test_torrent_info.cpp:468torrent with a non-dictionary info-section

    torrent with a non-dictionary info-section

    ../test/test_torrent_info.cpp:468

    relevance 0../test/test_torrent_info.cpp:469torrents with DHT nodes

    torrents with DHT nodes

    ../test/test_torrent_info.cpp:469

    relevance 0../test/test_torrent_info.cpp:470torrent with url-list as a single string

    torrent with url-list as a single string

    ../test/test_torrent_info.cpp:470

    relevance 0../test/test_torrent_info.cpp:471torrent with http seed as a single string

    torrent with http seed as a single string

    ../test/test_torrent_info.cpp:471

    relevance 0../test/test_torrent_info.cpp:472torrent with a comment

    torrent with a comment

    ../test/test_torrent_info.cpp:472

    relevance 0../test/test_torrent_info.cpp:473torrent with an SSL cert

    torrent with an SSL cert

    ../test/test_torrent_info.cpp:473

    relevance 0../test/test_torrent_info.cpp:474torrent with attributes (executable and hidden)

    torrent with attributes (executable and hidden)

    ../test/test_torrent_info.cpp:474

    relevance 0../test/test_torrent_info.cpp:475torrent_info constructor that takes an invalid bencoded buffer

    torrent_info constructor that takes an invalid bencoded buffer

    ../test/test_torrent_info.cpp:475

    relevance 0../test/test_torrent_info.cpp:476verify_encoding with a string that triggers character replacement

    verify_encoding with a string that triggers character replacement

    ../test/test_torrent_info.cpp:476

    	{ "v2_non_multiple_piece_layer.torrent", errors::torrent_invalid_piece_layer},
    │ │ │ │  	{ "v2_piece_layer_invalid_file_hash.torrent", errors::torrent_invalid_piece_layer},
    │ │ │ │  	{ "v2_invalid_piece_layer.torrent", errors::torrent_invalid_piece_layer},
    │ │ │ │  	{ "v2_invalid_piece_layer_root.torrent", errors::torrent_invalid_piece_layer},
    │ │ │ │  	{ "v2_unknown_piece_layer_entry.torrent", errors::torrent_invalid_piece_layer},
    │ │ │ │  	{ "v2_invalid_piece_layer_size.torrent", errors::torrent_invalid_piece_layer},
    │ │ │ │  	{ "v2_bad_file_alignment.torrent", errors::torrent_inconsistent_files},
    │ │ │ │  	{ "v2_unordered_files.torrent", errors::invalid_bencoding},
    │ │ │ │ @@ -4979,66 +5057,89 @@
    │ │ │ │  	entry::list_type l;
    │ │ │ │  	l.push_back(entry("http://foo.com/bar1"));
    │ │ │ │  	l.push_back(entry("http://foo.com/bar1"));
    │ │ │ │  	l.push_back(entry("http://foo.com/bar2"));
    │ │ │ │  	entry const e(l);
    │ │ │ │  	entry torrent;
    │ │ │ │  	torrent["url-list"] = e;
    │ │ │ │ -
    relevance 0../test/test_transfer.cpp:173these settings_pack tests belong in their own test

    these settings_pack tests belong in their own test

    ../test/test_transfer.cpp:173

    	// to the time it will take to complete the test
    │ │ │ │ -	pack.set_int(settings_pack::min_reconnect_time, 0);
    │ │ │ │ -	pack.set_int(settings_pack::stop_tracker_timeout, 1);
    │ │ │ │ -	pack.set_bool(settings_pack::announce_to_all_trackers, true);
    │ │ │ │ -	pack.set_bool(settings_pack::announce_to_all_tiers, true);
    │ │ │ │ +
    relevance 0../test/test_resolve_links.cpp:95test files with different piece size (negative test)

    test files with different piece size (negative test)

    ../test/test_resolve_links.cpp:95

    	{ "test2", "test1_pad_files", 0},
    │ │ │ │ +	{ "test3", "test1_pad_files", 0},
    │ │ │ │ +	{ "test2", "test1_single", 0},
    │ │ │ │  
    │ │ │ │ -	// make sure we announce to both http and udp trackers
    │ │ │ │ -	pack.set_bool(settings_pack::prefer_udp_trackers, false);
    │ │ │ │ -	pack.set_bool(settings_pack::enable_outgoing_utp, false);
    │ │ │ │ -	pack.set_bool(settings_pack::enable_incoming_utp, false);
    │ │ │ │ -	pack.set_bool(settings_pack::enable_lsd, false);
    │ │ │ │ -	pack.set_bool(settings_pack::enable_natpmp, false);
    │ │ │ │ -	pack.set_bool(settings_pack::enable_upnp, false);
    │ │ │ │ -	pack.set_bool(settings_pack::enable_dht, false);
    │ │ │ │ +	// these are all padded. The first small file will accidentally also
    │ │ │ │ +	// match, even though it's not tail padded, the following file is identical
    │ │ │ │ +	{ "test2_pad_files", "test1_pad_files", 2},
    │ │ │ │ +	{ "test3_pad_files", "test1_pad_files", 2},
    │ │ │ │ +	{ "test3_pad_files", "test2_pad_files", 2},
    │ │ │ │ +	{ "test1_pad_files", "test2_pad_files", 2},
    │ │ │ │ +	{ "test1_pad_files", "test3_pad_files", 2},
    │ │ │ │ +	{ "test2_pad_files", "test3_pad_files", 2},
    │ │ │ │  
    │ │ │ │ -	pack.set_int(settings_pack::out_enc_policy, settings_pack::pe_disabled);
    │ │ │ │ -	pack.set_int(settings_pack::in_enc_policy, settings_pack::pe_disabled);
    │ │ │ │ +	// one might expect this to work, but since the tail of the single file
    │ │ │ │ +	// torrent is not padded, the last piece hash won't match
    │ │ │ │ +	{ "test1_pad_files", "test1_single", 0},
    │ │ │ │  
    │ │ │ │ -	pack.set_bool(settings_pack::allow_multiple_connections_per_ip, false);
    │ │ │ │ +	// if it's padded on the other hand, it will work
    │ │ │ │ +	{ "test1_pad_files", "test1_single_padded", 1},
    │ │ │ │  
    │ │ │ │ -
    pack.set_int(settings_pack::unchoke_slots_limit, 0); │ │ │ │ -
    ses1.apply_settings(pack); │ │ │ │ - TEST_CHECK(ses1.get_settings().get_int(settings_pack::unchoke_slots_limit) == 0); │ │ │ │ +
    }; │ │ │ │ +
    │ │ │ │ +
    relevance 0../test/test_resolve_links.cpp:98it would be nice to test resolving of more than just 2 files as well. like 3 single file torrents merged into one, resolving all 3 files.

    it would be nice to test resolving of more than just 2 files as well. │ │ │ │ +like 3 single file torrents merged into one, resolving all 3 files.

    ../test/test_resolve_links.cpp:98

    	{ "test2", "test1_single", 0},
    │ │ │ │  
    │ │ │ │ -	pack.set_int(settings_pack::unchoke_slots_limit, -1);
    │ │ │ │ -	ses1.apply_settings(pack);
    │ │ │ │ -	TEST_CHECK(ses1.get_settings().get_int(settings_pack::unchoke_slots_limit) == -1);
    │ │ │ │ +	// these are all padded. The first small file will accidentally also
    │ │ │ │ +	// match, even though it's not tail padded, the following file is identical
    │ │ │ │ +	{ "test2_pad_files", "test1_pad_files", 2},
    │ │ │ │ +	{ "test3_pad_files", "test1_pad_files", 2},
    │ │ │ │ +	{ "test3_pad_files", "test2_pad_files", 2},
    │ │ │ │ +	{ "test1_pad_files", "test2_pad_files", 2},
    │ │ │ │ +	{ "test1_pad_files", "test3_pad_files", 2},
    │ │ │ │ +	{ "test2_pad_files", "test3_pad_files", 2},
    │ │ │ │  
    │ │ │ │ -	pack.set_int(settings_pack::unchoke_slots_limit, 8);
    │ │ │ │ -	ses1.apply_settings(pack);
    │ │ │ │ -	TEST_CHECK(ses1.get_settings().get_int(settings_pack::unchoke_slots_limit) == 8);
    │ │ │ │ +	// one might expect this to work, but since the tail of the single file
    │ │ │ │ +	// torrent is not padded, the last piece hash won't match
    │ │ │ │ +	{ "test1_pad_files", "test1_single", 0},
    │ │ │ │  
    │ │ │ │ -	ses2.apply_settings(pack);
    │ │ │ │ +	// if it's padded on the other hand, it will work
    │ │ │ │ +	{ "test1_pad_files", "test1_single_padded", 1},
    │ │ │ │  
    │ │ │ │ -	torrent_handle tor1;
    │ │ │ │ -	torrent_handle tor2;
    │ │ │ │ +};
    │ │ │ │  
    │ │ │ │ -	create_directory("tmp1_transfer", ec);
    │ │ │ │ -	std::ofstream file("tmp1_transfer/temporary");
    │ │ │ │ -	std::shared_ptr<torrent_info> t = ::create_torrent(&file, "temporary", 32 * 1024, 13, false);
    │ │ │ │ -	file.close();
    │ │ │ │ +
    │ │ │ │ +
    TORRENT_TEST(resolve_links) │ │ │ │ +{ │ │ │ │ + std::string path = combine_path(parent_path(current_working_directory()) │ │ │ │ + , "mutable_test_torrents"); │ │ │ │ │ │ │ │ - TEST_CHECK(exists(combine_path("tmp1_transfer", "temporary"))); │ │ │ │ + for (int i = 0; i < int(sizeof(test_torrents)/sizeof(test_torrents[0])); ++i) │ │ │ │ + { │ │ │ │ + test_torrent_t const& e = test_torrents[i]; │ │ │ │ │ │ │ │ - add_torrent_params params; │ │ │ │ - params.storage_mode = storage_mode; │ │ │ │ - params.flags &= ~torrent_flags::paused; │ │ │ │ - params.flags &= ~torrent_flags::auto_managed; │ │ │ │ + std::string p = combine_path(path, e.filename1) + ".torrent"; │ │ │ │ + std::printf("loading %s\n", p.c_str()); │ │ │ │ + std::shared_ptr<torrent_info> ti1 = std::make_shared<torrent_info>(p); │ │ │ │ │ │ │ │ - wait_for_listen(ses1, "ses1"); │ │ │ │ - wait_for_listen(ses2, "ses2"); │ │ │ │ -
    relevance 0../test/test_timestamp_history.cpp:54test the case where we have > 120 samples (and have the base delay actually be updated)

    test the case where we have > 120 samples (and have the base delay actually be updated)

    ../test/test_timestamp_history.cpp:54

    relevance 0../test/test_timestamp_history.cpp:55test the case where a sample is lower than the history entry but not lower than the base

    test the case where a sample is lower than the history entry but not lower than the base

    ../test/test_timestamp_history.cpp:55

    #include "libtorrent/aux_/timestamp_history.hpp"
    │ │ │ │ +		p = combine_path(path, e.filename2) + ".torrent";
    │ │ │ │ +		std::printf("loading %s\n", p.c_str());
    │ │ │ │ +		std::shared_ptr<torrent_info> ti2 = std::make_shared<torrent_info>(p);
    │ │ │ │ +
    │ │ │ │ +		std::printf("resolving\n");
    │ │ │ │ +		resolve_links l(ti1);
    │ │ │ │ +		l.match(ti2, ".");
    │ │ │ │ +
    │ │ │ │ +		aux::vector<resolve_links::link_t, file_index_t> const& links = l.get_links();
    │ │ │ │ +
    │ │ │ │ +		auto const num_matches = std::size_t(std::count_if(links.begin(), links.end()
    │ │ │ │ +			, std::bind(&resolve_links::link_t::ti, _1)));
    │ │ │ │ +
    │ │ │ │ +		// some debug output in case the test fails
    │ │ │ │ +		if (num_matches > e.expected_matches)
    │ │ │ │ +		{
    │ │ │ │ +			file_storage const& fs = ti1->files();
    │ │ │ │ +
    relevance 0../test/test_timestamp_history.cpp:54test the case where we have > 120 samples (and have the base delay actually be updated)

    test the case where we have > 120 samples (and have the base delay actually be updated)

    ../test/test_timestamp_history.cpp:54

    relevance 0../test/test_timestamp_history.cpp:55test the case where a sample is lower than the history entry but not lower than the base

    test the case where a sample is lower than the history entry but not lower than the base

    ../test/test_timestamp_history.cpp:55

    #include "libtorrent/aux_/timestamp_history.hpp"
    │ │ │ │  
    │ │ │ │  TORRENT_TEST(timestamp_history)
    │ │ │ │  {
    │ │ │ │  	using namespace lt;
    │ │ │ │  
    │ │ │ │  	aux::timestamp_history h;
    │ │ │ │  	TEST_EQUAL(h.add_sample(0x32, false), 0);
    │ │ │ │ @@ -5052,15 +5153,168 @@
    │ │ │ │  
    │ │ │ │  	// test that wrapping of the timestamp is properly handled
    │ │ │ │  	h.add_sample(0xfffffff3, false);
    │ │ │ │  	TEST_EQUAL(h.base(), 0xfffffff3);
    │ │ │ │  
    │ │ │ │  
    } │ │ │ │
    │ │ │ │ -
    relevance 0../test/test_tracker.cpp:60test scrape requests

    test scrape requests

    ../test/test_tracker.cpp:60

    relevance 0../test/test_tracker.cpp:61test parse peers6

    test parse peers6

    ../test/test_tracker.cpp:61

    relevance 0../test/test_tracker.cpp:62test parse tracker-id

    test parse tracker-id

    ../test/test_tracker.cpp:62

    relevance 0../test/test_tracker.cpp:63test parse failure-reason

    test parse failure-reason

    ../test/test_tracker.cpp:63

    relevance 0../test/test_tracker.cpp:64test all failure paths, including invalid bencoding not a dictionary no files entry in scrape response no info-hash entry in scrape response malformed peers in peer list of dictionaries uneven number of bytes in peers and peers6 string responses

    test all failure paths, including │ │ │ │ +

    relevance 0../test/test_upnp.cpp:156store the log and verify that some key messages are there

    store the log and verify that some key messages are there

    ../test/test_upnp.cpp:156

    			, portmap_protocol const protocol, error_code const& err
    │ │ │ │ +			, portmap_transport, aux::listen_socket_handle const&) override
    │ │ │ │ +		{
    │ │ │ │ +			callback_info info = {mapping, port, err};
    │ │ │ │ +			callbacks.push_back(info);
    │ │ │ │ +			std::cout << "mapping: " << static_cast<int>(mapping)
    │ │ │ │ +				<< ", port: " << port << ", IP: " << ip
    │ │ │ │ +				<< ", proto: " << static_cast<int>(protocol)
    │ │ │ │ +				<< ", error: \"" << err.message() << "\"\n";
    │ │ │ │ +		}
    │ │ │ │ +	#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ +		bool should_log_portmap(portmap_transport) const override
    │ │ │ │ +		{
    │ │ │ │ +			return true;
    │ │ │ │ +		}
    │ │ │ │ +
    │ │ │ │ +		void log_portmap(portmap_transport, char const* msg
    │ │ │ │ +			, aux::listen_socket_handle const&) const override
    │ │ │ │ +		{
    │ │ │ │ +			std::cout << "UPnP: " << msg << std::endl;
    │ │ │ │ +
    } │ │ │ │ +
    #endif │ │ │ │ + }; │ │ │ │ + │ │ │ │ +ip_interface pick_upnp_interface() │ │ │ │ +{ │ │ │ │ + lt::io_context ios; │ │ │ │ + error_code ec; │ │ │ │ + std::vector<ip_route> const routes = enum_routes(ios, ec); │ │ │ │ + if (ec) │ │ │ │ + { │ │ │ │ + std::cerr << "failed to enumerate routes: " << ec.message() << '\n'; │ │ │ │ + TEST_CHECK(false); │ │ │ │ + return {}; │ │ │ │ + } │ │ │ │ + std::vector<ip_interface> const ifs = enum_net_interfaces(ios, ec); │ │ │ │ + if (ec) │ │ │ │ + { │ │ │ │ + std::cerr << "failed to enumerate network interfaces: " << ec.message() << '\n'; │ │ │ │ + TEST_CHECK(false); │ │ │ │ + return {}; │ │ │ │ + } │ │ │ │ + int idx = 0; │ │ │ │ + for (auto const& face : ifs) │ │ │ │ + { │ │ │ │ + if (!face.interface_address.is_v4()) continue; │ │ │ │ + std::cout << " - " << idx │ │ │ │ + << ' ' << face.interface_address.to_string() │ │ │ │ + << ' ' << int(static_cast<std::uint8_t>(face.state)) │ │ │ │ + << ' ' << static_cast<std::uint32_t>(face.flags) │ │ │ │ + << ' ' << face.name << '\n'; │ │ │ │ +
    relevance 0../test/test_flags.cpp:163change to a different test setup. currently always paused. test_set_after_add(torrent_flags::paused); test_unset_after_add(torrent_flags::paused);

    change to a different test setup. currently always paused. │ │ │ │ +test_set_after_add(torrent_flags::paused); │ │ │ │ +test_unset_after_add(torrent_flags::paused);

    ../test/test_flags.cpp:163

    {
    │ │ │ │ +	// share-mode
    │ │ │ │ +	test_add_and_get_flags(torrent_flags::share_mode);
    │ │ │ │ +	test_set_after_add(torrent_flags::share_mode);
    │ │ │ │ +	test_unset_after_add(torrent_flags::share_mode);
    │ │ │ │ +}
    │ │ │ │ +#endif
    │ │ │ │ +
    │ │ │ │ +TORRENT_TEST(flag_apply_ip_filter)
    │ │ │ │ +{
    │ │ │ │ +	// apply-ip-filter
    │ │ │ │ +	test_add_and_get_flags(torrent_flags::apply_ip_filter);
    │ │ │ │ +	test_set_after_add(torrent_flags::apply_ip_filter);
    │ │ │ │ +	test_unset_after_add(torrent_flags::apply_ip_filter);
    │ │ │ │ +}
    │ │ │ │ +
    │ │ │ │ +TORRENT_TEST(flag_paused)
    │ │ │ │ +{
    │ │ │ │ +	// paused
    │ │ │ │ +	test_add_and_get_flags(torrent_flags::paused);
    │ │ │ │ +
    } │ │ │ │ +
    │ │ │ │ +TORRENT_TEST(flag_auto_managed) │ │ │ │ +{ │ │ │ │ + // auto-managed │ │ │ │ + test_add_and_get_flags(torrent_flags::auto_managed); │ │ │ │ + test_set_after_add(torrent_flags::auto_managed); │ │ │ │ + test_unset_after_add(torrent_flags::auto_managed); │ │ │ │ +} │ │ │ │ + │ │ │ │ +// super seeding mode is automatically turned off if we're not a seed │ │ │ │ +// since the posix_disk_io is not threaded, this will happen immediately │ │ │ │ +#if TORRENT_HAVE_MMAP │ │ │ │ +#ifndef TORRENT_DISABLE_SUPERSEEDING │ │ │ │ +TORRENT_TEST(flag_super_seeding) │ │ │ │ +{ │ │ │ │ + // super-seeding │ │ │ │ + test_add_and_get_flags(torrent_flags::super_seeding); │ │ │ │ + test_unset_after_add(torrent_flags::super_seeding); │ │ │ │ + test_set_after_add(torrent_flags::super_seeding); │ │ │ │ +} │ │ │ │ +#endif │ │ │ │ +#endif │ │ │ │ + │ │ │ │ +TORRENT_TEST(flag_sequential_download) │ │ │ │ +{ │ │ │ │ + // sequential-download │ │ │ │ + test_add_and_get_flags(torrent_flags::sequential_download); │ │ │ │ + test_set_after_add(torrent_flags::sequential_download); │ │ │ │ + test_unset_after_add(torrent_flags::sequential_download); │ │ │ │ +} │ │ │ │ +
    relevance 0../test/test_flags.cpp:205this test is flaky, since the torrent will become ready before asking for the flags, and by then stop_when_ready will have been cleared test_add_and_get_flags(torrent_flags::stop_when_ready); setting stop-when-ready when already stopped has no effect.

    this test is flaky, since the torrent will become ready before │ │ │ │ +asking for the flags, and by then stop_when_ready will have been cleared │ │ │ │ +test_add_and_get_flags(torrent_flags::stop_when_ready); │ │ │ │ +setting stop-when-ready when already stopped has no effect.

    ../test/test_flags.cpp:205

    relevance 0../test/test_flags.cpp:209change to a different test setup. currently always paused. test_set_after_add(torrent_flags::stop_when_ready);

    change to a different test setup. currently always paused. │ │ │ │ +test_set_after_add(torrent_flags::stop_when_ready);

    ../test/test_flags.cpp:209

    	test_set_after_add(torrent_flags::super_seeding);
    │ │ │ │ +}
    │ │ │ │ +#endif
    │ │ │ │ +#endif
    │ │ │ │ +
    │ │ │ │ +TORRENT_TEST(flag_sequential_download)
    │ │ │ │ +{
    │ │ │ │ +	// sequential-download
    │ │ │ │ +	test_add_and_get_flags(torrent_flags::sequential_download);
    │ │ │ │ +	test_set_after_add(torrent_flags::sequential_download);
    │ │ │ │ +	test_unset_after_add(torrent_flags::sequential_download);
    │ │ │ │ +}
    │ │ │ │ +
    │ │ │ │ +// the stop when ready flag will be cleared when the torrent is ready to start
    │ │ │ │ +// downloading.
    │ │ │ │ +// since the posix_disk_io is not threaded, this will happen immediately
    │ │ │ │ +#if TORRENT_HAVE_MMAP
    │ │ │ │ +TORRENT_TEST(flag_stop_when_ready)
    │ │ │ │ +{
    │ │ │ │ +	// stop-when-ready
    │ │ │ │ +
    test_unset_after_add(torrent_flags::stop_when_ready); │ │ │ │ +
    } │ │ │ │ +#endif │ │ │ │ + │ │ │ │ +TORRENT_TEST(flag_disable_dht) │ │ │ │ +{ │ │ │ │ + test_add_and_get_flags(torrent_flags::disable_dht); │ │ │ │ + test_set_after_add(torrent_flags::disable_dht); │ │ │ │ + test_unset_after_add(torrent_flags::disable_dht); │ │ │ │ +} │ │ │ │ + │ │ │ │ + │ │ │ │ +TORRENT_TEST(flag_disable_lsd) │ │ │ │ +{ │ │ │ │ + test_add_and_get_flags(torrent_flags::disable_lsd); │ │ │ │ + test_set_after_add(torrent_flags::disable_lsd); │ │ │ │ + test_unset_after_add(torrent_flags::disable_lsd); │ │ │ │ +} │ │ │ │ + │ │ │ │ +TORRENT_TEST(flag_disable_pex) │ │ │ │ +{ │ │ │ │ + test_add_and_get_flags(torrent_flags::disable_pex); │ │ │ │ + test_set_after_add(torrent_flags::disable_pex); │ │ │ │ + test_unset_after_add(torrent_flags::disable_pex); │ │ │ │ +} │ │ │ │ +
    relevance 0../test/test_tracker.cpp:60test scrape requests

    test scrape requests

    ../test/test_tracker.cpp:60

    relevance 0../test/test_tracker.cpp:61test parse peers6

    test parse peers6

    ../test/test_tracker.cpp:61

    relevance 0../test/test_tracker.cpp:62test parse tracker-id

    test parse tracker-id

    ../test/test_tracker.cpp:62

    relevance 0../test/test_tracker.cpp:63test parse failure-reason

    test parse failure-reason

    ../test/test_tracker.cpp:63

    relevance 0../test/test_tracker.cpp:64test all failure paths, including invalid bencoding not a dictionary no files entry in scrape response no info-hash entry in scrape response malformed peers in peer list of dictionaries uneven number of bytes in peers and peers6 string responses

    test all failure paths, including │ │ │ │ invalid bencoding │ │ │ │ not a dictionary │ │ │ │ no files entry in scrape response │ │ │ │ no info-hash entry in scrape response │ │ │ │ malformed peers in peer list of dictionaries │ │ │ │ uneven number of bytes in peers and peers6 string responses

    ../test/test_tracker.cpp:64

    #include "test_utils.hpp"
    │ │ │ │  #include "udp_tracker.hpp"
    │ │ │ │ @@ -5109,15 +5363,36 @@
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │  TORRENT_TEST(parse_peers4)
    │ │ │ │  {
    │ │ │ │  	char const response[] = "d5:peers12:\x01\x02\x03\x04\x30\x10"
    │ │ │ │  		"\x09\x08\x07\x06\x20\x10" "e";
    │ │ │ │  	error_code ec;
    │ │ │ │ -
    relevance 0../test/test_peer_list.cpp:1241test erasing peers

    test erasing peers

    ../test/test_peer_list.cpp:1241

    relevance 0../test/test_peer_list.cpp:1242test update_peer_port with allow_multiple_connections_per_ip and without

    test update_peer_port with allow_multiple_connections_per_ip and without

    ../test/test_peer_list.cpp:1242

    relevance 0../test/test_peer_list.cpp:1243test add i2p peers

    test add i2p peers

    ../test/test_peer_list.cpp:1243

    relevance 0../test/test_peer_list.cpp:1244test allow_i2p_mixed

    test allow_i2p_mixed

    ../test/test_peer_list.cpp:1244

    relevance 0../test/test_peer_list.cpp:1245test insert_peer failing with all error conditions

    test insert_peer failing with all error conditions

    ../test/test_peer_list.cpp:1245

    relevance 0../test/test_peer_list.cpp:1246test IPv6

    test IPv6

    ../test/test_peer_list.cpp:1246

    relevance 0../test/test_peer_list.cpp:1247test connect_to_peer() failing

    test connect_to_peer() failing

    ../test/test_peer_list.cpp:1247

    relevance 0../test/test_peer_list.cpp:1248test connection_closed

    test connection_closed

    ../test/test_peer_list.cpp:1248

    relevance 0../test/test_peer_list.cpp:1249connect candidates recalculation when incrementing failcount

    connect candidates recalculation when incrementing failcount

    ../test/test_peer_list.cpp:1249

    relevance 0../test/test_dht.cpp:472check to make sure the "best" items are stored

    check to make sure the "best" items are stored

    ../test/test_dht.cpp:472

    			, msg_args().target(items[j].target));
    │ │ │ │ +
    relevance 0../test/test_bloom_filter.cpp:135test size()

    test size()

    ../test/test_bloom_filter.cpp:135

    relevance 0../test/test_bloom_filter.cpp:136test clear()

    test clear()

    ../test/test_bloom_filter.cpp:136

    	sha1_hash k("\x01\x00\x02\x00                ");
    │ │ │ │ +	TEST_CHECK(!filter.find(k));
    │ │ │ │ +	filter.set(k);
    │ │ │ │ +	TEST_CHECK(filter.find(k));
    │ │ │ │ +
    │ │ │ │ +	std::uint8_t compare[4] = { 0x16, 0xff, 0x55, 0xaa};
    │ │ │ │ +
    │ │ │ │ +	bits_out = filter.to_string();
    │ │ │ │ +	TEST_EQUAL(memcmp(compare, bits_out.c_str(), 4), 0);
    │ │ │ │ +}
    │ │ │ │ +
    │ │ │ │ +} // anonymous namespace
    │ │ │ │ +
    │ │ │ │ +TORRENT_TEST(bloom_filter)
    │ │ │ │ +{
    │ │ │ │ +	test_set_and_get();
    │ │ │ │ +	test_set_bits();
    │ │ │ │ +	test_count_zeroes();
    │ │ │ │ +	test_to_from_string();
    │ │ │ │ +
    │ │ │ │ +
    } │ │ │ │ +
    relevance 0../test/test_dht.cpp:472check to make sure the "best" items are stored

    check to make sure the "best" items are stored

    ../test/test_dht.cpp:472

    			, msg_args().target(items[j].target));
    │ │ │ │  
    │ │ │ │  		key_desc_t const desc[] =
    │ │ │ │  		{
    │ │ │ │  			{ "r", bdecode_node::dict_t, 0, key_desc_t::parse_children },
    │ │ │ │  				{ "v", bdecode_node::dict_t, 0, 0},
    │ │ │ │  				{ "id", bdecode_node::string_t, 20, key_desc_t::last_child},
    │ │ │ │  			{ "y", bdecode_node::string_t, 1, 0},
    │ │ │ │ @@ -5160,15 +5435,15 @@
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │  void put_mutable_item_data_cb(dht::item& i)
    │ │ │ │  {
    │ │ │ │  	if (!i.empty())
    │ │ │ │  		g_got_items.push_back(i);
    │ │ │ │  
    │ │ │ │ -
    relevance 0../test/test_dht.cpp:3223this won't work because the second node isn't pinged so it wont be added to the routing table

    this won't work because the second node isn't pinged so it wont │ │ │ │ +relevance 0../test/test_dht.cpp:3223this won't work because the second node isn't pinged so it wont be added to the routing table

    this won't work because the second node isn't pinged so it wont │ │ │ │ be added to the routing table

    ../test/test_dht.cpp:3223

    	bool ret = verify_message(request, get_item_desc_ro, parsed, error_string);
    │ │ │ │  
    │ │ │ │  	TEST_CHECK(ret);
    │ │ │ │  	TEST_EQUAL(parsed[3].int_value(), 1);
    │ │ │ │  
    │ │ │ │  	// should have one node now, which is 4.4.4.4:1234
    │ │ │ │  	TEST_EQUAL(std::get<0>(node.size()), 1);
    │ │ │ │ @@ -5207,15 +5482,15 @@
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │  #ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │  // these tests rely on logging being enabled
    │ │ │ │  
    │ │ │ │  TORRENT_TEST(invalid_error_msg)
    │ │ │ │  {
    │ │ │ │ -
    relevance 0../test/test_dht.cpp:4081test obfuscated_get_peers

    test obfuscated_get_peers

    ../test/test_dht.cpp:4081

    		TEST_CHECK(sm.has_quota());
    │ │ │ │ +
    relevance 0../test/test_dht.cpp:4081test obfuscated_get_peers

    test obfuscated_get_peers

    ../test/test_dht.cpp:4081

    		TEST_CHECK(sm.has_quota());
    │ │ │ │  	});
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │  TORRENT_TEST(rate_limit_accrue_limit)
    │ │ │ │  {
    │ │ │ │  	aux::session_settings sett;
    │ │ │ │  	sett.set_int(settings_pack::dht_upload_rate_limit, std::numeric_limits<int>::max());
    │ │ │ │ @@ -5236,653 +5511,1016 @@
    │ │ │ │  TORRENT_TEST(dht)
    │ │ │ │  {
    │ │ │ │  	// dummy dht test
    │ │ │ │  	TEST_CHECK(true);
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │  #endif
    │ │ │ │ -
    relevance 0../test/test_fast_extension.cpp:1135test sending invalid requests (out of bound piece index, offsets and sizes)

    test sending invalid requests (out of bound piece index, offsets and │ │ │ │ -sizes)

    ../test/test_fast_extension.cpp:1135

    relevance 0../test/test_resolve_links.cpp:95test files with different piece size (negative test)

    test files with different piece size (negative test)

    ../test/test_resolve_links.cpp:95

    	{ "test2", "test1_pad_files", 0},
    │ │ │ │ -	{ "test3", "test1_pad_files", 0},
    │ │ │ │ -	{ "test2", "test1_single", 0},
    │ │ │ │ -
    │ │ │ │ -	// these are all padded. The first small file will accidentally also
    │ │ │ │ -	// match, even though it's not tail padded, the following file is identical
    │ │ │ │ -	{ "test2_pad_files", "test1_pad_files", 2},
    │ │ │ │ -	{ "test3_pad_files", "test1_pad_files", 2},
    │ │ │ │ -	{ "test3_pad_files", "test2_pad_files", 2},
    │ │ │ │ -	{ "test1_pad_files", "test2_pad_files", 2},
    │ │ │ │ -	{ "test1_pad_files", "test3_pad_files", 2},
    │ │ │ │ -	{ "test2_pad_files", "test3_pad_files", 2},
    │ │ │ │ +
    relevance 0../test/test_ssl.cpp:407test using a signed certificate with the wrong info-hash in DN

    test using a signed certificate with the wrong info-hash in DN

    ../test/test_ssl.cpp:407

    	// in verifying peers
    │ │ │ │ +	ctx.set_verify_mode(context::verify_none, ec);
    │ │ │ │ +	if (ec)
    │ │ │ │ +	{
    │ │ │ │ +		std::printf("Failed to set SSL verify mode: %s\n"
    │ │ │ │ +			, ec.message().c_str());
    │ │ │ │ +		TEST_CHECK(!ec);
    │ │ │ │ +		return false;
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -	// one might expect this to work, but since the tail of the single file
    │ │ │ │ -	// torrent is not padded, the last piece hash won't match
    │ │ │ │ -	{ "test1_pad_files", "test1_single", 0},
    │ │ │ │ +	std::string certificate = combine_path("..", combine_path("ssl", "peer_certificate.pem"));
    │ │ │ │ +	std::string private_key = combine_path("..", combine_path("ssl", "peer_private_key.pem"));
    │ │ │ │ +	std::string dh_params = combine_path("..", combine_path("ssl", "dhparams.pem"));
    │ │ │ │  
    │ │ │ │ -	// if it's padded on the other hand, it will work
    │ │ │ │ -	{ "test1_pad_files", "test1_single_padded", 1},
    │ │ │ │ +	if (flags & invalid_certificate)
    │ │ │ │ +	{
    │ │ │ │ +		certificate = combine_path("..", combine_path("ssl", "invalid_peer_certificate.pem"));
    │ │ │ │ +		private_key = combine_path("..", combine_path("ssl", "invalid_peer_private_key.pem"));
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -
    }; │ │ │ │ -
    │ │ │ │ -
    relevance 0../test/test_resolve_links.cpp:98it would be nice to test resolving of more than just 2 files as well. like 3 single file torrents merged into one, resolving all 3 files.

    it would be nice to test resolving of more than just 2 files as well. │ │ │ │ -like 3 single file torrents merged into one, resolving all 3 files.

    ../test/test_resolve_links.cpp:98

    	{ "test2", "test1_single", 0},
    │ │ │ │ +
    │ │ │ │ +
    if (flags & (valid_certificate | invalid_certificate)) │ │ │ │ + { │ │ │ │ + std::printf("set_password_callback\n"); │ │ │ │ + ctx.set_password_callback( │ │ │ │ + [](std::size_t, context::password_purpose) { return "test"; } │ │ │ │ + , ec); │ │ │ │ + if (ec) │ │ │ │ + { │ │ │ │ + std::printf("Failed to set certificate passphrase: %s\n" │ │ │ │ + , ec.message().c_str()); │ │ │ │ + TEST_CHECK(!ec); │ │ │ │ + return false; │ │ │ │ + } │ │ │ │ + std::printf("use_certificate_file \"%s\"\n", certificate.c_str()); │ │ │ │ + ctx.use_certificate_file(certificate, context::pem, ec); │ │ │ │ + if (ec) │ │ │ │ + { │ │ │ │ + std::printf("Failed to set certificate file: %s\n" │ │ │ │ + , ec.message().c_str()); │ │ │ │ + TEST_CHECK(!ec); │ │ │ │ + return false; │ │ │ │ + } │ │ │ │ + std::printf("use_private_key_file \"%s\"\n", private_key.c_str()); │ │ │ │ + ctx.use_private_key_file(private_key, context::pem, ec); │ │ │ │ + if (ec) │ │ │ │ + { │ │ │ │ + std::printf("Failed to set private key: %s\n" │ │ │ │ + , ec.message().c_str()); │ │ │ │ + TEST_CHECK(!ec); │ │ │ │ + return false; │ │ │ │ +
    relevance 0../test/test_ssl.cpp:509also test using a hash that refers to a valid torrent but that differs from the SNI hash

    also test using a hash that refers to a valid torrent │ │ │ │ +but that differs from the SNI hash

    ../test/test_ssl.cpp:509

    	print_alerts(ses1, "ses1", true, true, &on_alert);
    │ │ │ │ +	if (ec)
    │ │ │ │ +	{
    │ │ │ │ +		std::printf("Failed SSL handshake: %s\n"
    │ │ │ │ +			, ec.message().c_str());
    │ │ │ │ +		return false;
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -	// these are all padded. The first small file will accidentally also
    │ │ │ │ -	// match, even though it's not tail padded, the following file is identical
    │ │ │ │ -	{ "test2_pad_files", "test1_pad_files", 2},
    │ │ │ │ -	{ "test3_pad_files", "test1_pad_files", 2},
    │ │ │ │ -	{ "test3_pad_files", "test2_pad_files", 2},
    │ │ │ │ -	{ "test1_pad_files", "test2_pad_files", 2},
    │ │ │ │ -	{ "test1_pad_files", "test3_pad_files", 2},
    │ │ │ │ -	{ "test2_pad_files", "test3_pad_files", 2},
    │ │ │ │ +	char handshake[] = "\x13" "BitTorrent protocol\0\0\0\0\0\0\0\x04"
    │ │ │ │ +		"                    " // space for info-hash
    │ │ │ │ +		"aaaaaaaaaaaaaaaaaaaa" // peer-id
    │ │ │ │ +		"\0\0\0\x01\x02"; // interested
    │ │ │ │  
    │ │ │ │ -	// one might expect this to work, but since the tail of the single file
    │ │ │ │ -	// torrent is not padded, the last piece hash won't match
    │ │ │ │ -	{ "test1_pad_files", "test1_single", 0},
    │ │ │ │ +	// fill in the info-hash
    │ │ │ │ +	if (flags & valid_bittorrent_hash)
    │ │ │ │ +	{
    │ │ │ │ +		std::memcpy(handshake + 28, &t->info_hashes().v1[0], 20);
    │ │ │ │ +	}
    │ │ │ │ +	else
    │ │ │ │ +	{
    │ │ │ │ +
    std::generate(handshake + 28, handshake + 48, &rand); │ │ │ │ +
    } │ │ │ │ │ │ │ │ - // if it's padded on the other hand, it will work │ │ │ │ - { "test1_pad_files", "test1_single_padded", 1}, │ │ │ │ + // fill in the peer-id │ │ │ │ + std::generate(handshake + 48, handshake + 68, &rand); │ │ │ │ │ │ │ │ -}; │ │ │ │ + std::printf("bittorrent handshake\n"); │ │ │ │ + boost::asio::write(ssl_sock, boost::asio::buffer(handshake, (sizeof(handshake) - 1)), ec); │ │ │ │ + print_alerts(ses1, "ses1", true, true, &on_alert); │ │ │ │ + if (ec) │ │ │ │ + { │ │ │ │ + std::printf("failed to write bittorrent handshake: %s\n" │ │ │ │ + , ec.message().c_str()); │ │ │ │ + return false; │ │ │ │ + } │ │ │ │ │ │ │ │ -
    │ │ │ │ -
    TORRENT_TEST(resolve_links) │ │ │ │ -{ │ │ │ │ - std::string path = combine_path(parent_path(current_working_directory()) │ │ │ │ - , "mutable_test_torrents"); │ │ │ │ + char buf[68]; │ │ │ │ + std::printf("read bittorrent handshake\n"); │ │ │ │ + boost::asio::read(ssl_sock, boost::asio::buffer(buf, sizeof(buf)), ec); │ │ │ │ + print_alerts(ses1, "ses1", true, true, &on_alert); │ │ │ │ + if (ec) │ │ │ │ + { │ │ │ │ + std::printf("failed to read bittorrent handshake: %s\n" │ │ │ │ + , ec.message().c_str()); │ │ │ │ + return false; │ │ │ │ + } │ │ │ │ │ │ │ │ - for (int i = 0; i < int(sizeof(test_torrents)/sizeof(test_torrents[0])); ++i) │ │ │ │ + if (memcmp(buf, "\x13" "BitTorrent protocol", 20) != 0) │ │ │ │ { │ │ │ │ - test_torrent_t const& e = test_torrents[i]; │ │ │ │ + std::printf("invalid bittorrent handshake\n"); │ │ │ │ + return false; │ │ │ │ +
    relevance 0../src/udp_socket.cpp:659perhaps an attempt should be made to bind m_socks5_sock to the device of m_listen_socket

    perhaps an attempt should be made to bind m_socks5_sock to the │ │ │ │ +device of m_listen_socket

    ../src/udp_socket.cpp:659

    	if (ec)
    │ │ │ │ +	{
    │ │ │ │ +		if (m_alerts.should_post<socks5_alert>())
    │ │ │ │ +			m_alerts.emplace_alert<socks5_alert>(m_proxy_addr, operation_t::sock_option, ec);
    │ │ │ │ +		ec.clear();
    │ │ │ │ +	}
    │ │ │ │ +#endif
    │ │ │ │ +#endif
    │ │ │ │  
    │ │ │ │ -		std::string p = combine_path(path, e.filename1) + ".torrent";
    │ │ │ │ -		std::printf("loading %s\n", p.c_str());
    │ │ │ │ -		std::shared_ptr<torrent_info> ti1 = std::make_shared<torrent_info>(p);
    │ │ │ │ +	tcp::endpoint const bind_ep(m_listen_socket.get_local_endpoint().address(), 0);
    │ │ │ │ +	m_socks5_sock.bind(bind_ep, ec);
    │ │ │ │ +	if (ec)
    │ │ │ │ +	{
    │ │ │ │ +		if (m_alerts.should_post<socks5_alert>())
    │ │ │ │ +			m_alerts.emplace_alert<socks5_alert>(m_proxy_addr, operation_t::sock_bind, ec);
    │ │ │ │ +		++m_failures;
    │ │ │ │ +		retry_connection();
    │ │ │ │ +		return;
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -		p = combine_path(path, e.filename2) + ".torrent";
    │ │ │ │ -		std::printf("loading %s\n", p.c_str());
    │ │ │ │ -		std::shared_ptr<torrent_info> ti2 = std::make_shared<torrent_info>(p);
    │ │ │ │ +
    │ │ │ │ +
    ADD_OUTSTANDING_ASYNC("socks5::on_connected"); │ │ │ │ + m_socks5_sock.async_connect(m_proxy_addr │ │ │ │ + , std::bind(&socks5::on_connected, self(), _1)); │ │ │ │ │ │ │ │ - std::printf("resolving\n"); │ │ │ │ - resolve_links l(ti1); │ │ │ │ - l.match(ti2, "."); │ │ │ │ + ADD_OUTSTANDING_ASYNC("socks5::on_connect_timeout"); │ │ │ │ + m_timer.expires_after(seconds(10)); │ │ │ │ + m_timer.async_wait(std::bind(&socks5::on_connect_timeout │ │ │ │ + , self(), _1)); │ │ │ │ +} │ │ │ │ │ │ │ │ - aux::vector<resolve_links::link_t, file_index_t> const& links = l.get_links(); │ │ │ │ +void socks5::on_connect_timeout(error_code const& e) │ │ │ │ +{ │ │ │ │ + COMPLETE_ASYNC("socks5::on_connect_timeout"); │ │ │ │ │ │ │ │ - auto const num_matches = std::size_t(std::count_if(links.begin(), links.end() │ │ │ │ - , std::bind(&resolve_links::link_t::ti, _1))); │ │ │ │ + if (e == boost::asio::error::operation_aborted) return; │ │ │ │ │ │ │ │ - // some debug output in case the test fails │ │ │ │ - if (num_matches > e.expected_matches) │ │ │ │ - { │ │ │ │ - file_storage const& fs = ti1->files(); │ │ │ │ -
    relevance 0../test/test_resume.cpp:582test what happens when loading a resume file with both piece priorities and file priorities (file prio should take precedence)

    test what happens when loading a resume file with both piece priorities │ │ │ │ -and file priorities (file prio should take precedence)

    ../test/test_resume.cpp:582

    		{
    │ │ │ │ -			TEST_EQUAL(pieces[i], true);
    │ │ │ │ -		}
    │ │ │ │ -	}
    │ │ │ │ -}
    │ │ │ │ +	if (m_abort) return;
    │ │ │ │  
    │ │ │ │ -} // anonymous namespace
    │ │ │ │ +	if (m_alerts.should_post<socks5_alert>())
    │ │ │ │ +		m_alerts.emplace_alert<socks5_alert>(m_proxy_addr, operation_t::connect, errors::timed_out);
    │ │ │ │  
    │ │ │ │ -TORRENT_TEST(piece_slots_seed)
    │ │ │ │ -{
    │ │ │ │ -	test_piece_slots_seed(settings());
    │ │ │ │ -}
    │ │ │ │ +	error_code ignore;
    │ │ │ │ +	m_socks5_sock.close(ignore);
    │ │ │ │  
    │ │ │ │ -TORRENT_TEST(piece_slots_seed_suggest_cache)
    │ │ │ │ -{
    │ │ │ │ -	settings_pack sett = settings();
    │ │ │ │ -	sett.set_int(settings_pack::suggest_mode, settings_pack::suggest_read_cache);
    │ │ │ │ -	test_piece_slots_seed(sett);
    │ │ │ │ +	++m_failures;
    │ │ │ │ +	retry_connection();
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │ -
    │ │ │ │ -
    relevance 0../test/test_resume.cpp:585make sure a resume file only ever contain file priorities OR piece priorities. Never both.

    make sure a resume file only ever contain file priorities OR piece │ │ │ │ -priorities. Never both.

    ../test/test_resume.cpp:585

    			TEST_EQUAL(pieces[i], true);
    │ │ │ │ +void socks5::on_connected(error_code const& e)
    │ │ │ │ +{
    │ │ │ │ +
    relevance 0../src/torrent.cpp:1951this could be optimized by looking up which files are complete and just look at those

    this could be optimized by looking up which files are │ │ │ │ +complete and just look at those

    ../src/torrent.cpp:1951

    //				TORRENT_ASSERT(picker().have_piece(i));
    │ │ │ │ +				we_have(i);
    │ │ │ │ +			}
    │ │ │ │  		}
    │ │ │ │ -	}
    │ │ │ │ -}
    │ │ │ │  
    │ │ │ │ -} // anonymous namespace
    │ │ │ │ +		set_state(torrent_status::checking_resume_data);
    │ │ │ │  
    │ │ │ │ -TORRENT_TEST(piece_slots_seed)
    │ │ │ │ -{
    │ │ │ │ -	test_piece_slots_seed(settings());
    │ │ │ │ -}
    │ │ │ │ +		aux::vector<std::string, file_index_t> links;
    │ │ │ │ +#ifndef TORRENT_DISABLE_MUTABLE_TORRENTS
    │ │ │ │ +		if (!m_torrent_file->similar_torrents().empty()
    │ │ │ │ +			|| !m_torrent_file->collections().empty())
    │ │ │ │ +		{
    │ │ │ │ +			resolve_links res(m_torrent_file);
    │ │ │ │  
    │ │ │ │ -TORRENT_TEST(piece_slots_seed_suggest_cache)
    │ │ │ │ -{
    │ │ │ │ -	settings_pack sett = settings();
    │ │ │ │ -	sett.set_int(settings_pack::suggest_mode, settings_pack::suggest_read_cache);
    │ │ │ │ -	test_piece_slots_seed(sett);
    │ │ │ │ -}
    │ │ │ │ +			for (auto const& ih : m_torrent_file->similar_torrents())
    │ │ │ │ +			{
    │ │ │ │ +				std::shared_ptr<torrent> t = m_ses.find_torrent(info_hash_t(ih)).lock();
    │ │ │ │ +				if (!t) continue;
    │ │ │ │  
    │ │ │ │ +				// Only attempt to reuse files from torrents that are seeding.
    │ │ │ │ +
    if (!t->is_seed()) continue; │ │ │ │ +
    │ │ │ │ + res.match(t->get_torrent_file(), t->save_path()); │ │ │ │ + } │ │ │ │ + for (auto const& c : m_torrent_file->collections()) │ │ │ │ + { │ │ │ │ + std::vector<std::shared_ptr<torrent>> ts = m_ses.find_collection(c); │ │ │ │ │ │ │ │ -
    │ │ │ │ -
    relevance 0../test/test_resume.cpp:588generally save

    generally save

    ../test/test_resume.cpp:588

    		}
    │ │ │ │ -	}
    │ │ │ │ -}
    │ │ │ │ +				for (auto const& t : ts)
    │ │ │ │ +				{
    │ │ │ │ +					// Only attempt to reuse files from torrents that are seeding.
    │ │ │ │ +
    relevance 0../src/torrent.cpp:1964this could be optimized by looking up which files are complete and just look at those

    this could be optimized by looking up which files are │ │ │ │ +complete and just look at those

    ../src/torrent.cpp:1964

    		{
    │ │ │ │ +			resolve_links res(m_torrent_file);
    │ │ │ │  
    │ │ │ │ -} // anonymous namespace
    │ │ │ │ +			for (auto const& ih : m_torrent_file->similar_torrents())
    │ │ │ │ +			{
    │ │ │ │ +				std::shared_ptr<torrent> t = m_ses.find_torrent(info_hash_t(ih)).lock();
    │ │ │ │ +				if (!t) continue;
    │ │ │ │  
    │ │ │ │ -TORRENT_TEST(piece_slots_seed)
    │ │ │ │ -{
    │ │ │ │ -	test_piece_slots_seed(settings());
    │ │ │ │ -}
    │ │ │ │ +				// Only attempt to reuse files from torrents that are seeding.
    │ │ │ │ +				if (!t->is_seed()) continue;
    │ │ │ │  
    │ │ │ │ -TORRENT_TEST(piece_slots_seed_suggest_cache)
    │ │ │ │ -{
    │ │ │ │ -	settings_pack sett = settings();
    │ │ │ │ -	sett.set_int(settings_pack::suggest_mode, settings_pack::suggest_read_cache);
    │ │ │ │ -	test_piece_slots_seed(sett);
    │ │ │ │ -}
    │ │ │ │ +				res.match(t->get_torrent_file(), t->save_path());
    │ │ │ │ +			}
    │ │ │ │ +			for (auto const& c : m_torrent_file->collections())
    │ │ │ │ +			{
    │ │ │ │ +				std::vector<std::shared_ptr<torrent>> ts = m_ses.find_collection(c);
    │ │ │ │  
    │ │ │ │ +				for (auto const& t : ts)
    │ │ │ │ +				{
    │ │ │ │ +					// Only attempt to reuse files from torrents that are seeding.
    │ │ │ │ +
    if (!t->is_seed()) continue; │ │ │ │ +
    │ │ │ │ + res.match(t->get_torrent_file(), t->save_path()); │ │ │ │ + } │ │ │ │ + } │ │ │ │ │ │ │ │ + std::vector<resolve_links::link_t> const& l = res.get_links(); │ │ │ │ + if (!l.empty()) │ │ │ │ + { │ │ │ │ + links.resize(m_torrent_file->files().num_files()); │ │ │ │ + for (auto const& i : l) │ │ │ │ + { │ │ │ │ + if (!i.ti) continue; │ │ │ │ + links[i.file_idx] = combine_path(i.save_path │ │ │ │ + , i.ti->files().file_path(i.file_idx)); │ │ │ │ + } │ │ │ │ + } │ │ │ │ + } │ │ │ │ +#endif // TORRENT_DISABLE_MUTABLE_TORRENTS │ │ │ │ │ │ │ │ -
    │ │ │ │ -
    #if TORRENT_ABI_VERSION == 1 │ │ │ │ -TORRENT_TEST(file_priorities_default_deprecated) │ │ │ │ -{ │ │ │ │ - lt::session ses(settings()); │ │ │ │ - std::vector<download_priority_t> file_priorities = test_resume_flags(ses │ │ │ │ - , {}, "", "", true).get_file_priorities(); │ │ │ │ +#if TORRENT_USE_ASSERTS │ │ │ │ + TORRENT_ASSERT(m_outstanding_check_files == false); │ │ │ │ + m_outstanding_check_files = true; │ │ │ │ +#endif │ │ │ │ │ │ │ │ - TEST_EQUAL(file_priorities.size(), 3); │ │ │ │ - TEST_EQUAL(file_priorities[0], 4); │ │ │ │ - TEST_EQUAL(file_priorities[1], 4); │ │ │ │ - TEST_EQUAL(file_priorities[2], 4); │ │ │ │ -} │ │ │ │ + if (!m_add_torrent_params || !(m_add_torrent_params->flags & torrent_flags::no_verify_files)) │ │ │ │ + { │ │ │ │ + m_ses.disk_thread().async_check_files( │ │ │ │ + m_storage, m_add_torrent_params ? m_add_torrent_params.get() : nullptr │ │ │ │ + , std::move(links), [self = shared_from_this()](status_t st, storage_error const& error) │ │ │ │ + { self->on_resume_data_checked(st, error); }); │ │ │ │ +
    relevance 0../src/torrent.cpp:2728this pattern is repeated in a few places. Factor this into a function and generalize the concept of a torrent having a dedicated listen port

    this pattern is repeated in a few places. Factor this into │ │ │ │ +a function and generalize the concept of a torrent having a │ │ │ │ +dedicated listen port

    ../src/torrent.cpp:2728

    		// not ready for peers. Except, if we don't have metadata,
    │ │ │ │ +		// we need peers to download from
    │ │ │ │ +		if (!m_files_checked && valid_metadata()) return;
    │ │ │ │  
    │ │ │ │ -// As long as the add_torrent_params priorities are empty, the file_priorities
    │ │ │ │ -// from the resume data should take effect
    │ │ │ │ -TORRENT_TEST(file_priorities_in_resume_deprecated)
    │ │ │ │ -{
    │ │ │ │ -	lt::session ses(settings());
    │ │ │ │ -	std::vector<download_priority_t> file_priorities = test_resume_flags(ses, {}, "", "123").get_file_priorities();
    │ │ │ │ +		if (!m_announce_to_lsd) return;
    │ │ │ │  
    │ │ │ │ -	TEST_EQUAL(file_priorities.size(), 3);
    │ │ │ │ -	TEST_EQUAL(file_priorities[0], 1);
    │ │ │ │ -	TEST_EQUAL(file_priorities[1], 2);
    │ │ │ │ -	TEST_EQUAL(file_priorities[2], 3);
    │ │ │ │ -}
    │ │ │ │ +		// private torrents are never announced on LSD
    │ │ │ │ +		if (m_torrent_file->is_valid() && m_torrent_file->priv()) return;
    │ │ │ │  
    │ │ │ │ -// if both resume data and add_torrent_params has file_priorities, the
    │ │ │ │ -// add_torrent_params one take precedence
    │ │ │ │ -TORRENT_TEST(file_priorities_in_resume_and_params_deprecated)
    │ │ │ │ -{
    │ │ │ │ -
    relevance 0../test/test_resume.cpp:911test all other resume flags here too. This would require returning more than just the torrent_status from test_resume_flags. Also http seeds and trackers for instance

    test all other resume flags here too. This would require returning │ │ │ │ -more than just the torrent_status from test_resume_flags. Also http seeds │ │ │ │ -and trackers for instance

    ../test/test_resume.cpp:911

    	TEST_EQUAL(s.connections_limit, 1345);
    │ │ │ │ -	TEST_EQUAL(s.uploads_limit, 1346);
    │ │ │ │ -}
    │ │ │ │ +#if TORRENT_USE_I2P
    │ │ │ │ +		// i2p torrents are also never announced on LSD
    │ │ │ │ +		// unless we allow mixed swarms
    │ │ │ │ +		if (is_i2p() && !settings().get_bool(settings_pack::allow_i2p_mixed))
    │ │ │ │ +			return;
    │ │ │ │ +#endif
    │ │ │ │  
    │ │ │ │ -TORRENT_TEST(paused_deprecated)
    │ │ │ │ -{
    │ │ │ │ -	lt::session ses(settings());
    │ │ │ │ -	// resume data overrides the paused flag
    │ │ │ │ -	auto const now = lt::clock_type::now();
    │ │ │ │ -	torrent_status s = test_resume_flags(ses, torrent_flags::paused, "", "", true).status();
    │ │ │ │ -	default_tests(s, now);
    │ │ │ │ -#ifdef TORRENT_WINDOWS
    │ │ │ │ -	TEST_EQUAL(s.save_path, "c:\\add_torrent_params save_path");
    │ │ │ │ +		if (is_paused()) return;
    │ │ │ │ +
    │ │ │ │ +		if (!m_ses.has_lsd()) return;
    │ │ │ │ +
    │ │ │ │ +
    #ifdef TORRENT_SSL_PEERS │ │ │ │ +
    int port = is_ssl_torrent() ? m_ses.ssl_listen_port() : m_ses.listen_port(); │ │ │ │ #else │ │ │ │ - TEST_EQUAL(s.save_path, "/add_torrent_params save_path"); │ │ │ │ + int port = m_ses.listen_port(); │ │ │ │ #endif │ │ │ │ - TEST_EQUAL(s.flags & flags_mask, torrent_flags_t{}); │ │ │ │ - TEST_EQUAL(s.connections_limit, 1345); │ │ │ │ - TEST_EQUAL(s.uploads_limit, 1346); │ │ │ │ │ │ │ │ -
    } │ │ │ │ -
    │ │ │ │ -TORRENT_TEST(url_seed_resume_data_deprecated) │ │ │ │ -{ │ │ │ │ - // merge url seeds with resume data │ │ │ │ - std::printf("flags: merge_resume_http_seeds\n"); │ │ │ │ - lt::session ses(settings()); │ │ │ │ - torrent_handle h = test_resume_flags(ses, │ │ │ │ - torrent_flags::merge_resume_http_seeds, "", "", true); │ │ │ │ - std::set<std::string> us = h.url_seeds(); │ │ │ │ - std::set<std::string> ws = h.http_seeds(); │ │ │ │ + // announce with the local discovery service │ │ │ │ + m_torrent_file->info_hashes().for_each([&](sha1_hash const& ih, protocol_version) │ │ │ │ + { │ │ │ │ + m_ses.announce_lsd(ih, port); │ │ │ │ + }); │ │ │ │ + } │ │ │ │ │ │ │ │ - TEST_EQUAL(us.size(), 3); │ │ │ │ - TEST_EQUAL(std::count(us.begin(), us.end() │ │ │ │ - , "http://add_torrent_params_url_seed.com/"), 1); │ │ │ │ - TEST_EQUAL(std::count(us.begin(), us.end() │ │ │ │ - , "http://torrent_file_url_seed.com/"), 1); │ │ │ │ - TEST_EQUAL(std::count(us.begin(), us.end() │ │ │ │ - , "http://resume_data_url_seed.com/"), 1); │ │ │ │ +#ifndef TORRENT_DISABLE_DHT │ │ │ │ │ │ │ │ - TEST_EQUAL(ws.size(), 1); │ │ │ │ - TEST_EQUAL(std::count(ws.begin(), ws.end() │ │ │ │ - , "http://resume_data_http_seed.com"), 1); │ │ │ │ -} │ │ │ │ + void torrent::dht_announce() │ │ │ │ + { │ │ │ │ + TORRENT_ASSERT(is_single_thread()); │ │ │ │ + if (!m_ses.dht()) │ │ │ │ + { │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + debug_log("DHT: no dht initialized"); │ │ │ │ +#endif │ │ │ │ + return; │ │ │ │ + } │ │ │ │ + if (!should_announce_dht()) │ │ │ │ + { │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + if (should_log()) │ │ │ │ + { │ │ │ │ +#if TORRENT_USE_I2P │ │ │ │ +
    relevance 0../src/torrent.cpp:3885add one peer per IP the hostname resolves to

    add one peer per IP the hostname resolves to

    ../src/torrent.cpp:3885

    	catch (...) { handle_exception(); }
    │ │ │ │ +#endif
    │ │ │ │  
    │ │ │ │ -TORRENT_TEST(resume_override_torrent_deprecated)
    │ │ │ │ -{
    │ │ │ │ -	// resume data overrides the .torrent_file
    │ │ │ │ -	std::printf("flags: no merge_resume_http_seed\n");
    │ │ │ │ -	lt::session ses(settings());
    │ │ │ │ -	torrent_handle h = test_resume_flags(ses,
    │ │ │ │ -
    relevance 0../test/test_resume.cpp:1683test all other resume flags here too. This would require returning more than just the torrent_status from test_resume_flags. Also http seeds and trackers for instance

    test all other resume flags here too. This would require returning │ │ │ │ -more than just the torrent_status from test_resume_flags. Also http seeds │ │ │ │ -and trackers for instance

    ../test/test_resume.cpp:1683

    	TEST_EQUAL(s.connections_limit, 1345);
    │ │ │ │ -	TEST_EQUAL(s.uploads_limit, 1346);
    │ │ │ │ -}
    │ │ │ │ +	void torrent::on_peer_name_lookup(error_code const& e
    │ │ │ │ +		, std::vector<address> const& host_list, int const port
    │ │ │ │ +		, protocol_version const v) try
    │ │ │ │ +	{
    │ │ │ │ +		TORRENT_ASSERT(is_single_thread());
    │ │ │ │  
    │ │ │ │ -TORRENT_TEST(paused)
    │ │ │ │ -{
    │ │ │ │ -	lt::session ses(settings());
    │ │ │ │ -	// resume data overrides the paused flag
    │ │ │ │ -	auto const now = lt::clock_type::now();
    │ │ │ │ -	torrent_status s = test_resume_flags(ses, torrent_flags::paused).status();
    │ │ │ │ -	default_tests(s, now);
    │ │ │ │ -#ifdef TORRENT_WINDOWS
    │ │ │ │ -	TEST_EQUAL(s.save_path, "c:\\add_torrent_params save_path");
    │ │ │ │ -#else
    │ │ │ │ -	TEST_EQUAL(s.save_path, "/add_torrent_params save_path");
    │ │ │ │ +		INVARIANT_CHECK;
    │ │ │ │ +
    │ │ │ │ +		COMPLETE_ASYNC("torrent::on_peer_name_lookup");
    │ │ │ │ +
    │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ +		if (e && should_log())
    │ │ │ │ +			debug_log("peer name lookup error: %s", e.message().c_str());
    │ │ │ │  #endif
    │ │ │ │ -	TEST_EQUAL(s.flags & flags_mask, torrent_flags::paused);
    │ │ │ │ -	TEST_EQUAL(s.connections_limit, 1345);
    │ │ │ │ -	TEST_EQUAL(s.uploads_limit, 1346);
    │ │ │ │  
    │ │ │ │ -
    } │ │ │ │ + if (e || m_abort || host_list.empty() || m_ses.is_aborted()) return; │ │ │ │ + │ │ │ │ +
    tcp::endpoint host(host_list.front(), std::uint16_t(port)); │ │ │ │
    │ │ │ │ -TORRENT_TEST(no_metadata) │ │ │ │ -{ │ │ │ │ - lt::session ses(settings()); │ │ │ │ + if (m_ip_filter && m_ip_filter->access(host.address()) & ip_filter::blocked) │ │ │ │ + { │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + if (should_log()) │ │ │ │ + { │ │ │ │ + debug_log("blocked ip from tracker: %s", host.address().to_string().c_str()); │ │ │ │ + } │ │ │ │ +#endif │ │ │ │ + if (m_ses.alerts().should_post<peer_blocked_alert>()) │ │ │ │ + m_ses.alerts().emplace_alert<peer_blocked_alert>(get_handle() │ │ │ │ + , host, peer_blocked_alert::ip_filter); │ │ │ │ + return; │ │ │ │ + } │ │ │ │ │ │ │ │ - add_torrent_params p; │ │ │ │ - p.info_hashes.v1 = sha1_hash("abababababababababab"); │ │ │ │ - p.save_path = "."; │ │ │ │ - p.name = "foobar"; │ │ │ │ - torrent_handle h = ses.add_torrent(p); │ │ │ │ - h.save_resume_data(torrent_handle::save_info_dict); │ │ │ │ - alert const* a = wait_for_alert(ses, save_resume_data_alert::alert_type); │ │ │ │ - TEST_CHECK(a); │ │ │ │ - save_resume_data_alert const* ra = alert_cast<save_resume_data_alert>(a); │ │ │ │ - TEST_CHECK(ra); │ │ │ │ - if (ra) │ │ │ │ - { │ │ │ │ - auto const& atp = ra->params; │ │ │ │ - TEST_EQUAL(atp.info_hashes, p.info_hashes); │ │ │ │ - TEST_EQUAL(atp.name, "foobar"); │ │ │ │ + if (add_peer(host, peer_info::tracker, v == protocol_version::V2 ? pex_lt_v2 : pex_flags_t(0))) │ │ │ │ + { │ │ │ │ + state_updated(); │ │ │ │ + │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + if (should_log()) │ │ │ │ + { │ │ │ │ + debug_log("name-lookup add_peer() [ %s ] connect-candidates: %d" │ │ │ │ + , host.address().to_string().c_str() │ │ │ │ + , m_peer_list ? m_peer_list->num_connect_candidates() : -1); │ │ │ │ + } │ │ │ │ +#endif │ │ │ │ + } │ │ │ │ + update_want_peers(); │ │ │ │ } │ │ │ │ -} │ │ │ │ +
    relevance 0../src/torrent.cpp:4581only do this if the piece size > 1 blocks This is a v2 torrent so we can request get block level hashes.

    only do this if the piece size > 1 blocks │ │ │ │ +This is a v2 torrent so we can request get block │ │ │ │ +level hashes.

    ../src/torrent.cpp:4581

    		{
    │ │ │ │ +			std::set<torrent_peer*> ret;
    │ │ │ │ +			if (!blocks.empty() && !downloaders.empty())
    │ │ │ │ +			{
    │ │ │ │ +				for (auto const b : blocks) ret.insert(downloaders[std::size_t(b)]);
    │ │ │ │ +			}
    │ │ │ │ +			else
    │ │ │ │ +			{
    │ │ │ │ +				std::copy(downloaders.begin(), downloaders.end(), std::inserter(ret, ret.begin()));
    │ │ │ │ +			}
    │ │ │ │ +			return ret;
    │ │ │ │ +		}();
    │ │ │ │  
    │ │ │ │ -template <typename Fun>
    │ │ │ │ -void test_unfinished_pieces(Fun f)
    │ │ │ │ -{
    │ │ │ │ -	// create a torrent and complete files
    │ │ │ │ -	std::shared_ptr<torrent_info> ti = generate_torrent(true, true);
    │ │ │ │ +		// if this piece wasn't downloaded from peers, we just found it on disk.
    │ │ │ │ +		// In that case, we should just consider it as "not-have" and there's no
    │ │ │ │ +		// need to try to get higher fidelity hashes (yet)
    │ │ │ │ +		bool const found_on_disk = peers.size() == 1 && peers.count(nullptr);
    │ │ │ │  
    │ │ │ │ -	add_torrent_params p;
    │ │ │ │ -
    relevance 0../test/test_flags.cpp:163change to a different test setup. currently always paused. test_set_after_add(torrent_flags::paused); test_unset_after_add(torrent_flags::paused);

    change to a different test setup. currently always paused. │ │ │ │ -test_set_after_add(torrent_flags::paused); │ │ │ │ -test_unset_after_add(torrent_flags::paused);

    ../test/test_flags.cpp:163

    {
    │ │ │ │ -	// share-mode
    │ │ │ │ -	test_add_and_get_flags(torrent_flags::share_mode);
    │ │ │ │ -	test_set_after_add(torrent_flags::share_mode);
    │ │ │ │ -	test_unset_after_add(torrent_flags::share_mode);
    │ │ │ │ -}
    │ │ │ │ +		if (!torrent_file().info_hashes().has_v1() && blocks.empty() && !found_on_disk)
    │ │ │ │ +		{
    │ │ │ │ +
    verify_block_hashes(index); │ │ │ │ +
    } │ │ │ │ + │ │ │ │ + // the below code is penalizing peers that sent use bad data. │ │ │ │ + // increase the total amount of failed bytes │ │ │ │ + if (!found_on_disk) │ │ │ │ + { │ │ │ │ + if (blocks.empty()) │ │ │ │ + add_failed_bytes(m_torrent_file->piece_size(index)); │ │ │ │ + else │ │ │ │ + add_failed_bytes(static_cast<int>(blocks.size()) * default_block_size); │ │ │ │ + │ │ │ │ +#ifndef TORRENT_DISABLE_EXTENSIONS │ │ │ │ + for (auto& ext : m_extensions) │ │ │ │ + { │ │ │ │ + ext->on_piece_failed(index); │ │ │ │ + } │ │ │ │ #endif │ │ │ │ │ │ │ │ -TORRENT_TEST(flag_apply_ip_filter) │ │ │ │ -{ │ │ │ │ - // apply-ip-filter │ │ │ │ - test_add_and_get_flags(torrent_flags::apply_ip_filter); │ │ │ │ - test_set_after_add(torrent_flags::apply_ip_filter); │ │ │ │ - test_unset_after_add(torrent_flags::apply_ip_filter); │ │ │ │ -} │ │ │ │ + // did we receive this piece from a single peer? │ │ │ │ + // if we know exactly which blocks failed the hash, we can also be certain │ │ │ │ + // that all peers in the list sent us bad data │ │ │ │ + bool const known_bad_peer = (!found_on_disk && peers.size() == 1) || !blocks.empty(); │ │ │ │ │ │ │ │ -TORRENT_TEST(flag_paused) │ │ │ │ -{ │ │ │ │ - // paused │ │ │ │ - test_add_and_get_flags(torrent_flags::paused); │ │ │ │ -
    } │ │ │ │ -
    │ │ │ │ -TORRENT_TEST(flag_auto_managed) │ │ │ │ -{ │ │ │ │ - // auto-managed │ │ │ │ - test_add_and_get_flags(torrent_flags::auto_managed); │ │ │ │ - test_set_after_add(torrent_flags::auto_managed); │ │ │ │ - test_unset_after_add(torrent_flags::auto_managed); │ │ │ │ -} │ │ │ │ + penalize_peers(peers, index, known_bad_peer); │ │ │ │ + } │ │ │ │ │ │ │ │ -// super seeding mode is automatically turned off if we're not a seed │ │ │ │ -// since the posix_disk_io is not threaded, this will happen immediately │ │ │ │ -#if TORRENT_HAVE_MMAP │ │ │ │ -#ifndef TORRENT_DISABLE_SUPERSEEDING │ │ │ │ -TORRENT_TEST(flag_super_seeding) │ │ │ │ -{ │ │ │ │ - // super-seeding │ │ │ │ - test_add_and_get_flags(torrent_flags::super_seeding); │ │ │ │ - test_unset_after_add(torrent_flags::super_seeding); │ │ │ │ - test_set_after_add(torrent_flags::super_seeding); │ │ │ │ -} │ │ │ │ + // If m_storage isn't set here, it means we're shutting down │ │ │ │ + if (m_storage) │ │ │ │ + { │ │ │ │ + // it doesn't make much sense to fail to hash a piece │ │ │ │ +
    relevance 0../src/torrent.cpp:7525come up with a better way of doing this, instead of an immediately invoked lambda expression.

    come up with a better way of doing this, instead of an │ │ │ │ +immediately invoked lambda expression.

    ../src/torrent.cpp:7525

    					|| peerinfo->confirmed_supports_utp))
    │ │ │ │ +			{
    │ │ │ │ +				sm = m_ses.utp_socket_manager();
    │ │ │ │ +			}
    │ │ │ │ +
    │ │ │ │ +			// don't make a TCP connection if it's disabled
    │ │ │ │ +			if (sm == nullptr && !settings().get_bool(settings_pack::enable_outgoing_tcp))
    │ │ │ │ +			{
    │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ +				if (should_log())
    │ │ │ │ +				{
    │ │ │ │ +					debug_log("discarding peer \"%s\": TCP connections disabled "
    │ │ │ │ +						"[ supports-utp: %d ]", peerinfo->to_string().c_str()
    │ │ │ │ +						, peerinfo->supports_utp);
    │ │ │ │ +				}
    │ │ │ │  #endif
    │ │ │ │ +				return false;
    │ │ │ │ +			}
    │ │ │ │ +		}
    │ │ │ │ +
    │ │ │ │ +
    aux::socket_type s = [&] { │ │ │ │ +
    │ │ │ │ +#if TORRENT_USE_I2P │ │ │ │ + if (peerinfo->is_i2p_addr) │ │ │ │ + { │ │ │ │ + // It's not entirely obvious why this peer connection is not marked as │ │ │ │ + // one. The main feature of a peer connection is that whether or not we │ │ │ │ + // proxy it is configurable. When we use i2p, we want to always prox │ │ │ │ + // everything via i2p. │ │ │ │ + │ │ │ │ + aux::proxy_settings proxy; │ │ │ │ + proxy.hostname = settings().get_str(settings_pack::i2p_hostname); │ │ │ │ + proxy.port = std::uint16_t(settings().get_int(settings_pack::i2p_port)); │ │ │ │ + proxy.type = settings_pack::i2p_proxy; │ │ │ │ + │ │ │ │ + aux::socket_type ret = instantiate_connection(m_ses.get_context() │ │ │ │ + , proxy, nullptr, nullptr, false, false); │ │ │ │ + i2p_stream& str = boost::get<i2p_stream>(ret); │ │ │ │ + str.set_local_i2p_endpoint(m_ses.local_i2p_endpoint()); │ │ │ │ + str.set_destination(static_cast<i2p_peer*>(peerinfo)->dest()); │ │ │ │ + str.set_command(i2p_stream::cmd_connect); │ │ │ │ + str.set_session_id(m_ses.i2p_session()); │ │ │ │ + return ret; │ │ │ │ + } │ │ │ │ + else │ │ │ │ #endif │ │ │ │ + { │ │ │ │ + void* userdata = nullptr; │ │ │ │ +#ifdef TORRENT_SSL_PEERS │ │ │ │ + if (is_ssl_torrent()) │ │ │ │ + { │ │ │ │ +
    relevance 0../src/torrent.cpp:9118perhaps 0 should actually mean 0

    perhaps 0 should actually mean 0

    ../src/torrent.cpp:9118

    		// finished torrents may not change their queue positions, as it's set to
    │ │ │ │ +		// -1
    │ │ │ │ +		if ((m_abort || is_finished()) && p != no_pos) return;
    │ │ │ │  
    │ │ │ │ -TORRENT_TEST(flag_sequential_download)
    │ │ │ │ -{
    │ │ │ │ -	// sequential-download
    │ │ │ │ -	test_add_and_get_flags(torrent_flags::sequential_download);
    │ │ │ │ -	test_set_after_add(torrent_flags::sequential_download);
    │ │ │ │ -	test_unset_after_add(torrent_flags::sequential_download);
    │ │ │ │ -}
    │ │ │ │ -
    relevance 0../test/test_flags.cpp:205this test is flaky, since the torrent will become ready before asking for the flags, and by then stop_when_ready will have been cleared test_add_and_get_flags(torrent_flags::stop_when_ready); setting stop-when-ready when already stopped has no effect.

    this test is flaky, since the torrent will become ready before │ │ │ │ -asking for the flags, and by then stop_when_ready will have been cleared │ │ │ │ -test_add_and_get_flags(torrent_flags::stop_when_ready); │ │ │ │ -setting stop-when-ready when already stopped has no effect.

    ../test/test_flags.cpp:205

    relevance 0../test/test_flags.cpp:209change to a different test setup. currently always paused. test_set_after_add(torrent_flags::stop_when_ready);

    change to a different test setup. currently always paused. │ │ │ │ -test_set_after_add(torrent_flags::stop_when_ready);

    ../test/test_flags.cpp:209

    	test_set_after_add(torrent_flags::super_seeding);
    │ │ │ │ -}
    │ │ │ │ +		TORRENT_ASSERT((p == no_pos) == is_finished()
    │ │ │ │ +			|| (!m_auto_managed && p == no_pos)
    │ │ │ │ +			|| (m_abort && p == no_pos)
    │ │ │ │ +			|| (!m_added && p == no_pos));
    │ │ │ │ +		if (p == m_sequence_number) return;
    │ │ │ │ +
    │ │ │ │ +		TORRENT_ASSERT(p >= no_pos);
    │ │ │ │ +
    │ │ │ │ +		state_updated();
    │ │ │ │ +
    │ │ │ │ +		m_ses.set_queue_position(this, p);
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +	void torrent::set_max_uploads(int limit, bool const state_update)
    │ │ │ │ +	{
    │ │ │ │ +		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ +
    if (limit <= 0) limit = (1 << 24) - 1; │ │ │ │ +
    if (int(m_max_uploads) == limit) return; │ │ │ │ + if (state_update) state_updated(); │ │ │ │ + m_max_uploads = aux::numeric_cast<std::uint32_t>(limit); │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + if (should_log() && state_update) │ │ │ │ + debug_log("*** set-max-uploads: %d", m_max_uploads); │ │ │ │ #endif │ │ │ │ + │ │ │ │ + if (state_update) │ │ │ │ + set_need_save_resume(torrent_handle::if_config_changed); │ │ │ │ + } │ │ │ │ + │ │ │ │ + void torrent::set_max_connections(int limit, bool const state_update) │ │ │ │ + { │ │ │ │ + TORRENT_ASSERT(is_single_thread()); │ │ │ │ +
    relevance 0../src/torrent.cpp:9135perhaps 0 should actually mean 0

    perhaps 0 should actually mean 0

    ../src/torrent.cpp:9135

    │ │ │ │ +	void torrent::set_max_uploads(int limit, bool const state_update)
    │ │ │ │ +	{
    │ │ │ │ +		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ +		if (limit <= 0) limit = (1 << 24) - 1;
    │ │ │ │ +		if (int(m_max_uploads) == limit) return;
    │ │ │ │ +		if (state_update) state_updated();
    │ │ │ │ +		m_max_uploads = aux::numeric_cast<std::uint32_t>(limit);
    │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ +		if (should_log() && state_update)
    │ │ │ │ +			debug_log("*** set-max-uploads: %d", m_max_uploads);
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │ -TORRENT_TEST(flag_sequential_download)
    │ │ │ │ -{
    │ │ │ │ -	// sequential-download
    │ │ │ │ -	test_add_and_get_flags(torrent_flags::sequential_download);
    │ │ │ │ -	test_set_after_add(torrent_flags::sequential_download);
    │ │ │ │ -	test_unset_after_add(torrent_flags::sequential_download);
    │ │ │ │ -}
    │ │ │ │ +		if (state_update)
    │ │ │ │ +			set_need_save_resume(torrent_handle::if_config_changed);
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -// the stop when ready flag will be cleared when the torrent is ready to start
    │ │ │ │ -// downloading.
    │ │ │ │ -// since the posix_disk_io is not threaded, this will happen immediately
    │ │ │ │ -#if TORRENT_HAVE_MMAP
    │ │ │ │ -TORRENT_TEST(flag_stop_when_ready)
    │ │ │ │ -{
    │ │ │ │ -	// stop-when-ready
    │ │ │ │ -
    test_unset_after_add(torrent_flags::stop_when_ready); │ │ │ │ -
    } │ │ │ │ + void torrent::set_max_connections(int limit, bool const state_update) │ │ │ │ + { │ │ │ │ + TORRENT_ASSERT(is_single_thread()); │ │ │ │ +
    if (limit <= 0) limit = (1 << 24) - 1; │ │ │ │ +
    if (int(m_max_connections) == limit) return; │ │ │ │ + if (state_update) state_updated(); │ │ │ │ + m_max_connections = aux::numeric_cast<std::uint32_t>(limit); │ │ │ │ + update_want_peers(); │ │ │ │ + │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + if (should_log() && state_update) │ │ │ │ + debug_log("*** set-max-connections: %d", m_max_connections); │ │ │ │ #endif │ │ │ │ │ │ │ │ -TORRENT_TEST(flag_disable_dht) │ │ │ │ -{ │ │ │ │ - test_add_and_get_flags(torrent_flags::disable_dht); │ │ │ │ - test_set_after_add(torrent_flags::disable_dht); │ │ │ │ - test_unset_after_add(torrent_flags::disable_dht); │ │ │ │ -} │ │ │ │ + if (num_peers() > int(m_max_connections)) │ │ │ │ + { │ │ │ │ + disconnect_peers(num_peers() - m_max_connections │ │ │ │ + , errors::too_many_connections); │ │ │ │ + } │ │ │ │ │ │ │ │ + if (state_update) │ │ │ │ + set_need_save_resume(torrent_handle::if_config_changed); │ │ │ │ + } │ │ │ │ │ │ │ │ -TORRENT_TEST(flag_disable_lsd) │ │ │ │ -{ │ │ │ │ - test_add_and_get_flags(torrent_flags::disable_lsd); │ │ │ │ - test_set_after_add(torrent_flags::disable_lsd); │ │ │ │ - test_unset_after_add(torrent_flags::disable_lsd); │ │ │ │ -} │ │ │ │ + void torrent::set_upload_limit(int const limit) │ │ │ │ + { │ │ │ │ + set_limit_impl(limit, peer_connection::upload_channel); │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + debug_log("*** set-upload-limit: %d", limit); │ │ │ │ +#endif │ │ │ │ + } │ │ │ │ │ │ │ │ -TORRENT_TEST(flag_disable_pex) │ │ │ │ -{ │ │ │ │ - test_add_and_get_flags(torrent_flags::disable_pex); │ │ │ │ - test_set_after_add(torrent_flags::disable_pex); │ │ │ │ - test_unset_after_add(torrent_flags::disable_pex); │ │ │ │ -} │ │ │ │ -
    relevance 0../src/packet_buffer.cpp:157use compare_less_wrap for this comparison as well

    use compare_less_wrap for this comparison as well

    ../src/packet_buffer.cpp:157

    	{
    │ │ │ │ -		INVARIANT_CHECK;
    │ │ │ │ -		TORRENT_ASSERT_VAL(size <= 0xffff, size);
    │ │ │ │ -		std::uint32_t new_size = m_capacity == 0 ? 16 : m_capacity;
    │ │ │ │ +	void torrent::set_download_limit(int const limit)
    │ │ │ │ +	{
    │ │ │ │ +
    relevance 0../src/torrent.cpp:11061instead of resorting the whole list, insert the peers directly into the right place

    instead of resorting the whole list, insert the peers │ │ │ │ +directly into the right place

    ../src/torrent.cpp:11061

    				std::printf("timed out [average-piece-time: %d ms ]\n"
    │ │ │ │ +					, m_average_piece_time);
    │ │ │ │ +#endif
    │ │ │ │ +			}
    │ │ │ │  
    │ │ │ │ -		while (new_size < size)
    │ │ │ │ -			new_size <<= 1;
    │ │ │ │ +			// pick all blocks for this piece. the peers list is kept up to date
    │ │ │ │ +			// and sorted. when we issue a request to a peer, its download queue
    │ │ │ │ +			// time will increase and it may need to be bumped in the peers list,
    │ │ │ │ +			// since it's ordered by download queue time
    │ │ │ │ +			pick_time_critical_block(peers, ignore_peers
    │ │ │ │ +				, peers_with_requests
    │ │ │ │ +				, pi, &i, m_picker.get()
    │ │ │ │ +				, blocks_in_piece, timed_out);
    │ │ │ │  
    │ │ │ │ -		aux::unique_ptr<packet_ptr[], index_type> new_storage(new packet_ptr[new_size]);
    │ │ │ │ +			// put back the peers we ignored into the peer list for the next piece
    │ │ │ │ +			if (!ignore_peers.empty())
    │ │ │ │ +			{
    │ │ │ │ +				peers.insert(peers.begin(), ignore_peers.begin(), ignore_peers.end());
    │ │ │ │ +				ignore_peers.clear();
    │ │ │ │  
    │ │ │ │ -		for (index_type i = m_first; i < (m_first + m_capacity); ++i)
    │ │ │ │ -			new_storage[i & (new_size - 1)] = std::move(m_storage[i & (m_capacity - 1)]);
    │ │ │ │ +
    std::sort(peers.begin(), peers.end() │ │ │ │ +
    , [] (peer_connection const* lhs, peer_connection const* rhs) │ │ │ │ + { return lhs->download_queue_time(16*1024) < rhs->download_queue_time(16*1024); }); │ │ │ │ + } │ │ │ │ │ │ │ │ - m_storage = std::move(new_storage); │ │ │ │ - m_capacity = new_size; │ │ │ │ + // if this peer's download time exceeds 2 seconds, we're done. │ │ │ │ + // We don't want to build unreasonably long request queues │ │ │ │ + if (!peers.empty() && peers[0]->download_queue_time() > milliseconds(2000)) │ │ │ │ + break; │ │ │ │ + } │ │ │ │ + │ │ │ │ + // commit all the time critical requests │ │ │ │ + for (auto p : peers_with_requests) │ │ │ │ + { │ │ │ │ + p->send_block_requests(); │ │ │ │ + } │ │ │ │ } │ │ │ │ +#endif // TORRENT_DISABLE_STREAMING │ │ │ │ │ │ │ │ - packet_ptr packet_buffer::remove(index_type idx) │ │ │ │ + std::set<std::string> torrent::web_seeds(web_seed_entry::type_t const type) const │ │ │ │ { │ │ │ │ - INVARIANT_CHECK; │ │ │ │ -
    if (idx >= m_first + m_capacity) │ │ │ │ -
    return packet_ptr(); │ │ │ │ + TORRENT_ASSERT(is_single_thread()); │ │ │ │ + std::set<std::string> ret; │ │ │ │ + for (auto const& s : m_web_seeds) │ │ │ │ + { │ │ │ │ + if (s.peer_info.banned) continue; │ │ │ │ + if (s.removed) continue; │ │ │ │ + if (s.type != type) continue; │ │ │ │ + ret.insert(s.url); │ │ │ │ + } │ │ │ │ + return ret; │ │ │ │ +
    relevance 0../src/udp_tracker_connection.cpp:633why is this a linked list?

    why is this a linked list?

    ../src/udp_tracker_connection.cpp:633

    				ipv6_peer_entry e{};
    │ │ │ │ +				std::memcpy(e.ip.data(), buf.data(), 16);
    │ │ │ │ +				buf = buf.subspan(16);
    │ │ │ │ +				e.port = aux::read_uint16(buf);
    │ │ │ │ +				resp.peers6.push_back(e);
    │ │ │ │ +			}
    │ │ │ │ +		}
    │ │ │ │ +		else
    │ │ │ │ +		{
    │ │ │ │ +			resp.peers4.reserve(static_cast<std::size_t>(num_peers));
    │ │ │ │ +			for (int i = 0; i < num_peers; ++i)
    │ │ │ │ +			{
    │ │ │ │ +				ipv4_peer_entry e{};
    │ │ │ │ +				std::memcpy(e.ip.data(), buf.data(), 4);
    │ │ │ │ +				buf = buf.subspan(4);
    │ │ │ │ +				e.port = aux::read_uint16(buf);
    │ │ │ │ +				resp.peers4.push_back(e);
    │ │ │ │ +			}
    │ │ │ │ +		}
    │ │ │ │  
    │ │ │ │ -		if (compare_less_wrap(idx, m_first, 0xffff))
    │ │ │ │ -			return packet_ptr();
    │ │ │ │ +
    std::list<address> ip_list; │ │ │ │ +
    std::transform(m_endpoints.begin(), m_endpoints.end(), std::back_inserter(ip_list) │ │ │ │ + , [](tcp::endpoint const& ep) { return ep.address(); } ); │ │ │ │ │ │ │ │ - std::size_t const mask = m_capacity - 1; │ │ │ │ - packet_ptr old_value = std::move(m_storage[idx & mask]); │ │ │ │ - m_storage[idx & mask].reset(); │ │ │ │ + cb->tracker_response(tracker_req(), m_target.address(), ip_list, resp); │ │ │ │ │ │ │ │ - if (old_value) │ │ │ │ + close(); │ │ │ │ + return true; │ │ │ │ + } │ │ │ │ + │ │ │ │ + bool udp_tracker_connection::on_scrape_response(span<char const> buf) │ │ │ │ + { │ │ │ │ + restart_read_timeout(); │ │ │ │ + auto const action = static_cast<action_t>(aux::read_int32(buf)); │ │ │ │ + std::uint32_t const transaction = aux::read_uint32(buf); │ │ │ │ + │ │ │ │ + if (transaction != m_transaction_id) │ │ │ │ { │ │ │ │ - --m_size; │ │ │ │ - if (m_size == 0) m_last = m_first; │ │ │ │ + fail(error_code(errors::invalid_tracker_transaction_id), operation_t::bittorrent); │ │ │ │ + return false; │ │ │ │ } │ │ │ │ │ │ │ │ - if (idx == m_first && m_size != 0) │ │ │ │ + if (action == action_t::error) │ │ │ │ { │ │ │ │ - ++m_first; │ │ │ │ - for (index_type i = 0; i < m_capacity; ++i, ++m_first) │ │ │ │ - if (m_storage[m_first & mask]) break; │ │ │ │ - m_first &= 0xffff; │ │ │ │ + fail(error_code(errors::tracker_failure), operation_t::bittorrent │ │ │ │ + , std::string(buf.data(), static_cast<std::size_t>(buf.size())).c_str()); │ │ │ │ + return true; │ │ │ │ } │ │ │ │ │ │ │ │ - if (((idx + 1) & 0xffff) == m_last && m_size != 0) │ │ │ │ + if (action != action_t::scrape) │ │ │ │ { │ │ │ │ - --m_last; │ │ │ │ - for (index_type i = 0; i < m_capacity; ++i, --m_last) │ │ │ │ - if (m_storage[m_last & mask]) break; │ │ │ │ - ++m_last; │ │ │ │ - m_last &= 0xffff; │ │ │ │ -
    relevance 0../src/session_handle.cpp:499in C++14, use unique_ptr and move it into the lambda

    in C++14, use unique_ptr and move it into the lambda

    ../src/session_handle.cpp:499

    #ifndef BOOST_NO_EXCEPTIONS
    │ │ │ │ -		if (params.save_path.empty())
    │ │ │ │ -			aux::throw_ex<system_error>(error_code(errors::invalid_save_path));
    │ │ │ │ -#else
    │ │ │ │ -		TORRENT_ASSERT_PRECOND(!params.save_path.empty());
    │ │ │ │ -#endif
    │ │ │ │ +
    relevance 0../src/mmap_disk_io.cpp:578in the future, propagate exceptions back to the handlers

    in the future, propagate exceptions back to the handlers

    ../src/mmap_disk_io.cpp:578

    #if DEBUG_DISK_THREAD
    │ │ │ │ +		{
    │ │ │ │ +			std::unique_lock<std::mutex> l(m_job_mutex);
    │ │ │ │  
    │ │ │ │ -#if TORRENT_ABI_VERSION < 3
    │ │ │ │ -		if (!params.info_hashes.has_v1() && !params.info_hashes.has_v2() && !params.ti)
    │ │ │ │ -			params.info_hashes.v1 = params.info_hash;
    │ │ │ │ +			DLOG("perform_job job: %s ( %s%s) piece: %d offset: %d outstanding: %d\n"
    │ │ │ │ +				, job_action_name[j->action]
    │ │ │ │ +				, (j->flags & mmap_disk_job::fence) ? "fence ": ""
    │ │ │ │ +				, (j->flags & mmap_disk_job::force_copy) ? "force_copy ": ""
    │ │ │ │ +				, static_cast<int>(j->piece), j->d.io.offset
    │ │ │ │ +				, j->storage ? j->storage->num_outstanding_jobs() : -1);
    │ │ │ │ +		}
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │ -		// the internal torrent object keeps and mutates state in the
    │ │ │ │ -		// torrent_info object. We can't let that leak back to the client
    │ │ │ │ -		if (params.ti)
    │ │ │ │ -			params.ti = std::make_shared<torrent_info>(*params.ti);
    │ │ │ │ -
    │ │ │ │ -		// we cannot capture a unique_ptr into a lambda in c++11, so we use a raw
    │ │ │ │ -		// pointer for now. async_call uses a lambda expression to post the call
    │ │ │ │ -		// to the main thread
    │ │ │ │ -
    auto* p = new add_torrent_params(std::move(params)); │ │ │ │ -
    auto guard = aux::scope_end([p]{ delete p; }); │ │ │ │ - p->save_path = complete(p->save_path); │ │ │ │ + std::shared_ptr<mmap_storage> storage = j->storage; │ │ │ │ │ │ │ │ -#if TORRENT_ABI_VERSION == 1 │ │ │ │ - handle_backwards_compatible_resume_data(*p); │ │ │ │ -#endif │ │ │ │ + TORRENT_ASSERT(static_cast<int>(j->action) < int(job_functions.size())); │ │ │ │ │ │ │ │ - async_call(&session_impl::async_add_torrent, p); │ │ │ │ - guard.disarm(); │ │ │ │ - } │ │ │ │ + m_stats_counters.inc_stats_counter(counters::num_running_disk_jobs, 1); │ │ │ │ │ │ │ │ -#ifndef BOOST_NO_EXCEPTIONS │ │ │ │ -#if TORRENT_ABI_VERSION == 1 │ │ │ │ - // if the torrent already exists, this will throw duplicate_torrent │ │ │ │ - torrent_handle session_handle::add_torrent( │ │ │ │ - torrent_info const& ti │ │ │ │ - , std::string const& save_path │ │ │ │ - , entry const& resume_data │ │ │ │ - , storage_mode_t storage_mode │ │ │ │ - , bool const add_paused) │ │ │ │ - { │ │ │ │ - add_torrent_params p; │ │ │ │ - p.ti = std::make_shared<torrent_info>(ti); │ │ │ │ - p.save_path = save_path; │ │ │ │ - if (resume_data.type() != entry::undefined_t) │ │ │ │ + // call disk function │ │ │ │ +
    status_t ret = status_t::no_error; │ │ │ │ +
    try │ │ │ │ { │ │ │ │ - bencode(std::back_inserter(p.resume_data), resume_data); │ │ │ │ + int const idx = static_cast<int>(j->action); │ │ │ │ + ret = (this->*(job_functions[static_cast<std::size_t>(idx)]))(j); │ │ │ │ } │ │ │ │ - p.storage_mode = storage_mode; │ │ │ │ - if (add_paused) p.flags |= add_torrent_params::flag_paused; │ │ │ │ -
    relevance 0../src/posix_part_file.cpp:337what do we do if someone is currently reading from the disk from this piece? does it matter? Since we won't actively erase the data from disk, but it may be overwritten soon, it's probably not that big of a deal

    what do we do if someone is currently reading from the disk │ │ │ │ -from this piece? does it matter? Since we won't actively erase the │ │ │ │ -data from disk, but it may be overwritten soon, it's probably not that │ │ │ │ -big of a deal

    ../src/posix_part_file.cpp:337

    │ │ │ │ -			if (ec) return {};
    │ │ │ │ -
    │ │ │ │ -#ifdef TORRENT_WINDOWS
    │ │ │ │ -			ret = file_pointer(::_wfopen(convert_to_native_path_string(fn).c_str(), L"wb+"));
    │ │ │ │ -#else
    │ │ │ │ -			ret = file_pointer(::fopen(fn.c_str(), "wb+"));
    │ │ │ │ -#endif
    │ │ │ │ -			if (ret.file() == nullptr)
    │ │ │ │ -				ec.assign(errno, generic_category());
    │ │ │ │ +		catch (boost::system::system_error const& err)
    │ │ │ │ +		{
    │ │ │ │ +			ret = status_t::fatal_disk_error;
    │ │ │ │ +			j->error.ec = err.code();
    │ │ │ │ +			j->error.operation = operation_t::exception;
    │ │ │ │  		}
    │ │ │ │ -		if (ec) return {};
    │ │ │ │ -		return ret;
    │ │ │ │ +		catch (std::bad_alloc const&)
    │ │ │ │ +		{
    │ │ │ │ +			ret = status_t::fatal_disk_error;
    │ │ │ │ +			j->error.ec = errors::no_memory;
    │ │ │ │ +			j->error.operation = operation_t::exception;
    │ │ │ │ +		}
    │ │ │ │ +		catch (std::exception const&)
    │ │ │ │ +		{
    │ │ │ │ +			ret = status_t::fatal_disk_error;
    │ │ │ │ +			j->error.ec = boost::asio::error::fault;
    │ │ │ │ +			j->error.operation = operation_t::exception;
    │ │ │ │ +		}
    │ │ │ │ +
    │ │ │ │ +		// note that -2 errors are OK
    │ │ │ │ +		TORRENT_ASSERT(ret != status_t::fatal_disk_error
    │ │ │ │ +			|| (j->error.ec && j->error.operation != operation_t::unknown));
    │ │ │ │ +
    │ │ │ │ +		m_stats_counters.inc_stats_counter(counters::num_running_disk_jobs, -1);
    │ │ │ │ +
    │ │ │ │ +
    relevance 0../src/mmap_disk_io.cpp:1017this is potentially very expensive. One way to solve it would be to have a fence for just this one piece. but it hardly seems worth the complexity and cost just for the edge case of receiving a corrupt piece

    this is potentially very expensive. One way to solve │ │ │ │ +it would be to have a fence for just this one piece. │ │ │ │ +but it hardly seems worth the complexity and cost just for the edge │ │ │ │ +case of receiving a corrupt piece

    ../src/mmap_disk_io.cpp:1017

    		aux::mmap_disk_job* j = m_job_pool.allocate_job(aux::job_action_t::file_priority);
    │ │ │ │ +		j->storage = m_torrents[storage]->shared_from_this();
    │ │ │ │ +		j->argument = std::move(prios);
    │ │ │ │ +		j->callback = std::move(handler);
    │ │ │ │ +
    │ │ │ │ +		add_fence_job(j);
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ -	void posix_part_file::free_piece(piece_index_t const piece)
    │ │ │ │ +	void mmap_disk_io::async_clear_piece(storage_index_t const storage
    │ │ │ │ +		, piece_index_t const index, std::function<void(piece_index_t)> handler)
    │ │ │ │  	{
    │ │ │ │ -		auto const i = m_piece_map.find(piece);
    │ │ │ │ -		if (i == m_piece_map.end()) return;
    │ │ │ │ +		aux::mmap_disk_job* j = m_job_pool.allocate_job(aux::job_action_t::clear_piece);
    │ │ │ │ +		j->storage = m_torrents[storage]->shared_from_this();
    │ │ │ │ +		j->piece = index;
    │ │ │ │ +		j->callback = std::move(handler);
    │ │ │ │ +
    │ │ │ │ +		// regular jobs are not guaranteed to be executed in-order
    │ │ │ │ +		// since clear piece must guarantee that all write jobs that
    │ │ │ │ +		// have been issued finish before the clear piece job completes
    │ │ │ │  
    │ │ │ │  
    │ │ │ │ -
    m_free_slots.push_back(i->second); │ │ │ │ - m_piece_map.erase(i); │ │ │ │ - m_dirty_metadata = true; │ │ │ │ +
    relevance 0../src/mmap_disk_io.cpp:1022Perhaps the job queue could be traversed and all jobs for this piece could be cancelled. If there are no threads currently writing to this piece, we could skip the fence altogether

    Perhaps the job queue could be traversed and all jobs for this │ │ │ │ +piece could be cancelled. If there are no threads currently writing │ │ │ │ +to this piece, we could skip the fence altogether

    ../src/mmap_disk_io.cpp:1022

    		j->storage = m_torrents[storage]->shared_from_this();
    │ │ │ │ +		j->argument = std::move(prios);
    │ │ │ │ +		j->callback = std::move(handler);
    │ │ │ │ +
    │ │ │ │ +		add_fence_job(j);
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ -	void posix_part_file::move_partfile(std::string const& path, error_code& ec)
    │ │ │ │ +	void mmap_disk_io::async_clear_piece(storage_index_t const storage
    │ │ │ │ +		, piece_index_t const index, std::function<void(piece_index_t)> handler)
    │ │ │ │  	{
    │ │ │ │ -		flush_metadata_impl(ec);
    │ │ │ │ -		if (ec) return;
    │ │ │ │ +		aux::mmap_disk_job* j = m_job_pool.allocate_job(aux::job_action_t::clear_piece);
    │ │ │ │ +		j->storage = m_torrents[storage]->shared_from_this();
    │ │ │ │ +		j->piece = index;
    │ │ │ │ +		j->callback = std::move(handler);
    │ │ │ │  
    │ │ │ │ -		if (!m_piece_map.empty())
    │ │ │ │ -		{
    │ │ │ │ -			std::string old_path = combine_path(m_path, m_name);
    │ │ │ │ -			std::string new_path = combine_path(path, m_name);
    │ │ │ │ +		// regular jobs are not guaranteed to be executed in-order
    │ │ │ │ +		// since clear piece must guarantee that all write jobs that
    │ │ │ │ +		// have been issued finish before the clear piece job completes
    │ │ │ │  
    │ │ │ │ -			rename(old_path, new_path, ec);
    │ │ │ │ -			if (ec == boost::system::errc::no_such_file_or_directory)
    │ │ │ │ -				ec.clear();
    │ │ │ │  
    │ │ │ │ -			if (ec)
    │ │ │ │ +
    add_fence_job(j); │ │ │ │ +
    } │ │ │ │ + │ │ │ │ + status_t mmap_disk_io::do_hash(aux::mmap_disk_job* j) │ │ │ │ + { │ │ │ │ + // we're not using a cache. This is the simple path │ │ │ │ + // just read straight from the file │ │ │ │ + TORRENT_ASSERT(m_magic == 0x1337); │ │ │ │ + │ │ │ │ + bool const v1 = bool(j->flags & disk_interface::v1_hash); │ │ │ │ + bool const v2 = !j->d.h.block_hashes.empty(); │ │ │ │ + │ │ │ │ + int const piece_size = v1 ? j->storage->files().piece_size(j->piece) : 0; │ │ │ │ + int const piece_size2 = v2 ? j->storage->files().piece_size2(j->piece) : 0; │ │ │ │ + int const blocks_in_piece = v1 ? (piece_size + default_block_size - 1) / default_block_size : 0; │ │ │ │ + int const blocks_in_piece2 = v2 ? j->storage->files().blocks_in_piece2(j->piece) : 0; │ │ │ │ + aux::open_mode_t const file_mode = file_mode_for_job(j); │ │ │ │ + │ │ │ │ + TORRENT_ASSERT(!v2 || int(j->d.h.block_hashes.size()) >= blocks_in_piece2); │ │ │ │ + TORRENT_ASSERT(v1 || v2); │ │ │ │ + │ │ │ │ + hasher h; │ │ │ │ + int ret = 0; │ │ │ │ + int offset = 0; │ │ │ │ + int const blocks_to_read = std::max(blocks_in_piece, blocks_in_piece2); │ │ │ │ + time_point const start_time = clock_type::now(); │ │ │ │ + for (int i = 0; i < blocks_to_read; ++i) │ │ │ │ + { │ │ │ │ + bool const v2_block = i < blocks_in_piece2; │ │ │ │ + │ │ │ │ + DLOG("do_hash: reading (piece: %d block: %d)\n", int(j->piece), i); │ │ │ │ +
    relevance 0../src/magnet_uri.cpp:439what's the right number here?

    what's the right number here?

    ../src/magnet_uri.cpp:439

    			}
    │ │ │ │ +			else if (string_equal_no_case(name, "so"_sv)) // select-only (files)
    │ │ │ │  			{
    │ │ │ │ -				storage_error se;
    │ │ │ │ -				aux::copy_file(old_path, new_path, se);
    │ │ │ │ -				ec = se.ec;
    │ │ │ │ -				if (ec) return;
    │ │ │ │ -				remove(old_path, ec);
    │ │ │ │ -			}
    │ │ │ │ -		}
    │ │ │ │ -		m_path = path;
    │ │ │ │ -	}
    │ │ │ │ -
    relevance 0../src/posix_part_file.cpp:424instead of rebuilding the whole file header and flushing it, update the slot entries as we go

    instead of rebuilding the whole file header │ │ │ │ -and flushing it, update the slot entries as we go

    ../src/posix_part_file.cpp:424

    				}
    │ │ │ │ -				auto bytes_read = std::fread(buf.get(), 1, std::size_t(block_to_copy), file.file());
    │ │ │ │ -				if (int(bytes_read) != block_to_copy)
    │ │ │ │ -					ec.assign(errno, generic_category());
    │ │ │ │ +				// accept only digits, '-' and ','
    │ │ │ │ +				if (std::any_of(value.begin(), value.end(), [](char c)
    │ │ │ │ +					{ return !is_digit(c) && c != '-' && c != ','; }))
    │ │ │ │ +					continue;
    │ │ │ │  
    │ │ │ │ -				if (ec) return;
    │ │ │ │ +				// make sure all file priorities are set to 0, except the ones
    │ │ │ │ +				// we specify in the file_priorities
    │ │ │ │ +				p.flags |= torrent_flags::default_dont_download;
    │ │ │ │  
    │ │ │ │ -				f(file_offset, {buf.get(), block_to_copy});
    │ │ │ │ -			}
    │ │ │ │ -			file_offset += block_to_copy;
    │ │ │ │ -			piece_offset = 0;
    │ │ │ │ -			size -= block_to_copy;
    │ │ │ │ -		}
    │ │ │ │ +				do
    │ │ │ │ +				{
    │ │ │ │ +					string_view token;
    │ │ │ │ +					std::tie(token, value) = split_string(value, ',');
    │ │ │ │ +
    │ │ │ │ +					if (token.empty()) continue;
    │ │ │ │ +
    │ │ │ │ +					int idx1, idx2;
    │ │ │ │ +
    constexpr int max_index = 10000; // can't risk out of memory │ │ │ │ +
    │ │ │ │ + auto const divider = token.find_first_of('-'); │ │ │ │ + if (divider != std::string::npos) // it's a range │ │ │ │ + { │ │ │ │ + if (divider == 0) // no start index │ │ │ │ + continue; │ │ │ │ + if (divider == token.size() - 1) // no end index │ │ │ │ + continue; │ │ │ │ + │ │ │ │ + idx1 = std::atoi(token.substr(0, divider).to_string().c_str()); │ │ │ │ + if (idx1 < 0 || idx1 > max_index) // invalid index │ │ │ │ + continue; │ │ │ │ + idx2 = std::atoi(token.substr(divider + 1).to_string().c_str()); │ │ │ │ + if (idx2 < 0 || idx2 > max_index) // invalid index │ │ │ │ + continue; │ │ │ │ + │ │ │ │ + if (idx1 > idx2) // wrong range limits │ │ │ │ + continue; │ │ │ │ + } │ │ │ │ + else // it's an index │ │ │ │ + { │ │ │ │ + idx1 = std::atoi(token.to_string().c_str()); │ │ │ │ + if (idx1 < 0 || idx1 > max_index) // invalid index │ │ │ │ + continue; │ │ │ │ + idx2 = idx1; │ │ │ │ + } │ │ │ │ + │ │ │ │ + if (int(p.file_priorities.size()) <= idx2) │ │ │ │ + p.file_priorities.resize(static_cast<std::size_t>(idx2) + 1, dont_download); │ │ │ │ + │ │ │ │ +
    relevance 0../src/pe_crypto.cpp:60it would be nice to get the literal working

    it would be nice to get the literal working

    ../src/pe_crypto.cpp:60

    #include <algorithm>
    │ │ │ │ +#include <random>
    │ │ │ │ +
    │ │ │ │ +#include "libtorrent/aux_/disable_warnings_push.hpp"
    │ │ │ │ +
    │ │ │ │ +#include <boost/multiprecision/integer.hpp>
    │ │ │ │ +#include <boost/multiprecision/cpp_int.hpp>
    │ │ │ │ +
    │ │ │ │ +#include "libtorrent/aux_/disable_warnings_pop.hpp"
    │ │ │ │ +
    │ │ │ │ +#include "libtorrent/random.hpp"
    │ │ │ │ +#include "libtorrent/aux_/alloca.hpp"
    │ │ │ │ +#include "libtorrent/pe_crypto.hpp"
    │ │ │ │ +#include "libtorrent/hasher.hpp"
    │ │ │ │ +
    │ │ │ │ +namespace libtorrent {
    │ │ │ │ +
    │ │ │ │ +	namespace mp = boost::multiprecision;
    │ │ │ │ +
    │ │ │ │ +	namespace {
    │ │ │ │ +
    key_t const dh_prime │ │ │ │ +
    ("0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A63A36210000000000090563"); │ │ │ │ } │ │ │ │ │ │ │ │ - void posix_part_file::flush_metadata(error_code& ec) │ │ │ │ + std::array<char, 96> export_key(key_t const& k) │ │ │ │ { │ │ │ │ - flush_metadata_impl(ec); │ │ │ │ - } │ │ │ │ + std::array<char, 96> ret; │ │ │ │ + auto* begin = reinterpret_cast<std::uint8_t*>(ret.data()); │ │ │ │ + std::uint8_t* end = mp::export_bits(k, begin, 8); │ │ │ │ │ │ │ │ -
    void posix_part_file::flush_metadata_impl(error_code& ec) │ │ │ │ -
    { │ │ │ │ - // do we need to flush the metadata? │ │ │ │ - if (m_dirty_metadata == false) return; │ │ │ │ +
    relevance 0../src/pe_crypto.cpp:71it would be nice to be able to export to a fixed width field, so we wouldn't have to shift it later

    it would be nice to be able to export to a fixed width field, so │ │ │ │ +we wouldn't have to shift it later

    ../src/pe_crypto.cpp:71

    #include "libtorrent/random.hpp"
    │ │ │ │ +#include "libtorrent/aux_/alloca.hpp"
    │ │ │ │ +#include "libtorrent/pe_crypto.hpp"
    │ │ │ │ +#include "libtorrent/hasher.hpp"
    │ │ │ │  
    │ │ │ │ -		if (m_piece_map.empty())
    │ │ │ │ -		{
    │ │ │ │ -			// if we don't have any pieces left in the
    │ │ │ │ -			// part file, remove it
    │ │ │ │ -			std::string const p = combine_path(m_path, m_name);
    │ │ │ │ -			remove(p, ec);
    │ │ │ │ +namespace libtorrent {
    │ │ │ │  
    │ │ │ │ -			if (ec == boost::system::errc::no_such_file_or_directory)
    │ │ │ │ -				ec.clear();
    │ │ │ │ -			return;
    │ │ │ │ +	namespace mp = boost::multiprecision;
    │ │ │ │ +
    │ │ │ │ +	namespace {
    │ │ │ │ +		key_t const dh_prime
    │ │ │ │ +			("0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A63A36210000000000090563");
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +	std::array<char, 96> export_key(key_t const& k)
    │ │ │ │ +	{
    │ │ │ │ +		std::array<char, 96> ret;
    │ │ │ │ +		auto* begin = reinterpret_cast<std::uint8_t*>(ret.data());
    │ │ │ │ +		std::uint8_t* end = mp::export_bits(k, begin, 8);
    │ │ │ │ +
    │ │ │ │ +
    if (end < begin + 96) │ │ │ │ +
    { │ │ │ │ + int const len = int(end - begin); │ │ │ │ +#if defined __GNUC__ && __GNUC__ == 12 │ │ │ │ +#pragma GCC diagnostic push │ │ │ │ +#pragma GCC diagnostic ignored "-Wstringop-overflow" │ │ │ │ +#endif │ │ │ │ + std::memmove(begin + 96 - len, begin, aux::numeric_cast<std::size_t>(len)); │ │ │ │ +#if defined __GNUC__ && __GNUC__ == 12 │ │ │ │ +#pragma GCC diagnostic pop │ │ │ │ +#endif │ │ │ │ + std::memset(begin, 0, aux::numeric_cast<std::size_t>(96 - len)); │ │ │ │ } │ │ │ │ + return ret; │ │ │ │ + } │ │ │ │ │ │ │ │ - auto f = open_file(open_mode::read_write, ec); │ │ │ │ - if (ec) return; │ │ │ │ + void rc4_init(const unsigned char* in, std::size_t len, rc4 *state); │ │ │ │ + std::size_t rc4_encrypt(unsigned char *out, std::size_t outlen, rc4 *state); │ │ │ │ │ │ │ │ - std::vector<char> header(static_cast<std::size_t>(m_header_size)); │ │ │ │ + // Set the prime P and the generator, generate local public key │ │ │ │ + dh_key_exchange::dh_key_exchange() │ │ │ │ + { │ │ │ │ + aux::array<std::uint8_t, 96> random_key; │ │ │ │ + aux::random_bytes({reinterpret_cast<char*>(random_key.data()) │ │ │ │ + , static_cast<std::ptrdiff_t>(random_key.size())}); │ │ │ │ │ │ │ │ - using namespace libtorrent::aux; │ │ │ │ + // create local key (random) │ │ │ │ + mp::import_bits(m_dh_local_secret, random_key.begin(), random_key.end()); │ │ │ │ │ │ │ │ - char* ptr = header.data(); │ │ │ │ - write_uint32(m_max_pieces, ptr); │ │ │ │ - write_uint32(m_piece_size, ptr); │ │ │ │ + // key = (2 ^ secret) % prime │ │ │ │ + m_dh_local_key = mp::powm(key_t(2), m_dh_local_secret, dh_prime); │ │ │ │ +
    relevance 0../src/cpuid.cpp:131enable when aarch64 is really tested

    enable when aarch64 is really tested

    ../src/cpuid.cpp:131

    	bool supports_mmx() noexcept
    │ │ │ │ +	{
    │ │ │ │ +#if TORRENT_HAS_SSE
    │ │ │ │ +		std::uint32_t cpui[4] = {0};
    │ │ │ │ +		cpuid(cpui, 1);
    │ │ │ │ +		return (cpui[2] & (1 << 23)) != 0;
    │ │ │ │ +#else
    │ │ │ │ +		return false;
    │ │ │ │ +#endif
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -		for (piece_index_t piece(0); piece < piece_index_t(m_max_pieces); ++piece)
    │ │ │ │ -		{
    │ │ │ │ -			auto const i = m_piece_map.find(piece);
    │ │ │ │ -
    relevance 0../src/udp_socket.cpp:659perhaps an attempt should be made to bind m_socks5_sock to the device of m_listen_socket

    perhaps an attempt should be made to bind m_socks5_sock to the │ │ │ │ -device of m_listen_socket

    ../src/udp_socket.cpp:659

    	if (ec)
    │ │ │ │ +	bool supports_arm_neon() noexcept
    │ │ │ │  	{
    │ │ │ │ -		if (m_alerts.should_post<socks5_alert>())
    │ │ │ │ -			m_alerts.emplace_alert<socks5_alert>(m_proxy_addr, operation_t::sock_option, ec);
    │ │ │ │ -		ec.clear();
    │ │ │ │ +#if TORRENT_HAS_ARM_NEON && TORRENT_HAS_AUXV
    │ │ │ │ +#if defined __arm__
    │ │ │ │ +		//return (getauxval(AT_HWCAP) & HWCAP_NEON);
    │ │ │ │ +		return (helper_getauxval(16) & (1 << 12));
    │ │ │ │ +#elif defined __aarch64__
    │ │ │ │ +		//return (getauxval(AT_HWCAP) & HWCAP_ASIMD);
    │ │ │ │ +		//return (getauxval(16) & (1 << 1));
    │ │ │ │ +
    return false; │ │ │ │ +
    #endif │ │ │ │ +#else │ │ │ │ + return false; │ │ │ │ +#endif │ │ │ │ } │ │ │ │ + │ │ │ │ + bool supports_arm_crc32c() noexcept │ │ │ │ + { │ │ │ │ +#if TORRENT_HAS_ARM_CRC32 && TORRENT_HAS_AUXV │ │ │ │ +#if defined TORRENT_FORCE_ARM_CRC32 │ │ │ │ + return true; │ │ │ │ +#elif defined __arm__ │ │ │ │ + //return (getauxval(AT_HWCAP2) & HWCAP2_CRC32); │ │ │ │ + return (helper_getauxval(26) & (1 << 4)); │ │ │ │ +#elif defined __aarch64__ │ │ │ │ + //return (getauxval(AT_HWCAP) & HWCAP_CRC32); │ │ │ │ + return (helper_getauxval(16) & (1 << 7)); │ │ │ │ #endif │ │ │ │ +#else │ │ │ │ + return false; │ │ │ │ #endif │ │ │ │ + } │ │ │ │ │ │ │ │ - tcp::endpoint const bind_ep(m_listen_socket.get_local_endpoint().address(), 0); │ │ │ │ - m_socks5_sock.bind(bind_ep, ec); │ │ │ │ - if (ec) │ │ │ │ - { │ │ │ │ - if (m_alerts.should_post<socks5_alert>()) │ │ │ │ - m_alerts.emplace_alert<socks5_alert>(m_proxy_addr, operation_t::sock_bind, ec); │ │ │ │ - ++m_failures; │ │ │ │ - retry_connection(); │ │ │ │ - return; │ │ │ │ +} // anonymous namespace │ │ │ │ + │ │ │ │ + bool const sse42_support = supports_sse42(); │ │ │ │ + bool const mmx_support = supports_mmx(); │ │ │ │ + bool const arm_neon_support = supports_arm_neon(); │ │ │ │ + bool const arm_crc32c_support = supports_arm_crc32c(); │ │ │ │ +} } │ │ │ │ +
    relevance 0../src/create_torrent.cpp:618this can be optimized

    this can be optimized

    ../src/create_torrent.cpp:618

    		std::string& attr = e["attr"].string();
    │ │ │ │ +		if (flags & file_storage::flag_pad_file) attr += 'p';
    │ │ │ │ +		if (flags & file_storage::flag_hidden) attr += 'h';
    │ │ │ │ +		if (flags & file_storage::flag_executable) attr += 'x';
    │ │ │ │ +		if (include_symlinks && (flags & file_storage::flag_symlink)) attr += 'l';
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ -
    │ │ │ │ -
    ADD_OUTSTANDING_ASYNC("socks5::on_connected"); │ │ │ │ - m_socks5_sock.async_connect(m_proxy_addr │ │ │ │ - , std::bind(&socks5::on_connected, self(), _1)); │ │ │ │ + void add_symlink_path(entry& e, std::string symlink_path) │ │ │ │ + { │ │ │ │ + entry& sympath_e = e["symlink path"]; │ │ │ │ │ │ │ │ - ADD_OUTSTANDING_ASYNC("socks5::on_connect_timeout"); │ │ │ │ - m_timer.expires_after(seconds(10)); │ │ │ │ - m_timer.async_wait(std::bind(&socks5::on_connect_timeout │ │ │ │ - , self(), _1)); │ │ │ │ + std::string const link = lexically_relative("", symlink_path); │ │ │ │ + for (auto elems = lsplit_path(link); !elems.first.empty(); │ │ │ │ + elems = lsplit_path(elems.second)) │ │ │ │ + sympath_e.list().emplace_back(elems.first); │ │ │ │ + } │ │ │ │ } │ │ │ │ │ │ │ │ -void socks5::on_connect_timeout(error_code const& e) │ │ │ │ -{ │ │ │ │ - COMPLETE_ASYNC("socks5::on_connect_timeout"); │ │ │ │ + std::vector<char> create_torrent::generate_buf() const │ │ │ │ + { │ │ │ │ +
    std::vector<char> ret; │ │ │ │ +
    bencode(std::back_inserter(ret), generate()); │ │ │ │ + return ret; │ │ │ │ + } │ │ │ │ │ │ │ │ - if (e == boost::asio::error::operation_aborted) return; │ │ │ │ + entry create_torrent::generate() const │ │ │ │ + { │ │ │ │ + if (m_files.num_files() == 0 || m_files.total_size() == 0) │ │ │ │ + aux::throw_ex<system_error>(errors::torrent_missing_file_tree); │ │ │ │ │ │ │ │ - if (m_abort) return; │ │ │ │ + // if all v2 hashes are set correctly, generate the v2 parts of the │ │ │ │ + // torrent │ │ │ │ + bool const make_v2 = validate_v2_hashes(m_files, m_file_piece_hash); │ │ │ │ + bool const make_v1 = validate_v1_hashes(m_files, m_piece_hash); │ │ │ │ │ │ │ │ - if (m_alerts.should_post<socks5_alert>()) │ │ │ │ - m_alerts.emplace_alert<socks5_alert>(m_proxy_addr, operation_t::connect, errors::timed_out); │ │ │ │ + // if neither v1 nor v2 hashes were set, we can't create a torrent │ │ │ │ + if (!make_v1 && !make_v2) │ │ │ │ + aux::throw_ex<system_error>(errors::invalid_hash_entry); │ │ │ │ │ │ │ │ - error_code ignore; │ │ │ │ - m_socks5_sock.close(ignore); │ │ │ │ + TORRENT_ASSERT(m_files.piece_length() > 0); │ │ │ │ │ │ │ │ - ++m_failures; │ │ │ │ - retry_connection(); │ │ │ │ -} │ │ │ │ + entry dict; │ │ │ │ │ │ │ │ -void socks5::on_connected(error_code const& e) │ │ │ │ -{ │ │ │ │ -
    relevance 0../src/enum_net.cpp:144in C++17, use __has_include for this. Other operating systems are likely to require this as well

    in C++17, use __has_include for this. Other operating systems are │ │ │ │ + if (!m_urls.empty()) dict["announce"] = m_urls.front().first; │ │ │ │ + │ │ │ │ + if (!m_nodes.empty()) │ │ │ │ + { │ │ │ │ + entry& nodes = dict["nodes"]; │ │ │ │ + entry::list_type& nodes_list = nodes.list(); │ │ │ │ + for (auto const& n : m_nodes) │ │ │ │ + { │ │ │ │ +relevance 0../src/enum_net.cpp:144in C++17, use __has_include for this. Other operating systems are likely to require this as well

    in C++17, use __has_include for this. Other operating systems are │ │ │ │ likely to require this as well

    ../src/enum_net.cpp:144

    #include <arpa/inet.h>
    │ │ │ │  #include <cstring>
    │ │ │ │  #include <cstdlib>
    │ │ │ │  #include <unistd.h>
    │ │ │ │  #include <sys/types.h>
    │ │ │ │  
    │ │ │ │  #if defined TORRENT_ANDROID && !defined IFA_F_DADFAILED
    │ │ │ │ @@ -5926,15 +6564,15 @@
    │ │ │ │  		~socket_closer() { ::close(m_socket); }
    │ │ │ │  	private:
    │ │ │ │  		int m_socket;
    │ │ │ │  	};
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │  #if !defined TORRENT_BUILD_SIMULATOR
    │ │ │ │ -
    relevance 0../src/enum_net.cpp:268if we get here, the caller still assumes the error code is reported via errno

    if we get here, the caller still assumes the error code │ │ │ │ +relevance 0../src/enum_net.cpp:268if we get here, the caller still assumes the error code is reported via errno

    if we get here, the caller still assumes the error code │ │ │ │ is reported via errno

    ../src/enum_net.cpp:268

    		;
    │ │ │ │  	}
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │  #if TORRENT_USE_NETLINK
    │ │ │ │  
    │ │ │ │  	int read_nl_sock(int sock, std::uint32_t const seq, std::uint32_t const pid
    │ │ │ │ @@ -5951,15 +6589,15 @@
    │ │ │ │  
    │ │ │ │  			for (; len > 0 && aux::nlmsg_ok(nl_hdr, len); nl_hdr = aux::nlmsg_next(nl_hdr, len))
    │ │ │ │  			{
    │ │ │ │  
    if ((aux::nlmsg_ok(nl_hdr, read_len) == 0) || (nl_hdr->nlmsg_type == NLMSG_ERROR)) │ │ │ │
    return -1; │ │ │ │ // this function doesn't handle multiple requests at the same time │ │ │ │ // so report an error if the message does not have the expected seq and pid │ │ │ │ -
    relevance 0../src/enum_net.cpp:274if we get here, the caller still assumes the error code is reported via errno

    if we get here, the caller still assumes the error code │ │ │ │ +relevance 0../src/enum_net.cpp:274if we get here, the caller still assumes the error code is reported via errno

    if we get here, the caller still assumes the error code │ │ │ │ is reported via errno

    ../src/enum_net.cpp:274

    #if TORRENT_USE_NETLINK
    │ │ │ │  
    │ │ │ │  	int read_nl_sock(int sock, std::uint32_t const seq, std::uint32_t const pid
    │ │ │ │  		, std::function<void(nlmsghdr const*)> on_msg)
    │ │ │ │  	{
    │ │ │ │  		std::array<char, 4096> buf;
    │ │ │ │  		for (;;)
    │ │ │ │ @@ -6003,171 +6641,15 @@
    │ │ │ │  			return -1;
    │ │ │ │  
    │ │ │ │  		// get the socket's port ID so that we can verify it in the response
    │ │ │ │  		sockaddr_nl sock_addr;
    │ │ │ │  		socklen_t sock_addr_len = sizeof(sock_addr);
    │ │ │ │  		if (::getsockname(sock, reinterpret_cast<sockaddr*>(&sock_addr), &sock_addr_len) < 0)
    │ │ │ │  			return -1;
    │ │ │ │ -
    relevance 0../src/ut_metadata.cpp:281we really need to increment the refcounter on the torrent while this buffer is still in the peer's send buffer

    we really need to increment the refcounter on the torrent │ │ │ │ -while this buffer is still in the peer's send buffer

    ../src/ut_metadata.cpp:281

    				int const offset = piece * 16 * 1024;
    │ │ │ │ -				metadata = m_tp.metadata().data() + offset;
    │ │ │ │ -				metadata_piece_size = std::min(
    │ │ │ │ -					int(m_tp.metadata().size()) - offset, 16 * 1024);
    │ │ │ │ -				TORRENT_ASSERT(metadata_piece_size > 0);
    │ │ │ │ -				TORRENT_ASSERT(offset >= 0);
    │ │ │ │ -				TORRENT_ASSERT(offset + metadata_piece_size <= m_tp.metadata().size());
    │ │ │ │ -			}
    │ │ │ │ -
    │ │ │ │ -			char msg[200];
    │ │ │ │ -			char* header = msg;
    │ │ │ │ -			char* p = &msg[6];
    │ │ │ │ -			int const len = bencode(p, e);
    │ │ │ │ -			int const total_size = 2 + len + metadata_piece_size;
    │ │ │ │ -			namespace io = aux;
    │ │ │ │ -			io::write_uint32(total_size, header);
    │ │ │ │ -			io::write_uint8(bt_peer_connection::msg_extended, header);
    │ │ │ │ -			io::write_uint8(m_message_index, header);
    │ │ │ │ -
    │ │ │ │ -			m_pc.send_buffer({msg, len + 6});
    │ │ │ │ -
    if (metadata_piece_size) │ │ │ │ -
    { │ │ │ │ - m_pc.append_const_send_buffer( │ │ │ │ - span<char>(const_cast<char*>(metadata), metadata_piece_size), metadata_piece_size); │ │ │ │ - } │ │ │ │ - │ │ │ │ - m_pc.stats_counters().inc_stats_counter(counters::num_outgoing_extended); │ │ │ │ - m_pc.stats_counters().inc_stats_counter(counters::num_outgoing_metadata); │ │ │ │ - } │ │ │ │ - │ │ │ │ - bool on_extended(int const length │ │ │ │ - , int const extended_msg, span<char const> body) override │ │ │ │ - { │ │ │ │ - if (extended_msg != 2) return false; │ │ │ │ - if (m_message_index == 0) return false; │ │ │ │ - │ │ │ │ - if (length > 17 * 1024) │ │ │ │ - { │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - m_pc.peer_log(peer_log_alert::incoming_message, "UT_METADATA" │ │ │ │ - , "packet too big %d", length); │ │ │ │ -#endif │ │ │ │ - m_pc.disconnect(errors::invalid_metadata_message, operation_t::bittorrent, peer_connection_interface::peer_error); │ │ │ │ - return true; │ │ │ │ - } │ │ │ │ - │ │ │ │ - if (!m_pc.packet_finished()) return true; │ │ │ │ - │ │ │ │ - error_code ec; │ │ │ │ - bdecode_node msg = bdecode(body, ec); │ │ │ │ - if (msg.type() != bdecode_node::dict_t) │ │ │ │ -
    relevance 0../src/ip_notifier.cpp:41simulator support

    simulator support

    ../src/ip_notifier.cpp:41

          from this software without specific prior written permission.
    │ │ │ │ -
    │ │ │ │ -THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
    │ │ │ │ -AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    │ │ │ │ -IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
    │ │ │ │ -ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
    │ │ │ │ -LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
    │ │ │ │ -CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
    │ │ │ │ -SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
    │ │ │ │ -INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
    │ │ │ │ -CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    │ │ │ │ -ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    │ │ │ │ -POSSIBILITY OF SUCH DAMAGE.
    │ │ │ │ -
    │ │ │ │ -*/
    │ │ │ │ -
    │ │ │ │ -#include "libtorrent/aux_/ip_notifier.hpp"
    │ │ │ │ -#include "libtorrent/assert.hpp"
    │ │ │ │ -
    │ │ │ │ -#if defined TORRENT_BUILD_SIMULATOR
    │ │ │ │ -
    #elif TORRENT_USE_NETLINK │ │ │ │ -
    #include "libtorrent/netlink.hpp" │ │ │ │ -#include "libtorrent/socket.hpp" │ │ │ │ -#include <array> │ │ │ │ -#include <unordered_map> │ │ │ │ -#elif TORRENT_USE_SYSTEMCONFIGURATION || TORRENT_USE_SC_NETWORK_REACHABILITY │ │ │ │ -#include <SystemConfiguration/SystemConfiguration.h> │ │ │ │ -#elif defined TORRENT_WINDOWS │ │ │ │ -#include "libtorrent/aux_/throw.hpp" │ │ │ │ -#include "libtorrent/aux_/disable_warnings_push.hpp" │ │ │ │ -#include <iphlpapi.h> │ │ │ │ -#ifdef TORRENT_WINRT │ │ │ │ -#include <netioapi.h> │ │ │ │ -#endif │ │ │ │ -#include <mutex> │ │ │ │ -#include "libtorrent/aux_/disable_warnings_pop.hpp" │ │ │ │ -#endif │ │ │ │ - │ │ │ │ -#include "libtorrent/aux_/netlink_utils.hpp" │ │ │ │ - │ │ │ │ -namespace libtorrent { namespace aux { │ │ │ │ - │ │ │ │ -namespace { │ │ │ │ - │ │ │ │ -#if (TORRENT_USE_SYSTEMCONFIGURATION || TORRENT_USE_SC_NETWORK_REACHABILITY) && \ │ │ │ │ - !defined TORRENT_BUILD_SIMULATOR │ │ │ │ - │ │ │ │ -// common utilities for Mac and iOS │ │ │ │ -template <typename T> void CFRefRetain(T h) { CFRetain(h); } │ │ │ │ -template <typename T> void CFRefRelease(T h) { CFRelease(h); } │ │ │ │ - │ │ │ │ -
    relevance 0../src/http_seed_connection.cpp:441technically, this isn't supposed to happen, but it seems to sometimes. Some of the accounting is probably wrong in certain cases

    technically, this isn't supposed to happen, but it seems to │ │ │ │ -sometimes. Some of the accounting is probably wrong in certain │ │ │ │ -cases

    ../src/http_seed_connection.cpp:441

    					// cut out the chunk header from the receive buffer
    │ │ │ │ -					TORRENT_ASSERT(m_chunk_pos + m_body_start < INT_MAX);
    │ │ │ │ -					m_recv_buffer.cut(header_size, t->block_size() + 1024, aux::numeric_cast<int>(m_chunk_pos + m_body_start));
    │ │ │ │ -					recv_buffer = m_recv_buffer.get();
    │ │ │ │ -					recv_buffer = recv_buffer.subspan(m_body_start);
    │ │ │ │ -					m_chunk_pos += chunk_size;
    │ │ │ │ -					if (chunk_size == 0)
    │ │ │ │ -					{
    │ │ │ │ -						TORRENT_ASSERT(m_recv_buffer.get().size() < m_chunk_pos + m_body_start + 1
    │ │ │ │ -							|| m_recv_buffer.get()[static_cast<std::ptrdiff_t>(m_chunk_pos + m_body_start)] == 'H'
    │ │ │ │ -							|| (m_parser.chunked_encoding()
    │ │ │ │ -								&& m_recv_buffer.get()[static_cast<std::ptrdiff_t>(m_chunk_pos + m_body_start)] == '\r'));
    │ │ │ │ -						m_chunk_pos = -1;
    │ │ │ │ -					}
    │ │ │ │ -				}
    │ │ │ │ -			}
    │ │ │ │ -
    │ │ │ │ -			int payload = int(bytes_transferred);
    │ │ │ │ -			if (payload > m_response_left) payload = int(m_response_left);
    │ │ │ │ -			if (payload > front_request.length) payload = front_request.length;
    │ │ │ │ -
    if (payload > outstanding_bytes()) payload = outstanding_bytes(); │ │ │ │ -
    received_bytes(payload, 0); │ │ │ │ - incoming_piece_fragment(payload); │ │ │ │ - m_response_left -= payload; │ │ │ │ - │ │ │ │ - if (m_parser.status_code() == 503) │ │ │ │ - { │ │ │ │ - if (!m_parser.finished()) return; │ │ │ │ - │ │ │ │ - int retry_time = std::atoi(std::string(recv_buffer.begin(), recv_buffer.end()).c_str()); │ │ │ │ - if (retry_time <= 0) retry_time = 60; │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - peer_log(peer_log_alert::info, "CONNECT", "retrying in %d seconds", retry_time); │ │ │ │ -#endif │ │ │ │ - │ │ │ │ - received_bytes(0, int(bytes_transferred)); │ │ │ │ - // temporarily unavailable, retry later │ │ │ │ - t->retry_web_seed(this, seconds32(retry_time)); │ │ │ │ - disconnect(error_code(m_parser.status_code(), http_category()), operation_t::bittorrent, failure); │ │ │ │ - return; │ │ │ │ - } │ │ │ │ - │ │ │ │ - │ │ │ │ - // we only received the header, no data │ │ │ │ - if (recv_buffer.empty()) break; │ │ │ │ - │ │ │ │ - if (recv_buffer.size() < front_request.length) break; │ │ │ │ - │ │ │ │ - // if the response is chunked, we need to receive the last │ │ │ │ - // terminating chunk and the tail headers before we can proceed │ │ │ │ - if (m_parser.chunked_encoding() && m_chunk_pos >= 0) break; │ │ │ │ -
    relevance 0../src/session_impl.cpp:615come up with some abstraction to do this for gnutls as well load certificates from the windows system certificate store

    come up with some abstraction to do this for gnutls as well │ │ │ │ +relevance 0../src/session_impl.cpp:615come up with some abstraction to do this for gnutls as well load certificates from the windows system certificate store

    come up with some abstraction to do this for gnutls as well │ │ │ │ load certificates from the windows system certificate store

    ../src/session_impl.cpp:615

    		pause();
    │ │ │ │  	}
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │  	// This function is called by the creating thread, not in the message loop's
    │ │ │ │  	// io_context thread.
    │ │ │ │  	void session_impl::start_session()
    │ │ │ │ @@ -6211,15 +6693,15 @@
    │ │ │ │  #endif
    │ │ │ │  #ifdef __APPLE__
    │ │ │ │  		m_ssl_ctx.load_verify_file("/etc/ssl/cert.pem", ec);
    │ │ │ │  #ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │  		if (ec) session_log("SSL load_verify_file failed: %s", ec.message().c_str());
    │ │ │ │  		ec.clear();
    │ │ │ │  #endif
    │ │ │ │ -
    relevance 0../src/session_impl.cpp:1484it would be nice to reserve() these vectors up front

    it would be nice to reserve() these vectors up front

    ../src/session_impl.cpp:1484

    			bandwidth_channel* ch = &p->channel[peer_connection::download_channel];
    │ │ │ │ +
    relevance 0../src/session_impl.cpp:1484it would be nice to reserve() these vectors up front

    it would be nice to reserve() these vectors up front

    ../src/session_impl.cpp:1484

    			bandwidth_channel* ch = &p->channel[peer_connection::download_channel];
    │ │ │ │  			if (use_quota_overhead(ch, amount_down))
    │ │ │ │  				ret |= 1 << peer_connection::download_channel;
    │ │ │ │  			ch = &p->channel[peer_connection::upload_channel];
    │ │ │ │  			if (use_quota_overhead(ch, amount_up))
    │ │ │ │  				ret |= 1 << peer_connection::upload_channel;
    │ │ │ │  		}
    │ │ │ │  		return ret;
    │ │ │ │ @@ -6262,15 +6744,15 @@
    │ │ │ │  	bool get_setting_impl(Pack const& p, int name, bool*)
    │ │ │ │  	{ return p.get_bool(name); }
    │ │ │ │  
    │ │ │ │  	template <typename Pack>
    │ │ │ │  	std::string get_setting_impl(Pack const& p, int name, std::string*)
    │ │ │ │  	{ return p.get_str(name); }
    │ │ │ │  
    │ │ │ │ -
    relevance 0../src/session_impl.cpp:1998could this function be merged with expand_unspecified_addresses? right now both listen_endpoint_t and listen_interface_t are almost identical, maybe the latter could be removed too

    could this function be merged with expand_unspecified_addresses? │ │ │ │ +relevance 0../src/session_impl.cpp:1998could this function be merged with expand_unspecified_addresses? right now both listen_endpoint_t and listen_interface_t are almost identical, maybe the latter could be removed too

    could this function be merged with expand_unspecified_addresses? │ │ │ │ right now both listen_endpoint_t and listen_interface_t are almost │ │ │ │ identical, maybe the latter could be removed too

    ../src/session_impl.cpp:1998

    		session_log("FATAL SESSION ERROR (%s : %d) [%s]"
    │ │ │ │  			, ec.category().name(), ec.value(), ec.message().c_str());
    │ │ │ │  #endif
    │ │ │ │  		this->abort();
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ @@ -6315,15 +6797,15 @@
    │ │ │ │  				// (which must be of the same family as the address we're
    │ │ │ │  				// connecting to)
    │ │ │ │  				if (iface.device != ipface.name) continue;
    │ │ │ │  
    │ │ │ │  				bool const local = iface.local
    │ │ │ │  					|| ipface.interface_address.is_loopback()
    │ │ │ │  					|| is_link_local(ipface.interface_address);
    │ │ │ │ -
    relevance 0../src/session_impl.cpp:2306it would probably be better to do this by having a listen-socket "version" number that gets bumped. And instead of setting a bool to disable a tracker, we set the version number that it was disabled at. This change would affect the ABI in 1.2, so should be done in 2.0 or later

    it would probably be better to do this by having a │ │ │ │ +relevance 0../src/session_impl.cpp:2306it would probably be better to do this by having a listen-socket "version" number that gets bumped. And instead of setting a bool to disable a tracker, we set the version number that it was disabled at. This change would affect the ABI in 1.2, so should be done in 2.0 or later

    it would probably be better to do this by having a │ │ │ │ listen-socket "version" number that gets bumped. And instead of │ │ │ │ setting a bool to disable a tracker, we set the version number that │ │ │ │ it was disabled at. This change would affect the ABI in 1.2, so │ │ │ │ should be done in 2.0 or later

    ../src/session_impl.cpp:2306

    		{
    │ │ │ │  			for (auto const& s : m_listen_sockets)
    │ │ │ │  				remap_ports(remap_natpmp_and_upnp, *s);
    │ │ │ │  		}
    │ │ │ │ @@ -6370,15 +6852,15 @@
    │ │ │ │  			if (ep != EndpointType())
    │ │ │ │  				map_handle = m.add_mapping(protocol, ep.port(), ep, device);
    │ │ │ │  		}
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │  	void session_impl::remap_ports(remap_port_mask_t const mask
    │ │ │ │  		, listen_socket_t& s)
    │ │ │ │ -
    relevance 0../src/session_impl.cpp:2866this size need to be capped

    this size need to be capped

    ../src/session_impl.cpp:2866

    				// handshaking
    │ │ │ │ +
    relevance 0../src/session_impl.cpp:2866this size need to be capped

    this size need to be capped

    ../src/session_impl.cpp:2866

    				// handshaking
    │ │ │ │  				return socket_type(ssl_stream<tcp::socket>(tcp::socket(std::move(s)), m_peer_ssl_ctx));
    │ │ │ │  			}
    │ │ │ │  			else
    │ │ │ │  #endif
    │ │ │ │  			{
    │ │ │ │  				return socket_type(tcp::socket(std::move(s)));
    │ │ │ │  			}
    │ │ │ │ @@ -6414,15 +6896,15 @@
    │ │ │ │  
    │ │ │ │  	void session_impl::on_incoming_utp_ssl(socket_type s)
    │ │ │ │  	{
    │ │ │ │  		TORRENT_ASSERT(is_ssl(s));
    │ │ │ │  
    │ │ │ │  		// save the socket so we can cancel the handshake
    │ │ │ │  
    │ │ │ │ -
    relevance 0../src/session_impl.cpp:2891this size need to be capped

    this size need to be capped

    ../src/session_impl.cpp:2891

    			// after the handshake is done
    │ │ │ │ +
    relevance 0../src/session_impl.cpp:2891this size need to be capped

    this size need to be capped

    ../src/session_impl.cpp:2891

    			// after the handshake is done
    │ │ │ │  			ADD_OUTSTANDING_ASYNC("session_impl::ssl_handshake");
    │ │ │ │  			boost::get<ssl_stream<tcp::socket>>(**iter).async_accept_handshake(
    │ │ │ │  				[this, sock] (error_code const& err) { ssl_handshake(err, sock); });
    │ │ │ │  		}
    │ │ │ │  		else
    │ │ │ │  #endif
    │ │ │ │  		{
    │ │ │ │ @@ -6465,15 +6947,15 @@
    │ │ │ │  		if (iter == m_incoming_sockets.end()) return;
    │ │ │ │  
    │ │ │ │  		socket_type s(std::move(**iter));
    │ │ │ │  		TORRENT_ASSERT(is_ssl(s));
    │ │ │ │  		m_incoming_sockets.erase(iter);
    │ │ │ │  
    │ │ │ │  		error_code e;
    │ │ │ │ -
    relevance 0../src/session_impl.cpp:3590have a separate list for these connections, instead of having to loop through all of them

    have a separate list for these connections, instead of having to loop through all of them

    ../src/session_impl.cpp:3590

    		// --------------------------------------------------------------
    │ │ │ │ +
    relevance 0../src/session_impl.cpp:3590have a separate list for these connections, instead of having to loop through all of them

    have a separate list for these connections, instead of having to loop through all of them

    ../src/session_impl.cpp:3590

    		// --------------------------------------------------------------
    │ │ │ │  		if (!m_paused) m_auto_manage_time_scaler--;
    │ │ │ │  		if (m_auto_manage_time_scaler < 0)
    │ │ │ │  		{
    │ │ │ │  			m_auto_manage_time_scaler = settings().get_int(settings_pack::auto_manage_interval);
    │ │ │ │  			recalculate_auto_managed_torrents();
    │ │ │ │  		}
    │ │ │ │  
    │ │ │ │ @@ -6516,15 +6998,15 @@
    │ │ │ │  
    │ │ │ │  			// if the call to second_tick caused the torrent
    │ │ │ │  			// to no longer want to be ticked (i.e. it was
    │ │ │ │  			// removed from the list) we need to back up the counter
    │ │ │ │  			// to not miss the torrent after it
    │ │ │ │  			if (!t.want_tick()) --i;
    │ │ │ │  		}
    │ │ │ │ -
    relevance 0../src/session_impl.cpp:3623this should apply to all bandwidth channels

    this should apply to all bandwidth channels

    ../src/session_impl.cpp:3623

    #if TORRENT_DEBUG_STREAMING > 0
    │ │ │ │ +
    relevance 0../src/session_impl.cpp:3623this should apply to all bandwidth channels

    this should apply to all bandwidth channels

    ../src/session_impl.cpp:3623

    #if TORRENT_DEBUG_STREAMING > 0
    │ │ │ │  		std::printf("\033[2J\033[0;0H");
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │  		aux::vector<torrent*>& want_tick = m_torrent_lists[torrent_want_tick];
    │ │ │ │  		for (int i = 0; i < int(want_tick.size()); ++i)
    │ │ │ │  		{
    │ │ │ │  			torrent& t = *want_tick[i];
    │ │ │ │ @@ -6567,15 +7049,15 @@
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │  		m_stat.second_tick(tick_interval_ms);
    │ │ │ │  
    │ │ │ │  		// --------------------------------------------------------------
    │ │ │ │  		// scrape paused torrents that are auto managed
    │ │ │ │  		// (unless the session is paused)
    │ │ │ │ -
    relevance 0../src/session_impl.cpp:4314use a lower limit than m_settings.connections_limit to allocate the to 10% or so of connection slots for incoming connections cap this at max - 1, since we may add one below

    use a lower limit than m_settings.connections_limit │ │ │ │ +relevance 0../src/session_impl.cpp:4314use a lower limit than m_settings.connections_limit to allocate the to 10% or so of connection slots for incoming connections cap this at max - 1, since we may add one below

    use a lower limit than m_settings.connections_limit │ │ │ │ to allocate the to 10% or so of connection slots for incoming │ │ │ │ connections │ │ │ │ cap this at max - 1, since we may add one below

    ../src/session_impl.cpp:4314

    		// boost, which are done immediately on a tracker response. These
    │ │ │ │  		// connections needs to be deducted from the regular connection attempt
    │ │ │ │  		// quota for this tick
    │ │ │ │  		if (m_boost_connections > 0)
    │ │ │ │  		{
    │ │ │ │ @@ -6621,15 +7103,15 @@
    │ │ │ │  
    │ │ │ │  			if (m_next_finished_connect_torrent >= int(want_peers_finished.size()))
    │ │ │ │  				m_next_finished_connect_torrent = 0;
    │ │ │ │  
    │ │ │ │  			torrent* t = nullptr;
    │ │ │ │  			// there are prioritized torrents. Pick one of those
    │ │ │ │  			while (!m_prio_torrents.empty())
    │ │ │ │ -
    relevance 0../src/session_impl.cpp:4459post a message to have this happen immediately instead of waiting for the next tick

    post a message to have this happen │ │ │ │ +relevance 0../src/session_impl.cpp:4459post a message to have this happen immediately instead of waiting for the next tick

    post a message to have this happen │ │ │ │ immediately instead of waiting for the next tick

    ../src/session_impl.cpp:4459

    				continue;
    │ │ │ │  			}
    │ │ │ │  
    │ │ │ │  			if (!p->is_peer_interested()
    │ │ │ │  				|| p->is_disconnecting()
    │ │ │ │  				|| p->is_connecting())
    │ │ │ │  			{
    │ │ │ │ @@ -6673,15 +7155,15 @@
    │ │ │ │  		if (should_log())
    │ │ │ │  		{
    │ │ │ │  			session_log("RECALCULATE UNCHOKE SLOTS: [ peers: %d "
    │ │ │ │  				"eligible-peers: %d"
    │ │ │ │  				" allowed-slots: %d ]"
    │ │ │ │  				, int(m_connections.size())
    │ │ │ │  				, int(peers.size())
    │ │ │ │ -
    relevance 0../src/session_impl.cpp:4786it might be a nice feature here to limit the number of torrents to send in a single update. By just posting the first n torrents, they would nicely be round-robined because the torrent lists are always pushed back. Perhaps the status_update_alert could even have a fixed array of n entries rather than a vector, to further improve memory locality.

    it might be a nice feature here to limit the number of torrents │ │ │ │ +relevance 0../src/session_impl.cpp:4786it might be a nice feature here to limit the number of torrents to send in a single update. By just posting the first n torrents, they would nicely be round-robined because the torrent lists are always pushed back. Perhaps the status_update_alert could even have a fixed array of n entries rather than a vector, to further improve memory locality.

    it might be a nice feature here to limit the number of torrents │ │ │ │ to send in a single update. By just posting the first n torrents, they │ │ │ │ would nicely be round-robined because the torrent lists are always │ │ │ │ pushed back. Perhaps the status_update_alert could even have a fixed │ │ │ │ array of n entries rather than a vector, to further improve memory │ │ │ │ locality.

    ../src/session_impl.cpp:4786

    			t->status(&st, flags);
    │ │ │ │  		}
    │ │ │ │  	}
    │ │ │ │ @@ -6729,15 +7211,15 @@
    │ │ │ │  			m_posted_stats_header = true;
    │ │ │ │  			m_alerts.emplace_alert<session_stats_header_alert>();
    │ │ │ │  		}
    │ │ │ │  		m_disk_thread->update_stats_counters(m_stats_counters);
    │ │ │ │  
    │ │ │ │  #ifndef TORRENT_DISABLE_DHT
    │ │ │ │  		if (m_dht)
    │ │ │ │ -
    relevance 0../src/session_impl.cpp:5161factor out this logic into a separate function for unit testing

    factor out this logic into a separate function for unit │ │ │ │ +relevance 0../src/session_impl.cpp:5161factor out this logic into a separate function for unit testing

    factor out this logic into a separate function for unit │ │ │ │ testing

    ../src/session_impl.cpp:5161

    		if (m_settings.get_int(settings_pack::outgoing_port) > 0)
    │ │ │ │  		{
    │ │ │ │  #ifdef TORRENT_WINDOWS
    │ │ │ │  			s.set_option(exclusive_address_use(true), ec);
    │ │ │ │  #else
    │ │ │ │  			s.set_option(tcp::acceptor::reuse_address(true), ec);
    │ │ │ │  #endif
    │ │ │ │ @@ -6781,15 +7263,15 @@
    │ │ │ │  
    │ │ │ │  				if (ls->flags & listen_socket_t::proxy
    │ │ │ │  					|| match_addr_mask(ls->local_endpoint.address(), remote_address, ls->netmask))
    │ │ │ │  				{
    │ │ │ │  					// is this better than the previous match?
    │ │ │ │  					match = ls;
    │ │ │ │  				}
    │ │ │ │ -
    relevance 0../src/session_impl.cpp:5880refactor, move the storage to dht_tracker

    refactor, move the storage to dht_tracker

    ../src/session_impl.cpp:5880

    #ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ +
    relevance 0../src/session_impl.cpp:5880refactor, move the storage to dht_tracker

    refactor, move the storage to dht_tracker

    ../src/session_impl.cpp:5880

    #ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │  			session_log("not starting DHT, outstanding router lookups: %d"
    │ │ │ │  				, m_outstanding_router_lookups);
    │ │ │ │  #endif
    │ │ │ │  			return;
    │ │ │ │  		}
    │ │ │ │  
    │ │ │ │  		if (m_abort)
    │ │ │ │ @@ -6832,15 +7314,15 @@
    │ │ │ │  		for (auto const& n : m_dht_router_nodes)
    │ │ │ │  		{
    │ │ │ │  			m_dht->add_router_node(n);
    │ │ │ │  		}
    │ │ │ │  
    │ │ │ │  		for (auto const& n : m_dht_nodes)
    │ │ │ │  		{
    │ │ │ │ -
    relevance 0../src/session_impl.cpp:6267asserts that no outstanding async operations are still in flight

    asserts that no outstanding async operations are still in flight

    ../src/session_impl.cpp:6267

    		if (!m_dht) return;
    │ │ │ │ +
    relevance 0../src/session_impl.cpp:6267asserts that no outstanding async operations are still in flight

    asserts that no outstanding async operations are still in flight

    ../src/session_impl.cpp:6267

    		if (!m_dht) return;
    │ │ │ │  		m_dht->direct_request(ep, e, std::bind(&on_direct_response, std::ref(m_alerts), userdata, _1));
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │  	bool session_impl::is_listening() const
    │ │ │ │  	{
    │ │ │ │ @@ -6883,47 +7365,149 @@
    │ │ │ │  			for (wakeup_t const& w : _wakeups)
    │ │ │ │  			{
    │ │ │ │  				bool const idle_wakeup = w.context_switches > prev_csw;
    │ │ │ │  				std::fprintf(f, "%" PRId64 "\t%" PRId64 "\t%" PRId64 "\t%c\t%s\n"
    │ │ │ │  					, total_microseconds(w.timestamp - m)
    │ │ │ │  					, total_microseconds(w.timestamp - prev)
    │ │ │ │  					, w.context_switches
    │ │ │ │ -
    relevance 0../src/part_file.cpp:300what do we do if someone is currently reading from the disk from this piece? does it matter? Since we won't actively erase the data from disk, but it may be overwritten soon, it's probably not that big of a deal

    what do we do if someone is currently reading from the disk │ │ │ │ -from this piece? does it matter? Since we won't actively erase the │ │ │ │ -data from disk, but it may be overwritten soon, it's probably not that │ │ │ │ -big of a deal

    ../src/part_file.cpp:300

    				create_directories(m_path, ec);
    │ │ │ │ -				if (ec) return {};
    │ │ │ │ -				return aux::file_handle(fn, 0, mode);
    │ │ │ │ +
    relevance 0../src/ut_metadata.cpp:281we really need to increment the refcounter on the torrent while this buffer is still in the peer's send buffer

    we really need to increment the refcounter on the torrent │ │ │ │ +while this buffer is still in the peer's send buffer

    ../src/ut_metadata.cpp:281

    				int const offset = piece * 16 * 1024;
    │ │ │ │ +				metadata = m_tp.metadata().data() + offset;
    │ │ │ │ +				metadata_piece_size = std::min(
    │ │ │ │ +					int(m_tp.metadata().size()) - offset, 16 * 1024);
    │ │ │ │ +				TORRENT_ASSERT(metadata_piece_size > 0);
    │ │ │ │ +				TORRENT_ASSERT(offset >= 0);
    │ │ │ │ +				TORRENT_ASSERT(offset + metadata_piece_size <= m_tp.metadata().size());
    │ │ │ │  			}
    │ │ │ │ -			return {};
    │ │ │ │ +
    │ │ │ │ +			char msg[200];
    │ │ │ │ +			char* header = msg;
    │ │ │ │ +			char* p = &msg[6];
    │ │ │ │ +			int const len = bencode(p, e);
    │ │ │ │ +			int const total_size = 2 + len + metadata_piece_size;
    │ │ │ │ +			namespace io = aux;
    │ │ │ │ +			io::write_uint32(total_size, header);
    │ │ │ │ +			io::write_uint8(bt_peer_connection::msg_extended, header);
    │ │ │ │ +			io::write_uint8(m_message_index, header);
    │ │ │ │ +
    │ │ │ │ +			m_pc.send_buffer({msg, len + 6});
    │ │ │ │ +
    if (metadata_piece_size) │ │ │ │ +
    { │ │ │ │ + m_pc.append_const_send_buffer( │ │ │ │ + span<char>(const_cast<char*>(metadata), metadata_piece_size), metadata_piece_size); │ │ │ │ + } │ │ │ │ + │ │ │ │ + m_pc.stats_counters().inc_stats_counter(counters::num_outgoing_extended); │ │ │ │ + m_pc.stats_counters().inc_stats_counter(counters::num_outgoing_metadata); │ │ │ │ + } │ │ │ │ + │ │ │ │ + bool on_extended(int const length │ │ │ │ + , int const extended_msg, span<char const> body) override │ │ │ │ + { │ │ │ │ + if (extended_msg != 2) return false; │ │ │ │ + if (m_message_index == 0) return false; │ │ │ │ + │ │ │ │ + if (length > 17 * 1024) │ │ │ │ + { │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + m_pc.peer_log(peer_log_alert::incoming_message, "UT_METADATA" │ │ │ │ + , "packet too big %d", length); │ │ │ │ +#endif │ │ │ │ + m_pc.disconnect(errors::invalid_metadata_message, operation_t::bittorrent, peer_connection_interface::peer_error); │ │ │ │ + return true; │ │ │ │ + } │ │ │ │ + │ │ │ │ + if (!m_pc.packet_finished()) return true; │ │ │ │ + │ │ │ │ + error_code ec; │ │ │ │ + bdecode_node msg = bdecode(body, ec); │ │ │ │ + if (msg.type() != bdecode_node::dict_t) │ │ │ │ +
    relevance 0../src/torrent_info.cpp:887this should be considered a failure, and the .torrent file rejected

    this should be considered a failure, and the .torrent file │ │ │ │ +rejected

    ../src/torrent_info.cpp:887

    			std::string ext = extension(filename);
    │ │ │ │ +			int cnt = 0;
    │ │ │ │ +			for (;;)
    │ │ │ │ +			{
    │ │ │ │ +				++cnt;
    │ │ │ │ +				char new_ext[50];
    │ │ │ │ +				std::snprintf(new_ext, sizeof(new_ext), ".%d%s", cnt, ext.c_str());
    │ │ │ │ +				filename = base + new_ext;
    │ │ │ │ +
    │ │ │ │ +				boost::crc_optimal<32, 0x1EDC6F41, 0xFFFFFFFF, 0xFFFFFFFF, true, true> crc;
    │ │ │ │ +				process_string_lowercase(crc, filename);
    │ │ │ │ +				std::uint32_t const new_hash = crc.checksum();
    │ │ │ │ +				if (files.find(new_hash) == files.end())
    │ │ │ │ +				{
    │ │ │ │ +					files.insert({new_hash, {i, 0}});
    │ │ │ │ +					break;
    │ │ │ │ +				}
    │ │ │ │ +				++num_collisions;
    │ │ │ │ +				if (num_collisions > 100)
    │ │ │ │ +				{
    │ │ │ │ +
    } │ │ │ │ +
    } │ │ │ │ + │ │ │ │ + copy_on_write(); │ │ │ │ + m_files.rename_file(i, filename); │ │ │ │ } │ │ │ │ } │ │ │ │ - catch (storage_error const& e) │ │ │ │ + │ │ │ │ + void torrent_info::remap_files(file_storage const& f) │ │ │ │ { │ │ │ │ - ec = e.ec; │ │ │ │ - return {}; │ │ │ │ + INVARIANT_CHECK; │ │ │ │ + │ │ │ │ + TORRENT_ASSERT(is_loaded()); │ │ │ │ + // the new specified file storage must have the exact │ │ │ │ + // same size as the current file storage │ │ │ │ + TORRENT_ASSERT(m_files.total_size() == f.total_size()); │ │ │ │ + │ │ │ │ + if (m_files.total_size() != f.total_size()) return; │ │ │ │ + copy_on_write(); │ │ │ │ + m_files = f; │ │ │ │ + m_files.set_num_pieces(m_orig_files->num_pieces()); │ │ │ │ + m_files.set_piece_length(m_orig_files->piece_length()); │ │ │ │ } │ │ │ │ │ │ │ │ - void part_file::free_piece(piece_index_t const piece) │ │ │ │ +#if TORRENT_ABI_VERSION == 1 │ │ │ │ + // standard constructor that parses a torrent file │ │ │ │ + torrent_info::torrent_info(entry const& torrent_file) │ │ │ │ { │ │ │ │ - std::lock_guard<std::mutex> l(m_mutex); │ │ │ │ + std::vector<char> tmp; │ │ │ │ + std::back_insert_iterator<std::vector<char>> out(tmp); │ │ │ │ + bencode(out, torrent_file); │ │ │ │ +
    relevance 0../src/posix_part_file.cpp:337what do we do if someone is currently reading from the disk from this piece? does it matter? Since we won't actively erase the data from disk, but it may be overwritten soon, it's probably not that big of a deal

    what do we do if someone is currently reading from the disk │ │ │ │ +from this piece? does it matter? Since we won't actively erase the │ │ │ │ +data from disk, but it may be overwritten soon, it's probably not that │ │ │ │ +big of a deal

    ../src/posix_part_file.cpp:337

    │ │ │ │ +			if (ec) return {};
    │ │ │ │  
    │ │ │ │ +#ifdef TORRENT_WINDOWS
    │ │ │ │ +			ret = file_pointer(::_wfopen(convert_to_native_path_string(fn).c_str(), L"wb+"));
    │ │ │ │ +#else
    │ │ │ │ +			ret = file_pointer(::fopen(fn.c_str(), "wb+"));
    │ │ │ │ +#endif
    │ │ │ │ +			if (ret.file() == nullptr)
    │ │ │ │ +				ec.assign(errno, generic_category());
    │ │ │ │ +		}
    │ │ │ │ +		if (ec) return {};
    │ │ │ │ +		return ret;
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +	void posix_part_file::free_piece(piece_index_t const piece)
    │ │ │ │ +	{
    │ │ │ │  		auto const i = m_piece_map.find(piece);
    │ │ │ │  		if (i == m_piece_map.end()) return;
    │ │ │ │  
    │ │ │ │  
    │ │ │ │
    m_free_slots.push_back(i->second); │ │ │ │ m_piece_map.erase(i); │ │ │ │ m_dirty_metadata = true; │ │ │ │ } │ │ │ │ │ │ │ │ - void part_file::move_partfile(std::string const& path, error_code& ec) │ │ │ │ + void posix_part_file::move_partfile(std::string const& path, error_code& ec) │ │ │ │ { │ │ │ │ - std::lock_guard<std::mutex> l(m_mutex); │ │ │ │ - │ │ │ │ flush_metadata_impl(ec); │ │ │ │ if (ec) return; │ │ │ │ │ │ │ │ if (!m_piece_map.empty()) │ │ │ │ { │ │ │ │ std::string old_path = combine_path(m_path, m_name); │ │ │ │ std::string new_path = combine_path(path, m_name); │ │ │ │ @@ -6937,36 +7521,38 @@ │ │ │ │ storage_error se; │ │ │ │ aux::copy_file(old_path, new_path, se); │ │ │ │ ec = se.ec; │ │ │ │ if (ec) return; │ │ │ │ remove(old_path, ec); │ │ │ │ } │ │ │ │ } │ │ │ │ -
    relevance 0../src/part_file.cpp:411instead of rebuilding the whole file header and flushing it, update the slot entries as we go

    instead of rebuilding the whole file header │ │ │ │ -and flushing it, update the slot entries as we go

    ../src/part_file.cpp:411

    						TORRENT_ASSERT(j->second == slot);
    │ │ │ │ -						m_free_slots.push_back(j->second);
    │ │ │ │ -						m_piece_map.erase(j);
    │ │ │ │ -						m_dirty_metadata = true;
    │ │ │ │ -					}
    │ │ │ │ -				}
    │ │ │ │ +		m_path = path;
    │ │ │ │ +	}
    │ │ │ │ +
    relevance 0../src/posix_part_file.cpp:424instead of rebuilding the whole file header and flushing it, update the slot entries as we go

    instead of rebuilding the whole file header │ │ │ │ +and flushing it, update the slot entries as we go

    ../src/posix_part_file.cpp:424

    				}
    │ │ │ │ +				auto bytes_read = std::fread(buf.get(), 1, std::size_t(block_to_copy), file.file());
    │ │ │ │ +				if (int(bytes_read) != block_to_copy)
    │ │ │ │ +					ec.assign(errno, generic_category());
    │ │ │ │ +
    │ │ │ │ +				if (ec) return;
    │ │ │ │ +
    │ │ │ │ +				f(file_offset, {buf.get(), block_to_copy});
    │ │ │ │  			}
    │ │ │ │  			file_offset += block_to_copy;
    │ │ │ │  			piece_offset = 0;
    │ │ │ │  			size -= block_to_copy;
    │ │ │ │  		}
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ -	void part_file::flush_metadata(error_code& ec)
    │ │ │ │ +	void posix_part_file::flush_metadata(error_code& ec)
    │ │ │ │  	{
    │ │ │ │ -		std::lock_guard<std::mutex> l(m_mutex);
    │ │ │ │ -
    │ │ │ │  		flush_metadata_impl(ec);
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ -
    void part_file::flush_metadata_impl(error_code& ec) │ │ │ │ +
    void posix_part_file::flush_metadata_impl(error_code& ec) │ │ │ │
    { │ │ │ │ // do we need to flush the metadata? │ │ │ │ if (m_dirty_metadata == false) return; │ │ │ │ │ │ │ │ if (m_piece_map.empty()) │ │ │ │ { │ │ │ │ // if we don't have any pieces left in the │ │ │ │ @@ -6975,29 +7561,80 @@ │ │ │ │ remove(p, ec); │ │ │ │ │ │ │ │ if (ec == boost::system::errc::no_such_file_or_directory) │ │ │ │ ec.clear(); │ │ │ │ return; │ │ │ │ } │ │ │ │ │ │ │ │ - auto f = open_file(aux::open_mode::write | aux::open_mode::hidden, ec); │ │ │ │ + auto f = open_file(open_mode::read_write, ec); │ │ │ │ if (ec) return; │ │ │ │ │ │ │ │ std::vector<char> header(static_cast<std::size_t>(m_header_size)); │ │ │ │ │ │ │ │ using namespace libtorrent::aux; │ │ │ │ │ │ │ │ char* ptr = header.data(); │ │ │ │ write_uint32(m_max_pieces, ptr); │ │ │ │ write_uint32(m_piece_size, ptr); │ │ │ │ │ │ │ │ for (piece_index_t piece(0); piece < piece_index_t(m_max_pieces); ++piece) │ │ │ │ { │ │ │ │ auto const i = m_piece_map.find(piece); │ │ │ │ -
    relevance 0../src/utp_stream.cpp:1467this loop is not very efficient. It could be fixed by having a separate list of sequence numbers that need resending

    this loop is not very efficient. It could be fixed by having │ │ │ │ +relevance 0../src/choker.cpp:258make configurable

    make configurable

    ../src/choker.cpp:258

    			// first reset the number of unchoke slots, because we'll calculate
    │ │ │ │ +			// it purely based on the current state of our peers.
    │ │ │ │ +			upload_slots = 0;
    │ │ │ │ +
    │ │ │ │ +			int rate_threshold = sett.get_int(settings_pack::rate_choker_initial_threshold);
    │ │ │ │ +
    │ │ │ │ +			std::sort(peers.begin(), peers.end()
    │ │ │ │ +				, [](peer_connection const* lhs, peer_connection const* rhs)
    │ │ │ │ +				{ return upload_rate_compare(lhs, rhs); });
    │ │ │ │ +
    │ │ │ │ +			for (auto const* p : peers)
    │ │ │ │ +			{
    │ │ │ │ +				int const rate = int(p->uploaded_in_last_round()
    │ │ │ │ +					* 1000 / total_milliseconds(unchoke_interval));
    │ │ │ │ +
    │ │ │ │ +				// always have at least 1 unchoke slot
    │ │ │ │ +				if (rate < rate_threshold) break;
    │ │ │ │ +
    │ │ │ │ +				++upload_slots;
    │ │ │ │ +
    │ │ │ │ +
    rate_threshold += 2048; │ │ │ │ +
    } │ │ │ │ + ++upload_slots; │ │ │ │ + } │ │ │ │ + │ │ │ │ + // sorts the peers that are eligible for unchoke by download rate and │ │ │ │ + // secondary by total upload. The reason for this is, if all torrents are │ │ │ │ + // being seeded, the download rate will be 0, and the peers we have sent │ │ │ │ + // the least to should be unchoked │ │ │ │ + │ │ │ │ + // we use partial sort here, because we only care about the top │ │ │ │ + // upload_slots peers. │ │ │ │ + │ │ │ │ + int const slots = std::min(upload_slots, int(peers.size())); │ │ │ │ + │ │ │ │ + if (sett.get_int(settings_pack::seed_choking_algorithm) │ │ │ │ + == settings_pack::round_robin) │ │ │ │ + { │ │ │ │ + int const pieces = sett.get_int(settings_pack::seeding_piece_quota); │ │ │ │ + │ │ │ │ + std::nth_element(peers.begin(), peers.begin() │ │ │ │ + + slots, peers.end() │ │ │ │ + , [pieces](peer_connection const* lhs, peer_connection const* rhs) │ │ │ │ + { return unchoke_compare_rr(lhs, rhs, pieces); }); │ │ │ │ + } │ │ │ │ + else if (sett.get_int(settings_pack::seed_choking_algorithm) │ │ │ │ + == settings_pack::fastest_upload) │ │ │ │ + { │ │ │ │ + std::nth_element(peers.begin(), peers.begin() │ │ │ │ + + slots, peers.end() │ │ │ │ + , [](peer_connection const* lhs, peer_connection const* rhs) │ │ │ │ +
    relevance 0../src/utp_stream.cpp:1467this loop is not very efficient. It could be fixed by having a separate list of sequence numbers that need resending

    this loop is not very efficient. It could be fixed by having │ │ │ │ a separate list of sequence numbers that need resending

    ../src/utp_stream.cpp:1467

    #endif
    │ │ │ │  
    │ │ │ │  	if (m_stalled)
    │ │ │ │  	{
    │ │ │ │  		if (flags & pkt_ack)
    │ │ │ │  			defer_ack();
    │ │ │ │  		return false;
    │ │ │ │ @@ -7041,720 +7678,620 @@
    │ │ │ │  
    │ │ │ │  	// under these conditions, the next packet we send should be an MTU probe.
    │ │ │ │  	// MTU probes get to use the mid-point packet size, whereas other packets
    │ │ │ │  	// use a conservative packet size of the largest known to work. The reason
    │ │ │ │  	// for the cwnd condition is to make sure the probe is surrounded by non-
    │ │ │ │  	// probes, to be able to distinguish a loss of the probe vs. just loss in
    │ │ │ │  	// general.
    │ │ │ │ -
    relevance 0../src/torrent_handle.cpp:589support moving files into this call

    support moving files into this call

    ../src/torrent_handle.cpp:589

    		auto retp = &prio;
    │ │ │ │ -		sync_call(&torrent::piece_priorities, retp);
    │ │ │ │ -		std::vector<int> ret;
    │ │ │ │ -		ret.reserve(prio.size());
    │ │ │ │ -		for (auto p : prio)
    │ │ │ │ -			ret.push_back(int(static_cast<std::uint8_t>(p)));
    │ │ │ │ -		return ret;
    │ │ │ │ -	}
    │ │ │ │ -#endif
    │ │ │ │ +
    relevance 0../src/storage_utils.cpp:230ideally, if we end up copying files because of a move across volumes, the source should not be deleted until they've all been copied. That would let us rollback with higher confidence.

    ideally, if we end up copying files because of a move across │ │ │ │ +volumes, the source should not be deleted until they've all been │ │ │ │ +copied. That would let us rollback with higher confidence.

    ../src/storage_utils.cpp:230

    		// later
    │ │ │ │ +		aux::vector<bool, file_index_t> copied_files(std::size_t(f.num_files()), false);
    │ │ │ │  
    │ │ │ │ -	void torrent_handle::file_priority(file_index_t index, download_priority_t priority) const
    │ │ │ │ -	{
    │ │ │ │ -		async_call(&torrent::set_file_priority, index, priority);
    │ │ │ │ -	}
    │ │ │ │ +		// track how far we got in case of an error
    │ │ │ │ +		file_index_t file_index{};
    │ │ │ │ +		for (auto const i : f.file_range())
    │ │ │ │ +		{
    │ │ │ │ +			// files moved out to absolute paths are not moved
    │ │ │ │ +			if (f.file_absolute_path(i)) continue;
    │ │ │ │  
    │ │ │ │ -	download_priority_t torrent_handle::file_priority(file_index_t index) const
    │ │ │ │ -	{
    │ │ │ │ -		return sync_call_ret<download_priority_t>(dont_download, &torrent::file_priority, index);
    │ │ │ │ -	}
    │ │ │ │ +			std::string const old_path = combine_path(save_path, f.file_path(i));
    │ │ │ │ +			std::string const new_path = combine_path(new_save_path, f.file_path(i));
    │ │ │ │  
    │ │ │ │ -
    void torrent_handle::prioritize_files(std::vector<download_priority_t> const& files) const │ │ │ │ -
    { │ │ │ │ - async_call(&torrent::prioritize_files │ │ │ │ - , static_cast<aux::vector<download_priority_t, file_index_t> const&>(files)); │ │ │ │ - } │ │ │ │ + error_code ignore; │ │ │ │ + if (flags == move_flags_t::dont_replace && exists(new_path, ignore)) │ │ │ │ + { │ │ │ │ + if (ret == status_t::no_error) ret = status_t::need_full_check; │ │ │ │ + continue; │ │ │ │ + } │ │ │ │ │ │ │ │ - std::vector<download_priority_t> torrent_handle::get_file_priorities() const │ │ │ │ - { │ │ │ │ - aux::vector<download_priority_t, file_index_t> ret; │ │ │ │ - auto retp = &ret; │ │ │ │ - sync_call(&torrent::file_priorities, retp); │ │ │ │ - return TORRENT_RVO(ret); │ │ │ │ - } │ │ │ │ +
    move_file(old_path, new_path, ec); │ │ │ │ +
    │ │ │ │ + // if the source file doesn't exist. That's not a problem │ │ │ │ + // we just ignore that file │ │ │ │ + if (ec.ec == boost::system::errc::no_such_file_or_directory) │ │ │ │ + ec.ec.clear(); │ │ │ │ + else if (ec │ │ │ │ + && ec.ec != boost::system::errc::invalid_argument │ │ │ │ + && ec.ec != boost::system::errc::permission_denied) │ │ │ │ + { │ │ │ │ + // moving the file failed │ │ │ │ + // on OSX, the error when trying to rename a file across different │ │ │ │ + // volumes is EXDEV, which will make it fall back to copying. │ │ │ │ + ec.ec.clear(); │ │ │ │ + copy_file(old_path, new_path, ec); │ │ │ │ + if (!ec) copied_files[i] = true; │ │ │ │ + } │ │ │ │ │ │ │ │ -#if TORRENT_ABI_VERSION == 1 │ │ │ │ + if (ec) │ │ │ │ + { │ │ │ │ + ec.file(i); │ │ │ │ + file_index = i; │ │ │ │ + break; │ │ │ │ + } │ │ │ │ + } │ │ │ │ │ │ │ │ -// ============ start deprecation =============== │ │ │ │ + if (!ec && move_partfile) │ │ │ │ + { │ │ │ │ + error_code e; │ │ │ │ + move_partfile(new_save_path, e); │ │ │ │ + if (e) │ │ │ │ +
    relevance 0../src/storage_utils.cpp:538it would seem reasonable to, instead, set the have_pieces bits for the pieces representing these files, and resume with the normal logic

    it would seem reasonable to, instead, set the have_pieces bits │ │ │ │ +for the pieces representing these files, and resume with the normal │ │ │ │ +logic

    ../src/storage_utils.cpp:538

    					continue;
    │ │ │ │  
    │ │ │ │ -	void torrent_handle::prioritize_files(std::vector<int> const& files) const
    │ │ │ │ -	{
    │ │ │ │ -		aux::vector<download_priority_t, file_index_t> file_prio;
    │ │ │ │ -		file_prio.reserve(files.size());
    │ │ │ │ -		for (auto const p : files) {
    │ │ │ │ -			file_prio.push_back(download_priority_t(static_cast<std::uint8_t>(p)));
    │ │ │ │ -		}
    │ │ │ │ -		async_call(&torrent::prioritize_files, file_prio);
    │ │ │ │ -	}
    │ │ │ │ +				std::int64_t const size = get_filesize(stat, file_index, fs
    │ │ │ │ +					, save_path, ec);
    │ │ │ │ +				if (size < 0) return false;
    │ │ │ │  
    │ │ │ │ -	std::vector<int> torrent_handle::file_priorities() const
    │ │ │ │ -	{
    │ │ │ │ -		aux::vector<download_priority_t, file_index_t> prio;
    │ │ │ │ -
    relevance 0../src/settings_pack.cpp:305deprecate this

    deprecate this

    ../src/settings_pack.cpp:305

    		SET(outgoing_port, 0, nullptr),
    │ │ │ │ -		SET(num_outgoing_ports, 0, nullptr),
    │ │ │ │ -		SET(peer_dscp, 0x04, &session_impl::update_peer_dscp),
    │ │ │ │ -		SET(active_downloads, 3, &session_impl::trigger_auto_manage),
    │ │ │ │ -		SET(active_seeds, 5, &session_impl::trigger_auto_manage),
    │ │ │ │ -		SET(active_checking, 1, &session_impl::trigger_auto_manage),
    │ │ │ │ -		SET(active_dht_limit, 88, nullptr),
    │ │ │ │ -		SET(active_tracker_limit, 1600, nullptr),
    │ │ │ │ -		SET(active_lsd_limit, 60, nullptr),
    │ │ │ │ -		SET(active_limit, 500, &session_impl::trigger_auto_manage),
    │ │ │ │ -		DEPRECATED_SET(active_loaded_limit, 0, &session_impl::trigger_auto_manage),
    │ │ │ │ -		SET(auto_manage_interval, 30, nullptr),
    │ │ │ │ -		SET(seed_time_limit, 24 * 60 * 60, nullptr),
    │ │ │ │ -		SET(auto_scrape_interval, 1800, nullptr),
    │ │ │ │ -		SET(auto_scrape_min_interval, 300, nullptr),
    │ │ │ │ -		SET(max_peerlist_size, 3000, nullptr),
    │ │ │ │ -		SET(max_paused_peerlist_size, 1000, nullptr),
    │ │ │ │ -		SET(min_announce_interval, 5 * 60, nullptr),
    │ │ │ │ -		SET(auto_manage_startup, 60, nullptr),
    │ │ │ │ -		SET(seeding_piece_quota, 20, nullptr),
    │ │ │ │ -
    SET(max_rejects, 50, nullptr), │ │ │ │ -
    SET(recv_socket_buffer_size, 0, &session_impl::update_socket_buffer_size), │ │ │ │ - SET(send_socket_buffer_size, 0, &session_impl::update_socket_buffer_size), │ │ │ │ - SET(max_peer_recv_buffer_size, 2 * 1024 * 1024, nullptr), │ │ │ │ - DEPRECATED_SET(file_checks_delay_per_block, 0, nullptr), │ │ │ │ - DEPRECATED2_SET(read_cache_line_size, 32, nullptr), │ │ │ │ - DEPRECATED2_SET(write_cache_line_size, 16, nullptr), │ │ │ │ - SET(optimistic_disk_retry, 10 * 60, nullptr), │ │ │ │ - SET(max_suggest_pieces, 16, nullptr), │ │ │ │ - SET(local_service_announce_interval, 5 * 60, nullptr), │ │ │ │ - SET(dht_announce_interval, 15 * 60, &session_impl::update_dht_announce_interval), │ │ │ │ - SET(udp_tracker_token_expiry, 60, nullptr), │ │ │ │ - DEPRECATED_SET(default_cache_min_age, 1, nullptr), │ │ │ │ - SET(num_optimistic_unchoke_slots, 0, nullptr), │ │ │ │ - DEPRECATED_SET(default_est_reciprocation_rate, 16000, nullptr), │ │ │ │ - DEPRECATED_SET(increase_est_reciprocation_rate, 20, nullptr), │ │ │ │ - DEPRECATED_SET(decrease_est_reciprocation_rate, 3, nullptr), │ │ │ │ - SET(max_pex_peers, 50, nullptr), │ │ │ │ - SET(tick_interval, 500, nullptr), │ │ │ │ - SET(share_mode_target, 3, nullptr), │ │ │ │ - SET(upload_rate_limit, 0, &session_impl::update_upload_rate), │ │ │ │ - SET(download_rate_limit, 0, &session_impl::update_download_rate), │ │ │ │ - DEPRECATED_SET(local_upload_rate_limit, 0, &session_impl::update_local_upload_rate), │ │ │ │ - DEPRECATED_SET(local_download_rate_limit, 0, &session_impl::update_local_download_rate), │ │ │ │ - SET(dht_upload_rate_limit, 8000, &session_impl::update_dht_upload_rate_limit), │ │ │ │ - SET(unchoke_slots_limit, 8, &session_impl::update_unchoke_limit), │ │ │ │ - DEPRECATED_SET(half_open_limit, 0, nullptr), │ │ │ │ - SET(connections_limit, 200, &session_impl::update_connections_limit), │ │ │ │ - SET(connections_slack, 10, nullptr), │ │ │ │ - SET(utp_target_delay, 100, nullptr), │ │ │ │ - SET(utp_gain_factor, 3000, nullptr), │ │ │ │ -
    relevance 0../src/settings_pack.cpp:590it would be nice to reserve() these vectors up front

    it would be nice to reserve() these vectors up front

    ../src/settings_pack.cpp:590

    			s.set_str(settings_pack::string_type_base | i, str_settings[i].default_value);
    │ │ │ │ -			TORRENT_ASSERT(s.get_str(settings_pack::string_type_base + i) == str_settings[i].default_value);
    │ │ │ │ +				if (size < fs.file_size(file_index))
    │ │ │ │ +				{
    │ │ │ │ +					ec.ec = errors::mismatching_file_size;
    │ │ │ │ +					ec.file(file_index);
    │ │ │ │ +					ec.operation = operation_t::check_resume;
    │ │ │ │ +					return false;
    │ │ │ │ +				}
    │ │ │ │ +			}
    │ │ │ │ +			return true;
    │ │ │ │  		}
    │ │ │ │  
    │ │ │ │ -		for (int i = 0; i < settings_pack::num_int_settings; ++i)
    │ │ │ │ -		{
    │ │ │ │ -			s.set_int(settings_pack::int_type_base | i, int_settings[i].default_value);
    │ │ │ │ -			TORRENT_ASSERT(s.get_int(settings_pack::int_type_base + i) == int_settings[i].default_value);
    │ │ │ │ -		}
    │ │ │ │ +#ifndef TORRENT_DISABLE_MUTABLE_TORRENTS
    │ │ │ │ +		// always trigger a full recheck when we pull in files from other
    │ │ │ │ +		// torrents, via hard links
    │ │ │ │ +
    if (added_files) return false; │ │ │ │ +
    #endif │ │ │ │ │ │ │ │ - for (int i = 0; i < settings_pack::num_bool_settings; ++i) │ │ │ │ + // parse have bitmask. Verify that the files we expect to have │ │ │ │ + // actually do exist │ │ │ │ + piece_index_t const end_piece = std::min(rd.have_pieces.end_index(), fs.end_piece()); │ │ │ │ + for (piece_index_t i(0); i < end_piece; ++i) │ │ │ │ { │ │ │ │ - s.set_bool(settings_pack::bool_type_base | i, bool_settings[i].default_value); │ │ │ │ - TORRENT_ASSERT(s.get_bool(settings_pack::bool_type_base + i) == bool_settings[i].default_value); │ │ │ │ - } │ │ │ │ - } │ │ │ │ + if (rd.have_pieces.get_bit(i) == false) continue; │ │ │ │ │ │ │ │ - settings_pack default_settings() │ │ │ │ - { │ │ │ │ - settings_pack ret; │ │ │ │ -
    for (int i = 0; i < settings_pack::num_string_settings; ++i) │ │ │ │ -
    { │ │ │ │ - if (str_settings[i].default_value == nullptr) continue; │ │ │ │ - ret.set_str(settings_pack::string_type_base + i, str_settings[i].default_value); │ │ │ │ - } │ │ │ │ + std::vector<file_slice> f = fs.map_block(i, 0, 1); │ │ │ │ + TORRENT_ASSERT(!f.empty()); │ │ │ │ │ │ │ │ - for (int i = 0; i < settings_pack::num_int_settings; ++i) │ │ │ │ - { │ │ │ │ - ret.set_int(settings_pack::int_type_base + i, int_settings[i].default_value); │ │ │ │ - } │ │ │ │ + file_index_t const file_index = f[0].file_index; │ │ │ │ │ │ │ │ - for (int i = 0; i < settings_pack::num_bool_settings; ++i) │ │ │ │ - { │ │ │ │ - ret.set_bool(settings_pack::bool_type_base + i, bool_settings[i].default_value); │ │ │ │ - } │ │ │ │ - return ret; │ │ │ │ + // files with priority zero may not have been saved to disk at their │ │ │ │ + // expected location, but is likely to be in a partfile. Just exempt it │ │ │ │ + // from checking │ │ │ │ + if (file_index < file_priority.end_index() │ │ │ │ + && file_priority[file_index] == dont_download) │ │ │ │ + continue; │ │ │ │ + │ │ │ │ + if (fs.pad_file_at(file_index)) continue; │ │ │ │ + │ │ │ │ + if (get_filesize(stat, file_index, fs, save_path, ec) < 0) │ │ │ │ + return false; │ │ │ │ + │ │ │ │ + // OK, this file existed, good. Now, skip all remaining pieces in │ │ │ │ + // this file. We're just sanity-checking whether the files exist │ │ │ │ + // or not. │ │ │ │ + peer_request const pr = fs.map_file(file_index │ │ │ │ +
    relevance 0../src/performance_counters.cpp:40move stats_counter_t out of counters

    move stats_counter_t out of counters

    ../src/performance_counters.cpp:40

    relevance 0../src/performance_counters.cpp:41should bittorrent keep-alive messages have a counter too?

    should bittorrent keep-alive messages have a counter too?

    ../src/performance_counters.cpp:41

    relevance 0../src/performance_counters.cpp:42It would be nice if this could be an internal type. default_disk_constructor depends on it now

    It would be nice if this could be an internal type. default_disk_constructor depends on it now

    ../src/performance_counters.cpp:42

    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
    │ │ │ │ +AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    │ │ │ │ +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
    │ │ │ │ +ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
    │ │ │ │ +LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
    │ │ │ │ +CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
    │ │ │ │ +SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
    │ │ │ │ +INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
    │ │ │ │ +CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    │ │ │ │ +ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    │ │ │ │ +POSSIBILITY OF SUCH DAMAGE.
    │ │ │ │ +
    │ │ │ │ +*/
    │ │ │ │ +
    │ │ │ │ +#include "libtorrent/performance_counters.hpp"
    │ │ │ │ +#include "libtorrent/assert.hpp"
    │ │ │ │ +#include <cstring> // for memset
    │ │ │ │ +
    │ │ │ │ +namespace libtorrent {
    │ │ │ │ +
    │ │ │ │ +
    counters::counters() TORRENT_COUNTER_NOEXCEPT │ │ │ │ +
    { │ │ │ │ +#ifdef ATOMIC_LLONG_LOCK_FREE │ │ │ │ + for (auto& counter : m_stats_counter) │ │ │ │ + counter.store(0, std::memory_order_relaxed); │ │ │ │ +#else │ │ │ │ + m_stats_counter.fill(0); │ │ │ │ +#endif │ │ │ │ } │ │ │ │ │ │ │ │ - void apply_pack(settings_pack const* pack, aux::session_settings& sett │ │ │ │ - , aux::session_impl* ses) │ │ │ │ + counters::counters(counters const& c) TORRENT_COUNTER_NOEXCEPT │ │ │ │ { │ │ │ │ - using fun_t = void (aux::session_impl::*)(); │ │ │ │ - std::vector<fun_t> callbacks; │ │ │ │ +#ifdef ATOMIC_LLONG_LOCK_FREE │ │ │ │ + for (int i = 0; i < m_stats_counter.end_index(); ++i) │ │ │ │ + m_stats_counter[i].store( │ │ │ │ + c.m_stats_counter[i].load(std::memory_order_relaxed) │ │ │ │ + , std::memory_order_relaxed); │ │ │ │ +#else │ │ │ │ + std::lock_guard<std::mutex> l(c.m_mutex); │ │ │ │ + m_stats_counter = c.m_stats_counter; │ │ │ │ +#endif │ │ │ │ + } │ │ │ │ │ │ │ │ - sett.bulk_set([&](aux::session_settings_single_thread& s) │ │ │ │ - { │ │ │ │ - apply_pack_impl(pack, s, ses ? &callbacks : nullptr); │ │ │ │ - }); │ │ │ │ + counters& counters::operator=(counters const& c) & TORRENT_COUNTER_NOEXCEPT │ │ │ │ + { │ │ │ │ + if (&c == this) return *this; │ │ │ │ +#ifdef ATOMIC_LLONG_LOCK_FREE │ │ │ │ + for (int i = 0; i < m_stats_counter.end_index(); ++i) │ │ │ │ + m_stats_counter[i].store( │ │ │ │ + c.m_stats_counter[i].load(std::memory_order_relaxed) │ │ │ │ + , std::memory_order_relaxed); │ │ │ │ +
    relevance 0../src/packet_buffer.cpp:157use compare_less_wrap for this comparison as well

    use compare_less_wrap for this comparison as well

    ../src/packet_buffer.cpp:157

    	{
    │ │ │ │ +		INVARIANT_CHECK;
    │ │ │ │ +		TORRENT_ASSERT_VAL(size <= 0xffff, size);
    │ │ │ │ +		std::uint32_t new_size = m_capacity == 0 ? 16 : m_capacity;
    │ │ │ │  
    │ │ │ │ -		// call the callbacks once all the settings have been applied, and
    │ │ │ │ -		// only once per callback
    │ │ │ │ -
    relevance 0../src/udp_tracker_connection.cpp:633why is this a linked list?

    why is this a linked list?

    ../src/udp_tracker_connection.cpp:633

    				ipv6_peer_entry e{};
    │ │ │ │ -				std::memcpy(e.ip.data(), buf.data(), 16);
    │ │ │ │ -				buf = buf.subspan(16);
    │ │ │ │ -				e.port = aux::read_uint16(buf);
    │ │ │ │ -				resp.peers6.push_back(e);
    │ │ │ │ -			}
    │ │ │ │ -		}
    │ │ │ │ -		else
    │ │ │ │ -		{
    │ │ │ │ -			resp.peers4.reserve(static_cast<std::size_t>(num_peers));
    │ │ │ │ -			for (int i = 0; i < num_peers; ++i)
    │ │ │ │ -			{
    │ │ │ │ -				ipv4_peer_entry e{};
    │ │ │ │ -				std::memcpy(e.ip.data(), buf.data(), 4);
    │ │ │ │ -				buf = buf.subspan(4);
    │ │ │ │ -				e.port = aux::read_uint16(buf);
    │ │ │ │ -				resp.peers4.push_back(e);
    │ │ │ │ -			}
    │ │ │ │ -		}
    │ │ │ │ +		while (new_size < size)
    │ │ │ │ +			new_size <<= 1;
    │ │ │ │  
    │ │ │ │ -
    std::list<address> ip_list; │ │ │ │ -
    std::transform(m_endpoints.begin(), m_endpoints.end(), std::back_inserter(ip_list) │ │ │ │ - , [](tcp::endpoint const& ep) { return ep.address(); } ); │ │ │ │ + aux::unique_ptr<packet_ptr[], index_type> new_storage(new packet_ptr[new_size]); │ │ │ │ │ │ │ │ - cb->tracker_response(tracker_req(), m_target.address(), ip_list, resp); │ │ │ │ + for (index_type i = m_first; i < (m_first + m_capacity); ++i) │ │ │ │ + new_storage[i & (new_size - 1)] = std::move(m_storage[i & (m_capacity - 1)]); │ │ │ │ │ │ │ │ - close(); │ │ │ │ - return true; │ │ │ │ + m_storage = std::move(new_storage); │ │ │ │ + m_capacity = new_size; │ │ │ │ } │ │ │ │ │ │ │ │ - bool udp_tracker_connection::on_scrape_response(span<char const> buf) │ │ │ │ + packet_ptr packet_buffer::remove(index_type idx) │ │ │ │ { │ │ │ │ - restart_read_timeout(); │ │ │ │ - auto const action = static_cast<action_t>(aux::read_int32(buf)); │ │ │ │ - std::uint32_t const transaction = aux::read_uint32(buf); │ │ │ │ + INVARIANT_CHECK; │ │ │ │ +
    if (idx >= m_first + m_capacity) │ │ │ │ +
    return packet_ptr(); │ │ │ │ │ │ │ │ - if (transaction != m_transaction_id) │ │ │ │ + if (compare_less_wrap(idx, m_first, 0xffff)) │ │ │ │ + return packet_ptr(); │ │ │ │ + │ │ │ │ + std::size_t const mask = m_capacity - 1; │ │ │ │ + packet_ptr old_value = std::move(m_storage[idx & mask]); │ │ │ │ + m_storage[idx & mask].reset(); │ │ │ │ + │ │ │ │ + if (old_value) │ │ │ │ { │ │ │ │ - fail(error_code(errors::invalid_tracker_transaction_id), operation_t::bittorrent); │ │ │ │ - return false; │ │ │ │ + --m_size; │ │ │ │ + if (m_size == 0) m_last = m_first; │ │ │ │ } │ │ │ │ │ │ │ │ - if (action == action_t::error) │ │ │ │ + if (idx == m_first && m_size != 0) │ │ │ │ { │ │ │ │ - fail(error_code(errors::tracker_failure), operation_t::bittorrent │ │ │ │ - , std::string(buf.data(), static_cast<std::size_t>(buf.size())).c_str()); │ │ │ │ - return true; │ │ │ │ + ++m_first; │ │ │ │ + for (index_type i = 0; i < m_capacity; ++i, ++m_first) │ │ │ │ + if (m_storage[m_first & mask]) break; │ │ │ │ + m_first &= 0xffff; │ │ │ │ } │ │ │ │ │ │ │ │ - if (action != action_t::scrape) │ │ │ │ + if (((idx + 1) & 0xffff) == m_last && m_size != 0) │ │ │ │ { │ │ │ │ -
    relevance 0../src/magnet_uri.cpp:439what's the right number here?

    what's the right number here?

    ../src/magnet_uri.cpp:439

    			}
    │ │ │ │ -			else if (string_equal_no_case(name, "so"_sv)) // select-only (files)
    │ │ │ │ -			{
    │ │ │ │ -				// accept only digits, '-' and ','
    │ │ │ │ -				if (std::any_of(value.begin(), value.end(), [](char c)
    │ │ │ │ -					{ return !is_digit(c) && c != '-' && c != ','; }))
    │ │ │ │ -					continue;
    │ │ │ │ -
    │ │ │ │ -				// make sure all file priorities are set to 0, except the ones
    │ │ │ │ -				// we specify in the file_priorities
    │ │ │ │ -				p.flags |= torrent_flags::default_dont_download;
    │ │ │ │ +			--m_last;
    │ │ │ │ +			for (index_type i = 0; i < m_capacity; ++i, --m_last)
    │ │ │ │ +				if (m_storage[m_last & mask]) break;
    │ │ │ │ +			++m_last;
    │ │ │ │ +			m_last &= 0xffff;
    │ │ │ │ +
    relevance 0../src/merkle_tree.cpp:110in C++20, use std::identity

    in C++20, use std::identity

    ../src/merkle_tree.cpp:110

    		allocate_full();
    │ │ │ │  
    │ │ │ │ -				do
    │ │ │ │ -				{
    │ │ │ │ -					string_view token;
    │ │ │ │ -					std::tie(token, value) = split_string(value, ',');
    │ │ │ │ +		merkle_validate_copy(t, m_tree, root(), m_block_verified);
    │ │ │ │  
    │ │ │ │ -					if (token.empty()) continue;
    │ │ │ │ +		load_verified_bits(verified);
    │ │ │ │  
    │ │ │ │ -					int idx1, idx2;
    │ │ │ │ -
    constexpr int max_index = 10000; // can't risk out of memory │ │ │ │ -
    │ │ │ │ - auto const divider = token.find_first_of('-'); │ │ │ │ - if (divider != std::string::npos) // it's a range │ │ │ │ - { │ │ │ │ - if (divider == 0) // no start index │ │ │ │ - continue; │ │ │ │ - if (divider == token.size() - 1) // no end index │ │ │ │ - continue; │ │ │ │ + optimize_storage(); │ │ │ │ + optimize_storage_piece_layer(); │ │ │ │ + } │ │ │ │ │ │ │ │ - idx1 = std::atoi(token.substr(0, divider).to_string().c_str()); │ │ │ │ - if (idx1 < 0 || idx1 > max_index) // invalid index │ │ │ │ - continue; │ │ │ │ - idx2 = std::atoi(token.substr(divider + 1).to_string().c_str()); │ │ │ │ - if (idx2 < 0 || idx2 > max_index) // invalid index │ │ │ │ - continue; │ │ │ │ + void merkle_tree::clear() │ │ │ │ + { │ │ │ │ + m_tree.clear(); │ │ │ │ + m_tree.shrink_to_fit(); │ │ │ │ + m_block_verified.clear(); │ │ │ │ + m_mode = mode_t::empty_tree; │ │ │ │ + } │ │ │ │ │ │ │ │ - if (idx1 > idx2) // wrong range limits │ │ │ │ - continue; │ │ │ │ - } │ │ │ │ - else // it's an index │ │ │ │ - { │ │ │ │ - idx1 = std::atoi(token.to_string().c_str()); │ │ │ │ - if (idx1 < 0 || idx1 > max_index) // invalid index │ │ │ │ - continue; │ │ │ │ - idx2 = idx1; │ │ │ │ - } │ │ │ │ +namespace { │ │ │ │ │ │ │ │ - if (int(p.file_priorities.size()) <= idx2) │ │ │ │ - p.file_priorities.resize(static_cast<std::size_t>(idx2) + 1, dont_download); │ │ │ │ +
    struct identity │ │ │ │ +
    { │ │ │ │ + bool operator()(bool b) const { return b; } │ │ │ │ + }; │ │ │ │ +} │ │ │ │ │ │ │ │ -
    relevance 0../src/hash_picker.cpp:309use structured bindings in C++17

    use structured bindings in C++17

    ../src/hash_picker.cpp:309

    		, int const offset, sha256_hash const& h)
    │ │ │ │ +	void merkle_tree::load_sparse_tree(span<sha256_hash const> t
    │ │ │ │ +		, std::vector<bool> const& mask
    │ │ │ │ +		, std::vector<bool> const& verified)
    │ │ │ │  	{
    │ │ │ │ -		TORRENT_ASSERT(offset >= 0);
    │ │ │ │ -		auto const f = m_files.file_index_at_piece(piece);
    │ │ │ │ +		INVARIANT_CHECK;
    │ │ │ │ +		TORRENT_ASSERT(mask.size() == size());
    │ │ │ │ +		if (size() != mask.size()) return;
    │ │ │ │  
    │ │ │ │ -		if (m_files.pad_file_at(f))
    │ │ │ │ -			return { set_block_hash_result::result::success, 0, 0 };
    │ │ │ │ +		int const first_block = block_layer_start();
    │ │ │ │ +		int const end_block = first_block + m_num_blocks;
    │ │ │ │  
    │ │ │ │ -		auto& merkle_tree = m_merkle_trees[f];
    │ │ │ │ -		piece_index_t const file_first_piece = m_files.piece_index_at_file(f);
    │ │ │ │ -		std::int64_t const block_offset = static_cast<int>(piece) * std::int64_t(m_files.piece_length())
    │ │ │ │ -			+ offset - m_files.file_offset(f);
    │ │ │ │ -		int const block_index = aux::numeric_cast<int>(block_offset / default_block_size);
    │ │ │ │ +		TORRENT_ASSERT(first_block < int(mask.size()));
    │ │ │ │ +		TORRENT_ASSERT(end_block <= int(mask.size()));
    │ │ │ │  
    │ │ │ │ -		if (h.is_all_zeros())
    │ │ │ │ +		// if the mask covers all blocks, go straight to block_layer
    │ │ │ │ +		// mode, and validate
    │ │ │ │ +		if (std::all_of(mask.begin() + first_block, mask.begin() + end_block, identity()))
    │ │ │ │  		{
    │ │ │ │ -			TORRENT_ASSERT_FAIL();
    │ │ │ │ -			return set_block_hash_result::block_hash_failed();
    │ │ │ │ -		}
    │ │ │ │ +			// the index in t that points to first_block
    │ │ │ │ +			auto const block_index = std::count_if(mask.begin(), mask.begin() + first_block, identity());
    │ │ │ │  
    │ │ │ │ -
    aux::merkle_tree::set_block_result result; │ │ │ │ -
    int leafs_index; │ │ │ │ - int leafs_size; │ │ │ │ - std::tie(result, leafs_index, leafs_size) = merkle_tree.set_block(block_index, h); │ │ │ │ + // discrepancy │ │ │ │ + if (t.size() < block_index + m_num_blocks) │ │ │ │ + return clear(); │ │ │ │ │ │ │ │ - if (result == aux::merkle_tree::set_block_result::unknown) │ │ │ │ - return set_block_hash_result::unknown(); │ │ │ │ - if (result == aux::merkle_tree::set_block_result::block_hash_failed) │ │ │ │ - return set_block_hash_result::block_hash_failed(); │ │ │ │ +
    relevance 0../src/merkle_tree.cpp:319this can be optimized by using m_tree as storage to fill this tree into, and then clear it if the hashes fail

    this can be optimized by using m_tree as storage to fill this │ │ │ │ +tree into, and then clear it if the hashes fail

    ../src/merkle_tree.cpp:319

    	{
    │ │ │ │ +		INVARIANT_CHECK;
    │ │ │ │  
    │ │ │ │ -		auto const status = (result == aux::merkle_tree::set_block_result::hash_failed)
    │ │ │ │ -			? set_block_hash_result::result::piece_hash_failed
    │ │ │ │ -			: set_block_hash_result::result::success;
    │ │ │ │ +		// as we set the hashes of interior nodes, we may be able to validate
    │ │ │ │ +		// block hashes that we had since earlier. Any blocks that can be
    │ │ │ │ +		// validated, and failed, are added to this list
    │ │ │ │ +		add_hashes_result_t ret;
    │ │ │ │  
    │ │ │ │ -		int const blocks_per_piece = m_files.piece_length() / default_block_size;
    │ │ │ │ +		// we already have all hashes
    │ │ │ │ +		if (m_mode == mode_t::block_layer)
    │ │ │ │ +		{
    │ │ │ │ +			// since we're already on the block layer mode, we have the whole
    │ │ │ │ +			// tree, and we've already reported any pieces as passing that may
    │ │ │ │ +			// have existed in the tree when we completed it. At this point no
    │ │ │ │ +			// more pieces should be reported as passed
    │ │ │ │ +			return ret;
    │ │ │ │ +		}
    │ │ │ │  
    │ │ │ │ -		return { status
    │ │ │ │ -			, int(leafs_index - static_cast<int>(piece - file_first_piece) * blocks_per_piece)
    │ │ │ │ -			, std::min(leafs_size, m_files.file_num_pieces(f) * blocks_per_piece - leafs_index) };
    │ │ │ │ -	}
    │ │ │ │ +		allocate_full();
    │ │ │ │  
    │ │ │ │ -	void hash_picker::hashes_rejected(hash_request const& req)
    │ │ │ │ -	{
    │ │ │ │ -		TORRENT_ASSERT(req.base == m_piece_layer && req.index % 512 == 0);
    │ │ │ │ +
    int const leaf_count = merkle_num_leafs(int(hashes.size())); │ │ │ │ +
    aux::vector<sha256_hash> tree(merkle_num_nodes(leaf_count)); │ │ │ │ + std::copy(hashes.begin(), hashes.end(), tree.end() - leaf_count); │ │ │ │ │ │ │ │ - for (int i = req.index; i < req.index + req.count; i += 512) │ │ │ │ + // the end of a file is a special case, we may need to pad the leaf layer │ │ │ │ + if (leaf_count > hashes.size()) │ │ │ │ { │ │ │ │ - m_piece_hash_requested[req.file][i / 512].last_request = min_time(); │ │ │ │ - --m_piece_hash_requested[req.file][i / 512].num_requests; │ │ │ │ + int const leaf_layer_size = num_leafs(); │ │ │ │ + // assuming uncle_hashes lead all the way to the root, they tell us │ │ │ │ + // how many layers down we are │ │ │ │ + int const insert_layer_size = leaf_count << uncle_hashes.size(); │ │ │ │ + if (leaf_layer_size != insert_layer_size) │ │ │ │ + { │ │ │ │ + sha256_hash const pad_hash = merkle_pad(leaf_layer_size, insert_layer_size); │ │ │ │ + for (int i = int(hashes.size()); i < leaf_count; ++i) │ │ │ │ + tree[tree.end_index() - leaf_count + i] = pad_hash; │ │ │ │ + } │ │ │ │ } │ │ │ │ │ │ │ │ -
    relevance 0../src/torrent_peer.cpp:192how do we deal with our external address changing?

    how do we deal with our external address changing?

    ../src/torrent_peer.cpp:192

    		// connections. If it fails, we'll
    │ │ │ │ -		// retry with encryption
    │ │ │ │ -		, pe_support(false)
    │ │ │ │ -#endif
    │ │ │ │ -		, is_v6_addr(false)
    │ │ │ │ -#if TORRENT_USE_I2P
    │ │ │ │ -		, is_i2p_addr(false)
    │ │ │ │ -#endif
    │ │ │ │ -		, on_parole(false)
    │ │ │ │ -		, banned(false)
    │ │ │ │ -		, supports_utp(true) // assume peers support utp
    │ │ │ │ -		, confirmed_supports_utp(false)
    │ │ │ │ -		, supports_holepunch(false)
    │ │ │ │ -		, web_seed(false)
    │ │ │ │ -		, protocol_v2(false)
    │ │ │ │ -	{}
    │ │ │ │ +		merkle_fill_tree(tree, leaf_count);
    │ │ │ │  
    │ │ │ │ -	std::uint32_t torrent_peer::rank(external_ip const& external, int external_port) const
    │ │ │ │ -	{
    │ │ │ │ -		TORRENT_ASSERT(in_use);
    │ │ │ │ -
    if (peer_rank == 0) │ │ │ │ -
    peer_rank = peer_priority( │ │ │ │ - tcp::endpoint(external.external_address(this->address()), std::uint16_t(external_port)) │ │ │ │ - , tcp::endpoint(this->address(), this->port)); │ │ │ │ - return peer_rank; │ │ │ │ - } │ │ │ │ + int const base_num_layers = merkle_num_layers(leaf_count); │ │ │ │ │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - std::string torrent_peer::to_string() const │ │ │ │ - { │ │ │ │ - TORRENT_ASSERT(in_use); │ │ │ │ -#if TORRENT_USE_I2P │ │ │ │ - if (is_i2p_addr) return dest().to_string(); │ │ │ │ -#endif // TORRENT_USE_I2P │ │ │ │ - return address().to_string(); │ │ │ │ - } │ │ │ │ -#endif │ │ │ │ + // this is the index of the node where we'll insert the root of the │ │ │ │ + // subtree (tree). It's also the hash the uncle_hashes are here to prove │ │ │ │ + // is valid. │ │ │ │ + int const insert_root_idx = dest_start_idx >> base_num_layers; │ │ │ │ │ │ │ │ - std::int64_t torrent_peer::total_download() const │ │ │ │ - { │ │ │ │ - TORRENT_ASSERT(in_use); │ │ │ │ - if (connection != nullptr) │ │ │ │ - { │ │ │ │ - TORRENT_ASSERT(prev_amount_download == 0); │ │ │ │ - return connection->statistics().total_payload_download(); │ │ │ │ - } │ │ │ │ - else │ │ │ │ - { │ │ │ │ - return std::int64_t(prev_amount_download) << 10; │ │ │ │ - } │ │ │ │ - } │ │ │ │ -
    relevance 0../src/disabled_disk_io.cpp:106it would be nice to return a valid hash of zeroes here

    it would be nice to return a valid hash of zeroes here

    ../src/disabled_disk_io.cpp:106

    		});
    │ │ │ │ -	}
    │ │ │ │ +		// start with validating the proofs, and inserting them as we go.
    │ │ │ │ +		if (!merkle_validate_and_insert_proofs(m_tree, insert_root_idx, tree[0], uncle_hashes))
    │ │ │ │ +			return {};
    │ │ │ │ +
    relevance 0../src/merkle_tree.cpp:367a piece outside of this range may also fail, if one of the uncle hashes is at the layer right above the block hashes

    a piece outside of this range may also fail, if one of the uncle │ │ │ │ +hashes is at the layer right above the block hashes

    ../src/merkle_tree.cpp:367

    		int const insert_root_idx = dest_start_idx >> base_num_layers;
    │ │ │ │  
    │ │ │ │ -	bool async_write(storage_index_t
    │ │ │ │ -		, peer_request const& r
    │ │ │ │ -		, char const*, std::shared_ptr<disk_observer>
    │ │ │ │ -		, std::function<void(storage_error const&)> handler
    │ │ │ │ -		, disk_job_flags_t) override
    │ │ │ │ -	{
    │ │ │ │ -		TORRENT_ASSERT(r.length <= default_block_size);
    │ │ │ │ -		TORRENT_UNUSED(r);
    │ │ │ │ +		// start with validating the proofs, and inserting them as we go.
    │ │ │ │ +		if (!merkle_validate_and_insert_proofs(m_tree, insert_root_idx, tree[0], uncle_hashes))
    │ │ │ │ +			return {};
    │ │ │ │  
    │ │ │ │ -		post(m_ios, [h = std::move(handler)] { h(storage_error{}); });
    │ │ │ │ -		return false;
    │ │ │ │ -	}
    │ │ │ │ +		// first fill in the subtree of known hashes from the base layer
    │ │ │ │ +		auto const num_leafs = merkle_num_leafs(m_num_blocks);
    │ │ │ │ +		auto const first_leaf = merkle_first_leaf(num_leafs);
    │ │ │ │  
    │ │ │ │ -	void async_hash(storage_index_t
    │ │ │ │ -		, piece_index_t piece, span<sha256_hash>, disk_job_flags_t
    │ │ │ │ -		, std::function<void(piece_index_t, sha1_hash const&, storage_error const&)> handler) override
    │ │ │ │ -	{
    │ │ │ │ -
    post(m_ios, [h = std::move(handler), piece] { h(piece, sha1_hash{}, storage_error{}); }); │ │ │ │ -
    } │ │ │ │ + // this is the start of the leaf layer of "tree". We'll use this │ │ │ │ + // variable to step upwards towards the root │ │ │ │ + int source_cursor = int(tree.size()) - leaf_count; │ │ │ │ + // the running index in the loop │ │ │ │ + int dest_cursor = dest_start_idx; │ │ │ │ │ │ │ │ - void async_hash2(storage_index_t, piece_index_t piece, int │ │ │ │ - , disk_job_flags_t │ │ │ │ - , std::function<void(piece_index_t, sha256_hash const&, storage_error const&)> handler) override │ │ │ │ - { │ │ │ │ - post(m_ios, [h = std::move(handler), piece]() { h(piece, sha256_hash{}, storage_error{}); }); │ │ │ │ - } │ │ │ │ + // the number of tree levels in a piece hash. 0 means the block layer is │ │ │ │ + // the same as the piece layer │ │ │ │ + int const base = piece_levels(); │ │ │ │ │ │ │ │ - void async_move_storage(storage_index_t │ │ │ │ - , std::string p, move_flags_t │ │ │ │ - , std::function<void(status_t, std::string const&, storage_error const&)> handler) override │ │ │ │ - { │ │ │ │ - post(m_ios, [h = std::move(handler), path = std::move(p)] () mutable │ │ │ │ - { h(status_t::no_error, std::move(path), storage_error{}); }); │ │ │ │ - } │ │ │ │ +
    for (int layer_size = leaf_count; layer_size != 0; layer_size /= 2) │ │ │ │ +
    { │ │ │ │ + for (int i = 0; i < layer_size; ++i) │ │ │ │ + { │ │ │ │ + int const dst_idx = dest_cursor + i; │ │ │ │ + int const src_idx = source_cursor + i; │ │ │ │ + if (has_node(dst_idx)) │ │ │ │ + { │ │ │ │ + if (m_tree[dst_idx] != tree[src_idx]) │ │ │ │ + { │ │ │ │ + // this must be a block hash because inner nodes are not filled in until │ │ │ │ + // they can be verified. This assert ensures we're at the │ │ │ │ + // leaf layer of the file tree │ │ │ │ + TORRENT_ASSERT(dst_idx >= first_leaf); │ │ │ │ │ │ │ │ - void async_release_files(storage_index_t, std::function<void()> handler) override │ │ │ │ - { │ │ │ │ - post(m_ios, [h = std::move(handler)] { h(); }); │ │ │ │ - } │ │ │ │ + int const pos = dst_idx - first_leaf; │ │ │ │ + auto const piece = piece_index_t{pos >> m_blocks_per_piece_log} + file_piece_offset; │ │ │ │ + int const block = pos & ((1 << m_blocks_per_piece_log) - 1); │ │ │ │ │ │ │ │ - void async_delete_files(storage_index_t │ │ │ │ - , remove_flags_t, std::function<void(storage_error const&)> handler) override │ │ │ │ - { │ │ │ │ - post(m_ios, [h = std::move(handler)] { h(storage_error{}); }); │ │ │ │ - } │ │ │ │ + TORRENT_ASSERT(pos < m_num_blocks); │ │ │ │ + if (!ret.failed.empty() && ret.failed.back().first == piece) │ │ │ │ + ret.failed.back().second.push_back(block); │ │ │ │ + else │ │ │ │ + ret.failed.emplace_back(piece, std::vector<int>{block}); │ │ │ │ │ │ │ │ - void async_check_files(storage_index_t │ │ │ │ - , add_torrent_params const* │ │ │ │ -
    relevance 0../src/alert.cpp:404move this field into tracker_alert

    move this field into tracker_alert

    ../src/alert.cpp:404

    │ │ │ │ -		return torrent_alert::message() + ": state changed to: "
    │ │ │ │ -			+ state_str[state];
    │ │ │ │ -#endif
    │ │ │ │ -	}
    │ │ │ │ +						// now that this hash has been reported as failing, we
    │ │ │ │ +						// can clear it. This will prevent it from being
    │ │ │ │ +						// reported as failing again.
    │ │ │ │ +						m_tree[dst_idx].clear();
    │ │ │ │ +					}
    │ │ │ │ +					else if (dst_idx >= first_leaf)
    │ │ │ │ +
    relevance 0../src/merkle_tree.cpp:447instead of overwriting the root and comparing it against hashes[], write a functions that *validates* a tree by just filling it up to the level below the root and then validates it.

    instead of overwriting the root and comparing it │ │ │ │ +against hashes[], write a functions that *validates* a tree │ │ │ │ +by just filling it up to the level below the root and then │ │ │ │ +validates it.

    ../src/merkle_tree.cpp:447

    			&& dest_start_idx < first_piece_idx + num_pieces())
    │ │ │ │ +		{
    │ │ │ │ +			int const blocks_in_piece = 1 << base;
    │ │ │ │  
    │ │ │ │ -	tracker_error_alert::tracker_error_alert(aux::stack_allocator& alloc
    │ │ │ │ -		, torrent_handle const& h, tcp::endpoint const& ep, int times
    │ │ │ │ -		, protocol_version v, string_view u, operation_t const operation
    │ │ │ │ -		, error_code const& e
    │ │ │ │ -		, string_view m)
    │ │ │ │ -		: tracker_alert(alloc, h, ep, u)
    │ │ │ │ -		, times_in_row(times)
    │ │ │ │ -		, error(e)
    │ │ │ │ -		, op(operation)
    │ │ │ │ -		, m_msg_idx(alloc.copy_string(m))
    │ │ │ │ -#if TORRENT_ABI_VERSION == 1
    │ │ │ │ -		, status_code(e && e.category() == http_category() ? e.value() : -1)
    │ │ │ │ -		, msg(m)
    │ │ │ │ -#endif
    │ │ │ │ -
    , version(v) │ │ │ │ -
    { │ │ │ │ - TORRENT_ASSERT(!u.empty()); │ │ │ │ - } │ │ │ │ + // it may now be possible to verify the hashes of previously received blocks │ │ │ │ + // try to verify as many child nodes of the received hashes as possible │ │ │ │ + for (int i = 0; i < int(hashes.size()); ++i) │ │ │ │ + { │ │ │ │ + int const piece = dest_start_idx + i; │ │ │ │ + if (piece - first_piece_idx >= num_pieces()) │ │ │ │ + break; │ │ │ │ + // the first block in this piece │ │ │ │ + int const block_idx = merkle_get_first_child(piece, base); │ │ │ │ │ │ │ │ - char const* tracker_error_alert::failure_reason() const │ │ │ │ - { │ │ │ │ - return m_alloc.get().ptr(m_msg_idx); │ │ │ │ - } │ │ │ │ + int const block_end_idx = std::min(block_idx + blocks_in_piece, first_leaf + m_num_blocks); │ │ │ │ + if (std::any_of(m_tree.begin() + block_idx │ │ │ │ + , m_tree.begin() + block_end_idx │ │ │ │ + , [](sha256_hash const& h) { return h.is_all_zeros(); })) │ │ │ │ + continue; │ │ │ │ │ │ │ │ - std::string tracker_error_alert::message() const │ │ │ │ - { │ │ │ │ -#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ - return {}; │ │ │ │ -#else │ │ │ │ - char ret[400]; │ │ │ │ - std::snprintf(ret, sizeof(ret), "%s %s %s \"%s\" (%d)" │ │ │ │ - , tracker_alert::message().c_str() │ │ │ │ - , version == protocol_version::V1 ? "v1" : "v2" │ │ │ │ - , convert_from_native(error.message()).c_str(), error_message() │ │ │ │ - , times_in_row); │ │ │ │ - return ret; │ │ │ │ -#endif │ │ │ │ - } │ │ │ │ +
    merkle_fill_tree(m_tree, blocks_in_piece, block_idx); │ │ │ │ +
    if (m_tree[piece] != hashes[i]) │ │ │ │ + { │ │ │ │ + merkle_clear_tree(m_tree, blocks_in_piece, block_idx); │ │ │ │ + // write back the correct hash │ │ │ │ + m_tree[piece] = hashes[i]; │ │ │ │ + TORRENT_ASSERT(blocks_in_piece == blocks_per_piece()); │ │ │ │ │ │ │ │ - tracker_warning_alert::tracker_warning_alert(aux::stack_allocator& alloc │ │ │ │ - , torrent_handle const& h, tcp::endpoint const& ep │ │ │ │ - , string_view u, protocol_version v, string_view m) │ │ │ │ - : tracker_alert(alloc, h, ep, u) │ │ │ │ - , m_msg_idx(alloc.copy_string(m)) │ │ │ │ -#if TORRENT_ABI_VERSION == 1 │ │ │ │ -
    relevance 0../src/alert.cpp:438move this into tracker_alert

    move this into tracker_alert

    ../src/alert.cpp:438

    		return {};
    │ │ │ │ -#else
    │ │ │ │ -		char ret[400];
    │ │ │ │ -		std::snprintf(ret, sizeof(ret), "%s %s %s \"%s\" (%d)"
    │ │ │ │ -			, tracker_alert::message().c_str()
    │ │ │ │ -			, version == protocol_version::V1 ? "v1" : "v2"
    │ │ │ │ -			, convert_from_native(error.message()).c_str(), error_message()
    │ │ │ │ -			, times_in_row);
    │ │ │ │ -		return ret;
    │ │ │ │ -#endif
    │ │ │ │ -	}
    │ │ │ │ +					// an empty blocks vector indicates that we don't have the
    │ │ │ │ +					// block hashes, and we can't know which block failed
    │ │ │ │ +					// this will cause the block hashes to be requested
    │ │ │ │ +					ret.failed.emplace_back(piece_index_t{piece - first_piece_idx} + file_piece_offset
    │ │ │ │ +						, std::vector<int>());
    │ │ │ │ +				}
    │ │ │ │ +				else
    │ │ │ │ +				{
    │ │ │ │ +					ret.passed.push_back(piece_index_t{piece - first_piece_idx} + file_piece_offset);
    │ │ │ │ +					// record that these block hashes are correct!
    │ │ │ │ +					int const leafs_start = block_idx - block_layer_start();
    │ │ │ │ +					int const leafs_end = std::min(m_num_blocks, leafs_start + blocks_in_piece);
    │ │ │ │ +
    relevance 0../src/merkle_tree.cpp:471this could be done more efficiently if bitfield had a function to set a range of bits

    this could be done more efficiently if bitfield had a function │ │ │ │ +to set a range of bits

    ../src/merkle_tree.cpp:471

    				merkle_fill_tree(m_tree, blocks_in_piece, block_idx);
    │ │ │ │ +				if (m_tree[piece] != hashes[i])
    │ │ │ │ +				{
    │ │ │ │ +					merkle_clear_tree(m_tree, blocks_in_piece, block_idx);
    │ │ │ │ +					// write back the correct hash
    │ │ │ │ +					m_tree[piece] = hashes[i];
    │ │ │ │ +					TORRENT_ASSERT(blocks_in_piece == blocks_per_piece());
    │ │ │ │  
    │ │ │ │ -	tracker_warning_alert::tracker_warning_alert(aux::stack_allocator& alloc
    │ │ │ │ -		, torrent_handle const& h, tcp::endpoint const& ep
    │ │ │ │ -		, string_view u, protocol_version v, string_view m)
    │ │ │ │ -		: tracker_alert(alloc, h, ep, u)
    │ │ │ │ -		, m_msg_idx(alloc.copy_string(m))
    │ │ │ │ -#if TORRENT_ABI_VERSION == 1
    │ │ │ │ -		, msg(m)
    │ │ │ │ -#endif
    │ │ │ │ -
    , version(v) │ │ │ │ -
    { │ │ │ │ - TORRENT_ASSERT(!u.empty()); │ │ │ │ - } │ │ │ │ + // an empty blocks vector indicates that we don't have the │ │ │ │ + // block hashes, and we can't know which block failed │ │ │ │ + // this will cause the block hashes to be requested │ │ │ │ + ret.failed.emplace_back(piece_index_t{piece - first_piece_idx} + file_piece_offset │ │ │ │ + , std::vector<int>()); │ │ │ │ + } │ │ │ │ + else │ │ │ │ + { │ │ │ │ + ret.passed.push_back(piece_index_t{piece - first_piece_idx} + file_piece_offset); │ │ │ │ + // record that these block hashes are correct! │ │ │ │ + int const leafs_start = block_idx - block_layer_start(); │ │ │ │ + int const leafs_end = std::min(m_num_blocks, leafs_start + blocks_in_piece); │ │ │ │ +
    for (int k = leafs_start; k < leafs_end; ++k) │ │ │ │ +
    m_block_verified.set_bit(k); │ │ │ │ + } │ │ │ │ + TORRENT_ASSERT((piece - first_piece_idx) >= 0); │ │ │ │ + } │ │ │ │ + } │ │ │ │ │ │ │ │ - char const* tracker_warning_alert::warning_message() const │ │ │ │ - { │ │ │ │ - return m_alloc.get().ptr(m_msg_idx); │ │ │ │ + optimize_storage(); │ │ │ │ + │ │ │ │ + return ret; │ │ │ │ } │ │ │ │ │ │ │ │ - std::string tracker_warning_alert::message() const │ │ │ │ + std::tuple<merkle_tree::set_block_result, int, int> merkle_tree::set_block(int const block_index │ │ │ │ + , sha256_hash const& h) │ │ │ │ { │ │ │ │ -#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ - return {}; │ │ │ │ -#else │ │ │ │ - return tracker_alert::message() + (version == protocol_version::V1 ? " v1" : " v2") + " warning: " + warning_message(); │ │ │ │ +#ifdef TORRENT_EXPENSIVE_INVARIANT_CHECKS │ │ │ │ + INVARIANT_CHECK; │ │ │ │ #endif │ │ │ │ - } │ │ │ │ + TORRENT_ASSERT(block_index < m_num_blocks); │ │ │ │ │ │ │ │ - scrape_reply_alert::scrape_reply_alert(aux::stack_allocator& alloc │ │ │ │ - , torrent_handle const& h, tcp::endpoint const& ep │ │ │ │ - , int incomp, int comp, string_view u, protocol_version const v) │ │ │ │ - : tracker_alert(alloc, h, ep, u) │ │ │ │ - , incomplete(incomp) │ │ │ │ - , complete(comp) │ │ │ │ -
    relevance 0../src/alert.cpp:464move this into tracker_alert

    move this into tracker_alert

    ../src/alert.cpp:464

    	char const* tracker_warning_alert::warning_message() const
    │ │ │ │ -	{
    │ │ │ │ -		return m_alloc.get().ptr(m_msg_idx);
    │ │ │ │ -	}
    │ │ │ │ +		auto const num_leafs = merkle_num_leafs(m_num_blocks);
    │ │ │ │ +		auto const first_leaf = merkle_first_leaf(num_leafs);
    │ │ │ │ +		auto const block_tree_index = first_leaf + block_index;
    │ │ │ │  
    │ │ │ │ -	std::string tracker_warning_alert::message() const
    │ │ │ │ -	{
    │ │ │ │ -#ifdef TORRENT_DISABLE_ALERT_MSG
    │ │ │ │ -		return {};
    │ │ │ │ -#else
    │ │ │ │ -		return tracker_alert::message() + (version == protocol_version::V1 ? " v1" : " v2") + " warning: " + warning_message();
    │ │ │ │ -#endif
    │ │ │ │ -	}
    │ │ │ │ +		if (blocks_verified(block_index, 1))
    │ │ │ │ +		{
    │ │ │ │ +			// if this blocks's hash is already known, check the passed-in hash against it
    │ │ │ │ +			if (compare_node(block_tree_index, h))
    │ │ │ │ +				return std::make_tuple(set_block_result::ok, block_index, 1);
    │ │ │ │ +			else
    │ │ │ │ +				return std::make_tuple(set_block_result::block_hash_failed, block_index, 1);
    │ │ │ │ +
    relevance 0../src/merkle_tree.cpp:514use structured binding in C++17

    use structured binding in C++17

    ../src/merkle_tree.cpp:514

    		auto const first_leaf = merkle_first_leaf(num_leafs);
    │ │ │ │ +		auto const block_tree_index = first_leaf + block_index;
    │ │ │ │  
    │ │ │ │ -	scrape_reply_alert::scrape_reply_alert(aux::stack_allocator& alloc
    │ │ │ │ -		, torrent_handle const& h, tcp::endpoint const& ep
    │ │ │ │ -		, int incomp, int comp, string_view u, protocol_version const v)
    │ │ │ │ -		: tracker_alert(alloc, h, ep, u)
    │ │ │ │ -		, incomplete(incomp)
    │ │ │ │ -		, complete(comp)
    │ │ │ │ -
    , version(v) │ │ │ │ -
    { │ │ │ │ - TORRENT_ASSERT(!u.empty()); │ │ │ │ - } │ │ │ │ + if (blocks_verified(block_index, 1)) │ │ │ │ + { │ │ │ │ + // if this blocks's hash is already known, check the passed-in hash against it │ │ │ │ + if (compare_node(block_tree_index, h)) │ │ │ │ + return std::make_tuple(set_block_result::ok, block_index, 1); │ │ │ │ + else │ │ │ │ + return std::make_tuple(set_block_result::block_hash_failed, block_index, 1); │ │ │ │ + } │ │ │ │ │ │ │ │ - std::string scrape_reply_alert::message() const │ │ │ │ - { │ │ │ │ -#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ - return {}; │ │ │ │ -#else │ │ │ │ - char ret[400]; │ │ │ │ - std::snprintf(ret, sizeof(ret), "%s %s scrape reply: %d %d" │ │ │ │ - , tracker_alert::message().c_str() │ │ │ │ - , version == protocol_version::V1 ? "v1" : "v2" │ │ │ │ - , incomplete, complete); │ │ │ │ - return ret; │ │ │ │ -#endif │ │ │ │ - } │ │ │ │ + allocate_full(); │ │ │ │ │ │ │ │ - scrape_failed_alert::scrape_failed_alert(aux::stack_allocator& alloc │ │ │ │ - , torrent_handle const& h, tcp::endpoint const& ep │ │ │ │ - , string_view u, protocol_version const v, error_code const& e) │ │ │ │ - : tracker_alert(alloc, h, ep, u) │ │ │ │ - , error(e) │ │ │ │ - , m_msg_idx() │ │ │ │ -#if TORRENT_ABI_VERSION == 1 │ │ │ │ - , msg(convert_from_native(e.message())) │ │ │ │ -#endif │ │ │ │ -
    relevance 0../src/alert.cpp:493move this into tracker_alert

    move this into tracker_alert

    ../src/alert.cpp:493

    		return {};
    │ │ │ │ -#else
    │ │ │ │ -		char ret[400];
    │ │ │ │ -		std::snprintf(ret, sizeof(ret), "%s %s scrape reply: %d %d"
    │ │ │ │ -			, tracker_alert::message().c_str()
    │ │ │ │ -			, version == protocol_version::V1 ? "v1" : "v2"
    │ │ │ │ -			, incomplete, complete);
    │ │ │ │ -		return ret;
    │ │ │ │ -#endif
    │ │ │ │ -	}
    │ │ │ │ +		m_tree[block_tree_index] = h;
    │ │ │ │  
    │ │ │ │ -	scrape_failed_alert::scrape_failed_alert(aux::stack_allocator& alloc
    │ │ │ │ -		, torrent_handle const& h, tcp::endpoint const& ep
    │ │ │ │ -		, string_view u, protocol_version const v, error_code const& e)
    │ │ │ │ -		: tracker_alert(alloc, h, ep, u)
    │ │ │ │ -		, error(e)
    │ │ │ │ -		, m_msg_idx()
    │ │ │ │ -#if TORRENT_ABI_VERSION == 1
    │ │ │ │ -		, msg(convert_from_native(e.message()))
    │ │ │ │ -#endif
    │ │ │ │ -
    , version(v) │ │ │ │ -
    { │ │ │ │ - TORRENT_ASSERT(!u.empty()); │ │ │ │ + // to avoid wasting a lot of time hashing nodes only to discover they │ │ │ │ + // cannot be verified, check first to see if the root of the largest │ │ │ │ + // computable subtree is known │ │ │ │ + │ │ │ │ +
    int leafs_start; │ │ │ │ +
    int leafs_size; │ │ │ │ + int root_index; │ │ │ │ + std::tie(leafs_start, leafs_size, root_index) = │ │ │ │ + merkle_find_known_subtree(m_tree, block_index, m_num_blocks); │ │ │ │ + │ │ │ │ + // if the root node is unknown the hashes cannot be verified yet │ │ │ │ + if (m_tree[root_index].is_all_zeros()) │ │ │ │ + return std::make_tuple(set_block_result::unknown, leafs_start, leafs_size); │ │ │ │ + │ │ │ │ + // save the root hash because merkle_fill_tree will overwrite it │ │ │ │ + sha256_hash const root = m_tree[root_index]; │ │ │ │ + merkle_fill_tree(m_tree, leafs_size, first_leaf + leafs_start); │ │ │ │ + │ │ │ │ + if (root != m_tree[root_index]) │ │ │ │ + { │ │ │ │ + // hash failure, clear all the internal nodes │ │ │ │ + // the whole piece failed the hash check. Clear all block hashes │ │ │ │ + // in this piece and report a hash failure │ │ │ │ + merkle_clear_tree(m_tree, leafs_size, first_leaf + leafs_start); │ │ │ │ + m_tree[root_index] = root; │ │ │ │ + return std::make_tuple(set_block_result::hash_failed, leafs_start, leafs_size); │ │ │ │ + } │ │ │ │ + │ │ │ │ +
    relevance 0../src/merkle_tree.cpp:539this could be done more efficiently if bitfield had a function to set a range of bits

    this could be done more efficiently if bitfield had a function │ │ │ │ +to set a range of bits

    ../src/merkle_tree.cpp:539

    			merkle_find_known_subtree(m_tree, block_index, m_num_blocks);
    │ │ │ │ +
    │ │ │ │ +		// if the root node is unknown the hashes cannot be verified yet
    │ │ │ │ +		if (m_tree[root_index].is_all_zeros())
    │ │ │ │ +			return std::make_tuple(set_block_result::unknown, leafs_start, leafs_size);
    │ │ │ │ +
    │ │ │ │ +		// save the root hash because merkle_fill_tree will overwrite it
    │ │ │ │ +		sha256_hash const root = m_tree[root_index];
    │ │ │ │ +		merkle_fill_tree(m_tree, leafs_size, first_leaf + leafs_start);
    │ │ │ │ +
    │ │ │ │ +		if (root != m_tree[root_index])
    │ │ │ │ +		{
    │ │ │ │ +			// hash failure, clear all the internal nodes
    │ │ │ │ +			// the whole piece failed the hash check. Clear all block hashes
    │ │ │ │ +			// in this piece and report a hash failure
    │ │ │ │ +			merkle_clear_tree(m_tree, leafs_size, first_leaf + leafs_start);
    │ │ │ │ +			m_tree[root_index] = root;
    │ │ │ │ +			return std::make_tuple(set_block_result::hash_failed, leafs_start, leafs_size);
    │ │ │ │ +		}
    │ │ │ │ +
    │ │ │ │ +
    int const leafs_end = std::min(m_num_blocks, leafs_start + leafs_size); │ │ │ │ +
    for (int i = leafs_start; i < leafs_end; ++i) │ │ │ │ + m_block_verified.set_bit(i); │ │ │ │ + │ │ │ │ + // attempting to optimize storage is quite costly, only do it if we have │ │ │ │ + // a reason to believe it might have an effect │ │ │ │ + if (block_index == m_num_blocks - 1 || !m_tree[block_tree_index + 1].is_all_zeros()) │ │ │ │ + optimize_storage(); │ │ │ │ + │ │ │ │ + return std::make_tuple(set_block_result::ok, leafs_start, leafs_size); │ │ │ │ } │ │ │ │ │ │ │ │ - scrape_failed_alert::scrape_failed_alert(aux::stack_allocator& alloc │ │ │ │ - , torrent_handle const& h, tcp::endpoint const& ep │ │ │ │ - , string_view u, string_view m) │ │ │ │ - : tracker_alert(alloc, h, ep, u) │ │ │ │ - , error(errors::tracker_failure) │ │ │ │ - , m_msg_idx(alloc.copy_string(m)) │ │ │ │ -#if TORRENT_ABI_VERSION == 1 │ │ │ │ - , msg(m) │ │ │ │ -#endif │ │ │ │ + std::size_t merkle_tree::size() const │ │ │ │ { │ │ │ │ - TORRENT_ASSERT(!u.empty()); │ │ │ │ + return static_cast<std::size_t>(merkle_num_nodes(merkle_num_leafs(m_num_blocks))); │ │ │ │ } │ │ │ │ │ │ │ │ - char const* scrape_failed_alert::error_message() const │ │ │ │ + int merkle_tree::num_pieces() const │ │ │ │ { │ │ │ │ - if (m_msg_idx == aux::allocation_slot()) return ""; │ │ │ │ - else return m_alloc.get().ptr(m_msg_idx); │ │ │ │ + int const ps = blocks_per_piece(); │ │ │ │ + TORRENT_ASSERT(ps > 0); │ │ │ │ + return (m_num_blocks + ps - 1) >> m_blocks_per_piece_log; │ │ │ │ } │ │ │ │ │ │ │ │ - std::string scrape_failed_alert::message() const │ │ │ │ - { │ │ │ │ -#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ - return {}; │ │ │ │ -#else │ │ │ │ - return tracker_alert::message() + " scrape failed: " + error_message(); │ │ │ │ -#endif │ │ │ │ -
    relevance 0../src/alert.cpp:532move this field into tracker_alert

    move this field into tracker_alert

    ../src/alert.cpp:532

    	char const* scrape_failed_alert::error_message() const
    │ │ │ │ +	int merkle_tree::block_layer_start() const
    │ │ │ │  	{
    │ │ │ │ -		if (m_msg_idx == aux::allocation_slot()) return "";
    │ │ │ │ -		else return m_alloc.get().ptr(m_msg_idx);
    │ │ │ │ +		int const num_leafs = merkle_num_leafs(m_num_blocks);
    │ │ │ │ +		TORRENT_ASSERT(num_leafs > 0);
    │ │ │ │ +		return merkle_first_leaf(num_leafs);
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ -	std::string scrape_failed_alert::message() const
    │ │ │ │ +
    relevance 0../src/web_connection_base.cpp:72introduce a web-seed default class which has a low download priority

    introduce a web-seed default class which has a low download priority

    ../src/web_connection_base.cpp:72

    		: peer_connection(pack)
    │ │ │ │ +		, m_first_request(true)
    │ │ │ │ +		, m_ssl(false)
    │ │ │ │ +		, m_external_auth(web.auth)
    │ │ │ │ +		, m_extra_headers(web.extra_headers)
    │ │ │ │ +		, m_parser(http_parser::dont_parse_chunks)
    │ │ │ │ +		, m_body_start(0)
    │ │ │ │  	{
    │ │ │ │ -#ifdef TORRENT_DISABLE_ALERT_MSG
    │ │ │ │ -		return {};
    │ │ │ │ -#else
    │ │ │ │ -		return tracker_alert::message() + " scrape failed: " + error_message();
    │ │ │ │ -#endif
    │ │ │ │ -	}
    │ │ │ │ +		TORRENT_ASSERT(&web.peer_info == pack.peerinfo);
    │ │ │ │ +		// when going through a proxy, we don't necessarily have an endpoint here,
    │ │ │ │ +		// since the proxy might be resolving the hostname, not us
    │ │ │ │ +		TORRENT_ASSERT(web.endpoints.empty() || web.endpoints.front() == pack.endp);
    │ │ │ │  
    │ │ │ │ -	tracker_reply_alert::tracker_reply_alert(aux::stack_allocator& alloc
    │ │ │ │ -		, torrent_handle const& h, tcp::endpoint const& ep
    │ │ │ │ -		, int np, protocol_version v, string_view u)
    │ │ │ │ -		: tracker_alert(alloc, h, ep, u)
    │ │ │ │ -		, num_peers(np)
    │ │ │ │ -
    , version(v) │ │ │ │ -
    { │ │ │ │ - TORRENT_ASSERT(!u.empty()); │ │ │ │ - } │ │ │ │ + INVARIANT_CHECK; │ │ │ │ │ │ │ │ - std::string tracker_reply_alert::message() const │ │ │ │ - { │ │ │ │ -#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ - return {}; │ │ │ │ -#else │ │ │ │ - char ret[400]; │ │ │ │ - std::snprintf(ret, sizeof(ret), "%s %s received peers: %d" │ │ │ │ - , tracker_alert::message().c_str() │ │ │ │ - , version == protocol_version::V1 ? "v1" : "v2" │ │ │ │ - , num_peers); │ │ │ │ - return ret; │ │ │ │ -#endif │ │ │ │ - } │ │ │ │ + TORRENT_ASSERT(is_outgoing()); │ │ │ │ │ │ │ │ - dht_reply_alert::dht_reply_alert(aux::stack_allocator& alloc │ │ │ │ - , torrent_handle const& h │ │ │ │ - , int np) │ │ │ │ - : tracker_alert(alloc, h, {}, "") │ │ │ │ - , num_peers(np) │ │ │ │ - {} │ │ │ │ + TORRENT_ASSERT(!m_torrent.lock()->is_upload_only()); │ │ │ │ │ │ │ │ - std::string dht_reply_alert::message() const │ │ │ │ - { │ │ │ │ -#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ - return {}; │ │ │ │ -#else │ │ │ │ -
    relevance 0../src/alert.cpp:576move this to tracker_alert

    move this to tracker_alert

    ../src/alert.cpp:576

    		, num_peers(np)
    │ │ │ │ -	{}
    │ │ │ │ +		// we only want left-over bandwidth
    │ │ │ │ +
    │ │ │ │ +
    std::string protocol; │ │ │ │ + error_code ec; │ │ │ │ + std::tie(protocol, m_basic_auth, m_host, m_port, m_path) │ │ │ │ + = parse_url_components(web.url, ec); │ │ │ │ + TORRENT_ASSERT(!ec); │ │ │ │ │ │ │ │ - std::string dht_reply_alert::message() const │ │ │ │ - { │ │ │ │ -#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ - return {}; │ │ │ │ -#else │ │ │ │ - char ret[400]; │ │ │ │ - std::snprintf(ret, sizeof(ret), "%s received DHT peers: %d" │ │ │ │ - , tracker_alert::message().c_str(), num_peers); │ │ │ │ - return ret; │ │ │ │ + if (m_port == -1 && protocol == "http") │ │ │ │ + m_port = 80; │ │ │ │ + │ │ │ │ +#if TORRENT_USE_SSL │ │ │ │ + if (protocol == "https") │ │ │ │ + { │ │ │ │ + m_ssl = true; │ │ │ │ + if (m_port == -1) m_port = 443; │ │ │ │ + } │ │ │ │ #endif │ │ │ │ - } │ │ │ │ │ │ │ │ - tracker_announce_alert::tracker_announce_alert(aux::stack_allocator& alloc │ │ │ │ - , torrent_handle const& h, tcp::endpoint const& ep, string_view u │ │ │ │ - , protocol_version const v, event_t const e) │ │ │ │ - : tracker_alert(alloc, h, ep, u) │ │ │ │ - , event(e) │ │ │ │ -
    , version(v) │ │ │ │ -
    { │ │ │ │ - TORRENT_ASSERT(!u.empty()); │ │ │ │ - } │ │ │ │ + if (!m_basic_auth.empty()) │ │ │ │ + m_basic_auth = base64encode(m_basic_auth); │ │ │ │ │ │ │ │ - std::string tracker_announce_alert::message() const │ │ │ │ - { │ │ │ │ -#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ - return {}; │ │ │ │ -#else │ │ │ │ - static const char* const event_str[] = {"none", "completed", "started", "stopped", "paused"}; │ │ │ │ - return tracker_alert::message() │ │ │ │ - + (version == protocol_version::V1 ? " v1" : " v2") │ │ │ │ - + " sending announce (" + event_str[static_cast<int>(event)] + ")"; │ │ │ │ -#endif │ │ │ │ + m_server_string = m_host; │ │ │ │ + aux::verify_encoding(m_server_string); │ │ │ │ } │ │ │ │ │ │ │ │ - hash_failed_alert::hash_failed_alert( │ │ │ │ - aux::stack_allocator& alloc │ │ │ │ - , torrent_handle const& h │ │ │ │ - , piece_index_t index) │ │ │ │ - : torrent_alert(alloc, h) │ │ │ │ - , piece_index(index) │ │ │ │ + int web_connection_base::timeout() const │ │ │ │ { │ │ │ │ - TORRENT_ASSERT(index >= piece_index_t(0)); │ │ │ │ + // since this is a web seed, change the timeout │ │ │ │ + // according to the settings. │ │ │ │ + return m_settings.get_int(settings_pack::urlseed_timeout); │ │ │ │ } │ │ │ │ - │ │ │ │ - std::string hash_failed_alert::message() const │ │ │ │ - { │ │ │ │ -#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ - return {}; │ │ │ │ -
    relevance 0../src/random.cpp:141improve calling RAND_bytes multiple times, using fallback for now

    improve calling RAND_bytes multiple times, using fallback for now

    ../src/random.cpp:141

    #else
    │ │ │ │ +
    relevance 0../src/random.cpp:141improve calling RAND_bytes multiple times, using fallback for now

    improve calling RAND_bytes multiple times, using fallback for now

    ../src/random.cpp:141

    #else
    │ │ │ │  			std::generate(buffer.begin(), buffer.end(), [] { return char(random(0xff)); });
    │ │ │ │  #endif
    │ │ │ │  		}
    │ │ │ │  
    │ │ │ │  		void crypto_random_bytes(span<char> buffer)
    │ │ │ │  		{
    │ │ │ │  #ifdef TORRENT_BUILD_SIMULATOR
    │ │ │ │ @@ -7797,274 +8334,387 @@
    │ │ │ │  #error "no secure entropy source available. If you really want insecure random numbers, define TORRENT_I_WANT_INSECURE_RANDOM_NUMBERS"
    │ │ │ │  #endif
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │  #endif
    │ │ │ │  		}
    │ │ │ │  }
    │ │ │ │ -
    relevance 0../src/storage_utils.cpp:230ideally, if we end up copying files because of a move across volumes, the source should not be deleted until they've all been copied. That would let us rollback with higher confidence.

    ideally, if we end up copying files because of a move across │ │ │ │ -volumes, the source should not be deleted until they've all been │ │ │ │ -copied. That would let us rollback with higher confidence.

    ../src/storage_utils.cpp:230

    		// later
    │ │ │ │ -		aux::vector<bool, file_index_t> copied_files(std::size_t(f.num_files()), false);
    │ │ │ │ -
    │ │ │ │ -		// track how far we got in case of an error
    │ │ │ │ -		file_index_t file_index{};
    │ │ │ │ -		for (auto const i : f.file_range())
    │ │ │ │ -		{
    │ │ │ │ -			// files moved out to absolute paths are not moved
    │ │ │ │ -			if (f.file_absolute_path(i)) continue;
    │ │ │ │ +
    relevance 0../src/http_seed_connection.cpp:441technically, this isn't supposed to happen, but it seems to sometimes. Some of the accounting is probably wrong in certain cases

    technically, this isn't supposed to happen, but it seems to │ │ │ │ +sometimes. Some of the accounting is probably wrong in certain │ │ │ │ +cases

    ../src/http_seed_connection.cpp:441

    					// cut out the chunk header from the receive buffer
    │ │ │ │ +					TORRENT_ASSERT(m_chunk_pos + m_body_start < INT_MAX);
    │ │ │ │ +					m_recv_buffer.cut(header_size, t->block_size() + 1024, aux::numeric_cast<int>(m_chunk_pos + m_body_start));
    │ │ │ │ +					recv_buffer = m_recv_buffer.get();
    │ │ │ │ +					recv_buffer = recv_buffer.subspan(m_body_start);
    │ │ │ │ +					m_chunk_pos += chunk_size;
    │ │ │ │ +					if (chunk_size == 0)
    │ │ │ │ +					{
    │ │ │ │ +						TORRENT_ASSERT(m_recv_buffer.get().size() < m_chunk_pos + m_body_start + 1
    │ │ │ │ +							|| m_recv_buffer.get()[static_cast<std::ptrdiff_t>(m_chunk_pos + m_body_start)] == 'H'
    │ │ │ │ +							|| (m_parser.chunked_encoding()
    │ │ │ │ +								&& m_recv_buffer.get()[static_cast<std::ptrdiff_t>(m_chunk_pos + m_body_start)] == '\r'));
    │ │ │ │ +						m_chunk_pos = -1;
    │ │ │ │ +					}
    │ │ │ │ +				}
    │ │ │ │ +			}
    │ │ │ │  
    │ │ │ │ -			std::string const old_path = combine_path(save_path, f.file_path(i));
    │ │ │ │ -			std::string const new_path = combine_path(new_save_path, f.file_path(i));
    │ │ │ │ +			int payload = int(bytes_transferred);
    │ │ │ │ +			if (payload > m_response_left) payload = int(m_response_left);
    │ │ │ │ +			if (payload > front_request.length) payload = front_request.length;
    │ │ │ │ +
    if (payload > outstanding_bytes()) payload = outstanding_bytes(); │ │ │ │ +
    received_bytes(payload, 0); │ │ │ │ + incoming_piece_fragment(payload); │ │ │ │ + m_response_left -= payload; │ │ │ │ │ │ │ │ - error_code ignore; │ │ │ │ - if (flags == move_flags_t::dont_replace && exists(new_path, ignore)) │ │ │ │ + if (m_parser.status_code() == 503) │ │ │ │ { │ │ │ │ - if (ret == status_t::no_error) ret = status_t::need_full_check; │ │ │ │ - continue; │ │ │ │ - } │ │ │ │ + if (!m_parser.finished()) return; │ │ │ │ │ │ │ │ -
    move_file(old_path, new_path, ec); │ │ │ │ -
    │ │ │ │ - // if the source file doesn't exist. That's not a problem │ │ │ │ - // we just ignore that file │ │ │ │ - if (ec.ec == boost::system::errc::no_such_file_or_directory) │ │ │ │ - ec.ec.clear(); │ │ │ │ - else if (ec │ │ │ │ - && ec.ec != boost::system::errc::invalid_argument │ │ │ │ - && ec.ec != boost::system::errc::permission_denied) │ │ │ │ - { │ │ │ │ - // moving the file failed │ │ │ │ - // on OSX, the error when trying to rename a file across different │ │ │ │ - // volumes is EXDEV, which will make it fall back to copying. │ │ │ │ - ec.ec.clear(); │ │ │ │ - copy_file(old_path, new_path, ec); │ │ │ │ - if (!ec) copied_files[i] = true; │ │ │ │ + int retry_time = std::atoi(std::string(recv_buffer.begin(), recv_buffer.end()).c_str()); │ │ │ │ + if (retry_time <= 0) retry_time = 60; │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + peer_log(peer_log_alert::info, "CONNECT", "retrying in %d seconds", retry_time); │ │ │ │ +#endif │ │ │ │ + │ │ │ │ + received_bytes(0, int(bytes_transferred)); │ │ │ │ + // temporarily unavailable, retry later │ │ │ │ + t->retry_web_seed(this, seconds32(retry_time)); │ │ │ │ + disconnect(error_code(m_parser.status_code(), http_category()), operation_t::bittorrent, failure); │ │ │ │ + return; │ │ │ │ } │ │ │ │ │ │ │ │ - if (ec) │ │ │ │ - { │ │ │ │ - ec.file(i); │ │ │ │ - file_index = i; │ │ │ │ - break; │ │ │ │ + │ │ │ │ + // we only received the header, no data │ │ │ │ + if (recv_buffer.empty()) break; │ │ │ │ + │ │ │ │ + if (recv_buffer.size() < front_request.length) break; │ │ │ │ + │ │ │ │ + // if the response is chunked, we need to receive the last │ │ │ │ + // terminating chunk and the tail headers before we can proceed │ │ │ │ + if (m_parser.chunked_encoding() && m_chunk_pos >= 0) break; │ │ │ │ +
    relevance 0../src/add_torrent_params.cpp:78pre C++17, GCC and msvc does not make std::string nothrow move assignable, which means no type containing a string will be nothrow move assignable by default either static_assert(std::is_nothrow_move_assignable::value , "should be nothrow move assignable");

    pre C++17, GCC and msvc does not make std::string nothrow move │ │ │ │ +assignable, which means no type containing a string will be nothrow move │ │ │ │ +assignable by default either │ │ │ │ +static_assert(std::is_nothrow_move_assignable::value │ │ │ │ +, "should be nothrow move assignable");

    ../src/add_torrent_params.cpp:78

    			DECL_FLAG(sequential_download);
    │ │ │ │ +			DECL_FLAG(pinned);
    │ │ │ │ +			DECL_FLAG(stop_when_ready);
    │ │ │ │ +			DECL_FLAG(override_trackers);
    │ │ │ │ +			DECL_FLAG(override_web_seeds);
    │ │ │ │ +			DECL_FLAG(need_save_resume);
    │ │ │ │ +			DECL_FLAG(override_resume_data);
    │ │ │ │ +			DECL_FLAG(merge_resume_trackers);
    │ │ │ │ +			DECL_FLAG(use_resume_save_path);
    │ │ │ │ +			DECL_FLAG(merge_resume_http_seeds);
    │ │ │ │ +			DECL_FLAG(default_flags);
    │ │ │ │ +#undef DECL_FLAG
    │ │ │ │ +#endif // TORRENT_ABI_VERSION
    │ │ │ │ +
    │ │ │ │ +	static_assert(std::is_nothrow_move_constructible<add_torrent_params>::value
    │ │ │ │ +		, "should be nothrow move constructible");
    │ │ │ │ +
    │ │ │ │ +	static_assert(std::is_nothrow_move_constructible<std::string>::value
    │ │ │ │ +		, "should be nothrow move constructible");
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    relevance 0../src/add_torrent_params.cpp:84it would be nice if this was nothrow default constructible static_assert(std::is_nothrow_default_constructible::value , "should be nothrow default constructible");

    it would be nice if this was nothrow default constructible │ │ │ │ +static_assert(std::is_nothrow_default_constructible::value │ │ │ │ +, "should be nothrow default constructible");

    ../src/add_torrent_params.cpp:84

    			DECL_FLAG(pinned);
    │ │ │ │ +			DECL_FLAG(stop_when_ready);
    │ │ │ │ +			DECL_FLAG(override_trackers);
    │ │ │ │ +			DECL_FLAG(override_web_seeds);
    │ │ │ │ +			DECL_FLAG(need_save_resume);
    │ │ │ │ +			DECL_FLAG(override_resume_data);
    │ │ │ │ +			DECL_FLAG(merge_resume_trackers);
    │ │ │ │ +			DECL_FLAG(use_resume_save_path);
    │ │ │ │ +			DECL_FLAG(merge_resume_http_seeds);
    │ │ │ │ +			DECL_FLAG(default_flags);
    │ │ │ │ +#undef DECL_FLAG
    │ │ │ │ +#endif // TORRENT_ABI_VERSION
    │ │ │ │ +
    │ │ │ │ +	static_assert(std::is_nothrow_move_constructible<add_torrent_params>::value
    │ │ │ │ +		, "should be nothrow move constructible");
    │ │ │ │ +
    │ │ │ │ +	static_assert(std::is_nothrow_move_constructible<std::string>::value
    │ │ │ │ +		, "should be nothrow move constructible");
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    namespace aux { │ │ │ │ + │ │ │ │ + // returns whether this add_torrent_params object has "resume-data", i.e. │ │ │ │ + // information about which pieces we have. │ │ │ │ + bool contains_resume_data(add_torrent_params const& atp) │ │ │ │ + { │ │ │ │ + return !atp.have_pieces.empty() │ │ │ │ + || (atp.flags & torrent_flags::seed_mode); │ │ │ │ + } │ │ │ │ +} │ │ │ │ + │ │ │ │ +} │ │ │ │ +
    relevance 0../src/part_file.cpp:300what do we do if someone is currently reading from the disk from this piece? does it matter? Since we won't actively erase the data from disk, but it may be overwritten soon, it's probably not that big of a deal

    what do we do if someone is currently reading from the disk │ │ │ │ +from this piece? does it matter? Since we won't actively erase the │ │ │ │ +data from disk, but it may be overwritten soon, it's probably not that │ │ │ │ +big of a deal

    ../src/part_file.cpp:300

    				create_directories(m_path, ec);
    │ │ │ │ +				if (ec) return {};
    │ │ │ │ +				return aux::file_handle(fn, 0, mode);
    │ │ │ │  			}
    │ │ │ │ +			return {};
    │ │ │ │  		}
    │ │ │ │ +	}
    │ │ │ │ +	catch (storage_error const& e)
    │ │ │ │ +	{
    │ │ │ │ +		ec = e.ec;
    │ │ │ │ +		return {};
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -		if (!ec && move_partfile)
    │ │ │ │ +	void part_file::free_piece(piece_index_t const piece)
    │ │ │ │ +	{
    │ │ │ │ +		std::lock_guard<std::mutex> l(m_mutex);
    │ │ │ │ +
    │ │ │ │ +		auto const i = m_piece_map.find(piece);
    │ │ │ │ +		if (i == m_piece_map.end()) return;
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    m_free_slots.push_back(i->second); │ │ │ │ + m_piece_map.erase(i); │ │ │ │ + m_dirty_metadata = true; │ │ │ │ + } │ │ │ │ + │ │ │ │ + void part_file::move_partfile(std::string const& path, error_code& ec) │ │ │ │ + { │ │ │ │ + std::lock_guard<std::mutex> l(m_mutex); │ │ │ │ + │ │ │ │ + flush_metadata_impl(ec); │ │ │ │ + if (ec) return; │ │ │ │ + │ │ │ │ + if (!m_piece_map.empty()) │ │ │ │ { │ │ │ │ - error_code e; │ │ │ │ - move_partfile(new_save_path, e); │ │ │ │ - if (e) │ │ │ │ -
    relevance 0../src/storage_utils.cpp:538it would seem reasonable to, instead, set the have_pieces bits for the pieces representing these files, and resume with the normal logic

    it would seem reasonable to, instead, set the have_pieces bits │ │ │ │ -for the pieces representing these files, and resume with the normal │ │ │ │ -logic

    ../src/storage_utils.cpp:538

    					continue;
    │ │ │ │ +			std::string old_path = combine_path(m_path, m_name);
    │ │ │ │ +			std::string new_path = combine_path(path, m_name);
    │ │ │ │  
    │ │ │ │ -				std::int64_t const size = get_filesize(stat, file_index, fs
    │ │ │ │ -					, save_path, ec);
    │ │ │ │ -				if (size < 0) return false;
    │ │ │ │ +			rename(old_path, new_path, ec);
    │ │ │ │ +			if (ec == boost::system::errc::no_such_file_or_directory)
    │ │ │ │ +				ec.clear();
    │ │ │ │  
    │ │ │ │ -				if (size < fs.file_size(file_index))
    │ │ │ │ -				{
    │ │ │ │ -					ec.ec = errors::mismatching_file_size;
    │ │ │ │ -					ec.file(file_index);
    │ │ │ │ -					ec.operation = operation_t::check_resume;
    │ │ │ │ -					return false;
    │ │ │ │ +			if (ec)
    │ │ │ │ +			{
    │ │ │ │ +				storage_error se;
    │ │ │ │ +				aux::copy_file(old_path, new_path, se);
    │ │ │ │ +				ec = se.ec;
    │ │ │ │ +				if (ec) return;
    │ │ │ │ +				remove(old_path, ec);
    │ │ │ │ +			}
    │ │ │ │ +		}
    │ │ │ │ +
    relevance 0../src/part_file.cpp:411instead of rebuilding the whole file header and flushing it, update the slot entries as we go

    instead of rebuilding the whole file header │ │ │ │ +and flushing it, update the slot entries as we go

    ../src/part_file.cpp:411

    						TORRENT_ASSERT(j->second == slot);
    │ │ │ │ +						m_free_slots.push_back(j->second);
    │ │ │ │ +						m_piece_map.erase(j);
    │ │ │ │ +						m_dirty_metadata = true;
    │ │ │ │ +					}
    │ │ │ │  				}
    │ │ │ │  			}
    │ │ │ │ -			return true;
    │ │ │ │ +			file_offset += block_to_copy;
    │ │ │ │ +			piece_offset = 0;
    │ │ │ │ +			size -= block_to_copy;
    │ │ │ │  		}
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -#ifndef TORRENT_DISABLE_MUTABLE_TORRENTS
    │ │ │ │ -		// always trigger a full recheck when we pull in files from other
    │ │ │ │ -		// torrents, via hard links
    │ │ │ │ -
    if (added_files) return false; │ │ │ │ -
    #endif │ │ │ │ + void part_file::flush_metadata(error_code& ec) │ │ │ │ + { │ │ │ │ + std::lock_guard<std::mutex> l(m_mutex); │ │ │ │ │ │ │ │ - // parse have bitmask. Verify that the files we expect to have │ │ │ │ - // actually do exist │ │ │ │ - piece_index_t const end_piece = std::min(rd.have_pieces.end_index(), fs.end_piece()); │ │ │ │ - for (piece_index_t i(0); i < end_piece; ++i) │ │ │ │ - { │ │ │ │ - if (rd.have_pieces.get_bit(i) == false) continue; │ │ │ │ + flush_metadata_impl(ec); │ │ │ │ + } │ │ │ │ │ │ │ │ - std::vector<file_slice> f = fs.map_block(i, 0, 1); │ │ │ │ - TORRENT_ASSERT(!f.empty()); │ │ │ │ +
    void part_file::flush_metadata_impl(error_code& ec) │ │ │ │ +
    { │ │ │ │ + // do we need to flush the metadata? │ │ │ │ + if (m_dirty_metadata == false) return; │ │ │ │ │ │ │ │ - file_index_t const file_index = f[0].file_index; │ │ │ │ + if (m_piece_map.empty()) │ │ │ │ + { │ │ │ │ + // if we don't have any pieces left in the │ │ │ │ + // part file, remove it │ │ │ │ + std::string const p = combine_path(m_path, m_name); │ │ │ │ + remove(p, ec); │ │ │ │ │ │ │ │ - // files with priority zero may not have been saved to disk at their │ │ │ │ - // expected location, but is likely to be in a partfile. Just exempt it │ │ │ │ - // from checking │ │ │ │ - if (file_index < file_priority.end_index() │ │ │ │ - && file_priority[file_index] == dont_download) │ │ │ │ - continue; │ │ │ │ + if (ec == boost::system::errc::no_such_file_or_directory) │ │ │ │ + ec.clear(); │ │ │ │ + return; │ │ │ │ + } │ │ │ │ │ │ │ │ - if (fs.pad_file_at(file_index)) continue; │ │ │ │ + auto f = open_file(aux::open_mode::write | aux::open_mode::hidden, ec); │ │ │ │ + if (ec) return; │ │ │ │ │ │ │ │ - if (get_filesize(stat, file_index, fs, save_path, ec) < 0) │ │ │ │ - return false; │ │ │ │ + std::vector<char> header(static_cast<std::size_t>(m_header_size)); │ │ │ │ │ │ │ │ - // OK, this file existed, good. Now, skip all remaining pieces in │ │ │ │ - // this file. We're just sanity-checking whether the files exist │ │ │ │ - // or not. │ │ │ │ - peer_request const pr = fs.map_file(file_index │ │ │ │ -
    relevance 0../src/peer_connection.cpp:1105this should be the global download rate

    this should be the global download rate

    ../src/peer_connection.cpp:1105

    │ │ │ │ -		int rate = 0;
    │ │ │ │ +		using namespace libtorrent::aux;
    │ │ │ │  
    │ │ │ │ -		// if we haven't received any data recently, the current download rate
    │ │ │ │ -		// is not representative
    │ │ │ │ -		if (aux::time_now() - m_last_piece.get(m_connect) > seconds(30) && m_download_rate_peak > 0)
    │ │ │ │ -		{
    │ │ │ │ -			rate = m_download_rate_peak;
    │ │ │ │ -		}
    │ │ │ │ -		else if (aux::time_now() - m_last_unchoked.get(m_connect) < seconds(5)
    │ │ │ │ -			&& m_statistics.total_payload_upload() < 2 * 0x4000)
    │ │ │ │ +		char* ptr = header.data();
    │ │ │ │ +		write_uint32(m_max_pieces, ptr);
    │ │ │ │ +		write_uint32(m_piece_size, ptr);
    │ │ │ │ +
    │ │ │ │ +		for (piece_index_t piece(0); piece < piece_index_t(m_max_pieces); ++piece)
    │ │ │ │  		{
    │ │ │ │ -			// if we're have only been unchoked for a short period of time,
    │ │ │ │ -			// we don't know what rate we can get from this peer. Instead of assuming
    │ │ │ │ -			// the lowest possible rate, assume the average.
    │ │ │ │ +			auto const i = m_piece_map.find(piece);
    │ │ │ │ +
    relevance 0../src/utp_socket_manager.cpp:204this should not be heap allocated, sockets should be movable

    this should not be heap allocated, sockets should be movable

    ../src/utp_socket_manager.cpp:204

    │ │ │ │ +//		UTP_LOGV("incoming packet id:%d source:%s\n", id, print_endpoint(ep).c_str());
    │ │ │ │  
    │ │ │ │ -			int peers_with_requests = int(stats_counters()[counters::num_peers_down_requests]);
    │ │ │ │ -			// avoid division by 0
    │ │ │ │ -			if (peers_with_requests == 0) peers_with_requests = 1;
    │ │ │ │ +		if (!m_sett.get_bool(settings_pack::enable_incoming_utp))
    │ │ │ │ +			return false;
    │ │ │ │  
    │ │ │ │ -
    rate = t->statistics().transfer_rate(stat::download_payload) / peers_with_requests; │ │ │ │ -
    } │ │ │ │ - else │ │ │ │ + // if not found, see if it's a SYN packet, if it is, │ │ │ │ + // create a new utp_stream │ │ │ │ + if (ph->get_type() == ST_SYN) │ │ │ │ { │ │ │ │ - // current download rate in bytes per seconds │ │ │ │ - rate = m_statistics.transfer_rate(stat::download_payload); │ │ │ │ + // possible SYN flood. Just ignore │ │ │ │ + if (int(m_utp_sockets.size()) > m_sett.get_int(settings_pack::connections_limit) * 2) │ │ │ │ + return false; │ │ │ │ + │ │ │ │ + TORRENT_ASSERT(m_new_connection == -1); │ │ │ │ + // create the new socket with this ID │ │ │ │ + m_new_connection = id; │ │ │ │ + │ │ │ │ +// UTP_LOGV("not found, new connection id:%d\n", m_new_connection); │ │ │ │ + │ │ │ │ +
    aux::socket_type c(aux::instantiate_connection(m_ios, aux::proxy_settings(), m_ssl_context, this, true, false)); │ │ │ │ +
    │ │ │ │ + utp_stream* str = nullptr; │ │ │ │ +#ifdef TORRENT_SSL_PEERS │ │ │ │ + if (is_ssl(c)) │ │ │ │ + str = &boost::get<ssl_stream<utp_stream>>(c).next_layer(); │ │ │ │ + else │ │ │ │ +#endif │ │ │ │ + str = boost::get<utp_stream>(&c); │ │ │ │ + │ │ │ │ + TORRENT_ASSERT(str); │ │ │ │ + int const mtu = mtu_for_dest(ep.address()); │ │ │ │ + str->get_impl()->init_mtu(mtu); │ │ │ │ + str->get_impl()->m_sock = std::move(socket); │ │ │ │ + bool const ret = str->get_impl()->incoming_packet(p, ep, receive_time); │ │ │ │ + if (!ret) return false; │ │ │ │ + m_last_socket = str->get_impl(); │ │ │ │ + m_cb(std::move(c)); │ │ │ │ + // the connection most likely changed its connection ID here │ │ │ │ + // we need to move it to the correct ID │ │ │ │ + return true; │ │ │ │ } │ │ │ │ │ │ │ │ - // avoid division by zero │ │ │ │ - if (rate < 50) rate = 50; │ │ │ │ + if (ph->get_type() == ST_RESET) return false; │ │ │ │ │ │ │ │ - // average of current rate and peak │ │ │ │ -// rate = (rate + m_download_rate_peak) / 2; │ │ │ │ + // #error send reset │ │ │ │ │ │ │ │ - return milliseconds((m_outstanding_bytes + extra_bytes │ │ │ │ - + m_queued_time_critical * t->block_size() * 1000) / rate); │ │ │ │ + return false; │ │ │ │ } │ │ │ │ │ │ │ │ - void peer_connection::add_stat(std::int64_t const downloaded, std::int64_t const uploaded) │ │ │ │ + void utp_socket_manager::subscribe_writable(utp_socket_impl* s) │ │ │ │ +
    relevance 0../src/torrent_handle.cpp:589support moving files into this call

    support moving files into this call

    ../src/torrent_handle.cpp:589

    		auto retp = &prio;
    │ │ │ │ +		sync_call(&torrent::piece_priorities, retp);
    │ │ │ │ +		std::vector<int> ret;
    │ │ │ │ +		ret.reserve(prio.size());
    │ │ │ │ +		for (auto p : prio)
    │ │ │ │ +			ret.push_back(int(static_cast<std::uint8_t>(p)));
    │ │ │ │ +		return ret;
    │ │ │ │ +	}
    │ │ │ │ +#endif
    │ │ │ │ +
    │ │ │ │ +	void torrent_handle::file_priority(file_index_t index, download_priority_t priority) const
    │ │ │ │  	{
    │ │ │ │ -		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ -		m_statistics.add_stat(downloaded, uploaded);
    │ │ │ │ +		async_call(&torrent::set_file_priority, index, priority);
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ -	sha1_hash peer_connection::associated_info_hash() const
    │ │ │ │ +	download_priority_t torrent_handle::file_priority(file_index_t index) const
    │ │ │ │  	{
    │ │ │ │ -		std::shared_ptr<torrent> t = associated_torrent().lock();
    │ │ │ │ -		TORRENT_ASSERT(t);
    │ │ │ │ -		auto const& ih = t->info_hash();
    │ │ │ │ -		// if protocol_v2 is set on the peer, this better be a v2 torrent,
    │ │ │ │ -		// otherwise something isn't right
    │ │ │ │ -
    relevance 0../src/peer_connection.cpp:3536sort the allowed fast set in priority order

    sort the allowed fast set in priority order

    ../src/peer_connection.cpp:3536

    │ │ │ │ -		// if the peer has the piece and we want
    │ │ │ │ -		// to download it, request it
    │ │ │ │ -		if (index < m_have_piece.end_index()
    │ │ │ │ -			&& m_have_piece[index]
    │ │ │ │ -			&& !t->have_piece(index)
    │ │ │ │ -			&& t->valid_metadata()
    │ │ │ │ -			&& t->has_picker()
    │ │ │ │ -			&& t->picker().piece_priority(index) > dont_download)
    │ │ │ │ -		{
    │ │ │ │ -			t->peer_is_interesting(*this);
    │ │ │ │ -		}
    │ │ │ │ +		return sync_call_ret<download_priority_t>(dont_download, &torrent::file_priority, index);
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ -	std::vector<piece_index_t> const& peer_connection::allowed_fast()
    │ │ │ │ +
    void torrent_handle::prioritize_files(std::vector<download_priority_t> const& files) const │ │ │ │ +
    { │ │ │ │ + async_call(&torrent::prioritize_files │ │ │ │ + , static_cast<aux::vector<download_priority_t, file_index_t> const&>(files)); │ │ │ │ + } │ │ │ │ + │ │ │ │ + std::vector<download_priority_t> torrent_handle::get_file_priorities() const │ │ │ │ { │ │ │ │ - TORRENT_ASSERT(is_single_thread()); │ │ │ │ - std::shared_ptr<torrent> t = m_torrent.lock(); │ │ │ │ - TORRENT_ASSERT(t); │ │ │ │ + aux::vector<download_priority_t, file_index_t> ret; │ │ │ │ + auto retp = &ret; │ │ │ │ + sync_call(&torrent::file_priorities, retp); │ │ │ │ + return TORRENT_RVO(ret); │ │ │ │ + } │ │ │ │ │ │ │ │ -
    return m_allowed_fast; │ │ │ │ -
    } │ │ │ │ +#if TORRENT_ABI_VERSION == 1 │ │ │ │ │ │ │ │ - bool peer_connection::can_request_time_critical() const │ │ │ │ +// ============ start deprecation =============== │ │ │ │ + │ │ │ │ + void torrent_handle::prioritize_files(std::vector<int> const& files) const │ │ │ │ { │ │ │ │ - TORRENT_ASSERT(is_single_thread()); │ │ │ │ - if (has_peer_choked() || !is_interesting()) return false; │ │ │ │ - if (int(m_download_queue.size()) + int(m_request_queue.size()) │ │ │ │ - > m_desired_queue_size * 2) return false; │ │ │ │ - if (on_parole()) return false; │ │ │ │ - if (m_disconnecting) return false; │ │ │ │ - std::shared_ptr<torrent> t = m_torrent.lock(); │ │ │ │ - TORRENT_ASSERT(t); │ │ │ │ - if (t->upload_mode()) return false; │ │ │ │ + aux::vector<download_priority_t, file_index_t> file_prio; │ │ │ │ + file_prio.reserve(files.size()); │ │ │ │ + for (auto const p : files) { │ │ │ │ + file_prio.push_back(download_priority_t(static_cast<std::uint8_t>(p))); │ │ │ │ + } │ │ │ │ + async_call(&torrent::prioritize_files, file_prio); │ │ │ │ + } │ │ │ │ │ │ │ │ - // ignore snubbed peers, since they're not likely to return pieces in a │ │ │ │ - // timely manner anyway │ │ │ │ - if (m_snubbed) return false; │ │ │ │ - return true; │ │ │ │ + std::vector<int> torrent_handle::file_priorities() const │ │ │ │ + { │ │ │ │ + aux::vector<download_priority_t, file_index_t> prio; │ │ │ │ +
    relevance 0../src/disabled_disk_io.cpp:106it would be nice to return a valid hash of zeroes here

    it would be nice to return a valid hash of zeroes here

    ../src/disabled_disk_io.cpp:106

    		});
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ -	bool peer_connection::make_time_critical(piece_block const& block)
    │ │ │ │ +	bool async_write(storage_index_t
    │ │ │ │ +		, peer_request const& r
    │ │ │ │ +		, char const*, std::shared_ptr<disk_observer>
    │ │ │ │ +		, std::function<void(storage_error const&)> handler
    │ │ │ │ +		, disk_job_flags_t) override
    │ │ │ │  	{
    │ │ │ │ -		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ -		auto const rit = std::find_if(m_request_queue.begin()
    │ │ │ │ -			, m_request_queue.end(), aux::has_block(block));
    │ │ │ │ -		if (rit == m_request_queue.end()) return false;
    │ │ │ │ -#if TORRENT_USE_ASSERTS
    │ │ │ │ -		std::shared_ptr<torrent> t = m_torrent.lock();
    │ │ │ │ -		TORRENT_ASSERT(t);
    │ │ │ │ -		TORRENT_ASSERT(t->has_picker());
    │ │ │ │ -
    relevance 0../src/performance_counters.cpp:40move stats_counter_t out of counters

    move stats_counter_t out of counters

    ../src/performance_counters.cpp:40

    relevance 0../src/performance_counters.cpp:41should bittorrent keep-alive messages have a counter too?

    should bittorrent keep-alive messages have a counter too?

    ../src/performance_counters.cpp:41

    relevance 0../src/performance_counters.cpp:42It would be nice if this could be an internal type. default_disk_constructor depends on it now

    It would be nice if this could be an internal type. default_disk_constructor depends on it now

    ../src/performance_counters.cpp:42

    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
    │ │ │ │ -AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    │ │ │ │ -IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
    │ │ │ │ -ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
    │ │ │ │ -LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
    │ │ │ │ -CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
    │ │ │ │ -SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
    │ │ │ │ -INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
    │ │ │ │ -CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    │ │ │ │ -ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    │ │ │ │ -POSSIBILITY OF SUCH DAMAGE.
    │ │ │ │ +		TORRENT_ASSERT(r.length <= default_block_size);
    │ │ │ │ +		TORRENT_UNUSED(r);
    │ │ │ │  
    │ │ │ │ -*/
    │ │ │ │ +		post(m_ios, [h = std::move(handler)] { h(storage_error{}); });
    │ │ │ │ +		return false;
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -#include "libtorrent/performance_counters.hpp"
    │ │ │ │ -#include "libtorrent/assert.hpp"
    │ │ │ │ -#include <cstring> // for memset
    │ │ │ │ +	void async_hash(storage_index_t
    │ │ │ │ +		, piece_index_t piece, span<sha256_hash>, disk_job_flags_t
    │ │ │ │ +		, std::function<void(piece_index_t, sha1_hash const&, storage_error const&)> handler) override
    │ │ │ │ +	{
    │ │ │ │ +
    post(m_ios, [h = std::move(handler), piece] { h(piece, sha1_hash{}, storage_error{}); }); │ │ │ │ +
    } │ │ │ │ │ │ │ │ -namespace libtorrent { │ │ │ │ + void async_hash2(storage_index_t, piece_index_t piece, int │ │ │ │ + , disk_job_flags_t │ │ │ │ + , std::function<void(piece_index_t, sha256_hash const&, storage_error const&)> handler) override │ │ │ │ + { │ │ │ │ + post(m_ios, [h = std::move(handler), piece]() { h(piece, sha256_hash{}, storage_error{}); }); │ │ │ │ + } │ │ │ │ │ │ │ │ -
    counters::counters() TORRENT_COUNTER_NOEXCEPT │ │ │ │ -
    { │ │ │ │ -#ifdef ATOMIC_LLONG_LOCK_FREE │ │ │ │ - for (auto& counter : m_stats_counter) │ │ │ │ - counter.store(0, std::memory_order_relaxed); │ │ │ │ -#else │ │ │ │ - m_stats_counter.fill(0); │ │ │ │ -#endif │ │ │ │ + void async_move_storage(storage_index_t │ │ │ │ + , std::string p, move_flags_t │ │ │ │ + , std::function<void(status_t, std::string const&, storage_error const&)> handler) override │ │ │ │ + { │ │ │ │ + post(m_ios, [h = std::move(handler), path = std::move(p)] () mutable │ │ │ │ + { h(status_t::no_error, std::move(path), storage_error{}); }); │ │ │ │ } │ │ │ │ │ │ │ │ - counters::counters(counters const& c) TORRENT_COUNTER_NOEXCEPT │ │ │ │ + void async_release_files(storage_index_t, std::function<void()> handler) override │ │ │ │ { │ │ │ │ -#ifdef ATOMIC_LLONG_LOCK_FREE │ │ │ │ - for (int i = 0; i < m_stats_counter.end_index(); ++i) │ │ │ │ - m_stats_counter[i].store( │ │ │ │ - c.m_stats_counter[i].load(std::memory_order_relaxed) │ │ │ │ - , std::memory_order_relaxed); │ │ │ │ -#else │ │ │ │ - std::lock_guard<std::mutex> l(c.m_mutex); │ │ │ │ - m_stats_counter = c.m_stats_counter; │ │ │ │ -#endif │ │ │ │ + post(m_ios, [h = std::move(handler)] { h(); }); │ │ │ │ } │ │ │ │ │ │ │ │ - counters& counters::operator=(counters const& c) & TORRENT_COUNTER_NOEXCEPT │ │ │ │ + void async_delete_files(storage_index_t │ │ │ │ + , remove_flags_t, std::function<void(storage_error const&)> handler) override │ │ │ │ { │ │ │ │ - if (&c == this) return *this; │ │ │ │ -#ifdef ATOMIC_LLONG_LOCK_FREE │ │ │ │ - for (int i = 0; i < m_stats_counter.end_index(); ++i) │ │ │ │ - m_stats_counter[i].store( │ │ │ │ - c.m_stats_counter[i].load(std::memory_order_relaxed) │ │ │ │ - , std::memory_order_relaxed); │ │ │ │ -
    relevance 0../src/piece_picker.cpp:121find a better place for this

    find a better place for this

    ../src/piece_picker.cpp:121

    			if (limit == 0)
    │ │ │ │ +		post(m_ios, [h = std::move(handler)] { h(storage_error{}); });
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +	void async_check_files(storage_index_t
    │ │ │ │ +		, add_torrent_params const*
    │ │ │ │ +
    relevance 0../src/piece_picker.cpp:121find a better place for this

    find a better place for this

    ../src/piece_picker.cpp:121

    			if (limit == 0)
    │ │ │ │  			{
    │ │ │ │  				std::cerr << " ...";
    │ │ │ │  				break;
    │ │ │ │  			}
    │ │ │ │  			if (*i == -1) break;
    │ │ │ │  			while (j != p.m_priority_boundaries.end() && *j <= index)
    │ │ │ │  			{
    │ │ │ │ @@ -8107,15 +8757,15 @@
    │ │ │ │  	constexpr int max_piece_affinity_extent = 4 * 1024 * 1024 / default_block_size;
    │ │ │ │  
    │ │ │ │  	piece_picker::piece_picker(std::int64_t const total_size, int const piece_size)
    │ │ │ │  		: m_priority_boundaries(1, m_pieces.end_index())
    │ │ │ │  	{
    │ │ │ │  		TORRENT_ASSERT(total_size > 0);
    │ │ │ │  		TORRENT_ASSERT(piece_size > 0);
    │ │ │ │ -
    relevance 0../src/piece_picker.cpp:2067this could probably be optimized by incrementally calling partial_sort to sort one more element in the list. Because chances are that we'll just need a single piece, and once we've picked from it we're done. Sorting the rest of the list in that case is a waste of time.

    this could probably be optimized by incrementally │ │ │ │ +relevance 0../src/piece_picker.cpp:2067this could probably be optimized by incrementally calling partial_sort to sort one more element in the list. Because chances are that we'll just need a single piece, and once we've picked from it we're done. Sorting the rest of the list in that case is a waste of time.

    this could probably be optimized by incrementally │ │ │ │ calling partial_sort to sort one more element in the list. Because │ │ │ │ chances are that we'll just need a single piece, and once we've │ │ │ │ picked from it we're done. Sorting the rest of the list in that │ │ │ │ case is a waste of time.

    ../src/piece_picker.cpp:2067

    			// now, copy over the pointers. We also apply a filter here to not
    │ │ │ │  			// include ineligible pieces in certain modes. For instance, a piece
    │ │ │ │  			// that the current peer doesn't have is not included.
    │ │ │ │  			for (auto& dp : m_downloads[piece_pos::piece_downloading])
    │ │ │ │ @@ -8162,15 +8812,15 @@
    │ │ │ │  			if (num_blocks <= 0) return ret;
    │ │ │ │  		}
    │ │ │ │  
    │ │ │ │  		if (!suggested_pieces.empty())
    │ │ │ │  		{
    │ │ │ │  			for (piece_index_t i : suggested_pieces)
    │ │ │ │  			{
    │ │ │ │ -
    relevance 0../src/piece_picker.cpp:2211Is it a good idea that this affinity takes precedence over piece priority?

    Is it a good idea that this affinity takes precedence over │ │ │ │ +relevance 0../src/piece_picker.cpp:2211Is it a good idea that this affinity takes precedence over piece priority?

    Is it a good idea that this affinity takes precedence over │ │ │ │ piece priority?

    ../src/piece_picker.cpp:2211

    					prio_index_t const end = priority_end(i);
    │ │ │ │  					for (prio_index_t p = prev(end); p >= start; --p)
    │ │ │ │  					{
    │ │ │ │  						pc.inc_stats_counter(counters::piece_picker_reverse_rare_loops);
    │ │ │ │  
    │ │ │ │  						if (!is_piece_free(m_pieces[p], pieces)) continue;
    │ │ │ │  
    │ │ │ │ @@ -8214,15 +8864,15 @@
    │ │ │ │  								return ret;
    │ │ │ │  							}
    │ │ │ │  						}
    │ │ │ │  						// if we have all pieces belonging to this extent, remove it
    │ │ │ │  						if (have_all) to_erase = idx;
    │ │ │ │  					}
    │ │ │ │  					if (to_erase != -1) m_recent_extents.erase(m_recent_extents.begin() + to_erase);
    │ │ │ │ -
    relevance 0../src/piece_picker.cpp:2566when expanding pieces for cache stripe reasons, the !downloading condition doesn't make much sense

    when expanding pieces for cache stripe reasons, │ │ │ │ +relevance 0../src/piece_picker.cpp:2566when expanding pieces for cache stripe reasons, the !downloading condition doesn't make much sense

    when expanding pieces for cache stripe reasons, │ │ │ │ the !downloading condition doesn't make much sense

    ../src/piece_picker.cpp:2566

    		TORRENT_ASSERT(index < m_piece_map.end_index());
    │ │ │ │  		if (next(index) == m_piece_map.end_index())
    │ │ │ │  			return m_blocks_in_last_piece;
    │ │ │ │  		else
    │ │ │ │  			return blocks_per_piece();
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ @@ -8261,15 +8911,15 @@
    │ │ │ │  		}
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │  	// the first bool is true if this is the only peer that has requested and downloaded
    │ │ │ │  	// blocks from this piece.
    │ │ │ │  	// the second bool is true if this is the only active peer that is requesting
    │ │ │ │  	// and downloading blocks from this piece. Active means having a connection.
    │ │ │ │ -
    relevance 0../src/piece_picker.cpp:3144should 5 be configurable?

    should 5 be configurable?

    ../src/piece_picker.cpp:3144

    		bool have_all = true;
    │ │ │ │ +
    relevance 0../src/piece_picker.cpp:3144should 5 be configurable?

    should 5 be configurable?

    ../src/piece_picker.cpp:3144

    		bool have_all = true;
    │ │ │ │  
    │ │ │ │  		for (auto const piece : extent_for(this_extent))
    │ │ │ │  		{
    │ │ │ │  			if (piece == p) continue;
    │ │ │ │  
    │ │ │ │  			if (!m_piece_map[piece].have()) have_all = false;
    │ │ │ │  
    │ │ │ │ @@ -8312,1059 +8962,371 @@
    │ │ │ │  		TORRENT_ASSERT(!m_piece_map[block.piece_index].have());
    │ │ │ │  
    │ │ │ │  		piece_pos& p = m_piece_map[block.piece_index];
    │ │ │ │  		if (p.download_queue() == piece_pos::piece_open)
    │ │ │ │  		{
    │ │ │ │  #ifdef TORRENT_EXPENSIVE_INVARIANT_CHECKS
    │ │ │ │  			INVARIANT_CHECK;
    │ │ │ │ -
    relevance 0../src/create_torrent.cpp:618this can be optimized

    this can be optimized

    ../src/create_torrent.cpp:618

    		std::string& attr = e["attr"].string();
    │ │ │ │ -		if (flags & file_storage::flag_pad_file) attr += 'p';
    │ │ │ │ -		if (flags & file_storage::flag_hidden) attr += 'h';
    │ │ │ │ -		if (flags & file_storage::flag_executable) attr += 'x';
    │ │ │ │ -		if (include_symlinks && (flags & file_storage::flag_symlink)) attr += 'l';
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -	void add_symlink_path(entry& e, std::string symlink_path)
    │ │ │ │ -	{
    │ │ │ │ -		entry& sympath_e = e["symlink path"];
    │ │ │ │ +
    relevance 0../src/settings_pack.cpp:305deprecate this

    deprecate this

    ../src/settings_pack.cpp:305

    		SET(outgoing_port, 0, nullptr),
    │ │ │ │ +		SET(num_outgoing_ports, 0, nullptr),
    │ │ │ │ +		SET(peer_dscp, 0x04, &session_impl::update_peer_dscp),
    │ │ │ │ +		SET(active_downloads, 3, &session_impl::trigger_auto_manage),
    │ │ │ │ +		SET(active_seeds, 5, &session_impl::trigger_auto_manage),
    │ │ │ │ +		SET(active_checking, 1, &session_impl::trigger_auto_manage),
    │ │ │ │ +		SET(active_dht_limit, 88, nullptr),
    │ │ │ │ +		SET(active_tracker_limit, 1600, nullptr),
    │ │ │ │ +		SET(active_lsd_limit, 60, nullptr),
    │ │ │ │ +		SET(active_limit, 500, &session_impl::trigger_auto_manage),
    │ │ │ │ +		DEPRECATED_SET(active_loaded_limit, 0, &session_impl::trigger_auto_manage),
    │ │ │ │ +		SET(auto_manage_interval, 30, nullptr),
    │ │ │ │ +		SET(seed_time_limit, 24 * 60 * 60, nullptr),
    │ │ │ │ +		SET(auto_scrape_interval, 1800, nullptr),
    │ │ │ │ +		SET(auto_scrape_min_interval, 300, nullptr),
    │ │ │ │ +		SET(max_peerlist_size, 3000, nullptr),
    │ │ │ │ +		SET(max_paused_peerlist_size, 1000, nullptr),
    │ │ │ │ +		SET(min_announce_interval, 5 * 60, nullptr),
    │ │ │ │ +		SET(auto_manage_startup, 60, nullptr),
    │ │ │ │ +		SET(seeding_piece_quota, 20, nullptr),
    │ │ │ │ +
    SET(max_rejects, 50, nullptr), │ │ │ │ +
    SET(recv_socket_buffer_size, 0, &session_impl::update_socket_buffer_size), │ │ │ │ + SET(send_socket_buffer_size, 0, &session_impl::update_socket_buffer_size), │ │ │ │ + SET(max_peer_recv_buffer_size, 2 * 1024 * 1024, nullptr), │ │ │ │ + DEPRECATED_SET(file_checks_delay_per_block, 0, nullptr), │ │ │ │ + DEPRECATED2_SET(read_cache_line_size, 32, nullptr), │ │ │ │ + DEPRECATED2_SET(write_cache_line_size, 16, nullptr), │ │ │ │ + SET(optimistic_disk_retry, 10 * 60, nullptr), │ │ │ │ + SET(max_suggest_pieces, 16, nullptr), │ │ │ │ + SET(local_service_announce_interval, 5 * 60, nullptr), │ │ │ │ + SET(dht_announce_interval, 15 * 60, &session_impl::update_dht_announce_interval), │ │ │ │ + SET(udp_tracker_token_expiry, 60, nullptr), │ │ │ │ + DEPRECATED_SET(default_cache_min_age, 1, nullptr), │ │ │ │ + SET(num_optimistic_unchoke_slots, 0, nullptr), │ │ │ │ + DEPRECATED_SET(default_est_reciprocation_rate, 16000, nullptr), │ │ │ │ + DEPRECATED_SET(increase_est_reciprocation_rate, 20, nullptr), │ │ │ │ + DEPRECATED_SET(decrease_est_reciprocation_rate, 3, nullptr), │ │ │ │ + SET(max_pex_peers, 50, nullptr), │ │ │ │ + SET(tick_interval, 500, nullptr), │ │ │ │ + SET(share_mode_target, 3, nullptr), │ │ │ │ + SET(upload_rate_limit, 0, &session_impl::update_upload_rate), │ │ │ │ + SET(download_rate_limit, 0, &session_impl::update_download_rate), │ │ │ │ + DEPRECATED_SET(local_upload_rate_limit, 0, &session_impl::update_local_upload_rate), │ │ │ │ + DEPRECATED_SET(local_download_rate_limit, 0, &session_impl::update_local_download_rate), │ │ │ │ + SET(dht_upload_rate_limit, 8000, &session_impl::update_dht_upload_rate_limit), │ │ │ │ + SET(unchoke_slots_limit, 8, &session_impl::update_unchoke_limit), │ │ │ │ + DEPRECATED_SET(half_open_limit, 0, nullptr), │ │ │ │ + SET(connections_limit, 200, &session_impl::update_connections_limit), │ │ │ │ + SET(connections_slack, 10, nullptr), │ │ │ │ + SET(utp_target_delay, 100, nullptr), │ │ │ │ + SET(utp_gain_factor, 3000, nullptr), │ │ │ │ +
    relevance 0../src/settings_pack.cpp:590it would be nice to reserve() these vectors up front

    it would be nice to reserve() these vectors up front

    ../src/settings_pack.cpp:590

    			s.set_str(settings_pack::string_type_base | i, str_settings[i].default_value);
    │ │ │ │ +			TORRENT_ASSERT(s.get_str(settings_pack::string_type_base + i) == str_settings[i].default_value);
    │ │ │ │ +		}
    │ │ │ │  
    │ │ │ │ -		std::string const link = lexically_relative("", symlink_path);
    │ │ │ │ -		for (auto elems = lsplit_path(link); !elems.first.empty();
    │ │ │ │ -			elems = lsplit_path(elems.second))
    │ │ │ │ -			sympath_e.list().emplace_back(elems.first);
    │ │ │ │ -	}
    │ │ │ │ -}
    │ │ │ │ +		for (int i = 0; i < settings_pack::num_int_settings; ++i)
    │ │ │ │ +		{
    │ │ │ │ +			s.set_int(settings_pack::int_type_base | i, int_settings[i].default_value);
    │ │ │ │ +			TORRENT_ASSERT(s.get_int(settings_pack::int_type_base + i) == int_settings[i].default_value);
    │ │ │ │ +		}
    │ │ │ │  
    │ │ │ │ -	std::vector<char> create_torrent::generate_buf() const
    │ │ │ │ -	{
    │ │ │ │ -
    std::vector<char> ret; │ │ │ │ -
    bencode(std::back_inserter(ret), generate()); │ │ │ │ - return ret; │ │ │ │ + for (int i = 0; i < settings_pack::num_bool_settings; ++i) │ │ │ │ + { │ │ │ │ + s.set_bool(settings_pack::bool_type_base | i, bool_settings[i].default_value); │ │ │ │ + TORRENT_ASSERT(s.get_bool(settings_pack::bool_type_base + i) == bool_settings[i].default_value); │ │ │ │ + } │ │ │ │ } │ │ │ │ │ │ │ │ - entry create_torrent::generate() const │ │ │ │ + settings_pack default_settings() │ │ │ │ { │ │ │ │ - if (m_files.num_files() == 0 || m_files.total_size() == 0) │ │ │ │ - aux::throw_ex<system_error>(errors::torrent_missing_file_tree); │ │ │ │ - │ │ │ │ - // if all v2 hashes are set correctly, generate the v2 parts of the │ │ │ │ - // torrent │ │ │ │ - bool const make_v2 = validate_v2_hashes(m_files, m_file_piece_hash); │ │ │ │ - bool const make_v1 = validate_v1_hashes(m_files, m_piece_hash); │ │ │ │ - │ │ │ │ - // if neither v1 nor v2 hashes were set, we can't create a torrent │ │ │ │ - if (!make_v1 && !make_v2) │ │ │ │ - aux::throw_ex<system_error>(errors::invalid_hash_entry); │ │ │ │ - │ │ │ │ - TORRENT_ASSERT(m_files.piece_length() > 0); │ │ │ │ - │ │ │ │ - entry dict; │ │ │ │ - │ │ │ │ - if (!m_urls.empty()) dict["announce"] = m_urls.front().first; │ │ │ │ + settings_pack ret; │ │ │ │ +
    for (int i = 0; i < settings_pack::num_string_settings; ++i) │ │ │ │ +
    { │ │ │ │ + if (str_settings[i].default_value == nullptr) continue; │ │ │ │ + ret.set_str(settings_pack::string_type_base + i, str_settings[i].default_value); │ │ │ │ + } │ │ │ │ │ │ │ │ - if (!m_nodes.empty()) │ │ │ │ + for (int i = 0; i < settings_pack::num_int_settings; ++i) │ │ │ │ { │ │ │ │ - entry& nodes = dict["nodes"]; │ │ │ │ - entry::list_type& nodes_list = nodes.list(); │ │ │ │ - for (auto const& n : m_nodes) │ │ │ │ - { │ │ │ │ -
    relevance 0../src/torrent.cpp:1951this could be optimized by looking up which files are complete and just look at those

    this could be optimized by looking up which files are │ │ │ │ -complete and just look at those

    ../src/torrent.cpp:1951

    //				TORRENT_ASSERT(picker().have_piece(i));
    │ │ │ │ -				we_have(i);
    │ │ │ │ -			}
    │ │ │ │ +			ret.set_int(settings_pack::int_type_base + i, int_settings[i].default_value);
    │ │ │ │  		}
    │ │ │ │  
    │ │ │ │ -		set_state(torrent_status::checking_resume_data);
    │ │ │ │ -
    │ │ │ │ -		aux::vector<std::string, file_index_t> links;
    │ │ │ │ -#ifndef TORRENT_DISABLE_MUTABLE_TORRENTS
    │ │ │ │ -		if (!m_torrent_file->similar_torrents().empty()
    │ │ │ │ -			|| !m_torrent_file->collections().empty())
    │ │ │ │ +		for (int i = 0; i < settings_pack::num_bool_settings; ++i)
    │ │ │ │  		{
    │ │ │ │ -			resolve_links res(m_torrent_file);
    │ │ │ │ -
    │ │ │ │ -			for (auto const& ih : m_torrent_file->similar_torrents())
    │ │ │ │ -			{
    │ │ │ │ -				std::shared_ptr<torrent> t = m_ses.find_torrent(info_hash_t(ih)).lock();
    │ │ │ │ -				if (!t) continue;
    │ │ │ │ -
    │ │ │ │ -				// Only attempt to reuse files from torrents that are seeding.
    │ │ │ │ -
    if (!t->is_seed()) continue; │ │ │ │ -
    │ │ │ │ - res.match(t->get_torrent_file(), t->save_path()); │ │ │ │ - } │ │ │ │ - for (auto const& c : m_torrent_file->collections()) │ │ │ │ - { │ │ │ │ - std::vector<std::shared_ptr<torrent>> ts = m_ses.find_collection(c); │ │ │ │ - │ │ │ │ - for (auto const& t : ts) │ │ │ │ - { │ │ │ │ - // Only attempt to reuse files from torrents that are seeding. │ │ │ │ -
    relevance 0../src/torrent.cpp:1964this could be optimized by looking up which files are complete and just look at those

    this could be optimized by looking up which files are │ │ │ │ -complete and just look at those

    ../src/torrent.cpp:1964

    		{
    │ │ │ │ -			resolve_links res(m_torrent_file);
    │ │ │ │ -
    │ │ │ │ -			for (auto const& ih : m_torrent_file->similar_torrents())
    │ │ │ │ -			{
    │ │ │ │ -				std::shared_ptr<torrent> t = m_ses.find_torrent(info_hash_t(ih)).lock();
    │ │ │ │ -				if (!t) continue;
    │ │ │ │ -
    │ │ │ │ -				// Only attempt to reuse files from torrents that are seeding.
    │ │ │ │ -				if (!t->is_seed()) continue;
    │ │ │ │ -
    │ │ │ │ -				res.match(t->get_torrent_file(), t->save_path());
    │ │ │ │ -			}
    │ │ │ │ -			for (auto const& c : m_torrent_file->collections())
    │ │ │ │ -			{
    │ │ │ │ -				std::vector<std::shared_ptr<torrent>> ts = m_ses.find_collection(c);
    │ │ │ │ -
    │ │ │ │ -				for (auto const& t : ts)
    │ │ │ │ -				{
    │ │ │ │ -					// Only attempt to reuse files from torrents that are seeding.
    │ │ │ │ -
    if (!t->is_seed()) continue; │ │ │ │ -
    │ │ │ │ - res.match(t->get_torrent_file(), t->save_path()); │ │ │ │ - } │ │ │ │ - } │ │ │ │ - │ │ │ │ - std::vector<resolve_links::link_t> const& l = res.get_links(); │ │ │ │ - if (!l.empty()) │ │ │ │ - { │ │ │ │ - links.resize(m_torrent_file->files().num_files()); │ │ │ │ - for (auto const& i : l) │ │ │ │ - { │ │ │ │ - if (!i.ti) continue; │ │ │ │ - links[i.file_idx] = combine_path(i.save_path │ │ │ │ - , i.ti->files().file_path(i.file_idx)); │ │ │ │ - } │ │ │ │ - } │ │ │ │ + ret.set_bool(settings_pack::bool_type_base + i, bool_settings[i].default_value); │ │ │ │ } │ │ │ │ -#endif // TORRENT_DISABLE_MUTABLE_TORRENTS │ │ │ │ + return ret; │ │ │ │ + } │ │ │ │ │ │ │ │ -#if TORRENT_USE_ASSERTS │ │ │ │ - TORRENT_ASSERT(m_outstanding_check_files == false); │ │ │ │ - m_outstanding_check_files = true; │ │ │ │ -#endif │ │ │ │ + void apply_pack(settings_pack const* pack, aux::session_settings& sett │ │ │ │ + , aux::session_impl* ses) │ │ │ │ + { │ │ │ │ + using fun_t = void (aux::session_impl::*)(); │ │ │ │ + std::vector<fun_t> callbacks; │ │ │ │ │ │ │ │ - if (!m_add_torrent_params || !(m_add_torrent_params->flags & torrent_flags::no_verify_files)) │ │ │ │ + sett.bulk_set([&](aux::session_settings_single_thread& s) │ │ │ │ { │ │ │ │ - m_ses.disk_thread().async_check_files( │ │ │ │ - m_storage, m_add_torrent_params ? m_add_torrent_params.get() : nullptr │ │ │ │ - , std::move(links), [self = shared_from_this()](status_t st, storage_error const& error) │ │ │ │ - { self->on_resume_data_checked(st, error); }); │ │ │ │ -
    relevance 0../src/torrent.cpp:2728this pattern is repeated in a few places. Factor this into a function and generalize the concept of a torrent having a dedicated listen port

    this pattern is repeated in a few places. Factor this into │ │ │ │ -a function and generalize the concept of a torrent having a │ │ │ │ -dedicated listen port

    ../src/torrent.cpp:2728

    		// not ready for peers. Except, if we don't have metadata,
    │ │ │ │ -		// we need peers to download from
    │ │ │ │ -		if (!m_files_checked && valid_metadata()) return;
    │ │ │ │ -
    │ │ │ │ -		if (!m_announce_to_lsd) return;
    │ │ │ │ +			apply_pack_impl(pack, s, ses ? &callbacks : nullptr);
    │ │ │ │ +		});
    │ │ │ │  
    │ │ │ │ -		// private torrents are never announced on LSD
    │ │ │ │ -		if (m_torrent_file->is_valid() && m_torrent_file->priv()) return;
    │ │ │ │ +		// call the callbacks once all the settings have been applied, and
    │ │ │ │ +		// only once per callback
    │ │ │ │ +
    relevance 0../src/session_handle.cpp:499in C++14, use unique_ptr and move it into the lambda

    in C++14, use unique_ptr and move it into the lambda

    ../src/session_handle.cpp:499

    #ifndef BOOST_NO_EXCEPTIONS
    │ │ │ │ +		if (params.save_path.empty())
    │ │ │ │ +			aux::throw_ex<system_error>(error_code(errors::invalid_save_path));
    │ │ │ │ +#else
    │ │ │ │ +		TORRENT_ASSERT_PRECOND(!params.save_path.empty());
    │ │ │ │ +#endif
    │ │ │ │  
    │ │ │ │ -#if TORRENT_USE_I2P
    │ │ │ │ -		// i2p torrents are also never announced on LSD
    │ │ │ │ -		// unless we allow mixed swarms
    │ │ │ │ -		if (is_i2p() && !settings().get_bool(settings_pack::allow_i2p_mixed))
    │ │ │ │ -			return;
    │ │ │ │ +#if TORRENT_ABI_VERSION < 3
    │ │ │ │ +		if (!params.info_hashes.has_v1() && !params.info_hashes.has_v2() && !params.ti)
    │ │ │ │ +			params.info_hashes.v1 = params.info_hash;
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │ -		if (is_paused()) return;
    │ │ │ │ +		// the internal torrent object keeps and mutates state in the
    │ │ │ │ +		// torrent_info object. We can't let that leak back to the client
    │ │ │ │ +		if (params.ti)
    │ │ │ │ +			params.ti = std::make_shared<torrent_info>(*params.ti);
    │ │ │ │  
    │ │ │ │ -		if (!m_ses.has_lsd()) return;
    │ │ │ │ +		// we cannot capture a unique_ptr into a lambda in c++11, so we use a raw
    │ │ │ │ +		// pointer for now. async_call uses a lambda expression to post the call
    │ │ │ │ +		// to the main thread
    │ │ │ │ +
    auto* p = new add_torrent_params(std::move(params)); │ │ │ │ +
    auto guard = aux::scope_end([p]{ delete p; }); │ │ │ │ + p->save_path = complete(p->save_path); │ │ │ │ │ │ │ │ -
    #ifdef TORRENT_SSL_PEERS │ │ │ │ -
    int port = is_ssl_torrent() ? m_ses.ssl_listen_port() : m_ses.listen_port(); │ │ │ │ -#else │ │ │ │ - int port = m_ses.listen_port(); │ │ │ │ +#if TORRENT_ABI_VERSION == 1 │ │ │ │ + handle_backwards_compatible_resume_data(*p); │ │ │ │ #endif │ │ │ │ │ │ │ │ - // announce with the local discovery service │ │ │ │ - m_torrent_file->info_hashes().for_each([&](sha1_hash const& ih, protocol_version) │ │ │ │ - { │ │ │ │ - m_ses.announce_lsd(ih, port); │ │ │ │ - }); │ │ │ │ + async_call(&session_impl::async_add_torrent, p); │ │ │ │ + guard.disarm(); │ │ │ │ } │ │ │ │ │ │ │ │ -#ifndef TORRENT_DISABLE_DHT │ │ │ │ - │ │ │ │ - void torrent::dht_announce() │ │ │ │ +#ifndef BOOST_NO_EXCEPTIONS │ │ │ │ +#if TORRENT_ABI_VERSION == 1 │ │ │ │ + // if the torrent already exists, this will throw duplicate_torrent │ │ │ │ + torrent_handle session_handle::add_torrent( │ │ │ │ + torrent_info const& ti │ │ │ │ + , std::string const& save_path │ │ │ │ + , entry const& resume_data │ │ │ │ + , storage_mode_t storage_mode │ │ │ │ + , bool const add_paused) │ │ │ │ { │ │ │ │ - TORRENT_ASSERT(is_single_thread()); │ │ │ │ - if (!m_ses.dht()) │ │ │ │ + add_torrent_params p; │ │ │ │ + p.ti = std::make_shared<torrent_info>(ti); │ │ │ │ + p.save_path = save_path; │ │ │ │ + if (resume_data.type() != entry::undefined_t) │ │ │ │ { │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - debug_log("DHT: no dht initialized"); │ │ │ │ -#endif │ │ │ │ - return; │ │ │ │ + bencode(std::back_inserter(p.resume_data), resume_data); │ │ │ │ } │ │ │ │ - if (!should_announce_dht()) │ │ │ │ - { │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - if (should_log()) │ │ │ │ - { │ │ │ │ + p.storage_mode = storage_mode; │ │ │ │ + if (add_paused) p.flags |= add_torrent_params::flag_paused; │ │ │ │ +
    relevance 0../src/torrent_peer.cpp:192how do we deal with our external address changing?

    how do we deal with our external address changing?

    ../src/torrent_peer.cpp:192

    		// connections. If it fails, we'll
    │ │ │ │ +		// retry with encryption
    │ │ │ │ +		, pe_support(false)
    │ │ │ │ +#endif
    │ │ │ │ +		, is_v6_addr(false)
    │ │ │ │  #if TORRENT_USE_I2P
    │ │ │ │ -
    relevance 0../src/torrent.cpp:3885add one peer per IP the hostname resolves to

    add one peer per IP the hostname resolves to

    ../src/torrent.cpp:3885

    	catch (...) { handle_exception(); }
    │ │ │ │ +		, is_i2p_addr(false)
    │ │ │ │  #endif
    │ │ │ │ +		, on_parole(false)
    │ │ │ │ +		, banned(false)
    │ │ │ │ +		, supports_utp(true) // assume peers support utp
    │ │ │ │ +		, confirmed_supports_utp(false)
    │ │ │ │ +		, supports_holepunch(false)
    │ │ │ │ +		, web_seed(false)
    │ │ │ │ +		, protocol_v2(false)
    │ │ │ │ +	{}
    │ │ │ │  
    │ │ │ │ -	void torrent::on_peer_name_lookup(error_code const& e
    │ │ │ │ -		, std::vector<address> const& host_list, int const port
    │ │ │ │ -		, protocol_version const v) try
    │ │ │ │ +	std::uint32_t torrent_peer::rank(external_ip const& external, int external_port) const
    │ │ │ │  	{
    │ │ │ │ -		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ -
    │ │ │ │ -		INVARIANT_CHECK;
    │ │ │ │ -
    │ │ │ │ -		COMPLETE_ASYNC("torrent::on_peer_name_lookup");
    │ │ │ │ +		TORRENT_ASSERT(in_use);
    │ │ │ │ +
    if (peer_rank == 0) │ │ │ │ +
    peer_rank = peer_priority( │ │ │ │ + tcp::endpoint(external.external_address(this->address()), std::uint16_t(external_port)) │ │ │ │ + , tcp::endpoint(this->address(), this->port)); │ │ │ │ + return peer_rank; │ │ │ │ + } │ │ │ │ │ │ │ │ #ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - if (e && should_log()) │ │ │ │ - debug_log("peer name lookup error: %s", e.message().c_str()); │ │ │ │ + std::string torrent_peer::to_string() const │ │ │ │ + { │ │ │ │ + TORRENT_ASSERT(in_use); │ │ │ │ +#if TORRENT_USE_I2P │ │ │ │ + if (is_i2p_addr) return dest().to_string(); │ │ │ │ +#endif // TORRENT_USE_I2P │ │ │ │ + return address().to_string(); │ │ │ │ + } │ │ │ │ #endif │ │ │ │ │ │ │ │ - if (e || m_abort || host_list.empty() || m_ses.is_aborted()) return; │ │ │ │ - │ │ │ │ -
    tcp::endpoint host(host_list.front(), std::uint16_t(port)); │ │ │ │ -
    │ │ │ │ - if (m_ip_filter && m_ip_filter->access(host.address()) & ip_filter::blocked) │ │ │ │ + std::int64_t torrent_peer::total_download() const │ │ │ │ + { │ │ │ │ + TORRENT_ASSERT(in_use); │ │ │ │ + if (connection != nullptr) │ │ │ │ { │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - if (should_log()) │ │ │ │ - { │ │ │ │ - debug_log("blocked ip from tracker: %s", host.address().to_string().c_str()); │ │ │ │ - } │ │ │ │ -#endif │ │ │ │ - if (m_ses.alerts().should_post<peer_blocked_alert>()) │ │ │ │ - m_ses.alerts().emplace_alert<peer_blocked_alert>(get_handle() │ │ │ │ - , host, peer_blocked_alert::ip_filter); │ │ │ │ - return; │ │ │ │ + TORRENT_ASSERT(prev_amount_download == 0); │ │ │ │ + return connection->statistics().total_payload_download(); │ │ │ │ } │ │ │ │ - │ │ │ │ - if (add_peer(host, peer_info::tracker, v == protocol_version::V2 ? pex_lt_v2 : pex_flags_t(0))) │ │ │ │ + else │ │ │ │ { │ │ │ │ - state_updated(); │ │ │ │ - │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - if (should_log()) │ │ │ │ - { │ │ │ │ - debug_log("name-lookup add_peer() [ %s ] connect-candidates: %d" │ │ │ │ - , host.address().to_string().c_str() │ │ │ │ - , m_peer_list ? m_peer_list->num_connect_candidates() : -1); │ │ │ │ - } │ │ │ │ -#endif │ │ │ │ + return std::int64_t(prev_amount_download) << 10; │ │ │ │ } │ │ │ │ - update_want_peers(); │ │ │ │ } │ │ │ │ -
    relevance 0../src/torrent.cpp:4581only do this if the piece size > 1 blocks This is a v2 torrent so we can request get block level hashes.

    only do this if the piece size > 1 blocks │ │ │ │ -This is a v2 torrent so we can request get block │ │ │ │ -level hashes.

    ../src/torrent.cpp:4581

    		{
    │ │ │ │ -			std::set<torrent_peer*> ret;
    │ │ │ │ -			if (!blocks.empty() && !downloaders.empty())
    │ │ │ │ -			{
    │ │ │ │ -				for (auto const b : blocks) ret.insert(downloaders[std::size_t(b)]);
    │ │ │ │ -			}
    │ │ │ │ -			else
    │ │ │ │ -			{
    │ │ │ │ -				std::copy(downloaders.begin(), downloaders.end(), std::inserter(ret, ret.begin()));
    │ │ │ │ -			}
    │ │ │ │ -			return ret;
    │ │ │ │ -		}();
    │ │ │ │ -
    │ │ │ │ -		// if this piece wasn't downloaded from peers, we just found it on disk.
    │ │ │ │ -		// In that case, we should just consider it as "not-have" and there's no
    │ │ │ │ -		// need to try to get higher fidelity hashes (yet)
    │ │ │ │ -		bool const found_on_disk = peers.size() == 1 && peers.count(nullptr);
    │ │ │ │ -
    │ │ │ │ -		if (!torrent_file().info_hashes().has_v1() && blocks.empty() && !found_on_disk)
    │ │ │ │ -		{
    │ │ │ │ -
    verify_block_hashes(index); │ │ │ │ -
    } │ │ │ │ - │ │ │ │ - // the below code is penalizing peers that sent use bad data. │ │ │ │ - // increase the total amount of failed bytes │ │ │ │ - if (!found_on_disk) │ │ │ │ - { │ │ │ │ - if (blocks.empty()) │ │ │ │ - add_failed_bytes(m_torrent_file->piece_size(index)); │ │ │ │ - else │ │ │ │ - add_failed_bytes(static_cast<int>(blocks.size()) * default_block_size); │ │ │ │ - │ │ │ │ -#ifndef TORRENT_DISABLE_EXTENSIONS │ │ │ │ - for (auto& ext : m_extensions) │ │ │ │ - { │ │ │ │ - ext->on_piece_failed(index); │ │ │ │ - } │ │ │ │ -#endif │ │ │ │ - │ │ │ │ - // did we receive this piece from a single peer? │ │ │ │ - // if we know exactly which blocks failed the hash, we can also be certain │ │ │ │ - // that all peers in the list sent us bad data │ │ │ │ - bool const known_bad_peer = (!found_on_disk && peers.size() == 1) || !blocks.empty(); │ │ │ │ - │ │ │ │ - penalize_peers(peers, index, known_bad_peer); │ │ │ │ - } │ │ │ │ +
    relevance 0../src/peer_connection.cpp:1105this should be the global download rate

    this should be the global download rate

    ../src/peer_connection.cpp:1105

    │ │ │ │ +		int rate = 0;
    │ │ │ │  
    │ │ │ │ -		// If m_storage isn't set here, it means we're shutting down
    │ │ │ │ -		if (m_storage)
    │ │ │ │ +		// if we haven't received any data recently, the current download rate
    │ │ │ │ +		// is not representative
    │ │ │ │ +		if (aux::time_now() - m_last_piece.get(m_connect) > seconds(30) && m_download_rate_peak > 0)
    │ │ │ │  		{
    │ │ │ │ -			// it doesn't make much sense to fail to hash a piece
    │ │ │ │ -
    relevance 0../src/torrent.cpp:7525come up with a better way of doing this, instead of an immediately invoked lambda expression.

    come up with a better way of doing this, instead of an │ │ │ │ -immediately invoked lambda expression.

    ../src/torrent.cpp:7525

    					|| peerinfo->confirmed_supports_utp))
    │ │ │ │ -			{
    │ │ │ │ -				sm = m_ses.utp_socket_manager();
    │ │ │ │ -			}
    │ │ │ │ -
    │ │ │ │ -			// don't make a TCP connection if it's disabled
    │ │ │ │ -			if (sm == nullptr && !settings().get_bool(settings_pack::enable_outgoing_tcp))
    │ │ │ │ -			{
    │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -				if (should_log())
    │ │ │ │ -				{
    │ │ │ │ -					debug_log("discarding peer \"%s\": TCP connections disabled "
    │ │ │ │ -						"[ supports-utp: %d ]", peerinfo->to_string().c_str()
    │ │ │ │ -						, peerinfo->supports_utp);
    │ │ │ │ -				}
    │ │ │ │ -#endif
    │ │ │ │ -				return false;
    │ │ │ │ -			}
    │ │ │ │ +			rate = m_download_rate_peak;
    │ │ │ │  		}
    │ │ │ │ -
    │ │ │ │ -
    aux::socket_type s = [&] { │ │ │ │ -
    │ │ │ │ -#if TORRENT_USE_I2P │ │ │ │ - if (peerinfo->is_i2p_addr) │ │ │ │ + else if (aux::time_now() - m_last_unchoked.get(m_connect) < seconds(5) │ │ │ │ + && m_statistics.total_payload_upload() < 2 * 0x4000) │ │ │ │ { │ │ │ │ - // It's not entirely obvious why this peer connection is not marked as │ │ │ │ - // one. The main feature of a peer connection is that whether or not we │ │ │ │ - // proxy it is configurable. When we use i2p, we want to always prox │ │ │ │ - // everything via i2p. │ │ │ │ + // if we're have only been unchoked for a short period of time, │ │ │ │ + // we don't know what rate we can get from this peer. Instead of assuming │ │ │ │ + // the lowest possible rate, assume the average. │ │ │ │ │ │ │ │ - aux::proxy_settings proxy; │ │ │ │ - proxy.hostname = settings().get_str(settings_pack::i2p_hostname); │ │ │ │ - proxy.port = std::uint16_t(settings().get_int(settings_pack::i2p_port)); │ │ │ │ - proxy.type = settings_pack::i2p_proxy; │ │ │ │ + int peers_with_requests = int(stats_counters()[counters::num_peers_down_requests]); │ │ │ │ + // avoid division by 0 │ │ │ │ + if (peers_with_requests == 0) peers_with_requests = 1; │ │ │ │ │ │ │ │ - aux::socket_type ret = instantiate_connection(m_ses.get_context() │ │ │ │ - , proxy, nullptr, nullptr, false, false); │ │ │ │ - i2p_stream& str = boost::get<i2p_stream>(ret); │ │ │ │ - str.set_local_i2p_endpoint(m_ses.local_i2p_endpoint()); │ │ │ │ - str.set_destination(static_cast<i2p_peer*>(peerinfo)->dest()); │ │ │ │ - str.set_command(i2p_stream::cmd_connect); │ │ │ │ - str.set_session_id(m_ses.i2p_session()); │ │ │ │ - return ret; │ │ │ │ - } │ │ │ │ +
    rate = t->statistics().transfer_rate(stat::download_payload) / peers_with_requests; │ │ │ │ +
    } │ │ │ │ else │ │ │ │ -#endif │ │ │ │ { │ │ │ │ - void* userdata = nullptr; │ │ │ │ -#ifdef TORRENT_SSL_PEERS │ │ │ │ - if (is_ssl_torrent()) │ │ │ │ - { │ │ │ │ -
    relevance 0../src/torrent.cpp:9118perhaps 0 should actually mean 0

    perhaps 0 should actually mean 0

    ../src/torrent.cpp:9118

    		// finished torrents may not change their queue positions, as it's set to
    │ │ │ │ -		// -1
    │ │ │ │ -		if ((m_abort || is_finished()) && p != no_pos) return;
    │ │ │ │ -
    │ │ │ │ -		TORRENT_ASSERT((p == no_pos) == is_finished()
    │ │ │ │ -			|| (!m_auto_managed && p == no_pos)
    │ │ │ │ -			|| (m_abort && p == no_pos)
    │ │ │ │ -			|| (!m_added && p == no_pos));
    │ │ │ │ -		if (p == m_sequence_number) return;
    │ │ │ │ -
    │ │ │ │ -		TORRENT_ASSERT(p >= no_pos);
    │ │ │ │ -
    │ │ │ │ -		state_updated();
    │ │ │ │ -
    │ │ │ │ -		m_ses.set_queue_position(this, p);
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -	void torrent::set_max_uploads(int limit, bool const state_update)
    │ │ │ │ -	{
    │ │ │ │ -		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ -
    if (limit <= 0) limit = (1 << 24) - 1; │ │ │ │ -
    if (int(m_max_uploads) == limit) return; │ │ │ │ - if (state_update) state_updated(); │ │ │ │ - m_max_uploads = aux::numeric_cast<std::uint32_t>(limit); │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - if (should_log() && state_update) │ │ │ │ - debug_log("*** set-max-uploads: %d", m_max_uploads); │ │ │ │ -#endif │ │ │ │ + // current download rate in bytes per seconds │ │ │ │ + rate = m_statistics.transfer_rate(stat::download_payload); │ │ │ │ + } │ │ │ │ │ │ │ │ - if (state_update) │ │ │ │ - set_need_save_resume(torrent_handle::if_config_changed); │ │ │ │ - } │ │ │ │ + // avoid division by zero │ │ │ │ + if (rate < 50) rate = 50; │ │ │ │ │ │ │ │ - void torrent::set_max_connections(int limit, bool const state_update) │ │ │ │ - { │ │ │ │ - TORRENT_ASSERT(is_single_thread()); │ │ │ │ -
    relevance 0../src/torrent.cpp:9135perhaps 0 should actually mean 0

    perhaps 0 should actually mean 0

    ../src/torrent.cpp:9135

    │ │ │ │ -	void torrent::set_max_uploads(int limit, bool const state_update)
    │ │ │ │ -	{
    │ │ │ │ -		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ -		if (limit <= 0) limit = (1 << 24) - 1;
    │ │ │ │ -		if (int(m_max_uploads) == limit) return;
    │ │ │ │ -		if (state_update) state_updated();
    │ │ │ │ -		m_max_uploads = aux::numeric_cast<std::uint32_t>(limit);
    │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -		if (should_log() && state_update)
    │ │ │ │ -			debug_log("*** set-max-uploads: %d", m_max_uploads);
    │ │ │ │ -#endif
    │ │ │ │ +		// average of current rate and peak
    │ │ │ │ +//		rate = (rate + m_download_rate_peak) / 2;
    │ │ │ │  
    │ │ │ │ -		if (state_update)
    │ │ │ │ -			set_need_save_resume(torrent_handle::if_config_changed);
    │ │ │ │ +		return milliseconds((m_outstanding_bytes + extra_bytes
    │ │ │ │ +			+ m_queued_time_critical * t->block_size() * 1000) / rate);
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ -	void torrent::set_max_connections(int limit, bool const state_update)
    │ │ │ │ +	void peer_connection::add_stat(std::int64_t const downloaded, std::int64_t const uploaded)
    │ │ │ │  	{
    │ │ │ │  		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ -
    if (limit <= 0) limit = (1 << 24) - 1; │ │ │ │ -
    if (int(m_max_connections) == limit) return; │ │ │ │ - if (state_update) state_updated(); │ │ │ │ - m_max_connections = aux::numeric_cast<std::uint32_t>(limit); │ │ │ │ - update_want_peers(); │ │ │ │ - │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - if (should_log() && state_update) │ │ │ │ - debug_log("*** set-max-connections: %d", m_max_connections); │ │ │ │ -#endif │ │ │ │ - │ │ │ │ - if (num_peers() > int(m_max_connections)) │ │ │ │ - { │ │ │ │ - disconnect_peers(num_peers() - m_max_connections │ │ │ │ - , errors::too_many_connections); │ │ │ │ - } │ │ │ │ - │ │ │ │ - if (state_update) │ │ │ │ - set_need_save_resume(torrent_handle::if_config_changed); │ │ │ │ - } │ │ │ │ - │ │ │ │ - void torrent::set_upload_limit(int const limit) │ │ │ │ - { │ │ │ │ - set_limit_impl(limit, peer_connection::upload_channel); │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ - debug_log("*** set-upload-limit: %d", limit); │ │ │ │ -#endif │ │ │ │ + m_statistics.add_stat(downloaded, uploaded); │ │ │ │ } │ │ │ │ │ │ │ │ - void torrent::set_download_limit(int const limit) │ │ │ │ + sha1_hash peer_connection::associated_info_hash() const │ │ │ │ { │ │ │ │ -
    relevance 0../src/torrent.cpp:11061instead of resorting the whole list, insert the peers directly into the right place

    instead of resorting the whole list, insert the peers │ │ │ │ -directly into the right place

    ../src/torrent.cpp:11061

    				std::printf("timed out [average-piece-time: %d ms ]\n"
    │ │ │ │ -					, m_average_piece_time);
    │ │ │ │ -#endif
    │ │ │ │ -			}
    │ │ │ │ -
    │ │ │ │ -			// pick all blocks for this piece. the peers list is kept up to date
    │ │ │ │ -			// and sorted. when we issue a request to a peer, its download queue
    │ │ │ │ -			// time will increase and it may need to be bumped in the peers list,
    │ │ │ │ -			// since it's ordered by download queue time
    │ │ │ │ -			pick_time_critical_block(peers, ignore_peers
    │ │ │ │ -				, peers_with_requests
    │ │ │ │ -				, pi, &i, m_picker.get()
    │ │ │ │ -				, blocks_in_piece, timed_out);
    │ │ │ │ -
    │ │ │ │ -			// put back the peers we ignored into the peer list for the next piece
    │ │ │ │ -			if (!ignore_peers.empty())
    │ │ │ │ -			{
    │ │ │ │ -				peers.insert(peers.begin(), ignore_peers.begin(), ignore_peers.end());
    │ │ │ │ -				ignore_peers.clear();
    │ │ │ │ -
    │ │ │ │ -
    std::sort(peers.begin(), peers.end() │ │ │ │ -
    , [] (peer_connection const* lhs, peer_connection const* rhs) │ │ │ │ - { return lhs->download_queue_time(16*1024) < rhs->download_queue_time(16*1024); }); │ │ │ │ - } │ │ │ │ - │ │ │ │ - // if this peer's download time exceeds 2 seconds, we're done. │ │ │ │ - // We don't want to build unreasonably long request queues │ │ │ │ - if (!peers.empty() && peers[0]->download_queue_time() > milliseconds(2000)) │ │ │ │ - break; │ │ │ │ - } │ │ │ │ - │ │ │ │ - // commit all the time critical requests │ │ │ │ - for (auto p : peers_with_requests) │ │ │ │ + std::shared_ptr<torrent> t = associated_torrent().lock(); │ │ │ │ + TORRENT_ASSERT(t); │ │ │ │ + auto const& ih = t->info_hash(); │ │ │ │ + // if protocol_v2 is set on the peer, this better be a v2 torrent, │ │ │ │ + // otherwise something isn't right │ │ │ │ +
    relevance 0../src/peer_connection.cpp:3536sort the allowed fast set in priority order

    sort the allowed fast set in priority order

    ../src/peer_connection.cpp:3536

    │ │ │ │ +		// if the peer has the piece and we want
    │ │ │ │ +		// to download it, request it
    │ │ │ │ +		if (index < m_have_piece.end_index()
    │ │ │ │ +			&& m_have_piece[index]
    │ │ │ │ +			&& !t->have_piece(index)
    │ │ │ │ +			&& t->valid_metadata()
    │ │ │ │ +			&& t->has_picker()
    │ │ │ │ +			&& t->picker().piece_priority(index) > dont_download)
    │ │ │ │  		{
    │ │ │ │ -			p->send_block_requests();
    │ │ │ │ +			t->peer_is_interesting(*this);
    │ │ │ │  		}
    │ │ │ │  	}
    │ │ │ │ -#endif // TORRENT_DISABLE_STREAMING
    │ │ │ │  
    │ │ │ │ -	std::set<std::string> torrent::web_seeds(web_seed_entry::type_t const type) const
    │ │ │ │ +	std::vector<piece_index_t> const& peer_connection::allowed_fast()
    │ │ │ │  	{
    │ │ │ │  		TORRENT_ASSERT(is_single_thread());
    │ │ │ │ -		std::set<std::string> ret;
    │ │ │ │ -		for (auto const& s : m_web_seeds)
    │ │ │ │ -		{
    │ │ │ │ -			if (s.peer_info.banned) continue;
    │ │ │ │ -			if (s.removed) continue;
    │ │ │ │ -			if (s.type != type) continue;
    │ │ │ │ -			ret.insert(s.url);
    │ │ │ │ -		}
    │ │ │ │ -		return ret;
    │ │ │ │ -
    relevance 0../src/session.cpp:540In C++17. use if constexpr instead

    In C++17. use if constexpr instead

    ../src/session.cpp:540

    	{}
    │ │ │ │ -	session_proxy::session_proxy(session_proxy const&) = default;
    │ │ │ │ -	session_proxy& session_proxy::operator=(session_proxy const&) & = default;
    │ │ │ │ -	session_proxy::session_proxy(session_proxy&&) noexcept = default;
    │ │ │ │ -	session_proxy& session_proxy::operator=(session_proxy&&) & noexcept = default;
    │ │ │ │ -	session_proxy::~session_proxy()
    │ │ │ │ -	{
    │ │ │ │ -		if (m_thread && m_thread.use_count() == 1)
    │ │ │ │ -		{
    │ │ │ │ -#if defined TORRENT_ASIO_DEBUGGING
    │ │ │ │ -			wait_for_asio_handlers();
    │ │ │ │ -#endif
    │ │ │ │ -			m_thread->join();
    │ │ │ │ -		}
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -	TORRENT_EXPORT std::unique_ptr<disk_interface> default_disk_io_constructor(
    │ │ │ │ -		io_context& ios, settings_interface const& sett, counters& cnt)
    │ │ │ │ -	{
    │ │ │ │ -#if TORRENT_HAVE_MMAP || TORRENT_HAVE_MAP_VIEW_OF_FILE
    │ │ │ │ -
    #include "libtorrent/aux_/disable_deprecation_warnings_push.hpp" │ │ │ │ -
    if (sizeof(void*) == 8) │ │ │ │ - return mmap_disk_io_constructor(ios, sett, cnt); │ │ │ │ - else │ │ │ │ - return posix_disk_io_constructor(ios, sett, cnt); │ │ │ │ -#include "libtorrent/aux_/disable_warnings_pop.hpp" │ │ │ │ -#else │ │ │ │ - return posix_disk_io_constructor(ios, sett, cnt); │ │ │ │ -#endif │ │ │ │ - } │ │ │ │ + std::shared_ptr<torrent> t = m_torrent.lock(); │ │ │ │ + TORRENT_ASSERT(t); │ │ │ │ │ │ │ │ -} │ │ │ │ -
    relevance 0../src/cpuid.cpp:131enable when aarch64 is really tested

    enable when aarch64 is really tested

    ../src/cpuid.cpp:131

    	bool supports_mmx() noexcept
    │ │ │ │ -	{
    │ │ │ │ -#if TORRENT_HAS_SSE
    │ │ │ │ -		std::uint32_t cpui[4] = {0};
    │ │ │ │ -		cpuid(cpui, 1);
    │ │ │ │ -		return (cpui[2] & (1 << 23)) != 0;
    │ │ │ │ -#else
    │ │ │ │ -		return false;
    │ │ │ │ -#endif
    │ │ │ │ -	}
    │ │ │ │ +
    return m_allowed_fast; │ │ │ │ +
    } │ │ │ │ │ │ │ │ - bool supports_arm_neon() noexcept │ │ │ │ + bool peer_connection::can_request_time_critical() const │ │ │ │ { │ │ │ │ -#if TORRENT_HAS_ARM_NEON && TORRENT_HAS_AUXV │ │ │ │ -#if defined __arm__ │ │ │ │ - //return (getauxval(AT_HWCAP) & HWCAP_NEON); │ │ │ │ - return (helper_getauxval(16) & (1 << 12)); │ │ │ │ -#elif defined __aarch64__ │ │ │ │ - //return (getauxval(AT_HWCAP) & HWCAP_ASIMD); │ │ │ │ - //return (getauxval(16) & (1 << 1)); │ │ │ │ -
    return false; │ │ │ │ -
    #endif │ │ │ │ -#else │ │ │ │ - return false; │ │ │ │ -#endif │ │ │ │ - } │ │ │ │ + TORRENT_ASSERT(is_single_thread()); │ │ │ │ + if (has_peer_choked() || !is_interesting()) return false; │ │ │ │ + if (int(m_download_queue.size()) + int(m_request_queue.size()) │ │ │ │ + > m_desired_queue_size * 2) return false; │ │ │ │ + if (on_parole()) return false; │ │ │ │ + if (m_disconnecting) return false; │ │ │ │ + std::shared_ptr<torrent> t = m_torrent.lock(); │ │ │ │ + TORRENT_ASSERT(t); │ │ │ │ + if (t->upload_mode()) return false; │ │ │ │ │ │ │ │ - bool supports_arm_crc32c() noexcept │ │ │ │ - { │ │ │ │ -#if TORRENT_HAS_ARM_CRC32 && TORRENT_HAS_AUXV │ │ │ │ -#if defined TORRENT_FORCE_ARM_CRC32 │ │ │ │ + // ignore snubbed peers, since they're not likely to return pieces in a │ │ │ │ + // timely manner anyway │ │ │ │ + if (m_snubbed) return false; │ │ │ │ return true; │ │ │ │ -#elif defined __arm__ │ │ │ │ - //return (getauxval(AT_HWCAP2) & HWCAP2_CRC32); │ │ │ │ - return (helper_getauxval(26) & (1 << 4)); │ │ │ │ -#elif defined __aarch64__ │ │ │ │ - //return (getauxval(AT_HWCAP) & HWCAP_CRC32); │ │ │ │ - return (helper_getauxval(16) & (1 << 7)); │ │ │ │ -#endif │ │ │ │ -#else │ │ │ │ - return false; │ │ │ │ -#endif │ │ │ │ } │ │ │ │ │ │ │ │ -} // anonymous namespace │ │ │ │ - │ │ │ │ - bool const sse42_support = supports_sse42(); │ │ │ │ - bool const mmx_support = supports_mmx(); │ │ │ │ - bool const arm_neon_support = supports_arm_neon(); │ │ │ │ - bool const arm_crc32c_support = supports_arm_crc32c(); │ │ │ │ -} } │ │ │ │ -
    relevance 0../src/choker.cpp:258make configurable

    make configurable

    ../src/choker.cpp:258

    			// first reset the number of unchoke slots, because we'll calculate
    │ │ │ │ -			// it purely based on the current state of our peers.
    │ │ │ │ -			upload_slots = 0;
    │ │ │ │ -
    │ │ │ │ -			int rate_threshold = sett.get_int(settings_pack::rate_choker_initial_threshold);
    │ │ │ │ -
    │ │ │ │ -			std::sort(peers.begin(), peers.end()
    │ │ │ │ -				, [](peer_connection const* lhs, peer_connection const* rhs)
    │ │ │ │ -				{ return upload_rate_compare(lhs, rhs); });
    │ │ │ │ -
    │ │ │ │ -			for (auto const* p : peers)
    │ │ │ │ -			{
    │ │ │ │ -				int const rate = int(p->uploaded_in_last_round()
    │ │ │ │ -					* 1000 / total_milliseconds(unchoke_interval));
    │ │ │ │ -
    │ │ │ │ -				// always have at least 1 unchoke slot
    │ │ │ │ -				if (rate < rate_threshold) break;
    │ │ │ │ -
    │ │ │ │ -				++upload_slots;
    │ │ │ │ -
    │ │ │ │ -
    rate_threshold += 2048; │ │ │ │ -
    } │ │ │ │ - ++upload_slots; │ │ │ │ - } │ │ │ │ - │ │ │ │ - // sorts the peers that are eligible for unchoke by download rate and │ │ │ │ - // secondary by total upload. The reason for this is, if all torrents are │ │ │ │ - // being seeded, the download rate will be 0, and the peers we have sent │ │ │ │ - // the least to should be unchoked │ │ │ │ - │ │ │ │ - // we use partial sort here, because we only care about the top │ │ │ │ - // upload_slots peers. │ │ │ │ - │ │ │ │ - int const slots = std::min(upload_slots, int(peers.size())); │ │ │ │ - │ │ │ │ - if (sett.get_int(settings_pack::seed_choking_algorithm) │ │ │ │ - == settings_pack::round_robin) │ │ │ │ - { │ │ │ │ - int const pieces = sett.get_int(settings_pack::seeding_piece_quota); │ │ │ │ - │ │ │ │ - std::nth_element(peers.begin(), peers.begin() │ │ │ │ - + slots, peers.end() │ │ │ │ - , [pieces](peer_connection const* lhs, peer_connection const* rhs) │ │ │ │ - { return unchoke_compare_rr(lhs, rhs, pieces); }); │ │ │ │ - } │ │ │ │ - else if (sett.get_int(settings_pack::seed_choking_algorithm) │ │ │ │ - == settings_pack::fastest_upload) │ │ │ │ - { │ │ │ │ - std::nth_element(peers.begin(), peers.begin() │ │ │ │ - + slots, peers.end() │ │ │ │ - , [](peer_connection const* lhs, peer_connection const* rhs) │ │ │ │ -
    relevance 0../src/merkle_tree.cpp:110in C++20, use std::identity

    in C++20, use std::identity

    ../src/merkle_tree.cpp:110

    		allocate_full();
    │ │ │ │ -
    │ │ │ │ -		merkle_validate_copy(t, m_tree, root(), m_block_verified);
    │ │ │ │ -
    │ │ │ │ -		load_verified_bits(verified);
    │ │ │ │ -
    │ │ │ │ -		optimize_storage();
    │ │ │ │ -		optimize_storage_piece_layer();
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -	void merkle_tree::clear()
    │ │ │ │ +	bool peer_connection::make_time_critical(piece_block const& block)
    │ │ │ │  	{
    │ │ │ │ -		m_tree.clear();
    │ │ │ │ -		m_tree.shrink_to_fit();
    │ │ │ │ -		m_block_verified.clear();
    │ │ │ │ -		m_mode = mode_t::empty_tree;
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -namespace {
    │ │ │ │ -
    │ │ │ │ -
    struct identity │ │ │ │ -
    { │ │ │ │ - bool operator()(bool b) const { return b; } │ │ │ │ - }; │ │ │ │ -} │ │ │ │ - │ │ │ │ - void merkle_tree::load_sparse_tree(span<sha256_hash const> t │ │ │ │ - , std::vector<bool> const& mask │ │ │ │ - , std::vector<bool> const& verified) │ │ │ │ + TORRENT_ASSERT(is_single_thread()); │ │ │ │ + auto const rit = std::find_if(m_request_queue.begin() │ │ │ │ + , m_request_queue.end(), aux::has_block(block)); │ │ │ │ + if (rit == m_request_queue.end()) return false; │ │ │ │ +#if TORRENT_USE_ASSERTS │ │ │ │ + std::shared_ptr<torrent> t = m_torrent.lock(); │ │ │ │ + TORRENT_ASSERT(t); │ │ │ │ + TORRENT_ASSERT(t->has_picker()); │ │ │ │ +
    relevance 0../src/hash_picker.cpp:309use structured bindings in C++17

    use structured bindings in C++17

    ../src/hash_picker.cpp:309

    		, int const offset, sha256_hash const& h)
    │ │ │ │  	{
    │ │ │ │ -		INVARIANT_CHECK;
    │ │ │ │ -		TORRENT_ASSERT(mask.size() == size());
    │ │ │ │ -		if (size() != mask.size()) return;
    │ │ │ │ -
    │ │ │ │ -		int const first_block = block_layer_start();
    │ │ │ │ -		int const end_block = first_block + m_num_blocks;
    │ │ │ │ -
    │ │ │ │ -		TORRENT_ASSERT(first_block < int(mask.size()));
    │ │ │ │ -		TORRENT_ASSERT(end_block <= int(mask.size()));
    │ │ │ │ -
    │ │ │ │ -		// if the mask covers all blocks, go straight to block_layer
    │ │ │ │ -		// mode, and validate
    │ │ │ │ -		if (std::all_of(mask.begin() + first_block, mask.begin() + end_block, identity()))
    │ │ │ │ -		{
    │ │ │ │ -			// the index in t that points to first_block
    │ │ │ │ -			auto const block_index = std::count_if(mask.begin(), mask.begin() + first_block, identity());
    │ │ │ │ -
    │ │ │ │ -			// discrepancy
    │ │ │ │ -			if (t.size() < block_index + m_num_blocks)
    │ │ │ │ -				return clear();
    │ │ │ │ -
    │ │ │ │ -
    relevance 0../src/merkle_tree.cpp:319this can be optimized by using m_tree as storage to fill this tree into, and then clear it if the hashes fail

    this can be optimized by using m_tree as storage to fill this │ │ │ │ -tree into, and then clear it if the hashes fail

    ../src/merkle_tree.cpp:319

    	{
    │ │ │ │ -		INVARIANT_CHECK;
    │ │ │ │ -
    │ │ │ │ -		// as we set the hashes of interior nodes, we may be able to validate
    │ │ │ │ -		// block hashes that we had since earlier. Any blocks that can be
    │ │ │ │ -		// validated, and failed, are added to this list
    │ │ │ │ -		add_hashes_result_t ret;
    │ │ │ │ -
    │ │ │ │ -		// we already have all hashes
    │ │ │ │ -		if (m_mode == mode_t::block_layer)
    │ │ │ │ -		{
    │ │ │ │ -			// since we're already on the block layer mode, we have the whole
    │ │ │ │ -			// tree, and we've already reported any pieces as passing that may
    │ │ │ │ -			// have existed in the tree when we completed it. At this point no
    │ │ │ │ -			// more pieces should be reported as passed
    │ │ │ │ -			return ret;
    │ │ │ │ -		}
    │ │ │ │ +		TORRENT_ASSERT(offset >= 0);
    │ │ │ │ +		auto const f = m_files.file_index_at_piece(piece);
    │ │ │ │  
    │ │ │ │ -		allocate_full();
    │ │ │ │ +		if (m_files.pad_file_at(f))
    │ │ │ │ +			return { set_block_hash_result::result::success, 0, 0 };
    │ │ │ │  
    │ │ │ │ -
    int const leaf_count = merkle_num_leafs(int(hashes.size())); │ │ │ │ -
    aux::vector<sha256_hash> tree(merkle_num_nodes(leaf_count)); │ │ │ │ - std::copy(hashes.begin(), hashes.end(), tree.end() - leaf_count); │ │ │ │ + auto& merkle_tree = m_merkle_trees[f]; │ │ │ │ + piece_index_t const file_first_piece = m_files.piece_index_at_file(f); │ │ │ │ + std::int64_t const block_offset = static_cast<int>(piece) * std::int64_t(m_files.piece_length()) │ │ │ │ + + offset - m_files.file_offset(f); │ │ │ │ + int const block_index = aux::numeric_cast<int>(block_offset / default_block_size); │ │ │ │ │ │ │ │ - // the end of a file is a special case, we may need to pad the leaf layer │ │ │ │ - if (leaf_count > hashes.size()) │ │ │ │ + if (h.is_all_zeros()) │ │ │ │ { │ │ │ │ - int const leaf_layer_size = num_leafs(); │ │ │ │ - // assuming uncle_hashes lead all the way to the root, they tell us │ │ │ │ - // how many layers down we are │ │ │ │ - int const insert_layer_size = leaf_count << uncle_hashes.size(); │ │ │ │ - if (leaf_layer_size != insert_layer_size) │ │ │ │ - { │ │ │ │ - sha256_hash const pad_hash = merkle_pad(leaf_layer_size, insert_layer_size); │ │ │ │ - for (int i = int(hashes.size()); i < leaf_count; ++i) │ │ │ │ - tree[tree.end_index() - leaf_count + i] = pad_hash; │ │ │ │ - } │ │ │ │ + TORRENT_ASSERT_FAIL(); │ │ │ │ + return set_block_hash_result::block_hash_failed(); │ │ │ │ } │ │ │ │ │ │ │ │ - merkle_fill_tree(tree, leaf_count); │ │ │ │ - │ │ │ │ - int const base_num_layers = merkle_num_layers(leaf_count); │ │ │ │ - │ │ │ │ - // this is the index of the node where we'll insert the root of the │ │ │ │ - // subtree (tree). It's also the hash the uncle_hashes are here to prove │ │ │ │ - // is valid. │ │ │ │ - int const insert_root_idx = dest_start_idx >> base_num_layers; │ │ │ │ - │ │ │ │ - // start with validating the proofs, and inserting them as we go. │ │ │ │ - if (!merkle_validate_and_insert_proofs(m_tree, insert_root_idx, tree[0], uncle_hashes)) │ │ │ │ - return {}; │ │ │ │ -
    relevance 0../src/merkle_tree.cpp:367a piece outside of this range may also fail, if one of the uncle hashes is at the layer right above the block hashes

    a piece outside of this range may also fail, if one of the uncle │ │ │ │ -hashes is at the layer right above the block hashes

    ../src/merkle_tree.cpp:367

    		int const insert_root_idx = dest_start_idx >> base_num_layers;
    │ │ │ │ -
    │ │ │ │ -		// start with validating the proofs, and inserting them as we go.
    │ │ │ │ -		if (!merkle_validate_and_insert_proofs(m_tree, insert_root_idx, tree[0], uncle_hashes))
    │ │ │ │ -			return {};
    │ │ │ │ -
    │ │ │ │ -		// first fill in the subtree of known hashes from the base layer
    │ │ │ │ -		auto const num_leafs = merkle_num_leafs(m_num_blocks);
    │ │ │ │ -		auto const first_leaf = merkle_first_leaf(num_leafs);
    │ │ │ │ -
    │ │ │ │ -		// this is the start of the leaf layer of "tree". We'll use this
    │ │ │ │ -		// variable to step upwards towards the root
    │ │ │ │ -		int source_cursor = int(tree.size()) - leaf_count;
    │ │ │ │ -		// the running index in the loop
    │ │ │ │ -		int dest_cursor = dest_start_idx;
    │ │ │ │ -
    │ │ │ │ -		// the number of tree levels in a piece hash. 0 means the block layer is
    │ │ │ │ -		// the same as the piece layer
    │ │ │ │ -		int const base = piece_levels();
    │ │ │ │ -
    │ │ │ │ -
    for (int layer_size = leaf_count; layer_size != 0; layer_size /= 2) │ │ │ │ -
    { │ │ │ │ - for (int i = 0; i < layer_size; ++i) │ │ │ │ - { │ │ │ │ - int const dst_idx = dest_cursor + i; │ │ │ │ - int const src_idx = source_cursor + i; │ │ │ │ - if (has_node(dst_idx)) │ │ │ │ - { │ │ │ │ - if (m_tree[dst_idx] != tree[src_idx]) │ │ │ │ - { │ │ │ │ - // this must be a block hash because inner nodes are not filled in until │ │ │ │ - // they can be verified. This assert ensures we're at the │ │ │ │ - // leaf layer of the file tree │ │ │ │ - TORRENT_ASSERT(dst_idx >= first_leaf); │ │ │ │ - │ │ │ │ - int const pos = dst_idx - first_leaf; │ │ │ │ - auto const piece = piece_index_t{pos >> m_blocks_per_piece_log} + file_piece_offset; │ │ │ │ - int const block = pos & ((1 << m_blocks_per_piece_log) - 1); │ │ │ │ - │ │ │ │ - TORRENT_ASSERT(pos < m_num_blocks); │ │ │ │ - if (!ret.failed.empty() && ret.failed.back().first == piece) │ │ │ │ - ret.failed.back().second.push_back(block); │ │ │ │ - else │ │ │ │ - ret.failed.emplace_back(piece, std::vector<int>{block}); │ │ │ │ - │ │ │ │ - // now that this hash has been reported as failing, we │ │ │ │ - // can clear it. This will prevent it from being │ │ │ │ - // reported as failing again. │ │ │ │ - m_tree[dst_idx].clear(); │ │ │ │ - } │ │ │ │ - else if (dst_idx >= first_leaf) │ │ │ │ -
    relevance 0../src/merkle_tree.cpp:447instead of overwriting the root and comparing it against hashes[], write a functions that *validates* a tree by just filling it up to the level below the root and then validates it.

    instead of overwriting the root and comparing it │ │ │ │ -against hashes[], write a functions that *validates* a tree │ │ │ │ -by just filling it up to the level below the root and then │ │ │ │ -validates it.

    ../src/merkle_tree.cpp:447

    			&& dest_start_idx < first_piece_idx + num_pieces())
    │ │ │ │ -		{
    │ │ │ │ -			int const blocks_in_piece = 1 << base;
    │ │ │ │ -
    │ │ │ │ -			// it may now be possible to verify the hashes of previously received blocks
    │ │ │ │ -			// try to verify as many child nodes of the received hashes as possible
    │ │ │ │ -			for (int i = 0; i < int(hashes.size()); ++i)
    │ │ │ │ -			{
    │ │ │ │ -				int const piece = dest_start_idx + i;
    │ │ │ │ -				if (piece - first_piece_idx >= num_pieces())
    │ │ │ │ -					break;
    │ │ │ │ -				// the first block in this piece
    │ │ │ │ -				int const block_idx = merkle_get_first_child(piece, base);
    │ │ │ │ -
    │ │ │ │ -				int const block_end_idx = std::min(block_idx + blocks_in_piece, first_leaf + m_num_blocks);
    │ │ │ │ -				if (std::any_of(m_tree.begin() + block_idx
    │ │ │ │ -					, m_tree.begin() + block_end_idx
    │ │ │ │ -					, [](sha256_hash const& h) { return h.is_all_zeros(); }))
    │ │ │ │ -					continue;
    │ │ │ │ -
    │ │ │ │ -
    merkle_fill_tree(m_tree, blocks_in_piece, block_idx); │ │ │ │ -
    if (m_tree[piece] != hashes[i]) │ │ │ │ - { │ │ │ │ - merkle_clear_tree(m_tree, blocks_in_piece, block_idx); │ │ │ │ - // write back the correct hash │ │ │ │ - m_tree[piece] = hashes[i]; │ │ │ │ - TORRENT_ASSERT(blocks_in_piece == blocks_per_piece()); │ │ │ │ +
    aux::merkle_tree::set_block_result result; │ │ │ │ +
    int leafs_index; │ │ │ │ + int leafs_size; │ │ │ │ + std::tie(result, leafs_index, leafs_size) = merkle_tree.set_block(block_index, h); │ │ │ │ │ │ │ │ - // an empty blocks vector indicates that we don't have the │ │ │ │ - // block hashes, and we can't know which block failed │ │ │ │ - // this will cause the block hashes to be requested │ │ │ │ - ret.failed.emplace_back(piece_index_t{piece - first_piece_idx} + file_piece_offset │ │ │ │ - , std::vector<int>()); │ │ │ │ - } │ │ │ │ - else │ │ │ │ - { │ │ │ │ - ret.passed.push_back(piece_index_t{piece - first_piece_idx} + file_piece_offset); │ │ │ │ - // record that these block hashes are correct! │ │ │ │ - int const leafs_start = block_idx - block_layer_start(); │ │ │ │ - int const leafs_end = std::min(m_num_blocks, leafs_start + blocks_in_piece); │ │ │ │ -
    relevance 0../src/merkle_tree.cpp:471this could be done more efficiently if bitfield had a function to set a range of bits

    this could be done more efficiently if bitfield had a function │ │ │ │ -to set a range of bits

    ../src/merkle_tree.cpp:471

    				merkle_fill_tree(m_tree, blocks_in_piece, block_idx);
    │ │ │ │ -				if (m_tree[piece] != hashes[i])
    │ │ │ │ -				{
    │ │ │ │ -					merkle_clear_tree(m_tree, blocks_in_piece, block_idx);
    │ │ │ │ -					// write back the correct hash
    │ │ │ │ -					m_tree[piece] = hashes[i];
    │ │ │ │ -					TORRENT_ASSERT(blocks_in_piece == blocks_per_piece());
    │ │ │ │ +		if (result == aux::merkle_tree::set_block_result::unknown)
    │ │ │ │ +			return set_block_hash_result::unknown();
    │ │ │ │ +		if (result == aux::merkle_tree::set_block_result::block_hash_failed)
    │ │ │ │ +			return set_block_hash_result::block_hash_failed();
    │ │ │ │  
    │ │ │ │ -					// an empty blocks vector indicates that we don't have the
    │ │ │ │ -					// block hashes, and we can't know which block failed
    │ │ │ │ -					// this will cause the block hashes to be requested
    │ │ │ │ -					ret.failed.emplace_back(piece_index_t{piece - first_piece_idx} + file_piece_offset
    │ │ │ │ -						, std::vector<int>());
    │ │ │ │ -				}
    │ │ │ │ -				else
    │ │ │ │ -				{
    │ │ │ │ -					ret.passed.push_back(piece_index_t{piece - first_piece_idx} + file_piece_offset);
    │ │ │ │ -					// record that these block hashes are correct!
    │ │ │ │ -					int const leafs_start = block_idx - block_layer_start();
    │ │ │ │ -					int const leafs_end = std::min(m_num_blocks, leafs_start + blocks_in_piece);
    │ │ │ │ -
    for (int k = leafs_start; k < leafs_end; ++k) │ │ │ │ -
    m_block_verified.set_bit(k); │ │ │ │ - } │ │ │ │ - TORRENT_ASSERT((piece - first_piece_idx) >= 0); │ │ │ │ - } │ │ │ │ - } │ │ │ │ + auto const status = (result == aux::merkle_tree::set_block_result::hash_failed) │ │ │ │ + ? set_block_hash_result::result::piece_hash_failed │ │ │ │ + : set_block_hash_result::result::success; │ │ │ │ │ │ │ │ - optimize_storage(); │ │ │ │ + int const blocks_per_piece = m_files.piece_length() / default_block_size; │ │ │ │ │ │ │ │ - return ret; │ │ │ │ + return { status │ │ │ │ + , int(leafs_index - static_cast<int>(piece - file_first_piece) * blocks_per_piece) │ │ │ │ + , std::min(leafs_size, m_files.file_num_pieces(f) * blocks_per_piece - leafs_index) }; │ │ │ │ } │ │ │ │ │ │ │ │ - std::tuple<merkle_tree::set_block_result, int, int> merkle_tree::set_block(int const block_index │ │ │ │ - , sha256_hash const& h) │ │ │ │ + void hash_picker::hashes_rejected(hash_request const& req) │ │ │ │ { │ │ │ │ -#ifdef TORRENT_EXPENSIVE_INVARIANT_CHECKS │ │ │ │ - INVARIANT_CHECK; │ │ │ │ -#endif │ │ │ │ - TORRENT_ASSERT(block_index < m_num_blocks); │ │ │ │ - │ │ │ │ - auto const num_leafs = merkle_num_leafs(m_num_blocks); │ │ │ │ - auto const first_leaf = merkle_first_leaf(num_leafs); │ │ │ │ - auto const block_tree_index = first_leaf + block_index; │ │ │ │ - │ │ │ │ - if (blocks_verified(block_index, 1)) │ │ │ │ - { │ │ │ │ - // if this blocks's hash is already known, check the passed-in hash against it │ │ │ │ - if (compare_node(block_tree_index, h)) │ │ │ │ - return std::make_tuple(set_block_result::ok, block_index, 1); │ │ │ │ - else │ │ │ │ - return std::make_tuple(set_block_result::block_hash_failed, block_index, 1); │ │ │ │ -
    relevance 0../src/merkle_tree.cpp:514use structured binding in C++17

    use structured binding in C++17

    ../src/merkle_tree.cpp:514

    		auto const first_leaf = merkle_first_leaf(num_leafs);
    │ │ │ │ -		auto const block_tree_index = first_leaf + block_index;
    │ │ │ │ -
    │ │ │ │ -		if (blocks_verified(block_index, 1))
    │ │ │ │ -		{
    │ │ │ │ -			// if this blocks's hash is already known, check the passed-in hash against it
    │ │ │ │ -			if (compare_node(block_tree_index, h))
    │ │ │ │ -				return std::make_tuple(set_block_result::ok, block_index, 1);
    │ │ │ │ -			else
    │ │ │ │ -				return std::make_tuple(set_block_result::block_hash_failed, block_index, 1);
    │ │ │ │ -		}
    │ │ │ │ -
    │ │ │ │ -		allocate_full();
    │ │ │ │ -
    │ │ │ │ -		m_tree[block_tree_index] = h;
    │ │ │ │ -
    │ │ │ │ -		// to avoid wasting a lot of time hashing nodes only to discover they
    │ │ │ │ -		// cannot be verified, check first to see if the root of the largest
    │ │ │ │ -		// computable subtree is known
    │ │ │ │ -
    │ │ │ │ -
    int leafs_start; │ │ │ │ -
    int leafs_size; │ │ │ │ - int root_index; │ │ │ │ - std::tie(leafs_start, leafs_size, root_index) = │ │ │ │ - merkle_find_known_subtree(m_tree, block_index, m_num_blocks); │ │ │ │ - │ │ │ │ - // if the root node is unknown the hashes cannot be verified yet │ │ │ │ - if (m_tree[root_index].is_all_zeros()) │ │ │ │ - return std::make_tuple(set_block_result::unknown, leafs_start, leafs_size); │ │ │ │ - │ │ │ │ - // save the root hash because merkle_fill_tree will overwrite it │ │ │ │ - sha256_hash const root = m_tree[root_index]; │ │ │ │ - merkle_fill_tree(m_tree, leafs_size, first_leaf + leafs_start); │ │ │ │ - │ │ │ │ - if (root != m_tree[root_index]) │ │ │ │ - { │ │ │ │ - // hash failure, clear all the internal nodes │ │ │ │ - // the whole piece failed the hash check. Clear all block hashes │ │ │ │ - // in this piece and report a hash failure │ │ │ │ - merkle_clear_tree(m_tree, leafs_size, first_leaf + leafs_start); │ │ │ │ - m_tree[root_index] = root; │ │ │ │ - return std::make_tuple(set_block_result::hash_failed, leafs_start, leafs_size); │ │ │ │ - } │ │ │ │ - │ │ │ │ -
    relevance 0../src/merkle_tree.cpp:539this could be done more efficiently if bitfield had a function to set a range of bits

    this could be done more efficiently if bitfield had a function │ │ │ │ -to set a range of bits

    ../src/merkle_tree.cpp:539

    			merkle_find_known_subtree(m_tree, block_index, m_num_blocks);
    │ │ │ │ -
    │ │ │ │ -		// if the root node is unknown the hashes cannot be verified yet
    │ │ │ │ -		if (m_tree[root_index].is_all_zeros())
    │ │ │ │ -			return std::make_tuple(set_block_result::unknown, leafs_start, leafs_size);
    │ │ │ │ -
    │ │ │ │ -		// save the root hash because merkle_fill_tree will overwrite it
    │ │ │ │ -		sha256_hash const root = m_tree[root_index];
    │ │ │ │ -		merkle_fill_tree(m_tree, leafs_size, first_leaf + leafs_start);
    │ │ │ │ +		TORRENT_ASSERT(req.base == m_piece_layer && req.index % 512 == 0);
    │ │ │ │  
    │ │ │ │ -		if (root != m_tree[root_index])
    │ │ │ │ +		for (int i = req.index; i < req.index + req.count; i += 512)
    │ │ │ │  		{
    │ │ │ │ -			// hash failure, clear all the internal nodes
    │ │ │ │ -			// the whole piece failed the hash check. Clear all block hashes
    │ │ │ │ -			// in this piece and report a hash failure
    │ │ │ │ -			merkle_clear_tree(m_tree, leafs_size, first_leaf + leafs_start);
    │ │ │ │ -			m_tree[root_index] = root;
    │ │ │ │ -			return std::make_tuple(set_block_result::hash_failed, leafs_start, leafs_size);
    │ │ │ │ -		}
    │ │ │ │ -
    │ │ │ │ -
    int const leafs_end = std::min(m_num_blocks, leafs_start + leafs_size); │ │ │ │ -
    for (int i = leafs_start; i < leafs_end; ++i) │ │ │ │ - m_block_verified.set_bit(i); │ │ │ │ - │ │ │ │ - // attempting to optimize storage is quite costly, only do it if we have │ │ │ │ - // a reason to believe it might have an effect │ │ │ │ - if (block_index == m_num_blocks - 1 || !m_tree[block_tree_index + 1].is_all_zeros()) │ │ │ │ - optimize_storage(); │ │ │ │ - │ │ │ │ - return std::make_tuple(set_block_result::ok, leafs_start, leafs_size); │ │ │ │ - } │ │ │ │ - │ │ │ │ - std::size_t merkle_tree::size() const │ │ │ │ - { │ │ │ │ - return static_cast<std::size_t>(merkle_num_nodes(merkle_num_leafs(m_num_blocks))); │ │ │ │ - } │ │ │ │ - │ │ │ │ - int merkle_tree::num_pieces() const │ │ │ │ - { │ │ │ │ - int const ps = blocks_per_piece(); │ │ │ │ - TORRENT_ASSERT(ps > 0); │ │ │ │ - return (m_num_blocks + ps - 1) >> m_blocks_per_piece_log; │ │ │ │ - } │ │ │ │ - │ │ │ │ - int merkle_tree::block_layer_start() const │ │ │ │ - { │ │ │ │ - int const num_leafs = merkle_num_leafs(m_num_blocks); │ │ │ │ - TORRENT_ASSERT(num_leafs > 0); │ │ │ │ - return merkle_first_leaf(num_leafs); │ │ │ │ - } │ │ │ │ - │ │ │ │ -
    relevance 0../src/pe_crypto.cpp:60it would be nice to get the literal working

    it would be nice to get the literal working

    ../src/pe_crypto.cpp:60

    #include <algorithm>
    │ │ │ │ -#include <random>
    │ │ │ │ -
    │ │ │ │ -#include "libtorrent/aux_/disable_warnings_push.hpp"
    │ │ │ │ -
    │ │ │ │ -#include <boost/multiprecision/integer.hpp>
    │ │ │ │ -#include <boost/multiprecision/cpp_int.hpp>
    │ │ │ │ -
    │ │ │ │ -#include "libtorrent/aux_/disable_warnings_pop.hpp"
    │ │ │ │ -
    │ │ │ │ -#include "libtorrent/random.hpp"
    │ │ │ │ -#include "libtorrent/aux_/alloca.hpp"
    │ │ │ │ -#include "libtorrent/pe_crypto.hpp"
    │ │ │ │ -#include "libtorrent/hasher.hpp"
    │ │ │ │ -
    │ │ │ │ -namespace libtorrent {
    │ │ │ │ -
    │ │ │ │ -	namespace mp = boost::multiprecision;
    │ │ │ │ -
    │ │ │ │ -	namespace {
    │ │ │ │ -
    key_t const dh_prime │ │ │ │ -
    ("0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A63A36210000000000090563"); │ │ │ │ - } │ │ │ │ - │ │ │ │ - std::array<char, 96> export_key(key_t const& k) │ │ │ │ - { │ │ │ │ - std::array<char, 96> ret; │ │ │ │ - auto* begin = reinterpret_cast<std::uint8_t*>(ret.data()); │ │ │ │ - std::uint8_t* end = mp::export_bits(k, begin, 8); │ │ │ │ - │ │ │ │ -
    relevance 0../src/pe_crypto.cpp:71it would be nice to be able to export to a fixed width field, so we wouldn't have to shift it later

    it would be nice to be able to export to a fixed width field, so │ │ │ │ -we wouldn't have to shift it later

    ../src/pe_crypto.cpp:71

    #include "libtorrent/random.hpp"
    │ │ │ │ -#include "libtorrent/aux_/alloca.hpp"
    │ │ │ │ -#include "libtorrent/pe_crypto.hpp"
    │ │ │ │ -#include "libtorrent/hasher.hpp"
    │ │ │ │ -
    │ │ │ │ -namespace libtorrent {
    │ │ │ │ -
    │ │ │ │ -	namespace mp = boost::multiprecision;
    │ │ │ │ -
    │ │ │ │ -	namespace {
    │ │ │ │ -		key_t const dh_prime
    │ │ │ │ -			("0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A63A36210000000000090563");
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -	std::array<char, 96> export_key(key_t const& k)
    │ │ │ │ -	{
    │ │ │ │ -		std::array<char, 96> ret;
    │ │ │ │ -		auto* begin = reinterpret_cast<std::uint8_t*>(ret.data());
    │ │ │ │ -		std::uint8_t* end = mp::export_bits(k, begin, 8);
    │ │ │ │ -
    │ │ │ │ -
    if (end < begin + 96) │ │ │ │ -
    { │ │ │ │ - int const len = int(end - begin); │ │ │ │ -#if defined __GNUC__ && __GNUC__ == 12 │ │ │ │ -#pragma GCC diagnostic push │ │ │ │ -#pragma GCC diagnostic ignored "-Wstringop-overflow" │ │ │ │ -#endif │ │ │ │ - std::memmove(begin + 96 - len, begin, aux::numeric_cast<std::size_t>(len)); │ │ │ │ -#if defined __GNUC__ && __GNUC__ == 12 │ │ │ │ -#pragma GCC diagnostic pop │ │ │ │ -#endif │ │ │ │ - std::memset(begin, 0, aux::numeric_cast<std::size_t>(96 - len)); │ │ │ │ + m_piece_hash_requested[req.file][i / 512].last_request = min_time(); │ │ │ │ + --m_piece_hash_requested[req.file][i / 512].num_requests; │ │ │ │ } │ │ │ │ - return ret; │ │ │ │ - } │ │ │ │ │ │ │ │ - void rc4_init(const unsigned char* in, std::size_t len, rc4 *state); │ │ │ │ - std::size_t rc4_encrypt(unsigned char *out, std::size_t outlen, rc4 *state); │ │ │ │ - │ │ │ │ - // Set the prime P and the generator, generate local public key │ │ │ │ - dh_key_exchange::dh_key_exchange() │ │ │ │ - { │ │ │ │ - aux::array<std::uint8_t, 96> random_key; │ │ │ │ - aux::random_bytes({reinterpret_cast<char*>(random_key.data()) │ │ │ │ - , static_cast<std::ptrdiff_t>(random_key.size())}); │ │ │ │ - │ │ │ │ - // create local key (random) │ │ │ │ - mp::import_bits(m_dh_local_secret, random_key.begin(), random_key.end()); │ │ │ │ - │ │ │ │ - // key = (2 ^ secret) % prime │ │ │ │ - m_dh_local_key = mp::powm(key_t(2), m_dh_local_secret, dh_prime); │ │ │ │
    relevance 0../src/file_storage.cpp:457maybe it would be nice to have a better index here

    maybe it would be nice to have a better index here

    ../src/file_storage.cpp:457

    		// find the file iterator and file offset
    │ │ │ │  		aux::file_entry target;
    │ │ │ │  		target.offset = aux::numeric_cast<std::uint64_t>(offset);
    │ │ │ │  		TORRENT_ASSERT(!compare_file_offset(target, m_files.front()));
    │ │ │ │  
    │ │ │ │  		auto file_iter = std::upper_bound(
    │ │ │ │  			m_files.begin(), m_files.end(), target, compare_file_offset);
    │ │ │ │ @@ -9511,403 +9473,492 @@
    │ │ │ │  			// symlink targets are only allowed to point to files or directories in
    │ │ │ │  			// this torrent.
    │ │ │ │  			{
    │ │ │ │  				std::string target = m_symlinks[fe.symlink_index];
    │ │ │ │  
    │ │ │ │  				if (is_complete(target))
    │ │ │ │  				{
    │ │ │ │ -
    relevance 0../src/utp_socket_manager.cpp:204this should not be heap allocated, sockets should be movable

    this should not be heap allocated, sockets should be movable

    ../src/utp_socket_manager.cpp:204

    │ │ │ │ -//		UTP_LOGV("incoming packet id:%d source:%s\n", id, print_endpoint(ep).c_str());
    │ │ │ │ -
    │ │ │ │ -		if (!m_sett.get_bool(settings_pack::enable_incoming_utp))
    │ │ │ │ -			return false;
    │ │ │ │ +
    relevance 0../src/ip_notifier.cpp:41simulator support

    simulator support

    ../src/ip_notifier.cpp:41

          from this software without specific prior written permission.
    │ │ │ │  
    │ │ │ │ -		// if not found, see if it's a SYN packet, if it is,
    │ │ │ │ -		// create a new utp_stream
    │ │ │ │ -		if (ph->get_type() == ST_SYN)
    │ │ │ │ -		{
    │ │ │ │ -			// possible SYN flood. Just ignore
    │ │ │ │ -			if (int(m_utp_sockets.size()) > m_sett.get_int(settings_pack::connections_limit) * 2)
    │ │ │ │ -				return false;
    │ │ │ │ +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
    │ │ │ │ +AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    │ │ │ │ +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
    │ │ │ │ +ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
    │ │ │ │ +LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
    │ │ │ │ +CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
    │ │ │ │ +SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
    │ │ │ │ +INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
    │ │ │ │ +CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    │ │ │ │ +ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    │ │ │ │ +POSSIBILITY OF SUCH DAMAGE.
    │ │ │ │  
    │ │ │ │ -			TORRENT_ASSERT(m_new_connection == -1);
    │ │ │ │ -			// create the new socket with this ID
    │ │ │ │ -			m_new_connection = id;
    │ │ │ │ +*/
    │ │ │ │  
    │ │ │ │ -//			UTP_LOGV("not found, new connection id:%d\n", m_new_connection);
    │ │ │ │ +#include "libtorrent/aux_/ip_notifier.hpp"
    │ │ │ │ +#include "libtorrent/assert.hpp"
    │ │ │ │  
    │ │ │ │ -
    aux::socket_type c(aux::instantiate_connection(m_ios, aux::proxy_settings(), m_ssl_context, this, true, false)); │ │ │ │ -
    │ │ │ │ - utp_stream* str = nullptr; │ │ │ │ -#ifdef TORRENT_SSL_PEERS │ │ │ │ - if (is_ssl(c)) │ │ │ │ - str = &boost::get<ssl_stream<utp_stream>>(c).next_layer(); │ │ │ │ - else │ │ │ │ +#if defined TORRENT_BUILD_SIMULATOR │ │ │ │ +
    #elif TORRENT_USE_NETLINK │ │ │ │ +
    #include "libtorrent/netlink.hpp" │ │ │ │ +#include "libtorrent/socket.hpp" │ │ │ │ +#include <array> │ │ │ │ +#include <unordered_map> │ │ │ │ +#elif TORRENT_USE_SYSTEMCONFIGURATION || TORRENT_USE_SC_NETWORK_REACHABILITY │ │ │ │ +#include <SystemConfiguration/SystemConfiguration.h> │ │ │ │ +#elif defined TORRENT_WINDOWS │ │ │ │ +#include "libtorrent/aux_/throw.hpp" │ │ │ │ +#include "libtorrent/aux_/disable_warnings_push.hpp" │ │ │ │ +#include <iphlpapi.h> │ │ │ │ +#ifdef TORRENT_WINRT │ │ │ │ +#include <netioapi.h> │ │ │ │ #endif │ │ │ │ - str = boost::get<utp_stream>(&c); │ │ │ │ - │ │ │ │ - TORRENT_ASSERT(str); │ │ │ │ - int const mtu = mtu_for_dest(ep.address()); │ │ │ │ - str->get_impl()->init_mtu(mtu); │ │ │ │ - str->get_impl()->m_sock = std::move(socket); │ │ │ │ - bool const ret = str->get_impl()->incoming_packet(p, ep, receive_time); │ │ │ │ - if (!ret) return false; │ │ │ │ - m_last_socket = str->get_impl(); │ │ │ │ - m_cb(std::move(c)); │ │ │ │ - // the connection most likely changed its connection ID here │ │ │ │ - // we need to move it to the correct ID │ │ │ │ - return true; │ │ │ │ - } │ │ │ │ - │ │ │ │ - if (ph->get_type() == ST_RESET) return false; │ │ │ │ - │ │ │ │ - // #error send reset │ │ │ │ - │ │ │ │ - return false; │ │ │ │ - } │ │ │ │ - │ │ │ │ - void utp_socket_manager::subscribe_writable(utp_socket_impl* s) │ │ │ │ -
    relevance 0../src/mmap_disk_io.cpp:578in the future, propagate exceptions back to the handlers

    in the future, propagate exceptions back to the handlers

    ../src/mmap_disk_io.cpp:578

    #if DEBUG_DISK_THREAD
    │ │ │ │ -		{
    │ │ │ │ -			std::unique_lock<std::mutex> l(m_job_mutex);
    │ │ │ │ -
    │ │ │ │ -			DLOG("perform_job job: %s ( %s%s) piece: %d offset: %d outstanding: %d\n"
    │ │ │ │ -				, job_action_name[j->action]
    │ │ │ │ -				, (j->flags & mmap_disk_job::fence) ? "fence ": ""
    │ │ │ │ -				, (j->flags & mmap_disk_job::force_copy) ? "force_copy ": ""
    │ │ │ │ -				, static_cast<int>(j->piece), j->d.io.offset
    │ │ │ │ -				, j->storage ? j->storage->num_outstanding_jobs() : -1);
    │ │ │ │ -		}
    │ │ │ │ +#include <mutex>
    │ │ │ │ +#include "libtorrent/aux_/disable_warnings_pop.hpp"
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │ -		std::shared_ptr<mmap_storage> storage = j->storage;
    │ │ │ │ +#include "libtorrent/aux_/netlink_utils.hpp"
    │ │ │ │  
    │ │ │ │ -		TORRENT_ASSERT(static_cast<int>(j->action) < int(job_functions.size()));
    │ │ │ │ +namespace libtorrent { namespace aux {
    │ │ │ │  
    │ │ │ │ -		m_stats_counters.inc_stats_counter(counters::num_running_disk_jobs, 1);
    │ │ │ │ +namespace {
    │ │ │ │  
    │ │ │ │ -		// call disk function
    │ │ │ │ -
    status_t ret = status_t::no_error; │ │ │ │ -
    try │ │ │ │ - { │ │ │ │ - int const idx = static_cast<int>(j->action); │ │ │ │ - ret = (this->*(job_functions[static_cast<std::size_t>(idx)]))(j); │ │ │ │ - } │ │ │ │ - catch (boost::system::system_error const& err) │ │ │ │ - { │ │ │ │ - ret = status_t::fatal_disk_error; │ │ │ │ - j->error.ec = err.code(); │ │ │ │ - j->error.operation = operation_t::exception; │ │ │ │ - } │ │ │ │ - catch (std::bad_alloc const&) │ │ │ │ - { │ │ │ │ - ret = status_t::fatal_disk_error; │ │ │ │ - j->error.ec = errors::no_memory; │ │ │ │ - j->error.operation = operation_t::exception; │ │ │ │ - } │ │ │ │ - catch (std::exception const&) │ │ │ │ - { │ │ │ │ - ret = status_t::fatal_disk_error; │ │ │ │ - j->error.ec = boost::asio::error::fault; │ │ │ │ - j->error.operation = operation_t::exception; │ │ │ │ - } │ │ │ │ +#if (TORRENT_USE_SYSTEMCONFIGURATION || TORRENT_USE_SC_NETWORK_REACHABILITY) && \ │ │ │ │ + !defined TORRENT_BUILD_SIMULATOR │ │ │ │ │ │ │ │ - // note that -2 errors are OK │ │ │ │ - TORRENT_ASSERT(ret != status_t::fatal_disk_error │ │ │ │ - || (j->error.ec && j->error.operation != operation_t::unknown)); │ │ │ │ +// common utilities for Mac and iOS │ │ │ │ +template <typename T> void CFRefRetain(T h) { CFRetain(h); } │ │ │ │ +template <typename T> void CFRefRelease(T h) { CFRelease(h); } │ │ │ │ │ │ │ │ - m_stats_counters.inc_stats_counter(counters::num_running_disk_jobs, -1); │ │ │ │ +
    relevance 0../src/load_torrent.cpp:121move the loading logic from torrent_info constructor into here

    move the loading logic from torrent_info constructor into here

    ../src/load_torrent.cpp:121

    				mask.resize(std::size_t(full_size), false);
    │ │ │ │ +				for (int i = merkle_first_leaf(piece_layer_size)
    │ │ │ │ +					, end = i + num_pieces; i < end; ++i)
    │ │ │ │ +				{
    │ │ │ │ +					mask[std::size_t(i)] = true;
    │ │ │ │ +				}
    │ │ │ │ +			}
    │ │ │ │ +			ti->free_piece_layers();
    │ │ │ │ +		}
    │ │ │ │ +		atp.info_hashes = atp.ti->info_hashes();
    │ │ │ │ +	}
    │ │ │ │ +}
    │ │ │ │  
    │ │ │ │ -
    relevance 0../src/mmap_disk_io.cpp:1017this is potentially very expensive. One way to solve it would be to have a fence for just this one piece. but it hardly seems worth the complexity and cost just for the edge case of receiving a corrupt piece

    this is potentially very expensive. One way to solve │ │ │ │ -it would be to have a fence for just this one piece. │ │ │ │ -but it hardly seems worth the complexity and cost just for the edge │ │ │ │ -case of receiving a corrupt piece

    ../src/mmap_disk_io.cpp:1017

    		aux::mmap_disk_job* j = m_job_pool.allocate_job(aux::job_action_t::file_priority);
    │ │ │ │ -		j->storage = m_torrents[storage]->shared_from_this();
    │ │ │ │ -		j->argument = std::move(prios);
    │ │ │ │ -		j->callback = std::move(handler);
    │ │ │ │ +	add_torrent_params load_torrent_file(std::string const& filename)
    │ │ │ │ +	{ return load_torrent_file(filename, load_torrent_limits{}); }
    │ │ │ │ +	add_torrent_params load_torrent_buffer(span<char const> buffer)
    │ │ │ │ +	{ return load_torrent_buffer(buffer, load_torrent_limits{}); }
    │ │ │ │ +	add_torrent_params load_torrent_parsed(bdecode_node const& torrent_file)
    │ │ │ │ +	{ return load_torrent_parsed(torrent_file, load_torrent_limits{}); }
    │ │ │ │  
    │ │ │ │ -		add_fence_job(j);
    │ │ │ │ +
    add_torrent_params load_torrent_file(std::string const& filename, load_torrent_limits const& cfg) │ │ │ │ +
    { │ │ │ │ + add_torrent_params ret; │ │ │ │ + ret.ti = std::make_shared<torrent_info>(filename, cfg); │ │ │ │ + update_atp(ret); │ │ │ │ + return ret; │ │ │ │ } │ │ │ │ │ │ │ │ - void mmap_disk_io::async_clear_piece(storage_index_t const storage │ │ │ │ - , piece_index_t const index, std::function<void(piece_index_t)> handler) │ │ │ │ + add_torrent_params load_torrent_buffer(span<char const> buffer, load_torrent_limits const& cfg) │ │ │ │ { │ │ │ │ - aux::mmap_disk_job* j = m_job_pool.allocate_job(aux::job_action_t::clear_piece); │ │ │ │ - j->storage = m_torrents[storage]->shared_from_this(); │ │ │ │ - j->piece = index; │ │ │ │ - j->callback = std::move(handler); │ │ │ │ - │ │ │ │ - // regular jobs are not guaranteed to be executed in-order │ │ │ │ - // since clear piece must guarantee that all write jobs that │ │ │ │ - // have been issued finish before the clear piece job completes │ │ │ │ - │ │ │ │ -
    │ │ │ │ -
    relevance 0../src/mmap_disk_io.cpp:1022Perhaps the job queue could be traversed and all jobs for this piece could be cancelled. If there are no threads currently writing to this piece, we could skip the fence altogether

    Perhaps the job queue could be traversed and all jobs for this │ │ │ │ -piece could be cancelled. If there are no threads currently writing │ │ │ │ -to this piece, we could skip the fence altogether

    ../src/mmap_disk_io.cpp:1022

    		j->storage = m_torrents[storage]->shared_from_this();
    │ │ │ │ -		j->argument = std::move(prios);
    │ │ │ │ -		j->callback = std::move(handler);
    │ │ │ │ -
    │ │ │ │ -		add_fence_job(j);
    │ │ │ │ +		add_torrent_params ret;
    │ │ │ │ +		ret.ti = std::make_shared<torrent_info>(buffer, cfg, from_span);
    │ │ │ │ +		update_atp(ret);
    │ │ │ │ +		return ret;
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ -	void mmap_disk_io::async_clear_piece(storage_index_t const storage
    │ │ │ │ -		, piece_index_t const index, std::function<void(piece_index_t)> handler)
    │ │ │ │ +	add_torrent_params load_torrent_parsed(bdecode_node const& torrent_file, load_torrent_limits const& cfg)
    │ │ │ │  	{
    │ │ │ │ -		aux::mmap_disk_job* j = m_job_pool.allocate_job(aux::job_action_t::clear_piece);
    │ │ │ │ -		j->storage = m_torrents[storage]->shared_from_this();
    │ │ │ │ -		j->piece = index;
    │ │ │ │ -		j->callback = std::move(handler);
    │ │ │ │ -
    │ │ │ │ -		// regular jobs are not guaranteed to be executed in-order
    │ │ │ │ -		// since clear piece must guarantee that all write jobs that
    │ │ │ │ -		// have been issued finish before the clear piece job completes
    │ │ │ │ -
    │ │ │ │ +		add_torrent_params ret;
    │ │ │ │ +		ret.ti = std::make_shared<torrent_info>(torrent_file, cfg);
    │ │ │ │ +		update_atp(ret);
    │ │ │ │ +		return ret;
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -
    add_fence_job(j); │ │ │ │ -
    } │ │ │ │ +} │ │ │ │ │ │ │ │ - status_t mmap_disk_io::do_hash(aux::mmap_disk_job* j) │ │ │ │ +
    relevance 0../src/session.cpp:540In C++17. use if constexpr instead

    In C++17. use if constexpr instead

    ../src/session.cpp:540

    	{}
    │ │ │ │ +	session_proxy::session_proxy(session_proxy const&) = default;
    │ │ │ │ +	session_proxy& session_proxy::operator=(session_proxy const&) & = default;
    │ │ │ │ +	session_proxy::session_proxy(session_proxy&&) noexcept = default;
    │ │ │ │ +	session_proxy& session_proxy::operator=(session_proxy&&) & noexcept = default;
    │ │ │ │ +	session_proxy::~session_proxy()
    │ │ │ │  	{
    │ │ │ │ -		// we're not using a cache. This is the simple path
    │ │ │ │ -		// just read straight from the file
    │ │ │ │ -		TORRENT_ASSERT(m_magic == 0x1337);
    │ │ │ │ -
    │ │ │ │ -		bool const v1 = bool(j->flags & disk_interface::v1_hash);
    │ │ │ │ -		bool const v2 = !j->d.h.block_hashes.empty();
    │ │ │ │ -
    │ │ │ │ -		int const piece_size = v1 ? j->storage->files().piece_size(j->piece) : 0;
    │ │ │ │ -		int const piece_size2 = v2 ? j->storage->files().piece_size2(j->piece) : 0;
    │ │ │ │ -		int const blocks_in_piece = v1 ? (piece_size + default_block_size - 1) / default_block_size : 0;
    │ │ │ │ -		int const blocks_in_piece2 = v2 ? j->storage->files().blocks_in_piece2(j->piece) : 0;
    │ │ │ │ -		aux::open_mode_t const file_mode = file_mode_for_job(j);
    │ │ │ │ -
    │ │ │ │ -		TORRENT_ASSERT(!v2 || int(j->d.h.block_hashes.size()) >= blocks_in_piece2);
    │ │ │ │ -		TORRENT_ASSERT(v1 || v2);
    │ │ │ │ -
    │ │ │ │ -		hasher h;
    │ │ │ │ -		int ret = 0;
    │ │ │ │ -		int offset = 0;
    │ │ │ │ -		int const blocks_to_read = std::max(blocks_in_piece, blocks_in_piece2);
    │ │ │ │ -		time_point const start_time = clock_type::now();
    │ │ │ │ -		for (int i = 0; i < blocks_to_read; ++i)
    │ │ │ │ +		if (m_thread && m_thread.use_count() == 1)
    │ │ │ │  		{
    │ │ │ │ -			bool const v2_block = i < blocks_in_piece2;
    │ │ │ │ +#if defined TORRENT_ASIO_DEBUGGING
    │ │ │ │ +			wait_for_asio_handlers();
    │ │ │ │ +#endif
    │ │ │ │ +			m_thread->join();
    │ │ │ │ +		}
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -			DLOG("do_hash: reading (piece: %d block: %d)\n", int(j->piece), i);
    │ │ │ │ -
    relevance 0../src/web_connection_base.cpp:72introduce a web-seed default class which has a low download priority

    introduce a web-seed default class which has a low download priority

    ../src/web_connection_base.cpp:72

    		: peer_connection(pack)
    │ │ │ │ -		, m_first_request(true)
    │ │ │ │ -		, m_ssl(false)
    │ │ │ │ -		, m_external_auth(web.auth)
    │ │ │ │ -		, m_extra_headers(web.extra_headers)
    │ │ │ │ -		, m_parser(http_parser::dont_parse_chunks)
    │ │ │ │ -		, m_body_start(0)
    │ │ │ │ +	TORRENT_EXPORT std::unique_ptr<disk_interface> default_disk_io_constructor(
    │ │ │ │ +		io_context& ios, settings_interface const& sett, counters& cnt)
    │ │ │ │  	{
    │ │ │ │ -		TORRENT_ASSERT(&web.peer_info == pack.peerinfo);
    │ │ │ │ -		// when going through a proxy, we don't necessarily have an endpoint here,
    │ │ │ │ -		// since the proxy might be resolving the hostname, not us
    │ │ │ │ -		TORRENT_ASSERT(web.endpoints.empty() || web.endpoints.front() == pack.endp);
    │ │ │ │ +#if TORRENT_HAVE_MMAP || TORRENT_HAVE_MAP_VIEW_OF_FILE
    │ │ │ │ +
    #include "libtorrent/aux_/disable_deprecation_warnings_push.hpp" │ │ │ │ +
    if (sizeof(void*) == 8) │ │ │ │ + return mmap_disk_io_constructor(ios, sett, cnt); │ │ │ │ + else │ │ │ │ + return posix_disk_io_constructor(ios, sett, cnt); │ │ │ │ +#include "libtorrent/aux_/disable_warnings_pop.hpp" │ │ │ │ +#else │ │ │ │ + return posix_disk_io_constructor(ios, sett, cnt); │ │ │ │ +#endif │ │ │ │ + } │ │ │ │ │ │ │ │ - INVARIANT_CHECK; │ │ │ │ +} │ │ │ │ +
    relevance 0../src/alert.cpp:404move this field into tracker_alert

    move this field into tracker_alert

    ../src/alert.cpp:404

    │ │ │ │ +		return torrent_alert::message() + ": state changed to: "
    │ │ │ │ +			+ state_str[state];
    │ │ │ │ +#endif
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -		TORRENT_ASSERT(is_outgoing());
    │ │ │ │ +	tracker_error_alert::tracker_error_alert(aux::stack_allocator& alloc
    │ │ │ │ +		, torrent_handle const& h, tcp::endpoint const& ep, int times
    │ │ │ │ +		, protocol_version v, string_view u, operation_t const operation
    │ │ │ │ +		, error_code const& e
    │ │ │ │ +		, string_view m)
    │ │ │ │ +		: tracker_alert(alloc, h, ep, u)
    │ │ │ │ +		, times_in_row(times)
    │ │ │ │ +		, error(e)
    │ │ │ │ +		, op(operation)
    │ │ │ │ +		, m_msg_idx(alloc.copy_string(m))
    │ │ │ │ +#if TORRENT_ABI_VERSION == 1
    │ │ │ │ +		, status_code(e && e.category() == http_category() ? e.value() : -1)
    │ │ │ │ +		, msg(m)
    │ │ │ │ +#endif
    │ │ │ │ +
    , version(v) │ │ │ │ +
    { │ │ │ │ + TORRENT_ASSERT(!u.empty()); │ │ │ │ + } │ │ │ │ │ │ │ │ - TORRENT_ASSERT(!m_torrent.lock()->is_upload_only()); │ │ │ │ + char const* tracker_error_alert::failure_reason() const │ │ │ │ + { │ │ │ │ + return m_alloc.get().ptr(m_msg_idx); │ │ │ │ + } │ │ │ │ │ │ │ │ - // we only want left-over bandwidth │ │ │ │ -
    │ │ │ │ -
    std::string protocol; │ │ │ │ - error_code ec; │ │ │ │ - std::tie(protocol, m_basic_auth, m_host, m_port, m_path) │ │ │ │ - = parse_url_components(web.url, ec); │ │ │ │ - TORRENT_ASSERT(!ec); │ │ │ │ + std::string tracker_error_alert::message() const │ │ │ │ + { │ │ │ │ +#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ + return {}; │ │ │ │ +#else │ │ │ │ + char ret[400]; │ │ │ │ + std::snprintf(ret, sizeof(ret), "%s %s %s \"%s\" (%d)" │ │ │ │ + , tracker_alert::message().c_str() │ │ │ │ + , version == protocol_version::V1 ? "v1" : "v2" │ │ │ │ + , convert_from_native(error.message()).c_str(), error_message() │ │ │ │ + , times_in_row); │ │ │ │ + return ret; │ │ │ │ +#endif │ │ │ │ + } │ │ │ │ │ │ │ │ - if (m_port == -1 && protocol == "http") │ │ │ │ - m_port = 80; │ │ │ │ + tracker_warning_alert::tracker_warning_alert(aux::stack_allocator& alloc │ │ │ │ + , torrent_handle const& h, tcp::endpoint const& ep │ │ │ │ + , string_view u, protocol_version v, string_view m) │ │ │ │ + : tracker_alert(alloc, h, ep, u) │ │ │ │ + , m_msg_idx(alloc.copy_string(m)) │ │ │ │ +#if TORRENT_ABI_VERSION == 1 │ │ │ │ +
    relevance 0../src/alert.cpp:438move this into tracker_alert

    move this into tracker_alert

    ../src/alert.cpp:438

    		return {};
    │ │ │ │ +#else
    │ │ │ │ +		char ret[400];
    │ │ │ │ +		std::snprintf(ret, sizeof(ret), "%s %s %s \"%s\" (%d)"
    │ │ │ │ +			, tracker_alert::message().c_str()
    │ │ │ │ +			, version == protocol_version::V1 ? "v1" : "v2"
    │ │ │ │ +			, convert_from_native(error.message()).c_str(), error_message()
    │ │ │ │ +			, times_in_row);
    │ │ │ │ +		return ret;
    │ │ │ │ +#endif
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -#if TORRENT_USE_SSL
    │ │ │ │ -		if (protocol == "https")
    │ │ │ │ -		{
    │ │ │ │ -			m_ssl = true;
    │ │ │ │ -			if (m_port == -1) m_port = 443;
    │ │ │ │ -		}
    │ │ │ │ +	tracker_warning_alert::tracker_warning_alert(aux::stack_allocator& alloc
    │ │ │ │ +		, torrent_handle const& h, tcp::endpoint const& ep
    │ │ │ │ +		, string_view u, protocol_version v, string_view m)
    │ │ │ │ +		: tracker_alert(alloc, h, ep, u)
    │ │ │ │ +		, m_msg_idx(alloc.copy_string(m))
    │ │ │ │ +#if TORRENT_ABI_VERSION == 1
    │ │ │ │ +		, msg(m)
    │ │ │ │  #endif
    │ │ │ │ +
    , version(v) │ │ │ │ +
    { │ │ │ │ + TORRENT_ASSERT(!u.empty()); │ │ │ │ + } │ │ │ │ │ │ │ │ - if (!m_basic_auth.empty()) │ │ │ │ - m_basic_auth = base64encode(m_basic_auth); │ │ │ │ + char const* tracker_warning_alert::warning_message() const │ │ │ │ + { │ │ │ │ + return m_alloc.get().ptr(m_msg_idx); │ │ │ │ + } │ │ │ │ │ │ │ │ - m_server_string = m_host; │ │ │ │ - aux::verify_encoding(m_server_string); │ │ │ │ + std::string tracker_warning_alert::message() const │ │ │ │ + { │ │ │ │ +#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ + return {}; │ │ │ │ +#else │ │ │ │ + return tracker_alert::message() + (version == protocol_version::V1 ? " v1" : " v2") + " warning: " + warning_message(); │ │ │ │ +#endif │ │ │ │ } │ │ │ │ │ │ │ │ - int web_connection_base::timeout() const │ │ │ │ + scrape_reply_alert::scrape_reply_alert(aux::stack_allocator& alloc │ │ │ │ + , torrent_handle const& h, tcp::endpoint const& ep │ │ │ │ + , int incomp, int comp, string_view u, protocol_version const v) │ │ │ │ + : tracker_alert(alloc, h, ep, u) │ │ │ │ + , incomplete(incomp) │ │ │ │ + , complete(comp) │ │ │ │ +
    relevance 0../src/alert.cpp:464move this into tracker_alert

    move this into tracker_alert

    ../src/alert.cpp:464

    	char const* tracker_warning_alert::warning_message() const
    │ │ │ │  	{
    │ │ │ │ -		// since this is a web seed, change the timeout
    │ │ │ │ -		// according to the settings.
    │ │ │ │ -		return m_settings.get_int(settings_pack::urlseed_timeout);
    │ │ │ │ +		return m_alloc.get().ptr(m_msg_idx);
    │ │ │ │  	}
    │ │ │ │ -
    relevance 0../src/torrent_info.cpp:887this should be considered a failure, and the .torrent file rejected

    this should be considered a failure, and the .torrent file │ │ │ │ -rejected

    ../src/torrent_info.cpp:887

    			std::string ext = extension(filename);
    │ │ │ │ -			int cnt = 0;
    │ │ │ │ -			for (;;)
    │ │ │ │ -			{
    │ │ │ │ -				++cnt;
    │ │ │ │ -				char new_ext[50];
    │ │ │ │ -				std::snprintf(new_ext, sizeof(new_ext), ".%d%s", cnt, ext.c_str());
    │ │ │ │ -				filename = base + new_ext;
    │ │ │ │  
    │ │ │ │ -				boost::crc_optimal<32, 0x1EDC6F41, 0xFFFFFFFF, 0xFFFFFFFF, true, true> crc;
    │ │ │ │ -				process_string_lowercase(crc, filename);
    │ │ │ │ -				std::uint32_t const new_hash = crc.checksum();
    │ │ │ │ -				if (files.find(new_hash) == files.end())
    │ │ │ │ -				{
    │ │ │ │ -					files.insert({new_hash, {i, 0}});
    │ │ │ │ -					break;
    │ │ │ │ -				}
    │ │ │ │ -				++num_collisions;
    │ │ │ │ -				if (num_collisions > 100)
    │ │ │ │ -				{
    │ │ │ │ -
    } │ │ │ │ -
    } │ │ │ │ + std::string tracker_warning_alert::message() const │ │ │ │ + { │ │ │ │ +#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ + return {}; │ │ │ │ +#else │ │ │ │ + return tracker_alert::message() + (version == protocol_version::V1 ? " v1" : " v2") + " warning: " + warning_message(); │ │ │ │ +#endif │ │ │ │ + } │ │ │ │ │ │ │ │ - copy_on_write(); │ │ │ │ - m_files.rename_file(i, filename); │ │ │ │ - } │ │ │ │ + scrape_reply_alert::scrape_reply_alert(aux::stack_allocator& alloc │ │ │ │ + , torrent_handle const& h, tcp::endpoint const& ep │ │ │ │ + , int incomp, int comp, string_view u, protocol_version const v) │ │ │ │ + : tracker_alert(alloc, h, ep, u) │ │ │ │ + , incomplete(incomp) │ │ │ │ + , complete(comp) │ │ │ │ +
    , version(v) │ │ │ │ +
    { │ │ │ │ + TORRENT_ASSERT(!u.empty()); │ │ │ │ } │ │ │ │ │ │ │ │ - void torrent_info::remap_files(file_storage const& f) │ │ │ │ + std::string scrape_reply_alert::message() const │ │ │ │ { │ │ │ │ - INVARIANT_CHECK; │ │ │ │ +#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ + return {}; │ │ │ │ +#else │ │ │ │ + char ret[400]; │ │ │ │ + std::snprintf(ret, sizeof(ret), "%s %s scrape reply: %d %d" │ │ │ │ + , tracker_alert::message().c_str() │ │ │ │ + , version == protocol_version::V1 ? "v1" : "v2" │ │ │ │ + , incomplete, complete); │ │ │ │ + return ret; │ │ │ │ +#endif │ │ │ │ + } │ │ │ │ │ │ │ │ - TORRENT_ASSERT(is_loaded()); │ │ │ │ - // the new specified file storage must have the exact │ │ │ │ - // same size as the current file storage │ │ │ │ - TORRENT_ASSERT(m_files.total_size() == f.total_size()); │ │ │ │ + scrape_failed_alert::scrape_failed_alert(aux::stack_allocator& alloc │ │ │ │ + , torrent_handle const& h, tcp::endpoint const& ep │ │ │ │ + , string_view u, protocol_version const v, error_code const& e) │ │ │ │ + : tracker_alert(alloc, h, ep, u) │ │ │ │ + , error(e) │ │ │ │ + , m_msg_idx() │ │ │ │ +#if TORRENT_ABI_VERSION == 1 │ │ │ │ + , msg(convert_from_native(e.message())) │ │ │ │ +#endif │ │ │ │ +
    relevance 0../src/alert.cpp:493move this into tracker_alert

    move this into tracker_alert

    ../src/alert.cpp:493

    		return {};
    │ │ │ │ +#else
    │ │ │ │ +		char ret[400];
    │ │ │ │ +		std::snprintf(ret, sizeof(ret), "%s %s scrape reply: %d %d"
    │ │ │ │ +			, tracker_alert::message().c_str()
    │ │ │ │ +			, version == protocol_version::V1 ? "v1" : "v2"
    │ │ │ │ +			, incomplete, complete);
    │ │ │ │ +		return ret;
    │ │ │ │ +#endif
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -		if (m_files.total_size() != f.total_size()) return;
    │ │ │ │ -		copy_on_write();
    │ │ │ │ -		m_files = f;
    │ │ │ │ -		m_files.set_num_pieces(m_orig_files->num_pieces());
    │ │ │ │ -		m_files.set_piece_length(m_orig_files->piece_length());
    │ │ │ │ +	scrape_failed_alert::scrape_failed_alert(aux::stack_allocator& alloc
    │ │ │ │ +		, torrent_handle const& h, tcp::endpoint const& ep
    │ │ │ │ +		, string_view u, protocol_version const v, error_code const& e)
    │ │ │ │ +		: tracker_alert(alloc, h, ep, u)
    │ │ │ │ +		, error(e)
    │ │ │ │ +		, m_msg_idx()
    │ │ │ │ +#if TORRENT_ABI_VERSION == 1
    │ │ │ │ +		, msg(convert_from_native(e.message()))
    │ │ │ │ +#endif
    │ │ │ │ +
    , version(v) │ │ │ │ +
    { │ │ │ │ + TORRENT_ASSERT(!u.empty()); │ │ │ │ } │ │ │ │ │ │ │ │ + scrape_failed_alert::scrape_failed_alert(aux::stack_allocator& alloc │ │ │ │ + , torrent_handle const& h, tcp::endpoint const& ep │ │ │ │ + , string_view u, string_view m) │ │ │ │ + : tracker_alert(alloc, h, ep, u) │ │ │ │ + , error(errors::tracker_failure) │ │ │ │ + , m_msg_idx(alloc.copy_string(m)) │ │ │ │ #if TORRENT_ABI_VERSION == 1 │ │ │ │ - // standard constructor that parses a torrent file │ │ │ │ - torrent_info::torrent_info(entry const& torrent_file) │ │ │ │ + , msg(m) │ │ │ │ +#endif │ │ │ │ { │ │ │ │ - std::vector<char> tmp; │ │ │ │ - std::back_insert_iterator<std::vector<char>> out(tmp); │ │ │ │ - bencode(out, torrent_file); │ │ │ │ -
    relevance 0../src/load_torrent.cpp:121move the loading logic from torrent_info constructor into here

    move the loading logic from torrent_info constructor into here

    ../src/load_torrent.cpp:121

    				mask.resize(std::size_t(full_size), false);
    │ │ │ │ -				for (int i = merkle_first_leaf(piece_layer_size)
    │ │ │ │ -					, end = i + num_pieces; i < end; ++i)
    │ │ │ │ -				{
    │ │ │ │ -					mask[std::size_t(i)] = true;
    │ │ │ │ -				}
    │ │ │ │ -			}
    │ │ │ │ -			ti->free_piece_layers();
    │ │ │ │ -		}
    │ │ │ │ -		atp.info_hashes = atp.ti->info_hashes();
    │ │ │ │ +		TORRENT_ASSERT(!u.empty());
    │ │ │ │  	}
    │ │ │ │ -}
    │ │ │ │  
    │ │ │ │ -	add_torrent_params load_torrent_file(std::string const& filename)
    │ │ │ │ -	{ return load_torrent_file(filename, load_torrent_limits{}); }
    │ │ │ │ -	add_torrent_params load_torrent_buffer(span<char const> buffer)
    │ │ │ │ -	{ return load_torrent_buffer(buffer, load_torrent_limits{}); }
    │ │ │ │ -	add_torrent_params load_torrent_parsed(bdecode_node const& torrent_file)
    │ │ │ │ -	{ return load_torrent_parsed(torrent_file, load_torrent_limits{}); }
    │ │ │ │ +	char const* scrape_failed_alert::error_message() const
    │ │ │ │ +	{
    │ │ │ │ +		if (m_msg_idx == aux::allocation_slot()) return "";
    │ │ │ │ +		else return m_alloc.get().ptr(m_msg_idx);
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -
    add_torrent_params load_torrent_file(std::string const& filename, load_torrent_limits const& cfg) │ │ │ │ + std::string scrape_failed_alert::message() const │ │ │ │ + { │ │ │ │ +#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ + return {}; │ │ │ │ +#else │ │ │ │ + return tracker_alert::message() + " scrape failed: " + error_message(); │ │ │ │ +#endif │ │ │ │ +
    relevance 0../src/alert.cpp:532move this field into tracker_alert

    move this field into tracker_alert

    ../src/alert.cpp:532

    	char const* scrape_failed_alert::error_message() const
    │ │ │ │ +	{
    │ │ │ │ +		if (m_msg_idx == aux::allocation_slot()) return "";
    │ │ │ │ +		else return m_alloc.get().ptr(m_msg_idx);
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +	std::string scrape_failed_alert::message() const
    │ │ │ │ +	{
    │ │ │ │ +#ifdef TORRENT_DISABLE_ALERT_MSG
    │ │ │ │ +		return {};
    │ │ │ │ +#else
    │ │ │ │ +		return tracker_alert::message() + " scrape failed: " + error_message();
    │ │ │ │ +#endif
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +	tracker_reply_alert::tracker_reply_alert(aux::stack_allocator& alloc
    │ │ │ │ +		, torrent_handle const& h, tcp::endpoint const& ep
    │ │ │ │ +		, int np, protocol_version v, string_view u)
    │ │ │ │ +		: tracker_alert(alloc, h, ep, u)
    │ │ │ │ +		, num_peers(np)
    │ │ │ │ +
    , version(v) │ │ │ │
    { │ │ │ │ - add_torrent_params ret; │ │ │ │ - ret.ti = std::make_shared<torrent_info>(filename, cfg); │ │ │ │ - update_atp(ret); │ │ │ │ - return ret; │ │ │ │ + TORRENT_ASSERT(!u.empty()); │ │ │ │ } │ │ │ │ │ │ │ │ - add_torrent_params load_torrent_buffer(span<char const> buffer, load_torrent_limits const& cfg) │ │ │ │ + std::string tracker_reply_alert::message() const │ │ │ │ { │ │ │ │ - add_torrent_params ret; │ │ │ │ - ret.ti = std::make_shared<torrent_info>(buffer, cfg, from_span); │ │ │ │ - update_atp(ret); │ │ │ │ +#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ + return {}; │ │ │ │ +#else │ │ │ │ + char ret[400]; │ │ │ │ + std::snprintf(ret, sizeof(ret), "%s %s received peers: %d" │ │ │ │ + , tracker_alert::message().c_str() │ │ │ │ + , version == protocol_version::V1 ? "v1" : "v2" │ │ │ │ + , num_peers); │ │ │ │ return ret; │ │ │ │ +#endif │ │ │ │ } │ │ │ │ │ │ │ │ - add_torrent_params load_torrent_parsed(bdecode_node const& torrent_file, load_torrent_limits const& cfg) │ │ │ │ + dht_reply_alert::dht_reply_alert(aux::stack_allocator& alloc │ │ │ │ + , torrent_handle const& h │ │ │ │ + , int np) │ │ │ │ + : tracker_alert(alloc, h, {}, "") │ │ │ │ + , num_peers(np) │ │ │ │ + {} │ │ │ │ + │ │ │ │ + std::string dht_reply_alert::message() const │ │ │ │ { │ │ │ │ - add_torrent_params ret; │ │ │ │ - ret.ti = std::make_shared<torrent_info>(torrent_file, cfg); │ │ │ │ - update_atp(ret); │ │ │ │ +#ifdef TORRENT_DISABLE_ALERT_MSG │ │ │ │ + return {}; │ │ │ │ +#else │ │ │ │ +
    relevance 0../src/alert.cpp:576move this to tracker_alert

    move this to tracker_alert

    ../src/alert.cpp:576

    		, num_peers(np)
    │ │ │ │ +	{}
    │ │ │ │ +
    │ │ │ │ +	std::string dht_reply_alert::message() const
    │ │ │ │ +	{
    │ │ │ │ +#ifdef TORRENT_DISABLE_ALERT_MSG
    │ │ │ │ +		return {};
    │ │ │ │ +#else
    │ │ │ │ +		char ret[400];
    │ │ │ │ +		std::snprintf(ret, sizeof(ret), "%s received DHT peers: %d"
    │ │ │ │ +			, tracker_alert::message().c_str(), num_peers);
    │ │ │ │  		return ret;
    │ │ │ │ +#endif
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ -}
    │ │ │ │ +	tracker_announce_alert::tracker_announce_alert(aux::stack_allocator& alloc
    │ │ │ │ +		, torrent_handle const& h, tcp::endpoint const& ep, string_view u
    │ │ │ │ +		, protocol_version const v, event_t const e)
    │ │ │ │ +		: tracker_alert(alloc, h, ep, u)
    │ │ │ │ +		, event(e)
    │ │ │ │ +
    , version(v) │ │ │ │ +
    { │ │ │ │ + TORRENT_ASSERT(!u.empty()); │ │ │ │ + } │ │ │ │ │ │ │ │ -
    relevance 0../src/add_torrent_params.cpp:78pre C++17, GCC and msvc does not make std::string nothrow move assignable, which means no type containing a string will be nothrow move assignable by default either static_assert(std::is_nothrow_move_assignable::value , "should be nothrow move assignable");

    pre C++17, GCC and msvc does not make std::string nothrow move │ │ │ │ -assignable, which means no type containing a string will be nothrow move │ │ │ │ -assignable by default either │ │ │ │ -static_assert(std::is_nothrow_move_assignable::value │ │ │ │ -, "should be nothrow move assignable");

    ../src/add_torrent_params.cpp:78

    			DECL_FLAG(sequential_download);
    │ │ │ │ -			DECL_FLAG(pinned);
    │ │ │ │ -			DECL_FLAG(stop_when_ready);
    │ │ │ │ -			DECL_FLAG(override_trackers);
    │ │ │ │ -			DECL_FLAG(override_web_seeds);
    │ │ │ │ -			DECL_FLAG(need_save_resume);
    │ │ │ │ -			DECL_FLAG(override_resume_data);
    │ │ │ │ -			DECL_FLAG(merge_resume_trackers);
    │ │ │ │ -			DECL_FLAG(use_resume_save_path);
    │ │ │ │ -			DECL_FLAG(merge_resume_http_seeds);
    │ │ │ │ -			DECL_FLAG(default_flags);
    │ │ │ │ -#undef DECL_FLAG
    │ │ │ │ -#endif // TORRENT_ABI_VERSION
    │ │ │ │ +	std::string tracker_announce_alert::message() const
    │ │ │ │ +	{
    │ │ │ │ +#ifdef TORRENT_DISABLE_ALERT_MSG
    │ │ │ │ +		return {};
    │ │ │ │ +#else
    │ │ │ │ +		static const char* const event_str[] = {"none", "completed", "started", "stopped", "paused"};
    │ │ │ │ +		return tracker_alert::message()
    │ │ │ │ +			+ (version == protocol_version::V1 ? " v1" : " v2")
    │ │ │ │ +			+ " sending announce (" + event_str[static_cast<int>(event)] + ")";
    │ │ │ │ +#endif
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -	static_assert(std::is_nothrow_move_constructible<add_torrent_params>::value
    │ │ │ │ -		, "should be nothrow move constructible");
    │ │ │ │ +	hash_failed_alert::hash_failed_alert(
    │ │ │ │ +		aux::stack_allocator& alloc
    │ │ │ │ +		, torrent_handle const& h
    │ │ │ │ +		, piece_index_t index)
    │ │ │ │ +		: torrent_alert(alloc, h)
    │ │ │ │ +		, piece_index(index)
    │ │ │ │ +	{
    │ │ │ │ +		TORRENT_ASSERT(index >= piece_index_t(0));
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -	static_assert(std::is_nothrow_move_constructible<std::string>::value
    │ │ │ │ -		, "should be nothrow move constructible");
    │ │ │ │ +	std::string hash_failed_alert::message() const
    │ │ │ │ +	{
    │ │ │ │ +#ifdef TORRENT_DISABLE_ALERT_MSG
    │ │ │ │ +		return {};
    │ │ │ │ +
    relevance 0../src/kademlia/item.cpp:143implement ctor for entry from bdecode_node?

    implement ctor for entry from bdecode_node?

    ../src/kademlia/item.cpp:143

    	, secret_key const& sk)
    │ │ │ │ +{
    │ │ │ │ +	char str[1200];
    │ │ │ │ +	int const len = canonical_string(v, seq, salt, str);
    │ │ │ │  
    │ │ │ │ -
    │ │ │ │ -
    relevance 0../src/add_torrent_params.cpp:84it would be nice if this was nothrow default constructible static_assert(std::is_nothrow_default_constructible::value , "should be nothrow default constructible");

    it would be nice if this was nothrow default constructible │ │ │ │ -static_assert(std::is_nothrow_default_constructible::value │ │ │ │ -, "should be nothrow default constructible");

    ../src/add_torrent_params.cpp:84

    			DECL_FLAG(pinned);
    │ │ │ │ -			DECL_FLAG(stop_when_ready);
    │ │ │ │ -			DECL_FLAG(override_trackers);
    │ │ │ │ -			DECL_FLAG(override_web_seeds);
    │ │ │ │ -			DECL_FLAG(need_save_resume);
    │ │ │ │ -			DECL_FLAG(override_resume_data);
    │ │ │ │ -			DECL_FLAG(merge_resume_trackers);
    │ │ │ │ -			DECL_FLAG(use_resume_save_path);
    │ │ │ │ -			DECL_FLAG(merge_resume_http_seeds);
    │ │ │ │ -			DECL_FLAG(default_flags);
    │ │ │ │ -#undef DECL_FLAG
    │ │ │ │ -#endif // TORRENT_ABI_VERSION
    │ │ │ │ +	return ed25519_sign({str, len}, pk, sk);
    │ │ │ │ +}
    │ │ │ │  
    │ │ │ │ -	static_assert(std::is_nothrow_move_constructible<add_torrent_params>::value
    │ │ │ │ -		, "should be nothrow move constructible");
    │ │ │ │ +item::item(public_key const& pk, span<char const> salt)
    │ │ │ │ +	: m_salt(salt.data(), static_cast<std::size_t>(salt.size()))
    │ │ │ │ +	, m_pk(pk)
    │ │ │ │ +	, m_mutable(true)
    │ │ │ │ +{}
    │ │ │ │  
    │ │ │ │ -	static_assert(std::is_nothrow_move_constructible<std::string>::value
    │ │ │ │ -		, "should be nothrow move constructible");
    │ │ │ │ +item::item(entry v)
    │ │ │ │ +	: m_value(std::move(v))
    │ │ │ │ +{}
    │ │ │ │  
    │ │ │ │ +item::item(bdecode_node const& v)
    │ │ │ │ +{
    │ │ │ │ +
    m_value = v; │ │ │ │ +
    } │ │ │ │ │ │ │ │ -
    │ │ │ │ -
    namespace aux { │ │ │ │ +item::item(entry v, span<char const> salt │ │ │ │ + , sequence_number const seq, public_key const& pk, secret_key const& sk) │ │ │ │ +{ │ │ │ │ + assign(std::move(v), salt, seq, pk, sk); │ │ │ │ +} │ │ │ │ │ │ │ │ - // returns whether this add_torrent_params object has "resume-data", i.e. │ │ │ │ - // information about which pieces we have. │ │ │ │ - bool contains_resume_data(add_torrent_params const& atp) │ │ │ │ - { │ │ │ │ - return !atp.have_pieces.empty() │ │ │ │ - || (atp.flags & torrent_flags::seed_mode); │ │ │ │ - } │ │ │ │ +void item::assign(entry v) │ │ │ │ +{ │ │ │ │ + m_mutable = false; │ │ │ │ + m_value = std::move(v); │ │ │ │ } │ │ │ │ │ │ │ │ +void item::assign(entry v, span<char const> salt │ │ │ │ + , sequence_number const seq, public_key const& pk, secret_key const& sk) │ │ │ │ +{ │ │ │ │ + std::array<char, 1000> buffer; │ │ │ │ + int const bsize = bencode(buffer.begin(), v); │ │ │ │ + TORRENT_ASSERT(bsize <= 1000); │ │ │ │ + m_sig = sign_mutable_item(span<char const>(buffer).first(bsize) │ │ │ │ + , salt, seq, pk, sk); │ │ │ │ + m_salt.assign(salt.data(), static_cast<std::size_t>(salt.size())); │ │ │ │ + m_pk = pk; │ │ │ │ + m_seq = seq; │ │ │ │ + m_mutable = true; │ │ │ │ + m_value = std::move(v); │ │ │ │ } │ │ │ │ -
    relevance 0../src/kademlia/node.cpp:1177keep the returned value to pass as a limit to write_nodes_entries when implemented

    keep the returned value to pass as a limit │ │ │ │ + │ │ │ │ +void item::assign(bdecode_node const& v) │ │ │ │ +relevance 0../src/kademlia/node.cpp:1177keep the returned value to pass as a limit to write_nodes_entries when implemented

    keep the returned value to pass as a limit │ │ │ │ to write_nodes_entries when implemented

    ../src/kademlia/node.cpp:1177

    		}
    │ │ │ │  	}
    │ │ │ │  	else if (query == "sample_infohashes")
    │ │ │ │  	{
    │ │ │ │  		static key_desc_t const msg_desc[] = {
    │ │ │ │  			{"target", bdecode_node::string_t, 20, 0},
    │ │ │ │  			{"want", bdecode_node::list_t, 0, key_desc_t::optional},
    │ │ │ │ @@ -9946,15 +9997,15 @@
    │ │ │ │  
    │ │ │ │  		sha1_hash const target(target_ent.string_ptr());
    │ │ │ │  		// always return nodes as well as peers
    │ │ │ │  		write_nodes_entries(target, arg_ent.dict_find_list("want"), reply);
    │ │ │ │  	}
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │ -
    relevance 0../src/kademlia/node.cpp:1205limit number of entries in the result

    limit number of entries in the result

    ../src/kademlia/node.cpp:1205

    		// if we don't recognize the message but there's a
    │ │ │ │ +
    relevance 0../src/kademlia/node.cpp:1205limit number of entries in the result

    limit number of entries in the result

    ../src/kademlia/node.cpp:1205

    		// if we don't recognize the message but there's a
    │ │ │ │  		// 'target' or 'info_hash' in the arguments, treat it
    │ │ │ │  		// as find_node to be future compatible
    │ │ │ │  		bdecode_node target_ent = arg_ent.dict_find_string("target");
    │ │ │ │  		if (!target_ent || target_ent.string_length() != 20)
    │ │ │ │  		{
    │ │ │ │  			target_ent = arg_ent.dict_find_string("info_hash");
    │ │ │ │  			if (!target_ent || target_ent.string_length() != 20)
    │ │ │ │ @@ -9997,216 +10048,15 @@
    │ │ │ │  		std::vector<node_entry> const n = wanted_node->m_table.find_node(info_hash, {});
    │ │ │ │  		r[wanted_node->protocol_nodes_key()] = write_nodes_entry(n);
    │ │ │ │  	}
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │  node::protocol_descriptor const& node::map_protocol_to_descriptor(udp const protocol)
    │ │ │ │  {
    │ │ │ │ -
    relevance 0../src/kademlia/put_data.cpp:92what if o is not an instance of put_data_observer? This need to be redesigned for better type safety.

    what if o is not an instance of put_data_observer? This need to be │ │ │ │ -redesigned for better type safety.

    ../src/kademlia/put_data.cpp:92

    	}
    │ │ │ │ -}
    │ │ │ │ -
    │ │ │ │ -void put_data::done()
    │ │ │ │ -{
    │ │ │ │ -	m_done = true;
    │ │ │ │ -
    │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -	get_node().observer()->log(dht_logger::traversal, "[%u] %s DONE, response %d, timeout %d"
    │ │ │ │ -		, id(), name(), num_responses(), num_timeouts());
    │ │ │ │ -#endif
    │ │ │ │ -
    │ │ │ │ -	m_put_callback(m_data, num_responses());
    │ │ │ │ -	traversal_algorithm::done();
    │ │ │ │ -}
    │ │ │ │ -
    │ │ │ │ -bool put_data::invoke(observer_ptr o)
    │ │ │ │ -{
    │ │ │ │ -	if (m_done) return false;
    │ │ │ │ -
    │ │ │ │ -
    auto* po = static_cast<put_data_observer*>(o.get()); │ │ │ │ -
    │ │ │ │ - entry e; │ │ │ │ - e["y"] = "q"; │ │ │ │ - e["q"] = "put"; │ │ │ │ - entry& a = e["a"]; │ │ │ │ - a["v"] = m_data.value(); │ │ │ │ - a["token"] = po->m_token; │ │ │ │ - if (m_data.is_mutable()) │ │ │ │ - { │ │ │ │ - a["k"] = m_data.pk().bytes; │ │ │ │ - a["seq"] = m_data.seq().value; │ │ │ │ - a["sig"] = m_data.sig().bytes; │ │ │ │ - if (!m_data.salt().empty()) │ │ │ │ - { │ │ │ │ - a["salt"] = m_data.salt(); │ │ │ │ - } │ │ │ │ - } │ │ │ │ - │ │ │ │ - m_node.stats_counters().inc_stats_counter(counters::dht_put_out); │ │ │ │ - │ │ │ │ - return m_node.m_rpc.invoke(e, o->target_ep(), o); │ │ │ │ -} │ │ │ │ - │ │ │ │ -} } // namespace libtorrent::dht │ │ │ │ -
    relevance 0../src/kademlia/node_id.cpp:66it's a little bit weird to return 159 - leading zeroes. It should probably be 160 - leading zeroes, but all other code in here is tuned to this expectation now, and it doesn't really matter (other than complexity)

    it's a little bit weird to return 159 - leading zeroes. It should │ │ │ │ -probably be 160 - leading zeroes, but all other code in here is tuned to │ │ │ │ -this expectation now, and it doesn't really matter (other than complexity)

    ../src/kademlia/node_id.cpp:66

    │ │ │ │ -// returns the distance between the two nodes
    │ │ │ │ -// using the kademlia XOR-metric
    │ │ │ │ -node_id distance(node_id const& n1, node_id const& n2)
    │ │ │ │ -{
    │ │ │ │ -	return n1 ^ n2;
    │ │ │ │ -}
    │ │ │ │ -
    │ │ │ │ -// returns true if: distance(n1, ref) < distance(n2, ref)
    │ │ │ │ -bool compare_ref(node_id const& n1, node_id const& n2, node_id const& ref)
    │ │ │ │ -{
    │ │ │ │ -	node_id const lhs = n1 ^ ref;
    │ │ │ │ -	node_id const rhs = n2 ^ ref;
    │ │ │ │ -	return lhs < rhs;
    │ │ │ │ -}
    │ │ │ │ -
    │ │ │ │ -// returns n in: 2^n <= distance(n1, n2) < 2^(n+1)
    │ │ │ │ -// useful for finding out which bucket a node belongs to
    │ │ │ │ -int distance_exp(node_id const& n1, node_id const& n2)
    │ │ │ │ -{
    │ │ │ │ -
    return std::max(159 - distance(n1, n2).count_leading_zeroes(), 0); │ │ │ │ -
    } │ │ │ │ - │ │ │ │ -int min_distance_exp(node_id const& n1, std::vector<node_id> const& ids) │ │ │ │ -{ │ │ │ │ - TORRENT_ASSERT(ids.size() > 0); │ │ │ │ - │ │ │ │ - int min = 160; // see distance_exp for the why of this constant │ │ │ │ - for (auto const& node_id : ids) │ │ │ │ - { │ │ │ │ - min = std::min(min, distance_exp(n1, node_id)); │ │ │ │ - } │ │ │ │ - │ │ │ │ - return min; │ │ │ │ -} │ │ │ │ - │ │ │ │ -node_id generate_id_impl(address const& ip_, std::uint32_t r) │ │ │ │ -{ │ │ │ │ - std::uint8_t* ip = nullptr; │ │ │ │ - │ │ │ │ - static std::uint8_t const v4mask[] = { 0x03, 0x0f, 0x3f, 0xff }; │ │ │ │ - static std::uint8_t const v6mask[] = { 0x01, 0x03, 0x07, 0x0f, 0x1f, 0x3f, 0x7f, 0xff }; │ │ │ │ - std::uint8_t const* mask = nullptr; │ │ │ │ - int num_octets = 0; │ │ │ │ - │ │ │ │ - address_v4::bytes_type b4{}; │ │ │ │ - address_v6::bytes_type b6{}; │ │ │ │ - if (ip_.is_v6()) │ │ │ │ - { │ │ │ │ - b6 = ip_.to_v6().to_bytes(); │ │ │ │ - ip = b6.data(); │ │ │ │ -
    relevance 0../src/kademlia/dht_tracker.cpp:317pick the closest node rather than the first

    pick the closest node rather than the first

    ../src/kademlia/dht_tracker.cpp:317

    │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -		m_log->log(dht_logger::tracker, "*** new write key*** %d nodes"
    │ │ │ │ -			, int(m_nodes.size()));
    │ │ │ │ -#endif
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -	void dht_tracker::update_storage_node_ids()
    │ │ │ │ -	{
    │ │ │ │ -		std::vector<sha1_hash> ids;
    │ │ │ │ -		for (auto& n : m_nodes)
    │ │ │ │ -			ids.push_back(n.second.dht.nid());
    │ │ │ │ -		m_storage.update_node_ids(ids);
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -	node* dht_tracker::get_node(node_id const& id, std::string const& family_name)
    │ │ │ │ -	{
    │ │ │ │ -		TORRENT_UNUSED(id);
    │ │ │ │ -		for (auto& n : m_nodes)
    │ │ │ │ -		{
    │ │ │ │ -
    if (n.second.dht.protocol_family_name() == family_name) │ │ │ │ -
    return &n.second.dht; │ │ │ │ - } │ │ │ │ - │ │ │ │ - return nullptr; │ │ │ │ - } │ │ │ │ - │ │ │ │ - void dht_tracker::get_peers(sha1_hash const& ih │ │ │ │ - , std::function<void(std::vector<tcp::endpoint> const&)> f) │ │ │ │ - { │ │ │ │ - for (auto& n : m_nodes) │ │ │ │ - n.second.dht.get_peers(ih, f, {}, {}); │ │ │ │ - } │ │ │ │ - │ │ │ │ - void dht_tracker::announce(sha1_hash const& ih, int listen_port │ │ │ │ - , announce_flags_t const flags │ │ │ │ - , std::function<void(std::vector<tcp::endpoint> const&)> f) │ │ │ │ - { │ │ │ │ - for (auto& n : m_nodes) │ │ │ │ - n.second.dht.announce(ih, listen_port, flags, f); │ │ │ │ - } │ │ │ │ - │ │ │ │ - void dht_tracker::sample_infohashes(udp::endpoint const& ep, sha1_hash const& target │ │ │ │ - , std::function<void(node_id │ │ │ │ - , time_duration │ │ │ │ - , int, std::vector<sha1_hash> │ │ │ │ - , std::vector<std::pair<sha1_hash, udp::endpoint>>)> f) │ │ │ │ - { │ │ │ │ - for (auto& n : m_nodes) │ │ │ │ - { │ │ │ │ - if (ep.protocol() != (n.first.get_external_address().is_v4() ? udp::v4() : udp::v6())) │ │ │ │ -
    relevance 0../src/kademlia/item.cpp:143implement ctor for entry from bdecode_node?

    implement ctor for entry from bdecode_node?

    ../src/kademlia/item.cpp:143

    	, secret_key const& sk)
    │ │ │ │ -{
    │ │ │ │ -	char str[1200];
    │ │ │ │ -	int const len = canonical_string(v, seq, salt, str);
    │ │ │ │ -
    │ │ │ │ -	return ed25519_sign({str, len}, pk, sk);
    │ │ │ │ -}
    │ │ │ │ -
    │ │ │ │ -item::item(public_key const& pk, span<char const> salt)
    │ │ │ │ -	: m_salt(salt.data(), static_cast<std::size_t>(salt.size()))
    │ │ │ │ -	, m_pk(pk)
    │ │ │ │ -	, m_mutable(true)
    │ │ │ │ -{}
    │ │ │ │ -
    │ │ │ │ -item::item(entry v)
    │ │ │ │ -	: m_value(std::move(v))
    │ │ │ │ -{}
    │ │ │ │ -
    │ │ │ │ -item::item(bdecode_node const& v)
    │ │ │ │ -{
    │ │ │ │ -
    m_value = v; │ │ │ │ -
    } │ │ │ │ - │ │ │ │ -item::item(entry v, span<char const> salt │ │ │ │ - , sequence_number const seq, public_key const& pk, secret_key const& sk) │ │ │ │ -{ │ │ │ │ - assign(std::move(v), salt, seq, pk, sk); │ │ │ │ -} │ │ │ │ - │ │ │ │ -void item::assign(entry v) │ │ │ │ -{ │ │ │ │ - m_mutable = false; │ │ │ │ - m_value = std::move(v); │ │ │ │ -} │ │ │ │ - │ │ │ │ -void item::assign(entry v, span<char const> salt │ │ │ │ - , sequence_number const seq, public_key const& pk, secret_key const& sk) │ │ │ │ -{ │ │ │ │ - std::array<char, 1000> buffer; │ │ │ │ - int const bsize = bencode(buffer.begin(), v); │ │ │ │ - TORRENT_ASSERT(bsize <= 1000); │ │ │ │ - m_sig = sign_mutable_item(span<char const>(buffer).first(bsize) │ │ │ │ - , salt, seq, pk, sk); │ │ │ │ - m_salt.assign(salt.data(), static_cast<std::size_t>(salt.size())); │ │ │ │ - m_pk = pk; │ │ │ │ - m_seq = seq; │ │ │ │ - m_mutable = true; │ │ │ │ - m_value = std::move(v); │ │ │ │ -} │ │ │ │ - │ │ │ │ -void item::assign(bdecode_node const& v) │ │ │ │ -
    relevance 0../src/kademlia/routing_table.cpp:289This is temporary. For now, only report the largest routing table (of potentially multiple ones, for multi-homed systems) in next major version, break the ABI and support reporting all of them in the dht_stats_alert

    This is temporary. For now, only report the largest routing table │ │ │ │ +relevance 0../src/kademlia/routing_table.cpp:289This is temporary. For now, only report the largest routing table (of potentially multiple ones, for multi-homed systems) in next major version, break the ABI and support reporting all of them in the dht_stats_alert

    This is temporary. For now, only report the largest routing table │ │ │ │ (of potentially multiple ones, for multi-homed systems) │ │ │ │ in next major version, break the ABI and support reporting all of them in │ │ │ │ the dht_stats_alert

    ../src/kademlia/routing_table.cpp:289

    	, m_bucket_size(bucket_size)
    │ │ │ │  {
    │ │ │ │  	// bucket sizes must be a power of 2
    │ │ │ │  	TORRENT_ASSERT_VAL(((bucket_size - 1) & bucket_size) == 0, bucket_size);
    │ │ │ │  	TORRENT_UNUSED(log);
    │ │ │ │ @@ -10233,15 +10083,15 @@
    │ │ │ │  		b.num_nodes = int(i.live_nodes.size());
    │ │ │ │  		b.num_replacements = int(i.replacements.size());
    │ │ │ │  		s.push_back(b);
    │ │ │ │  	}
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │  #if TORRENT_ABI_VERSION == 1
    │ │ │ │ -
    relevance 0../src/kademlia/routing_table.cpp:314arvidn note when it's across IPv4 and IPv6, adding (dht_global_nodes) would make sense. in the future though, where we may have one DHT node per external interface (which may be multiple of the same address family), then it becomes a bit trickier

    arvidn note │ │ │ │ +relevance 0../src/kademlia/routing_table.cpp:314arvidn note when it's across IPv4 and IPv6, adding (dht_global_nodes) would make sense. in the future though, where we may have one DHT node per external interface (which may be multiple of the same address family), then it becomes a bit trickier

    arvidn note │ │ │ │ when it's across IPv4 and IPv6, adding (dht_global_nodes) would │ │ │ │ make sense. in the future though, where we may have one DHT node │ │ │ │ per external interface (which may be multiple of the same address │ │ │ │ family), then it becomes a bit trickier

    ../src/kademlia/routing_table.cpp:314

    	if (s.size() > m_buckets.size()) return;
    │ │ │ │  	s.clear();
    │ │ │ │  	for (auto const& i : m_buckets)
    │ │ │ │  	{
    │ │ │ │ @@ -10288,15 +10138,15 @@
    │ │ │ │  			, [](node_entry const& k) { return k.confirmed(); } ));
    │ │ │ │  
    │ │ │ │  		replacements += int(i.replacements.size());
    │ │ │ │  	}
    │ │ │ │  	return std::make_tuple(nodes, replacements, confirmed);
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │ -
    relevance 0../src/kademlia/routing_table.cpp:518this need to take bucket "prefix" into account. It should be unified with add_node_impl()

    this need to take bucket "prefix" into account. It should be unified │ │ │ │ +relevance 0../src/kademlia/routing_table.cpp:518this need to take bucket "prefix" into account. It should be unified with add_node_impl()

    this need to take bucket "prefix" into account. It should be unified │ │ │ │ with add_node_impl()

    ../src/kademlia/routing_table.cpp:518

    {
    │ │ │ │  	for (auto i = m_buckets.begin() , end(m_buckets.end()); i != end; ++i)
    │ │ │ │  	{
    │ │ │ │  		for (auto j = i->replacements.begin(); j != i->replacements.end(); ++j)
    │ │ │ │  		{
    │ │ │ │  			if (j->addr() != ep.address()) continue;
    │ │ │ │  			if (j->port() != ep.port()) continue;
    │ │ │ │ @@ -10340,197 +10190,216 @@
    │ │ │ │  		&& m_buckets.back().replacements.empty())
    │ │ │ │  	{
    │ │ │ │  		m_buckets.erase(m_buckets.end() - 1);
    │ │ │ │  	}
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │  void routing_table::remove_node(node_entry* n, bucket_t* b)
    │ │ │ │ -
    relevance 0../include/libtorrent/torrent_info.hpp:729change the type to std::shared_ptr in C++17 it is used as if immutable, it cannot be const for technical reasons right now.

    change the type to std::shared_ptr in C++17 │ │ │ │ -it is used as if immutable, it cannot be const for technical reasons │ │ │ │ -right now.

    ../include/libtorrent/torrent_info.hpp:729

    │ │ │ │ -		// these are the collections from outside of the info-dict. These are
    │ │ │ │ -		// owning strings, since we only keep the info-section around, these
    │ │ │ │ -		// cannot be pointers into that buffer.
    │ │ │ │ -		std::vector<std::string> m_owned_collections;
    │ │ │ │ -
    │ │ │ │ -#if TORRENT_ABI_VERSION <= 2
    │ │ │ │ -		// if this is a merkle torrent, this is the merkle
    │ │ │ │ -		// tree. It has space for merkle_num_nodes(merkle_num_leafs(num_pieces))
    │ │ │ │ -		// hashes
    │ │ │ │ -		aux::vector<sha1_hash> m_merkle_tree;
    │ │ │ │ +
    relevance 0../src/kademlia/dht_tracker.cpp:317pick the closest node rather than the first

    pick the closest node rather than the first

    ../src/kademlia/dht_tracker.cpp:317

    │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ +		m_log->log(dht_logger::tracker, "*** new write key*** %d nodes"
    │ │ │ │ +			, int(m_nodes.size()));
    │ │ │ │  #endif
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -		// v2 merkle tree for each file
    │ │ │ │ -		// the actual hash buffers are always divisible by 32 (sha256_hash::size())
    │ │ │ │ -		aux::vector<aux::vector<char>, file_index_t> m_piece_layers;
    │ │ │ │ -
    │ │ │ │ -		// this is a copy of the info section from the torrent.
    │ │ │ │ -		// it use maintained in this flat format in order to
    │ │ │ │ -		// make it available through the metadata extension
    │ │ │ │ -
    boost::shared_array<char> m_info_section; │ │ │ │ -
    │ │ │ │ - // if a comment is found in the torrent file │ │ │ │ - // this will be set to that comment │ │ │ │ - std::string m_comment; │ │ │ │ - │ │ │ │ - // an optional string naming the software used │ │ │ │ - // to create the torrent file │ │ │ │ - std::string m_created_by; │ │ │ │ - │ │ │ │ - // the info section parsed. points into m_info_section │ │ │ │ - // parsed lazily │ │ │ │ - mutable bdecode_node m_info_dict; │ │ │ │ - │ │ │ │ - // if a creation date is found in the torrent file │ │ │ │ - // this will be set to that, otherwise it'll be │ │ │ │ - // 1970, Jan 1 │ │ │ │ - std::time_t m_creation_date = 0; │ │ │ │ - │ │ │ │ - // the hash(es) that identify this torrent │ │ │ │ - info_hash_t m_info_hash; │ │ │ │ - │ │ │ │ - // this is the offset into the m_info_section buffer to the first byte of │ │ │ │ - // the first SHA-1 hash │ │ │ │ - std::int32_t m_piece_hashes = 0; │ │ │ │ + void dht_tracker::update_storage_node_ids() │ │ │ │ + { │ │ │ │ + std::vector<sha1_hash> ids; │ │ │ │ + for (auto& n : m_nodes) │ │ │ │ + ids.push_back(n.second.dht.nid()); │ │ │ │ + m_storage.update_node_ids(ids); │ │ │ │ + } │ │ │ │ │ │ │ │ - // the number of bytes in m_info_section │ │ │ │ - std::int32_t m_info_section_size = 0; │ │ │ │ + node* dht_tracker::get_node(node_id const& id, std::string const& family_name) │ │ │ │ + { │ │ │ │ + TORRENT_UNUSED(id); │ │ │ │ + for (auto& n : m_nodes) │ │ │ │ + { │ │ │ │ +
    if (n.second.dht.protocol_family_name() == family_name) │ │ │ │ +
    return &n.second.dht; │ │ │ │ + } │ │ │ │ │ │ │ │ - // this is used when creating a torrent. If there's │ │ │ │ - // only one file there are cases where it's impossible │ │ │ │ -
    relevance 0../include/libtorrent/identify_client.hpp:48hide this declaration when deprecated functions are disabled, and remove its internal use

    hide this declaration when deprecated functions are disabled, and │ │ │ │ -remove its internal use

    ../include/libtorrent/identify_client.hpp:48

    CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    │ │ │ │ -ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    │ │ │ │ -POSSIBILITY OF SUCH DAMAGE.
    │ │ │ │ +		return nullptr;
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -*/
    │ │ │ │ +	void dht_tracker::get_peers(sha1_hash const& ih
    │ │ │ │ +		, std::function<void(std::vector<tcp::endpoint> const&)> f)
    │ │ │ │ +	{
    │ │ │ │ +		for (auto& n : m_nodes)
    │ │ │ │ +			n.second.dht.get_peers(ih, f, {}, {});
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -#ifndef TORRENT_IDENTIFY_CLIENT_HPP_INCLUDED
    │ │ │ │ -#define TORRENT_IDENTIFY_CLIENT_HPP_INCLUDED
    │ │ │ │ +	void dht_tracker::announce(sha1_hash const& ih, int listen_port
    │ │ │ │ +		, announce_flags_t const flags
    │ │ │ │ +		, std::function<void(std::vector<tcp::endpoint> const&)> f)
    │ │ │ │ +	{
    │ │ │ │ +		for (auto& n : m_nodes)
    │ │ │ │ +			n.second.dht.announce(ih, listen_port, flags, f);
    │ │ │ │ +	}
    │ │ │ │  
    │ │ │ │ -#include "libtorrent/config.hpp"
    │ │ │ │ +	void dht_tracker::sample_infohashes(udp::endpoint const& ep, sha1_hash const& target
    │ │ │ │ +		, std::function<void(node_id
    │ │ │ │ +			, time_duration
    │ │ │ │ +			, int, std::vector<sha1_hash>
    │ │ │ │ +			, std::vector<std::pair<sha1_hash, udp::endpoint>>)> f)
    │ │ │ │ +	{
    │ │ │ │ +		for (auto& n : m_nodes)
    │ │ │ │ +		{
    │ │ │ │ +			if (ep.protocol() != (n.first.get_external_address().is_v4() ? udp::v4() : udp::v6()))
    │ │ │ │ +
    relevance 0../src/kademlia/node_id.cpp:66it's a little bit weird to return 159 - leading zeroes. It should probably be 160 - leading zeroes, but all other code in here is tuned to this expectation now, and it doesn't really matter (other than complexity)

    it's a little bit weird to return 159 - leading zeroes. It should │ │ │ │ +probably be 160 - leading zeroes, but all other code in here is tuned to │ │ │ │ +this expectation now, and it doesn't really matter (other than complexity)

    ../src/kademlia/node_id.cpp:66

    │ │ │ │ +// returns the distance between the two nodes
    │ │ │ │ +// using the kademlia XOR-metric
    │ │ │ │ +node_id distance(node_id const& n1, node_id const& n2)
    │ │ │ │ +{
    │ │ │ │ +	return n1 ^ n2;
    │ │ │ │ +}
    │ │ │ │  
    │ │ │ │ -#if TORRENT_ABI_VERSION == 1
    │ │ │ │ -#include "libtorrent/aux_/disable_warnings_push.hpp"
    │ │ │ │ -#include <boost/optional.hpp>
    │ │ │ │ -#include "libtorrent/aux_/disable_warnings_pop.hpp"
    │ │ │ │ -#endif
    │ │ │ │ +// returns true if: distance(n1, ref) < distance(n2, ref)
    │ │ │ │ +bool compare_ref(node_id const& n1, node_id const& n2, node_id const& ref)
    │ │ │ │ +{
    │ │ │ │ +	node_id const lhs = n1 ^ ref;
    │ │ │ │ +	node_id const rhs = n2 ^ ref;
    │ │ │ │ +	return lhs < rhs;
    │ │ │ │ +}
    │ │ │ │  
    │ │ │ │ -#include "libtorrent/peer_id.hpp"
    │ │ │ │ -#include "libtorrent/fingerprint.hpp"
    │ │ │ │ +// returns n in: 2^n <= distance(n1, n2) < 2^(n+1)
    │ │ │ │ +// useful for finding out which bucket a node belongs to
    │ │ │ │ +int distance_exp(node_id const& n1, node_id const& n2)
    │ │ │ │ +{
    │ │ │ │ +
    return std::max(159 - distance(n1, n2).count_leading_zeroes(), 0); │ │ │ │ +
    } │ │ │ │ │ │ │ │ -
    namespace libtorrent { │ │ │ │ -
    │ │ │ │ -namespace aux { │ │ │ │ +int min_distance_exp(node_id const& n1, std::vector<node_id> const& ids) │ │ │ │ +{ │ │ │ │ + TORRENT_ASSERT(ids.size() > 0); │ │ │ │ │ │ │ │ - TORRENT_EXTRA_EXPORT │ │ │ │ - std::string identify_client_impl(const peer_id& p); │ │ │ │ + int min = 160; // see distance_exp for the why of this constant │ │ │ │ + for (auto const& node_id : ids) │ │ │ │ + { │ │ │ │ + min = std::min(min, distance_exp(n1, node_id)); │ │ │ │ + } │ │ │ │ │ │ │ │ + return min; │ │ │ │ } │ │ │ │ │ │ │ │ - // these functions don't really need to be public. This mechanism of │ │ │ │ - // advertising client software and version is also out-dated. │ │ │ │ - │ │ │ │ - // This function can can be used to extract a string describing a client │ │ │ │ - // version from its peer-id. It will recognize most clients that have this │ │ │ │ - // kind of identification in the peer-id. │ │ │ │ - TORRENT_DEPRECATED_EXPORT │ │ │ │ - std::string identify_client(const peer_id& p); │ │ │ │ - │ │ │ │ -#if TORRENT_ABI_VERSION == 1 │ │ │ │ - │ │ │ │ -#include "libtorrent/aux_/disable_deprecation_warnings_push.hpp" │ │ │ │ +node_id generate_id_impl(address const& ip_, std::uint32_t r) │ │ │ │ +{ │ │ │ │ + std::uint8_t* ip = nullptr; │ │ │ │ │ │ │ │ - // Returns an optional fingerprint if any can be identified from the peer │ │ │ │ - // id. This can be used to automate the identification of clients. It will │ │ │ │ - // not be able to identify peers with non- standard encodings. Only Azureus │ │ │ │ - // style, Shadow's style and Mainline style. │ │ │ │ - TORRENT_DEPRECATED_EXPORT │ │ │ │ - boost::optional<fingerprint> │ │ │ │ - client_fingerprint(peer_id const& p); │ │ │ │ + static std::uint8_t const v4mask[] = { 0x03, 0x0f, 0x3f, 0xff }; │ │ │ │ + static std::uint8_t const v6mask[] = { 0x01, 0x03, 0x07, 0x0f, 0x1f, 0x3f, 0x7f, 0xff }; │ │ │ │ + std::uint8_t const* mask = nullptr; │ │ │ │ + int num_octets = 0; │ │ │ │ │ │ │ │ -#include "libtorrent/aux_/disable_warnings_pop.hpp" │ │ │ │ -
    relevance 0../include/libtorrent/socket_type.hpp:60move to aux

    move to aux

    ../include/libtorrent/socket_type.hpp:60

    namespace libtorrent {
    │ │ │ │ +	address_v4::bytes_type b4{};
    │ │ │ │ +	address_v6::bytes_type b6{};
    │ │ │ │ +	if (ip_.is_v6())
    │ │ │ │ +	{
    │ │ │ │ +		b6 = ip_.to_v6().to_bytes();
    │ │ │ │ +		ip = b6.data();
    │ │ │ │ +
    relevance 0../src/kademlia/put_data.cpp:92what if o is not an instance of put_data_observer? This need to be redesigned for better type safety.

    what if o is not an instance of put_data_observer? This need to be │ │ │ │ +redesigned for better type safety.

    ../src/kademlia/put_data.cpp:92

    	}
    │ │ │ │ +}
    │ │ │ │  
    │ │ │ │ -// A type describing kinds of sockets involved in various operations or events.
    │ │ │ │ -enum class socket_type_t : std::uint8_t {
    │ │ │ │ -	tcp,
    │ │ │ │ -	socks5,
    │ │ │ │ -	http,
    │ │ │ │ -	utp,
    │ │ │ │ -	i2p,
    │ │ │ │ -	tcp_ssl,
    │ │ │ │ -	socks5_ssl,
    │ │ │ │ -	http_ssl,
    │ │ │ │ -	utp_ssl,
    │ │ │ │ +void put_data::done()
    │ │ │ │ +{
    │ │ │ │ +	m_done = true;
    │ │ │ │  
    │ │ │ │ -#if TORRENT_ABI_VERSION <= 2
    │ │ │ │ -	udp TORRENT_DEPRECATED_ENUM = utp,
    │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ +	get_node().observer()->log(dht_logger::traversal, "[%u] %s DONE, response %d, timeout %d"
    │ │ │ │ +		, id(), name(), num_responses(), num_timeouts());
    │ │ │ │  #endif
    │ │ │ │ -};
    │ │ │ │  
    │ │ │ │ -// return a short human readable name for types of socket
    │ │ │ │ -
    char const* socket_type_name(socket_type_t); │ │ │ │ -
    │ │ │ │ + m_put_callback(m_data, num_responses()); │ │ │ │ + traversal_algorithm::done(); │ │ │ │ } │ │ │ │ │ │ │ │ -#endif │ │ │ │ -
    relevance 0../include/libtorrent/announce_entry.hpp:76include the number of peers received from this tracker, at last announce

    include the number of peers received from this tracker, at last │ │ │ │ -announce

    ../include/libtorrent/announce_entry.hpp:76

    │ │ │ │ -	struct TORRENT_EXPORT announce_infohash
    │ │ │ │ +bool put_data::invoke(observer_ptr o)
    │ │ │ │ +{
    │ │ │ │ +	if (m_done) return false;
    │ │ │ │ +
    │ │ │ │ +
    auto* po = static_cast<put_data_observer*>(o.get()); │ │ │ │ +
    │ │ │ │ + entry e; │ │ │ │ + e["y"] = "q"; │ │ │ │ + e["q"] = "put"; │ │ │ │ + entry& a = e["a"]; │ │ │ │ + a["v"] = m_data.value(); │ │ │ │ + a["token"] = po->m_token; │ │ │ │ + if (m_data.is_mutable()) │ │ │ │ { │ │ │ │ - // internal │ │ │ │ - TORRENT_UNEXPORT announce_infohash(); │ │ │ │ + a["k"] = m_data.pk().bytes; │ │ │ │ + a["seq"] = m_data.seq().value; │ │ │ │ + a["sig"] = m_data.sig().bytes; │ │ │ │ + if (!m_data.salt().empty()) │ │ │ │ + { │ │ │ │ + a["salt"] = m_data.salt(); │ │ │ │ + } │ │ │ │ + } │ │ │ │ │ │ │ │ - // if this tracker has returned an error or warning message │ │ │ │ - // that message is stored here │ │ │ │ - std::string message; │ │ │ │ + m_node.stats_counters().inc_stats_counter(counters::dht_put_out); │ │ │ │ │ │ │ │ - // if this tracker failed the last time it was contacted │ │ │ │ - // this error code specifies what error occurred │ │ │ │ - error_code last_error; │ │ │ │ + return m_node.m_rpc.invoke(e, o->target_ep(), o); │ │ │ │ +} │ │ │ │ │ │ │ │ - // the time of next tracker announce │ │ │ │ - time_point32 next_announce = (time_point32::min)(); │ │ │ │ +} } // namespace libtorrent::dht │ │ │ │ +
    relevance 0../include/libtorrent/i2p_stream.hpp:533make this a string_view

    make this a string_view

    ../include/libtorrent/i2p_stream.hpp:533

    │ │ │ │ +		char tmp[20];
    │ │ │ │ +		aux::random_bytes(tmp);
    │ │ │ │ +		m_session_id.resize(sizeof(tmp)*2);
    │ │ │ │ +		aux::to_hex(tmp, &m_session_id[0]);
    │ │ │ │  
    │ │ │ │ -		// no announces before this time
    │ │ │ │ -		time_point32 min_announce = (time_point32::min)();
    │ │ │ │ +		m_sam_socket = std::make_shared<i2p_stream>(m_io_service);
    │ │ │ │ +		m_sam_socket->set_proxy(m_hostname, m_port);
    │ │ │ │ +		m_sam_socket->set_command(i2p_stream::cmd_create_session);
    │ │ │ │ +		m_sam_socket->set_session_id(m_session_id.c_str());
    │ │ │ │ +		m_sam_socket->set_session_options(session_options);
    │ │ │ │  
    │ │ │ │ -
    │ │ │ │ -
    // these are either -1 or the scrape information this tracker last │ │ │ │ - // responded with. *incomplete* is the current number of downloaders in │ │ │ │ - // the swarm, *complete* is the current number of seeds in the swarm and │ │ │ │ - // *downloaded* is the cumulative number of completed downloads of this │ │ │ │ - // torrent, since the beginning of time (from this tracker's point of │ │ │ │ - // view). │ │ │ │ + ADD_OUTSTANDING_ASYNC("i2p_stream::on_sam_connect"); │ │ │ │ + m_sam_socket->async_connect(tcp::endpoint(), wrap_allocator( │ │ │ │ + [this,s=m_sam_socket](error_code const& ec, Handler hn) { │ │ │ │ + on_sam_connect(ec, s, std::move(hn)); │ │ │ │ + }, std::move(handler))); │ │ │ │ + } │ │ │ │ + void close(error_code&); │ │ │ │ │ │ │ │ - // if this tracker has returned scrape data, these fields are filled in │ │ │ │ - // with valid numbers. Otherwise they are set to -1. ``incomplete`` counts │ │ │ │ - // the number of current downloaders. ``complete`` counts the number of │ │ │ │ - // current peers completed the download, or "seeds". ``downloaded`` is the │ │ │ │ - // cumulative number of completed downloads. │ │ │ │ - int scrape_incomplete = -1; │ │ │ │ - int scrape_complete = -1; │ │ │ │ - int scrape_downloaded = -1; │ │ │ │ +
    char const* session_id() const { return m_session_id.c_str(); } │ │ │ │ +
    std::string const& local_endpoint() const { return m_i2p_local_endpoint; } │ │ │ │ │ │ │ │ - // the number of times in a row we have failed to announce to this │ │ │ │ - // tracker. │ │ │ │ - std::uint8_t fails : 7; │ │ │ │ + template <typename Handler> │ │ │ │ + void async_name_lookup(char const* name, Handler handler) │ │ │ │ + { │ │ │ │ + if (m_state == sam_idle && m_name_lookup.empty() && is_open()) │ │ │ │ + do_name_lookup(name, std::move(handler)); │ │ │ │ + else │ │ │ │ + m_name_lookup.emplace_back(std::string(name) │ │ │ │ + , std::move(handler)); │ │ │ │ + } │ │ │ │ │ │ │ │ - // true while we're waiting for a response from the tracker. │ │ │ │ - bool updating : 1; │ │ │ │ +private: │ │ │ │ │ │ │ │ - // set to true when we get a valid response from an announce │ │ │ │ - // with event=started. If it is set, we won't send start in the subsequent │ │ │ │ - // announces. │ │ │ │ - bool start_sent : 1; │ │ │ │ + template <typename Handler> │ │ │ │ + void on_sam_connect(error_code const& ec, std::shared_ptr<i2p_stream>, Handler h) │ │ │ │ + { │ │ │ │ + COMPLETE_ASYNC("i2p_stream::on_sam_connect"); │ │ │ │ + m_state = sam_idle; │ │ │ │ │ │ │ │ - // set to true when we send a event=completed. │ │ │ │ - bool complete_sent : 1; │ │ │ │ -
    relevance 0../include/libtorrent/torrent.hpp:280make this a raw pointer. perhaps keep the shared_ptr around further down the object to maintain an owner

    make this a raw pointer. perhaps keep the shared_ptr │ │ │ │ + if (ec) │ │ │ │ + { │ │ │ │ + h(ec); │ │ │ │ + return; │ │ │ │ + } │ │ │ │ + │ │ │ │ + do_name_lookup("ME", wrap_allocator( │ │ │ │ + [this](error_code const& e, char const* dst, Handler hn) { │ │ │ │ + set_local_endpoint(e, dst, std::move(hn)); │ │ │ │ + }, std::move(h))); │ │ │ │ +relevance 0../include/libtorrent/torrent.hpp:280make this a raw pointer. perhaps keep the shared_ptr around further down the object to maintain an owner

    make this a raw pointer. perhaps keep the shared_ptr │ │ │ │ around further down the object to maintain an owner

    ../include/libtorrent/torrent.hpp:280

    #endif
    │ │ │ │  	};
    │ │ │ │  
    │ │ │ │  	struct TORRENT_EXTRA_EXPORT torrent_hot_members
    │ │ │ │  	{
    │ │ │ │  		torrent_hot_members(aux::session_interface& ses
    │ │ │ │  			, add_torrent_params const& p, bool session_paused);
    │ │ │ │ @@ -10574,15 +10443,15 @@
    │ │ │ │  		// this is set to false as long as the connections
    │ │ │ │  		// of this torrent haven't been initialized. If we
    │ │ │ │  		// have metadata from the start, connections are
    │ │ │ │  		// initialized immediately, if we didn't have metadata,
    │ │ │ │  		// they are initialized right after files_checked().
    │ │ │ │  		// valid_resume_data() will return false as long as
    │ │ │ │  		// the connections aren't initialized, to avoid
    │ │ │ │ -
    relevance 0../include/libtorrent/torrent.hpp:463make graceful pause also finish all sending blocks before disconnecting

    make graceful pause also finish all sending blocks │ │ │ │ +relevance 0../include/libtorrent/torrent.hpp:463make graceful pause also finish all sending blocks before disconnecting

    make graceful pause also finish all sending blocks │ │ │ │ before disconnecting

    ../include/libtorrent/torrent.hpp:463

    │ │ │ │  		void on_resume_data_checked(status_t status, storage_error const& error);
    │ │ │ │  		void on_force_recheck(status_t status, storage_error const& error);
    │ │ │ │  		void on_piece_hashed(aux::vector<sha256_hash> block_hashes
    │ │ │ │  			, piece_index_t piece, sha1_hash const& piece_hash
    │ │ │ │  			, storage_error const& error);
    │ │ │ │  		void files_checked();
    │ │ │ │ @@ -10626,15 +10495,15 @@
    │ │ │ │  		void read_piece(piece_index_t);
    │ │ │ │  		void on_disk_read_complete(disk_buffer_holder, storage_error const&
    │ │ │ │  			, peer_request const&, std::shared_ptr<read_piece_struct>);
    │ │ │ │  
    │ │ │ │  		storage_mode_t storage_mode() const;
    │ │ │ │  
    │ │ │ │  		// this will flag the torrent as aborted. The main
    │ │ │ │ -
    relevance 0../include/libtorrent/torrent.hpp:600make this flag a combination of the other ones

    make this flag a combination │ │ │ │ +relevance 0../include/libtorrent/torrent.hpp:600make this flag a combination of the other ones

    make this flag a combination │ │ │ │ of the other ones

    ../include/libtorrent/torrent.hpp:600

    		void do_pause(bool was_paused = false);
    │ │ │ │  		void do_resume();
    │ │ │ │  
    │ │ │ │  		seconds32 finished_time() const;
    │ │ │ │  		seconds32 active_time() const;
    │ │ │ │  		seconds32 seeding_time() const;
    │ │ │ │  		seconds32 upload_mode_time() const;
    │ │ │ │ @@ -10678,15 +10547,15 @@
    │ │ │ │  		void set_piece_priority(piece_index_t index, download_priority_t priority);
    │ │ │ │  		download_priority_t piece_priority(piece_index_t index) const;
    │ │ │ │  
    │ │ │ │  		void prioritize_pieces(aux::vector<download_priority_t, piece_index_t> const& pieces);
    │ │ │ │  		void prioritize_piece_list(std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces);
    │ │ │ │  		void piece_priorities(aux::vector<download_priority_t, piece_index_t>*) const;
    │ │ │ │  
    │ │ │ │ -
    relevance 0../include/libtorrent/torrent.hpp:1381this wastes 5 bits per file

    this wastes 5 bits per file

    ../include/libtorrent/torrent.hpp:1381

    #ifndef TORRENT_DISABLE_EXTENSIONS
    │ │ │ │ +
    relevance 0../include/libtorrent/torrent.hpp:1381this wastes 5 bits per file

    this wastes 5 bits per file

    ../include/libtorrent/torrent.hpp:1381

    #ifndef TORRENT_DISABLE_EXTENSIONS
    │ │ │ │  		std::list<std::shared_ptr<torrent_plugin>> m_extensions;
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │  		// used for tracker announces
    │ │ │ │  		deadline_timer m_tracker_timer;
    │ │ │ │  
    │ │ │ │  		// used to detect when we are active or inactive for long enough
    │ │ │ │ @@ -10729,15 +10598,15 @@
    │ │ │ │  #if TORRENT_ABI_VERSION == 1
    │ │ │ │  		// deprecated in 1.1
    │ │ │ │  		std::string m_username;
    │ │ │ │  		std::string m_password;
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │  		std::string m_save_path;
    │ │ │ │ -
    relevance 0../include/libtorrent/torrent.hpp:1696this member can probably be removed

    this member can probably be removed

    ../include/libtorrent/torrent.hpp:1696

    		unsigned int m_num_uploads:24;
    │ │ │ │ +
    relevance 0../include/libtorrent/torrent.hpp:1696this member can probably be removed

    this member can probably be removed

    ../include/libtorrent/torrent.hpp:1696

    		unsigned int m_num_uploads:24;
    │ │ │ │  
    │ │ │ │  		// 4 unused bits
    │ │ │ │  
    │ │ │ │  		// when this is true, this torrent supports peer exchange
    │ │ │ │  		bool m_enable_pex:1;
    │ │ │ │  
    │ │ │ │  		// set to true if the session IP filter applies to this
    │ │ │ │ @@ -10780,66 +10649,310 @@
    │ │ │ │  		// remember that this is an SSL torrent, so that we don't
    │ │ │ │  		// accidentally start seeding it without any authentication.
    │ │ │ │  		bool m_ssl_torrent:1;
    │ │ │ │  
    │ │ │ │  		// this is set to true if we're trying to delete the
    │ │ │ │  		// files belonging to it. When set, don't write any
    │ │ │ │  		// more blocks to disk!
    │ │ │ │ -
    relevance 0../include/libtorrent/peer_connection_interface.hpp:51make this interface smaller!

    make this interface smaller!

    ../include/libtorrent/peer_connection_interface.hpp:51

    │ │ │ │ -*/
    │ │ │ │ +
    relevance 0../include/libtorrent/upnp.hpp:162support using the windows API for UPnP operations as well

    support using the windows API for UPnP operations as well

    ../include/libtorrent/upnp.hpp:162

    {
    │ │ │ │ +	bool in_error_code = false;
    │ │ │ │ +	bool exit = false;
    │ │ │ │ +	int error_code = -1;
    │ │ │ │ +};
    │ │ │ │  
    │ │ │ │ -#ifndef TORRENT_PEER_CONNECTION_INTERFACE_HPP
    │ │ │ │ -#define TORRENT_PEER_CONNECTION_INTERFACE_HPP
    │ │ │ │ +struct ip_address_parse_state: error_code_parse_state
    │ │ │ │ +{
    │ │ │ │ +	bool in_ip_address = false;
    │ │ │ │ +	std::string ip_address;
    │ │ │ │ +};
    │ │ │ │  
    │ │ │ │ -#include "libtorrent/fwd.hpp"
    │ │ │ │ -#include "libtorrent/socket.hpp"
    │ │ │ │ -#include "libtorrent/error_code.hpp"
    │ │ │ │ -#include "libtorrent/alert_types.hpp"
    │ │ │ │ -#include "libtorrent/operations.hpp" // for operation_t enum
    │ │ │ │ -#include "libtorrent/units.hpp"
    │ │ │ │ +TORRENT_EXTRA_EXPORT void find_control_url(int type, string_view, parse_state& state);
    │ │ │ │  
    │ │ │ │ -namespace libtorrent {
    │ │ │ │ +TORRENT_EXTRA_EXPORT void find_error_code(int type, string_view string
    │ │ │ │ +	, error_code_parse_state& state);
    │ │ │ │  
    │ │ │ │ -	struct torrent_peer;
    │ │ │ │ -	class stat;
    │ │ │ │ +TORRENT_EXTRA_EXPORT void find_ip_address(int type, string_view string
    │ │ │ │ +	, ip_address_parse_state& state);
    │ │ │ │  
    │ │ │ │ -	using disconnect_severity_t = aux::strong_typedef<std::uint8_t, struct disconnect_severity_tag>;
    │ │ │ │ +
    struct TORRENT_EXTRA_EXPORT upnp final │ │ │ │ +
    : std::enable_shared_from_this<upnp> │ │ │ │ + , single_threaded │ │ │ │ +{ │ │ │ │ + upnp(io_context& ios │ │ │ │ + , aux::session_settings const& settings │ │ │ │ + , aux::portmap_callback& cb │ │ │ │ + , address_v4 listen_address │ │ │ │ + , address_v4 netmask │ │ │ │ + , std::string listen_device │ │ │ │ + , aux::listen_socket_handle ls); │ │ │ │ + ~upnp(); │ │ │ │ │ │ │ │ -
    struct TORRENT_EXTRA_EXPORT peer_connection_interface │ │ │ │ -
    { │ │ │ │ - static constexpr disconnect_severity_t normal{0}; │ │ │ │ - static constexpr disconnect_severity_t failure{1}; │ │ │ │ - static constexpr disconnect_severity_t peer_error{2}; │ │ │ │ + void start(); │ │ │ │ │ │ │ │ -#if TORRENT_USE_I2P │ │ │ │ - virtual std::string const& destination() const = 0; │ │ │ │ - virtual std::string const& local_i2p_endpoint() const = 0; │ │ │ │ + // Attempts to add a port mapping for the specified protocol. Valid protocols are │ │ │ │ + // ``upnp::tcp`` and ``upnp::udp`` for the UPnP class and ``natpmp::tcp`` and │ │ │ │ + // ``natpmp::udp`` for the NAT-PMP class. │ │ │ │ + // │ │ │ │ + // ``external_port`` is the port on the external address that will be mapped. This │ │ │ │ + // is a hint, you are not guaranteed that this port will be available, and it may │ │ │ │ + // end up being something else. In the portmap_alert_ notification, the actual │ │ │ │ + // external port is reported. │ │ │ │ + // │ │ │ │ + // ``local_port`` is the port in the local machine that the mapping should forward │ │ │ │ + // to. │ │ │ │ + // │ │ │ │ + // The return value is an index that identifies this port mapping. This is used │ │ │ │ + // to refer to mappings that fails or succeeds in the portmap_error_alert_ and │ │ │ │ + // portmap_alert_ respectively. If The mapping fails immediately, the return value │ │ │ │ + // is -1, which means failure. There will not be any error alert notification for │ │ │ │ +
    relevance 0../include/libtorrent/peer_connection.hpp:218make this a raw pointer (to save size in the first cache line) and make the constructor take a raw pointer. torrent objects should always outlive their peers

    make this a raw pointer (to save size in │ │ │ │ +the first cache line) and make the constructor │ │ │ │ +take a raw pointer. torrent objects should always │ │ │ │ +outlive their peers

    ../include/libtorrent/peer_connection.hpp:218

    			, m_snubbed(false)
    │ │ │ │ +			, m_interesting(false)
    │ │ │ │ +			, m_choked(true)
    │ │ │ │ +			, m_ignore_stats(false)
    │ │ │ │ +		{}
    │ │ │ │ +
    │ │ │ │ +		// explicitly disallow assignment, to silence msvc warning
    │ │ │ │ +		peer_connection_hot_members& operator=(peer_connection_hot_members const&) = delete;
    │ │ │ │ +
    │ │ │ │ +	protected:
    │ │ │ │ +
    │ │ │ │ +		// the pieces the other end have
    │ │ │ │ +		typed_bitfield<piece_index_t> m_have_piece;
    │ │ │ │ +
    │ │ │ │ +		// this is the torrent this connection is
    │ │ │ │ +		// associated with. If the connection is an
    │ │ │ │ +		// incoming connection, this is set to zero
    │ │ │ │ +		// until the info_hash is received. Then it's
    │ │ │ │ +		// set to the torrent it belongs to.
    │ │ │ │ +
    │ │ │ │ +
    std::weak_ptr<torrent> m_torrent; │ │ │ │ +
    │ │ │ │ + public: │ │ │ │ + │ │ │ │ + // a back reference to the session │ │ │ │ + // the peer belongs to. │ │ │ │ + aux::session_interface& m_ses; │ │ │ │ + │ │ │ │ + // settings that apply to this peer │ │ │ │ + aux::session_settings const& m_settings; │ │ │ │ + │ │ │ │ + protected: │ │ │ │ + │ │ │ │ + // this is true if this connection has been added │ │ │ │ + // to the list of connections that will be closed. │ │ │ │ + bool m_disconnecting:1; │ │ │ │ + │ │ │ │ + // this is true until this socket has become │ │ │ │ + // writable for the first time (i.e. the │ │ │ │ + // connection completed). While connecting │ │ │ │ + // the timeout will not be triggered. This is │ │ │ │ + // because windows XP SP2 may delay connection │ │ │ │ + // attempts, which means that the connection │ │ │ │ + // may not even have been attempted when the │ │ │ │ + // time out is reached. │ │ │ │ + bool m_connecting:1; │ │ │ │ + │ │ │ │ + // this is set to true if the last time we tried to │ │ │ │ + // pick a piece to download, we could only find │ │ │ │ + // blocks that were already requested from other │ │ │ │ + // peers. In this case, we should not try to pick │ │ │ │ +
    relevance 0../include/libtorrent/peer_connection.hpp:1026factor this out into its own class with a virtual interface torrent and session should implement this interface

    factor this out into its own class with a virtual interface │ │ │ │ +torrent and session should implement this interface

    ../include/libtorrent/peer_connection.hpp:1026

    │ │ │ │ +		// the local endpoint for this peer, i.e. our address
    │ │ │ │ +		// and our port. If this is set for outgoing connections
    │ │ │ │ +		// before the connection completes, it means we want to
    │ │ │ │ +		// force the connection to be bound to the specified interface.
    │ │ │ │ +		// if it ends up being bound to a different local IP, the connection
    │ │ │ │ +		// is closed.
    │ │ │ │ +		tcp::endpoint m_local;
    │ │ │ │ +
    │ │ │ │ +		// remote peer's id
    │ │ │ │ +		peer_id m_peer_id;
    │ │ │ │ +
    │ │ │ │ +	protected:
    │ │ │ │ +
    │ │ │ │ +		template <typename Fun, typename... Args>
    │ │ │ │ +		void wrap(Fun f, Args&&... a);
    │ │ │ │ +
    │ │ │ │ +		// statistics about upload and download speeds
    │ │ │ │ +		// and total amount of uploads and downloads for
    │ │ │ │ +		// this peer
    │ │ │ │ +
    stat m_statistics; │ │ │ │ +
    │ │ │ │ + // the number of outstanding bytes expected │ │ │ │ + // to be received by extensions │ │ │ │ + int m_extension_outstanding_bytes = 0; │ │ │ │ + │ │ │ │ + // the number of time critical requests │ │ │ │ + // queued up in the m_request_queue that │ │ │ │ + // soon will be committed to the download │ │ │ │ + // queue. This is included in download_queue_time() │ │ │ │ + // so that it can be used while adding more │ │ │ │ + // requests and take the previous requests │ │ │ │ + // into account without submitting it all │ │ │ │ + // immediately │ │ │ │ + std::uint16_t m_queued_time_critical = 0; │ │ │ │ + │ │ │ │ + // the number of bytes we are currently reading │ │ │ │ + // from disk, that will be added to the send │ │ │ │ + // buffer as soon as they complete │ │ │ │ + int m_reading_bytes = 0; │ │ │ │ + │ │ │ │ + // options used for the piece picker. These flags will │ │ │ │ + // be augmented with flags controlled by other settings │ │ │ │ + // like sequential download etc. These are here to │ │ │ │ + // let plugins control flags that should always be set │ │ │ │ + picker_options_t m_picker_options{}; │ │ │ │ + │ │ │ │ + // the number of invalid piece-requests │ │ │ │ + // we have got from this peer. If the request │ │ │ │ + // queue gets empty, and there have been │ │ │ │ + // invalid requests, we can assume the │ │ │ │ +
    relevance 0../include/libtorrent/performance_counters.hpp:485some space could be saved here by making gauges 32 bits

    some space could be saved here by making gauges 32 bits

    ../include/libtorrent/performance_counters.hpp:485

    relevance 0../include/libtorrent/performance_counters.hpp:486restore these to regular integers. Instead have one copy of the counters per thread and collect them at convenient synchronization points

    restore these to regular integers. Instead have one copy │ │ │ │ +of the counters per thread and collect them at convenient │ │ │ │ +synchronization points

    ../include/libtorrent/performance_counters.hpp:486

    #ifdef ATOMIC_LLONG_LOCK_FREE
    │ │ │ │ +#define TORRENT_COUNTER_NOEXCEPT noexcept
    │ │ │ │ +#else
    │ │ │ │ +#define TORRENT_COUNTER_NOEXCEPT
    │ │ │ │  #endif
    │ │ │ │ -		virtual tcp::endpoint const& remote() const = 0;
    │ │ │ │ -		virtual tcp::endpoint local_endpoint() const = 0;
    │ │ │ │ -		virtual void disconnect(error_code const& ec
    │ │ │ │ -			, operation_t op, disconnect_severity_t = peer_connection_interface::normal) = 0;
    │ │ │ │ -		virtual peer_id const& pid() const = 0;
    │ │ │ │ -		virtual peer_id our_pid() const = 0;
    │ │ │ │ -		virtual void set_holepunch_mode() = 0;
    │ │ │ │ -		virtual torrent_peer* peer_info_struct() const = 0;
    │ │ │ │ -		virtual void set_peer_info(torrent_peer* pi) = 0;
    │ │ │ │ -		virtual bool is_outgoing() const = 0;
    │ │ │ │ -		virtual void add_stat(std::int64_t downloaded, std::int64_t uploaded) = 0;
    │ │ │ │ -		virtual bool fast_reconnect() const = 0;
    │ │ │ │ -		virtual bool is_choked() const = 0;
    │ │ │ │ -		virtual bool failed() const = 0;
    │ │ │ │ -		virtual stat const& statistics() const = 0;
    │ │ │ │ -		virtual void get_peer_info(peer_info& p) const = 0;
    │ │ │ │ -#ifndef TORRENT_DISABLE_LOGGING
    │ │ │ │ -		virtual bool should_log(peer_log_alert::direction_t direction) const = 0;
    │ │ │ │ -		virtual void peer_log(peer_log_alert::direction_t direction
    │ │ │ │ -			, char const* event, char const* fmt = "", ...) const noexcept TORRENT_FORMAT(4,5) = 0;
    │ │ │ │ +
    │ │ │ │ +		counters() TORRENT_COUNTER_NOEXCEPT;
    │ │ │ │ +
    │ │ │ │ +		counters(counters const&) TORRENT_COUNTER_NOEXCEPT;
    │ │ │ │ +		counters& operator=(counters const&) & TORRENT_COUNTER_NOEXCEPT;
    │ │ │ │ +
    │ │ │ │ +		// returns the new value
    │ │ │ │ +		std::int64_t inc_stats_counter(int c, std::int64_t value = 1) TORRENT_COUNTER_NOEXCEPT;
    │ │ │ │ +		std::int64_t operator[](int i) const TORRENT_COUNTER_NOEXCEPT;
    │ │ │ │ +
    │ │ │ │ +		void set_value(int c, std::int64_t value) TORRENT_COUNTER_NOEXCEPT;
    │ │ │ │ +		void blend_stats_counter(int c, std::int64_t value, int ratio) TORRENT_COUNTER_NOEXCEPT;
    │ │ │ │ +
    │ │ │ │ +	private:
    │ │ │ │ +
    │ │ │ │ +
    #ifdef ATOMIC_LLONG_LOCK_FREE │ │ │ │ +
    aux::array<std::atomic<std::int64_t>, num_counters> m_stats_counter; │ │ │ │ +#else │ │ │ │ + // if the atomic type isn't lock-free, use a single lock instead, for │ │ │ │ + // the whole array │ │ │ │ + mutable std::mutex m_mutex; │ │ │ │ + aux::array<std::int64_t, num_counters> m_stats_counter; │ │ │ │ #endif │ │ │ │ -
    relevance 0../include/libtorrent/piece_picker.hpp:823should this be allocated lazily?

    should this be allocated lazily?

    ../include/libtorrent/piece_picker.hpp:823

    		// download list it may live in now
    │ │ │ │ +	};
    │ │ │ │ +}
    │ │ │ │ +
    │ │ │ │ +#endif
    │ │ │ │ +
    relevance 0../include/libtorrent/announce_entry.hpp:76include the number of peers received from this tracker, at last announce

    include the number of peers received from this tracker, at last │ │ │ │ +announce

    ../include/libtorrent/announce_entry.hpp:76

    │ │ │ │ +	struct TORRENT_EXPORT announce_infohash
    │ │ │ │ +	{
    │ │ │ │ +		// internal
    │ │ │ │ +		TORRENT_UNEXPORT announce_infohash();
    │ │ │ │ +
    │ │ │ │ +		// if this tracker has returned an error or warning message
    │ │ │ │ +		// that message is stored here
    │ │ │ │ +		std::string message;
    │ │ │ │ +
    │ │ │ │ +		// if this tracker failed the last time it was contacted
    │ │ │ │ +		// this error code specifies what error occurred
    │ │ │ │ +		error_code last_error;
    │ │ │ │ +
    │ │ │ │ +		// the time of next tracker announce
    │ │ │ │ +		time_point32 next_announce = (time_point32::min)();
    │ │ │ │ +
    │ │ │ │ +		// no announces before this time
    │ │ │ │ +		time_point32 min_announce = (time_point32::min)();
    │ │ │ │ +
    │ │ │ │ +
    │ │ │ │ +
    // these are either -1 or the scrape information this tracker last │ │ │ │ + // responded with. *incomplete* is the current number of downloaders in │ │ │ │ + // the swarm, *complete* is the current number of seeds in the swarm and │ │ │ │ + // *downloaded* is the cumulative number of completed downloads of this │ │ │ │ + // torrent, since the beginning of time (from this tracker's point of │ │ │ │ + // view). │ │ │ │ + │ │ │ │ + // if this tracker has returned scrape data, these fields are filled in │ │ │ │ + // with valid numbers. Otherwise they are set to -1. ``incomplete`` counts │ │ │ │ + // the number of current downloaders. ``complete`` counts the number of │ │ │ │ + // current peers completed the download, or "seeds". ``downloaded`` is the │ │ │ │ + // cumulative number of completed downloads. │ │ │ │ + int scrape_incomplete = -1; │ │ │ │ + int scrape_complete = -1; │ │ │ │ + int scrape_downloaded = -1; │ │ │ │ + │ │ │ │ + // the number of times in a row we have failed to announce to this │ │ │ │ + // tracker. │ │ │ │ + std::uint8_t fails : 7; │ │ │ │ + │ │ │ │ + // true while we're waiting for a response from the tracker. │ │ │ │ + bool updating : 1; │ │ │ │ + │ │ │ │ + // set to true when we get a valid response from an announce │ │ │ │ + // with event=started. If it is set, we won't send start in the subsequent │ │ │ │ + // announces. │ │ │ │ + bool start_sent : 1; │ │ │ │ + │ │ │ │ + // set to true when we send a event=completed. │ │ │ │ + bool complete_sent : 1; │ │ │ │ +
    relevance 0../include/libtorrent/socks5_stream.hpp:197we could bind the socket here, since we know what the target endpoint is of the proxy

    we could bind the socket here, since we know what the │ │ │ │ +target endpoint is of the proxy

    ../include/libtorrent/socks5_stream.hpp:197

    			}, std::move(handler)));
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +private:
    │ │ │ │ +
    │ │ │ │ +	template <typename Handler>
    │ │ │ │ +	void name_lookup(error_code const& e, tcp::resolver::results_type ips
    │ │ │ │ +		, Handler h)
    │ │ │ │ +	{
    │ │ │ │ +		COMPLETE_ASYNC("socks5_stream::name_lookup");
    │ │ │ │ +		if (handle_error(e, std::move(h))) return;
    │ │ │ │ +
    │ │ │ │ +		auto i = ips.begin();
    │ │ │ │ +		if (!m_sock.is_open())
    │ │ │ │ +		{
    │ │ │ │ +			error_code ec;
    │ │ │ │ +			m_sock.open(i->endpoint().protocol(), ec);
    │ │ │ │ +			if (handle_error(ec, std::move(h))) return;
    │ │ │ │ +		}
    │ │ │ │ +
    │ │ │ │ +
    ADD_OUTSTANDING_ASYNC("socks5_stream::connected"); │ │ │ │ +
    m_sock.async_connect(i->endpoint(), wrap_allocator( │ │ │ │ + [this](error_code const& ec, Handler hn) │ │ │ │ + { connected(ec, std::move(hn)); }, std::move(h))); │ │ │ │ + } │ │ │ │ + │ │ │ │ + template <typename Handler> │ │ │ │ + void connected(error_code const& e, Handler h) │ │ │ │ + { │ │ │ │ + COMPLETE_ASYNC("socks5_stream::connected"); │ │ │ │ + if (handle_error(e, std::move(h))) return; │ │ │ │ + │ │ │ │ + using namespace libtorrent::aux; │ │ │ │ + if (m_version == 5) │ │ │ │ + { │ │ │ │ + // send SOCKS5 authentication methods │ │ │ │ + m_buffer.resize(m_user.empty()?3:4); │ │ │ │ + char* p = &m_buffer[0]; │ │ │ │ + write_uint8(5, p); // SOCKS VERSION 5 │ │ │ │ + if (m_user.empty()) │ │ │ │ + { │ │ │ │ + write_uint8(1, p); // 1 authentication method (no auth) │ │ │ │ + write_uint8(0, p); // no authentication │ │ │ │ + } │ │ │ │ + else │ │ │ │ + { │ │ │ │ + write_uint8(2, p); // 2 authentication methods │ │ │ │ + write_uint8(0, p); // no authentication │ │ │ │ + write_uint8(2, p); // username/password │ │ │ │ + } │ │ │ │ + ADD_OUTSTANDING_ASYNC("socks5_stream::handshake1"); │ │ │ │ +
    relevance 0../include/libtorrent/piece_picker.hpp:823should this be allocated lazily?

    should this be allocated lazily?

    ../include/libtorrent/piece_picker.hpp:823

    		// download list it may live in now
    │ │ │ │  		std::vector<downloading_piece>::iterator update_piece_state(
    │ │ │ │  			std::vector<downloading_piece>::iterator dp);
    │ │ │ │  
    │ │ │ │  	private:
    │ │ │ │  
    │ │ │ │  #if TORRENT_USE_ASSERTS || TORRENT_USE_INVARIANT_CHECKS
    │ │ │ │  		index_range<download_queue_t> categories() const
    │ │ │ │ @@ -10882,15 +10995,15 @@
    │ │ │ │  		std::int64_t m_have_filtered_pad_bytes = 0;
    │ │ │ │  
    │ │ │ │  		// the number of seeds. These are not added to
    │ │ │ │  		// the availability counters of the pieces
    │ │ │ │  		int m_seeds = 0;
    │ │ │ │  
    │ │ │ │  		// this vector contains all piece indices that are pickable
    │ │ │ │ -
    relevance 0../include/libtorrent/piece_picker.hpp:895it would be more intuitive to account "wanted" pieces instead of filtered

    it would be more intuitive to account "wanted" pieces │ │ │ │ +relevance 0../include/libtorrent/piece_picker.hpp:895it would be more intuitive to account "wanted" pieces instead of filtered

    it would be more intuitive to account "wanted" pieces │ │ │ │ instead of filtered

    ../include/libtorrent/piece_picker.hpp:895

    │ │ │ │  		// this holds the information of the blocks in partially downloaded
    │ │ │ │  		// pieces. the downloading_piece::info index point into this vector for
    │ │ │ │  		// its storage
    │ │ │ │  		aux::vector<block_info> m_block_info;
    │ │ │ │  
    │ │ │ │  		// these are block ranges in m_block_info that are free. The numbers
    │ │ │ │ @@ -10932,117 +11045,144 @@
    │ │ │ │  
    │ │ │ │  		enum { max_pieces = (std::numeric_limits<int>::max)() - 1 };
    │ │ │ │  
    │ │ │ │  	};
    │ │ │ │  }
    │ │ │ │  
    │ │ │ │  #endif // TORRENT_PIECE_PICKER_HPP_INCLUDED
    │ │ │ │ -
    relevance 0../include/libtorrent/i2p_stream.hpp:533make this a string_view

    make this a string_view

    ../include/libtorrent/i2p_stream.hpp:533

    │ │ │ │ -		char tmp[20];
    │ │ │ │ -		aux::random_bytes(tmp);
    │ │ │ │ -		m_session_id.resize(sizeof(tmp)*2);
    │ │ │ │ -		aux::to_hex(tmp, &m_session_id[0]);
    │ │ │ │ +
    relevance 0../include/libtorrent/socket_type.hpp:60move to aux

    move to aux

    ../include/libtorrent/socket_type.hpp:60

    namespace libtorrent {
    │ │ │ │  
    │ │ │ │ -		m_sam_socket = std::make_shared<i2p_stream>(m_io_service);
    │ │ │ │ -		m_sam_socket->set_proxy(m_hostname, m_port);
    │ │ │ │ -		m_sam_socket->set_command(i2p_stream::cmd_create_session);
    │ │ │ │ -		m_sam_socket->set_session_id(m_session_id.c_str());
    │ │ │ │ -		m_sam_socket->set_session_options(session_options);
    │ │ │ │ +// A type describing kinds of sockets involved in various operations or events.
    │ │ │ │ +enum class socket_type_t : std::uint8_t {
    │ │ │ │ +	tcp,
    │ │ │ │ +	socks5,
    │ │ │ │ +	http,
    │ │ │ │ +	utp,
    │ │ │ │ +	i2p,
    │ │ │ │ +	tcp_ssl,
    │ │ │ │ +	socks5_ssl,
    │ │ │ │ +	http_ssl,
    │ │ │ │ +	utp_ssl,
    │ │ │ │  
    │ │ │ │ -		ADD_OUTSTANDING_ASYNC("i2p_stream::on_sam_connect");
    │ │ │ │ -		m_sam_socket->async_connect(tcp::endpoint(), wrap_allocator(
    │ │ │ │ -			[this,s=m_sam_socket](error_code const& ec, Handler hn) {
    │ │ │ │ -				on_sam_connect(ec, s, std::move(hn));
    │ │ │ │ -			}, std::move(handler)));
    │ │ │ │ -	}
    │ │ │ │ -	void close(error_code&);
    │ │ │ │ +#if TORRENT_ABI_VERSION <= 2
    │ │ │ │ +	udp TORRENT_DEPRECATED_ENUM = utp,
    │ │ │ │ +#endif
    │ │ │ │ +};
    │ │ │ │  
    │ │ │ │ -
    char const* session_id() const { return m_session_id.c_str(); } │ │ │ │ -
    std::string const& local_endpoint() const { return m_i2p_local_endpoint; } │ │ │ │ +// return a short human readable name for types of socket │ │ │ │ +
    char const* socket_type_name(socket_type_t); │ │ │ │ +
    │ │ │ │ +} │ │ │ │ │ │ │ │ - template <typename Handler> │ │ │ │ - void async_name_lookup(char const* name, Handler handler) │ │ │ │ +#endif │ │ │ │ +
    relevance 0../include/libtorrent/proxy_base.hpp:227it would be nice to remember the bind port and bind once we know where the proxy is m_sock.bind(endpoint, ec);

    it would be nice to remember the bind port and bind once we know where the proxy is │ │ │ │ +m_sock.bind(endpoint, ec);

    ../include/libtorrent/proxy_base.hpp:227

    		TORRENT_ASSERT(m_magic == 0x1337);
    │ │ │ │ +		m_sock.cancel();
    │ │ │ │ +	}
    │ │ │ │ +
    │ │ │ │ +	void cancel(error_code& ec)
    │ │ │ │  	{
    │ │ │ │ -		if (m_state == sam_idle && m_name_lookup.empty() && is_open())
    │ │ │ │ -			do_name_lookup(name, std::move(handler));
    │ │ │ │ -		else
    │ │ │ │ -			m_name_lookup.emplace_back(std::string(name)
    │ │ │ │ -				, std::move(handler));
    │ │ │ │ +		TORRENT_ASSERT(m_magic == 0x1337);
    │ │ │ │ +		m_sock.cancel(ec);
    │ │ │ │  	}
    │ │ │ │  
    │ │ │ │ -private:
    │ │ │ │ +	void bind(endpoint_type const& /* endpoint */, error_code& /* ec */)
    │ │ │ │ +	{
    │ │ │ │ +		TORRENT_ASSERT(m_magic == 0x1337);
    │ │ │ │ +		// the reason why we ignore binds here is because we don't
    │ │ │ │ +		// (necessarily) yet know what address family the proxy
    │ │ │ │ +		// will resolve to, and binding to the wrong one would
    │ │ │ │ +		// break our connection attempt later. The caller here
    │ │ │ │ +		// doesn't necessarily know that we're proxying, so this
    │ │ │ │ +		// bind address is based on the final endpoint, not the
    │ │ │ │ +		// proxy.
    │ │ │ │ +
    } │ │ │ │ +
    │ │ │ │ +#ifndef BOOST_NO_EXCEPTIONS │ │ │ │ + void open(protocol_type const&) │ │ │ │ + { │ │ │ │ + TORRENT_ASSERT(m_magic == 0x1337); │ │ │ │ +// m_sock.open(p); │ │ │ │ + } │ │ │ │ +#endif │ │ │ │ │ │ │ │ - template <typename Handler> │ │ │ │ - void on_sam_connect(error_code const& ec, std::shared_ptr<i2p_stream>, Handler h) │ │ │ │ + void open(protocol_type const&, error_code&) │ │ │ │ { │ │ │ │ - COMPLETE_ASYNC("i2p_stream::on_sam_connect"); │ │ │ │ - m_state = sam_idle; │ │ │ │ + TORRENT_ASSERT(m_magic == 0x1337); │ │ │ │ + // we need to ignore this for the same reason as stated │ │ │ │ + // for ignoring bind() │ │ │ │ +// m_sock.open(p, ec); │ │ │ │ + } │ │ │ │ │ │ │ │ - if (ec) │ │ │ │ - { │ │ │ │ - h(ec); │ │ │ │ - return; │ │ │ │ - } │ │ │ │ +#ifndef BOOST_NO_EXCEPTIONS │ │ │ │ + void close() │ │ │ │ + { │ │ │ │ + TORRENT_ASSERT(m_magic == 0x1337); │ │ │ │ + m_remote_endpoint = endpoint_type(); │ │ │ │ + m_sock.close(); │ │ │ │ + m_resolver.cancel(); │ │ │ │ + } │ │ │ │ +#endif │ │ │ │ │ │ │ │ - do_name_lookup("ME", wrap_allocator( │ │ │ │ - [this](error_code const& e, char const* dst, Handler hn) { │ │ │ │ - set_local_endpoint(e, dst, std::move(hn)); │ │ │ │ - }, std::move(h))); │ │ │ │ -
    relevance 0../include/libtorrent/string_view.hpp:40replace this by the standard string_view in C++17

    replace this by the standard string_view in C++17

    ../include/libtorrent/string_view.hpp:40

    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    │ │ │ │ -IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
    │ │ │ │ -ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
    │ │ │ │ -LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
    │ │ │ │ -CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
    │ │ │ │ -SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
    │ │ │ │ -INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
    │ │ │ │ -CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    │ │ │ │ +	void close(error_code& ec)
    │ │ │ │ +	{
    │ │ │ │ +		TORRENT_ASSERT(m_magic == 0x1337);
    │ │ │ │ +
    relevance 0../include/libtorrent/identify_client.hpp:48hide this declaration when deprecated functions are disabled, and remove its internal use

    hide this declaration when deprecated functions are disabled, and │ │ │ │ +remove its internal use

    ../include/libtorrent/identify_client.hpp:48

    CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    │ │ │ │  ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    │ │ │ │  POSSIBILITY OF SUCH DAMAGE.
    │ │ │ │  
    │ │ │ │  */
    │ │ │ │  
    │ │ │ │ -#ifndef TORRENT_STRING_VIEW_HPP_INCLUDED
    │ │ │ │ -#define TORRENT_STRING_VIEW_HPP_INCLUDED
    │ │ │ │ +#ifndef TORRENT_IDENTIFY_CLIENT_HPP_INCLUDED
    │ │ │ │ +#define TORRENT_IDENTIFY_CLIENT_HPP_INCLUDED
    │ │ │ │  
    │ │ │ │ -#include <boost/version.hpp>
    │ │ │ │ +#include "libtorrent/config.hpp"
    │ │ │ │  
    │ │ │ │ +#if TORRENT_ABI_VERSION == 1
    │ │ │ │  #include "libtorrent/aux_/disable_warnings_push.hpp"
    │ │ │ │ +#include <boost/optional.hpp>
    │ │ │ │ +#include "libtorrent/aux_/disable_warnings_pop.hpp"
    │ │ │ │ +#endif
    │ │ │ │  
    │ │ │ │ -
    │ │ │ │ -
    #if BOOST_VERSION < 106100 │ │ │ │ -#include <boost/utility/string_ref.hpp> │ │ │ │ -#include <cstring> // for strchr │ │ │ │ -namespace libtorrent { │ │ │ │ +#include "libtorrent/peer_id.hpp" │ │ │ │ +#include "libtorrent/fingerprint.hpp" │ │ │ │ │ │ │ │ -using string_view = boost::string_ref; │ │ │ │ -using wstring_view = boost::wstring_ref; │ │ │ │ +
    namespace libtorrent { │ │ │ │ +
    │ │ │ │ +namespace aux { │ │ │ │ + │ │ │ │ + TORRENT_EXTRA_EXPORT │ │ │ │ + std::string identify_client_impl(const peer_id& p); │ │ │ │ │ │ │ │ -// internal │ │ │ │ -inline string_view::size_type find_first_of(string_view const v, char const c │ │ │ │ - , string_view::size_type pos) │ │ │ │ -{ │ │ │ │ - while (pos < v.size()) │ │ │ │ - { │ │ │ │ - if (v[pos] == c) return pos; │ │ │ │ - ++pos; │ │ │ │ - } │ │ │ │ - return string_view::npos; │ │ │ │ } │ │ │ │ │ │ │ │ -// internal │ │ │ │ -inline string_view::size_type find_first_of(string_view const v, char const* c │ │ │ │ - , string_view::size_type pos) │ │ │ │ -{ │ │ │ │ - while (pos < v.size()) │ │ │ │ - { │ │ │ │ - if (std::strchr(c, v[pos]) != nullptr) return pos; │ │ │ │ - ++pos; │ │ │ │ - } │ │ │ │ - return string_view::npos; │ │ │ │ -
    relevance 0../include/libtorrent/hash_picker.hpp:155support batched adding of block hashes for reduced overhead?

    support batched adding of block hashes for reduced overhead?

    ../include/libtorrent/hash_picker.hpp:155

    		// the number of hashes in the range
    │ │ │ │ +	// these functions don't really need to be public. This mechanism of
    │ │ │ │ +	// advertising client software and version is also out-dated.
    │ │ │ │ +
    │ │ │ │ +	// This function can can be used to extract a string describing a client
    │ │ │ │ +	// version from its peer-id. It will recognize most clients that have this
    │ │ │ │ +	// kind of identification in the peer-id.
    │ │ │ │ +	TORRENT_DEPRECATED_EXPORT
    │ │ │ │ +	std::string identify_client(const peer_id& p);
    │ │ │ │ +
    │ │ │ │ +#if TORRENT_ABI_VERSION == 1
    │ │ │ │ +
    │ │ │ │ +#include "libtorrent/aux_/disable_deprecation_warnings_push.hpp"
    │ │ │ │ +
    │ │ │ │ +	// Returns an optional fingerprint if any can be identified from the peer
    │ │ │ │ +	// id. This can be used to automate the identification of clients. It will
    │ │ │ │ +	// not be able to identify peers with non- standard encodings. Only Azureus
    │ │ │ │ +	// style, Shadow's style and Mainline style.
    │ │ │ │ +	TORRENT_DEPRECATED_EXPORT
    │ │ │ │ +	boost::optional<fingerprint>
    │ │ │ │ +		client_fingerprint(peer_id const& p);
    │ │ │ │ +
    │ │ │ │ +#include "libtorrent/aux_/disable_warnings_pop.hpp"
    │ │ │ │ +
    relevance 0../include/libtorrent/hash_picker.hpp:155support batched adding of block hashes for reduced overhead?

    support batched adding of block hashes for reduced overhead?

    ../include/libtorrent/hash_picker.hpp:155

    		// the number of hashes in the range
    │ │ │ │  		int count = 0;
    │ │ │ │  		int proof_layers = 0;
    │ │ │ │  	};
    │ │ │ │  
    │ │ │ │  	// validates the hash_request, to ensure its invariant as well as matching
    │ │ │ │  	// the torrent's file_storage and the number of hashes accompanying the
    │ │ │ │  	// request
    │ │ │ │ @@ -11085,308 +11225,168 @@
    │ │ │ │  
    │ │ │ │  		struct priority_block_request
    │ │ │ │  		{
    │ │ │ │  			priority_block_request(file_index_t const f, int const b)
    │ │ │ │  				: file(f), block(b) {}
    │ │ │ │  			file_index_t file;
    │ │ │ │  			int block;
    │ │ │ │ -
    relevance 0../include/libtorrent/proxy_base.hpp:227it would be nice to remember the bind port and bind once we know where the proxy is m_sock.bind(endpoint, ec);

    it would be nice to remember the bind port and bind once we know where the proxy is │ │ │ │ -m_sock.bind(endpoint, ec);

    ../include/libtorrent/proxy_base.hpp:227

    		TORRENT_ASSERT(m_magic == 0x1337);
    │ │ │ │ -		m_sock.cancel();
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -	void cancel(error_code& ec)
    │ │ │ │ -	{
    │ │ │ │ -		TORRENT_ASSERT(m_magic == 0x1337);
    │ │ │ │ -		m_sock.cancel(ec);
    │ │ │ │ -	}
    │ │ │ │ -
    │ │ │ │ -	void bind(endpoint_type const& /* endpoint */, error_code& /* ec */)
    │ │ │ │ -	{
    │ │ │ │ -		TORRENT_ASSERT(m_magic == 0x1337);
    │ │ │ │ -		// the reason why we ignore binds here is because we don't
    │ │ │ │ -		// (necessarily) yet know what address family the proxy
    │ │ │ │ -		// will resolve to, and binding to the wrong one would
    │ │ │ │ -		// break our connection attempt later. The caller here
    │ │ │ │ -		// doesn't necessarily know that we're proxying, so this
    │ │ │ │ -		// bind address is based on the final endpoint, not the
    │ │ │ │ -		// proxy.
    │ │ │ │ -
    } │ │ │ │ -
    │ │ │ │ -#ifndef BOOST_NO_EXCEPTIONS │ │ │ │ - void open(protocol_type const&) │ │ │ │ - { │ │ │ │ - TORRENT_ASSERT(m_magic == 0x1337); │ │ │ │ -// m_sock.open(p); │ │ │ │ - } │ │ │ │ -#endif │ │ │ │ - │ │ │ │ - void open(protocol_type const&, error_code&) │ │ │ │ - { │ │ │ │ - TORRENT_ASSERT(m_magic == 0x1337); │ │ │ │ - // we need to ignore this for the same reason as stated │ │ │ │ - // for ignoring bind() │ │ │ │ -// m_sock.open(p, ec); │ │ │ │ - } │ │ │ │ - │ │ │ │ -#ifndef BOOST_NO_EXCEPTIONS │ │ │ │ - void close() │ │ │ │ - { │ │ │ │ - TORRENT_ASSERT(m_magic == 0x1337); │ │ │ │ - m_remote_endpoint = endpoint_type(); │ │ │ │ - m_sock.close(); │ │ │ │ - m_resolver.cancel(); │ │ │ │ - } │ │ │ │ -#endif │ │ │ │ - │ │ │ │ - void close(error_code& ec) │ │ │ │ - { │ │ │ │ - TORRENT_ASSERT(m_magic == 0x1337); │ │ │ │ -
    relevance 0../include/libtorrent/peer_connection.hpp:218make this a raw pointer (to save size in the first cache line) and make the constructor take a raw pointer. torrent objects should always outlive their peers

    make this a raw pointer (to save size in │ │ │ │ -the first cache line) and make the constructor │ │ │ │ -take a raw pointer. torrent objects should always │ │ │ │ -outlive their peers

    ../include/libtorrent/peer_connection.hpp:218

    			, m_snubbed(false)
    │ │ │ │ -			, m_interesting(false)
    │ │ │ │ -			, m_choked(true)
    │ │ │ │ -			, m_ignore_stats(false)
    │ │ │ │ -		{}
    │ │ │ │ -
    │ │ │ │ -		// explicitly disallow assignment, to silence msvc warning
    │ │ │ │ -		peer_connection_hot_members& operator=(peer_connection_hot_members const&) = delete;
    │ │ │ │ -
    │ │ │ │ -	protected:
    │ │ │ │ -
    │ │ │ │ -		// the pieces the other end have
    │ │ │ │ -		typed_bitfield<piece_index_t> m_have_piece;
    │ │ │ │ -
    │ │ │ │ -		// this is the torrent this connection is
    │ │ │ │ -		// associated with. If the connection is an
    │ │ │ │ -		// incoming connection, this is set to zero
    │ │ │ │ -		// until the info_hash is received. Then it's
    │ │ │ │ -		// set to the torrent it belongs to.
    │ │ │ │ -
    │ │ │ │ -
    std::weak_ptr<torrent> m_torrent; │ │ │ │ -
    │ │ │ │ - public: │ │ │ │ - │ │ │ │ - // a back reference to the session │ │ │ │ - // the peer belongs to. │ │ │ │ - aux::session_interface& m_ses; │ │ │ │ - │ │ │ │ - // settings that apply to this peer │ │ │ │ - aux::session_settings const& m_settings; │ │ │ │ - │ │ │ │ - protected: │ │ │ │ - │ │ │ │ - // this is true if this connection has been added │ │ │ │ - // to the list of connections that will be closed. │ │ │ │ - bool m_disconnecting:1; │ │ │ │ - │ │ │ │ - // this is true until this socket has become │ │ │ │ - // writable for the first time (i.e. the │ │ │ │ - // connection completed). While connecting │ │ │ │ - // the timeout will not be triggered. This is │ │ │ │ - // because windows XP SP2 may delay connection │ │ │ │ - // attempts, which means that the connection │ │ │ │ - // may not even have been attempted when the │ │ │ │ - // time out is reached. │ │ │ │ - bool m_connecting:1; │ │ │ │ - │ │ │ │ - // this is set to true if the last time we tried to │ │ │ │ - // pick a piece to download, we could only find │ │ │ │ - // blocks that were already requested from other │ │ │ │ - // peers. In this case, we should not try to pick │ │ │ │ -
    relevance 0../include/libtorrent/peer_connection.hpp:1026factor this out into its own class with a virtual interface torrent and session should implement this interface

    factor this out into its own class with a virtual interface │ │ │ │ -torrent and session should implement this interface

    ../include/libtorrent/peer_connection.hpp:1026

    │ │ │ │ -		// the local endpoint for this peer, i.e. our address
    │ │ │ │ -		// and our port. If this is set for outgoing connections
    │ │ │ │ -		// before the connection completes, it means we want to
    │ │ │ │ -		// force the connection to be bound to the specified interface.
    │ │ │ │ -		// if it ends up being bound to a different local IP, the connection
    │ │ │ │ -		// is closed.
    │ │ │ │ -		tcp::endpoint m_local;
    │ │ │ │ -
    │ │ │ │ -		// remote peer's id
    │ │ │ │ -		peer_id m_peer_id;
    │ │ │ │ +
    relevance 0../include/libtorrent/string_view.hpp:40replace this by the standard string_view in C++17

    replace this by the standard string_view in C++17

    ../include/libtorrent/string_view.hpp:40

    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    │ │ │ │ +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
    │ │ │ │ +ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
    │ │ │ │ +LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
    │ │ │ │ +CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
    │ │ │ │ +SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
    │ │ │ │ +INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
    │ │ │ │ +CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    │ │ │ │ +ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    │ │ │ │ +POSSIBILITY OF SUCH DAMAGE.
    │ │ │ │  
    │ │ │ │ -	protected:
    │ │ │ │ +*/
    │ │ │ │  
    │ │ │ │ -		template <typename Fun, typename... Args>
    │ │ │ │ -		void wrap(Fun f, Args&&... a);
    │ │ │ │ +#ifndef TORRENT_STRING_VIEW_HPP_INCLUDED
    │ │ │ │ +#define TORRENT_STRING_VIEW_HPP_INCLUDED
    │ │ │ │  
    │ │ │ │ -		// statistics about upload and download speeds
    │ │ │ │ -		// and total amount of uploads and downloads for
    │ │ │ │ -		// this peer
    │ │ │ │ -
    stat m_statistics; │ │ │ │ -
    │ │ │ │ - // the number of outstanding bytes expected │ │ │ │ - // to be received by extensions │ │ │ │ - int m_extension_outstanding_bytes = 0; │ │ │ │ +#include <boost/version.hpp> │ │ │ │ │ │ │ │ - // the number of time critical requests │ │ │ │ - // queued up in the m_request_queue that │ │ │ │ - // soon will be committed to the download │ │ │ │ - // queue. This is included in download_queue_time() │ │ │ │ - // so that it can be used while adding more │ │ │ │ - // requests and take the previous requests │ │ │ │ - // into account without submitting it all │ │ │ │ - // immediately │ │ │ │ - std::uint16_t m_queued_time_critical = 0; │ │ │ │ +#include "libtorrent/aux_/disable_warnings_push.hpp" │ │ │ │ │ │ │ │ - // the number of bytes we are currently reading │ │ │ │ - // from disk, that will be added to the send │ │ │ │ - // buffer as soon as they complete │ │ │ │ - int m_reading_bytes = 0; │ │ │ │ +
    │ │ │ │ +
    #if BOOST_VERSION < 106100 │ │ │ │ +#include <boost/utility/string_ref.hpp> │ │ │ │ +#include <cstring> // for strchr │ │ │ │ +namespace libtorrent { │ │ │ │ │ │ │ │ - // options used for the piece picker. These flags will │ │ │ │ - // be augmented with flags controlled by other settings │ │ │ │ - // like sequential download etc. These are here to │ │ │ │ - // let plugins control flags that should always be set │ │ │ │ - picker_options_t m_picker_options{}; │ │ │ │ +using string_view = boost::string_ref; │ │ │ │ +using wstring_view = boost::wstring_ref; │ │ │ │ │ │ │ │ - // the number of invalid piece-requests │ │ │ │ - // we have got from this peer. If the request │ │ │ │ - // queue gets empty, and there have been │ │ │ │ - // invalid requests, we can assume the │ │ │ │ -
    relevance 0../include/libtorrent/socks5_stream.hpp:197we could bind the socket here, since we know what the target endpoint is of the proxy

    we could bind the socket here, since we know what the │ │ │ │ -target endpoint is of the proxy

    ../include/libtorrent/socks5_stream.hpp:197

    			}, std::move(handler)));
    │ │ │ │ +// internal
    │ │ │ │ +inline string_view::size_type find_first_of(string_view const v, char const c
    │ │ │ │ +	, string_view::size_type pos)
    │ │ │ │ +{
    │ │ │ │ +	while (pos < v.size())
    │ │ │ │ +	{
    │ │ │ │ +		if (v[pos] == c) return pos;
    │ │ │ │ +		++pos;
    │ │ │ │  	}
    │ │ │ │ +	return string_view::npos;
    │ │ │ │ +}
    │ │ │ │  
    │ │ │ │ -private:
    │ │ │ │ -
    │ │ │ │ -	template <typename Handler>
    │ │ │ │ -	void name_lookup(error_code const& e, tcp::resolver::results_type ips
    │ │ │ │ -		, Handler h)
    │ │ │ │ +// internal
    │ │ │ │ +inline string_view::size_type find_first_of(string_view const v, char const* c
    │ │ │ │ +	, string_view::size_type pos)
    │ │ │ │ +{
    │ │ │ │ +	while (pos < v.size())
    │ │ │ │  	{
    │ │ │ │ -		COMPLETE_ASYNC("socks5_stream::name_lookup");
    │ │ │ │ -		if (handle_error(e, std::move(h))) return;
    │ │ │ │ +		if (std::strchr(c, v[pos]) != nullptr) return pos;
    │ │ │ │ +		++pos;
    │ │ │ │ +	}
    │ │ │ │ +	return string_view::npos;
    │ │ │ │ +
    relevance 0../include/libtorrent/torrent_info.hpp:729change the type to std::shared_ptr in C++17 it is used as if immutable, it cannot be const for technical reasons right now.

    change the type to std::shared_ptr in C++17 │ │ │ │ +it is used as if immutable, it cannot be const for technical reasons │ │ │ │ +right now.

    ../include/libtorrent/torrent_info.hpp:729

    │ │ │ │ +		// these are the collections from outside of the info-dict. These are
    │ │ │ │ +		// owning strings, since we only keep the info-section around, these
    │ │ │ │ +		// cannot be pointers into that buffer.
    │ │ │ │ +		std::vector<std::string> m_owned_collections;
    │ │ │ │  
    │ │ │ │ -		auto i = ips.begin();
    │ │ │ │ -		if (!m_sock.is_open())
    │ │ │ │ -		{
    │ │ │ │ -			error_code ec;
    │ │ │ │ -			m_sock.open(i->endpoint().protocol(), ec);
    │ │ │ │ -			if (handle_error(ec, std::move(h))) return;
    │ │ │ │ -		}
    │ │ │ │ +#if TORRENT_ABI_VERSION <= 2
    │ │ │ │ +		// if this is a merkle torrent, this is the merkle
    │ │ │ │ +		// tree. It has space for merkle_num_nodes(merkle_num_leafs(num_pieces))
    │ │ │ │ +		// hashes
    │ │ │ │ +		aux::vector<sha1_hash> m_merkle_tree;
    │ │ │ │ +#endif
    │ │ │ │  
    │ │ │ │ -
    ADD_OUTSTANDING_ASYNC("socks5_stream::connected"); │ │ │ │ -
    m_sock.async_connect(i->endpoint(), wrap_allocator( │ │ │ │ - [this](error_code const& ec, Handler hn) │ │ │ │ - { connected(ec, std::move(hn)); }, std::move(h))); │ │ │ │ - } │ │ │ │ + // v2 merkle tree for each file │ │ │ │ + // the actual hash buffers are always divisible by 32 (sha256_hash::size()) │ │ │ │ + aux::vector<aux::vector<char>, file_index_t> m_piece_layers; │ │ │ │ │ │ │ │ - template <typename Handler> │ │ │ │ - void connected(error_code const& e, Handler h) │ │ │ │ - { │ │ │ │ - COMPLETE_ASYNC("socks5_stream::connected"); │ │ │ │ - if (handle_error(e, std::move(h))) return; │ │ │ │ + // this is a copy of the info section from the torrent. │ │ │ │ + // it use maintained in this flat format in order to │ │ │ │ + // make it available through the metadata extension │ │ │ │ +
    boost::shared_array<char> m_info_section; │ │ │ │ +
    │ │ │ │ + // if a comment is found in the torrent file │ │ │ │ + // this will be set to that comment │ │ │ │ + std::string m_comment; │ │ │ │ │ │ │ │ - using namespace libtorrent::aux; │ │ │ │ - if (m_version == 5) │ │ │ │ - { │ │ │ │ - // send SOCKS5 authentication methods │ │ │ │ - m_buffer.resize(m_user.empty()?3:4); │ │ │ │ - char* p = &m_buffer[0]; │ │ │ │ - write_uint8(5, p); // SOCKS VERSION 5 │ │ │ │ - if (m_user.empty()) │ │ │ │ - { │ │ │ │ - write_uint8(1, p); // 1 authentication method (no auth) │ │ │ │ - write_uint8(0, p); // no authentication │ │ │ │ - } │ │ │ │ - else │ │ │ │ - { │ │ │ │ - write_uint8(2, p); // 2 authentication methods │ │ │ │ - write_uint8(0, p); // no authentication │ │ │ │ - write_uint8(2, p); // username/password │ │ │ │ - } │ │ │ │ - ADD_OUTSTANDING_ASYNC("socks5_stream::handshake1"); │ │ │ │ -
    relevance 0../include/libtorrent/upnp.hpp:162support using the windows API for UPnP operations as well

    support using the windows API for UPnP operations as well

    ../include/libtorrent/upnp.hpp:162

    {
    │ │ │ │ -	bool in_error_code = false;
    │ │ │ │ -	bool exit = false;
    │ │ │ │ -	int error_code = -1;
    │ │ │ │ -};
    │ │ │ │ +		// an optional string naming the software used
    │ │ │ │ +		// to create the torrent file
    │ │ │ │ +		std::string m_created_by;
    │ │ │ │  
    │ │ │ │ -struct ip_address_parse_state: error_code_parse_state
    │ │ │ │ -{
    │ │ │ │ -	bool in_ip_address = false;
    │ │ │ │ -	std::string ip_address;
    │ │ │ │ -};
    │ │ │ │ +		// the info section parsed. points into m_info_section
    │ │ │ │ +		// parsed lazily
    │ │ │ │ +		mutable bdecode_node m_info_dict;
    │ │ │ │  
    │ │ │ │ -TORRENT_EXTRA_EXPORT void find_control_url(int type, string_view, parse_state& state);
    │ │ │ │ +		// if a creation date is found in the torrent file
    │ │ │ │ +		// this will be set to that, otherwise it'll be
    │ │ │ │ +		// 1970, Jan 1
    │ │ │ │ +		std::time_t m_creation_date = 0;
    │ │ │ │  
    │ │ │ │ -TORRENT_EXTRA_EXPORT void find_error_code(int type, string_view string
    │ │ │ │ -	, error_code_parse_state& state);
    │ │ │ │ +		// the hash(es) that identify this torrent
    │ │ │ │ +		info_hash_t m_info_hash;
    │ │ │ │  
    │ │ │ │ -TORRENT_EXTRA_EXPORT void find_ip_address(int type, string_view string
    │ │ │ │ -	, ip_address_parse_state& state);
    │ │ │ │ +		// this is the offset into the m_info_section buffer to the first byte of
    │ │ │ │ +		// the first SHA-1 hash
    │ │ │ │ +		std::int32_t m_piece_hashes = 0;
    │ │ │ │  
    │ │ │ │ -
    struct TORRENT_EXTRA_EXPORT upnp final │ │ │ │ -
    : std::enable_shared_from_this<upnp> │ │ │ │ - , single_threaded │ │ │ │ -{ │ │ │ │ - upnp(io_context& ios │ │ │ │ - , aux::session_settings const& settings │ │ │ │ - , aux::portmap_callback& cb │ │ │ │ - , address_v4 listen_address │ │ │ │ - , address_v4 netmask │ │ │ │ - , std::string listen_device │ │ │ │ - , aux::listen_socket_handle ls); │ │ │ │ - ~upnp(); │ │ │ │ + // the number of bytes in m_info_section │ │ │ │ + std::int32_t m_info_section_size = 0; │ │ │ │ │ │ │ │ - void start(); │ │ │ │ + // this is used when creating a torrent. If there's │ │ │ │ + // only one file there are cases where it's impossible │ │ │ │ +
    relevance 0../include/libtorrent/peer_connection_interface.hpp:51make this interface smaller!

    make this interface smaller!

    ../include/libtorrent/peer_connection_interface.hpp:51

    │ │ │ │ +*/
    │ │ │ │  
    │ │ │ │ -	// Attempts to add a port mapping for the specified protocol. Valid protocols are
    │ │ │ │ -	// ``upnp::tcp`` and ``upnp::udp`` for the UPnP class and ``natpmp::tcp`` and
    │ │ │ │ -	// ``natpmp::udp`` for the NAT-PMP class.
    │ │ │ │ -	//
    │ │ │ │ -	// ``external_port`` is the port on the external address that will be mapped. This
    │ │ │ │ -	// is a hint, you are not guaranteed that this port will be available, and it may
    │ │ │ │ -	// end up being something else. In the portmap_alert_ notification, the actual
    │ │ │ │ -	// external port is reported.
    │ │ │ │ -	//
    │ │ │ │ -	// ``local_port`` is the port in the local machine that the mapping should forward
    │ │ │ │ -	// to.
    │ │ │ │ -	//
    │ │ │ │ -	// The return value is an index that identifies this port mapping. This is used
    │ │ │ │ -	// to refer to mappings that fails or succeeds in the portmap_error_alert_ and
    │ │ │ │ -	// portmap_alert_ respectively. If The mapping fails immediately, the return value
    │ │ │ │ -	// is -1, which means failure. There will not be any error alert notification for
    │ │ │ │ -
    relevance 0../include/libtorrent/performance_counters.hpp:485some space could be saved here by making gauges 32 bits

    some space could be saved here by making gauges 32 bits

    ../include/libtorrent/performance_counters.hpp:485

    relevance 0../include/libtorrent/performance_counters.hpp:486restore these to regular integers. Instead have one copy of the counters per thread and collect them at convenient synchronization points

    restore these to regular integers. Instead have one copy │ │ │ │ -of the counters per thread and collect them at convenient │ │ │ │ -synchronization points

    ../include/libtorrent/performance_counters.hpp:486

    #ifdef ATOMIC_LLONG_LOCK_FREE
    │ │ │ │ -#define TORRENT_COUNTER_NOEXCEPT noexcept
    │ │ │ │ -#else
    │ │ │ │ -#define TORRENT_COUNTER_NOEXCEPT
    │ │ │ │ -#endif
    │ │ │ │ +#ifndef TORRENT_PEER_CONNECTION_INTERFACE_HPP
    │ │ │ │ +#define TORRENT_PEER_CONNECTION_INTERFACE_HPP
    │ │ │ │  
    │ │ │ │ -		counters() TORRENT_COUNTER_NOEXCEPT;
    │ │ │ │ +#include "libtorrent/fwd.hpp"
    │ │ │ │ +#include "libtorrent/socket.hpp"
    │ │ │ │ +#include "libtorrent/error_code.hpp"
    │ │ │ │ +#include "libtorrent/alert_types.hpp"
    │ │ │ │ +#include "libtorrent/operations.hpp" // for operation_t enum
    │ │ │ │ +#include "libtorrent/units.hpp"
    │ │ │ │  
    │ │ │ │ -		counters(counters const&) TORRENT_COUNTER_NOEXCEPT;
    │ │ │ │ -		counters& operator=(counters const&) & TORRENT_COUNTER_NOEXCEPT;
    │ │ │ │ +namespace libtorrent {
    │ │ │ │  
    │ │ │ │ -		// returns the new value
    │ │ │ │ -		std::int64_t inc_stats_counter(int c, std::int64_t value = 1) TORRENT_COUNTER_NOEXCEPT;
    │ │ │ │ -		std::int64_t operator[](int i) const TORRENT_COUNTER_NOEXCEPT;
    │ │ │ │ +	struct torrent_peer;
    │ │ │ │ +	class stat;
    │ │ │ │  
    │ │ │ │ -		void set_value(int c, std::int64_t value) TORRENT_COUNTER_NOEXCEPT;
    │ │ │ │ -		void blend_stats_counter(int c, std::int64_t value, int ratio) TORRENT_COUNTER_NOEXCEPT;
    │ │ │ │ +	using disconnect_severity_t = aux::strong_typedef<std::uint8_t, struct disconnect_severity_tag>;
    │ │ │ │  
    │ │ │ │ -	private:
    │ │ │ │ +
    struct TORRENT_EXTRA_EXPORT peer_connection_interface │ │ │ │ +
    { │ │ │ │ + static constexpr disconnect_severity_t normal{0}; │ │ │ │ + static constexpr disconnect_severity_t failure{1}; │ │ │ │ + static constexpr disconnect_severity_t peer_error{2}; │ │ │ │ │ │ │ │ -
    #ifdef ATOMIC_LLONG_LOCK_FREE │ │ │ │ -
    aux::array<std::atomic<std::int64_t>, num_counters> m_stats_counter; │ │ │ │ -#else │ │ │ │ - // if the atomic type isn't lock-free, use a single lock instead, for │ │ │ │ - // the whole array │ │ │ │ - mutable std::mutex m_mutex; │ │ │ │ - aux::array<std::int64_t, num_counters> m_stats_counter; │ │ │ │ +#if TORRENT_USE_I2P │ │ │ │ + virtual std::string const& destination() const = 0; │ │ │ │ + virtual std::string const& local_i2p_endpoint() const = 0; │ │ │ │ #endif │ │ │ │ - }; │ │ │ │ -} │ │ │ │ - │ │ │ │ + virtual tcp::endpoint const& remote() const = 0; │ │ │ │ + virtual tcp::endpoint local_endpoint() const = 0; │ │ │ │ + virtual void disconnect(error_code const& ec │ │ │ │ + , operation_t op, disconnect_severity_t = peer_connection_interface::normal) = 0; │ │ │ │ + virtual peer_id const& pid() const = 0; │ │ │ │ + virtual peer_id our_pid() const = 0; │ │ │ │ + virtual void set_holepunch_mode() = 0; │ │ │ │ + virtual torrent_peer* peer_info_struct() const = 0; │ │ │ │ + virtual void set_peer_info(torrent_peer* pi) = 0; │ │ │ │ + virtual bool is_outgoing() const = 0; │ │ │ │ + virtual void add_stat(std::int64_t downloaded, std::int64_t uploaded) = 0; │ │ │ │ + virtual bool fast_reconnect() const = 0; │ │ │ │ + virtual bool is_choked() const = 0; │ │ │ │ + virtual bool failed() const = 0; │ │ │ │ + virtual stat const& statistics() const = 0; │ │ │ │ + virtual void get_peer_info(peer_info& p) const = 0; │ │ │ │ +#ifndef TORRENT_DISABLE_LOGGING │ │ │ │ + virtual bool should_log(peer_log_alert::direction_t direction) const = 0; │ │ │ │ + virtual void peer_log(peer_log_alert::direction_t direction │ │ │ │ + , char const* event, char const* fmt = "", ...) const noexcept TORRENT_FORMAT(4,5) = 0; │ │ │ │ #endif │ │ │ │
    relevance 0../include/libtorrent/kademlia/msg.hpp:87move this to its own .hpp/.cpp pair?

    move this to its own .hpp/.cpp pair?

    ../include/libtorrent/kademlia/msg.hpp:87

    	int flags;
    │ │ │ │  
    │ │ │ │  	enum {
    │ │ │ │  		// this argument is optional, parsing will not
    │ │ │ │  		// fail if it's not present
    │ │ │ │  		optional = 1,
    │ │ │ │ @@ -11468,219 +11468,50 @@
    │ │ │ │  		, secret_key const& sk);
    │ │ │ │  	explicit item(bdecode_node const& v);
    │ │ │ │  
    │ │ │ │  	void assign(entry v);
    │ │ │ │  	void assign(entry v, span<char const> salt
    │ │ │ │  		, sequence_number seq
    │ │ │ │  		, public_key const& pk
    │ │ │ │ -
    relevance 0../include/libtorrent/aux_/session_interface.hpp:212it would be nice to not have this be part of session_interface

    it would be nice to not have this be part of session_interface

    ../include/libtorrent/aux_/session_interface.hpp:212

    		virtual void deferred_submit_jobs() = 0;
    │ │ │ │ -
    │ │ │ │ -		virtual std::uint16_t listen_port() const = 0;
    │ │ │ │ -		virtual std::uint16_t ssl_listen_port() const = 0;
    │ │ │ │ -
    │ │ │ │ -		virtual int listen_port(aux::transport ssl, address const& local_addr) = 0;
    │ │ │ │ -
    │ │ │ │ -		virtual void for_each_listen_socket(std::function<void(aux::listen_socket_handle const&)> f) = 0;
    │ │ │ │ -
    │ │ │ │ -		// ask for which interface and port to bind outgoing peer connections on
    │ │ │ │ -		virtual tcp::endpoint bind_outgoing_socket(socket_type& s, address const&
    │ │ │ │ -			remote_address, error_code& ec) const = 0;
    │ │ │ │ -		virtual bool verify_bound_address(address const& addr, bool utp
    │ │ │ │ -			, error_code& ec) = 0;
    │ │ │ │ -
    │ │ │ │ -#ifndef TORRENT_DISABLE_MUTABLE_TORRENTS
    │ │ │ │ -		virtual std::vector<std::shared_ptr<torrent>> find_collection(
    │ │ │ │ -			std::string const& collection) const = 0;
    │ │ │ │ -#endif
    │ │ │ │ -
    │ │ │ │ -
    virtual proxy_settings proxy() const = 0; │ │ │ │ -
    │ │ │ │ -#if TORRENT_USE_I2P │ │ │ │ - virtual char const* i2p_session() const = 0; │ │ │ │ - virtual std::string const& local_i2p_endpoint() const = 0; │ │ │ │ -#endif │ │ │ │ - │ │ │ │ - virtual void prioritize_connections(std::weak_ptr<torrent> t) = 0; │ │ │ │ - │ │ │ │ - virtual void trigger_auto_manage() = 0; │ │ │ │ - │ │ │ │ - virtual void apply_settings_pack(std::shared_ptr<settings_pack> pack) = 0; │ │ │ │ - virtual session_settings const& settings() const = 0; │ │ │ │ - │ │ │ │ - virtual void queue_tracker_request(tracker_request req │ │ │ │ - , std::weak_ptr<request_callback> c) = 0; │ │ │ │ +
    relevance 0../include/libtorrent/aux_/pool.hpp:49ensure the alignment is good here

    ensure the alignment is good here

    ../include/libtorrent/aux_/pool.hpp:49

    POSSIBILITY OF SUCH DAMAGE.
    │ │ │ │  
    │ │ │ │ -		// peer-classes
    │ │ │ │ -		virtual void set_peer_classes(peer_class_set* s, address const& a, socket_type_t st) = 0;
    │ │ │ │ -		virtual peer_class_pool const& peer_classes() const = 0;
    │ │ │ │ -		virtual peer_class_pool& peer_classes() = 0;
    │ │ │ │ -		virtual bool ignore_unchoke_slots_set(peer_class_set const& set) const = 0;
    │ │ │ │ -		virtual int copy_pertinent_channels(peer_class_set const& set
    │ │ │ │ -			, int channel, bandwidth_channel** dst, int m) = 0;
    │ │ │ │ -		virtual int use_quota_overhead(peer_class_set& set, int amount_down, int amount_up) = 0;
    │ │ │ │ -
    │ │ │ │ -		virtual bandwidth_manager* get_bandwidth_manager(int channel) = 0;
    │ │ │ │ -
    │ │ │ │ -		virtual void sent_bytes(int bytes_payload, int bytes_protocol) = 0;
    │ │ │ │ -		virtual void received_bytes(int bytes_payload, int bytes_protocol) = 0;
    │ │ │ │ -		virtual void trancieve_ip_packet(int bytes, bool ipv6) = 0;
    │ │ │ │ -
    relevance 0../include/libtorrent/aux_/session_impl.hpp:265make these direct members and generate shared_ptrs to them which alias the listen_socket_t shared_ptr

    make these direct members and generate shared_ptrs to them │ │ │ │ -which alias the listen_socket_t shared_ptr

    ../include/libtorrent/aux_/session_impl.hpp:265

    			if (udp_sock) return udp_sock->sock.local_port();
    │ │ │ │ -			return 0;
    │ │ │ │ -		}
    │ │ │ │ -
    │ │ │ │ -		// 0 is natpmp 1 is upnp
    │ │ │ │ -		// the order of these arrays determines the priority in
    │ │ │ │ -		// which their ports will be announced to peers
    │ │ │ │ -		aux::array<listen_port_mapping, 2, portmap_transport> tcp_port_mapping;
    │ │ │ │ -		aux::array<listen_port_mapping, 2, portmap_transport> udp_port_mapping;
    │ │ │ │ -
    │ │ │ │ -		// indicates whether this is an SSL listen socket or not
    │ │ │ │ -		transport ssl = transport::plaintext;
    │ │ │ │ -
    │ │ │ │ -		listen_socket_flags_t flags = accept_incoming;
    │ │ │ │ -
    │ │ │ │ -		// the actual sockets (TCP listen socket and UDP socket)
    │ │ │ │ -		// An entry does not necessarily have a UDP or TCP socket. One of these
    │ │ │ │ -		// pointers may be nullptr!
    │ │ │ │ -		// These must be shared_ptr to avoid a dangling reference if an
    │ │ │ │ -		// incoming packet is in the event queue when the socket is erased
    │ │ │ │ -
    std::shared_ptr<tcp::acceptor> sock; │ │ │ │ -
    std::shared_ptr<aux::session_udp_socket> udp_sock; │ │ │ │ - │ │ │ │ - // since udp packets are expected to be dispatched frequently, this saves │ │ │ │ - // time on handler allocation every time we read again. │ │ │ │ - aux::handler_storage<aux::udp_handler_max_size, aux::udp_handler> udp_handler_storage; │ │ │ │ - │ │ │ │ - std::shared_ptr<natpmp> natpmp_mapper; │ │ │ │ - std::shared_ptr<upnp> upnp_mapper; │ │ │ │ - │ │ │ │ - std::shared_ptr<struct lsd> lsd; │ │ │ │ - │ │ │ │ - // set to true when we receive an incoming connection from this listen │ │ │ │ - // socket │ │ │ │ - bool incoming_connection = false; │ │ │ │ - }; │ │ │ │ - │ │ │ │ - struct TORRENT_EXTRA_EXPORT listen_endpoint_t │ │ │ │ - { │ │ │ │ - listen_endpoint_t(address const& adr, int p, std::string dev, transport s │ │ │ │ - , listen_socket_flags_t f, address const& nmask = address{}) │ │ │ │ - : addr(adr), netmask(nmask), port(p), device(std::move(dev)), ssl(s), flags(f) {} │ │ │ │ - │ │ │ │ - bool operator==(listen_endpoint_t const& o) const │ │ │ │ - { │ │ │ │ - return addr == o.addr │ │ │ │ - && port == o.port │ │ │ │ - && device == o.device │ │ │ │ - && ssl == o.ssl │ │ │ │ - && flags == o.flags; │ │ │ │ - } │ │ │ │ -
    relevance 0../include/libtorrent/aux_/session_impl.hpp:1068replace this by a proper asio timer

    replace this by a proper asio timer

    ../include/libtorrent/aux_/session_impl.hpp:1068

    #ifdef TORRENT_SSL_PEERS
    │ │ │ │ -			void on_incoming_utp_ssl(socket_type s);
    │ │ │ │ -			void ssl_handshake(error_code const& ec, socket_type* s);
    │ │ │ │ -#endif
    │ │ │ │ -
    │ │ │ │ -			// round-robin index into m_outgoing_interfaces
    │ │ │ │ -			mutable std::uint8_t m_interface_index = 0;
    │ │ │ │ -
    │ │ │ │ -			std::shared_ptr<listen_socket_t> setup_listener(
    │ │ │ │ -				listen_endpoint_t const& lep, error_code& ec);
    │ │ │ │ -
    │ │ │ │ -#ifndef TORRENT_DISABLE_DHT
    │ │ │ │ -			dht::dht_state m_dht_state;
    │ │ │ │ -#endif
    │ │ │ │ -
    │ │ │ │ -			// this is initialized to the unchoke_interval
    │ │ │ │ -			// session_setting and decreased every second.
    │ │ │ │ -			// when it reaches zero, it is reset to the
    │ │ │ │ -			// unchoke_interval and the unchoke set is
    │ │ │ │ -			// recomputed.
    │ │ │ │ -
    int m_unchoke_time_scaler = 0; │ │ │ │ -
    │ │ │ │ - // this is used to decide when to recalculate which │ │ │ │ - // torrents to keep queued and which to activate │ │ │ │ -
    relevance 0../include/libtorrent/aux_/session_impl.hpp:1073replace this by a proper asio timer

    replace this by a proper asio timer

    ../include/libtorrent/aux_/session_impl.hpp:1073

    │ │ │ │ -			// round-robin index into m_outgoing_interfaces
    │ │ │ │ -			mutable std::uint8_t m_interface_index = 0;
    │ │ │ │ -
    │ │ │ │ -			std::shared_ptr<listen_socket_t> setup_listener(
    │ │ │ │ -				listen_endpoint_t const& lep, error_code& ec);
    │ │ │ │ -
    │ │ │ │ -#ifndef TORRENT_DISABLE_DHT
    │ │ │ │ -			dht::dht_state m_dht_state;
    │ │ │ │ -#endif
    │ │ │ │ +*/
    │ │ │ │  
    │ │ │ │ -			// this is initialized to the unchoke_interval
    │ │ │ │ -			// session_setting and decreased every second.
    │ │ │ │ -			// when it reaches zero, it is reset to the
    │ │ │ │ -			// unchoke_interval and the unchoke set is
    │ │ │ │ -			// recomputed.
    │ │ │ │ -			int m_unchoke_time_scaler = 0;
    │ │ │ │ +#ifndef TORRENT_POOL_HPP
    │ │ │ │ +#define TORRENT_POOL_HPP
    │ │ │ │  
    │ │ │ │ -			// this is used to decide when to recalculate which
    │ │ │ │ -			// torrents to keep queued and which to activate
    │ │ │ │ -
    int m_auto_manage_time_scaler = 0; │ │ │ │ -
    │ │ │ │ - // works like unchoke_time_scaler but it │ │ │ │ - // is only decreased when the unchoke set │ │ │ │ - // is recomputed, and when it reaches zero, │ │ │ │ - // the optimistic unchoke is moved to another peer. │ │ │ │ -
    relevance 0../include/libtorrent/aux_/session_impl.hpp:1080replace this by a proper asio timer

    replace this by a proper asio timer

    ../include/libtorrent/aux_/session_impl.hpp:1080

    │ │ │ │ -#ifndef TORRENT_DISABLE_DHT
    │ │ │ │ -			dht::dht_state m_dht_state;
    │ │ │ │ -#endif
    │ │ │ │ +#include "libtorrent/aux_/disable_warnings_push.hpp"
    │ │ │ │ +#include <boost/pool/pool.hpp>
    │ │ │ │ +#include <boost/pool/object_pool.hpp>
    │ │ │ │ +#include "libtorrent/aux_/disable_warnings_pop.hpp"
    │ │ │ │  
    │ │ │ │ -			// this is initialized to the unchoke_interval
    │ │ │ │ -			// session_setting and decreased every second.
    │ │ │ │ -			// when it reaches zero, it is reset to the
    │ │ │ │ -			// unchoke_interval and the unchoke set is
    │ │ │ │ -			// recomputed.
    │ │ │ │ -			int m_unchoke_time_scaler = 0;
    │ │ │ │ +namespace libtorrent {
    │ │ │ │ +namespace aux {
    │ │ │ │  
    │ │ │ │ -			// this is used to decide when to recalculate which
    │ │ │ │ -			// torrents to keep queued and which to activate
    │ │ │ │ -			int m_auto_manage_time_scaler = 0;
    │ │ │ │ +struct allocator_new_delete
    │ │ │ │ +{
    │ │ │ │ +	using size_type = std::size_t;
    │ │ │ │ +	using difference_type = std::ptrdiff_t;
    │ │ │ │  
    │ │ │ │ -			// works like unchoke_time_scaler but it
    │ │ │ │ -			// is only decreased when the unchoke set
    │ │ │ │ -			// is recomputed, and when it reaches zero,
    │ │ │ │ -			// the optimistic unchoke is moved to another peer.
    │ │ │ │ -
    int m_optimistic_unchoke_time_scaler = 0; │ │ │ │ -
    │ │ │ │ - // works like unchoke_time_scaler. Each time │ │ │ │ - // it reaches 0, and all the connections are │ │ │ │ - // used, the worst connection will be disconnected │ │ │ │ - // from the torrent with the most peers │ │ │ │ - int m_disconnect_time_scaler = 90; │ │ │ │ +
    static char* malloc(size_type const bytes) │ │ │ │ +
    { return new char[bytes]; } │ │ │ │ + static void free(char* const block) │ │ │ │ + { delete [] block; } │ │ │ │ +}; │ │ │ │ │ │ │ │ - // when this scaler reaches zero, it will │ │ │ │ - // scrape one of the auto managed, paused, │ │ │ │ - // torrents. │ │ │ │ - int m_auto_scrape_time_scaler = 180; │ │ │ │ +using pool = boost::pool<allocator_new_delete>; │ │ │ │ │ │ │ │ - // statistics gathered from all torrents. │ │ │ │ - stat m_stat; │ │ │ │ +template <typename T> │ │ │ │ +using object_pool = boost::object_pool<T, allocator_new_delete>; │ │ │ │ │ │ │ │ - // implements session_interface │ │ │ │ - void sent_bytes(int bytes_payload, int bytes_protocol) override; │ │ │ │ - void received_bytes(int bytes_payload, int bytes_protocol) override; │ │ │ │ - void trancieve_ip_packet(int bytes, bool ipv6) override; │ │ │ │ - void sent_syn(bool ipv6) override; │ │ │ │ - void received_synack(bool ipv6) override; │ │ │ │ +} │ │ │ │ +} │ │ │ │ │ │ │ │ -#if TORRENT_ABI_VERSION == 1 │ │ │ │ - int m_peak_up_rate = 0; │ │ │ │ #endif │ │ │ │ - │ │ │ │ - void on_tick(error_code const& e); │ │ │ │ - │ │ │ │ - void try_connect_more_peers(); │ │ │ │ - void auto_manage_checking_torrents(std::vector<torrent*>& list │ │ │ │ -
    relevance 0../include/libtorrent/aux_/announce_entry.hpp:74include the number of peers received from this tracker, at last announce

    include the number of peers received from this tracker, at last │ │ │ │ +relevance 0../include/libtorrent/aux_/announce_entry.hpp:74include the number of peers received from this tracker, at last announce

    include the number of peers received from this tracker, at last │ │ │ │ announce

    ../include/libtorrent/aux_/announce_entry.hpp:74

    namespace aux {
    │ │ │ │  
    │ │ │ │  	struct TORRENT_EXTRA_EXPORT announce_infohash
    │ │ │ │  	{
    │ │ │ │  		announce_infohash();
    │ │ │ │  
    │ │ │ │  		// if this tracker has returned an error or warning message
    │ │ │ │ @@ -11724,50 +11555,15 @@
    │ │ │ │  		// set to true when we get a valid response from an announce
    │ │ │ │  		// with event=started. If it is set, we won't send start in the subsequent
    │ │ │ │  		// announces.
    │ │ │ │  		bool start_sent : 1;
    │ │ │ │  
    │ │ │ │  		// set to true when we send a event=completed.
    │ │ │ │  		bool complete_sent : 1;
    │ │ │ │ -
    relevance 0../include/libtorrent/aux_/pool.hpp:49ensure the alignment is good here

    ensure the alignment is good here

    ../include/libtorrent/aux_/pool.hpp:49

    POSSIBILITY OF SUCH DAMAGE.
    │ │ │ │ -
    │ │ │ │ -*/
    │ │ │ │ -
    │ │ │ │ -#ifndef TORRENT_POOL_HPP
    │ │ │ │ -#define TORRENT_POOL_HPP
    │ │ │ │ -
    │ │ │ │ -#include "libtorrent/aux_/disable_warnings_push.hpp"
    │ │ │ │ -#include <boost/pool/pool.hpp>
    │ │ │ │ -#include <boost/pool/object_pool.hpp>
    │ │ │ │ -#include "libtorrent/aux_/disable_warnings_pop.hpp"
    │ │ │ │ -
    │ │ │ │ -namespace libtorrent {
    │ │ │ │ -namespace aux {
    │ │ │ │ -
    │ │ │ │ -struct allocator_new_delete
    │ │ │ │ -{
    │ │ │ │ -	using size_type = std::size_t;
    │ │ │ │ -	using difference_type = std::ptrdiff_t;
    │ │ │ │ -
    │ │ │ │ -
    static char* malloc(size_type const bytes) │ │ │ │ -
    { return new char[bytes]; } │ │ │ │ - static void free(char* const block) │ │ │ │ - { delete [] block; } │ │ │ │ -}; │ │ │ │ - │ │ │ │ -using pool = boost::pool<allocator_new_delete>; │ │ │ │ - │ │ │ │ -template <typename T> │ │ │ │ -using object_pool = boost::object_pool<T, allocator_new_delete>; │ │ │ │ - │ │ │ │ -} │ │ │ │ -} │ │ │ │ - │ │ │ │ -#endif │ │ │ │ -
    relevance 0../include/libtorrent/aux_/merkle_tree.hpp:85remove this constructor. Don't support "uninitialized" trees. This also requires not constructing these for pad-files and small files as well. So, a sparse hash list in torrent_info

    remove this constructor. Don't support "uninitialized" trees. This │ │ │ │ +relevance 0../include/libtorrent/aux_/merkle_tree.hpp:85remove this constructor. Don't support "uninitialized" trees. This also requires not constructing these for pad-files and small files as well. So, a sparse hash list in torrent_info

    remove this constructor. Don't support "uninitialized" trees. This │ │ │ │ also requires not constructing these for pad-files and small files as │ │ │ │ well. So, a sparse hash list in torrent_info

    ../include/libtorrent/aux_/merkle_tree.hpp:85

    // The invariant of the tree is that all interior nodes (i.e. all but the very
    │ │ │ │  // bottom leaf nodes, representing block hashes) are either set and valid, or
    │ │ │ │  // clear. No invalid hashes are allowed, and they can only be added by also
    │ │ │ │  // providing proof of being valid.
    │ │ │ │  
    │ │ │ │  // The leaf blocks on the other hand, MAY be invalid. For instance, when adding
    │ │ │ │ @@ -11812,15 +11608,15 @@
    │ │ │ │  
    │ │ │ │  	// returns true if the entire tree is known and verified
    │ │ │ │  	bool is_complete() const;
    │ │ │ │  
    │ │ │ │  	// returns true if all block hashes in the specified range have been verified
    │ │ │ │  	bool blocks_verified(int block_idx, int num_blocks) const;
    │ │ │ │  
    │ │ │ │ -
    relevance 0../include/libtorrent/aux_/merkle_tree.hpp:175make this a std::unique_ptr

    make this a std::unique_ptr

    ../include/libtorrent/aux_/merkle_tree.hpp:175

    │ │ │ │ +
    relevance 0../include/libtorrent/aux_/merkle_tree.hpp:175make this a std::unique_ptr

    make this a std::unique_ptr

    ../include/libtorrent/aux_/merkle_tree.hpp:175

    │ │ │ │  	int blocks_per_piece() const { return 1 << m_blocks_per_piece_log; }
    │ │ │ │  	// the number tree levels per piece. This is 0 if the block layer is also
    │ │ │ │  	// the piece layer.
    │ │ │ │  	int piece_levels() const { return m_blocks_per_piece_log; }
    │ │ │ │  
    │ │ │ │  	int block_layer_start() const;
    │ │ │ │  	int piece_layer_start() const;
    │ │ │ │ @@ -11863,15 +11659,168 @@
    │ │ │ │  		// we don't have any hashes in this tree. m_tree should be empty
    │ │ │ │  		// an empty tree still always have the root hash (available as root())
    │ │ │ │  		empty_tree,
    │ │ │ │  
    │ │ │ │  		// in this mode, m_tree represents the full tree, including padding.
    │ │ │ │  		full_tree,
    │ │ │ │  
    │ │ │ │ -
    relevance 0../include/libtorrent/aux_/deprecated.hpp:47figure out which version of clang this is supported in

    figure out which version of clang this is supported in

    ../include/libtorrent/aux_/deprecated.hpp:47

    CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    │ │ │ │ +
    relevance 0../include/libtorrent/aux_/session_impl.hpp:265make these direct members and generate shared_ptrs to them which alias the listen_socket_t shared_ptr

    make these direct members and generate shared_ptrs to them │ │ │ │ +which alias the listen_socket_t shared_ptr

    ../include/libtorrent/aux_/session_impl.hpp:265

    			if (udp_sock) return udp_sock->sock.local_port();
    │ │ │ │ +			return 0;
    │ │ │ │ +		}
    │ │ │ │ +
    │ │ │ │ +		// 0 is natpmp 1 is upnp
    │ │ │ │ +		// the order of these arrays determines the priority in
    │ │ │ │ +		// which their ports will be announced to peers
    │ │ │ │ +		aux::array<listen_port_mapping, 2, portmap_transport> tcp_port_mapping;
    │ │ │ │ +		aux::array<listen_port_mapping, 2, portmap_transport> udp_port_mapping;
    │ │ │ │ +
    │ │ │ │ +		// indicates whether this is an SSL listen socket or not
    │ │ │ │ +		transport ssl = transport::plaintext;
    │ │ │ │ +
    │ │ │ │ +		listen_socket_flags_t flags = accept_incoming;
    │ │ │ │ +
    │ │ │ │ +		// the actual sockets (TCP listen socket and UDP socket)
    │ │ │ │ +		// An entry does not necessarily have a UDP or TCP socket. One of these
    │ │ │ │ +		// pointers may be nullptr!
    │ │ │ │ +		// These must be shared_ptr to avoid a dangling reference if an
    │ │ │ │ +		// incoming packet is in the event queue when the socket is erased
    │ │ │ │ +
    std::shared_ptr<tcp::acceptor> sock; │ │ │ │ +
    std::shared_ptr<aux::session_udp_socket> udp_sock; │ │ │ │ + │ │ │ │ + // since udp packets are expected to be dispatched frequently, this saves │ │ │ │ + // time on handler allocation every time we read again. │ │ │ │ + aux::handler_storage<aux::udp_handler_max_size, aux::udp_handler> udp_handler_storage; │ │ │ │ + │ │ │ │ + std::shared_ptr<natpmp> natpmp_mapper; │ │ │ │ + std::shared_ptr<upnp> upnp_mapper; │ │ │ │ + │ │ │ │ + std::shared_ptr<struct lsd> lsd; │ │ │ │ + │ │ │ │ + // set to true when we receive an incoming connection from this listen │ │ │ │ + // socket │ │ │ │ + bool incoming_connection = false; │ │ │ │ + }; │ │ │ │ + │ │ │ │ + struct TORRENT_EXTRA_EXPORT listen_endpoint_t │ │ │ │ + { │ │ │ │ + listen_endpoint_t(address const& adr, int p, std::string dev, transport s │ │ │ │ + , listen_socket_flags_t f, address const& nmask = address{}) │ │ │ │ + : addr(adr), netmask(nmask), port(p), device(std::move(dev)), ssl(s), flags(f) {} │ │ │ │ + │ │ │ │ + bool operator==(listen_endpoint_t const& o) const │ │ │ │ + { │ │ │ │ + return addr == o.addr │ │ │ │ + && port == o.port │ │ │ │ + && device == o.device │ │ │ │ + && ssl == o.ssl │ │ │ │ + && flags == o.flags; │ │ │ │ + } │ │ │ │ +
    relevance 0../include/libtorrent/aux_/session_impl.hpp:1068replace this by a proper asio timer

    replace this by a proper asio timer

    ../include/libtorrent/aux_/session_impl.hpp:1068

    #ifdef TORRENT_SSL_PEERS
    │ │ │ │ +			void on_incoming_utp_ssl(socket_type s);
    │ │ │ │ +			void ssl_handshake(error_code const& ec, socket_type* s);
    │ │ │ │ +#endif
    │ │ │ │ +
    │ │ │ │ +			// round-robin index into m_outgoing_interfaces
    │ │ │ │ +			mutable std::uint8_t m_interface_index = 0;
    │ │ │ │ +
    │ │ │ │ +			std::shared_ptr<listen_socket_t> setup_listener(
    │ │ │ │ +				listen_endpoint_t const& lep, error_code& ec);
    │ │ │ │ +
    │ │ │ │ +#ifndef TORRENT_DISABLE_DHT
    │ │ │ │ +			dht::dht_state m_dht_state;
    │ │ │ │ +#endif
    │ │ │ │ +
    │ │ │ │ +			// this is initialized to the unchoke_interval
    │ │ │ │ +			// session_setting and decreased every second.
    │ │ │ │ +			// when it reaches zero, it is reset to the
    │ │ │ │ +			// unchoke_interval and the unchoke set is
    │ │ │ │ +			// recomputed.
    │ │ │ │ +
    int m_unchoke_time_scaler = 0; │ │ │ │ +
    │ │ │ │ + // this is used to decide when to recalculate which │ │ │ │ + // torrents to keep queued and which to activate │ │ │ │ +
    relevance 0../include/libtorrent/aux_/session_impl.hpp:1073replace this by a proper asio timer

    replace this by a proper asio timer

    ../include/libtorrent/aux_/session_impl.hpp:1073

    │ │ │ │ +			// round-robin index into m_outgoing_interfaces
    │ │ │ │ +			mutable std::uint8_t m_interface_index = 0;
    │ │ │ │ +
    │ │ │ │ +			std::shared_ptr<listen_socket_t> setup_listener(
    │ │ │ │ +				listen_endpoint_t const& lep, error_code& ec);
    │ │ │ │ +
    │ │ │ │ +#ifndef TORRENT_DISABLE_DHT
    │ │ │ │ +			dht::dht_state m_dht_state;
    │ │ │ │ +#endif
    │ │ │ │ +
    │ │ │ │ +			// this is initialized to the unchoke_interval
    │ │ │ │ +			// session_setting and decreased every second.
    │ │ │ │ +			// when it reaches zero, it is reset to the
    │ │ │ │ +			// unchoke_interval and the unchoke set is
    │ │ │ │ +			// recomputed.
    │ │ │ │ +			int m_unchoke_time_scaler = 0;
    │ │ │ │ +
    │ │ │ │ +			// this is used to decide when to recalculate which
    │ │ │ │ +			// torrents to keep queued and which to activate
    │ │ │ │ +
    int m_auto_manage_time_scaler = 0; │ │ │ │ +
    │ │ │ │ + // works like unchoke_time_scaler but it │ │ │ │ + // is only decreased when the unchoke set │ │ │ │ + // is recomputed, and when it reaches zero, │ │ │ │ + // the optimistic unchoke is moved to another peer. │ │ │ │ +
    relevance 0../include/libtorrent/aux_/session_impl.hpp:1080replace this by a proper asio timer

    replace this by a proper asio timer

    ../include/libtorrent/aux_/session_impl.hpp:1080

    │ │ │ │ +#ifndef TORRENT_DISABLE_DHT
    │ │ │ │ +			dht::dht_state m_dht_state;
    │ │ │ │ +#endif
    │ │ │ │ +
    │ │ │ │ +			// this is initialized to the unchoke_interval
    │ │ │ │ +			// session_setting and decreased every second.
    │ │ │ │ +			// when it reaches zero, it is reset to the
    │ │ │ │ +			// unchoke_interval and the unchoke set is
    │ │ │ │ +			// recomputed.
    │ │ │ │ +			int m_unchoke_time_scaler = 0;
    │ │ │ │ +
    │ │ │ │ +			// this is used to decide when to recalculate which
    │ │ │ │ +			// torrents to keep queued and which to activate
    │ │ │ │ +			int m_auto_manage_time_scaler = 0;
    │ │ │ │ +
    │ │ │ │ +			// works like unchoke_time_scaler but it
    │ │ │ │ +			// is only decreased when the unchoke set
    │ │ │ │ +			// is recomputed, and when it reaches zero,
    │ │ │ │ +			// the optimistic unchoke is moved to another peer.
    │ │ │ │ +
    int m_optimistic_unchoke_time_scaler = 0; │ │ │ │ +
    │ │ │ │ + // works like unchoke_time_scaler. Each time │ │ │ │ + // it reaches 0, and all the connections are │ │ │ │ + // used, the worst connection will be disconnected │ │ │ │ + // from the torrent with the most peers │ │ │ │ + int m_disconnect_time_scaler = 90; │ │ │ │ + │ │ │ │ + // when this scaler reaches zero, it will │ │ │ │ + // scrape one of the auto managed, paused, │ │ │ │ + // torrents. │ │ │ │ + int m_auto_scrape_time_scaler = 180; │ │ │ │ + │ │ │ │ + // statistics gathered from all torrents. │ │ │ │ + stat m_stat; │ │ │ │ + │ │ │ │ + // implements session_interface │ │ │ │ + void sent_bytes(int bytes_payload, int bytes_protocol) override; │ │ │ │ + void received_bytes(int bytes_payload, int bytes_protocol) override; │ │ │ │ + void trancieve_ip_packet(int bytes, bool ipv6) override; │ │ │ │ + void sent_syn(bool ipv6) override; │ │ │ │ + void received_synack(bool ipv6) override; │ │ │ │ + │ │ │ │ +#if TORRENT_ABI_VERSION == 1 │ │ │ │ + int m_peak_up_rate = 0; │ │ │ │ +#endif │ │ │ │ + │ │ │ │ + void on_tick(error_code const& e); │ │ │ │ + │ │ │ │ + void try_connect_more_peers(); │ │ │ │ + void auto_manage_checking_torrents(std::vector<torrent*>& list │ │ │ │ +
    relevance 0../include/libtorrent/aux_/deprecated.hpp:47figure out which version of clang this is supported in

    figure out which version of clang this is supported in

    ../include/libtorrent/aux_/deprecated.hpp:47

    CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    │ │ │ │  ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    │ │ │ │  POSSIBILITY OF SUCH DAMAGE.
    │ │ │ │  
    │ │ │ │  */
    │ │ │ │  
    │ │ │ │  #ifndef TORRENT_DEPRECATED_HPP_INCLUDED
    │ │ │ │  #define TORRENT_DEPRECATED_HPP_INCLUDED
    │ │ │ │ @@ -11904,15 +11853,15 @@
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │  #ifndef TORRENT_DEPRECATED_ENUM
    │ │ │ │  #define TORRENT_DEPRECATED_ENUM
    │ │ │ │  #endif
    │ │ │ │  
    │ │ │ │  #endif
    │ │ │ │ -
    relevance 0../include/libtorrent/aux_/allocating_handler.hpp:316in C++17, Handler and Storage could just use "auto"

    in C++17, Handler and Storage could just use "auto"

    ../include/libtorrent/aux_/allocating_handler.hpp:316

    │ │ │ │ +
    relevance 0../include/libtorrent/aux_/allocating_handler.hpp:316in C++17, Handler and Storage could just use "auto"

    in C++17, Handler and Storage could just use "auto"

    ../include/libtorrent/aux_/allocating_handler.hpp:316

    │ │ │ │  	private:
    │ │ │ │  
    │ │ │ │  		Handler handler;
    │ │ │ │  		handler_storage<Size, Name>* storage;
    │ │ │ │  #ifndef BOOST_NO_EXCEPTIONS
    │ │ │ │  		error_handler_interface* error_handler;
    │ │ │ │  #endif
    │ │ │ │ @@ -11955,15 +11904,15 @@
    │ │ │ │  			{
    │ │ │ │  				(ptr_.get()->*ErrorHandler)(e.code());
    │ │ │ │  			}
    │ │ │ │  			catch (std::exception const& e)
    │ │ │ │  			{
    │ │ │ │  				(ptr_.get()->*ExceptHandler)(e);
    │ │ │ │  			}
    │ │ │ │ -
    relevance 0../include/libtorrent/aux_/utp_stream.hpp:693it would be nice to make this private

    it would be nice to make this private

    ../include/libtorrent/aux_/utp_stream.hpp:693

    	bool consume_incoming_data(
    │ │ │ │ +
    relevance 0../include/libtorrent/aux_/utp_stream.hpp:693it would be nice to make this private

    it would be nice to make this private

    ../include/libtorrent/aux_/utp_stream.hpp:693

    	bool consume_incoming_data(
    │ │ │ │  		utp_header const* ph, std::uint8_t const* ptr, int payload_size, time_point now);
    │ │ │ │  	void update_mtu_limits();
    │ │ │ │  	void experienced_loss(std::uint32_t seq_nr, time_point now);
    │ │ │ │  
    │ │ │ │  	void send_deferred_ack();
    │ │ │ │  	void socket_drained();
    │ │ │ │  
    │ │ │ │ @@ -12006,8 +11955,59 @@
    │ │ │ │  	// it's important that these match the enums in performance_counters for
    │ │ │ │  	// num_utp_idle etc.
    │ │ │ │  	enum class state_t {
    │ │ │ │  		// not yet connected
    │ │ │ │  		none,
    │ │ │ │  		// sent a syn packet, not received any acks
    │ │ │ │  		syn_sent,
    │ │ │ │ +
    relevance 0../include/libtorrent/aux_/session_interface.hpp:212it would be nice to not have this be part of session_interface

    it would be nice to not have this be part of session_interface

    ../include/libtorrent/aux_/session_interface.hpp:212

    		virtual void deferred_submit_jobs() = 0;
    │ │ │ │ +
    │ │ │ │ +		virtual std::uint16_t listen_port() const = 0;
    │ │ │ │ +		virtual std::uint16_t ssl_listen_port() const = 0;
    │ │ │ │ +
    │ │ │ │ +		virtual int listen_port(aux::transport ssl, address const& local_addr) = 0;
    │ │ │ │ +
    │ │ │ │ +		virtual void for_each_listen_socket(std::function<void(aux::listen_socket_handle const&)> f) = 0;
    │ │ │ │ +
    │ │ │ │ +		// ask for which interface and port to bind outgoing peer connections on
    │ │ │ │ +		virtual tcp::endpoint bind_outgoing_socket(socket_type& s, address const&
    │ │ │ │ +			remote_address, error_code& ec) const = 0;
    │ │ │ │ +		virtual bool verify_bound_address(address const& addr, bool utp
    │ │ │ │ +			, error_code& ec) = 0;
    │ │ │ │ +
    │ │ │ │ +#ifndef TORRENT_DISABLE_MUTABLE_TORRENTS
    │ │ │ │ +		virtual std::vector<std::shared_ptr<torrent>> find_collection(
    │ │ │ │ +			std::string const& collection) const = 0;
    │ │ │ │ +#endif
    │ │ │ │ +
    │ │ │ │ +
    virtual proxy_settings proxy() const = 0; │ │ │ │ +
    │ │ │ │ +#if TORRENT_USE_I2P │ │ │ │ + virtual char const* i2p_session() const = 0; │ │ │ │ + virtual std::string const& local_i2p_endpoint() const = 0; │ │ │ │ +#endif │ │ │ │ + │ │ │ │ + virtual void prioritize_connections(std::weak_ptr<torrent> t) = 0; │ │ │ │ + │ │ │ │ + virtual void trigger_auto_manage() = 0; │ │ │ │ + │ │ │ │ + virtual void apply_settings_pack(std::shared_ptr<settings_pack> pack) = 0; │ │ │ │ + virtual session_settings const& settings() const = 0; │ │ │ │ + │ │ │ │ + virtual void queue_tracker_request(tracker_request req │ │ │ │ + , std::weak_ptr<request_callback> c) = 0; │ │ │ │ + │ │ │ │ + // peer-classes │ │ │ │ + virtual void set_peer_classes(peer_class_set* s, address const& a, socket_type_t st) = 0; │ │ │ │ + virtual peer_class_pool const& peer_classes() const = 0; │ │ │ │ + virtual peer_class_pool& peer_classes() = 0; │ │ │ │ + virtual bool ignore_unchoke_slots_set(peer_class_set const& set) const = 0; │ │ │ │ + virtual int copy_pertinent_channels(peer_class_set const& set │ │ │ │ + , int channel, bandwidth_channel** dst, int m) = 0; │ │ │ │ + virtual int use_quota_overhead(peer_class_set& set, int amount_down, int amount_up) = 0; │ │ │ │ + │ │ │ │ + virtual bandwidth_manager* get_bandwidth_manager(int channel) = 0; │ │ │ │ + │ │ │ │ + virtual void sent_bytes(int bytes_payload, int bytes_protocol) = 0; │ │ │ │ + virtual void received_bytes(int bytes_payload, int bytes_protocol) = 0; │ │ │ │ + virtual void trancieve_ip_packet(int bytes, bool ipv6) = 0; │ │ │ │
    │ │ │ │ ├── html2text {} │ │ │ │ │ @@ -454,321 +454,318 @@ │ │ │ │ │ | | │ │ │ │ │ | auto o = rpc.allocate_observer(std::move(algo), source, node_id()); | │ │ │ │ │ |#if TORRENT_USE_ASSERTS | │ │ │ │ │ | o->m_in_constructor = false; | │ │ │ │ │ |#endif | │ │ │ │ │ | o->flags |= observer::flag_queried; | │ │ │ │ │ |_ _r_p_c_._i_n_v_o_k_e_(_r_e_q_,_ _s_o_u_r_c_e_,_ _o_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_s_e_s_s_i_o_n___h_a_n_d_l_e_._c_p_p_:_6_9_1_ _|_e_x_p_o_s_e_ _t_h_e_ _s_e_q_u_e_n_c_e___n_u_m_b_e_r_,_ _p_u_b_l_i_c___k_e_y_,_ _s_e_c_r_e_t___k_e_y_ _a_n_d_ _s_i_g_n_a_t_u_r_e_ _t_y_p_e_s_ _t_o_ _t_h_e_ _c_l_i_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** eexxppoossee tthhee sseeqquueennccee__nnuummbbeerr,, ppuubblliicc__kkeeyy,, sseeccrreett__kkeeyy aanndd ssiiggnnaattuurree ttyyppeess ttoo tthhee cclliieenntt ********** | │ │ │ │ │ -|****** ....//ssrrcc//sseessssiioonn__hhaannddllee..ccpppp::669911 ****** | │ │ │ │ │ -|void session_handle::dht_get_item(sha1_hash const& target) | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_DHT | │ │ │ │ │ -| async_call(&session_impl::dht_get_immutable_item, target); | │ │ │ │ │ -|#else | │ │ │ │ │ -| TORRENT_UNUSED(target); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_4_1_9_ _ _ _ _ _ _ _ _|_w_e_ _c_o_u_l_d_ _p_r_o_b_a_b_l_y_ _g_e_t_ _a_w_a_y_ _w_i_t_h_ _j_u_s_t_ _s_a_v_i_n_g_ _a_ _f_e_w_ _f_i_e_l_d_s_ _h_e_r_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** wwee ccoouulldd pprroobbaabbllyy ggeett aawwaayy wwiitthh jjuusstt ssaavviinngg aa ffeeww ffiieellddss hheerree ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::441199 ****** | │ │ │ │ │ +|// --- V2 HASHES --- | │ │ │ │ │ | | │ │ │ │ │ -| void session_handle::dht_get_item(std::array key | │ │ │ │ │ -| , std::string salt) | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_DHT | │ │ │ │ │ -| async_call(&session_impl::dht_get_mutable_item, key, salt); | │ │ │ │ │ -|#else | │ │ │ │ │ -| TORRENT_UNUSED(key); | │ │ │ │ │ -| TORRENT_UNUSED(salt); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ +| if (m_torrent_file->is_valid() && m_torrent_file->info_hashes().has_v2()) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (!p.merkle_trees.empty()) | │ │ │ │ │ +| load_merkle_trees( | │ │ │ │ │ +| std::move(p.merkle_trees) | │ │ │ │ │ +| , std::move(p.merkle_tree_mask) | │ │ │ │ │ +| , std::move(p.verified_leaf_hashes)); | │ │ │ │ │ | | │ │ │ │ │ -|sha1_hash session_handle::dht_put_item(entry data) | │ │ │ │ │ -|{ | │ │ │ │ │ -| std::vector buf; | │ │ │ │ │ -| bencode(std::back_inserter(buf), data); | │ │ │ │ │ -| sha1_hash const ret = hasher(buf).final(); | │ │ │ │ │ +| // we really don't want to store extra copies of the trees | │ │ │ │ │ +| TORRENT_ASSERT(p.merkle_trees.empty()); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_DHT | │ │ │ │ │ -| async_call(&session_impl::dht_put_immutable_item, data, ret); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| return ret; | │ │ │ │ │ -| } | │ │ │ │ │ +| if (valid_metadata()) | │ │ │ │ │ +| { | │ │ │ │ │ +| inc_stats_counter(counters::num_total_pieces_added | │ │ │ │ │ +| , m_torrent_file->num_pieces()); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| void session_handle::dht_put_item(std::array key | │ │ │ │ │ -| , std::function& | │ │ │ │ │ -| , std::int64_t&, std::string const&)> cb | │ │ │ │ │ -| , std::string salt) | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_DHT | │ │ │ │ │ -| async_call(&session_impl::dht_put_mutable_item, key, cb, salt); | │ │ │ │ │ -|#else | │ │ │ │ │ -| TORRENT_UNUSED(key); | │ │ │ │ │ -| TORRENT_UNUSED(cb); | │ │ │ │ │ -| TORRENT_UNUSED(salt); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ +|m_add_torrent_params = std::make_unique(std::move(p)); | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -| void session_handle::dht_get_peers(sha1_hash const& info_hash) | │ │ │ │ │ +| void torrent::load_merkle_trees( | │ │ │ │ │ +| aux::vector, file_index_t> trees_import | │ │ │ │ │ +| , aux::vector, file_index_t> mask | │ │ │ │ │ +| , aux::vector, file_index_t> verified) | │ │ │ │ │ | { | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_DHT | │ │ │ │ │ -| async_call(&session_impl::dht_get_peers, info_hash); | │ │ │ │ │ -|_#_e_l_s_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 3|_._._/_s_r_c_/ |this should be an optional, piece index -1 should not be allowed | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_w_e_b___p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_1_9_9_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss sshhoouulldd bbee aann ooppttiioonnaall,, ppiieeccee iinnddeexx --11 sshhoouulldd nnoott bbee aalllloowweedd ********** | │ │ │ │ │ -|****** ....//ssrrcc//wweebb__ppeeeerr__ccoonnnneeccttiioonn..ccpppp::119999 ****** | │ │ │ │ │ -| auto const range = aux::file_piece_range_inclusive(fs, i); | │ │ │ │ │ -| for (piece_index_t k = std::get<0>(range); k < std::get<1>(range); ++k) | │ │ │ │ │ -| have.clear_bit(k); | │ │ │ │ │ -| } | │ │ │ │ │ -| t->set_seed(peer_info_struct(), false); | │ │ │ │ │ -| if (have.none_set()) | │ │ │ │ │ -| { | │ │ │ │ │ -| incoming_have_none(); | │ │ │ │ │ -| m_web->interesting = false; | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| peer_log(peer_log_alert::info, "WEB-SEED", "have no pieces, not interesting. %s", m_url.c_str()); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| else | │ │ │ │ │ +| auto const& fs = m_torrent_file->orig_files(); | │ │ │ │ │ +| | │ │ │ │ │ +| std::vector const empty_verified; | │ │ │ │ │ +| for (file_index_t i{0}; i < fs.end_file(); ++i) | │ │ │ │ │ | { | │ │ │ │ │ -| incoming_bitfield(have); | │ │ │ │ │ +| if (fs.pad_file_at(i) || fs.file_size(i) == 0) | │ │ │ │ │ +| continue; | │ │ │ │ │ +| | │ │ │ │ │ +| if (i >= trees_import.end_index()) break; | │ │ │ │ │ +| std::vector const& verified_bitmask = (i >= verified.end_index()) ? empty_verified : verified[i]; | │ │ │ │ │ +| if (i < mask.end_index() && !mask[i].empty()) | │ │ │ │ │ +| { | │ │ │ │ │ +| mask[i].resize(m_merkle_trees[i].size(), false); | │ │ │ │ │ +| m_merkle_trees[i].load_sparse_tree(trees_import[i], mask[i], verified_bitmask); | │ │ │ │ │ +| } | │ │ │ │ │ +| else | │ │ │ │ │ +| { | │ │ │ │ │ +| m_merkle_trees[i].load_tree(trees_import[i], verified_bitmask); | │ │ │ │ │ +| } | │ │ │ │ │ | } | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -|if (m_web->restart_request.piece != piece_index_t(-1)) | │ │ │ │ │ -|{ | │ │ │ │ │ -| // increase the chances of requesting the block | │ │ │ │ │ -| // we have partial data for already, to finish it | │ │ │ │ │ -| incoming_suggest(m_web->restart_request.piece); | │ │ │ │ │ +|_ _v_o_i_d_ _t_o_r_r_e_n_t_:_:_i_n_c___s_t_a_t_s___c_o_u_n_t_e_r_(_i_n_t_ _c_,_ _i_n_t_ _v_a_l_u_e_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_7_1_5_ _ _ _ _ _ _ _ _|_a_s_s_e_r_t_ _t_h_e_r_e_ _a_r_e_ _n_o_ _o_u_t_s_t_a_n_d_i_n_g_ _a_s_y_n_c_ _o_p_e_r_a_t_i_o_n_s_ _o_n_ _t_h_i_s_ _t_o_r_r_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** aasssseerrtt tthheerree aarree nnoo oouuttssttaannddiinngg aassyynncc ooppeerraattiioonnss oonn tthhiiss ttoorrrreenntt ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::771155 ****** | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| if (!m_ses.dht()) return false; | │ │ │ │ │ +| if (m_torrent_file->is_valid() && !m_files_checked) return false; | │ │ │ │ │ +| if (!m_announce_to_dht) return false; | │ │ │ │ │ +| if (m_paused) return false; | │ │ │ │ │ +| | │ │ │ │ │ +| // don't announce private torrents | │ │ │ │ │ +| if (m_torrent_file->is_valid() && m_torrent_file->priv()) return false; | │ │ │ │ │ +| if (m_trackers.empty()) return true; | │ │ │ │ │ +| if (!settings().get_bool(settings_pack::use_dht_as_fallback)) return true; | │ │ │ │ │ +| | │ │ │ │ │ +| return std::none_of(m_trackers.begin(), m_trackers.end() | │ │ │ │ │ +| , [](aux::announce_entry const& tr) { return bool(tr.verified); }); | │ │ │ │ │ | } | │ │ │ │ │ -| web_connection_base::on_connected(); | │ │ │ │ │ -|} | │ │ │ │ │ | | │ │ │ │ │ -|void web_peer_connection::disconnect(error_code const& ec | │ │ │ │ │ -| , operation_t op, disconnect_severity_t const error) | │ │ │ │ │ -|{ | │ │ │ │ │ -| if (is_disconnecting()) return; | │ │ │ │ │ +|#endif | │ │ │ │ │ | | │ │ │ │ │ -| if (op == operation_t::sock_write && ec == boost::system::errc::broken_pipe) | │ │ │ │ │ +| torrent::~torrent() | │ │ │ │ │ | { | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| // a write operation failed with broken-pipe. This typically happens | │ │ │ │ │ -| // with HTTP 1.0 servers that close their incoming channel of the TCP | │ │ │ │ │ -| // stream whenever they're done reading one full request. Instead of | │ │ │ │ │ -| // us bailing out and failing the entire request just because our | │ │ │ │ │ -| // write-end was closed, ignore it and keep reading until the read-end | │ │ │ │ │ -| // also is closed. | │ │ │ │ │ -| peer_log(peer_log_alert::info, "WRITE_DIRECTION", "CLOSED"); | │ │ │ │ │ +| | │ │ │ │ │ +|#if TORRENT_USE_ASSERTS | │ │ │ │ │ +| for (torrent_list_index_t i{}; i != m_links.end_index(); ++i) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (!m_links[i].in_list()) continue; | │ │ │ │ │ +| m_links[i].unlink(m_ses.torrent_list(i), i); | │ │ │ │ │ +| } | │ │ │ │ │ |#endif | │ │ │ │ │ | | │ │ │ │ │ -| // prevent the peer from trying to send anything more | │ │ │ │ │ -| m_send_buffer.clear(); | │ │ │ │ │ +| // The invariant can't be maintained here, since the torrent | │ │ │ │ │ +| // is being destructed, all weak references to it have been | │ │ │ │ │ +| // reset, which means that all its peers already have an | │ │ │ │ │ +| // invalidated torrent pointer (so it cannot be verified to be correct) | │ │ │ │ │ | | │ │ │ │ │ -| // when the web server closed our write-end of the socket (i.e. its | │ │ │ │ │ -|_ _ _/_/_ _r_e_a_d_-_e_n_d_)_,_ _i_f_ _i_t_'_s_ _a_n_ _H_T_T_P_ _1_._0_ _s_e_r_v_e_r_._ _w_e_ _w_i_l_l_ _s_t_o_p_ _s_e_n_d_i_n_g_ _m_o_r_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 3|_._._/_s_r_c_/ |do we really need a special case here? wouldn't the multi-file case handle single file torrents correctly too? | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_w_e_b___p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_4_1_9_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ddoo wwee rreeaallllyy nneeeedd aa ssppeecciiaall ccaassee hheerree?? wwoouullddnn''tt tthhee mmuullttii--ffiillee ccaassee hhaannddllee ssiinnggllee ffiillee ttoorrrreennttss ccoorrrreeccttllyy ttoooo?? ********** | │ │ │ │ │ -|****** ....//ssrrcc//wweebb__ppeeeerr__ccoonnnneeccttiioonn..ccpppp::441199 ****** | │ │ │ │ │ -|size -= pr.length; | │ │ │ │ │ -| } | │ │ │ │ │ +| // i.e. the invariant can only be maintained if all connections have | │ │ │ │ │ +| // been closed by the time the torrent is destructed. And they are | │ │ │ │ │ +| // supposed to be closed. So we can still do the invariant check. | │ │ │ │ │ | | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| peer_log(peer_log_alert::outgoing_message, "REQUESTING", "(piece: %d start: %d) - (piece: %d end: %d)" | │ │ │ │ │ -| , static_cast(r.piece), r.start | │ │ │ │ │ -| , static_cast(pr.piece), pr.start + pr.length); | │ │ │ │ │ -|#endif | │ │ │ │ │ +| // however, the torrent object may be destructed from the main | │ │ │ │ │ +| // thread when shutting down, if the disk cache has references to it. | │ │ │ │ │ +| // this means that the invariant check that this is called from the | │ │ │ │ │ +| // network thread cannot be maintained | │ │ │ │ │ | | │ │ │ │ │ -| bool const single_file_request = t->torrent_file().num_files() == 1; | │ │ │ │ │ -| int const proxy_type = m_settings.get_int(settings_pack::proxy_type); | │ │ │ │ │ -| bool const using_proxy = (proxy_type == settings_pack::http | │ │ │ │ │ -| || proxy_type == settings_pack::http_pw) && !m_ssl; | │ │ │ │ │ +| TORRENT_ASSERT(m_peer_class == peer_class_t{0}); | │ │ │ │ │ +| TORRENT_ASSERT(m_connections.empty()); | │ │ │ │ │ +| // just in case, make sure the session accounting is kept right | │ │ │ │ │ +| for (auto p : m_connections) | │ │ │ │ │ +| m_ses.close_connection(p); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| // the number of pad files that have been "requested". In case we _only_ | │ │ │ │ │ -| // request padfiles, we can't rely on handling them in the on_receive() | │ │ │ │ │ -| // callback (because we won't receive anything), instead we have to post a | │ │ │ │ │ -| // pretend read callback where we can deliver the zeroes for the partfile | │ │ │ │ │ -| int num_pad_files = 0; | │ │ │ │ │ +|_ _v_o_i_d_ _t_o_r_r_e_n_t_:_:_r_e_a_d___p_i_e_c_e_(_p_i_e_c_e___i_n_d_e_x___t_ _c_o_n_s_t_ _p_i_e_c_e_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_1_3_3_1_ _ _ _ _ _ _ _|_t_h_e_r_e_'_s_ _s_o_m_e_ _d_u_p_l_i_c_a_t_i_o_n_ _b_e_t_w_e_e_n_ _t_h_i_s_ _f_u_n_c_t_i_o_n_ _a_n_d_ _p_e_e_r___c_o_n_n_e_c_t_i_o_n_:_:_i_n_c_o_m_i_n_g___p_i_e_c_e_(_)_._ _i_s_ _t_h_e_r_e_ _a_ _w_a_y_ _t_o_ _m_e_r_g_e_ _s_o_m_e_t_h_i_n_g_?_ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthheerree''ss ssoommee dduupplliiccaattiioonn bbeettwweeeenn tthhiiss ffuunnccttiioonn aanndd ppeeeerr__ccoonnnneeccttiioonn::::iinnccoommiinngg__ppiieeccee(()).. iiss tthheerree aa wwaayy ttoo mmeerrggee ssoommeetthhiinngg?? ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::11333311 ****** | │ │ │ │ │ +|piece_index_t m_piece; | │ │ │ │ │ +| bool m_armed = true; | │ │ │ │ │ +| }; | │ │ │ │ │ | | │ │ │ │ │ -|if (single_file_request) | │ │ │ │ │ -|{ | │ │ │ │ │ -| file_request_t file_req; | │ │ │ │ │ -| file_req.file_index = file_index_t(0); | │ │ │ │ │ -| file_req.start = std::int64_t(static_cast(req.piece)) * info.piece_length() | │ │ │ │ │ -| + req.start; | │ │ │ │ │ -| file_req.length = req.length; | │ │ │ │ │ +| void torrent::add_piece_async(piece_index_t const piece | │ │ │ │ │ +| , std::vector data, add_piece_flags_t const flags) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ | | │ │ │ │ │ -| request += "GET "; | │ │ │ │ │ -| // do not encode single file paths, they are | │ │ │ │ │ -| // assumed to be encoded in the torrent file | │ │ │ │ │ -| request += using_proxy ? m_url : m_path; | │ │ │ │ │ -| request += " HTTP/1.1\r\n"; | │ │ │ │ │ -| add_headers(request, m_settings, using_proxy); | │ │ │ │ │ -| request += "\r\nRange: bytes="; | │ │ │ │ │ -| request += to_string(file_req.start).data(); | │ │ │ │ │ -| request += "-"; | │ │ │ │ │ -| request += to_string(file_req.start + file_req.length - 1).data(); | │ │ │ │ │ -| request += "\r\n\r\n"; | │ │ │ │ │ -| m_first_request = false; | │ │ │ │ │ +| // make sure the piece index is correct | │ │ │ │ │ +| if (piece >= torrent_file().end_piece()) | │ │ │ │ │ +| return; | │ │ │ │ │ | | │ │ │ │ │ -| m_file_requests.push_back(file_req); | │ │ │ │ │ +| // make sure the piece size is correct | │ │ │ │ │ +| if (data.size() != std::size_t(m_torrent_file->piece_size(piece))) | │ │ │ │ │ +| return; | │ │ │ │ │ +| | │ │ │ │ │ +| add_piece(piece, data.data(), flags); | │ │ │ │ │ | } | │ │ │ │ │ -| else | │ │ │ │ │ +| | │ │ │ │ │ +|void torrent::add_piece(piece_index_t const piece, char const* data | │ │ │ │ │ +|, add_piece_flags_t const flags) | │ │ │ │ │ | { | │ │ │ │ │ -| std::vector files = info.orig_files().map_block(req.piece, req.start | │ │ │ │ │ -| , req.length); | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ | | │ │ │ │ │ -| for (auto const &f : files) | │ │ │ │ │ -| { | │ │ │ │ │ -|_ _ _ _f_i_l_e___r_e_q_u_e_s_t___t_ _f_i_l_e___r_e_q_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 3|_._._/_s_r_c_/ |file_index_t should not allow negative values | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_w_e_b___p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_5_0_4_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ffiillee__iinnddeexx__tt sshhoouulldd nnoott aallllooww nneeggaattiivvee vvaalluueess ********** | │ │ │ │ │ -|****** ....//ssrrcc//wweebb__ppeeeerr__ccoonnnneeccttiioonn..ccpppp::550044 ****** | │ │ │ │ │ -|// with the correct slashes. Don't encode it again | │ │ │ │ │ -| request += m_path; | │ │ │ │ │ -| } | │ │ │ │ │ +| // make sure the piece index is correct | │ │ │ │ │ +| if (piece >= torrent_file().end_piece()) | │ │ │ │ │ +| return; | │ │ │ │ │ | | │ │ │ │ │ -| request += escape_file_path(info.orig_files(), f.file_index); | │ │ │ │ │ -| } | │ │ │ │ │ -| request += " HTTP/1.1\r\n"; | │ │ │ │ │ -| add_headers(request, m_settings, using_proxy); | │ │ │ │ │ -| request += "\r\nRange: bytes="; | │ │ │ │ │ -| request += to_string(f.offset).data(); | │ │ │ │ │ -| request += "-"; | │ │ │ │ │ -| request += to_string(f.offset + f.size - 1).data(); | │ │ │ │ │ -| request += "\r\n\r\n"; | │ │ │ │ │ -| m_first_request = false; | │ │ │ │ │ +| int const piece_size = m_torrent_file->piece_size(piece); | │ │ │ │ │ +| int const blocks_in_piece = (piece_size + block_size() - 1) / block_size(); | │ │ │ │ │ | | │ │ │ │ │ -|#if 0 | │ │ │ │ │ -| std::cerr << this << " SEND-REQUEST: f: " << f.file_index | │ │ │ │ │ -| << " s: " << f.offset | │ │ │ │ │ -| << " e: " << (f.offset + f.size - 1) << std::endl; | │ │ │ │ │ -|#endif | │ │ │ │ │ -|TORRENT_ASSERT(f.file_index >= file_index_t(0)); | │ │ │ │ │ +| if (m_deleted) return; | │ │ │ │ │ | | │ │ │ │ │ -| m_file_requests.push_back(file_req); | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ +| // avoid crash trying to access the picker when there is none | │ │ │ │ │ +| if (m_have_all && !has_picker()) return; | │ │ │ │ │ | | │ │ │ │ │ -| if (num_pad_files == int(m_file_requests.size())) | │ │ │ │ │ +| // we don't support clobbering the piece picker while checking the | │ │ │ │ │ +| // files. We may end up having the same piece multiple times | │ │ │ │ │ +| TORRENT_ASSERT_PRECOND(state() != torrent_status::checking_files | │ │ │ │ │ +| && state() != torrent_status::checking_resume_data); | │ │ │ │ │ +| if (state() == torrent_status::checking_files | │ │ │ │ │ +| || state() == torrent_status::checking_resume_data) | │ │ │ │ │ +| return; | │ │ │ │ │ +| | │ │ │ │ │ +| need_picker(); | │ │ │ │ │ +| | │ │ │ │ │ +| if (picker().have_piece(piece) | │ │ │ │ │ +| && !(flags & torrent_handle::overwrite_existing)) | │ │ │ │ │ +|_ _ _ _r_e_t_u_r_n_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_3_9_6_6_ _ _ _ _ _ _ _|_t_h_i_s_ _c_o_u_l_d_ _p_r_o_b_a_b_l_y_ _b_e_ _p_u_l_l_e_d_ _o_u_t_ _i_n_t_o_ _a_ _f_r_e_e_ _f_u_n_c_t_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss ccoouulldd pprroobbaabbllyy bbee ppuulllleedd oouutt iinnttoo aa ffrreeee ffuunnccttiioonn ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::33996666 ****** | │ │ │ │ │ +|std::int64_t calc_bytes(file_storage const& fs, piece_count const& pc) | │ │ │ │ │ | { | │ │ │ │ │ -| post(get_context(), std::bind( | │ │ │ │ │ -| &web_peer_connection::on_receive_padfile, | │ │ │ │ │ -| std::static_pointer_cast(self()))); | │ │ │ │ │ -| return; | │ │ │ │ │ -| } | │ │ │ │ │ +| // it's an impossible combination to have 0 pieces, but still have one of them be the last piece | │ │ │ │ │ +| TORRENT_ASSERT(!(pc.num_pieces == 0 && pc.last_piece == true)); | │ │ │ │ │ | | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| peer_log(peer_log_alert::outgoing_message, "REQUEST", "%s", request.c_str()); | │ │ │ │ │ -|#endif | │ │ │ │ │ +| // if we have 0 pieces, we can't have any pad blocks either | │ │ │ │ │ +| TORRENT_ASSERT(!(pc.num_pieces == 0 && pc.pad_bytes > 0)); | │ │ │ │ │ | | │ │ │ │ │ -| send_buffer(request); | │ │ │ │ │ -|} | │ │ │ │ │ +| // if we have all pieces, we must also have the last one | │ │ │ │ │ +| TORRENT_ASSERT(!(pc.num_pieces == fs.num_pieces() && pc.last_piece == false)); | │ │ │ │ │ | | │ │ │ │ │ -|namespace { | │ │ │ │ │ +| // every block should not be a pad block | │ │ │ │ │ +| TORRENT_ASSERT(pc.pad_bytes <= std::int64_t(pc.num_pieces) * fs.piece_length()); | │ │ │ │ │ | | │ │ │ │ │ -| std::string get_peer_name(http_parser const& p, std::string const& host) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::string const& server_version = p.header("server"); | │ │ │ │ │ -| if (!server_version.empty()) | │ │ │ │ │ -| return server_version; | │ │ │ │ │ -| return host; | │ │ │ │ │ -|_ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 3|_._._/_s_r_c_/ |this could be made more efficient for the case when we use an HTTP proxy. Then we wouldn't need to add new web seeds to the torrent,| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_w_e_b___p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_6_9_5_ _ _ _|_w_e_ _c_o_u_l_d_ _j_u_s_t_ _m_a_k_e_ _t_h_e_ _r_e_d_i_r_e_c_t_ _t_a_b_l_e_ _c_o_n_t_a_i_n_ _f_u_l_l_ _U_R_L_s_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss ccoouulldd bbee mmaaddee mmoorree eeffffiicciieenntt ffoorr tthhee ccaassee wwhheenn wwee uussee aann HHTTTTPP pprrooxxyy.. TThheenn wwee wwoouullddnn''tt nneeeedd ttoo aadddd nneeww wweebb sseeeeddss ttoo tthhee ttoorrrreenntt,, wwee ccoouulldd jjuusstt mmaakkee tthhee rreeddiirreecctt | │ │ │ │ │ -|ttaabbllee ccoonnttaaiinn ffuullll UURRLLss.. ********** | │ │ │ │ │ -|****** ....//ssrrcc//wweebb__ppeeeerr__ccoonnnneeccttiioonn..ccpppp::669955 ****** | │ │ │ │ │ -|bool const single_file_request = !m_path.empty() | │ │ │ │ │ -| && m_path[m_path.size() - 1] != '/'; | │ │ │ │ │ +| return std::int64_t(pc.num_pieces) * fs.piece_length() | │ │ │ │ │ +| - (pc.last_piece ? fs.piece_length() - fs.piece_size(fs.last_piece()) : 0) | │ │ │ │ │ +| - std::int64_t(pc.pad_bytes); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| // when SSRF mitigation is enabled, a web seed on the internet (is_global()) | │ │ │ │ │ -| // is not allowed to redirect to a server on the local network, so we set | │ │ │ │ │ -| // the no_local_ips flag | │ │ │ │ │ -| auto const web_seed_flags = torrent::ephemeral | │ │ │ │ │ -| | ((m_settings.get_bool(settings_pack::ssrf_mitigation) && aux::is_global(remote().address())) | │ │ │ │ │ -| ? torrent::no_local_ips : web_seed_flag_t{}); | │ │ │ │ │ +| // fills in total_wanted, total_wanted_done and total_done | │ │ │ │ │ +|void torrent::bytes_done(torrent_status& st, status_flags_t const flags) const | │ │ │ │ │ +|{ | │ │ │ │ │ +| INVARIANT_CHECK; | │ │ │ │ │ | | │ │ │ │ │ -| // add the redirected url and remove the current one | │ │ │ │ │ -| if (!single_file_request) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(!m_file_requests.empty()); | │ │ │ │ │ -| file_index_t const file_index = m_file_requests.front().file_index; | │ │ │ │ │ +| st.total_done = 0; | │ │ │ │ │ +| st.total_wanted_done = 0; | │ │ │ │ │ +| st.total_wanted = m_size_on_disk; | │ │ │ │ │ | | │ │ │ │ │ -| location = resolve_redirect_location(m_url, location); | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| peer_log(peer_log_alert::info, "LOCATION", "%s", location.c_str()); | │ │ │ │ │ -|#endif | │ │ │ │ │ -|std::string redirect_base; | │ │ │ │ │ -|std::string redirect_path; | │ │ │ │ │ -| error_code ec; | │ │ │ │ │ -| std::tie(redirect_base, redirect_path) = split_url(location, ec); | │ │ │ │ │ +| TORRENT_ASSERT(st.total_wanted <= m_torrent_file->total_size()); | │ │ │ │ │ +| TORRENT_ASSERT(st.total_wanted >= 0); | │ │ │ │ │ | | │ │ │ │ │ -| if (ec) | │ │ │ │ │ +| TORRENT_ASSERT(!valid_metadata() || m_torrent_file->num_pieces() > 0); | │ │ │ │ │ +| if (!valid_metadata()) return; | │ │ │ │ │ +| | │ │ │ │ │ +| if (m_seed_mode || is_seed()) | │ │ │ │ │ | { | │ │ │ │ │ -| // we should not try this server again. | │ │ │ │ │ -| disconnect(errors::missing_location, operation_t::bittorrent, failure); | │ │ │ │ │ +| // once we're a seed and remove the piece picker, we stop tracking | │ │ │ │ │ +| // piece- and file priority. We consider everything as being | │ │ │ │ │ +| // "wanted" | │ │ │ │ │ +| st.total_done = m_torrent_file->total_size() - m_padding_bytes; | │ │ │ │ │ +| st.total_wanted_done = m_size_on_disk; | │ │ │ │ │ +| st.total_wanted = m_size_on_disk; | │ │ │ │ │ +| TORRENT_ASSERT(st.total_wanted <= st.total_done); | │ │ │ │ │ +| TORRENT_ASSERT(st.total_wanted_done <= st.total_wanted); | │ │ │ │ │ +| TORRENT_ASSERT(st.total_done <= m_torrent_file->total_size()); | │ │ │ │ │ | return; | │ │ │ │ │ | } | │ │ │ │ │ +| else if (!has_picker()) | │ │ │ │ │ +| { | │ │ │ │ │ +| st.total_done = 0; | │ │ │ │ │ +|_ _ _ _s_t_._t_o_t_a_l___w_a_n_t_e_d___d_o_n_e_ _=_ _0_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_4_9_0_5_ _ _ _ _ _ _ _|_s_h_o_u_l_d_ _t_h_i_s_ _a_l_e_r_t_ _h_a_v_e_ _a_n_ _e_r_r_o_r_ _c_o_d_e_ _i_n_ _i_t_?_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** sshhoouulldd tthhiiss aalleerrtt hhaavvee aann eerrrroorr ccooddee iinn iitt?? ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::44990055 ****** | │ │ │ │ │ +|on_remove_peers(); | │ │ │ │ │ +| TORRENT_ASSERT(m_connections.empty()); | │ │ │ │ │ | | │ │ │ │ │ -| // add_web_seed won't add duplicates. If we have already added an entry | │ │ │ │ │ -| // with this URL, we'll get back the existing entry | │ │ │ │ │ +| // post a message to the main thread to destruct | │ │ │ │ │ +| // the torrent object from there | │ │ │ │ │ +| if (m_storage) | │ │ │ │ │ +| { | │ │ │ │ │ +| try { | │ │ │ │ │ +| m_ses.disk_thread().async_stop_torrent(m_storage | │ │ │ │ │ +| , std::bind(&torrent::on_torrent_aborted, shared_from_this())); | │ │ │ │ │ +| } | │ │ │ │ │ +| catch (std::exception const& e) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_UNUSED(e); | │ │ │ │ │ +| m_storage.reset(); | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| debug_log("Failed to flush disk cache: %s", e.what()); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| // clients may rely on this alert to be posted, so it's probably a | │ │ │ │ │ +| // good idea to post it here, even though we failed | │ │ │ │ │ +|if (alerts().should_post()) | │ │ │ │ │ +|alerts().emplace_alert(get_handle()); | │ │ │ │ │ +| } | │ │ │ │ │ +| m_ses.deferred_submit_jobs(); | │ │ │ │ │ +| } | │ │ │ │ │ +| else | │ │ │ │ │ +| { | │ │ │ │ │ +| if (alerts().should_post()) | │ │ │ │ │ +| alerts().emplace_alert(get_handle()); | │ │ │ │ │ +| alerts().emplace_alert(get_handle() | │ │ │ │ │ +| , info_hash(), get_userdata()); | │ │ │ │ │ +|_ _ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_4_9_7_5_ _ _ _ _ _ _ _|_t_h_i_s_ _s_h_o_u_l_d_ _r_e_t_u_r_n_ _o_p_t_i_o_n_a_l_<_>_._ _p_i_e_c_e_ _i_n_d_e_x_ _-_1_ _s_h_o_u_l_d_ _n_o_t_ _b_e_ _a_l_l_o_w_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss sshhoouulldd rreettuurrnn ooppttiioonnaall<<>>.. ppiieeccee iinnddeexx --11 sshhoouulldd nnoott bbee aalllloowweedd ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::44997755 ****** | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -| // "ephemeral" flag should be set to avoid "web_seed_t" saving in resume data. | │ │ │ │ │ -| // E.g. original "web_seed_t" request url points to "http://example1.com/file1" and | │ │ │ │ │ -| // web server responses with redirect location "http://example2.com/subpath/file2". | │ │ │ │ │ -| // "handle_redirect" process this location to create new "web_seed_t" | │ │ │ │ │ -| // with base url=="http://example2.com/" and redirects[0]=="/subpath/file2"). | │ │ │ │ │ -| // If we try to load resume with such "web_seed_t" then "web_peer_connection" will send | │ │ │ │ │ -| // request with wrong path "http://example2.com/file1" (cause "redirects" map is not serialized in resume) | │ │ │ │ │ -| web_seed_t* web = t->add_web_seed(redirect_base, web_seed_entry::url_seed | │ │ │ │ │ -| , m_external_auth, m_extra_headers, web_seed_flags); | │ │ │ │ │ -| web->have_files.resize(t->torrent_file().num_files(), false); | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_SUPERSEEDING | │ │ │ │ │ +| void torrent::set_super_seeding(bool const on) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (on == m_super_seeding) return; | │ │ │ │ │ | | │ │ │ │ │ -| // the new web seed we're adding only has this file for now | │ │ │ │ │ -| // we may add more files later | │ │ │ │ │ -| web->redirects[file_index] = redirect_path; | │ │ │ │ │ -| if (web->have_files.get_bit(file_index) == false) | │ │ │ │ │ -|_ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_u_t___m_e_t_a_d_a_t_a_._c_p_p_:_2_6_8_ _ _ _ _|_u_s_e_ _t_h_e_ _a_u_x_:_:_w_r_i_t_e___*_ _f_u_n_c_t_i_o_n_s_ _a_n_d_ _t_h_e_ _s_p_a_n_ _h_e_r_e_ _i_n_s_t_e_a_d_,_ _i_t_ _w_i_l_l_ _f_i_t_ _b_e_t_t_e_r_ _w_i_t_h_ _s_e_n_d___b_u_f_f_e_r_(_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** uussee tthhee aauuxx::::wwrriittee__** ffuunnccttiioonnss aanndd tthhee ssppaann hheerree iinnsstteeaadd,, iitt wwiillll ffiitt bbeetttteerr wwiitthh sseenndd__bbuuffffeerr(()) ********** | │ │ │ │ │ -|****** ....//ssrrcc//uutt__mmeettaaddaattaa..ccpppp::226688 ****** | │ │ │ │ │ -|int metadata_piece_size = 0; | │ │ │ │ │ +| m_super_seeding = on; | │ │ │ │ │ +| set_need_save_resume(torrent_handle::if_state_changed); | │ │ │ │ │ +| state_updated(); | │ │ │ │ │ | | │ │ │ │ │ -| if (m_torrent.valid_metadata()) | │ │ │ │ │ -| e["total_size"] = m_tp.metadata().size(); | │ │ │ │ │ +| if (m_super_seeding) return; | │ │ │ │ │ | | │ │ │ │ │ -| if (type == msg_t::piece) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(piece >= 0 && piece < (m_tp.metadata().size() + 16 * 1024 - 1) / (16 * 1024)); | │ │ │ │ │ -| TORRENT_ASSERT(m_pc.associated_torrent().lock()->valid_metadata()); | │ │ │ │ │ -| TORRENT_ASSERT(m_torrent.valid_metadata()); | │ │ │ │ │ +| // disable super seeding for all peers | │ │ │ │ │ +| for (auto pc : *this) | │ │ │ │ │ +| { | │ │ │ │ │ +| pc->superseed_piece(piece_index_t(-1), piece_index_t(-1)); | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| int const offset = piece * 16 * 1024; | │ │ │ │ │ -| metadata = m_tp.metadata().data() + offset; | │ │ │ │ │ -| metadata_piece_size = std::min( | │ │ │ │ │ -| int(m_tp.metadata().size()) - offset, 16 * 1024); | │ │ │ │ │ -| TORRENT_ASSERT(metadata_piece_size > 0); | │ │ │ │ │ -| TORRENT_ASSERT(offset >= 0); | │ │ │ │ │ -| TORRENT_ASSERT(offset + metadata_piece_size <= m_tp.metadata().size()); | │ │ │ │ │ -| } | │ │ │ │ │ +|piece_index_t torrent::get_piece_to_super_seed(typed_bitfield const& bits) | │ │ │ │ │ +|{ | │ │ │ │ │ +| // return a piece with low availability that is not in | │ │ │ │ │ +| // the bitfield and that is not currently being super | │ │ │ │ │ +| // seeded by any peer | │ │ │ │ │ +| TORRENT_ASSERT(m_super_seeding); | │ │ │ │ │ | | │ │ │ │ │ -|char msg[200]; | │ │ │ │ │ -|char* header = msg; | │ │ │ │ │ -| char* p = &msg[6]; | │ │ │ │ │ -| int const len = bencode(p, e); | │ │ │ │ │ -| int const total_size = 2 + len + metadata_piece_size; | │ │ │ │ │ -| namespace io = aux; | │ │ │ │ │ -| io::write_uint32(total_size, header); | │ │ │ │ │ -| io::write_uint8(bt_peer_connection::msg_extended, header); | │ │ │ │ │ -| io::write_uint8(m_message_index, header); | │ │ │ │ │ +| // do a linear search from the first piece | │ │ │ │ │ +| int min_availability = 9999; | │ │ │ │ │ +| std::vector avail_vec; | │ │ │ │ │ +| for (auto const i : m_torrent_file->piece_range()) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (bits[i]) continue; | │ │ │ │ │ | | │ │ │ │ │ -|_ _ _ _m___p_c_._s_e_n_d___b_u_f_f_e_r_(_{_m_s_g_,_ _l_e_n_ _+_ _6_}_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| int availability = 0; | │ │ │ │ │ +| for (auto pc : *this) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (pc->super_seeded_piece(i)) | │ │ │ │ │ +| { | │ │ │ │ │ +| // avoid super-seeding the same piece to more than one | │ │ │ │ │ +| // peer if we can avoid it. Do this by artificially | │ │ │ │ │ +| // increase the availability | │ │ │ │ │ +| availability = 999; | │ │ │ │ │ +| break; | │ │ │ │ │ +| } | │ │ │ │ │ +| if (pc->has_piece(i)) ++availability; | │ │ │ │ │ +| } | │ │ │ │ │ +| if (availability > min_availability) continue; | │ │ │ │ │ +| if (availability == min_availability) | │ │ │ │ │ +| { | │ │ │ │ │ +|_ _ _ _ _a_v_a_i_l___v_e_c_._p_u_s_h___b_a_c_k_(_i_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_s_e_s_s_i_o_n___i_m_p_l_._c_p_p_:_1_1_4_2_ _ _|_c_l_o_s_i_n_g_ _t_h_e_ _u_d_p_ _s_o_c_k_e_t_s_ _h_e_r_e_ _m_e_a_n_s_ _t_h_a_t_ _t_h_e_ _u_T_P_ _c_o_n_n_e_c_t_i_o_n_s_ _c_a_n_n_o_t_ _b_e_ _c_l_o_s_e_d_ _g_r_a_c_e_f_u_l_l_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** cclloossiinngg tthhee uuddpp ssoocckkeettss hheerree mmeeaannss tthhaatt tthhee uuTTPP ccoonnnneeccttiioonnss ccaannnnoott bbee cclloosseedd ggrraacceeffuullllyy ********** | │ │ │ │ │ |****** ....//ssrrcc//sseessssiioonn__iimmppll..ccpppp::11114422 ****** | │ │ │ │ │ |#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ | session_log(" aborting all connections (%d)", int(m_connections.size())); | │ │ │ │ │ |#endif | │ │ │ │ │ | // abort all connections | │ │ │ │ │ @@ -1126,14 +1123,321 @@ │ │ │ │ │ | alerts.emplace_alert(pk.bytes, sig.bytes | │ │ │ │ │ | , std::move(salt), seq.value, num); | │ │ │ │ │ | } | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ | void put_mutable_callback(dht::item& i | │ │ │ │ │ |_ _ _ _,_ _s_t_d_:_:_f_u_n_c_t_i_o_n_<_v_o_i_d_(_e_n_t_r_y_&_,_ _s_t_d_:_:_a_r_r_a_y_<_c_h_a_r_,_ _6_4_>_&_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 3|_._._/_s_r_c_/ |this should be an optional, piece index -1 should not be allowed | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_w_e_b___p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_1_9_9_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss sshhoouulldd bbee aann ooppttiioonnaall,, ppiieeccee iinnddeexx --11 sshhoouulldd nnoott bbee aalllloowweedd ********** | │ │ │ │ │ +|****** ....//ssrrcc//wweebb__ppeeeerr__ccoonnnneeccttiioonn..ccpppp::119999 ****** | │ │ │ │ │ +| auto const range = aux::file_piece_range_inclusive(fs, i); | │ │ │ │ │ +| for (piece_index_t k = std::get<0>(range); k < std::get<1>(range); ++k) | │ │ │ │ │ +| have.clear_bit(k); | │ │ │ │ │ +| } | │ │ │ │ │ +| t->set_seed(peer_info_struct(), false); | │ │ │ │ │ +| if (have.none_set()) | │ │ │ │ │ +| { | │ │ │ │ │ +| incoming_have_none(); | │ │ │ │ │ +| m_web->interesting = false; | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| peer_log(peer_log_alert::info, "WEB-SEED", "have no pieces, not interesting. %s", m_url.c_str()); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ +| else | │ │ │ │ │ +| { | │ │ │ │ │ +| incoming_bitfield(have); | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|if (m_web->restart_request.piece != piece_index_t(-1)) | │ │ │ │ │ +|{ | │ │ │ │ │ +| // increase the chances of requesting the block | │ │ │ │ │ +| // we have partial data for already, to finish it | │ │ │ │ │ +| incoming_suggest(m_web->restart_request.piece); | │ │ │ │ │ +| } | │ │ │ │ │ +| web_connection_base::on_connected(); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|void web_peer_connection::disconnect(error_code const& ec | │ │ │ │ │ +| , operation_t op, disconnect_severity_t const error) | │ │ │ │ │ +|{ | │ │ │ │ │ +| if (is_disconnecting()) return; | │ │ │ │ │ +| | │ │ │ │ │ +| if (op == operation_t::sock_write && ec == boost::system::errc::broken_pipe) | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| // a write operation failed with broken-pipe. This typically happens | │ │ │ │ │ +| // with HTTP 1.0 servers that close their incoming channel of the TCP | │ │ │ │ │ +| // stream whenever they're done reading one full request. Instead of | │ │ │ │ │ +| // us bailing out and failing the entire request just because our | │ │ │ │ │ +| // write-end was closed, ignore it and keep reading until the read-end | │ │ │ │ │ +| // also is closed. | │ │ │ │ │ +| peer_log(peer_log_alert::info, "WRITE_DIRECTION", "CLOSED"); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| // prevent the peer from trying to send anything more | │ │ │ │ │ +| m_send_buffer.clear(); | │ │ │ │ │ +| | │ │ │ │ │ +| // when the web server closed our write-end of the socket (i.e. its | │ │ │ │ │ +|_ _ _/_/_ _r_e_a_d_-_e_n_d_)_,_ _i_f_ _i_t_'_s_ _a_n_ _H_T_T_P_ _1_._0_ _s_e_r_v_e_r_._ _w_e_ _w_i_l_l_ _s_t_o_p_ _s_e_n_d_i_n_g_ _m_o_r_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 3|_._._/_s_r_c_/ |do we really need a special case here? wouldn't the multi-file case handle single file torrents correctly too? | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_w_e_b___p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_4_1_9_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ddoo wwee rreeaallllyy nneeeedd aa ssppeecciiaall ccaassee hheerree?? wwoouullddnn''tt tthhee mmuullttii--ffiillee ccaassee hhaannddllee ssiinnggllee ffiillee ttoorrrreennttss ccoorrrreeccttllyy ttoooo?? ********** | │ │ │ │ │ +|****** ....//ssrrcc//wweebb__ppeeeerr__ccoonnnneeccttiioonn..ccpppp::441199 ****** | │ │ │ │ │ +|size -= pr.length; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| peer_log(peer_log_alert::outgoing_message, "REQUESTING", "(piece: %d start: %d) - (piece: %d end: %d)" | │ │ │ │ │ +| , static_cast(r.piece), r.start | │ │ │ │ │ +| , static_cast(pr.piece), pr.start + pr.length); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| bool const single_file_request = t->torrent_file().num_files() == 1; | │ │ │ │ │ +| int const proxy_type = m_settings.get_int(settings_pack::proxy_type); | │ │ │ │ │ +| bool const using_proxy = (proxy_type == settings_pack::http | │ │ │ │ │ +| || proxy_type == settings_pack::http_pw) && !m_ssl; | │ │ │ │ │ +| | │ │ │ │ │ +| // the number of pad files that have been "requested". In case we _only_ | │ │ │ │ │ +| // request padfiles, we can't rely on handling them in the on_receive() | │ │ │ │ │ +| // callback (because we won't receive anything), instead we have to post a | │ │ │ │ │ +| // pretend read callback where we can deliver the zeroes for the partfile | │ │ │ │ │ +| int num_pad_files = 0; | │ │ │ │ │ +| | │ │ │ │ │ +|if (single_file_request) | │ │ │ │ │ +|{ | │ │ │ │ │ +| file_request_t file_req; | │ │ │ │ │ +| file_req.file_index = file_index_t(0); | │ │ │ │ │ +| file_req.start = std::int64_t(static_cast(req.piece)) * info.piece_length() | │ │ │ │ │ +| + req.start; | │ │ │ │ │ +| file_req.length = req.length; | │ │ │ │ │ +| | │ │ │ │ │ +| request += "GET "; | │ │ │ │ │ +| // do not encode single file paths, they are | │ │ │ │ │ +| // assumed to be encoded in the torrent file | │ │ │ │ │ +| request += using_proxy ? m_url : m_path; | │ │ │ │ │ +| request += " HTTP/1.1\r\n"; | │ │ │ │ │ +| add_headers(request, m_settings, using_proxy); | │ │ │ │ │ +| request += "\r\nRange: bytes="; | │ │ │ │ │ +| request += to_string(file_req.start).data(); | │ │ │ │ │ +| request += "-"; | │ │ │ │ │ +| request += to_string(file_req.start + file_req.length - 1).data(); | │ │ │ │ │ +| request += "\r\n\r\n"; | │ │ │ │ │ +| m_first_request = false; | │ │ │ │ │ +| | │ │ │ │ │ +| m_file_requests.push_back(file_req); | │ │ │ │ │ +| } | │ │ │ │ │ +| else | │ │ │ │ │ +| { | │ │ │ │ │ +| std::vector files = info.orig_files().map_block(req.piece, req.start | │ │ │ │ │ +| , req.length); | │ │ │ │ │ +| | │ │ │ │ │ +| for (auto const &f : files) | │ │ │ │ │ +| { | │ │ │ │ │ +|_ _ _ _f_i_l_e___r_e_q_u_e_s_t___t_ _f_i_l_e___r_e_q_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 3|_._._/_s_r_c_/ |file_index_t should not allow negative values | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_w_e_b___p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_5_0_4_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ffiillee__iinnddeexx__tt sshhoouulldd nnoott aallllooww nneeggaattiivvee vvaalluueess ********** | │ │ │ │ │ +|****** ....//ssrrcc//wweebb__ppeeeerr__ccoonnnneeccttiioonn..ccpppp::550044 ****** | │ │ │ │ │ +|// with the correct slashes. Don't encode it again | │ │ │ │ │ +| request += m_path; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| request += escape_file_path(info.orig_files(), f.file_index); | │ │ │ │ │ +| } | │ │ │ │ │ +| request += " HTTP/1.1\r\n"; | │ │ │ │ │ +| add_headers(request, m_settings, using_proxy); | │ │ │ │ │ +| request += "\r\nRange: bytes="; | │ │ │ │ │ +| request += to_string(f.offset).data(); | │ │ │ │ │ +| request += "-"; | │ │ │ │ │ +| request += to_string(f.offset + f.size - 1).data(); | │ │ │ │ │ +| request += "\r\n\r\n"; | │ │ │ │ │ +| m_first_request = false; | │ │ │ │ │ +| | │ │ │ │ │ +|#if 0 | │ │ │ │ │ +| std::cerr << this << " SEND-REQUEST: f: " << f.file_index | │ │ │ │ │ +| << " s: " << f.offset | │ │ │ │ │ +| << " e: " << (f.offset + f.size - 1) << std::endl; | │ │ │ │ │ +|#endif | │ │ │ │ │ +|TORRENT_ASSERT(f.file_index >= file_index_t(0)); | │ │ │ │ │ +| | │ │ │ │ │ +| m_file_requests.push_back(file_req); | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| if (num_pad_files == int(m_file_requests.size())) | │ │ │ │ │ +| { | │ │ │ │ │ +| post(get_context(), std::bind( | │ │ │ │ │ +| &web_peer_connection::on_receive_padfile, | │ │ │ │ │ +| std::static_pointer_cast(self()))); | │ │ │ │ │ +| return; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| peer_log(peer_log_alert::outgoing_message, "REQUEST", "%s", request.c_str()); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| send_buffer(request); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|namespace { | │ │ │ │ │ +| | │ │ │ │ │ +| std::string get_peer_name(http_parser const& p, std::string const& host) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::string const& server_version = p.header("server"); | │ │ │ │ │ +| if (!server_version.empty()) | │ │ │ │ │ +| return server_version; | │ │ │ │ │ +| return host; | │ │ │ │ │ +|_ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 3|_._._/_s_r_c_/ |this could be made more efficient for the case when we use an HTTP proxy. Then we wouldn't need to add new web seeds to the torrent,| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_w_e_b___p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_6_9_5_ _ _ _|_w_e_ _c_o_u_l_d_ _j_u_s_t_ _m_a_k_e_ _t_h_e_ _r_e_d_i_r_e_c_t_ _t_a_b_l_e_ _c_o_n_t_a_i_n_ _f_u_l_l_ _U_R_L_s_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss ccoouulldd bbee mmaaddee mmoorree eeffffiicciieenntt ffoorr tthhee ccaassee wwhheenn wwee uussee aann HHTTTTPP pprrooxxyy.. TThheenn wwee wwoouullddnn''tt nneeeedd ttoo aadddd nneeww wweebb sseeeeddss ttoo tthhee ttoorrrreenntt,, wwee ccoouulldd jjuusstt mmaakkee tthhee rreeddiirreecctt | │ │ │ │ │ +|ttaabbllee ccoonnttaaiinn ffuullll UURRLLss.. ********** | │ │ │ │ │ +|****** ....//ssrrcc//wweebb__ppeeeerr__ccoonnnneeccttiioonn..ccpppp::669955 ****** | │ │ │ │ │ +|bool const single_file_request = !m_path.empty() | │ │ │ │ │ +| && m_path[m_path.size() - 1] != '/'; | │ │ │ │ │ +| | │ │ │ │ │ +| // when SSRF mitigation is enabled, a web seed on the internet (is_global()) | │ │ │ │ │ +| // is not allowed to redirect to a server on the local network, so we set | │ │ │ │ │ +| // the no_local_ips flag | │ │ │ │ │ +| auto const web_seed_flags = torrent::ephemeral | │ │ │ │ │ +| | ((m_settings.get_bool(settings_pack::ssrf_mitigation) && aux::is_global(remote().address())) | │ │ │ │ │ +| ? torrent::no_local_ips : web_seed_flag_t{}); | │ │ │ │ │ +| | │ │ │ │ │ +| // add the redirected url and remove the current one | │ │ │ │ │ +| if (!single_file_request) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(!m_file_requests.empty()); | │ │ │ │ │ +| file_index_t const file_index = m_file_requests.front().file_index; | │ │ │ │ │ +| | │ │ │ │ │ +| location = resolve_redirect_location(m_url, location); | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| peer_log(peer_log_alert::info, "LOCATION", "%s", location.c_str()); | │ │ │ │ │ +|#endif | │ │ │ │ │ +|std::string redirect_base; | │ │ │ │ │ +|std::string redirect_path; | │ │ │ │ │ +| error_code ec; | │ │ │ │ │ +| std::tie(redirect_base, redirect_path) = split_url(location, ec); | │ │ │ │ │ +| | │ │ │ │ │ +| if (ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| // we should not try this server again. | │ │ │ │ │ +| disconnect(errors::missing_location, operation_t::bittorrent, failure); | │ │ │ │ │ +| return; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| // add_web_seed won't add duplicates. If we have already added an entry | │ │ │ │ │ +| // with this URL, we'll get back the existing entry | │ │ │ │ │ +| | │ │ │ │ │ +| // "ephemeral" flag should be set to avoid "web_seed_t" saving in resume data. | │ │ │ │ │ +| // E.g. original "web_seed_t" request url points to "http://example1.com/file1" and | │ │ │ │ │ +| // web server responses with redirect location "http://example2.com/subpath/file2". | │ │ │ │ │ +| // "handle_redirect" process this location to create new "web_seed_t" | │ │ │ │ │ +| // with base url=="http://example2.com/" and redirects[0]=="/subpath/file2"). | │ │ │ │ │ +| // If we try to load resume with such "web_seed_t" then "web_peer_connection" will send | │ │ │ │ │ +| // request with wrong path "http://example2.com/file1" (cause "redirects" map is not serialized in resume) | │ │ │ │ │ +| web_seed_t* web = t->add_web_seed(redirect_base, web_seed_entry::url_seed | │ │ │ │ │ +| , m_external_auth, m_extra_headers, web_seed_flags); | │ │ │ │ │ +| web->have_files.resize(t->torrent_file().num_files(), false); | │ │ │ │ │ +| | │ │ │ │ │ +| // the new web seed we're adding only has this file for now | │ │ │ │ │ +| // we may add more files later | │ │ │ │ │ +| web->redirects[file_index] = redirect_path; | │ │ │ │ │ +| if (web->have_files.get_bit(file_index) == false) | │ │ │ │ │ +|_ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_u_t___m_e_t_a_d_a_t_a_._c_p_p_:_2_6_8_ _ _ _ _|_u_s_e_ _t_h_e_ _a_u_x_:_:_w_r_i_t_e___*_ _f_u_n_c_t_i_o_n_s_ _a_n_d_ _t_h_e_ _s_p_a_n_ _h_e_r_e_ _i_n_s_t_e_a_d_,_ _i_t_ _w_i_l_l_ _f_i_t_ _b_e_t_t_e_r_ _w_i_t_h_ _s_e_n_d___b_u_f_f_e_r_(_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** uussee tthhee aauuxx::::wwrriittee__** ffuunnccttiioonnss aanndd tthhee ssppaann hheerree iinnsstteeaadd,, iitt wwiillll ffiitt bbeetttteerr wwiitthh sseenndd__bbuuffffeerr(()) ********** | │ │ │ │ │ +|****** ....//ssrrcc//uutt__mmeettaaddaattaa..ccpppp::226688 ****** | │ │ │ │ │ +|int metadata_piece_size = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| if (m_torrent.valid_metadata()) | │ │ │ │ │ +| e["total_size"] = m_tp.metadata().size(); | │ │ │ │ │ +| | │ │ │ │ │ +| if (type == msg_t::piece) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(piece >= 0 && piece < (m_tp.metadata().size() + 16 * 1024 - 1) / (16 * 1024)); | │ │ │ │ │ +| TORRENT_ASSERT(m_pc.associated_torrent().lock()->valid_metadata()); | │ │ │ │ │ +| TORRENT_ASSERT(m_torrent.valid_metadata()); | │ │ │ │ │ +| | │ │ │ │ │ +| int const offset = piece * 16 * 1024; | │ │ │ │ │ +| metadata = m_tp.metadata().data() + offset; | │ │ │ │ │ +| metadata_piece_size = std::min( | │ │ │ │ │ +| int(m_tp.metadata().size()) - offset, 16 * 1024); | │ │ │ │ │ +| TORRENT_ASSERT(metadata_piece_size > 0); | │ │ │ │ │ +| TORRENT_ASSERT(offset >= 0); | │ │ │ │ │ +| TORRENT_ASSERT(offset + metadata_piece_size <= m_tp.metadata().size()); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|char msg[200]; | │ │ │ │ │ +|char* header = msg; | │ │ │ │ │ +| char* p = &msg[6]; | │ │ │ │ │ +| int const len = bencode(p, e); | │ │ │ │ │ +| int const total_size = 2 + len + metadata_piece_size; | │ │ │ │ │ +| namespace io = aux; | │ │ │ │ │ +| io::write_uint32(total_size, header); | │ │ │ │ │ +| io::write_uint8(bt_peer_connection::msg_extended, header); | │ │ │ │ │ +| io::write_uint8(m_message_index, header); | │ │ │ │ │ +| | │ │ │ │ │ +|_ _ _ _m___p_c_._s_e_n_d___b_u_f_f_e_r_(_{_m_s_g_,_ _l_e_n_ _+_ _6_}_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_s_e_s_s_i_o_n___h_a_n_d_l_e_._c_p_p_:_6_9_1_ _|_e_x_p_o_s_e_ _t_h_e_ _s_e_q_u_e_n_c_e___n_u_m_b_e_r_,_ _p_u_b_l_i_c___k_e_y_,_ _s_e_c_r_e_t___k_e_y_ _a_n_d_ _s_i_g_n_a_t_u_r_e_ _t_y_p_e_s_ _t_o_ _t_h_e_ _c_l_i_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** eexxppoossee tthhee sseeqquueennccee__nnuummbbeerr,, ppuubblliicc__kkeeyy,, sseeccrreett__kkeeyy aanndd ssiiggnnaattuurree ttyyppeess ttoo tthhee cclliieenntt ********** | │ │ │ │ │ +|****** ....//ssrrcc//sseessssiioonn__hhaannddllee..ccpppp::669911 ****** | │ │ │ │ │ +|void session_handle::dht_get_item(sha1_hash const& target) | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_DHT | │ │ │ │ │ +| async_call(&session_impl::dht_get_immutable_item, target); | │ │ │ │ │ +|#else | │ │ │ │ │ +| TORRENT_UNUSED(target); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void session_handle::dht_get_item(std::array key | │ │ │ │ │ +| , std::string salt) | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_DHT | │ │ │ │ │ +| async_call(&session_impl::dht_get_mutable_item, key, salt); | │ │ │ │ │ +|#else | │ │ │ │ │ +| TORRENT_UNUSED(key); | │ │ │ │ │ +| TORRENT_UNUSED(salt); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|sha1_hash session_handle::dht_put_item(entry data) | │ │ │ │ │ +|{ | │ │ │ │ │ +| std::vector buf; | │ │ │ │ │ +| bencode(std::back_inserter(buf), data); | │ │ │ │ │ +| sha1_hash const ret = hasher(buf).final(); | │ │ │ │ │ +| | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_DHT | │ │ │ │ │ +| async_call(&session_impl::dht_put_immutable_item, data, ret); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| return ret; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void session_handle::dht_put_item(std::array key | │ │ │ │ │ +| , std::function& | │ │ │ │ │ +| , std::int64_t&, std::string const&)> cb | │ │ │ │ │ +| , std::string salt) | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_DHT | │ │ │ │ │ +| async_call(&session_impl::dht_put_mutable_item, key, cb, salt); | │ │ │ │ │ +|#else | │ │ │ │ │ +| TORRENT_UNUSED(key); | │ │ │ │ │ +| TORRENT_UNUSED(cb); | │ │ │ │ │ +| TORRENT_UNUSED(salt); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void session_handle::dht_get_peers(sha1_hash const& info_hash) | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_DHT | │ │ │ │ │ +| async_call(&session_impl::dht_get_peers, info_hash); | │ │ │ │ │ +|_#_e_l_s_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ | |_._._/_s_r_c_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_: |instead of having to ask the torrent whether it's in graceful pause mode or not, the peers should keep that state (and the torrent | │ │ │ │ │ |relevance 3|_3_1_3_3 |should update them when it enters graceful pause). When a peer enters graceful pause mode, it should cancel all outstanding requests| │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_a_n_d_ _c_l_e_a_r_ _i_t_s_ _r_e_q_u_e_s_t_ _q_u_e_u_e_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** iinnsstteeaadd ooff hhaavviinngg ttoo aasskk tthhee ttoorrrreenntt wwhheetthheerr iitt''ss iinn ggrraacceeffuull ppaauussee mmooddee oorr nnoott,, tthhee ppeeeerrss sshhoouulldd kkeeeepp tthhaatt ssttaattee ((aanndd tthhee ttoorrrreenntt sshhoouulldd uuppddaattee tthheemm wwhheenn iitt eenntteerrss | │ │ │ │ │ |ggrraacceeffuull ppaauussee)).. WWhheenn aa ppeeeerr eenntteerrss ggrraacceeffuull ppaauussee mmooddee,, iitt sshhoouulldd ccaanncceell aallll oouuttssttaannddiinngg rreeqquueessttss aanndd cclleeaarr iittss rreeqquueesstt qquueeuuee.. ********** | │ │ │ │ │ |****** ....//ssrrcc//ppeeeerr__ccoonnnneeccttiioonn..ccpppp::33113333 ****** | │ │ │ │ │ |// to disk or are in the disk write cache | │ │ │ │ │ @@ -1291,318 +1595,14 @@ │ │ │ │ │ | | │ │ │ │ │ | return; | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ | TORRENT_ASSERT(!has_piece(new_piece)); | │ │ │ │ │ | | │ │ │ │ │ |_#_i_f_n_d_e_f_ _T_O_R_R_E_N_T___D_I_S_A_B_L_E___L_O_G_G_I_N_G_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_4_1_9_ _ _ _ _ _ _ _ _|_w_e_ _c_o_u_l_d_ _p_r_o_b_a_b_l_y_ _g_e_t_ _a_w_a_y_ _w_i_t_h_ _j_u_s_t_ _s_a_v_i_n_g_ _a_ _f_e_w_ _f_i_e_l_d_s_ _h_e_r_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** wwee ccoouulldd pprroobbaabbllyy ggeett aawwaayy wwiitthh jjuusstt ssaavviinngg aa ffeeww ffiieellddss hheerree ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::441199 ****** | │ │ │ │ │ -|// --- V2 HASHES --- | │ │ │ │ │ -| | │ │ │ │ │ -| if (m_torrent_file->is_valid() && m_torrent_file->info_hashes().has_v2()) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (!p.merkle_trees.empty()) | │ │ │ │ │ -| load_merkle_trees( | │ │ │ │ │ -| std::move(p.merkle_trees) | │ │ │ │ │ -| , std::move(p.merkle_tree_mask) | │ │ │ │ │ -| , std::move(p.verified_leaf_hashes)); | │ │ │ │ │ -| | │ │ │ │ │ -| // we really don't want to store extra copies of the trees | │ │ │ │ │ -| TORRENT_ASSERT(p.merkle_trees.empty()); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| if (valid_metadata()) | │ │ │ │ │ -| { | │ │ │ │ │ -| inc_stats_counter(counters::num_total_pieces_added | │ │ │ │ │ -| , m_torrent_file->num_pieces()); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|m_add_torrent_params = std::make_unique(std::move(p)); | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -| void torrent::load_merkle_trees( | │ │ │ │ │ -| aux::vector, file_index_t> trees_import | │ │ │ │ │ -| , aux::vector, file_index_t> mask | │ │ │ │ │ -| , aux::vector, file_index_t> verified) | │ │ │ │ │ -| { | │ │ │ │ │ -| auto const& fs = m_torrent_file->orig_files(); | │ │ │ │ │ -| | │ │ │ │ │ -| std::vector const empty_verified; | │ │ │ │ │ -| for (file_index_t i{0}; i < fs.end_file(); ++i) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (fs.pad_file_at(i) || fs.file_size(i) == 0) | │ │ │ │ │ -| continue; | │ │ │ │ │ -| | │ │ │ │ │ -| if (i >= trees_import.end_index()) break; | │ │ │ │ │ -| std::vector const& verified_bitmask = (i >= verified.end_index()) ? empty_verified : verified[i]; | │ │ │ │ │ -| if (i < mask.end_index() && !mask[i].empty()) | │ │ │ │ │ -| { | │ │ │ │ │ -| mask[i].resize(m_merkle_trees[i].size(), false); | │ │ │ │ │ -| m_merkle_trees[i].load_sparse_tree(trees_import[i], mask[i], verified_bitmask); | │ │ │ │ │ -| } | │ │ │ │ │ -| else | │ │ │ │ │ -| { | │ │ │ │ │ -| m_merkle_trees[i].load_tree(trees_import[i], verified_bitmask); | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|_ _v_o_i_d_ _t_o_r_r_e_n_t_:_:_i_n_c___s_t_a_t_s___c_o_u_n_t_e_r_(_i_n_t_ _c_,_ _i_n_t_ _v_a_l_u_e_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_7_1_5_ _ _ _ _ _ _ _ _|_a_s_s_e_r_t_ _t_h_e_r_e_ _a_r_e_ _n_o_ _o_u_t_s_t_a_n_d_i_n_g_ _a_s_y_n_c_ _o_p_e_r_a_t_i_o_n_s_ _o_n_ _t_h_i_s_ _t_o_r_r_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** aasssseerrtt tthheerree aarree nnoo oouuttssttaannddiinngg aassyynncc ooppeerraattiioonnss oonn tthhiiss ttoorrrreenntt ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::771155 ****** | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| if (!m_ses.dht()) return false; | │ │ │ │ │ -| if (m_torrent_file->is_valid() && !m_files_checked) return false; | │ │ │ │ │ -| if (!m_announce_to_dht) return false; | │ │ │ │ │ -| if (m_paused) return false; | │ │ │ │ │ -| | │ │ │ │ │ -| // don't announce private torrents | │ │ │ │ │ -| if (m_torrent_file->is_valid() && m_torrent_file->priv()) return false; | │ │ │ │ │ -| if (m_trackers.empty()) return true; | │ │ │ │ │ -| if (!settings().get_bool(settings_pack::use_dht_as_fallback)) return true; | │ │ │ │ │ -| | │ │ │ │ │ -| return std::none_of(m_trackers.begin(), m_trackers.end() | │ │ │ │ │ -| , [](aux::announce_entry const& tr) { return bool(tr.verified); }); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| torrent::~torrent() | │ │ │ │ │ -| { | │ │ │ │ │ -| | │ │ │ │ │ -|#if TORRENT_USE_ASSERTS | │ │ │ │ │ -| for (torrent_list_index_t i{}; i != m_links.end_index(); ++i) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (!m_links[i].in_list()) continue; | │ │ │ │ │ -| m_links[i].unlink(m_ses.torrent_list(i), i); | │ │ │ │ │ -| } | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| // The invariant can't be maintained here, since the torrent | │ │ │ │ │ -| // is being destructed, all weak references to it have been | │ │ │ │ │ -| // reset, which means that all its peers already have an | │ │ │ │ │ -| // invalidated torrent pointer (so it cannot be verified to be correct) | │ │ │ │ │ -| | │ │ │ │ │ -| // i.e. the invariant can only be maintained if all connections have | │ │ │ │ │ -| // been closed by the time the torrent is destructed. And they are | │ │ │ │ │ -| // supposed to be closed. So we can still do the invariant check. | │ │ │ │ │ -| | │ │ │ │ │ -| // however, the torrent object may be destructed from the main | │ │ │ │ │ -| // thread when shutting down, if the disk cache has references to it. | │ │ │ │ │ -| // this means that the invariant check that this is called from the | │ │ │ │ │ -| // network thread cannot be maintained | │ │ │ │ │ -| | │ │ │ │ │ -| TORRENT_ASSERT(m_peer_class == peer_class_t{0}); | │ │ │ │ │ -| TORRENT_ASSERT(m_connections.empty()); | │ │ │ │ │ -| // just in case, make sure the session accounting is kept right | │ │ │ │ │ -| for (auto p : m_connections) | │ │ │ │ │ -| m_ses.close_connection(p); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|_ _v_o_i_d_ _t_o_r_r_e_n_t_:_:_r_e_a_d___p_i_e_c_e_(_p_i_e_c_e___i_n_d_e_x___t_ _c_o_n_s_t_ _p_i_e_c_e_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_1_3_3_1_ _ _ _ _ _ _ _|_t_h_e_r_e_'_s_ _s_o_m_e_ _d_u_p_l_i_c_a_t_i_o_n_ _b_e_t_w_e_e_n_ _t_h_i_s_ _f_u_n_c_t_i_o_n_ _a_n_d_ _p_e_e_r___c_o_n_n_e_c_t_i_o_n_:_:_i_n_c_o_m_i_n_g___p_i_e_c_e_(_)_._ _i_s_ _t_h_e_r_e_ _a_ _w_a_y_ _t_o_ _m_e_r_g_e_ _s_o_m_e_t_h_i_n_g_?_ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthheerree''ss ssoommee dduupplliiccaattiioonn bbeettwweeeenn tthhiiss ffuunnccttiioonn aanndd ppeeeerr__ccoonnnneeccttiioonn::::iinnccoommiinngg__ppiieeccee(()).. iiss tthheerree aa wwaayy ttoo mmeerrggee ssoommeetthhiinngg?? ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::11333311 ****** | │ │ │ │ │ -|piece_index_t m_piece; | │ │ │ │ │ -| bool m_armed = true; | │ │ │ │ │ -| }; | │ │ │ │ │ -| | │ │ │ │ │ -| void torrent::add_piece_async(piece_index_t const piece | │ │ │ │ │ -| , std::vector data, add_piece_flags_t const flags) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -| | │ │ │ │ │ -| // make sure the piece index is correct | │ │ │ │ │ -| if (piece >= torrent_file().end_piece()) | │ │ │ │ │ -| return; | │ │ │ │ │ -| | │ │ │ │ │ -| // make sure the piece size is correct | │ │ │ │ │ -| if (data.size() != std::size_t(m_torrent_file->piece_size(piece))) | │ │ │ │ │ -| return; | │ │ │ │ │ -| | │ │ │ │ │ -| add_piece(piece, data.data(), flags); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|void torrent::add_piece(piece_index_t const piece, char const* data | │ │ │ │ │ -|, add_piece_flags_t const flags) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -| | │ │ │ │ │ -| // make sure the piece index is correct | │ │ │ │ │ -| if (piece >= torrent_file().end_piece()) | │ │ │ │ │ -| return; | │ │ │ │ │ -| | │ │ │ │ │ -| int const piece_size = m_torrent_file->piece_size(piece); | │ │ │ │ │ -| int const blocks_in_piece = (piece_size + block_size() - 1) / block_size(); | │ │ │ │ │ -| | │ │ │ │ │ -| if (m_deleted) return; | │ │ │ │ │ -| | │ │ │ │ │ -| // avoid crash trying to access the picker when there is none | │ │ │ │ │ -| if (m_have_all && !has_picker()) return; | │ │ │ │ │ -| | │ │ │ │ │ -| // we don't support clobbering the piece picker while checking the | │ │ │ │ │ -| // files. We may end up having the same piece multiple times | │ │ │ │ │ -| TORRENT_ASSERT_PRECOND(state() != torrent_status::checking_files | │ │ │ │ │ -| && state() != torrent_status::checking_resume_data); | │ │ │ │ │ -| if (state() == torrent_status::checking_files | │ │ │ │ │ -| || state() == torrent_status::checking_resume_data) | │ │ │ │ │ -| return; | │ │ │ │ │ -| | │ │ │ │ │ -| need_picker(); | │ │ │ │ │ -| | │ │ │ │ │ -| if (picker().have_piece(piece) | │ │ │ │ │ -| && !(flags & torrent_handle::overwrite_existing)) | │ │ │ │ │ -|_ _ _ _r_e_t_u_r_n_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_3_9_6_6_ _ _ _ _ _ _ _|_t_h_i_s_ _c_o_u_l_d_ _p_r_o_b_a_b_l_y_ _b_e_ _p_u_l_l_e_d_ _o_u_t_ _i_n_t_o_ _a_ _f_r_e_e_ _f_u_n_c_t_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss ccoouulldd pprroobbaabbllyy bbee ppuulllleedd oouutt iinnttoo aa ffrreeee ffuunnccttiioonn ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::33996666 ****** | │ │ │ │ │ -|std::int64_t calc_bytes(file_storage const& fs, piece_count const& pc) | │ │ │ │ │ -| { | │ │ │ │ │ -| // it's an impossible combination to have 0 pieces, but still have one of them be the last piece | │ │ │ │ │ -| TORRENT_ASSERT(!(pc.num_pieces == 0 && pc.last_piece == true)); | │ │ │ │ │ -| | │ │ │ │ │ -| // if we have 0 pieces, we can't have any pad blocks either | │ │ │ │ │ -| TORRENT_ASSERT(!(pc.num_pieces == 0 && pc.pad_bytes > 0)); | │ │ │ │ │ -| | │ │ │ │ │ -| // if we have all pieces, we must also have the last one | │ │ │ │ │ -| TORRENT_ASSERT(!(pc.num_pieces == fs.num_pieces() && pc.last_piece == false)); | │ │ │ │ │ -| | │ │ │ │ │ -| // every block should not be a pad block | │ │ │ │ │ -| TORRENT_ASSERT(pc.pad_bytes <= std::int64_t(pc.num_pieces) * fs.piece_length()); | │ │ │ │ │ -| | │ │ │ │ │ -| return std::int64_t(pc.num_pieces) * fs.piece_length() | │ │ │ │ │ -| - (pc.last_piece ? fs.piece_length() - fs.piece_size(fs.last_piece()) : 0) | │ │ │ │ │ -| - std::int64_t(pc.pad_bytes); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // fills in total_wanted, total_wanted_done and total_done | │ │ │ │ │ -|void torrent::bytes_done(torrent_status& st, status_flags_t const flags) const | │ │ │ │ │ -|{ | │ │ │ │ │ -| INVARIANT_CHECK; | │ │ │ │ │ -| | │ │ │ │ │ -| st.total_done = 0; | │ │ │ │ │ -| st.total_wanted_done = 0; | │ │ │ │ │ -| st.total_wanted = m_size_on_disk; | │ │ │ │ │ -| | │ │ │ │ │ -| TORRENT_ASSERT(st.total_wanted <= m_torrent_file->total_size()); | │ │ │ │ │ -| TORRENT_ASSERT(st.total_wanted >= 0); | │ │ │ │ │ -| | │ │ │ │ │ -| TORRENT_ASSERT(!valid_metadata() || m_torrent_file->num_pieces() > 0); | │ │ │ │ │ -| if (!valid_metadata()) return; | │ │ │ │ │ -| | │ │ │ │ │ -| if (m_seed_mode || is_seed()) | │ │ │ │ │ -| { | │ │ │ │ │ -| // once we're a seed and remove the piece picker, we stop tracking | │ │ │ │ │ -| // piece- and file priority. We consider everything as being | │ │ │ │ │ -| // "wanted" | │ │ │ │ │ -| st.total_done = m_torrent_file->total_size() - m_padding_bytes; | │ │ │ │ │ -| st.total_wanted_done = m_size_on_disk; | │ │ │ │ │ -| st.total_wanted = m_size_on_disk; | │ │ │ │ │ -| TORRENT_ASSERT(st.total_wanted <= st.total_done); | │ │ │ │ │ -| TORRENT_ASSERT(st.total_wanted_done <= st.total_wanted); | │ │ │ │ │ -| TORRENT_ASSERT(st.total_done <= m_torrent_file->total_size()); | │ │ │ │ │ -| return; | │ │ │ │ │ -| } | │ │ │ │ │ -| else if (!has_picker()) | │ │ │ │ │ -| { | │ │ │ │ │ -| st.total_done = 0; | │ │ │ │ │ -|_ _ _ _s_t_._t_o_t_a_l___w_a_n_t_e_d___d_o_n_e_ _=_ _0_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_4_9_0_5_ _ _ _ _ _ _ _|_s_h_o_u_l_d_ _t_h_i_s_ _a_l_e_r_t_ _h_a_v_e_ _a_n_ _e_r_r_o_r_ _c_o_d_e_ _i_n_ _i_t_?_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** sshhoouulldd tthhiiss aalleerrtt hhaavvee aann eerrrroorr ccooddee iinn iitt?? ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::44990055 ****** | │ │ │ │ │ -|on_remove_peers(); | │ │ │ │ │ -| TORRENT_ASSERT(m_connections.empty()); | │ │ │ │ │ -| | │ │ │ │ │ -| // post a message to the main thread to destruct | │ │ │ │ │ -| // the torrent object from there | │ │ │ │ │ -| if (m_storage) | │ │ │ │ │ -| { | │ │ │ │ │ -| try { | │ │ │ │ │ -| m_ses.disk_thread().async_stop_torrent(m_storage | │ │ │ │ │ -| , std::bind(&torrent::on_torrent_aborted, shared_from_this())); | │ │ │ │ │ -| } | │ │ │ │ │ -| catch (std::exception const& e) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_UNUSED(e); | │ │ │ │ │ -| m_storage.reset(); | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| debug_log("Failed to flush disk cache: %s", e.what()); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| // clients may rely on this alert to be posted, so it's probably a | │ │ │ │ │ -| // good idea to post it here, even though we failed | │ │ │ │ │ -|if (alerts().should_post()) | │ │ │ │ │ -|alerts().emplace_alert(get_handle()); | │ │ │ │ │ -| } | │ │ │ │ │ -| m_ses.deferred_submit_jobs(); | │ │ │ │ │ -| } | │ │ │ │ │ -| else | │ │ │ │ │ -| { | │ │ │ │ │ -| if (alerts().should_post()) | │ │ │ │ │ -| alerts().emplace_alert(get_handle()); | │ │ │ │ │ -| alerts().emplace_alert(get_handle() | │ │ │ │ │ -| , info_hash(), get_userdata()); | │ │ │ │ │ -|_ _ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _3_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_4_9_7_5_ _ _ _ _ _ _ _|_t_h_i_s_ _s_h_o_u_l_d_ _r_e_t_u_r_n_ _o_p_t_i_o_n_a_l_<_>_._ _p_i_e_c_e_ _i_n_d_e_x_ _-_1_ _s_h_o_u_l_d_ _n_o_t_ _b_e_ _a_l_l_o_w_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss sshhoouulldd rreettuurrnn ooppttiioonnaall<<>>.. ppiieeccee iinnddeexx --11 sshhoouulldd nnoott bbee aalllloowweedd ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::44997755 ****** | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_SUPERSEEDING | │ │ │ │ │ -| void torrent::set_super_seeding(bool const on) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (on == m_super_seeding) return; | │ │ │ │ │ -| | │ │ │ │ │ -| m_super_seeding = on; | │ │ │ │ │ -| set_need_save_resume(torrent_handle::if_state_changed); | │ │ │ │ │ -| state_updated(); | │ │ │ │ │ -| | │ │ │ │ │ -| if (m_super_seeding) return; | │ │ │ │ │ -| | │ │ │ │ │ -| // disable super seeding for all peers | │ │ │ │ │ -| for (auto pc : *this) | │ │ │ │ │ -| { | │ │ │ │ │ -| pc->superseed_piece(piece_index_t(-1), piece_index_t(-1)); | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|piece_index_t torrent::get_piece_to_super_seed(typed_bitfield const& bits) | │ │ │ │ │ -|{ | │ │ │ │ │ -| // return a piece with low availability that is not in | │ │ │ │ │ -| // the bitfield and that is not currently being super | │ │ │ │ │ -| // seeded by any peer | │ │ │ │ │ -| TORRENT_ASSERT(m_super_seeding); | │ │ │ │ │ -| | │ │ │ │ │ -| // do a linear search from the first piece | │ │ │ │ │ -| int min_availability = 9999; | │ │ │ │ │ -| std::vector avail_vec; | │ │ │ │ │ -| for (auto const i : m_torrent_file->piece_range()) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (bits[i]) continue; | │ │ │ │ │ -| | │ │ │ │ │ -| int availability = 0; | │ │ │ │ │ -| for (auto pc : *this) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (pc->super_seeded_piece(i)) | │ │ │ │ │ -| { | │ │ │ │ │ -| // avoid super-seeding the same piece to more than one | │ │ │ │ │ -| // peer if we can avoid it. Do this by artificially | │ │ │ │ │ -| // increase the availability | │ │ │ │ │ -| availability = 999; | │ │ │ │ │ -| break; | │ │ │ │ │ -| } | │ │ │ │ │ -| if (pc->has_piece(i)) ++availability; | │ │ │ │ │ -| } | │ │ │ │ │ -| if (availability > min_availability) continue; | │ │ │ │ │ -| if (availability == min_availability) | │ │ │ │ │ -| { | │ │ │ │ │ -|_ _ _ _ _a_v_a_i_l___v_e_c_._p_u_s_h___b_a_c_k_(_i_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 3|_._._/_s_r_c_/_k_a_d_e_m_l_i_a_/ |move this into it's own .cpp file | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_r_p_c___m_a_n_a_g_e_r_._c_p_p_:_7_1_ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** mmoovvee tthhiiss iinnttoo iitt''ss oowwnn ..ccpppp ffiillee ********** | │ │ │ │ │ |****** ....//ssrrcc//kkaaddeemmlliiaa//rrppcc__mmaannaaggeerr..ccpppp::7711 ****** | │ │ │ │ │ |#include | │ │ │ │ │ |#include | │ │ │ │ │ |#include | │ │ │ │ │ @@ -1650,123 +1650,14 @@ │ │ │ │ │ | } | │ │ │ │ │ | else | │ │ │ │ │ | { | │ │ │ │ │ | flags &= ~flag_ipv6_address; | │ │ │ │ │ | m_addr.v4 = ep.address().to_v4().to_bytes(); | │ │ │ │ │ | } | │ │ │ │ │ |_}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 3|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |unify url_seed and http_seed with just web_seed, using the web_seed_entry. | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_t_o_r_r_e_n_t___h_a_n_d_l_e_._h_p_p_:_5_3_5_ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** uunniiffyy uurrll__sseeeedd aanndd hhttttpp__sseeeedd wwiitthh jjuusstt wweebb__sseeeedd,, uussiinngg tthhee wweebb__sseeeedd__eennttrryy.. ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ttoorrrreenntt__hhaannddllee..hhpppp::553355 ****** | │ │ │ │ │ -|// one returned from ``trackers()`` and will replace it. If you want an | │ │ │ │ │ -| // immediate effect, you have to call force_reannounce(). See | │ │ │ │ │ -| // announce_entry. | │ │ │ │ │ -| // | │ │ │ │ │ -| // ``post_trackers()`` is the asynchronous version of ``trackers()``. It | │ │ │ │ │ -| // will trigger a tracker_list_alert to be posted. | │ │ │ │ │ -| // | │ │ │ │ │ -| // ``add_tracker()`` will look if the specified tracker is already in the | │ │ │ │ │ -| // set. If it is, it doesn't do anything. If it's not in the current set | │ │ │ │ │ -| // of trackers, it will insert it in the tier specified in the | │ │ │ │ │ -| // announce_entry. | │ │ │ │ │ -| // | │ │ │ │ │ -| // The updated set of trackers will be saved in the resume data, and when | │ │ │ │ │ -| // a torrent is started with resume data, the trackers from the resume | │ │ │ │ │ -| // data will replace the original ones. | │ │ │ │ │ -| std::vector trackers() const; | │ │ │ │ │ -| void replace_trackers(std::vector const&) const; | │ │ │ │ │ -| void add_tracker(announce_entry const&) const; | │ │ │ │ │ -| void post_trackers() 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 add_url_seed(std::string const& url) const; | │ │ │ │ │ -| void remove_url_seed(std::string const& url) const; | │ │ │ │ │ -| std::set url_seeds() const; | │ │ │ │ │ -| | │ │ │ │ │ -| // These functions are identical as the ``*_url_seed()`` variants, but | │ │ │ │ │ -| // they operate on `BEP 17`_ web seeds instead of `BEP 19`_. | │ │ │ │ │ -| // | │ │ │ │ │ -| // See http-seeding_ for more information. | │ │ │ │ │ -| void add_http_seed(std::string const& url) const; | │ │ │ │ │ -| void remove_http_seed(std::string const& url) const; | │ │ │ │ │ -| std::set http_seeds() const; | │ │ │ │ │ -| | │ │ │ │ │ -| // add the specified extension to this torrent. The ``ext`` argument is | │ │ │ │ │ -| // a function that will be called from within libtorrent's context | │ │ │ │ │ -| // passing in the internal torrent object and the specified userdata | │ │ │ │ │ -| // pointer. The function is expected to return a shared pointer to | │ │ │ │ │ -| // a torrent_plugin instance. | │ │ │ │ │ -| void add_extension( | │ │ │ │ │ -| std::function(torrent_handle const&, client_data_t)> const& ext | │ │ │ │ │ -|_ _ _ _,_ _c_l_i_e_n_t___d_a_t_a___t_ _u_s_e_r_d_a_t_a_ _=_ _c_l_i_e_n_t___d_a_t_a___t_{_}_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 3|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |dh_key_exchange should probably move into its own file | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_p_e___c_r_y_p_t_o_._h_p_p_:_7_2_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ddhh__kkeeyy__eexxcchhaannggee sshhoouulldd pprroobbaabbllyy mmoovvee iinnttoo iittss oowwnn ffiillee ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ppee__ccrryyppttoo..hhpppp::7722 ****** | │ │ │ │ │ -|#include | │ │ │ │ │ -|#include | │ │ │ │ │ -|#include | │ │ │ │ │ -| | │ │ │ │ │ -|namespace libtorrent { | │ │ │ │ │ -| | │ │ │ │ │ -| namespace mp = boost::multiprecision; | │ │ │ │ │ -| | │ │ │ │ │ -| using key_t = mp::number>; | │ │ │ │ │ -| | │ │ │ │ │ -| TORRENT_EXTRA_EXPORT std::array export_key(key_t const& k); | │ │ │ │ │ -| | │ │ │ │ │ -| // RC4 state from libtomcrypt | │ │ │ │ │ -| struct rc4 { | │ │ │ │ │ -| int x; | │ │ │ │ │ -| int y; | │ │ │ │ │ -| aux::array buf; | │ │ │ │ │ -| }; | │ │ │ │ │ -| | │ │ │ │ │ -|class TORRENT_EXTRA_EXPORT dh_key_exchange | │ │ │ │ │ -|{ | │ │ │ │ │ -| public: | │ │ │ │ │ -| dh_key_exchange(); | │ │ │ │ │ -| | │ │ │ │ │ -| // Get local public key | │ │ │ │ │ -| key_t const& get_local_key() const { return m_dh_local_key; } | │ │ │ │ │ -| | │ │ │ │ │ -| // read remote_pubkey, generate and store shared secret in | │ │ │ │ │ -| // m_dh_shared_secret. | │ │ │ │ │ -| void compute_secret(std::uint8_t const* remote_pubkey); | │ │ │ │ │ -| void compute_secret(key_t const& remote_pubkey); | │ │ │ │ │ -| | │ │ │ │ │ -| key_t const& get_secret() const { return m_dh_shared_secret; } | │ │ │ │ │ -| | │ │ │ │ │ -| sha1_hash const& get_hash_xor_mask() const { return m_xor_mask; } | │ │ │ │ │ -| | │ │ │ │ │ -| private: | │ │ │ │ │ -| | │ │ │ │ │ -| key_t m_dh_local_key; | │ │ │ │ │ -| key_t m_dh_local_secret; | │ │ │ │ │ -| key_t m_dh_shared_secret; | │ │ │ │ │ -| sha1_hash m_xor_mask; | │ │ │ │ │ -| }; | │ │ │ │ │ -| | │ │ │ │ │ -| struct TORRENT_EXTRA_EXPORT encryption_handler | │ │ │ │ │ -| { | │ │ │ │ │ -| std::tuple>> | │ │ │ │ │ -| encrypt(span> iovec); | │ │ │ │ │ -| | │ │ │ │ │ -|_ _ _i_n_t_ _d_e_c_r_y_p_t_(_a_u_x_:_:_c_r_y_p_t_o___r_e_c_e_i_v_e___b_u_f_f_e_r_&_ _r_e_c_v___b_u_f_f_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 3|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |factor out predictive pieces and all operations on it into a separate class (to use as member here instead) | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_t_o_r_r_e_n_t_._h_p_p_:_1_4_2_3_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** ffaaccttoorr oouutt pprreeddiiccttiivvee ppiieecceess aanndd aallll ooppeerraattiioonnss oonn iitt iinnttoo aa sseeppaarraattee ccllaassss ((ttoo uussee aass mmeemmbbeerr hheerree iinnsstteeaadd)) ********** | │ │ │ │ │ |****** ....//iinncclluuddee//lliibbttoorrrreenntt//ttoorrrreenntt..hhpppp::11442233 ****** | │ │ │ │ │ |#endif | │ │ │ │ │ | | │ │ │ │ │ | std::string m_trackerid; | │ │ │ │ │ @@ -1868,14 +1759,64 @@ │ │ │ │ │ | | │ │ │ │ │ | // the number of pieces we completed the check of | │ │ │ │ │ | piece_index_t m_num_checked_pieces{0}; | │ │ │ │ │ | | │ │ │ │ │ | // if the error occurred on a file, this is the index of that file | │ │ │ │ │ | // there are a few special cases, when this is negative. See | │ │ │ │ │ |_ _ _/_/_ _s_e_t___e_r_r_o_r_(_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 3|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |if we make this be a disk_buffer_holder instead we would save a copy use allocate_disk_receive_buffer and | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_w_e_b___p_e_e_r___c_o_n_n_e_c_t_i_o_n_._h_p_p_:_1_1_9_ _ _ _|_r_e_l_e_a_s_e___d_i_s_k___r_e_c_e_i_v_e___b_u_f_f_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iiff wwee mmaakkee tthhiiss bbee aa ddiisskk__bbuuffffeerr__hhoollddeerr iinnsstteeaadd wwee wwoouulldd ssaavvee aa ccooppyy uussee aallllooccaattee__ddiisskk__rreecceeiivvee__bbuuffffeerr aanndd rreelleeaassee__ddiisskk__rreecceeiivvee__bbuuffffeerr ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//wweebb__ppeeeerr__ccoonnnneeccttiioonn..hhpppp::111199 ****** | │ │ │ │ │ +|piece_block_progress downloading_piece_progress() const override; | │ │ │ │ │ +| | │ │ │ │ │ +| void handle_padfile(); | │ │ │ │ │ +| | │ │ │ │ │ +| // this has one entry per http-request | │ │ │ │ │ +| // (might be more than the bt requests) | │ │ │ │ │ +| struct file_request_t | │ │ │ │ │ +| { | │ │ │ │ │ +| file_index_t file_index; | │ │ │ │ │ +| int length; | │ │ │ │ │ +| std::int64_t start; | │ │ │ │ │ +| }; | │ │ │ │ │ +| std::deque m_file_requests; | │ │ │ │ │ +| | │ │ │ │ │ +| std::string m_url; | │ │ │ │ │ +| | │ │ │ │ │ +| web_seed_t* m_web; | │ │ │ │ │ +| | │ │ │ │ │ +| // this is used for intermediate storage of pieces to be delivered to the | │ │ │ │ │ +| // bittorrent engine | │ │ │ │ │ +|aux::vector m_piece; | │ │ │ │ │ +| | │ │ │ │ │ +| // the number of bytes we've forwarded to the incoming_payload() function | │ │ │ │ │ +| // in the current HTTP response. used to know where in the buffer the | │ │ │ │ │ +| // next response starts | │ │ │ │ │ +| int m_received_body; | │ │ │ │ │ +| | │ │ │ │ │ +| // this is the offset inside the current receive | │ │ │ │ │ +| // buffer where the next chunk header will be. | │ │ │ │ │ +| // this is updated for each chunk header that's | │ │ │ │ │ +| // parsed. It does not necessarily point to a valid | │ │ │ │ │ +| // offset in the receive buffer, if we haven't received | │ │ │ │ │ +| // it yet. This offset never includes the HTTP header | │ │ │ │ │ +| int m_chunk_pos; | │ │ │ │ │ +| | │ │ │ │ │ +| // this is the number of bytes we've already received | │ │ │ │ │ +| // from the next chunk header we're waiting for | │ │ │ │ │ +| int m_partial_chunk_header; | │ │ │ │ │ +| | │ │ │ │ │ +| // the number of responses we've received so far on | │ │ │ │ │ +| // this connection | │ │ │ │ │ +| int m_num_responses; | │ │ │ │ │ +| }; | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|_#_e_n_d_i_f_ _/_/_ _T_O_R_R_E_N_T___W_E_B___P_E_E_R___C_O_N_N_E_C_T_I_O_N___H_P_P___I_N_C_L_U_D_E_D_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 3|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |everything but payload counters and rates could probably be removed from here | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_s_t_a_t_._h_p_p_:_2_5_7_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** eevveerryytthhiinngg bbuutt ppaayyllooaadd ccoouunntteerrss aanndd rraatteess ccoouulldd pprroobbaabbllyy bbee rreemmoovveedd ffrroomm hheerree ********** | │ │ │ │ │ |****** ....//iinncclluuddee//lliibbttoorrrreenntt//ssttaatt..hhpppp::225577 ****** | │ │ │ │ │ |// peer_connection is opened and have some previous | │ │ │ │ │ | // transfers from earlier connections. | │ │ │ │ │ | void add_stat(std::int64_t downloaded, std::int64_t uploaded) | │ │ │ │ │ @@ -1921,64 +1862,14 @@ │ │ │ │ │ | | │ │ │ │ │ | stat_channel m_stat[num_channels]; | │ │ │ │ │ | }; | │ │ │ │ │ | | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ |_#_e_n_d_i_f_ _/_/_ _T_O_R_R_E_N_T___S_T_A_T___H_P_P___I_N_C_L_U_D_E_D_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 3|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |if we make this be a disk_buffer_holder instead we would save a copy use allocate_disk_receive_buffer and | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_w_e_b___p_e_e_r___c_o_n_n_e_c_t_i_o_n_._h_p_p_:_1_1_9_ _ _ _|_r_e_l_e_a_s_e___d_i_s_k___r_e_c_e_i_v_e___b_u_f_f_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iiff wwee mmaakkee tthhiiss bbee aa ddiisskk__bbuuffffeerr__hhoollddeerr iinnsstteeaadd wwee wwoouulldd ssaavvee aa ccooppyy uussee aallllooccaattee__ddiisskk__rreecceeiivvee__bbuuffffeerr aanndd rreelleeaassee__ddiisskk__rreecceeiivvee__bbuuffffeerr ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//wweebb__ppeeeerr__ccoonnnneeccttiioonn..hhpppp::111199 ****** | │ │ │ │ │ -|piece_block_progress downloading_piece_progress() const override; | │ │ │ │ │ -| | │ │ │ │ │ -| void handle_padfile(); | │ │ │ │ │ -| | │ │ │ │ │ -| // this has one entry per http-request | │ │ │ │ │ -| // (might be more than the bt requests) | │ │ │ │ │ -| struct file_request_t | │ │ │ │ │ -| { | │ │ │ │ │ -| file_index_t file_index; | │ │ │ │ │ -| int length; | │ │ │ │ │ -| std::int64_t start; | │ │ │ │ │ -| }; | │ │ │ │ │ -| std::deque m_file_requests; | │ │ │ │ │ -| | │ │ │ │ │ -| std::string m_url; | │ │ │ │ │ -| | │ │ │ │ │ -| web_seed_t* m_web; | │ │ │ │ │ -| | │ │ │ │ │ -| // this is used for intermediate storage of pieces to be delivered to the | │ │ │ │ │ -| // bittorrent engine | │ │ │ │ │ -|aux::vector m_piece; | │ │ │ │ │ -| | │ │ │ │ │ -| // the number of bytes we've forwarded to the incoming_payload() function | │ │ │ │ │ -| // in the current HTTP response. used to know where in the buffer the | │ │ │ │ │ -| // next response starts | │ │ │ │ │ -| int m_received_body; | │ │ │ │ │ -| | │ │ │ │ │ -| // this is the offset inside the current receive | │ │ │ │ │ -| // buffer where the next chunk header will be. | │ │ │ │ │ -| // this is updated for each chunk header that's | │ │ │ │ │ -| // parsed. It does not necessarily point to a valid | │ │ │ │ │ -| // offset in the receive buffer, if we haven't received | │ │ │ │ │ -| // it yet. This offset never includes the HTTP header | │ │ │ │ │ -| int m_chunk_pos; | │ │ │ │ │ -| | │ │ │ │ │ -| // this is the number of bytes we've already received | │ │ │ │ │ -| // from the next chunk header we're waiting for | │ │ │ │ │ -| int m_partial_chunk_header; | │ │ │ │ │ -| | │ │ │ │ │ -| // the number of responses we've received so far on | │ │ │ │ │ -| // this connection | │ │ │ │ │ -| int m_num_responses; | │ │ │ │ │ -| }; | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|_#_e_n_d_i_f_ _/_/_ _T_O_R_R_E_N_T___W_E_B___P_E_E_R___C_O_N_N_E_C_T_I_O_N___H_P_P___I_N_C_L_U_D_E_D_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 3|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |use string_view for device_name | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_e_n_u_m___n_e_t_._h_p_p_:_1_6_4_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** uussee ssttrriinngg__vviieeww ffoorr ddeevviiccee__nnaammee ********** | │ │ │ │ │ |****** ....//iinncclluuddee//lliibbttoorrrreenntt//eennuumm__nneett..hhpppp::116644 ****** | │ │ │ │ │ |// return nullopt. | │ │ │ │ │ | TORRENT_EXTRA_EXPORT boost::optional
    get_gateway( | │ │ │ │ │ | ip_interface const& iface, span routes); | │ │ │ │ │ @@ -2026,14 +1917,123 @@ │ │ │ │ │ | // try to use SO_BINDTODEVICE here, if that exists. If it fails, | │ │ │ │ │ | // fall back to the mechanism we have below | │ │ │ │ │ | aux::bind_device(sock, device_name, ec); | │ │ │ │ │ | if (ec) | │ │ │ │ │ |#endif | │ │ │ │ │ | { | │ │ │ │ │ |_ _ _ _e_c_._c_l_e_a_r_(_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 3|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |dh_key_exchange should probably move into its own file | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_p_e___c_r_y_p_t_o_._h_p_p_:_7_2_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ddhh__kkeeyy__eexxcchhaannggee sshhoouulldd pprroobbaabbllyy mmoovvee iinnttoo iittss oowwnn ffiillee ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ppee__ccrryyppttoo..hhpppp::7722 ****** | │ │ │ │ │ +|#include | │ │ │ │ │ +|#include | │ │ │ │ │ +|#include | │ │ │ │ │ +| | │ │ │ │ │ +|namespace libtorrent { | │ │ │ │ │ +| | │ │ │ │ │ +| namespace mp = boost::multiprecision; | │ │ │ │ │ +| | │ │ │ │ │ +| using key_t = mp::number>; | │ │ │ │ │ +| | │ │ │ │ │ +| TORRENT_EXTRA_EXPORT std::array export_key(key_t const& k); | │ │ │ │ │ +| | │ │ │ │ │ +| // RC4 state from libtomcrypt | │ │ │ │ │ +| struct rc4 { | │ │ │ │ │ +| int x; | │ │ │ │ │ +| int y; | │ │ │ │ │ +| aux::array buf; | │ │ │ │ │ +| }; | │ │ │ │ │ +| | │ │ │ │ │ +|class TORRENT_EXTRA_EXPORT dh_key_exchange | │ │ │ │ │ +|{ | │ │ │ │ │ +| public: | │ │ │ │ │ +| dh_key_exchange(); | │ │ │ │ │ +| | │ │ │ │ │ +| // Get local public key | │ │ │ │ │ +| key_t const& get_local_key() const { return m_dh_local_key; } | │ │ │ │ │ +| | │ │ │ │ │ +| // read remote_pubkey, generate and store shared secret in | │ │ │ │ │ +| // m_dh_shared_secret. | │ │ │ │ │ +| void compute_secret(std::uint8_t const* remote_pubkey); | │ │ │ │ │ +| void compute_secret(key_t const& remote_pubkey); | │ │ │ │ │ +| | │ │ │ │ │ +| key_t const& get_secret() const { return m_dh_shared_secret; } | │ │ │ │ │ +| | │ │ │ │ │ +| sha1_hash const& get_hash_xor_mask() const { return m_xor_mask; } | │ │ │ │ │ +| | │ │ │ │ │ +| private: | │ │ │ │ │ +| | │ │ │ │ │ +| key_t m_dh_local_key; | │ │ │ │ │ +| key_t m_dh_local_secret; | │ │ │ │ │ +| key_t m_dh_shared_secret; | │ │ │ │ │ +| sha1_hash m_xor_mask; | │ │ │ │ │ +| }; | │ │ │ │ │ +| | │ │ │ │ │ +| struct TORRENT_EXTRA_EXPORT encryption_handler | │ │ │ │ │ +| { | │ │ │ │ │ +| std::tuple>> | │ │ │ │ │ +| encrypt(span> iovec); | │ │ │ │ │ +| | │ │ │ │ │ +|_ _ _i_n_t_ _d_e_c_r_y_p_t_(_a_u_x_:_:_c_r_y_p_t_o___r_e_c_e_i_v_e___b_u_f_f_e_r_&_ _r_e_c_v___b_u_f_f_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 3|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |unify url_seed and http_seed with just web_seed, using the web_seed_entry. | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_t_o_r_r_e_n_t___h_a_n_d_l_e_._h_p_p_:_5_3_5_ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** uunniiffyy uurrll__sseeeedd aanndd hhttttpp__sseeeedd wwiitthh jjuusstt wweebb__sseeeedd,, uussiinngg tthhee wweebb__sseeeedd__eennttrryy.. ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ttoorrrreenntt__hhaannddllee..hhpppp::553355 ****** | │ │ │ │ │ +|// one returned from ``trackers()`` and will replace it. If you want an | │ │ │ │ │ +| // immediate effect, you have to call force_reannounce(). See | │ │ │ │ │ +| // announce_entry. | │ │ │ │ │ +| // | │ │ │ │ │ +| // ``post_trackers()`` is the asynchronous version of ``trackers()``. It | │ │ │ │ │ +| // will trigger a tracker_list_alert to be posted. | │ │ │ │ │ +| // | │ │ │ │ │ +| // ``add_tracker()`` will look if the specified tracker is already in the | │ │ │ │ │ +| // set. If it is, it doesn't do anything. If it's not in the current set | │ │ │ │ │ +| // of trackers, it will insert it in the tier specified in the | │ │ │ │ │ +| // announce_entry. | │ │ │ │ │ +| // | │ │ │ │ │ +| // The updated set of trackers will be saved in the resume data, and when | │ │ │ │ │ +| // a torrent is started with resume data, the trackers from the resume | │ │ │ │ │ +| // data will replace the original ones. | │ │ │ │ │ +| std::vector trackers() const; | │ │ │ │ │ +| void replace_trackers(std::vector const&) const; | │ │ │ │ │ +| void add_tracker(announce_entry const&) const; | │ │ │ │ │ +| void post_trackers() 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 add_url_seed(std::string const& url) const; | │ │ │ │ │ +| void remove_url_seed(std::string const& url) const; | │ │ │ │ │ +| std::set url_seeds() const; | │ │ │ │ │ +| | │ │ │ │ │ +| // These functions are identical as the ``*_url_seed()`` variants, but | │ │ │ │ │ +| // they operate on `BEP 17`_ web seeds instead of `BEP 19`_. | │ │ │ │ │ +| // | │ │ │ │ │ +| // See http-seeding_ for more information. | │ │ │ │ │ +| void add_http_seed(std::string const& url) const; | │ │ │ │ │ +| void remove_http_seed(std::string const& url) const; | │ │ │ │ │ +| std::set http_seeds() const; | │ │ │ │ │ +| | │ │ │ │ │ +| // add the specified extension to this torrent. The ``ext`` argument is | │ │ │ │ │ +| // a function that will be called from within libtorrent's context | │ │ │ │ │ +| // passing in the internal torrent object and the specified userdata | │ │ │ │ │ +| // pointer. The function is expected to return a shared pointer to | │ │ │ │ │ +| // a torrent_plugin instance. | │ │ │ │ │ +| void add_extension( | │ │ │ │ │ +| std::function(torrent_handle const&, client_data_t)> const& ext | │ │ │ │ │ +|_ _ _ _,_ _c_l_i_e_n_t___d_a_t_a___t_ _u_s_e_r_d_a_t_a_ _=_ _c_l_i_e_n_t___d_a_t_a___t_{_}_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 3|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |to improve memory locality and scanning performance, turn the routing table into a single vector with boundaries for the nodes | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_k_a_d_e_m_l_i_a_/_r_o_u_t_i_n_g___t_a_b_l_e_._h_p_p_:_1_5_3_|_i_n_s_t_e_a_d_._ _P_e_r_h_a_p_s_ _r_e_p_l_a_c_e_m_e_n_t_ _n_o_d_e_s_ _s_h_o_u_l_d_ _b_e_ _i_n_ _a_ _s_e_p_a_r_a_t_e_ _v_e_c_t_o_r_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** ttoo iimmpprroovvee mmeemmoorryy llooccaalliittyy aanndd ssccaannnniinngg ppeerrffoorrmmaannccee,, ttuurrnn tthhee rroouuttiinngg ttaabbllee iinnttoo aa ssiinnggllee vveeccttoorr wwiitthh bboouunnddaarriieess ffoorr tthhee nnooddeess iinnsstteeaadd.. PPeerrhhaappss rreeppllaacceemmeenntt nnooddeess sshhoouulldd | │ │ │ │ │ |bbee iinn aa sseeppaarraattee vveeccttoorr.. ********** | │ │ │ │ │ |****** ....//iinncclluuddee//lliibbttoorrrreenntt//kkaaddeemmlliiaa//rroouuttiinngg__ttaabbllee..hhpppp::115533 ****** | │ │ │ │ │ |// * Nodes are not marked as being stale, they keep a counter | │ │ │ │ │ |// that tells how many times in a row they have failed. When | │ │ │ │ │ @@ -2136,14 +2136,18 @@ │ │ │ │ │ | , move_flags_t flags, storage_error& ec); | │ │ │ │ │ | | │ │ │ │ │ | // deletes the files on fs from save_path according to options. Options may | │ │ │ │ │ | // opt to only delete the partfile | │ │ │ │ │ | TORRENT_EXTRA_EXPORT void | │ │ │ │ │ | delete_files(file_storage const& fs, std::string const& save_path | │ │ │ │ │ |_ _ _,_ _s_t_d_:_:_s_t_r_i_n_g_ _c_o_n_s_t_&_ _p_a_r_t___f_i_l_e___n_a_m_e_,_ _r_e_m_o_v_e___f_l_a_g_s___t_ _o_p_t_i_o_n_s_,_ _s_t_o_r_a_g_e___e_r_r_o_r_&_ _e_c_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 2|_._._/_t_e_s_t_/_t_e_s_t___p_i_e_c_e___p_i_c_k_e_r_._c_p_p_:|test picking with partial pieces and other peers present so that both backup_pieces and backup_pieces2 are used | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_2_8_7_0_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt ppiicckkiinngg wwiitthh ppaarrttiiaall ppiieecceess aanndd ootthheerr ppeeeerrss pprreesseenntt ssoo tthhaatt bbootthh bbaacckkuupp__ppiieecceess aanndd bbaacckkuupp__ppiieecceess22 aarree uusseedd ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ii_ee_cc_ee____pp_ii_cc_kk_ee_rr_.._cc_pp_pp_::_22_88_77_00_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _2_|_._._/_t_e_s_t_/_t_e_s_t___s_t_o_r_a_g_e_._c_p_p_:_7_6_9_ _ _|_s_p_l_i_t_ _t_h_i_s_ _t_e_s_t_ _u_p_ _i_n_t_o_ _s_m_a_l_l_e_r_ _p_a_r_t_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** sspplliitt tthhiiss tteesstt uupp iinnttoo ssmmaalllleerr ppaarrttss ********** | │ │ │ │ │ |****** ....//tteesstt//tteesstt__ssttoorraaggee..ccpppp::776699 ****** | │ │ │ │ │ |io->submit_jobs(); | │ │ │ │ │ | ios.restart(); | │ │ │ │ │ | run_until(ios, done); | │ │ │ │ │ | | │ │ │ │ │ @@ -2298,18 +2302,284 @@ │ │ │ │ │ | bool ret = verify_message(ent, msg_desc, msg_keys, error_string); | │ │ │ │ │ | TEST_CHECK(ret); | │ │ │ │ │ | TEST_CHECK(msg_keys[0]); | │ │ │ │ │ | if (msg_keys[0]) TEST_EQUAL(msg_keys[0].string_value(), "test"); | │ │ │ │ │ | TEST_CHECK(msg_keys[1]); | │ │ │ │ │ | TEST_CHECK(msg_keys[2]); | │ │ │ │ │ |_ _i_f_ _(_m_s_g___k_e_y_s_[_2_]_)_ _T_E_S_T___E_Q_U_A_L_(_m_s_g___k_e_y_s_[_2_]_._s_t_r_i_n_g___v_a_l_u_e_(_)_,_ _"_t_e_s_t_2_"_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 2|_._._/_t_e_s_t_/_t_e_s_t___p_i_e_c_e___p_i_c_k_e_r_._c_p_p_:|test picking with partial pieces and other peers present so that both backup_pieces and backup_pieces2 are used | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_2_8_7_0_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt ppiicckkiinngg wwiitthh ppaarrttiiaall ppiieecceess aanndd ootthheerr ppeeeerrss pprreesseenntt ssoo tthhaatt bbootthh bbaacckkuupp__ppiieecceess aanndd bbaacckkuupp__ppiieecceess22 aarree uusseedd ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ii_ee_cc_ee____pp_ii_cc_kk_ee_rr_.._cc_pp_pp_::_22_88_77_00_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_5_0_4_ _ _ _ _ _ _ _ _|_p_o_s_t_ _a_l_e_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ppoosstt aalleerrtt ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::550044 ****** | │ │ │ │ │ +|if (m_current_gauge_state != no_gauge_state) | │ │ │ │ │ +| inc_stats_counter(m_current_gauge_state + counters::num_checking_torrents, -1); | │ │ │ │ │ +| if (new_gauge_state != no_gauge_state) | │ │ │ │ │ +| inc_stats_counter(new_gauge_state + counters::num_checking_torrents, 1); | │ │ │ │ │ +| | │ │ │ │ │ +| TORRENT_ASSERT(new_gauge_state >= 0); | │ │ │ │ │ +| TORRENT_ASSERT(new_gauge_state <= no_gauge_state); | │ │ │ │ │ +| m_current_gauge_state = static_cast(new_gauge_state); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void torrent::leave_seed_mode(seed_mode_t const checking) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (!m_seed_mode) return; | │ │ │ │ │ +| | │ │ │ │ │ +| if (checking == seed_mode_t::check_files) | │ │ │ │ │ +| { | │ │ │ │ │ +| // this means the user promised we had all the | │ │ │ │ │ +| // files, but it turned out we didn't. This is | │ │ │ │ │ +| // an error. | │ │ │ │ │ +| | │ │ │ │ │ +| | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| debug_log("*** FAILED SEED MODE, rechecking"); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| debug_log("*** LEAVING SEED MODE (%s)" | │ │ │ │ │ +| , checking == seed_mode_t::skip_checking ? "as seed" : "as non-seed"); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| m_seed_mode = false; | │ │ │ │ │ +| // seed is false if we turned out not | │ │ │ │ │ +| // to be a seed after all | │ │ │ │ │ +| if (checking == seed_mode_t::check_files | │ │ │ │ │ +| && state() != torrent_status::checking_resume_data) | │ │ │ │ │ +| { | │ │ │ │ │ +| m_have_all = false; | │ │ │ │ │ +| set_state(torrent_status::downloading); | │ │ │ │ │ +| force_recheck(); | │ │ │ │ │ +| } | │ │ │ │ │ +| m_num_verified = 0; | │ │ │ │ │ +| m_verified.clear(); | │ │ │ │ │ +| m_verifying.clear(); | │ │ │ │ │ +| | │ │ │ │ │ +| set_need_save_resume(torrent_handle::if_state_changed); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void torrent::verified(piece_index_t const piece) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(!m_verified.get_bit(piece)); | │ │ │ │ │ +|_ _ _+_+_m___n_u_m___v_e_r_i_f_i_e_d_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_1_8_5_2_ _ _ _ _ _ _ _|_a_d_d_ _a_ _u_n_i_t_ _t_e_s_t_ _w_h_e_r_e_ _w_e_ _d_o_n_'_t_ _h_a_v_e_ _m_e_t_a_d_a_t_a_,_ _c_o_n_n_e_c_t_ _t_o_ _a_ _p_e_e_r_ _t_h_a_t_ _s_e_n_d_s_ _a_ _b_i_t_f_i_e_l_d_ _t_h_a_t_'_s_ _t_o_o_ _l_a_r_g_e_,_ _t_h_e_n_ _w_e_ _g_e_t_ _t_h_e_ _m_e_t_a_d_a_t_a_ _ _ _ | │ │ │ │ │ +|********** aadddd aa uunniitt tteesstt wwhheerree wwee ddoonn''tt hhaavvee mmeettaaddaattaa,, ccoonnnneecctt ttoo aa ppeeeerr tthhaatt sseennddss aa bbiittffiieelldd tthhaatt''ss ttoooo llaarrggee,, tthheenn wwee ggeett tthhee mmeettaaddaattaa ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::11885522 ****** | │ │ │ │ │ +|for (auto const& f : m_add_torrent_params->renamed_files) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (f.first < file_index_t(0) || f.first >= fs.end_file()) continue; | │ │ │ │ │ +| m_torrent_file->rename_file(file_index_t(f.first), f.second); | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| construct_storage(); | │ │ │ │ │ +| | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_SHARE_MODE | │ │ │ │ │ +| if (m_share_mode && valid_metadata()) | │ │ │ │ │ +| { | │ │ │ │ │ +| // in share mode, all pieces have their priorities initialized to 0 | │ │ │ │ │ +| m_file_priority.clear(); | │ │ │ │ │ +| m_file_priority.resize(m_torrent_file->num_files(), dont_download); | │ │ │ │ │ +| } | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| // it's important to initialize the peers early, because this is what will | │ │ │ │ │ +| // fix up their have-bitmasks to have the correct size | │ │ │ │ │ +|if (!m_connections_initialized) | │ │ │ │ │ +|{ | │ │ │ │ │ +| m_connections_initialized = true; | │ │ │ │ │ +| // all peer connections have to initialize themselves now that the metadata | │ │ │ │ │ +| // is available | │ │ │ │ │ +| // copy the peer list since peers may disconnect and invalidate | │ │ │ │ │ +| // m_connections as we initialize them | │ │ │ │ │ +| for (auto c : m_connections) | │ │ │ │ │ +| { | │ │ │ │ │ +| auto pc = c->self(); | │ │ │ │ │ +| if (pc->is_disconnecting()) continue; | │ │ │ │ │ +| pc->on_metadata_impl(); | │ │ │ │ │ +| if (pc->is_disconnecting()) continue; | │ │ │ │ │ +| pc->init(); | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| // in case file priorities were passed in via the add_torrent_params | │ │ │ │ │ +| // and also in the case of share mode, we need to update the priorities | │ │ │ │ │ +| // this has to be applied before piece priority | │ │ │ │ │ +| if (!m_file_priority.empty()) | │ │ │ │ │ +| { | │ │ │ │ │ +| // m_file_priority was loaded from the resume data, this doesn't | │ │ │ │ │ +| // alter any state that needs to be saved in the resume data | │ │ │ │ │ +| auto const ns = m_need_save_resume_data; | │ │ │ │ │ +| update_piece_priorities(m_file_priority); | │ │ │ │ │ +| m_need_save_resume_data = ns; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| if (m_add_torrent_params) | │ │ │ │ │ +|_ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_4_4_9_2_ _ _ _ _ _ _ _|_u_s_e_ _c_h_r_o_n_o_ _t_y_p_e_ _f_o_r_ _t_i_m_e_ _d_u_r_a_t_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** uussee cchhrroonnoo ttyyppee ffoorr ttiimmee dduurraattiioonn ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::44449922 ****** | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +| m_picker->piece_passed(index); | │ │ │ │ │ +| update_gauge(); | │ │ │ │ │ +| we_have(index); | │ │ │ │ │ +| | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| if (should_log()) | │ │ │ │ │ +| debug_log("we_have(%d) (num_have: %d)", int(index), num_have()); | │ │ │ │ │ +|#endif | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_STREAMING | │ │ │ │ │ +| remove_time_critical_piece(index, true); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_PREDICTIVE_PIECES | │ │ │ │ │ +| // we believe we will complete this piece very soon | │ │ │ │ │ +| // announce it to peers ahead of time to eliminate the | │ │ │ │ │ +| // round-trip times involved in announcing it, requesting it | │ │ │ │ │ +| // and sending it | │ │ │ │ │ +|void torrent::predicted_have_piece(piece_index_t const index, int const milliseconds) | │ │ │ │ │ +|{ | │ │ │ │ │ +| auto const i = std::lower_bound(m_predictive_pieces.begin() | │ │ │ │ │ +| , m_predictive_pieces.end(), index); | │ │ │ │ │ +| if (i != m_predictive_pieces.end() && *i == index) return; | │ │ │ │ │ +| | │ │ │ │ │ +| for (auto p : m_connections) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_INCREMENT(m_iterating_connections); | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| p->peer_log(peer_log_alert::outgoing, "PREDICTIVE_HAVE", "piece: %d expected in %d ms" | │ │ │ │ │ +| , static_cast(index), milliseconds); | │ │ │ │ │ +|#else | │ │ │ │ │ +| TORRENT_UNUSED(milliseconds); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| p->announce_piece(index); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| m_predictive_pieces.insert(i, index); | │ │ │ │ │ +| } | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| // blocks may contain the block indices of the blocks that failed (if this is | │ │ │ │ │ +| // a v2 torrent). | │ │ │ │ │ +| void torrent::piece_failed(piece_index_t const index, std::vector blocks) | │ │ │ │ │ +| { | │ │ │ │ │ +| // if the last piece fails the peer connection will still | │ │ │ │ │ +| // think that it has received all of it until this function | │ │ │ │ │ +| // resets the download queue. So, we cannot do the | │ │ │ │ │ +| // invariant check here since it assumes: | │ │ │ │ │ +|_ _ _/_/_ _(_t_o_t_a_l___d_o_n_e_ _=_=_ _m___t_o_r_r_e_n_t___f_i_l_e_-_>_t_o_t_a_l___s_i_z_e_(_)_)_ _=_>_ _i_s___s_e_e_d_(_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_4_9_1_9_ _ _ _ _ _ _ _|_a_b_o_r_t_ _l_o_o_k_u_p_s_ _t_h_i_s_ _t_o_r_r_e_n_t_ _h_a_s_ _m_a_d_e_ _v_i_a_ _t_h_e_ _s_e_s_s_i_o_n_ _h_o_s_t_ _r_e_s_o_l_v_e_r_ _i_n_t_e_r_f_a_c_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** aabboorrtt llooookkuuppss tthhiiss ttoorrrreenntt hhaass mmaaddee vviiaa tthhee sseessssiioonn hhoosstt rreessoollvveerr iinntteerrffaaccee ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::44991199 ****** | │ │ │ │ │ +|TORRENT_UNUSED(e); | │ │ │ │ │ +| m_storage.reset(); | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| debug_log("Failed to flush disk cache: %s", e.what()); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| // clients may rely on this alert to be posted, so it's probably a | │ │ │ │ │ +| // good idea to post it here, even though we failed | │ │ │ │ │ +| if (alerts().should_post()) | │ │ │ │ │ +| alerts().emplace_alert(get_handle()); | │ │ │ │ │ +| } | │ │ │ │ │ +| m_ses.deferred_submit_jobs(); | │ │ │ │ │ +| } | │ │ │ │ │ +| else | │ │ │ │ │ +| { | │ │ │ │ │ +| if (alerts().should_post()) | │ │ │ │ │ +| alerts().emplace_alert(get_handle()); | │ │ │ │ │ +| alerts().emplace_alert(get_handle() | │ │ │ │ │ +| , info_hash(), get_userdata()); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| | │ │ │ │ │ +|if (!m_apply_ip_filter) | │ │ │ │ │ +| { | │ │ │ │ │ +| inc_stats_counter(counters::non_filter_torrents, -1); | │ │ │ │ │ +| m_apply_ip_filter = true; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| m_paused = false; | │ │ │ │ │ +| m_auto_managed = false; | │ │ │ │ │ +| update_state_list(); | │ │ │ │ │ +| for (torrent_list_index_t i{}; i != m_links.end_index(); ++i) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (!m_links[i].in_list()) continue; | │ │ │ │ │ +| m_links[i].unlink(m_ses.torrent_list(i), i); | │ │ │ │ │ +| } | │ │ │ │ │ +| // don't re-add this torrent to the state-update list | │ │ │ │ │ +| m_state_subscription = false; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| // this is called when we're destructing non-gracefully. i.e. we're _just_ | │ │ │ │ │ +| // destructing everything. | │ │ │ │ │ +| void torrent::panic() | │ │ │ │ │ +| { | │ │ │ │ │ +| m_storage.reset(); | │ │ │ │ │ +| // if there are any other peers allocated still, we need to clear them | │ │ │ │ │ +| // now. They can't be cleared later because the allocator will already | │ │ │ │ │ +| // have been destructed | │ │ │ │ │ +| if (m_peer_list) m_peer_list->clear(); | │ │ │ │ │ +| m_connections.clear(); | │ │ │ │ │ +| m_outgoing_pids.clear(); | │ │ │ │ │ +|_ _ _m___p_e_e_r_s___t_o___d_i_s_c_o_n_n_e_c_t_._c_l_e_a_r_(_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 2|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_8_0_3_2 |if peer is a really good peer, maybe we shouldn't disconnect it perhaps this logic should be disabled if we have too many idle peers| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_(_w_i_t_h_ _s_o_m_e_ _d_e_f_i_n_i_t_i_o_n_ _o_f_ _i_d_l_e_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iiff ppeeeerr iiss aa rreeaallllyy ggoooodd ppeeeerr,, mmaayybbee wwee sshhoouullddnn''tt ddiissccoonnnneecctt iitt ppeerrhhaappss tthhiiss llooggiicc sshhoouulldd bbee ddiissaabblleedd iiff wwee hhaavvee ttoooo mmaannyy iiddllee ppeeeerrss ((wwiitthh ssoommee ddeeffiinniittiioonn ooff iiddllee)) **********| │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::88003322 ****** | │ │ │ │ │ +| m_peers_to_disconnect.reserve(m_connections.size() + 1); | │ │ │ │ │ +| m_connections.reserve(m_connections.size() + 1); | │ │ │ │ │ +| | │ │ │ │ │ +|#if TORRENT_USE_ASSERTS | │ │ │ │ │ +| error_code ec; | │ │ │ │ │ +| TORRENT_ASSERT(p->remote() == p->get_socket().remote_endpoint(ec) || ec); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| TORRENT_ASSERT(p->peer_info_struct() != nullptr); | │ │ │ │ │ +| | │ │ │ │ │ +| // we need to do this after we've added the peer to the peer_list | │ │ │ │ │ +| // since that's when the peer is assigned its peer_info object, | │ │ │ │ │ +| // which holds the rank | │ │ │ │ │ +| if (maybe_replace_peer) | │ │ │ │ │ +| { | │ │ │ │ │ +| // now, find the lowest rank peer and disconnect that | │ │ │ │ │ +| // if it's lower rank than the incoming connection | │ │ │ │ │ +| peer_connection* peer = find_lowest_ranking_peer(); | │ │ │ │ │ +| | │ │ │ │ │ +|if (peer != nullptr && peer->peer_rank() < p->peer_rank()) | │ │ │ │ │ +|{ | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| if (should_log()) | │ │ │ │ │ +| { | │ │ │ │ │ +| debug_log("CLOSING CONNECTION \"%s\" peer list full (low peer rank) " | │ │ │ │ │ +| "connections: %d limit: %d" | │ │ │ │ │ +| , print_endpoint(peer->remote()).c_str() | │ │ │ │ │ +| , num_peers() | │ │ │ │ │ +| , m_max_connections); | │ │ │ │ │ +| } | │ │ │ │ │ +|#endif | │ │ │ │ │ +| peer->disconnect(errors::too_many_connections, operation_t::bittorrent); | │ │ │ │ │ +| p->peer_disconnected_other(); | │ │ │ │ │ +| } | │ │ │ │ │ +| else | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| if (should_log()) | │ │ │ │ │ +| { | │ │ │ │ │ +| debug_log("CLOSING CONNECTION \"%s\" peer list full (low peer rank) " | │ │ │ │ │ +| "connections: %d limit: %d" | │ │ │ │ │ +| , print_endpoint(p->remote()).c_str() | │ │ │ │ │ +| , num_peers() | │ │ │ │ │ +| , m_max_connections); | │ │ │ │ │ +| } | │ │ │ │ │ +|#endif | │ │ │ │ │ +| p->disconnect(errors::too_many_connections, operation_t::bittorrent); | │ │ │ │ │ +| // we have to do this here because from the peer's point of view | │ │ │ │ │ +| // it wasn't really attached to the torrent, but we do need | │ │ │ │ │ +|_ _ _ _ _/_/_ _t_o_ _l_e_t_ _p_e_e_r___l_i_s_t_ _k_n_o_w_ _w_e_'_r_e_ _r_e_m_o_v_i_n_g_ _i_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_u_p_n_p_._c_p_p_:_1_0_6_ _ _ _ _ _ _ _ _ _ _ _|_u_s_e_ _b_o_o_s_t_:_:_a_s_i_o_:_:_i_p_:_:_n_e_t_w_o_r_k_ _i_n_s_t_e_a_d_ _o_f_ _n_e_t_m_a_s_k_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** uussee bboooosstt::::aassiioo::::iipp::::nneettwwoorrkk iinnsstteeaadd ooff nneettmmaasskk ********** | │ │ │ │ │ |****** ....//ssrrcc//uuppnnpp..ccpppp::110066 ****** | │ │ │ │ │ |static error_code ignore_error; | │ │ │ │ │ | | │ │ │ │ │ |upnp::rootdevice::rootdevice() = default; | │ │ │ │ │ | | │ │ │ │ │ @@ -2355,123 +2625,69 @@ │ │ │ │ │ |#if TORRENT_USE_SSL | │ │ │ │ │ | m_ssl_ctx.set_verify_mode(ssl::context::verify_none); | │ │ │ │ │ |#endif | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ |void upnp::start() | │ │ │ │ │ |_{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_b_d_e_c_o_d_e_._c_p_p_:_8_2_6_ _ _ _ _ _ _ _ _|_a_t_t_e_m_p_t_ _t_o_ _s_i_m_p_l_i_f_y_ _t_h_i_s_ _i_m_p_l_e_m_e_n_t_a_t_i_o_n_ _b_y_ _e_m_b_r_a_c_i_n_g_ _t_h_e_ _s_p_a_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** aatttteemmpptt ttoo ssiimmpplliiffyy tthhiiss iimmpplleemmeennttaattiioonn bbyy eemmbbrraacciinngg tthhee ssppaann ********** | │ │ │ │ │ -|****** ....//ssrrcc//bbddeeccooddee..ccpppp::882266 ****** | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -| bdecode_node bdecode(span buffer | │ │ │ │ │ -| , error_code& ec, int* error_pos, int depth_limit, int token_limit) | │ │ │ │ │ -| { | │ │ │ │ │ -| bdecode_node ret; | │ │ │ │ │ -| ec.clear(); | │ │ │ │ │ +|relevance 2|_._._/_s_r_c_/ |support authentication here. tracker_req().auth | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_u_d_p___t_r_a_c_k_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_8_1_ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ssuuppppoorrtt aauutthheennttiiccaattiioonn hheerree.. ttrraacckkeerr__rreeqq(())..aauutthh ********** | │ │ │ │ │ +|****** ....//ssrrcc//uuddpp__ttrraacckkeerr__ccoonnnneeccttiioonn..ccpppp::8811 ****** | │ │ │ │ │ +|udp_tracker_connection::m_connection_cache; | │ │ │ │ │ | | │ │ │ │ │ -| if (buffer.size() > bdecode_token::max_offset) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (error_pos) *error_pos = 0; | │ │ │ │ │ -| ec = bdecode_errors::limit_exceeded; | │ │ │ │ │ -| return ret; | │ │ │ │ │ -| } | │ │ │ │ │ +| std::mutex udp_tracker_connection::m_cache_mutex; | │ │ │ │ │ | | │ │ │ │ │ -| // this is the stack of bdecode_token indices, into m_tokens. | │ │ │ │ │ -| // sp is the stack pointer, as index into the array, stack | │ │ │ │ │ -| int sp = 0; | │ │ │ │ │ -| TORRENT_ALLOCA(stack, stack_frame, depth_limit); | │ │ │ │ │ +| udp_tracker_connection::udp_tracker_connection( | │ │ │ │ │ +| io_context& ios | │ │ │ │ │ +| , tracker_manager& man | │ │ │ │ │ +| , tracker_request const& req | │ │ │ │ │ +| , std::weak_ptr c) | │ │ │ │ │ +| : tracker_connection(man, req, ios, std::move(c)) | │ │ │ │ │ +| , m_transaction_id(0) | │ │ │ │ │ +| , m_attempts(0) | │ │ │ │ │ +| , m_state(action_t::error) | │ │ │ │ │ +| , m_abort(false) | │ │ │ │ │ +| { | │ │ │ │ │ +| update_transaction_id(); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|char const* start = buffer.data(); | │ │ │ │ │ -|char const* end = start + buffer.size(); | │ │ │ │ │ -| char const* const orig_start = start; | │ │ │ │ │ +| void udp_tracker_connection::start() | │ │ │ │ │ +| { | │ │ │ │ │ +|std::string hostname; | │ │ │ │ │ +|std::string protocol; | │ │ │ │ │ +| int port; | │ │ │ │ │ +| error_code ec; | │ │ │ │ │ | | │ │ │ │ │ -| if (start == end) | │ │ │ │ │ -| TORRENT_FAIL_BDECODE(bdecode_errors::unexpected_eof); | │ │ │ │ │ +| std::tie(protocol, std::ignore, hostname, port, std::ignore) | │ │ │ │ │ +| = parse_url_components(tracker_req().url, ec); | │ │ │ │ │ +| if (port == -1) port = protocol == "http" ? 80 : 443; | │ │ │ │ │ | | │ │ │ │ │ -| while (start <= end) | │ │ │ │ │ +| if (ec) | │ │ │ │ │ | { | │ │ │ │ │ -| if (start >= end) TORRENT_FAIL_BDECODE(bdecode_errors::unexpected_eof); | │ │ │ │ │ -| | │ │ │ │ │ -| if (sp >= depth_limit) | │ │ │ │ │ -| TORRENT_FAIL_BDECODE(bdecode_errors::depth_exceeded); | │ │ │ │ │ -| | │ │ │ │ │ -| --token_limit; | │ │ │ │ │ -| if (token_limit < 0) | │ │ │ │ │ -| TORRENT_FAIL_BDECODE(bdecode_errors::limit_exceeded); | │ │ │ │ │ -| | │ │ │ │ │ -| // look for a new token | │ │ │ │ │ -| char const t = *start; | │ │ │ │ │ -| | │ │ │ │ │ -| int const current_frame = sp; | │ │ │ │ │ -| | │ │ │ │ │ -| // if we're currently parsing a dictionary, assert that | │ │ │ │ │ -| // every other node is a string. | │ │ │ │ │ -| if (current_frame > 0 | │ │ │ │ │ -| && ret.m_tokens[stack[current_frame - 1].token].type == bdecode_token::dict) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (stack[current_frame - 1].state == 0) | │ │ │ │ │ -| { | │ │ │ │ │ -|_ _ _ _ _ _/_/_ _t_h_e_ _c_u_r_r_e_n_t_ _p_a_r_e_n_t_ _i_s_ _a_ _d_i_c_t_ _a_n_d_ _w_e_ _a_r_e_ _p_a_r_s_i_n_g_ _a_ _k_e_y_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 2|_._._/_s_r_c_/ |just make this peer not have the pieces associated with the file we just requested. Only when it doesn't have any of the file do the| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_w_e_b___p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_6_2_6_ _ _ _|_f_o_l_l_o_w_i_n_g_ _p_a_d_ _f_i_l_e_s_ _w_i_l_l_ _m_a_k_e_ _i_t_ _c_o_m_p_l_i_c_a_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** jjuusstt mmaakkee tthhiiss ppeeeerr nnoott hhaavvee tthhee ppiieecceess aassssoocciiaatteedd wwiitthh tthhee ffiillee wwee jjuusstt rreeqquueesstteedd.. OOnnllyy wwhheenn iitt ddooeessnn''tt hhaavvee aannyy ooff tthhee ffiillee ddoo tthhee ffoolllloowwiinngg ppaadd ffiilleess wwiillll mmaakkee iitt | │ │ │ │ │ -|ccoommpplliiccaatteedd ********** | │ │ │ │ │ -|****** ....//ssrrcc//wweebb__ppeeeerr__ccoonnnneeccttiioonn..ccpppp::662266 ****** | │ │ │ │ │ -| peer_connection::received_invalid_data(index, single_peer); | │ │ │ │ │ -| | │ │ │ │ │ -| // if we don't think we have any of the files, allow banning the web seed | │ │ │ │ │ -| if (num_have_pieces() == 0) return true; | │ │ │ │ │ -| | │ │ │ │ │ -| // don't disconnect, we won't request anything from this file again | │ │ │ │ │ -| return false; | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|void web_peer_connection::on_receive_padfile() | │ │ │ │ │ -|{ | │ │ │ │ │ -| handle_padfile(); | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|void web_peer_connection::handle_error(int const bytes_left) | │ │ │ │ │ -|{ | │ │ │ │ │ -| std::shared_ptr t = associated_torrent().lock(); | │ │ │ │ │ -| TORRENT_ASSERT(t); | │ │ │ │ │ -| | │ │ │ │ │ +| tracker_connection::fail(ec, operation_t::parse_address); | │ │ │ │ │ +| return; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|// temporarily unavailable, retry later | │ │ │ │ │ -| t->retry_web_seed(this, m_parser.header_duration("retry-after")); | │ │ │ │ │ -| if (t->alerts().should_post()) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::string const error_msg = to_string(m_parser.status_code()).data() | │ │ │ │ │ -| + (" " + m_parser.message()); | │ │ │ │ │ -| t->alerts().emplace_alert(t->get_handle(), m_url | │ │ │ │ │ -| , error_msg); | │ │ │ │ │ -| } | │ │ │ │ │ -| received_bytes(0, bytes_left); | │ │ │ │ │ -| disconnect(error_code(m_parser.status_code(), http_category()), operation_t::bittorrent, failure); | │ │ │ │ │ -|} | │ │ │ │ │ +| aux::session_settings const& settings = m_man.settings(); | │ │ │ │ │ | | │ │ │ │ │ -|void web_peer_connection::disable(error_code const& ec) | │ │ │ │ │ -|{ | │ │ │ │ │ -| // we should not try this server again. | │ │ │ │ │ -| m_web->disabled = true; | │ │ │ │ │ -| disconnect(ec, operation_t::bittorrent, peer_error); | │ │ │ │ │ -| if (m_web->ephemeral) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::shared_ptr t = associated_torrent().lock(); | │ │ │ │ │ -| TORRENT_ASSERT(t); | │ │ │ │ │ -| t->remove_web_seed_conn(this); | │ │ │ │ │ -| } | │ │ │ │ │ -| m_web = nullptr; | │ │ │ │ │ -| TORRENT_ASSERT(is_disconnecting()); | │ │ │ │ │ -|} | │ │ │ │ │ +| int const proxy_type = settings.get_int(settings_pack::proxy_type); | │ │ │ │ │ | | │ │ │ │ │ -|void web_peer_connection::handle_redirect(int const bytes_left) | │ │ │ │ │ -|_{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| if (settings.get_bool(settings_pack::proxy_hostnames) | │ │ │ │ │ +| && (proxy_type == settings_pack::socks5 | │ │ │ │ │ +| || proxy_type == settings_pack::socks5_pw)) | │ │ │ │ │ +| { | │ │ │ │ │ +| m_hostname = hostname; | │ │ │ │ │ +| m_target.port(std::uint16_t(port)); | │ │ │ │ │ +| start_announce(); | │ │ │ │ │ +| } | │ │ │ │ │ +| else | │ │ │ │ │ +| { | │ │ │ │ │ +| using namespace std::placeholders; | │ │ │ │ │ +|_ _ _ _A_D_D___O_U_T_S_T_A_N_D_I_N_G___A_S_Y_N_C_(_"_u_d_p___t_r_a_c_k_e_r___c_o_n_n_e_c_t_i_o_n_:_:_n_a_m_e___l_o_o_k_u_p_"_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_s_e_s_s_i_o_n___i_m_p_l_._c_p_p_:_5_9_9_ _ _ _|_i_s_ _t_h_e_r_e_ _a_ _r_e_a_s_o_n_ _n_o_t_ _t_o_ _m_o_v_e_ _a_l_l_ _o_f_ _t_h_i_s_ _i_n_t_o_ _i_n_i_t_(_)_?_ _a_n_d_ _j_u_s_t_ _p_o_s_t_ _i_t_ _t_o_ _t_h_e_ _i_o___c_o_n_t_e_x_t_?_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** iiss tthheerree aa rreeaassoonn nnoott ttoo mmoovvee aallll ooff tthhiiss iinnttoo iinniitt(())?? aanndd jjuusstt ppoosstt iitt ttoo tthhee iioo__ccoonntteexxtt?? ********** | │ │ │ │ │ |****** ....//ssrrcc//sseessssiioonn__iimmppll..ccpppp::559999 ****** | │ │ │ │ │ |try | │ │ │ │ │ |#endif | │ │ │ │ │ | { | │ │ │ │ │ | (this->*f)(std::forward(a)...); | │ │ │ │ │ @@ -2772,123 +2988,69 @@ │ │ │ │ │ | | │ │ │ │ │ |#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ | if (should_log()) | │ │ │ │ │ | { | │ │ │ │ │ | session_log(">>> SET_DSCP [ udp (%s %d) value: %x e: %s ]" | │ │ │ │ │ | , l->udp_sock->sock.local_endpoint().address().to_string().c_str() | │ │ │ │ │ |_ _ _ _ _ _ _,_ _l_-_>_u_d_p___s_o_c_k_-_>_s_o_c_k_._l_o_c_a_l___p_o_r_t_(_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 2|_._._/_s_r_c_/ |support authentication here. tracker_req().auth | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_u_d_p___t_r_a_c_k_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_8_1_ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ssuuppppoorrtt aauutthheennttiiccaattiioonn hheerree.. ttrraacckkeerr__rreeqq(())..aauutthh ********** | │ │ │ │ │ -|****** ....//ssrrcc//uuddpp__ttrraacckkeerr__ccoonnnneeccttiioonn..ccpppp::8811 ****** | │ │ │ │ │ -|udp_tracker_connection::m_connection_cache; | │ │ │ │ │ -| | │ │ │ │ │ -| std::mutex udp_tracker_connection::m_cache_mutex; | │ │ │ │ │ -| | │ │ │ │ │ -| udp_tracker_connection::udp_tracker_connection( | │ │ │ │ │ -| io_context& ios | │ │ │ │ │ -| , tracker_manager& man | │ │ │ │ │ -| , tracker_request const& req | │ │ │ │ │ -| , std::weak_ptr c) | │ │ │ │ │ -| : tracker_connection(man, req, ios, std::move(c)) | │ │ │ │ │ -| , m_transaction_id(0) | │ │ │ │ │ -| , m_attempts(0) | │ │ │ │ │ -| , m_state(action_t::error) | │ │ │ │ │ -| , m_abort(false) | │ │ │ │ │ -| { | │ │ │ │ │ -| update_transaction_id(); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void udp_tracker_connection::start() | │ │ │ │ │ -| { | │ │ │ │ │ -|std::string hostname; | │ │ │ │ │ -|std::string protocol; | │ │ │ │ │ -| int port; | │ │ │ │ │ -| error_code ec; | │ │ │ │ │ -| | │ │ │ │ │ -| std::tie(protocol, std::ignore, hostname, port, std::ignore) | │ │ │ │ │ -| = parse_url_components(tracker_req().url, ec); | │ │ │ │ │ -| if (port == -1) port = protocol == "http" ? 80 : 443; | │ │ │ │ │ -| | │ │ │ │ │ -| if (ec) | │ │ │ │ │ -| { | │ │ │ │ │ -| tracker_connection::fail(ec, operation_t::parse_address); | │ │ │ │ │ -| return; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| aux::session_settings const& settings = m_man.settings(); | │ │ │ │ │ -| | │ │ │ │ │ -| int const proxy_type = settings.get_int(settings_pack::proxy_type); | │ │ │ │ │ -| | │ │ │ │ │ -| if (settings.get_bool(settings_pack::proxy_hostnames) | │ │ │ │ │ -| && (proxy_type == settings_pack::socks5 | │ │ │ │ │ -| || proxy_type == settings_pack::socks5_pw)) | │ │ │ │ │ -| { | │ │ │ │ │ -| m_hostname = hostname; | │ │ │ │ │ -| m_target.port(std::uint16_t(port)); | │ │ │ │ │ -| start_announce(); | │ │ │ │ │ -| } | │ │ │ │ │ -| else | │ │ │ │ │ -| { | │ │ │ │ │ -| using namespace std::placeholders; | │ │ │ │ │ -|_ _ _ _A_D_D___O_U_T_S_T_A_N_D_I_N_G___A_S_Y_N_C_(_"_u_d_p___t_r_a_c_k_e_r___c_o_n_n_e_c_t_i_o_n_:_:_n_a_m_e___l_o_o_k_u_p_"_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_a_l_e_r_t___m_a_n_a_g_e_r_._c_p_p_:_8_0_ _ _ _|_k_e_e_p_ _a_ _c_o_u_n_t_ _o_f_ _t_h_e_ _n_u_m_b_e_r_ _o_f_ _t_h_r_e_a_d_s_ _w_a_i_t_i_n_g_._ _O_n_l_y_ _i_f_ _i_t_'_s_ _>_ _0_ _n_o_t_i_f_y_ _t_h_e_m_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** kkeeeepp aa ccoouunntt ooff tthhee nnuummbbeerr ooff tthhrreeaaddss wwaaiittiinngg.. OOnnllyy iiff iitt''ss >> 00 nnoottiiffyy tthheemm ********** | │ │ │ │ │ -|****** ....//ssrrcc//aalleerrtt__mmaannaaggeerr..ccpppp::8800 ****** | │ │ │ │ │ -|return m_alerts[m_generation].front(); | │ │ │ │ │ -| | │ │ │ │ │ -| // this call can be interrupted prematurely by other signals | │ │ │ │ │ -| m_condition.wait_for(lock, max_wait); | │ │ │ │ │ -| if (!m_alerts[m_generation].empty()) | │ │ │ │ │ -| return m_alerts[m_generation].front(); | │ │ │ │ │ +|relevance 2|_._._/_s_r_c_/ |just make this peer not have the pieces associated with the file we just requested. Only when it doesn't have any of the file do the| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_w_e_b___p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_6_2_6_ _ _ _|_f_o_l_l_o_w_i_n_g_ _p_a_d_ _f_i_l_e_s_ _w_i_l_l_ _m_a_k_e_ _i_t_ _c_o_m_p_l_i_c_a_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** jjuusstt mmaakkee tthhiiss ppeeeerr nnoott hhaavvee tthhee ppiieecceess aassssoocciiaatteedd wwiitthh tthhee ffiillee wwee jjuusstt rreeqquueesstteedd.. OOnnllyy wwhheenn iitt ddooeessnn''tt hhaavvee aannyy ooff tthhee ffiillee ddoo tthhee ffoolllloowwiinngg ppaadd ffiilleess wwiillll mmaakkee iitt | │ │ │ │ │ +|ccoommpplliiccaatteedd ********** | │ │ │ │ │ +|****** ....//ssrrcc//wweebb__ppeeeerr__ccoonnnneeccttiioonn..ccpppp::662266 ****** | │ │ │ │ │ +| peer_connection::received_invalid_data(index, single_peer); | │ │ │ │ │ | | │ │ │ │ │ -| return nullptr; | │ │ │ │ │ -| } | │ │ │ │ │ +| // if we don't think we have any of the files, allow banning the web seed | │ │ │ │ │ +| if (num_have_pieces() == 0) return true; | │ │ │ │ │ | | │ │ │ │ │ -| void alert_manager::maybe_notify(alert* a) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (m_alerts[m_generation].size() == 1) | │ │ │ │ │ -| { | │ │ │ │ │ -| // we just posted to an empty queue. If anyone is waiting for | │ │ │ │ │ -| // alerts, we need to notify them. Also (potentially) call the | │ │ │ │ │ -| // user supplied m_notify callback to let the client wake up its | │ │ │ │ │ -| // message loop to poll for alerts. | │ │ │ │ │ -| if (m_notify) m_notify(); | │ │ │ │ │ +| // don't disconnect, we won't request anything from this file again | │ │ │ │ │ +| return false; | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -|m_condition.notify_all(); | │ │ │ │ │ +|void web_peer_connection::on_receive_padfile() | │ │ │ │ │ +|{ | │ │ │ │ │ +| handle_padfile(); | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_EXTENSIONS | │ │ │ │ │ -| for (auto& e : m_ses_extensions) | │ │ │ │ │ -| e->on_alert(a); | │ │ │ │ │ -|#else | │ │ │ │ │ -| TORRENT_UNUSED(a); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ +|void web_peer_connection::handle_error(int const bytes_left) | │ │ │ │ │ +|{ | │ │ │ │ │ +| std::shared_ptr t = associated_torrent().lock(); | │ │ │ │ │ +| TORRENT_ASSERT(t); | │ │ │ │ │ | | │ │ │ │ │ -| void alert_manager::set_notify_function(std::function const& fun) | │ │ │ │ │ +| | │ │ │ │ │ +|// temporarily unavailable, retry later | │ │ │ │ │ +| t->retry_web_seed(this, m_parser.header_duration("retry-after")); | │ │ │ │ │ +| if (t->alerts().should_post()) | │ │ │ │ │ | { | │ │ │ │ │ -| std::unique_lock lock(m_mutex); | │ │ │ │ │ -| m_notify = fun; | │ │ │ │ │ -| if (!m_alerts[m_generation].empty()) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (m_notify) m_notify(); | │ │ │ │ │ -| } | │ │ │ │ │ +| std::string const error_msg = to_string(m_parser.status_code()).data() | │ │ │ │ │ +| + (" " + m_parser.message()); | │ │ │ │ │ +| t->alerts().emplace_alert(t->get_handle(), m_url | │ │ │ │ │ +| , error_msg); | │ │ │ │ │ | } | │ │ │ │ │ +| received_bytes(0, bytes_left); | │ │ │ │ │ +| disconnect(error_code(m_parser.status_code(), http_category()), operation_t::bittorrent, failure); | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_EXTENSIONS | │ │ │ │ │ -| void alert_manager::add_extension(std::shared_ptr ext) | │ │ │ │ │ +|void web_peer_connection::disable(error_code const& ec) | │ │ │ │ │ +|{ | │ │ │ │ │ +| // we should not try this server again. | │ │ │ │ │ +| m_web->disabled = true; | │ │ │ │ │ +| disconnect(ec, operation_t::bittorrent, peer_error); | │ │ │ │ │ +| if (m_web->ephemeral) | │ │ │ │ │ | { | │ │ │ │ │ -| m_ses_extensions.push_back(std::move(ext)); | │ │ │ │ │ +| std::shared_ptr t = associated_torrent().lock(); | │ │ │ │ │ +| TORRENT_ASSERT(t); | │ │ │ │ │ +| t->remove_web_seed_conn(this); | │ │ │ │ │ | } | │ │ │ │ │ -|#endif | │ │ │ │ │ +| m_web = nullptr; | │ │ │ │ │ +| TORRENT_ASSERT(is_disconnecting()); | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -| void alert_manager::get_all(std::vector& alerts) | │ │ │ │ │ -| { | │ │ │ │ │ -|_ _ _s_t_d_:_:_l_o_c_k___g_u_a_r_d_<_s_t_d_:_:_r_e_c_u_r_s_i_v_e___m_u_t_e_x_>_ _l_o_c_k_(_m___m_u_t_e_x_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|void web_peer_connection::handle_redirect(int const bytes_left) | │ │ │ │ │ +|_{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 2|_._._/_s_r_c_/ |peer_connection and tracker_connection should probably be flags | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_i_n_s_t_a_n_t_i_a_t_e___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_4_4_ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** ppeeeerr__ccoonnnneeccttiioonn aanndd ttrraacckkeerr__ccoonnnneeccttiioonn sshhoouulldd pprroobbaabbllyy bbee ffllaaggss ********** | │ │ │ │ │ |****** ....//ssrrcc//iinnssttaannttiiaattee__ccoonnnneeccttiioonn..ccpppp::4444 ****** | │ │ │ │ │ |ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE | │ │ │ │ │ |LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | │ │ │ │ │ |CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | │ │ │ │ │ @@ -2936,68 +3098,122 @@ │ │ │ │ │ | s.set_impl(sm->new_utp_socket(&s)); | │ │ │ │ │ | return socket_type(std::move(s)); | │ │ │ │ │ | } | │ │ │ │ │ | } | │ │ │ │ │ |#if TORRENT_USE_I2P | │ │ │ │ │ | else if (ps.type == settings_pack::i2p_proxy) | │ │ │ │ │ |_ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_a_l_e_r_t_._c_p_p_:_2_0_2_1_ _ _ _ _ _ _ _ _ _|_t_h_e_ _s_a_l_t_ _h_e_r_e_ _i_s_ _a_l_l_o_c_a_t_e_d_ _o_n_ _t_h_e_ _h_e_a_p_._ _I_t_ _w_o_u_l_d_ _b_e_ _n_i_c_e_ _t_o_ _a_l_l_o_c_a_t_e_ _i_n_ _t_h_e_ _s_t_a_c_k___a_l_l_o_c_a_t_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhee ssaalltt hheerree iiss aallllooccaatteedd oonn tthhee hheeaapp.. IItt wwoouulldd bbee nniiccee ttoo aallllooccaattee iinn tthhee ssttaacckk__aallllooccaattoorr ********** | │ │ │ │ │ -|****** ....//ssrrcc//aalleerrtt..ccpppp::22002211 ****** | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -| dht_immutable_item_alert::dht_immutable_item_alert(aux::stack_allocator& | │ │ │ │ │ -| , sha1_hash const& t, entry i) | │ │ │ │ │ -| : target(t), item(std::move(i)) | │ │ │ │ │ -| {} | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_p_a_t_h_._c_p_p_:_4_2_9_ _ _ _ _ _ _ _ _ _ _ _|_t_e_s_t_ _t_h_i_s_ _o_n_ _a_ _F_A_T_ _v_o_l_u_m_e_ _t_o_ _s_e_e_ _w_h_a_t_ _e_r_r_o_r_ _w_e_ _g_e_t_!_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt tthhiiss oonn aa FFAATT vvoolluummee ttoo sseeee wwhhaatt eerrrroorr wwee ggeett!! ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppaatthh..ccpppp::442299 ****** | │ │ │ │ │ +|// it's possible CreateHardLink will copy the file internally too, | │ │ │ │ │ +| // if the filesystem does not support it. | │ │ │ │ │ +| ec.assign(GetLastError(), system_category()); | │ │ │ │ │ +| return; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| std::string dht_immutable_item_alert::message() const | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ -| return {}; | │ │ │ │ │ +| // fall back to making a copy | │ │ │ │ │ +|#endif | │ │ │ │ │ |#else | │ │ │ │ │ -| char msg[1050]; | │ │ │ │ │ -| std::snprintf(msg, sizeof(msg), "DHT immutable item %s [ %s ]" | │ │ │ │ │ -| , aux::to_hex(target).c_str() | │ │ │ │ │ -| , item.to_string().c_str()); | │ │ │ │ │ -| return msg; | │ │ │ │ │ +| // assume posix's link() function exists | │ │ │ │ │ +| int ret = ::link(n_exist.c_str(), n_link.c_str()); | │ │ │ │ │ +| | │ │ │ │ │ +| if (ret == 0) | │ │ │ │ │ +| { | │ │ │ │ │ +| ec.clear(); | │ │ │ │ │ +| return; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| // most errors are passed through, except for the ones that indicate that | │ │ │ │ │ +| // hard links are not supported and require a copy. | │ │ │ │ │ +|if (errno != EMLINK | │ │ │ │ │ +|&& errno != EXDEV | │ │ │ │ │ +|#ifdef TORRENT_BEOS | │ │ │ │ │ +| // haiku returns EPERM when the filesystem doesn't support hard link | │ │ │ │ │ +| && errno != EPERM | │ │ │ │ │ |#endif | │ │ │ │ │ -| } | │ │ │ │ │ +| ) | │ │ │ │ │ +| { | │ │ │ │ │ +| // some error happened, report up to the caller | │ │ │ │ │ +| ec.assign(errno, system_category()); | │ │ │ │ │ +| return; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|dht_mutable_item_alert::dht_mutable_item_alert(aux::stack_allocator& | │ │ │ │ │ -|, std::array const& k | │ │ │ │ │ -| , std::array const& sig | │ │ │ │ │ -| , std::int64_t sequence | │ │ │ │ │ -| , string_view s | │ │ │ │ │ -| , entry i | │ │ │ │ │ -| , bool a) | │ │ │ │ │ -| : key(k), signature(sig), seq(sequence), salt(s), item(std::move(i)), authoritative(a) | │ │ │ │ │ -| {} | │ │ │ │ │ +| // fall back to making a copy | │ │ │ │ │ | | │ │ │ │ │ -| std::string dht_mutable_item_alert::message() const | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ -| return {}; | │ │ │ │ │ -|#else | │ │ │ │ │ -| char msg[1050]; | │ │ │ │ │ -| std::snprintf(msg, sizeof(msg), "DHT mutable item (key=%s salt=%s seq=%" PRId64 " %s) [ %s ]" | │ │ │ │ │ -| , aux::to_hex(key).c_str() | │ │ │ │ │ -| , salt.c_str() | │ │ │ │ │ -| , seq | │ │ │ │ │ -| , authoritative ? "auth" : "non-auth" | │ │ │ │ │ -| , item.to_string().c_str()); | │ │ │ │ │ -| return msg; | │ │ │ │ │ |#endif | │ │ │ │ │ +| | │ │ │ │ │ +| // if we get here, we should copy the file | │ │ │ │ │ +| storage_error se; | │ │ │ │ │ +| aux::copy_file(file, link, se); | │ │ │ │ │ +| ec = se.ec; | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| dht_put_alert::dht_put_alert(aux::stack_allocator&, sha1_hash const& t, int n) | │ │ │ │ │ -| : target(t) | │ │ │ │ │ -| , public_key() | │ │ │ │ │ -| , signature() | │ │ │ │ │ -|_ _ _,_ _s_a_l_t_(_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| bool is_directory(std::string const& f, error_code& ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| ec.clear(); | │ │ │ │ │ +| error_code e; | │ │ │ │ │ +| file_status s; | │ │ │ │ │ +| stat_file(f, &s, e); | │ │ │ │ │ +| if (!e && s.mode & file_status::directory) return true; | │ │ │ │ │ +|_ _ _e_c_ _=_ _e_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_b_d_e_c_o_d_e_._c_p_p_:_8_2_6_ _ _ _ _ _ _ _ _|_a_t_t_e_m_p_t_ _t_o_ _s_i_m_p_l_i_f_y_ _t_h_i_s_ _i_m_p_l_e_m_e_n_t_a_t_i_o_n_ _b_y_ _e_m_b_r_a_c_i_n_g_ _t_h_e_ _s_p_a_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** aatttteemmpptt ttoo ssiimmpplliiffyy tthhiiss iimmpplleemmeennttaattiioonn bbyy eemmbbrraacciinngg tthhee ssppaann ********** | │ │ │ │ │ +|****** ....//ssrrcc//bbddeeccooddee..ccpppp::882266 ****** | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +| bdecode_node bdecode(span buffer | │ │ │ │ │ +| , error_code& ec, int* error_pos, int depth_limit, int token_limit) | │ │ │ │ │ +| { | │ │ │ │ │ +| bdecode_node ret; | │ │ │ │ │ +| ec.clear(); | │ │ │ │ │ +| | │ │ │ │ │ +| if (buffer.size() > bdecode_token::max_offset) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (error_pos) *error_pos = 0; | │ │ │ │ │ +| ec = bdecode_errors::limit_exceeded; | │ │ │ │ │ +| return ret; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| // this is the stack of bdecode_token indices, into m_tokens. | │ │ │ │ │ +| // sp is the stack pointer, as index into the array, stack | │ │ │ │ │ +| int sp = 0; | │ │ │ │ │ +| TORRENT_ALLOCA(stack, stack_frame, depth_limit); | │ │ │ │ │ +| | │ │ │ │ │ +|char const* start = buffer.data(); | │ │ │ │ │ +|char const* end = start + buffer.size(); | │ │ │ │ │ +| char const* const orig_start = start; | │ │ │ │ │ +| | │ │ │ │ │ +| if (start == end) | │ │ │ │ │ +| TORRENT_FAIL_BDECODE(bdecode_errors::unexpected_eof); | │ │ │ │ │ +| | │ │ │ │ │ +| while (start <= end) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (start >= end) TORRENT_FAIL_BDECODE(bdecode_errors::unexpected_eof); | │ │ │ │ │ +| | │ │ │ │ │ +| if (sp >= depth_limit) | │ │ │ │ │ +| TORRENT_FAIL_BDECODE(bdecode_errors::depth_exceeded); | │ │ │ │ │ +| | │ │ │ │ │ +| --token_limit; | │ │ │ │ │ +| if (token_limit < 0) | │ │ │ │ │ +| TORRENT_FAIL_BDECODE(bdecode_errors::limit_exceeded); | │ │ │ │ │ +| | │ │ │ │ │ +| // look for a new token | │ │ │ │ │ +| char const t = *start; | │ │ │ │ │ +| | │ │ │ │ │ +| int const current_frame = sp; | │ │ │ │ │ +| | │ │ │ │ │ +| // if we're currently parsing a dictionary, assert that | │ │ │ │ │ +| // every other node is a string. | │ │ │ │ │ +| if (current_frame > 0 | │ │ │ │ │ +| && ret.m_tokens[stack[current_frame - 1].token].type == bdecode_token::dict) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (stack[current_frame - 1].state == 0) | │ │ │ │ │ +| { | │ │ │ │ │ +|_ _ _ _ _ _/_/_ _t_h_e_ _c_u_r_r_e_n_t_ _p_a_r_e_n_t_ _i_s_ _a_ _d_i_c_t_ _a_n_d_ _w_e_ _a_r_e_ _p_a_r_s_i_n_g_ _a_ _k_e_y_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ | | |technically, this is where the transaction of moving the files is completed. This is where the new save_path should be committed. If| │ │ │ │ │ |relevance 2|_._._/_s_r_c_/_s_t_o_r_a_g_e___u_t_i_l_s_._c_p_p_:_2_9_4 |there is an error in the code below, that should not prevent the new save path to be set. Maybe it would make sense to make the | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_s_a_v_e___p_a_t_h_ _a_n_ _i_n_-_o_u_t_ _p_a_r_a_m_e_t_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** tteecchhnniiccaallllyy,, tthhiiss iiss wwhheerree tthhee ttrraannssaaccttiioonn ooff mmoovviinngg tthhee ffiilleess iiss ccoommpplleetteedd.. TThhiiss iiss wwhheerree tthhee nneeww ssaavvee__ppaatthh sshhoouulldd bbee ccoommmmiitttteedd.. IIff tthheerree iiss aann eerrrroorr iinn tthhee ccooddee bbeellooww,,| │ │ │ │ │ |tthhaatt sshhoouulldd nnoott pprreevveenntt tthhee nneeww ssaavvee ppaatthh ttoo bbee sseett.. MMaayybbee iitt wwoouulldd mmaakkee sseennssee ttoo mmaakkee tthhee ssaavvee__ppaatthh aann iinn--oouutt ppaarraammeetteerr ********** | │ │ │ │ │ |****** ....//ssrrcc//ssttoorraaggee__uuttiillss..ccpppp::229944 ****** | │ │ │ │ │ |while (--file_index >= file_index_t(0)) | │ │ │ │ │ @@ -3101,14 +3317,124 @@ │ │ │ │ │ | // files with priority zero may not have been saved to disk at their | │ │ │ │ │ | // expected location, but is likely to be in a partfile. Just exempt it | │ │ │ │ │ | // from checking | │ │ │ │ │ | if (file_index < file_priority.end_index() | │ │ │ │ │ | && file_priority[file_index] == dont_download | │ │ │ │ │ | && !(rd.flags & torrent_flags::seed_mode)) | │ │ │ │ │ |_ _ _ _ _ _c_o_n_t_i_n_u_e_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 2|_._._/_s_r_c_/_p_e_e_r___l_i_s_t_._c_p_p_:_5_3_9 |it would be nice if there was a way to iterate over these torrent_peer objects in the order they are allocated in the pool instead. | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_I_t_ _w_o_u_l_d_ _p_r_o_b_a_b_l_y_ _b_e_ _m_o_r_e_ _e_f_f_i_c_i_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iitt wwoouulldd bbee nniiccee iiff tthheerree wwaass aa wwaayy ttoo iitteerraattee oovveerr tthheessee ttoorrrreenntt__ppeeeerr oobbjjeeccttss iinn tthhee oorrddeerr tthheeyy aarree aallllooccaatteedd iinn tthhee ppooooll iinnsstteeaadd.. IItt wwoouulldd pprroobbaabbllyy bbee mmoorree eeffffiicciieenntt | │ │ │ │ │ +|********** | │ │ │ │ │ +|****** ....//ssrrcc//ppeeeerr__lliisstt..ccpppp::553399 ****** | │ │ │ │ │ +|, int session_time, torrent_state* state) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ +| INVARIANT_CHECK; | │ │ │ │ │ +| | │ │ │ │ │ +| const int candidate_count = 10; | │ │ │ │ │ +| peers.reserve(candidate_count); | │ │ │ │ │ +| | │ │ │ │ │ +| int erase_candidate = -1; | │ │ │ │ │ +| | │ │ │ │ │ +| if (bool(m_finished) != state->is_finished) | │ │ │ │ │ +| recalculate_connect_candidates(state); | │ │ │ │ │ +| | │ │ │ │ │ +| external_ip const& external = state->ip; | │ │ │ │ │ +| int external_port = state->port; | │ │ │ │ │ +| | │ │ │ │ │ +| if (m_round_robin >= int(m_peers.size())) m_round_robin = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| int max_peerlist_size = state->max_peerlist_size; | │ │ │ │ │ +| | │ │ │ │ │ +|for (int iterations = std::min(int(m_peers.size()), 300); | │ │ │ │ │ +|iterations > 0; --iterations) | │ │ │ │ │ +| { | │ │ │ │ │ +| ++state->loop_counter; | │ │ │ │ │ +| | │ │ │ │ │ +| if (m_round_robin >= int(m_peers.size())) m_round_robin = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| torrent_peer& pe = *m_peers[m_round_robin]; | │ │ │ │ │ +| TORRENT_ASSERT(pe.in_use); | │ │ │ │ │ +| int current = m_round_robin; | │ │ │ │ │ +| | │ │ │ │ │ +| // if the number of peers is growing large | │ │ │ │ │ +| // we need to start weeding. | │ │ │ │ │ +| | │ │ │ │ │ +| if (int(m_peers.size()) >= max_peerlist_size * 0.95 | │ │ │ │ │ +| && max_peerlist_size > 0) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (is_erase_candidate(pe) | │ │ │ │ │ +| && (erase_candidate == -1 | │ │ │ │ │ +| || !compare_peer_erase(*m_peers[erase_candidate], pe))) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (should_erase_immediately(pe)) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (erase_candidate > current) --erase_candidate; | │ │ │ │ │ +| erase_peer(m_peers.begin() + current, state); | │ │ │ │ │ +| continue; | │ │ │ │ │ +| } | │ │ │ │ │ +| else | │ │ │ │ │ +| { | │ │ │ │ │ +| erase_candidate = current; | │ │ │ │ │ +|_ _ _ _ _ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_t_r_a_c_k_e_r___m_a_n_a_g_e_r_._c_p_p_:_3_6_9_|_i_m_p_l_e_m_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iimmpplleemmeenntt ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttrraacckkeerr__mmaannaaggeerr..ccpppp::336699 ****** | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| if (m_ses.should_log()) | │ │ │ │ │ +| { | │ │ │ │ │ +| m_ses.session_log("incoming UDP tracker packet from %s has invalid " | │ │ │ │ │ +| "transaction ID (%x)", print_endpoint(ep).c_str() | │ │ │ │ │ +| , transaction); | │ │ │ │ │ +| } | │ │ │ │ │ +|#endif | │ │ │ │ │ +| return false; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| std::shared_ptr const p = i->second; | │ │ │ │ │ +| // on_receive() may remove the tracker connection from the list | │ │ │ │ │ +| return p->on_receive(ep, buf); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void tracker_manager::incoming_error(error_code const& | │ │ │ │ │ +| , udp::endpoint const&) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +| bool tracker_manager::incoming_packet(string_view const hostname | │ │ │ │ │ +| , span const buf) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ +| // ignore packets smaller than 8 bytes | │ │ │ │ │ +| if (buf.size() < 16) return false; | │ │ │ │ │ +| | │ │ │ │ │ +| // the first word is the action, if it's not [0, 3] | │ │ │ │ │ +| // it's not a valid udp tracker response | │ │ │ │ │ +| span ptr = buf; | │ │ │ │ │ +| std::uint32_t const action = aux::read_uint32(ptr); | │ │ │ │ │ +| if (action > 3) return false; | │ │ │ │ │ +| | │ │ │ │ │ +| std::uint32_t const transaction = aux::read_uint32(ptr); | │ │ │ │ │ +| auto const i = m_udp_conns.find(transaction); | │ │ │ │ │ +| | │ │ │ │ │ +| if (i == m_udp_conns.end()) | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| // now, this may not have been meant to be a tracker response, | │ │ │ │ │ +| // but chances are pretty good, so it's probably worth logging | │ │ │ │ │ +| m_ses.session_log("incoming UDP tracker packet from %s has invalid " | │ │ │ │ │ +| "transaction ID (%x)", std::string(hostname).c_str(), int(transaction)); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| return false; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| std::shared_ptr const p = i->second; | │ │ │ │ │ +|_ _ _/_/_ _o_n___r_e_c_e_i_v_e_(_)_ _m_a_y_ _r_e_m_o_v_e_ _t_h_e_ _t_r_a_c_k_e_r_ _c_o_n_n_e_c_t_i_o_n_ _f_r_o_m_ _t_h_e_ _l_i_s_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_e_s_c_a_p_e___s_t_r_i_n_g_._c_p_p_:_1_9_4_ _ _|_t_h_i_s_ _s_h_o_u_l_d_ _p_r_o_b_a_b_l_y_ _b_e_ _m_o_v_e_d_ _i_n_t_o_ _s_t_r_i_n_g___u_t_i_l_._c_p_p_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** tthhiiss sshhoouulldd pprroobbaabbllyy bbee mmoovveedd iinnttoo ssttrriinngg__uuttiill..ccpppp ********** | │ │ │ │ │ |****** ....//ssrrcc//eessccaappee__ssttrriinngg..ccpppp::119944 ****** | │ │ │ │ │ |{ | │ │ │ │ │ | return escape_string_impl(str.data(), int(str.size()), 10); | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ @@ -3155,236 +3481,70 @@ │ │ │ │ │ | if (!need_encoding(path.c_str(), int(path.size()))) | │ │ │ │ │ | return url; | │ │ │ │ │ | | │ │ │ │ │ | std::string msg; | │ │ │ │ │ | std::string escaped_path { escape_path(path) }; | │ │ │ │ │ | // reserve enough space so further append will | │ │ │ │ │ |_ _ _/_/_ _o_n_l_y_ _c_o_p_y_ _v_a_l_u_e_s_ _t_o_ _e_x_i_s_t_i_n_g_ _l_o_c_a_t_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 2|_._._/_s_r_c_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_: |this should probably be based on time instead of number of request messages. For a very high throughput connection, 300 may be a | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_2_5_6_2_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_l_e_g_i_t_i_m_a_t_e_ _n_u_m_b_e_r_ _o_f_ _r_e_q_u_e_s_t_s_ _t_o_ _h_a_v_e_ _i_n_ _f_l_i_g_h_t_ _w_h_e_n_ _g_e_t_t_i_n_g_ _c_h_o_k_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss sshhoouulldd pprroobbaabbllyy bbee bbaasseedd oonn ttiimmee iinnsstteeaadd ooff nnuummbbeerr ooff rreeqquueesstt mmeessssaaggeess.. FFoorr aa vveerryy hhiigghh tthhrroouugghhppuutt ccoonnnneeccttiioonn,, 330000 mmaayy bbee aa lleeggiittiimmaattee nnuummbbeerr ooff rreeqquueessttss ttoo hhaavvee iinn| │ │ │ │ │ -|fflliigghhtt wwhheenn ggeettttiinngg cchhookkeedd ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppeeeerr__ccoonnnneeccttiioonn..ccpppp::22556622 ****** | │ │ │ │ │ -|} | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| write_reject_request(r); | │ │ │ │ │ -| if (m_num_invalid_requests < std::numeric_limits::max()) | │ │ │ │ │ -| ++m_num_invalid_requests; | │ │ │ │ │ -| | │ │ │ │ │ -| if (t->alerts().should_post()) | │ │ │ │ │ -| { | │ │ │ │ │ -| // msvc 12 appears to deduce the rvalue reference template | │ │ │ │ │ -| // incorrectly for bool temporaries. So, create a dummy instance | │ │ │ │ │ -| bool const peer_interested = bool(m_peer_interested); | │ │ │ │ │ -| t->alerts().emplace_alert( | │ │ │ │ │ -| t->get_handle(), m_remote, m_peer_id, r | │ │ │ │ │ -| , t->user_have_piece(r.piece), peer_interested, false); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // every ten invalid request, remind the peer that it's choked | │ │ │ │ │ -| if (!m_peer_interested && m_num_invalid_requests % 10 == 0 && m_choked) | │ │ │ │ │ +| |_._._/_s_r_c_/ | | │ │ │ │ │ +|relevance 2|_h_t_t_p___t_r_a_c_k_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_: |returning a bool here is redundant. Instead this function should return the peer_entry | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_4_7_9_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** rreettuurrnniinngg aa bbooooll hheerree iiss rreedduunnddaanntt.. IInnsstteeaadd tthhiiss ffuunnccttiioonn sshhoouulldd rreettuurrnn tthhee ppeeeerr__eennttrryy ********** | │ │ │ │ │ +|****** ....//ssrrcc//hhttttpp__ttrraacckkeerr__ccoonnnneeccttiioonn..ccpppp::447799 ****** | │ │ │ │ │ +|{ | │ │ │ │ │ +| cb->tracker_scrape_response(tracker_req(), resp.complete | │ │ │ │ │ +| , resp.incomplete, resp.downloaded, resp.downloaders); | │ │ │ │ │ +| } | │ │ │ │ │ +| else | │ │ │ │ │ +| { | │ │ │ │ │ +| std::list
    ip_list; | │ │ │ │ │ +| if (m_tracker_connection) | │ │ │ │ │ | { | │ │ │ │ │ -|if (m_num_invalid_requests > 300 && !m_peer_choked | │ │ │ │ │ -|&& can_disconnect(errors::too_many_requests_when_choked)) | │ │ │ │ │ +| for (auto const& endp : m_tracker_connection->endpoints()) | │ │ │ │ │ | { | │ │ │ │ │ -| disconnect(errors::too_many_requests_when_choked, operation_t::bittorrent, peer_error); | │ │ │ │ │ -| return; | │ │ │ │ │ +| ip_list.push_back(endp.address()); | │ │ │ │ │ | } | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| peer_log(peer_log_alert::outgoing_message, "CHOKE"); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| write_choke(); | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| return; | │ │ │ │ │ +| cb->tracker_response(tracker_req(), m_tracker_ip, ip_list, resp); | │ │ │ │ │ | } | │ │ │ │ │ +| close(); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| // if we have choked the client | │ │ │ │ │ -| // ignore the request | │ │ │ │ │ -| int const blocks_per_piece = | │ │ │ │ │ -| (ti.piece_length() + t->block_size() - 1) / t->block_size(); | │ │ │ │ │ -| | │ │ │ │ │ -| // disconnect peers that downloads more than foo times an allowed | │ │ │ │ │ -| // fast piece | │ │ │ │ │ -| if (m_choked && fast_idx != -1 && m_accept_fast_piece_cnt[fast_idx] >= 3 * blocks_per_piece | │ │ │ │ │ -| && can_disconnect(errors::too_many_requests_when_choked)) | │ │ │ │ │ +|bool extract_peer_info(bdecode_node const& info, peer_entry& ret, error_code& ec) | │ │ │ │ │ +|{ | │ │ │ │ │ +| // extract peer id (if any) | │ │ │ │ │ +| if (info.type() != bdecode_node::dict_t) | │ │ │ │ │ | { | │ │ │ │ │ -| disconnect(errors::too_many_requests_when_choked, operation_t::bittorrent, peer_error); | │ │ │ │ │ -| return; | │ │ │ │ │ +| ec = errors::invalid_peer_dict; | │ │ │ │ │ +| return false; | │ │ │ │ │ | } | │ │ │ │ │ -| | │ │ │ │ │ -| if (m_choked && fast_idx == -1) | │ │ │ │ │ -|_ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| |_._._/_s_r_c_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_: |since we throw away the queue entry once we issue the disk job, this may happen. Instead, we should keep the queue entry around, | │ │ │ │ │ -|relevance 2|_3_3_0_9 |mark it as having been requested from disk and once the disk job comes back, discard it if it has been cancelled. Maybe even be able| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_t_o_ _c_a_n_c_e_l_ _d_i_s_k_ _j_o_b_s_?_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ssiinnccee wwee tthhrrooww aawwaayy tthhee qquueeuuee eennttrryy oonnccee wwee iissssuuee tthhee ddiisskk jjoobb,, tthhiiss mmaayy hhaappppeenn.. IInnsstteeaadd,, wwee sshhoouulldd kkeeeepp tthhee qquueeuuee eennttrryy aarroouunndd,, mmaarrkk iitt aass hhaavviinngg bbeeeenn rreeqquueesstteedd ffrroomm | │ │ │ │ │ -|ddiisskk aanndd oonnccee tthhee ddiisskk jjoobb ccoommeess bbaacckk,, ddiissccaarrdd iitt iiff iitt hhaass bbeeeenn ccaanncceelllleedd.. MMaayybbee eevveenn bbee aabbllee ttoo ccaanncceell ddiisskk jjoobbss?? ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppeeeerr__ccoonnnneeccttiioonn..ccpppp::33330099 ****** | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| peer_log(peer_log_alert::incoming_message, "CANCEL" | │ │ │ │ │ -| , "piece: %d s: %x l: %x", static_cast(r.piece), r.start, r.length); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| auto const i = std::find(m_requests.begin(), m_requests.end(), r); | │ │ │ │ │ -| | │ │ │ │ │ -| if (i != m_requests.end()) | │ │ │ │ │ +| bdecode_node i = info.dict_find_string("peer id"); | │ │ │ │ │ +| if (i && i.string_length() == 20) | │ │ │ │ │ | { | │ │ │ │ │ -| m_counters.inc_stats_counter(counters::cancelled_piece_requests); | │ │ │ │ │ -| m_requests.erase(i); | │ │ │ │ │ -| | │ │ │ │ │ -| if (m_requests.empty()) | │ │ │ │ │ -| m_counters.inc_stats_counter(counters::num_peers_up_requests, -1); | │ │ │ │ │ -| | │ │ │ │ │ -| write_reject_request(r); | │ │ │ │ │ +| std::copy(i.string_ptr(), i.string_ptr() + 20, ret.pid.begin()); | │ │ │ │ │ | } | │ │ │ │ │ | else | │ │ │ │ │ | { | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -|peer_log(peer_log_alert::info, "INVALID_CANCEL", "got cancel not in the queue"); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // ----------------------------- | │ │ │ │ │ -| // --------- DHT PORT ---------- | │ │ │ │ │ -| // ----------------------------- | │ │ │ │ │ -| | │ │ │ │ │ -| void peer_connection::incoming_dht_port(int const listen_port) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -| INVARIANT_CHECK; | │ │ │ │ │ -| | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| peer_log(peer_log_alert::incoming_message, "DHT_PORT", "p: %d", listen_port); | │ │ │ │ │ -|#endif | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_DHT | │ │ │ │ │ -| m_ses.add_dht_node({m_remote.address(), std::uint16_t(listen_port)}); | │ │ │ │ │ -|#else | │ │ │ │ │ -| TORRENT_UNUSED(listen_port); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // ----------------------------- | │ │ │ │ │ -| // --------- HAVE ALL ---------- | │ │ │ │ │ -| // ----------------------------- | │ │ │ │ │ -| | │ │ │ │ │ -| void peer_connection::incoming_have_all() | │ │ │ │ │ -|_ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 2|_._._/_s_r_c_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_: |use a deadline_timer for timeouts. Don't rely on second_tick()! Hook this up to connect timeout as well. This would improve | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_4_9_7_5_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_p_e_r_f_o_r_m_a_n_c_e_ _b_e_c_a_u_s_e_ _o_f_ _l_e_s_s_ _w_o_r_k_ _i_n_ _s_e_c_o_n_d___t_i_c_k_(_)_,_ _a_n_d_ _m_i_g_h_t_ _l_e_t_ _u_s_e_ _r_e_m_o_v_e_ _t_i_c_k_i_n_g_ _e_n_t_i_r_e_l_y_ _e_v_e_n_t_u_a_l_l_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** uussee aa ddeeaaddlliinnee__ttiimmeerr ffoorr ttiimmeeoouuttss.. DDoonn''tt rreellyy oonn sseeccoonndd__ttiicckk(())!! HHooookk tthhiiss uupp ttoo ccoonnnneecctt ttiimmeeoouutt aass wweellll.. TThhiiss wwoouulldd iimmpprroovvee ppeerrffoorrmmaannccee bbeeccaauussee ooff lleessss wwoorrkk iinn | │ │ │ │ │ -|sseeccoonndd__ttiicckk(()),, aanndd mmiigghhtt lleett uussee rreemmoovvee ttiicckkiinngg eennttiirreellyy eevveennttuuaallllyy ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppeeeerr__ccoonnnneeccttiioonn..ccpppp::44997755 ****** | │ │ │ │ │ -|if (d > seconds(connect_timeout) | │ │ │ │ │ -| && can_disconnect(errors::timed_out)) | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| peer_log(peer_log_alert::info, "CONNECT_FAILED", "waited %d seconds" | │ │ │ │ │ -| , int(total_seconds(d))); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| connect_failed(errors::timed_out); | │ │ │ │ │ -| return; | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // if the bw_network flag isn't set, it means we are not even trying to | │ │ │ │ │ -| // read from this peer's socket. Most likely because we're applying a | │ │ │ │ │ -| // rate limit. If the peer is "slow" because we are rate limiting it, | │ │ │ │ │ -| // don't enforce timeouts. However, as soon as we *do* read from the | │ │ │ │ │ -| // socket, we expect to receive data, and not have timed out. Then we | │ │ │ │ │ -| // can enforce the timeouts. | │ │ │ │ │ -| bool const reading_socket = bool(m_channel_state[download_channel] & peer_info::bw_network); | │ │ │ │ │ -| | │ │ │ │ │ -|if (reading_socket && d > seconds(timeout()) && !m_connecting && m_reading_bytes == 0 | │ │ │ │ │ -|&& can_disconnect(errors::timed_out_inactivity)) | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| peer_log(peer_log_alert::info, "LAST_ACTIVITY", "%d seconds ago" | │ │ │ │ │ -| , int(total_seconds(d))); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| disconnect(errors::timed_out_inactivity, operation_t::bittorrent); | │ │ │ │ │ -| return; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // do not stall waiting for a handshake | │ │ │ │ │ -| int timeout = m_settings.get_int (settings_pack::handshake_timeout); | │ │ │ │ │ -|#if TORRENT_USE_I2P | │ │ │ │ │ -| timeout *= is_i2p(m_socket) ? 4 : 1; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| if (reading_socket | │ │ │ │ │ -| && !m_connecting | │ │ │ │ │ -| && in_handshake() | │ │ │ │ │ -| && d > seconds(timeout)) | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| peer_log(peer_log_alert::info, "NO_HANDSHAKE", "waited %d seconds" | │ │ │ │ │ -| , int(total_seconds(d))); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| disconnect(errors::timed_out_no_handshake, operation_t::bittorrent); | │ │ │ │ │ -| return; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // disconnect peers that we unchoked, but they didn't send a request in | │ │ │ │ │ -|_ _ _/_/_ _t_h_e_ _l_a_s_t_ _6_0_ _s_e_c_o_n_d_s_,_ _a_n_d_ _w_e_ _h_a_v_e_n_'_t_ _b_e_e_n_ _w_o_r_k_i_n_g_ _o_n_ _s_e_r_v_i_c_i_n_g_ _a_ _r_e_q_u_e_s_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_t_r_a_c_k_e_r___m_a_n_a_g_e_r_._c_p_p_:_3_6_9_|_i_m_p_l_e_m_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iimmpplleemmeenntt ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttrraacckkeerr__mmaannaaggeerr..ccpppp::336699 ****** | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| if (m_ses.should_log()) | │ │ │ │ │ -| { | │ │ │ │ │ -| m_ses.session_log("incoming UDP tracker packet from %s has invalid " | │ │ │ │ │ -| "transaction ID (%x)", print_endpoint(ep).c_str() | │ │ │ │ │ -| , transaction); | │ │ │ │ │ -| } | │ │ │ │ │ -|#endif | │ │ │ │ │ -| return false; | │ │ │ │ │ +| // if there's no peer_id, just initialize it to a bunch of zeroes | │ │ │ │ │ +| ret.pid.clear(); | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| std::shared_ptr const p = i->second; | │ │ │ │ │ -| // on_receive() may remove the tracker connection from the list | │ │ │ │ │ -| return p->on_receive(ep, buf); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void tracker_manager::incoming_error(error_code const& | │ │ │ │ │ -| , udp::endpoint const&) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -| bool tracker_manager::incoming_packet(string_view const hostname | │ │ │ │ │ -| , span const buf) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -| // ignore packets smaller than 8 bytes | │ │ │ │ │ -| if (buf.size() < 16) return false; | │ │ │ │ │ -| | │ │ │ │ │ -| // the first word is the action, if it's not [0, 3] | │ │ │ │ │ -| // it's not a valid udp tracker response | │ │ │ │ │ -| span ptr = buf; | │ │ │ │ │ -| std::uint32_t const action = aux::read_uint32(ptr); | │ │ │ │ │ -| if (action > 3) return false; | │ │ │ │ │ -| | │ │ │ │ │ -| std::uint32_t const transaction = aux::read_uint32(ptr); | │ │ │ │ │ -| auto const i = m_udp_conns.find(transaction); | │ │ │ │ │ -| | │ │ │ │ │ -| if (i == m_udp_conns.end()) | │ │ │ │ │ +| // extract ip | │ │ │ │ │ +| i = info.dict_find_string("ip"); | │ │ │ │ │ +| if (!i) | │ │ │ │ │ | { | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| // now, this may not have been meant to be a tracker response, | │ │ │ │ │ -| // but chances are pretty good, so it's probably worth logging | │ │ │ │ │ -| m_ses.session_log("incoming UDP tracker packet from %s has invalid " | │ │ │ │ │ -| "transaction ID (%x)", std::string(hostname).c_str(), int(transaction)); | │ │ │ │ │ -|#endif | │ │ │ │ │ +| ec = errors::invalid_tracker_response; | │ │ │ │ │ | return false; | │ │ │ │ │ | } | │ │ │ │ │ +| ret.hostname = i.string_value().to_string(); | │ │ │ │ │ | | │ │ │ │ │ -| std::shared_ptr const p = i->second; | │ │ │ │ │ -|_ _ _/_/_ _o_n___r_e_c_e_i_v_e_(_)_ _m_a_y_ _r_e_m_o_v_e_ _t_h_e_ _t_r_a_c_k_e_r_ _c_o_n_n_e_c_t_i_o_n_ _f_r_o_m_ _t_h_e_ _l_i_s_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| // extract port | │ │ │ │ │ +| i = info.dict_find_int("port"); | │ │ │ │ │ +|_ _ _i_f_ _(_!_i_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_p_i_e_c_e___p_i_c_k_e_r_._c_p_p_:_1_9_9_6_ _ _|_m_a_k_e_ _t_h_e_ _2_0_4_8_ _l_i_m_i_t_ _c_o_n_f_i_g_u_r_a_b_l_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** mmaakkee tthhee 22004488 lliimmiitt ccoonnffiigguurraabbllee ********** | │ │ │ │ │ |****** ....//ssrrcc//ppiieeccee__ppiicckkeerr..ccpppp::11999966 ****** | │ │ │ │ │ |// indicating which path thought the picker we took to arrive at the | │ │ │ │ │ | // returned block picks. | │ │ │ │ │ | picker_flags_t piece_picker::pick_pieces(typed_bitfield const& pieces | │ │ │ │ │ | , std::vector& interesting_blocks, int num_blocks | │ │ │ │ │ @@ -3540,450 +3700,290 @@ │ │ │ │ │ | TORRENT_ASSERT(info.num_peers == 0); | │ │ │ │ │ | | │ │ │ │ │ | TORRENT_ASSERT(i->writing > 0); | │ │ │ │ │ | TORRENT_ASSERT(info.state == block_info::state_writing); | │ │ │ │ │ | | │ │ │ │ │ | if (info.state == block_info::state_finished) return; | │ │ │ │ │ |_ _ _i_f_ _(_i_n_f_o_._s_t_a_t_e_ _=_=_ _b_l_o_c_k___i_n_f_o_:_:_s_t_a_t_e___w_r_i_t_i_n_g_)_ _-_-_i_-_>_w_r_i_t_i_n_g_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_5_0_4_ _ _ _ _ _ _ _ _|_p_o_s_t_ _a_l_e_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ppoosstt aalleerrtt ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::550044 ****** | │ │ │ │ │ -|if (m_current_gauge_state != no_gauge_state) | │ │ │ │ │ -| inc_stats_counter(m_current_gauge_state + counters::num_checking_torrents, -1); | │ │ │ │ │ -| if (new_gauge_state != no_gauge_state) | │ │ │ │ │ -| inc_stats_counter(new_gauge_state + counters::num_checking_torrents, 1); | │ │ │ │ │ -| | │ │ │ │ │ -| TORRENT_ASSERT(new_gauge_state >= 0); | │ │ │ │ │ -| TORRENT_ASSERT(new_gauge_state <= no_gauge_state); | │ │ │ │ │ -| m_current_gauge_state = static_cast(new_gauge_state); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void torrent::leave_seed_mode(seed_mode_t const checking) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (!m_seed_mode) return; | │ │ │ │ │ -| | │ │ │ │ │ -| if (checking == seed_mode_t::check_files) | │ │ │ │ │ -| { | │ │ │ │ │ -| // this means the user promised we had all the | │ │ │ │ │ -| // files, but it turned out we didn't. This is | │ │ │ │ │ -| // an error. | │ │ │ │ │ -| | │ │ │ │ │ -| | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| debug_log("*** FAILED SEED MODE, rechecking"); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| debug_log("*** LEAVING SEED MODE (%s)" | │ │ │ │ │ -| , checking == seed_mode_t::skip_checking ? "as seed" : "as non-seed"); | │ │ │ │ │ +|relevance 2|_._._/_s_r_c_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_: |this should probably be based on time instead of number of request messages. For a very high throughput connection, 300 may be a | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_2_5_6_2_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_l_e_g_i_t_i_m_a_t_e_ _n_u_m_b_e_r_ _o_f_ _r_e_q_u_e_s_t_s_ _t_o_ _h_a_v_e_ _i_n_ _f_l_i_g_h_t_ _w_h_e_n_ _g_e_t_t_i_n_g_ _c_h_o_k_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss sshhoouulldd pprroobbaabbllyy bbee bbaasseedd oonn ttiimmee iinnsstteeaadd ooff nnuummbbeerr ooff rreeqquueesstt mmeessssaaggeess.. FFoorr aa vveerryy hhiigghh tthhrroouugghhppuutt ccoonnnneeccttiioonn,, 330000 mmaayy bbee aa lleeggiittiimmaattee nnuummbbeerr ooff rreeqquueessttss ttoo hhaavvee iinn| │ │ │ │ │ +|fflliigghhtt wwhheenn ggeettttiinngg cchhookkeedd ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppeeeerr__ccoonnnneeccttiioonn..ccpppp::22556622 ****** | │ │ │ │ │ +|} | │ │ │ │ │ |#endif | │ │ │ │ │ -| m_seed_mode = false; | │ │ │ │ │ -| // seed is false if we turned out not | │ │ │ │ │ -| // to be a seed after all | │ │ │ │ │ -| if (checking == seed_mode_t::check_files | │ │ │ │ │ -| && state() != torrent_status::checking_resume_data) | │ │ │ │ │ -| { | │ │ │ │ │ -| m_have_all = false; | │ │ │ │ │ -| set_state(torrent_status::downloading); | │ │ │ │ │ -| force_recheck(); | │ │ │ │ │ -| } | │ │ │ │ │ -| m_num_verified = 0; | │ │ │ │ │ -| m_verified.clear(); | │ │ │ │ │ -| m_verifying.clear(); | │ │ │ │ │ | | │ │ │ │ │ -| set_need_save_resume(torrent_handle::if_state_changed); | │ │ │ │ │ -| } | │ │ │ │ │ +| write_reject_request(r); | │ │ │ │ │ +| if (m_num_invalid_requests < std::numeric_limits::max()) | │ │ │ │ │ +| ++m_num_invalid_requests; | │ │ │ │ │ | | │ │ │ │ │ -| void torrent::verified(piece_index_t const piece) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(!m_verified.get_bit(piece)); | │ │ │ │ │ -|_ _ _+_+_m___n_u_m___v_e_r_i_f_i_e_d_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_1_8_5_2_ _ _ _ _ _ _ _|_a_d_d_ _a_ _u_n_i_t_ _t_e_s_t_ _w_h_e_r_e_ _w_e_ _d_o_n_'_t_ _h_a_v_e_ _m_e_t_a_d_a_t_a_,_ _c_o_n_n_e_c_t_ _t_o_ _a_ _p_e_e_r_ _t_h_a_t_ _s_e_n_d_s_ _a_ _b_i_t_f_i_e_l_d_ _t_h_a_t_'_s_ _t_o_o_ _l_a_r_g_e_,_ _t_h_e_n_ _w_e_ _g_e_t_ _t_h_e_ _m_e_t_a_d_a_t_a_ _ _ _ | │ │ │ │ │ -|********** aadddd aa uunniitt tteesstt wwhheerree wwee ddoonn''tt hhaavvee mmeettaaddaattaa,, ccoonnnneecctt ttoo aa ppeeeerr tthhaatt sseennddss aa bbiittffiieelldd tthhaatt''ss ttoooo llaarrggee,, tthheenn wwee ggeett tthhee mmeettaaddaattaa ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::11885522 ****** | │ │ │ │ │ -|for (auto const& f : m_add_torrent_params->renamed_files) | │ │ │ │ │ +| if (t->alerts().should_post()) | │ │ │ │ │ | { | │ │ │ │ │ -| if (f.first < file_index_t(0) || f.first >= fs.end_file()) continue; | │ │ │ │ │ -| m_torrent_file->rename_file(file_index_t(f.first), f.second); | │ │ │ │ │ +| // msvc 12 appears to deduce the rvalue reference template | │ │ │ │ │ +| // incorrectly for bool temporaries. So, create a dummy instance | │ │ │ │ │ +| bool const peer_interested = bool(m_peer_interested); | │ │ │ │ │ +| t->alerts().emplace_alert( | │ │ │ │ │ +| t->get_handle(), m_remote, m_peer_id, r | │ │ │ │ │ +| , t->user_have_piece(r.piece), peer_interested, false); | │ │ │ │ │ | } | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| construct_storage(); | │ │ │ │ │ | | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_SHARE_MODE | │ │ │ │ │ -| if (m_share_mode && valid_metadata()) | │ │ │ │ │ -| { | │ │ │ │ │ -| // in share mode, all pieces have their priorities initialized to 0 | │ │ │ │ │ -| m_file_priority.clear(); | │ │ │ │ │ -| m_file_priority.resize(m_torrent_file->num_files(), dont_download); | │ │ │ │ │ -| } | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| // it's important to initialize the peers early, because this is what will | │ │ │ │ │ -| // fix up their have-bitmasks to have the correct size | │ │ │ │ │ -|if (!m_connections_initialized) | │ │ │ │ │ -|{ | │ │ │ │ │ -| m_connections_initialized = true; | │ │ │ │ │ -| // all peer connections have to initialize themselves now that the metadata | │ │ │ │ │ -| // is available | │ │ │ │ │ -| // copy the peer list since peers may disconnect and invalidate | │ │ │ │ │ -| // m_connections as we initialize them | │ │ │ │ │ -| for (auto c : m_connections) | │ │ │ │ │ +| // every ten invalid request, remind the peer that it's choked | │ │ │ │ │ +| if (!m_peer_interested && m_num_invalid_requests % 10 == 0 && m_choked) | │ │ │ │ │ | { | │ │ │ │ │ -| auto pc = c->self(); | │ │ │ │ │ -| if (pc->is_disconnecting()) continue; | │ │ │ │ │ -| pc->on_metadata_impl(); | │ │ │ │ │ -| if (pc->is_disconnecting()) continue; | │ │ │ │ │ -| pc->init(); | │ │ │ │ │ +|if (m_num_invalid_requests > 300 && !m_peer_choked | │ │ │ │ │ +|&& can_disconnect(errors::too_many_requests_when_choked)) | │ │ │ │ │ +| { | │ │ │ │ │ +| disconnect(errors::too_many_requests_when_choked, operation_t::bittorrent, peer_error); | │ │ │ │ │ +| return; | │ │ │ │ │ +| } | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| peer_log(peer_log_alert::outgoing_message, "CHOKE"); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| write_choke(); | │ │ │ │ │ | } | │ │ │ │ │ +| | │ │ │ │ │ +| return; | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| // in case file priorities were passed in via the add_torrent_params | │ │ │ │ │ -| // and also in the case of share mode, we need to update the priorities | │ │ │ │ │ -| // this has to be applied before piece priority | │ │ │ │ │ -| if (!m_file_priority.empty()) | │ │ │ │ │ +| // if we have choked the client | │ │ │ │ │ +| // ignore the request | │ │ │ │ │ +| int const blocks_per_piece = | │ │ │ │ │ +| (ti.piece_length() + t->block_size() - 1) / t->block_size(); | │ │ │ │ │ +| | │ │ │ │ │ +| // disconnect peers that downloads more than foo times an allowed | │ │ │ │ │ +| // fast piece | │ │ │ │ │ +| if (m_choked && fast_idx != -1 && m_accept_fast_piece_cnt[fast_idx] >= 3 * blocks_per_piece | │ │ │ │ │ +| && can_disconnect(errors::too_many_requests_when_choked)) | │ │ │ │ │ | { | │ │ │ │ │ -| // m_file_priority was loaded from the resume data, this doesn't | │ │ │ │ │ -| // alter any state that needs to be saved in the resume data | │ │ │ │ │ -| auto const ns = m_need_save_resume_data; | │ │ │ │ │ -| update_piece_priorities(m_file_priority); | │ │ │ │ │ -| m_need_save_resume_data = ns; | │ │ │ │ │ +| disconnect(errors::too_many_requests_when_choked, operation_t::bittorrent, peer_error); | │ │ │ │ │ +| return; | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| if (m_add_torrent_params) | │ │ │ │ │ +| if (m_choked && fast_idx == -1) | │ │ │ │ │ |_ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_4_4_9_2_ _ _ _ _ _ _ _|_u_s_e_ _c_h_r_o_n_o_ _t_y_p_e_ _f_o_r_ _t_i_m_e_ _d_u_r_a_t_i_o_n_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** uussee cchhrroonnoo ttyyppee ffoorr ttiimmee dduurraattiioonn ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::44449922 ****** | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -| m_picker->piece_passed(index); | │ │ │ │ │ -| update_gauge(); | │ │ │ │ │ -| we_have(index); | │ │ │ │ │ -| | │ │ │ │ │ +| |_._._/_s_r_c_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_: |since we throw away the queue entry once we issue the disk job, this may happen. Instead, we should keep the queue entry around, | │ │ │ │ │ +|relevance 2|_3_3_0_9 |mark it as having been requested from disk and once the disk job comes back, discard it if it has been cancelled. Maybe even be able| │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_t_o_ _c_a_n_c_e_l_ _d_i_s_k_ _j_o_b_s_?_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ssiinnccee wwee tthhrrooww aawwaayy tthhee qquueeuuee eennttrryy oonnccee wwee iissssuuee tthhee ddiisskk jjoobb,, tthhiiss mmaayy hhaappppeenn.. IInnsstteeaadd,, wwee sshhoouulldd kkeeeepp tthhee qquueeuuee eennttrryy aarroouunndd,, mmaarrkk iitt aass hhaavviinngg bbeeeenn rreeqquueesstteedd ffrroomm | │ │ │ │ │ +|ddiisskk aanndd oonnccee tthhee ddiisskk jjoobb ccoommeess bbaacckk,, ddiissccaarrdd iitt iiff iitt hhaass bbeeeenn ccaanncceelllleedd.. MMaayybbee eevveenn bbee aabbllee ttoo ccaanncceell ddiisskk jjoobbss?? ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppeeeerr__ccoonnnneeccttiioonn..ccpppp::33330099 ****** | │ │ │ │ │ |#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| if (should_log()) | │ │ │ │ │ -| debug_log("we_have(%d) (num_have: %d)", int(index), num_have()); | │ │ │ │ │ -|#endif | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_STREAMING | │ │ │ │ │ -| remove_time_critical_piece(index, true); | │ │ │ │ │ +| peer_log(peer_log_alert::incoming_message, "CANCEL" | │ │ │ │ │ +| , "piece: %d s: %x l: %x", static_cast(r.piece), r.start, r.length); | │ │ │ │ │ |#endif | │ │ │ │ │ -| } | │ │ │ │ │ | | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_PREDICTIVE_PIECES | │ │ │ │ │ -| // we believe we will complete this piece very soon | │ │ │ │ │ -| // announce it to peers ahead of time to eliminate the | │ │ │ │ │ -| // round-trip times involved in announcing it, requesting it | │ │ │ │ │ -| // and sending it | │ │ │ │ │ -|void torrent::predicted_have_piece(piece_index_t const index, int const milliseconds) | │ │ │ │ │ -|{ | │ │ │ │ │ -| auto const i = std::lower_bound(m_predictive_pieces.begin() | │ │ │ │ │ -| , m_predictive_pieces.end(), index); | │ │ │ │ │ -| if (i != m_predictive_pieces.end() && *i == index) return; | │ │ │ │ │ +| auto const i = std::find(m_requests.begin(), m_requests.end(), r); | │ │ │ │ │ | | │ │ │ │ │ -| for (auto p : m_connections) | │ │ │ │ │ +| if (i != m_requests.end()) | │ │ │ │ │ | { | │ │ │ │ │ -| TORRENT_INCREMENT(m_iterating_connections); | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| p->peer_log(peer_log_alert::outgoing, "PREDICTIVE_HAVE", "piece: %d expected in %d ms" | │ │ │ │ │ -| , static_cast(index), milliseconds); | │ │ │ │ │ -|#else | │ │ │ │ │ -| TORRENT_UNUSED(milliseconds); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| p->announce_piece(index); | │ │ │ │ │ -| } | │ │ │ │ │ +| m_counters.inc_stats_counter(counters::cancelled_piece_requests); | │ │ │ │ │ +| m_requests.erase(i); | │ │ │ │ │ | | │ │ │ │ │ -| m_predictive_pieces.insert(i, index); | │ │ │ │ │ -| } | │ │ │ │ │ -|#endif | │ │ │ │ │ +| if (m_requests.empty()) | │ │ │ │ │ +| m_counters.inc_stats_counter(counters::num_peers_up_requests, -1); | │ │ │ │ │ | | │ │ │ │ │ -| // blocks may contain the block indices of the blocks that failed (if this is | │ │ │ │ │ -| // a v2 torrent). | │ │ │ │ │ -| void torrent::piece_failed(piece_index_t const index, std::vector blocks) | │ │ │ │ │ -| { | │ │ │ │ │ -| // if the last piece fails the peer connection will still | │ │ │ │ │ -| // think that it has received all of it until this function | │ │ │ │ │ -| // resets the download queue. So, we cannot do the | │ │ │ │ │ -| // invariant check here since it assumes: | │ │ │ │ │ -|_ _ _/_/_ _(_t_o_t_a_l___d_o_n_e_ _=_=_ _m___t_o_r_r_e_n_t___f_i_l_e_-_>_t_o_t_a_l___s_i_z_e_(_)_)_ _=_>_ _i_s___s_e_e_d_(_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_4_9_1_9_ _ _ _ _ _ _ _|_a_b_o_r_t_ _l_o_o_k_u_p_s_ _t_h_i_s_ _t_o_r_r_e_n_t_ _h_a_s_ _m_a_d_e_ _v_i_a_ _t_h_e_ _s_e_s_s_i_o_n_ _h_o_s_t_ _r_e_s_o_l_v_e_r_ _i_n_t_e_r_f_a_c_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** aabboorrtt llooookkuuppss tthhiiss ttoorrrreenntt hhaass mmaaddee vviiaa tthhee sseessssiioonn hhoosstt rreessoollvveerr iinntteerrffaaccee ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::44991199 ****** | │ │ │ │ │ -|TORRENT_UNUSED(e); | │ │ │ │ │ -| m_storage.reset(); | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| debug_log("Failed to flush disk cache: %s", e.what()); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| // clients may rely on this alert to be posted, so it's probably a | │ │ │ │ │ -| // good idea to post it here, even though we failed | │ │ │ │ │ -| if (alerts().should_post()) | │ │ │ │ │ -| alerts().emplace_alert(get_handle()); | │ │ │ │ │ -| } | │ │ │ │ │ -| m_ses.deferred_submit_jobs(); | │ │ │ │ │ +| write_reject_request(r); | │ │ │ │ │ | } | │ │ │ │ │ | else | │ │ │ │ │ | { | │ │ │ │ │ -| if (alerts().should_post()) | │ │ │ │ │ -| alerts().emplace_alert(get_handle()); | │ │ │ │ │ -| alerts().emplace_alert(get_handle() | │ │ │ │ │ -| , info_hash(), get_userdata()); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| | │ │ │ │ │ -|if (!m_apply_ip_filter) | │ │ │ │ │ -| { | │ │ │ │ │ -| inc_stats_counter(counters::non_filter_torrents, -1); | │ │ │ │ │ -| m_apply_ip_filter = true; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| m_paused = false; | │ │ │ │ │ -| m_auto_managed = false; | │ │ │ │ │ -| update_state_list(); | │ │ │ │ │ -| for (torrent_list_index_t i{}; i != m_links.end_index(); ++i) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (!m_links[i].in_list()) continue; | │ │ │ │ │ -| m_links[i].unlink(m_ses.torrent_list(i), i); | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +|peer_log(peer_log_alert::info, "INVALID_CANCEL", "got cancel not in the queue"); | │ │ │ │ │ +|#endif | │ │ │ │ │ | } | │ │ │ │ │ -| // don't re-add this torrent to the state-update list | │ │ │ │ │ -| m_state_subscription = false; | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| // this is called when we're destructing non-gracefully. i.e. we're _just_ | │ │ │ │ │ -| // destructing everything. | │ │ │ │ │ -| void torrent::panic() | │ │ │ │ │ +| // ----------------------------- | │ │ │ │ │ +| // --------- DHT PORT ---------- | │ │ │ │ │ +| // ----------------------------- | │ │ │ │ │ +| | │ │ │ │ │ +| void peer_connection::incoming_dht_port(int const listen_port) | │ │ │ │ │ | { | │ │ │ │ │ -| m_storage.reset(); | │ │ │ │ │ -| // if there are any other peers allocated still, we need to clear them | │ │ │ │ │ -| // now. They can't be cleared later because the allocator will already | │ │ │ │ │ -| // have been destructed | │ │ │ │ │ -| if (m_peer_list) m_peer_list->clear(); | │ │ │ │ │ -| m_connections.clear(); | │ │ │ │ │ -| m_outgoing_pids.clear(); | │ │ │ │ │ -|_ _ _m___p_e_e_r_s___t_o___d_i_s_c_o_n_n_e_c_t_._c_l_e_a_r_(_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 2|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_8_0_3_2 |if peer is a really good peer, maybe we shouldn't disconnect it perhaps this logic should be disabled if we have too many idle peers| │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_(_w_i_t_h_ _s_o_m_e_ _d_e_f_i_n_i_t_i_o_n_ _o_f_ _i_d_l_e_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iiff ppeeeerr iiss aa rreeaallllyy ggoooodd ppeeeerr,, mmaayybbee wwee sshhoouullddnn''tt ddiissccoonnnneecctt iitt ppeerrhhaappss tthhiiss llooggiicc sshhoouulldd bbee ddiissaabblleedd iiff wwee hhaavvee ttoooo mmaannyy iiddllee ppeeeerrss ((wwiitthh ssoommee ddeeffiinniittiioonn ooff iiddllee)) **********| │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::88003322 ****** | │ │ │ │ │ -| m_peers_to_disconnect.reserve(m_connections.size() + 1); | │ │ │ │ │ -| m_connections.reserve(m_connections.size() + 1); | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ +| INVARIANT_CHECK; | │ │ │ │ │ | | │ │ │ │ │ -|#if TORRENT_USE_ASSERTS | │ │ │ │ │ -| error_code ec; | │ │ │ │ │ -| TORRENT_ASSERT(p->remote() == p->get_socket().remote_endpoint(ec) || ec); | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| peer_log(peer_log_alert::incoming_message, "DHT_PORT", "p: %d", listen_port); | │ │ │ │ │ |#endif | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_DHT | │ │ │ │ │ +| m_ses.add_dht_node({m_remote.address(), std::uint16_t(listen_port)}); | │ │ │ │ │ +|#else | │ │ │ │ │ +| TORRENT_UNUSED(listen_port); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| TORRENT_ASSERT(p->peer_info_struct() != nullptr); | │ │ │ │ │ -| | │ │ │ │ │ -| // we need to do this after we've added the peer to the peer_list | │ │ │ │ │ -| // since that's when the peer is assigned its peer_info object, | │ │ │ │ │ -| // which holds the rank | │ │ │ │ │ -| if (maybe_replace_peer) | │ │ │ │ │ -| { | │ │ │ │ │ -| // now, find the lowest rank peer and disconnect that | │ │ │ │ │ -| // if it's lower rank than the incoming connection | │ │ │ │ │ -| peer_connection* peer = find_lowest_ranking_peer(); | │ │ │ │ │ +| // ----------------------------- | │ │ │ │ │ +| // --------- HAVE ALL ---------- | │ │ │ │ │ +| // ----------------------------- | │ │ │ │ │ | | │ │ │ │ │ -|if (peer != nullptr && peer->peer_rank() < p->peer_rank()) | │ │ │ │ │ -|{ | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| if (should_log()) | │ │ │ │ │ -| { | │ │ │ │ │ -| debug_log("CLOSING CONNECTION \"%s\" peer list full (low peer rank) " | │ │ │ │ │ -| "connections: %d limit: %d" | │ │ │ │ │ -| , print_endpoint(peer->remote()).c_str() | │ │ │ │ │ -| , num_peers() | │ │ │ │ │ -| , m_max_connections); | │ │ │ │ │ -| } | │ │ │ │ │ -|#endif | │ │ │ │ │ -| peer->disconnect(errors::too_many_connections, operation_t::bittorrent); | │ │ │ │ │ -| p->peer_disconnected_other(); | │ │ │ │ │ -| } | │ │ │ │ │ -| else | │ │ │ │ │ +| void peer_connection::incoming_have_all() | │ │ │ │ │ +|_ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 2|_._._/_s_r_c_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_: |use a deadline_timer for timeouts. Don't rely on second_tick()! Hook this up to connect timeout as well. This would improve | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_4_9_7_5_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_p_e_r_f_o_r_m_a_n_c_e_ _b_e_c_a_u_s_e_ _o_f_ _l_e_s_s_ _w_o_r_k_ _i_n_ _s_e_c_o_n_d___t_i_c_k_(_)_,_ _a_n_d_ _m_i_g_h_t_ _l_e_t_ _u_s_e_ _r_e_m_o_v_e_ _t_i_c_k_i_n_g_ _e_n_t_i_r_e_l_y_ _e_v_e_n_t_u_a_l_l_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** uussee aa ddeeaaddlliinnee__ttiimmeerr ffoorr ttiimmeeoouuttss.. DDoonn''tt rreellyy oonn sseeccoonndd__ttiicckk(())!! HHooookk tthhiiss uupp ttoo ccoonnnneecctt ttiimmeeoouutt aass wweellll.. TThhiiss wwoouulldd iimmpprroovvee ppeerrffoorrmmaannccee bbeeccaauussee ooff lleessss wwoorrkk iinn | │ │ │ │ │ +|sseeccoonndd__ttiicckk(()),, aanndd mmiigghhtt lleett uussee rreemmoovvee ttiicckkiinngg eennttiirreellyy eevveennttuuaallllyy ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppeeeerr__ccoonnnneeccttiioonn..ccpppp::44997755 ****** | │ │ │ │ │ +|if (d > seconds(connect_timeout) | │ │ │ │ │ +| && can_disconnect(errors::timed_out)) | │ │ │ │ │ | { | │ │ │ │ │ |#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| if (should_log()) | │ │ │ │ │ -| { | │ │ │ │ │ -| debug_log("CLOSING CONNECTION \"%s\" peer list full (low peer rank) " | │ │ │ │ │ -| "connections: %d limit: %d" | │ │ │ │ │ -| , print_endpoint(p->remote()).c_str() | │ │ │ │ │ -| , num_peers() | │ │ │ │ │ -| , m_max_connections); | │ │ │ │ │ -| } | │ │ │ │ │ +| peer_log(peer_log_alert::info, "CONNECT_FAILED", "waited %d seconds" | │ │ │ │ │ +| , int(total_seconds(d))); | │ │ │ │ │ |#endif | │ │ │ │ │ -| p->disconnect(errors::too_many_connections, operation_t::bittorrent); | │ │ │ │ │ -| // we have to do this here because from the peer's point of view | │ │ │ │ │ -| // it wasn't really attached to the torrent, but we do need | │ │ │ │ │ -|_ _ _ _ _/_/_ _t_o_ _l_e_t_ _p_e_e_r___l_i_s_t_ _k_n_o_w_ _w_e_'_r_e_ _r_e_m_o_v_i_n_g_ _i_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| |_._._/_s_r_c_/ | | │ │ │ │ │ -|relevance 2|_h_t_t_p___t_r_a_c_k_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_: |returning a bool here is redundant. Instead this function should return the peer_entry | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_4_7_9_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** rreettuurrnniinngg aa bbooooll hheerree iiss rreedduunnddaanntt.. IInnsstteeaadd tthhiiss ffuunnccttiioonn sshhoouulldd rreettuurrnn tthhee ppeeeerr__eennttrryy ********** | │ │ │ │ │ -|****** ....//ssrrcc//hhttttpp__ttrraacckkeerr__ccoonnnneeccttiioonn..ccpppp::447799 ****** | │ │ │ │ │ -|{ | │ │ │ │ │ -| cb->tracker_scrape_response(tracker_req(), resp.complete | │ │ │ │ │ -| , resp.incomplete, resp.downloaded, resp.downloaders); | │ │ │ │ │ -| } | │ │ │ │ │ -| else | │ │ │ │ │ -| { | │ │ │ │ │ -| std::list
    ip_list; | │ │ │ │ │ -| if (m_tracker_connection) | │ │ │ │ │ -| { | │ │ │ │ │ -| for (auto const& endp : m_tracker_connection->endpoints()) | │ │ │ │ │ -| { | │ │ │ │ │ -| ip_list.push_back(endp.address()); | │ │ │ │ │ -| } | │ │ │ │ │ +| connect_failed(errors::timed_out); | │ │ │ │ │ +| return; | │ │ │ │ │ | } | │ │ │ │ │ -| | │ │ │ │ │ -| cb->tracker_response(tracker_req(), m_tracker_ip, ip_list, resp); | │ │ │ │ │ | } | │ │ │ │ │ -| close(); | │ │ │ │ │ -| } | │ │ │ │ │ | | │ │ │ │ │ -|bool extract_peer_info(bdecode_node const& info, peer_entry& ret, error_code& ec) | │ │ │ │ │ -|{ | │ │ │ │ │ -| // extract peer id (if any) | │ │ │ │ │ -| if (info.type() != bdecode_node::dict_t) | │ │ │ │ │ -| { | │ │ │ │ │ -| ec = errors::invalid_peer_dict; | │ │ │ │ │ -| return false; | │ │ │ │ │ -| } | │ │ │ │ │ -| bdecode_node i = info.dict_find_string("peer id"); | │ │ │ │ │ -| if (i && i.string_length() == 20) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::copy(i.string_ptr(), i.string_ptr() + 20, ret.pid.begin()); | │ │ │ │ │ -| } | │ │ │ │ │ -| else | │ │ │ │ │ -| { | │ │ │ │ │ -| // if there's no peer_id, just initialize it to a bunch of zeroes | │ │ │ │ │ -| ret.pid.clear(); | │ │ │ │ │ -| } | │ │ │ │ │ +| // if the bw_network flag isn't set, it means we are not even trying to | │ │ │ │ │ +| // read from this peer's socket. Most likely because we're applying a | │ │ │ │ │ +| // rate limit. If the peer is "slow" because we are rate limiting it, | │ │ │ │ │ +| // don't enforce timeouts. However, as soon as we *do* read from the | │ │ │ │ │ +| // socket, we expect to receive data, and not have timed out. Then we | │ │ │ │ │ +| // can enforce the timeouts. | │ │ │ │ │ +| bool const reading_socket = bool(m_channel_state[download_channel] & peer_info::bw_network); | │ │ │ │ │ | | │ │ │ │ │ -| // extract ip | │ │ │ │ │ -| i = info.dict_find_string("ip"); | │ │ │ │ │ -| if (!i) | │ │ │ │ │ +|if (reading_socket && d > seconds(timeout()) && !m_connecting && m_reading_bytes == 0 | │ │ │ │ │ +|&& can_disconnect(errors::timed_out_inactivity)) | │ │ │ │ │ | { | │ │ │ │ │ -| ec = errors::invalid_tracker_response; | │ │ │ │ │ -| return false; | │ │ │ │ │ -| } | │ │ │ │ │ -| ret.hostname = i.string_value().to_string(); | │ │ │ │ │ -| | │ │ │ │ │ -| // extract port | │ │ │ │ │ -| i = info.dict_find_int("port"); | │ │ │ │ │ -|_ _ _i_f_ _(_!_i_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_p_a_t_h_._c_p_p_:_4_2_9_ _ _ _ _ _ _ _ _ _ _ _|_t_e_s_t_ _t_h_i_s_ _o_n_ _a_ _F_A_T_ _v_o_l_u_m_e_ _t_o_ _s_e_e_ _w_h_a_t_ _e_r_r_o_r_ _w_e_ _g_e_t_!_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt tthhiiss oonn aa FFAATT vvoolluummee ttoo sseeee wwhhaatt eerrrroorr wwee ggeett!! ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppaatthh..ccpppp::442299 ****** | │ │ │ │ │ -|// it's possible CreateHardLink will copy the file internally too, | │ │ │ │ │ -| // if the filesystem does not support it. | │ │ │ │ │ -| ec.assign(GetLastError(), system_category()); | │ │ │ │ │ -| return; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // fall back to making a copy | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| peer_log(peer_log_alert::info, "LAST_ACTIVITY", "%d seconds ago" | │ │ │ │ │ +| , int(total_seconds(d))); | │ │ │ │ │ |#endif | │ │ │ │ │ -|#else | │ │ │ │ │ -| // assume posix's link() function exists | │ │ │ │ │ -| int ret = ::link(n_exist.c_str(), n_link.c_str()); | │ │ │ │ │ -| | │ │ │ │ │ -| if (ret == 0) | │ │ │ │ │ -| { | │ │ │ │ │ -| ec.clear(); | │ │ │ │ │ +| disconnect(errors::timed_out_inactivity, operation_t::bittorrent); | │ │ │ │ │ | return; | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| // most errors are passed through, except for the ones that indicate that | │ │ │ │ │ -| // hard links are not supported and require a copy. | │ │ │ │ │ -|if (errno != EMLINK | │ │ │ │ │ -|&& errno != EXDEV | │ │ │ │ │ -|#ifdef TORRENT_BEOS | │ │ │ │ │ -| // haiku returns EPERM when the filesystem doesn't support hard link | │ │ │ │ │ -| && errno != EPERM | │ │ │ │ │ +| // do not stall waiting for a handshake | │ │ │ │ │ +| int timeout = m_settings.get_int (settings_pack::handshake_timeout); | │ │ │ │ │ +|#if TORRENT_USE_I2P | │ │ │ │ │ +| timeout *= is_i2p(m_socket) ? 4 : 1; | │ │ │ │ │ |#endif | │ │ │ │ │ -| ) | │ │ │ │ │ +| if (reading_socket | │ │ │ │ │ +| && !m_connecting | │ │ │ │ │ +| && in_handshake() | │ │ │ │ │ +| && d > seconds(timeout)) | │ │ │ │ │ | { | │ │ │ │ │ -| // some error happened, report up to the caller | │ │ │ │ │ -| ec.assign(errno, system_category()); | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| peer_log(peer_log_alert::info, "NO_HANDSHAKE", "waited %d seconds" | │ │ │ │ │ +| , int(total_seconds(d))); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| disconnect(errors::timed_out_no_handshake, operation_t::bittorrent); | │ │ │ │ │ | return; | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| // fall back to making a copy | │ │ │ │ │ +| // disconnect peers that we unchoked, but they didn't send a request in | │ │ │ │ │ +|_ _ _/_/_ _t_h_e_ _l_a_s_t_ _6_0_ _s_e_c_o_n_d_s_,_ _a_n_d_ _w_e_ _h_a_v_e_n_'_t_ _b_e_e_n_ _w_o_r_k_i_n_g_ _o_n_ _s_e_r_v_i_c_i_n_g_ _a_ _r_e_q_u_e_s_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_a_l_e_r_t___m_a_n_a_g_e_r_._c_p_p_:_8_0_ _ _ _|_k_e_e_p_ _a_ _c_o_u_n_t_ _o_f_ _t_h_e_ _n_u_m_b_e_r_ _o_f_ _t_h_r_e_a_d_s_ _w_a_i_t_i_n_g_._ _O_n_l_y_ _i_f_ _i_t_'_s_ _>_ _0_ _n_o_t_i_f_y_ _t_h_e_m_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** kkeeeepp aa ccoouunntt ooff tthhee nnuummbbeerr ooff tthhrreeaaddss wwaaiittiinngg.. OOnnllyy iiff iitt''ss >> 00 nnoottiiffyy tthheemm ********** | │ │ │ │ │ +|****** ....//ssrrcc//aalleerrtt__mmaannaaggeerr..ccpppp::8800 ****** | │ │ │ │ │ +|return m_alerts[m_generation].front(); | │ │ │ │ │ | | │ │ │ │ │ -|#endif | │ │ │ │ │ +| // this call can be interrupted prematurely by other signals | │ │ │ │ │ +| m_condition.wait_for(lock, max_wait); | │ │ │ │ │ +| if (!m_alerts[m_generation].empty()) | │ │ │ │ │ +| return m_alerts[m_generation].front(); | │ │ │ │ │ | | │ │ │ │ │ -| // if we get here, we should copy the file | │ │ │ │ │ -| storage_error se; | │ │ │ │ │ -| aux::copy_file(file, link, se); | │ │ │ │ │ -| ec = se.ec; | │ │ │ │ │ +| return nullptr; | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| bool is_directory(std::string const& f, error_code& ec) | │ │ │ │ │ -| { | │ │ │ │ │ -| ec.clear(); | │ │ │ │ │ -| error_code e; | │ │ │ │ │ -| file_status s; | │ │ │ │ │ -| stat_file(f, &s, e); | │ │ │ │ │ -| if (!e && s.mode & file_status::directory) return true; | │ │ │ │ │ -|_ _ _e_c_ _=_ _e_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 2|_._._/_s_r_c_/_p_e_e_r___l_i_s_t_._c_p_p_:_5_3_9 |it would be nice if there was a way to iterate over these torrent_peer objects in the order they are allocated in the pool instead. | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_I_t_ _w_o_u_l_d_ _p_r_o_b_a_b_l_y_ _b_e_ _m_o_r_e_ _e_f_f_i_c_i_e_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iitt wwoouulldd bbee nniiccee iiff tthheerree wwaass aa wwaayy ttoo iitteerraattee oovveerr tthheessee ttoorrrreenntt__ppeeeerr oobbjjeeccttss iinn tthhee oorrddeerr tthheeyy aarree aallllooccaatteedd iinn tthhee ppooooll iinnsstteeaadd.. IItt wwoouulldd pprroobbaabbllyy bbee mmoorree eeffffiicciieenntt | │ │ │ │ │ -|********** | │ │ │ │ │ -|****** ....//ssrrcc//ppeeeerr__lliisstt..ccpppp::553399 ****** | │ │ │ │ │ -|, int session_time, torrent_state* state) | │ │ │ │ │ +| void alert_manager::maybe_notify(alert* a) | │ │ │ │ │ | { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -| INVARIANT_CHECK; | │ │ │ │ │ -| | │ │ │ │ │ -| const int candidate_count = 10; | │ │ │ │ │ -| peers.reserve(candidate_count); | │ │ │ │ │ +| if (m_alerts[m_generation].size() == 1) | │ │ │ │ │ +| { | │ │ │ │ │ +| // we just posted to an empty queue. If anyone is waiting for | │ │ │ │ │ +| // alerts, we need to notify them. Also (potentially) call the | │ │ │ │ │ +| // user supplied m_notify callback to let the client wake up its | │ │ │ │ │ +| // message loop to poll for alerts. | │ │ │ │ │ +| if (m_notify) m_notify(); | │ │ │ │ │ | | │ │ │ │ │ -| int erase_candidate = -1; | │ │ │ │ │ +|m_condition.notify_all(); | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -| if (bool(m_finished) != state->is_finished) | │ │ │ │ │ -| recalculate_connect_candidates(state); | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_EXTENSIONS | │ │ │ │ │ +| for (auto& e : m_ses_extensions) | │ │ │ │ │ +| e->on_alert(a); | │ │ │ │ │ +|#else | │ │ │ │ │ +| TORRENT_UNUSED(a); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| external_ip const& external = state->ip; | │ │ │ │ │ -| int external_port = state->port; | │ │ │ │ │ +| void alert_manager::set_notify_function(std::function const& fun) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::unique_lock lock(m_mutex); | │ │ │ │ │ +| m_notify = fun; | │ │ │ │ │ +| if (!m_alerts[m_generation].empty()) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (m_notify) m_notify(); | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| if (m_round_robin >= int(m_peers.size())) m_round_robin = 0; | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_EXTENSIONS | │ │ │ │ │ +| void alert_manager::add_extension(std::shared_ptr ext) | │ │ │ │ │ +| { | │ │ │ │ │ +| m_ses_extensions.push_back(std::move(ext)); | │ │ │ │ │ +| } | │ │ │ │ │ +|#endif | │ │ │ │ │ | | │ │ │ │ │ -| int max_peerlist_size = state->max_peerlist_size; | │ │ │ │ │ +| void alert_manager::get_all(std::vector& alerts) | │ │ │ │ │ +| { | │ │ │ │ │ +|_ _ _s_t_d_:_:_l_o_c_k___g_u_a_r_d_<_s_t_d_:_:_r_e_c_u_r_s_i_v_e___m_u_t_e_x_>_ _l_o_c_k_(_m___m_u_t_e_x_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_a_l_e_r_t_._c_p_p_:_2_0_2_1_ _ _ _ _ _ _ _ _ _|_t_h_e_ _s_a_l_t_ _h_e_r_e_ _i_s_ _a_l_l_o_c_a_t_e_d_ _o_n_ _t_h_e_ _h_e_a_p_._ _I_t_ _w_o_u_l_d_ _b_e_ _n_i_c_e_ _t_o_ _a_l_l_o_c_a_t_e_ _i_n_ _t_h_e_ _s_t_a_c_k___a_l_l_o_c_a_t_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhee ssaalltt hheerree iiss aallllooccaatteedd oonn tthhee hheeaapp.. IItt wwoouulldd bbee nniiccee ttoo aallllooccaattee iinn tthhee ssttaacckk__aallllooccaattoorr ********** | │ │ │ │ │ +|****** ....//ssrrcc//aalleerrtt..ccpppp::22002211 ****** | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -|for (int iterations = std::min(int(m_peers.size()), 300); | │ │ │ │ │ -|iterations > 0; --iterations) | │ │ │ │ │ -| { | │ │ │ │ │ -| ++state->loop_counter; | │ │ │ │ │ +| dht_immutable_item_alert::dht_immutable_item_alert(aux::stack_allocator& | │ │ │ │ │ +| , sha1_hash const& t, entry i) | │ │ │ │ │ +| : target(t), item(std::move(i)) | │ │ │ │ │ +| {} | │ │ │ │ │ | | │ │ │ │ │ -| if (m_round_robin >= int(m_peers.size())) m_round_robin = 0; | │ │ │ │ │ +| std::string dht_immutable_item_alert::message() const | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ +| return {}; | │ │ │ │ │ +|#else | │ │ │ │ │ +| char msg[1050]; | │ │ │ │ │ +| std::snprintf(msg, sizeof(msg), "DHT immutable item %s [ %s ]" | │ │ │ │ │ +| , aux::to_hex(target).c_str() | │ │ │ │ │ +| , item.to_string().c_str()); | │ │ │ │ │ +| return msg; | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| torrent_peer& pe = *m_peers[m_round_robin]; | │ │ │ │ │ -| TORRENT_ASSERT(pe.in_use); | │ │ │ │ │ -| int current = m_round_robin; | │ │ │ │ │ +|dht_mutable_item_alert::dht_mutable_item_alert(aux::stack_allocator& | │ │ │ │ │ +|, std::array const& k | │ │ │ │ │ +| , std::array const& sig | │ │ │ │ │ +| , std::int64_t sequence | │ │ │ │ │ +| , string_view s | │ │ │ │ │ +| , entry i | │ │ │ │ │ +| , bool a) | │ │ │ │ │ +| : key(k), signature(sig), seq(sequence), salt(s), item(std::move(i)), authoritative(a) | │ │ │ │ │ +| {} | │ │ │ │ │ | | │ │ │ │ │ -| // if the number of peers is growing large | │ │ │ │ │ -| // we need to start weeding. | │ │ │ │ │ +| std::string dht_mutable_item_alert::message() const | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ +| return {}; | │ │ │ │ │ +|#else | │ │ │ │ │ +| char msg[1050]; | │ │ │ │ │ +| std::snprintf(msg, sizeof(msg), "DHT mutable item (key=%s salt=%s seq=%" PRId64 " %s) [ %s ]" | │ │ │ │ │ +| , aux::to_hex(key).c_str() | │ │ │ │ │ +| , salt.c_str() | │ │ │ │ │ +| , seq | │ │ │ │ │ +| , authoritative ? "auth" : "non-auth" | │ │ │ │ │ +| , item.to_string().c_str()); | │ │ │ │ │ +| return msg; | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| if (int(m_peers.size()) >= max_peerlist_size * 0.95 | │ │ │ │ │ -| && max_peerlist_size > 0) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (is_erase_candidate(pe) | │ │ │ │ │ -| && (erase_candidate == -1 | │ │ │ │ │ -| || !compare_peer_erase(*m_peers[erase_candidate], pe))) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (should_erase_immediately(pe)) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (erase_candidate > current) --erase_candidate; | │ │ │ │ │ -| erase_peer(m_peers.begin() + current, state); | │ │ │ │ │ -| continue; | │ │ │ │ │ -| } | │ │ │ │ │ -| else | │ │ │ │ │ -| { | │ │ │ │ │ -| erase_candidate = current; | │ │ │ │ │ -|_ _ _ _ _ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| dht_put_alert::dht_put_alert(aux::stack_allocator&, sha1_hash const& t, int n) | │ │ │ │ │ +| : target(t) | │ │ │ │ │ +| , public_key() | │ │ │ │ │ +| , signature() | │ │ │ │ │ +|_ _ _,_ _s_a_l_t_(_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _2_|_._._/_s_r_c_/_k_a_d_e_m_l_i_a_/_n_o_d_e_._c_p_p_:_6_8_4_ _ _|_i_t_ _w_o_u_l_d_ _b_e_ _n_i_c_e_ _t_o_ _h_a_v_e_ _a_ _b_i_a_s_ _t_o_w_a_r_d_s_ _n_o_d_e_-_i_d_ _p_r_e_f_i_x_e_s_ _t_h_a_t_ _a_r_e_ _m_i_s_s_i_n_g_ _i_n_ _t_h_e_ _b_u_c_k_e_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** iitt wwoouulldd bbee nniiccee ttoo hhaavvee aa bbiiaass ttoowwaarrddss nnooddee--iidd pprreeffiixxeess tthhaatt aarree mmiissssiinngg iinn tthhee bbuucckkeett ********** | │ │ │ │ │ |****** ....//ssrrcc//kkaaddeemmlliiaa//nnooddee..ccpppp::668844 ****** | │ │ │ │ │ |node_entry const* ne = m_table.next_refresh(); | │ │ │ │ │ | if (ne == nullptr) return; | │ │ │ │ │ | | │ │ │ │ │ | // this shouldn't happen | │ │ │ │ │ @@ -4084,69 +4084,14 @@ │ │ │ │ │ |entry write_nodes_entry(std::vector const& nodes) | │ │ │ │ │ |{ | │ │ │ │ │ | entry r; | │ │ │ │ │ | std::back_insert_iterator out(r.string()); | │ │ │ │ │ | for (auto const& n : nodes) | │ │ │ │ │ | { | │ │ │ │ │ |_ _ _s_t_d_:_:_c_o_p_y_(_n_._i_d_._b_e_g_i_n_(_)_,_ _n_._i_d_._e_n_d_(_)_,_ _o_u_t_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 2|_._._/_s_r_c_/_k_a_d_e_m_l_i_a_/ |make this configurable in dht_settings | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_d_h_t___s_t_o_r_a_g_e_._c_p_p_:_8_7_ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** mmaakkee tthhiiss ccoonnffiigguurraabbllee iinn ddhhtt__sseettttiinnggss ********** | │ │ │ │ │ -|****** ....//ssrrcc//kkaaddeemmlliiaa//ddhhtt__ssttoorraaggee..ccpppp::8877 ****** | │ │ │ │ │ -|tcp::endpoint addr; | │ │ │ │ │ -| bool seed = 0; | │ │ │ │ │ -| }; | │ │ │ │ │ -| | │ │ │ │ │ -| // internal | │ │ │ │ │ -| bool operator<(peer_entry const& lhs, peer_entry const& rhs) | │ │ │ │ │ -| { | │ │ │ │ │ -| return lhs.addr.address() == rhs.addr.address() | │ │ │ │ │ -| ? lhs.addr.port() < rhs.addr.port() | │ │ │ │ │ -| : lhs.addr.address() < rhs.addr.address(); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // this is a group. It contains a set of group members | │ │ │ │ │ -| struct torrent_entry | │ │ │ │ │ -| { | │ │ │ │ │ -| std::string name; | │ │ │ │ │ -| std::vector peers4; | │ │ │ │ │ -| std::vector peers6; | │ │ │ │ │ -| }; | │ │ │ │ │ -| | │ │ │ │ │ -|constexpr time_duration announce_interval = minutes(30); | │ │ │ │ │ -| | │ │ │ │ │ -| struct dht_immutable_item | │ │ │ │ │ -| { | │ │ │ │ │ -| // the actual value | │ │ │ │ │ -| std::unique_ptr value; | │ │ │ │ │ -| // this counts the number of IPs we have seen | │ │ │ │ │ -| // announcing this item, this is used to determine | │ │ │ │ │ -| // popularity if we reach the limit of items to store | │ │ │ │ │ -| bloom_filter<128> ips; | │ │ │ │ │ -| // the last time we heard about this item | │ │ │ │ │ -| // the correct interpretation of this field | │ │ │ │ │ -| // requires a time reference | │ │ │ │ │ -| time_point last_seen; | │ │ │ │ │ -| // number of IPs in the bloom filter | │ │ │ │ │ -| int num_announcers = 0; | │ │ │ │ │ -| // size of malloced space pointed to by value | │ │ │ │ │ -| int size = 0; | │ │ │ │ │ -| }; | │ │ │ │ │ -| | │ │ │ │ │ -| struct dht_mutable_item : dht_immutable_item | │ │ │ │ │ -| { | │ │ │ │ │ -| signature sig{}; | │ │ │ │ │ -| sequence_number seq{}; | │ │ │ │ │ -| public_key key{}; | │ │ │ │ │ -| std::string salt; | │ │ │ │ │ -| }; | │ │ │ │ │ -| | │ │ │ │ │ -| void set_value(dht_immutable_item& item, span buf) | │ │ │ │ │ -| { | │ │ │ │ │ -|_ _ _i_n_t_ _c_o_n_s_t_ _s_i_z_e_ _=_ _i_n_t_(_b_u_f_._s_i_z_e_(_)_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 2|_._._/_s_r_c_/_k_a_d_e_m_l_i_a_/ |use the non deprecated function instead of this one | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_r_o_u_t_i_n_g___t_a_b_l_e_._c_p_p_:_3_0_5_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** uussee tthhee nnoonn ddeepprreeccaatteedd ffuunnccttiioonn iinnsstteeaadd ooff tthhiiss oonnee ********** | │ │ │ │ │ |****** ....//ssrrcc//kkaaddeemmlliiaa//rroouuttiinngg__ttaabbllee..ccpppp::330055 ****** | │ │ │ │ │ |static const aux::array size_exceptions{{{16, 8, 4, 2}}}; | │ │ │ │ │ | if (bucket < size_exceptions.end_index()) | │ │ │ │ │ | return m_bucket_size * size_exceptions[bucket]; | │ │ │ │ │ @@ -4226,14 +4171,231 @@ │ │ │ │ │ | { | │ │ │ │ │ | // this entry belongs in the new bucket | │ │ │ │ │ | if (j->pinged() && int(new_bucket.size()) < new_bucket_size) | │ │ │ │ │ | new_bucket.push_back(*j); | │ │ │ │ │ | else | │ │ │ │ │ | new_replacement_bucket.push_back(*j); | │ │ │ │ │ |_ _ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 2|_._._/_s_r_c_/_k_a_d_e_m_l_i_a_/ |make this configurable in dht_settings | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_d_h_t___s_t_o_r_a_g_e_._c_p_p_:_8_7_ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** mmaakkee tthhiiss ccoonnffiigguurraabbllee iinn ddhhtt__sseettttiinnggss ********** | │ │ │ │ │ +|****** ....//ssrrcc//kkaaddeemmlliiaa//ddhhtt__ssttoorraaggee..ccpppp::8877 ****** | │ │ │ │ │ +|tcp::endpoint addr; | │ │ │ │ │ +| bool seed = 0; | │ │ │ │ │ +| }; | │ │ │ │ │ +| | │ │ │ │ │ +| // internal | │ │ │ │ │ +| bool operator<(peer_entry const& lhs, peer_entry const& rhs) | │ │ │ │ │ +| { | │ │ │ │ │ +| return lhs.addr.address() == rhs.addr.address() | │ │ │ │ │ +| ? lhs.addr.port() < rhs.addr.port() | │ │ │ │ │ +| : lhs.addr.address() < rhs.addr.address(); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| // this is a group. It contains a set of group members | │ │ │ │ │ +| struct torrent_entry | │ │ │ │ │ +| { | │ │ │ │ │ +| std::string name; | │ │ │ │ │ +| std::vector peers4; | │ │ │ │ │ +| std::vector peers6; | │ │ │ │ │ +| }; | │ │ │ │ │ +| | │ │ │ │ │ +|constexpr time_duration announce_interval = minutes(30); | │ │ │ │ │ +| | │ │ │ │ │ +| struct dht_immutable_item | │ │ │ │ │ +| { | │ │ │ │ │ +| // the actual value | │ │ │ │ │ +| std::unique_ptr value; | │ │ │ │ │ +| // this counts the number of IPs we have seen | │ │ │ │ │ +| // announcing this item, this is used to determine | │ │ │ │ │ +| // popularity if we reach the limit of items to store | │ │ │ │ │ +| bloom_filter<128> ips; | │ │ │ │ │ +| // the last time we heard about this item | │ │ │ │ │ +| // the correct interpretation of this field | │ │ │ │ │ +| // requires a time reference | │ │ │ │ │ +| time_point last_seen; | │ │ │ │ │ +| // number of IPs in the bloom filter | │ │ │ │ │ +| int num_announcers = 0; | │ │ │ │ │ +| // size of malloced space pointed to by value | │ │ │ │ │ +| int size = 0; | │ │ │ │ │ +| }; | │ │ │ │ │ +| | │ │ │ │ │ +| struct dht_mutable_item : dht_immutable_item | │ │ │ │ │ +| { | │ │ │ │ │ +| signature sig{}; | │ │ │ │ │ +| sequence_number seq{}; | │ │ │ │ │ +| public_key key{}; | │ │ │ │ │ +| std::string salt; | │ │ │ │ │ +| }; | │ │ │ │ │ +| | │ │ │ │ │ +| void set_value(dht_immutable_item& item, span buf) | │ │ │ │ │ +| { | │ │ │ │ │ +|_ _ _i_n_t_ _c_o_n_s_t_ _s_i_z_e_ _=_ _i_n_t_(_b_u_f_._s_i_z_e_(_)_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 2|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |this should really be a circular buffer | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._h_p_p_:_9_9_6_ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss sshhoouulldd rreeaallllyy bbee aa cciirrccuullaarr bbuuffffeerr ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ppeeeerr__ccoonnnneeccttiioonn..hhpppp::999966 ****** | │ │ │ │ │ +|// it just serves as a queue to remember what we've sent, to avoid | │ │ │ │ │ +| // re-sending suggests for the same piece | │ │ │ │ │ +| // i.e. outgoing suggest pieces | │ │ │ │ │ +| aux::vector m_suggest_pieces; | │ │ │ │ │ +| | │ │ │ │ │ +| // the pieces we will send to the peer | │ │ │ │ │ +| // if requested (regardless of choke state) | │ │ │ │ │ +| std::vector m_accept_fast; | │ │ │ │ │ +| | │ │ │ │ │ +| // a sent-piece counter for the allowed fast set | │ │ │ │ │ +| // to avoid exploitation. Each slot is a counter | │ │ │ │ │ +| // for one of the pieces from the allowed-fast set | │ │ │ │ │ +| aux::vector m_accept_fast_piece_cnt; | │ │ │ │ │ +| | │ │ │ │ │ +| // the pieces the peer will send us if | │ │ │ │ │ +| // requested (regardless of choke state) | │ │ │ │ │ +| std::vector m_allowed_fast; | │ │ │ │ │ +| | │ │ │ │ │ +| // pieces that has been suggested to be downloaded from this peer | │ │ │ │ │ +| // i.e. incoming suggestions | │ │ │ │ │ +|aux::vector m_suggested_pieces; | │ │ │ │ │ +| | │ │ │ │ │ +| // the time when this peer last saw a complete copy | │ │ │ │ │ +| // of this torrent | │ │ │ │ │ +| time_t m_last_seen_complete = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| // the block we're currently receiving. Or | │ │ │ │ │ +| // (-1, -1) if we're not receiving one | │ │ │ │ │ +| piece_block m_receiving_block = piece_block::invalid; | │ │ │ │ │ +| | │ │ │ │ │ +| // the local endpoint for this peer, i.e. our address | │ │ │ │ │ +| // and our port. If this is set for outgoing connections | │ │ │ │ │ +| // before the connection completes, it means we want to | │ │ │ │ │ +| // force the connection to be bound to the specified interface. | │ │ │ │ │ +| // if it ends up being bound to a different local IP, the connection | │ │ │ │ │ +| // is closed. | │ │ │ │ │ +| tcp::endpoint m_local; | │ │ │ │ │ +| | │ │ │ │ │ +| // remote peer's id | │ │ │ │ │ +| peer_id m_peer_id; | │ │ │ │ │ +| | │ │ │ │ │ +| protected: | │ │ │ │ │ +| | │ │ │ │ │ +| template | │ │ │ │ │ +| void wrap(Fun f, Args&&... a); | │ │ │ │ │ +| | │ │ │ │ │ +| // statistics about upload and download speeds | │ │ │ │ │ +| // and total amount of uploads and downloads for | │ │ │ │ │ +|_ _ _/_/_ _t_h_i_s_ _p_e_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 2|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |rename this target queue size | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._h_p_p_:_1_0_8_6_ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** rreennaammee tthhiiss ttaarrggeett qquueeuuee ssiizzee ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ppeeeerr__ccoonnnneeccttiioonn..hhpppp::11008866 ****** | │ │ │ │ │ +|// this is the piece that is available to this peer. Only | │ │ │ │ │ +| // these two pieces can be downloaded from us by this peer. | │ │ │ │ │ +| // This will remain the current piece for this peer until | │ │ │ │ │ +| // another peer sends us a have message for this piece | │ │ │ │ │ +| std::array m_superseed_piece = {{piece_index_t(-1), piece_index_t(-1)}}; | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| // the number of bytes send to the disk-io | │ │ │ │ │ +| // thread that hasn't yet been completely written. | │ │ │ │ │ +| int m_outstanding_writing_bytes = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| // max transfer rates seen on this peer | │ │ │ │ │ +| int m_download_rate_peak = 0; | │ │ │ │ │ +| int m_upload_rate_peak = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| // stop sending data after this many bytes, INT_MAX = inf | │ │ │ │ │ +| int m_send_barrier = INT_MAX; | │ │ │ │ │ +| | │ │ │ │ │ +| // the number of request we should queue up | │ │ │ │ │ +| // at the remote end. | │ │ │ │ │ +|std::uint16_t m_desired_queue_size = 4; | │ │ │ │ │ +| | │ │ │ │ │ +| // if set to non-zero, this peer will always prefer | │ │ │ │ │ +| // to request entire n pieces, rather than blocks. | │ │ │ │ │ +| // where n is the value of this variable. | │ │ │ │ │ +| // if it is 0, the download rate limit setting | │ │ │ │ │ +| // will be used to determine if whole pieces | │ │ │ │ │ +| // are preferred. | │ │ │ │ │ +| std::uint16_t m_prefer_contiguous_blocks = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| // this is the number of times this peer has had | │ │ │ │ │ +| // a request rejected because of a disk I/O failure. | │ │ │ │ │ +| // once this reaches a certain threshold, the | │ │ │ │ │ +| // peer is disconnected in order to avoid infinite | │ │ │ │ │ +| // loops of consistent failures | │ │ │ │ │ +| std::uint8_t m_disk_read_failures = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| // this is used in seed mode whenever we trigger a hash check | │ │ │ │ │ +| // for a piece, before we read it. It's used to throttle | │ │ │ │ │ +| // the hash checks to just a few per peer at a time. | │ │ │ │ │ +| std::uint8_t m_outstanding_piece_verification:3; | │ │ │ │ │ +| | │ │ │ │ │ +| // is true if it was we that connected to the peer | │ │ │ │ │ +| // and false if we got an incoming connection | │ │ │ │ │ +| // could be considered: true = local, false = remote | │ │ │ │ │ +| bool m_outgoing:1; | │ │ │ │ │ +| | │ │ │ │ │ +| // is true if we learn the incoming connections listening | │ │ │ │ │ +| // during the extended handshake | │ │ │ │ │ +|_ _ _b_o_o_l_ _m___r_e_c_e_i_v_e_d___l_i_s_t_e_n___p_o_r_t_:_1_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 2|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |add async_connect() that takes a hostname and port as well | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_s_o_c_k_s_5___s_t_r_e_a_m_._h_p_p_:_1_5_3_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** aadddd aassyynncc__ccoonnnneecctt(()) tthhaatt ttaakkeess aa hhoossttnnaammee aanndd ppoorrtt aass wweellll ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ssoocckkss55__ssttrreeaamm..hhpppp::115533 ****** | │ │ │ │ │ +|TORRENT_ASSERT(!aux::is_ip_address(host)); | │ │ │ │ │ +| m_dst_name = host; | │ │ │ │ │ +| if (m_dst_name.size() > 255) | │ │ │ │ │ +| m_dst_name.resize(255); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void close(error_code& ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| m_dst_name.clear(); | │ │ │ │ │ +| proxy_base::close(ec); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|#ifndef BOOST_NO_EXCEPTIONS | │ │ │ │ │ +| void close() | │ │ │ │ │ +| { | │ │ │ │ │ +| m_dst_name.clear(); | │ │ │ │ │ +| proxy_base::close(); | │ │ │ │ │ +| } | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +|template | │ │ │ │ │ +|void async_connect(endpoint_type const& endpoint, Handler handler) | │ │ │ │ │ +| { | │ │ │ │ │ +| // make sure we don't try to connect to INADDR_ANY. binding is fine, | │ │ │ │ │ +| // and using a hostname is fine on SOCKS version 5. | │ │ │ │ │ +| TORRENT_ASSERT(endpoint.address() != address() | │ │ │ │ │ +| || (!m_dst_name.empty() && m_version == 5)); | │ │ │ │ │ +| | │ │ │ │ │ +| m_remote_endpoint = endpoint; | │ │ │ │ │ +| | │ │ │ │ │ +| // the connect is split up in the following steps: | │ │ │ │ │ +| // 1. resolve name of proxy server | │ │ │ │ │ +| // 2. connect to proxy server | │ │ │ │ │ +| // 3. if version == 5: | │ │ │ │ │ +| // 3.1 send SOCKS5 authentication method message | │ │ │ │ │ +| // 3.2 read SOCKS5 authentication response | │ │ │ │ │ +| // 3.3 send username+password | │ │ │ │ │ +| // 4. send SOCKS command message | │ │ │ │ │ +| | │ │ │ │ │ +| ADD_OUTSTANDING_ASYNC("socks5_stream::name_lookup"); | │ │ │ │ │ +| m_resolver.async_resolve(m_hostname, to_string(m_port).data(), wrap_allocator( | │ │ │ │ │ +| [this](error_code const& ec, tcp::resolver::results_type ips, Handler hn) { | │ │ │ │ │ +| name_lookup(ec, std::move(ips), std::move(hn)); | │ │ │ │ │ +| }, std::move(handler))); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|private: | │ │ │ │ │ +| | │ │ │ │ │ +| template | │ │ │ │ │ +| void name_lookup(error_code const& e, tcp::resolver::results_type ips | │ │ │ │ │ +|_ _ _,_ _H_a_n_d_l_e_r_ _h_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 2|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |having 8 priority levels is probably excessive. It should probably be changed to 3 levels + dont-download | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_p_i_e_c_e___p_i_c_k_e_r_._h_p_p_:_6_6_8_ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** hhaavviinngg 88 pprriioorriittyy lleevveellss iiss pprroobbaabbllyy eexxcceessssiivvee.. IItt sshhoouulldd pprroobbaabbllyy bbee cchhaannggeedd ttoo 33 lleevveellss ++ ddoonntt--ddoowwnnllooaadd ********** | │ │ │ │ │ |****** ....//iinncclluuddee//lliibbttoorrrreenntt//ppiieeccee__ppiicckkeerr..hhpppp::666688 ****** | │ │ │ │ │ |else if (state() == piece_full) | │ │ │ │ │ | state(piece_full_reverse); | │ │ │ │ │ | } | │ │ │ │ │ @@ -4390,176 +4552,69 @@ │ │ │ │ │ | using allocator_type = typename boost::asio::associated_allocator::type; | │ │ │ │ │ | using executor_type = typename boost::asio::associated_executor::type; | │ │ │ │ │ | | │ │ │ │ │ | allocator_type get_allocator() const noexcept | │ │ │ │ │ | { return boost::asio::get_associated_allocator(m_underlying_handler); } | │ │ │ │ │ | | │ │ │ │ │ |_ _e_x_e_c_u_t_o_r___t_y_p_e_ _g_e_t___e_x_e_c_u_t_o_r_(_)_ _c_o_n_s_t_ _n_o_e_x_c_e_p_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 2|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |this should really be a circular buffer | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._h_p_p_:_9_9_6_ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss sshhoouulldd rreeaallllyy bbee aa cciirrccuullaarr bbuuffffeerr ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ppeeeerr__ccoonnnneeccttiioonn..hhpppp::999966 ****** | │ │ │ │ │ -|// it just serves as a queue to remember what we've sent, to avoid | │ │ │ │ │ -| // re-sending suggests for the same piece | │ │ │ │ │ -| // i.e. outgoing suggest pieces | │ │ │ │ │ -| aux::vector m_suggest_pieces; | │ │ │ │ │ -| | │ │ │ │ │ -| // the pieces we will send to the peer | │ │ │ │ │ -| // if requested (regardless of choke state) | │ │ │ │ │ -| std::vector m_accept_fast; | │ │ │ │ │ -| | │ │ │ │ │ -| // a sent-piece counter for the allowed fast set | │ │ │ │ │ -| // to avoid exploitation. Each slot is a counter | │ │ │ │ │ -| // for one of the pieces from the allowed-fast set | │ │ │ │ │ -| aux::vector m_accept_fast_piece_cnt; | │ │ │ │ │ -| | │ │ │ │ │ -| // the pieces the peer will send us if | │ │ │ │ │ -| // requested (regardless of choke state) | │ │ │ │ │ -| std::vector m_allowed_fast; | │ │ │ │ │ -| | │ │ │ │ │ -| // pieces that has been suggested to be downloaded from this peer | │ │ │ │ │ -| // i.e. incoming suggestions | │ │ │ │ │ -|aux::vector m_suggested_pieces; | │ │ │ │ │ -| | │ │ │ │ │ -| // the time when this peer last saw a complete copy | │ │ │ │ │ -| // of this torrent | │ │ │ │ │ -| time_t m_last_seen_complete = 0; | │ │ │ │ │ -| | │ │ │ │ │ -| // the block we're currently receiving. Or | │ │ │ │ │ -| // (-1, -1) if we're not receiving one | │ │ │ │ │ -| piece_block m_receiving_block = piece_block::invalid; | │ │ │ │ │ -| | │ │ │ │ │ -| // the local endpoint for this peer, i.e. our address | │ │ │ │ │ -| // and our port. If this is set for outgoing connections | │ │ │ │ │ -| // before the connection completes, it means we want to | │ │ │ │ │ -| // force the connection to be bound to the specified interface. | │ │ │ │ │ -| // if it ends up being bound to a different local IP, the connection | │ │ │ │ │ -| // is closed. | │ │ │ │ │ -| tcp::endpoint m_local; | │ │ │ │ │ -| | │ │ │ │ │ -| // remote peer's id | │ │ │ │ │ -| peer_id m_peer_id; | │ │ │ │ │ +|relevance 2|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/ |this type should probably be renamed to send_buffer | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_c_h_a_i_n_e_d___b_u_f_f_e_r_._h_p_p_:_5_9_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss ttyyppee sshhoouulldd pprroobbaabbllyy bbee rreennaammeedd ttoo sseenndd__bbuuffffeerr ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//aauuxx__//cchhaaiinneedd__bbuuffffeerr..hhpppp::5599 ****** | │ │ │ │ │ +|#include "libtorrent/aux_/buffer.hpp" | │ │ │ │ │ | | │ │ │ │ │ -| protected: | │ │ │ │ │ +|#include | │ │ │ │ │ +|#include | │ │ │ │ │ | | │ │ │ │ │ -| template | │ │ │ │ │ -| void wrap(Fun f, Args&&... a); | │ │ │ │ │ +|#include "libtorrent/aux_/disable_warnings_push.hpp" | │ │ │ │ │ +|#include | │ │ │ │ │ +|#include "libtorrent/aux_/disable_warnings_pop.hpp" | │ │ │ │ │ | | │ │ │ │ │ -| // statistics about upload and download speeds | │ │ │ │ │ -| // and total amount of uploads and downloads for | │ │ │ │ │ -|_ _ _/_/_ _t_h_i_s_ _p_e_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 2|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |rename this target queue size | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._h_p_p_:_1_0_8_6_ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** rreennaammee tthhiiss ttaarrggeett qquueeuuee ssiizzee ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ppeeeerr__ccoonnnneeccttiioonn..hhpppp::11008866 ****** | │ │ │ │ │ -|// this is the piece that is available to this peer. Only | │ │ │ │ │ -| // these two pieces can be downloaded from us by this peer. | │ │ │ │ │ -| // This will remain the current piece for this peer until | │ │ │ │ │ -| // another peer sends us a have message for this piece | │ │ │ │ │ -| std::array m_superseed_piece = {{piece_index_t(-1), piece_index_t(-1)}}; | │ │ │ │ │ +|#ifdef _MSC_VER | │ │ │ │ │ +|// visual studio requires the value in a deque to be copyable. C++11 | │ │ │ │ │ +|// has looser requirements depending on which functions are actually used. | │ │ │ │ │ +|#define TORRENT_CPP98_DEQUE 1 | │ │ │ │ │ +|#else | │ │ │ │ │ +|#define TORRENT_CPP98_DEQUE 0 | │ │ │ │ │ |#endif | │ │ │ │ │ | | │ │ │ │ │ -| // the number of bytes send to the disk-io | │ │ │ │ │ -| // thread that hasn't yet been completely written. | │ │ │ │ │ -| int m_outstanding_writing_bytes = 0; | │ │ │ │ │ -| | │ │ │ │ │ -| // max transfer rates seen on this peer | │ │ │ │ │ -| int m_download_rate_peak = 0; | │ │ │ │ │ -| int m_upload_rate_peak = 0; | │ │ │ │ │ -| | │ │ │ │ │ -| // stop sending data after this many bytes, INT_MAX = inf | │ │ │ │ │ -| int m_send_barrier = INT_MAX; | │ │ │ │ │ -| | │ │ │ │ │ -| // the number of request we should queue up | │ │ │ │ │ -| // at the remote end. | │ │ │ │ │ -|std::uint16_t m_desired_queue_size = 4; | │ │ │ │ │ -| | │ │ │ │ │ -| // if set to non-zero, this peer will always prefer | │ │ │ │ │ -| // to request entire n pieces, rather than blocks. | │ │ │ │ │ -| // where n is the value of this variable. | │ │ │ │ │ -| // if it is 0, the download rate limit setting | │ │ │ │ │ -| // will be used to determine if whole pieces | │ │ │ │ │ -| // are preferred. | │ │ │ │ │ -| std::uint16_t m_prefer_contiguous_blocks = 0; | │ │ │ │ │ -| | │ │ │ │ │ -| // this is the number of times this peer has had | │ │ │ │ │ -| // a request rejected because of a disk I/O failure. | │ │ │ │ │ -| // once this reaches a certain threshold, the | │ │ │ │ │ -| // peer is disconnected in order to avoid infinite | │ │ │ │ │ -| // loops of consistent failures | │ │ │ │ │ -| std::uint8_t m_disk_read_failures = 0; | │ │ │ │ │ -| | │ │ │ │ │ -| // this is used in seed mode whenever we trigger a hash check | │ │ │ │ │ -| // for a piece, before we read it. It's used to throttle | │ │ │ │ │ -| // the hash checks to just a few per peer at a time. | │ │ │ │ │ -| std::uint8_t m_outstanding_piece_verification:3; | │ │ │ │ │ -| | │ │ │ │ │ -| // is true if it was we that connected to the peer | │ │ │ │ │ -| // and false if we got an incoming connection | │ │ │ │ │ -| // could be considered: true = local, false = remote | │ │ │ │ │ -| bool m_outgoing:1; | │ │ │ │ │ -| | │ │ │ │ │ -| // is true if we learn the incoming connections listening | │ │ │ │ │ -| // during the extended handshake | │ │ │ │ │ -|_ _ _b_o_o_l_ _m___r_e_c_e_i_v_e_d___l_i_s_t_e_n___p_o_r_t_:_1_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 2|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |add async_connect() that takes a hostname and port as well | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_s_o_c_k_s_5___s_t_r_e_a_m_._h_p_p_:_1_5_3_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** aadddd aassyynncc__ccoonnnneecctt(()) tthhaatt ttaakkeess aa hhoossttnnaammee aanndd ppoorrtt aass wweellll ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ssoocckkss55__ssttrreeaamm..hhpppp::115533 ****** | │ │ │ │ │ -|TORRENT_ASSERT(!aux::is_ip_address(host)); | │ │ │ │ │ -| m_dst_name = host; | │ │ │ │ │ -| if (m_dst_name.size() > 255) | │ │ │ │ │ -| m_dst_name.resize(255); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void close(error_code& ec) | │ │ │ │ │ -| { | │ │ │ │ │ -| m_dst_name.clear(); | │ │ │ │ │ -| proxy_base::close(ec); | │ │ │ │ │ -| } | │ │ │ │ │ +|namespace libtorrent { | │ │ │ │ │ +|namespace aux { | │ │ │ │ │ | | │ │ │ │ │ -|#ifndef BOOST_NO_EXCEPTIONS | │ │ │ │ │ -| void close() | │ │ │ │ │ -| { | │ │ │ │ │ -| m_dst_name.clear(); | │ │ │ │ │ -| proxy_base::close(); | │ │ │ │ │ -| } | │ │ │ │ │ +|struct TORRENT_EXTRA_EXPORT chained_buffer : private single_threaded | │ │ │ │ │ +|{ | │ │ │ │ │ +| chained_buffer(): m_bytes(0), m_capacity(0) | │ │ │ │ │ +| { | │ │ │ │ │ +| thread_started(); | │ │ │ │ │ +|#if TORRENT_USE_ASSERTS | │ │ │ │ │ +| m_destructed = false; | │ │ │ │ │ |#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|template | │ │ │ │ │ -|void async_connect(endpoint_type const& endpoint, Handler handler) | │ │ │ │ │ -| { | │ │ │ │ │ -| // make sure we don't try to connect to INADDR_ANY. binding is fine, | │ │ │ │ │ -| // and using a hostname is fine on SOCKS version 5. | │ │ │ │ │ -| TORRENT_ASSERT(endpoint.address() != address() | │ │ │ │ │ -| || (!m_dst_name.empty() && m_version == 5)); | │ │ │ │ │ -| | │ │ │ │ │ -| m_remote_endpoint = endpoint; | │ │ │ │ │ -| | │ │ │ │ │ -| // the connect is split up in the following steps: | │ │ │ │ │ -| // 1. resolve name of proxy server | │ │ │ │ │ -| // 2. connect to proxy server | │ │ │ │ │ -| // 3. if version == 5: | │ │ │ │ │ -| // 3.1 send SOCKS5 authentication method message | │ │ │ │ │ -| // 3.2 read SOCKS5 authentication response | │ │ │ │ │ -| // 3.3 send username+password | │ │ │ │ │ -| // 4. send SOCKS command message | │ │ │ │ │ -| | │ │ │ │ │ -| ADD_OUTSTANDING_ASYNC("socks5_stream::name_lookup"); | │ │ │ │ │ -| m_resolver.async_resolve(m_hostname, to_string(m_port).data(), wrap_allocator( | │ │ │ │ │ -| [this](error_code const& ec, tcp::resolver::results_type ips, Handler hn) { | │ │ │ │ │ -| name_lookup(ec, std::move(ips), std::move(hn)); | │ │ │ │ │ -| }, std::move(handler))); | │ │ │ │ │ -| } | │ │ │ │ │ +| private: | │ │ │ │ │ | | │ │ │ │ │ -|private: | │ │ │ │ │ +| // destructs/frees the holder object | │ │ │ │ │ +| using destruct_holder_fun = void (*)(void*); | │ │ │ │ │ +| using move_construct_holder_fun = void (*)(void*, void*); | │ │ │ │ │ | | │ │ │ │ │ -| template | │ │ │ │ │ -| void name_lookup(error_code const& e, tcp::resolver::results_type ips | │ │ │ │ │ -|_ _ _,_ _H_a_n_d_l_e_r_ _h_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| struct buffer_t | │ │ │ │ │ +| { | │ │ │ │ │ +| buffer_t() {} | │ │ │ │ │ +|#if TORRENT_CPP98_DEQUE | │ │ │ │ │ +| buffer_t(buffer_t&& rhs) noexcept | │ │ │ │ │ +| { | │ │ │ │ │ +| destruct_holder = rhs.destruct_holder; | │ │ │ │ │ +| move_holder = rhs.move_holder; | │ │ │ │ │ +| buf = rhs.buf; | │ │ │ │ │ +| size = rhs.size; | │ │ │ │ │ +| used_size = rhs.used_size; | │ │ │ │ │ +| move_holder(&holder, &rhs.holder); | │ │ │ │ │ +| } | │ │ │ │ │ +| buffer_t& operator=(buffer_t&& rhs) & noexcept | │ │ │ │ │ +|_ _ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 2|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/ |make this interface a lot smaller. It could be split up into several smaller interfaces. Each subsystem could then limit the size of| │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_s_e_s_s_i_o_n___i_n_t_e_r_f_a_c_e_._h_p_p_:_1_2_7_ _ _ _ _ _|_t_h_e_ _m_o_c_k_ _o_b_j_e_c_t_ _t_o_ _t_e_s_t_ _i_t_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** mmaakkee tthhiiss iinntteerrffaaccee aa lloott ssmmaalllleerr.. IItt ccoouulldd bbee sspplliitt uupp iinnttoo sseevveerraall ssmmaalllleerr iinntteerrffaacceess.. EEaacchh ssuubbssyysstteemm ccoouulldd tthheenn lliimmiitt tthhee ssiizzee ooff tthhee mmoocckk oobbjjeecctt ttoo tteesstt iitt.. ********** | │ │ │ │ │ |****** ....//iinncclluuddee//lliibbttoorrrreenntt//aauuxx__//sseessssiioonn__iinntteerrffaaccee..hhpppp::112277 ****** | │ │ │ │ │ |// a release build with logging disabled (which is the default) will | │ │ │ │ │ | // not have this class at all | │ │ │ │ │ | struct TORRENT_EXTRA_EXPORT session_logger | │ │ │ │ │ @@ -4635,123 +4690,14 @@ │ │ │ │ │ | | │ │ │ │ │ | virtual void remove_torrent(torrent_handle const& h, remove_flags_t options = {}) = 0; | │ │ │ │ │ | virtual void remove_torrent_impl(std::shared_ptr tptr, remove_flags_t options) = 0; | │ │ │ │ │ | | │ │ │ │ │ | // port filter | │ │ │ │ │ | virtual port_filter const& get_port_filter() const = 0; | │ │ │ │ │ |_ _ _v_i_r_t_u_a_l_ _v_o_i_d_ _b_a_n___i_p_(_a_d_d_r_e_s_s_ _a_d_d_r_)_ _=_ _0_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 2|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/ |this type should probably be renamed to send_buffer | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_c_h_a_i_n_e_d___b_u_f_f_e_r_._h_p_p_:_5_9_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss ttyyppee sshhoouulldd pprroobbaabbllyy bbee rreennaammeedd ttoo sseenndd__bbuuffffeerr ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//aauuxx__//cchhaaiinneedd__bbuuffffeerr..hhpppp::5599 ****** | │ │ │ │ │ -|#include "libtorrent/aux_/buffer.hpp" | │ │ │ │ │ -| | │ │ │ │ │ -|#include | │ │ │ │ │ -|#include | │ │ │ │ │ -| | │ │ │ │ │ -|#include "libtorrent/aux_/disable_warnings_push.hpp" | │ │ │ │ │ -|#include | │ │ │ │ │ -|#include "libtorrent/aux_/disable_warnings_pop.hpp" | │ │ │ │ │ -| | │ │ │ │ │ -|#ifdef _MSC_VER | │ │ │ │ │ -|// visual studio requires the value in a deque to be copyable. C++11 | │ │ │ │ │ -|// has looser requirements depending on which functions are actually used. | │ │ │ │ │ -|#define TORRENT_CPP98_DEQUE 1 | │ │ │ │ │ -|#else | │ │ │ │ │ -|#define TORRENT_CPP98_DEQUE 0 | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -|namespace libtorrent { | │ │ │ │ │ -|namespace aux { | │ │ │ │ │ -| | │ │ │ │ │ -|struct TORRENT_EXTRA_EXPORT chained_buffer : private single_threaded | │ │ │ │ │ -|{ | │ │ │ │ │ -| chained_buffer(): m_bytes(0), m_capacity(0) | │ │ │ │ │ -| { | │ │ │ │ │ -| thread_started(); | │ │ │ │ │ -|#if TORRENT_USE_ASSERTS | │ │ │ │ │ -| m_destructed = false; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| private: | │ │ │ │ │ -| | │ │ │ │ │ -| // destructs/frees the holder object | │ │ │ │ │ -| using destruct_holder_fun = void (*)(void*); | │ │ │ │ │ -| using move_construct_holder_fun = void (*)(void*, void*); | │ │ │ │ │ -| | │ │ │ │ │ -| struct buffer_t | │ │ │ │ │ -| { | │ │ │ │ │ -| buffer_t() {} | │ │ │ │ │ -|#if TORRENT_CPP98_DEQUE | │ │ │ │ │ -| buffer_t(buffer_t&& rhs) noexcept | │ │ │ │ │ -| { | │ │ │ │ │ -| destruct_holder = rhs.destruct_holder; | │ │ │ │ │ -| move_holder = rhs.move_holder; | │ │ │ │ │ -| buf = rhs.buf; | │ │ │ │ │ -| size = rhs.size; | │ │ │ │ │ -| used_size = rhs.used_size; | │ │ │ │ │ -| move_holder(&holder, &rhs.holder); | │ │ │ │ │ -| } | │ │ │ │ │ -| buffer_t& operator=(buffer_t&& rhs) & noexcept | │ │ │ │ │ -|_ _ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _1_|_._._/_s_r_c_/_s_e_s_s_i_o_n___i_m_p_l_._c_p_p_:_5_7_0_7_ _ _|_r_e_p_o_r_t_ _t_h_e_ _p_r_o_p_e_r_ _a_d_d_r_e_s_s_ _o_f_ _t_h_e_ _r_o_u_t_e_r_ _a_s_ _t_h_e_ _s_o_u_r_c_e_ _I_P_ _o_f_ _t_h_i_s_ _v_o_t_e_ _o_f_ _o_u_r_ _e_x_t_e_r_n_a_l_ _a_d_d_r_e_s_s_,_ _i_n_s_t_e_a_d_ _o_f_ _t_h_e_ _e_m_p_t_y_ _a_d_d_r_e_s_s_ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** rreeppoorrtt tthhee pprrooppeerr aaddddrreessss ooff tthhee rroouutteerr aass tthhee ssoouurrccee IIPP ooff tthhiiss vvoottee ooff oouurr eexxtteerrnnaall aaddddrreessss,, iinnsstteeaadd ooff tthhee eemmppttyy aaddddrreessss ********** | │ │ │ │ │ -|****** ....//ssrrcc//sseessssiioonn__iimmppll..ccpppp::55770077 ****** | │ │ │ │ │ -|, listen_socket_handle const& ls) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -| | │ │ │ │ │ -| listen_socket_t* listen_socket = ls.get(); | │ │ │ │ │ -| | │ │ │ │ │ -| // NOTE: don't assume that if ec != 0, the rest of the logic | │ │ │ │ │ -| // is not necessary, the ports still need to be set, in other | │ │ │ │ │ -| // words, don't early return without careful review of the | │ │ │ │ │ -| // remaining logic | │ │ │ │ │ -| if (ec && m_alerts.should_post()) | │ │ │ │ │ -| { | │ │ │ │ │ -| m_alerts.emplace_alert(mapping | │ │ │ │ │ -| , transport, ec, listen_socket ? listen_socket->local_endpoint.address() : address()); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| if (!listen_socket) return; | │ │ │ │ │ -| | │ │ │ │ │ -| if (!ec && !external_ip.is_unspecified()) | │ │ │ │ │ -| { | │ │ │ │ │ -|listen_socket->external_address.cast_vote(external_ip, source_router, address()); | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -| // need to check whether this mapping is for one of session ports (it could also be a user mapping) | │ │ │ │ │ -| if ((proto == portmap_protocol::tcp) && (listen_socket->tcp_port_mapping[transport].mapping == mapping)) | │ │ │ │ │ -| listen_socket->tcp_port_mapping[transport].port = port; | │ │ │ │ │ -| else if ((proto == portmap_protocol::udp) && (listen_socket->udp_port_mapping[transport].mapping == mapping)) | │ │ │ │ │ -| listen_socket->udp_port_mapping[transport].port = port; | │ │ │ │ │ -| | │ │ │ │ │ -| if (!ec && m_alerts.should_post()) | │ │ │ │ │ -| { | │ │ │ │ │ -| m_alerts.emplace_alert(mapping, port | │ │ │ │ │ -| , transport, proto, listen_socket->local_endpoint.address()); | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ -| session_status session_impl::status() const | │ │ │ │ │ -| { | │ │ │ │ │ -|// INVARIANT_CHECK; | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -| | │ │ │ │ │ -| session_status s; | │ │ │ │ │ -| | │ │ │ │ │ -| s.optimistic_unchoke_counter = m_optimistic_unchoke_time_scaler; | │ │ │ │ │ -| s.unchoke_counter = m_unchoke_time_scaler; | │ │ │ │ │ -| s.num_dead_peers = int(m_undead_peers.size()); | │ │ │ │ │ -| | │ │ │ │ │ -| s.num_peers = int(m_stats_counters[counters::num_peers_connected]); | │ │ │ │ │ -| s.num_unchoked = int(m_stats_counters[counters::num_peers_up_unchoked_all]); | │ │ │ │ │ -|_ _ _s_._a_l_l_o_w_e_d___u_p_l_o_a_d___s_l_o_t_s_ _=_ _i_n_t_(_m___s_t_a_t_s___c_o_u_n_t_e_r_s_[_c_o_u_n_t_e_r_s_:_:_n_u_m___u_n_c_h_o_k_e___s_l_o_t_s_]_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ | | |make this depend on the error and on the filesystem the files are being downloaded to. If the error is no_space_left_on_device and | │ │ │ │ │ |relevance 1|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_1_1_2_6 |the filesystem doesn't support sparse files, only zero the priorities of the pieces that are at the tails of all files, leaving | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_e_v_e_r_y_t_h_i_n_g_ _u_p_ _t_o_ _t_h_e_ _h_i_g_h_e_s_t_ _w_r_i_t_t_e_n_ _p_i_e_c_e_ _i_n_ _e_a_c_h_ _f_i_l_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** mmaakkee tthhiiss ddeeppeenndd oonn tthhee eerrrroorr aanndd oonn tthhee ffiilleessyysstteemm tthhee ffiilleess aarree bbeeiinngg ddoowwnnllooaaddeedd ttoo.. IIff tthhee eerrrroorr iiss nnoo__ssppaaccee__lleefftt__oonn__ddeevviiccee aanndd tthhee ffiilleessyysstteemm ddooeessnn''tt ssuuppppoorrtt ssppaarrssee | │ │ │ │ │ |ffiilleess,, oonnllyy zzeerroo tthhee pprriioorriittiieess ooff tthhee ppiieecceess tthhaatt aarree aatt tthhee ttaaiillss ooff aallll ffiilleess,, lleeaavviinngg eevveerryytthhiinngg uupp ttoo tthhee hhiigghheesstt wwrriitttteenn ppiieeccee iinn eeaacchh ffiillee ********** | │ │ │ │ │ |****** ....//ssrrcc//ttoorrrreenntt..ccpppp::11112266 ****** | │ │ │ │ │ | // notify the user of the error | │ │ │ │ │ @@ -4853,14 +4799,68 @@ │ │ │ │ │ | // we need to keep the object alive during this operation | │ │ │ │ │ | m_ses.disk_thread().async_release_files(m_storage | │ │ │ │ │ | , std::bind(&torrent::on_cache_flushed, shared_from_this(), false)); | │ │ │ │ │ | m_ses.deferred_submit_jobs(); | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ |_ _ _/_/_ _t_h_i_s_ _t_o_r_r_e_n_t_ _j_u_s_t_ _c_o_m_p_l_e_t_e_d_ _d_o_w_n_l_o_a_d_s_,_ _w_h_i_c_h_ _m_e_a_n_s_ _i_t_ _w_i_l_l_ _f_a_l_l_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _1_|_._._/_s_r_c_/_s_e_s_s_i_o_n___i_m_p_l_._c_p_p_:_5_7_0_7_ _ _|_r_e_p_o_r_t_ _t_h_e_ _p_r_o_p_e_r_ _a_d_d_r_e_s_s_ _o_f_ _t_h_e_ _r_o_u_t_e_r_ _a_s_ _t_h_e_ _s_o_u_r_c_e_ _I_P_ _o_f_ _t_h_i_s_ _v_o_t_e_ _o_f_ _o_u_r_ _e_x_t_e_r_n_a_l_ _a_d_d_r_e_s_s_,_ _i_n_s_t_e_a_d_ _o_f_ _t_h_e_ _e_m_p_t_y_ _a_d_d_r_e_s_s_ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** rreeppoorrtt tthhee pprrooppeerr aaddddrreessss ooff tthhee rroouutteerr aass tthhee ssoouurrccee IIPP ooff tthhiiss vvoottee ooff oouurr eexxtteerrnnaall aaddddrreessss,, iinnsstteeaadd ooff tthhee eemmppttyy aaddddrreessss ********** | │ │ │ │ │ +|****** ....//ssrrcc//sseessssiioonn__iimmppll..ccpppp::55770077 ****** | │ │ │ │ │ +|, listen_socket_handle const& ls) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ +| | │ │ │ │ │ +| listen_socket_t* listen_socket = ls.get(); | │ │ │ │ │ +| | │ │ │ │ │ +| // NOTE: don't assume that if ec != 0, the rest of the logic | │ │ │ │ │ +| // is not necessary, the ports still need to be set, in other | │ │ │ │ │ +| // words, don't early return without careful review of the | │ │ │ │ │ +| // remaining logic | │ │ │ │ │ +| if (ec && m_alerts.should_post()) | │ │ │ │ │ +| { | │ │ │ │ │ +| m_alerts.emplace_alert(mapping | │ │ │ │ │ +| , transport, ec, listen_socket ? listen_socket->local_endpoint.address() : address()); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| if (!listen_socket) return; | │ │ │ │ │ +| | │ │ │ │ │ +| if (!ec && !external_ip.is_unspecified()) | │ │ │ │ │ +| { | │ │ │ │ │ +|listen_socket->external_address.cast_vote(external_ip, source_router, address()); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +| // need to check whether this mapping is for one of session ports (it could also be a user mapping) | │ │ │ │ │ +| if ((proto == portmap_protocol::tcp) && (listen_socket->tcp_port_mapping[transport].mapping == mapping)) | │ │ │ │ │ +| listen_socket->tcp_port_mapping[transport].port = port; | │ │ │ │ │ +| else if ((proto == portmap_protocol::udp) && (listen_socket->udp_port_mapping[transport].mapping == mapping)) | │ │ │ │ │ +| listen_socket->udp_port_mapping[transport].port = port; | │ │ │ │ │ +| | │ │ │ │ │ +| if (!ec && m_alerts.should_post()) | │ │ │ │ │ +| { | │ │ │ │ │ +| m_alerts.emplace_alert(mapping, port | │ │ │ │ │ +| , transport, proto, listen_socket->local_endpoint.address()); | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ +| session_status session_impl::status() const | │ │ │ │ │ +| { | │ │ │ │ │ +|// INVARIANT_CHECK; | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ +| | │ │ │ │ │ +| session_status s; | │ │ │ │ │ +| | │ │ │ │ │ +| s.optimistic_unchoke_counter = m_optimistic_unchoke_time_scaler; | │ │ │ │ │ +| s.unchoke_counter = m_unchoke_time_scaler; | │ │ │ │ │ +| s.num_dead_peers = int(m_undead_peers.size()); | │ │ │ │ │ +| | │ │ │ │ │ +| s.num_peers = int(m_stats_counters[counters::num_peers_connected]); | │ │ │ │ │ +| s.num_unchoked = int(m_stats_counters[counters::num_peers_up_unchoked_all]); | │ │ │ │ │ +|_ _ _s_._a_l_l_o_w_e_d___u_p_l_o_a_d___s_l_o_t_s_ _=_ _i_n_t_(_m___s_t_a_t_s___c_o_u_n_t_e_r_s_[_c_o_u_n_t_e_r_s_:_:_n_u_m___u_n_c_h_o_k_e___s_l_o_t_s_]_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 1|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |have one instance per possible subnet, 192.168.x.x, 10.x.x.x, etc. | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_i_p___v_o_t_e_r_._h_p_p_:_1_3_0_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** hhaavvee oonnee iinnssttaannccee ppeerr ppoossssiibbllee ssuubbnneett,, 119922..116688..xx..xx,, 1100..xx..xx..xx,, eettcc.. ********** | │ │ │ │ │ |****** ....//iinncclluuddee//lliibbttoorrrreenntt//iipp__vvootteerr..hhpppp::113300 ****** | │ │ │ │ │ |// stores one address for each combination of local/global and ipv4/ipv6 | │ │ │ │ │ | // use of this class should be avoided, get the IP from the appropriate | │ │ │ │ │ | // listen interface wherever possible | │ │ │ │ │ @@ -4883,301 +4883,418 @@ │ │ │ │ │ | // [n][0] = IPv4 [n][1] = IPv6 | │ │ │ │ │ |address m_addresses[2][2]; | │ │ │ │ │ |}; | │ │ │ │ │ | | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ |_#_e_n_d_i_f_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___s_s_l_._c_p_p_:_4_0_7_ _ _ _ _ _ _|_t_e_s_t_ _u_s_i_n_g_ _a_ _s_i_g_n_e_d_ _c_e_r_t_i_f_i_c_a_t_e_ _w_i_t_h_ _t_h_e_ _w_r_o_n_g_ _i_n_f_o_-_h_a_s_h_ _i_n_ _D_N_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt uussiinngg aa ssiiggnneedd cceerrttiiffiiccaattee wwiitthh tthhee wwrroonngg iinnffoo--hhaasshh iinn DDNN ********** | │ │ │ │ │ -|****** ....//tteesstt//tteesstt__ssssll..ccpppp::440077 ****** | │ │ │ │ │ -|// in verifying peers | │ │ │ │ │ -| ctx.set_verify_mode(context::verify_none, ec); | │ │ │ │ │ -| if (ec) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::printf("Failed to set SSL verify mode: %s\n" | │ │ │ │ │ -| , ec.message().c_str()); | │ │ │ │ │ -| TEST_CHECK(!ec); | │ │ │ │ │ -| return false; | │ │ │ │ │ -| } | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |test erasing peers | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_1_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt eerraassiinngg ppeeeerrss ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_11_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |test update_peer_port with allow_multiple_connections_per_ip and without | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_2_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt uuppddaattee__ppeeeerr__ppoorrtt wwiitthh aallllooww__mmuullttiippllee__ccoonnnneeccttiioonnss__ppeerr__iipp aanndd wwiitthhoouutt ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_22_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |test add i2p peers | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_3_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt aadddd ii22pp ppeeeerrss ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_33_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |test allow_i2p_mixed | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_4_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt aallllooww__ii22pp__mmiixxeedd ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_44_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |test insert_peer failing with all error conditions | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_5_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt iinnsseerrtt__ppeeeerr ffaaiilliinngg wwiitthh aallll eerrrroorr ccoonnddiittiioonnss ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_55_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |test IPv6 | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_6_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt IIPPvv66 ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_66_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |test connect_to_peer() failing | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_7_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt ccoonnnneecctt__ttoo__ppeeeerr(()) ffaaiilliinngg ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_77_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |test connection_closed | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_8_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt ccoonnnneeccttiioonn__cclloosseedd ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_88_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |connect candidates recalculation when incrementing failcount | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_9_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ccoonnnneecctt ccaannddiiddaatteess rreeccaallccuullaattiioonn wwhheenn iinnccrreemmeennttiinngg ffaaiillccoouunntt ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_99_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___t_r_a_n_s_f_e_r_._c_p_p_:_1_7_3_ _|_t_h_e_s_e_ _s_e_t_t_i_n_g_s___p_a_c_k_ _t_e_s_t_s_ _b_e_l_o_n_g_ _i_n_ _t_h_e_i_r_ _o_w_n_ _t_e_s_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthheessee sseettttiinnggss__ppaacckk tteessttss bbeelloonngg iinn tthheeiirr oowwnn tteesstt ********** | │ │ │ │ │ +|****** ....//tteesstt//tteesstt__ttrraannssffeerr..ccpppp::117733 ****** | │ │ │ │ │ +|// to the time it will take to complete the test | │ │ │ │ │ +| pack.set_int(settings_pack::min_reconnect_time, 0); | │ │ │ │ │ +| pack.set_int(settings_pack::stop_tracker_timeout, 1); | │ │ │ │ │ +| pack.set_bool(settings_pack::announce_to_all_trackers, true); | │ │ │ │ │ +| pack.set_bool(settings_pack::announce_to_all_tiers, true); | │ │ │ │ │ | | │ │ │ │ │ -| std::string certificate = combine_path("..", combine_path("ssl", "peer_certificate.pem")); | │ │ │ │ │ -| std::string private_key = combine_path("..", combine_path("ssl", "peer_private_key.pem")); | │ │ │ │ │ -| std::string dh_params = combine_path("..", combine_path("ssl", "dhparams.pem")); | │ │ │ │ │ +| // make sure we announce to both http and udp trackers | │ │ │ │ │ +| pack.set_bool(settings_pack::prefer_udp_trackers, false); | │ │ │ │ │ +| pack.set_bool(settings_pack::enable_outgoing_utp, false); | │ │ │ │ │ +| pack.set_bool(settings_pack::enable_incoming_utp, false); | │ │ │ │ │ +| pack.set_bool(settings_pack::enable_lsd, false); | │ │ │ │ │ +| pack.set_bool(settings_pack::enable_natpmp, false); | │ │ │ │ │ +| pack.set_bool(settings_pack::enable_upnp, false); | │ │ │ │ │ +| pack.set_bool(settings_pack::enable_dht, false); | │ │ │ │ │ | | │ │ │ │ │ -| if (flags & invalid_certificate) | │ │ │ │ │ -| { | │ │ │ │ │ -| certificate = combine_path("..", combine_path("ssl", "invalid_peer_certificate.pem")); | │ │ │ │ │ -| private_key = combine_path("..", combine_path("ssl", "invalid_peer_private_key.pem")); | │ │ │ │ │ -| } | │ │ │ │ │ +| pack.set_int(settings_pack::out_enc_policy, settings_pack::pe_disabled); | │ │ │ │ │ +| pack.set_int(settings_pack::in_enc_policy, settings_pack::pe_disabled); | │ │ │ │ │ | | │ │ │ │ │ +| pack.set_bool(settings_pack::allow_multiple_connections_per_ip, false); | │ │ │ │ │ | | │ │ │ │ │ -|if (flags & (valid_certificate | invalid_certificate)) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::printf("set_password_callback\n"); | │ │ │ │ │ -| ctx.set_password_callback( | │ │ │ │ │ -| [](std::size_t, context::password_purpose) { return "test"; } | │ │ │ │ │ -| , ec); | │ │ │ │ │ -| if (ec) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::printf("Failed to set certificate passphrase: %s\n" | │ │ │ │ │ -| , ec.message().c_str()); | │ │ │ │ │ -| TEST_CHECK(!ec); | │ │ │ │ │ -| return false; | │ │ │ │ │ -| } | │ │ │ │ │ -| std::printf("use_certificate_file \"%s\"\n", certificate.c_str()); | │ │ │ │ │ -| ctx.use_certificate_file(certificate, context::pem, ec); | │ │ │ │ │ -| if (ec) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::printf("Failed to set certificate file: %s\n" | │ │ │ │ │ -| , ec.message().c_str()); | │ │ │ │ │ -| TEST_CHECK(!ec); | │ │ │ │ │ -| return false; | │ │ │ │ │ -| } | │ │ │ │ │ -| std::printf("use_private_key_file \"%s\"\n", private_key.c_str()); | │ │ │ │ │ -| ctx.use_private_key_file(private_key, context::pem, ec); | │ │ │ │ │ -| if (ec) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::printf("Failed to set private key: %s\n" | │ │ │ │ │ -| , ec.message().c_str()); | │ │ │ │ │ -| TEST_CHECK(!ec); | │ │ │ │ │ -|_ _ _ _r_e_t_u_r_n_ _f_a_l_s_e_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___s_s_l_._c_p_p_:_5_0_9_ _ _ _ _ _ _|_a_l_s_o_ _t_e_s_t_ _u_s_i_n_g_ _a_ _h_a_s_h_ _t_h_a_t_ _r_e_f_e_r_s_ _t_o_ _a_ _v_a_l_i_d_ _t_o_r_r_e_n_t_ _b_u_t_ _t_h_a_t_ _d_i_f_f_e_r_s_ _f_r_o_m_ _t_h_e_ _S_N_I_ _h_a_s_h_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** aallssoo tteesstt uussiinngg aa hhaasshh tthhaatt rreeffeerrss ttoo aa vvaalliidd ttoorrrreenntt bbuutt tthhaatt ddiiffffeerrss ffrroomm tthhee SSNNII hhaasshh ********** | │ │ │ │ │ -|****** ....//tteesstt//tteesstt__ssssll..ccpppp::550099 ****** | │ │ │ │ │ -|print_alerts(ses1, "ses1", true, true, &on_alert); | │ │ │ │ │ -| if (ec) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::printf("Failed SSL handshake: %s\n" | │ │ │ │ │ -| , ec.message().c_str()); | │ │ │ │ │ -| return false; | │ │ │ │ │ -| } | │ │ │ │ │ +|pack.set_int(settings_pack::unchoke_slots_limit, 0); | │ │ │ │ │ +|ses1.apply_settings(pack); | │ │ │ │ │ +| TEST_CHECK(ses1.get_settings().get_int(settings_pack::unchoke_slots_limit) == 0); | │ │ │ │ │ | | │ │ │ │ │ -| char handshake[] = "\x13" "BitTorrent protocol\0\0\0\0\0\0\0\x04" | │ │ │ │ │ -| " " // space for info-hash | │ │ │ │ │ -| "aaaaaaaaaaaaaaaaaaaa" // peer-id | │ │ │ │ │ -| "\0\0\0\x01\x02"; // interested | │ │ │ │ │ +| pack.set_int(settings_pack::unchoke_slots_limit, -1); | │ │ │ │ │ +| ses1.apply_settings(pack); | │ │ │ │ │ +| TEST_CHECK(ses1.get_settings().get_int(settings_pack::unchoke_slots_limit) == -1); | │ │ │ │ │ | | │ │ │ │ │ -| // fill in the info-hash | │ │ │ │ │ -| if (flags & valid_bittorrent_hash) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::memcpy(handshake + 28, &t->info_hashes().v1[0], 20); | │ │ │ │ │ -| } | │ │ │ │ │ -| else | │ │ │ │ │ -| { | │ │ │ │ │ -|std::generate(handshake + 28, handshake + 48, &rand); | │ │ │ │ │ -|} | │ │ │ │ │ +| pack.set_int(settings_pack::unchoke_slots_limit, 8); | │ │ │ │ │ +| ses1.apply_settings(pack); | │ │ │ │ │ +| TEST_CHECK(ses1.get_settings().get_int(settings_pack::unchoke_slots_limit) == 8); | │ │ │ │ │ | | │ │ │ │ │ -| // fill in the peer-id | │ │ │ │ │ -| std::generate(handshake + 48, handshake + 68, &rand); | │ │ │ │ │ +| ses2.apply_settings(pack); | │ │ │ │ │ | | │ │ │ │ │ -| std::printf("bittorrent handshake\n"); | │ │ │ │ │ -| boost::asio::write(ssl_sock, boost::asio::buffer(handshake, (sizeof(handshake) - 1)), ec); | │ │ │ │ │ -| print_alerts(ses1, "ses1", true, true, &on_alert); | │ │ │ │ │ -| if (ec) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::printf("failed to write bittorrent handshake: %s\n" | │ │ │ │ │ -| , ec.message().c_str()); | │ │ │ │ │ -| return false; | │ │ │ │ │ -| } | │ │ │ │ │ +| torrent_handle tor1; | │ │ │ │ │ +| torrent_handle tor2; | │ │ │ │ │ | | │ │ │ │ │ -| char buf[68]; | │ │ │ │ │ -| std::printf("read bittorrent handshake\n"); | │ │ │ │ │ -| boost::asio::read(ssl_sock, boost::asio::buffer(buf, sizeof(buf)), ec); | │ │ │ │ │ -| print_alerts(ses1, "ses1", true, true, &on_alert); | │ │ │ │ │ -| if (ec) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::printf("failed to read bittorrent handshake: %s\n" | │ │ │ │ │ -| , ec.message().c_str()); | │ │ │ │ │ -| return false; | │ │ │ │ │ -| } | │ │ │ │ │ +| create_directory("tmp1_transfer", ec); | │ │ │ │ │ +| std::ofstream file("tmp1_transfer/temporary"); | │ │ │ │ │ +| std::shared_ptr t = ::create_torrent(&file, "temporary", 32 * 1024, 13, false); | │ │ │ │ │ +| file.close(); | │ │ │ │ │ | | │ │ │ │ │ -| if (memcmp(buf, "\x13" "BitTorrent protocol", 20) != 0) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::printf("invalid bittorrent handshake\n"); | │ │ │ │ │ -|_ _ _r_e_t_u_r_n_ _f_a_l_s_e_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___u_p_n_p_._c_p_p_:_1_5_6_ _ _ _ _ _|_s_t_o_r_e_ _t_h_e_ _l_o_g_ _a_n_d_ _v_e_r_i_f_y_ _t_h_a_t_ _s_o_m_e_ _k_e_y_ _m_e_s_s_a_g_e_s_ _a_r_e_ _t_h_e_r_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ssttoorree tthhee lloogg aanndd vveerriiffyy tthhaatt ssoommee kkeeyy mmeessssaaggeess aarree tthheerree ********** | │ │ │ │ │ -|****** ....//tteesstt//tteesstt__uuppnnpp..ccpppp::115566 ****** | │ │ │ │ │ -|, portmap_protocol const protocol, error_code const& err | │ │ │ │ │ -| , portmap_transport, aux::listen_socket_handle const&) override | │ │ │ │ │ -| { | │ │ │ │ │ -| callback_info info = {mapping, port, err}; | │ │ │ │ │ -| callbacks.push_back(info); | │ │ │ │ │ -| std::cout << "mapping: " << static_cast(mapping) | │ │ │ │ │ -| << ", port: " << port << ", IP: " << ip | │ │ │ │ │ -| << ", proto: " << static_cast(protocol) | │ │ │ │ │ -| << ", error: \"" << err.message() << "\"\n"; | │ │ │ │ │ -| } | │ │ │ │ │ -| #ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| bool should_log_portmap(portmap_transport) const override | │ │ │ │ │ -| { | │ │ │ │ │ -| return true; | │ │ │ │ │ -| } | │ │ │ │ │ +| TEST_CHECK(exists(combine_path("tmp1_transfer", "temporary"))); | │ │ │ │ │ | | │ │ │ │ │ -| void log_portmap(portmap_transport, char const* msg | │ │ │ │ │ -| , aux::listen_socket_handle const&) const override | │ │ │ │ │ -| { | │ │ │ │ │ -| std::cout << "UPnP: " << msg << std::endl; | │ │ │ │ │ -|} | │ │ │ │ │ -|#endif | │ │ │ │ │ -| }; | │ │ │ │ │ +| add_torrent_params params; | │ │ │ │ │ +| params.storage_mode = storage_mode; | │ │ │ │ │ +| params.flags &= ~torrent_flags::paused; | │ │ │ │ │ +| params.flags &= ~torrent_flags::auto_managed; | │ │ │ │ │ | | │ │ │ │ │ -|ip_interface pick_upnp_interface() | │ │ │ │ │ +| wait_for_listen(ses1, "ses1"); | │ │ │ │ │ +|_ _w_a_i_t___f_o_r___l_i_s_t_e_n_(_s_e_s_2_,_ _"_s_e_s_2_"_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___r_e_s_u_m_e_._c_p_p_:_5_8_2_ _ _ _|_t_e_s_t_ _w_h_a_t_ _h_a_p_p_e_n_s_ _w_h_e_n_ _l_o_a_d_i_n_g_ _a_ _r_e_s_u_m_e_ _f_i_l_e_ _w_i_t_h_ _b_o_t_h_ _p_i_e_c_e_ _p_r_i_o_r_i_t_i_e_s_ _a_n_d_ _f_i_l_e_ _p_r_i_o_r_i_t_i_e_s_ _(_f_i_l_e_ _p_r_i_o_ _s_h_o_u_l_d_ _t_a_k_e_ _p_r_e_c_e_d_e_n_c_e_)_ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt wwhhaatt hhaappppeennss wwhheenn llooaaddiinngg aa rreessuummee ffiillee wwiitthh bbootthh ppiieeccee pprriioorriittiieess aanndd ffiillee pprriioorriittiieess ((ffiillee pprriioo sshhoouulldd ttaakkee pprreecceeddeennccee)) ********** | │ │ │ │ │ +|****** ....//tteesstt//tteesstt__rreessuummee..ccpppp::558822 ****** | │ │ │ │ │ |{ | │ │ │ │ │ -| lt::io_context ios; | │ │ │ │ │ -| error_code ec; | │ │ │ │ │ -| std::vector const routes = enum_routes(ios, ec); | │ │ │ │ │ -| if (ec) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::cerr << "failed to enumerate routes: " << ec.message() << '\n'; | │ │ │ │ │ -| TEST_CHECK(false); | │ │ │ │ │ -| return {}; | │ │ │ │ │ -| } | │ │ │ │ │ -| std::vector const ifs = enum_net_interfaces(ios, ec); | │ │ │ │ │ -| if (ec) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::cerr << "failed to enumerate network interfaces: " << ec.message() << '\n'; | │ │ │ │ │ -| TEST_CHECK(false); | │ │ │ │ │ -| return {}; | │ │ │ │ │ +| TEST_EQUAL(pieces[i], true); | │ │ │ │ │ +| } | │ │ │ │ │ | } | │ │ │ │ │ -| int idx = 0; | │ │ │ │ │ -| for (auto const& face : ifs) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (!face.interface_address.is_v4()) continue; | │ │ │ │ │ -| std::cout << " - " << idx | │ │ │ │ │ -| << ' ' << face.interface_address.to_string() | │ │ │ │ │ -| << ' ' << int(static_cast(face.state)) | │ │ │ │ │ -| << ' ' << static_cast(face.flags) | │ │ │ │ │ -|_ _ _ _<_<_ _'_ _'_ _<_<_ _f_a_c_e_._n_a_m_e_ _<_<_ _'_\_n_'_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___b_l_o_o_m___f_i_l_t_e_r_._c_p_p_:|test size() | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_1_3_5_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt ssiizzee(()) ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____bb_ll_oo_oo_mm____ff_ii_ll_tt_ee_rr_.._cc_pp_pp_::_11_33_55_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___b_l_o_o_m___f_i_l_t_e_r_._c_p_p_:|test clear() | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_1_3_6_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt cclleeaarr(()) ********** | │ │ │ │ │ -|****** ....//tteesstt//tteesstt__bblloooomm__ffiilltteerr..ccpppp::113366 ****** | │ │ │ │ │ -|sha1_hash k("\x01\x00\x02\x00 "); | │ │ │ │ │ -| TEST_CHECK(!filter.find(k)); | │ │ │ │ │ -| filter.set(k); | │ │ │ │ │ -| TEST_CHECK(filter.find(k)); | │ │ │ │ │ -| | │ │ │ │ │ -| std::uint8_t compare[4] = { 0x16, 0xff, 0x55, 0xaa}; | │ │ │ │ │ -| | │ │ │ │ │ -| bits_out = filter.to_string(); | │ │ │ │ │ -| TEST_EQUAL(memcmp(compare, bits_out.c_str(), 4), 0); | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ |} // anonymous namespace | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(bloom_filter) | │ │ │ │ │ +|TORRENT_TEST(piece_slots_seed) | │ │ │ │ │ |{ | │ │ │ │ │ -| test_set_and_get(); | │ │ │ │ │ -| test_set_bits(); | │ │ │ │ │ -| test_count_zeroes(); | │ │ │ │ │ -| test_to_from_string(); | │ │ │ │ │ +| test_piece_slots_seed(settings()); | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -|_}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___m_e_r_k_l_e___t_r_e_e_._c_p_p_: |use structured bindings in C++17 | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_2_3_3_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** uussee ssttrruuccttuurreedd bbiinnddiinnggss iinn CC++++1177 ********** | │ │ │ │ │ -|****** ....//tteesstt//tteesstt__mmeerrkkllee__ttrreeee..ccpppp::223333 ****** | │ │ │ │ │ -|mask[std::size_t(i)] = true; | │ │ │ │ │ -| t.load_sparse_tree(span(f).subspan(first_piece, num_pieces), mask, empty_verified); | │ │ │ │ │ -| int const end_piece_layer = first_piece + merkle_num_leafs(num_pieces); | │ │ │ │ │ -| for (int i = 0; i < end_piece_layer; ++i) | │ │ │ │ │ -| { | │ │ │ │ │ -| TEST_CHECK(t.has_node(i)); | │ │ │ │ │ -| TEST_CHECK(t.compare_node(i, f[i])); | │ │ │ │ │ -| } | │ │ │ │ │ -| for (int i = end_piece_layer; i < num_nodes; ++i) | │ │ │ │ │ -| { | │ │ │ │ │ -| TEST_CHECK(!t.has_node(i)); | │ │ │ │ │ +|TORRENT_TEST(piece_slots_seed_suggest_cache) | │ │ │ │ │ +|{ | │ │ │ │ │ +| settings_pack sett = settings(); | │ │ │ │ │ +| sett.set_int(settings_pack::suggest_mode, settings_pack::suggest_read_cache); | │ │ │ │ │ +| test_piece_slots_seed(sett); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___r_e_s_u_m_e_._c_p_p_:_5_8_5_ _ _ _|_m_a_k_e_ _s_u_r_e_ _a_ _r_e_s_u_m_e_ _f_i_l_e_ _o_n_l_y_ _e_v_e_r_ _c_o_n_t_a_i_n_ _f_i_l_e_ _p_r_i_o_r_i_t_i_e_s_ _O_R_ _p_i_e_c_e_ _p_r_i_o_r_i_t_i_e_s_._ _N_e_v_e_r_ _b_o_t_h_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** mmaakkee ssuurree aa rreessuummee ffiillee oonnllyy eevveerr ccoonnttaaiinn ffiillee pprriioorriittiieess OORR ppiieeccee pprriioorriittiieess.. NNeevveerr bbootthh.. ********** | │ │ │ │ │ +|****** ....//tteesstt//tteesstt__rreessuummee..ccpppp::558855 ****** | │ │ │ │ │ +|TEST_EQUAL(pieces[i], true); | │ │ │ │ │ | } | │ │ │ │ │ | } | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ -|namespace { | │ │ │ │ │ -|void test_roundtrip(aux::merkle_tree const& t | │ │ │ │ │ -| , int const block_count | │ │ │ │ │ -| , int const blocks_per_piece) | │ │ │ │ │ -|{ | │ │ │ │ │ -|aux::vector mask; | │ │ │ │ │ -|std::vector tree; | │ │ │ │ │ -| std::tie(tree, mask) = t.build_sparse_vector(); | │ │ │ │ │ +|} // anonymous namespace | │ │ │ │ │ | | │ │ │ │ │ -| aux::merkle_tree t2(block_count, blocks_per_piece, f[0].data()); | │ │ │ │ │ -| t2.load_sparse_tree(tree, mask, empty_verified); | │ │ │ │ │ +|TORRENT_TEST(piece_slots_seed) | │ │ │ │ │ +|{ | │ │ │ │ │ +| test_piece_slots_seed(settings()); | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -| TEST_CHECK(t.build_vector() == t2.build_vector()); | │ │ │ │ │ -| for (int i = 0; i < int(t.size()); ++i) | │ │ │ │ │ -| { | │ │ │ │ │ -| TEST_EQUAL(t[i], t2[i]); | │ │ │ │ │ -| TEST_EQUAL(t.has_node(i), t2.has_node(i)); | │ │ │ │ │ +|TORRENT_TEST(piece_slots_seed_suggest_cache) | │ │ │ │ │ +|{ | │ │ │ │ │ +| settings_pack sett = settings(); | │ │ │ │ │ +| sett.set_int(settings_pack::suggest_mode, settings_pack::suggest_read_cache); | │ │ │ │ │ +| test_piece_slots_seed(sett); | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -| if (!t.has_node(i)) | │ │ │ │ │ -| TEST_CHECK(t[i].is_all_zeros()); | │ │ │ │ │ -| if (!t2.has_node(i)) | │ │ │ │ │ -| TEST_CHECK(t2[i].is_all_zeros()); | │ │ │ │ │ | | │ │ │ │ │ -| TEST_CHECK(t.compare_node(i, t2[i])); | │ │ │ │ │ -| TEST_CHECK(t2.compare_node(i, t[i])); | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___r_e_s_u_m_e_._c_p_p_:_5_8_8_ _ _ _|_g_e_n_e_r_a_l_l_y_ _s_a_v_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ggeenneerraallllyy ssaavvee ********** | │ │ │ │ │ +|****** ....//tteesstt//tteesstt__rreessuummee..ccpppp::558888 ****** | │ │ │ │ │ +|} | │ │ │ │ │ | } | │ │ │ │ │ |} | │ │ │ │ │ +| | │ │ │ │ │ +|} // anonymous namespace | │ │ │ │ │ +| | │ │ │ │ │ +|TORRENT_TEST(piece_slots_seed) | │ │ │ │ │ +|{ | │ │ │ │ │ +| test_piece_slots_seed(settings()); | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(roundtrip_empty_tree) | │ │ │ │ │ +|TORRENT_TEST(piece_slots_seed_suggest_cache) | │ │ │ │ │ |{ | │ │ │ │ │ -| aux::merkle_tree t(num_blocks, 1, f[0].data()); | │ │ │ │ │ -| test_roundtrip(t, num_blocks, 1); | │ │ │ │ │ +| settings_pack sett = settings(); | │ │ │ │ │ +| sett.set_int(settings_pack::suggest_mode, settings_pack::suggest_read_cache); | │ │ │ │ │ +| test_piece_slots_seed(sett); | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ -|_T_O_R_R_E_N_T___T_E_S_T_(_r_o_u_n_d_t_r_i_p___f_u_l_l___t_r_e_e_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___m_e_r_k_l_e___t_r_e_e_._c_p_p_: |add test for load_piece_layer() | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_9_3_8_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** aadddd tteesstt ffoorr llooaadd__ppiieeccee__llaayyeerr(()) ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____mm_ee_rr_kk_ll_ee____tt_rr_ee_ee_.._cc_pp_pp_::_99_33_88_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___m_e_r_k_l_e___t_r_e_e_._c_p_p_: |add test for add_hashes() with an odd number of blocks | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_9_3_9_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** aadddd tteesstt ffoorr aadddd__hhaasshheess(()) wwiitthh aann oodddd nnuummbbeerr ooff bblloocckkss ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____mm_ee_rr_kk_ll_ee____tt_rr_ee_ee_.._cc_pp_pp_::_99_33_99_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___m_e_r_k_l_e___t_r_e_e_._c_p_p_: |add test for set_block() (setting the last block) with an odd number of blocks | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_9_4_0_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** aadddd tteesstt ffoorr sseett__bblloocckk(()) ((sseettttiinngg tthhee llaasstt bblloocckk)) wwiitthh aann oodddd nnuummbbeerr ooff bblloocckkss ********** | │ │ │ │ │ -|****** ....//tteesstt//tteesstt__mmeerrkkllee__ttrreeee..ccpppp::994400 ****** | │ │ │ │ │ -| for (int i = 0; i < 7; ++i) | │ │ │ │ │ -| TEST_EQUAL(t[i], f[i]); | │ │ │ │ │ -| } | │ │ │ │ │ | | │ │ │ │ │ -| // use a proof that ties the first piece node 3 (since we don't need it all | │ │ │ │ │ -| // the way to the root). | │ │ │ │ │ -| auto const result = t.add_hashes(127, pdiff(1), range(f, 127, 4), build_proof(f, 31, 3)); | │ │ │ │ │ -| TEST_CHECK(result); | │ │ │ │ │ | | │ │ │ │ │ -| auto const& res = *result; | │ │ │ │ │ -| TEST_EQUAL(res.passed.size(), 0); | │ │ │ │ │ -| TEST_EQUAL(res.failed.size(), 0); | │ │ │ │ │ | | │ │ │ │ │ -| for (int i = 127; i < 127 + 4; ++i) | │ │ │ │ │ -| TEST_CHECK(t[i] == f[i]); | │ │ │ │ │ +|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ +|TORRENT_TEST(file_priorities_default_deprecated) | │ │ │ │ │ +|{ | │ │ │ │ │ +| lt::session ses(settings()); | │ │ │ │ │ +| std::vector file_priorities = test_resume_flags(ses | │ │ │ │ │ +| , {}, "", "", true).get_file_priorities(); | │ │ │ │ │ | | │ │ │ │ │ -| TEST_CHECK(t.verified_leafs() == none_set(num_blocks)); | │ │ │ │ │ +| TEST_EQUAL(file_priorities.size(), 3); | │ │ │ │ │ +| TEST_EQUAL(file_priorities[0], 4); | │ │ │ │ │ +| TEST_EQUAL(file_priorities[1], 4); | │ │ │ │ │ +| TEST_EQUAL(file_priorities[2], 4); | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___f_i_l_e___s_t_o_r_a_g_e_._c_p_p_:|test file attributes | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_0_8_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt ffiillee aattttrriibbuutteess ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____ff_ii_ll_ee____ss_tt_oo_rr_aa_gg_ee_.._cc_pp_pp_::_11_22_00_88_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___f_i_l_e___s_t_o_r_a_g_e_._c_p_p_:|test symlinks | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_0_9_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt ssyymmlliinnkkss ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____ff_ii_ll_ee____ss_tt_oo_rr_aa_gg_ee_.._cc_pp_pp_::_11_22_00_99_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___t_o_r_r_e_n_t___i_n_f_o_._c_p_p_:|test remap_files | │ │ │ │ │ +|// As long as the add_torrent_params priorities are empty, the file_priorities | │ │ │ │ │ +|// from the resume data should take effect | │ │ │ │ │ +|TORRENT_TEST(file_priorities_in_resume_deprecated) | │ │ │ │ │ +|{ | │ │ │ │ │ +| lt::session ses(settings()); | │ │ │ │ │ +| std::vector file_priorities = test_resume_flags(ses, {}, "", "123").get_file_priorities(); | │ │ │ │ │ +| | │ │ │ │ │ +| TEST_EQUAL(file_priorities.size(), 3); | │ │ │ │ │ +| TEST_EQUAL(file_priorities[0], 1); | │ │ │ │ │ +| TEST_EQUAL(file_priorities[1], 2); | │ │ │ │ │ +| TEST_EQUAL(file_priorities[2], 3); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|// if both resume data and add_torrent_params has file_priorities, the | │ │ │ │ │ +|// add_torrent_params one take precedence | │ │ │ │ │ +|TORRENT_TEST(file_priorities_in_resume_and_params_deprecated) | │ │ │ │ │ +|_{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___r_e_s_u_m_e_._c_p_p_:_9_1_1 |test all other resume flags here too. This would require returning more than just the torrent_status from test_resume_flags. Also | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_h_t_t_p_ _s_e_e_d_s_ _a_n_d_ _t_r_a_c_k_e_r_s_ _f_o_r_ _i_n_s_t_a_n_c_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt aallll ootthheerr rreessuummee ffllaaggss hheerree ttoooo.. TThhiiss wwoouulldd rreeqquuiirree rreettuurrnniinngg mmoorree tthhaann jjuusstt tthhee ttoorrrreenntt__ssttaattuuss ffrroomm tteesstt__rreessuummee__ffllaaggss.. AAllssoo hhttttpp sseeeeddss aanndd ttrraacckkeerrss ffoorr iinnssttaannccee | │ │ │ │ │ +|********** | │ │ │ │ │ +|****** ....//tteesstt//tteesstt__rreessuummee..ccpppp::991111 ****** | │ │ │ │ │ +|TEST_EQUAL(s.connections_limit, 1345); | │ │ │ │ │ +| TEST_EQUAL(s.uploads_limit, 1346); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|TORRENT_TEST(paused_deprecated) | │ │ │ │ │ +|{ | │ │ │ │ │ +| lt::session ses(settings()); | │ │ │ │ │ +| // resume data overrides the paused flag | │ │ │ │ │ +| auto const now = lt::clock_type::now(); | │ │ │ │ │ +| torrent_status s = test_resume_flags(ses, torrent_flags::paused, "", "", true).status(); | │ │ │ │ │ +| default_tests(s, now); | │ │ │ │ │ +|#ifdef TORRENT_WINDOWS | │ │ │ │ │ +| TEST_EQUAL(s.save_path, "c:\\add_torrent_params save_path"); | │ │ │ │ │ +|#else | │ │ │ │ │ +| TEST_EQUAL(s.save_path, "/add_torrent_params save_path"); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| TEST_EQUAL(s.flags & flags_mask, torrent_flags_t{}); | │ │ │ │ │ +| TEST_EQUAL(s.connections_limit, 1345); | │ │ │ │ │ +| TEST_EQUAL(s.uploads_limit, 1346); | │ │ │ │ │ +| | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|TORRENT_TEST(url_seed_resume_data_deprecated) | │ │ │ │ │ +|{ | │ │ │ │ │ +| // merge url seeds with resume data | │ │ │ │ │ +| std::printf("flags: merge_resume_http_seeds\n"); | │ │ │ │ │ +| lt::session ses(settings()); | │ │ │ │ │ +| torrent_handle h = test_resume_flags(ses, | │ │ │ │ │ +| torrent_flags::merge_resume_http_seeds, "", "", true); | │ │ │ │ │ +| std::set us = h.url_seeds(); | │ │ │ │ │ +| std::set ws = h.http_seeds(); | │ │ │ │ │ +| | │ │ │ │ │ +| TEST_EQUAL(us.size(), 3); | │ │ │ │ │ +| TEST_EQUAL(std::count(us.begin(), us.end() | │ │ │ │ │ +| , "http://add_torrent_params_url_seed.com/"), 1); | │ │ │ │ │ +| TEST_EQUAL(std::count(us.begin(), us.end() | │ │ │ │ │ +| , "http://torrent_file_url_seed.com/"), 1); | │ │ │ │ │ +| TEST_EQUAL(std::count(us.begin(), us.end() | │ │ │ │ │ +| , "http://resume_data_url_seed.com/"), 1); | │ │ │ │ │ +| | │ │ │ │ │ +| TEST_EQUAL(ws.size(), 1); | │ │ │ │ │ +| TEST_EQUAL(std::count(ws.begin(), ws.end() | │ │ │ │ │ +| , "http://resume_data_http_seed.com"), 1); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|TORRENT_TEST(resume_override_torrent_deprecated) | │ │ │ │ │ +|{ | │ │ │ │ │ +| // resume data overrides the .torrent_file | │ │ │ │ │ +| std::printf("flags: no merge_resume_http_seed\n"); | │ │ │ │ │ +| lt::session ses(settings()); | │ │ │ │ │ +|_ _t_o_r_r_e_n_t___h_a_n_d_l_e_ _h_ _=_ _t_e_s_t___r_e_s_u_m_e___f_l_a_g_s_(_s_e_s_,_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___r_e_s_u_m_e_._c_p_p_:_1_6_8_3 |test all other resume flags here too. This would require returning more than just the torrent_status from test_resume_flags. Also | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_h_t_t_p_ _s_e_e_d_s_ _a_n_d_ _t_r_a_c_k_e_r_s_ _f_o_r_ _i_n_s_t_a_n_c_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt aallll ootthheerr rreessuummee ffllaaggss hheerree ttoooo.. TThhiiss wwoouulldd rreeqquuiirree rreettuurrnniinngg mmoorree tthhaann jjuusstt tthhee ttoorrrreenntt__ssttaattuuss ffrroomm tteesstt__rreessuummee__ffllaaggss.. AAllssoo hhttttpp sseeeeddss aanndd ttrraacckkeerrss ffoorr iinnssttaannccee | │ │ │ │ │ +|********** | │ │ │ │ │ +|****** ....//tteesstt//tteesstt__rreessuummee..ccpppp::11668833 ****** | │ │ │ │ │ +|TEST_EQUAL(s.connections_limit, 1345); | │ │ │ │ │ +| TEST_EQUAL(s.uploads_limit, 1346); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|TORRENT_TEST(paused) | │ │ │ │ │ +|{ | │ │ │ │ │ +| lt::session ses(settings()); | │ │ │ │ │ +| // resume data overrides the paused flag | │ │ │ │ │ +| auto const now = lt::clock_type::now(); | │ │ │ │ │ +| torrent_status s = test_resume_flags(ses, torrent_flags::paused).status(); | │ │ │ │ │ +| default_tests(s, now); | │ │ │ │ │ +|#ifdef TORRENT_WINDOWS | │ │ │ │ │ +| TEST_EQUAL(s.save_path, "c:\\add_torrent_params save_path"); | │ │ │ │ │ +|#else | │ │ │ │ │ +| TEST_EQUAL(s.save_path, "/add_torrent_params save_path"); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| TEST_EQUAL(s.flags & flags_mask, torrent_flags::paused); | │ │ │ │ │ +| TEST_EQUAL(s.connections_limit, 1345); | │ │ │ │ │ +| TEST_EQUAL(s.uploads_limit, 1346); | │ │ │ │ │ +| | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|TORRENT_TEST(no_metadata) | │ │ │ │ │ +|{ | │ │ │ │ │ +| lt::session ses(settings()); | │ │ │ │ │ +| | │ │ │ │ │ +| add_torrent_params p; | │ │ │ │ │ +| p.info_hashes.v1 = sha1_hash("abababababababababab"); | │ │ │ │ │ +| p.save_path = "."; | │ │ │ │ │ +| p.name = "foobar"; | │ │ │ │ │ +| torrent_handle h = ses.add_torrent(p); | │ │ │ │ │ +| h.save_resume_data(torrent_handle::save_info_dict); | │ │ │ │ │ +| alert const* a = wait_for_alert(ses, save_resume_data_alert::alert_type); | │ │ │ │ │ +| TEST_CHECK(a); | │ │ │ │ │ +| save_resume_data_alert const* ra = alert_cast(a); | │ │ │ │ │ +| TEST_CHECK(ra); | │ │ │ │ │ +| if (ra) | │ │ │ │ │ +| { | │ │ │ │ │ +| auto const& atp = ra->params; | │ │ │ │ │ +| TEST_EQUAL(atp.info_hashes, p.info_hashes); | │ │ │ │ │ +| TEST_EQUAL(atp.name, "foobar"); | │ │ │ │ │ +| } | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|template | │ │ │ │ │ +|void test_unfinished_pieces(Fun f) | │ │ │ │ │ +|{ | │ │ │ │ │ +| // create a torrent and complete files | │ │ │ │ │ +| std::shared_ptr ti = generate_torrent(true, true); | │ │ │ │ │ +| | │ │ │ │ │ +|_ _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s_ _p_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/ |test sending invalid requests (out of bound piece index, offsets and sizes) | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_t_e_s_t___f_a_s_t___e_x_t_e_n_s_i_o_n_._c_p_p_:_1_1_3_5_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt sseennddiinngg iinnvvaalliidd rreeqquueessttss ((oouutt ooff bboouunndd ppiieeccee iinnddeexx,, ooffffsseettss aanndd ssiizzeess)) ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____ff_aa_ss_tt____ee_xx_tt_ee_nn_ss_ii_oo_nn_.._cc_pp_pp_::_11_11_33_55_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___m_e_r_k_l_e___t_r_e_e_._c_p_p_: |use structured bindings in C++17 | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_2_3_3_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** uussee ssttrruuccttuurreedd bbiinnddiinnggss iinn CC++++1177 ********** | │ │ │ │ │ +|****** ....//tteesstt//tteesstt__mmeerrkkllee__ttrreeee..ccpppp::223333 ****** | │ │ │ │ │ +|mask[std::size_t(i)] = true; | │ │ │ │ │ +| t.load_sparse_tree(span(f).subspan(first_piece, num_pieces), mask, empty_verified); | │ │ │ │ │ +| int const end_piece_layer = first_piece + merkle_num_leafs(num_pieces); | │ │ │ │ │ +| for (int i = 0; i < end_piece_layer; ++i) | │ │ │ │ │ +| { | │ │ │ │ │ +| TEST_CHECK(t.has_node(i)); | │ │ │ │ │ +| TEST_CHECK(t.compare_node(i, f[i])); | │ │ │ │ │ +| } | │ │ │ │ │ +| for (int i = end_piece_layer; i < num_nodes; ++i) | │ │ │ │ │ +| { | │ │ │ │ │ +| TEST_CHECK(!t.has_node(i)); | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|namespace { | │ │ │ │ │ +|void test_roundtrip(aux::merkle_tree const& t | │ │ │ │ │ +| , int const block_count | │ │ │ │ │ +| , int const blocks_per_piece) | │ │ │ │ │ +|{ | │ │ │ │ │ +|aux::vector mask; | │ │ │ │ │ +|std::vector tree; | │ │ │ │ │ +| std::tie(tree, mask) = t.build_sparse_vector(); | │ │ │ │ │ +| | │ │ │ │ │ +| aux::merkle_tree t2(block_count, blocks_per_piece, f[0].data()); | │ │ │ │ │ +| t2.load_sparse_tree(tree, mask, empty_verified); | │ │ │ │ │ +| | │ │ │ │ │ +| TEST_CHECK(t.build_vector() == t2.build_vector()); | │ │ │ │ │ +| for (int i = 0; i < int(t.size()); ++i) | │ │ │ │ │ +| { | │ │ │ │ │ +| TEST_EQUAL(t[i], t2[i]); | │ │ │ │ │ +| TEST_EQUAL(t.has_node(i), t2.has_node(i)); | │ │ │ │ │ +| | │ │ │ │ │ +| if (!t.has_node(i)) | │ │ │ │ │ +| TEST_CHECK(t[i].is_all_zeros()); | │ │ │ │ │ +| if (!t2.has_node(i)) | │ │ │ │ │ +| TEST_CHECK(t2[i].is_all_zeros()); | │ │ │ │ │ +| | │ │ │ │ │ +| TEST_CHECK(t.compare_node(i, t2[i])); | │ │ │ │ │ +| TEST_CHECK(t2.compare_node(i, t[i])); | │ │ │ │ │ +| } | │ │ │ │ │ +|} | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|TORRENT_TEST(roundtrip_empty_tree) | │ │ │ │ │ +|{ | │ │ │ │ │ +| aux::merkle_tree t(num_blocks, 1, f[0].data()); | │ │ │ │ │ +| test_roundtrip(t, num_blocks, 1); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|_T_O_R_R_E_N_T___T_E_S_T_(_r_o_u_n_d_t_r_i_p___f_u_l_l___t_r_e_e_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___m_e_r_k_l_e___t_r_e_e_._c_p_p_: |add test for load_piece_layer() | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_9_3_8_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** aadddd tteesstt ffoorr llooaadd__ppiieeccee__llaayyeerr(()) ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____mm_ee_rr_kk_ll_ee____tt_rr_ee_ee_.._cc_pp_pp_::_99_33_88_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___m_e_r_k_l_e___t_r_e_e_._c_p_p_: |add test for add_hashes() with an odd number of blocks | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_9_3_9_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** aadddd tteesstt ffoorr aadddd__hhaasshheess(()) wwiitthh aann oodddd nnuummbbeerr ooff bblloocckkss ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____mm_ee_rr_kk_ll_ee____tt_rr_ee_ee_.._cc_pp_pp_::_99_33_99_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___m_e_r_k_l_e___t_r_e_e_._c_p_p_: |add test for set_block() (setting the last block) with an odd number of blocks | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_9_4_0_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** aadddd tteesstt ffoorr sseett__bblloocckk(()) ((sseettttiinngg tthhee llaasstt bblloocckk)) wwiitthh aann oodddd nnuummbbeerr ooff bblloocckkss ********** | │ │ │ │ │ +|****** ....//tteesstt//tteesstt__mmeerrkkllee__ttrreeee..ccpppp::994400 ****** | │ │ │ │ │ +| for (int i = 0; i < 7; ++i) | │ │ │ │ │ +| TEST_EQUAL(t[i], f[i]); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| // use a proof that ties the first piece node 3 (since we don't need it all | │ │ │ │ │ +| // the way to the root). | │ │ │ │ │ +| auto const result = t.add_hashes(127, pdiff(1), range(f, 127, 4), build_proof(f, 31, 3)); | │ │ │ │ │ +| TEST_CHECK(result); | │ │ │ │ │ +| | │ │ │ │ │ +| auto const& res = *result; | │ │ │ │ │ +| TEST_EQUAL(res.passed.size(), 0); | │ │ │ │ │ +| TEST_EQUAL(res.failed.size(), 0); | │ │ │ │ │ +| | │ │ │ │ │ +| for (int i = 127; i < 127 + 4; ++i) | │ │ │ │ │ +| TEST_CHECK(t[i] == f[i]); | │ │ │ │ │ +| | │ │ │ │ │ +| TEST_CHECK(t.verified_leafs() == none_set(num_blocks)); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___f_i_l_e___s_t_o_r_a_g_e_._c_p_p_:|test file attributes | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_0_8_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt ffiillee aattttrriibbuutteess ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____ff_ii_ll_ee____ss_tt_oo_rr_aa_gg_ee_.._cc_pp_pp_::_11_22_00_88_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___f_i_l_e___s_t_o_r_a_g_e_._c_p_p_:|test symlinks | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_0_9_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt ssyymmlliinnkkss ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____ff_ii_ll_ee____ss_tt_oo_rr_aa_gg_ee_.._cc_pp_pp_::_11_22_00_99_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___t_o_r_r_e_n_t___i_n_f_o_._c_p_p_:|test remap_files | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_4_5_9_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** tteesstt rreemmaapp__ffiilleess ********** | │ │ │ │ │ |_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____tt_oo_rr_rr_ee_nn_tt____ii_nn_ff_oo_.._cc_pp_pp_::_44_55_99_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 0|_._._/_t_e_s_t_/_t_e_s_t___t_o_r_r_e_n_t___i_n_f_o_._c_p_p_:|torrent with 'p' (padfile) attribute | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_4_6_0_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** ttoorrrreenntt wwiitthh ''pp'' ((ppaaddffiillee)) aattttrriibbuuttee ********** | │ │ │ │ │ |_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____tt_oo_rr_rr_ee_nn_tt____ii_nn_ff_oo_.._cc_pp_pp_::_44_66_00_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ @@ -5285,68 +5402,94 @@ │ │ │ │ │ | entry::list_type l; | │ │ │ │ │ | l.push_back(entry("http://foo.com/bar1")); | │ │ │ │ │ | l.push_back(entry("http://foo.com/bar1")); | │ │ │ │ │ | l.push_back(entry("http://foo.com/bar2")); | │ │ │ │ │ | entry const e(l); | │ │ │ │ │ | entry torrent; | │ │ │ │ │ |_ _t_o_r_r_e_n_t_[_"_u_r_l_-_l_i_s_t_"_]_ _=_ _e_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___t_r_a_n_s_f_e_r_._c_p_p_:_1_7_3_ _|_t_h_e_s_e_ _s_e_t_t_i_n_g_s___p_a_c_k_ _t_e_s_t_s_ _b_e_l_o_n_g_ _i_n_ _t_h_e_i_r_ _o_w_n_ _t_e_s_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthheessee sseettttiinnggss__ppaacckk tteessttss bbeelloonngg iinn tthheeiirr oowwnn tteesstt ********** | │ │ │ │ │ -|****** ....//tteesstt//tteesstt__ttrraannssffeerr..ccpppp::117733 ****** | │ │ │ │ │ -|// to the time it will take to complete the test | │ │ │ │ │ -| pack.set_int(settings_pack::min_reconnect_time, 0); | │ │ │ │ │ -| pack.set_int(settings_pack::stop_tracker_timeout, 1); | │ │ │ │ │ -| pack.set_bool(settings_pack::announce_to_all_trackers, true); | │ │ │ │ │ -| pack.set_bool(settings_pack::announce_to_all_tiers, true); | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/ |test files with different piece size (negative test) | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_t_e_s_t___r_e_s_o_l_v_e___l_i_n_k_s_._c_p_p_:_9_5_ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt ffiilleess wwiitthh ddiiffffeerreenntt ppiieeccee ssiizzee ((nneeggaattiivvee tteesstt)) ********** | │ │ │ │ │ +|****** ....//tteesstt//tteesstt__rreessoollvvee__lliinnkkss..ccpppp::9955 ****** | │ │ │ │ │ +|{ "test2", "test1_pad_files", 0}, | │ │ │ │ │ +| { "test3", "test1_pad_files", 0}, | │ │ │ │ │ +| { "test2", "test1_single", 0}, | │ │ │ │ │ | | │ │ │ │ │ -| // make sure we announce to both http and udp trackers | │ │ │ │ │ -| pack.set_bool(settings_pack::prefer_udp_trackers, false); | │ │ │ │ │ -| pack.set_bool(settings_pack::enable_outgoing_utp, false); | │ │ │ │ │ -| pack.set_bool(settings_pack::enable_incoming_utp, false); | │ │ │ │ │ -| pack.set_bool(settings_pack::enable_lsd, false); | │ │ │ │ │ -| pack.set_bool(settings_pack::enable_natpmp, false); | │ │ │ │ │ -| pack.set_bool(settings_pack::enable_upnp, false); | │ │ │ │ │ -| pack.set_bool(settings_pack::enable_dht, false); | │ │ │ │ │ +| // these are all padded. The first small file will accidentally also | │ │ │ │ │ +| // match, even though it's not tail padded, the following file is identical | │ │ │ │ │ +| { "test2_pad_files", "test1_pad_files", 2}, | │ │ │ │ │ +| { "test3_pad_files", "test1_pad_files", 2}, | │ │ │ │ │ +| { "test3_pad_files", "test2_pad_files", 2}, | │ │ │ │ │ +| { "test1_pad_files", "test2_pad_files", 2}, | │ │ │ │ │ +| { "test1_pad_files", "test3_pad_files", 2}, | │ │ │ │ │ +| { "test2_pad_files", "test3_pad_files", 2}, | │ │ │ │ │ | | │ │ │ │ │ -| pack.set_int(settings_pack::out_enc_policy, settings_pack::pe_disabled); | │ │ │ │ │ -| pack.set_int(settings_pack::in_enc_policy, settings_pack::pe_disabled); | │ │ │ │ │ +| // one might expect this to work, but since the tail of the single file | │ │ │ │ │ +| // torrent is not padded, the last piece hash won't match | │ │ │ │ │ +| { "test1_pad_files", "test1_single", 0}, | │ │ │ │ │ | | │ │ │ │ │ -| pack.set_bool(settings_pack::allow_multiple_connections_per_ip, false); | │ │ │ │ │ +| // if it's padded on the other hand, it will work | │ │ │ │ │ +| { "test1_pad_files", "test1_single_padded", 1}, | │ │ │ │ │ | | │ │ │ │ │ -|pack.set_int(settings_pack::unchoke_slots_limit, 0); | │ │ │ │ │ -|ses1.apply_settings(pack); | │ │ │ │ │ -| TEST_CHECK(ses1.get_settings().get_int(settings_pack::unchoke_slots_limit) == 0); | │ │ │ │ │ +|_}_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/ |it would be nice to test resolving of more than just 2 files as well. like 3 single file torrents merged into one, resolving all 3 | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_t_e_s_t___r_e_s_o_l_v_e___l_i_n_k_s_._c_p_p_:_9_8_ _ _ _ _ _|_f_i_l_e_s_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iitt wwoouulldd bbee nniiccee ttoo tteesstt rreessoollvviinngg ooff mmoorree tthhaann jjuusstt 22 ffiilleess aass wweellll.. lliikkee 33 ssiinnggllee ffiillee ttoorrrreennttss mmeerrggeedd iinnttoo oonnee,, rreessoollvviinngg aallll 33 ffiilleess.. ********** | │ │ │ │ │ +|****** ....//tteesstt//tteesstt__rreessoollvvee__lliinnkkss..ccpppp::9988 ****** | │ │ │ │ │ +|{ "test2", "test1_single", 0}, | │ │ │ │ │ | | │ │ │ │ │ -| pack.set_int(settings_pack::unchoke_slots_limit, -1); | │ │ │ │ │ -| ses1.apply_settings(pack); | │ │ │ │ │ -| TEST_CHECK(ses1.get_settings().get_int(settings_pack::unchoke_slots_limit) == -1); | │ │ │ │ │ +| // these are all padded. The first small file will accidentally also | │ │ │ │ │ +| // match, even though it's not tail padded, the following file is identical | │ │ │ │ │ +| { "test2_pad_files", "test1_pad_files", 2}, | │ │ │ │ │ +| { "test3_pad_files", "test1_pad_files", 2}, | │ │ │ │ │ +| { "test3_pad_files", "test2_pad_files", 2}, | │ │ │ │ │ +| { "test1_pad_files", "test2_pad_files", 2}, | │ │ │ │ │ +| { "test1_pad_files", "test3_pad_files", 2}, | │ │ │ │ │ +| { "test2_pad_files", "test3_pad_files", 2}, | │ │ │ │ │ | | │ │ │ │ │ -| pack.set_int(settings_pack::unchoke_slots_limit, 8); | │ │ │ │ │ -| ses1.apply_settings(pack); | │ │ │ │ │ -| TEST_CHECK(ses1.get_settings().get_int(settings_pack::unchoke_slots_limit) == 8); | │ │ │ │ │ +| // one might expect this to work, but since the tail of the single file | │ │ │ │ │ +| // torrent is not padded, the last piece hash won't match | │ │ │ │ │ +| { "test1_pad_files", "test1_single", 0}, | │ │ │ │ │ | | │ │ │ │ │ -| ses2.apply_settings(pack); | │ │ │ │ │ +| // if it's padded on the other hand, it will work | │ │ │ │ │ +| { "test1_pad_files", "test1_single_padded", 1}, | │ │ │ │ │ | | │ │ │ │ │ -| torrent_handle tor1; | │ │ │ │ │ -| torrent_handle tor2; | │ │ │ │ │ +|}; | │ │ │ │ │ | | │ │ │ │ │ -| create_directory("tmp1_transfer", ec); | │ │ │ │ │ -| std::ofstream file("tmp1_transfer/temporary"); | │ │ │ │ │ -| std::shared_ptr t = ::create_torrent(&file, "temporary", 32 * 1024, 13, false); | │ │ │ │ │ -| file.close(); | │ │ │ │ │ | | │ │ │ │ │ -| TEST_CHECK(exists(combine_path("tmp1_transfer", "temporary"))); | │ │ │ │ │ +|TORRENT_TEST(resolve_links) | │ │ │ │ │ +|{ | │ │ │ │ │ +| std::string path = combine_path(parent_path(current_working_directory()) | │ │ │ │ │ +| , "mutable_test_torrents"); | │ │ │ │ │ | | │ │ │ │ │ -| add_torrent_params params; | │ │ │ │ │ -| params.storage_mode = storage_mode; | │ │ │ │ │ -| params.flags &= ~torrent_flags::paused; | │ │ │ │ │ -| params.flags &= ~torrent_flags::auto_managed; | │ │ │ │ │ +| for (int i = 0; i < int(sizeof(test_torrents)/sizeof(test_torrents[0])); ++i) | │ │ │ │ │ +| { | │ │ │ │ │ +| test_torrent_t const& e = test_torrents[i]; | │ │ │ │ │ | | │ │ │ │ │ -| wait_for_listen(ses1, "ses1"); | │ │ │ │ │ -|_ _w_a_i_t___f_o_r___l_i_s_t_e_n_(_s_e_s_2_,_ _"_s_e_s_2_"_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| std::string p = combine_path(path, e.filename1) + ".torrent"; | │ │ │ │ │ +| std::printf("loading %s\n", p.c_str()); | │ │ │ │ │ +| std::shared_ptr ti1 = std::make_shared(p); | │ │ │ │ │ +| | │ │ │ │ │ +| p = combine_path(path, e.filename2) + ".torrent"; | │ │ │ │ │ +| std::printf("loading %s\n", p.c_str()); | │ │ │ │ │ +| std::shared_ptr ti2 = std::make_shared(p); | │ │ │ │ │ +| | │ │ │ │ │ +| std::printf("resolving\n"); | │ │ │ │ │ +| resolve_links l(ti1); | │ │ │ │ │ +| l.match(ti2, "."); | │ │ │ │ │ +| | │ │ │ │ │ +| aux::vector const& links = l.get_links(); | │ │ │ │ │ +| | │ │ │ │ │ +| auto const num_matches = std::size_t(std::count_if(links.begin(), links.end() | │ │ │ │ │ +| , std::bind(&resolve_links::link_t::ti, _1))); | │ │ │ │ │ +| | │ │ │ │ │ +| // some debug output in case the test fails | │ │ │ │ │ +| if (num_matches > e.expected_matches) | │ │ │ │ │ +| { | │ │ │ │ │ +|_ _ _ _f_i_l_e___s_t_o_r_a_g_e_ _c_o_n_s_t_&_ _f_s_ _=_ _t_i_1_-_>_f_i_l_e_s_(_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 0|_._._/_t_e_s_t_/ |test the case where we have > 120 samples (and have the base delay actually be updated) | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_t_e_s_t___t_i_m_e_s_t_a_m_p___h_i_s_t_o_r_y_._c_p_p_:_5_4_ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** tteesstt tthhee ccaassee wwhheerree wwee hhaavvee >> 112200 ssaammpplleess ((aanndd hhaavvee tthhee bbaassee ddeellaayy aaccttuuaallllyy bbee uuppddaatteedd)) ********** | │ │ │ │ │ |_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____tt_ii_mm_ee_ss_tt_aa_mm_pp____hh_ii_ss_tt_oo_rr_yy_.._cc_pp_pp_::_55_44_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 0|_._._/_t_e_s_t_/ |test the case where a sample is lower than the history entry but not lower than the base | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_t_e_s_t___t_i_m_e_s_t_a_m_p___h_i_s_t_o_r_y_._c_p_p_:_5_5_ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** tteesstt tthhee ccaassee wwhheerree aa ssaammppllee iiss lloowweerr tthhaann tthhee hhiissttoorryy eennttrryy bbuutt nnoott lloowweerr tthhaann tthhee bbaassee ********** | │ │ │ │ │ @@ -5368,14 +5511,176 @@ │ │ │ │ │ | TEST_EQUAL(h.base(), 0x30); | │ │ │ │ │ | | │ │ │ │ │ | // test that wrapping of the timestamp is properly handled | │ │ │ │ │ | h.add_sample(0xfffffff3, false); | │ │ │ │ │ | TEST_EQUAL(h.base(), 0xfffffff3); | │ │ │ │ │ | | │ │ │ │ │ |_}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___u_p_n_p_._c_p_p_:_1_5_6_ _ _ _ _ _|_s_t_o_r_e_ _t_h_e_ _l_o_g_ _a_n_d_ _v_e_r_i_f_y_ _t_h_a_t_ _s_o_m_e_ _k_e_y_ _m_e_s_s_a_g_e_s_ _a_r_e_ _t_h_e_r_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ssttoorree tthhee lloogg aanndd vveerriiffyy tthhaatt ssoommee kkeeyy mmeessssaaggeess aarree tthheerree ********** | │ │ │ │ │ +|****** ....//tteesstt//tteesstt__uuppnnpp..ccpppp::115566 ****** | │ │ │ │ │ +|, portmap_protocol const protocol, error_code const& err | │ │ │ │ │ +| , portmap_transport, aux::listen_socket_handle const&) override | │ │ │ │ │ +| { | │ │ │ │ │ +| callback_info info = {mapping, port, err}; | │ │ │ │ │ +| callbacks.push_back(info); | │ │ │ │ │ +| std::cout << "mapping: " << static_cast(mapping) | │ │ │ │ │ +| << ", port: " << port << ", IP: " << ip | │ │ │ │ │ +| << ", proto: " << static_cast(protocol) | │ │ │ │ │ +| << ", error: \"" << err.message() << "\"\n"; | │ │ │ │ │ +| } | │ │ │ │ │ +| #ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| bool should_log_portmap(portmap_transport) const override | │ │ │ │ │ +| { | │ │ │ │ │ +| return true; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void log_portmap(portmap_transport, char const* msg | │ │ │ │ │ +| , aux::listen_socket_handle const&) const override | │ │ │ │ │ +| { | │ │ │ │ │ +| std::cout << "UPnP: " << msg << std::endl; | │ │ │ │ │ +|} | │ │ │ │ │ +|#endif | │ │ │ │ │ +| }; | │ │ │ │ │ +| | │ │ │ │ │ +|ip_interface pick_upnp_interface() | │ │ │ │ │ +|{ | │ │ │ │ │ +| lt::io_context ios; | │ │ │ │ │ +| error_code ec; | │ │ │ │ │ +| std::vector const routes = enum_routes(ios, ec); | │ │ │ │ │ +| if (ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::cerr << "failed to enumerate routes: " << ec.message() << '\n'; | │ │ │ │ │ +| TEST_CHECK(false); | │ │ │ │ │ +| return {}; | │ │ │ │ │ +| } | │ │ │ │ │ +| std::vector const ifs = enum_net_interfaces(ios, ec); | │ │ │ │ │ +| if (ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::cerr << "failed to enumerate network interfaces: " << ec.message() << '\n'; | │ │ │ │ │ +| TEST_CHECK(false); | │ │ │ │ │ +| return {}; | │ │ │ │ │ +| } | │ │ │ │ │ +| int idx = 0; | │ │ │ │ │ +| for (auto const& face : ifs) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (!face.interface_address.is_v4()) continue; | │ │ │ │ │ +| std::cout << " - " << idx | │ │ │ │ │ +| << ' ' << face.interface_address.to_string() | │ │ │ │ │ +| << ' ' << int(static_cast(face.state)) | │ │ │ │ │ +| << ' ' << static_cast(face.flags) | │ │ │ │ │ +|_ _ _ _<_<_ _'_ _'_ _<_<_ _f_a_c_e_._n_a_m_e_ _<_<_ _'_\_n_'_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___f_l_a_g_s_._c_p_p_:_1_6_3 |change to a different test setup. currently always paused. test_set_after_add(torrent_flags::paused); test_unset_after_add | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_(_t_o_r_r_e_n_t___f_l_a_g_s_:_:_p_a_u_s_e_d_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** cchhaannggee ttoo aa ddiiffffeerreenntt tteesstt sseettuupp.. ccuurrrreennttllyy aallwwaayyss ppaauusseedd.. tteesstt__sseett__aafftteerr__aadddd((ttoorrrreenntt__ffllaaggss::::ppaauusseedd));; tteesstt__uunnsseett__aafftteerr__aadddd((ttoorrrreenntt__ffllaaggss::::ppaauusseedd));; ********** | │ │ │ │ │ +|****** ....//tteesstt//tteesstt__ffllaaggss..ccpppp::116633 ****** | │ │ │ │ │ +|{ | │ │ │ │ │ +| // share-mode | │ │ │ │ │ +| test_add_and_get_flags(torrent_flags::share_mode); | │ │ │ │ │ +| test_set_after_add(torrent_flags::share_mode); | │ │ │ │ │ +| test_unset_after_add(torrent_flags::share_mode); | │ │ │ │ │ +|} | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +|TORRENT_TEST(flag_apply_ip_filter) | │ │ │ │ │ +|{ | │ │ │ │ │ +| // apply-ip-filter | │ │ │ │ │ +| test_add_and_get_flags(torrent_flags::apply_ip_filter); | │ │ │ │ │ +| test_set_after_add(torrent_flags::apply_ip_filter); | │ │ │ │ │ +| test_unset_after_add(torrent_flags::apply_ip_filter); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|TORRENT_TEST(flag_paused) | │ │ │ │ │ +|{ | │ │ │ │ │ +| // paused | │ │ │ │ │ +| test_add_and_get_flags(torrent_flags::paused); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|TORRENT_TEST(flag_auto_managed) | │ │ │ │ │ +|{ | │ │ │ │ │ +| // auto-managed | │ │ │ │ │ +| test_add_and_get_flags(torrent_flags::auto_managed); | │ │ │ │ │ +| test_set_after_add(torrent_flags::auto_managed); | │ │ │ │ │ +| test_unset_after_add(torrent_flags::auto_managed); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|// super seeding mode is automatically turned off if we're not a seed | │ │ │ │ │ +|// since the posix_disk_io is not threaded, this will happen immediately | │ │ │ │ │ +|#if TORRENT_HAVE_MMAP | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_SUPERSEEDING | │ │ │ │ │ +|TORRENT_TEST(flag_super_seeding) | │ │ │ │ │ +|{ | │ │ │ │ │ +| // super-seeding | │ │ │ │ │ +| test_add_and_get_flags(torrent_flags::super_seeding); | │ │ │ │ │ +| test_unset_after_add(torrent_flags::super_seeding); | │ │ │ │ │ +| test_set_after_add(torrent_flags::super_seeding); | │ │ │ │ │ +|} | │ │ │ │ │ +|#endif | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +|TORRENT_TEST(flag_sequential_download) | │ │ │ │ │ +|{ | │ │ │ │ │ +| // sequential-download | │ │ │ │ │ +| test_add_and_get_flags(torrent_flags::sequential_download); | │ │ │ │ │ +| test_set_after_add(torrent_flags::sequential_download); | │ │ │ │ │ +| test_unset_after_add(torrent_flags::sequential_download); | │ │ │ │ │ +|_}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___f_l_a_g_s_._c_p_p_:_2_0_5 |this test is flaky, since the torrent will become ready before asking for the flags, and by then stop_when_ready will have been | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_c_l_e_a_r_e_d_ _t_e_s_t___a_d_d___a_n_d___g_e_t___f_l_a_g_s_(_t_o_r_r_e_n_t___f_l_a_g_s_:_:_s_t_o_p___w_h_e_n___r_e_a_d_y_)_;_ _s_e_t_t_i_n_g_ _s_t_o_p_-_w_h_e_n_-_r_e_a_d_y_ _w_h_e_n_ _a_l_r_e_a_d_y_ _s_t_o_p_p_e_d_ _h_a_s_ _n_o_ _e_f_f_e_c_t_._ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss tteesstt iiss ffllaakkyy,, ssiinnccee tthhee ttoorrrreenntt wwiillll bbeeccoommee rreeaaddyy bbeeffoorree aasskkiinngg ffoorr tthhee ffllaaggss,, aanndd bbyy tthheenn ssttoopp__wwhheenn__rreeaaddyy wwiillll hhaavvee bbeeeenn cclleeaarreedd tteesstt__aadddd__aanndd__ggeett__ffllaaggss | │ │ │ │ │ +|((ttoorrrreenntt__ffllaaggss::::ssttoopp__wwhheenn__rreeaaddyy));; sseettttiinngg ssttoopp--wwhheenn--rreeaaddyy wwhheenn aallrreeaaddyy ssttooppppeedd hhaass nnoo eeffffeecctt.. ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____ff_ll_aa_gg_ss_.._cc_pp_pp_::_22_00_55_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___f_l_a_g_s_._c_p_p_:_2_0_9_ _ _ _ _|_c_h_a_n_g_e_ _t_o_ _a_ _d_i_f_f_e_r_e_n_t_ _t_e_s_t_ _s_e_t_u_p_._ _c_u_r_r_e_n_t_l_y_ _a_l_w_a_y_s_ _p_a_u_s_e_d_._ _t_e_s_t___s_e_t___a_f_t_e_r___a_d_d_(_t_o_r_r_e_n_t___f_l_a_g_s_:_:_s_t_o_p___w_h_e_n___r_e_a_d_y_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** cchhaannggee ttoo aa ddiiffffeerreenntt tteesstt sseettuupp.. ccuurrrreennttllyy aallwwaayyss ppaauusseedd.. tteesstt__sseett__aafftteerr__aadddd((ttoorrrreenntt__ffllaaggss::::ssttoopp__wwhheenn__rreeaaddyy));; ********** | │ │ │ │ │ +|****** ....//tteesstt//tteesstt__ffllaaggss..ccpppp::220099 ****** | │ │ │ │ │ +|test_set_after_add(torrent_flags::super_seeding); | │ │ │ │ │ +|} | │ │ │ │ │ +|#endif | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +|TORRENT_TEST(flag_sequential_download) | │ │ │ │ │ +|{ | │ │ │ │ │ +| // sequential-download | │ │ │ │ │ +| test_add_and_get_flags(torrent_flags::sequential_download); | │ │ │ │ │ +| test_set_after_add(torrent_flags::sequential_download); | │ │ │ │ │ +| test_unset_after_add(torrent_flags::sequential_download); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|// the stop when ready flag will be cleared when the torrent is ready to start | │ │ │ │ │ +|// downloading. | │ │ │ │ │ +|// since the posix_disk_io is not threaded, this will happen immediately | │ │ │ │ │ +|#if TORRENT_HAVE_MMAP | │ │ │ │ │ +|TORRENT_TEST(flag_stop_when_ready) | │ │ │ │ │ +|{ | │ │ │ │ │ +| // stop-when-ready | │ │ │ │ │ +|test_unset_after_add(torrent_flags::stop_when_ready); | │ │ │ │ │ +|} | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +|TORRENT_TEST(flag_disable_dht) | │ │ │ │ │ +|{ | │ │ │ │ │ +| test_add_and_get_flags(torrent_flags::disable_dht); | │ │ │ │ │ +| test_set_after_add(torrent_flags::disable_dht); | │ │ │ │ │ +| test_unset_after_add(torrent_flags::disable_dht); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +| | │ │ │ │ │ +|TORRENT_TEST(flag_disable_lsd) | │ │ │ │ │ +|{ | │ │ │ │ │ +| test_add_and_get_flags(torrent_flags::disable_lsd); | │ │ │ │ │ +| test_set_after_add(torrent_flags::disable_lsd); | │ │ │ │ │ +| test_unset_after_add(torrent_flags::disable_lsd); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|TORRENT_TEST(flag_disable_pex) | │ │ │ │ │ +|{ | │ │ │ │ │ +| test_add_and_get_flags(torrent_flags::disable_pex); | │ │ │ │ │ +| test_set_after_add(torrent_flags::disable_pex); | │ │ │ │ │ +| test_unset_after_add(torrent_flags::disable_pex); | │ │ │ │ │ +|_}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___t_r_a_c_k_e_r_._c_p_p_:_6_0_ _ _ _|_t_e_s_t_ _s_c_r_a_p_e_ _r_e_q_u_e_s_t_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** tteesstt ssccrraappee rreeqquueessttss ********** | │ │ │ │ │ |_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____tt_rr_aa_cc_kk_ee_rr_.._cc_pp_pp_::_66_00_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___t_r_a_c_k_e_r_._c_p_p_:_6_1_ _ _ _|_t_e_s_t_ _p_a_r_s_e_ _p_e_e_r_s_6_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** tteesstt ppaarrssee ppeeeerrss66 ********** | │ │ │ │ │ |_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____tt_rr_aa_cc_kk_ee_rr_.._cc_pp_pp_::_66_11_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___t_r_a_c_k_e_r_._c_p_p_:_6_2_ _ _ _|_t_e_s_t_ _p_a_r_s_e_ _t_r_a_c_k_e_r_-_i_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ @@ -5436,50 +5741,43 @@ │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ |TORRENT_TEST(parse_peers4) | │ │ │ │ │ |{ | │ │ │ │ │ | char const response[] = "d5:peers12:\x01\x02\x03\x04\x30\x10" | │ │ │ │ │ | "\x09\x08\x07\x06\x20\x10" "e"; | │ │ │ │ │ |_ _e_r_r_o_r___c_o_d_e_ _e_c_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |test erasing peers | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_1_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt eerraassiinngg ppeeeerrss ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_11_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |test update_peer_port with allow_multiple_connections_per_ip and without | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_2_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt uuppddaattee__ppeeeerr__ppoorrtt wwiitthh aallllooww__mmuullttiippllee__ccoonnnneeccttiioonnss__ppeerr__iipp aanndd wwiitthhoouutt ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_22_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |test add i2p peers | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_3_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt aadddd ii22pp ppeeeerrss ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_33_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |test allow_i2p_mixed | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_4_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt aallllooww__ii22pp__mmiixxeedd ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_44_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |test insert_peer failing with all error conditions | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_5_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt iinnsseerrtt__ppeeeerr ffaaiilliinngg wwiitthh aallll eerrrroorr ccoonnddiittiioonnss ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_55_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |test IPv6 | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_6_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt IIPPvv66 ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_66_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |test connect_to_peer() failing | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_7_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt ccoonnnneecctt__ttoo__ppeeeerr(()) ffaaiilliinngg ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_77_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |test connection_closed | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_8_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt ccoonnnneeccttiioonn__cclloosseedd ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_88_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___p_e_e_r___l_i_s_t_._c_p_p_: |connect candidates recalculation when incrementing failcount | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_1_2_4_9_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ccoonnnneecctt ccaannddiiddaatteess rreeccaallccuullaattiioonn wwhheenn iinnccrreemmeennttiinngg ffaaiillccoouunntt ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____pp_ee_ee_rr____ll_ii_ss_tt_.._cc_pp_pp_::_11_22_44_99_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___b_l_o_o_m___f_i_l_t_e_r_._c_p_p_:|test size() | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_1_3_5_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt ssiizzee(()) ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____bb_ll_oo_oo_mm____ff_ii_ll_tt_ee_rr_.._cc_pp_pp_::_11_33_55_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___b_l_o_o_m___f_i_l_t_e_r_._c_p_p_:|test clear() | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_1_3_6_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt cclleeaarr(()) ********** | │ │ │ │ │ +|****** ....//tteesstt//tteesstt__bblloooomm__ffiilltteerr..ccpppp::113366 ****** | │ │ │ │ │ +|sha1_hash k("\x01\x00\x02\x00 "); | │ │ │ │ │ +| TEST_CHECK(!filter.find(k)); | │ │ │ │ │ +| filter.set(k); | │ │ │ │ │ +| TEST_CHECK(filter.find(k)); | │ │ │ │ │ +| | │ │ │ │ │ +| std::uint8_t compare[4] = { 0x16, 0xff, 0x55, 0xaa}; | │ │ │ │ │ +| | │ │ │ │ │ +| bits_out = filter.to_string(); | │ │ │ │ │ +| TEST_EQUAL(memcmp(compare, bits_out.c_str(), 4), 0); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|} // anonymous namespace | │ │ │ │ │ +| | │ │ │ │ │ +|TORRENT_TEST(bloom_filter) | │ │ │ │ │ +|{ | │ │ │ │ │ +| test_set_and_get(); | │ │ │ │ │ +| test_set_bits(); | │ │ │ │ │ +| test_count_zeroes(); | │ │ │ │ │ +| test_to_from_string(); | │ │ │ │ │ +| | │ │ │ │ │ +|_}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___d_h_t_._c_p_p_:_4_7_2_ _ _ _ _ _ _|_c_h_e_c_k_ _t_o_ _m_a_k_e_ _s_u_r_e_ _t_h_e_ _"_b_e_s_t_"_ _i_t_e_m_s_ _a_r_e_ _s_t_o_r_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** cchheecckk ttoo mmaakkee ssuurree tthhee ""bbeesstt"" iitteemmss aarree ssttoorreedd ********** | │ │ │ │ │ |****** ....//tteesstt//tteesstt__ddhhtt..ccpppp::447722 ****** | │ │ │ │ │ |, msg_args().target(items[j].target)); | │ │ │ │ │ | | │ │ │ │ │ | key_desc_t const desc[] = | │ │ │ │ │ | { | │ │ │ │ │ @@ -5606,691 +5904,1065 @@ │ │ │ │ │ |TORRENT_TEST(dht) | │ │ │ │ │ |{ | │ │ │ │ │ | // dummy dht test | │ │ │ │ │ | TEST_CHECK(true); | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ |_#_e_n_d_i_f_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/ |test sending invalid requests (out of bound piece index, offsets and sizes) | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_t_e_s_t___f_a_s_t___e_x_t_e_n_s_i_o_n_._c_p_p_:_1_1_3_5_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt sseennddiinngg iinnvvaalliidd rreeqquueessttss ((oouutt ooff bboouunndd ppiieeccee iinnddeexx,, ooffffsseettss aanndd ssiizzeess)) ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____ff_aa_ss_tt____ee_xx_tt_ee_nn_ss_ii_oo_nn_.._cc_pp_pp_::_11_11_33_55_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/ |test files with different piece size (negative test) | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_t_e_s_t___r_e_s_o_l_v_e___l_i_n_k_s_._c_p_p_:_9_5_ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt ffiilleess wwiitthh ddiiffffeerreenntt ppiieeccee ssiizzee ((nneeggaattiivvee tteesstt)) ********** | │ │ │ │ │ -|****** ....//tteesstt//tteesstt__rreessoollvvee__lliinnkkss..ccpppp::9955 ****** | │ │ │ │ │ -|{ "test2", "test1_pad_files", 0}, | │ │ │ │ │ -| { "test3", "test1_pad_files", 0}, | │ │ │ │ │ -| { "test2", "test1_single", 0}, | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___s_s_l_._c_p_p_:_4_0_7_ _ _ _ _ _ _|_t_e_s_t_ _u_s_i_n_g_ _a_ _s_i_g_n_e_d_ _c_e_r_t_i_f_i_c_a_t_e_ _w_i_t_h_ _t_h_e_ _w_r_o_n_g_ _i_n_f_o_-_h_a_s_h_ _i_n_ _D_N_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteesstt uussiinngg aa ssiiggnneedd cceerrttiiffiiccaattee wwiitthh tthhee wwrroonngg iinnffoo--hhaasshh iinn DDNN ********** | │ │ │ │ │ +|****** ....//tteesstt//tteesstt__ssssll..ccpppp::440077 ****** | │ │ │ │ │ +|// in verifying peers | │ │ │ │ │ +| ctx.set_verify_mode(context::verify_none, ec); | │ │ │ │ │ +| if (ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::printf("Failed to set SSL verify mode: %s\n" | │ │ │ │ │ +| , ec.message().c_str()); | │ │ │ │ │ +| TEST_CHECK(!ec); | │ │ │ │ │ +| return false; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| // these are all padded. The first small file will accidentally also | │ │ │ │ │ -| // match, even though it's not tail padded, the following file is identical | │ │ │ │ │ -| { "test2_pad_files", "test1_pad_files", 2}, | │ │ │ │ │ -| { "test3_pad_files", "test1_pad_files", 2}, | │ │ │ │ │ -| { "test3_pad_files", "test2_pad_files", 2}, | │ │ │ │ │ -| { "test1_pad_files", "test2_pad_files", 2}, | │ │ │ │ │ -| { "test1_pad_files", "test3_pad_files", 2}, | │ │ │ │ │ -| { "test2_pad_files", "test3_pad_files", 2}, | │ │ │ │ │ +| std::string certificate = combine_path("..", combine_path("ssl", "peer_certificate.pem")); | │ │ │ │ │ +| std::string private_key = combine_path("..", combine_path("ssl", "peer_private_key.pem")); | │ │ │ │ │ +| std::string dh_params = combine_path("..", combine_path("ssl", "dhparams.pem")); | │ │ │ │ │ | | │ │ │ │ │ -| // one might expect this to work, but since the tail of the single file | │ │ │ │ │ -| // torrent is not padded, the last piece hash won't match | │ │ │ │ │ -| { "test1_pad_files", "test1_single", 0}, | │ │ │ │ │ +| if (flags & invalid_certificate) | │ │ │ │ │ +| { | │ │ │ │ │ +| certificate = combine_path("..", combine_path("ssl", "invalid_peer_certificate.pem")); | │ │ │ │ │ +| private_key = combine_path("..", combine_path("ssl", "invalid_peer_private_key.pem")); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| // if it's padded on the other hand, it will work | │ │ │ │ │ -| { "test1_pad_files", "test1_single_padded", 1}, | │ │ │ │ │ | | │ │ │ │ │ -|_}_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/ |it would be nice to test resolving of more than just 2 files as well. like 3 single file torrents merged into one, resolving all 3 | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_t_e_s_t___r_e_s_o_l_v_e___l_i_n_k_s_._c_p_p_:_9_8_ _ _ _ _ _|_f_i_l_e_s_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iitt wwoouulldd bbee nniiccee ttoo tteesstt rreessoollvviinngg ooff mmoorree tthhaann jjuusstt 22 ffiilleess aass wweellll.. lliikkee 33 ssiinnggllee ffiillee ttoorrrreennttss mmeerrggeedd iinnttoo oonnee,, rreessoollvviinngg aallll 33 ffiilleess.. ********** | │ │ │ │ │ -|****** ....//tteesstt//tteesstt__rreessoollvvee__lliinnkkss..ccpppp::9988 ****** | │ │ │ │ │ -|{ "test2", "test1_single", 0}, | │ │ │ │ │ +|if (flags & (valid_certificate | invalid_certificate)) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::printf("set_password_callback\n"); | │ │ │ │ │ +| ctx.set_password_callback( | │ │ │ │ │ +| [](std::size_t, context::password_purpose) { return "test"; } | │ │ │ │ │ +| , ec); | │ │ │ │ │ +| if (ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::printf("Failed to set certificate passphrase: %s\n" | │ │ │ │ │ +| , ec.message().c_str()); | │ │ │ │ │ +| TEST_CHECK(!ec); | │ │ │ │ │ +| return false; | │ │ │ │ │ +| } | │ │ │ │ │ +| std::printf("use_certificate_file \"%s\"\n", certificate.c_str()); | │ │ │ │ │ +| ctx.use_certificate_file(certificate, context::pem, ec); | │ │ │ │ │ +| if (ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::printf("Failed to set certificate file: %s\n" | │ │ │ │ │ +| , ec.message().c_str()); | │ │ │ │ │ +| TEST_CHECK(!ec); | │ │ │ │ │ +| return false; | │ │ │ │ │ +| } | │ │ │ │ │ +| std::printf("use_private_key_file \"%s\"\n", private_key.c_str()); | │ │ │ │ │ +| ctx.use_private_key_file(private_key, context::pem, ec); | │ │ │ │ │ +| if (ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::printf("Failed to set private key: %s\n" | │ │ │ │ │ +| , ec.message().c_str()); | │ │ │ │ │ +| TEST_CHECK(!ec); | │ │ │ │ │ +|_ _ _ _r_e_t_u_r_n_ _f_a_l_s_e_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___s_s_l_._c_p_p_:_5_0_9_ _ _ _ _ _ _|_a_l_s_o_ _t_e_s_t_ _u_s_i_n_g_ _a_ _h_a_s_h_ _t_h_a_t_ _r_e_f_e_r_s_ _t_o_ _a_ _v_a_l_i_d_ _t_o_r_r_e_n_t_ _b_u_t_ _t_h_a_t_ _d_i_f_f_e_r_s_ _f_r_o_m_ _t_h_e_ _S_N_I_ _h_a_s_h_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** aallssoo tteesstt uussiinngg aa hhaasshh tthhaatt rreeffeerrss ttoo aa vvaalliidd ttoorrrreenntt bbuutt tthhaatt ddiiffffeerrss ffrroomm tthhee SSNNII hhaasshh ********** | │ │ │ │ │ +|****** ....//tteesstt//tteesstt__ssssll..ccpppp::550099 ****** | │ │ │ │ │ +|print_alerts(ses1, "ses1", true, true, &on_alert); | │ │ │ │ │ +| if (ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::printf("Failed SSL handshake: %s\n" | │ │ │ │ │ +| , ec.message().c_str()); | │ │ │ │ │ +| return false; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| // these are all padded. The first small file will accidentally also | │ │ │ │ │ -| // match, even though it's not tail padded, the following file is identical | │ │ │ │ │ -| { "test2_pad_files", "test1_pad_files", 2}, | │ │ │ │ │ -| { "test3_pad_files", "test1_pad_files", 2}, | │ │ │ │ │ -| { "test3_pad_files", "test2_pad_files", 2}, | │ │ │ │ │ -| { "test1_pad_files", "test2_pad_files", 2}, | │ │ │ │ │ -| { "test1_pad_files", "test3_pad_files", 2}, | │ │ │ │ │ -| { "test2_pad_files", "test3_pad_files", 2}, | │ │ │ │ │ +| char handshake[] = "\x13" "BitTorrent protocol\0\0\0\0\0\0\0\x04" | │ │ │ │ │ +| " " // space for info-hash | │ │ │ │ │ +| "aaaaaaaaaaaaaaaaaaaa" // peer-id | │ │ │ │ │ +| "\0\0\0\x01\x02"; // interested | │ │ │ │ │ | | │ │ │ │ │ -| // one might expect this to work, but since the tail of the single file | │ │ │ │ │ -| // torrent is not padded, the last piece hash won't match | │ │ │ │ │ -| { "test1_pad_files", "test1_single", 0}, | │ │ │ │ │ +| // fill in the info-hash | │ │ │ │ │ +| if (flags & valid_bittorrent_hash) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::memcpy(handshake + 28, &t->info_hashes().v1[0], 20); | │ │ │ │ │ +| } | │ │ │ │ │ +| else | │ │ │ │ │ +| { | │ │ │ │ │ +|std::generate(handshake + 28, handshake + 48, &rand); | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -| // if it's padded on the other hand, it will work | │ │ │ │ │ -| { "test1_pad_files", "test1_single_padded", 1}, | │ │ │ │ │ +| // fill in the peer-id | │ │ │ │ │ +| std::generate(handshake + 48, handshake + 68, &rand); | │ │ │ │ │ | | │ │ │ │ │ -|}; | │ │ │ │ │ +| std::printf("bittorrent handshake\n"); | │ │ │ │ │ +| boost::asio::write(ssl_sock, boost::asio::buffer(handshake, (sizeof(handshake) - 1)), ec); | │ │ │ │ │ +| print_alerts(ses1, "ses1", true, true, &on_alert); | │ │ │ │ │ +| if (ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::printf("failed to write bittorrent handshake: %s\n" | │ │ │ │ │ +| , ec.message().c_str()); | │ │ │ │ │ +| return false; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ +| char buf[68]; | │ │ │ │ │ +| std::printf("read bittorrent handshake\n"); | │ │ │ │ │ +| boost::asio::read(ssl_sock, boost::asio::buffer(buf, sizeof(buf)), ec); | │ │ │ │ │ +| print_alerts(ses1, "ses1", true, true, &on_alert); | │ │ │ │ │ +| if (ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::printf("failed to read bittorrent handshake: %s\n" | │ │ │ │ │ +| , ec.message().c_str()); | │ │ │ │ │ +| return false; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(resolve_links) | │ │ │ │ │ -|{ | │ │ │ │ │ -| std::string path = combine_path(parent_path(current_working_directory()) | │ │ │ │ │ -| , "mutable_test_torrents"); | │ │ │ │ │ +| if (memcmp(buf, "\x13" "BitTorrent protocol", 20) != 0) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::printf("invalid bittorrent handshake\n"); | │ │ │ │ │ +|_ _ _r_e_t_u_r_n_ _f_a_l_s_e_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_u_d_p___s_o_c_k_e_t_._c_p_p_:_6_5_9_ _ _ _ _ _|_p_e_r_h_a_p_s_ _a_n_ _a_t_t_e_m_p_t_ _s_h_o_u_l_d_ _b_e_ _m_a_d_e_ _t_o_ _b_i_n_d_ _m___s_o_c_k_s_5___s_o_c_k_ _t_o_ _t_h_e_ _d_e_v_i_c_e_ _o_f_ _m___l_i_s_t_e_n___s_o_c_k_e_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ppeerrhhaappss aann aatttteemmpptt sshhoouulldd bbee mmaaddee ttoo bbiinndd mm__ssoocckkss55__ssoocckk ttoo tthhee ddeevviiccee ooff mm__lliisstteenn__ssoocckkeett ********** | │ │ │ │ │ +|****** ....//ssrrcc//uuddpp__ssoocckkeett..ccpppp::665599 ****** | │ │ │ │ │ +|if (ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (m_alerts.should_post()) | │ │ │ │ │ +| m_alerts.emplace_alert(m_proxy_addr, operation_t::sock_option, ec); | │ │ │ │ │ +| ec.clear(); | │ │ │ │ │ +| } | │ │ │ │ │ +|#endif | │ │ │ │ │ +|#endif | │ │ │ │ │ | | │ │ │ │ │ -| for (int i = 0; i < int(sizeof(test_torrents)/sizeof(test_torrents[0])); ++i) | │ │ │ │ │ +| tcp::endpoint const bind_ep(m_listen_socket.get_local_endpoint().address(), 0); | │ │ │ │ │ +| m_socks5_sock.bind(bind_ep, ec); | │ │ │ │ │ +| if (ec) | │ │ │ │ │ | { | │ │ │ │ │ -| test_torrent_t const& e = test_torrents[i]; | │ │ │ │ │ +| if (m_alerts.should_post()) | │ │ │ │ │ +| m_alerts.emplace_alert(m_proxy_addr, operation_t::sock_bind, ec); | │ │ │ │ │ +| ++m_failures; | │ │ │ │ │ +| retry_connection(); | │ │ │ │ │ +| return; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| std::string p = combine_path(path, e.filename1) + ".torrent"; | │ │ │ │ │ -| std::printf("loading %s\n", p.c_str()); | │ │ │ │ │ -| std::shared_ptr ti1 = std::make_shared(p); | │ │ │ │ │ | | │ │ │ │ │ -| p = combine_path(path, e.filename2) + ".torrent"; | │ │ │ │ │ -| std::printf("loading %s\n", p.c_str()); | │ │ │ │ │ -| std::shared_ptr ti2 = std::make_shared(p); | │ │ │ │ │ +|ADD_OUTSTANDING_ASYNC("socks5::on_connected"); | │ │ │ │ │ +| m_socks5_sock.async_connect(m_proxy_addr | │ │ │ │ │ +| , std::bind(&socks5::on_connected, self(), _1)); | │ │ │ │ │ | | │ │ │ │ │ -| std::printf("resolving\n"); | │ │ │ │ │ -| resolve_links l(ti1); | │ │ │ │ │ -| l.match(ti2, "."); | │ │ │ │ │ +| ADD_OUTSTANDING_ASYNC("socks5::on_connect_timeout"); | │ │ │ │ │ +| m_timer.expires_after(seconds(10)); | │ │ │ │ │ +| m_timer.async_wait(std::bind(&socks5::on_connect_timeout | │ │ │ │ │ +| , self(), _1)); | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -| aux::vector const& links = l.get_links(); | │ │ │ │ │ +|void socks5::on_connect_timeout(error_code const& e) | │ │ │ │ │ +|{ | │ │ │ │ │ +| COMPLETE_ASYNC("socks5::on_connect_timeout"); | │ │ │ │ │ | | │ │ │ │ │ -| auto const num_matches = std::size_t(std::count_if(links.begin(), links.end() | │ │ │ │ │ -| , std::bind(&resolve_links::link_t::ti, _1))); | │ │ │ │ │ +| if (e == boost::asio::error::operation_aborted) return; | │ │ │ │ │ | | │ │ │ │ │ -| // some debug output in case the test fails | │ │ │ │ │ -| if (num_matches > e.expected_matches) | │ │ │ │ │ -| { | │ │ │ │ │ -|_ _ _ _f_i_l_e___s_t_o_r_a_g_e_ _c_o_n_s_t_&_ _f_s_ _=_ _t_i_1_-_>_f_i_l_e_s_(_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___r_e_s_u_m_e_._c_p_p_:_5_8_2_ _ _ _|_t_e_s_t_ _w_h_a_t_ _h_a_p_p_e_n_s_ _w_h_e_n_ _l_o_a_d_i_n_g_ _a_ _r_e_s_u_m_e_ _f_i_l_e_ _w_i_t_h_ _b_o_t_h_ _p_i_e_c_e_ _p_r_i_o_r_i_t_i_e_s_ _a_n_d_ _f_i_l_e_ _p_r_i_o_r_i_t_i_e_s_ _(_f_i_l_e_ _p_r_i_o_ _s_h_o_u_l_d_ _t_a_k_e_ _p_r_e_c_e_d_e_n_c_e_)_ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt wwhhaatt hhaappppeennss wwhheenn llooaaddiinngg aa rreessuummee ffiillee wwiitthh bbootthh ppiieeccee pprriioorriittiieess aanndd ffiillee pprriioorriittiieess ((ffiillee pprriioo sshhoouulldd ttaakkee pprreecceeddeennccee)) ********** | │ │ │ │ │ -|****** ....//tteesstt//tteesstt__rreessuummee..ccpppp::558822 ****** | │ │ │ │ │ -|{ | │ │ │ │ │ -| TEST_EQUAL(pieces[i], true); | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -|} | │ │ │ │ │ +| if (m_abort) return; | │ │ │ │ │ | | │ │ │ │ │ -|} // anonymous namespace | │ │ │ │ │ +| if (m_alerts.should_post()) | │ │ │ │ │ +| m_alerts.emplace_alert(m_proxy_addr, operation_t::connect, errors::timed_out); | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(piece_slots_seed) | │ │ │ │ │ -|{ | │ │ │ │ │ -| test_piece_slots_seed(settings()); | │ │ │ │ │ -|} | │ │ │ │ │ +| error_code ignore; | │ │ │ │ │ +| m_socks5_sock.close(ignore); | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(piece_slots_seed_suggest_cache) | │ │ │ │ │ -|{ | │ │ │ │ │ -| settings_pack sett = settings(); | │ │ │ │ │ -| sett.set_int(settings_pack::suggest_mode, settings_pack::suggest_read_cache); | │ │ │ │ │ -| test_piece_slots_seed(sett); | │ │ │ │ │ +| ++m_failures; | │ │ │ │ │ +| retry_connection(); | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___r_e_s_u_m_e_._c_p_p_:_5_8_5_ _ _ _|_m_a_k_e_ _s_u_r_e_ _a_ _r_e_s_u_m_e_ _f_i_l_e_ _o_n_l_y_ _e_v_e_r_ _c_o_n_t_a_i_n_ _f_i_l_e_ _p_r_i_o_r_i_t_i_e_s_ _O_R_ _p_i_e_c_e_ _p_r_i_o_r_i_t_i_e_s_._ _N_e_v_e_r_ _b_o_t_h_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** mmaakkee ssuurree aa rreessuummee ffiillee oonnllyy eevveerr ccoonnttaaiinn ffiillee pprriioorriittiieess OORR ppiieeccee pprriioorriittiieess.. NNeevveerr bbootthh.. ********** | │ │ │ │ │ -|****** ....//tteesstt//tteesstt__rreessuummee..ccpppp::558855 ****** | │ │ │ │ │ -|TEST_EQUAL(pieces[i], true); | │ │ │ │ │ +|void socks5::on_connected(error_code const& e) | │ │ │ │ │ +|_{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_1_9_5_1_ _ _ _ _ _ _ _|_t_h_i_s_ _c_o_u_l_d_ _b_e_ _o_p_t_i_m_i_z_e_d_ _b_y_ _l_o_o_k_i_n_g_ _u_p_ _w_h_i_c_h_ _f_i_l_e_s_ _a_r_e_ _c_o_m_p_l_e_t_e_ _a_n_d_ _j_u_s_t_ _l_o_o_k_ _a_t_ _t_h_o_s_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss ccoouulldd bbee ooppttiimmiizzeedd bbyy llooookkiinngg uupp wwhhiicchh ffiilleess aarree ccoommpplleettee aanndd jjuusstt llooookk aatt tthhoossee ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::11995511 ****** | │ │ │ │ │ +|// TORRENT_ASSERT(picker().have_piece(i)); | │ │ │ │ │ +| we_have(i); | │ │ │ │ │ +| } | │ │ │ │ │ | } | │ │ │ │ │ -| } | │ │ │ │ │ -|} | │ │ │ │ │ | | │ │ │ │ │ -|} // anonymous namespace | │ │ │ │ │ +| set_state(torrent_status::checking_resume_data); | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(piece_slots_seed) | │ │ │ │ │ -|{ | │ │ │ │ │ -| test_piece_slots_seed(settings()); | │ │ │ │ │ -|} | │ │ │ │ │ +| aux::vector links; | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_MUTABLE_TORRENTS | │ │ │ │ │ +| if (!m_torrent_file->similar_torrents().empty() | │ │ │ │ │ +| || !m_torrent_file->collections().empty()) | │ │ │ │ │ +| { | │ │ │ │ │ +| resolve_links res(m_torrent_file); | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(piece_slots_seed_suggest_cache) | │ │ │ │ │ +| for (auto const& ih : m_torrent_file->similar_torrents()) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::shared_ptr t = m_ses.find_torrent(info_hash_t(ih)).lock(); | │ │ │ │ │ +| if (!t) continue; | │ │ │ │ │ +| | │ │ │ │ │ +| // Only attempt to reuse files from torrents that are seeding. | │ │ │ │ │ +|if (!t->is_seed()) continue; | │ │ │ │ │ +| | │ │ │ │ │ +| res.match(t->get_torrent_file(), t->save_path()); | │ │ │ │ │ +| } | │ │ │ │ │ +| for (auto const& c : m_torrent_file->collections()) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::vector> ts = m_ses.find_collection(c); | │ │ │ │ │ +| | │ │ │ │ │ +| for (auto const& t : ts) | │ │ │ │ │ +| { | │ │ │ │ │ +|_ _ _ _ _ _/_/_ _O_n_l_y_ _a_t_t_e_m_p_t_ _t_o_ _r_e_u_s_e_ _f_i_l_e_s_ _f_r_o_m_ _t_o_r_r_e_n_t_s_ _t_h_a_t_ _a_r_e_ _s_e_e_d_i_n_g_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_1_9_6_4_ _ _ _ _ _ _ _|_t_h_i_s_ _c_o_u_l_d_ _b_e_ _o_p_t_i_m_i_z_e_d_ _b_y_ _l_o_o_k_i_n_g_ _u_p_ _w_h_i_c_h_ _f_i_l_e_s_ _a_r_e_ _c_o_m_p_l_e_t_e_ _a_n_d_ _j_u_s_t_ _l_o_o_k_ _a_t_ _t_h_o_s_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss ccoouulldd bbee ooppttiimmiizzeedd bbyy llooookkiinngg uupp wwhhiicchh ffiilleess aarree ccoommpplleettee aanndd jjuusstt llooookk aatt tthhoossee ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::11996644 ****** | │ │ │ │ │ |{ | │ │ │ │ │ -| settings_pack sett = settings(); | │ │ │ │ │ -| sett.set_int(settings_pack::suggest_mode, settings_pack::suggest_read_cache); | │ │ │ │ │ -| test_piece_slots_seed(sett); | │ │ │ │ │ -|} | │ │ │ │ │ +| resolve_links res(m_torrent_file); | │ │ │ │ │ | | │ │ │ │ │ +| for (auto const& ih : m_torrent_file->similar_torrents()) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::shared_ptr t = m_ses.find_torrent(info_hash_t(ih)).lock(); | │ │ │ │ │ +| if (!t) continue; | │ │ │ │ │ | | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___r_e_s_u_m_e_._c_p_p_:_5_8_8_ _ _ _|_g_e_n_e_r_a_l_l_y_ _s_a_v_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ggeenneerraallllyy ssaavvee ********** | │ │ │ │ │ -|****** ....//tteesstt//tteesstt__rreessuummee..ccpppp::558888 ****** | │ │ │ │ │ -|} | │ │ │ │ │ -| } | │ │ │ │ │ -|} | │ │ │ │ │ +| // Only attempt to reuse files from torrents that are seeding. | │ │ │ │ │ +| if (!t->is_seed()) continue; | │ │ │ │ │ | | │ │ │ │ │ -|} // anonymous namespace | │ │ │ │ │ +| res.match(t->get_torrent_file(), t->save_path()); | │ │ │ │ │ +| } | │ │ │ │ │ +| for (auto const& c : m_torrent_file->collections()) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::vector> ts = m_ses.find_collection(c); | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(piece_slots_seed) | │ │ │ │ │ -|{ | │ │ │ │ │ -| test_piece_slots_seed(settings()); | │ │ │ │ │ -|} | │ │ │ │ │ +| for (auto const& t : ts) | │ │ │ │ │ +| { | │ │ │ │ │ +| // Only attempt to reuse files from torrents that are seeding. | │ │ │ │ │ +|if (!t->is_seed()) continue; | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(piece_slots_seed_suggest_cache) | │ │ │ │ │ -|{ | │ │ │ │ │ -| settings_pack sett = settings(); | │ │ │ │ │ -| sett.set_int(settings_pack::suggest_mode, settings_pack::suggest_read_cache); | │ │ │ │ │ -| test_piece_slots_seed(sett); | │ │ │ │ │ -|} | │ │ │ │ │ +| res.match(t->get_torrent_file(), t->save_path()); | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ +| std::vector const& l = res.get_links(); | │ │ │ │ │ +| if (!l.empty()) | │ │ │ │ │ +| { | │ │ │ │ │ +| links.resize(m_torrent_file->files().num_files()); | │ │ │ │ │ +| for (auto const& i : l) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (!i.ti) continue; | │ │ │ │ │ +| links[i.file_idx] = combine_path(i.save_path | │ │ │ │ │ +| , i.ti->files().file_path(i.file_idx)); | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +|#endif // TORRENT_DISABLE_MUTABLE_TORRENTS | │ │ │ │ │ | | │ │ │ │ │ +|#if TORRENT_USE_ASSERTS | │ │ │ │ │ +| TORRENT_ASSERT(m_outstanding_check_files == false); | │ │ │ │ │ +| m_outstanding_check_files = true; | │ │ │ │ │ +|#endif | │ │ │ │ │ | | │ │ │ │ │ +| if (!m_add_torrent_params || !(m_add_torrent_params->flags & torrent_flags::no_verify_files)) | │ │ │ │ │ +| { | │ │ │ │ │ +| m_ses.disk_thread().async_check_files( | │ │ │ │ │ +| m_storage, m_add_torrent_params ? m_add_torrent_params.get() : nullptr | │ │ │ │ │ +| , std::move(links), [self = shared_from_this()](status_t st, storage_error const& error) | │ │ │ │ │ +|_ _ _ _ _{_ _s_e_l_f_-_>_o_n___r_e_s_u_m_e___d_a_t_a___c_h_e_c_k_e_d_(_s_t_,_ _e_r_r_o_r_)_;_ _}_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_2_7_2_8 |this pattern is repeated in a few places. Factor this into a function and generalize the concept of a torrent having a dedicated | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_l_i_s_t_e_n_ _p_o_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss ppaatttteerrnn iiss rreeppeeaatteedd iinn aa ffeeww ppllaacceess.. FFaaccttoorr tthhiiss iinnttoo aa ffuunnccttiioonn aanndd ggeenneerraalliizzee tthhee ccoonncceepptt ooff aa ttoorrrreenntt hhaavviinngg aa ddeeddiiccaatteedd lliisstteenn ppoorrtt ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::22772288 ****** | │ │ │ │ │ +|// not ready for peers. Except, if we don't have metadata, | │ │ │ │ │ +| // we need peers to download from | │ │ │ │ │ +| if (!m_files_checked && valid_metadata()) return; | │ │ │ │ │ | | │ │ │ │ │ -|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ -|TORRENT_TEST(file_priorities_default_deprecated) | │ │ │ │ │ -|{ | │ │ │ │ │ -| lt::session ses(settings()); | │ │ │ │ │ -| std::vector file_priorities = test_resume_flags(ses | │ │ │ │ │ -| , {}, "", "", true).get_file_priorities(); | │ │ │ │ │ +| if (!m_announce_to_lsd) return; | │ │ │ │ │ | | │ │ │ │ │ -| TEST_EQUAL(file_priorities.size(), 3); | │ │ │ │ │ -| TEST_EQUAL(file_priorities[0], 4); | │ │ │ │ │ -| TEST_EQUAL(file_priorities[1], 4); | │ │ │ │ │ -| TEST_EQUAL(file_priorities[2], 4); | │ │ │ │ │ -|} | │ │ │ │ │ +| // private torrents are never announced on LSD | │ │ │ │ │ +| if (m_torrent_file->is_valid() && m_torrent_file->priv()) return; | │ │ │ │ │ | | │ │ │ │ │ -|// As long as the add_torrent_params priorities are empty, the file_priorities | │ │ │ │ │ -|// from the resume data should take effect | │ │ │ │ │ -|TORRENT_TEST(file_priorities_in_resume_deprecated) | │ │ │ │ │ -|{ | │ │ │ │ │ -| lt::session ses(settings()); | │ │ │ │ │ -| std::vector file_priorities = test_resume_flags(ses, {}, "", "123").get_file_priorities(); | │ │ │ │ │ +|#if TORRENT_USE_I2P | │ │ │ │ │ +| // i2p torrents are also never announced on LSD | │ │ │ │ │ +| // unless we allow mixed swarms | │ │ │ │ │ +| if (is_i2p() && !settings().get_bool(settings_pack::allow_i2p_mixed)) | │ │ │ │ │ +| return; | │ │ │ │ │ +|#endif | │ │ │ │ │ | | │ │ │ │ │ -| TEST_EQUAL(file_priorities.size(), 3); | │ │ │ │ │ -| TEST_EQUAL(file_priorities[0], 1); | │ │ │ │ │ -| TEST_EQUAL(file_priorities[1], 2); | │ │ │ │ │ -| TEST_EQUAL(file_priorities[2], 3); | │ │ │ │ │ -|} | │ │ │ │ │ +| if (is_paused()) return; | │ │ │ │ │ | | │ │ │ │ │ -|// if both resume data and add_torrent_params has file_priorities, the | │ │ │ │ │ -|// add_torrent_params one take precedence | │ │ │ │ │ -|TORRENT_TEST(file_priorities_in_resume_and_params_deprecated) | │ │ │ │ │ -|_{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___r_e_s_u_m_e_._c_p_p_:_9_1_1 |test all other resume flags here too. This would require returning more than just the torrent_status from test_resume_flags. Also | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_h_t_t_p_ _s_e_e_d_s_ _a_n_d_ _t_r_a_c_k_e_r_s_ _f_o_r_ _i_n_s_t_a_n_c_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt aallll ootthheerr rreessuummee ffllaaggss hheerree ttoooo.. TThhiiss wwoouulldd rreeqquuiirree rreettuurrnniinngg mmoorree tthhaann jjuusstt tthhee ttoorrrreenntt__ssttaattuuss ffrroomm tteesstt__rreessuummee__ffllaaggss.. AAllssoo hhttttpp sseeeeddss aanndd ttrraacckkeerrss ffoorr iinnssttaannccee | │ │ │ │ │ -|********** | │ │ │ │ │ -|****** ....//tteesstt//tteesstt__rreessuummee..ccpppp::991111 ****** | │ │ │ │ │ -|TEST_EQUAL(s.connections_limit, 1345); | │ │ │ │ │ -| TEST_EQUAL(s.uploads_limit, 1346); | │ │ │ │ │ -|} | │ │ │ │ │ +| if (!m_ses.has_lsd()) return; | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(paused_deprecated) | │ │ │ │ │ -|{ | │ │ │ │ │ -| lt::session ses(settings()); | │ │ │ │ │ -| // resume data overrides the paused flag | │ │ │ │ │ -| auto const now = lt::clock_type::now(); | │ │ │ │ │ -| torrent_status s = test_resume_flags(ses, torrent_flags::paused, "", "", true).status(); | │ │ │ │ │ -| default_tests(s, now); | │ │ │ │ │ -|#ifdef TORRENT_WINDOWS | │ │ │ │ │ -| TEST_EQUAL(s.save_path, "c:\\add_torrent_params save_path"); | │ │ │ │ │ +|#ifdef TORRENT_SSL_PEERS | │ │ │ │ │ +|int port = is_ssl_torrent() ? m_ses.ssl_listen_port() : m_ses.listen_port(); | │ │ │ │ │ |#else | │ │ │ │ │ -| TEST_EQUAL(s.save_path, "/add_torrent_params save_path"); | │ │ │ │ │ +| int port = m_ses.listen_port(); | │ │ │ │ │ |#endif | │ │ │ │ │ -| TEST_EQUAL(s.flags & flags_mask, torrent_flags_t{}); | │ │ │ │ │ -| TEST_EQUAL(s.connections_limit, 1345); | │ │ │ │ │ -| TEST_EQUAL(s.uploads_limit, 1346); | │ │ │ │ │ | | │ │ │ │ │ -|} | │ │ │ │ │ +| // announce with the local discovery service | │ │ │ │ │ +| m_torrent_file->info_hashes().for_each([&](sha1_hash const& ih, protocol_version) | │ │ │ │ │ +| { | │ │ │ │ │ +| m_ses.announce_lsd(ih, port); | │ │ │ │ │ +| }); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(url_seed_resume_data_deprecated) | │ │ │ │ │ -|{ | │ │ │ │ │ -| // merge url seeds with resume data | │ │ │ │ │ -| std::printf("flags: merge_resume_http_seeds\n"); | │ │ │ │ │ -| lt::session ses(settings()); | │ │ │ │ │ -| torrent_handle h = test_resume_flags(ses, | │ │ │ │ │ -| torrent_flags::merge_resume_http_seeds, "", "", true); | │ │ │ │ │ -| std::set us = h.url_seeds(); | │ │ │ │ │ -| std::set ws = h.http_seeds(); | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_DHT | │ │ │ │ │ | | │ │ │ │ │ -| TEST_EQUAL(us.size(), 3); | │ │ │ │ │ -| TEST_EQUAL(std::count(us.begin(), us.end() | │ │ │ │ │ -| , "http://add_torrent_params_url_seed.com/"), 1); | │ │ │ │ │ -| TEST_EQUAL(std::count(us.begin(), us.end() | │ │ │ │ │ -| , "http://torrent_file_url_seed.com/"), 1); | │ │ │ │ │ -| TEST_EQUAL(std::count(us.begin(), us.end() | │ │ │ │ │ -| , "http://resume_data_url_seed.com/"), 1); | │ │ │ │ │ +| void torrent::dht_announce() | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ +| if (!m_ses.dht()) | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| debug_log("DHT: no dht initialized"); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| return; | │ │ │ │ │ +| } | │ │ │ │ │ +| if (!should_announce_dht()) | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| if (should_log()) | │ │ │ │ │ +| { | │ │ │ │ │ +|_#_i_f_ _T_O_R_R_E_N_T___U_S_E___I_2_P_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_3_8_8_5_ _ _ _ _ _ _ _|_a_d_d_ _o_n_e_ _p_e_e_r_ _p_e_r_ _I_P_ _t_h_e_ _h_o_s_t_n_a_m_e_ _r_e_s_o_l_v_e_s_ _t_o_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** aadddd oonnee ppeeeerr ppeerr IIPP tthhee hhoossttnnaammee rreessoollvveess ttoo ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::33888855 ****** | │ │ │ │ │ +|catch (...) { handle_exception(); } | │ │ │ │ │ +|#endif | │ │ │ │ │ | | │ │ │ │ │ -| TEST_EQUAL(ws.size(), 1); | │ │ │ │ │ -| TEST_EQUAL(std::count(ws.begin(), ws.end() | │ │ │ │ │ -| , "http://resume_data_http_seed.com"), 1); | │ │ │ │ │ -|} | │ │ │ │ │ +| void torrent::on_peer_name_lookup(error_code const& e | │ │ │ │ │ +| , std::vector
    const& host_list, int const port | │ │ │ │ │ +| , protocol_version const v) try | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(resume_override_torrent_deprecated) | │ │ │ │ │ -|{ | │ │ │ │ │ -| // resume data overrides the .torrent_file | │ │ │ │ │ -| std::printf("flags: no merge_resume_http_seed\n"); | │ │ │ │ │ -| lt::session ses(settings()); | │ │ │ │ │ -|_ _t_o_r_r_e_n_t___h_a_n_d_l_e_ _h_ _=_ _t_e_s_t___r_e_s_u_m_e___f_l_a_g_s_(_s_e_s_,_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___r_e_s_u_m_e_._c_p_p_:_1_6_8_3 |test all other resume flags here too. This would require returning more than just the torrent_status from test_resume_flags. Also | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_h_t_t_p_ _s_e_e_d_s_ _a_n_d_ _t_r_a_c_k_e_r_s_ _f_o_r_ _i_n_s_t_a_n_c_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteesstt aallll ootthheerr rreessuummee ffllaaggss hheerree ttoooo.. TThhiiss wwoouulldd rreeqquuiirree rreettuurrnniinngg mmoorree tthhaann jjuusstt tthhee ttoorrrreenntt__ssttaattuuss ffrroomm tteesstt__rreessuummee__ffllaaggss.. AAllssoo hhttttpp sseeeeddss aanndd ttrraacckkeerrss ffoorr iinnssttaannccee | │ │ │ │ │ -|********** | │ │ │ │ │ -|****** ....//tteesstt//tteesstt__rreessuummee..ccpppp::11668833 ****** | │ │ │ │ │ -|TEST_EQUAL(s.connections_limit, 1345); | │ │ │ │ │ -| TEST_EQUAL(s.uploads_limit, 1346); | │ │ │ │ │ -|} | │ │ │ │ │ +| INVARIANT_CHECK; | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(paused) | │ │ │ │ │ -|{ | │ │ │ │ │ -| lt::session ses(settings()); | │ │ │ │ │ -| // resume data overrides the paused flag | │ │ │ │ │ -| auto const now = lt::clock_type::now(); | │ │ │ │ │ -| torrent_status s = test_resume_flags(ses, torrent_flags::paused).status(); | │ │ │ │ │ -| default_tests(s, now); | │ │ │ │ │ -|#ifdef TORRENT_WINDOWS | │ │ │ │ │ -| TEST_EQUAL(s.save_path, "c:\\add_torrent_params save_path"); | │ │ │ │ │ -|#else | │ │ │ │ │ -| TEST_EQUAL(s.save_path, "/add_torrent_params save_path"); | │ │ │ │ │ +| COMPLETE_ASYNC("torrent::on_peer_name_lookup"); | │ │ │ │ │ +| | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| if (e && should_log()) | │ │ │ │ │ +| debug_log("peer name lookup error: %s", e.message().c_str()); | │ │ │ │ │ |#endif | │ │ │ │ │ -| TEST_EQUAL(s.flags & flags_mask, torrent_flags::paused); | │ │ │ │ │ -| TEST_EQUAL(s.connections_limit, 1345); | │ │ │ │ │ -| TEST_EQUAL(s.uploads_limit, 1346); | │ │ │ │ │ | | │ │ │ │ │ -|} | │ │ │ │ │ +| if (e || m_abort || host_list.empty() || m_ses.is_aborted()) return; | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(no_metadata) | │ │ │ │ │ -|{ | │ │ │ │ │ -| lt::session ses(settings()); | │ │ │ │ │ +|tcp::endpoint host(host_list.front(), std::uint16_t(port)); | │ │ │ │ │ | | │ │ │ │ │ -| add_torrent_params p; | │ │ │ │ │ -| p.info_hashes.v1 = sha1_hash("abababababababababab"); | │ │ │ │ │ -| p.save_path = "."; | │ │ │ │ │ -| p.name = "foobar"; | │ │ │ │ │ -| torrent_handle h = ses.add_torrent(p); | │ │ │ │ │ -| h.save_resume_data(torrent_handle::save_info_dict); | │ │ │ │ │ -| alert const* a = wait_for_alert(ses, save_resume_data_alert::alert_type); | │ │ │ │ │ -| TEST_CHECK(a); | │ │ │ │ │ -| save_resume_data_alert const* ra = alert_cast(a); | │ │ │ │ │ -| TEST_CHECK(ra); | │ │ │ │ │ -| if (ra) | │ │ │ │ │ -| { | │ │ │ │ │ -| auto const& atp = ra->params; | │ │ │ │ │ -| TEST_EQUAL(atp.info_hashes, p.info_hashes); | │ │ │ │ │ -| TEST_EQUAL(atp.name, "foobar"); | │ │ │ │ │ -| } | │ │ │ │ │ -|} | │ │ │ │ │ +| if (m_ip_filter && m_ip_filter->access(host.address()) & ip_filter::blocked) | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| if (should_log()) | │ │ │ │ │ +| { | │ │ │ │ │ +| debug_log("blocked ip from tracker: %s", host.address().to_string().c_str()); | │ │ │ │ │ +| } | │ │ │ │ │ +|#endif | │ │ │ │ │ +| if (m_ses.alerts().should_post()) | │ │ │ │ │ +| m_ses.alerts().emplace_alert(get_handle() | │ │ │ │ │ +| , host, peer_blocked_alert::ip_filter); | │ │ │ │ │ +| return; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|template | │ │ │ │ │ -|void test_unfinished_pieces(Fun f) | │ │ │ │ │ -|{ | │ │ │ │ │ -| // create a torrent and complete files | │ │ │ │ │ -| std::shared_ptr ti = generate_torrent(true, true); | │ │ │ │ │ +| if (add_peer(host, peer_info::tracker, v == protocol_version::V2 ? pex_lt_v2 : pex_flags_t(0))) | │ │ │ │ │ +| { | │ │ │ │ │ +| state_updated(); | │ │ │ │ │ | | │ │ │ │ │ -|_ _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s_ _p_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___f_l_a_g_s_._c_p_p_:_1_6_3 |change to a different test setup. currently always paused. test_set_after_add(torrent_flags::paused); test_unset_after_add | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_(_t_o_r_r_e_n_t___f_l_a_g_s_:_:_p_a_u_s_e_d_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** cchhaannggee ttoo aa ddiiffffeerreenntt tteesstt sseettuupp.. ccuurrrreennttllyy aallwwaayyss ppaauusseedd.. tteesstt__sseett__aafftteerr__aadddd((ttoorrrreenntt__ffllaaggss::::ppaauusseedd));; tteesstt__uunnsseett__aafftteerr__aadddd((ttoorrrreenntt__ffllaaggss::::ppaauusseedd));; ********** | │ │ │ │ │ -|****** ....//tteesstt//tteesstt__ffllaaggss..ccpppp::116633 ****** | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| if (should_log()) | │ │ │ │ │ +| { | │ │ │ │ │ +| debug_log("name-lookup add_peer() [ %s ] connect-candidates: %d" | │ │ │ │ │ +| , host.address().to_string().c_str() | │ │ │ │ │ +| , m_peer_list ? m_peer_list->num_connect_candidates() : -1); | │ │ │ │ │ +| } | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ +| update_want_peers(); | │ │ │ │ │ +|_ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_4_5_8_1_ _ _ _ _ _ _ _|_o_n_l_y_ _d_o_ _t_h_i_s_ _i_f_ _t_h_e_ _p_i_e_c_e_ _s_i_z_e_ _>_ _1_ _b_l_o_c_k_s_ _T_h_i_s_ _i_s_ _a_ _v_2_ _t_o_r_r_e_n_t_ _s_o_ _w_e_ _c_a_n_ _r_e_q_u_e_s_t_ _g_e_t_ _b_l_o_c_k_ _l_e_v_e_l_ _h_a_s_h_e_s_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** oonnllyy ddoo tthhiiss iiff tthhee ppiieeccee ssiizzee >> 11 bblloocckkss TThhiiss iiss aa vv22 ttoorrrreenntt ssoo wwee ccaann rreeqquueesstt ggeett bblloocckk lleevveell hhaasshheess.. ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::44558811 ****** | │ │ │ │ │ |{ | │ │ │ │ │ -| // share-mode | │ │ │ │ │ -| test_add_and_get_flags(torrent_flags::share_mode); | │ │ │ │ │ -| test_set_after_add(torrent_flags::share_mode); | │ │ │ │ │ -| test_unset_after_add(torrent_flags::share_mode); | │ │ │ │ │ +| std::set ret; | │ │ │ │ │ +| if (!blocks.empty() && !downloaders.empty()) | │ │ │ │ │ +| { | │ │ │ │ │ +| for (auto const b : blocks) ret.insert(downloaders[std::size_t(b)]); | │ │ │ │ │ +| } | │ │ │ │ │ +| else | │ │ │ │ │ +| { | │ │ │ │ │ +| std::copy(downloaders.begin(), downloaders.end(), std::inserter(ret, ret.begin())); | │ │ │ │ │ +| } | │ │ │ │ │ +| return ret; | │ │ │ │ │ +| }(); | │ │ │ │ │ +| | │ │ │ │ │ +| // if this piece wasn't downloaded from peers, we just found it on disk. | │ │ │ │ │ +| // In that case, we should just consider it as "not-have" and there's no | │ │ │ │ │ +| // need to try to get higher fidelity hashes (yet) | │ │ │ │ │ +| bool const found_on_disk = peers.size() == 1 && peers.count(nullptr); | │ │ │ │ │ +| | │ │ │ │ │ +| if (!torrent_file().info_hashes().has_v1() && blocks.empty() && !found_on_disk) | │ │ │ │ │ +| { | │ │ │ │ │ +|verify_block_hashes(index); | │ │ │ │ │ |} | │ │ │ │ │ +| | │ │ │ │ │ +| // the below code is penalizing peers that sent use bad data. | │ │ │ │ │ +| // increase the total amount of failed bytes | │ │ │ │ │ +| if (!found_on_disk) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (blocks.empty()) | │ │ │ │ │ +| add_failed_bytes(m_torrent_file->piece_size(index)); | │ │ │ │ │ +| else | │ │ │ │ │ +| add_failed_bytes(static_cast(blocks.size()) * default_block_size); | │ │ │ │ │ +| | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_EXTENSIONS | │ │ │ │ │ +| for (auto& ext : m_extensions) | │ │ │ │ │ +| { | │ │ │ │ │ +| ext->on_piece_failed(index); | │ │ │ │ │ +| } | │ │ │ │ │ |#endif | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(flag_apply_ip_filter) | │ │ │ │ │ -|{ | │ │ │ │ │ -| // apply-ip-filter | │ │ │ │ │ -| test_add_and_get_flags(torrent_flags::apply_ip_filter); | │ │ │ │ │ -| test_set_after_add(torrent_flags::apply_ip_filter); | │ │ │ │ │ -| test_unset_after_add(torrent_flags::apply_ip_filter); | │ │ │ │ │ -|} | │ │ │ │ │ +| // did we receive this piece from a single peer? | │ │ │ │ │ +| // if we know exactly which blocks failed the hash, we can also be certain | │ │ │ │ │ +| // that all peers in the list sent us bad data | │ │ │ │ │ +| bool const known_bad_peer = (!found_on_disk && peers.size() == 1) || !blocks.empty(); | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(flag_paused) | │ │ │ │ │ -|{ | │ │ │ │ │ -| // paused | │ │ │ │ │ -| test_add_and_get_flags(torrent_flags::paused); | │ │ │ │ │ -|} | │ │ │ │ │ +| penalize_peers(peers, index, known_bad_peer); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(flag_auto_managed) | │ │ │ │ │ -|{ | │ │ │ │ │ -| // auto-managed | │ │ │ │ │ -| test_add_and_get_flags(torrent_flags::auto_managed); | │ │ │ │ │ -| test_set_after_add(torrent_flags::auto_managed); | │ │ │ │ │ -| test_unset_after_add(torrent_flags::auto_managed); | │ │ │ │ │ -|} | │ │ │ │ │ +| // If m_storage isn't set here, it means we're shutting down | │ │ │ │ │ +| if (m_storage) | │ │ │ │ │ +| { | │ │ │ │ │ +|_ _ _ _/_/_ _i_t_ _d_o_e_s_n_'_t_ _m_a_k_e_ _m_u_c_h_ _s_e_n_s_e_ _t_o_ _f_a_i_l_ _t_o_ _h_a_s_h_ _a_ _p_i_e_c_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_7_5_2_5_ _ _ _ _ _ _ _|_c_o_m_e_ _u_p_ _w_i_t_h_ _a_ _b_e_t_t_e_r_ _w_a_y_ _o_f_ _d_o_i_n_g_ _t_h_i_s_,_ _i_n_s_t_e_a_d_ _o_f_ _a_n_ _i_m_m_e_d_i_a_t_e_l_y_ _i_n_v_o_k_e_d_ _l_a_m_b_d_a_ _e_x_p_r_e_s_s_i_o_n_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ccoommee uupp wwiitthh aa bbeetttteerr wwaayy ooff ddooiinngg tthhiiss,, iinnsstteeaadd ooff aann iimmmmeeddiiaatteellyy iinnvvookkeedd llaammbbddaa eexxpprreessssiioonn.. ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::77552255 ****** | │ │ │ │ │ +||| peerinfo->confirmed_supports_utp)) | │ │ │ │ │ +| { | │ │ │ │ │ +| sm = m_ses.utp_socket_manager(); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|// super seeding mode is automatically turned off if we're not a seed | │ │ │ │ │ -|// since the posix_disk_io is not threaded, this will happen immediately | │ │ │ │ │ -|#if TORRENT_HAVE_MMAP | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_SUPERSEEDING | │ │ │ │ │ -|TORRENT_TEST(flag_super_seeding) | │ │ │ │ │ -|{ | │ │ │ │ │ -| // super-seeding | │ │ │ │ │ -| test_add_and_get_flags(torrent_flags::super_seeding); | │ │ │ │ │ -| test_unset_after_add(torrent_flags::super_seeding); | │ │ │ │ │ -| test_set_after_add(torrent_flags::super_seeding); | │ │ │ │ │ -|} | │ │ │ │ │ +| // don't make a TCP connection if it's disabled | │ │ │ │ │ +| if (sm == nullptr && !settings().get_bool(settings_pack::enable_outgoing_tcp)) | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| if (should_log()) | │ │ │ │ │ +| { | │ │ │ │ │ +| debug_log("discarding peer \"%s\": TCP connections disabled " | │ │ │ │ │ +| "[ supports-utp: %d ]", peerinfo->to_string().c_str() | │ │ │ │ │ +| , peerinfo->supports_utp); | │ │ │ │ │ +| } | │ │ │ │ │ |#endif | │ │ │ │ │ +| return false; | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|aux::socket_type s = [&] { | │ │ │ │ │ +| | │ │ │ │ │ +|#if TORRENT_USE_I2P | │ │ │ │ │ +| if (peerinfo->is_i2p_addr) | │ │ │ │ │ +| { | │ │ │ │ │ +| // It's not entirely obvious why this peer connection is not marked as | │ │ │ │ │ +| // one. The main feature of a peer connection is that whether or not we | │ │ │ │ │ +| // proxy it is configurable. When we use i2p, we want to always prox | │ │ │ │ │ +| // everything via i2p. | │ │ │ │ │ +| | │ │ │ │ │ +| aux::proxy_settings proxy; | │ │ │ │ │ +| proxy.hostname = settings().get_str(settings_pack::i2p_hostname); | │ │ │ │ │ +| proxy.port = std::uint16_t(settings().get_int(settings_pack::i2p_port)); | │ │ │ │ │ +| proxy.type = settings_pack::i2p_proxy; | │ │ │ │ │ +| | │ │ │ │ │ +| aux::socket_type ret = instantiate_connection(m_ses.get_context() | │ │ │ │ │ +| , proxy, nullptr, nullptr, false, false); | │ │ │ │ │ +| i2p_stream& str = boost::get(ret); | │ │ │ │ │ +| str.set_local_i2p_endpoint(m_ses.local_i2p_endpoint()); | │ │ │ │ │ +| str.set_destination(static_cast(peerinfo)->dest()); | │ │ │ │ │ +| str.set_command(i2p_stream::cmd_connect); | │ │ │ │ │ +| str.set_session_id(m_ses.i2p_session()); | │ │ │ │ │ +| return ret; | │ │ │ │ │ +| } | │ │ │ │ │ +| else | │ │ │ │ │ |#endif | │ │ │ │ │ +| { | │ │ │ │ │ +| void* userdata = nullptr; | │ │ │ │ │ +|#ifdef TORRENT_SSL_PEERS | │ │ │ │ │ +| if (is_ssl_torrent()) | │ │ │ │ │ +|_ _ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_9_1_1_8_ _ _ _ _ _ _ _|_p_e_r_h_a_p_s_ _0_ _s_h_o_u_l_d_ _a_c_t_u_a_l_l_y_ _m_e_a_n_ _0_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ppeerrhhaappss 00 sshhoouulldd aaccttuuaallllyy mmeeaann 00 ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::99111188 ****** | │ │ │ │ │ +|// finished torrents may not change their queue positions, as it's set to | │ │ │ │ │ +| // -1 | │ │ │ │ │ +| if ((m_abort || is_finished()) && p != no_pos) return; | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(flag_sequential_download) | │ │ │ │ │ -|{ | │ │ │ │ │ -| // sequential-download | │ │ │ │ │ -| test_add_and_get_flags(torrent_flags::sequential_download); | │ │ │ │ │ -| test_set_after_add(torrent_flags::sequential_download); | │ │ │ │ │ -| test_unset_after_add(torrent_flags::sequential_download); | │ │ │ │ │ -|_}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_t_e_s_t_/_t_e_s_t___f_l_a_g_s_._c_p_p_:_2_0_5 |this test is flaky, since the torrent will become ready before asking for the flags, and by then stop_when_ready will have been | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_c_l_e_a_r_e_d_ _t_e_s_t___a_d_d___a_n_d___g_e_t___f_l_a_g_s_(_t_o_r_r_e_n_t___f_l_a_g_s_:_:_s_t_o_p___w_h_e_n___r_e_a_d_y_)_;_ _s_e_t_t_i_n_g_ _s_t_o_p_-_w_h_e_n_-_r_e_a_d_y_ _w_h_e_n_ _a_l_r_e_a_d_y_ _s_t_o_p_p_e_d_ _h_a_s_ _n_o_ _e_f_f_e_c_t_._ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss tteesstt iiss ffllaakkyy,, ssiinnccee tthhee ttoorrrreenntt wwiillll bbeeccoommee rreeaaddyy bbeeffoorree aasskkiinngg ffoorr tthhee ffllaaggss,, aanndd bbyy tthheenn ssttoopp__wwhheenn__rreeaaddyy wwiillll hhaavvee bbeeeenn cclleeaarreedd tteesstt__aadddd__aanndd__ggeett__ffllaaggss | │ │ │ │ │ -|((ttoorrrreenntt__ffllaaggss::::ssttoopp__wwhheenn__rreeaaddyy));; sseettttiinngg ssttoopp--wwhheenn--rreeaaddyy wwhheenn aallrreeaaddyy ssttooppppeedd hhaass nnoo eeffffeecctt.. ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_tt_ee_ss_tt_//_tt_ee_ss_tt____ff_ll_aa_gg_ss_.._cc_pp_pp_::_22_00_55_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_t_e_s_t_/_t_e_s_t___f_l_a_g_s_._c_p_p_:_2_0_9_ _ _ _ _|_c_h_a_n_g_e_ _t_o_ _a_ _d_i_f_f_e_r_e_n_t_ _t_e_s_t_ _s_e_t_u_p_._ _c_u_r_r_e_n_t_l_y_ _a_l_w_a_y_s_ _p_a_u_s_e_d_._ _t_e_s_t___s_e_t___a_f_t_e_r___a_d_d_(_t_o_r_r_e_n_t___f_l_a_g_s_:_:_s_t_o_p___w_h_e_n___r_e_a_d_y_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** cchhaannggee ttoo aa ddiiffffeerreenntt tteesstt sseettuupp.. ccuurrrreennttllyy aallwwaayyss ppaauusseedd.. tteesstt__sseett__aafftteerr__aadddd((ttoorrrreenntt__ffllaaggss::::ssttoopp__wwhheenn__rreeaaddyy));; ********** | │ │ │ │ │ -|****** ....//tteesstt//tteesstt__ffllaaggss..ccpppp::220099 ****** | │ │ │ │ │ -|test_set_after_add(torrent_flags::super_seeding); | │ │ │ │ │ -|} | │ │ │ │ │ +| TORRENT_ASSERT((p == no_pos) == is_finished() | │ │ │ │ │ +| || (!m_auto_managed && p == no_pos) | │ │ │ │ │ +| || (m_abort && p == no_pos) | │ │ │ │ │ +| || (!m_added && p == no_pos)); | │ │ │ │ │ +| if (p == m_sequence_number) return; | │ │ │ │ │ +| | │ │ │ │ │ +| TORRENT_ASSERT(p >= no_pos); | │ │ │ │ │ +| | │ │ │ │ │ +| state_updated(); | │ │ │ │ │ +| | │ │ │ │ │ +| m_ses.set_queue_position(this, p); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void torrent::set_max_uploads(int limit, bool const state_update) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ +|if (limit <= 0) limit = (1 << 24) - 1; | │ │ │ │ │ +|if (int(m_max_uploads) == limit) return; | │ │ │ │ │ +| if (state_update) state_updated(); | │ │ │ │ │ +| m_max_uploads = aux::numeric_cast(limit); | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| if (should_log() && state_update) | │ │ │ │ │ +| debug_log("*** set-max-uploads: %d", m_max_uploads); | │ │ │ │ │ |#endif | │ │ │ │ │ +| | │ │ │ │ │ +| if (state_update) | │ │ │ │ │ +| set_need_save_resume(torrent_handle::if_config_changed); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void torrent::set_max_connections(int limit, bool const state_update) | │ │ │ │ │ +| { | │ │ │ │ │ +|_ _ _T_O_R_R_E_N_T___A_S_S_E_R_T_(_i_s___s_i_n_g_l_e___t_h_r_e_a_d_(_)_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_9_1_3_5_ _ _ _ _ _ _ _|_p_e_r_h_a_p_s_ _0_ _s_h_o_u_l_d_ _a_c_t_u_a_l_l_y_ _m_e_a_n_ _0_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ppeerrhhaappss 00 sshhoouulldd aaccttuuaallllyy mmeeaann 00 ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::99113355 ****** | │ │ │ │ │ +| void torrent::set_max_uploads(int limit, bool const state_update) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ +| if (limit <= 0) limit = (1 << 24) - 1; | │ │ │ │ │ +| if (int(m_max_uploads) == limit) return; | │ │ │ │ │ +| if (state_update) state_updated(); | │ │ │ │ │ +| m_max_uploads = aux::numeric_cast(limit); | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| if (should_log() && state_update) | │ │ │ │ │ +| debug_log("*** set-max-uploads: %d", m_max_uploads); | │ │ │ │ │ |#endif | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(flag_sequential_download) | │ │ │ │ │ -|{ | │ │ │ │ │ -| // sequential-download | │ │ │ │ │ -| test_add_and_get_flags(torrent_flags::sequential_download); | │ │ │ │ │ -| test_set_after_add(torrent_flags::sequential_download); | │ │ │ │ │ -| test_unset_after_add(torrent_flags::sequential_download); | │ │ │ │ │ -|} | │ │ │ │ │ +| if (state_update) | │ │ │ │ │ +| set_need_save_resume(torrent_handle::if_config_changed); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|// the stop when ready flag will be cleared when the torrent is ready to start | │ │ │ │ │ -|// downloading. | │ │ │ │ │ -|// since the posix_disk_io is not threaded, this will happen immediately | │ │ │ │ │ -|#if TORRENT_HAVE_MMAP | │ │ │ │ │ -|TORRENT_TEST(flag_stop_when_ready) | │ │ │ │ │ -|{ | │ │ │ │ │ -| // stop-when-ready | │ │ │ │ │ -|test_unset_after_add(torrent_flags::stop_when_ready); | │ │ │ │ │ -|} | │ │ │ │ │ +| void torrent::set_max_connections(int limit, bool const state_update) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ +|if (limit <= 0) limit = (1 << 24) - 1; | │ │ │ │ │ +|if (int(m_max_connections) == limit) return; | │ │ │ │ │ +| if (state_update) state_updated(); | │ │ │ │ │ +| m_max_connections = aux::numeric_cast(limit); | │ │ │ │ │ +| update_want_peers(); | │ │ │ │ │ +| | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| if (should_log() && state_update) | │ │ │ │ │ +| debug_log("*** set-max-connections: %d", m_max_connections); | │ │ │ │ │ |#endif | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(flag_disable_dht) | │ │ │ │ │ -|{ | │ │ │ │ │ -| test_add_and_get_flags(torrent_flags::disable_dht); | │ │ │ │ │ -| test_set_after_add(torrent_flags::disable_dht); | │ │ │ │ │ -| test_unset_after_add(torrent_flags::disable_dht); | │ │ │ │ │ -|} | │ │ │ │ │ +| if (num_peers() > int(m_max_connections)) | │ │ │ │ │ +| { | │ │ │ │ │ +| disconnect_peers(num_peers() - m_max_connections | │ │ │ │ │ +| , errors::too_many_connections); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ +| if (state_update) | │ │ │ │ │ +| set_need_save_resume(torrent_handle::if_config_changed); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(flag_disable_lsd) | │ │ │ │ │ -|{ | │ │ │ │ │ -| test_add_and_get_flags(torrent_flags::disable_lsd); | │ │ │ │ │ -| test_set_after_add(torrent_flags::disable_lsd); | │ │ │ │ │ -| test_unset_after_add(torrent_flags::disable_lsd); | │ │ │ │ │ -|} | │ │ │ │ │ +| void torrent::set_upload_limit(int const limit) | │ │ │ │ │ +| { | │ │ │ │ │ +| set_limit_impl(limit, peer_connection::upload_channel); | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| debug_log("*** set-upload-limit: %d", limit); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_TEST(flag_disable_pex) | │ │ │ │ │ -|{ | │ │ │ │ │ -| test_add_and_get_flags(torrent_flags::disable_pex); | │ │ │ │ │ -| test_set_after_add(torrent_flags::disable_pex); | │ │ │ │ │ -| test_unset_after_add(torrent_flags::disable_pex); | │ │ │ │ │ -|_}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_a_c_k_e_t___b_u_f_f_e_r_._c_p_p_:_1_5_7_ _ _|_u_s_e_ _c_o_m_p_a_r_e___l_e_s_s___w_r_a_p_ _f_o_r_ _t_h_i_s_ _c_o_m_p_a_r_i_s_o_n_ _a_s_ _w_e_l_l_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** uussee ccoommppaarree__lleessss__wwrraapp ffoorr tthhiiss ccoommppaarriissoonn aass wweellll ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppaacckkeett__bbuuffffeerr..ccpppp::115577 ****** | │ │ │ │ │ -|{ | │ │ │ │ │ -| INVARIANT_CHECK; | │ │ │ │ │ -| TORRENT_ASSERT_VAL(size <= 0xffff, size); | │ │ │ │ │ -| std::uint32_t new_size = m_capacity == 0 ? 16 : m_capacity; | │ │ │ │ │ +| void torrent::set_download_limit(int const limit) | │ │ │ │ │ +|_ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_1_1_0_6_1_ _ _ _ _ _ _|_i_n_s_t_e_a_d_ _o_f_ _r_e_s_o_r_t_i_n_g_ _t_h_e_ _w_h_o_l_e_ _l_i_s_t_,_ _i_n_s_e_r_t_ _t_h_e_ _p_e_e_r_s_ _d_i_r_e_c_t_l_y_ _i_n_t_o_ _t_h_e_ _r_i_g_h_t_ _p_l_a_c_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iinnsstteeaadd ooff rreessoorrttiinngg tthhee wwhhoollee lliisstt,, iinnsseerrtt tthhee ppeeeerrss ddiirreeccttllyy iinnttoo tthhee rriigghhtt ppllaaccee ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::1111006611 ****** | │ │ │ │ │ +|std::printf("timed out [average-piece-time: %d ms ]\n" | │ │ │ │ │ +| , m_average_piece_time); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| while (new_size < size) | │ │ │ │ │ -| new_size <<= 1; | │ │ │ │ │ +| // pick all blocks for this piece. the peers list is kept up to date | │ │ │ │ │ +| // and sorted. when we issue a request to a peer, its download queue | │ │ │ │ │ +| // time will increase and it may need to be bumped in the peers list, | │ │ │ │ │ +| // since it's ordered by download queue time | │ │ │ │ │ +| pick_time_critical_block(peers, ignore_peers | │ │ │ │ │ +| , peers_with_requests | │ │ │ │ │ +| , pi, &i, m_picker.get() | │ │ │ │ │ +| , blocks_in_piece, timed_out); | │ │ │ │ │ | | │ │ │ │ │ -| aux::unique_ptr new_storage(new packet_ptr[new_size]); | │ │ │ │ │ +| // put back the peers we ignored into the peer list for the next piece | │ │ │ │ │ +| if (!ignore_peers.empty()) | │ │ │ │ │ +| { | │ │ │ │ │ +| peers.insert(peers.begin(), ignore_peers.begin(), ignore_peers.end()); | │ │ │ │ │ +| ignore_peers.clear(); | │ │ │ │ │ | | │ │ │ │ │ -| for (index_type i = m_first; i < (m_first + m_capacity); ++i) | │ │ │ │ │ -| new_storage[i & (new_size - 1)] = std::move(m_storage[i & (m_capacity - 1)]); | │ │ │ │ │ +|std::sort(peers.begin(), peers.end() | │ │ │ │ │ +|, [] (peer_connection const* lhs, peer_connection const* rhs) | │ │ │ │ │ +| { return lhs->download_queue_time(16*1024) < rhs->download_queue_time(16*1024); }); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| m_storage = std::move(new_storage); | │ │ │ │ │ -| m_capacity = new_size; | │ │ │ │ │ +| // if this peer's download time exceeds 2 seconds, we're done. | │ │ │ │ │ +| // We don't want to build unreasonably long request queues | │ │ │ │ │ +| if (!peers.empty() && peers[0]->download_queue_time() > milliseconds(2000)) | │ │ │ │ │ +| break; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| // commit all the time critical requests | │ │ │ │ │ +| for (auto p : peers_with_requests) | │ │ │ │ │ +| { | │ │ │ │ │ +| p->send_block_requests(); | │ │ │ │ │ +| } | │ │ │ │ │ | } | │ │ │ │ │ +|#endif // TORRENT_DISABLE_STREAMING | │ │ │ │ │ | | │ │ │ │ │ -| packet_ptr packet_buffer::remove(index_type idx) | │ │ │ │ │ +| std::set torrent::web_seeds(web_seed_entry::type_t const type) const | │ │ │ │ │ | { | │ │ │ │ │ -| INVARIANT_CHECK; | │ │ │ │ │ -|if (idx >= m_first + m_capacity) | │ │ │ │ │ -|return packet_ptr(); | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ +| std::set ret; | │ │ │ │ │ +| for (auto const& s : m_web_seeds) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (s.peer_info.banned) continue; | │ │ │ │ │ +| if (s.removed) continue; | │ │ │ │ │ +| if (s.type != type) continue; | │ │ │ │ │ +| ret.insert(s.url); | │ │ │ │ │ +| } | │ │ │ │ │ +|_ _ _r_e_t_u_r_n_ _r_e_t_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/ |why is this a linked list? | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_u_d_p___t_r_a_c_k_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_6_3_3_|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** wwhhyy iiss tthhiiss aa lliinnkkeedd lliisstt?? ********** | │ │ │ │ │ +|****** ....//ssrrcc//uuddpp__ttrraacckkeerr__ccoonnnneeccttiioonn..ccpppp::663333 ****** | │ │ │ │ │ +|ipv6_peer_entry e{}; | │ │ │ │ │ +| std::memcpy(e.ip.data(), buf.data(), 16); | │ │ │ │ │ +| buf = buf.subspan(16); | │ │ │ │ │ +| e.port = aux::read_uint16(buf); | │ │ │ │ │ +| resp.peers6.push_back(e); | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| else | │ │ │ │ │ +| { | │ │ │ │ │ +| resp.peers4.reserve(static_cast(num_peers)); | │ │ │ │ │ +| for (int i = 0; i < num_peers; ++i) | │ │ │ │ │ +| { | │ │ │ │ │ +| ipv4_peer_entry e{}; | │ │ │ │ │ +| std::memcpy(e.ip.data(), buf.data(), 4); | │ │ │ │ │ +| buf = buf.subspan(4); | │ │ │ │ │ +| e.port = aux::read_uint16(buf); | │ │ │ │ │ +| resp.peers4.push_back(e); | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| if (compare_less_wrap(idx, m_first, 0xffff)) | │ │ │ │ │ -| return packet_ptr(); | │ │ │ │ │ +|std::list
    ip_list; | │ │ │ │ │ +|std::transform(m_endpoints.begin(), m_endpoints.end(), std::back_inserter(ip_list) | │ │ │ │ │ +| , [](tcp::endpoint const& ep) { return ep.address(); } ); | │ │ │ │ │ | | │ │ │ │ │ -| std::size_t const mask = m_capacity - 1; | │ │ │ │ │ -| packet_ptr old_value = std::move(m_storage[idx & mask]); | │ │ │ │ │ -| m_storage[idx & mask].reset(); | │ │ │ │ │ +| cb->tracker_response(tracker_req(), m_target.address(), ip_list, resp); | │ │ │ │ │ | | │ │ │ │ │ -| if (old_value) | │ │ │ │ │ +| close(); | │ │ │ │ │ +| return true; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| bool udp_tracker_connection::on_scrape_response(span buf) | │ │ │ │ │ +| { | │ │ │ │ │ +| restart_read_timeout(); | │ │ │ │ │ +| auto const action = static_cast(aux::read_int32(buf)); | │ │ │ │ │ +| std::uint32_t const transaction = aux::read_uint32(buf); | │ │ │ │ │ +| | │ │ │ │ │ +| if (transaction != m_transaction_id) | │ │ │ │ │ | { | │ │ │ │ │ -| --m_size; | │ │ │ │ │ -| if (m_size == 0) m_last = m_first; | │ │ │ │ │ +| fail(error_code(errors::invalid_tracker_transaction_id), operation_t::bittorrent); | │ │ │ │ │ +| return false; | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| if (idx == m_first && m_size != 0) | │ │ │ │ │ +| if (action == action_t::error) | │ │ │ │ │ | { | │ │ │ │ │ -| ++m_first; | │ │ │ │ │ -| for (index_type i = 0; i < m_capacity; ++i, ++m_first) | │ │ │ │ │ -| if (m_storage[m_first & mask]) break; | │ │ │ │ │ -| m_first &= 0xffff; | │ │ │ │ │ +| fail(error_code(errors::tracker_failure), operation_t::bittorrent | │ │ │ │ │ +| , std::string(buf.data(), static_cast(buf.size())).c_str()); | │ │ │ │ │ +| return true; | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| if (((idx + 1) & 0xffff) == m_last && m_size != 0) | │ │ │ │ │ +| if (action != action_t::scrape) | │ │ │ │ │ +|_ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_m_m_a_p___d_i_s_k___i_o_._c_p_p_:_5_7_8_ _ _ _|_i_n_ _t_h_e_ _f_u_t_u_r_e_,_ _p_r_o_p_a_g_a_t_e_ _e_x_c_e_p_t_i_o_n_s_ _b_a_c_k_ _t_o_ _t_h_e_ _h_a_n_d_l_e_r_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iinn tthhee ffuuttuurree,, pprrooppaaggaattee eexxcceeppttiioonnss bbaacckk ttoo tthhee hhaannddlleerrss ********** | │ │ │ │ │ +|****** ....//ssrrcc//mmmmaapp__ddiisskk__iioo..ccpppp::557788 ****** | │ │ │ │ │ +|#if DEBUG_DISK_THREAD | │ │ │ │ │ | { | │ │ │ │ │ -| --m_last; | │ │ │ │ │ -| for (index_type i = 0; i < m_capacity; ++i, --m_last) | │ │ │ │ │ -| if (m_storage[m_last & mask]) break; | │ │ │ │ │ -| ++m_last; | │ │ │ │ │ -|_ _ _ _m___l_a_s_t_ _&_=_ _0_x_f_f_f_f_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_s_e_s_s_i_o_n___h_a_n_d_l_e_._c_p_p_:_4_9_9_ _|_i_n_ _C_+_+_1_4_,_ _u_s_e_ _u_n_i_q_u_e___p_t_r_ _a_n_d_ _m_o_v_e_ _i_t_ _i_n_t_o_ _t_h_e_ _l_a_m_b_d_a_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iinn CC++++1144,, uussee uunniiqquuee__ppttrr aanndd mmoovvee iitt iinnttoo tthhee llaammbbddaa ********** | │ │ │ │ │ -|****** ....//ssrrcc//sseessssiioonn__hhaannddllee..ccpppp::449999 ****** | │ │ │ │ │ -|#ifndef BOOST_NO_EXCEPTIONS | │ │ │ │ │ -| if (params.save_path.empty()) | │ │ │ │ │ -| aux::throw_ex(error_code(errors::invalid_save_path)); | │ │ │ │ │ -|#else | │ │ │ │ │ -| TORRENT_ASSERT_PRECOND(!params.save_path.empty()); | │ │ │ │ │ -|#endif | │ │ │ │ │ +| std::unique_lock l(m_job_mutex); | │ │ │ │ │ | | │ │ │ │ │ -|#if TORRENT_ABI_VERSION < 3 | │ │ │ │ │ -| if (!params.info_hashes.has_v1() && !params.info_hashes.has_v2() && !params.ti) | │ │ │ │ │ -| params.info_hashes.v1 = params.info_hash; | │ │ │ │ │ +| DLOG("perform_job job: %s ( %s%s) piece: %d offset: %d outstanding: %d\n" | │ │ │ │ │ +| , job_action_name[j->action] | │ │ │ │ │ +| , (j->flags & mmap_disk_job::fence) ? "fence ": "" | │ │ │ │ │ +| , (j->flags & mmap_disk_job::force_copy) ? "force_copy ": "" | │ │ │ │ │ +| , static_cast(j->piece), j->d.io.offset | │ │ │ │ │ +| , j->storage ? j->storage->num_outstanding_jobs() : -1); | │ │ │ │ │ +| } | │ │ │ │ │ |#endif | │ │ │ │ │ | | │ │ │ │ │ -| // the internal torrent object keeps and mutates state in the | │ │ │ │ │ -| // torrent_info object. We can't let that leak back to the client | │ │ │ │ │ -| if (params.ti) | │ │ │ │ │ -| params.ti = std::make_shared(*params.ti); | │ │ │ │ │ -| | │ │ │ │ │ -| // we cannot capture a unique_ptr into a lambda in c++11, so we use a raw | │ │ │ │ │ -| // pointer for now. async_call uses a lambda expression to post the call | │ │ │ │ │ -| // to the main thread | │ │ │ │ │ -|auto* p = new add_torrent_params(std::move(params)); | │ │ │ │ │ -|auto guard = aux::scope_end([p]{ delete p; }); | │ │ │ │ │ -| p->save_path = complete(p->save_path); | │ │ │ │ │ +| std::shared_ptr storage = j->storage; | │ │ │ │ │ | | │ │ │ │ │ -|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ -| handle_backwards_compatible_resume_data(*p); | │ │ │ │ │ -|#endif | │ │ │ │ │ +| TORRENT_ASSERT(static_cast(j->action) < int(job_functions.size())); | │ │ │ │ │ | | │ │ │ │ │ -| async_call(&session_impl::async_add_torrent, p); | │ │ │ │ │ -| guard.disarm(); | │ │ │ │ │ -| } | │ │ │ │ │ +| m_stats_counters.inc_stats_counter(counters::num_running_disk_jobs, 1); | │ │ │ │ │ | | │ │ │ │ │ -|#ifndef BOOST_NO_EXCEPTIONS | │ │ │ │ │ -|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ -| // if the torrent already exists, this will throw duplicate_torrent | │ │ │ │ │ -| torrent_handle session_handle::add_torrent( | │ │ │ │ │ -| torrent_info const& ti | │ │ │ │ │ -| , std::string const& save_path | │ │ │ │ │ -| , entry const& resume_data | │ │ │ │ │ -| , storage_mode_t storage_mode | │ │ │ │ │ -| , bool const add_paused) | │ │ │ │ │ -| { | │ │ │ │ │ -| add_torrent_params p; | │ │ │ │ │ -| p.ti = std::make_shared(ti); | │ │ │ │ │ -| p.save_path = save_path; | │ │ │ │ │ -| if (resume_data.type() != entry::undefined_t) | │ │ │ │ │ +| // call disk function | │ │ │ │ │ +|status_t ret = status_t::no_error; | │ │ │ │ │ +|try | │ │ │ │ │ | { | │ │ │ │ │ -| bencode(std::back_inserter(p.resume_data), resume_data); | │ │ │ │ │ +| int const idx = static_cast(j->action); | │ │ │ │ │ +| ret = (this->*(job_functions[static_cast(idx)]))(j); | │ │ │ │ │ | } | │ │ │ │ │ -| p.storage_mode = storage_mode; | │ │ │ │ │ -|_ _ _i_f_ _(_a_d_d___p_a_u_s_e_d_)_ _p_._f_l_a_g_s_ _|_=_ _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s_:_:_f_l_a_g___p_a_u_s_e_d_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/_p_o_s_i_x___p_a_r_t___f_i_l_e_._c_p_p_:_3_3_7|what do we do if someone is currently reading from the disk from this piece? does it matter? Since we won't actively erase the data | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_f_r_o_m_ _d_i_s_k_,_ _b_u_t_ _i_t_ _m_a_y_ _b_e_ _o_v_e_r_w_r_i_t_t_e_n_ _s_o_o_n_,_ _i_t_'_s_ _p_r_o_b_a_b_l_y_ _n_o_t_ _t_h_a_t_ _b_i_g_ _o_f_ _a_ _d_e_a_l_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** wwhhaatt ddoo wwee ddoo iiff ssoommeeoonnee iiss ccuurrrreennttllyy rreeaaddiinngg ffrroomm tthhee ddiisskk ffrroomm tthhiiss ppiieeccee?? ddooeess iitt mmaatttteerr?? SSiinnccee wwee wwoonn''tt aaccttiivveellyy eerraassee tthhee ddaattaa ffrroomm ddiisskk,, bbuutt iitt mmaayy bbee oovveerrwwrriitttteenn | │ │ │ │ │ -|ssoooonn,, iitt''ss pprroobbaabbllyy nnoott tthhaatt bbiigg ooff aa ddeeaall ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppoossiixx__ppaarrtt__ffiillee..ccpppp::333377 ****** | │ │ │ │ │ -| if (ec) return {}; | │ │ │ │ │ -| | │ │ │ │ │ -|#ifdef TORRENT_WINDOWS | │ │ │ │ │ -| ret = file_pointer(::_wfopen(convert_to_native_path_string(fn).c_str(), L"wb+")); | │ │ │ │ │ -|#else | │ │ │ │ │ -| ret = file_pointer(::fopen(fn.c_str(), "wb+")); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| if (ret.file() == nullptr) | │ │ │ │ │ -| ec.assign(errno, generic_category()); | │ │ │ │ │ +| catch (boost::system::system_error const& err) | │ │ │ │ │ +| { | │ │ │ │ │ +| ret = status_t::fatal_disk_error; | │ │ │ │ │ +| j->error.ec = err.code(); | │ │ │ │ │ +| j->error.operation = operation_t::exception; | │ │ │ │ │ | } | │ │ │ │ │ -| if (ec) return {}; | │ │ │ │ │ -| return ret; | │ │ │ │ │ +| catch (std::bad_alloc const&) | │ │ │ │ │ +| { | │ │ │ │ │ +| ret = status_t::fatal_disk_error; | │ │ │ │ │ +| j->error.ec = errors::no_memory; | │ │ │ │ │ +| j->error.operation = operation_t::exception; | │ │ │ │ │ +| } | │ │ │ │ │ +| catch (std::exception const&) | │ │ │ │ │ +| { | │ │ │ │ │ +| ret = status_t::fatal_disk_error; | │ │ │ │ │ +| j->error.ec = boost::asio::error::fault; | │ │ │ │ │ +| j->error.operation = operation_t::exception; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| // note that -2 errors are OK | │ │ │ │ │ +| TORRENT_ASSERT(ret != status_t::fatal_disk_error | │ │ │ │ │ +| || (j->error.ec && j->error.operation != operation_t::unknown)); | │ │ │ │ │ +| | │ │ │ │ │ +|_ _ _m___s_t_a_t_s___c_o_u_n_t_e_r_s_._i_n_c___s_t_a_t_s___c_o_u_n_t_e_r_(_c_o_u_n_t_e_r_s_:_:_n_u_m___r_u_n_n_i_n_g___d_i_s_k___j_o_b_s_,_ _-_1_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/_m_m_a_p___d_i_s_k___i_o_._c_p_p_:_1_0_1_7 |this is potentially very expensive. One way to solve it would be to have a fence for just this one piece. but it hardly seems worth | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_t_h_e_ _c_o_m_p_l_e_x_i_t_y_ _a_n_d_ _c_o_s_t_ _j_u_s_t_ _f_o_r_ _t_h_e_ _e_d_g_e_ _c_a_s_e_ _o_f_ _r_e_c_e_i_v_i_n_g_ _a_ _c_o_r_r_u_p_t_ _p_i_e_c_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss iiss ppootteennttiiaallllyy vveerryy eexxppeennssiivvee.. OOnnee wwaayy ttoo ssoollvvee iitt wwoouulldd bbee ttoo hhaavvee aa ffeennccee ffoorr jjuusstt tthhiiss oonnee ppiieeccee.. bbuutt iitt hhaarrddllyy sseeeemmss wwoorrtthh tthhee ccoommpplleexxiittyy aanndd ccoosstt jjuusstt ffoorr tthhee | │ │ │ │ │ +|eeddggee ccaassee ooff rreecceeiivviinngg aa ccoorrrruupptt ppiieeccee ********** | │ │ │ │ │ +|****** ....//ssrrcc//mmmmaapp__ddiisskk__iioo..ccpppp::11001177 ****** | │ │ │ │ │ +|aux::mmap_disk_job* j = m_job_pool.allocate_job(aux::job_action_t::file_priority); | │ │ │ │ │ +| j->storage = m_torrents[storage]->shared_from_this(); | │ │ │ │ │ +| j->argument = std::move(prios); | │ │ │ │ │ +| j->callback = std::move(handler); | │ │ │ │ │ +| | │ │ │ │ │ +| add_fence_job(j); | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| void posix_part_file::free_piece(piece_index_t const piece) | │ │ │ │ │ +| void mmap_disk_io::async_clear_piece(storage_index_t const storage | │ │ │ │ │ +| , piece_index_t const index, std::function handler) | │ │ │ │ │ | { | │ │ │ │ │ -| auto const i = m_piece_map.find(piece); | │ │ │ │ │ -| if (i == m_piece_map.end()) return; | │ │ │ │ │ +| aux::mmap_disk_job* j = m_job_pool.allocate_job(aux::job_action_t::clear_piece); | │ │ │ │ │ +| j->storage = m_torrents[storage]->shared_from_this(); | │ │ │ │ │ +| j->piece = index; | │ │ │ │ │ +| j->callback = std::move(handler); | │ │ │ │ │ | | │ │ │ │ │ +| // regular jobs are not guaranteed to be executed in-order | │ │ │ │ │ +| // since clear piece must guarantee that all write jobs that | │ │ │ │ │ +| // have been issued finish before the clear piece job completes | │ │ │ │ │ | | │ │ │ │ │ -|m_free_slots.push_back(i->second); | │ │ │ │ │ -| m_piece_map.erase(i); | │ │ │ │ │ -| m_dirty_metadata = true; | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/_m_m_a_p___d_i_s_k___i_o_._c_p_p_:_1_0_2_2 |Perhaps the job queue could be traversed and all jobs for this piece could be cancelled. If there are no threads currently writing | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_t_o_ _t_h_i_s_ _p_i_e_c_e_,_ _w_e_ _c_o_u_l_d_ _s_k_i_p_ _t_h_e_ _f_e_n_c_e_ _a_l_t_o_g_e_t_h_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** PPeerrhhaappss tthhee jjoobb qquueeuuee ccoouulldd bbee ttrraavveerrsseedd aanndd aallll jjoobbss ffoorr tthhiiss ppiieeccee ccoouulldd bbee ccaanncceelllleedd.. IIff tthheerree aarree nnoo tthhrreeaaddss ccuurrrreennttllyy wwrriittiinngg ttoo tthhiiss ppiieeccee,, wwee ccoouulldd sskkiipp tthhee ffeennccee| │ │ │ │ │ +|aallttooggeetthheerr ********** | │ │ │ │ │ +|****** ....//ssrrcc//mmmmaapp__ddiisskk__iioo..ccpppp::11002222 ****** | │ │ │ │ │ +|j->storage = m_torrents[storage]->shared_from_this(); | │ │ │ │ │ +| j->argument = std::move(prios); | │ │ │ │ │ +| j->callback = std::move(handler); | │ │ │ │ │ +| | │ │ │ │ │ +| add_fence_job(j); | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| void posix_part_file::move_partfile(std::string const& path, error_code& ec) | │ │ │ │ │ +| void mmap_disk_io::async_clear_piece(storage_index_t const storage | │ │ │ │ │ +| , piece_index_t const index, std::function handler) | │ │ │ │ │ | { | │ │ │ │ │ -| flush_metadata_impl(ec); | │ │ │ │ │ -| if (ec) return; | │ │ │ │ │ +| aux::mmap_disk_job* j = m_job_pool.allocate_job(aux::job_action_t::clear_piece); | │ │ │ │ │ +| j->storage = m_torrents[storage]->shared_from_this(); | │ │ │ │ │ +| j->piece = index; | │ │ │ │ │ +| j->callback = std::move(handler); | │ │ │ │ │ | | │ │ │ │ │ -| if (!m_piece_map.empty()) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::string old_path = combine_path(m_path, m_name); | │ │ │ │ │ -| std::string new_path = combine_path(path, m_name); | │ │ │ │ │ +| // regular jobs are not guaranteed to be executed in-order | │ │ │ │ │ +| // since clear piece must guarantee that all write jobs that | │ │ │ │ │ +| // have been issued finish before the clear piece job completes | │ │ │ │ │ | | │ │ │ │ │ -| rename(old_path, new_path, ec); | │ │ │ │ │ -| if (ec == boost::system::errc::no_such_file_or_directory) | │ │ │ │ │ -| ec.clear(); | │ │ │ │ │ | | │ │ │ │ │ -| if (ec) | │ │ │ │ │ -| { | │ │ │ │ │ -| storage_error se; | │ │ │ │ │ -| aux::copy_file(old_path, new_path, se); | │ │ │ │ │ -| ec = se.ec; | │ │ │ │ │ -| if (ec) return; | │ │ │ │ │ -| remove(old_path, ec); | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| m_path = path; | │ │ │ │ │ -|_ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_o_s_i_x___p_a_r_t___f_i_l_e_._c_p_p_:_4_2_4_|_i_n_s_t_e_a_d_ _o_f_ _r_e_b_u_i_l_d_i_n_g_ _t_h_e_ _w_h_o_l_e_ _f_i_l_e_ _h_e_a_d_e_r_ _a_n_d_ _f_l_u_s_h_i_n_g_ _i_t_,_ _u_p_d_a_t_e_ _t_h_e_ _s_l_o_t_ _e_n_t_r_i_e_s_ _a_s_ _w_e_ _g_o_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iinnsstteeaadd ooff rreebbuuiillddiinngg tthhee wwhhoollee ffiillee hheeaaddeerr aanndd fflluusshhiinngg iitt,, uuppddaattee tthhee sslloott eennttrriieess aass wwee ggoo ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppoossiixx__ppaarrtt__ffiillee..ccpppp::442244 ****** | │ │ │ │ │ +|add_fence_job(j); | │ │ │ │ │ |} | │ │ │ │ │ -| auto bytes_read = std::fread(buf.get(), 1, std::size_t(block_to_copy), file.file()); | │ │ │ │ │ -| if (int(bytes_read) != block_to_copy) | │ │ │ │ │ -| ec.assign(errno, generic_category()); | │ │ │ │ │ | | │ │ │ │ │ -| if (ec) return; | │ │ │ │ │ +| status_t mmap_disk_io::do_hash(aux::mmap_disk_job* j) | │ │ │ │ │ +| { | │ │ │ │ │ +| // we're not using a cache. This is the simple path | │ │ │ │ │ +| // just read straight from the file | │ │ │ │ │ +| TORRENT_ASSERT(m_magic == 0x1337); | │ │ │ │ │ | | │ │ │ │ │ -| f(file_offset, {buf.get(), block_to_copy}); | │ │ │ │ │ -| } | │ │ │ │ │ -| file_offset += block_to_copy; | │ │ │ │ │ -| piece_offset = 0; | │ │ │ │ │ -| size -= block_to_copy; | │ │ │ │ │ -| } | │ │ │ │ │ +| bool const v1 = bool(j->flags & disk_interface::v1_hash); | │ │ │ │ │ +| bool const v2 = !j->d.h.block_hashes.empty(); | │ │ │ │ │ +| | │ │ │ │ │ +| int const piece_size = v1 ? j->storage->files().piece_size(j->piece) : 0; | │ │ │ │ │ +| int const piece_size2 = v2 ? j->storage->files().piece_size2(j->piece) : 0; | │ │ │ │ │ +| int const blocks_in_piece = v1 ? (piece_size + default_block_size - 1) / default_block_size : 0; | │ │ │ │ │ +| int const blocks_in_piece2 = v2 ? j->storage->files().blocks_in_piece2(j->piece) : 0; | │ │ │ │ │ +| aux::open_mode_t const file_mode = file_mode_for_job(j); | │ │ │ │ │ +| | │ │ │ │ │ +| TORRENT_ASSERT(!v2 || int(j->d.h.block_hashes.size()) >= blocks_in_piece2); | │ │ │ │ │ +| TORRENT_ASSERT(v1 || v2); | │ │ │ │ │ +| | │ │ │ │ │ +| hasher h; | │ │ │ │ │ +| int ret = 0; | │ │ │ │ │ +| int offset = 0; | │ │ │ │ │ +| int const blocks_to_read = std::max(blocks_in_piece, blocks_in_piece2); | │ │ │ │ │ +| time_point const start_time = clock_type::now(); | │ │ │ │ │ +| for (int i = 0; i < blocks_to_read; ++i) | │ │ │ │ │ +| { | │ │ │ │ │ +| bool const v2_block = i < blocks_in_piece2; | │ │ │ │ │ +| | │ │ │ │ │ +|_ _ _ _D_L_O_G_(_"_d_o___h_a_s_h_:_ _r_e_a_d_i_n_g_ _(_p_i_e_c_e_:_ _%_d_ _b_l_o_c_k_:_ _%_d_)_\_n_"_,_ _i_n_t_(_j_-_>_p_i_e_c_e_)_,_ _i_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_m_a_g_n_e_t___u_r_i_._c_p_p_:_4_3_9_ _ _ _ _ _|_w_h_a_t_'_s_ _t_h_e_ _r_i_g_h_t_ _n_u_m_b_e_r_ _h_e_r_e_?_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** wwhhaatt''ss tthhee rriigghhtt nnuummbbeerr hheerree?? ********** | │ │ │ │ │ +|****** ....//ssrrcc//mmaaggnneett__uurrii..ccpppp::443399 ****** | │ │ │ │ │ +|} | │ │ │ │ │ +| else if (string_equal_no_case(name, "so"_sv)) // select-only (files) | │ │ │ │ │ +| { | │ │ │ │ │ +| // accept only digits, '-' and ',' | │ │ │ │ │ +| if (std::any_of(value.begin(), value.end(), [](char c) | │ │ │ │ │ +| { return !is_digit(c) && c != '-' && c != ','; })) | │ │ │ │ │ +| continue; | │ │ │ │ │ +| | │ │ │ │ │ +| // make sure all file priorities are set to 0, except the ones | │ │ │ │ │ +| // we specify in the file_priorities | │ │ │ │ │ +| p.flags |= torrent_flags::default_dont_download; | │ │ │ │ │ +| | │ │ │ │ │ +| do | │ │ │ │ │ +| { | │ │ │ │ │ +| string_view token; | │ │ │ │ │ +| std::tie(token, value) = split_string(value, ','); | │ │ │ │ │ +| | │ │ │ │ │ +| if (token.empty()) continue; | │ │ │ │ │ +| | │ │ │ │ │ +| int idx1, idx2; | │ │ │ │ │ +|constexpr int max_index = 10000; // can't risk out of memory | │ │ │ │ │ +| | │ │ │ │ │ +| auto const divider = token.find_first_of('-'); | │ │ │ │ │ +| if (divider != std::string::npos) // it's a range | │ │ │ │ │ +| { | │ │ │ │ │ +| if (divider == 0) // no start index | │ │ │ │ │ +| continue; | │ │ │ │ │ +| if (divider == token.size() - 1) // no end index | │ │ │ │ │ +| continue; | │ │ │ │ │ +| | │ │ │ │ │ +| idx1 = std::atoi(token.substr(0, divider).to_string().c_str()); | │ │ │ │ │ +| if (idx1 < 0 || idx1 > max_index) // invalid index | │ │ │ │ │ +| continue; | │ │ │ │ │ +| idx2 = std::atoi(token.substr(divider + 1).to_string().c_str()); | │ │ │ │ │ +| if (idx2 < 0 || idx2 > max_index) // invalid index | │ │ │ │ │ +| continue; | │ │ │ │ │ +| | │ │ │ │ │ +| if (idx1 > idx2) // wrong range limits | │ │ │ │ │ +| continue; | │ │ │ │ │ +| } | │ │ │ │ │ +| else // it's an index | │ │ │ │ │ +| { | │ │ │ │ │ +| idx1 = std::atoi(token.to_string().c_str()); | │ │ │ │ │ +| if (idx1 < 0 || idx1 > max_index) // invalid index | │ │ │ │ │ +| continue; | │ │ │ │ │ +| idx2 = idx1; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| if (int(p.file_priorities.size()) <= idx2) | │ │ │ │ │ +|_ _ _ _ _ _ _p_._f_i_l_e___p_r_i_o_r_i_t_i_e_s_._r_e_s_i_z_e_(_s_t_a_t_i_c___c_a_s_t_<_s_t_d_:_:_s_i_z_e___t_>_(_i_d_x_2_)_ _+_ _1_,_ _d_o_n_t___d_o_w_n_l_o_a_d_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_e___c_r_y_p_t_o_._c_p_p_:_6_0_ _ _ _ _ _ _ _|_i_t_ _w_o_u_l_d_ _b_e_ _n_i_c_e_ _t_o_ _g_e_t_ _t_h_e_ _l_i_t_e_r_a_l_ _w_o_r_k_i_n_g_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iitt wwoouulldd bbee nniiccee ttoo ggeett tthhee lliitteerraall wwoorrkkiinngg ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppee__ccrryyppttoo..ccpppp::6600 ****** | │ │ │ │ │ +|#include | │ │ │ │ │ +|#include | │ │ │ │ │ +| | │ │ │ │ │ +|#include "libtorrent/aux_/disable_warnings_push.hpp" | │ │ │ │ │ +| | │ │ │ │ │ +|#include | │ │ │ │ │ +|#include | │ │ │ │ │ +| | │ │ │ │ │ +|#include "libtorrent/aux_/disable_warnings_pop.hpp" | │ │ │ │ │ +| | │ │ │ │ │ +|#include "libtorrent/random.hpp" | │ │ │ │ │ +|#include "libtorrent/aux_/alloca.hpp" | │ │ │ │ │ +|#include "libtorrent/pe_crypto.hpp" | │ │ │ │ │ +|#include "libtorrent/hasher.hpp" | │ │ │ │ │ +| | │ │ │ │ │ +|namespace libtorrent { | │ │ │ │ │ +| | │ │ │ │ │ +| namespace mp = boost::multiprecision; | │ │ │ │ │ +| | │ │ │ │ │ +| namespace { | │ │ │ │ │ +|key_t const dh_prime | │ │ │ │ │ +|("0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A63|36210000000000090563"); │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| void posix_part_file::flush_metadata(error_code& ec) | │ │ │ │ │ +| std::array export_key(key_t const& k) | │ │ │ │ │ | { | │ │ │ │ │ -| flush_metadata_impl(ec); | │ │ │ │ │ -| } | │ │ │ │ │ +| std::array ret; | │ │ │ │ │ +| auto* begin = reinterpret_cast(ret.data()); | │ │ │ │ │ +|_ _ _s_t_d_:_:_u_i_n_t_8___t_*_ _e_n_d_ _=_ _m_p_:_:_e_x_p_o_r_t___b_i_t_s_(_k_,_ _b_e_g_i_n_,_ _8_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_e___c_r_y_p_t_o_._c_p_p_:_7_1_ _ _ _ _ _ _ _|_i_t_ _w_o_u_l_d_ _b_e_ _n_i_c_e_ _t_o_ _b_e_ _a_b_l_e_ _t_o_ _e_x_p_o_r_t_ _t_o_ _a_ _f_i_x_e_d_ _w_i_d_t_h_ _f_i_e_l_d_,_ _s_o_ _w_e_ _w_o_u_l_d_n_'_t_ _h_a_v_e_ _t_o_ _s_h_i_f_t_ _i_t_ _l_a_t_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iitt wwoouulldd bbee nniiccee ttoo bbee aabbllee ttoo eexxppoorrtt ttoo aa ffiixxeedd wwiiddtthh ffiieelldd,, ssoo wwee wwoouullddnn''tt hhaavvee ttoo sshhiifftt iitt llaatteerr ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppee__ccrryyppttoo..ccpppp::7711 ****** | │ │ │ │ │ +|#include "libtorrent/random.hpp" | │ │ │ │ │ +|#include "libtorrent/aux_/alloca.hpp" | │ │ │ │ │ +|#include "libtorrent/pe_crypto.hpp" | │ │ │ │ │ +|#include "libtorrent/hasher.hpp" | │ │ │ │ │ | | │ │ │ │ │ -|void posix_part_file::flush_metadata_impl(error_code& ec) | │ │ │ │ │ -|{ | │ │ │ │ │ -| // do we need to flush the metadata? | │ │ │ │ │ -| if (m_dirty_metadata == false) return; | │ │ │ │ │ +|namespace libtorrent { | │ │ │ │ │ | | │ │ │ │ │ -| if (m_piece_map.empty()) | │ │ │ │ │ -| { | │ │ │ │ │ -| // if we don't have any pieces left in the | │ │ │ │ │ -| // part file, remove it | │ │ │ │ │ -| std::string const p = combine_path(m_path, m_name); | │ │ │ │ │ -| remove(p, ec); | │ │ │ │ │ +| namespace mp = boost::multiprecision; | │ │ │ │ │ | | │ │ │ │ │ -| if (ec == boost::system::errc::no_such_file_or_directory) | │ │ │ │ │ -| ec.clear(); | │ │ │ │ │ -| return; | │ │ │ │ │ -| } | │ │ │ │ │ +| namespace { | │ │ │ │ │ +| key_t const dh_prime | │ │ │ │ │ +| | │ │ │ │ │ +|("0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A63|36210000000000090563"); │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| auto f = open_file(open_mode::read_write, ec); | │ │ │ │ │ -| if (ec) return; | │ │ │ │ │ +| std::array export_key(key_t const& k) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::array ret; | │ │ │ │ │ +| auto* begin = reinterpret_cast(ret.data()); | │ │ │ │ │ +| std::uint8_t* end = mp::export_bits(k, begin, 8); | │ │ │ │ │ | | │ │ │ │ │ -| std::vector header(static_cast(m_header_size)); | │ │ │ │ │ +|if (end < begin + 96) | │ │ │ │ │ +|{ | │ │ │ │ │ +| int const len = int(end - begin); | │ │ │ │ │ +|#if defined __GNUC__ && __GNUC__ == 12 | │ │ │ │ │ +|#pragma GCC diagnostic push | │ │ │ │ │ +|#pragma GCC diagnostic ignored "-Wstringop-overflow" | │ │ │ │ │ +|#endif | │ │ │ │ │ +| std::memmove(begin + 96 - len, begin, aux::numeric_cast(len)); | │ │ │ │ │ +|#if defined __GNUC__ && __GNUC__ == 12 | │ │ │ │ │ +|#pragma GCC diagnostic pop | │ │ │ │ │ +|#endif | │ │ │ │ │ +| std::memset(begin, 0, aux::numeric_cast(96 - len)); | │ │ │ │ │ +| } | │ │ │ │ │ +| return ret; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| using namespace libtorrent::aux; | │ │ │ │ │ +| void rc4_init(const unsigned char* in, std::size_t len, rc4 *state); | │ │ │ │ │ +| std::size_t rc4_encrypt(unsigned char *out, std::size_t outlen, rc4 *state); | │ │ │ │ │ | | │ │ │ │ │ -| char* ptr = header.data(); | │ │ │ │ │ -| write_uint32(m_max_pieces, ptr); | │ │ │ │ │ -| write_uint32(m_piece_size, ptr); | │ │ │ │ │ +| // Set the prime P and the generator, generate local public key | │ │ │ │ │ +| dh_key_exchange::dh_key_exchange() | │ │ │ │ │ +| { | │ │ │ │ │ +| aux::array random_key; | │ │ │ │ │ +| aux::random_bytes({reinterpret_cast(random_key.data()) | │ │ │ │ │ +| , static_cast(random_key.size())}); | │ │ │ │ │ | | │ │ │ │ │ -| for (piece_index_t piece(0); piece < piece_index_t(m_max_pieces); ++piece) | │ │ │ │ │ -| { | │ │ │ │ │ -|_ _ _ _a_u_t_o_ _c_o_n_s_t_ _i_ _=_ _m___p_i_e_c_e___m_a_p_._f_i_n_d_(_p_i_e_c_e_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_u_d_p___s_o_c_k_e_t_._c_p_p_:_6_5_9_ _ _ _ _ _|_p_e_r_h_a_p_s_ _a_n_ _a_t_t_e_m_p_t_ _s_h_o_u_l_d_ _b_e_ _m_a_d_e_ _t_o_ _b_i_n_d_ _m___s_o_c_k_s_5___s_o_c_k_ _t_o_ _t_h_e_ _d_e_v_i_c_e_ _o_f_ _m___l_i_s_t_e_n___s_o_c_k_e_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ppeerrhhaappss aann aatttteemmpptt sshhoouulldd bbee mmaaddee ttoo bbiinndd mm__ssoocckkss55__ssoocckk ttoo tthhee ddeevviiccee ooff mm__lliisstteenn__ssoocckkeett ********** | │ │ │ │ │ -|****** ....//ssrrcc//uuddpp__ssoocckkeett..ccpppp::665599 ****** | │ │ │ │ │ -|if (ec) | │ │ │ │ │ +| // create local key (random) | │ │ │ │ │ +| mp::import_bits(m_dh_local_secret, random_key.begin(), random_key.end()); | │ │ │ │ │ +| | │ │ │ │ │ +| // key = (2 ^ secret) % prime | │ │ │ │ │ +|_ _ _m___d_h___l_o_c_a_l___k_e_y_ _=_ _m_p_:_:_p_o_w_m_(_k_e_y___t_(_2_)_,_ _m___d_h___l_o_c_a_l___s_e_c_r_e_t_,_ _d_h___p_r_i_m_e_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_c_p_u_i_d_._c_p_p_:_1_3_1_ _ _ _ _ _ _ _ _ _ _|_e_n_a_b_l_e_ _w_h_e_n_ _a_a_r_c_h_6_4_ _i_s_ _r_e_a_l_l_y_ _t_e_s_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** eennaabbllee wwhheenn aaaarrcchh6644 iiss rreeaallllyy tteesstteedd ********** | │ │ │ │ │ +|****** ....//ssrrcc//ccppuuiidd..ccpppp::113311 ****** | │ │ │ │ │ +|bool supports_mmx() noexcept | │ │ │ │ │ | { | │ │ │ │ │ -| if (m_alerts.should_post()) | │ │ │ │ │ -| m_alerts.emplace_alert(m_proxy_addr, operation_t::sock_option, ec); | │ │ │ │ │ -| ec.clear(); | │ │ │ │ │ +|#if TORRENT_HAS_SSE | │ │ │ │ │ +| std::uint32_t cpui[4] = {0}; | │ │ │ │ │ +| cpuid(cpui, 1); | │ │ │ │ │ +| return (cpui[2] & (1 << 23)) != 0; | │ │ │ │ │ +|#else | │ │ │ │ │ +| return false; | │ │ │ │ │ +|#endif | │ │ │ │ │ | } | │ │ │ │ │ +| | │ │ │ │ │ +| bool supports_arm_neon() noexcept | │ │ │ │ │ +| { | │ │ │ │ │ +|#if TORRENT_HAS_ARM_NEON && TORRENT_HAS_AUXV | │ │ │ │ │ +|#if defined __arm__ | │ │ │ │ │ +| //return (getauxval(AT_HWCAP) & HWCAP_NEON); | │ │ │ │ │ +| return (helper_getauxval(16) & (1 << 12)); | │ │ │ │ │ +|#elif defined __aarch64__ | │ │ │ │ │ +| //return (getauxval(AT_HWCAP) & HWCAP_ASIMD); | │ │ │ │ │ +| //return (getauxval(16) & (1 << 1)); | │ │ │ │ │ +|return false; | │ │ │ │ │ |#endif | │ │ │ │ │ +|#else | │ │ │ │ │ +| return false; | │ │ │ │ │ |#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| tcp::endpoint const bind_ep(m_listen_socket.get_local_endpoint().address(), 0); | │ │ │ │ │ -| m_socks5_sock.bind(bind_ep, ec); | │ │ │ │ │ -| if (ec) | │ │ │ │ │ +| bool supports_arm_crc32c() noexcept | │ │ │ │ │ | { | │ │ │ │ │ -| if (m_alerts.should_post()) | │ │ │ │ │ -| m_alerts.emplace_alert(m_proxy_addr, operation_t::sock_bind, ec); | │ │ │ │ │ -| ++m_failures; | │ │ │ │ │ -| retry_connection(); | │ │ │ │ │ -| return; | │ │ │ │ │ +|#if TORRENT_HAS_ARM_CRC32 && TORRENT_HAS_AUXV | │ │ │ │ │ +|#if defined TORRENT_FORCE_ARM_CRC32 | │ │ │ │ │ +| return true; | │ │ │ │ │ +|#elif defined __arm__ | │ │ │ │ │ +| //return (getauxval(AT_HWCAP2) & HWCAP2_CRC32); | │ │ │ │ │ +| return (helper_getauxval(26) & (1 << 4)); | │ │ │ │ │ +|#elif defined __aarch64__ | │ │ │ │ │ +| //return (getauxval(AT_HWCAP) & HWCAP_CRC32); | │ │ │ │ │ +| return (helper_getauxval(16) & (1 << 7)); | │ │ │ │ │ +|#endif | │ │ │ │ │ +|#else | │ │ │ │ │ +| return false; | │ │ │ │ │ +|#endif | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ +|} // anonymous namespace | │ │ │ │ │ | | │ │ │ │ │ -|ADD_OUTSTANDING_ASYNC("socks5::on_connected"); | │ │ │ │ │ -| m_socks5_sock.async_connect(m_proxy_addr | │ │ │ │ │ -| , std::bind(&socks5::on_connected, self(), _1)); | │ │ │ │ │ +| bool const sse42_support = supports_sse42(); | │ │ │ │ │ +| bool const mmx_support = supports_mmx(); | │ │ │ │ │ +| bool const arm_neon_support = supports_arm_neon(); | │ │ │ │ │ +| bool const arm_crc32c_support = supports_arm_crc32c(); | │ │ │ │ │ +|_}_ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_c_r_e_a_t_e___t_o_r_r_e_n_t_._c_p_p_:_6_1_8_ _|_t_h_i_s_ _c_a_n_ _b_e_ _o_p_t_i_m_i_z_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss ccaann bbee ooppttiimmiizzeedd ********** | │ │ │ │ │ +|****** ....//ssrrcc//ccrreeaattee__ttoorrrreenntt..ccpppp::661188 ****** | │ │ │ │ │ +|std::string& attr = e["attr"].string(); | │ │ │ │ │ +| if (flags & file_storage::flag_pad_file) attr += 'p'; | │ │ │ │ │ +| if (flags & file_storage::flag_hidden) attr += 'h'; | │ │ │ │ │ +| if (flags & file_storage::flag_executable) attr += 'x'; | │ │ │ │ │ +| if (include_symlinks && (flags & file_storage::flag_symlink)) attr += 'l'; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| ADD_OUTSTANDING_ASYNC("socks5::on_connect_timeout"); | │ │ │ │ │ -| m_timer.expires_after(seconds(10)); | │ │ │ │ │ -| m_timer.async_wait(std::bind(&socks5::on_connect_timeout | │ │ │ │ │ -| , self(), _1)); | │ │ │ │ │ +| void add_symlink_path(entry& e, std::string symlink_path) | │ │ │ │ │ +| { | │ │ │ │ │ +| entry& sympath_e = e["symlink path"]; | │ │ │ │ │ +| | │ │ │ │ │ +| std::string const link = lexically_relative("", symlink_path); | │ │ │ │ │ +| for (auto elems = lsplit_path(link); !elems.first.empty(); | │ │ │ │ │ +| elems = lsplit_path(elems.second)) | │ │ │ │ │ +| sympath_e.list().emplace_back(elems.first); | │ │ │ │ │ +| } | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ -|void socks5::on_connect_timeout(error_code const& e) | │ │ │ │ │ -|{ | │ │ │ │ │ -| COMPLETE_ASYNC("socks5::on_connect_timeout"); | │ │ │ │ │ +| std::vector create_torrent::generate_buf() const | │ │ │ │ │ +| { | │ │ │ │ │ +|std::vector ret; | │ │ │ │ │ +|bencode(std::back_inserter(ret), generate()); | │ │ │ │ │ +| return ret; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| if (e == boost::asio::error::operation_aborted) return; | │ │ │ │ │ +| entry create_torrent::generate() const | │ │ │ │ │ +| { | │ │ │ │ │ +| if (m_files.num_files() == 0 || m_files.total_size() == 0) | │ │ │ │ │ +| aux::throw_ex(errors::torrent_missing_file_tree); | │ │ │ │ │ | | │ │ │ │ │ -| if (m_abort) return; | │ │ │ │ │ +| // if all v2 hashes are set correctly, generate the v2 parts of the | │ │ │ │ │ +| // torrent | │ │ │ │ │ +| bool const make_v2 = validate_v2_hashes(m_files, m_file_piece_hash); | │ │ │ │ │ +| bool const make_v1 = validate_v1_hashes(m_files, m_piece_hash); | │ │ │ │ │ | | │ │ │ │ │ -| if (m_alerts.should_post()) | │ │ │ │ │ -| m_alerts.emplace_alert(m_proxy_addr, operation_t::connect, errors::timed_out); | │ │ │ │ │ +| // if neither v1 nor v2 hashes were set, we can't create a torrent | │ │ │ │ │ +| if (!make_v1 && !make_v2) | │ │ │ │ │ +| aux::throw_ex(errors::invalid_hash_entry); | │ │ │ │ │ | | │ │ │ │ │ -| error_code ignore; | │ │ │ │ │ -| m_socks5_sock.close(ignore); | │ │ │ │ │ +| TORRENT_ASSERT(m_files.piece_length() > 0); | │ │ │ │ │ | | │ │ │ │ │ -| ++m_failures; | │ │ │ │ │ -| retry_connection(); | │ │ │ │ │ -|} | │ │ │ │ │ +| entry dict; | │ │ │ │ │ | | │ │ │ │ │ -|void socks5::on_connected(error_code const& e) | │ │ │ │ │ -|_{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| if (!m_urls.empty()) dict["announce"] = m_urls.front().first; | │ │ │ │ │ +| | │ │ │ │ │ +| if (!m_nodes.empty()) | │ │ │ │ │ +| { | │ │ │ │ │ +| entry& nodes = dict["nodes"]; | │ │ │ │ │ +| entry::list_type& nodes_list = nodes.list(); | │ │ │ │ │ +| for (auto const& n : m_nodes) | │ │ │ │ │ +|_ _ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_e_n_u_m___n_e_t_._c_p_p_:_1_4_4_ _ _ _ _ _ _ _|_i_n_ _C_+_+_1_7_,_ _u_s_e_ _____h_a_s___i_n_c_l_u_d_e_ _f_o_r_ _t_h_i_s_._ _O_t_h_e_r_ _o_p_e_r_a_t_i_n_g_ _s_y_s_t_e_m_s_ _a_r_e_ _l_i_k_e_l_y_ _t_o_ _r_e_q_u_i_r_e_ _t_h_i_s_ _a_s_ _w_e_l_l_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** iinn CC++++1177,, uussee ____hhaass__iinncclluuddee ffoorr tthhiiss.. OOtthheerr ooppeerraattiinngg ssyysstteemmss aarree lliikkeellyy ttoo rreeqquuiirree tthhiiss aass wweellll ********** | │ │ │ │ │ |****** ....//ssrrcc//eennuumm__nneett..ccpppp::114444 ****** | │ │ │ │ │ |#include | │ │ │ │ │ |#include | │ │ │ │ │ |#include | │ │ │ │ │ |#include | │ │ │ │ │ @@ -6418,176 +7090,14 @@ │ │ │ │ │ | return -1; | │ │ │ │ │ | | │ │ │ │ │ | // get the socket's port ID so that we can verify it in the response | │ │ │ │ │ | sockaddr_nl sock_addr; | │ │ │ │ │ | socklen_t sock_addr_len = sizeof(sock_addr); | │ │ │ │ │ | if (::getsockname(sock, reinterpret_cast(&sock_addr), &sock_addr_len) < 0) | │ │ │ │ │ |_ _ _ _r_e_t_u_r_n_ _-_1_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_u_t___m_e_t_a_d_a_t_a_._c_p_p_:_2_8_1_ _ _ _ _|_w_e_ _r_e_a_l_l_y_ _n_e_e_d_ _t_o_ _i_n_c_r_e_m_e_n_t_ _t_h_e_ _r_e_f_c_o_u_n_t_e_r_ _o_n_ _t_h_e_ _t_o_r_r_e_n_t_ _w_h_i_l_e_ _t_h_i_s_ _b_u_f_f_e_r_ _i_s_ _s_t_i_l_l_ _i_n_ _t_h_e_ _p_e_e_r_'_s_ _s_e_n_d_ _b_u_f_f_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** wwee rreeaallllyy nneeeedd ttoo iinnccrreemmeenntt tthhee rreeffccoouunntteerr oonn tthhee ttoorrrreenntt wwhhiillee tthhiiss bbuuffffeerr iiss ssttiillll iinn tthhee ppeeeerr''ss sseenndd bbuuffffeerr ********** | │ │ │ │ │ -|****** ....//ssrrcc//uutt__mmeettaaddaattaa..ccpppp::228811 ****** | │ │ │ │ │ -|int const offset = piece * 16 * 1024; | │ │ │ │ │ -| metadata = m_tp.metadata().data() + offset; | │ │ │ │ │ -| metadata_piece_size = std::min( | │ │ │ │ │ -| int(m_tp.metadata().size()) - offset, 16 * 1024); | │ │ │ │ │ -| TORRENT_ASSERT(metadata_piece_size > 0); | │ │ │ │ │ -| TORRENT_ASSERT(offset >= 0); | │ │ │ │ │ -| TORRENT_ASSERT(offset + metadata_piece_size <= m_tp.metadata().size()); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| char msg[200]; | │ │ │ │ │ -| char* header = msg; | │ │ │ │ │ -| char* p = &msg[6]; | │ │ │ │ │ -| int const len = bencode(p, e); | │ │ │ │ │ -| int const total_size = 2 + len + metadata_piece_size; | │ │ │ │ │ -| namespace io = aux; | │ │ │ │ │ -| io::write_uint32(total_size, header); | │ │ │ │ │ -| io::write_uint8(bt_peer_connection::msg_extended, header); | │ │ │ │ │ -| io::write_uint8(m_message_index, header); | │ │ │ │ │ -| | │ │ │ │ │ -| m_pc.send_buffer({msg, len + 6}); | │ │ │ │ │ -|if (metadata_piece_size) | │ │ │ │ │ -|{ | │ │ │ │ │ -| m_pc.append_const_send_buffer( | │ │ │ │ │ -| span(const_cast(metadata), metadata_piece_size), metadata_piece_size); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| m_pc.stats_counters().inc_stats_counter(counters::num_outgoing_extended); | │ │ │ │ │ -| m_pc.stats_counters().inc_stats_counter(counters::num_outgoing_metadata); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| bool on_extended(int const length | │ │ │ │ │ -| , int const extended_msg, span body) override | │ │ │ │ │ -| { | │ │ │ │ │ -| if (extended_msg != 2) return false; | │ │ │ │ │ -| if (m_message_index == 0) return false; | │ │ │ │ │ -| | │ │ │ │ │ -| if (length > 17 * 1024) | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| m_pc.peer_log(peer_log_alert::incoming_message, "UT_METADATA" | │ │ │ │ │ -| , "packet too big %d", length); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| m_pc.disconnect(errors::invalid_metadata_message, operation_t::bittorrent, peer_connection_interface::peer_error); | │ │ │ │ │ -| return true; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| if (!m_pc.packet_finished()) return true; | │ │ │ │ │ -| | │ │ │ │ │ -| error_code ec; | │ │ │ │ │ -| bdecode_node msg = bdecode(body, ec); | │ │ │ │ │ -|_ _ _ _i_f_ _(_m_s_g_._t_y_p_e_(_)_ _!_=_ _b_d_e_c_o_d_e___n_o_d_e_:_:_d_i_c_t___t_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_i_p___n_o_t_i_f_i_e_r_._c_p_p_:_4_1_ _ _ _ _ _|_s_i_m_u_l_a_t_o_r_ _s_u_p_p_o_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ssiimmuullaattoorr ssuuppppoorrtt ********** | │ │ │ │ │ -|****** ....//ssrrcc//iipp__nnoottiiffiieerr..ccpppp::4411 ****** | │ │ │ │ │ -| from this software without specific prior written permission. | │ │ │ │ │ -| | │ │ │ │ │ -|THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | │ │ │ │ │ -|AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | │ │ │ │ │ -|IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | │ │ │ │ │ -|ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE | │ │ │ │ │ -|LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | │ │ │ │ │ -|CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | │ │ │ │ │ -|SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | │ │ │ │ │ -|INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | │ │ │ │ │ -|CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | │ │ │ │ │ -|ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | │ │ │ │ │ -|POSSIBILITY OF SUCH DAMAGE. | │ │ │ │ │ -| | │ │ │ │ │ -|*/ | │ │ │ │ │ -| | │ │ │ │ │ -|#include "libtorrent/aux_/ip_notifier.hpp" | │ │ │ │ │ -|#include "libtorrent/assert.hpp" | │ │ │ │ │ -| | │ │ │ │ │ -|#if defined TORRENT_BUILD_SIMULATOR | │ │ │ │ │ -|#elif TORRENT_USE_NETLINK | │ │ │ │ │ -|#include "libtorrent/netlink.hpp" | │ │ │ │ │ -|#include "libtorrent/socket.hpp" | │ │ │ │ │ -|#include | │ │ │ │ │ -|#include | │ │ │ │ │ -|#elif TORRENT_USE_SYSTEMCONFIGURATION || TORRENT_USE_SC_NETWORK_REACHABILITY | │ │ │ │ │ -|#include | │ │ │ │ │ -|#elif defined TORRENT_WINDOWS | │ │ │ │ │ -|#include "libtorrent/aux_/throw.hpp" | │ │ │ │ │ -|#include "libtorrent/aux_/disable_warnings_push.hpp" | │ │ │ │ │ -|#include | │ │ │ │ │ -|#ifdef TORRENT_WINRT | │ │ │ │ │ -|#include | │ │ │ │ │ -|#endif | │ │ │ │ │ -|#include | │ │ │ │ │ -|#include "libtorrent/aux_/disable_warnings_pop.hpp" | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -|#include "libtorrent/aux_/netlink_utils.hpp" | │ │ │ │ │ -| | │ │ │ │ │ -|namespace libtorrent { namespace aux { | │ │ │ │ │ -| | │ │ │ │ │ -|namespace { | │ │ │ │ │ -| | │ │ │ │ │ -|#if (TORRENT_USE_SYSTEMCONFIGURATION || TORRENT_USE_SC_NETWORK_REACHABILITY) && \ | │ │ │ │ │ -| !defined TORRENT_BUILD_SIMULATOR | │ │ │ │ │ -| | │ │ │ │ │ -|// common utilities for Mac and iOS | │ │ │ │ │ -|template void CFRefRetain(T h) { CFRetain(h); } | │ │ │ │ │ -|_t_e_m_p_l_a_t_e_ _<_t_y_p_e_n_a_m_e_ _T_>_ _v_o_i_d_ _C_F_R_e_f_R_e_l_e_a_s_e_(_T_ _h_)_ _{_ _C_F_R_e_l_e_a_s_e_(_h_)_;_ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/ |technically, this isn't supposed to happen, but it seems to sometimes. Some of the accounting is probably wrong in certain cases | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_h_t_t_p___s_e_e_d___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_4_4_1_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tteecchhnniiccaallllyy,, tthhiiss iissnn''tt ssuuppppoosseedd ttoo hhaappppeenn,, bbuutt iitt sseeeemmss ttoo ssoommeettiimmeess.. SSoommee ooff tthhee aaccccoouunnttiinngg iiss pprroobbaabbllyy wwrroonngg iinn cceerrttaaiinn ccaasseess ********** | │ │ │ │ │ -|****** ....//ssrrcc//hhttttpp__sseeeedd__ccoonnnneeccttiioonn..ccpppp::444411 ****** | │ │ │ │ │ -|// cut out the chunk header from the receive buffer | │ │ │ │ │ -| TORRENT_ASSERT(m_chunk_pos + m_body_start < INT_MAX); | │ │ │ │ │ -| m_recv_buffer.cut(header_size, t->block_size() + 1024, aux::numeric_cast(m_chunk_pos + m_body_start)); | │ │ │ │ │ -| recv_buffer = m_recv_buffer.get(); | │ │ │ │ │ -| recv_buffer = recv_buffer.subspan(m_body_start); | │ │ │ │ │ -| m_chunk_pos += chunk_size; | │ │ │ │ │ -| if (chunk_size == 0) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(m_recv_buffer.get().size() < m_chunk_pos + m_body_start + 1 | │ │ │ │ │ -| || m_recv_buffer.get()[static_cast(m_chunk_pos + m_body_start)] == 'H' | │ │ │ │ │ -| || (m_parser.chunked_encoding() | │ │ │ │ │ -| && m_recv_buffer.get()[static_cast(m_chunk_pos + m_body_start)] == '\r')); | │ │ │ │ │ -| m_chunk_pos = -1; | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| int payload = int(bytes_transferred); | │ │ │ │ │ -| if (payload > m_response_left) payload = int(m_response_left); | │ │ │ │ │ -| if (payload > front_request.length) payload = front_request.length; | │ │ │ │ │ -|if (payload > outstanding_bytes()) payload = outstanding_bytes(); | │ │ │ │ │ -|received_bytes(payload, 0); | │ │ │ │ │ -| incoming_piece_fragment(payload); | │ │ │ │ │ -| m_response_left -= payload; | │ │ │ │ │ -| | │ │ │ │ │ -| if (m_parser.status_code() == 503) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (!m_parser.finished()) return; | │ │ │ │ │ -| | │ │ │ │ │ -| int retry_time = std::atoi(std::string(recv_buffer.begin(), recv_buffer.end()).c_str()); | │ │ │ │ │ -| if (retry_time <= 0) retry_time = 60; | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| peer_log(peer_log_alert::info, "CONNECT", "retrying in %d seconds", retry_time); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| received_bytes(0, int(bytes_transferred)); | │ │ │ │ │ -| // temporarily unavailable, retry later | │ │ │ │ │ -| t->retry_web_seed(this, seconds32(retry_time)); | │ │ │ │ │ -| disconnect(error_code(m_parser.status_code(), http_category()), operation_t::bittorrent, failure); | │ │ │ │ │ -| return; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| | │ │ │ │ │ -| // we only received the header, no data | │ │ │ │ │ -| if (recv_buffer.empty()) break; | │ │ │ │ │ -| | │ │ │ │ │ -| if (recv_buffer.size() < front_request.length) break; | │ │ │ │ │ -| | │ │ │ │ │ -| // if the response is chunked, we need to receive the last | │ │ │ │ │ -| // terminating chunk and the tail headers before we can proceed | │ │ │ │ │ -|_ _ _ _i_f_ _(_m___p_a_r_s_e_r_._c_h_u_n_k_e_d___e_n_c_o_d_i_n_g_(_)_ _&_&_ _m___c_h_u_n_k___p_o_s_ _>_=_ _0_)_ _b_r_e_a_k_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_s_e_s_s_i_o_n___i_m_p_l_._c_p_p_:_6_1_5_ _ _ _|_c_o_m_e_ _u_p_ _w_i_t_h_ _s_o_m_e_ _a_b_s_t_r_a_c_t_i_o_n_ _t_o_ _d_o_ _t_h_i_s_ _f_o_r_ _g_n_u_t_l_s_ _a_s_ _w_e_l_l_ _l_o_a_d_ _c_e_r_t_i_f_i_c_a_t_e_s_ _f_r_o_m_ _t_h_e_ _w_i_n_d_o_w_s_ _s_y_s_t_e_m_ _c_e_r_t_i_f_i_c_a_t_e_ _s_t_o_r_e_ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** ccoommee uupp wwiitthh ssoommee aabbssttrraaccttiioonn ttoo ddoo tthhiiss ffoorr ggnnuuttllss aass wweellll llooaadd cceerrttiiffiiccaatteess ffrroomm tthhee wwiinnddoowwss ssyysstteemm cceerrttiiffiiccaattee ssttoorree ********** | │ │ │ │ │ |****** ....//ssrrcc//sseessssiioonn__iimmppll..ccpppp::661155 ****** | │ │ │ │ │ |pause(); | │ │ │ │ │ | } | │ │ │ │ │ |#endif | │ │ │ │ │ | | │ │ │ │ │ @@ -7338,49 +7848,154 @@ │ │ │ │ │ | for (wakeup_t const& w : _wakeups) | │ │ │ │ │ | { | │ │ │ │ │ | bool const idle_wakeup = w.context_switches > prev_csw; | │ │ │ │ │ | std::fprintf(f, "%" PRId64 "\t%" PRId64 "\t%" PRId64 "\t%c\t%s\n" | │ │ │ │ │ | , total_microseconds(w.timestamp - m) | │ │ │ │ │ | , total_microseconds(w.timestamp - prev) | │ │ │ │ │ |_ _ _ _ _ _,_ _w_._c_o_n_t_e_x_t___s_w_i_t_c_h_e_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/_p_a_r_t___f_i_l_e_._c_p_p_:_3_0_0 |what do we do if someone is currently reading from the disk from this piece? does it matter? Since we won't actively erase the data | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_f_r_o_m_ _d_i_s_k_,_ _b_u_t_ _i_t_ _m_a_y_ _b_e_ _o_v_e_r_w_r_i_t_t_e_n_ _s_o_o_n_,_ _i_t_'_s_ _p_r_o_b_a_b_l_y_ _n_o_t_ _t_h_a_t_ _b_i_g_ _o_f_ _a_ _d_e_a_l_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** wwhhaatt ddoo wwee ddoo iiff ssoommeeoonnee iiss ccuurrrreennttllyy rreeaaddiinngg ffrroomm tthhee ddiisskk ffrroomm tthhiiss ppiieeccee?? ddooeess iitt mmaatttteerr?? SSiinnccee wwee wwoonn''tt aaccttiivveellyy eerraassee tthhee ddaattaa ffrroomm ddiisskk,, bbuutt iitt mmaayy bbee oovveerrwwrriitttteenn | │ │ │ │ │ -|ssoooonn,, iitt''ss pprroobbaabbllyy nnoott tthhaatt bbiigg ooff aa ddeeaall ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppaarrtt__ffiillee..ccpppp::330000 ****** | │ │ │ │ │ -|create_directories(m_path, ec); | │ │ │ │ │ -| if (ec) return {}; | │ │ │ │ │ -| return aux::file_handle(fn, 0, mode); | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_u_t___m_e_t_a_d_a_t_a_._c_p_p_:_2_8_1_ _ _ _ _|_w_e_ _r_e_a_l_l_y_ _n_e_e_d_ _t_o_ _i_n_c_r_e_m_e_n_t_ _t_h_e_ _r_e_f_c_o_u_n_t_e_r_ _o_n_ _t_h_e_ _t_o_r_r_e_n_t_ _w_h_i_l_e_ _t_h_i_s_ _b_u_f_f_e_r_ _i_s_ _s_t_i_l_l_ _i_n_ _t_h_e_ _p_e_e_r_'_s_ _s_e_n_d_ _b_u_f_f_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** wwee rreeaallllyy nneeeedd ttoo iinnccrreemmeenntt tthhee rreeffccoouunntteerr oonn tthhee ttoorrrreenntt wwhhiillee tthhiiss bbuuffffeerr iiss ssttiillll iinn tthhee ppeeeerr''ss sseenndd bbuuffffeerr ********** | │ │ │ │ │ +|****** ....//ssrrcc//uutt__mmeettaaddaattaa..ccpppp::228811 ****** | │ │ │ │ │ +|int const offset = piece * 16 * 1024; | │ │ │ │ │ +| metadata = m_tp.metadata().data() + offset; | │ │ │ │ │ +| metadata_piece_size = std::min( | │ │ │ │ │ +| int(m_tp.metadata().size()) - offset, 16 * 1024); | │ │ │ │ │ +| TORRENT_ASSERT(metadata_piece_size > 0); | │ │ │ │ │ +| TORRENT_ASSERT(offset >= 0); | │ │ │ │ │ +| TORRENT_ASSERT(offset + metadata_piece_size <= m_tp.metadata().size()); | │ │ │ │ │ | } | │ │ │ │ │ -| return {}; | │ │ │ │ │ +| | │ │ │ │ │ +| char msg[200]; | │ │ │ │ │ +| char* header = msg; | │ │ │ │ │ +| char* p = &msg[6]; | │ │ │ │ │ +| int const len = bencode(p, e); | │ │ │ │ │ +| int const total_size = 2 + len + metadata_piece_size; | │ │ │ │ │ +| namespace io = aux; | │ │ │ │ │ +| io::write_uint32(total_size, header); | │ │ │ │ │ +| io::write_uint8(bt_peer_connection::msg_extended, header); | │ │ │ │ │ +| io::write_uint8(m_message_index, header); | │ │ │ │ │ +| | │ │ │ │ │ +| m_pc.send_buffer({msg, len + 6}); | │ │ │ │ │ +|if (metadata_piece_size) | │ │ │ │ │ +|{ | │ │ │ │ │ +| m_pc.append_const_send_buffer( | │ │ │ │ │ +| span(const_cast(metadata), metadata_piece_size), metadata_piece_size); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| m_pc.stats_counters().inc_stats_counter(counters::num_outgoing_extended); | │ │ │ │ │ +| m_pc.stats_counters().inc_stats_counter(counters::num_outgoing_metadata); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| bool on_extended(int const length | │ │ │ │ │ +| , int const extended_msg, span body) override | │ │ │ │ │ +| { | │ │ │ │ │ +| if (extended_msg != 2) return false; | │ │ │ │ │ +| if (m_message_index == 0) return false; | │ │ │ │ │ +| | │ │ │ │ │ +| if (length > 17 * 1024) | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| m_pc.peer_log(peer_log_alert::incoming_message, "UT_METADATA" | │ │ │ │ │ +| , "packet too big %d", length); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| m_pc.disconnect(errors::invalid_metadata_message, operation_t::bittorrent, peer_connection_interface::peer_error); | │ │ │ │ │ +| return true; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| if (!m_pc.packet_finished()) return true; | │ │ │ │ │ +| | │ │ │ │ │ +| error_code ec; | │ │ │ │ │ +| bdecode_node msg = bdecode(body, ec); | │ │ │ │ │ +|_ _ _ _i_f_ _(_m_s_g_._t_y_p_e_(_)_ _!_=_ _b_d_e_c_o_d_e___n_o_d_e_:_:_d_i_c_t___t_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t___i_n_f_o_._c_p_p_:_8_8_7_ _ _ _|_t_h_i_s_ _s_h_o_u_l_d_ _b_e_ _c_o_n_s_i_d_e_r_e_d_ _a_ _f_a_i_l_u_r_e_,_ _a_n_d_ _t_h_e_ _._t_o_r_r_e_n_t_ _f_i_l_e_ _r_e_j_e_c_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss sshhoouulldd bbee ccoonnssiiddeerreedd aa ffaaiilluurree,, aanndd tthhee ..ttoorrrreenntt ffiillee rreejjeecctteedd ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt__iinnffoo..ccpppp::888877 ****** | │ │ │ │ │ +|std::string ext = extension(filename); | │ │ │ │ │ +| int cnt = 0; | │ │ │ │ │ +| for (;;) | │ │ │ │ │ +| { | │ │ │ │ │ +| ++cnt; | │ │ │ │ │ +| char new_ext[50]; | │ │ │ │ │ +| std::snprintf(new_ext, sizeof(new_ext), ".%d%s", cnt, ext.c_str()); | │ │ │ │ │ +| filename = base + new_ext; | │ │ │ │ │ +| | │ │ │ │ │ +| boost::crc_optimal<32, 0x1EDC6F41, 0xFFFFFFFF, 0xFFFFFFFF, true, true> crc; | │ │ │ │ │ +| process_string_lowercase(crc, filename); | │ │ │ │ │ +| std::uint32_t const new_hash = crc.checksum(); | │ │ │ │ │ +| if (files.find(new_hash) == files.end()) | │ │ │ │ │ +| { | │ │ │ │ │ +| files.insert({new_hash, {i, 0}}); | │ │ │ │ │ +| break; | │ │ │ │ │ +| } | │ │ │ │ │ +| ++num_collisions; | │ │ │ │ │ +| if (num_collisions > 100) | │ │ │ │ │ +| { | │ │ │ │ │ +|} | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +| copy_on_write(); | │ │ │ │ │ +| m_files.rename_file(i, filename); | │ │ │ │ │ | } | │ │ │ │ │ | } | │ │ │ │ │ -| catch (storage_error const& e) | │ │ │ │ │ +| | │ │ │ │ │ +| void torrent_info::remap_files(file_storage const& f) | │ │ │ │ │ | { | │ │ │ │ │ -| ec = e.ec; | │ │ │ │ │ -| return {}; | │ │ │ │ │ +| INVARIANT_CHECK; | │ │ │ │ │ +| | │ │ │ │ │ +| TORRENT_ASSERT(is_loaded()); | │ │ │ │ │ +| // the new specified file storage must have the exact | │ │ │ │ │ +| // same size as the current file storage | │ │ │ │ │ +| TORRENT_ASSERT(m_files.total_size() == f.total_size()); | │ │ │ │ │ +| | │ │ │ │ │ +| if (m_files.total_size() != f.total_size()) return; | │ │ │ │ │ +| copy_on_write(); | │ │ │ │ │ +| m_files = f; | │ │ │ │ │ +| m_files.set_num_pieces(m_orig_files->num_pieces()); | │ │ │ │ │ +| m_files.set_piece_length(m_orig_files->piece_length()); | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| void part_file::free_piece(piece_index_t const piece) | │ │ │ │ │ +|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ +| // standard constructor that parses a torrent file | │ │ │ │ │ +| torrent_info::torrent_info(entry const& torrent_file) | │ │ │ │ │ | { | │ │ │ │ │ -| std::lock_guard l(m_mutex); | │ │ │ │ │ +| std::vector tmp; | │ │ │ │ │ +| std::back_insert_iterator> out(tmp); | │ │ │ │ │ +|_ _ _b_e_n_c_o_d_e_(_o_u_t_,_ _t_o_r_r_e_n_t___f_i_l_e_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/_p_o_s_i_x___p_a_r_t___f_i_l_e_._c_p_p_:_3_3_7|what do we do if someone is currently reading from the disk from this piece? does it matter? Since we won't actively erase the data | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_f_r_o_m_ _d_i_s_k_,_ _b_u_t_ _i_t_ _m_a_y_ _b_e_ _o_v_e_r_w_r_i_t_t_e_n_ _s_o_o_n_,_ _i_t_'_s_ _p_r_o_b_a_b_l_y_ _n_o_t_ _t_h_a_t_ _b_i_g_ _o_f_ _a_ _d_e_a_l_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** wwhhaatt ddoo wwee ddoo iiff ssoommeeoonnee iiss ccuurrrreennttllyy rreeaaddiinngg ffrroomm tthhee ddiisskk ffrroomm tthhiiss ppiieeccee?? ddooeess iitt mmaatttteerr?? SSiinnccee wwee wwoonn''tt aaccttiivveellyy eerraassee tthhee ddaattaa ffrroomm ddiisskk,, bbuutt iitt mmaayy bbee oovveerrwwrriitttteenn | │ │ │ │ │ +|ssoooonn,, iitt''ss pprroobbaabbllyy nnoott tthhaatt bbiigg ooff aa ddeeaall ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppoossiixx__ppaarrtt__ffiillee..ccpppp::333377 ****** | │ │ │ │ │ +| if (ec) return {}; | │ │ │ │ │ | | │ │ │ │ │ +|#ifdef TORRENT_WINDOWS | │ │ │ │ │ +| ret = file_pointer(::_wfopen(convert_to_native_path_string(fn).c_str(), L"wb+")); | │ │ │ │ │ +|#else | │ │ │ │ │ +| ret = file_pointer(::fopen(fn.c_str(), "wb+")); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| if (ret.file() == nullptr) | │ │ │ │ │ +| ec.assign(errno, generic_category()); | │ │ │ │ │ +| } | │ │ │ │ │ +| if (ec) return {}; | │ │ │ │ │ +| return ret; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void posix_part_file::free_piece(piece_index_t const piece) | │ │ │ │ │ +| { | │ │ │ │ │ | auto const i = m_piece_map.find(piece); | │ │ │ │ │ | if (i == m_piece_map.end()) return; | │ │ │ │ │ | | │ │ │ │ │ | | │ │ │ │ │ |m_free_slots.push_back(i->second); | │ │ │ │ │ | m_piece_map.erase(i); | │ │ │ │ │ | m_dirty_metadata = true; | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| void part_file::move_partfile(std::string const& path, error_code& ec) | │ │ │ │ │ +| void posix_part_file::move_partfile(std::string const& path, error_code& ec) | │ │ │ │ │ | { | │ │ │ │ │ -| std::lock_guard l(m_mutex); | │ │ │ │ │ -| | │ │ │ │ │ | flush_metadata_impl(ec); | │ │ │ │ │ | if (ec) return; | │ │ │ │ │ | | │ │ │ │ │ | if (!m_piece_map.empty()) | │ │ │ │ │ | { | │ │ │ │ │ | std::string old_path = combine_path(m_path, m_name); | │ │ │ │ │ | std::string new_path = combine_path(path, m_name); | │ │ │ │ │ @@ -7393,39 +8008,41 @@ │ │ │ │ │ | { | │ │ │ │ │ | storage_error se; | │ │ │ │ │ | aux::copy_file(old_path, new_path, se); | │ │ │ │ │ | ec = se.ec; | │ │ │ │ │ | if (ec) return; | │ │ │ │ │ | remove(old_path, ec); | │ │ │ │ │ | } | │ │ │ │ │ -|_ _ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_a_r_t___f_i_l_e_._c_p_p_:_4_1_1_ _ _ _ _ _ _|_i_n_s_t_e_a_d_ _o_f_ _r_e_b_u_i_l_d_i_n_g_ _t_h_e_ _w_h_o_l_e_ _f_i_l_e_ _h_e_a_d_e_r_ _a_n_d_ _f_l_u_s_h_i_n_g_ _i_t_,_ _u_p_d_a_t_e_ _t_h_e_ _s_l_o_t_ _e_n_t_r_i_e_s_ _a_s_ _w_e_ _g_o_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| } | │ │ │ │ │ +| m_path = path; | │ │ │ │ │ +|_ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_o_s_i_x___p_a_r_t___f_i_l_e_._c_p_p_:_4_2_4_|_i_n_s_t_e_a_d_ _o_f_ _r_e_b_u_i_l_d_i_n_g_ _t_h_e_ _w_h_o_l_e_ _f_i_l_e_ _h_e_a_d_e_r_ _a_n_d_ _f_l_u_s_h_i_n_g_ _i_t_,_ _u_p_d_a_t_e_ _t_h_e_ _s_l_o_t_ _e_n_t_r_i_e_s_ _a_s_ _w_e_ _g_o_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** iinnsstteeaadd ooff rreebbuuiillddiinngg tthhee wwhhoollee ffiillee hheeaaddeerr aanndd fflluusshhiinngg iitt,, uuppddaattee tthhee sslloott eennttrriieess aass wwee ggoo ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppaarrtt__ffiillee..ccpppp::441111 ****** | │ │ │ │ │ -|TORRENT_ASSERT(j->second == slot); | │ │ │ │ │ -| m_free_slots.push_back(j->second); | │ │ │ │ │ -| m_piece_map.erase(j); | │ │ │ │ │ -| m_dirty_metadata = true; | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ +|****** ....//ssrrcc//ppoossiixx__ppaarrtt__ffiillee..ccpppp::442244 ****** | │ │ │ │ │ +|} | │ │ │ │ │ +| auto bytes_read = std::fread(buf.get(), 1, std::size_t(block_to_copy), file.file()); | │ │ │ │ │ +| if (int(bytes_read) != block_to_copy) | │ │ │ │ │ +| ec.assign(errno, generic_category()); | │ │ │ │ │ +| | │ │ │ │ │ +| if (ec) return; | │ │ │ │ │ +| | │ │ │ │ │ +| f(file_offset, {buf.get(), block_to_copy}); | │ │ │ │ │ | } | │ │ │ │ │ | file_offset += block_to_copy; | │ │ │ │ │ | piece_offset = 0; | │ │ │ │ │ | size -= block_to_copy; | │ │ │ │ │ | } | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| void part_file::flush_metadata(error_code& ec) | │ │ │ │ │ +| void posix_part_file::flush_metadata(error_code& ec) | │ │ │ │ │ | { | │ │ │ │ │ -| std::lock_guard l(m_mutex); | │ │ │ │ │ -| | │ │ │ │ │ | flush_metadata_impl(ec); | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -|void part_file::flush_metadata_impl(error_code& ec) | │ │ │ │ │ +|void posix_part_file::flush_metadata_impl(error_code& ec) | │ │ │ │ │ |{ | │ │ │ │ │ | // do we need to flush the metadata? | │ │ │ │ │ | if (m_dirty_metadata == false) return; | │ │ │ │ │ | | │ │ │ │ │ | if (m_piece_map.empty()) | │ │ │ │ │ | { | │ │ │ │ │ | // if we don't have any pieces left in the | │ │ │ │ │ @@ -7434,28 +8051,82 @@ │ │ │ │ │ | remove(p, ec); | │ │ │ │ │ | | │ │ │ │ │ | if (ec == boost::system::errc::no_such_file_or_directory) | │ │ │ │ │ | ec.clear(); | │ │ │ │ │ | return; | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| auto f = open_file(aux::open_mode::write | aux::open_mode::hidden, ec); | │ │ │ │ │ +| auto f = open_file(open_mode::read_write, ec); | │ │ │ │ │ | if (ec) return; | │ │ │ │ │ | | │ │ │ │ │ | std::vector header(static_cast(m_header_size)); | │ │ │ │ │ | | │ │ │ │ │ | using namespace libtorrent::aux; | │ │ │ │ │ | | │ │ │ │ │ | char* ptr = header.data(); | │ │ │ │ │ | write_uint32(m_max_pieces, ptr); | │ │ │ │ │ | write_uint32(m_piece_size, ptr); | │ │ │ │ │ | | │ │ │ │ │ | for (piece_index_t piece(0); piece < piece_index_t(m_max_pieces); ++piece) | │ │ │ │ │ | { | │ │ │ │ │ |_ _ _ _a_u_t_o_ _c_o_n_s_t_ _i_ _=_ _m___p_i_e_c_e___m_a_p_._f_i_n_d_(_p_i_e_c_e_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_c_h_o_k_e_r_._c_p_p_:_2_5_8_ _ _ _ _ _ _ _ _ _|_m_a_k_e_ _c_o_n_f_i_g_u_r_a_b_l_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** mmaakkee ccoonnffiigguurraabbllee ********** | │ │ │ │ │ +|****** ....//ssrrcc//cchhookkeerr..ccpppp::225588 ****** | │ │ │ │ │ +|// first reset the number of unchoke slots, because we'll calculate | │ │ │ │ │ +| // it purely based on the current state of our peers. | │ │ │ │ │ +| upload_slots = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| int rate_threshold = sett.get_int(settings_pack::rate_choker_initial_threshold); | │ │ │ │ │ +| | │ │ │ │ │ +| std::sort(peers.begin(), peers.end() | │ │ │ │ │ +| , [](peer_connection const* lhs, peer_connection const* rhs) | │ │ │ │ │ +| { return upload_rate_compare(lhs, rhs); }); | │ │ │ │ │ +| | │ │ │ │ │ +| for (auto const* p : peers) | │ │ │ │ │ +| { | │ │ │ │ │ +| int const rate = int(p->uploaded_in_last_round() | │ │ │ │ │ +| * 1000 / total_milliseconds(unchoke_interval)); | │ │ │ │ │ +| | │ │ │ │ │ +| // always have at least 1 unchoke slot | │ │ │ │ │ +| if (rate < rate_threshold) break; | │ │ │ │ │ +| | │ │ │ │ │ +| ++upload_slots; | │ │ │ │ │ +| | │ │ │ │ │ +|rate_threshold += 2048; | │ │ │ │ │ +|} | │ │ │ │ │ +| ++upload_slots; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| // sorts the peers that are eligible for unchoke by download rate and | │ │ │ │ │ +| // secondary by total upload. The reason for this is, if all torrents are | │ │ │ │ │ +| // being seeded, the download rate will be 0, and the peers we have sent | │ │ │ │ │ +| // the least to should be unchoked | │ │ │ │ │ +| | │ │ │ │ │ +| // we use partial sort here, because we only care about the top | │ │ │ │ │ +| // upload_slots peers. | │ │ │ │ │ +| | │ │ │ │ │ +| int const slots = std::min(upload_slots, int(peers.size())); | │ │ │ │ │ +| | │ │ │ │ │ +| if (sett.get_int(settings_pack::seed_choking_algorithm) | │ │ │ │ │ +| == settings_pack::round_robin) | │ │ │ │ │ +| { | │ │ │ │ │ +| int const pieces = sett.get_int(settings_pack::seeding_piece_quota); | │ │ │ │ │ +| | │ │ │ │ │ +| std::nth_element(peers.begin(), peers.begin() | │ │ │ │ │ +| + slots, peers.end() | │ │ │ │ │ +| , [pieces](peer_connection const* lhs, peer_connection const* rhs) | │ │ │ │ │ +| { return unchoke_compare_rr(lhs, rhs, pieces); }); | │ │ │ │ │ +| } | │ │ │ │ │ +| else if (sett.get_int(settings_pack::seed_choking_algorithm) | │ │ │ │ │ +| == settings_pack::fastest_upload) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::nth_element(peers.begin(), peers.begin() | │ │ │ │ │ +| + slots, peers.end() | │ │ │ │ │ +|_ _ _ _ _,_ _[_]_(_p_e_e_r___c_o_n_n_e_c_t_i_o_n_ _c_o_n_s_t_*_ _l_h_s_,_ _p_e_e_r___c_o_n_n_e_c_t_i_o_n_ _c_o_n_s_t_*_ _r_h_s_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_u_t_p___s_t_r_e_a_m_._c_p_p_:_1_4_6_7_ _ _ _ _|_t_h_i_s_ _l_o_o_p_ _i_s_ _n_o_t_ _v_e_r_y_ _e_f_f_i_c_i_e_n_t_._ _I_t_ _c_o_u_l_d_ _b_e_ _f_i_x_e_d_ _b_y_ _h_a_v_i_n_g_ _a_ _s_e_p_a_r_a_t_e_ _l_i_s_t_ _o_f_ _s_e_q_u_e_n_c_e_ _n_u_m_b_e_r_s_ _t_h_a_t_ _n_e_e_d_ _r_e_s_e_n_d_i_n_g_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** tthhiiss lloooopp iiss nnoott vveerryy eeffffiicciieenntt.. IItt ccoouulldd bbee ffiixxeedd bbyy hhaavviinngg aa sseeppaarraattee lliisstt ooff sseeqquueennccee nnuummbbeerrss tthhaatt nneeeedd rreesseennddiinngg ********** | │ │ │ │ │ |****** ....//ssrrcc//uuttpp__ssttrreeaamm..ccpppp::11446677 ****** | │ │ │ │ │ |#endif | │ │ │ │ │ | | │ │ │ │ │ | if (m_stalled) | │ │ │ │ │ | { | │ │ │ │ │ @@ -7502,814 +8173,14 @@ │ │ │ │ │ | | │ │ │ │ │ | // under these conditions, the next packet we send should be an MTU probe. | │ │ │ │ │ | // MTU probes get to use the mid-point packet size, whereas other packets | │ │ │ │ │ | // use a conservative packet size of the largest known to work. The reason | │ │ │ │ │ | // for the cwnd condition is to make sure the probe is surrounded by non- | │ │ │ │ │ | // probes, to be able to distinguish a loss of the probe vs. just loss in | │ │ │ │ │ |_ _/_/_ _g_e_n_e_r_a_l_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t___h_a_n_d_l_e_._c_p_p_:_5_8_9_ _|_s_u_p_p_o_r_t_ _m_o_v_i_n_g_ _f_i_l_e_s_ _i_n_t_o_ _t_h_i_s_ _c_a_l_l_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ssuuppppoorrtt mmoovviinngg ffiilleess iinnttoo tthhiiss ccaallll ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt__hhaannddllee..ccpppp::558899 ****** | │ │ │ │ │ -|auto retp = &prio; | │ │ │ │ │ -| sync_call(&torrent::piece_priorities, retp); | │ │ │ │ │ -| std::vector ret; | │ │ │ │ │ -| ret.reserve(prio.size()); | │ │ │ │ │ -| for (auto p : prio) | │ │ │ │ │ -| ret.push_back(int(static_cast(p))); | │ │ │ │ │ -| return ret; | │ │ │ │ │ -| } | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| void torrent_handle::file_priority(file_index_t index, download_priority_t priority) const | │ │ │ │ │ -| { | │ │ │ │ │ -| async_call(&torrent::set_file_priority, index, priority); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| download_priority_t torrent_handle::file_priority(file_index_t index) const | │ │ │ │ │ -| { | │ │ │ │ │ -| return sync_call_ret(dont_download, &torrent::file_priority, index); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|void torrent_handle::prioritize_files(std::vector const& files) const | │ │ │ │ │ -|{ | │ │ │ │ │ -| async_call(&torrent::prioritize_files | │ │ │ │ │ -| , static_cast const&>(files)); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| std::vector torrent_handle::get_file_priorities() const | │ │ │ │ │ -| { | │ │ │ │ │ -| aux::vector ret; | │ │ │ │ │ -| auto retp = &ret; | │ │ │ │ │ -| sync_call(&torrent::file_priorities, retp); | │ │ │ │ │ -| return TORRENT_RVO(ret); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ -| | │ │ │ │ │ -|// ============ start deprecation =============== | │ │ │ │ │ -| | │ │ │ │ │ -| void torrent_handle::prioritize_files(std::vector const& files) const | │ │ │ │ │ -| { | │ │ │ │ │ -| aux::vector file_prio; | │ │ │ │ │ -| file_prio.reserve(files.size()); | │ │ │ │ │ -| for (auto const p : files) { | │ │ │ │ │ -| file_prio.push_back(download_priority_t(static_cast(p))); | │ │ │ │ │ -| } | │ │ │ │ │ -| async_call(&torrent::prioritize_files, file_prio); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| std::vector torrent_handle::file_priorities() const | │ │ │ │ │ -| { | │ │ │ │ │ -|_ _ _a_u_x_:_:_v_e_c_t_o_r_<_d_o_w_n_l_o_a_d___p_r_i_o_r_i_t_y___t_,_ _f_i_l_e___i_n_d_e_x___t_>_ _p_r_i_o_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_s_e_t_t_i_n_g_s___p_a_c_k_._c_p_p_:_3_0_5_ _ _|_d_e_p_r_e_c_a_t_e_ _t_h_i_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ddeepprreeccaattee tthhiiss ********** | │ │ │ │ │ -|****** ....//ssrrcc//sseettttiinnggss__ppaacckk..ccpppp::330055 ****** | │ │ │ │ │ -|SET(outgoing_port, 0, nullptr), | │ │ │ │ │ -| SET(num_outgoing_ports, 0, nullptr), | │ │ │ │ │ -| SET(peer_dscp, 0x04, &session_impl::update_peer_dscp), | │ │ │ │ │ -| SET(active_downloads, 3, &session_impl::trigger_auto_manage), | │ │ │ │ │ -| SET(active_seeds, 5, &session_impl::trigger_auto_manage), | │ │ │ │ │ -| SET(active_checking, 1, &session_impl::trigger_auto_manage), | │ │ │ │ │ -| SET(active_dht_limit, 88, nullptr), | │ │ │ │ │ -| SET(active_tracker_limit, 1600, nullptr), | │ │ │ │ │ -| SET(active_lsd_limit, 60, nullptr), | │ │ │ │ │ -| SET(active_limit, 500, &session_impl::trigger_auto_manage), | │ │ │ │ │ -| DEPRECATED_SET(active_loaded_limit, 0, &session_impl::trigger_auto_manage), | │ │ │ │ │ -| SET(auto_manage_interval, 30, nullptr), | │ │ │ │ │ -| SET(seed_time_limit, 24 * 60 * 60, nullptr), | │ │ │ │ │ -| SET(auto_scrape_interval, 1800, nullptr), | │ │ │ │ │ -| SET(auto_scrape_min_interval, 300, nullptr), | │ │ │ │ │ -| SET(max_peerlist_size, 3000, nullptr), | │ │ │ │ │ -| SET(max_paused_peerlist_size, 1000, nullptr), | │ │ │ │ │ -| SET(min_announce_interval, 5 * 60, nullptr), | │ │ │ │ │ -| SET(auto_manage_startup, 60, nullptr), | │ │ │ │ │ -| SET(seeding_piece_quota, 20, nullptr), | │ │ │ │ │ -|SET(max_rejects, 50, nullptr), | │ │ │ │ │ -|SET(recv_socket_buffer_size, 0, &session_impl::update_socket_buffer_size), | │ │ │ │ │ -| SET(send_socket_buffer_size, 0, &session_impl::update_socket_buffer_size), | │ │ │ │ │ -| SET(max_peer_recv_buffer_size, 2 * 1024 * 1024, nullptr), | │ │ │ │ │ -| DEPRECATED_SET(file_checks_delay_per_block, 0, nullptr), | │ │ │ │ │ -| DEPRECATED2_SET(read_cache_line_size, 32, nullptr), | │ │ │ │ │ -| DEPRECATED2_SET(write_cache_line_size, 16, nullptr), | │ │ │ │ │ -| SET(optimistic_disk_retry, 10 * 60, nullptr), | │ │ │ │ │ -| SET(max_suggest_pieces, 16, nullptr), | │ │ │ │ │ -| SET(local_service_announce_interval, 5 * 60, nullptr), | │ │ │ │ │ -| SET(dht_announce_interval, 15 * 60, &session_impl::update_dht_announce_interval), | │ │ │ │ │ -| SET(udp_tracker_token_expiry, 60, nullptr), | │ │ │ │ │ -| DEPRECATED_SET(default_cache_min_age, 1, nullptr), | │ │ │ │ │ -| SET(num_optimistic_unchoke_slots, 0, nullptr), | │ │ │ │ │ -| DEPRECATED_SET(default_est_reciprocation_rate, 16000, nullptr), | │ │ │ │ │ -| DEPRECATED_SET(increase_est_reciprocation_rate, 20, nullptr), | │ │ │ │ │ -| DEPRECATED_SET(decrease_est_reciprocation_rate, 3, nullptr), | │ │ │ │ │ -| SET(max_pex_peers, 50, nullptr), | │ │ │ │ │ -| SET(tick_interval, 500, nullptr), | │ │ │ │ │ -| SET(share_mode_target, 3, nullptr), | │ │ │ │ │ -| SET(upload_rate_limit, 0, &session_impl::update_upload_rate), | │ │ │ │ │ -| SET(download_rate_limit, 0, &session_impl::update_download_rate), | │ │ │ │ │ -| DEPRECATED_SET(local_upload_rate_limit, 0, &session_impl::update_local_upload_rate), | │ │ │ │ │ -| DEPRECATED_SET(local_download_rate_limit, 0, &session_impl::update_local_download_rate), | │ │ │ │ │ -| SET(dht_upload_rate_limit, 8000, &session_impl::update_dht_upload_rate_limit), | │ │ │ │ │ -| SET(unchoke_slots_limit, 8, &session_impl::update_unchoke_limit), | │ │ │ │ │ -| DEPRECATED_SET(half_open_limit, 0, nullptr), | │ │ │ │ │ -| SET(connections_limit, 200, &session_impl::update_connections_limit), | │ │ │ │ │ -| SET(connections_slack, 10, nullptr), | │ │ │ │ │ -| SET(utp_target_delay, 100, nullptr), | │ │ │ │ │ -|_ _ _S_E_T_(_u_t_p___g_a_i_n___f_a_c_t_o_r_,_ _3_0_0_0_,_ _n_u_l_l_p_t_r_)_,_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_s_e_t_t_i_n_g_s___p_a_c_k_._c_p_p_:_5_9_0_ _ _|_i_t_ _w_o_u_l_d_ _b_e_ _n_i_c_e_ _t_o_ _r_e_s_e_r_v_e_(_)_ _t_h_e_s_e_ _v_e_c_t_o_r_s_ _u_p_ _f_r_o_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iitt wwoouulldd bbee nniiccee ttoo rreesseerrvvee(()) tthheessee vveeccttoorrss uupp ffrroonntt ********** | │ │ │ │ │ -|****** ....//ssrrcc//sseettttiinnggss__ppaacckk..ccpppp::559900 ****** | │ │ │ │ │ -|s.set_str(settings_pack::string_type_base | i, str_settings[i].default_value); | │ │ │ │ │ -| TORRENT_ASSERT(s.get_str(settings_pack::string_type_base + i) == str_settings[i].default_value); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| for (int i = 0; i < settings_pack::num_int_settings; ++i) | │ │ │ │ │ -| { | │ │ │ │ │ -| s.set_int(settings_pack::int_type_base | i, int_settings[i].default_value); | │ │ │ │ │ -| TORRENT_ASSERT(s.get_int(settings_pack::int_type_base + i) == int_settings[i].default_value); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| for (int i = 0; i < settings_pack::num_bool_settings; ++i) | │ │ │ │ │ -| { | │ │ │ │ │ -| s.set_bool(settings_pack::bool_type_base | i, bool_settings[i].default_value); | │ │ │ │ │ -| TORRENT_ASSERT(s.get_bool(settings_pack::bool_type_base + i) == bool_settings[i].default_value); | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| settings_pack default_settings() | │ │ │ │ │ -| { | │ │ │ │ │ -| settings_pack ret; | │ │ │ │ │ -|for (int i = 0; i < settings_pack::num_string_settings; ++i) | │ │ │ │ │ -|{ | │ │ │ │ │ -| if (str_settings[i].default_value == nullptr) continue; | │ │ │ │ │ -| ret.set_str(settings_pack::string_type_base + i, str_settings[i].default_value); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| for (int i = 0; i < settings_pack::num_int_settings; ++i) | │ │ │ │ │ -| { | │ │ │ │ │ -| ret.set_int(settings_pack::int_type_base + i, int_settings[i].default_value); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| for (int i = 0; i < settings_pack::num_bool_settings; ++i) | │ │ │ │ │ -| { | │ │ │ │ │ -| ret.set_bool(settings_pack::bool_type_base + i, bool_settings[i].default_value); | │ │ │ │ │ -| } | │ │ │ │ │ -| return ret; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void apply_pack(settings_pack const* pack, aux::session_settings& sett | │ │ │ │ │ -| , aux::session_impl* ses) | │ │ │ │ │ -| { | │ │ │ │ │ -| using fun_t = void (aux::session_impl::*)(); | │ │ │ │ │ -| std::vector callbacks; | │ │ │ │ │ -| | │ │ │ │ │ -| sett.bulk_set([&](aux::session_settings_single_thread& s) | │ │ │ │ │ -| { | │ │ │ │ │ -| apply_pack_impl(pack, s, ses ? &callbacks : nullptr); | │ │ │ │ │ -| }); | │ │ │ │ │ -| | │ │ │ │ │ -| // call the callbacks once all the settings have been applied, and | │ │ │ │ │ -|_ _ _/_/_ _o_n_l_y_ _o_n_c_e_ _p_e_r_ _c_a_l_l_b_a_c_k_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/ |why is this a linked list? | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_u_d_p___t_r_a_c_k_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_6_3_3_|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** wwhhyy iiss tthhiiss aa lliinnkkeedd lliisstt?? ********** | │ │ │ │ │ -|****** ....//ssrrcc//uuddpp__ttrraacckkeerr__ccoonnnneeccttiioonn..ccpppp::663333 ****** | │ │ │ │ │ -|ipv6_peer_entry e{}; | │ │ │ │ │ -| std::memcpy(e.ip.data(), buf.data(), 16); | │ │ │ │ │ -| buf = buf.subspan(16); | │ │ │ │ │ -| e.port = aux::read_uint16(buf); | │ │ │ │ │ -| resp.peers6.push_back(e); | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| else | │ │ │ │ │ -| { | │ │ │ │ │ -| resp.peers4.reserve(static_cast(num_peers)); | │ │ │ │ │ -| for (int i = 0; i < num_peers; ++i) | │ │ │ │ │ -| { | │ │ │ │ │ -| ipv4_peer_entry e{}; | │ │ │ │ │ -| std::memcpy(e.ip.data(), buf.data(), 4); | │ │ │ │ │ -| buf = buf.subspan(4); | │ │ │ │ │ -| e.port = aux::read_uint16(buf); | │ │ │ │ │ -| resp.peers4.push_back(e); | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|std::list
    ip_list; | │ │ │ │ │ -|std::transform(m_endpoints.begin(), m_endpoints.end(), std::back_inserter(ip_list) | │ │ │ │ │ -| , [](tcp::endpoint const& ep) { return ep.address(); } ); | │ │ │ │ │ -| | │ │ │ │ │ -| cb->tracker_response(tracker_req(), m_target.address(), ip_list, resp); | │ │ │ │ │ -| | │ │ │ │ │ -| close(); | │ │ │ │ │ -| return true; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| bool udp_tracker_connection::on_scrape_response(span buf) | │ │ │ │ │ -| { | │ │ │ │ │ -| restart_read_timeout(); | │ │ │ │ │ -| auto const action = static_cast(aux::read_int32(buf)); | │ │ │ │ │ -| std::uint32_t const transaction = aux::read_uint32(buf); | │ │ │ │ │ -| | │ │ │ │ │ -| if (transaction != m_transaction_id) | │ │ │ │ │ -| { | │ │ │ │ │ -| fail(error_code(errors::invalid_tracker_transaction_id), operation_t::bittorrent); | │ │ │ │ │ -| return false; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| if (action == action_t::error) | │ │ │ │ │ -| { | │ │ │ │ │ -| fail(error_code(errors::tracker_failure), operation_t::bittorrent | │ │ │ │ │ -| , std::string(buf.data(), static_cast(buf.size())).c_str()); | │ │ │ │ │ -| return true; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| if (action != action_t::scrape) | │ │ │ │ │ -|_ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_m_a_g_n_e_t___u_r_i_._c_p_p_:_4_3_9_ _ _ _ _ _|_w_h_a_t_'_s_ _t_h_e_ _r_i_g_h_t_ _n_u_m_b_e_r_ _h_e_r_e_?_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** wwhhaatt''ss tthhee rriigghhtt nnuummbbeerr hheerree?? ********** | │ │ │ │ │ -|****** ....//ssrrcc//mmaaggnneett__uurrii..ccpppp::443399 ****** | │ │ │ │ │ -|} | │ │ │ │ │ -| else if (string_equal_no_case(name, "so"_sv)) // select-only (files) | │ │ │ │ │ -| { | │ │ │ │ │ -| // accept only digits, '-' and ',' | │ │ │ │ │ -| if (std::any_of(value.begin(), value.end(), [](char c) | │ │ │ │ │ -| { return !is_digit(c) && c != '-' && c != ','; })) | │ │ │ │ │ -| continue; | │ │ │ │ │ -| | │ │ │ │ │ -| // make sure all file priorities are set to 0, except the ones | │ │ │ │ │ -| // we specify in the file_priorities | │ │ │ │ │ -| p.flags |= torrent_flags::default_dont_download; | │ │ │ │ │ -| | │ │ │ │ │ -| do | │ │ │ │ │ -| { | │ │ │ │ │ -| string_view token; | │ │ │ │ │ -| std::tie(token, value) = split_string(value, ','); | │ │ │ │ │ -| | │ │ │ │ │ -| if (token.empty()) continue; | │ │ │ │ │ -| | │ │ │ │ │ -| int idx1, idx2; | │ │ │ │ │ -|constexpr int max_index = 10000; // can't risk out of memory | │ │ │ │ │ -| | │ │ │ │ │ -| auto const divider = token.find_first_of('-'); | │ │ │ │ │ -| if (divider != std::string::npos) // it's a range | │ │ │ │ │ -| { | │ │ │ │ │ -| if (divider == 0) // no start index | │ │ │ │ │ -| continue; | │ │ │ │ │ -| if (divider == token.size() - 1) // no end index | │ │ │ │ │ -| continue; | │ │ │ │ │ -| | │ │ │ │ │ -| idx1 = std::atoi(token.substr(0, divider).to_string().c_str()); | │ │ │ │ │ -| if (idx1 < 0 || idx1 > max_index) // invalid index | │ │ │ │ │ -| continue; | │ │ │ │ │ -| idx2 = std::atoi(token.substr(divider + 1).to_string().c_str()); | │ │ │ │ │ -| if (idx2 < 0 || idx2 > max_index) // invalid index | │ │ │ │ │ -| continue; | │ │ │ │ │ -| | │ │ │ │ │ -| if (idx1 > idx2) // wrong range limits | │ │ │ │ │ -| continue; | │ │ │ │ │ -| } | │ │ │ │ │ -| else // it's an index | │ │ │ │ │ -| { | │ │ │ │ │ -| idx1 = std::atoi(token.to_string().c_str()); | │ │ │ │ │ -| if (idx1 < 0 || idx1 > max_index) // invalid index | │ │ │ │ │ -| continue; | │ │ │ │ │ -| idx2 = idx1; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| if (int(p.file_priorities.size()) <= idx2) | │ │ │ │ │ -|_ _ _ _ _ _ _p_._f_i_l_e___p_r_i_o_r_i_t_i_e_s_._r_e_s_i_z_e_(_s_t_a_t_i_c___c_a_s_t_<_s_t_d_:_:_s_i_z_e___t_>_(_i_d_x_2_)_ _+_ _1_,_ _d_o_n_t___d_o_w_n_l_o_a_d_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_h_a_s_h___p_i_c_k_e_r_._c_p_p_:_3_0_9_ _ _ _ _|_u_s_e_ _s_t_r_u_c_t_u_r_e_d_ _b_i_n_d_i_n_g_s_ _i_n_ _C_+_+_1_7_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** uussee ssttrruuccttuurreedd bbiinnddiinnggss iinn CC++++1177 ********** | │ │ │ │ │ -|****** ....//ssrrcc//hhaasshh__ppiicckkeerr..ccpppp::330099 ****** | │ │ │ │ │ -|, int const offset, sha256_hash const& h) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(offset >= 0); | │ │ │ │ │ -| auto const f = m_files.file_index_at_piece(piece); | │ │ │ │ │ -| | │ │ │ │ │ -| if (m_files.pad_file_at(f)) | │ │ │ │ │ -| return { set_block_hash_result::result::success, 0, 0 }; | │ │ │ │ │ -| | │ │ │ │ │ -| auto& merkle_tree = m_merkle_trees[f]; | │ │ │ │ │ -| piece_index_t const file_first_piece = m_files.piece_index_at_file(f); | │ │ │ │ │ -| std::int64_t const block_offset = static_cast(piece) * std::int64_t(m_files.piece_length()) | │ │ │ │ │ -| + offset - m_files.file_offset(f); | │ │ │ │ │ -| int const block_index = aux::numeric_cast(block_offset / default_block_size); | │ │ │ │ │ -| | │ │ │ │ │ -| if (h.is_all_zeros()) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT_FAIL(); | │ │ │ │ │ -| return set_block_hash_result::block_hash_failed(); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|aux::merkle_tree::set_block_result result; | │ │ │ │ │ -|int leafs_index; | │ │ │ │ │ -| int leafs_size; | │ │ │ │ │ -| std::tie(result, leafs_index, leafs_size) = merkle_tree.set_block(block_index, h); | │ │ │ │ │ -| | │ │ │ │ │ -| if (result == aux::merkle_tree::set_block_result::unknown) | │ │ │ │ │ -| return set_block_hash_result::unknown(); | │ │ │ │ │ -| if (result == aux::merkle_tree::set_block_result::block_hash_failed) | │ │ │ │ │ -| return set_block_hash_result::block_hash_failed(); | │ │ │ │ │ -| | │ │ │ │ │ -| auto const status = (result == aux::merkle_tree::set_block_result::hash_failed) | │ │ │ │ │ -| ? set_block_hash_result::result::piece_hash_failed | │ │ │ │ │ -| : set_block_hash_result::result::success; | │ │ │ │ │ -| | │ │ │ │ │ -| int const blocks_per_piece = m_files.piece_length() / default_block_size; | │ │ │ │ │ -| | │ │ │ │ │ -| return { status | │ │ │ │ │ -| , int(leafs_index - static_cast(piece - file_first_piece) * blocks_per_piece) | │ │ │ │ │ -| , std::min(leafs_size, m_files.file_num_pieces(f) * blocks_per_piece - leafs_index) }; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void hash_picker::hashes_rejected(hash_request const& req) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(req.base == m_piece_layer && req.index % 512 == 0); | │ │ │ │ │ -| | │ │ │ │ │ -| for (int i = req.index; i < req.index + req.count; i += 512) | │ │ │ │ │ -| { | │ │ │ │ │ -| m_piece_hash_requested[req.file][i / 512].last_request = min_time(); | │ │ │ │ │ -| --m_piece_hash_requested[req.file][i / 512].num_requests; | │ │ │ │ │ -|_ _ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t___p_e_e_r_._c_p_p_:_1_9_2_ _ _ _|_h_o_w_ _d_o_ _w_e_ _d_e_a_l_ _w_i_t_h_ _o_u_r_ _e_x_t_e_r_n_a_l_ _a_d_d_r_e_s_s_ _c_h_a_n_g_i_n_g_?_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** hhooww ddoo wwee ddeeaall wwiitthh oouurr eexxtteerrnnaall aaddddrreessss cchhaannggiinngg?? ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt__ppeeeerr..ccpppp::119922 ****** | │ │ │ │ │ -|// connections. If it fails, we'll | │ │ │ │ │ -| // retry with encryption | │ │ │ │ │ -| , pe_support(false) | │ │ │ │ │ -|#endif | │ │ │ │ │ -| , is_v6_addr(false) | │ │ │ │ │ -|#if TORRENT_USE_I2P | │ │ │ │ │ -| , is_i2p_addr(false) | │ │ │ │ │ -|#endif | │ │ │ │ │ -| , on_parole(false) | │ │ │ │ │ -| , banned(false) | │ │ │ │ │ -| , supports_utp(true) // assume peers support utp | │ │ │ │ │ -| , confirmed_supports_utp(false) | │ │ │ │ │ -| , supports_holepunch(false) | │ │ │ │ │ -| , web_seed(false) | │ │ │ │ │ -| , protocol_v2(false) | │ │ │ │ │ -| {} | │ │ │ │ │ -| | │ │ │ │ │ -| std::uint32_t torrent_peer::rank(external_ip const& external, int external_port) const | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(in_use); | │ │ │ │ │ -|if (peer_rank == 0) | │ │ │ │ │ -|peer_rank = peer_priority( | │ │ │ │ │ -| tcp::endpoint(external.external_address(this->address()), std::uint16_t(external_port)) | │ │ │ │ │ -| , tcp::endpoint(this->address(), this->port)); | │ │ │ │ │ -| return peer_rank; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| std::string torrent_peer::to_string() const | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(in_use); | │ │ │ │ │ -|#if TORRENT_USE_I2P | │ │ │ │ │ -| if (is_i2p_addr) return dest().to_string(); | │ │ │ │ │ -|#endif // TORRENT_USE_I2P | │ │ │ │ │ -| return address().to_string(); | │ │ │ │ │ -| } | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| std::int64_t torrent_peer::total_download() const | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(in_use); | │ │ │ │ │ -| if (connection != nullptr) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(prev_amount_download == 0); | │ │ │ │ │ -| return connection->statistics().total_payload_download(); | │ │ │ │ │ -| } | │ │ │ │ │ -| else | │ │ │ │ │ -| { | │ │ │ │ │ -| return std::int64_t(prev_amount_download) << 10; | │ │ │ │ │ -| } | │ │ │ │ │ -|_ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/_d_i_s_a_b_l_e_d___d_i_s_k___i_o_._c_p_p_: |it would be nice to return a valid hash of zeroes here | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_1_0_6_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iitt wwoouulldd bbee nniiccee ttoo rreettuurrnn aa vvaalliidd hhaasshh ooff zzeerrooeess hheerree ********** | │ │ │ │ │ -|****** ....//ssrrcc//ddiissaabblleedd__ddiisskk__iioo..ccpppp::110066 ****** | │ │ │ │ │ -|}); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| bool async_write(storage_index_t | │ │ │ │ │ -| , peer_request const& r | │ │ │ │ │ -| , char const*, std::shared_ptr | │ │ │ │ │ -| , std::function handler | │ │ │ │ │ -| , disk_job_flags_t) override | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(r.length <= default_block_size); | │ │ │ │ │ -| TORRENT_UNUSED(r); | │ │ │ │ │ -| | │ │ │ │ │ -| post(m_ios, [h = std::move(handler)] { h(storage_error{}); }); | │ │ │ │ │ -| return false; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void async_hash(storage_index_t | │ │ │ │ │ -| , piece_index_t piece, span, disk_job_flags_t | │ │ │ │ │ -| , std::function handler) override | │ │ │ │ │ -| { | │ │ │ │ │ -|post(m_ios, [h = std::move(handler), piece] { h(piece, sha1_hash{}, storage_error{}); }); | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -| void async_hash2(storage_index_t, piece_index_t piece, int | │ │ │ │ │ -| , disk_job_flags_t | │ │ │ │ │ -| , std::function handler) override | │ │ │ │ │ -| { | │ │ │ │ │ -| post(m_ios, [h = std::move(handler), piece]() { h(piece, sha256_hash{}, storage_error{}); }); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void async_move_storage(storage_index_t | │ │ │ │ │ -| , std::string p, move_flags_t | │ │ │ │ │ -| , std::function handler) override | │ │ │ │ │ -| { | │ │ │ │ │ -| post(m_ios, [h = std::move(handler), path = std::move(p)] () mutable | │ │ │ │ │ -| { h(status_t::no_error, std::move(path), storage_error{}); }); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void async_release_files(storage_index_t, std::function handler) override | │ │ │ │ │ -| { | │ │ │ │ │ -| post(m_ios, [h = std::move(handler)] { h(); }); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void async_delete_files(storage_index_t | │ │ │ │ │ -| , remove_flags_t, std::function handler) override | │ │ │ │ │ -| { | │ │ │ │ │ -| post(m_ios, [h = std::move(handler)] { h(storage_error{}); }); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void async_check_files(storage_index_t | │ │ │ │ │ -|_ _ _,_ _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s_ _c_o_n_s_t_*_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_a_l_e_r_t_._c_p_p_:_4_0_4_ _ _ _ _ _ _ _ _ _ _|_m_o_v_e_ _t_h_i_s_ _f_i_e_l_d_ _i_n_t_o_ _t_r_a_c_k_e_r___a_l_e_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** mmoovvee tthhiiss ffiieelldd iinnttoo ttrraacckkeerr__aalleerrtt ********** | │ │ │ │ │ -|****** ....//ssrrcc//aalleerrtt..ccpppp::440044 ****** | │ │ │ │ │ -| return torrent_alert::message() + ": state changed to: " | │ │ │ │ │ -| + state_str[state]; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| tracker_error_alert::tracker_error_alert(aux::stack_allocator& alloc | │ │ │ │ │ -| , torrent_handle const& h, tcp::endpoint const& ep, int times | │ │ │ │ │ -| , protocol_version v, string_view u, operation_t const operation | │ │ │ │ │ -| , error_code const& e | │ │ │ │ │ -| , string_view m) | │ │ │ │ │ -| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ -| , times_in_row(times) | │ │ │ │ │ -| , error(e) | │ │ │ │ │ -| , op(operation) | │ │ │ │ │ -| , m_msg_idx(alloc.copy_string(m)) | │ │ │ │ │ -|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ -| , status_code(e && e.category() == http_category() ? e.value() : -1) | │ │ │ │ │ -| , msg(m) | │ │ │ │ │ -|#endif | │ │ │ │ │ -|, version(v) | │ │ │ │ │ -|{ | │ │ │ │ │ -| TORRENT_ASSERT(!u.empty()); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| char const* tracker_error_alert::failure_reason() const | │ │ │ │ │ -| { | │ │ │ │ │ -| return m_alloc.get().ptr(m_msg_idx); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| std::string tracker_error_alert::message() const | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ -| return {}; | │ │ │ │ │ -|#else | │ │ │ │ │ -| char ret[400]; | │ │ │ │ │ -| std::snprintf(ret, sizeof(ret), "%s %s %s \"%s\" (%d)" | │ │ │ │ │ -| , tracker_alert::message().c_str() | │ │ │ │ │ -| , version == protocol_version::V1 ? "v1" : "v2" | │ │ │ │ │ -| , convert_from_native(error.message()).c_str(), error_message() | │ │ │ │ │ -| , times_in_row); | │ │ │ │ │ -| return ret; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| tracker_warning_alert::tracker_warning_alert(aux::stack_allocator& alloc | │ │ │ │ │ -| , torrent_handle const& h, tcp::endpoint const& ep | │ │ │ │ │ -| , string_view u, protocol_version v, string_view m) | │ │ │ │ │ -| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ -| , m_msg_idx(alloc.copy_string(m)) | │ │ │ │ │ -|_#_i_f_ _T_O_R_R_E_N_T___A_B_I___V_E_R_S_I_O_N_ _=_=_ _1_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_a_l_e_r_t_._c_p_p_:_4_3_8_ _ _ _ _ _ _ _ _ _ _|_m_o_v_e_ _t_h_i_s_ _i_n_t_o_ _t_r_a_c_k_e_r___a_l_e_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** mmoovvee tthhiiss iinnttoo ttrraacckkeerr__aalleerrtt ********** | │ │ │ │ │ -|****** ....//ssrrcc//aalleerrtt..ccpppp::443388 ****** | │ │ │ │ │ -|return {}; | │ │ │ │ │ -|#else | │ │ │ │ │ -| char ret[400]; | │ │ │ │ │ -| std::snprintf(ret, sizeof(ret), "%s %s %s \"%s\" (%d)" | │ │ │ │ │ -| , tracker_alert::message().c_str() | │ │ │ │ │ -| , version == protocol_version::V1 ? "v1" : "v2" | │ │ │ │ │ -| , convert_from_native(error.message()).c_str(), error_message() | │ │ │ │ │ -| , times_in_row); | │ │ │ │ │ -| return ret; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| tracker_warning_alert::tracker_warning_alert(aux::stack_allocator& alloc | │ │ │ │ │ -| , torrent_handle const& h, tcp::endpoint const& ep | │ │ │ │ │ -| , string_view u, protocol_version v, string_view m) | │ │ │ │ │ -| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ -| , m_msg_idx(alloc.copy_string(m)) | │ │ │ │ │ -|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ -| , msg(m) | │ │ │ │ │ -|#endif | │ │ │ │ │ -|, version(v) | │ │ │ │ │ -|{ | │ │ │ │ │ -| TORRENT_ASSERT(!u.empty()); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| char const* tracker_warning_alert::warning_message() const | │ │ │ │ │ -| { | │ │ │ │ │ -| return m_alloc.get().ptr(m_msg_idx); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| std::string tracker_warning_alert::message() const | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ -| return {}; | │ │ │ │ │ -|#else | │ │ │ │ │ -| return tracker_alert::message() + (version == protocol_version::V1 ? " v1" : " v2") + " warning: " + warning_message(); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| scrape_reply_alert::scrape_reply_alert(aux::stack_allocator& alloc | │ │ │ │ │ -| , torrent_handle const& h, tcp::endpoint const& ep | │ │ │ │ │ -| , int incomp, int comp, string_view u, protocol_version const v) | │ │ │ │ │ -| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ -| , incomplete(incomp) | │ │ │ │ │ -|_ _ _,_ _c_o_m_p_l_e_t_e_(_c_o_m_p_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_a_l_e_r_t_._c_p_p_:_4_6_4_ _ _ _ _ _ _ _ _ _ _|_m_o_v_e_ _t_h_i_s_ _i_n_t_o_ _t_r_a_c_k_e_r___a_l_e_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** mmoovvee tthhiiss iinnttoo ttrraacckkeerr__aalleerrtt ********** | │ │ │ │ │ -|****** ....//ssrrcc//aalleerrtt..ccpppp::446644 ****** | │ │ │ │ │ -|char const* tracker_warning_alert::warning_message() const | │ │ │ │ │ -| { | │ │ │ │ │ -| return m_alloc.get().ptr(m_msg_idx); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| std::string tracker_warning_alert::message() const | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ -| return {}; | │ │ │ │ │ -|#else | │ │ │ │ │ -| return tracker_alert::message() + (version == protocol_version::V1 ? " v1" : " v2") + " warning: " + warning_message(); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| scrape_reply_alert::scrape_reply_alert(aux::stack_allocator& alloc | │ │ │ │ │ -| , torrent_handle const& h, tcp::endpoint const& ep | │ │ │ │ │ -| , int incomp, int comp, string_view u, protocol_version const v) | │ │ │ │ │ -| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ -| , incomplete(incomp) | │ │ │ │ │ -| , complete(comp) | │ │ │ │ │ -|, version(v) | │ │ │ │ │ -|{ | │ │ │ │ │ -| TORRENT_ASSERT(!u.empty()); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| std::string scrape_reply_alert::message() const | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ -| return {}; | │ │ │ │ │ -|#else | │ │ │ │ │ -| char ret[400]; | │ │ │ │ │ -| std::snprintf(ret, sizeof(ret), "%s %s scrape reply: %d %d" | │ │ │ │ │ -| , tracker_alert::message().c_str() | │ │ │ │ │ -| , version == protocol_version::V1 ? "v1" : "v2" | │ │ │ │ │ -| , incomplete, complete); | │ │ │ │ │ -| return ret; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| scrape_failed_alert::scrape_failed_alert(aux::stack_allocator& alloc | │ │ │ │ │ -| , torrent_handle const& h, tcp::endpoint const& ep | │ │ │ │ │ -| , string_view u, protocol_version const v, error_code const& e) | │ │ │ │ │ -| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ -| , error(e) | │ │ │ │ │ -| , m_msg_idx() | │ │ │ │ │ -|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ -| , msg(convert_from_native(e.message())) | │ │ │ │ │ -|_#_e_n_d_i_f_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_a_l_e_r_t_._c_p_p_:_4_9_3_ _ _ _ _ _ _ _ _ _ _|_m_o_v_e_ _t_h_i_s_ _i_n_t_o_ _t_r_a_c_k_e_r___a_l_e_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** mmoovvee tthhiiss iinnttoo ttrraacckkeerr__aalleerrtt ********** | │ │ │ │ │ -|****** ....//ssrrcc//aalleerrtt..ccpppp::449933 ****** | │ │ │ │ │ -|return {}; | │ │ │ │ │ -|#else | │ │ │ │ │ -| char ret[400]; | │ │ │ │ │ -| std::snprintf(ret, sizeof(ret), "%s %s scrape reply: %d %d" | │ │ │ │ │ -| , tracker_alert::message().c_str() | │ │ │ │ │ -| , version == protocol_version::V1 ? "v1" : "v2" | │ │ │ │ │ -| , incomplete, complete); | │ │ │ │ │ -| return ret; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| scrape_failed_alert::scrape_failed_alert(aux::stack_allocator& alloc | │ │ │ │ │ -| , torrent_handle const& h, tcp::endpoint const& ep | │ │ │ │ │ -| , string_view u, protocol_version const v, error_code const& e) | │ │ │ │ │ -| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ -| , error(e) | │ │ │ │ │ -| , m_msg_idx() | │ │ │ │ │ -|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ -| , msg(convert_from_native(e.message())) | │ │ │ │ │ -|#endif | │ │ │ │ │ -|, version(v) | │ │ │ │ │ -|{ | │ │ │ │ │ -| TORRENT_ASSERT(!u.empty()); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| scrape_failed_alert::scrape_failed_alert(aux::stack_allocator& alloc | │ │ │ │ │ -| , torrent_handle const& h, tcp::endpoint const& ep | │ │ │ │ │ -| , string_view u, string_view m) | │ │ │ │ │ -| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ -| , error(errors::tracker_failure) | │ │ │ │ │ -| , m_msg_idx(alloc.copy_string(m)) | │ │ │ │ │ -|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ -| , msg(m) | │ │ │ │ │ -|#endif | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(!u.empty()); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| char const* scrape_failed_alert::error_message() const | │ │ │ │ │ -| { | │ │ │ │ │ -| if (m_msg_idx == aux::allocation_slot()) return ""; | │ │ │ │ │ -| else return m_alloc.get().ptr(m_msg_idx); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| std::string scrape_failed_alert::message() const | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ -| return {}; | │ │ │ │ │ -|#else | │ │ │ │ │ -| return tracker_alert::message() + " scrape failed: " + error_message(); | │ │ │ │ │ -|_#_e_n_d_i_f_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_a_l_e_r_t_._c_p_p_:_5_3_2_ _ _ _ _ _ _ _ _ _ _|_m_o_v_e_ _t_h_i_s_ _f_i_e_l_d_ _i_n_t_o_ _t_r_a_c_k_e_r___a_l_e_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** mmoovvee tthhiiss ffiieelldd iinnttoo ttrraacckkeerr__aalleerrtt ********** | │ │ │ │ │ -|****** ....//ssrrcc//aalleerrtt..ccpppp::553322 ****** | │ │ │ │ │ -|char const* scrape_failed_alert::error_message() const | │ │ │ │ │ -| { | │ │ │ │ │ -| if (m_msg_idx == aux::allocation_slot()) return ""; | │ │ │ │ │ -| else return m_alloc.get().ptr(m_msg_idx); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| std::string scrape_failed_alert::message() const | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ -| return {}; | │ │ │ │ │ -|#else | │ │ │ │ │ -| return tracker_alert::message() + " scrape failed: " + error_message(); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| tracker_reply_alert::tracker_reply_alert(aux::stack_allocator& alloc | │ │ │ │ │ -| , torrent_handle const& h, tcp::endpoint const& ep | │ │ │ │ │ -| , int np, protocol_version v, string_view u) | │ │ │ │ │ -| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ -| , num_peers(np) | │ │ │ │ │ -|, version(v) | │ │ │ │ │ -|{ | │ │ │ │ │ -| TORRENT_ASSERT(!u.empty()); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| std::string tracker_reply_alert::message() const | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ -| return {}; | │ │ │ │ │ -|#else | │ │ │ │ │ -| char ret[400]; | │ │ │ │ │ -| std::snprintf(ret, sizeof(ret), "%s %s received peers: %d" | │ │ │ │ │ -| , tracker_alert::message().c_str() | │ │ │ │ │ -| , version == protocol_version::V1 ? "v1" : "v2" | │ │ │ │ │ -| , num_peers); | │ │ │ │ │ -| return ret; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| dht_reply_alert::dht_reply_alert(aux::stack_allocator& alloc | │ │ │ │ │ -| , torrent_handle const& h | │ │ │ │ │ -| , int np) | │ │ │ │ │ -| : tracker_alert(alloc, h, {}, "") | │ │ │ │ │ -| , num_peers(np) | │ │ │ │ │ -| {} | │ │ │ │ │ -| | │ │ │ │ │ -| std::string dht_reply_alert::message() const | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ -| return {}; | │ │ │ │ │ -|_#_e_l_s_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_a_l_e_r_t_._c_p_p_:_5_7_6_ _ _ _ _ _ _ _ _ _ _|_m_o_v_e_ _t_h_i_s_ _t_o_ _t_r_a_c_k_e_r___a_l_e_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** mmoovvee tthhiiss ttoo ttrraacckkeerr__aalleerrtt ********** | │ │ │ │ │ -|****** ....//ssrrcc//aalleerrtt..ccpppp::557766 ****** | │ │ │ │ │ -|, num_peers(np) | │ │ │ │ │ -| {} | │ │ │ │ │ -| | │ │ │ │ │ -| std::string dht_reply_alert::message() const | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ -| return {}; | │ │ │ │ │ -|#else | │ │ │ │ │ -| char ret[400]; | │ │ │ │ │ -| std::snprintf(ret, sizeof(ret), "%s received DHT peers: %d" | │ │ │ │ │ -| , tracker_alert::message().c_str(), num_peers); | │ │ │ │ │ -| return ret; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| tracker_announce_alert::tracker_announce_alert(aux::stack_allocator& alloc | │ │ │ │ │ -| , torrent_handle const& h, tcp::endpoint const& ep, string_view u | │ │ │ │ │ -| , protocol_version const v, event_t const e) | │ │ │ │ │ -| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ -| , event(e) | │ │ │ │ │ -|, version(v) | │ │ │ │ │ -|{ | │ │ │ │ │ -| TORRENT_ASSERT(!u.empty()); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| std::string tracker_announce_alert::message() const | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ -| return {}; | │ │ │ │ │ -|#else | │ │ │ │ │ -| static const char* const event_str[] = {"none", "completed", "started", "stopped", "paused"}; | │ │ │ │ │ -| return tracker_alert::message() | │ │ │ │ │ -| + (version == protocol_version::V1 ? " v1" : " v2") | │ │ │ │ │ -| + " sending announce (" + event_str[static_cast(event)] + ")"; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| hash_failed_alert::hash_failed_alert( | │ │ │ │ │ -| aux::stack_allocator& alloc | │ │ │ │ │ -| , torrent_handle const& h | │ │ │ │ │ -| , piece_index_t index) | │ │ │ │ │ -| : torrent_alert(alloc, h) | │ │ │ │ │ -| , piece_index(index) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(index >= piece_index_t(0)); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| std::string hash_failed_alert::message() const | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ -|_ _ _r_e_t_u_r_n_ _{_}_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_r_a_n_d_o_m_._c_p_p_:_1_4_1_ _ _ _ _ _ _ _ _ _|_i_m_p_r_o_v_e_ _c_a_l_l_i_n_g_ _R_A_N_D___b_y_t_e_s_ _m_u_l_t_i_p_l_e_ _t_i_m_e_s_,_ _u_s_i_n_g_ _f_a_l_l_b_a_c_k_ _f_o_r_ _n_o_w_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iimmpprroovvee ccaalllliinngg RRAANNDD__bbyytteess mmuullttiippllee ttiimmeess,, uussiinngg ffaallllbbaacckk ffoorr nnooww ********** | │ │ │ │ │ -|****** ....//ssrrcc//rraannddoomm..ccpppp::114411 ****** | │ │ │ │ │ -|#else | │ │ │ │ │ -| std::generate(buffer.begin(), buffer.end(), [] { return char(random(0xff)); }); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void crypto_random_bytes(span buffer) | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifdef TORRENT_BUILD_SIMULATOR | │ │ │ │ │ -| // In the simulator we want deterministic random numbers | │ │ │ │ │ -| std::generate(buffer.begin(), buffer.end(), [] { return char(random(0xff)); }); | │ │ │ │ │ -|#elif TORRENT_USE_CNG | │ │ │ │ │ -| aux::cng_gen_random(buffer); | │ │ │ │ │ -|#elif TORRENT_USE_CRYPTOAPI | │ │ │ │ │ -| // windows | │ │ │ │ │ -| aux::crypt_gen_random(buffer); | │ │ │ │ │ -|#elif defined TORRENT_USE_LIBCRYPTO && !defined TORRENT_USE_WOLFSSL | │ │ │ │ │ -|// wolfSSL uses wc_RNG_GenerateBlock as the internal function for the | │ │ │ │ │ -|// openssl compatibility layer. This function API does not support | │ │ │ │ │ -|// an arbitrary buffer size (openssl does), it is limited by the | │ │ │ │ │ -|// constant RNG_MAX_BLOCK_LEN. | │ │ │ │ │ -| | │ │ │ │ │ -|// openssl | │ │ │ │ │ -| int r = RAND_bytes(reinterpret_cast(buffer.data()) | │ │ │ │ │ -| , int(buffer.size())); | │ │ │ │ │ -| if (r != 1) aux::throw_ex(errors::no_entropy); | │ │ │ │ │ -|#elif TORRENT_USE_GETRANDOM | │ │ │ │ │ -| ssize_t const r = ::getrandom(buffer.data(), static_cast(buffer.size()), 0); | │ │ │ │ │ -| if (r == ssize_t(buffer.size())) return; | │ │ │ │ │ -| if (r == -1 && errno != ENOSYS) aux::throw_ex(error_code(errno, generic_category())); | │ │ │ │ │ -| static dev_random dev; | │ │ │ │ │ -| dev.read(buffer); | │ │ │ │ │ -|#elif TORRENT_USE_DEV_RANDOM | │ │ │ │ │ -| static dev_random dev; | │ │ │ │ │ -| dev.read(buffer); | │ │ │ │ │ -|#else | │ │ │ │ │ -| | │ │ │ │ │ -|#if TORRENT_BROKEN_RANDOM_DEVICE | │ │ │ │ │ -| // even pseudo random numbers rely on being able to seed the random | │ │ │ │ │ -| // generator | │ │ │ │ │ -|#error "no entropy source available" | │ │ │ │ │ -|#else | │ │ │ │ │ -|#ifdef TORRENT_I_WANT_INSECURE_RANDOM_NUMBERS | │ │ │ │ │ -| std::generate(buffer.begin(), buffer.end(), [] { return char(random(0xff)); }); | │ │ │ │ │ -|#else | │ │ │ │ │ -|#error "no secure entropy source available. If you really want insecure random numbers, define TORRENT_I_WANT_INSECURE_RANDOM_NUMBERS" | │ │ │ │ │ -|#endif | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -|_}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 0|_._._/_s_r_c_/_s_t_o_r_a_g_e___u_t_i_l_s_._c_p_p_:_2_3_0 |ideally, if we end up copying files because of a move across volumes, the source should not be deleted until they've all been | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_c_o_p_i_e_d_._ _T_h_a_t_ _w_o_u_l_d_ _l_e_t_ _u_s_ _r_o_l_l_b_a_c_k_ _w_i_t_h_ _h_i_g_h_e_r_ _c_o_n_f_i_d_e_n_c_e_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** iiddeeaallllyy,, iiff wwee eenndd uupp ccooppyyiinngg ffiilleess bbeeccaauussee ooff aa mmoovvee aaccrroossss vvoolluummeess,, tthhee ssoouurrccee sshhoouulldd nnoott bbee ddeelleetteedd uunnttiill tthheeyy''vvee aallll bbeeeenn ccooppiieedd.. TThhaatt wwoouulldd lleett uuss rroollllbbaacckk wwiitthh | │ │ │ │ │ |hhiigghheerr ccoonnffiiddeennccee.. ********** | │ │ │ │ │ |****** ....//ssrrcc//ssttoorraaggee__uuttiillss..ccpppp::223300 ****** | │ │ │ │ │ |// later | │ │ │ │ │ | aux::vector copied_files(std::size_t(f.num_files()), false); | │ │ │ │ │ @@ -8413,122 +8284,14 @@ │ │ │ │ │ | if (get_filesize(stat, file_index, fs, save_path, ec) < 0) | │ │ │ │ │ | return false; | │ │ │ │ │ | | │ │ │ │ │ | // OK, this file existed, good. Now, skip all remaining pieces in | │ │ │ │ │ | // this file. We're just sanity-checking whether the files exist | │ │ │ │ │ | // or not. | │ │ │ │ │ |_ _ _ _p_e_e_r___r_e_q_u_e_s_t_ _c_o_n_s_t_ _p_r_ _=_ _f_s_._m_a_p___f_i_l_e_(_f_i_l_e___i_n_d_e_x_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_: |this should be the global download rate | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_1_1_0_5_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss sshhoouulldd bbee tthhee gglloobbaall ddoowwnnllooaadd rraattee ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppeeeerr__ccoonnnneeccttiioonn..ccpppp::11110055 ****** | │ │ │ │ │ -| int rate = 0; | │ │ │ │ │ -| | │ │ │ │ │ -| // if we haven't received any data recently, the current download rate | │ │ │ │ │ -| // is not representative | │ │ │ │ │ -| if (aux::time_now() - m_last_piece.get(m_connect) > seconds(30) && m_download_rate_peak > 0) | │ │ │ │ │ -| { | │ │ │ │ │ -| rate = m_download_rate_peak; | │ │ │ │ │ -| } | │ │ │ │ │ -| else if (aux::time_now() - m_last_unchoked.get(m_connect) < seconds(5) | │ │ │ │ │ -| && m_statistics.total_payload_upload() < 2 * 0x4000) | │ │ │ │ │ -| { | │ │ │ │ │ -| // if we're have only been unchoked for a short period of time, | │ │ │ │ │ -| // we don't know what rate we can get from this peer. Instead of assuming | │ │ │ │ │ -| // the lowest possible rate, assume the average. | │ │ │ │ │ -| | │ │ │ │ │ -| int peers_with_requests = int(stats_counters()[counters::num_peers_down_requests]); | │ │ │ │ │ -| // avoid division by 0 | │ │ │ │ │ -| if (peers_with_requests == 0) peers_with_requests = 1; | │ │ │ │ │ -| | │ │ │ │ │ -|rate = t->statistics().transfer_rate(stat::download_payload) / peers_with_requests; | │ │ │ │ │ -|} | │ │ │ │ │ -| else | │ │ │ │ │ -| { | │ │ │ │ │ -| // current download rate in bytes per seconds | │ │ │ │ │ -| rate = m_statistics.transfer_rate(stat::download_payload); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // avoid division by zero | │ │ │ │ │ -| if (rate < 50) rate = 50; | │ │ │ │ │ -| | │ │ │ │ │ -| // average of current rate and peak | │ │ │ │ │ -|// rate = (rate + m_download_rate_peak) / 2; | │ │ │ │ │ -| | │ │ │ │ │ -| return milliseconds((m_outstanding_bytes + extra_bytes | │ │ │ │ │ -| + m_queued_time_critical * t->block_size() * 1000) / rate); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void peer_connection::add_stat(std::int64_t const downloaded, std::int64_t const uploaded) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -| m_statistics.add_stat(downloaded, uploaded); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| sha1_hash peer_connection::associated_info_hash() const | │ │ │ │ │ -| { | │ │ │ │ │ -| std::shared_ptr t = associated_torrent().lock(); | │ │ │ │ │ -| TORRENT_ASSERT(t); | │ │ │ │ │ -| auto const& ih = t->info_hash(); | │ │ │ │ │ -| // if protocol_v2 is set on the peer, this better be a v2 torrent, | │ │ │ │ │ -|_ _ _/_/_ _o_t_h_e_r_w_i_s_e_ _s_o_m_e_t_h_i_n_g_ _i_s_n_'_t_ _r_i_g_h_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_: |sort the allowed fast set in priority order | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_3_5_3_6_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ssoorrtt tthhee aalllloowweedd ffaasstt sseett iinn pprriioorriittyy oorrddeerr ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppeeeerr__ccoonnnneeccttiioonn..ccpppp::33553366 ****** | │ │ │ │ │ -| // if the peer has the piece and we want | │ │ │ │ │ -| // to download it, request it | │ │ │ │ │ -| if (index < m_have_piece.end_index() | │ │ │ │ │ -| && m_have_piece[index] | │ │ │ │ │ -| && !t->have_piece(index) | │ │ │ │ │ -| && t->valid_metadata() | │ │ │ │ │ -| && t->has_picker() | │ │ │ │ │ -| && t->picker().piece_priority(index) > dont_download) | │ │ │ │ │ -| { | │ │ │ │ │ -| t->peer_is_interesting(*this); | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| std::vector const& peer_connection::allowed_fast() | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -| std::shared_ptr t = m_torrent.lock(); | │ │ │ │ │ -| TORRENT_ASSERT(t); | │ │ │ │ │ -| | │ │ │ │ │ -|return m_allowed_fast; | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -| bool peer_connection::can_request_time_critical() const | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -| if (has_peer_choked() || !is_interesting()) return false; | │ │ │ │ │ -| if (int(m_download_queue.size()) + int(m_request_queue.size()) | │ │ │ │ │ -| > m_desired_queue_size * 2) return false; | │ │ │ │ │ -| if (on_parole()) return false; | │ │ │ │ │ -| if (m_disconnecting) return false; | │ │ │ │ │ -| std::shared_ptr t = m_torrent.lock(); | │ │ │ │ │ -| TORRENT_ASSERT(t); | │ │ │ │ │ -| if (t->upload_mode()) return false; | │ │ │ │ │ -| | │ │ │ │ │ -| // ignore snubbed peers, since they're not likely to return pieces in a | │ │ │ │ │ -| // timely manner anyway | │ │ │ │ │ -| if (m_snubbed) return false; | │ │ │ │ │ -| return true; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| bool peer_connection::make_time_critical(piece_block const& block) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -| auto const rit = std::find_if(m_request_queue.begin() | │ │ │ │ │ -| , m_request_queue.end(), aux::has_block(block)); | │ │ │ │ │ -| if (rit == m_request_queue.end()) return false; | │ │ │ │ │ -|#if TORRENT_USE_ASSERTS | │ │ │ │ │ -| std::shared_ptr t = m_torrent.lock(); | │ │ │ │ │ -| TORRENT_ASSERT(t); | │ │ │ │ │ -|_ _ _T_O_R_R_E_N_T___A_S_S_E_R_T_(_t_-_>_h_a_s___p_i_c_k_e_r_(_)_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 0|_._._/_s_r_c_/ |move stats_counter_t out of counters | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_p_e_r_f_o_r_m_a_n_c_e___c_o_u_n_t_e_r_s_._c_p_p_:_4_0_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** mmoovvee ssttaattss__ccoouunntteerr__tt oouutt ooff ccoouunntteerrss ********** | │ │ │ │ │ |_**_**_**_ _.._.._//_ss_rr_cc_//_pp_ee_rr_ff_oo_rr_mm_aa_nn_cc_ee____cc_oo_uu_nn_tt_ee_rr_ss_.._cc_pp_pp_::_44_00_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 0|_._._/_s_r_c_/ |should bittorrent keep-alive messages have a counter too? | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_p_e_r_f_o_r_m_a_n_c_e___c_o_u_n_t_e_r_s_._c_p_p_:_4_1_ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** sshhoouulldd bbiittttoorrrreenntt kkeeeepp--aalliivvee mmeessssaaggeess hhaavvee aa ccoouunntteerr ttoooo?? ********** | │ │ │ │ │ @@ -8584,930 +8347,68 @@ │ │ │ │ │ | { | │ │ │ │ │ | if (&c == this) return *this; | │ │ │ │ │ |#ifdef ATOMIC_LLONG_LOCK_FREE | │ │ │ │ │ | for (int i = 0; i < m_stats_counter.end_index(); ++i) | │ │ │ │ │ | m_stats_counter[i].store( | │ │ │ │ │ | c.m_stats_counter[i].load(std::memory_order_relaxed) | │ │ │ │ │ |_ _ _ _ _ _,_ _s_t_d_:_:_m_e_m_o_r_y___o_r_d_e_r___r_e_l_a_x_e_d_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_i_e_c_e___p_i_c_k_e_r_._c_p_p_:_1_2_1_ _ _ _|_f_i_n_d_ _a_ _b_e_t_t_e_r_ _p_l_a_c_e_ _f_o_r_ _t_h_i_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ffiinndd aa bbeetttteerr ppllaaccee ffoorr tthhiiss ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppiieeccee__ppiicckkeerr..ccpppp::112211 ****** | │ │ │ │ │ -|if (limit == 0) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::cerr << " ..."; | │ │ │ │ │ -| break; | │ │ │ │ │ -| } | │ │ │ │ │ -| if (*i == -1) break; | │ │ │ │ │ -| while (j != p.m_priority_boundaries.end() && *j <= index) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::cerr << "| "; | │ │ │ │ │ -| ++j; | │ │ │ │ │ -| } | │ │ │ │ │ -| std::cerr << *i << "(" << p.m_piece_map[*i].index << ") "; | │ │ │ │ │ -| --limit; | │ │ │ │ │ -| } | │ │ │ │ │ -| std::cerr << std::endl; | │ │ │ │ │ -| } | │ │ │ │ │ -|} | │ │ │ │ │ -|#endif // TORRENT_PICKER_LOG | │ │ │ │ │ -|namespace libtorrent { | │ │ │ │ │ -| | │ │ │ │ │ -|const piece_block piece_block::invalid( | │ │ │ │ │ -|std::numeric_limits::max() | │ │ │ │ │ -| , std::numeric_limits::max()); | │ │ │ │ │ -| | │ │ │ │ │ -| constexpr prio_index_t piece_picker::piece_pos::we_have_index; | │ │ │ │ │ -| | │ │ │ │ │ -| constexpr picker_options_t piece_picker::rarest_first; | │ │ │ │ │ -| constexpr picker_options_t piece_picker::reverse; | │ │ │ │ │ -| constexpr picker_options_t piece_picker::on_parole; | │ │ │ │ │ -| constexpr picker_options_t piece_picker::prioritize_partials; | │ │ │ │ │ -| constexpr picker_options_t piece_picker::sequential; | │ │ │ │ │ -| constexpr picker_options_t piece_picker::align_expanded_pieces; | │ │ │ │ │ -| constexpr picker_options_t piece_picker::piece_extent_affinity; | │ │ │ │ │ -| | │ │ │ │ │ -| constexpr download_queue_t piece_picker::piece_pos::piece_downloading; | │ │ │ │ │ -| constexpr download_queue_t piece_picker::piece_pos::piece_full; | │ │ │ │ │ -| constexpr download_queue_t piece_picker::piece_pos::piece_finished; | │ │ │ │ │ -| constexpr download_queue_t piece_picker::piece_pos::piece_zero_prio; | │ │ │ │ │ -| constexpr download_queue_t piece_picker::piece_pos::num_download_categories; | │ │ │ │ │ -| constexpr download_queue_t piece_picker::piece_pos::piece_open; | │ │ │ │ │ -| constexpr download_queue_t piece_picker::piece_pos::piece_downloading_reverse; | │ │ │ │ │ -| constexpr download_queue_t piece_picker::piece_pos::piece_full_reverse; | │ │ │ │ │ -| | │ │ │ │ │ -| // the max number of blocks to create an affinity for | │ │ │ │ │ -| constexpr int max_piece_affinity_extent = 4 * 1024 * 1024 / default_block_size; | │ │ │ │ │ -| | │ │ │ │ │ -| piece_picker::piece_picker(std::int64_t const total_size, int const piece_size) | │ │ │ │ │ -| : m_priority_boundaries(1, m_pieces.end_index()) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(total_size > 0); | │ │ │ │ │ -|_ _ _T_O_R_R_E_N_T___A_S_S_E_R_T_(_p_i_e_c_e___s_i_z_e_ _>_ _0_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| | |this could probably be optimized by incrementally calling partial_sort to sort one more element in the list. Because chances are | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/_p_i_e_c_e___p_i_c_k_e_r_._c_p_p_:_2_0_6_7 |that we'll just need a single piece, and once we've picked from it we're done. Sorting the rest of the list in that case is a waste | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_o_f_ _t_i_m_e_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss ccoouulldd pprroobbaabbllyy bbee ooppttiimmiizzeedd bbyy iinnccrreemmeennttaallllyy ccaalllliinngg ppaarrttiiaall__ssoorrtt ttoo ssoorrtt oonnee mmoorree eelleemmeenntt iinn tthhee lliisstt.. BBeeccaauussee cchhaanncceess aarree tthhaatt wwee''llll jjuusstt nneeeedd aa ssiinnggllee ppiieeccee,, aanndd| │ │ │ │ │ -|oonnccee wwee''vvee ppiicckkeedd ffrroomm iitt wwee''rree ddoonnee.. SSoorrttiinngg tthhee rreesstt ooff tthhee lliisstt iinn tthhaatt ccaassee iiss aa wwaassttee ooff ttiimmee.. ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppiieeccee__ppiicckkeerr..ccpppp::22006677 ****** | │ │ │ │ │ -|// now, copy over the pointers. We also apply a filter here to not | │ │ │ │ │ -| // include ineligible pieces in certain modes. For instance, a piece | │ │ │ │ │ -| // that the current peer doesn't have is not included. | │ │ │ │ │ -| for (auto& dp : m_downloads[piece_pos::piece_downloading]) | │ │ │ │ │ -| { | │ │ │ │ │ -| pc.inc_stats_counter(counters::piece_picker_partial_loops); | │ │ │ │ │ -| | │ │ │ │ │ -| if (!is_piece_free(dp.index, pieces)) continue; | │ │ │ │ │ -| | │ │ │ │ │ -| TORRENT_ASSERT(m_piece_map[dp.index].download_queue() | │ │ │ │ │ -| == piece_pos::piece_downloading); | │ │ │ │ │ -| | │ │ │ │ │ -| ordered_partials[num_ordered_partials++] = &dp; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // now, sort the list. | │ │ │ │ │ -| if (options & rarest_first) | │ │ │ │ │ -| { | │ │ │ │ │ -| ret |= picker_log_alert::rarest_first_partials; | │ │ │ │ │ -| | │ │ │ │ │ -|std::sort(ordered_partials.begin(), ordered_partials.begin() + num_ordered_partials | │ │ │ │ │ -|, std::bind(&piece_picker::partial_compare_rarest_first, this | │ │ │ │ │ -| , _1, _2)); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| for (int i = 0; i < num_ordered_partials; ++i) | │ │ │ │ │ -| { | │ │ │ │ │ -| ret |= picker_log_alert::prioritize_partials; | │ │ │ │ │ -| | │ │ │ │ │ -| num_blocks = add_blocks_downloading(*ordered_partials[i], pieces | │ │ │ │ │ -| , interesting_blocks, backup_blocks, backup_blocks2 | │ │ │ │ │ -| , num_blocks, prefer_contiguous_blocks, peer, options); | │ │ │ │ │ -| if (num_blocks <= 0) return ret; | │ │ │ │ │ -| if (int(backup_blocks.size()) >= num_blocks | │ │ │ │ │ -| && int(backup_blocks2.size()) >= num_blocks) | │ │ │ │ │ -| break; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| num_blocks = append_blocks(interesting_blocks, backup_blocks | │ │ │ │ │ -| , num_blocks); | │ │ │ │ │ -| if (num_blocks <= 0) return ret; | │ │ │ │ │ -| | │ │ │ │ │ -| num_blocks = append_blocks(interesting_blocks, backup_blocks2 | │ │ │ │ │ -| , num_blocks); | │ │ │ │ │ -| if (num_blocks <= 0) return ret; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| if (!suggested_pieces.empty()) | │ │ │ │ │ -| { | │ │ │ │ │ -| for (piece_index_t i : suggested_pieces) | │ │ │ │ │ -|_ _ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_i_e_c_e___p_i_c_k_e_r_._c_p_p_:_2_2_1_1_ _ _|_I_s_ _i_t_ _a_ _g_o_o_d_ _i_d_e_a_ _t_h_a_t_ _t_h_i_s_ _a_f_f_i_n_i_t_y_ _t_a_k_e_s_ _p_r_e_c_e_d_e_n_c_e_ _o_v_e_r_ _p_i_e_c_e_ _p_r_i_o_r_i_t_y_?_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** IIss iitt aa ggoooodd iiddeeaa tthhaatt tthhiiss aaffffiinniittyy ttaakkeess pprreecceeddeennccee oovveerr ppiieeccee pprriioorriittyy?? ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppiieeccee__ppiicckkeerr..ccpppp::22221111 ****** | │ │ │ │ │ -|prio_index_t const end = priority_end(i); | │ │ │ │ │ -| for (prio_index_t p = prev(end); p >= start; --p) | │ │ │ │ │ -| { | │ │ │ │ │ -| pc.inc_stats_counter(counters::piece_picker_reverse_rare_loops); | │ │ │ │ │ -| | │ │ │ │ │ -| if (!is_piece_free(m_pieces[p], pieces)) continue; | │ │ │ │ │ -| | │ │ │ │ │ -| ret |= picker_log_alert::reverse_rarest_first; | │ │ │ │ │ -| | │ │ │ │ │ -| num_blocks = add_blocks(m_pieces[p], pieces | │ │ │ │ │ -| , interesting_blocks, backup_blocks | │ │ │ │ │ -| , backup_blocks2, num_blocks | │ │ │ │ │ -| , prefer_contiguous_blocks, peer, ignored_pieces | │ │ │ │ │ -| , options); | │ │ │ │ │ -| if (num_blocks <= 0) return ret; | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| else | │ │ │ │ │ -| { | │ │ │ │ │ -|if (options & piece_extent_affinity) | │ │ │ │ │ -|{ | │ │ │ │ │ -| int to_erase = -1; | │ │ │ │ │ -| int idx = -1; | │ │ │ │ │ -| for (piece_extent_t const e : m_recent_extents) | │ │ │ │ │ -| { | │ │ │ │ │ -| ++idx; | │ │ │ │ │ -| bool have_all = true; | │ │ │ │ │ -| for (piece_index_t const p : extent_for(e)) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (!m_piece_map[p].have()) have_all = false; | │ │ │ │ │ -| if (!is_piece_free(p, pieces)) continue; | │ │ │ │ │ -| | │ │ │ │ │ -| ret |= picker_log_alert::extent_affinity; | │ │ │ │ │ -| | │ │ │ │ │ -| num_blocks = add_blocks(p, pieces | │ │ │ │ │ -| , interesting_blocks, backup_blocks | │ │ │ │ │ -| , backup_blocks2, num_blocks | │ │ │ │ │ -| , prefer_contiguous_blocks, peer, ignored_pieces | │ │ │ │ │ -| , options); | │ │ │ │ │ -| if (num_blocks <= 0) | │ │ │ │ │ -| { | │ │ │ │ │ -| // if we have all pieces belonging to this extent, remove it | │ │ │ │ │ -| if (to_erase != -1) m_recent_extents.erase(m_recent_extents.begin() + to_erase); | │ │ │ │ │ -| return ret; | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| // if we have all pieces belonging to this extent, remove it | │ │ │ │ │ -| if (have_all) to_erase = idx; | │ │ │ │ │ -| } | │ │ │ │ │ -|_ _ _ _ _ _i_f_ _(_t_o___e_r_a_s_e_ _!_=_ _-_1_)_ _m___r_e_c_e_n_t___e_x_t_e_n_t_s_._e_r_a_s_e_(_m___r_e_c_e_n_t___e_x_t_e_n_t_s_._b_e_g_i_n_(_)_ _+_ _t_o___e_r_a_s_e_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_i_e_c_e___p_i_c_k_e_r_._c_p_p_:_2_5_6_6_ _ _|_w_h_e_n_ _e_x_p_a_n_d_i_n_g_ _p_i_e_c_e_s_ _f_o_r_ _c_a_c_h_e_ _s_t_r_i_p_e_ _r_e_a_s_o_n_s_,_ _t_h_e_ _!_d_o_w_n_l_o_a_d_i_n_g_ _c_o_n_d_i_t_i_o_n_ _d_o_e_s_n_'_t_ _m_a_k_e_ _m_u_c_h_ _s_e_n_s_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** wwhheenn eexxppaannddiinngg ppiieecceess ffoorr ccaacchhee ssttrriippee rreeaassoonnss,, tthhee !!ddoowwnnllooaaddiinngg ccoonnddiittiioonn ddooeessnn''tt mmaakkee mmuucchh sseennssee ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppiieeccee__ppiicckkeerr..ccpppp::22556666 ****** | │ │ │ │ │ -|TORRENT_ASSERT(index < m_piece_map.end_index()); | │ │ │ │ │ -| if (next(index) == m_piece_map.end_index()) | │ │ │ │ │ -| return m_blocks_in_last_piece; | │ │ │ │ │ -| else | │ │ │ │ │ -| return blocks_per_piece(); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| bool piece_picker::is_piece_free(piece_index_t const piece | │ │ │ │ │ -| , typed_bitfield const& bitmask) const | │ │ │ │ │ -| { | │ │ │ │ │ -| return bitmask[piece] | │ │ │ │ │ -| && !m_piece_map[piece].have() | │ │ │ │ │ -| && !m_piece_map[piece].filtered(); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| bool piece_picker::can_pick(piece_index_t const piece | │ │ │ │ │ -| , typed_bitfield const& bitmask) const | │ │ │ │ │ -| { | │ │ │ │ │ -| return bitmask[piece] | │ │ │ │ │ -| && !m_piece_map[piece].have() | │ │ │ │ │ -|&& !m_piece_map[piece].downloading() | │ │ │ │ │ -|&& !m_piece_map[piece].filtered(); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|#if TORRENT_USE_INVARIANT_CHECKS | │ │ │ │ │ -| void piece_picker::check_peers() | │ │ │ │ │ -| { | │ │ │ │ │ -| for (auto const& b : m_block_info) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(b.peer == nullptr || static_cast(b.peer)->in_use); | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| void piece_picker::clear_peer(torrent_peer* peer) | │ │ │ │ │ -| { | │ │ │ │ │ -| for (auto& b : m_block_info) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (b.peer == peer) b.peer = nullptr; | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // the first bool is true if this is the only peer that has requested and downloaded | │ │ │ │ │ -| // blocks from this piece. | │ │ │ │ │ -| // the second bool is true if this is the only active peer that is requesting | │ │ │ │ │ -|_ _/_/_ _a_n_d_ _d_o_w_n_l_o_a_d_i_n_g_ _b_l_o_c_k_s_ _f_r_o_m_ _t_h_i_s_ _p_i_e_c_e_._ _A_c_t_i_v_e_ _m_e_a_n_s_ _h_a_v_i_n_g_ _a_ _c_o_n_n_e_c_t_i_o_n_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_i_e_c_e___p_i_c_k_e_r_._c_p_p_:_3_1_4_4_ _ _|_s_h_o_u_l_d_ _5_ _b_e_ _c_o_n_f_i_g_u_r_a_b_l_e_?_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** sshhoouulldd 55 bbee ccoonnffiigguurraabbllee?? ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppiieeccee__ppiicckkeerr..ccpppp::33114444 ****** | │ │ │ │ │ -|bool have_all = true; | │ │ │ │ │ -| | │ │ │ │ │ -| for (auto const piece : extent_for(this_extent)) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (piece == p) continue; | │ │ │ │ │ -| | │ │ │ │ │ -| if (!m_piece_map[piece].have()) have_all = false; | │ │ │ │ │ -| | │ │ │ │ │ -| // if at least one piece in this extent has a different priority than | │ │ │ │ │ -| // the one we just started downloading, don't create an affinity for | │ │ │ │ │ -| // adjacent pieces. This probably means the pieces belong to different | │ │ │ │ │ -| // files, or that some other mechanism determining the priority should | │ │ │ │ │ -| // take precedence. | │ │ │ │ │ -| if (piece_priority(piece) != this_prio) return; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // if we already have all the *other* pieces in this extent, there's no | │ │ │ │ │ -| // need to inflate their priorities | │ │ │ │ │ -| if (have_all) return; | │ │ │ │ │ -| | │ │ │ │ │ -|if (m_recent_extents.size() < 5) | │ │ │ │ │ -|m_recent_extents.push_back(this_extent); | │ │ │ │ │ -| | │ │ │ │ │ -| // limit the number of extent affinities active at any given time to limit | │ │ │ │ │ -| // the cost of checking them. Also, don't replace them, commit to | │ │ │ │ │ -| // finishing them before starting another extent. This is analogous to | │ │ │ │ │ -| // limiting the number of partial pieces. | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // options may be 0 or piece_picker::reverse | │ │ │ │ │ -| // returns false if the block could not be marked as downloading | │ │ │ │ │ -| bool piece_picker::mark_as_downloading(piece_block const block | │ │ │ │ │ -| , torrent_peer* peer, picker_options_t const options) | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifdef TORRENT_PICKER_LOG | │ │ │ │ │ -| std::cerr << "[" << this << "] " << "mark_as_downloading( {" | │ │ │ │ │ -| << block.piece_index << ", " << block.block_index << "} )" << std::endl; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| TORRENT_ASSERT(peer == nullptr || peer->in_use); | │ │ │ │ │ -| TORRENT_ASSERT(block.block_index != piece_block::invalid.block_index); | │ │ │ │ │ -| TORRENT_ASSERT(block.piece_index != piece_block::invalid.piece_index); | │ │ │ │ │ -| TORRENT_ASSERT(block.piece_index < m_piece_map.end_index()); | │ │ │ │ │ -| TORRENT_ASSERT(block.block_index < blocks_in_piece(block.piece_index)); | │ │ │ │ │ -| TORRENT_ASSERT(!m_piece_map[block.piece_index].have()); | │ │ │ │ │ -| | │ │ │ │ │ -| piece_pos& p = m_piece_map[block.piece_index]; | │ │ │ │ │ -| if (p.download_queue() == piece_pos::piece_open) | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifdef TORRENT_EXPENSIVE_INVARIANT_CHECKS | │ │ │ │ │ -|_ _ _ _I_N_V_A_R_I_A_N_T___C_H_E_C_K_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_c_r_e_a_t_e___t_o_r_r_e_n_t_._c_p_p_:_6_1_8_ _|_t_h_i_s_ _c_a_n_ _b_e_ _o_p_t_i_m_i_z_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss ccaann bbee ooppttiimmiizzeedd ********** | │ │ │ │ │ -|****** ....//ssrrcc//ccrreeaattee__ttoorrrreenntt..ccpppp::661188 ****** | │ │ │ │ │ -|std::string& attr = e["attr"].string(); | │ │ │ │ │ -| if (flags & file_storage::flag_pad_file) attr += 'p'; | │ │ │ │ │ -| if (flags & file_storage::flag_hidden) attr += 'h'; | │ │ │ │ │ -| if (flags & file_storage::flag_executable) attr += 'x'; | │ │ │ │ │ -| if (include_symlinks && (flags & file_storage::flag_symlink)) attr += 'l'; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void add_symlink_path(entry& e, std::string symlink_path) | │ │ │ │ │ -| { | │ │ │ │ │ -| entry& sympath_e = e["symlink path"]; | │ │ │ │ │ -| | │ │ │ │ │ -| std::string const link = lexically_relative("", symlink_path); | │ │ │ │ │ -| for (auto elems = lsplit_path(link); !elems.first.empty(); | │ │ │ │ │ -| elems = lsplit_path(elems.second)) | │ │ │ │ │ -| sympath_e.list().emplace_back(elems.first); | │ │ │ │ │ -| } | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -| std::vector create_torrent::generate_buf() const | │ │ │ │ │ -| { | │ │ │ │ │ -|std::vector ret; | │ │ │ │ │ -|bencode(std::back_inserter(ret), generate()); | │ │ │ │ │ -| return ret; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| entry create_torrent::generate() const | │ │ │ │ │ -| { | │ │ │ │ │ -| if (m_files.num_files() == 0 || m_files.total_size() == 0) | │ │ │ │ │ -| aux::throw_ex(errors::torrent_missing_file_tree); | │ │ │ │ │ -| | │ │ │ │ │ -| // if all v2 hashes are set correctly, generate the v2 parts of the | │ │ │ │ │ -| // torrent | │ │ │ │ │ -| bool const make_v2 = validate_v2_hashes(m_files, m_file_piece_hash); | │ │ │ │ │ -| bool const make_v1 = validate_v1_hashes(m_files, m_piece_hash); | │ │ │ │ │ -| | │ │ │ │ │ -| // if neither v1 nor v2 hashes were set, we can't create a torrent | │ │ │ │ │ -| if (!make_v1 && !make_v2) | │ │ │ │ │ -| aux::throw_ex(errors::invalid_hash_entry); | │ │ │ │ │ -| | │ │ │ │ │ -| TORRENT_ASSERT(m_files.piece_length() > 0); | │ │ │ │ │ -| | │ │ │ │ │ -| entry dict; | │ │ │ │ │ -| | │ │ │ │ │ -| if (!m_urls.empty()) dict["announce"] = m_urls.front().first; | │ │ │ │ │ -| | │ │ │ │ │ -| if (!m_nodes.empty()) | │ │ │ │ │ -| { | │ │ │ │ │ -| entry& nodes = dict["nodes"]; | │ │ │ │ │ -| entry::list_type& nodes_list = nodes.list(); | │ │ │ │ │ -| for (auto const& n : m_nodes) | │ │ │ │ │ -|_ _ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_1_9_5_1_ _ _ _ _ _ _ _|_t_h_i_s_ _c_o_u_l_d_ _b_e_ _o_p_t_i_m_i_z_e_d_ _b_y_ _l_o_o_k_i_n_g_ _u_p_ _w_h_i_c_h_ _f_i_l_e_s_ _a_r_e_ _c_o_m_p_l_e_t_e_ _a_n_d_ _j_u_s_t_ _l_o_o_k_ _a_t_ _t_h_o_s_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss ccoouulldd bbee ooppttiimmiizzeedd bbyy llooookkiinngg uupp wwhhiicchh ffiilleess aarree ccoommpplleettee aanndd jjuusstt llooookk aatt tthhoossee ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::11995511 ****** | │ │ │ │ │ -|// TORRENT_ASSERT(picker().have_piece(i)); | │ │ │ │ │ -| we_have(i); | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| set_state(torrent_status::checking_resume_data); | │ │ │ │ │ -| | │ │ │ │ │ -| aux::vector links; | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_MUTABLE_TORRENTS | │ │ │ │ │ -| if (!m_torrent_file->similar_torrents().empty() | │ │ │ │ │ -| || !m_torrent_file->collections().empty()) | │ │ │ │ │ -| { | │ │ │ │ │ -| resolve_links res(m_torrent_file); | │ │ │ │ │ -| | │ │ │ │ │ -| for (auto const& ih : m_torrent_file->similar_torrents()) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::shared_ptr t = m_ses.find_torrent(info_hash_t(ih)).lock(); | │ │ │ │ │ -| if (!t) continue; | │ │ │ │ │ -| | │ │ │ │ │ -| // Only attempt to reuse files from torrents that are seeding. | │ │ │ │ │ -|if (!t->is_seed()) continue; | │ │ │ │ │ -| | │ │ │ │ │ -| res.match(t->get_torrent_file(), t->save_path()); | │ │ │ │ │ -| } | │ │ │ │ │ -| for (auto const& c : m_torrent_file->collections()) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::vector> ts = m_ses.find_collection(c); | │ │ │ │ │ -| | │ │ │ │ │ -| for (auto const& t : ts) | │ │ │ │ │ -| { | │ │ │ │ │ -|_ _ _ _ _ _/_/_ _O_n_l_y_ _a_t_t_e_m_p_t_ _t_o_ _r_e_u_s_e_ _f_i_l_e_s_ _f_r_o_m_ _t_o_r_r_e_n_t_s_ _t_h_a_t_ _a_r_e_ _s_e_e_d_i_n_g_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_1_9_6_4_ _ _ _ _ _ _ _|_t_h_i_s_ _c_o_u_l_d_ _b_e_ _o_p_t_i_m_i_z_e_d_ _b_y_ _l_o_o_k_i_n_g_ _u_p_ _w_h_i_c_h_ _f_i_l_e_s_ _a_r_e_ _c_o_m_p_l_e_t_e_ _a_n_d_ _j_u_s_t_ _l_o_o_k_ _a_t_ _t_h_o_s_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss ccoouulldd bbee ooppttiimmiizzeedd bbyy llooookkiinngg uupp wwhhiicchh ffiilleess aarree ccoommpplleettee aanndd jjuusstt llooookk aatt tthhoossee ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::11996644 ****** | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_a_c_k_e_t___b_u_f_f_e_r_._c_p_p_:_1_5_7_ _ _|_u_s_e_ _c_o_m_p_a_r_e___l_e_s_s___w_r_a_p_ _f_o_r_ _t_h_i_s_ _c_o_m_p_a_r_i_s_o_n_ _a_s_ _w_e_l_l_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** uussee ccoommppaarree__lleessss__wwrraapp ffoorr tthhiiss ccoommppaarriissoonn aass wweellll ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppaacckkeett__bbuuffffeerr..ccpppp::115577 ****** | │ │ │ │ │ |{ | │ │ │ │ │ -| resolve_links res(m_torrent_file); | │ │ │ │ │ -| | │ │ │ │ │ -| for (auto const& ih : m_torrent_file->similar_torrents()) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::shared_ptr t = m_ses.find_torrent(info_hash_t(ih)).lock(); | │ │ │ │ │ -| if (!t) continue; | │ │ │ │ │ -| | │ │ │ │ │ -| // Only attempt to reuse files from torrents that are seeding. | │ │ │ │ │ -| if (!t->is_seed()) continue; | │ │ │ │ │ -| | │ │ │ │ │ -| res.match(t->get_torrent_file(), t->save_path()); | │ │ │ │ │ -| } | │ │ │ │ │ -| for (auto const& c : m_torrent_file->collections()) | │ │ │ │ │ -| { | │ │ │ │ │ -| std::vector> ts = m_ses.find_collection(c); | │ │ │ │ │ -| | │ │ │ │ │ -| for (auto const& t : ts) | │ │ │ │ │ -| { | │ │ │ │ │ -| // Only attempt to reuse files from torrents that are seeding. | │ │ │ │ │ -|if (!t->is_seed()) continue; | │ │ │ │ │ -| | │ │ │ │ │ -| res.match(t->get_torrent_file(), t->save_path()); | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| std::vector const& l = res.get_links(); | │ │ │ │ │ -| if (!l.empty()) | │ │ │ │ │ -| { | │ │ │ │ │ -| links.resize(m_torrent_file->files().num_files()); | │ │ │ │ │ -| for (auto const& i : l) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (!i.ti) continue; | │ │ │ │ │ -| links[i.file_idx] = combine_path(i.save_path | │ │ │ │ │ -| , i.ti->files().file_path(i.file_idx)); | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -|#endif // TORRENT_DISABLE_MUTABLE_TORRENTS | │ │ │ │ │ -| | │ │ │ │ │ -|#if TORRENT_USE_ASSERTS | │ │ │ │ │ -| TORRENT_ASSERT(m_outstanding_check_files == false); | │ │ │ │ │ -| m_outstanding_check_files = true; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| if (!m_add_torrent_params || !(m_add_torrent_params->flags & torrent_flags::no_verify_files)) | │ │ │ │ │ -| { | │ │ │ │ │ -| m_ses.disk_thread().async_check_files( | │ │ │ │ │ -| m_storage, m_add_torrent_params ? m_add_torrent_params.get() : nullptr | │ │ │ │ │ -| , std::move(links), [self = shared_from_this()](status_t st, storage_error const& error) | │ │ │ │ │ -|_ _ _ _ _{_ _s_e_l_f_-_>_o_n___r_e_s_u_m_e___d_a_t_a___c_h_e_c_k_e_d_(_s_t_,_ _e_r_r_o_r_)_;_ _}_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_2_7_2_8 |this pattern is repeated in a few places. Factor this into a function and generalize the concept of a torrent having a dedicated | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_l_i_s_t_e_n_ _p_o_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss ppaatttteerrnn iiss rreeppeeaatteedd iinn aa ffeeww ppllaacceess.. FFaaccttoorr tthhiiss iinnttoo aa ffuunnccttiioonn aanndd ggeenneerraalliizzee tthhee ccoonncceepptt ooff aa ttoorrrreenntt hhaavviinngg aa ddeeddiiccaatteedd lliisstteenn ppoorrtt ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::22772288 ****** | │ │ │ │ │ -|// not ready for peers. Except, if we don't have metadata, | │ │ │ │ │ -| // we need peers to download from | │ │ │ │ │ -| if (!m_files_checked && valid_metadata()) return; | │ │ │ │ │ -| | │ │ │ │ │ -| if (!m_announce_to_lsd) return; | │ │ │ │ │ -| | │ │ │ │ │ -| // private torrents are never announced on LSD | │ │ │ │ │ -| if (m_torrent_file->is_valid() && m_torrent_file->priv()) return; | │ │ │ │ │ -| | │ │ │ │ │ -|#if TORRENT_USE_I2P | │ │ │ │ │ -| // i2p torrents are also never announced on LSD | │ │ │ │ │ -| // unless we allow mixed swarms | │ │ │ │ │ -| if (is_i2p() && !settings().get_bool(settings_pack::allow_i2p_mixed)) | │ │ │ │ │ -| return; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| if (is_paused()) return; | │ │ │ │ │ -| | │ │ │ │ │ -| if (!m_ses.has_lsd()) return; | │ │ │ │ │ -| | │ │ │ │ │ -|#ifdef TORRENT_SSL_PEERS | │ │ │ │ │ -|int port = is_ssl_torrent() ? m_ses.ssl_listen_port() : m_ses.listen_port(); | │ │ │ │ │ -|#else | │ │ │ │ │ -| int port = m_ses.listen_port(); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| // announce with the local discovery service | │ │ │ │ │ -| m_torrent_file->info_hashes().for_each([&](sha1_hash const& ih, protocol_version) | │ │ │ │ │ -| { | │ │ │ │ │ -| m_ses.announce_lsd(ih, port); | │ │ │ │ │ -| }); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_DHT | │ │ │ │ │ -| | │ │ │ │ │ -| void torrent::dht_announce() | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -| if (!m_ses.dht()) | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| debug_log("DHT: no dht initialized"); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| return; | │ │ │ │ │ -| } | │ │ │ │ │ -| if (!should_announce_dht()) | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| if (should_log()) | │ │ │ │ │ -| { | │ │ │ │ │ -|_#_i_f_ _T_O_R_R_E_N_T___U_S_E___I_2_P_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_3_8_8_5_ _ _ _ _ _ _ _|_a_d_d_ _o_n_e_ _p_e_e_r_ _p_e_r_ _I_P_ _t_h_e_ _h_o_s_t_n_a_m_e_ _r_e_s_o_l_v_e_s_ _t_o_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** aadddd oonnee ppeeeerr ppeerr IIPP tthhee hhoossttnnaammee rreessoollvveess ttoo ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::33888855 ****** | │ │ │ │ │ -|catch (...) { handle_exception(); } | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| void torrent::on_peer_name_lookup(error_code const& e | │ │ │ │ │ -| , std::vector
    const& host_list, int const port | │ │ │ │ │ -| , protocol_version const v) try | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -| | │ │ │ │ │ | INVARIANT_CHECK; | │ │ │ │ │ +| TORRENT_ASSERT_VAL(size <= 0xffff, size); | │ │ │ │ │ +| std::uint32_t new_size = m_capacity == 0 ? 16 : m_capacity; | │ │ │ │ │ | | │ │ │ │ │ -| COMPLETE_ASYNC("torrent::on_peer_name_lookup"); | │ │ │ │ │ -| | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| if (e && should_log()) | │ │ │ │ │ -| debug_log("peer name lookup error: %s", e.message().c_str()); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| if (e || m_abort || host_list.empty() || m_ses.is_aborted()) return; | │ │ │ │ │ -| | │ │ │ │ │ -|tcp::endpoint host(host_list.front(), std::uint16_t(port)); | │ │ │ │ │ -| | │ │ │ │ │ -| if (m_ip_filter && m_ip_filter->access(host.address()) & ip_filter::blocked) | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| if (should_log()) | │ │ │ │ │ -| { | │ │ │ │ │ -| debug_log("blocked ip from tracker: %s", host.address().to_string().c_str()); | │ │ │ │ │ -| } | │ │ │ │ │ -|#endif | │ │ │ │ │ -| if (m_ses.alerts().should_post()) | │ │ │ │ │ -| m_ses.alerts().emplace_alert(get_handle() | │ │ │ │ │ -| , host, peer_blocked_alert::ip_filter); | │ │ │ │ │ -| return; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| if (add_peer(host, peer_info::tracker, v == protocol_version::V2 ? pex_lt_v2 : pex_flags_t(0))) | │ │ │ │ │ -| { | │ │ │ │ │ -| state_updated(); | │ │ │ │ │ -| | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| if (should_log()) | │ │ │ │ │ -| { | │ │ │ │ │ -| debug_log("name-lookup add_peer() [ %s ] connect-candidates: %d" | │ │ │ │ │ -| , host.address().to_string().c_str() | │ │ │ │ │ -| , m_peer_list ? m_peer_list->num_connect_candidates() : -1); | │ │ │ │ │ -| } | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| update_want_peers(); | │ │ │ │ │ -|_ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_4_5_8_1_ _ _ _ _ _ _ _|_o_n_l_y_ _d_o_ _t_h_i_s_ _i_f_ _t_h_e_ _p_i_e_c_e_ _s_i_z_e_ _>_ _1_ _b_l_o_c_k_s_ _T_h_i_s_ _i_s_ _a_ _v_2_ _t_o_r_r_e_n_t_ _s_o_ _w_e_ _c_a_n_ _r_e_q_u_e_s_t_ _g_e_t_ _b_l_o_c_k_ _l_e_v_e_l_ _h_a_s_h_e_s_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** oonnllyy ddoo tthhiiss iiff tthhee ppiieeccee ssiizzee >> 11 bblloocckkss TThhiiss iiss aa vv22 ttoorrrreenntt ssoo wwee ccaann rreeqquueesstt ggeett bblloocckk lleevveell hhaasshheess.. ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::44558811 ****** | │ │ │ │ │ -|{ | │ │ │ │ │ -| std::set ret; | │ │ │ │ │ -| if (!blocks.empty() && !downloaders.empty()) | │ │ │ │ │ -| { | │ │ │ │ │ -| for (auto const b : blocks) ret.insert(downloaders[std::size_t(b)]); | │ │ │ │ │ -| } | │ │ │ │ │ -| else | │ │ │ │ │ -| { | │ │ │ │ │ -| std::copy(downloaders.begin(), downloaders.end(), std::inserter(ret, ret.begin())); | │ │ │ │ │ -| } | │ │ │ │ │ -| return ret; | │ │ │ │ │ -| }(); | │ │ │ │ │ -| | │ │ │ │ │ -| // if this piece wasn't downloaded from peers, we just found it on disk. | │ │ │ │ │ -| // In that case, we should just consider it as "not-have" and there's no | │ │ │ │ │ -| // need to try to get higher fidelity hashes (yet) | │ │ │ │ │ -| bool const found_on_disk = peers.size() == 1 && peers.count(nullptr); | │ │ │ │ │ -| | │ │ │ │ │ -| if (!torrent_file().info_hashes().has_v1() && blocks.empty() && !found_on_disk) | │ │ │ │ │ -| { | │ │ │ │ │ -|verify_block_hashes(index); | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -| // the below code is penalizing peers that sent use bad data. | │ │ │ │ │ -| // increase the total amount of failed bytes | │ │ │ │ │ -| if (!found_on_disk) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (blocks.empty()) | │ │ │ │ │ -| add_failed_bytes(m_torrent_file->piece_size(index)); | │ │ │ │ │ -| else | │ │ │ │ │ -| add_failed_bytes(static_cast(blocks.size()) * default_block_size); | │ │ │ │ │ -| | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_EXTENSIONS | │ │ │ │ │ -| for (auto& ext : m_extensions) | │ │ │ │ │ -| { | │ │ │ │ │ -| ext->on_piece_failed(index); | │ │ │ │ │ -| } | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| // did we receive this piece from a single peer? | │ │ │ │ │ -| // if we know exactly which blocks failed the hash, we can also be certain | │ │ │ │ │ -| // that all peers in the list sent us bad data | │ │ │ │ │ -| bool const known_bad_peer = (!found_on_disk && peers.size() == 1) || !blocks.empty(); | │ │ │ │ │ -| | │ │ │ │ │ -| penalize_peers(peers, index, known_bad_peer); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // If m_storage isn't set here, it means we're shutting down | │ │ │ │ │ -| if (m_storage) | │ │ │ │ │ -| { | │ │ │ │ │ -|_ _ _ _/_/_ _i_t_ _d_o_e_s_n_'_t_ _m_a_k_e_ _m_u_c_h_ _s_e_n_s_e_ _t_o_ _f_a_i_l_ _t_o_ _h_a_s_h_ _a_ _p_i_e_c_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_7_5_2_5_ _ _ _ _ _ _ _|_c_o_m_e_ _u_p_ _w_i_t_h_ _a_ _b_e_t_t_e_r_ _w_a_y_ _o_f_ _d_o_i_n_g_ _t_h_i_s_,_ _i_n_s_t_e_a_d_ _o_f_ _a_n_ _i_m_m_e_d_i_a_t_e_l_y_ _i_n_v_o_k_e_d_ _l_a_m_b_d_a_ _e_x_p_r_e_s_s_i_o_n_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ccoommee uupp wwiitthh aa bbeetttteerr wwaayy ooff ddooiinngg tthhiiss,, iinnsstteeaadd ooff aann iimmmmeeddiiaatteellyy iinnvvookkeedd llaammbbddaa eexxpprreessssiioonn.. ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::77552255 ****** | │ │ │ │ │ -||| peerinfo->confirmed_supports_utp)) | │ │ │ │ │ -| { | │ │ │ │ │ -| sm = m_ses.utp_socket_manager(); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // don't make a TCP connection if it's disabled | │ │ │ │ │ -| if (sm == nullptr && !settings().get_bool(settings_pack::enable_outgoing_tcp)) | │ │ │ │ │ -| { | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| if (should_log()) | │ │ │ │ │ -| { | │ │ │ │ │ -| debug_log("discarding peer \"%s\": TCP connections disabled " | │ │ │ │ │ -| "[ supports-utp: %d ]", peerinfo->to_string().c_str() | │ │ │ │ │ -| , peerinfo->supports_utp); | │ │ │ │ │ -| } | │ │ │ │ │ -|#endif | │ │ │ │ │ -| return false; | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|aux::socket_type s = [&] { | │ │ │ │ │ -| | │ │ │ │ │ -|#if TORRENT_USE_I2P | │ │ │ │ │ -| if (peerinfo->is_i2p_addr) | │ │ │ │ │ -| { | │ │ │ │ │ -| // It's not entirely obvious why this peer connection is not marked as | │ │ │ │ │ -| // one. The main feature of a peer connection is that whether or not we | │ │ │ │ │ -| // proxy it is configurable. When we use i2p, we want to always prox | │ │ │ │ │ -| // everything via i2p. | │ │ │ │ │ -| | │ │ │ │ │ -| aux::proxy_settings proxy; | │ │ │ │ │ -| proxy.hostname = settings().get_str(settings_pack::i2p_hostname); | │ │ │ │ │ -| proxy.port = std::uint16_t(settings().get_int(settings_pack::i2p_port)); | │ │ │ │ │ -| proxy.type = settings_pack::i2p_proxy; | │ │ │ │ │ -| | │ │ │ │ │ -| aux::socket_type ret = instantiate_connection(m_ses.get_context() | │ │ │ │ │ -| , proxy, nullptr, nullptr, false, false); | │ │ │ │ │ -| i2p_stream& str = boost::get(ret); | │ │ │ │ │ -| str.set_local_i2p_endpoint(m_ses.local_i2p_endpoint()); | │ │ │ │ │ -| str.set_destination(static_cast(peerinfo)->dest()); | │ │ │ │ │ -| str.set_command(i2p_stream::cmd_connect); | │ │ │ │ │ -| str.set_session_id(m_ses.i2p_session()); | │ │ │ │ │ -| return ret; | │ │ │ │ │ -| } | │ │ │ │ │ -| else | │ │ │ │ │ -|#endif | │ │ │ │ │ -| { | │ │ │ │ │ -| void* userdata = nullptr; | │ │ │ │ │ -|#ifdef TORRENT_SSL_PEERS | │ │ │ │ │ -| if (is_ssl_torrent()) | │ │ │ │ │ -|_ _ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_9_1_1_8_ _ _ _ _ _ _ _|_p_e_r_h_a_p_s_ _0_ _s_h_o_u_l_d_ _a_c_t_u_a_l_l_y_ _m_e_a_n_ _0_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ppeerrhhaappss 00 sshhoouulldd aaccttuuaallllyy mmeeaann 00 ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::99111188 ****** | │ │ │ │ │ -|// finished torrents may not change their queue positions, as it's set to | │ │ │ │ │ -| // -1 | │ │ │ │ │ -| if ((m_abort || is_finished()) && p != no_pos) return; | │ │ │ │ │ -| | │ │ │ │ │ -| TORRENT_ASSERT((p == no_pos) == is_finished() | │ │ │ │ │ -| || (!m_auto_managed && p == no_pos) | │ │ │ │ │ -| || (m_abort && p == no_pos) | │ │ │ │ │ -| || (!m_added && p == no_pos)); | │ │ │ │ │ -| if (p == m_sequence_number) return; | │ │ │ │ │ -| | │ │ │ │ │ -| TORRENT_ASSERT(p >= no_pos); | │ │ │ │ │ -| | │ │ │ │ │ -| state_updated(); | │ │ │ │ │ -| | │ │ │ │ │ -| m_ses.set_queue_position(this, p); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void torrent::set_max_uploads(int limit, bool const state_update) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -|if (limit <= 0) limit = (1 << 24) - 1; | │ │ │ │ │ -|if (int(m_max_uploads) == limit) return; | │ │ │ │ │ -| if (state_update) state_updated(); | │ │ │ │ │ -| m_max_uploads = aux::numeric_cast(limit); | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| if (should_log() && state_update) | │ │ │ │ │ -| debug_log("*** set-max-uploads: %d", m_max_uploads); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| if (state_update) | │ │ │ │ │ -| set_need_save_resume(torrent_handle::if_config_changed); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void torrent::set_max_connections(int limit, bool const state_update) | │ │ │ │ │ -| { | │ │ │ │ │ -|_ _ _T_O_R_R_E_N_T___A_S_S_E_R_T_(_i_s___s_i_n_g_l_e___t_h_r_e_a_d_(_)_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_9_1_3_5_ _ _ _ _ _ _ _|_p_e_r_h_a_p_s_ _0_ _s_h_o_u_l_d_ _a_c_t_u_a_l_l_y_ _m_e_a_n_ _0_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ppeerrhhaappss 00 sshhoouulldd aaccttuuaallllyy mmeeaann 00 ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::99113355 ****** | │ │ │ │ │ -| void torrent::set_max_uploads(int limit, bool const state_update) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -| if (limit <= 0) limit = (1 << 24) - 1; | │ │ │ │ │ -| if (int(m_max_uploads) == limit) return; | │ │ │ │ │ -| if (state_update) state_updated(); | │ │ │ │ │ -| m_max_uploads = aux::numeric_cast(limit); | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| if (should_log() && state_update) | │ │ │ │ │ -| debug_log("*** set-max-uploads: %d", m_max_uploads); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| if (state_update) | │ │ │ │ │ -| set_need_save_resume(torrent_handle::if_config_changed); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void torrent::set_max_connections(int limit, bool const state_update) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -|if (limit <= 0) limit = (1 << 24) - 1; | │ │ │ │ │ -|if (int(m_max_connections) == limit) return; | │ │ │ │ │ -| if (state_update) state_updated(); | │ │ │ │ │ -| m_max_connections = aux::numeric_cast(limit); | │ │ │ │ │ -| update_want_peers(); | │ │ │ │ │ +| while (new_size < size) | │ │ │ │ │ +| new_size <<= 1; | │ │ │ │ │ | | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| if (should_log() && state_update) | │ │ │ │ │ -| debug_log("*** set-max-connections: %d", m_max_connections); | │ │ │ │ │ -|#endif | │ │ │ │ │ +| aux::unique_ptr new_storage(new packet_ptr[new_size]); | │ │ │ │ │ | | │ │ │ │ │ -| if (num_peers() > int(m_max_connections)) | │ │ │ │ │ -| { | │ │ │ │ │ -| disconnect_peers(num_peers() - m_max_connections | │ │ │ │ │ -| , errors::too_many_connections); | │ │ │ │ │ -| } | │ │ │ │ │ +| for (index_type i = m_first; i < (m_first + m_capacity); ++i) | │ │ │ │ │ +| new_storage[i & (new_size - 1)] = std::move(m_storage[i & (m_capacity - 1)]); | │ │ │ │ │ | | │ │ │ │ │ -| if (state_update) | │ │ │ │ │ -| set_need_save_resume(torrent_handle::if_config_changed); | │ │ │ │ │ +| m_storage = std::move(new_storage); | │ │ │ │ │ +| m_capacity = new_size; | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| void torrent::set_upload_limit(int const limit) | │ │ │ │ │ +| packet_ptr packet_buffer::remove(index_type idx) | │ │ │ │ │ | { | │ │ │ │ │ -| set_limit_impl(limit, peer_connection::upload_channel); | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| debug_log("*** set-upload-limit: %d", limit); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void torrent::set_download_limit(int const limit) | │ │ │ │ │ -|_ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t_._c_p_p_:_1_1_0_6_1_ _ _ _ _ _ _|_i_n_s_t_e_a_d_ _o_f_ _r_e_s_o_r_t_i_n_g_ _t_h_e_ _w_h_o_l_e_ _l_i_s_t_,_ _i_n_s_e_r_t_ _t_h_e_ _p_e_e_r_s_ _d_i_r_e_c_t_l_y_ _i_n_t_o_ _t_h_e_ _r_i_g_h_t_ _p_l_a_c_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iinnsstteeaadd ooff rreessoorrttiinngg tthhee wwhhoollee lliisstt,, iinnsseerrtt tthhee ppeeeerrss ddiirreeccttllyy iinnttoo tthhee rriigghhtt ppllaaccee ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt..ccpppp::1111006611 ****** | │ │ │ │ │ -|std::printf("timed out [average-piece-time: %d ms ]\n" | │ │ │ │ │ -| , m_average_piece_time); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| // pick all blocks for this piece. the peers list is kept up to date | │ │ │ │ │ -| // and sorted. when we issue a request to a peer, its download queue | │ │ │ │ │ -| // time will increase and it may need to be bumped in the peers list, | │ │ │ │ │ -| // since it's ordered by download queue time | │ │ │ │ │ -| pick_time_critical_block(peers, ignore_peers | │ │ │ │ │ -| , peers_with_requests | │ │ │ │ │ -| , pi, &i, m_picker.get() | │ │ │ │ │ -| , blocks_in_piece, timed_out); | │ │ │ │ │ -| | │ │ │ │ │ -| // put back the peers we ignored into the peer list for the next piece | │ │ │ │ │ -| if (!ignore_peers.empty()) | │ │ │ │ │ -| { | │ │ │ │ │ -| peers.insert(peers.begin(), ignore_peers.begin(), ignore_peers.end()); | │ │ │ │ │ -| ignore_peers.clear(); | │ │ │ │ │ +| INVARIANT_CHECK; | │ │ │ │ │ +|if (idx >= m_first + m_capacity) | │ │ │ │ │ +|return packet_ptr(); | │ │ │ │ │ | | │ │ │ │ │ -|std::sort(peers.begin(), peers.end() | │ │ │ │ │ -|, [] (peer_connection const* lhs, peer_connection const* rhs) | │ │ │ │ │ -| { return lhs->download_queue_time(16*1024) < rhs->download_queue_time(16*1024); }); | │ │ │ │ │ -| } | │ │ │ │ │ +| if (compare_less_wrap(idx, m_first, 0xffff)) | │ │ │ │ │ +| return packet_ptr(); | │ │ │ │ │ | | │ │ │ │ │ -| // if this peer's download time exceeds 2 seconds, we're done. | │ │ │ │ │ -| // We don't want to build unreasonably long request queues | │ │ │ │ │ -| if (!peers.empty() && peers[0]->download_queue_time() > milliseconds(2000)) | │ │ │ │ │ -| break; | │ │ │ │ │ -| } | │ │ │ │ │ +| std::size_t const mask = m_capacity - 1; | │ │ │ │ │ +| packet_ptr old_value = std::move(m_storage[idx & mask]); | │ │ │ │ │ +| m_storage[idx & mask].reset(); | │ │ │ │ │ | | │ │ │ │ │ -| // commit all the time critical requests | │ │ │ │ │ -| for (auto p : peers_with_requests) | │ │ │ │ │ +| if (old_value) | │ │ │ │ │ | { | │ │ │ │ │ -| p->send_block_requests(); | │ │ │ │ │ +| --m_size; | │ │ │ │ │ +| if (m_size == 0) m_last = m_first; | │ │ │ │ │ | } | │ │ │ │ │ -| } | │ │ │ │ │ -|#endif // TORRENT_DISABLE_STREAMING | │ │ │ │ │ | | │ │ │ │ │ -| std::set torrent::web_seeds(web_seed_entry::type_t const type) const | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ -| std::set ret; | │ │ │ │ │ -| for (auto const& s : m_web_seeds) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (s.peer_info.banned) continue; | │ │ │ │ │ -| if (s.removed) continue; | │ │ │ │ │ -| if (s.type != type) continue; | │ │ │ │ │ -| ret.insert(s.url); | │ │ │ │ │ -| } | │ │ │ │ │ -|_ _ _r_e_t_u_r_n_ _r_e_t_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_s_e_s_s_i_o_n_._c_p_p_:_5_4_0_ _ _ _ _ _ _ _ _|_I_n_ _C_+_+_1_7_._ _u_s_e_ _i_f_ _c_o_n_s_t_e_x_p_r_ _i_n_s_t_e_a_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** IInn CC++++1177.. uussee iiff ccoonnsstteexxpprr iinnsstteeaadd ********** | │ │ │ │ │ -|****** ....//ssrrcc//sseessssiioonn..ccpppp::554400 ****** | │ │ │ │ │ -|{} | │ │ │ │ │ -| session_proxy::session_proxy(session_proxy const&) = default; | │ │ │ │ │ -| session_proxy& session_proxy::operator=(session_proxy const&) & = default; | │ │ │ │ │ -| session_proxy::session_proxy(session_proxy&&) noexcept = default; | │ │ │ │ │ -| session_proxy& session_proxy::operator=(session_proxy&&) & noexcept = default; | │ │ │ │ │ -| session_proxy::~session_proxy() | │ │ │ │ │ -| { | │ │ │ │ │ -| if (m_thread && m_thread.use_count() == 1) | │ │ │ │ │ +| if (idx == m_first && m_size != 0) | │ │ │ │ │ | { | │ │ │ │ │ -|#if defined TORRENT_ASIO_DEBUGGING | │ │ │ │ │ -| wait_for_asio_handlers(); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| m_thread->join(); | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| TORRENT_EXPORT std::unique_ptr default_disk_io_constructor( | │ │ │ │ │ -| io_context& ios, settings_interface const& sett, counters& cnt) | │ │ │ │ │ -| { | │ │ │ │ │ -|#if TORRENT_HAVE_MMAP || TORRENT_HAVE_MAP_VIEW_OF_FILE | │ │ │ │ │ -|#include "libtorrent/aux_/disable_deprecation_warnings_push.hpp" | │ │ │ │ │ -|if (sizeof(void*) == 8) | │ │ │ │ │ -| return mmap_disk_io_constructor(ios, sett, cnt); | │ │ │ │ │ -| else | │ │ │ │ │ -| return posix_disk_io_constructor(ios, sett, cnt); | │ │ │ │ │ -|#include "libtorrent/aux_/disable_warnings_pop.hpp" | │ │ │ │ │ -|#else | │ │ │ │ │ -| return posix_disk_io_constructor(ios, sett, cnt); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|_}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_c_p_u_i_d_._c_p_p_:_1_3_1_ _ _ _ _ _ _ _ _ _ _|_e_n_a_b_l_e_ _w_h_e_n_ _a_a_r_c_h_6_4_ _i_s_ _r_e_a_l_l_y_ _t_e_s_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** eennaabbllee wwhheenn aaaarrcchh6644 iiss rreeaallllyy tteesstteedd ********** | │ │ │ │ │ -|****** ....//ssrrcc//ccppuuiidd..ccpppp::113311 ****** | │ │ │ │ │ -|bool supports_mmx() noexcept | │ │ │ │ │ -| { | │ │ │ │ │ -|#if TORRENT_HAS_SSE | │ │ │ │ │ -| std::uint32_t cpui[4] = {0}; | │ │ │ │ │ -| cpuid(cpui, 1); | │ │ │ │ │ -| return (cpui[2] & (1 << 23)) != 0; | │ │ │ │ │ -|#else | │ │ │ │ │ -| return false; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| bool supports_arm_neon() noexcept | │ │ │ │ │ -| { | │ │ │ │ │ -|#if TORRENT_HAS_ARM_NEON && TORRENT_HAS_AUXV | │ │ │ │ │ -|#if defined __arm__ | │ │ │ │ │ -| //return (getauxval(AT_HWCAP) & HWCAP_NEON); | │ │ │ │ │ -| return (helper_getauxval(16) & (1 << 12)); | │ │ │ │ │ -|#elif defined __aarch64__ | │ │ │ │ │ -| //return (getauxval(AT_HWCAP) & HWCAP_ASIMD); | │ │ │ │ │ -| //return (getauxval(16) & (1 << 1)); | │ │ │ │ │ -|return false; | │ │ │ │ │ -|#endif | │ │ │ │ │ -|#else | │ │ │ │ │ -| return false; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| bool supports_arm_crc32c() noexcept | │ │ │ │ │ -| { | │ │ │ │ │ -|#if TORRENT_HAS_ARM_CRC32 && TORRENT_HAS_AUXV | │ │ │ │ │ -|#if defined TORRENT_FORCE_ARM_CRC32 | │ │ │ │ │ -| return true; | │ │ │ │ │ -|#elif defined __arm__ | │ │ │ │ │ -| //return (getauxval(AT_HWCAP2) & HWCAP2_CRC32); | │ │ │ │ │ -| return (helper_getauxval(26) & (1 << 4)); | │ │ │ │ │ -|#elif defined __aarch64__ | │ │ │ │ │ -| //return (getauxval(AT_HWCAP) & HWCAP_CRC32); | │ │ │ │ │ -| return (helper_getauxval(16) & (1 << 7)); | │ │ │ │ │ -|#endif | │ │ │ │ │ -|#else | │ │ │ │ │ -| return false; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|} // anonymous namespace | │ │ │ │ │ -| | │ │ │ │ │ -| bool const sse42_support = supports_sse42(); | │ │ │ │ │ -| bool const mmx_support = supports_mmx(); | │ │ │ │ │ -| bool const arm_neon_support = supports_arm_neon(); | │ │ │ │ │ -| bool const arm_crc32c_support = supports_arm_crc32c(); | │ │ │ │ │ -|_}_ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_c_h_o_k_e_r_._c_p_p_:_2_5_8_ _ _ _ _ _ _ _ _ _|_m_a_k_e_ _c_o_n_f_i_g_u_r_a_b_l_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** mmaakkee ccoonnffiigguurraabbllee ********** | │ │ │ │ │ -|****** ....//ssrrcc//cchhookkeerr..ccpppp::225588 ****** | │ │ │ │ │ -|// first reset the number of unchoke slots, because we'll calculate | │ │ │ │ │ -| // it purely based on the current state of our peers. | │ │ │ │ │ -| upload_slots = 0; | │ │ │ │ │ -| | │ │ │ │ │ -| int rate_threshold = sett.get_int(settings_pack::rate_choker_initial_threshold); | │ │ │ │ │ -| | │ │ │ │ │ -| std::sort(peers.begin(), peers.end() | │ │ │ │ │ -| , [](peer_connection const* lhs, peer_connection const* rhs) | │ │ │ │ │ -| { return upload_rate_compare(lhs, rhs); }); | │ │ │ │ │ -| | │ │ │ │ │ -| for (auto const* p : peers) | │ │ │ │ │ -| { | │ │ │ │ │ -| int const rate = int(p->uploaded_in_last_round() | │ │ │ │ │ -| * 1000 / total_milliseconds(unchoke_interval)); | │ │ │ │ │ -| | │ │ │ │ │ -| // always have at least 1 unchoke slot | │ │ │ │ │ -| if (rate < rate_threshold) break; | │ │ │ │ │ -| | │ │ │ │ │ -| ++upload_slots; | │ │ │ │ │ -| | │ │ │ │ │ -|rate_threshold += 2048; | │ │ │ │ │ -|} | │ │ │ │ │ -| ++upload_slots; | │ │ │ │ │ +| ++m_first; | │ │ │ │ │ +| for (index_type i = 0; i < m_capacity; ++i, ++m_first) | │ │ │ │ │ +| if (m_storage[m_first & mask]) break; | │ │ │ │ │ +| m_first &= 0xffff; | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| // sorts the peers that are eligible for unchoke by download rate and | │ │ │ │ │ -| // secondary by total upload. The reason for this is, if all torrents are | │ │ │ │ │ -| // being seeded, the download rate will be 0, and the peers we have sent | │ │ │ │ │ -| // the least to should be unchoked | │ │ │ │ │ -| | │ │ │ │ │ -| // we use partial sort here, because we only care about the top | │ │ │ │ │ -| // upload_slots peers. | │ │ │ │ │ -| | │ │ │ │ │ -| int const slots = std::min(upload_slots, int(peers.size())); | │ │ │ │ │ -| | │ │ │ │ │ -| if (sett.get_int(settings_pack::seed_choking_algorithm) | │ │ │ │ │ -| == settings_pack::round_robin) | │ │ │ │ │ -| { | │ │ │ │ │ -| int const pieces = sett.get_int(settings_pack::seeding_piece_quota); | │ │ │ │ │ -| | │ │ │ │ │ -| std::nth_element(peers.begin(), peers.begin() | │ │ │ │ │ -| + slots, peers.end() | │ │ │ │ │ -| , [pieces](peer_connection const* lhs, peer_connection const* rhs) | │ │ │ │ │ -| { return unchoke_compare_rr(lhs, rhs, pieces); }); | │ │ │ │ │ -| } | │ │ │ │ │ -| else if (sett.get_int(settings_pack::seed_choking_algorithm) | │ │ │ │ │ -| == settings_pack::fastest_upload) | │ │ │ │ │ +| if (((idx + 1) & 0xffff) == m_last && m_size != 0) | │ │ │ │ │ | { | │ │ │ │ │ -| std::nth_element(peers.begin(), peers.begin() | │ │ │ │ │ -| + slots, peers.end() | │ │ │ │ │ -|_ _ _ _ _,_ _[_]_(_p_e_e_r___c_o_n_n_e_c_t_i_o_n_ _c_o_n_s_t_*_ _l_h_s_,_ _p_e_e_r___c_o_n_n_e_c_t_i_o_n_ _c_o_n_s_t_*_ _r_h_s_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| --m_last; | │ │ │ │ │ +| for (index_type i = 0; i < m_capacity; ++i, --m_last) | │ │ │ │ │ +| if (m_storage[m_last & mask]) break; | │ │ │ │ │ +| ++m_last; | │ │ │ │ │ +|_ _ _ _m___l_a_s_t_ _&_=_ _0_x_f_f_f_f_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_m_e_r_k_l_e___t_r_e_e_._c_p_p_:_1_1_0_ _ _ _ _|_i_n_ _C_+_+_2_0_,_ _u_s_e_ _s_t_d_:_:_i_d_e_n_t_i_t_y_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** iinn CC++++2200,, uussee ssttdd::::iiddeennttiittyy ********** | │ │ │ │ │ |****** ....//ssrrcc//mmeerrkkllee__ttrreeee..ccpppp::111100 ****** | │ │ │ │ │ |allocate_full(); | │ │ │ │ │ | | │ │ │ │ │ | merkle_validate_copy(t, m_tree, root(), m_block_verified); | │ │ │ │ │ | | │ │ │ │ │ @@ -9859,101 +8760,1159 @@ │ │ │ │ │ | | │ │ │ │ │ | int merkle_tree::block_layer_start() const | │ │ │ │ │ | { | │ │ │ │ │ | int const num_leafs = merkle_num_leafs(m_num_blocks); | │ │ │ │ │ | TORRENT_ASSERT(num_leafs > 0); | │ │ │ │ │ | return merkle_first_leaf(num_leafs); | │ │ │ │ │ |_ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_e___c_r_y_p_t_o_._c_p_p_:_6_0_ _ _ _ _ _ _ _|_i_t_ _w_o_u_l_d_ _b_e_ _n_i_c_e_ _t_o_ _g_e_t_ _t_h_e_ _l_i_t_e_r_a_l_ _w_o_r_k_i_n_g_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iitt wwoouulldd bbee nniiccee ttoo ggeett tthhee lliitteerraall wwoorrkkiinngg ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppee__ccrryyppttoo..ccpppp::6600 ****** | │ │ │ │ │ -|#include | │ │ │ │ │ -|#include | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/ |introduce a web-seed default class which has a low download priority | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_w_e_b___c_o_n_n_e_c_t_i_o_n___b_a_s_e_._c_p_p_:_7_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iinnttrroodduuccee aa wweebb--sseeeedd ddeeffaauulltt ccllaassss wwhhiicchh hhaass aa llooww ddoowwnnllooaadd pprriioorriittyy ********** | │ │ │ │ │ +|****** ....//ssrrcc//wweebb__ccoonnnneeccttiioonn__bbaassee..ccpppp::7722 ****** | │ │ │ │ │ +|: peer_connection(pack) | │ │ │ │ │ +| , m_first_request(true) | │ │ │ │ │ +| , m_ssl(false) | │ │ │ │ │ +| , m_external_auth(web.auth) | │ │ │ │ │ +| , m_extra_headers(web.extra_headers) | │ │ │ │ │ +| , m_parser(http_parser::dont_parse_chunks) | │ │ │ │ │ +| , m_body_start(0) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(&web.peer_info == pack.peerinfo); | │ │ │ │ │ +| // when going through a proxy, we don't necessarily have an endpoint here, | │ │ │ │ │ +| // since the proxy might be resolving the hostname, not us | │ │ │ │ │ +| TORRENT_ASSERT(web.endpoints.empty() || web.endpoints.front() == pack.endp); | │ │ │ │ │ | | │ │ │ │ │ -|#include "libtorrent/aux_/disable_warnings_push.hpp" | │ │ │ │ │ +| INVARIANT_CHECK; | │ │ │ │ │ | | │ │ │ │ │ -|#include | │ │ │ │ │ -|#include | │ │ │ │ │ +| TORRENT_ASSERT(is_outgoing()); | │ │ │ │ │ | | │ │ │ │ │ -|#include "libtorrent/aux_/disable_warnings_pop.hpp" | │ │ │ │ │ +| TORRENT_ASSERT(!m_torrent.lock()->is_upload_only()); | │ │ │ │ │ | | │ │ │ │ │ -|#include "libtorrent/random.hpp" | │ │ │ │ │ -|#include "libtorrent/aux_/alloca.hpp" | │ │ │ │ │ -|#include "libtorrent/pe_crypto.hpp" | │ │ │ │ │ -|#include "libtorrent/hasher.hpp" | │ │ │ │ │ +| // we only want left-over bandwidth | │ │ │ │ │ | | │ │ │ │ │ -|namespace libtorrent { | │ │ │ │ │ +|std::string protocol; | │ │ │ │ │ +| error_code ec; | │ │ │ │ │ +| std::tie(protocol, m_basic_auth, m_host, m_port, m_path) | │ │ │ │ │ +| = parse_url_components(web.url, ec); | │ │ │ │ │ +| TORRENT_ASSERT(!ec); | │ │ │ │ │ | | │ │ │ │ │ -| namespace mp = boost::multiprecision; | │ │ │ │ │ +| if (m_port == -1 && protocol == "http") | │ │ │ │ │ +| m_port = 80; | │ │ │ │ │ | | │ │ │ │ │ -| namespace { | │ │ │ │ │ -|key_t const dh_prime | │ │ │ │ │ -|("0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A63|36210000000000090563"); │ │ │ │ │ +|#if TORRENT_USE_SSL | │ │ │ │ │ +| if (protocol == "https") | │ │ │ │ │ +| { | │ │ │ │ │ +| m_ssl = true; | │ │ │ │ │ +| if (m_port == -1) m_port = 443; | │ │ │ │ │ +| } | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| if (!m_basic_auth.empty()) | │ │ │ │ │ +| m_basic_auth = base64encode(m_basic_auth); | │ │ │ │ │ +| | │ │ │ │ │ +| m_server_string = m_host; | │ │ │ │ │ +| aux::verify_encoding(m_server_string); | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| std::array export_key(key_t const& k) | │ │ │ │ │ +| int web_connection_base::timeout() const | │ │ │ │ │ | { | │ │ │ │ │ -| std::array ret; | │ │ │ │ │ -| auto* begin = reinterpret_cast(ret.data()); | │ │ │ │ │ -|_ _ _s_t_d_:_:_u_i_n_t_8___t_*_ _e_n_d_ _=_ _m_p_:_:_e_x_p_o_r_t___b_i_t_s_(_k_,_ _b_e_g_i_n_,_ _8_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_e___c_r_y_p_t_o_._c_p_p_:_7_1_ _ _ _ _ _ _ _|_i_t_ _w_o_u_l_d_ _b_e_ _n_i_c_e_ _t_o_ _b_e_ _a_b_l_e_ _t_o_ _e_x_p_o_r_t_ _t_o_ _a_ _f_i_x_e_d_ _w_i_d_t_h_ _f_i_e_l_d_,_ _s_o_ _w_e_ _w_o_u_l_d_n_'_t_ _h_a_v_e_ _t_o_ _s_h_i_f_t_ _i_t_ _l_a_t_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iitt wwoouulldd bbee nniiccee ttoo bbee aabbllee ttoo eexxppoorrtt ttoo aa ffiixxeedd wwiiddtthh ffiieelldd,, ssoo wwee wwoouullddnn''tt hhaavvee ttoo sshhiifftt iitt llaatteerr ********** | │ │ │ │ │ -|****** ....//ssrrcc//ppee__ccrryyppttoo..ccpppp::7711 ****** | │ │ │ │ │ -|#include "libtorrent/random.hpp" | │ │ │ │ │ -|#include "libtorrent/aux_/alloca.hpp" | │ │ │ │ │ -|#include "libtorrent/pe_crypto.hpp" | │ │ │ │ │ -|#include "libtorrent/hasher.hpp" | │ │ │ │ │ +| // since this is a web seed, change the timeout | │ │ │ │ │ +| // according to the settings. | │ │ │ │ │ +| return m_settings.get_int(settings_pack::urlseed_timeout); | │ │ │ │ │ +|_ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_r_a_n_d_o_m_._c_p_p_:_1_4_1_ _ _ _ _ _ _ _ _ _|_i_m_p_r_o_v_e_ _c_a_l_l_i_n_g_ _R_A_N_D___b_y_t_e_s_ _m_u_l_t_i_p_l_e_ _t_i_m_e_s_,_ _u_s_i_n_g_ _f_a_l_l_b_a_c_k_ _f_o_r_ _n_o_w_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iimmpprroovvee ccaalllliinngg RRAANNDD__bbyytteess mmuullttiippllee ttiimmeess,, uussiinngg ffaallllbbaacckk ffoorr nnooww ********** | │ │ │ │ │ +|****** ....//ssrrcc//rraannddoomm..ccpppp::114411 ****** | │ │ │ │ │ +|#else | │ │ │ │ │ +| std::generate(buffer.begin(), buffer.end(), [] { return char(random(0xff)); }); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|namespace libtorrent { | │ │ │ │ │ +| void crypto_random_bytes(span buffer) | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifdef TORRENT_BUILD_SIMULATOR | │ │ │ │ │ +| // In the simulator we want deterministic random numbers | │ │ │ │ │ +| std::generate(buffer.begin(), buffer.end(), [] { return char(random(0xff)); }); | │ │ │ │ │ +|#elif TORRENT_USE_CNG | │ │ │ │ │ +| aux::cng_gen_random(buffer); | │ │ │ │ │ +|#elif TORRENT_USE_CRYPTOAPI | │ │ │ │ │ +| // windows | │ │ │ │ │ +| aux::crypt_gen_random(buffer); | │ │ │ │ │ +|#elif defined TORRENT_USE_LIBCRYPTO && !defined TORRENT_USE_WOLFSSL | │ │ │ │ │ +|// wolfSSL uses wc_RNG_GenerateBlock as the internal function for the | │ │ │ │ │ +|// openssl compatibility layer. This function API does not support | │ │ │ │ │ +|// an arbitrary buffer size (openssl does), it is limited by the | │ │ │ │ │ +|// constant RNG_MAX_BLOCK_LEN. | │ │ │ │ │ | | │ │ │ │ │ -| namespace mp = boost::multiprecision; | │ │ │ │ │ +|// openssl | │ │ │ │ │ +| int r = RAND_bytes(reinterpret_cast(buffer.data()) | │ │ │ │ │ +| , int(buffer.size())); | │ │ │ │ │ +| if (r != 1) aux::throw_ex(errors::no_entropy); | │ │ │ │ │ +|#elif TORRENT_USE_GETRANDOM | │ │ │ │ │ +| ssize_t const r = ::getrandom(buffer.data(), static_cast(buffer.size()), 0); | │ │ │ │ │ +| if (r == ssize_t(buffer.size())) return; | │ │ │ │ │ +| if (r == -1 && errno != ENOSYS) aux::throw_ex(error_code(errno, generic_category())); | │ │ │ │ │ +| static dev_random dev; | │ │ │ │ │ +| dev.read(buffer); | │ │ │ │ │ +|#elif TORRENT_USE_DEV_RANDOM | │ │ │ │ │ +| static dev_random dev; | │ │ │ │ │ +| dev.read(buffer); | │ │ │ │ │ +|#else | │ │ │ │ │ | | │ │ │ │ │ -| namespace { | │ │ │ │ │ -| key_t const dh_prime | │ │ │ │ │ -| | │ │ │ │ │ -|("0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A63|36210000000000090563"); │ │ │ │ │ +|#if TORRENT_BROKEN_RANDOM_DEVICE | │ │ │ │ │ +| // even pseudo random numbers rely on being able to seed the random | │ │ │ │ │ +| // generator | │ │ │ │ │ +|#error "no entropy source available" | │ │ │ │ │ +|#else | │ │ │ │ │ +|#ifdef TORRENT_I_WANT_INSECURE_RANDOM_NUMBERS | │ │ │ │ │ +| std::generate(buffer.begin(), buffer.end(), [] { return char(random(0xff)); }); | │ │ │ │ │ +|#else | │ │ │ │ │ +|#error "no secure entropy source available. If you really want insecure random numbers, define TORRENT_I_WANT_INSECURE_RANDOM_NUMBERS" | │ │ │ │ │ +|#endif | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ +|_}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/ |technically, this isn't supposed to happen, but it seems to sometimes. Some of the accounting is probably wrong in certain cases | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_h_t_t_p___s_e_e_d___c_o_n_n_e_c_t_i_o_n_._c_p_p_:_4_4_1_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tteecchhnniiccaallllyy,, tthhiiss iissnn''tt ssuuppppoosseedd ttoo hhaappppeenn,, bbuutt iitt sseeeemmss ttoo ssoommeettiimmeess.. SSoommee ooff tthhee aaccccoouunnttiinngg iiss pprroobbaabbllyy wwrroonngg iinn cceerrttaaiinn ccaasseess ********** | │ │ │ │ │ +|****** ....//ssrrcc//hhttttpp__sseeeedd__ccoonnnneeccttiioonn..ccpppp::444411 ****** | │ │ │ │ │ +|// cut out the chunk header from the receive buffer | │ │ │ │ │ +| TORRENT_ASSERT(m_chunk_pos + m_body_start < INT_MAX); | │ │ │ │ │ +| m_recv_buffer.cut(header_size, t->block_size() + 1024, aux::numeric_cast(m_chunk_pos + m_body_start)); | │ │ │ │ │ +| recv_buffer = m_recv_buffer.get(); | │ │ │ │ │ +| recv_buffer = recv_buffer.subspan(m_body_start); | │ │ │ │ │ +| m_chunk_pos += chunk_size; | │ │ │ │ │ +| if (chunk_size == 0) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(m_recv_buffer.get().size() < m_chunk_pos + m_body_start + 1 | │ │ │ │ │ +| || m_recv_buffer.get()[static_cast(m_chunk_pos + m_body_start)] == 'H' | │ │ │ │ │ +| || (m_parser.chunked_encoding() | │ │ │ │ │ +| && m_recv_buffer.get()[static_cast(m_chunk_pos + m_body_start)] == '\r')); | │ │ │ │ │ +| m_chunk_pos = -1; | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| int payload = int(bytes_transferred); | │ │ │ │ │ +| if (payload > m_response_left) payload = int(m_response_left); | │ │ │ │ │ +| if (payload > front_request.length) payload = front_request.length; | │ │ │ │ │ +|if (payload > outstanding_bytes()) payload = outstanding_bytes(); | │ │ │ │ │ +|received_bytes(payload, 0); | │ │ │ │ │ +| incoming_piece_fragment(payload); | │ │ │ │ │ +| m_response_left -= payload; | │ │ │ │ │ +| | │ │ │ │ │ +| if (m_parser.status_code() == 503) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (!m_parser.finished()) return; | │ │ │ │ │ +| | │ │ │ │ │ +| int retry_time = std::atoi(std::string(recv_buffer.begin(), recv_buffer.end()).c_str()); | │ │ │ │ │ +| if (retry_time <= 0) retry_time = 60; | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| peer_log(peer_log_alert::info, "CONNECT", "retrying in %d seconds", retry_time); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| received_bytes(0, int(bytes_transferred)); | │ │ │ │ │ +| // temporarily unavailable, retry later | │ │ │ │ │ +| t->retry_web_seed(this, seconds32(retry_time)); | │ │ │ │ │ +| disconnect(error_code(m_parser.status_code(), http_category()), operation_t::bittorrent, failure); | │ │ │ │ │ +| return; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| | │ │ │ │ │ +| // we only received the header, no data | │ │ │ │ │ +| if (recv_buffer.empty()) break; | │ │ │ │ │ +| | │ │ │ │ │ +| if (recv_buffer.size() < front_request.length) break; | │ │ │ │ │ +| | │ │ │ │ │ +| // if the response is chunked, we need to receive the last | │ │ │ │ │ +| // terminating chunk and the tail headers before we can proceed | │ │ │ │ │ +|_ _ _ _i_f_ _(_m___p_a_r_s_e_r_._c_h_u_n_k_e_d___e_n_c_o_d_i_n_g_(_)_ _&_&_ _m___c_h_u_n_k___p_o_s_ _>_=_ _0_)_ _b_r_e_a_k_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/_a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s_._c_p_p_:|pre C++17, GCC and msvc does not make std::string nothrow move assignable, which means no type containing a string will be nothrow | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_7_8_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_m_o_v_e_ _a_s_s_i_g_n_a_b_l_e_ _b_y_ _d_e_f_a_u_l_t_ _e_i_t_h_e_r_ _s_t_a_t_i_c___a_s_s_e_r_t_(_s_t_d_:_:_i_s___n_o_t_h_r_o_w___m_o_v_e___a_s_s_i_g_n_a_b_l_e_:_:_v_a_l_u_e_ _,_ _"_s_h_o_u_l_d_ _b_e_ _n_o_t_h_r_o_w_ _m_o_v_e_ _a_s_s_i_g_n_a_b_l_e_"_)_;_ _ _ _ _ _ | │ │ │ │ │ +|********** pprree CC++++1177,, GGCCCC aanndd mmssvvcc ddooeess nnoott mmaakkee ssttdd::::ssttrriinngg nnootthhrrooww mmoovvee aassssiiggnnaabbllee,, wwhhiicchh mmeeaannss nnoo ttyyppee ccoonnttaaiinniinngg aa ssttrriinngg wwiillll bbee nnootthhrrooww mmoovvee aassssiiggnnaabbllee bbyy ddeeffaauulltt eeiitthheerr | │ │ │ │ │ +|ssttaattiicc__aasssseerrtt((ssttdd::::iiss__nnootthhrrooww__mmoovvee__aassssiiggnnaabbllee::::vvaalluuee ,, ""sshhoouulldd bbee nnootthhrrooww mmoovvee aassssiiggnnaabbllee""));; ********** | │ │ │ │ │ +|****** ....//ssrrcc//aadddd__ttoorrrreenntt__ppaarraammss..ccpppp::7788 ****** | │ │ │ │ │ +|DECL_FLAG(sequential_download); | │ │ │ │ │ +| DECL_FLAG(pinned); | │ │ │ │ │ +| DECL_FLAG(stop_when_ready); | │ │ │ │ │ +| DECL_FLAG(override_trackers); | │ │ │ │ │ +| DECL_FLAG(override_web_seeds); | │ │ │ │ │ +| DECL_FLAG(need_save_resume); | │ │ │ │ │ +| DECL_FLAG(override_resume_data); | │ │ │ │ │ +| DECL_FLAG(merge_resume_trackers); | │ │ │ │ │ +| DECL_FLAG(use_resume_save_path); | │ │ │ │ │ +| DECL_FLAG(merge_resume_http_seeds); | │ │ │ │ │ +| DECL_FLAG(default_flags); | │ │ │ │ │ +|#undef DECL_FLAG | │ │ │ │ │ +|#endif // TORRENT_ABI_VERSION | │ │ │ │ │ +| | │ │ │ │ │ +| static_assert(std::is_nothrow_move_constructible::value | │ │ │ │ │ +| , "should be nothrow move constructible"); | │ │ │ │ │ +| | │ │ │ │ │ +| static_assert(std::is_nothrow_move_constructible::value | │ │ │ │ │ +| , "should be nothrow move constructible"); | │ │ │ │ │ +| | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/_a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s_._c_p_p_:|it would be nice if this was nothrow default constructible static_assert(std::is_nothrow_default_constructible::value , "should be | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_8_4_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_n_o_t_h_r_o_w_ _d_e_f_a_u_l_t_ _c_o_n_s_t_r_u_c_t_i_b_l_e_"_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iitt wwoouulldd bbee nniiccee iiff tthhiiss wwaass nnootthhrrooww ddeeffaauulltt ccoonnssttrruuccttiibbllee ssttaattiicc__aasssseerrtt((ssttdd::::iiss__nnootthhrrooww__ddeeffaauulltt__ccoonnssttrruuccttiibbllee::::vvaalluuee ,, ""sshhoouulldd bbee nnootthhrrooww ddeeffaauulltt ccoonnssttrruuccttiibbllee""));; **********| │ │ │ │ │ +|****** ....//ssrrcc//aadddd__ttoorrrreenntt__ppaarraammss..ccpppp::8844 ****** | │ │ │ │ │ +|DECL_FLAG(pinned); | │ │ │ │ │ +| DECL_FLAG(stop_when_ready); | │ │ │ │ │ +| DECL_FLAG(override_trackers); | │ │ │ │ │ +| DECL_FLAG(override_web_seeds); | │ │ │ │ │ +| DECL_FLAG(need_save_resume); | │ │ │ │ │ +| DECL_FLAG(override_resume_data); | │ │ │ │ │ +| DECL_FLAG(merge_resume_trackers); | │ │ │ │ │ +| DECL_FLAG(use_resume_save_path); | │ │ │ │ │ +| DECL_FLAG(merge_resume_http_seeds); | │ │ │ │ │ +| DECL_FLAG(default_flags); | │ │ │ │ │ +|#undef DECL_FLAG | │ │ │ │ │ +|#endif // TORRENT_ABI_VERSION | │ │ │ │ │ +| | │ │ │ │ │ +| static_assert(std::is_nothrow_move_constructible::value | │ │ │ │ │ +| , "should be nothrow move constructible"); | │ │ │ │ │ +| | │ │ │ │ │ +| static_assert(std::is_nothrow_move_constructible::value | │ │ │ │ │ +| , "should be nothrow move constructible"); | │ │ │ │ │ +| | │ │ │ │ │ +| | │ │ │ │ │ +| | │ │ │ │ │ +|namespace aux { | │ │ │ │ │ +| | │ │ │ │ │ +| // returns whether this add_torrent_params object has "resume-data", i.e. | │ │ │ │ │ +| // information about which pieces we have. | │ │ │ │ │ +| bool contains_resume_data(add_torrent_params const& atp) | │ │ │ │ │ +| { | │ │ │ │ │ +| return !atp.have_pieces.empty() | │ │ │ │ │ +| || (atp.flags & torrent_flags::seed_mode); | │ │ │ │ │ | } | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -| std::array export_key(key_t const& k) | │ │ │ │ │ +|_}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/_p_a_r_t___f_i_l_e_._c_p_p_:_3_0_0 |what do we do if someone is currently reading from the disk from this piece? does it matter? Since we won't actively erase the data | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_f_r_o_m_ _d_i_s_k_,_ _b_u_t_ _i_t_ _m_a_y_ _b_e_ _o_v_e_r_w_r_i_t_t_e_n_ _s_o_o_n_,_ _i_t_'_s_ _p_r_o_b_a_b_l_y_ _n_o_t_ _t_h_a_t_ _b_i_g_ _o_f_ _a_ _d_e_a_l_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** wwhhaatt ddoo wwee ddoo iiff ssoommeeoonnee iiss ccuurrrreennttllyy rreeaaddiinngg ffrroomm tthhee ddiisskk ffrroomm tthhiiss ppiieeccee?? ddooeess iitt mmaatttteerr?? SSiinnccee wwee wwoonn''tt aaccttiivveellyy eerraassee tthhee ddaattaa ffrroomm ddiisskk,, bbuutt iitt mmaayy bbee oovveerrwwrriitttteenn | │ │ │ │ │ +|ssoooonn,, iitt''ss pprroobbaabbllyy nnoott tthhaatt bbiigg ooff aa ddeeaall ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppaarrtt__ffiillee..ccpppp::330000 ****** | │ │ │ │ │ +|create_directories(m_path, ec); | │ │ │ │ │ +| if (ec) return {}; | │ │ │ │ │ +| return aux::file_handle(fn, 0, mode); | │ │ │ │ │ +| } | │ │ │ │ │ +| return {}; | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| catch (storage_error const& e) | │ │ │ │ │ | { | │ │ │ │ │ -| std::array ret; | │ │ │ │ │ -| auto* begin = reinterpret_cast(ret.data()); | │ │ │ │ │ -| std::uint8_t* end = mp::export_bits(k, begin, 8); | │ │ │ │ │ +| ec = e.ec; | │ │ │ │ │ +| return {}; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|if (end < begin + 96) | │ │ │ │ │ +| void part_file::free_piece(piece_index_t const piece) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::lock_guard l(m_mutex); | │ │ │ │ │ +| | │ │ │ │ │ +| auto const i = m_piece_map.find(piece); | │ │ │ │ │ +| if (i == m_piece_map.end()) return; | │ │ │ │ │ +| | │ │ │ │ │ +| | │ │ │ │ │ +|m_free_slots.push_back(i->second); | │ │ │ │ │ +| m_piece_map.erase(i); | │ │ │ │ │ +| m_dirty_metadata = true; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void part_file::move_partfile(std::string const& path, error_code& ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::lock_guard l(m_mutex); | │ │ │ │ │ +| | │ │ │ │ │ +| flush_metadata_impl(ec); | │ │ │ │ │ +| if (ec) return; | │ │ │ │ │ +| | │ │ │ │ │ +| if (!m_piece_map.empty()) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::string old_path = combine_path(m_path, m_name); | │ │ │ │ │ +| std::string new_path = combine_path(path, m_name); | │ │ │ │ │ +| | │ │ │ │ │ +| rename(old_path, new_path, ec); | │ │ │ │ │ +| if (ec == boost::system::errc::no_such_file_or_directory) | │ │ │ │ │ +| ec.clear(); | │ │ │ │ │ +| | │ │ │ │ │ +| if (ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| storage_error se; | │ │ │ │ │ +| aux::copy_file(old_path, new_path, se); | │ │ │ │ │ +| ec = se.ec; | │ │ │ │ │ +| if (ec) return; | │ │ │ │ │ +| remove(old_path, ec); | │ │ │ │ │ +| } | │ │ │ │ │ +|_ _ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_a_r_t___f_i_l_e_._c_p_p_:_4_1_1_ _ _ _ _ _ _|_i_n_s_t_e_a_d_ _o_f_ _r_e_b_u_i_l_d_i_n_g_ _t_h_e_ _w_h_o_l_e_ _f_i_l_e_ _h_e_a_d_e_r_ _a_n_d_ _f_l_u_s_h_i_n_g_ _i_t_,_ _u_p_d_a_t_e_ _t_h_e_ _s_l_o_t_ _e_n_t_r_i_e_s_ _a_s_ _w_e_ _g_o_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iinnsstteeaadd ooff rreebbuuiillddiinngg tthhee wwhhoollee ffiillee hheeaaddeerr aanndd fflluusshhiinngg iitt,, uuppddaattee tthhee sslloott eennttrriieess aass wwee ggoo ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppaarrtt__ffiillee..ccpppp::441111 ****** | │ │ │ │ │ +|TORRENT_ASSERT(j->second == slot); | │ │ │ │ │ +| m_free_slots.push_back(j->second); | │ │ │ │ │ +| m_piece_map.erase(j); | │ │ │ │ │ +| m_dirty_metadata = true; | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| file_offset += block_to_copy; | │ │ │ │ │ +| piece_offset = 0; | │ │ │ │ │ +| size -= block_to_copy; | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void part_file::flush_metadata(error_code& ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::lock_guard l(m_mutex); | │ │ │ │ │ +| | │ │ │ │ │ +| flush_metadata_impl(ec); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|void part_file::flush_metadata_impl(error_code& ec) | │ │ │ │ │ |{ | │ │ │ │ │ -| int const len = int(end - begin); | │ │ │ │ │ -|#if defined __GNUC__ && __GNUC__ == 12 | │ │ │ │ │ -|#pragma GCC diagnostic push | │ │ │ │ │ -|#pragma GCC diagnostic ignored "-Wstringop-overflow" | │ │ │ │ │ +| // do we need to flush the metadata? | │ │ │ │ │ +| if (m_dirty_metadata == false) return; | │ │ │ │ │ +| | │ │ │ │ │ +| if (m_piece_map.empty()) | │ │ │ │ │ +| { | │ │ │ │ │ +| // if we don't have any pieces left in the | │ │ │ │ │ +| // part file, remove it | │ │ │ │ │ +| std::string const p = combine_path(m_path, m_name); | │ │ │ │ │ +| remove(p, ec); | │ │ │ │ │ +| | │ │ │ │ │ +| if (ec == boost::system::errc::no_such_file_or_directory) | │ │ │ │ │ +| ec.clear(); | │ │ │ │ │ +| return; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| auto f = open_file(aux::open_mode::write | aux::open_mode::hidden, ec); | │ │ │ │ │ +| if (ec) return; | │ │ │ │ │ +| | │ │ │ │ │ +| std::vector header(static_cast(m_header_size)); | │ │ │ │ │ +| | │ │ │ │ │ +| using namespace libtorrent::aux; | │ │ │ │ │ +| | │ │ │ │ │ +| char* ptr = header.data(); | │ │ │ │ │ +| write_uint32(m_max_pieces, ptr); | │ │ │ │ │ +| write_uint32(m_piece_size, ptr); | │ │ │ │ │ +| | │ │ │ │ │ +| for (piece_index_t piece(0); piece < piece_index_t(m_max_pieces); ++piece) | │ │ │ │ │ +| { | │ │ │ │ │ +|_ _ _ _a_u_t_o_ _c_o_n_s_t_ _i_ _=_ _m___p_i_e_c_e___m_a_p_._f_i_n_d_(_p_i_e_c_e_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/_u_t_p___s_o_c_k_e_t___m_a_n_a_g_e_r_._c_p_p_:|this should not be heap allocated, sockets should be movable | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_2_0_4_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss sshhoouulldd nnoott bbee hheeaapp aallllooccaatteedd,, ssoocckkeettss sshhoouulldd bbee mmoovvaabbllee ********** | │ │ │ │ │ +|****** ....//ssrrcc//uuttpp__ssoocckkeett__mmaannaaggeerr..ccpppp::220044 ****** | │ │ │ │ │ +|// UTP_LOGV("incoming packet id:%d source:%s\n", id, print_endpoint(ep).c_str()); | │ │ │ │ │ +| | │ │ │ │ │ +| if (!m_sett.get_bool(settings_pack::enable_incoming_utp)) | │ │ │ │ │ +| return false; | │ │ │ │ │ +| | │ │ │ │ │ +| // if not found, see if it's a SYN packet, if it is, | │ │ │ │ │ +| // create a new utp_stream | │ │ │ │ │ +| if (ph->get_type() == ST_SYN) | │ │ │ │ │ +| { | │ │ │ │ │ +| // possible SYN flood. Just ignore | │ │ │ │ │ +| if (int(m_utp_sockets.size()) > m_sett.get_int(settings_pack::connections_limit) * 2) | │ │ │ │ │ +| return false; | │ │ │ │ │ +| | │ │ │ │ │ +| TORRENT_ASSERT(m_new_connection == -1); | │ │ │ │ │ +| // create the new socket with this ID | │ │ │ │ │ +| m_new_connection = id; | │ │ │ │ │ +| | │ │ │ │ │ +|// UTP_LOGV("not found, new connection id:%d\n", m_new_connection); | │ │ │ │ │ +| | │ │ │ │ │ +|aux::socket_type c(aux::instantiate_connection(m_ios, aux::proxy_settings(), m_ssl_context, this, true, false)); | │ │ │ │ │ +| | │ │ │ │ │ +| utp_stream* str = nullptr; | │ │ │ │ │ +|#ifdef TORRENT_SSL_PEERS | │ │ │ │ │ +| if (is_ssl(c)) | │ │ │ │ │ +| str = &boost::get>(c).next_layer(); | │ │ │ │ │ +| else | │ │ │ │ │ |#endif | │ │ │ │ │ -| std::memmove(begin + 96 - len, begin, aux::numeric_cast(len)); | │ │ │ │ │ -|#if defined __GNUC__ && __GNUC__ == 12 | │ │ │ │ │ -|#pragma GCC diagnostic pop | │ │ │ │ │ +| str = boost::get(&c); | │ │ │ │ │ +| | │ │ │ │ │ +| TORRENT_ASSERT(str); | │ │ │ │ │ +| int const mtu = mtu_for_dest(ep.address()); | │ │ │ │ │ +| str->get_impl()->init_mtu(mtu); | │ │ │ │ │ +| str->get_impl()->m_sock = std::move(socket); | │ │ │ │ │ +| bool const ret = str->get_impl()->incoming_packet(p, ep, receive_time); | │ │ │ │ │ +| if (!ret) return false; | │ │ │ │ │ +| m_last_socket = str->get_impl(); | │ │ │ │ │ +| m_cb(std::move(c)); | │ │ │ │ │ +| // the connection most likely changed its connection ID here | │ │ │ │ │ +| // we need to move it to the correct ID | │ │ │ │ │ +| return true; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| if (ph->get_type() == ST_RESET) return false; | │ │ │ │ │ +| | │ │ │ │ │ +| // #error send reset | │ │ │ │ │ +| | │ │ │ │ │ +| return false; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|_ _v_o_i_d_ _u_t_p___s_o_c_k_e_t___m_a_n_a_g_e_r_:_:_s_u_b_s_c_r_i_b_e___w_r_i_t_a_b_l_e_(_u_t_p___s_o_c_k_e_t___i_m_p_l_*_ _s_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t___h_a_n_d_l_e_._c_p_p_:_5_8_9_ _|_s_u_p_p_o_r_t_ _m_o_v_i_n_g_ _f_i_l_e_s_ _i_n_t_o_ _t_h_i_s_ _c_a_l_l_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ssuuppppoorrtt mmoovviinngg ffiilleess iinnttoo tthhiiss ccaallll ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt__hhaannddllee..ccpppp::558899 ****** | │ │ │ │ │ +|auto retp = &prio; | │ │ │ │ │ +| sync_call(&torrent::piece_priorities, retp); | │ │ │ │ │ +| std::vector ret; | │ │ │ │ │ +| ret.reserve(prio.size()); | │ │ │ │ │ +| for (auto p : prio) | │ │ │ │ │ +| ret.push_back(int(static_cast(p))); | │ │ │ │ │ +| return ret; | │ │ │ │ │ +| } | │ │ │ │ │ |#endif | │ │ │ │ │ -| std::memset(begin, 0, aux::numeric_cast(96 - len)); | │ │ │ │ │ +| | │ │ │ │ │ +| void torrent_handle::file_priority(file_index_t index, download_priority_t priority) const | │ │ │ │ │ +| { | │ │ │ │ │ +| async_call(&torrent::set_file_priority, index, priority); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| download_priority_t torrent_handle::file_priority(file_index_t index) const | │ │ │ │ │ +| { | │ │ │ │ │ +| return sync_call_ret(dont_download, &torrent::file_priority, index); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|void torrent_handle::prioritize_files(std::vector const& files) const | │ │ │ │ │ +|{ | │ │ │ │ │ +| async_call(&torrent::prioritize_files | │ │ │ │ │ +| , static_cast const&>(files)); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| std::vector torrent_handle::get_file_priorities() const | │ │ │ │ │ +| { | │ │ │ │ │ +| aux::vector ret; | │ │ │ │ │ +| auto retp = &ret; | │ │ │ │ │ +| sync_call(&torrent::file_priorities, retp); | │ │ │ │ │ +| return TORRENT_RVO(ret); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ +| | │ │ │ │ │ +|// ============ start deprecation =============== | │ │ │ │ │ +| | │ │ │ │ │ +| void torrent_handle::prioritize_files(std::vector const& files) const | │ │ │ │ │ +| { | │ │ │ │ │ +| aux::vector file_prio; | │ │ │ │ │ +| file_prio.reserve(files.size()); | │ │ │ │ │ +| for (auto const p : files) { | │ │ │ │ │ +| file_prio.push_back(download_priority_t(static_cast(p))); | │ │ │ │ │ +| } | │ │ │ │ │ +| async_call(&torrent::prioritize_files, file_prio); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| std::vector torrent_handle::file_priorities() const | │ │ │ │ │ +| { | │ │ │ │ │ +|_ _ _a_u_x_:_:_v_e_c_t_o_r_<_d_o_w_n_l_o_a_d___p_r_i_o_r_i_t_y___t_,_ _f_i_l_e___i_n_d_e_x___t_>_ _p_r_i_o_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/_d_i_s_a_b_l_e_d___d_i_s_k___i_o_._c_p_p_: |it would be nice to return a valid hash of zeroes here | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_1_0_6_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iitt wwoouulldd bbee nniiccee ttoo rreettuurrnn aa vvaalliidd hhaasshh ooff zzeerrooeess hheerree ********** | │ │ │ │ │ +|****** ....//ssrrcc//ddiissaabblleedd__ddiisskk__iioo..ccpppp::110066 ****** | │ │ │ │ │ +|}); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| bool async_write(storage_index_t | │ │ │ │ │ +| , peer_request const& r | │ │ │ │ │ +| , char const*, std::shared_ptr | │ │ │ │ │ +| , std::function handler | │ │ │ │ │ +| , disk_job_flags_t) override | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(r.length <= default_block_size); | │ │ │ │ │ +| TORRENT_UNUSED(r); | │ │ │ │ │ +| | │ │ │ │ │ +| post(m_ios, [h = std::move(handler)] { h(storage_error{}); }); | │ │ │ │ │ +| return false; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void async_hash(storage_index_t | │ │ │ │ │ +| , piece_index_t piece, span, disk_job_flags_t | │ │ │ │ │ +| , std::function handler) override | │ │ │ │ │ +| { | │ │ │ │ │ +|post(m_ios, [h = std::move(handler), piece] { h(piece, sha1_hash{}, storage_error{}); }); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +| void async_hash2(storage_index_t, piece_index_t piece, int | │ │ │ │ │ +| , disk_job_flags_t | │ │ │ │ │ +| , std::function handler) override | │ │ │ │ │ +| { | │ │ │ │ │ +| post(m_ios, [h = std::move(handler), piece]() { h(piece, sha256_hash{}, storage_error{}); }); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void async_move_storage(storage_index_t | │ │ │ │ │ +| , std::string p, move_flags_t | │ │ │ │ │ +| , std::function handler) override | │ │ │ │ │ +| { | │ │ │ │ │ +| post(m_ios, [h = std::move(handler), path = std::move(p)] () mutable | │ │ │ │ │ +| { h(status_t::no_error, std::move(path), storage_error{}); }); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void async_release_files(storage_index_t, std::function handler) override | │ │ │ │ │ +| { | │ │ │ │ │ +| post(m_ios, [h = std::move(handler)] { h(); }); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void async_delete_files(storage_index_t | │ │ │ │ │ +| , remove_flags_t, std::function handler) override | │ │ │ │ │ +| { | │ │ │ │ │ +| post(m_ios, [h = std::move(handler)] { h(storage_error{}); }); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void async_check_files(storage_index_t | │ │ │ │ │ +|_ _ _,_ _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s_ _c_o_n_s_t_*_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_i_e_c_e___p_i_c_k_e_r_._c_p_p_:_1_2_1_ _ _ _|_f_i_n_d_ _a_ _b_e_t_t_e_r_ _p_l_a_c_e_ _f_o_r_ _t_h_i_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ffiinndd aa bbeetttteerr ppllaaccee ffoorr tthhiiss ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppiieeccee__ppiicckkeerr..ccpppp::112211 ****** | │ │ │ │ │ +|if (limit == 0) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::cerr << " ..."; | │ │ │ │ │ +| break; | │ │ │ │ │ +| } | │ │ │ │ │ +| if (*i == -1) break; | │ │ │ │ │ +| while (j != p.m_priority_boundaries.end() && *j <= index) | │ │ │ │ │ +| { | │ │ │ │ │ +| std::cerr << "| "; | │ │ │ │ │ +| ++j; | │ │ │ │ │ +| } | │ │ │ │ │ +| std::cerr << *i << "(" << p.m_piece_map[*i].index << ") "; | │ │ │ │ │ +| --limit; | │ │ │ │ │ +| } | │ │ │ │ │ +| std::cerr << std::endl; | │ │ │ │ │ +| } | │ │ │ │ │ +|} | │ │ │ │ │ +|#endif // TORRENT_PICKER_LOG | │ │ │ │ │ +|namespace libtorrent { | │ │ │ │ │ +| | │ │ │ │ │ +|const piece_block piece_block::invalid( | │ │ │ │ │ +|std::numeric_limits::max() | │ │ │ │ │ +| , std::numeric_limits::max()); | │ │ │ │ │ +| | │ │ │ │ │ +| constexpr prio_index_t piece_picker::piece_pos::we_have_index; | │ │ │ │ │ +| | │ │ │ │ │ +| constexpr picker_options_t piece_picker::rarest_first; | │ │ │ │ │ +| constexpr picker_options_t piece_picker::reverse; | │ │ │ │ │ +| constexpr picker_options_t piece_picker::on_parole; | │ │ │ │ │ +| constexpr picker_options_t piece_picker::prioritize_partials; | │ │ │ │ │ +| constexpr picker_options_t piece_picker::sequential; | │ │ │ │ │ +| constexpr picker_options_t piece_picker::align_expanded_pieces; | │ │ │ │ │ +| constexpr picker_options_t piece_picker::piece_extent_affinity; | │ │ │ │ │ +| | │ │ │ │ │ +| constexpr download_queue_t piece_picker::piece_pos::piece_downloading; | │ │ │ │ │ +| constexpr download_queue_t piece_picker::piece_pos::piece_full; | │ │ │ │ │ +| constexpr download_queue_t piece_picker::piece_pos::piece_finished; | │ │ │ │ │ +| constexpr download_queue_t piece_picker::piece_pos::piece_zero_prio; | │ │ │ │ │ +| constexpr download_queue_t piece_picker::piece_pos::num_download_categories; | │ │ │ │ │ +| constexpr download_queue_t piece_picker::piece_pos::piece_open; | │ │ │ │ │ +| constexpr download_queue_t piece_picker::piece_pos::piece_downloading_reverse; | │ │ │ │ │ +| constexpr download_queue_t piece_picker::piece_pos::piece_full_reverse; | │ │ │ │ │ +| | │ │ │ │ │ +| // the max number of blocks to create an affinity for | │ │ │ │ │ +| constexpr int max_piece_affinity_extent = 4 * 1024 * 1024 / default_block_size; | │ │ │ │ │ +| | │ │ │ │ │ +| piece_picker::piece_picker(std::int64_t const total_size, int const piece_size) | │ │ │ │ │ +| : m_priority_boundaries(1, m_pieces.end_index()) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(total_size > 0); | │ │ │ │ │ +|_ _ _T_O_R_R_E_N_T___A_S_S_E_R_T_(_p_i_e_c_e___s_i_z_e_ _>_ _0_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| | |this could probably be optimized by incrementally calling partial_sort to sort one more element in the list. Because chances are | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/_p_i_e_c_e___p_i_c_k_e_r_._c_p_p_:_2_0_6_7 |that we'll just need a single piece, and once we've picked from it we're done. Sorting the rest of the list in that case is a waste | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_o_f_ _t_i_m_e_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss ccoouulldd pprroobbaabbllyy bbee ooppttiimmiizzeedd bbyy iinnccrreemmeennttaallllyy ccaalllliinngg ppaarrttiiaall__ssoorrtt ttoo ssoorrtt oonnee mmoorree eelleemmeenntt iinn tthhee lliisstt.. BBeeccaauussee cchhaanncceess aarree tthhaatt wwee''llll jjuusstt nneeeedd aa ssiinnggllee ppiieeccee,, aanndd| │ │ │ │ │ +|oonnccee wwee''vvee ppiicckkeedd ffrroomm iitt wwee''rree ddoonnee.. SSoorrttiinngg tthhee rreesstt ooff tthhee lliisstt iinn tthhaatt ccaassee iiss aa wwaassttee ooff ttiimmee.. ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppiieeccee__ppiicckkeerr..ccpppp::22006677 ****** | │ │ │ │ │ +|// now, copy over the pointers. We also apply a filter here to not | │ │ │ │ │ +| // include ineligible pieces in certain modes. For instance, a piece | │ │ │ │ │ +| // that the current peer doesn't have is not included. | │ │ │ │ │ +| for (auto& dp : m_downloads[piece_pos::piece_downloading]) | │ │ │ │ │ +| { | │ │ │ │ │ +| pc.inc_stats_counter(counters::piece_picker_partial_loops); | │ │ │ │ │ +| | │ │ │ │ │ +| if (!is_piece_free(dp.index, pieces)) continue; | │ │ │ │ │ +| | │ │ │ │ │ +| TORRENT_ASSERT(m_piece_map[dp.index].download_queue() | │ │ │ │ │ +| == piece_pos::piece_downloading); | │ │ │ │ │ +| | │ │ │ │ │ +| ordered_partials[num_ordered_partials++] = &dp; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| // now, sort the list. | │ │ │ │ │ +| if (options & rarest_first) | │ │ │ │ │ +| { | │ │ │ │ │ +| ret |= picker_log_alert::rarest_first_partials; | │ │ │ │ │ +| | │ │ │ │ │ +|std::sort(ordered_partials.begin(), ordered_partials.begin() + num_ordered_partials | │ │ │ │ │ +|, std::bind(&piece_picker::partial_compare_rarest_first, this | │ │ │ │ │ +| , _1, _2)); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| for (int i = 0; i < num_ordered_partials; ++i) | │ │ │ │ │ +| { | │ │ │ │ │ +| ret |= picker_log_alert::prioritize_partials; | │ │ │ │ │ +| | │ │ │ │ │ +| num_blocks = add_blocks_downloading(*ordered_partials[i], pieces | │ │ │ │ │ +| , interesting_blocks, backup_blocks, backup_blocks2 | │ │ │ │ │ +| , num_blocks, prefer_contiguous_blocks, peer, options); | │ │ │ │ │ +| if (num_blocks <= 0) return ret; | │ │ │ │ │ +| if (int(backup_blocks.size()) >= num_blocks | │ │ │ │ │ +| && int(backup_blocks2.size()) >= num_blocks) | │ │ │ │ │ +| break; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| num_blocks = append_blocks(interesting_blocks, backup_blocks | │ │ │ │ │ +| , num_blocks); | │ │ │ │ │ +| if (num_blocks <= 0) return ret; | │ │ │ │ │ +| | │ │ │ │ │ +| num_blocks = append_blocks(interesting_blocks, backup_blocks2 | │ │ │ │ │ +| , num_blocks); | │ │ │ │ │ +| if (num_blocks <= 0) return ret; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| if (!suggested_pieces.empty()) | │ │ │ │ │ +| { | │ │ │ │ │ +| for (piece_index_t i : suggested_pieces) | │ │ │ │ │ +|_ _ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_i_e_c_e___p_i_c_k_e_r_._c_p_p_:_2_2_1_1_ _ _|_I_s_ _i_t_ _a_ _g_o_o_d_ _i_d_e_a_ _t_h_a_t_ _t_h_i_s_ _a_f_f_i_n_i_t_y_ _t_a_k_e_s_ _p_r_e_c_e_d_e_n_c_e_ _o_v_e_r_ _p_i_e_c_e_ _p_r_i_o_r_i_t_y_?_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** IIss iitt aa ggoooodd iiddeeaa tthhaatt tthhiiss aaffffiinniittyy ttaakkeess pprreecceeddeennccee oovveerr ppiieeccee pprriioorriittyy?? ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppiieeccee__ppiicckkeerr..ccpppp::22221111 ****** | │ │ │ │ │ +|prio_index_t const end = priority_end(i); | │ │ │ │ │ +| for (prio_index_t p = prev(end); p >= start; --p) | │ │ │ │ │ +| { | │ │ │ │ │ +| pc.inc_stats_counter(counters::piece_picker_reverse_rare_loops); | │ │ │ │ │ +| | │ │ │ │ │ +| if (!is_piece_free(m_pieces[p], pieces)) continue; | │ │ │ │ │ +| | │ │ │ │ │ +| ret |= picker_log_alert::reverse_rarest_first; | │ │ │ │ │ +| | │ │ │ │ │ +| num_blocks = add_blocks(m_pieces[p], pieces | │ │ │ │ │ +| , interesting_blocks, backup_blocks | │ │ │ │ │ +| , backup_blocks2, num_blocks | │ │ │ │ │ +| , prefer_contiguous_blocks, peer, ignored_pieces | │ │ │ │ │ +| , options); | │ │ │ │ │ +| if (num_blocks <= 0) return ret; | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| else | │ │ │ │ │ +| { | │ │ │ │ │ +|if (options & piece_extent_affinity) | │ │ │ │ │ +|{ | │ │ │ │ │ +| int to_erase = -1; | │ │ │ │ │ +| int idx = -1; | │ │ │ │ │ +| for (piece_extent_t const e : m_recent_extents) | │ │ │ │ │ +| { | │ │ │ │ │ +| ++idx; | │ │ │ │ │ +| bool have_all = true; | │ │ │ │ │ +| for (piece_index_t const p : extent_for(e)) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (!m_piece_map[p].have()) have_all = false; | │ │ │ │ │ +| if (!is_piece_free(p, pieces)) continue; | │ │ │ │ │ +| | │ │ │ │ │ +| ret |= picker_log_alert::extent_affinity; | │ │ │ │ │ +| | │ │ │ │ │ +| num_blocks = add_blocks(p, pieces | │ │ │ │ │ +| , interesting_blocks, backup_blocks | │ │ │ │ │ +| , backup_blocks2, num_blocks | │ │ │ │ │ +| , prefer_contiguous_blocks, peer, ignored_pieces | │ │ │ │ │ +| , options); | │ │ │ │ │ +| if (num_blocks <= 0) | │ │ │ │ │ +| { | │ │ │ │ │ +| // if we have all pieces belonging to this extent, remove it | │ │ │ │ │ +| if (to_erase != -1) m_recent_extents.erase(m_recent_extents.begin() + to_erase); | │ │ │ │ │ +| return ret; | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| // if we have all pieces belonging to this extent, remove it | │ │ │ │ │ +| if (have_all) to_erase = idx; | │ │ │ │ │ +| } | │ │ │ │ │ +|_ _ _ _ _ _i_f_ _(_t_o___e_r_a_s_e_ _!_=_ _-_1_)_ _m___r_e_c_e_n_t___e_x_t_e_n_t_s_._e_r_a_s_e_(_m___r_e_c_e_n_t___e_x_t_e_n_t_s_._b_e_g_i_n_(_)_ _+_ _t_o___e_r_a_s_e_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_i_e_c_e___p_i_c_k_e_r_._c_p_p_:_2_5_6_6_ _ _|_w_h_e_n_ _e_x_p_a_n_d_i_n_g_ _p_i_e_c_e_s_ _f_o_r_ _c_a_c_h_e_ _s_t_r_i_p_e_ _r_e_a_s_o_n_s_,_ _t_h_e_ _!_d_o_w_n_l_o_a_d_i_n_g_ _c_o_n_d_i_t_i_o_n_ _d_o_e_s_n_'_t_ _m_a_k_e_ _m_u_c_h_ _s_e_n_s_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** wwhheenn eexxppaannddiinngg ppiieecceess ffoorr ccaacchhee ssttrriippee rreeaassoonnss,, tthhee !!ddoowwnnllooaaddiinngg ccoonnddiittiioonn ddooeessnn''tt mmaakkee mmuucchh sseennssee ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppiieeccee__ppiicckkeerr..ccpppp::22556666 ****** | │ │ │ │ │ +|TORRENT_ASSERT(index < m_piece_map.end_index()); | │ │ │ │ │ +| if (next(index) == m_piece_map.end_index()) | │ │ │ │ │ +| return m_blocks_in_last_piece; | │ │ │ │ │ +| else | │ │ │ │ │ +| return blocks_per_piece(); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| bool piece_picker::is_piece_free(piece_index_t const piece | │ │ │ │ │ +| , typed_bitfield const& bitmask) const | │ │ │ │ │ +| { | │ │ │ │ │ +| return bitmask[piece] | │ │ │ │ │ +| && !m_piece_map[piece].have() | │ │ │ │ │ +| && !m_piece_map[piece].filtered(); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| bool piece_picker::can_pick(piece_index_t const piece | │ │ │ │ │ +| , typed_bitfield const& bitmask) const | │ │ │ │ │ +| { | │ │ │ │ │ +| return bitmask[piece] | │ │ │ │ │ +| && !m_piece_map[piece].have() | │ │ │ │ │ +|&& !m_piece_map[piece].downloading() | │ │ │ │ │ +|&& !m_piece_map[piece].filtered(); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|#if TORRENT_USE_INVARIANT_CHECKS | │ │ │ │ │ +| void piece_picker::check_peers() | │ │ │ │ │ +| { | │ │ │ │ │ +| for (auto const& b : m_block_info) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(b.peer == nullptr || static_cast(b.peer)->in_use); | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| void piece_picker::clear_peer(torrent_peer* peer) | │ │ │ │ │ +| { | │ │ │ │ │ +| for (auto& b : m_block_info) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (b.peer == peer) b.peer = nullptr; | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| // the first bool is true if this is the only peer that has requested and downloaded | │ │ │ │ │ +| // blocks from this piece. | │ │ │ │ │ +| // the second bool is true if this is the only active peer that is requesting | │ │ │ │ │ +|_ _/_/_ _a_n_d_ _d_o_w_n_l_o_a_d_i_n_g_ _b_l_o_c_k_s_ _f_r_o_m_ _t_h_i_s_ _p_i_e_c_e_._ _A_c_t_i_v_e_ _m_e_a_n_s_ _h_a_v_i_n_g_ _a_ _c_o_n_n_e_c_t_i_o_n_._ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_p_i_e_c_e___p_i_c_k_e_r_._c_p_p_:_3_1_4_4_ _ _|_s_h_o_u_l_d_ _5_ _b_e_ _c_o_n_f_i_g_u_r_a_b_l_e_?_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** sshhoouulldd 55 bbee ccoonnffiigguurraabbllee?? ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppiieeccee__ppiicckkeerr..ccpppp::33114444 ****** | │ │ │ │ │ +|bool have_all = true; | │ │ │ │ │ +| | │ │ │ │ │ +| for (auto const piece : extent_for(this_extent)) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (piece == p) continue; | │ │ │ │ │ +| | │ │ │ │ │ +| if (!m_piece_map[piece].have()) have_all = false; | │ │ │ │ │ +| | │ │ │ │ │ +| // if at least one piece in this extent has a different priority than | │ │ │ │ │ +| // the one we just started downloading, don't create an affinity for | │ │ │ │ │ +| // adjacent pieces. This probably means the pieces belong to different | │ │ │ │ │ +| // files, or that some other mechanism determining the priority should | │ │ │ │ │ +| // take precedence. | │ │ │ │ │ +| if (piece_priority(piece) != this_prio) return; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| // if we already have all the *other* pieces in this extent, there's no | │ │ │ │ │ +| // need to inflate their priorities | │ │ │ │ │ +| if (have_all) return; | │ │ │ │ │ +| | │ │ │ │ │ +|if (m_recent_extents.size() < 5) | │ │ │ │ │ +|m_recent_extents.push_back(this_extent); | │ │ │ │ │ +| | │ │ │ │ │ +| // limit the number of extent affinities active at any given time to limit | │ │ │ │ │ +| // the cost of checking them. Also, don't replace them, commit to | │ │ │ │ │ +| // finishing them before starting another extent. This is analogous to | │ │ │ │ │ +| // limiting the number of partial pieces. | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| // options may be 0 or piece_picker::reverse | │ │ │ │ │ +| // returns false if the block could not be marked as downloading | │ │ │ │ │ +| bool piece_picker::mark_as_downloading(piece_block const block | │ │ │ │ │ +| , torrent_peer* peer, picker_options_t const options) | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifdef TORRENT_PICKER_LOG | │ │ │ │ │ +| std::cerr << "[" << this << "] " << "mark_as_downloading( {" | │ │ │ │ │ +| << block.piece_index << ", " << block.block_index << "} )" << std::endl; | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| TORRENT_ASSERT(peer == nullptr || peer->in_use); | │ │ │ │ │ +| TORRENT_ASSERT(block.block_index != piece_block::invalid.block_index); | │ │ │ │ │ +| TORRENT_ASSERT(block.piece_index != piece_block::invalid.piece_index); | │ │ │ │ │ +| TORRENT_ASSERT(block.piece_index < m_piece_map.end_index()); | │ │ │ │ │ +| TORRENT_ASSERT(block.block_index < blocks_in_piece(block.piece_index)); | │ │ │ │ │ +| TORRENT_ASSERT(!m_piece_map[block.piece_index].have()); | │ │ │ │ │ +| | │ │ │ │ │ +| piece_pos& p = m_piece_map[block.piece_index]; | │ │ │ │ │ +| if (p.download_queue() == piece_pos::piece_open) | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifdef TORRENT_EXPENSIVE_INVARIANT_CHECKS | │ │ │ │ │ +|_ _ _ _I_N_V_A_R_I_A_N_T___C_H_E_C_K_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_s_e_t_t_i_n_g_s___p_a_c_k_._c_p_p_:_3_0_5_ _ _|_d_e_p_r_e_c_a_t_e_ _t_h_i_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ddeepprreeccaattee tthhiiss ********** | │ │ │ │ │ +|****** ....//ssrrcc//sseettttiinnggss__ppaacckk..ccpppp::330055 ****** | │ │ │ │ │ +|SET(outgoing_port, 0, nullptr), | │ │ │ │ │ +| SET(num_outgoing_ports, 0, nullptr), | │ │ │ │ │ +| SET(peer_dscp, 0x04, &session_impl::update_peer_dscp), | │ │ │ │ │ +| SET(active_downloads, 3, &session_impl::trigger_auto_manage), | │ │ │ │ │ +| SET(active_seeds, 5, &session_impl::trigger_auto_manage), | │ │ │ │ │ +| SET(active_checking, 1, &session_impl::trigger_auto_manage), | │ │ │ │ │ +| SET(active_dht_limit, 88, nullptr), | │ │ │ │ │ +| SET(active_tracker_limit, 1600, nullptr), | │ │ │ │ │ +| SET(active_lsd_limit, 60, nullptr), | │ │ │ │ │ +| SET(active_limit, 500, &session_impl::trigger_auto_manage), | │ │ │ │ │ +| DEPRECATED_SET(active_loaded_limit, 0, &session_impl::trigger_auto_manage), | │ │ │ │ │ +| SET(auto_manage_interval, 30, nullptr), | │ │ │ │ │ +| SET(seed_time_limit, 24 * 60 * 60, nullptr), | │ │ │ │ │ +| SET(auto_scrape_interval, 1800, nullptr), | │ │ │ │ │ +| SET(auto_scrape_min_interval, 300, nullptr), | │ │ │ │ │ +| SET(max_peerlist_size, 3000, nullptr), | │ │ │ │ │ +| SET(max_paused_peerlist_size, 1000, nullptr), | │ │ │ │ │ +| SET(min_announce_interval, 5 * 60, nullptr), | │ │ │ │ │ +| SET(auto_manage_startup, 60, nullptr), | │ │ │ │ │ +| SET(seeding_piece_quota, 20, nullptr), | │ │ │ │ │ +|SET(max_rejects, 50, nullptr), | │ │ │ │ │ +|SET(recv_socket_buffer_size, 0, &session_impl::update_socket_buffer_size), | │ │ │ │ │ +| SET(send_socket_buffer_size, 0, &session_impl::update_socket_buffer_size), | │ │ │ │ │ +| SET(max_peer_recv_buffer_size, 2 * 1024 * 1024, nullptr), | │ │ │ │ │ +| DEPRECATED_SET(file_checks_delay_per_block, 0, nullptr), | │ │ │ │ │ +| DEPRECATED2_SET(read_cache_line_size, 32, nullptr), | │ │ │ │ │ +| DEPRECATED2_SET(write_cache_line_size, 16, nullptr), | │ │ │ │ │ +| SET(optimistic_disk_retry, 10 * 60, nullptr), | │ │ │ │ │ +| SET(max_suggest_pieces, 16, nullptr), | │ │ │ │ │ +| SET(local_service_announce_interval, 5 * 60, nullptr), | │ │ │ │ │ +| SET(dht_announce_interval, 15 * 60, &session_impl::update_dht_announce_interval), | │ │ │ │ │ +| SET(udp_tracker_token_expiry, 60, nullptr), | │ │ │ │ │ +| DEPRECATED_SET(default_cache_min_age, 1, nullptr), | │ │ │ │ │ +| SET(num_optimistic_unchoke_slots, 0, nullptr), | │ │ │ │ │ +| DEPRECATED_SET(default_est_reciprocation_rate, 16000, nullptr), | │ │ │ │ │ +| DEPRECATED_SET(increase_est_reciprocation_rate, 20, nullptr), | │ │ │ │ │ +| DEPRECATED_SET(decrease_est_reciprocation_rate, 3, nullptr), | │ │ │ │ │ +| SET(max_pex_peers, 50, nullptr), | │ │ │ │ │ +| SET(tick_interval, 500, nullptr), | │ │ │ │ │ +| SET(share_mode_target, 3, nullptr), | │ │ │ │ │ +| SET(upload_rate_limit, 0, &session_impl::update_upload_rate), | │ │ │ │ │ +| SET(download_rate_limit, 0, &session_impl::update_download_rate), | │ │ │ │ │ +| DEPRECATED_SET(local_upload_rate_limit, 0, &session_impl::update_local_upload_rate), | │ │ │ │ │ +| DEPRECATED_SET(local_download_rate_limit, 0, &session_impl::update_local_download_rate), | │ │ │ │ │ +| SET(dht_upload_rate_limit, 8000, &session_impl::update_dht_upload_rate_limit), | │ │ │ │ │ +| SET(unchoke_slots_limit, 8, &session_impl::update_unchoke_limit), | │ │ │ │ │ +| DEPRECATED_SET(half_open_limit, 0, nullptr), | │ │ │ │ │ +| SET(connections_limit, 200, &session_impl::update_connections_limit), | │ │ │ │ │ +| SET(connections_slack, 10, nullptr), | │ │ │ │ │ +| SET(utp_target_delay, 100, nullptr), | │ │ │ │ │ +|_ _ _S_E_T_(_u_t_p___g_a_i_n___f_a_c_t_o_r_,_ _3_0_0_0_,_ _n_u_l_l_p_t_r_)_,_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_s_e_t_t_i_n_g_s___p_a_c_k_._c_p_p_:_5_9_0_ _ _|_i_t_ _w_o_u_l_d_ _b_e_ _n_i_c_e_ _t_o_ _r_e_s_e_r_v_e_(_)_ _t_h_e_s_e_ _v_e_c_t_o_r_s_ _u_p_ _f_r_o_n_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iitt wwoouulldd bbee nniiccee ttoo rreesseerrvvee(()) tthheessee vveeccttoorrss uupp ffrroonntt ********** | │ │ │ │ │ +|****** ....//ssrrcc//sseettttiinnggss__ppaacckk..ccpppp::559900 ****** | │ │ │ │ │ +|s.set_str(settings_pack::string_type_base | i, str_settings[i].default_value); | │ │ │ │ │ +| TORRENT_ASSERT(s.get_str(settings_pack::string_type_base + i) == str_settings[i].default_value); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| for (int i = 0; i < settings_pack::num_int_settings; ++i) | │ │ │ │ │ +| { | │ │ │ │ │ +| s.set_int(settings_pack::int_type_base | i, int_settings[i].default_value); | │ │ │ │ │ +| TORRENT_ASSERT(s.get_int(settings_pack::int_type_base + i) == int_settings[i].default_value); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| for (int i = 0; i < settings_pack::num_bool_settings; ++i) | │ │ │ │ │ +| { | │ │ │ │ │ +| s.set_bool(settings_pack::bool_type_base | i, bool_settings[i].default_value); | │ │ │ │ │ +| TORRENT_ASSERT(s.get_bool(settings_pack::bool_type_base + i) == bool_settings[i].default_value); | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| settings_pack default_settings() | │ │ │ │ │ +| { | │ │ │ │ │ +| settings_pack ret; | │ │ │ │ │ +|for (int i = 0; i < settings_pack::num_string_settings; ++i) | │ │ │ │ │ +|{ | │ │ │ │ │ +| if (str_settings[i].default_value == nullptr) continue; | │ │ │ │ │ +| ret.set_str(settings_pack::string_type_base + i, str_settings[i].default_value); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| for (int i = 0; i < settings_pack::num_int_settings; ++i) | │ │ │ │ │ +| { | │ │ │ │ │ +| ret.set_int(settings_pack::int_type_base + i, int_settings[i].default_value); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| for (int i = 0; i < settings_pack::num_bool_settings; ++i) | │ │ │ │ │ +| { | │ │ │ │ │ +| ret.set_bool(settings_pack::bool_type_base + i, bool_settings[i].default_value); | │ │ │ │ │ | } | │ │ │ │ │ | return ret; | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| void rc4_init(const unsigned char* in, std::size_t len, rc4 *state); | │ │ │ │ │ -| std::size_t rc4_encrypt(unsigned char *out, std::size_t outlen, rc4 *state); | │ │ │ │ │ +| void apply_pack(settings_pack const* pack, aux::session_settings& sett | │ │ │ │ │ +| , aux::session_impl* ses) | │ │ │ │ │ +| { | │ │ │ │ │ +| using fun_t = void (aux::session_impl::*)(); | │ │ │ │ │ +| std::vector callbacks; | │ │ │ │ │ | | │ │ │ │ │ -| // Set the prime P and the generator, generate local public key | │ │ │ │ │ -| dh_key_exchange::dh_key_exchange() | │ │ │ │ │ +| sett.bulk_set([&](aux::session_settings_single_thread& s) | │ │ │ │ │ +| { | │ │ │ │ │ +| apply_pack_impl(pack, s, ses ? &callbacks : nullptr); | │ │ │ │ │ +| }); | │ │ │ │ │ +| | │ │ │ │ │ +| // call the callbacks once all the settings have been applied, and | │ │ │ │ │ +|_ _ _/_/_ _o_n_l_y_ _o_n_c_e_ _p_e_r_ _c_a_l_l_b_a_c_k_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_s_e_s_s_i_o_n___h_a_n_d_l_e_._c_p_p_:_4_9_9_ _|_i_n_ _C_+_+_1_4_,_ _u_s_e_ _u_n_i_q_u_e___p_t_r_ _a_n_d_ _m_o_v_e_ _i_t_ _i_n_t_o_ _t_h_e_ _l_a_m_b_d_a_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iinn CC++++1144,, uussee uunniiqquuee__ppttrr aanndd mmoovvee iitt iinnttoo tthhee llaammbbddaa ********** | │ │ │ │ │ +|****** ....//ssrrcc//sseessssiioonn__hhaannddllee..ccpppp::449999 ****** | │ │ │ │ │ +|#ifndef BOOST_NO_EXCEPTIONS | │ │ │ │ │ +| if (params.save_path.empty()) | │ │ │ │ │ +| aux::throw_ex(error_code(errors::invalid_save_path)); | │ │ │ │ │ +|#else | │ │ │ │ │ +| TORRENT_ASSERT_PRECOND(!params.save_path.empty()); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +|#if TORRENT_ABI_VERSION < 3 | │ │ │ │ │ +| if (!params.info_hashes.has_v1() && !params.info_hashes.has_v2() && !params.ti) | │ │ │ │ │ +| params.info_hashes.v1 = params.info_hash; | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| // the internal torrent object keeps and mutates state in the | │ │ │ │ │ +| // torrent_info object. We can't let that leak back to the client | │ │ │ │ │ +| if (params.ti) | │ │ │ │ │ +| params.ti = std::make_shared(*params.ti); | │ │ │ │ │ +| | │ │ │ │ │ +| // we cannot capture a unique_ptr into a lambda in c++11, so we use a raw | │ │ │ │ │ +| // pointer for now. async_call uses a lambda expression to post the call | │ │ │ │ │ +| // to the main thread | │ │ │ │ │ +|auto* p = new add_torrent_params(std::move(params)); | │ │ │ │ │ +|auto guard = aux::scope_end([p]{ delete p; }); | │ │ │ │ │ +| p->save_path = complete(p->save_path); | │ │ │ │ │ +| | │ │ │ │ │ +|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ +| handle_backwards_compatible_resume_data(*p); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| async_call(&session_impl::async_add_torrent, p); | │ │ │ │ │ +| guard.disarm(); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|#ifndef BOOST_NO_EXCEPTIONS | │ │ │ │ │ +|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ +| // if the torrent already exists, this will throw duplicate_torrent | │ │ │ │ │ +| torrent_handle session_handle::add_torrent( | │ │ │ │ │ +| torrent_info const& ti | │ │ │ │ │ +| , std::string const& save_path | │ │ │ │ │ +| , entry const& resume_data | │ │ │ │ │ +| , storage_mode_t storage_mode | │ │ │ │ │ +| , bool const add_paused) | │ │ │ │ │ | { | │ │ │ │ │ -| aux::array random_key; | │ │ │ │ │ -| aux::random_bytes({reinterpret_cast(random_key.data()) | │ │ │ │ │ -| , static_cast(random_key.size())}); | │ │ │ │ │ +| add_torrent_params p; | │ │ │ │ │ +| p.ti = std::make_shared(ti); | │ │ │ │ │ +| p.save_path = save_path; | │ │ │ │ │ +| if (resume_data.type() != entry::undefined_t) | │ │ │ │ │ +| { | │ │ │ │ │ +| bencode(std::back_inserter(p.resume_data), resume_data); | │ │ │ │ │ +| } | │ │ │ │ │ +| p.storage_mode = storage_mode; | │ │ │ │ │ +|_ _ _i_f_ _(_a_d_d___p_a_u_s_e_d_)_ _p_._f_l_a_g_s_ _|_=_ _a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s_:_:_f_l_a_g___p_a_u_s_e_d_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t___p_e_e_r_._c_p_p_:_1_9_2_ _ _ _|_h_o_w_ _d_o_ _w_e_ _d_e_a_l_ _w_i_t_h_ _o_u_r_ _e_x_t_e_r_n_a_l_ _a_d_d_r_e_s_s_ _c_h_a_n_g_i_n_g_?_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** hhooww ddoo wwee ddeeaall wwiitthh oouurr eexxtteerrnnaall aaddddrreessss cchhaannggiinngg?? ********** | │ │ │ │ │ +|****** ....//ssrrcc//ttoorrrreenntt__ppeeeerr..ccpppp::119922 ****** | │ │ │ │ │ +|// connections. If it fails, we'll | │ │ │ │ │ +| // retry with encryption | │ │ │ │ │ +| , pe_support(false) | │ │ │ │ │ +|#endif | │ │ │ │ │ +| , is_v6_addr(false) | │ │ │ │ │ +|#if TORRENT_USE_I2P | │ │ │ │ │ +| , is_i2p_addr(false) | │ │ │ │ │ +|#endif | │ │ │ │ │ +| , on_parole(false) | │ │ │ │ │ +| , banned(false) | │ │ │ │ │ +| , supports_utp(true) // assume peers support utp | │ │ │ │ │ +| , confirmed_supports_utp(false) | │ │ │ │ │ +| , supports_holepunch(false) | │ │ │ │ │ +| , web_seed(false) | │ │ │ │ │ +| , protocol_v2(false) | │ │ │ │ │ +| {} | │ │ │ │ │ | | │ │ │ │ │ -| // create local key (random) | │ │ │ │ │ -| mp::import_bits(m_dh_local_secret, random_key.begin(), random_key.end()); | │ │ │ │ │ +| std::uint32_t torrent_peer::rank(external_ip const& external, int external_port) const | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(in_use); | │ │ │ │ │ +|if (peer_rank == 0) | │ │ │ │ │ +|peer_rank = peer_priority( | │ │ │ │ │ +| tcp::endpoint(external.external_address(this->address()), std::uint16_t(external_port)) | │ │ │ │ │ +| , tcp::endpoint(this->address(), this->port)); | │ │ │ │ │ +| return peer_rank; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| // key = (2 ^ secret) % prime | │ │ │ │ │ -|_ _ _m___d_h___l_o_c_a_l___k_e_y_ _=_ _m_p_:_:_p_o_w_m_(_k_e_y___t_(_2_)_,_ _m___d_h___l_o_c_a_l___s_e_c_r_e_t_,_ _d_h___p_r_i_m_e_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| std::string torrent_peer::to_string() const | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(in_use); | │ │ │ │ │ +|#if TORRENT_USE_I2P | │ │ │ │ │ +| if (is_i2p_addr) return dest().to_string(); | │ │ │ │ │ +|#endif // TORRENT_USE_I2P | │ │ │ │ │ +| return address().to_string(); | │ │ │ │ │ +| } | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| std::int64_t torrent_peer::total_download() const | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(in_use); | │ │ │ │ │ +| if (connection != nullptr) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(prev_amount_download == 0); | │ │ │ │ │ +| return connection->statistics().total_payload_download(); | │ │ │ │ │ +| } | │ │ │ │ │ +| else | │ │ │ │ │ +| { | │ │ │ │ │ +| return std::int64_t(prev_amount_download) << 10; | │ │ │ │ │ +| } | │ │ │ │ │ +|_ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_: |this should be the global download rate | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_1_1_0_5_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** tthhiiss sshhoouulldd bbee tthhee gglloobbaall ddoowwnnllooaadd rraattee ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppeeeerr__ccoonnnneeccttiioonn..ccpppp::11110055 ****** | │ │ │ │ │ +| int rate = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| // if we haven't received any data recently, the current download rate | │ │ │ │ │ +| // is not representative | │ │ │ │ │ +| if (aux::time_now() - m_last_piece.get(m_connect) > seconds(30) && m_download_rate_peak > 0) | │ │ │ │ │ +| { | │ │ │ │ │ +| rate = m_download_rate_peak; | │ │ │ │ │ +| } | │ │ │ │ │ +| else if (aux::time_now() - m_last_unchoked.get(m_connect) < seconds(5) | │ │ │ │ │ +| && m_statistics.total_payload_upload() < 2 * 0x4000) | │ │ │ │ │ +| { | │ │ │ │ │ +| // if we're have only been unchoked for a short period of time, | │ │ │ │ │ +| // we don't know what rate we can get from this peer. Instead of assuming | │ │ │ │ │ +| // the lowest possible rate, assume the average. | │ │ │ │ │ +| | │ │ │ │ │ +| int peers_with_requests = int(stats_counters()[counters::num_peers_down_requests]); | │ │ │ │ │ +| // avoid division by 0 | │ │ │ │ │ +| if (peers_with_requests == 0) peers_with_requests = 1; | │ │ │ │ │ +| | │ │ │ │ │ +|rate = t->statistics().transfer_rate(stat::download_payload) / peers_with_requests; | │ │ │ │ │ +|} | │ │ │ │ │ +| else | │ │ │ │ │ +| { | │ │ │ │ │ +| // current download rate in bytes per seconds | │ │ │ │ │ +| rate = m_statistics.transfer_rate(stat::download_payload); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| // avoid division by zero | │ │ │ │ │ +| if (rate < 50) rate = 50; | │ │ │ │ │ +| | │ │ │ │ │ +| // average of current rate and peak | │ │ │ │ │ +|// rate = (rate + m_download_rate_peak) / 2; | │ │ │ │ │ +| | │ │ │ │ │ +| return milliseconds((m_outstanding_bytes + extra_bytes | │ │ │ │ │ +| + m_queued_time_critical * t->block_size() * 1000) / rate); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void peer_connection::add_stat(std::int64_t const downloaded, std::int64_t const uploaded) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ +| m_statistics.add_stat(downloaded, uploaded); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| sha1_hash peer_connection::associated_info_hash() const | │ │ │ │ │ +| { | │ │ │ │ │ +| std::shared_ptr t = associated_torrent().lock(); | │ │ │ │ │ +| TORRENT_ASSERT(t); | │ │ │ │ │ +| auto const& ih = t->info_hash(); | │ │ │ │ │ +| // if protocol_v2 is set on the peer, this better be a v2 torrent, | │ │ │ │ │ +|_ _ _/_/_ _o_t_h_e_r_w_i_s_e_ _s_o_m_e_t_h_i_n_g_ _i_s_n_'_t_ _r_i_g_h_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._c_p_p_: |sort the allowed fast set in priority order | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_3_5_3_6_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ssoorrtt tthhee aalllloowweedd ffaasstt sseett iinn pprriioorriittyy oorrddeerr ********** | │ │ │ │ │ +|****** ....//ssrrcc//ppeeeerr__ccoonnnneeccttiioonn..ccpppp::33553366 ****** | │ │ │ │ │ +| // if the peer has the piece and we want | │ │ │ │ │ +| // to download it, request it | │ │ │ │ │ +| if (index < m_have_piece.end_index() | │ │ │ │ │ +| && m_have_piece[index] | │ │ │ │ │ +| && !t->have_piece(index) | │ │ │ │ │ +| && t->valid_metadata() | │ │ │ │ │ +| && t->has_picker() | │ │ │ │ │ +| && t->picker().piece_priority(index) > dont_download) | │ │ │ │ │ +| { | │ │ │ │ │ +| t->peer_is_interesting(*this); | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| std::vector const& peer_connection::allowed_fast() | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ +| std::shared_ptr t = m_torrent.lock(); | │ │ │ │ │ +| TORRENT_ASSERT(t); | │ │ │ │ │ +| | │ │ │ │ │ +|return m_allowed_fast; | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +| bool peer_connection::can_request_time_critical() const | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ +| if (has_peer_choked() || !is_interesting()) return false; | │ │ │ │ │ +| if (int(m_download_queue.size()) + int(m_request_queue.size()) | │ │ │ │ │ +| > m_desired_queue_size * 2) return false; | │ │ │ │ │ +| if (on_parole()) return false; | │ │ │ │ │ +| if (m_disconnecting) return false; | │ │ │ │ │ +| std::shared_ptr t = m_torrent.lock(); | │ │ │ │ │ +| TORRENT_ASSERT(t); | │ │ │ │ │ +| if (t->upload_mode()) return false; | │ │ │ │ │ +| | │ │ │ │ │ +| // ignore snubbed peers, since they're not likely to return pieces in a | │ │ │ │ │ +| // timely manner anyway | │ │ │ │ │ +| if (m_snubbed) return false; | │ │ │ │ │ +| return true; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| bool peer_connection::make_time_critical(piece_block const& block) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(is_single_thread()); | │ │ │ │ │ +| auto const rit = std::find_if(m_request_queue.begin() | │ │ │ │ │ +| , m_request_queue.end(), aux::has_block(block)); | │ │ │ │ │ +| if (rit == m_request_queue.end()) return false; | │ │ │ │ │ +|#if TORRENT_USE_ASSERTS | │ │ │ │ │ +| std::shared_ptr t = m_torrent.lock(); | │ │ │ │ │ +| TORRENT_ASSERT(t); | │ │ │ │ │ +|_ _ _T_O_R_R_E_N_T___A_S_S_E_R_T_(_t_-_>_h_a_s___p_i_c_k_e_r_(_)_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_h_a_s_h___p_i_c_k_e_r_._c_p_p_:_3_0_9_ _ _ _ _|_u_s_e_ _s_t_r_u_c_t_u_r_e_d_ _b_i_n_d_i_n_g_s_ _i_n_ _C_+_+_1_7_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** uussee ssttrruuccttuurreedd bbiinnddiinnggss iinn CC++++1177 ********** | │ │ │ │ │ +|****** ....//ssrrcc//hhaasshh__ppiicckkeerr..ccpppp::330099 ****** | │ │ │ │ │ +|, int const offset, sha256_hash const& h) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(offset >= 0); | │ │ │ │ │ +| auto const f = m_files.file_index_at_piece(piece); | │ │ │ │ │ +| | │ │ │ │ │ +| if (m_files.pad_file_at(f)) | │ │ │ │ │ +| return { set_block_hash_result::result::success, 0, 0 }; | │ │ │ │ │ +| | │ │ │ │ │ +| auto& merkle_tree = m_merkle_trees[f]; | │ │ │ │ │ +| piece_index_t const file_first_piece = m_files.piece_index_at_file(f); | │ │ │ │ │ +| std::int64_t const block_offset = static_cast(piece) * std::int64_t(m_files.piece_length()) | │ │ │ │ │ +| + offset - m_files.file_offset(f); | │ │ │ │ │ +| int const block_index = aux::numeric_cast(block_offset / default_block_size); | │ │ │ │ │ +| | │ │ │ │ │ +| if (h.is_all_zeros()) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT_FAIL(); | │ │ │ │ │ +| return set_block_hash_result::block_hash_failed(); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|aux::merkle_tree::set_block_result result; | │ │ │ │ │ +|int leafs_index; | │ │ │ │ │ +| int leafs_size; | │ │ │ │ │ +| std::tie(result, leafs_index, leafs_size) = merkle_tree.set_block(block_index, h); | │ │ │ │ │ +| | │ │ │ │ │ +| if (result == aux::merkle_tree::set_block_result::unknown) | │ │ │ │ │ +| return set_block_hash_result::unknown(); | │ │ │ │ │ +| if (result == aux::merkle_tree::set_block_result::block_hash_failed) | │ │ │ │ │ +| return set_block_hash_result::block_hash_failed(); | │ │ │ │ │ +| | │ │ │ │ │ +| auto const status = (result == aux::merkle_tree::set_block_result::hash_failed) | │ │ │ │ │ +| ? set_block_hash_result::result::piece_hash_failed | │ │ │ │ │ +| : set_block_hash_result::result::success; | │ │ │ │ │ +| | │ │ │ │ │ +| int const blocks_per_piece = m_files.piece_length() / default_block_size; | │ │ │ │ │ +| | │ │ │ │ │ +| return { status | │ │ │ │ │ +| , int(leafs_index - static_cast(piece - file_first_piece) * blocks_per_piece) | │ │ │ │ │ +| , std::min(leafs_size, m_files.file_num_pieces(f) * blocks_per_piece - leafs_index) }; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void hash_picker::hashes_rejected(hash_request const& req) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(req.base == m_piece_layer && req.index % 512 == 0); | │ │ │ │ │ +| | │ │ │ │ │ +| for (int i = req.index; i < req.index + req.count; i += 512) | │ │ │ │ │ +| { | │ │ │ │ │ +| m_piece_hash_requested[req.file][i / 512].last_request = min_time(); | │ │ │ │ │ +| --m_piece_hash_requested[req.file][i / 512].num_requests; | │ │ │ │ │ +|_ _ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_f_i_l_e___s_t_o_r_a_g_e_._c_p_p_:_4_5_7_ _ _ _|_m_a_y_b_e_ _i_t_ _w_o_u_l_d_ _b_e_ _n_i_c_e_ _t_o_ _h_a_v_e_ _a_ _b_e_t_t_e_r_ _i_n_d_e_x_ _h_e_r_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** mmaayybbee iitt wwoouulldd bbee nniiccee ttoo hhaavvee aa bbeetttteerr iinnddeexx hheerree ********** | │ │ │ │ │ |****** ....//ssrrcc//ffiillee__ssttoorraaggee..ccpppp::445577 ****** | │ │ │ │ │ |// find the file iterator and file offset | │ │ │ │ │ | aux::file_entry target; | │ │ │ │ │ | target.offset = aux::numeric_cast(offset); | │ │ │ │ │ | TORRENT_ASSERT(!compare_file_offset(target, m_files.front())); | │ │ │ │ │ @@ -10107,423 +10066,518 @@ │ │ │ │ │ | // symlink targets are only allowed to point to files or directories in | │ │ │ │ │ | // this torrent. | │ │ │ │ │ | { | │ │ │ │ │ | std::string target = m_symlinks[fe.symlink_index]; | │ │ │ │ │ | | │ │ │ │ │ | if (is_complete(target)) | │ │ │ │ │ |_ _ _ _ _{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/_u_t_p___s_o_c_k_e_t___m_a_n_a_g_e_r_._c_p_p_:|this should not be heap allocated, sockets should be movable | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_2_0_4_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss sshhoouulldd nnoott bbee hheeaapp aallllooccaatteedd,, ssoocckkeettss sshhoouulldd bbee mmoovvaabbllee ********** | │ │ │ │ │ -|****** ....//ssrrcc//uuttpp__ssoocckkeett__mmaannaaggeerr..ccpppp::220044 ****** | │ │ │ │ │ -|// UTP_LOGV("incoming packet id:%d source:%s\n", id, print_endpoint(ep).c_str()); | │ │ │ │ │ -| | │ │ │ │ │ -| if (!m_sett.get_bool(settings_pack::enable_incoming_utp)) | │ │ │ │ │ -| return false; | │ │ │ │ │ -| | │ │ │ │ │ -| // if not found, see if it's a SYN packet, if it is, | │ │ │ │ │ -| // create a new utp_stream | │ │ │ │ │ -| if (ph->get_type() == ST_SYN) | │ │ │ │ │ -| { | │ │ │ │ │ -| // possible SYN flood. Just ignore | │ │ │ │ │ -| if (int(m_utp_sockets.size()) > m_sett.get_int(settings_pack::connections_limit) * 2) | │ │ │ │ │ -| return false; | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_i_p___n_o_t_i_f_i_e_r_._c_p_p_:_4_1_ _ _ _ _ _|_s_i_m_u_l_a_t_o_r_ _s_u_p_p_o_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ssiimmuullaattoorr ssuuppppoorrtt ********** | │ │ │ │ │ +|****** ....//ssrrcc//iipp__nnoottiiffiieerr..ccpppp::4411 ****** | │ │ │ │ │ +| from this software without specific prior written permission. | │ │ │ │ │ | | │ │ │ │ │ -| TORRENT_ASSERT(m_new_connection == -1); | │ │ │ │ │ -| // create the new socket with this ID | │ │ │ │ │ -| m_new_connection = id; | │ │ │ │ │ +|THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | │ │ │ │ │ +|AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | │ │ │ │ │ +|IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | │ │ │ │ │ +|ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE | │ │ │ │ │ +|LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | │ │ │ │ │ +|CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | │ │ │ │ │ +|SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | │ │ │ │ │ +|INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | │ │ │ │ │ +|CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | │ │ │ │ │ +|ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | │ │ │ │ │ +|POSSIBILITY OF SUCH DAMAGE. | │ │ │ │ │ | | │ │ │ │ │ -|// UTP_LOGV("not found, new connection id:%d\n", m_new_connection); | │ │ │ │ │ +|*/ | │ │ │ │ │ | | │ │ │ │ │ -|aux::socket_type c(aux::instantiate_connection(m_ios, aux::proxy_settings(), m_ssl_context, this, true, false)); | │ │ │ │ │ +|#include "libtorrent/aux_/ip_notifier.hpp" | │ │ │ │ │ +|#include "libtorrent/assert.hpp" | │ │ │ │ │ | | │ │ │ │ │ -| utp_stream* str = nullptr; | │ │ │ │ │ -|#ifdef TORRENT_SSL_PEERS | │ │ │ │ │ -| if (is_ssl(c)) | │ │ │ │ │ -| str = &boost::get>(c).next_layer(); | │ │ │ │ │ -| else | │ │ │ │ │ +|#if defined TORRENT_BUILD_SIMULATOR | │ │ │ │ │ +|#elif TORRENT_USE_NETLINK | │ │ │ │ │ +|#include "libtorrent/netlink.hpp" | │ │ │ │ │ +|#include "libtorrent/socket.hpp" | │ │ │ │ │ +|#include | │ │ │ │ │ +|#include | │ │ │ │ │ +|#elif TORRENT_USE_SYSTEMCONFIGURATION || TORRENT_USE_SC_NETWORK_REACHABILITY | │ │ │ │ │ +|#include | │ │ │ │ │ +|#elif defined TORRENT_WINDOWS | │ │ │ │ │ +|#include "libtorrent/aux_/throw.hpp" | │ │ │ │ │ +|#include "libtorrent/aux_/disable_warnings_push.hpp" | │ │ │ │ │ +|#include | │ │ │ │ │ +|#ifdef TORRENT_WINRT | │ │ │ │ │ +|#include | │ │ │ │ │ +|#endif | │ │ │ │ │ +|#include | │ │ │ │ │ +|#include "libtorrent/aux_/disable_warnings_pop.hpp" | │ │ │ │ │ |#endif | │ │ │ │ │ -| str = boost::get(&c); | │ │ │ │ │ -| | │ │ │ │ │ -| TORRENT_ASSERT(str); | │ │ │ │ │ -| int const mtu = mtu_for_dest(ep.address()); | │ │ │ │ │ -| str->get_impl()->init_mtu(mtu); | │ │ │ │ │ -| str->get_impl()->m_sock = std::move(socket); | │ │ │ │ │ -| bool const ret = str->get_impl()->incoming_packet(p, ep, receive_time); | │ │ │ │ │ -| if (!ret) return false; | │ │ │ │ │ -| m_last_socket = str->get_impl(); | │ │ │ │ │ -| m_cb(std::move(c)); | │ │ │ │ │ -| // the connection most likely changed its connection ID here | │ │ │ │ │ -| // we need to move it to the correct ID | │ │ │ │ │ -| return true; | │ │ │ │ │ -| } | │ │ │ │ │ | | │ │ │ │ │ -| if (ph->get_type() == ST_RESET) return false; | │ │ │ │ │ +|#include "libtorrent/aux_/netlink_utils.hpp" | │ │ │ │ │ | | │ │ │ │ │ -| // #error send reset | │ │ │ │ │ +|namespace libtorrent { namespace aux { | │ │ │ │ │ | | │ │ │ │ │ -| return false; | │ │ │ │ │ -| } | │ │ │ │ │ +|namespace { | │ │ │ │ │ | | │ │ │ │ │ -|_ _v_o_i_d_ _u_t_p___s_o_c_k_e_t___m_a_n_a_g_e_r_:_:_s_u_b_s_c_r_i_b_e___w_r_i_t_a_b_l_e_(_u_t_p___s_o_c_k_e_t___i_m_p_l_*_ _s_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_m_m_a_p___d_i_s_k___i_o_._c_p_p_:_5_7_8_ _ _ _|_i_n_ _t_h_e_ _f_u_t_u_r_e_,_ _p_r_o_p_a_g_a_t_e_ _e_x_c_e_p_t_i_o_n_s_ _b_a_c_k_ _t_o_ _t_h_e_ _h_a_n_d_l_e_r_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iinn tthhee ffuuttuurree,, pprrooppaaggaattee eexxcceeppttiioonnss bbaacckk ttoo tthhee hhaannddlleerrss ********** | │ │ │ │ │ -|****** ....//ssrrcc//mmmmaapp__ddiisskk__iioo..ccpppp::557788 ****** | │ │ │ │ │ -|#if DEBUG_DISK_THREAD | │ │ │ │ │ -| { | │ │ │ │ │ -| std::unique_lock l(m_job_mutex); | │ │ │ │ │ +|#if (TORRENT_USE_SYSTEMCONFIGURATION || TORRENT_USE_SC_NETWORK_REACHABILITY) && \ | │ │ │ │ │ +| !defined TORRENT_BUILD_SIMULATOR | │ │ │ │ │ | | │ │ │ │ │ -| DLOG("perform_job job: %s ( %s%s) piece: %d offset: %d outstanding: %d\n" | │ │ │ │ │ -| , job_action_name[j->action] | │ │ │ │ │ -| , (j->flags & mmap_disk_job::fence) ? "fence ": "" | │ │ │ │ │ -| , (j->flags & mmap_disk_job::force_copy) ? "force_copy ": "" | │ │ │ │ │ -| , static_cast(j->piece), j->d.io.offset | │ │ │ │ │ -| , j->storage ? j->storage->num_outstanding_jobs() : -1); | │ │ │ │ │ +|// common utilities for Mac and iOS | │ │ │ │ │ +|template void CFRefRetain(T h) { CFRetain(h); } | │ │ │ │ │ +|_t_e_m_p_l_a_t_e_ _<_t_y_p_e_n_a_m_e_ _T_>_ _v_o_i_d_ _C_F_R_e_f_R_e_l_e_a_s_e_(_T_ _h_)_ _{_ _C_F_R_e_l_e_a_s_e_(_h_)_;_ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_l_o_a_d___t_o_r_r_e_n_t_._c_p_p_:_1_2_1_ _ _ _|_m_o_v_e_ _t_h_e_ _l_o_a_d_i_n_g_ _l_o_g_i_c_ _f_r_o_m_ _t_o_r_r_e_n_t___i_n_f_o_ _c_o_n_s_t_r_u_c_t_o_r_ _i_n_t_o_ _h_e_r_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** mmoovvee tthhee llooaaddiinngg llooggiicc ffrroomm ttoorrrreenntt__iinnffoo ccoonnssttrruuccttoorr iinnttoo hheerree ********** | │ │ │ │ │ +|****** ....//ssrrcc//llooaadd__ttoorrrreenntt..ccpppp::112211 ****** | │ │ │ │ │ +|mask.resize(std::size_t(full_size), false); | │ │ │ │ │ +| for (int i = merkle_first_leaf(piece_layer_size) | │ │ │ │ │ +| , end = i + num_pieces; i < end; ++i) | │ │ │ │ │ +| { | │ │ │ │ │ +| mask[std::size_t(i)] = true; | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ +| ti->free_piece_layers(); | │ │ │ │ │ | } | │ │ │ │ │ -|#endif | │ │ │ │ │ +| atp.info_hashes = atp.ti->info_hashes(); | │ │ │ │ │ +| } | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -| std::shared_ptr storage = j->storage; | │ │ │ │ │ +| add_torrent_params load_torrent_file(std::string const& filename) | │ │ │ │ │ +| { return load_torrent_file(filename, load_torrent_limits{}); } | │ │ │ │ │ +| add_torrent_params load_torrent_buffer(span buffer) | │ │ │ │ │ +| { return load_torrent_buffer(buffer, load_torrent_limits{}); } | │ │ │ │ │ +| add_torrent_params load_torrent_parsed(bdecode_node const& torrent_file) | │ │ │ │ │ +| { return load_torrent_parsed(torrent_file, load_torrent_limits{}); } | │ │ │ │ │ | | │ │ │ │ │ -| TORRENT_ASSERT(static_cast(j->action) < int(job_functions.size())); | │ │ │ │ │ +|add_torrent_params load_torrent_file(std::string const& filename, load_torrent_limits const& cfg) | │ │ │ │ │ +|{ | │ │ │ │ │ +| add_torrent_params ret; | │ │ │ │ │ +| ret.ti = std::make_shared(filename, cfg); | │ │ │ │ │ +| update_atp(ret); | │ │ │ │ │ +| return ret; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| m_stats_counters.inc_stats_counter(counters::num_running_disk_jobs, 1); | │ │ │ │ │ +| add_torrent_params load_torrent_buffer(span buffer, load_torrent_limits const& cfg) | │ │ │ │ │ +| { | │ │ │ │ │ +| add_torrent_params ret; | │ │ │ │ │ +| ret.ti = std::make_shared(buffer, cfg, from_span); | │ │ │ │ │ +| update_atp(ret); | │ │ │ │ │ +| return ret; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| // call disk function | │ │ │ │ │ -|status_t ret = status_t::no_error; | │ │ │ │ │ -|try | │ │ │ │ │ -| { | │ │ │ │ │ -| int const idx = static_cast(j->action); | │ │ │ │ │ -| ret = (this->*(job_functions[static_cast(idx)]))(j); | │ │ │ │ │ -| } | │ │ │ │ │ -| catch (boost::system::system_error const& err) | │ │ │ │ │ -| { | │ │ │ │ │ -| ret = status_t::fatal_disk_error; | │ │ │ │ │ -| j->error.ec = err.code(); | │ │ │ │ │ -| j->error.operation = operation_t::exception; | │ │ │ │ │ -| } | │ │ │ │ │ -| catch (std::bad_alloc const&) | │ │ │ │ │ -| { | │ │ │ │ │ -| ret = status_t::fatal_disk_error; | │ │ │ │ │ -| j->error.ec = errors::no_memory; | │ │ │ │ │ -| j->error.operation = operation_t::exception; | │ │ │ │ │ -| } | │ │ │ │ │ -| catch (std::exception const&) | │ │ │ │ │ +| add_torrent_params load_torrent_parsed(bdecode_node const& torrent_file, load_torrent_limits const& cfg) | │ │ │ │ │ +| { | │ │ │ │ │ +| add_torrent_params ret; | │ │ │ │ │ +| ret.ti = std::make_shared(torrent_file, cfg); | │ │ │ │ │ +| update_atp(ret); | │ │ │ │ │ +| return ret; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|_}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_s_e_s_s_i_o_n_._c_p_p_:_5_4_0_ _ _ _ _ _ _ _ _|_I_n_ _C_+_+_1_7_._ _u_s_e_ _i_f_ _c_o_n_s_t_e_x_p_r_ _i_n_s_t_e_a_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** IInn CC++++1177.. uussee iiff ccoonnsstteexxpprr iinnsstteeaadd ********** | │ │ │ │ │ +|****** ....//ssrrcc//sseessssiioonn..ccpppp::554400 ****** | │ │ │ │ │ +|{} | │ │ │ │ │ +| session_proxy::session_proxy(session_proxy const&) = default; | │ │ │ │ │ +| session_proxy& session_proxy::operator=(session_proxy const&) & = default; | │ │ │ │ │ +| session_proxy::session_proxy(session_proxy&&) noexcept = default; | │ │ │ │ │ +| session_proxy& session_proxy::operator=(session_proxy&&) & noexcept = default; | │ │ │ │ │ +| session_proxy::~session_proxy() | │ │ │ │ │ +| { | │ │ │ │ │ +| if (m_thread && m_thread.use_count() == 1) | │ │ │ │ │ | { | │ │ │ │ │ -| ret = status_t::fatal_disk_error; | │ │ │ │ │ -| j->error.ec = boost::asio::error::fault; | │ │ │ │ │ -| j->error.operation = operation_t::exception; | │ │ │ │ │ +|#if defined TORRENT_ASIO_DEBUGGING | │ │ │ │ │ +| wait_for_asio_handlers(); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| m_thread->join(); | │ │ │ │ │ | } | │ │ │ │ │ -| | │ │ │ │ │ -| // note that -2 errors are OK | │ │ │ │ │ -| TORRENT_ASSERT(ret != status_t::fatal_disk_error | │ │ │ │ │ -| || (j->error.ec && j->error.operation != operation_t::unknown)); | │ │ │ │ │ -| | │ │ │ │ │ -|_ _ _m___s_t_a_t_s___c_o_u_n_t_e_r_s_._i_n_c___s_t_a_t_s___c_o_u_n_t_e_r_(_c_o_u_n_t_e_r_s_:_:_n_u_m___r_u_n_n_i_n_g___d_i_s_k___j_o_b_s_,_ _-_1_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/_m_m_a_p___d_i_s_k___i_o_._c_p_p_:_1_0_1_7 |this is potentially very expensive. One way to solve it would be to have a fence for just this one piece. but it hardly seems worth | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_t_h_e_ _c_o_m_p_l_e_x_i_t_y_ _a_n_d_ _c_o_s_t_ _j_u_s_t_ _f_o_r_ _t_h_e_ _e_d_g_e_ _c_a_s_e_ _o_f_ _r_e_c_e_i_v_i_n_g_ _a_ _c_o_r_r_u_p_t_ _p_i_e_c_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss iiss ppootteennttiiaallllyy vveerryy eexxppeennssiivvee.. OOnnee wwaayy ttoo ssoollvvee iitt wwoouulldd bbee ttoo hhaavvee aa ffeennccee ffoorr jjuusstt tthhiiss oonnee ppiieeccee.. bbuutt iitt hhaarrddllyy sseeeemmss wwoorrtthh tthhee ccoommpplleexxiittyy aanndd ccoosstt jjuusstt ffoorr tthhee | │ │ │ │ │ -|eeddggee ccaassee ooff rreecceeiivviinngg aa ccoorrrruupptt ppiieeccee ********** | │ │ │ │ │ -|****** ....//ssrrcc//mmmmaapp__ddiisskk__iioo..ccpppp::11001177 ****** | │ │ │ │ │ -|aux::mmap_disk_job* j = m_job_pool.allocate_job(aux::job_action_t::file_priority); | │ │ │ │ │ -| j->storage = m_torrents[storage]->shared_from_this(); | │ │ │ │ │ -| j->argument = std::move(prios); | │ │ │ │ │ -| j->callback = std::move(handler); | │ │ │ │ │ -| | │ │ │ │ │ -| add_fence_job(j); | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| void mmap_disk_io::async_clear_piece(storage_index_t const storage | │ │ │ │ │ -| , piece_index_t const index, std::function handler) | │ │ │ │ │ +| TORRENT_EXPORT std::unique_ptr default_disk_io_constructor( | │ │ │ │ │ +| io_context& ios, settings_interface const& sett, counters& cnt) | │ │ │ │ │ | { | │ │ │ │ │ -| aux::mmap_disk_job* j = m_job_pool.allocate_job(aux::job_action_t::clear_piece); | │ │ │ │ │ -| j->storage = m_torrents[storage]->shared_from_this(); | │ │ │ │ │ -| j->piece = index; | │ │ │ │ │ -| j->callback = std::move(handler); | │ │ │ │ │ -| | │ │ │ │ │ -| // regular jobs are not guaranteed to be executed in-order | │ │ │ │ │ -| // since clear piece must guarantee that all write jobs that | │ │ │ │ │ -| // have been issued finish before the clear piece job completes | │ │ │ │ │ +|#if TORRENT_HAVE_MMAP || TORRENT_HAVE_MAP_VIEW_OF_FILE | │ │ │ │ │ +|#include "libtorrent/aux_/disable_deprecation_warnings_push.hpp" | │ │ │ │ │ +|if (sizeof(void*) == 8) | │ │ │ │ │ +| return mmap_disk_io_constructor(ios, sett, cnt); | │ │ │ │ │ +| else | │ │ │ │ │ +| return posix_disk_io_constructor(ios, sett, cnt); | │ │ │ │ │ +|#include "libtorrent/aux_/disable_warnings_pop.hpp" | │ │ │ │ │ +|#else | │ │ │ │ │ +| return posix_disk_io_constructor(ios, sett, cnt); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/_m_m_a_p___d_i_s_k___i_o_._c_p_p_:_1_0_2_2 |Perhaps the job queue could be traversed and all jobs for this piece could be cancelled. If there are no threads currently writing | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_t_o_ _t_h_i_s_ _p_i_e_c_e_,_ _w_e_ _c_o_u_l_d_ _s_k_i_p_ _t_h_e_ _f_e_n_c_e_ _a_l_t_o_g_e_t_h_e_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** PPeerrhhaappss tthhee jjoobb qquueeuuee ccoouulldd bbee ttrraavveerrsseedd aanndd aallll jjoobbss ffoorr tthhiiss ppiieeccee ccoouulldd bbee ccaanncceelllleedd.. IIff tthheerree aarree nnoo tthhrreeaaddss ccuurrrreennttllyy wwrriittiinngg ttoo tthhiiss ppiieeccee,, wwee ccoouulldd sskkiipp tthhee ffeennccee| │ │ │ │ │ -|aallttooggeetthheerr ********** | │ │ │ │ │ -|****** ....//ssrrcc//mmmmaapp__ddiisskk__iioo..ccpppp::11002222 ****** | │ │ │ │ │ -|j->storage = m_torrents[storage]->shared_from_this(); | │ │ │ │ │ -| j->argument = std::move(prios); | │ │ │ │ │ -| j->callback = std::move(handler); | │ │ │ │ │ +|_}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_a_l_e_r_t_._c_p_p_:_4_0_4_ _ _ _ _ _ _ _ _ _ _|_m_o_v_e_ _t_h_i_s_ _f_i_e_l_d_ _i_n_t_o_ _t_r_a_c_k_e_r___a_l_e_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** mmoovvee tthhiiss ffiieelldd iinnttoo ttrraacckkeerr__aalleerrtt ********** | │ │ │ │ │ +|****** ....//ssrrcc//aalleerrtt..ccpppp::440044 ****** | │ │ │ │ │ +| return torrent_alert::message() + ": state changed to: " | │ │ │ │ │ +| + state_str[state]; | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| add_fence_job(j); | │ │ │ │ │ +| tracker_error_alert::tracker_error_alert(aux::stack_allocator& alloc | │ │ │ │ │ +| , torrent_handle const& h, tcp::endpoint const& ep, int times | │ │ │ │ │ +| , protocol_version v, string_view u, operation_t const operation | │ │ │ │ │ +| , error_code const& e | │ │ │ │ │ +| , string_view m) | │ │ │ │ │ +| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ +| , times_in_row(times) | │ │ │ │ │ +| , error(e) | │ │ │ │ │ +| , op(operation) | │ │ │ │ │ +| , m_msg_idx(alloc.copy_string(m)) | │ │ │ │ │ +|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ +| , status_code(e && e.category() == http_category() ? e.value() : -1) | │ │ │ │ │ +| , msg(m) | │ │ │ │ │ +|#endif | │ │ │ │ │ +|, version(v) | │ │ │ │ │ +|{ | │ │ │ │ │ +| TORRENT_ASSERT(!u.empty()); | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| void mmap_disk_io::async_clear_piece(storage_index_t const storage | │ │ │ │ │ -| , piece_index_t const index, std::function handler) | │ │ │ │ │ +| char const* tracker_error_alert::failure_reason() const | │ │ │ │ │ | { | │ │ │ │ │ -| aux::mmap_disk_job* j = m_job_pool.allocate_job(aux::job_action_t::clear_piece); | │ │ │ │ │ -| j->storage = m_torrents[storage]->shared_from_this(); | │ │ │ │ │ -| j->piece = index; | │ │ │ │ │ -| j->callback = std::move(handler); | │ │ │ │ │ -| | │ │ │ │ │ -| // regular jobs are not guaranteed to be executed in-order | │ │ │ │ │ -| // since clear piece must guarantee that all write jobs that | │ │ │ │ │ -| // have been issued finish before the clear piece job completes | │ │ │ │ │ -| | │ │ │ │ │ -| | │ │ │ │ │ -|add_fence_job(j); | │ │ │ │ │ -|} | │ │ │ │ │ +| return m_alloc.get().ptr(m_msg_idx); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| status_t mmap_disk_io::do_hash(aux::mmap_disk_job* j) | │ │ │ │ │ +| std::string tracker_error_alert::message() const | │ │ │ │ │ | { | │ │ │ │ │ -| // we're not using a cache. This is the simple path | │ │ │ │ │ -| // just read straight from the file | │ │ │ │ │ -| TORRENT_ASSERT(m_magic == 0x1337); | │ │ │ │ │ -| | │ │ │ │ │ -| bool const v1 = bool(j->flags & disk_interface::v1_hash); | │ │ │ │ │ -| bool const v2 = !j->d.h.block_hashes.empty(); | │ │ │ │ │ -| | │ │ │ │ │ -| int const piece_size = v1 ? j->storage->files().piece_size(j->piece) : 0; | │ │ │ │ │ -| int const piece_size2 = v2 ? j->storage->files().piece_size2(j->piece) : 0; | │ │ │ │ │ -| int const blocks_in_piece = v1 ? (piece_size + default_block_size - 1) / default_block_size : 0; | │ │ │ │ │ -| int const blocks_in_piece2 = v2 ? j->storage->files().blocks_in_piece2(j->piece) : 0; | │ │ │ │ │ -| aux::open_mode_t const file_mode = file_mode_for_job(j); | │ │ │ │ │ +|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ +| return {}; | │ │ │ │ │ +|#else | │ │ │ │ │ +| char ret[400]; | │ │ │ │ │ +| std::snprintf(ret, sizeof(ret), "%s %s %s \"%s\" (%d)" | │ │ │ │ │ +| , tracker_alert::message().c_str() | │ │ │ │ │ +| , version == protocol_version::V1 ? "v1" : "v2" | │ │ │ │ │ +| , convert_from_native(error.message()).c_str(), error_message() | │ │ │ │ │ +| , times_in_row); | │ │ │ │ │ +| return ret; | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| TORRENT_ASSERT(!v2 || int(j->d.h.block_hashes.size()) >= blocks_in_piece2); | │ │ │ │ │ -| TORRENT_ASSERT(v1 || v2); | │ │ │ │ │ +| tracker_warning_alert::tracker_warning_alert(aux::stack_allocator& alloc | │ │ │ │ │ +| , torrent_handle const& h, tcp::endpoint const& ep | │ │ │ │ │ +| , string_view u, protocol_version v, string_view m) | │ │ │ │ │ +| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ +| , m_msg_idx(alloc.copy_string(m)) | │ │ │ │ │ +|_#_i_f_ _T_O_R_R_E_N_T___A_B_I___V_E_R_S_I_O_N_ _=_=_ _1_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_a_l_e_r_t_._c_p_p_:_4_3_8_ _ _ _ _ _ _ _ _ _ _|_m_o_v_e_ _t_h_i_s_ _i_n_t_o_ _t_r_a_c_k_e_r___a_l_e_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** mmoovvee tthhiiss iinnttoo ttrraacckkeerr__aalleerrtt ********** | │ │ │ │ │ +|****** ....//ssrrcc//aalleerrtt..ccpppp::443388 ****** | │ │ │ │ │ +|return {}; | │ │ │ │ │ +|#else | │ │ │ │ │ +| char ret[400]; | │ │ │ │ │ +| std::snprintf(ret, sizeof(ret), "%s %s %s \"%s\" (%d)" | │ │ │ │ │ +| , tracker_alert::message().c_str() | │ │ │ │ │ +| , version == protocol_version::V1 ? "v1" : "v2" | │ │ │ │ │ +| , convert_from_native(error.message()).c_str(), error_message() | │ │ │ │ │ +| , times_in_row); | │ │ │ │ │ +| return ret; | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| hasher h; | │ │ │ │ │ -| int ret = 0; | │ │ │ │ │ -| int offset = 0; | │ │ │ │ │ -| int const blocks_to_read = std::max(blocks_in_piece, blocks_in_piece2); | │ │ │ │ │ -| time_point const start_time = clock_type::now(); | │ │ │ │ │ -| for (int i = 0; i < blocks_to_read; ++i) | │ │ │ │ │ -| { | │ │ │ │ │ -| bool const v2_block = i < blocks_in_piece2; | │ │ │ │ │ +| tracker_warning_alert::tracker_warning_alert(aux::stack_allocator& alloc | │ │ │ │ │ +| , torrent_handle const& h, tcp::endpoint const& ep | │ │ │ │ │ +| , string_view u, protocol_version v, string_view m) | │ │ │ │ │ +| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ +| , m_msg_idx(alloc.copy_string(m)) | │ │ │ │ │ +|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ +| , msg(m) | │ │ │ │ │ +|#endif | │ │ │ │ │ +|, version(v) | │ │ │ │ │ +|{ | │ │ │ │ │ +| TORRENT_ASSERT(!u.empty()); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|_ _ _ _D_L_O_G_(_"_d_o___h_a_s_h_:_ _r_e_a_d_i_n_g_ _(_p_i_e_c_e_:_ _%_d_ _b_l_o_c_k_:_ _%_d_)_\_n_"_,_ _i_n_t_(_j_-_>_p_i_e_c_e_)_,_ _i_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/ |introduce a web-seed default class which has a low download priority | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_w_e_b___c_o_n_n_e_c_t_i_o_n___b_a_s_e_._c_p_p_:_7_2_ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iinnttrroodduuccee aa wweebb--sseeeedd ddeeffaauulltt ccllaassss wwhhiicchh hhaass aa llooww ddoowwnnllooaadd pprriioorriittyy ********** | │ │ │ │ │ -|****** ....//ssrrcc//wweebb__ccoonnnneeccttiioonn__bbaassee..ccpppp::7722 ****** | │ │ │ │ │ -|: peer_connection(pack) | │ │ │ │ │ -| , m_first_request(true) | │ │ │ │ │ -| , m_ssl(false) | │ │ │ │ │ -| , m_external_auth(web.auth) | │ │ │ │ │ -| , m_extra_headers(web.extra_headers) | │ │ │ │ │ -| , m_parser(http_parser::dont_parse_chunks) | │ │ │ │ │ -| , m_body_start(0) | │ │ │ │ │ +| char const* tracker_warning_alert::warning_message() const | │ │ │ │ │ | { | │ │ │ │ │ -| TORRENT_ASSERT(&web.peer_info == pack.peerinfo); | │ │ │ │ │ -| // when going through a proxy, we don't necessarily have an endpoint here, | │ │ │ │ │ -| // since the proxy might be resolving the hostname, not us | │ │ │ │ │ -| TORRENT_ASSERT(web.endpoints.empty() || web.endpoints.front() == pack.endp); | │ │ │ │ │ -| | │ │ │ │ │ -| INVARIANT_CHECK; | │ │ │ │ │ -| | │ │ │ │ │ -| TORRENT_ASSERT(is_outgoing()); | │ │ │ │ │ -| | │ │ │ │ │ -| TORRENT_ASSERT(!m_torrent.lock()->is_upload_only()); | │ │ │ │ │ -| | │ │ │ │ │ -| // we only want left-over bandwidth | │ │ │ │ │ +| return m_alloc.get().ptr(m_msg_idx); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|std::string protocol; | │ │ │ │ │ -| error_code ec; | │ │ │ │ │ -| std::tie(protocol, m_basic_auth, m_host, m_port, m_path) | │ │ │ │ │ -| = parse_url_components(web.url, ec); | │ │ │ │ │ -| TORRENT_ASSERT(!ec); | │ │ │ │ │ +| std::string tracker_warning_alert::message() const | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ +| return {}; | │ │ │ │ │ +|#else | │ │ │ │ │ +| return tracker_alert::message() + (version == protocol_version::V1 ? " v1" : " v2") + " warning: " + warning_message(); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| if (m_port == -1 && protocol == "http") | │ │ │ │ │ -| m_port = 80; | │ │ │ │ │ +| scrape_reply_alert::scrape_reply_alert(aux::stack_allocator& alloc | │ │ │ │ │ +| , torrent_handle const& h, tcp::endpoint const& ep | │ │ │ │ │ +| , int incomp, int comp, string_view u, protocol_version const v) | │ │ │ │ │ +| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ +| , incomplete(incomp) | │ │ │ │ │ +|_ _ _,_ _c_o_m_p_l_e_t_e_(_c_o_m_p_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_a_l_e_r_t_._c_p_p_:_4_6_4_ _ _ _ _ _ _ _ _ _ _|_m_o_v_e_ _t_h_i_s_ _i_n_t_o_ _t_r_a_c_k_e_r___a_l_e_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** mmoovvee tthhiiss iinnttoo ttrraacckkeerr__aalleerrtt ********** | │ │ │ │ │ +|****** ....//ssrrcc//aalleerrtt..ccpppp::446644 ****** | │ │ │ │ │ +|char const* tracker_warning_alert::warning_message() const | │ │ │ │ │ +| { | │ │ │ │ │ +| return m_alloc.get().ptr(m_msg_idx); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|#if TORRENT_USE_SSL | │ │ │ │ │ -| if (protocol == "https") | │ │ │ │ │ -| { | │ │ │ │ │ -| m_ssl = true; | │ │ │ │ │ -| if (m_port == -1) m_port = 443; | │ │ │ │ │ -| } | │ │ │ │ │ +| std::string tracker_warning_alert::message() const | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ +| return {}; | │ │ │ │ │ +|#else | │ │ │ │ │ +| return tracker_alert::message() + (version == protocol_version::V1 ? " v1" : " v2") + " warning: " + warning_message(); | │ │ │ │ │ |#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| if (!m_basic_auth.empty()) | │ │ │ │ │ -| m_basic_auth = base64encode(m_basic_auth); | │ │ │ │ │ -| | │ │ │ │ │ -| m_server_string = m_host; | │ │ │ │ │ -| aux::verify_encoding(m_server_string); | │ │ │ │ │ +| scrape_reply_alert::scrape_reply_alert(aux::stack_allocator& alloc | │ │ │ │ │ +| , torrent_handle const& h, tcp::endpoint const& ep | │ │ │ │ │ +| , int incomp, int comp, string_view u, protocol_version const v) | │ │ │ │ │ +| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ +| , incomplete(incomp) | │ │ │ │ │ +| , complete(comp) | │ │ │ │ │ +|, version(v) | │ │ │ │ │ +|{ | │ │ │ │ │ +| TORRENT_ASSERT(!u.empty()); | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| int web_connection_base::timeout() const | │ │ │ │ │ +| std::string scrape_reply_alert::message() const | │ │ │ │ │ | { | │ │ │ │ │ -| // since this is a web seed, change the timeout | │ │ │ │ │ -| // according to the settings. | │ │ │ │ │ -| return m_settings.get_int(settings_pack::urlseed_timeout); | │ │ │ │ │ -|_ _}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_t_o_r_r_e_n_t___i_n_f_o_._c_p_p_:_8_8_7_ _ _ _|_t_h_i_s_ _s_h_o_u_l_d_ _b_e_ _c_o_n_s_i_d_e_r_e_d_ _a_ _f_a_i_l_u_r_e_,_ _a_n_d_ _t_h_e_ _._t_o_r_r_e_n_t_ _f_i_l_e_ _r_e_j_e_c_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** tthhiiss sshhoouulldd bbee ccoonnssiiddeerreedd aa ffaaiilluurree,, aanndd tthhee ..ttoorrrreenntt ffiillee rreejjeecctteedd ********** | │ │ │ │ │ -|****** ....//ssrrcc//ttoorrrreenntt__iinnffoo..ccpppp::888877 ****** | │ │ │ │ │ -|std::string ext = extension(filename); | │ │ │ │ │ -| int cnt = 0; | │ │ │ │ │ -| for (;;) | │ │ │ │ │ -| { | │ │ │ │ │ -| ++cnt; | │ │ │ │ │ -| char new_ext[50]; | │ │ │ │ │ -| std::snprintf(new_ext, sizeof(new_ext), ".%d%s", cnt, ext.c_str()); | │ │ │ │ │ -| filename = base + new_ext; | │ │ │ │ │ +|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ +| return {}; | │ │ │ │ │ +|#else | │ │ │ │ │ +| char ret[400]; | │ │ │ │ │ +| std::snprintf(ret, sizeof(ret), "%s %s scrape reply: %d %d" | │ │ │ │ │ +| , tracker_alert::message().c_str() | │ │ │ │ │ +| , version == protocol_version::V1 ? "v1" : "v2" | │ │ │ │ │ +| , incomplete, complete); | │ │ │ │ │ +| return ret; | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| boost::crc_optimal<32, 0x1EDC6F41, 0xFFFFFFFF, 0xFFFFFFFF, true, true> crc; | │ │ │ │ │ -| process_string_lowercase(crc, filename); | │ │ │ │ │ -| std::uint32_t const new_hash = crc.checksum(); | │ │ │ │ │ -| if (files.find(new_hash) == files.end()) | │ │ │ │ │ -| { | │ │ │ │ │ -| files.insert({new_hash, {i, 0}}); | │ │ │ │ │ -| break; | │ │ │ │ │ -| } | │ │ │ │ │ -| ++num_collisions; | │ │ │ │ │ -| if (num_collisions > 100) | │ │ │ │ │ -| { | │ │ │ │ │ -|} | │ │ │ │ │ -|} | │ │ │ │ │ +| scrape_failed_alert::scrape_failed_alert(aux::stack_allocator& alloc | │ │ │ │ │ +| , torrent_handle const& h, tcp::endpoint const& ep | │ │ │ │ │ +| , string_view u, protocol_version const v, error_code const& e) | │ │ │ │ │ +| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ +| , error(e) | │ │ │ │ │ +| , m_msg_idx() | │ │ │ │ │ +|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ +| , msg(convert_from_native(e.message())) | │ │ │ │ │ +|_#_e_n_d_i_f_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_a_l_e_r_t_._c_p_p_:_4_9_3_ _ _ _ _ _ _ _ _ _ _|_m_o_v_e_ _t_h_i_s_ _i_n_t_o_ _t_r_a_c_k_e_r___a_l_e_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** mmoovvee tthhiiss iinnttoo ttrraacckkeerr__aalleerrtt ********** | │ │ │ │ │ +|****** ....//ssrrcc//aalleerrtt..ccpppp::449933 ****** | │ │ │ │ │ +|return {}; | │ │ │ │ │ +|#else | │ │ │ │ │ +| char ret[400]; | │ │ │ │ │ +| std::snprintf(ret, sizeof(ret), "%s %s scrape reply: %d %d" | │ │ │ │ │ +| , tracker_alert::message().c_str() | │ │ │ │ │ +| , version == protocol_version::V1 ? "v1" : "v2" | │ │ │ │ │ +| , incomplete, complete); | │ │ │ │ │ +| return ret; | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| copy_on_write(); | │ │ │ │ │ -| m_files.rename_file(i, filename); | │ │ │ │ │ -| } | │ │ │ │ │ +| scrape_failed_alert::scrape_failed_alert(aux::stack_allocator& alloc | │ │ │ │ │ +| , torrent_handle const& h, tcp::endpoint const& ep | │ │ │ │ │ +| , string_view u, protocol_version const v, error_code const& e) | │ │ │ │ │ +| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ +| , error(e) | │ │ │ │ │ +| , m_msg_idx() | │ │ │ │ │ +|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ +| , msg(convert_from_native(e.message())) | │ │ │ │ │ +|#endif | │ │ │ │ │ +|, version(v) | │ │ │ │ │ +|{ | │ │ │ │ │ +| TORRENT_ASSERT(!u.empty()); | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| void torrent_info::remap_files(file_storage const& f) | │ │ │ │ │ +| scrape_failed_alert::scrape_failed_alert(aux::stack_allocator& alloc | │ │ │ │ │ +| , torrent_handle const& h, tcp::endpoint const& ep | │ │ │ │ │ +| , string_view u, string_view m) | │ │ │ │ │ +| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ +| , error(errors::tracker_failure) | │ │ │ │ │ +| , m_msg_idx(alloc.copy_string(m)) | │ │ │ │ │ +|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ +| , msg(m) | │ │ │ │ │ +|#endif | │ │ │ │ │ | { | │ │ │ │ │ -| INVARIANT_CHECK; | │ │ │ │ │ -| | │ │ │ │ │ -| TORRENT_ASSERT(is_loaded()); | │ │ │ │ │ -| // the new specified file storage must have the exact | │ │ │ │ │ -| // same size as the current file storage | │ │ │ │ │ -| TORRENT_ASSERT(m_files.total_size() == f.total_size()); | │ │ │ │ │ +| TORRENT_ASSERT(!u.empty()); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| if (m_files.total_size() != f.total_size()) return; | │ │ │ │ │ -| copy_on_write(); | │ │ │ │ │ -| m_files = f; | │ │ │ │ │ -| m_files.set_num_pieces(m_orig_files->num_pieces()); | │ │ │ │ │ -| m_files.set_piece_length(m_orig_files->piece_length()); | │ │ │ │ │ +| char const* scrape_failed_alert::error_message() const | │ │ │ │ │ +| { | │ │ │ │ │ +| if (m_msg_idx == aux::allocation_slot()) return ""; | │ │ │ │ │ +| else return m_alloc.get().ptr(m_msg_idx); | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ -| // standard constructor that parses a torrent file | │ │ │ │ │ -| torrent_info::torrent_info(entry const& torrent_file) | │ │ │ │ │ +| std::string scrape_failed_alert::message() const | │ │ │ │ │ | { | │ │ │ │ │ -| std::vector tmp; | │ │ │ │ │ -| std::back_insert_iterator> out(tmp); | │ │ │ │ │ -|_ _ _b_e_n_c_o_d_e_(_o_u_t_,_ _t_o_r_r_e_n_t___f_i_l_e_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_l_o_a_d___t_o_r_r_e_n_t_._c_p_p_:_1_2_1_ _ _ _|_m_o_v_e_ _t_h_e_ _l_o_a_d_i_n_g_ _l_o_g_i_c_ _f_r_o_m_ _t_o_r_r_e_n_t___i_n_f_o_ _c_o_n_s_t_r_u_c_t_o_r_ _i_n_t_o_ _h_e_r_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** mmoovvee tthhee llooaaddiinngg llooggiicc ffrroomm ttoorrrreenntt__iinnffoo ccoonnssttrruuccttoorr iinnttoo hheerree ********** | │ │ │ │ │ -|****** ....//ssrrcc//llooaadd__ttoorrrreenntt..ccpppp::112211 ****** | │ │ │ │ │ -|mask.resize(std::size_t(full_size), false); | │ │ │ │ │ -| for (int i = merkle_first_leaf(piece_layer_size) | │ │ │ │ │ -| , end = i + num_pieces; i < end; ++i) | │ │ │ │ │ -| { | │ │ │ │ │ -| mask[std::size_t(i)] = true; | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| ti->free_piece_layers(); | │ │ │ │ │ -| } | │ │ │ │ │ -| atp.info_hashes = atp.ti->info_hashes(); | │ │ │ │ │ +|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ +| return {}; | │ │ │ │ │ +|#else | │ │ │ │ │ +| return tracker_alert::message() + " scrape failed: " + error_message(); | │ │ │ │ │ +|_#_e_n_d_i_f_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_a_l_e_r_t_._c_p_p_:_5_3_2_ _ _ _ _ _ _ _ _ _ _|_m_o_v_e_ _t_h_i_s_ _f_i_e_l_d_ _i_n_t_o_ _t_r_a_c_k_e_r___a_l_e_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** mmoovvee tthhiiss ffiieelldd iinnttoo ttrraacckkeerr__aalleerrtt ********** | │ │ │ │ │ +|****** ....//ssrrcc//aalleerrtt..ccpppp::553322 ****** | │ │ │ │ │ +|char const* scrape_failed_alert::error_message() const | │ │ │ │ │ +| { | │ │ │ │ │ +| if (m_msg_idx == aux::allocation_slot()) return ""; | │ │ │ │ │ +| else return m_alloc.get().ptr(m_msg_idx); | │ │ │ │ │ | } | │ │ │ │ │ -|} | │ │ │ │ │ | | │ │ │ │ │ -| add_torrent_params load_torrent_file(std::string const& filename) | │ │ │ │ │ -| { return load_torrent_file(filename, load_torrent_limits{}); } | │ │ │ │ │ -| add_torrent_params load_torrent_buffer(span buffer) | │ │ │ │ │ -| { return load_torrent_buffer(buffer, load_torrent_limits{}); } | │ │ │ │ │ -| add_torrent_params load_torrent_parsed(bdecode_node const& torrent_file) | │ │ │ │ │ -| { return load_torrent_parsed(torrent_file, load_torrent_limits{}); } | │ │ │ │ │ +| std::string scrape_failed_alert::message() const | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ +| return {}; | │ │ │ │ │ +|#else | │ │ │ │ │ +| return tracker_alert::message() + " scrape failed: " + error_message(); | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|add_torrent_params load_torrent_file(std::string const& filename, load_torrent_limits const& cfg) | │ │ │ │ │ +| tracker_reply_alert::tracker_reply_alert(aux::stack_allocator& alloc | │ │ │ │ │ +| , torrent_handle const& h, tcp::endpoint const& ep | │ │ │ │ │ +| , int np, protocol_version v, string_view u) | │ │ │ │ │ +| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ +| , num_peers(np) | │ │ │ │ │ +|, version(v) | │ │ │ │ │ |{ | │ │ │ │ │ -| add_torrent_params ret; | │ │ │ │ │ -| ret.ti = std::make_shared(filename, cfg); | │ │ │ │ │ -| update_atp(ret); | │ │ │ │ │ -| return ret; | │ │ │ │ │ +| TORRENT_ASSERT(!u.empty()); | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| add_torrent_params load_torrent_buffer(span buffer, load_torrent_limits const& cfg) | │ │ │ │ │ +| std::string tracker_reply_alert::message() const | │ │ │ │ │ | { | │ │ │ │ │ -| add_torrent_params ret; | │ │ │ │ │ -| ret.ti = std::make_shared(buffer, cfg, from_span); | │ │ │ │ │ -| update_atp(ret); | │ │ │ │ │ +|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ +| return {}; | │ │ │ │ │ +|#else | │ │ │ │ │ +| char ret[400]; | │ │ │ │ │ +| std::snprintf(ret, sizeof(ret), "%s %s received peers: %d" | │ │ │ │ │ +| , tracker_alert::message().c_str() | │ │ │ │ │ +| , version == protocol_version::V1 ? "v1" : "v2" | │ │ │ │ │ +| , num_peers); | │ │ │ │ │ | return ret; | │ │ │ │ │ +|#endif | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -| add_torrent_params load_torrent_parsed(bdecode_node const& torrent_file, load_torrent_limits const& cfg) | │ │ │ │ │ +| dht_reply_alert::dht_reply_alert(aux::stack_allocator& alloc | │ │ │ │ │ +| , torrent_handle const& h | │ │ │ │ │ +| , int np) | │ │ │ │ │ +| : tracker_alert(alloc, h, {}, "") | │ │ │ │ │ +| , num_peers(np) | │ │ │ │ │ +| {} | │ │ │ │ │ +| | │ │ │ │ │ +| std::string dht_reply_alert::message() const | │ │ │ │ │ | { | │ │ │ │ │ -| add_torrent_params ret; | │ │ │ │ │ -| ret.ti = std::make_shared(torrent_file, cfg); | │ │ │ │ │ -| update_atp(ret); | │ │ │ │ │ +|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ +| return {}; | │ │ │ │ │ +|_#_e_l_s_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_a_l_e_r_t_._c_p_p_:_5_7_6_ _ _ _ _ _ _ _ _ _ _|_m_o_v_e_ _t_h_i_s_ _t_o_ _t_r_a_c_k_e_r___a_l_e_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** mmoovvee tthhiiss ttoo ttrraacckkeerr__aalleerrtt ********** | │ │ │ │ │ +|****** ....//ssrrcc//aalleerrtt..ccpppp::557766 ****** | │ │ │ │ │ +|, num_peers(np) | │ │ │ │ │ +| {} | │ │ │ │ │ +| | │ │ │ │ │ +| std::string dht_reply_alert::message() const | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ +| return {}; | │ │ │ │ │ +|#else | │ │ │ │ │ +| char ret[400]; | │ │ │ │ │ +| std::snprintf(ret, sizeof(ret), "%s received DHT peers: %d" | │ │ │ │ │ +| , tracker_alert::message().c_str(), num_peers); | │ │ │ │ │ | return ret; | │ │ │ │ │ +|#endif | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -|_}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/_a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s_._c_p_p_:|pre C++17, GCC and msvc does not make std::string nothrow move assignable, which means no type containing a string will be nothrow | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_7_8_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_m_o_v_e_ _a_s_s_i_g_n_a_b_l_e_ _b_y_ _d_e_f_a_u_l_t_ _e_i_t_h_e_r_ _s_t_a_t_i_c___a_s_s_e_r_t_(_s_t_d_:_:_i_s___n_o_t_h_r_o_w___m_o_v_e___a_s_s_i_g_n_a_b_l_e_:_:_v_a_l_u_e_ _,_ _"_s_h_o_u_l_d_ _b_e_ _n_o_t_h_r_o_w_ _m_o_v_e_ _a_s_s_i_g_n_a_b_l_e_"_)_;_ _ _ _ _ _ | │ │ │ │ │ -|********** pprree CC++++1177,, GGCCCC aanndd mmssvvcc ddooeess nnoott mmaakkee ssttdd::::ssttrriinngg nnootthhrrooww mmoovvee aassssiiggnnaabbllee,, wwhhiicchh mmeeaannss nnoo ttyyppee ccoonnttaaiinniinngg aa ssttrriinngg wwiillll bbee nnootthhrrooww mmoovvee aassssiiggnnaabbllee bbyy ddeeffaauulltt eeiitthheerr | │ │ │ │ │ -|ssttaattiicc__aasssseerrtt((ssttdd::::iiss__nnootthhrrooww__mmoovvee__aassssiiggnnaabbllee::::vvaalluuee ,, ""sshhoouulldd bbee nnootthhrrooww mmoovvee aassssiiggnnaabbllee""));; ********** | │ │ │ │ │ -|****** ....//ssrrcc//aadddd__ttoorrrreenntt__ppaarraammss..ccpppp::7788 ****** | │ │ │ │ │ -|DECL_FLAG(sequential_download); | │ │ │ │ │ -| DECL_FLAG(pinned); | │ │ │ │ │ -| DECL_FLAG(stop_when_ready); | │ │ │ │ │ -| DECL_FLAG(override_trackers); | │ │ │ │ │ -| DECL_FLAG(override_web_seeds); | │ │ │ │ │ -| DECL_FLAG(need_save_resume); | │ │ │ │ │ -| DECL_FLAG(override_resume_data); | │ │ │ │ │ -| DECL_FLAG(merge_resume_trackers); | │ │ │ │ │ -| DECL_FLAG(use_resume_save_path); | │ │ │ │ │ -| DECL_FLAG(merge_resume_http_seeds); | │ │ │ │ │ -| DECL_FLAG(default_flags); | │ │ │ │ │ -|#undef DECL_FLAG | │ │ │ │ │ -|#endif // TORRENT_ABI_VERSION | │ │ │ │ │ +| tracker_announce_alert::tracker_announce_alert(aux::stack_allocator& alloc | │ │ │ │ │ +| , torrent_handle const& h, tcp::endpoint const& ep, string_view u | │ │ │ │ │ +| , protocol_version const v, event_t const e) | │ │ │ │ │ +| : tracker_alert(alloc, h, ep, u) | │ │ │ │ │ +| , event(e) | │ │ │ │ │ +|, version(v) | │ │ │ │ │ +|{ | │ │ │ │ │ +| TORRENT_ASSERT(!u.empty()); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| static_assert(std::is_nothrow_move_constructible::value | │ │ │ │ │ -| , "should be nothrow move constructible"); | │ │ │ │ │ +| std::string tracker_announce_alert::message() const | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ +| return {}; | │ │ │ │ │ +|#else | │ │ │ │ │ +| static const char* const event_str[] = {"none", "completed", "started", "stopped", "paused"}; | │ │ │ │ │ +| return tracker_alert::message() | │ │ │ │ │ +| + (version == protocol_version::V1 ? " v1" : " v2") | │ │ │ │ │ +| + " sending announce (" + event_str[static_cast(event)] + ")"; | │ │ │ │ │ +|#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| static_assert(std::is_nothrow_move_constructible::value | │ │ │ │ │ -| , "should be nothrow move constructible"); | │ │ │ │ │ +| hash_failed_alert::hash_failed_alert( | │ │ │ │ │ +| aux::stack_allocator& alloc | │ │ │ │ │ +| , torrent_handle const& h | │ │ │ │ │ +| , piece_index_t index) | │ │ │ │ │ +| : torrent_alert(alloc, h) | │ │ │ │ │ +| , piece_index(index) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(index >= piece_index_t(0)); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/_a_d_d___t_o_r_r_e_n_t___p_a_r_a_m_s_._c_p_p_:|it would be nice if this was nothrow default constructible static_assert(std::is_nothrow_default_constructible::value , "should be | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_8_4_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_n_o_t_h_r_o_w_ _d_e_f_a_u_l_t_ _c_o_n_s_t_r_u_c_t_i_b_l_e_"_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iitt wwoouulldd bbee nniiccee iiff tthhiiss wwaass nnootthhrrooww ddeeffaauulltt ccoonnssttrruuccttiibbllee ssttaattiicc__aasssseerrtt((ssttdd::::iiss__nnootthhrrooww__ddeeffaauulltt__ccoonnssttrruuccttiibbllee::::vvaalluuee ,, ""sshhoouulldd bbee nnootthhrrooww ddeeffaauulltt ccoonnssttrruuccttiibbllee""));; **********| │ │ │ │ │ -|****** ....//ssrrcc//aadddd__ttoorrrreenntt__ppaarraammss..ccpppp::8844 ****** | │ │ │ │ │ -|DECL_FLAG(pinned); | │ │ │ │ │ -| DECL_FLAG(stop_when_ready); | │ │ │ │ │ -| DECL_FLAG(override_trackers); | │ │ │ │ │ -| DECL_FLAG(override_web_seeds); | │ │ │ │ │ -| DECL_FLAG(need_save_resume); | │ │ │ │ │ -| DECL_FLAG(override_resume_data); | │ │ │ │ │ -| DECL_FLAG(merge_resume_trackers); | │ │ │ │ │ -| DECL_FLAG(use_resume_save_path); | │ │ │ │ │ -| DECL_FLAG(merge_resume_http_seeds); | │ │ │ │ │ -| DECL_FLAG(default_flags); | │ │ │ │ │ -|#undef DECL_FLAG | │ │ │ │ │ -|#endif // TORRENT_ABI_VERSION | │ │ │ │ │ +| std::string hash_failed_alert::message() const | │ │ │ │ │ +| { | │ │ │ │ │ +|#ifdef TORRENT_DISABLE_ALERT_MSG | │ │ │ │ │ +|_ _ _r_e_t_u_r_n_ _{_}_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_k_a_d_e_m_l_i_a_/_i_t_e_m_._c_p_p_:_1_4_3_ _ _|_i_m_p_l_e_m_e_n_t_ _c_t_o_r_ _f_o_r_ _e_n_t_r_y_ _f_r_o_m_ _b_d_e_c_o_d_e___n_o_d_e_?_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iimmpplleemmeenntt ccttoorr ffoorr eennttrryy ffrroomm bbddeeccooddee__nnooddee?? ********** | │ │ │ │ │ +|****** ....//ssrrcc//kkaaddeemmlliiaa//iitteemm..ccpppp::114433 ****** | │ │ │ │ │ +|, secret_key const& sk) | │ │ │ │ │ +|{ | │ │ │ │ │ +| char str[1200]; | │ │ │ │ │ +| int const len = canonical_string(v, seq, salt, str); | │ │ │ │ │ | | │ │ │ │ │ -| static_assert(std::is_nothrow_move_constructible::value | │ │ │ │ │ -| , "should be nothrow move constructible"); | │ │ │ │ │ +| return ed25519_sign({str, len}, pk, sk); | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -| static_assert(std::is_nothrow_move_constructible::value | │ │ │ │ │ -| , "should be nothrow move constructible"); | │ │ │ │ │ +|item::item(public_key const& pk, span salt) | │ │ │ │ │ +| : m_salt(salt.data(), static_cast(salt.size())) | │ │ │ │ │ +| , m_pk(pk) | │ │ │ │ │ +| , m_mutable(true) | │ │ │ │ │ +|{} | │ │ │ │ │ | | │ │ │ │ │ +|item::item(entry v) | │ │ │ │ │ +| : m_value(std::move(v)) | │ │ │ │ │ +|{} | │ │ │ │ │ | | │ │ │ │ │ +|item::item(bdecode_node const& v) | │ │ │ │ │ +|{ | │ │ │ │ │ +|m_value = v; | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -|namespace aux { | │ │ │ │ │ +|item::item(entry v, span salt | │ │ │ │ │ +| , sequence_number const seq, public_key const& pk, secret_key const& sk) | │ │ │ │ │ +|{ | │ │ │ │ │ +| assign(std::move(v), salt, seq, pk, sk); | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -| // returns whether this add_torrent_params object has "resume-data", i.e. | │ │ │ │ │ -| // information about which pieces we have. | │ │ │ │ │ -| bool contains_resume_data(add_torrent_params const& atp) | │ │ │ │ │ -| { | │ │ │ │ │ -| return !atp.have_pieces.empty() | │ │ │ │ │ -| || (atp.flags & torrent_flags::seed_mode); | │ │ │ │ │ -| } | │ │ │ │ │ +|void item::assign(entry v) | │ │ │ │ │ +|{ | │ │ │ │ │ +| m_mutable = false; | │ │ │ │ │ +| m_value = std::move(v); | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ -|_}_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|void item::assign(entry v, span salt | │ │ │ │ │ +| , sequence_number const seq, public_key const& pk, secret_key const& sk) | │ │ │ │ │ +|{ | │ │ │ │ │ +| std::array buffer; | │ │ │ │ │ +| int const bsize = bencode(buffer.begin(), v); | │ │ │ │ │ +| TORRENT_ASSERT(bsize <= 1000); | │ │ │ │ │ +| m_sig = sign_mutable_item(span(buffer).first(bsize) | │ │ │ │ │ +| , salt, seq, pk, sk); | │ │ │ │ │ +| m_salt.assign(salt.data(), static_cast(salt.size())); | │ │ │ │ │ +| m_pk = pk; | │ │ │ │ │ +| m_seq = seq; | │ │ │ │ │ +| m_mutable = true; | │ │ │ │ │ +| m_value = std::move(v); | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|_v_o_i_d_ _i_t_e_m_:_:_a_s_s_i_g_n_(_b_d_e_c_o_d_e___n_o_d_e_ _c_o_n_s_t_&_ _v_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_k_a_d_e_m_l_i_a_/_n_o_d_e_._c_p_p_:_1_1_7_7_ _|_k_e_e_p_ _t_h_e_ _r_e_t_u_r_n_e_d_ _v_a_l_u_e_ _t_o_ _p_a_s_s_ _a_s_ _a_ _l_i_m_i_t_ _t_o_ _w_r_i_t_e___n_o_d_e_s___e_n_t_r_i_e_s_ _w_h_e_n_ _i_m_p_l_e_m_e_n_t_e_d_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** kkeeeepp tthhee rreettuurrnneedd vvaalluuee ttoo ppaassss aass aa lliimmiitt ttoo wwrriittee__nnooddeess__eennttrriieess wwhheenn iimmpplleemmeenntteedd ********** | │ │ │ │ │ |****** ....//ssrrcc//kkaaddeemmlliiaa//nnooddee..ccpppp::11117777 ****** | │ │ │ │ │ |} | │ │ │ │ │ | } | │ │ │ │ │ | else if (query == "sample_infohashes") | │ │ │ │ │ | { | │ │ │ │ │ @@ -10618,226 +10672,14 @@ │ │ │ │ │ | std::vector const n = wanted_node->m_table.find_node(info_hash, {}); | │ │ │ │ │ | r[wanted_node->protocol_nodes_key()] = write_nodes_entry(n); | │ │ │ │ │ | } | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ |node::protocol_descriptor const& node::map_protocol_to_descriptor(udp const protocol) | │ │ │ │ │ |_{_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/_k_a_d_e_m_l_i_a_/_p_u_t___d_a_t_a_._c_p_p_: |what if o is not an instance of put_data_observer? This need to be redesigned for better type safety. | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_9_2_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** wwhhaatt iiff oo iiss nnoott aann iinnssttaannccee ooff ppuutt__ddaattaa__oobbsseerrvveerr?? TThhiiss nneeeedd ttoo bbee rreeddeessiiggnneedd ffoorr bbeetttteerr ttyyppee ssaaffeettyy.. ********** | │ │ │ │ │ -|****** ....//ssrrcc//kkaaddeemmlliiaa//ppuutt__ddaattaa..ccpppp::9922 ****** | │ │ │ │ │ -|} | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|void put_data::done() | │ │ │ │ │ -|{ | │ │ │ │ │ -| m_done = true; | │ │ │ │ │ -| | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| get_node().observer()->log(dht_logger::traversal, "[%u] %s DONE, response %d, timeout %d" | │ │ │ │ │ -| , id(), name(), num_responses(), num_timeouts()); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| m_put_callback(m_data, num_responses()); | │ │ │ │ │ -| traversal_algorithm::done(); | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|bool put_data::invoke(observer_ptr o) | │ │ │ │ │ -|{ | │ │ │ │ │ -| if (m_done) return false; | │ │ │ │ │ -| | │ │ │ │ │ -|auto* po = static_cast(o.get()); | │ │ │ │ │ -| | │ │ │ │ │ -| entry e; | │ │ │ │ │ -| e["y"] = "q"; | │ │ │ │ │ -| e["q"] = "put"; | │ │ │ │ │ -| entry& a = e["a"]; | │ │ │ │ │ -| a["v"] = m_data.value(); | │ │ │ │ │ -| a["token"] = po->m_token; | │ │ │ │ │ -| if (m_data.is_mutable()) | │ │ │ │ │ -| { | │ │ │ │ │ -| a["k"] = m_data.pk().bytes; | │ │ │ │ │ -| a["seq"] = m_data.seq().value; | │ │ │ │ │ -| a["sig"] = m_data.sig().bytes; | │ │ │ │ │ -| if (!m_data.salt().empty()) | │ │ │ │ │ -| { | │ │ │ │ │ -| a["salt"] = m_data.salt(); | │ │ │ │ │ -| } | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| m_node.stats_counters().inc_stats_counter(counters::dht_put_out); | │ │ │ │ │ -| | │ │ │ │ │ -| return m_node.m_rpc.invoke(e, o->target_ep(), o); | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|_}_ _}_ _/_/_ _n_a_m_e_s_p_a_c_e_ _l_i_b_t_o_r_r_e_n_t_:_:_d_h_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/_k_a_d_e_m_l_i_a_/_n_o_d_e___i_d_._c_p_p_:_6_6|it's a little bit weird to return 159 - leading zeroes. It should probably be 160 - leading zeroes, but all other code in here is | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_t_u_n_e_d_ _t_o_ _t_h_i_s_ _e_x_p_e_c_t_a_t_i_o_n_ _n_o_w_,_ _a_n_d_ _i_t_ _d_o_e_s_n_'_t_ _r_e_a_l_l_y_ _m_a_t_t_e_r_ _(_o_t_h_e_r_ _t_h_a_n_ _c_o_m_p_l_e_x_i_t_y_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iitt''ss aa lliittttllee bbiitt wweeiirrdd ttoo rreettuurrnn 115599 -- lleeaaddiinngg zzeerrooeess.. IItt sshhoouulldd pprroobbaabbllyy bbee 116600 -- lleeaaddiinngg zzeerrooeess,, bbuutt aallll ootthheerr ccooddee iinn hheerree iiss ttuunneedd ttoo tthhiiss eexxppeeccttaattiioonn nnooww,, aanndd iitt | │ │ │ │ │ -|ddooeessnn''tt rreeaallllyy mmaatttteerr ((ootthheerr tthhaann ccoommpplleexxiittyy)) ********** | │ │ │ │ │ -|****** ....//ssrrcc//kkaaddeemmlliiaa//nnooddee__iidd..ccpppp::6666 ****** | │ │ │ │ │ -|// returns the distance between the two nodes | │ │ │ │ │ -|// using the kademlia XOR-metric | │ │ │ │ │ -|node_id distance(node_id const& n1, node_id const& n2) | │ │ │ │ │ -|{ | │ │ │ │ │ -| return n1 ^ n2; | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|// returns true if: distance(n1, ref) < distance(n2, ref) | │ │ │ │ │ -|bool compare_ref(node_id const& n1, node_id const& n2, node_id const& ref) | │ │ │ │ │ -|{ | │ │ │ │ │ -| node_id const lhs = n1 ^ ref; | │ │ │ │ │ -| node_id const rhs = n2 ^ ref; | │ │ │ │ │ -| return lhs < rhs; | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|// returns n in: 2^n <= distance(n1, n2) < 2^(n+1) | │ │ │ │ │ -|// useful for finding out which bucket a node belongs to | │ │ │ │ │ -|int distance_exp(node_id const& n1, node_id const& n2) | │ │ │ │ │ -|{ | │ │ │ │ │ -|return std::max(159 - distance(n1, n2).count_leading_zeroes(), 0); | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|int min_distance_exp(node_id const& n1, std::vector const& ids) | │ │ │ │ │ -|{ | │ │ │ │ │ -| TORRENT_ASSERT(ids.size() > 0); | │ │ │ │ │ -| | │ │ │ │ │ -| int min = 160; // see distance_exp for the why of this constant | │ │ │ │ │ -| for (auto const& node_id : ids) | │ │ │ │ │ -| { | │ │ │ │ │ -| min = std::min(min, distance_exp(n1, node_id)); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| return min; | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|node_id generate_id_impl(address const& ip_, std::uint32_t r) | │ │ │ │ │ -|{ | │ │ │ │ │ -| std::uint8_t* ip = nullptr; | │ │ │ │ │ -| | │ │ │ │ │ -| static std::uint8_t const v4mask[] = { 0x03, 0x0f, 0x3f, 0xff }; | │ │ │ │ │ -| static std::uint8_t const v6mask[] = { 0x01, 0x03, 0x07, 0x0f, 0x1f, 0x3f, 0x7f, 0xff }; | │ │ │ │ │ -| std::uint8_t const* mask = nullptr; | │ │ │ │ │ -| int num_octets = 0; | │ │ │ │ │ -| | │ │ │ │ │ -| address_v4::bytes_type b4{}; | │ │ │ │ │ -| address_v6::bytes_type b6{}; | │ │ │ │ │ -| if (ip_.is_v6()) | │ │ │ │ │ -| { | │ │ │ │ │ -| b6 = ip_.to_v6().to_bytes(); | │ │ │ │ │ -|_ _ _i_p_ _=_ _b_6_._d_a_t_a_(_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_s_r_c_/_k_a_d_e_m_l_i_a_/ |pick the closest node rather than the first | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_d_h_t___t_r_a_c_k_e_r_._c_p_p_:_3_1_7_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ppiicckk tthhee cclloosseesstt nnooddee rraatthheerr tthhaann tthhee ffiirrsstt ********** | │ │ │ │ │ -|****** ....//ssrrcc//kkaaddeemmlliiaa//ddhhtt__ttrraacckkeerr..ccpppp::331177 ****** | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| m_log->log(dht_logger::tracker, "*** new write key*** %d nodes" | │ │ │ │ │ -| , int(m_nodes.size())); | │ │ │ │ │ -|#endif | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void dht_tracker::update_storage_node_ids() | │ │ │ │ │ -| { | │ │ │ │ │ -| std::vector ids; | │ │ │ │ │ -| for (auto& n : m_nodes) | │ │ │ │ │ -| ids.push_back(n.second.dht.nid()); | │ │ │ │ │ -| m_storage.update_node_ids(ids); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| node* dht_tracker::get_node(node_id const& id, std::string const& family_name) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_UNUSED(id); | │ │ │ │ │ -| for (auto& n : m_nodes) | │ │ │ │ │ -| { | │ │ │ │ │ -|if (n.second.dht.protocol_family_name() == family_name) | │ │ │ │ │ -|return &n.second.dht; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| return nullptr; | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void dht_tracker::get_peers(sha1_hash const& ih | │ │ │ │ │ -| , std::function const&)> f) | │ │ │ │ │ -| { | │ │ │ │ │ -| for (auto& n : m_nodes) | │ │ │ │ │ -| n.second.dht.get_peers(ih, f, {}, {}); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void dht_tracker::announce(sha1_hash const& ih, int listen_port | │ │ │ │ │ -| , announce_flags_t const flags | │ │ │ │ │ -| , std::function const&)> f) | │ │ │ │ │ -| { | │ │ │ │ │ -| for (auto& n : m_nodes) | │ │ │ │ │ -| n.second.dht.announce(ih, listen_port, flags, f); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void dht_tracker::sample_infohashes(udp::endpoint const& ep, sha1_hash const& target | │ │ │ │ │ -| , std::function | │ │ │ │ │ -| , std::vector>)> f) | │ │ │ │ │ -| { | │ │ │ │ │ -| for (auto& n : m_nodes) | │ │ │ │ │ -| { | │ │ │ │ │ -|_ _ _ _i_f_ _(_e_p_._p_r_o_t_o_c_o_l_(_)_ _!_=_ _(_n_._f_i_r_s_t_._g_e_t___e_x_t_e_r_n_a_l___a_d_d_r_e_s_s_(_)_._i_s___v_4_(_)_ _?_ _u_d_p_:_:_v_4_(_)_ _:_ _u_d_p_:_:_v_6_(_)_)_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|_r_e_l_e_v_a_n_c_e_ _0_|_._._/_s_r_c_/_k_a_d_e_m_l_i_a_/_i_t_e_m_._c_p_p_:_1_4_3_ _ _|_i_m_p_l_e_m_e_n_t_ _c_t_o_r_ _f_o_r_ _e_n_t_r_y_ _f_r_o_m_ _b_d_e_c_o_d_e___n_o_d_e_?_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iimmpplleemmeenntt ccttoorr ffoorr eennttrryy ffrroomm bbddeeccooddee__nnooddee?? ********** | │ │ │ │ │ -|****** ....//ssrrcc//kkaaddeemmlliiaa//iitteemm..ccpppp::114433 ****** | │ │ │ │ │ -|, secret_key const& sk) | │ │ │ │ │ -|{ | │ │ │ │ │ -| char str[1200]; | │ │ │ │ │ -| int const len = canonical_string(v, seq, salt, str); | │ │ │ │ │ -| | │ │ │ │ │ -| return ed25519_sign({str, len}, pk, sk); | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|item::item(public_key const& pk, span salt) | │ │ │ │ │ -| : m_salt(salt.data(), static_cast(salt.size())) | │ │ │ │ │ -| , m_pk(pk) | │ │ │ │ │ -| , m_mutable(true) | │ │ │ │ │ -|{} | │ │ │ │ │ -| | │ │ │ │ │ -|item::item(entry v) | │ │ │ │ │ -| : m_value(std::move(v)) | │ │ │ │ │ -|{} | │ │ │ │ │ -| | │ │ │ │ │ -|item::item(bdecode_node const& v) | │ │ │ │ │ -|{ | │ │ │ │ │ -|m_value = v; | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|item::item(entry v, span salt | │ │ │ │ │ -| , sequence_number const seq, public_key const& pk, secret_key const& sk) | │ │ │ │ │ -|{ | │ │ │ │ │ -| assign(std::move(v), salt, seq, pk, sk); | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|void item::assign(entry v) | │ │ │ │ │ -|{ | │ │ │ │ │ -| m_mutable = false; | │ │ │ │ │ -| m_value = std::move(v); | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|void item::assign(entry v, span salt | │ │ │ │ │ -| , sequence_number const seq, public_key const& pk, secret_key const& sk) | │ │ │ │ │ -|{ | │ │ │ │ │ -| std::array buffer; | │ │ │ │ │ -| int const bsize = bencode(buffer.begin(), v); | │ │ │ │ │ -| TORRENT_ASSERT(bsize <= 1000); | │ │ │ │ │ -| m_sig = sign_mutable_item(span(buffer).first(bsize) | │ │ │ │ │ -| , salt, seq, pk, sk); | │ │ │ │ │ -| m_salt.assign(salt.data(), static_cast(salt.size())); | │ │ │ │ │ -| m_pk = pk; | │ │ │ │ │ -| m_seq = seq; | │ │ │ │ │ -| m_mutable = true; | │ │ │ │ │ -| m_value = std::move(v); | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|_v_o_i_d_ _i_t_e_m_:_:_a_s_s_i_g_n_(_b_d_e_c_o_d_e___n_o_d_e_ _c_o_n_s_t_&_ _v_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 0|_._._/_s_r_c_/_k_a_d_e_m_l_i_a_/ |This is temporary. For now, only report the largest routing table (of potentially multiple ones, for multi-homed systems) in next | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_r_o_u_t_i_n_g___t_a_b_l_e_._c_p_p_:_2_8_9_ _ _ _ _ _ _ _ _ _|_m_a_j_o_r_ _v_e_r_s_i_o_n_,_ _b_r_e_a_k_ _t_h_e_ _A_B_I_ _a_n_d_ _s_u_p_p_o_r_t_ _r_e_p_o_r_t_i_n_g_ _a_l_l_ _o_f_ _t_h_e_m_ _i_n_ _t_h_e_ _d_h_t___s_t_a_t_s___a_l_e_r_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** TThhiiss iiss tteemmppoorraarryy.. FFoorr nnooww,, oonnllyy rreeppoorrtt tthhee llaarrggeesstt rroouuttiinngg ttaabbllee ((ooff ppootteennttiiaallllyy mmuullttiippllee oonneess,, ffoorr mmuullttii--hhoommeedd ssyysstteemmss)) iinn nneexxtt mmaajjoorr vveerrssiioonn,, bbrreeaakk tthhee AABBII aanndd | │ │ │ │ │ |ssuuppppoorrtt rreeppoorrttiinngg aallll ooff tthheemm iinn tthhee ddhhtt__ssttaattss__aalleerrtt ********** | │ │ │ │ │ |****** ....//ssrrcc//kkaaddeemmlliiaa//rroouuttiinngg__ttaabbllee..ccpppp::228899 ****** | │ │ │ │ │ |, m_bucket_size(bucket_size) | │ │ │ │ │ |{ | │ │ │ │ │ @@ -10977,206 +10819,226 @@ │ │ │ │ │ | && m_buckets.back().replacements.empty()) | │ │ │ │ │ | { | │ │ │ │ │ | m_buckets.erase(m_buckets.end() - 1); | │ │ │ │ │ | } | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ |_v_o_i_d_ _r_o_u_t_i_n_g___t_a_b_l_e_:_:_r_e_m_o_v_e___n_o_d_e_(_n_o_d_e___e_n_t_r_y_*_ _n_,_ _b_u_c_k_e_t___t_*_ _b_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |change the type to std::shared_ptr in C++17 it is used as if immutable, it cannot be const for technical reasons right now. | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_t_o_r_r_e_n_t___i_n_f_o_._h_p_p_:_7_2_9_ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** cchhaannggee tthhee ttyyppee ttoo ssttdd::::sshhaarreedd__ppttrr iinn CC++++1177 iitt iiss uusseedd aass iiff iimmmmuuttaabbllee,, iitt ccaannnnoott bbee ccoonnsstt ffoorr tteecchhnniiccaall rreeaassoonnss rriigghhtt nnooww.. ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ttoorrrreenntt__iinnffoo..hhpppp::772299 ****** | │ │ │ │ │ -| // these are the collections from outside of the info-dict. These are | │ │ │ │ │ -| // owning strings, since we only keep the info-section around, these | │ │ │ │ │ -| // cannot be pointers into that buffer. | │ │ │ │ │ -| std::vector m_owned_collections; | │ │ │ │ │ -| | │ │ │ │ │ -|#if TORRENT_ABI_VERSION <= 2 | │ │ │ │ │ -| // if this is a merkle torrent, this is the merkle | │ │ │ │ │ -| // tree. It has space for merkle_num_nodes(merkle_num_leafs(num_pieces)) | │ │ │ │ │ -| // hashes | │ │ │ │ │ -| aux::vector m_merkle_tree; | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/_k_a_d_e_m_l_i_a_/ |pick the closest node rather than the first | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_d_h_t___t_r_a_c_k_e_r_._c_p_p_:_3_1_7_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ppiicckk tthhee cclloosseesstt nnooddee rraatthheerr tthhaann tthhee ffiirrsstt ********** | │ │ │ │ │ +|****** ....//ssrrcc//kkaaddeemmlliiaa//ddhhtt__ttrraacckkeerr..ccpppp::331177 ****** | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| m_log->log(dht_logger::tracker, "*** new write key*** %d nodes" | │ │ │ │ │ +| , int(m_nodes.size())); | │ │ │ │ │ |#endif | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| // v2 merkle tree for each file | │ │ │ │ │ -| // the actual hash buffers are always divisible by 32 (sha256_hash::size()) | │ │ │ │ │ -| aux::vector, file_index_t> m_piece_layers; | │ │ │ │ │ -| | │ │ │ │ │ -| // this is a copy of the info section from the torrent. | │ │ │ │ │ -| // it use maintained in this flat format in order to | │ │ │ │ │ -| // make it available through the metadata extension | │ │ │ │ │ -|boost::shared_array m_info_section; | │ │ │ │ │ -| | │ │ │ │ │ -| // if a comment is found in the torrent file | │ │ │ │ │ -| // this will be set to that comment | │ │ │ │ │ -| std::string m_comment; | │ │ │ │ │ -| | │ │ │ │ │ -| // an optional string naming the software used | │ │ │ │ │ -| // to create the torrent file | │ │ │ │ │ -| std::string m_created_by; | │ │ │ │ │ -| | │ │ │ │ │ -| // the info section parsed. points into m_info_section | │ │ │ │ │ -| // parsed lazily | │ │ │ │ │ -| mutable bdecode_node m_info_dict; | │ │ │ │ │ -| | │ │ │ │ │ -| // if a creation date is found in the torrent file | │ │ │ │ │ -| // this will be set to that, otherwise it'll be | │ │ │ │ │ -| // 1970, Jan 1 | │ │ │ │ │ -| std::time_t m_creation_date = 0; | │ │ │ │ │ -| | │ │ │ │ │ -| // the hash(es) that identify this torrent | │ │ │ │ │ -| info_hash_t m_info_hash; | │ │ │ │ │ -| | │ │ │ │ │ -| // this is the offset into the m_info_section buffer to the first byte of | │ │ │ │ │ -| // the first SHA-1 hash | │ │ │ │ │ -| std::int32_t m_piece_hashes = 0; | │ │ │ │ │ -| | │ │ │ │ │ -| // the number of bytes in m_info_section | │ │ │ │ │ -| std::int32_t m_info_section_size = 0; | │ │ │ │ │ -| | │ │ │ │ │ -| // this is used when creating a torrent. If there's | │ │ │ │ │ -|_ _ _/_/_ _o_n_l_y_ _o_n_e_ _f_i_l_e_ _t_h_e_r_e_ _a_r_e_ _c_a_s_e_s_ _w_h_e_r_e_ _i_t_'_s_ _i_m_p_o_s_s_i_b_l_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |hide this declaration when deprecated functions are disabled, and remove its internal use | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_i_d_e_n_t_i_f_y___c_l_i_e_n_t_._h_p_p_:_4_8_ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** hhiiddee tthhiiss ddeeccllaarraattiioonn wwhheenn ddeepprreeccaatteedd ffuunnccttiioonnss aarree ddiissaabblleedd,, aanndd rreemmoovvee iittss iinntteerrnnaall uussee ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//iiddeennttiiffyy__cclliieenntt..hhpppp::4488 ****** | │ │ │ │ │ -|CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | │ │ │ │ │ -|ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | │ │ │ │ │ -|POSSIBILITY OF SUCH DAMAGE. | │ │ │ │ │ -| | │ │ │ │ │ -|*/ | │ │ │ │ │ -| | │ │ │ │ │ -|#ifndef TORRENT_IDENTIFY_CLIENT_HPP_INCLUDED | │ │ │ │ │ -|#define TORRENT_IDENTIFY_CLIENT_HPP_INCLUDED | │ │ │ │ │ +| void dht_tracker::update_storage_node_ids() | │ │ │ │ │ +| { | │ │ │ │ │ +| std::vector ids; | │ │ │ │ │ +| for (auto& n : m_nodes) | │ │ │ │ │ +| ids.push_back(n.second.dht.nid()); | │ │ │ │ │ +| m_storage.update_node_ids(ids); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|#include "libtorrent/config.hpp" | │ │ │ │ │ +| node* dht_tracker::get_node(node_id const& id, std::string const& family_name) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_UNUSED(id); | │ │ │ │ │ +| for (auto& n : m_nodes) | │ │ │ │ │ +| { | │ │ │ │ │ +|if (n.second.dht.protocol_family_name() == family_name) | │ │ │ │ │ +|return &n.second.dht; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ -|#include "libtorrent/aux_/disable_warnings_push.hpp" | │ │ │ │ │ -|#include | │ │ │ │ │ -|#include "libtorrent/aux_/disable_warnings_pop.hpp" | │ │ │ │ │ -|#endif | │ │ │ │ │ +| return nullptr; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|#include "libtorrent/peer_id.hpp" | │ │ │ │ │ -|#include "libtorrent/fingerprint.hpp" | │ │ │ │ │ +| void dht_tracker::get_peers(sha1_hash const& ih | │ │ │ │ │ +| , std::function const&)> f) | │ │ │ │ │ +| { | │ │ │ │ │ +| for (auto& n : m_nodes) | │ │ │ │ │ +| n.second.dht.get_peers(ih, f, {}, {}); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|namespace libtorrent { | │ │ │ │ │ +| void dht_tracker::announce(sha1_hash const& ih, int listen_port | │ │ │ │ │ +| , announce_flags_t const flags | │ │ │ │ │ +| , std::function const&)> f) | │ │ │ │ │ +| { | │ │ │ │ │ +| for (auto& n : m_nodes) | │ │ │ │ │ +| n.second.dht.announce(ih, listen_port, flags, f); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|namespace aux { | │ │ │ │ │ +| void dht_tracker::sample_infohashes(udp::endpoint const& ep, sha1_hash const& target | │ │ │ │ │ +| , std::function | │ │ │ │ │ +| , std::vector>)> f) | │ │ │ │ │ +| { | │ │ │ │ │ +| for (auto& n : m_nodes) | │ │ │ │ │ +| { | │ │ │ │ │ +|_ _ _ _i_f_ _(_e_p_._p_r_o_t_o_c_o_l_(_)_ _!_=_ _(_n_._f_i_r_s_t_._g_e_t___e_x_t_e_r_n_a_l___a_d_d_r_e_s_s_(_)_._i_s___v_4_(_)_ _?_ _u_d_p_:_:_v_4_(_)_ _:_ _u_d_p_:_:_v_6_(_)_)_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/_k_a_d_e_m_l_i_a_/_n_o_d_e___i_d_._c_p_p_:_6_6|it's a little bit weird to return 159 - leading zeroes. It should probably be 160 - leading zeroes, but all other code in here is | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_t_u_n_e_d_ _t_o_ _t_h_i_s_ _e_x_p_e_c_t_a_t_i_o_n_ _n_o_w_,_ _a_n_d_ _i_t_ _d_o_e_s_n_'_t_ _r_e_a_l_l_y_ _m_a_t_t_e_r_ _(_o_t_h_e_r_ _t_h_a_n_ _c_o_m_p_l_e_x_i_t_y_)_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iitt''ss aa lliittttllee bbiitt wweeiirrdd ttoo rreettuurrnn 115599 -- lleeaaddiinngg zzeerrooeess.. IItt sshhoouulldd pprroobbaabbllyy bbee 116600 -- lleeaaddiinngg zzeerrooeess,, bbuutt aallll ootthheerr ccooddee iinn hheerree iiss ttuunneedd ttoo tthhiiss eexxppeeccttaattiioonn nnooww,, aanndd iitt | │ │ │ │ │ +|ddooeessnn''tt rreeaallllyy mmaatttteerr ((ootthheerr tthhaann ccoommpplleexxiittyy)) ********** | │ │ │ │ │ +|****** ....//ssrrcc//kkaaddeemmlliiaa//nnooddee__iidd..ccpppp::6666 ****** | │ │ │ │ │ +|// returns the distance between the two nodes | │ │ │ │ │ +|// using the kademlia XOR-metric | │ │ │ │ │ +|node_id distance(node_id const& n1, node_id const& n2) | │ │ │ │ │ +|{ | │ │ │ │ │ +| return n1 ^ n2; | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -| TORRENT_EXTRA_EXPORT | │ │ │ │ │ -| std::string identify_client_impl(const peer_id& p); | │ │ │ │ │ +|// returns true if: distance(n1, ref) < distance(n2, ref) | │ │ │ │ │ +|bool compare_ref(node_id const& n1, node_id const& n2, node_id const& ref) | │ │ │ │ │ +|{ | │ │ │ │ │ +| node_id const lhs = n1 ^ ref; | │ │ │ │ │ +| node_id const rhs = n2 ^ ref; | │ │ │ │ │ +| return lhs < rhs; | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ +|// returns n in: 2^n <= distance(n1, n2) < 2^(n+1) | │ │ │ │ │ +|// useful for finding out which bucket a node belongs to | │ │ │ │ │ +|int distance_exp(node_id const& n1, node_id const& n2) | │ │ │ │ │ +|{ | │ │ │ │ │ +|return std::max(159 - distance(n1, n2).count_leading_zeroes(), 0); | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ -| // these functions don't really need to be public. This mechanism of | │ │ │ │ │ -| // advertising client software and version is also out-dated. | │ │ │ │ │ +|int min_distance_exp(node_id const& n1, std::vector const& ids) | │ │ │ │ │ +|{ | │ │ │ │ │ +| TORRENT_ASSERT(ids.size() > 0); | │ │ │ │ │ | | │ │ │ │ │ -| // This function can can be used to extract a string describing a client | │ │ │ │ │ -| // version from its peer-id. It will recognize most clients that have this | │ │ │ │ │ -| // kind of identification in the peer-id. | │ │ │ │ │ -| TORRENT_DEPRECATED_EXPORT | │ │ │ │ │ -| std::string identify_client(const peer_id& p); | │ │ │ │ │ +| int min = 160; // see distance_exp for the why of this constant | │ │ │ │ │ +| for (auto const& node_id : ids) | │ │ │ │ │ +| { | │ │ │ │ │ +| min = std::min(min, distance_exp(n1, node_id)); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ +| return min; | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -|#include "libtorrent/aux_/disable_deprecation_warnings_push.hpp" | │ │ │ │ │ +|node_id generate_id_impl(address const& ip_, std::uint32_t r) | │ │ │ │ │ +|{ | │ │ │ │ │ +| std::uint8_t* ip = nullptr; | │ │ │ │ │ | | │ │ │ │ │ -| // Returns an optional fingerprint if any can be identified from the peer | │ │ │ │ │ -| // id. This can be used to automate the identification of clients. It will | │ │ │ │ │ -| // not be able to identify peers with non- standard encodings. Only Azureus | │ │ │ │ │ -| // style, Shadow's style and Mainline style. | │ │ │ │ │ -| TORRENT_DEPRECATED_EXPORT | │ │ │ │ │ -| boost::optional | │ │ │ │ │ -| client_fingerprint(peer_id const& p); | │ │ │ │ │ +| static std::uint8_t const v4mask[] = { 0x03, 0x0f, 0x3f, 0xff }; | │ │ │ │ │ +| static std::uint8_t const v6mask[] = { 0x01, 0x03, 0x07, 0x0f, 0x1f, 0x3f, 0x7f, 0xff }; | │ │ │ │ │ +| std::uint8_t const* mask = nullptr; | │ │ │ │ │ +| int num_octets = 0; | │ │ │ │ │ | | │ │ │ │ │ -|_#_i_n_c_l_u_d_e_ _"_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/_d_i_s_a_b_l_e___w_a_r_n_i_n_g_s___p_o_p_._h_p_p_"_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |move to aux | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_s_o_c_k_e_t___t_y_p_e_._h_p_p_:_6_0_ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** mmoovvee ttoo aauuxx ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ssoocckkeett__ttyyppee..hhpppp::6600 ****** | │ │ │ │ │ -|namespace libtorrent { | │ │ │ │ │ +| address_v4::bytes_type b4{}; | │ │ │ │ │ +| address_v6::bytes_type b6{}; | │ │ │ │ │ +| if (ip_.is_v6()) | │ │ │ │ │ +| { | │ │ │ │ │ +| b6 = ip_.to_v6().to_bytes(); | │ │ │ │ │ +|_ _ _i_p_ _=_ _b_6_._d_a_t_a_(_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_s_r_c_/_k_a_d_e_m_l_i_a_/_p_u_t___d_a_t_a_._c_p_p_: |what if o is not an instance of put_data_observer? This need to be redesigned for better type safety. | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_9_2_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** wwhhaatt iiff oo iiss nnoott aann iinnssttaannccee ooff ppuutt__ddaattaa__oobbsseerrvveerr?? TThhiiss nneeeedd ttoo bbee rreeddeessiiggnneedd ffoorr bbeetttteerr ttyyppee ssaaffeettyy.. ********** | │ │ │ │ │ +|****** ....//ssrrcc//kkaaddeemmlliiaa//ppuutt__ddaattaa..ccpppp::9922 ****** | │ │ │ │ │ +|} | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -|// A type describing kinds of sockets involved in various operations or events. | │ │ │ │ │ -|enum class socket_type_t : std::uint8_t { | │ │ │ │ │ -| tcp, | │ │ │ │ │ -| socks5, | │ │ │ │ │ -| http, | │ │ │ │ │ -| utp, | │ │ │ │ │ -| i2p, | │ │ │ │ │ -| tcp_ssl, | │ │ │ │ │ -| socks5_ssl, | │ │ │ │ │ -| http_ssl, | │ │ │ │ │ -| utp_ssl, | │ │ │ │ │ +|void put_data::done() | │ │ │ │ │ +|{ | │ │ │ │ │ +| m_done = true; | │ │ │ │ │ | | │ │ │ │ │ -|#if TORRENT_ABI_VERSION <= 2 | │ │ │ │ │ -| udp TORRENT_DEPRECATED_ENUM = utp, | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| get_node().observer()->log(dht_logger::traversal, "[%u] %s DONE, response %d, timeout %d" | │ │ │ │ │ +| , id(), name(), num_responses(), num_timeouts()); | │ │ │ │ │ |#endif | │ │ │ │ │ -|}; | │ │ │ │ │ -| | │ │ │ │ │ -|// return a short human readable name for types of socket | │ │ │ │ │ -|char const* socket_type_name(socket_type_t); | │ │ │ │ │ | | │ │ │ │ │ +| m_put_callback(m_data, num_responses()); | │ │ │ │ │ +| traversal_algorithm::done(); | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ -|_#_e_n_d_i_f_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |include the number of peers received from this tracker, at last announce | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_a_n_n_o_u_n_c_e___e_n_t_r_y_._h_p_p_:_7_6_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iinncclluuddee tthhee nnuummbbeerr ooff ppeeeerrss rreecceeiivveedd ffrroomm tthhiiss ttrraacckkeerr,, aatt llaasstt aannnnoouunnccee ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//aannnnoouunnccee__eennttrryy..hhpppp::7766 ****** | │ │ │ │ │ -| struct TORRENT_EXPORT announce_infohash | │ │ │ │ │ +|bool put_data::invoke(observer_ptr o) | │ │ │ │ │ +|{ | │ │ │ │ │ +| if (m_done) return false; | │ │ │ │ │ +| | │ │ │ │ │ +|auto* po = static_cast(o.get()); | │ │ │ │ │ +| | │ │ │ │ │ +| entry e; | │ │ │ │ │ +| e["y"] = "q"; | │ │ │ │ │ +| e["q"] = "put"; | │ │ │ │ │ +| entry& a = e["a"]; | │ │ │ │ │ +| a["v"] = m_data.value(); | │ │ │ │ │ +| a["token"] = po->m_token; | │ │ │ │ │ +| if (m_data.is_mutable()) | │ │ │ │ │ | { | │ │ │ │ │ -| // internal | │ │ │ │ │ -| TORRENT_UNEXPORT announce_infohash(); | │ │ │ │ │ +| a["k"] = m_data.pk().bytes; | │ │ │ │ │ +| a["seq"] = m_data.seq().value; | │ │ │ │ │ +| a["sig"] = m_data.sig().bytes; | │ │ │ │ │ +| if (!m_data.salt().empty()) | │ │ │ │ │ +| { | │ │ │ │ │ +| a["salt"] = m_data.salt(); | │ │ │ │ │ +| } | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| // if this tracker has returned an error or warning message | │ │ │ │ │ -| // that message is stored here | │ │ │ │ │ -| std::string message; | │ │ │ │ │ +| m_node.stats_counters().inc_stats_counter(counters::dht_put_out); | │ │ │ │ │ | | │ │ │ │ │ -| // if this tracker failed the last time it was contacted | │ │ │ │ │ -| // this error code specifies what error occurred | │ │ │ │ │ -| error_code last_error; | │ │ │ │ │ +| return m_node.m_rpc.invoke(e, o->target_ep(), o); | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -| // the time of next tracker announce | │ │ │ │ │ -| time_point32 next_announce = (time_point32::min)(); | │ │ │ │ │ +|_}_ _}_ _/_/_ _n_a_m_e_s_p_a_c_e_ _l_i_b_t_o_r_r_e_n_t_:_:_d_h_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |make this a string_view | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_i_2_p___s_t_r_e_a_m_._h_p_p_:_5_3_3_ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** mmaakkee tthhiiss aa ssttrriinngg__vviieeww ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ii22pp__ssttrreeaamm..hhpppp::553333 ****** | │ │ │ │ │ +| char tmp[20]; | │ │ │ │ │ +| aux::random_bytes(tmp); | │ │ │ │ │ +| m_session_id.resize(sizeof(tmp)*2); | │ │ │ │ │ +| aux::to_hex(tmp, &m_session_id[0]); | │ │ │ │ │ | | │ │ │ │ │ -| // no announces before this time | │ │ │ │ │ -| time_point32 min_announce = (time_point32::min)(); | │ │ │ │ │ +| m_sam_socket = std::make_shared(m_io_service); | │ │ │ │ │ +| m_sam_socket->set_proxy(m_hostname, m_port); | │ │ │ │ │ +| m_sam_socket->set_command(i2p_stream::cmd_create_session); | │ │ │ │ │ +| m_sam_socket->set_session_id(m_session_id.c_str()); | │ │ │ │ │ +| m_sam_socket->set_session_options(session_options); | │ │ │ │ │ | | │ │ │ │ │ +| ADD_OUTSTANDING_ASYNC("i2p_stream::on_sam_connect"); | │ │ │ │ │ +| m_sam_socket->async_connect(tcp::endpoint(), wrap_allocator( | │ │ │ │ │ +| [this,s=m_sam_socket](error_code const& ec, Handler hn) { | │ │ │ │ │ +| on_sam_connect(ec, s, std::move(hn)); | │ │ │ │ │ +| }, std::move(handler))); | │ │ │ │ │ +| } | │ │ │ │ │ +| void close(error_code&); | │ │ │ │ │ | | │ │ │ │ │ -|// these are either -1 or the scrape information this tracker last | │ │ │ │ │ -| // responded with. *incomplete* is the current number of downloaders in | │ │ │ │ │ -| // the swarm, *complete* is the current number of seeds in the swarm and | │ │ │ │ │ -| // *downloaded* is the cumulative number of completed downloads of this | │ │ │ │ │ -| // torrent, since the beginning of time (from this tracker's point of | │ │ │ │ │ -| // view). | │ │ │ │ │ +|char const* session_id() const { return m_session_id.c_str(); } | │ │ │ │ │ +|std::string const& local_endpoint() const { return m_i2p_local_endpoint; } | │ │ │ │ │ | | │ │ │ │ │ -| // if this tracker has returned scrape data, these fields are filled in | │ │ │ │ │ -| // with valid numbers. Otherwise they are set to -1. ``incomplete`` counts | │ │ │ │ │ -| // the number of current downloaders. ``complete`` counts the number of | │ │ │ │ │ -| // current peers completed the download, or "seeds". ``downloaded`` is the | │ │ │ │ │ -| // cumulative number of completed downloads. | │ │ │ │ │ -| int scrape_incomplete = -1; | │ │ │ │ │ -| int scrape_complete = -1; | │ │ │ │ │ -| int scrape_downloaded = -1; | │ │ │ │ │ +| template | │ │ │ │ │ +| void async_name_lookup(char const* name, Handler handler) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (m_state == sam_idle && m_name_lookup.empty() && is_open()) | │ │ │ │ │ +| do_name_lookup(name, std::move(handler)); | │ │ │ │ │ +| else | │ │ │ │ │ +| m_name_lookup.emplace_back(std::string(name) | │ │ │ │ │ +| , std::move(handler)); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| // the number of times in a row we have failed to announce to this | │ │ │ │ │ -| // tracker. | │ │ │ │ │ -| std::uint8_t fails : 7; | │ │ │ │ │ +|private: | │ │ │ │ │ | | │ │ │ │ │ -| // true while we're waiting for a response from the tracker. | │ │ │ │ │ -| bool updating : 1; | │ │ │ │ │ +| template | │ │ │ │ │ +| void on_sam_connect(error_code const& ec, std::shared_ptr, Handler h) | │ │ │ │ │ +| { | │ │ │ │ │ +| COMPLETE_ASYNC("i2p_stream::on_sam_connect"); | │ │ │ │ │ +| m_state = sam_idle; | │ │ │ │ │ | | │ │ │ │ │ -| // set to true when we get a valid response from an announce | │ │ │ │ │ -| // with event=started. If it is set, we won't send start in the subsequent | │ │ │ │ │ -| // announces. | │ │ │ │ │ -| bool start_sent : 1; | │ │ │ │ │ +| if (ec) | │ │ │ │ │ +| { | │ │ │ │ │ +| h(ec); | │ │ │ │ │ +| return; | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| // set to true when we send a event=completed. | │ │ │ │ │ -|_ _ _b_o_o_l_ _c_o_m_p_l_e_t_e___s_e_n_t_ _:_ _1_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| do_name_lookup("ME", wrap_allocator( | │ │ │ │ │ +| [this](error_code const& e, char const* dst, Handler hn) { | │ │ │ │ │ +| set_local_endpoint(e, dst, std::move(hn)); | │ │ │ │ │ +|_ _ _ _}_,_ _s_t_d_:_:_m_o_v_e_(_h_)_)_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |make this a raw pointer. perhaps keep the shared_ptr around further down the object to maintain an owner | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_t_o_r_r_e_n_t_._h_p_p_:_2_8_0_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** mmaakkee tthhiiss aa rraaww ppooiinntteerr.. ppeerrhhaappss kkeeeepp tthhee sshhaarreedd__ppttrr aarroouunndd ffuurrtthheerr ddoowwnn tthhee oobbjjeecctt ttoo mmaaiinnttaaiinn aann oowwnneerr ********** | │ │ │ │ │ |****** ....//iinncclluuddee//lliibbttoorrrreenntt//ttoorrrreenntt..hhpppp::228800 ****** | │ │ │ │ │ |#endif | │ │ │ │ │ | }; | │ │ │ │ │ | | │ │ │ │ │ @@ -11442,69 +11304,327 @@ │ │ │ │ │ | // remember that this is an SSL torrent, so that we don't | │ │ │ │ │ | // accidentally start seeding it without any authentication. | │ │ │ │ │ | bool m_ssl_torrent:1; | │ │ │ │ │ | | │ │ │ │ │ | // this is set to true if we're trying to delete the | │ │ │ │ │ | // files belonging to it. When set, don't write any | │ │ │ │ │ |_ _ _/_/_ _m_o_r_e_ _b_l_o_c_k_s_ _t_o_ _d_i_s_k_!_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -| |_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ | | │ │ │ │ │ -|relevance 0|_p_e_e_r___c_o_n_n_e_c_t_i_o_n___i_n_t_e_r_f_a_c_e_._h_p_p_:|make this interface smaller! | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_5_1_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** mmaakkee tthhiiss iinntteerrffaaccee ssmmaalllleerr!! ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ppeeeerr__ccoonnnneeccttiioonn__iinntteerrffaaccee..hhpppp::5511 ****** | │ │ │ │ │ -|*/ | │ │ │ │ │ -| | │ │ │ │ │ -|#ifndef TORRENT_PEER_CONNECTION_INTERFACE_HPP | │ │ │ │ │ -|#define TORRENT_PEER_CONNECTION_INTERFACE_HPP | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |support using the windows API for UPnP operations as well | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_u_p_n_p_._h_p_p_:_1_6_2_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ssuuppppoorrtt uussiinngg tthhee wwiinnddoowwss AAPPII ffoorr UUPPnnPP ooppeerraattiioonnss aass wweellll ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//uuppnnpp..hhpppp::116622 ****** | │ │ │ │ │ +|{ | │ │ │ │ │ +| bool in_error_code = false; | │ │ │ │ │ +| bool exit = false; | │ │ │ │ │ +| int error_code = -1; | │ │ │ │ │ +|}; | │ │ │ │ │ | | │ │ │ │ │ -|#include "libtorrent/fwd.hpp" | │ │ │ │ │ -|#include "libtorrent/socket.hpp" | │ │ │ │ │ -|#include "libtorrent/error_code.hpp" | │ │ │ │ │ -|#include "libtorrent/alert_types.hpp" | │ │ │ │ │ -|#include "libtorrent/operations.hpp" // for operation_t enum | │ │ │ │ │ -|#include "libtorrent/units.hpp" | │ │ │ │ │ +|struct ip_address_parse_state: error_code_parse_state | │ │ │ │ │ +|{ | │ │ │ │ │ +| bool in_ip_address = false; | │ │ │ │ │ +| std::string ip_address; | │ │ │ │ │ +|}; | │ │ │ │ │ | | │ │ │ │ │ -|namespace libtorrent { | │ │ │ │ │ +|TORRENT_EXTRA_EXPORT void find_control_url(int type, string_view, parse_state& state); | │ │ │ │ │ | | │ │ │ │ │ -| struct torrent_peer; | │ │ │ │ │ -| class stat; | │ │ │ │ │ +|TORRENT_EXTRA_EXPORT void find_error_code(int type, string_view string | │ │ │ │ │ +| , error_code_parse_state& state); | │ │ │ │ │ | | │ │ │ │ │ -| using disconnect_severity_t = aux::strong_typedef; | │ │ │ │ │ +|TORRENT_EXTRA_EXPORT void find_ip_address(int type, string_view string | │ │ │ │ │ +| , ip_address_parse_state& state); | │ │ │ │ │ | | │ │ │ │ │ -|struct TORRENT_EXTRA_EXPORT peer_connection_interface | │ │ │ │ │ +|struct TORRENT_EXTRA_EXPORT upnp final | │ │ │ │ │ +|: std::enable_shared_from_this | │ │ │ │ │ +| , single_threaded | │ │ │ │ │ |{ | │ │ │ │ │ -| static constexpr disconnect_severity_t normal{0}; | │ │ │ │ │ -| static constexpr disconnect_severity_t failure{1}; | │ │ │ │ │ -| static constexpr disconnect_severity_t peer_error{2}; | │ │ │ │ │ +| upnp(io_context& ios | │ │ │ │ │ +| , aux::session_settings const& settings | │ │ │ │ │ +| , aux::portmap_callback& cb | │ │ │ │ │ +| , address_v4 listen_address | │ │ │ │ │ +| , address_v4 netmask | │ │ │ │ │ +| , std::string listen_device | │ │ │ │ │ +| , aux::listen_socket_handle ls); | │ │ │ │ │ +| ~upnp(); | │ │ │ │ │ | | │ │ │ │ │ -|#if TORRENT_USE_I2P | │ │ │ │ │ -| virtual std::string const& destination() const = 0; | │ │ │ │ │ -| virtual std::string const& local_i2p_endpoint() const = 0; | │ │ │ │ │ +| void start(); | │ │ │ │ │ +| | │ │ │ │ │ +| // Attempts to add a port mapping for the specified protocol. Valid protocols are | │ │ │ │ │ +| // ``upnp::tcp`` and ``upnp::udp`` for the UPnP class and ``natpmp::tcp`` and | │ │ │ │ │ +| // ``natpmp::udp`` for the NAT-PMP class. | │ │ │ │ │ +| // | │ │ │ │ │ +| // ``external_port`` is the port on the external address that will be mapped. This | │ │ │ │ │ +| // is a hint, you are not guaranteed that this port will be available, and it may | │ │ │ │ │ +| // end up being something else. In the portmap_alert_ notification, the actual | │ │ │ │ │ +| // external port is reported. | │ │ │ │ │ +| // | │ │ │ │ │ +| // ``local_port`` is the port in the local machine that the mapping should forward | │ │ │ │ │ +| // to. | │ │ │ │ │ +| // | │ │ │ │ │ +| // The return value is an index that identifies this port mapping. This is used | │ │ │ │ │ +| // to refer to mappings that fails or succeeds in the portmap_error_alert_ and | │ │ │ │ │ +| // portmap_alert_ respectively. If The mapping fails immediately, the return value | │ │ │ │ │ +|_ _/_/_ _i_s_ _-_1_,_ _w_h_i_c_h_ _m_e_a_n_s_ _f_a_i_l_u_r_e_._ _T_h_e_r_e_ _w_i_l_l_ _n_o_t_ _b_e_ _a_n_y_ _e_r_r_o_r_ _a_l_e_r_t_ _n_o_t_i_f_i_c_a_t_i_o_n_ _f_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |make this a raw pointer (to save size in the first cache line) and make the constructor take a raw pointer. torrent objects should | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._h_p_p_:_2_1_8_ _ _ _ _ _ _ _|_a_l_w_a_y_s_ _o_u_t_l_i_v_e_ _t_h_e_i_r_ _p_e_e_r_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** mmaakkee tthhiiss aa rraaww ppooiinntteerr ((ttoo ssaavvee ssiizzee iinn tthhee ffiirrsstt ccaacchhee lliinnee)) aanndd mmaakkee tthhee ccoonnssttrruuccttoorr ttaakkee aa rraaww ppooiinntteerr.. ttoorrrreenntt oobbjjeeccttss sshhoouulldd aallwwaayyss oouuttlliivvee tthheeiirr ppeeeerrss ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ppeeeerr__ccoonnnneeccttiioonn..hhpppp::221188 ****** | │ │ │ │ │ +|, m_snubbed(false) | │ │ │ │ │ +| , m_interesting(false) | │ │ │ │ │ +| , m_choked(true) | │ │ │ │ │ +| , m_ignore_stats(false) | │ │ │ │ │ +| {} | │ │ │ │ │ +| | │ │ │ │ │ +| // explicitly disallow assignment, to silence msvc warning | │ │ │ │ │ +| peer_connection_hot_members& operator=(peer_connection_hot_members const&) = delete; | │ │ │ │ │ +| | │ │ │ │ │ +| protected: | │ │ │ │ │ +| | │ │ │ │ │ +| // the pieces the other end have | │ │ │ │ │ +| typed_bitfield m_have_piece; | │ │ │ │ │ +| | │ │ │ │ │ +| // this is the torrent this connection is | │ │ │ │ │ +| // associated with. If the connection is an | │ │ │ │ │ +| // incoming connection, this is set to zero | │ │ │ │ │ +| // until the info_hash is received. Then it's | │ │ │ │ │ +| // set to the torrent it belongs to. | │ │ │ │ │ +| | │ │ │ │ │ +|std::weak_ptr m_torrent; | │ │ │ │ │ +| | │ │ │ │ │ +| public: | │ │ │ │ │ +| | │ │ │ │ │ +| // a back reference to the session | │ │ │ │ │ +| // the peer belongs to. | │ │ │ │ │ +| aux::session_interface& m_ses; | │ │ │ │ │ +| | │ │ │ │ │ +| // settings that apply to this peer | │ │ │ │ │ +| aux::session_settings const& m_settings; | │ │ │ │ │ +| | │ │ │ │ │ +| protected: | │ │ │ │ │ +| | │ │ │ │ │ +| // this is true if this connection has been added | │ │ │ │ │ +| // to the list of connections that will be closed. | │ │ │ │ │ +| bool m_disconnecting:1; | │ │ │ │ │ +| | │ │ │ │ │ +| // this is true until this socket has become | │ │ │ │ │ +| // writable for the first time (i.e. the | │ │ │ │ │ +| // connection completed). While connecting | │ │ │ │ │ +| // the timeout will not be triggered. This is | │ │ │ │ │ +| // because windows XP SP2 may delay connection | │ │ │ │ │ +| // attempts, which means that the connection | │ │ │ │ │ +| // may not even have been attempted when the | │ │ │ │ │ +| // time out is reached. | │ │ │ │ │ +| bool m_connecting:1; | │ │ │ │ │ +| | │ │ │ │ │ +| // this is set to true if the last time we tried to | │ │ │ │ │ +| // pick a piece to download, we could only find | │ │ │ │ │ +| // blocks that were already requested from other | │ │ │ │ │ +|_ _ _/_/_ _p_e_e_r_s_._ _I_n_ _t_h_i_s_ _c_a_s_e_,_ _w_e_ _s_h_o_u_l_d_ _n_o_t_ _t_r_y_ _t_o_ _p_i_c_k_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |factor this out into its own class with a virtual interface torrent and session should implement this interface | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._h_p_p_:_1_0_2_6_ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ffaaccttoorr tthhiiss oouutt iinnttoo iittss oowwnn ccllaassss wwiitthh aa vviirrttuuaall iinntteerrffaaccee ttoorrrreenntt aanndd sseessssiioonn sshhoouulldd iimmpplleemmeenntt tthhiiss iinntteerrffaaccee ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ppeeeerr__ccoonnnneeccttiioonn..hhpppp::11002266 ****** | │ │ │ │ │ +| // the local endpoint for this peer, i.e. our address | │ │ │ │ │ +| // and our port. If this is set for outgoing connections | │ │ │ │ │ +| // before the connection completes, it means we want to | │ │ │ │ │ +| // force the connection to be bound to the specified interface. | │ │ │ │ │ +| // if it ends up being bound to a different local IP, the connection | │ │ │ │ │ +| // is closed. | │ │ │ │ │ +| tcp::endpoint m_local; | │ │ │ │ │ +| | │ │ │ │ │ +| // remote peer's id | │ │ │ │ │ +| peer_id m_peer_id; | │ │ │ │ │ +| | │ │ │ │ │ +| protected: | │ │ │ │ │ +| | │ │ │ │ │ +| template | │ │ │ │ │ +| void wrap(Fun f, Args&&... a); | │ │ │ │ │ +| | │ │ │ │ │ +| // statistics about upload and download speeds | │ │ │ │ │ +| // and total amount of uploads and downloads for | │ │ │ │ │ +| // this peer | │ │ │ │ │ +|stat m_statistics; | │ │ │ │ │ +| | │ │ │ │ │ +| // the number of outstanding bytes expected | │ │ │ │ │ +| // to be received by extensions | │ │ │ │ │ +| int m_extension_outstanding_bytes = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| // the number of time critical requests | │ │ │ │ │ +| // queued up in the m_request_queue that | │ │ │ │ │ +| // soon will be committed to the download | │ │ │ │ │ +| // queue. This is included in download_queue_time() | │ │ │ │ │ +| // so that it can be used while adding more | │ │ │ │ │ +| // requests and take the previous requests | │ │ │ │ │ +| // into account without submitting it all | │ │ │ │ │ +| // immediately | │ │ │ │ │ +| std::uint16_t m_queued_time_critical = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| // the number of bytes we are currently reading | │ │ │ │ │ +| // from disk, that will be added to the send | │ │ │ │ │ +| // buffer as soon as they complete | │ │ │ │ │ +| int m_reading_bytes = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| // options used for the piece picker. These flags will | │ │ │ │ │ +| // be augmented with flags controlled by other settings | │ │ │ │ │ +| // like sequential download etc. These are here to | │ │ │ │ │ +| // let plugins control flags that should always be set | │ │ │ │ │ +| picker_options_t m_picker_options{}; | │ │ │ │ │ +| | │ │ │ │ │ +| // the number of invalid piece-requests | │ │ │ │ │ +| // we have got from this peer. If the request | │ │ │ │ │ +| // queue gets empty, and there have been | │ │ │ │ │ +|_ _ _/_/_ _i_n_v_a_l_i_d_ _r_e_q_u_e_s_t_s_,_ _w_e_ _c_a_n_ _a_s_s_u_m_e_ _t_h_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |some space could be saved here by making gauges 32 bits | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_p_e_r_f_o_r_m_a_n_c_e___c_o_u_n_t_e_r_s_._h_p_p_:_4_8_5_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** ssoommee ssppaaccee ccoouulldd bbee ssaavveedd hheerree bbyy mmaakkiinngg ggaauuggeess 3322 bbiittss ********** | │ │ │ │ │ +|_**_**_**_ _.._.._//_ii_nn_cc_ll_uu_dd_ee_//_ll_ii_bb_tt_oo_rr_rr_ee_nn_tt_//_pp_ee_rr_ff_oo_rr_mm_aa_nn_cc_ee____cc_oo_uu_nn_tt_ee_rr_ss_.._hh_pp_pp_::_44_88_55_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |restore these to regular integers. Instead have one copy of the counters per thread and collect them at convenient synchronization | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_p_e_r_f_o_r_m_a_n_c_e___c_o_u_n_t_e_r_s_._h_p_p_:_4_8_6_ _ _|_p_o_i_n_t_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** rreessttoorree tthheessee ttoo rreegguullaarr iinntteeggeerrss.. IInnsstteeaadd hhaavvee oonnee ccooppyy ooff tthhee ccoouunntteerrss ppeerr tthhrreeaadd aanndd ccoolllleecctt tthheemm aatt ccoonnvveenniieenntt ssyynncchhrroonniizzaattiioonn ppooiinnttss ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ppeerrffoorrmmaannccee__ccoouunntteerrss..hhpppp::448866 ****** | │ │ │ │ │ +|#ifdef ATOMIC_LLONG_LOCK_FREE | │ │ │ │ │ +|#define TORRENT_COUNTER_NOEXCEPT noexcept | │ │ │ │ │ +|#else | │ │ │ │ │ +|#define TORRENT_COUNTER_NOEXCEPT | │ │ │ │ │ |#endif | │ │ │ │ │ -| virtual tcp::endpoint const& remote() const = 0; | │ │ │ │ │ -| virtual tcp::endpoint local_endpoint() const = 0; | │ │ │ │ │ -| virtual void disconnect(error_code const& ec | │ │ │ │ │ -| , operation_t op, disconnect_severity_t = peer_connection_interface::normal) = 0; | │ │ │ │ │ -| virtual peer_id const& pid() const = 0; | │ │ │ │ │ -| virtual peer_id our_pid() const = 0; | │ │ │ │ │ -| virtual void set_holepunch_mode() = 0; | │ │ │ │ │ -| virtual torrent_peer* peer_info_struct() const = 0; | │ │ │ │ │ -| virtual void set_peer_info(torrent_peer* pi) = 0; | │ │ │ │ │ -| virtual bool is_outgoing() const = 0; | │ │ │ │ │ -| virtual void add_stat(std::int64_t downloaded, std::int64_t uploaded) = 0; | │ │ │ │ │ -| virtual bool fast_reconnect() const = 0; | │ │ │ │ │ -| virtual bool is_choked() const = 0; | │ │ │ │ │ -| virtual bool failed() const = 0; | │ │ │ │ │ -| virtual stat const& statistics() const = 0; | │ │ │ │ │ -| virtual void get_peer_info(peer_info& p) const = 0; | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ -| virtual bool should_log(peer_log_alert::direction_t direction) const = 0; | │ │ │ │ │ -| virtual void peer_log(peer_log_alert::direction_t direction | │ │ │ │ │ -| , char const* event, char const* fmt = "", ...) const noexcept TORRENT_FORMAT(4,5) = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| counters() TORRENT_COUNTER_NOEXCEPT; | │ │ │ │ │ +| | │ │ │ │ │ +| counters(counters const&) TORRENT_COUNTER_NOEXCEPT; | │ │ │ │ │ +| counters& operator=(counters const&) & TORRENT_COUNTER_NOEXCEPT; | │ │ │ │ │ +| | │ │ │ │ │ +| // returns the new value | │ │ │ │ │ +| std::int64_t inc_stats_counter(int c, std::int64_t value = 1) TORRENT_COUNTER_NOEXCEPT; | │ │ │ │ │ +| std::int64_t operator[](int i) const TORRENT_COUNTER_NOEXCEPT; | │ │ │ │ │ +| | │ │ │ │ │ +| void set_value(int c, std::int64_t value) TORRENT_COUNTER_NOEXCEPT; | │ │ │ │ │ +| void blend_stats_counter(int c, std::int64_t value, int ratio) TORRENT_COUNTER_NOEXCEPT; | │ │ │ │ │ +| | │ │ │ │ │ +| private: | │ │ │ │ │ +| | │ │ │ │ │ +|#ifdef ATOMIC_LLONG_LOCK_FREE | │ │ │ │ │ +|aux::array, num_counters> m_stats_counter; | │ │ │ │ │ +|#else | │ │ │ │ │ +| // if the atomic type isn't lock-free, use a single lock instead, for | │ │ │ │ │ +| // the whole array | │ │ │ │ │ +| mutable std::mutex m_mutex; | │ │ │ │ │ +| aux::array m_stats_counter; | │ │ │ │ │ +|#endif | │ │ │ │ │ +| }; | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ |_#_e_n_d_i_f_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |include the number of peers received from this tracker, at last announce | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_a_n_n_o_u_n_c_e___e_n_t_r_y_._h_p_p_:_7_6_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iinncclluuddee tthhee nnuummbbeerr ooff ppeeeerrss rreecceeiivveedd ffrroomm tthhiiss ttrraacckkeerr,, aatt llaasstt aannnnoouunnccee ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//aannnnoouunnccee__eennttrryy..hhpppp::7766 ****** | │ │ │ │ │ +| struct TORRENT_EXPORT announce_infohash | │ │ │ │ │ +| { | │ │ │ │ │ +| // internal | │ │ │ │ │ +| TORRENT_UNEXPORT announce_infohash(); | │ │ │ │ │ +| | │ │ │ │ │ +| // if this tracker has returned an error or warning message | │ │ │ │ │ +| // that message is stored here | │ │ │ │ │ +| std::string message; | │ │ │ │ │ +| | │ │ │ │ │ +| // if this tracker failed the last time it was contacted | │ │ │ │ │ +| // this error code specifies what error occurred | │ │ │ │ │ +| error_code last_error; | │ │ │ │ │ +| | │ │ │ │ │ +| // the time of next tracker announce | │ │ │ │ │ +| time_point32 next_announce = (time_point32::min)(); | │ │ │ │ │ +| | │ │ │ │ │ +| // no announces before this time | │ │ │ │ │ +| time_point32 min_announce = (time_point32::min)(); | │ │ │ │ │ +| | │ │ │ │ │ +| | │ │ │ │ │ +|// these are either -1 or the scrape information this tracker last | │ │ │ │ │ +| // responded with. *incomplete* is the current number of downloaders in | │ │ │ │ │ +| // the swarm, *complete* is the current number of seeds in the swarm and | │ │ │ │ │ +| // *downloaded* is the cumulative number of completed downloads of this | │ │ │ │ │ +| // torrent, since the beginning of time (from this tracker's point of | │ │ │ │ │ +| // view). | │ │ │ │ │ +| | │ │ │ │ │ +| // if this tracker has returned scrape data, these fields are filled in | │ │ │ │ │ +| // with valid numbers. Otherwise they are set to -1. ``incomplete`` counts | │ │ │ │ │ +| // the number of current downloaders. ``complete`` counts the number of | │ │ │ │ │ +| // current peers completed the download, or "seeds". ``downloaded`` is the | │ │ │ │ │ +| // cumulative number of completed downloads. | │ │ │ │ │ +| int scrape_incomplete = -1; | │ │ │ │ │ +| int scrape_complete = -1; | │ │ │ │ │ +| int scrape_downloaded = -1; | │ │ │ │ │ +| | │ │ │ │ │ +| // the number of times in a row we have failed to announce to this | │ │ │ │ │ +| // tracker. | │ │ │ │ │ +| std::uint8_t fails : 7; | │ │ │ │ │ +| | │ │ │ │ │ +| // true while we're waiting for a response from the tracker. | │ │ │ │ │ +| bool updating : 1; | │ │ │ │ │ +| | │ │ │ │ │ +| // set to true when we get a valid response from an announce | │ │ │ │ │ +| // with event=started. If it is set, we won't send start in the subsequent | │ │ │ │ │ +| // announces. | │ │ │ │ │ +| bool start_sent : 1; | │ │ │ │ │ +| | │ │ │ │ │ +| // set to true when we send a event=completed. | │ │ │ │ │ +|_ _ _b_o_o_l_ _c_o_m_p_l_e_t_e___s_e_n_t_ _:_ _1_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |we could bind the socket here, since we know what the target endpoint is of the proxy | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_s_o_c_k_s_5___s_t_r_e_a_m_._h_p_p_:_1_9_7_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** wwee ccoouulldd bbiinndd tthhee ssoocckkeett hheerree,, ssiinnccee wwee kknnooww wwhhaatt tthhee ttaarrggeett eennddppooiinntt iiss ooff tthhee pprrooxxyy ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ssoocckkss55__ssttrreeaamm..hhpppp::119977 ****** | │ │ │ │ │ +|}, std::move(handler))); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|private: | │ │ │ │ │ +| | │ │ │ │ │ +| template | │ │ │ │ │ +| void name_lookup(error_code const& e, tcp::resolver::results_type ips | │ │ │ │ │ +| , Handler h) | │ │ │ │ │ +| { | │ │ │ │ │ +| COMPLETE_ASYNC("socks5_stream::name_lookup"); | │ │ │ │ │ +| if (handle_error(e, std::move(h))) return; | │ │ │ │ │ +| | │ │ │ │ │ +| auto i = ips.begin(); | │ │ │ │ │ +| if (!m_sock.is_open()) | │ │ │ │ │ +| { | │ │ │ │ │ +| error_code ec; | │ │ │ │ │ +| m_sock.open(i->endpoint().protocol(), ec); | │ │ │ │ │ +| if (handle_error(ec, std::move(h))) return; | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +|ADD_OUTSTANDING_ASYNC("socks5_stream::connected"); | │ │ │ │ │ +|m_sock.async_connect(i->endpoint(), wrap_allocator( | │ │ │ │ │ +| [this](error_code const& ec, Handler hn) | │ │ │ │ │ +| { connected(ec, std::move(hn)); }, std::move(h))); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| template | │ │ │ │ │ +| void connected(error_code const& e, Handler h) | │ │ │ │ │ +| { | │ │ │ │ │ +| COMPLETE_ASYNC("socks5_stream::connected"); | │ │ │ │ │ +| if (handle_error(e, std::move(h))) return; | │ │ │ │ │ +| | │ │ │ │ │ +| using namespace libtorrent::aux; | │ │ │ │ │ +| if (m_version == 5) | │ │ │ │ │ +| { | │ │ │ │ │ +| // send SOCKS5 authentication methods | │ │ │ │ │ +| m_buffer.resize(m_user.empty()?3:4); | │ │ │ │ │ +| char* p = &m_buffer[0]; | │ │ │ │ │ +| write_uint8(5, p); // SOCKS VERSION 5 | │ │ │ │ │ +| if (m_user.empty()) | │ │ │ │ │ +| { | │ │ │ │ │ +| write_uint8(1, p); // 1 authentication method (no auth) | │ │ │ │ │ +| write_uint8(0, p); // no authentication | │ │ │ │ │ +| } | │ │ │ │ │ +| else | │ │ │ │ │ +| { | │ │ │ │ │ +| write_uint8(2, p); // 2 authentication methods | │ │ │ │ │ +| write_uint8(0, p); // no authentication | │ │ │ │ │ +| write_uint8(2, p); // username/password | │ │ │ │ │ +| } | │ │ │ │ │ +|_ _ _ _A_D_D___O_U_T_S_T_A_N_D_I_N_G___A_S_Y_N_C_(_"_s_o_c_k_s_5___s_t_r_e_a_m_:_:_h_a_n_d_s_h_a_k_e_1_"_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |should this be allocated lazily? | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_p_i_e_c_e___p_i_c_k_e_r_._h_p_p_:_8_2_3_ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** sshhoouulldd tthhiiss bbee aallllooccaatteedd llaazziillyy?? ********** | │ │ │ │ │ |****** ....//iinncclluuddee//lliibbttoorrrreenntt//ppiieeccee__ppiicckkeerr..hhpppp::882233 ****** | │ │ │ │ │ |// download list it may live in now | │ │ │ │ │ | std::vector::iterator update_piece_state( | │ │ │ │ │ | std::vector::iterator dp); | │ │ │ │ │ @@ -11604,123 +11724,153 @@ │ │ │ │ │ | | │ │ │ │ │ | enum { max_pieces = (std::numeric_limits::max)() - 1 }; | │ │ │ │ │ | | │ │ │ │ │ | }; | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ |_#_e_n_d_i_f_ _/_/_ _T_O_R_R_E_N_T___P_I_E_C_E___P_I_C_K_E_R___H_P_P___I_N_C_L_U_D_E_D_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |make this a string_view | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_i_2_p___s_t_r_e_a_m_._h_p_p_:_5_3_3_ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** mmaakkee tthhiiss aa ssttrriinngg__vviieeww ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ii22pp__ssttrreeaamm..hhpppp::553333 ****** | │ │ │ │ │ -| char tmp[20]; | │ │ │ │ │ -| aux::random_bytes(tmp); | │ │ │ │ │ -| m_session_id.resize(sizeof(tmp)*2); | │ │ │ │ │ -| aux::to_hex(tmp, &m_session_id[0]); | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |move to aux | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_s_o_c_k_e_t___t_y_p_e_._h_p_p_:_6_0_ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** mmoovvee ttoo aauuxx ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ssoocckkeett__ttyyppee..hhpppp::6600 ****** | │ │ │ │ │ +|namespace libtorrent { | │ │ │ │ │ | | │ │ │ │ │ -| m_sam_socket = std::make_shared(m_io_service); | │ │ │ │ │ -| m_sam_socket->set_proxy(m_hostname, m_port); | │ │ │ │ │ -| m_sam_socket->set_command(i2p_stream::cmd_create_session); | │ │ │ │ │ -| m_sam_socket->set_session_id(m_session_id.c_str()); | │ │ │ │ │ -| m_sam_socket->set_session_options(session_options); | │ │ │ │ │ +|// A type describing kinds of sockets involved in various operations or events. | │ │ │ │ │ +|enum class socket_type_t : std::uint8_t { | │ │ │ │ │ +| tcp, | │ │ │ │ │ +| socks5, | │ │ │ │ │ +| http, | │ │ │ │ │ +| utp, | │ │ │ │ │ +| i2p, | │ │ │ │ │ +| tcp_ssl, | │ │ │ │ │ +| socks5_ssl, | │ │ │ │ │ +| http_ssl, | │ │ │ │ │ +| utp_ssl, | │ │ │ │ │ | | │ │ │ │ │ -| ADD_OUTSTANDING_ASYNC("i2p_stream::on_sam_connect"); | │ │ │ │ │ -| m_sam_socket->async_connect(tcp::endpoint(), wrap_allocator( | │ │ │ │ │ -| [this,s=m_sam_socket](error_code const& ec, Handler hn) { | │ │ │ │ │ -| on_sam_connect(ec, s, std::move(hn)); | │ │ │ │ │ -| }, std::move(handler))); | │ │ │ │ │ -| } | │ │ │ │ │ -| void close(error_code&); | │ │ │ │ │ +|#if TORRENT_ABI_VERSION <= 2 | │ │ │ │ │ +| udp TORRENT_DEPRECATED_ENUM = utp, | │ │ │ │ │ +|#endif | │ │ │ │ │ +|}; | │ │ │ │ │ | | │ │ │ │ │ -|char const* session_id() const { return m_session_id.c_str(); } | │ │ │ │ │ -|std::string const& local_endpoint() const { return m_i2p_local_endpoint; } | │ │ │ │ │ +|// return a short human readable name for types of socket | │ │ │ │ │ +|char const* socket_type_name(socket_type_t); | │ │ │ │ │ | | │ │ │ │ │ -| template | │ │ │ │ │ -| void async_name_lookup(char const* name, Handler handler) | │ │ │ │ │ +|} | │ │ │ │ │ +| | │ │ │ │ │ +|_#_e_n_d_i_f_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |it would be nice to remember the bind port and bind once we know where the proxy is m_sock.bind(endpoint, ec); | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_p_r_o_x_y___b_a_s_e_._h_p_p_:_2_2_7_ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iitt wwoouulldd bbee nniiccee ttoo rreemmeemmbbeerr tthhee bbiinndd ppoorrtt aanndd bbiinndd oonnccee wwee kknnooww wwhheerree tthhee pprrooxxyy iiss mm__ssoocckk..bbiinndd((eennddppooiinntt,, eecc));; ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//pprrooxxyy__bbaassee..hhpppp::222277 ****** | │ │ │ │ │ +|TORRENT_ASSERT(m_magic == 0x1337); | │ │ │ │ │ +| m_sock.cancel(); | │ │ │ │ │ +| } | │ │ │ │ │ +| | │ │ │ │ │ +| void cancel(error_code& ec) | │ │ │ │ │ | { | │ │ │ │ │ -| if (m_state == sam_idle && m_name_lookup.empty() && is_open()) | │ │ │ │ │ -| do_name_lookup(name, std::move(handler)); | │ │ │ │ │ -| else | │ │ │ │ │ -| m_name_lookup.emplace_back(std::string(name) | │ │ │ │ │ -| , std::move(handler)); | │ │ │ │ │ +| TORRENT_ASSERT(m_magic == 0x1337); | │ │ │ │ │ +| m_sock.cancel(ec); | │ │ │ │ │ | } | │ │ │ │ │ | | │ │ │ │ │ -|private: | │ │ │ │ │ +| void bind(endpoint_type const& /* endpoint */, error_code& /* ec */) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(m_magic == 0x1337); | │ │ │ │ │ +| // the reason why we ignore binds here is because we don't | │ │ │ │ │ +| // (necessarily) yet know what address family the proxy | │ │ │ │ │ +| // will resolve to, and binding to the wrong one would | │ │ │ │ │ +| // break our connection attempt later. The caller here | │ │ │ │ │ +| // doesn't necessarily know that we're proxying, so this | │ │ │ │ │ +| // bind address is based on the final endpoint, not the | │ │ │ │ │ +| // proxy. | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -| template | │ │ │ │ │ -| void on_sam_connect(error_code const& ec, std::shared_ptr, Handler h) | │ │ │ │ │ +|#ifndef BOOST_NO_EXCEPTIONS | │ │ │ │ │ +| void open(protocol_type const&) | │ │ │ │ │ | { | │ │ │ │ │ -| COMPLETE_ASYNC("i2p_stream::on_sam_connect"); | │ │ │ │ │ -| m_state = sam_idle; | │ │ │ │ │ +| TORRENT_ASSERT(m_magic == 0x1337); | │ │ │ │ │ +|// m_sock.open(p); | │ │ │ │ │ +| } | │ │ │ │ │ +|#endif | │ │ │ │ │ | | │ │ │ │ │ -| if (ec) | │ │ │ │ │ -| { | │ │ │ │ │ -| h(ec); | │ │ │ │ │ -| return; | │ │ │ │ │ -| } | │ │ │ │ │ +| void open(protocol_type const&, error_code&) | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(m_magic == 0x1337); | │ │ │ │ │ +| // we need to ignore this for the same reason as stated | │ │ │ │ │ +| // for ignoring bind() | │ │ │ │ │ +|// m_sock.open(p, ec); | │ │ │ │ │ +| } | │ │ │ │ │ | | │ │ │ │ │ -| do_name_lookup("ME", wrap_allocator( | │ │ │ │ │ -| [this](error_code const& e, char const* dst, Handler hn) { | │ │ │ │ │ -| set_local_endpoint(e, dst, std::move(hn)); | │ │ │ │ │ -|_ _ _ _}_,_ _s_t_d_:_:_m_o_v_e_(_h_)_)_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |replace this by the standard string_view in C++17 | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_s_t_r_i_n_g___v_i_e_w_._h_p_p_:_4_0_ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** rreeppllaaccee tthhiiss bbyy tthhee ssttaannddaarrdd ssttrriinngg__vviieeww iinn CC++++1177 ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ssttrriinngg__vviieeww..hhpppp::4400 ****** | │ │ │ │ │ -|AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | │ │ │ │ │ -|IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | │ │ │ │ │ -|ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE | │ │ │ │ │ -|LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | │ │ │ │ │ -|CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | │ │ │ │ │ -|SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | │ │ │ │ │ -|INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | │ │ │ │ │ +|#ifndef BOOST_NO_EXCEPTIONS | │ │ │ │ │ +| void close() | │ │ │ │ │ +| { | │ │ │ │ │ +| TORRENT_ASSERT(m_magic == 0x1337); | │ │ │ │ │ +| m_remote_endpoint = endpoint_type(); | │ │ │ │ │ +| m_sock.close(); | │ │ │ │ │ +| m_resolver.cancel(); | │ │ │ │ │ +| } | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| void close(error_code& ec) | │ │ │ │ │ +| { | │ │ │ │ │ +|_ _ _T_O_R_R_E_N_T___A_S_S_E_R_T_(_m___m_a_g_i_c_ _=_=_ _0_x_1_3_3_7_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |hide this declaration when deprecated functions are disabled, and remove its internal use | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_i_d_e_n_t_i_f_y___c_l_i_e_n_t_._h_p_p_:_4_8_ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** hhiiddee tthhiiss ddeeccllaarraattiioonn wwhheenn ddeepprreeccaatteedd ffuunnccttiioonnss aarree ddiissaabblleedd,, aanndd rreemmoovvee iittss iinntteerrnnaall uussee ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//iiddeennttiiffyy__cclliieenntt..hhpppp::4488 ****** | │ │ │ │ │ |CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | │ │ │ │ │ |ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | │ │ │ │ │ |POSSIBILITY OF SUCH DAMAGE. | │ │ │ │ │ | | │ │ │ │ │ |*/ | │ │ │ │ │ | | │ │ │ │ │ -|#ifndef TORRENT_STRING_VIEW_HPP_INCLUDED | │ │ │ │ │ -|#define TORRENT_STRING_VIEW_HPP_INCLUDED | │ │ │ │ │ +|#ifndef TORRENT_IDENTIFY_CLIENT_HPP_INCLUDED | │ │ │ │ │ +|#define TORRENT_IDENTIFY_CLIENT_HPP_INCLUDED | │ │ │ │ │ | | │ │ │ │ │ -|#include | │ │ │ │ │ +|#include "libtorrent/config.hpp" | │ │ │ │ │ | | │ │ │ │ │ +|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ |#include "libtorrent/aux_/disable_warnings_push.hpp" | │ │ │ │ │ +|#include | │ │ │ │ │ +|#include "libtorrent/aux_/disable_warnings_pop.hpp" | │ │ │ │ │ +|#endif | │ │ │ │ │ | | │ │ │ │ │ +|#include "libtorrent/peer_id.hpp" | │ │ │ │ │ +|#include "libtorrent/fingerprint.hpp" | │ │ │ │ │ | | │ │ │ │ │ -|#if BOOST_VERSION < 106100 | │ │ │ │ │ -|#include | │ │ │ │ │ -|#include // for strchr | │ │ │ │ │ |namespace libtorrent { | │ │ │ │ │ | | │ │ │ │ │ -|using string_view = boost::string_ref; | │ │ │ │ │ -|using wstring_view = boost::wstring_ref; | │ │ │ │ │ +|namespace aux { | │ │ │ │ │ +| | │ │ │ │ │ +| TORRENT_EXTRA_EXPORT | │ │ │ │ │ +| std::string identify_client_impl(const peer_id& p); | │ │ │ │ │ | | │ │ │ │ │ -|// internal | │ │ │ │ │ -|inline string_view::size_type find_first_of(string_view const v, char const c | │ │ │ │ │ -| , string_view::size_type pos) | │ │ │ │ │ -|{ | │ │ │ │ │ -| while (pos < v.size()) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (v[pos] == c) return pos; | │ │ │ │ │ -| ++pos; | │ │ │ │ │ -| } | │ │ │ │ │ -| return string_view::npos; | │ │ │ │ │ |} | │ │ │ │ │ | | │ │ │ │ │ -|// internal | │ │ │ │ │ -|inline string_view::size_type find_first_of(string_view const v, char const* c | │ │ │ │ │ -| , string_view::size_type pos) | │ │ │ │ │ -|{ | │ │ │ │ │ -| while (pos < v.size()) | │ │ │ │ │ -| { | │ │ │ │ │ -| if (std::strchr(c, v[pos]) != nullptr) return pos; | │ │ │ │ │ -| ++pos; | │ │ │ │ │ -| } | │ │ │ │ │ -|_ _r_e_t_u_r_n_ _s_t_r_i_n_g___v_i_e_w_:_:_n_p_o_s_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| // these functions don't really need to be public. This mechanism of | │ │ │ │ │ +| // advertising client software and version is also out-dated. | │ │ │ │ │ +| | │ │ │ │ │ +| // This function can can be used to extract a string describing a client | │ │ │ │ │ +| // version from its peer-id. It will recognize most clients that have this | │ │ │ │ │ +| // kind of identification in the peer-id. | │ │ │ │ │ +| TORRENT_DEPRECATED_EXPORT | │ │ │ │ │ +| std::string identify_client(const peer_id& p); | │ │ │ │ │ +| | │ │ │ │ │ +|#if TORRENT_ABI_VERSION == 1 | │ │ │ │ │ +| | │ │ │ │ │ +|#include "libtorrent/aux_/disable_deprecation_warnings_push.hpp" | │ │ │ │ │ +| | │ │ │ │ │ +| // Returns an optional fingerprint if any can be identified from the peer | │ │ │ │ │ +| // id. This can be used to automate the identification of clients. It will | │ │ │ │ │ +| // not be able to identify peers with non- standard encodings. Only Azureus | │ │ │ │ │ +| // style, Shadow's style and Mainline style. | │ │ │ │ │ +| TORRENT_DEPRECATED_EXPORT | │ │ │ │ │ +| boost::optional | │ │ │ │ │ +| client_fingerprint(peer_id const& p); | │ │ │ │ │ +| | │ │ │ │ │ +|_#_i_n_c_l_u_d_e_ _"_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/_d_i_s_a_b_l_e___w_a_r_n_i_n_g_s___p_o_p_._h_p_p_"_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |support batched adding of block hashes for reduced overhead? | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_h_a_s_h___p_i_c_k_e_r_._h_p_p_:_1_5_5_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** ssuuppppoorrtt bbaattcchheedd aaddddiinngg ooff bblloocckk hhaasshheess ffoorr rreedduucceedd oovveerrhheeaadd?? ********** | │ │ │ │ │ |****** ....//iinncclluuddee//lliibbttoorrrreenntt//hhaasshh__ppiicckkeerr..hhpppp::115555 ****** | │ │ │ │ │ |// the number of hashes in the range | │ │ │ │ │ | int count = 0; | │ │ │ │ │ | int proof_layers = 0; | │ │ │ │ │ @@ -11768,327 +11918,177 @@ │ │ │ │ │ | | │ │ │ │ │ | struct priority_block_request | │ │ │ │ │ | { | │ │ │ │ │ | priority_block_request(file_index_t const f, int const b) | │ │ │ │ │ | : file(f), block(b) {} | │ │ │ │ │ | file_index_t file; | │ │ │ │ │ |_ _ _ _i_n_t_ _b_l_o_c_k_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |it would be nice to remember the bind port and bind once we know where the proxy is m_sock.bind(endpoint, ec); | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_p_r_o_x_y___b_a_s_e_._h_p_p_:_2_2_7_ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iitt wwoouulldd bbee nniiccee ttoo rreemmeemmbbeerr tthhee bbiinndd ppoorrtt aanndd bbiinndd oonnccee wwee kknnooww wwhheerree tthhee pprrooxxyy iiss mm__ssoocckk..bbiinndd((eennddppooiinntt,, eecc));; ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//pprrooxxyy__bbaassee..hhpppp::222277 ****** | │ │ │ │ │ -|TORRENT_ASSERT(m_magic == 0x1337); | │ │ │ │ │ -| m_sock.cancel(); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void cancel(error_code& ec) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(m_magic == 0x1337); | │ │ │ │ │ -| m_sock.cancel(ec); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -| void bind(endpoint_type const& /* endpoint */, error_code& /* ec */) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(m_magic == 0x1337); | │ │ │ │ │ -| // the reason why we ignore binds here is because we don't | │ │ │ │ │ -| // (necessarily) yet know what address family the proxy | │ │ │ │ │ -| // will resolve to, and binding to the wrong one would | │ │ │ │ │ -| // break our connection attempt later. The caller here | │ │ │ │ │ -| // doesn't necessarily know that we're proxying, so this | │ │ │ │ │ -| // bind address is based on the final endpoint, not the | │ │ │ │ │ -| // proxy. | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|#ifndef BOOST_NO_EXCEPTIONS | │ │ │ │ │ -| void open(protocol_type const&) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(m_magic == 0x1337); | │ │ │ │ │ -|// m_sock.open(p); | │ │ │ │ │ -| } | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| void open(protocol_type const&, error_code&) | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(m_magic == 0x1337); | │ │ │ │ │ -| // we need to ignore this for the same reason as stated | │ │ │ │ │ -| // for ignoring bind() | │ │ │ │ │ -|// m_sock.open(p, ec); | │ │ │ │ │ -| } | │ │ │ │ │ -| | │ │ │ │ │ -|#ifndef BOOST_NO_EXCEPTIONS | │ │ │ │ │ -| void close() | │ │ │ │ │ -| { | │ │ │ │ │ -| TORRENT_ASSERT(m_magic == 0x1337); | │ │ │ │ │ -| m_remote_endpoint = endpoint_type(); | │ │ │ │ │ -| m_sock.close(); | │ │ │ │ │ -| m_resolver.cancel(); | │ │ │ │ │ -| } | │ │ │ │ │ -|#endif | │ │ │ │ │ -| | │ │ │ │ │ -| void close(error_code& ec) | │ │ │ │ │ -| { | │ │ │ │ │ -|_ _ _T_O_R_R_E_N_T___A_S_S_E_R_T_(_m___m_a_g_i_c_ _=_=_ _0_x_1_3_3_7_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |make this a raw pointer (to save size in the first cache line) and make the constructor take a raw pointer. torrent objects should | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._h_p_p_:_2_1_8_ _ _ _ _ _ _ _|_a_l_w_a_y_s_ _o_u_t_l_i_v_e_ _t_h_e_i_r_ _p_e_e_r_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** mmaakkee tthhiiss aa rraaww ppooiinntteerr ((ttoo ssaavvee ssiizzee iinn tthhee ffiirrsstt ccaacchhee lliinnee)) aanndd mmaakkee tthhee ccoonnssttrruuccttoorr ttaakkee aa rraaww ppooiinntteerr.. ttoorrrreenntt oobbjjeeccttss sshhoouulldd aallwwaayyss oouuttlliivvee tthheeiirr ppeeeerrss ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ppeeeerr__ccoonnnneeccttiioonn..hhpppp::221188 ****** | │ │ │ │ │ -|, m_snubbed(false) | │ │ │ │ │ -| , m_interesting(false) | │ │ │ │ │ -| , m_choked(true) | │ │ │ │ │ -| , m_ignore_stats(false) | │ │ │ │ │ -| {} | │ │ │ │ │ -| | │ │ │ │ │ -| // explicitly disallow assignment, to silence msvc warning | │ │ │ │ │ -| peer_connection_hot_members& operator=(peer_connection_hot_members const&) = delete; | │ │ │ │ │ -| | │ │ │ │ │ -| protected: | │ │ │ │ │ -| | │ │ │ │ │ -| // the pieces the other end have | │ │ │ │ │ -| typed_bitfield m_have_piece; | │ │ │ │ │ -| | │ │ │ │ │ -| // this is the torrent this connection is | │ │ │ │ │ -| // associated with. If the connection is an | │ │ │ │ │ -| // incoming connection, this is set to zero | │ │ │ │ │ -| // until the info_hash is received. Then it's | │ │ │ │ │ -| // set to the torrent it belongs to. | │ │ │ │ │ -| | │ │ │ │ │ -|std::weak_ptr m_torrent; | │ │ │ │ │ -| | │ │ │ │ │ -| public: | │ │ │ │ │ -| | │ │ │ │ │ -| // a back reference to the session | │ │ │ │ │ -| // the peer belongs to. | │ │ │ │ │ -| aux::session_interface& m_ses; | │ │ │ │ │ -| | │ │ │ │ │ -| // settings that apply to this peer | │ │ │ │ │ -| aux::session_settings const& m_settings; | │ │ │ │ │ -| | │ │ │ │ │ -| protected: | │ │ │ │ │ -| | │ │ │ │ │ -| // this is true if this connection has been added | │ │ │ │ │ -| // to the list of connections that will be closed. | │ │ │ │ │ -| bool m_disconnecting:1; | │ │ │ │ │ -| | │ │ │ │ │ -| // this is true until this socket has become | │ │ │ │ │ -| // writable for the first time (i.e. the | │ │ │ │ │ -| // connection completed). While connecting | │ │ │ │ │ -| // the timeout will not be triggered. This is | │ │ │ │ │ -| // because windows XP SP2 may delay connection | │ │ │ │ │ -| // attempts, which means that the connection | │ │ │ │ │ -| // may not even have been attempted when the | │ │ │ │ │ -| // time out is reached. | │ │ │ │ │ -| bool m_connecting:1; | │ │ │ │ │ -| | │ │ │ │ │ -| // this is set to true if the last time we tried to | │ │ │ │ │ -| // pick a piece to download, we could only find | │ │ │ │ │ -| // blocks that were already requested from other | │ │ │ │ │ -|_ _ _/_/_ _p_e_e_r_s_._ _I_n_ _t_h_i_s_ _c_a_s_e_,_ _w_e_ _s_h_o_u_l_d_ _n_o_t_ _t_r_y_ _t_o_ _p_i_c_k_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |factor this out into its own class with a virtual interface torrent and session should implement this interface | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_p_e_e_r___c_o_n_n_e_c_t_i_o_n_._h_p_p_:_1_0_2_6_ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ffaaccttoorr tthhiiss oouutt iinnttoo iittss oowwnn ccllaassss wwiitthh aa vviirrttuuaall iinntteerrffaaccee ttoorrrreenntt aanndd sseessssiioonn sshhoouulldd iimmpplleemmeenntt tthhiiss iinntteerrffaaccee ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ppeeeerr__ccoonnnneeccttiioonn..hhpppp::11002266 ****** | │ │ │ │ │ -| // the local endpoint for this peer, i.e. our address | │ │ │ │ │ -| // and our port. If this is set for outgoing connections | │ │ │ │ │ -| // before the connection completes, it means we want to | │ │ │ │ │ -| // force the connection to be bound to the specified interface. | │ │ │ │ │ -| // if it ends up being bound to a different local IP, the connection | │ │ │ │ │ -| // is closed. | │ │ │ │ │ -| tcp::endpoint m_local; | │ │ │ │ │ -| | │ │ │ │ │ -| // remote peer's id | │ │ │ │ │ -| peer_id m_peer_id; | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |replace this by the standard string_view in C++17 | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_s_t_r_i_n_g___v_i_e_w_._h_p_p_:_4_0_ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** rreeppllaaccee tthhiiss bbyy tthhee ssttaannddaarrdd ssttrriinngg__vviieeww iinn CC++++1177 ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ssttrriinngg__vviieeww..hhpppp::4400 ****** | │ │ │ │ │ +|AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | │ │ │ │ │ +|IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | │ │ │ │ │ +|ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE | │ │ │ │ │ +|LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | │ │ │ │ │ +|CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | │ │ │ │ │ +|SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | │ │ │ │ │ +|INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | │ │ │ │ │ +|CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | │ │ │ │ │ +|ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | │ │ │ │ │ +|POSSIBILITY OF SUCH DAMAGE. | │ │ │ │ │ | | │ │ │ │ │ -| protected: | │ │ │ │ │ +|*/ | │ │ │ │ │ | | │ │ │ │ │ -| template | │ │ │ │ │ -| void wrap(Fun f, Args&&... a); | │ │ │ │ │ +|#ifndef TORRENT_STRING_VIEW_HPP_INCLUDED | │ │ │ │ │ +|#define TORRENT_STRING_VIEW_HPP_INCLUDED | │ │ │ │ │ | | │ │ │ │ │ -| // statistics about upload and download speeds | │ │ │ │ │ -| // and total amount of uploads and downloads for | │ │ │ │ │ -| // this peer | │ │ │ │ │ -|stat m_statistics; | │ │ │ │ │ +|#include | │ │ │ │ │ | | │ │ │ │ │ -| // the number of outstanding bytes expected | │ │ │ │ │ -| // to be received by extensions | │ │ │ │ │ -| int m_extension_outstanding_bytes = 0; | │ │ │ │ │ +|#include "libtorrent/aux_/disable_warnings_push.hpp" | │ │ │ │ │ | | │ │ │ │ │ -| // the number of time critical requests | │ │ │ │ │ -| // queued up in the m_request_queue that | │ │ │ │ │ -| // soon will be committed to the download | │ │ │ │ │ -| // queue. This is included in download_queue_time() | │ │ │ │ │ -| // so that it can be used while adding more | │ │ │ │ │ -| // requests and take the previous requests | │ │ │ │ │ -| // into account without submitting it all | │ │ │ │ │ -| // immediately | │ │ │ │ │ -| std::uint16_t m_queued_time_critical = 0; | │ │ │ │ │ | | │ │ │ │ │ -| // the number of bytes we are currently reading | │ │ │ │ │ -| // from disk, that will be added to the send | │ │ │ │ │ -| // buffer as soon as they complete | │ │ │ │ │ -| int m_reading_bytes = 0; | │ │ │ │ │ +|#if BOOST_VERSION < 106100 | │ │ │ │ │ +|#include | │ │ │ │ │ +|#include // for strchr | │ │ │ │ │ +|namespace libtorrent { | │ │ │ │ │ | | │ │ │ │ │ -| // options used for the piece picker. These flags will | │ │ │ │ │ -| // be augmented with flags controlled by other settings | │ │ │ │ │ -| // like sequential download etc. These are here to | │ │ │ │ │ -| // let plugins control flags that should always be set | │ │ │ │ │ -| picker_options_t m_picker_options{}; | │ │ │ │ │ +|using string_view = boost::string_ref; | │ │ │ │ │ +|using wstring_view = boost::wstring_ref; | │ │ │ │ │ | | │ │ │ │ │ -| // the number of invalid piece-requests | │ │ │ │ │ -| // we have got from this peer. If the request | │ │ │ │ │ -| // queue gets empty, and there have been | │ │ │ │ │ -|_ _ _/_/_ _i_n_v_a_l_i_d_ _r_e_q_u_e_s_t_s_,_ _w_e_ _c_a_n_ _a_s_s_u_m_e_ _t_h_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |we could bind the socket here, since we know what the target endpoint is of the proxy | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_s_o_c_k_s_5___s_t_r_e_a_m_._h_p_p_:_1_9_7_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** wwee ccoouulldd bbiinndd tthhee ssoocckkeett hheerree,, ssiinnccee wwee kknnooww wwhhaatt tthhee ttaarrggeett eennddppooiinntt iiss ooff tthhee pprrooxxyy ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ssoocckkss55__ssttrreeaamm..hhpppp::119977 ****** | │ │ │ │ │ -|}, std::move(handler))); | │ │ │ │ │ +|// internal | │ │ │ │ │ +|inline string_view::size_type find_first_of(string_view const v, char const c | │ │ │ │ │ +| , string_view::size_type pos) | │ │ │ │ │ +|{ | │ │ │ │ │ +| while (pos < v.size()) | │ │ │ │ │ +| { | │ │ │ │ │ +| if (v[pos] == c) return pos; | │ │ │ │ │ +| ++pos; | │ │ │ │ │ | } | │ │ │ │ │ +| return string_view::npos; | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -|private: | │ │ │ │ │ -| | │ │ │ │ │ -| template | │ │ │ │ │ -| void name_lookup(error_code const& e, tcp::resolver::results_type ips | │ │ │ │ │ -| , Handler h) | │ │ │ │ │ +|// internal | │ │ │ │ │ +|inline string_view::size_type find_first_of(string_view const v, char const* c | │ │ │ │ │ +| , string_view::size_type pos) | │ │ │ │ │ +|{ | │ │ │ │ │ +| while (pos < v.size()) | │ │ │ │ │ | { | │ │ │ │ │ -| COMPLETE_ASYNC("socks5_stream::name_lookup"); | │ │ │ │ │ -| if (handle_error(e, std::move(h))) return; | │ │ │ │ │ +| if (std::strchr(c, v[pos]) != nullptr) return pos; | │ │ │ │ │ +| ++pos; | │ │ │ │ │ +| } | │ │ │ │ │ +|_ _r_e_t_u_r_n_ _s_t_r_i_n_g___v_i_e_w_:_:_n_p_o_s_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |change the type to std::shared_ptr in C++17 it is used as if immutable, it cannot be const for technical reasons right now. | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_t_o_r_r_e_n_t___i_n_f_o_._h_p_p_:_7_2_9_ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** cchhaannggee tthhee ttyyppee ttoo ssttdd::::sshhaarreedd__ppttrr iinn CC++++1177 iitt iiss uusseedd aass iiff iimmmmuuttaabbllee,, iitt ccaannnnoott bbee ccoonnsstt ffoorr tteecchhnniiccaall rreeaassoonnss rriigghhtt nnooww.. ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ttoorrrreenntt__iinnffoo..hhpppp::772299 ****** | │ │ │ │ │ +| // these are the collections from outside of the info-dict. These are | │ │ │ │ │ +| // owning strings, since we only keep the info-section around, these | │ │ │ │ │ +| // cannot be pointers into that buffer. | │ │ │ │ │ +| std::vector m_owned_collections; | │ │ │ │ │ | | │ │ │ │ │ -| auto i = ips.begin(); | │ │ │ │ │ -| if (!m_sock.is_open()) | │ │ │ │ │ -| { | │ │ │ │ │ -| error_code ec; | │ │ │ │ │ -| m_sock.open(i->endpoint().protocol(), ec); | │ │ │ │ │ -| if (handle_error(ec, std::move(h))) return; | │ │ │ │ │ -| } | │ │ │ │ │ +|#if TORRENT_ABI_VERSION <= 2 | │ │ │ │ │ +| // if this is a merkle torrent, this is the merkle | │ │ │ │ │ +| // tree. It has space for merkle_num_nodes(merkle_num_leafs(num_pieces)) | │ │ │ │ │ +| // hashes | │ │ │ │ │ +| aux::vector m_merkle_tree; | │ │ │ │ │ +|#endif | │ │ │ │ │ | | │ │ │ │ │ -|ADD_OUTSTANDING_ASYNC("socks5_stream::connected"); | │ │ │ │ │ -|m_sock.async_connect(i->endpoint(), wrap_allocator( | │ │ │ │ │ -| [this](error_code const& ec, Handler hn) | │ │ │ │ │ -| { connected(ec, std::move(hn)); }, std::move(h))); | │ │ │ │ │ -| } | │ │ │ │ │ +| // v2 merkle tree for each file | │ │ │ │ │ +| // the actual hash buffers are always divisible by 32 (sha256_hash::size()) | │ │ │ │ │ +| aux::vector, file_index_t> m_piece_layers; | │ │ │ │ │ | | │ │ │ │ │ -| template | │ │ │ │ │ -| void connected(error_code const& e, Handler h) | │ │ │ │ │ -| { | │ │ │ │ │ -| COMPLETE_ASYNC("socks5_stream::connected"); | │ │ │ │ │ -| if (handle_error(e, std::move(h))) return; | │ │ │ │ │ +| // this is a copy of the info section from the torrent. | │ │ │ │ │ +| // it use maintained in this flat format in order to | │ │ │ │ │ +| // make it available through the metadata extension | │ │ │ │ │ +|boost::shared_array m_info_section; | │ │ │ │ │ | | │ │ │ │ │ -| using namespace libtorrent::aux; | │ │ │ │ │ -| if (m_version == 5) | │ │ │ │ │ -| { | │ │ │ │ │ -| // send SOCKS5 authentication methods | │ │ │ │ │ -| m_buffer.resize(m_user.empty()?3:4); | │ │ │ │ │ -| char* p = &m_buffer[0]; | │ │ │ │ │ -| write_uint8(5, p); // SOCKS VERSION 5 | │ │ │ │ │ -| if (m_user.empty()) | │ │ │ │ │ -| { | │ │ │ │ │ -| write_uint8(1, p); // 1 authentication method (no auth) | │ │ │ │ │ -| write_uint8(0, p); // no authentication | │ │ │ │ │ -| } | │ │ │ │ │ -| else | │ │ │ │ │ -| { | │ │ │ │ │ -| write_uint8(2, p); // 2 authentication methods | │ │ │ │ │ -| write_uint8(0, p); // no authentication | │ │ │ │ │ -| write_uint8(2, p); // username/password | │ │ │ │ │ -| } | │ │ │ │ │ -|_ _ _ _A_D_D___O_U_T_S_T_A_N_D_I_N_G___A_S_Y_N_C_(_"_s_o_c_k_s_5___s_t_r_e_a_m_:_:_h_a_n_d_s_h_a_k_e_1_"_)_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |support using the windows API for UPnP operations as well | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_u_p_n_p_._h_p_p_:_1_6_2_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ssuuppppoorrtt uussiinngg tthhee wwiinnddoowwss AAPPII ffoorr UUPPnnPP ooppeerraattiioonnss aass wweellll ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//uuppnnpp..hhpppp::116622 ****** | │ │ │ │ │ -|{ | │ │ │ │ │ -| bool in_error_code = false; | │ │ │ │ │ -| bool exit = false; | │ │ │ │ │ -| int error_code = -1; | │ │ │ │ │ -|}; | │ │ │ │ │ +| // if a comment is found in the torrent file | │ │ │ │ │ +| // this will be set to that comment | │ │ │ │ │ +| std::string m_comment; | │ │ │ │ │ | | │ │ │ │ │ -|struct ip_address_parse_state: error_code_parse_state | │ │ │ │ │ -|{ | │ │ │ │ │ -| bool in_ip_address = false; | │ │ │ │ │ -| std::string ip_address; | │ │ │ │ │ -|}; | │ │ │ │ │ +| // an optional string naming the software used | │ │ │ │ │ +| // to create the torrent file | │ │ │ │ │ +| std::string m_created_by; | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_EXTRA_EXPORT void find_control_url(int type, string_view, parse_state& state); | │ │ │ │ │ +| // the info section parsed. points into m_info_section | │ │ │ │ │ +| // parsed lazily | │ │ │ │ │ +| mutable bdecode_node m_info_dict; | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_EXTRA_EXPORT void find_error_code(int type, string_view string | │ │ │ │ │ -| , error_code_parse_state& state); | │ │ │ │ │ +| // if a creation date is found in the torrent file | │ │ │ │ │ +| // this will be set to that, otherwise it'll be | │ │ │ │ │ +| // 1970, Jan 1 | │ │ │ │ │ +| std::time_t m_creation_date = 0; | │ │ │ │ │ | | │ │ │ │ │ -|TORRENT_EXTRA_EXPORT void find_ip_address(int type, string_view string | │ │ │ │ │ -| , ip_address_parse_state& state); | │ │ │ │ │ +| // the hash(es) that identify this torrent | │ │ │ │ │ +| info_hash_t m_info_hash; | │ │ │ │ │ | | │ │ │ │ │ -|struct TORRENT_EXTRA_EXPORT upnp final | │ │ │ │ │ -|: std::enable_shared_from_this | │ │ │ │ │ -| , single_threaded | │ │ │ │ │ -|{ | │ │ │ │ │ -| upnp(io_context& ios | │ │ │ │ │ -| , aux::session_settings const& settings | │ │ │ │ │ -| , aux::portmap_callback& cb | │ │ │ │ │ -| , address_v4 listen_address | │ │ │ │ │ -| , address_v4 netmask | │ │ │ │ │ -| , std::string listen_device | │ │ │ │ │ -| , aux::listen_socket_handle ls); | │ │ │ │ │ -| ~upnp(); | │ │ │ │ │ +| // this is the offset into the m_info_section buffer to the first byte of | │ │ │ │ │ +| // the first SHA-1 hash | │ │ │ │ │ +| std::int32_t m_piece_hashes = 0; | │ │ │ │ │ | | │ │ │ │ │ -| void start(); | │ │ │ │ │ +| // the number of bytes in m_info_section | │ │ │ │ │ +| std::int32_t m_info_section_size = 0; | │ │ │ │ │ | | │ │ │ │ │ -| // Attempts to add a port mapping for the specified protocol. Valid protocols are | │ │ │ │ │ -| // ``upnp::tcp`` and ``upnp::udp`` for the UPnP class and ``natpmp::tcp`` and | │ │ │ │ │ -| // ``natpmp::udp`` for the NAT-PMP class. | │ │ │ │ │ -| // | │ │ │ │ │ -| // ``external_port`` is the port on the external address that will be mapped. This | │ │ │ │ │ -| // is a hint, you are not guaranteed that this port will be available, and it may | │ │ │ │ │ -| // end up being something else. In the portmap_alert_ notification, the actual | │ │ │ │ │ -| // external port is reported. | │ │ │ │ │ -| // | │ │ │ │ │ -| // ``local_port`` is the port in the local machine that the mapping should forward | │ │ │ │ │ -| // to. | │ │ │ │ │ -| // | │ │ │ │ │ -| // The return value is an index that identifies this port mapping. This is used | │ │ │ │ │ -| // to refer to mappings that fails or succeeds in the portmap_error_alert_ and | │ │ │ │ │ -| // portmap_alert_ respectively. If The mapping fails immediately, the return value | │ │ │ │ │ -|_ _/_/_ _i_s_ _-_1_,_ _w_h_i_c_h_ _m_e_a_n_s_ _f_a_i_l_u_r_e_._ _T_h_e_r_e_ _w_i_l_l_ _n_o_t_ _b_e_ _a_n_y_ _e_r_r_o_r_ _a_l_e_r_t_ _n_o_t_i_f_i_c_a_t_i_o_n_ _f_o_r_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |some space could be saved here by making gauges 32 bits | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_p_e_r_f_o_r_m_a_n_c_e___c_o_u_n_t_e_r_s_._h_p_p_:_4_8_5_ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** ssoommee ssppaaccee ccoouulldd bbee ssaavveedd hheerree bbyy mmaakkiinngg ggaauuggeess 3322 bbiittss ********** | │ │ │ │ │ -|_**_**_**_ _.._.._//_ii_nn_cc_ll_uu_dd_ee_//_ll_ii_bb_tt_oo_rr_rr_ee_nn_tt_//_pp_ee_rr_ff_oo_rr_mm_aa_nn_cc_ee____cc_oo_uu_nn_tt_ee_rr_ss_.._hh_pp_pp_::_44_88_55_ _**_**_**_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |restore these to regular integers. Instead have one copy of the counters per thread and collect them at convenient synchronization | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_p_e_r_f_o_r_m_a_n_c_e___c_o_u_n_t_e_r_s_._h_p_p_:_4_8_6_ _ _|_p_o_i_n_t_s_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** rreessttoorree tthheessee ttoo rreegguullaarr iinntteeggeerrss.. IInnsstteeaadd hhaavvee oonnee ccooppyy ooff tthhee ccoouunntteerrss ppeerr tthhrreeaadd aanndd ccoolllleecctt tthheemm aatt ccoonnvveenniieenntt ssyynncchhrroonniizzaattiioonn ppooiinnttss ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ppeerrffoorrmmaannccee__ccoouunntteerrss..hhpppp::448866 ****** | │ │ │ │ │ -|#ifdef ATOMIC_LLONG_LOCK_FREE | │ │ │ │ │ -|#define TORRENT_COUNTER_NOEXCEPT noexcept | │ │ │ │ │ -|#else | │ │ │ │ │ -|#define TORRENT_COUNTER_NOEXCEPT | │ │ │ │ │ -|#endif | │ │ │ │ │ +| // this is used when creating a torrent. If there's | │ │ │ │ │ +|_ _ _/_/_ _o_n_l_y_ _o_n_e_ _f_i_l_e_ _t_h_e_r_e_ _a_r_e_ _c_a_s_e_s_ _w_h_e_r_e_ _i_t_'_s_ _i_m_p_o_s_s_i_b_l_e_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| |_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ | | │ │ │ │ │ +|relevance 0|_p_e_e_r___c_o_n_n_e_c_t_i_o_n___i_n_t_e_r_f_a_c_e_._h_p_p_:|make this interface smaller! | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_5_1_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** mmaakkee tthhiiss iinntteerrffaaccee ssmmaalllleerr!! ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//ppeeeerr__ccoonnnneeccttiioonn__iinntteerrffaaccee..hhpppp::5511 ****** | │ │ │ │ │ +|*/ | │ │ │ │ │ | | │ │ │ │ │ -| counters() TORRENT_COUNTER_NOEXCEPT; | │ │ │ │ │ +|#ifndef TORRENT_PEER_CONNECTION_INTERFACE_HPP | │ │ │ │ │ +|#define TORRENT_PEER_CONNECTION_INTERFACE_HPP | │ │ │ │ │ | | │ │ │ │ │ -| counters(counters const&) TORRENT_COUNTER_NOEXCEPT; | │ │ │ │ │ -| counters& operator=(counters const&) & TORRENT_COUNTER_NOEXCEPT; | │ │ │ │ │ +|#include "libtorrent/fwd.hpp" | │ │ │ │ │ +|#include "libtorrent/socket.hpp" | │ │ │ │ │ +|#include "libtorrent/error_code.hpp" | │ │ │ │ │ +|#include "libtorrent/alert_types.hpp" | │ │ │ │ │ +|#include "libtorrent/operations.hpp" // for operation_t enum | │ │ │ │ │ +|#include "libtorrent/units.hpp" | │ │ │ │ │ | | │ │ │ │ │ -| // returns the new value | │ │ │ │ │ -| std::int64_t inc_stats_counter(int c, std::int64_t value = 1) TORRENT_COUNTER_NOEXCEPT; | │ │ │ │ │ -| std::int64_t operator[](int i) const TORRENT_COUNTER_NOEXCEPT; | │ │ │ │ │ +|namespace libtorrent { | │ │ │ │ │ | | │ │ │ │ │ -| void set_value(int c, std::int64_t value) TORRENT_COUNTER_NOEXCEPT; | │ │ │ │ │ -| void blend_stats_counter(int c, std::int64_t value, int ratio) TORRENT_COUNTER_NOEXCEPT; | │ │ │ │ │ +| struct torrent_peer; | │ │ │ │ │ +| class stat; | │ │ │ │ │ | | │ │ │ │ │ -| private: | │ │ │ │ │ +| using disconnect_severity_t = aux::strong_typedef; | │ │ │ │ │ | | │ │ │ │ │ -|#ifdef ATOMIC_LLONG_LOCK_FREE | │ │ │ │ │ -|aux::array, num_counters> m_stats_counter; | │ │ │ │ │ -|#else | │ │ │ │ │ -| // if the atomic type isn't lock-free, use a single lock instead, for | │ │ │ │ │ -| // the whole array | │ │ │ │ │ -| mutable std::mutex m_mutex; | │ │ │ │ │ -| aux::array m_stats_counter; | │ │ │ │ │ -|#endif | │ │ │ │ │ -| }; | │ │ │ │ │ -|} | │ │ │ │ │ +|struct TORRENT_EXTRA_EXPORT peer_connection_interface | │ │ │ │ │ +|{ | │ │ │ │ │ +| static constexpr disconnect_severity_t normal{0}; | │ │ │ │ │ +| static constexpr disconnect_severity_t failure{1}; | │ │ │ │ │ +| static constexpr disconnect_severity_t peer_error{2}; | │ │ │ │ │ | | │ │ │ │ │ +|#if TORRENT_USE_I2P | │ │ │ │ │ +| virtual std::string const& destination() const = 0; | │ │ │ │ │ +| virtual std::string const& local_i2p_endpoint() const = 0; | │ │ │ │ │ +|#endif | │ │ │ │ │ +| virtual tcp::endpoint const& remote() const = 0; | │ │ │ │ │ +| virtual tcp::endpoint local_endpoint() const = 0; | │ │ │ │ │ +| virtual void disconnect(error_code const& ec | │ │ │ │ │ +| , operation_t op, disconnect_severity_t = peer_connection_interface::normal) = 0; | │ │ │ │ │ +| virtual peer_id const& pid() const = 0; | │ │ │ │ │ +| virtual peer_id our_pid() const = 0; | │ │ │ │ │ +| virtual void set_holepunch_mode() = 0; | │ │ │ │ │ +| virtual torrent_peer* peer_info_struct() const = 0; | │ │ │ │ │ +| virtual void set_peer_info(torrent_peer* pi) = 0; | │ │ │ │ │ +| virtual bool is_outgoing() const = 0; | │ │ │ │ │ +| virtual void add_stat(std::int64_t downloaded, std::int64_t uploaded) = 0; | │ │ │ │ │ +| virtual bool fast_reconnect() const = 0; | │ │ │ │ │ +| virtual bool is_choked() const = 0; | │ │ │ │ │ +| virtual bool failed() const = 0; | │ │ │ │ │ +| virtual stat const& statistics() const = 0; | │ │ │ │ │ +| virtual void get_peer_info(peer_info& p) const = 0; | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_LOGGING | │ │ │ │ │ +| virtual bool should_log(peer_log_alert::direction_t direction) const = 0; | │ │ │ │ │ +| virtual void peer_log(peer_log_alert::direction_t direction | │ │ │ │ │ +| , char const* event, char const* fmt = "", ...) const noexcept TORRENT_FORMAT(4,5) = 0; | │ │ │ │ │ |_#_e_n_d_i_f_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/ |move this to its own .hpp/.cpp pair? | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_k_a_d_e_m_l_i_a_/_m_s_g_._h_p_p_:_8_7_ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** mmoovvee tthhiiss ttoo iittss oowwnn ..hhpppp//..ccpppp ppaaiirr?? ********** | │ │ │ │ │ |****** ....//iinncclluuddee//lliibbttoorrrreenntt//kkaaddeemmlliiaa//mmssgg..hhpppp::8877 ****** | │ │ │ │ │ |int flags; | │ │ │ │ │ | | │ │ │ │ │ @@ -12177,69 +12177,216 @@ │ │ │ │ │ | , secret_key const& sk); | │ │ │ │ │ | explicit item(bdecode_node const& v); | │ │ │ │ │ | | │ │ │ │ │ | void assign(entry v); | │ │ │ │ │ | void assign(entry v, span salt | │ │ │ │ │ | , sequence_number seq | │ │ │ │ │ |_ _ _,_ _p_u_b_l_i_c___k_e_y_ _c_o_n_s_t_&_ _p_k_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/ |it would be nice to not have this be part of session_interface | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_s_e_s_s_i_o_n___i_n_t_e_r_f_a_c_e_._h_p_p_:_2_1_2_ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iitt wwoouulldd bbee nniiccee ttoo nnoott hhaavvee tthhiiss bbee ppaarrtt ooff sseessssiioonn__iinntteerrffaaccee ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//aauuxx__//sseessssiioonn__iinntteerrffaaccee..hhpppp::221122 ****** | │ │ │ │ │ -|virtual void deferred_submit_jobs() = 0; | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/ |ensure the alignment is good here | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_p_o_o_l_._h_p_p_:_4_9_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** eennssuurree tthhee aalliiggnnmmeenntt iiss ggoooodd hheerree ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//aauuxx__//ppooooll..hhpppp::4499 ****** | │ │ │ │ │ +|POSSIBILITY OF SUCH DAMAGE. | │ │ │ │ │ | | │ │ │ │ │ -| virtual std::uint16_t listen_port() const = 0; | │ │ │ │ │ -| virtual std::uint16_t ssl_listen_port() const = 0; | │ │ │ │ │ +|*/ | │ │ │ │ │ | | │ │ │ │ │ -| virtual int listen_port(aux::transport ssl, address const& local_addr) = 0; | │ │ │ │ │ +|#ifndef TORRENT_POOL_HPP | │ │ │ │ │ +|#define TORRENT_POOL_HPP | │ │ │ │ │ | | │ │ │ │ │ -| virtual void for_each_listen_socket(std::function f) = 0; | │ │ │ │ │ +|#include "libtorrent/aux_/disable_warnings_push.hpp" | │ │ │ │ │ +|#include | │ │ │ │ │ +|#include | │ │ │ │ │ +|#include "libtorrent/aux_/disable_warnings_pop.hpp" | │ │ │ │ │ | | │ │ │ │ │ -| // ask for which interface and port to bind outgoing peer connections on | │ │ │ │ │ -| virtual tcp::endpoint bind_outgoing_socket(socket_type& s, address const& | │ │ │ │ │ -| remote_address, error_code& ec) const = 0; | │ │ │ │ │ -| virtual bool verify_bound_address(address const& addr, bool utp | │ │ │ │ │ -| , error_code& ec) = 0; | │ │ │ │ │ +|namespace libtorrent { | │ │ │ │ │ +|namespace aux { | │ │ │ │ │ | | │ │ │ │ │ -|#ifndef TORRENT_DISABLE_MUTABLE_TORRENTS | │ │ │ │ │ -| virtual std::vector> find_collection( | │ │ │ │ │ -| std::string const& collection) const = 0; | │ │ │ │ │ -|#endif | │ │ │ │ │ +|struct allocator_new_delete | │ │ │ │ │ +|{ | │ │ │ │ │ +| using size_type = std::size_t; | │ │ │ │ │ +| using difference_type = std::ptrdiff_t; | │ │ │ │ │ | | │ │ │ │ │ -|virtual proxy_settings proxy() const = 0; | │ │ │ │ │ +|static char* malloc(size_type const bytes) | │ │ │ │ │ +|{ return new char[bytes]; } | │ │ │ │ │ +| static void free(char* const block) | │ │ │ │ │ +| { delete [] block; } | │ │ │ │ │ +|}; | │ │ │ │ │ | | │ │ │ │ │ -|#if TORRENT_USE_I2P | │ │ │ │ │ -| virtual char const* i2p_session() const = 0; | │ │ │ │ │ -| virtual std::string const& local_i2p_endpoint() const = 0; | │ │ │ │ │ -|#endif | │ │ │ │ │ +|using pool = boost::pool; | │ │ │ │ │ | | │ │ │ │ │ -| virtual void prioritize_connections(std::weak_ptr t) = 0; | │ │ │ │ │ +|template | │ │ │ │ │ +|using object_pool = boost::object_pool; | │ │ │ │ │ | | │ │ │ │ │ -| virtual void trigger_auto_manage() = 0; | │ │ │ │ │ +|} | │ │ │ │ │ +|} | │ │ │ │ │ | | │ │ │ │ │ -| virtual void apply_settings_pack(std::shared_ptr pack) = 0; | │ │ │ │ │ -| virtual session_settings const& settings() const = 0; | │ │ │ │ │ +|_#_e_n_d_i_f_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/ |include the number of peers received from this tracker, at last announce | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_a_n_n_o_u_n_c_e___e_n_t_r_y_._h_p_p_:_7_4_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iinncclluuddee tthhee nnuummbbeerr ooff ppeeeerrss rreecceeiivveedd ffrroomm tthhiiss ttrraacckkeerr,, aatt llaasstt aannnnoouunnccee ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//aauuxx__//aannnnoouunnccee__eennttrryy..hhpppp::7744 ****** | │ │ │ │ │ +|namespace aux { | │ │ │ │ │ | | │ │ │ │ │ -| virtual void queue_tracker_request(tracker_request req | │ │ │ │ │ -| , std::weak_ptr c) = 0; | │ │ │ │ │ +| struct TORRENT_EXTRA_EXPORT announce_infohash | │ │ │ │ │ +| { | │ │ │ │ │ +| announce_infohash(); | │ │ │ │ │ | | │ │ │ │ │ -| // peer-classes | │ │ │ │ │ -| virtual void set_peer_classes(peer_class_set* s, address const& a, socket_type_t st) = 0; | │ │ │ │ │ -| virtual peer_class_pool const& peer_classes() const = 0; | │ │ │ │ │ -| virtual peer_class_pool& peer_classes() = 0; | │ │ │ │ │ -| virtual bool ignore_unchoke_slots_set(peer_class_set const& set) const = 0; | │ │ │ │ │ -| virtual int copy_pertinent_channels(peer_class_set const& set | │ │ │ │ │ -| , int channel, bandwidth_channel** dst, int m) = 0; | │ │ │ │ │ -| virtual int use_quota_overhead(peer_class_set& set, int amount_down, int amount_up) = 0; | │ │ │ │ │ +| // if this tracker has returned an error or warning message | │ │ │ │ │ +| // that message is stored here | │ │ │ │ │ +| std::string message; | │ │ │ │ │ | | │ │ │ │ │ -| virtual bandwidth_manager* get_bandwidth_manager(int channel) = 0; | │ │ │ │ │ +| // if this tracker failed the last time it was contacted | │ │ │ │ │ +| // this error code specifies what error occurred | │ │ │ │ │ +| error_code last_error; | │ │ │ │ │ | | │ │ │ │ │ -| virtual void sent_bytes(int bytes_payload, int bytes_protocol) = 0; | │ │ │ │ │ -| virtual void received_bytes(int bytes_payload, int bytes_protocol) = 0; | │ │ │ │ │ -|_ _ _v_i_r_t_u_a_l_ _v_o_i_d_ _t_r_a_n_c_i_e_v_e___i_p___p_a_c_k_e_t_(_i_n_t_ _b_y_t_e_s_,_ _b_o_o_l_ _i_p_v_6_)_ _=_ _0_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +| // the time of next tracker announce | │ │ │ │ │ +| time_point32 next_announce = (time_point32::min)(); | │ │ │ │ │ +| | │ │ │ │ │ +| // no announces before this time | │ │ │ │ │ +| time_point32 min_announce = (time_point32::min)(); | │ │ │ │ │ +| | │ │ │ │ │ +| | │ │ │ │ │ +|// these are either -1 or the scrape information this tracker last | │ │ │ │ │ +| // responded with. *incomplete* is the current number of downloaders in | │ │ │ │ │ +| // the swarm, *complete* is the current number of seeds in the swarm and | │ │ │ │ │ +| // *downloaded* is the cumulative number of completed downloads of this | │ │ │ │ │ +| // torrent, since the beginning of time (from this tracker's point of | │ │ │ │ │ +| // view). | │ │ │ │ │ +| | │ │ │ │ │ +| // if this tracker has returned scrape data, these fields are filled in | │ │ │ │ │ +| // with valid numbers. Otherwise they are set to -1. ``incomplete`` counts | │ │ │ │ │ +| // the number of current downloaders. ``complete`` counts the number of | │ │ │ │ │ +| // current peers completed the download, or "seeds". ``downloaded`` is the | │ │ │ │ │ +| // cumulative number of completed downloads. | │ │ │ │ │ +| int scrape_incomplete = -1; | │ │ │ │ │ +| int scrape_complete = -1; | │ │ │ │ │ +| int scrape_downloaded = -1; | │ │ │ │ │ +| | │ │ │ │ │ +| // the number of times in a row we have failed to announce to this | │ │ │ │ │ +| // tracker. | │ │ │ │ │ +| std::uint8_t fails : 7; | │ │ │ │ │ +| | │ │ │ │ │ +| // true while we're waiting for a response from the tracker. | │ │ │ │ │ +| bool updating : 1; | │ │ │ │ │ +| | │ │ │ │ │ +| // set to true when we get a valid response from an announce | │ │ │ │ │ +| // with event=started. If it is set, we won't send start in the subsequent | │ │ │ │ │ +| // announces. | │ │ │ │ │ +| bool start_sent : 1; | │ │ │ │ │ +| | │ │ │ │ │ +| // set to true when we send a event=completed. | │ │ │ │ │ +|_ _ _b_o_o_l_ _c_o_m_p_l_e_t_e___s_e_n_t_ _:_ _1_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/ |remove this constructor. Don't support "uninitialized" trees. This also requires not constructing these for pad-files and small | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_m_e_r_k_l_e___t_r_e_e_._h_p_p_:_8_5_ _ _ _ _ _ _ _ _ _ _ _ _|_f_i_l_e_s_ _a_s_ _w_e_l_l_._ _S_o_,_ _a_ _s_p_a_r_s_e_ _h_a_s_h_ _l_i_s_t_ _i_n_ _t_o_r_r_e_n_t___i_n_f_o_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** rreemmoovvee tthhiiss ccoonnssttrruuccttoorr.. DDoonn''tt ssuuppppoorrtt ""uunniinniittiiaalliizzeedd"" ttrreeeess.. TThhiiss aallssoo rreeqquuiirreess nnoott ccoonnssttrruuccttiinngg tthheessee ffoorr ppaadd--ffiilleess aanndd ssmmaallll ffiilleess aass wweellll.. SSoo,, aa ssppaarrssee hhaasshh lliisstt iinn | │ │ │ │ │ +|ttoorrrreenntt__iinnffoo ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//aauuxx__//mmeerrkkllee__ttrreeee..hhpppp::8855 ****** | │ │ │ │ │ +|// The invariant of the tree is that all interior nodes (i.e. all but the very | │ │ │ │ │ +|// bottom leaf nodes, representing block hashes) are either set and valid, or | │ │ │ │ │ +|// clear. No invalid hashes are allowed, and they can only be added by also | │ │ │ │ │ +|// providing proof of being valid. | │ │ │ │ │ +| | │ │ │ │ │ +|// The leaf blocks on the other hand, MAY be invalid. For instance, when adding | │ │ │ │ │ +|// a magnet link for a torrent that we already have files for. Once we have the | │ │ │ │ │ +|// metadata, we have files on disk but no hashes. We won't know whether the data | │ │ │ │ │ +|// on disk is valid or not, until we've downloaded the hashes to validate them. | │ │ │ │ │ +| | │ │ │ │ │ +|// Idea for future space optimization: | │ │ │ │ │ +|// while downloading, we need to store interior nodes of this tree. However, we | │ │ │ │ │ +|// don't need to store the padding. a SHA-256 is 32 bytes. Instead of storing | │ │ │ │ │ +|// the full (padded) tree of SHA-256 hashes, store the full tree of 32 bit | │ │ │ │ │ +|// signed integers, being indices into the actual storage for the tree. We could | │ │ │ │ │ +|// even grow the storage lazily. Instead of storing the padding hashes, use | │ │ │ │ │ +|// negative indices to refer to fixed SHA-256(0), and SHA-256(SHA-256(0)) and so | │ │ │ │ │ +|// on | │ │ │ │ │ +|struct TORRENT_EXTRA_EXPORT merkle_tree | │ │ │ │ │ +|{ | │ │ │ │ │ +|merkle_tree() = default; | │ │ │ │ │ +|merkle_tree(int num_blocks, int blocks_per_piece, char const* r); | │ │ │ │ │ +| | │ │ │ │ │ +| sha256_hash root() const; | │ │ │ │ │ +| | │ │ │ │ │ +| void load_tree(span t, std::vector const& verified); | │ │ │ │ │ +| void load_sparse_tree(span t, std::vector const& mask | │ │ │ │ │ +| , std::vector const& verified); | │ │ │ │ │ +| void load_verified_bits(std::vector const& verified); | │ │ │ │ │ +| | │ │ │ │ │ +| std::size_t size() const; | │ │ │ │ │ +| int end_index() const { return int(size()); } | │ │ │ │ │ +| | │ │ │ │ │ +| bool has_node(int idx) const; | │ │ │ │ │ +| | │ │ │ │ │ +| bool compare_node(int idx, sha256_hash const& h) const; | │ │ │ │ │ +| | │ │ │ │ │ +| sha256_hash operator[](int idx) const; | │ │ │ │ │ +| | │ │ │ │ │ +| std::vector build_vector() const; | │ │ │ │ │ +| std::pair, aux::vector> build_sparse_vector() const; | │ │ │ │ │ +| | │ │ │ │ │ +| // get bits indicating if each leaf hash is verified | │ │ │ │ │ +| std::vector verified_leafs() const; | │ │ │ │ │ +| | │ │ │ │ │ +| // returns true if the entire tree is known and verified | │ │ │ │ │ +| bool is_complete() const; | │ │ │ │ │ +| | │ │ │ │ │ +| // returns true if all block hashes in the specified range have been verified | │ │ │ │ │ +|_ _b_o_o_l_ _b_l_o_c_k_s___v_e_r_i_f_i_e_d_(_i_n_t_ _b_l_o_c_k___i_d_x_,_ _i_n_t_ _n_u_m___b_l_o_c_k_s_)_ _c_o_n_s_t_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/ |make this a std::unique_ptr | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_m_e_r_k_l_e___t_r_e_e_._h_p_p_:_1_7_5_ _ _ _ _ _ _ _ _ _ _ _|_]_>_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** mmaakkee tthhiiss aa ssttdd::::uunniiqquuee__ppttrr]]>> ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//aauuxx__//mmeerrkkllee__ttrreeee..hhpppp::117755 ****** | │ │ │ │ │ +| int blocks_per_piece() const { return 1 << m_blocks_per_piece_log; } | │ │ │ │ │ +| // the number tree levels per piece. This is 0 if the block layer is also | │ │ │ │ │ +| // the piece layer. | │ │ │ │ │ +| int piece_levels() const { return m_blocks_per_piece_log; } | │ │ │ │ │ +| | │ │ │ │ │ +| int block_layer_start() const; | │ │ │ │ │ +| int piece_layer_start() const; | │ │ │ │ │ +| int num_pieces() const; | │ │ │ │ │ +| int num_leafs() const; | │ │ │ │ │ +| | │ │ │ │ │ +| void optimize_storage(); | │ │ │ │ │ +| void optimize_storage_piece_layer(); | │ │ │ │ │ +| void allocate_full(); | │ │ │ │ │ +| | │ │ │ │ │ +| // a pointer to the root hash for this file. | │ │ │ │ │ +| char const* m_root = nullptr; | │ │ │ │ │ +| | │ │ │ │ │ +| // this is either the full tree, or some sparse representation of it, | │ │ │ │ │ +| // depending on m_mode | │ │ │ │ │ +|aux::vector m_tree; | │ │ │ │ │ +| | │ │ │ │ │ +| // when the full tree is allocated, this has one bit for each block hash. a | │ │ │ │ │ +| // 1 means we have verified the block hash to be correct, otherwise the block | │ │ │ │ │ +| // hash may represent what's on disk, but we haven't been able to verify it | │ │ │ │ │ +| // yet | │ │ │ │ │ +| bitfield m_block_verified; | │ │ │ │ │ +| | │ │ │ │ │ +| // number of blocks in the file this tree represents. The number of leafs in | │ │ │ │ │ +| // the tree is rounded up to an even power of 2. | │ │ │ │ │ +| int m_num_blocks = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| // the number of blocks per piece, specified as how many steps to shift | │ │ │ │ │ +| // right 1 to get the number of blocks in one piece. This is a compact | │ │ │ │ │ +| // representation that's valid because pieces are always powers of 2. | │ │ │ │ │ +| // this is necessary to know which layer in the tree the piece layer is. | │ │ │ │ │ +| std::uint8_t m_blocks_per_piece_log = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| enum class mode_t : std::uint8_t | │ │ │ │ │ +| { | │ │ │ │ │ +| // a default constructed tree is truly empty. It does not even have a | │ │ │ │ │ +| // root hash | │ │ │ │ │ +| uninitialized_tree, | │ │ │ │ │ +| | │ │ │ │ │ +| // we don't have any hashes in this tree. m_tree should be empty | │ │ │ │ │ +| // an empty tree still always have the root hash (available as root()) | │ │ │ │ │ +| empty_tree, | │ │ │ │ │ +| | │ │ │ │ │ +| // in this mode, m_tree represents the full tree, including padding. | │ │ │ │ │ +|_ _ _f_u_l_l___t_r_e_e_,_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/ |make these direct members and generate shared_ptrs to them which alias the listen_socket_t shared_ptr | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_s_e_s_s_i_o_n___i_m_p_l_._h_p_p_:_2_6_5_ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** mmaakkee tthheessee ddiirreecctt mmeemmbbeerrss aanndd ggeenneerraattee sshhaarreedd__ppttrrss ttoo tthheemm wwhhiicchh aalliiaass tthhee lliisstteenn__ssoocckkeett__tt sshhaarreedd__ppttrr ********** | │ │ │ │ │ |****** ....//iinncclluuddee//lliibbttoorrrreenntt//aauuxx__//sseessssiioonn__iimmppll..hhpppp::226655 ****** | │ │ │ │ │ |if (udp_sock) return udp_sock->sock.local_port(); | │ │ │ │ │ | return 0; | │ │ │ │ │ | } | │ │ │ │ │ @@ -12398,216 +12545,14 @@ │ │ │ │ │ | int m_peak_up_rate = 0; | │ │ │ │ │ |#endif | │ │ │ │ │ | | │ │ │ │ │ | void on_tick(error_code const& e); | │ │ │ │ │ | | │ │ │ │ │ | void try_connect_more_peers(); | │ │ │ │ │ |_ _ _ _v_o_i_d_ _a_u_t_o___m_a_n_a_g_e___c_h_e_c_k_i_n_g___t_o_r_r_e_n_t_s_(_s_t_d_:_:_v_e_c_t_o_r_<_t_o_r_r_e_n_t_*_>_&_ _l_i_s_t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/ |include the number of peers received from this tracker, at last announce | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_a_n_n_o_u_n_c_e___e_n_t_r_y_._h_p_p_:_7_4_ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** iinncclluuddee tthhee nnuummbbeerr ooff ppeeeerrss rreecceeiivveedd ffrroomm tthhiiss ttrraacckkeerr,, aatt llaasstt aannnnoouunnccee ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//aauuxx__//aannnnoouunnccee__eennttrryy..hhpppp::7744 ****** | │ │ │ │ │ -|namespace aux { | │ │ │ │ │ -| | │ │ │ │ │ -| struct TORRENT_EXTRA_EXPORT announce_infohash | │ │ │ │ │ -| { | │ │ │ │ │ -| announce_infohash(); | │ │ │ │ │ -| | │ │ │ │ │ -| // if this tracker has returned an error or warning message | │ │ │ │ │ -| // that message is stored here | │ │ │ │ │ -| std::string message; | │ │ │ │ │ -| | │ │ │ │ │ -| // if this tracker failed the last time it was contacted | │ │ │ │ │ -| // this error code specifies what error occurred | │ │ │ │ │ -| error_code last_error; | │ │ │ │ │ -| | │ │ │ │ │ -| // the time of next tracker announce | │ │ │ │ │ -| time_point32 next_announce = (time_point32::min)(); | │ │ │ │ │ -| | │ │ │ │ │ -| // no announces before this time | │ │ │ │ │ -| time_point32 min_announce = (time_point32::min)(); | │ │ │ │ │ -| | │ │ │ │ │ -| | │ │ │ │ │ -|// these are either -1 or the scrape information this tracker last | │ │ │ │ │ -| // responded with. *incomplete* is the current number of downloaders in | │ │ │ │ │ -| // the swarm, *complete* is the current number of seeds in the swarm and | │ │ │ │ │ -| // *downloaded* is the cumulative number of completed downloads of this | │ │ │ │ │ -| // torrent, since the beginning of time (from this tracker's point of | │ │ │ │ │ -| // view). | │ │ │ │ │ -| | │ │ │ │ │ -| // if this tracker has returned scrape data, these fields are filled in | │ │ │ │ │ -| // with valid numbers. Otherwise they are set to -1. ``incomplete`` counts | │ │ │ │ │ -| // the number of current downloaders. ``complete`` counts the number of | │ │ │ │ │ -| // current peers completed the download, or "seeds". ``downloaded`` is the | │ │ │ │ │ -| // cumulative number of completed downloads. | │ │ │ │ │ -| int scrape_incomplete = -1; | │ │ │ │ │ -| int scrape_complete = -1; | │ │ │ │ │ -| int scrape_downloaded = -1; | │ │ │ │ │ -| | │ │ │ │ │ -| // the number of times in a row we have failed to announce to this | │ │ │ │ │ -| // tracker. | │ │ │ │ │ -| std::uint8_t fails : 7; | │ │ │ │ │ -| | │ │ │ │ │ -| // true while we're waiting for a response from the tracker. | │ │ │ │ │ -| bool updating : 1; | │ │ │ │ │ -| | │ │ │ │ │ -| // set to true when we get a valid response from an announce | │ │ │ │ │ -| // with event=started. If it is set, we won't send start in the subsequent | │ │ │ │ │ -| // announces. | │ │ │ │ │ -| bool start_sent : 1; | │ │ │ │ │ -| | │ │ │ │ │ -| // set to true when we send a event=completed. | │ │ │ │ │ -|_ _ _b_o_o_l_ _c_o_m_p_l_e_t_e___s_e_n_t_ _:_ _1_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/ |ensure the alignment is good here | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_p_o_o_l_._h_p_p_:_4_9_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** eennssuurree tthhee aalliiggnnmmeenntt iiss ggoooodd hheerree ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//aauuxx__//ppooooll..hhpppp::4499 ****** | │ │ │ │ │ -|POSSIBILITY OF SUCH DAMAGE. | │ │ │ │ │ -| | │ │ │ │ │ -|*/ | │ │ │ │ │ -| | │ │ │ │ │ -|#ifndef TORRENT_POOL_HPP | │ │ │ │ │ -|#define TORRENT_POOL_HPP | │ │ │ │ │ -| | │ │ │ │ │ -|#include "libtorrent/aux_/disable_warnings_push.hpp" | │ │ │ │ │ -|#include | │ │ │ │ │ -|#include | │ │ │ │ │ -|#include "libtorrent/aux_/disable_warnings_pop.hpp" | │ │ │ │ │ -| | │ │ │ │ │ -|namespace libtorrent { | │ │ │ │ │ -|namespace aux { | │ │ │ │ │ -| | │ │ │ │ │ -|struct allocator_new_delete | │ │ │ │ │ -|{ | │ │ │ │ │ -| using size_type = std::size_t; | │ │ │ │ │ -| using difference_type = std::ptrdiff_t; | │ │ │ │ │ -| | │ │ │ │ │ -|static char* malloc(size_type const bytes) | │ │ │ │ │ -|{ return new char[bytes]; } | │ │ │ │ │ -| static void free(char* const block) | │ │ │ │ │ -| { delete [] block; } | │ │ │ │ │ -|}; | │ │ │ │ │ -| | │ │ │ │ │ -|using pool = boost::pool; | │ │ │ │ │ -| | │ │ │ │ │ -|template | │ │ │ │ │ -|using object_pool = boost::object_pool; | │ │ │ │ │ -| | │ │ │ │ │ -|} | │ │ │ │ │ -|} | │ │ │ │ │ -| | │ │ │ │ │ -|_#_e_n_d_i_f_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/ |remove this constructor. Don't support "uninitialized" trees. This also requires not constructing these for pad-files and small | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_m_e_r_k_l_e___t_r_e_e_._h_p_p_:_8_5_ _ _ _ _ _ _ _ _ _ _ _ _|_f_i_l_e_s_ _a_s_ _w_e_l_l_._ _S_o_,_ _a_ _s_p_a_r_s_e_ _h_a_s_h_ _l_i_s_t_ _i_n_ _t_o_r_r_e_n_t___i_n_f_o_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** rreemmoovvee tthhiiss ccoonnssttrruuccttoorr.. DDoonn''tt ssuuppppoorrtt ""uunniinniittiiaalliizzeedd"" ttrreeeess.. TThhiiss aallssoo rreeqquuiirreess nnoott ccoonnssttrruuccttiinngg tthheessee ffoorr ppaadd--ffiilleess aanndd ssmmaallll ffiilleess aass wweellll.. SSoo,, aa ssppaarrssee hhaasshh lliisstt iinn | │ │ │ │ │ -|ttoorrrreenntt__iinnffoo ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//aauuxx__//mmeerrkkllee__ttrreeee..hhpppp::8855 ****** | │ │ │ │ │ -|// The invariant of the tree is that all interior nodes (i.e. all but the very | │ │ │ │ │ -|// bottom leaf nodes, representing block hashes) are either set and valid, or | │ │ │ │ │ -|// clear. No invalid hashes are allowed, and they can only be added by also | │ │ │ │ │ -|// providing proof of being valid. | │ │ │ │ │ -| | │ │ │ │ │ -|// The leaf blocks on the other hand, MAY be invalid. For instance, when adding | │ │ │ │ │ -|// a magnet link for a torrent that we already have files for. Once we have the | │ │ │ │ │ -|// metadata, we have files on disk but no hashes. We won't know whether the data | │ │ │ │ │ -|// on disk is valid or not, until we've downloaded the hashes to validate them. | │ │ │ │ │ -| | │ │ │ │ │ -|// Idea for future space optimization: | │ │ │ │ │ -|// while downloading, we need to store interior nodes of this tree. However, we | │ │ │ │ │ -|// don't need to store the padding. a SHA-256 is 32 bytes. Instead of storing | │ │ │ │ │ -|// the full (padded) tree of SHA-256 hashes, store the full tree of 32 bit | │ │ │ │ │ -|// signed integers, being indices into the actual storage for the tree. We could | │ │ │ │ │ -|// even grow the storage lazily. Instead of storing the padding hashes, use | │ │ │ │ │ -|// negative indices to refer to fixed SHA-256(0), and SHA-256(SHA-256(0)) and so | │ │ │ │ │ -|// on | │ │ │ │ │ -|struct TORRENT_EXTRA_EXPORT merkle_tree | │ │ │ │ │ -|{ | │ │ │ │ │ -|merkle_tree() = default; | │ │ │ │ │ -|merkle_tree(int num_blocks, int blocks_per_piece, char const* r); | │ │ │ │ │ -| | │ │ │ │ │ -| sha256_hash root() const; | │ │ │ │ │ -| | │ │ │ │ │ -| void load_tree(span t, std::vector const& verified); | │ │ │ │ │ -| void load_sparse_tree(span t, std::vector const& mask | │ │ │ │ │ -| , std::vector const& verified); | │ │ │ │ │ -| void load_verified_bits(std::vector const& verified); | │ │ │ │ │ -| | │ │ │ │ │ -| std::size_t size() const; | │ │ │ │ │ -| int end_index() const { return int(size()); } | │ │ │ │ │ -| | │ │ │ │ │ -| bool has_node(int idx) const; | │ │ │ │ │ -| | │ │ │ │ │ -| bool compare_node(int idx, sha256_hash const& h) const; | │ │ │ │ │ -| | │ │ │ │ │ -| sha256_hash operator[](int idx) const; | │ │ │ │ │ -| | │ │ │ │ │ -| std::vector build_vector() const; | │ │ │ │ │ -| std::pair, aux::vector> build_sparse_vector() const; | │ │ │ │ │ -| | │ │ │ │ │ -| // get bits indicating if each leaf hash is verified | │ │ │ │ │ -| std::vector verified_leafs() const; | │ │ │ │ │ -| | │ │ │ │ │ -| // returns true if the entire tree is known and verified | │ │ │ │ │ -| bool is_complete() const; | │ │ │ │ │ -| | │ │ │ │ │ -| // returns true if all block hashes in the specified range have been verified | │ │ │ │ │ -|_ _b_o_o_l_ _b_l_o_c_k_s___v_e_r_i_f_i_e_d_(_i_n_t_ _b_l_o_c_k___i_d_x_,_ _i_n_t_ _n_u_m___b_l_o_c_k_s_)_ _c_o_n_s_t_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/ |make this a std::unique_ptr | │ │ │ │ │ -|_ _ _ _ _ _ _ _ _ _ _ _|_m_e_r_k_l_e___t_r_e_e_._h_p_p_:_1_7_5_ _ _ _ _ _ _ _ _ _ _ _|_]_>_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ -|********** mmaakkee tthhiiss aa ssttdd::::uunniiqquuee__ppttrr]]>> ********** | │ │ │ │ │ -|****** ....//iinncclluuddee//lliibbttoorrrreenntt//aauuxx__//mmeerrkkllee__ttrreeee..hhpppp::117755 ****** | │ │ │ │ │ -| int blocks_per_piece() const { return 1 << m_blocks_per_piece_log; } | │ │ │ │ │ -| // the number tree levels per piece. This is 0 if the block layer is also | │ │ │ │ │ -| // the piece layer. | │ │ │ │ │ -| int piece_levels() const { return m_blocks_per_piece_log; } | │ │ │ │ │ -| | │ │ │ │ │ -| int block_layer_start() const; | │ │ │ │ │ -| int piece_layer_start() const; | │ │ │ │ │ -| int num_pieces() const; | │ │ │ │ │ -| int num_leafs() const; | │ │ │ │ │ -| | │ │ │ │ │ -| void optimize_storage(); | │ │ │ │ │ -| void optimize_storage_piece_layer(); | │ │ │ │ │ -| void allocate_full(); | │ │ │ │ │ -| | │ │ │ │ │ -| // a pointer to the root hash for this file. | │ │ │ │ │ -| char const* m_root = nullptr; | │ │ │ │ │ -| | │ │ │ │ │ -| // this is either the full tree, or some sparse representation of it, | │ │ │ │ │ -| // depending on m_mode | │ │ │ │ │ -|aux::vector m_tree; | │ │ │ │ │ -| | │ │ │ │ │ -| // when the full tree is allocated, this has one bit for each block hash. a | │ │ │ │ │ -| // 1 means we have verified the block hash to be correct, otherwise the block | │ │ │ │ │ -| // hash may represent what's on disk, but we haven't been able to verify it | │ │ │ │ │ -| // yet | │ │ │ │ │ -| bitfield m_block_verified; | │ │ │ │ │ -| | │ │ │ │ │ -| // number of blocks in the file this tree represents. The number of leafs in | │ │ │ │ │ -| // the tree is rounded up to an even power of 2. | │ │ │ │ │ -| int m_num_blocks = 0; | │ │ │ │ │ -| | │ │ │ │ │ -| // the number of blocks per piece, specified as how many steps to shift | │ │ │ │ │ -| // right 1 to get the number of blocks in one piece. This is a compact | │ │ │ │ │ -| // representation that's valid because pieces are always powers of 2. | │ │ │ │ │ -| // this is necessary to know which layer in the tree the piece layer is. | │ │ │ │ │ -| std::uint8_t m_blocks_per_piece_log = 0; | │ │ │ │ │ -| | │ │ │ │ │ -| enum class mode_t : std::uint8_t | │ │ │ │ │ -| { | │ │ │ │ │ -| // a default constructed tree is truly empty. It does not even have a | │ │ │ │ │ -| // root hash | │ │ │ │ │ -| uninitialized_tree, | │ │ │ │ │ -| | │ │ │ │ │ -| // we don't have any hashes in this tree. m_tree should be empty | │ │ │ │ │ -| // an empty tree still always have the root hash (available as root()) | │ │ │ │ │ -| empty_tree, | │ │ │ │ │ -| | │ │ │ │ │ -| // in this mode, m_tree represents the full tree, including padding. | │ │ │ │ │ -|_ _ _f_u_l_l___t_r_e_e_,_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/ |figure out which version of clang this is supported in | │ │ │ │ │ |_ _ _ _ _ _ _ _ _ _ _ _|_d_e_p_r_e_c_a_t_e_d_._h_p_p_:_4_7_ _ _ _ _ _ _ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ |********** ffiigguurree oouutt wwhhiicchh vveerrssiioonn ooff ccllaanngg tthhiiss iiss ssuuppppoorrtteedd iinn ********** | │ │ │ │ │ |****** ....//iinncclluuddee//lliibbttoorrrreenntt//aauuxx__//ddeepprreeccaatteedd..hhpppp::4477 ****** | │ │ │ │ │ |CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | │ │ │ │ │ |ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | │ │ │ │ │ |POSSIBILITY OF SUCH DAMAGE. | │ │ │ │ │ @@ -12754,7 +12699,62 @@ │ │ │ │ │ | // it's important that these match the enums in performance_counters for | │ │ │ │ │ | // num_utp_idle etc. | │ │ │ │ │ | enum class state_t { | │ │ │ │ │ | // not yet connected | │ │ │ │ │ | none, | │ │ │ │ │ | // sent a syn packet, not received any acks | │ │ │ │ │ |_ _ _s_y_n___s_e_n_t_,_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|relevance 0|_._._/_i_n_c_l_u_d_e_/_l_i_b_t_o_r_r_e_n_t_/_a_u_x___/ |it would be nice to not have this be part of session_interface | │ │ │ │ │ +|_ _ _ _ _ _ _ _ _ _ _ _|_s_e_s_s_i_o_n___i_n_t_e_r_f_a_c_e_._h_p_p_:_2_1_2_ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ | │ │ │ │ │ +|********** iitt wwoouulldd bbee nniiccee ttoo nnoott hhaavvee tthhiiss bbee ppaarrtt ooff sseessssiioonn__iinntteerrffaaccee ********** | │ │ │ │ │ +|****** ....//iinncclluuddee//lliibbttoorrrreenntt//aauuxx__//sseessssiioonn__iinntteerrffaaccee..hhpppp::221122 ****** | │ │ │ │ │ +|virtual void deferred_submit_jobs() = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| virtual std::uint16_t listen_port() const = 0; | │ │ │ │ │ +| virtual std::uint16_t ssl_listen_port() const = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| virtual int listen_port(aux::transport ssl, address const& local_addr) = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| virtual void for_each_listen_socket(std::function f) = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| // ask for which interface and port to bind outgoing peer connections on | │ │ │ │ │ +| virtual tcp::endpoint bind_outgoing_socket(socket_type& s, address const& | │ │ │ │ │ +| remote_address, error_code& ec) const = 0; | │ │ │ │ │ +| virtual bool verify_bound_address(address const& addr, bool utp | │ │ │ │ │ +| , error_code& ec) = 0; | │ │ │ │ │ +| | │ │ │ │ │ +|#ifndef TORRENT_DISABLE_MUTABLE_TORRENTS | │ │ │ │ │ +| virtual std::vector> find_collection( | │ │ │ │ │ +| std::string const& collection) const = 0; | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +|virtual proxy_settings proxy() const = 0; | │ │ │ │ │ +| | │ │ │ │ │ +|#if TORRENT_USE_I2P | │ │ │ │ │ +| virtual char const* i2p_session() const = 0; | │ │ │ │ │ +| virtual std::string const& local_i2p_endpoint() const = 0; | │ │ │ │ │ +|#endif | │ │ │ │ │ +| | │ │ │ │ │ +| virtual void prioritize_connections(std::weak_ptr t) = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| virtual void trigger_auto_manage() = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| virtual void apply_settings_pack(std::shared_ptr pack) = 0; | │ │ │ │ │ +| virtual session_settings const& settings() const = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| virtual void queue_tracker_request(tracker_request req | │ │ │ │ │ +| , std::weak_ptr c) = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| // peer-classes | │ │ │ │ │ +| virtual void set_peer_classes(peer_class_set* s, address const& a, socket_type_t st) = 0; | │ │ │ │ │ +| virtual peer_class_pool const& peer_classes() const = 0; | │ │ │ │ │ +| virtual peer_class_pool& peer_classes() = 0; | │ │ │ │ │ +| virtual bool ignore_unchoke_slots_set(peer_class_set const& set) const = 0; | │ │ │ │ │ +| virtual int copy_pertinent_channels(peer_class_set const& set | │ │ │ │ │ +| , int channel, bandwidth_channel** dst, int m) = 0; | │ │ │ │ │ +| virtual int use_quota_overhead(peer_class_set& set, int amount_down, int amount_up) = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| virtual bandwidth_manager* get_bandwidth_manager(int channel) = 0; | │ │ │ │ │ +| | │ │ │ │ │ +| virtual void sent_bytes(int bytes_payload, int bytes_protocol) = 0; | │ │ │ │ │ +| virtual void received_bytes(int bytes_payload, int bytes_protocol) = 0; | │ │ │ │ │ +|_ _ _v_i_r_t_u_a_l_ _v_o_i_d_ _t_r_a_n_c_i_e_v_e___i_p___p_a_c_k_e_t_(_i_n_t_ _b_y_t_e_s_,_ _b_o_o_l_ _i_p_v_6_)_ _=_ _0_;_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ |