text: /*
  
  Copyright (c) 2006-2018, Arvid Norberg
  All rights reserved.
  
  Redistribution and use in source and binary forms, with or without
  modification, are permitted provided that the following conditions
  are met:
  
      * Redistributions of source code must retain the above copyright
        notice, this list of conditions and the following disclaimer.
      * Redistributions in binary form must reproduce the above copyright
        notice, this list of conditions and the following disclaimer in
        the documentation and/or other materials provided with the distribution.
      * Neither the name of the author nor the names of its
        contributors may be used to endorse or promote products derived
        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.
  
  */
  
  #ifndef NODE_HPP
  #define NODE_HPP
  
  #include <map>
  #include <set>
  #include <mutex>
  #include <cstdint>
  
  #include <libtorrent/config.hpp>
  #include <libtorrent/kademlia/dht_storage.hpp>
  #include <libtorrent/kademlia/dht_settings.hpp>
  #include <libtorrent/kademlia/routing_table.hpp>
  #include <libtorrent/kademlia/rpc_manager.hpp>
  #include <libtorrent/kademlia/node_id.hpp>
  #include <libtorrent/kademlia/find_data.hpp>
  #include <libtorrent/kademlia/item.hpp>
  #include <libtorrent/kademlia/announce_flags.hpp>
  
  #include <libtorrent/fwd.hpp>
  #include <libtorrent/socket.hpp> // for udp::endpoint
  #include <libtorrent/string_view.hpp>
  #include <libtorrent/aux_/listen_socket_handle.hpp>
  
  namespace libtorrent {
  	struct counters;
  }
  
  namespace libtorrent {
  namespace dht {
  
  struct traversal_algorithm;
  struct dht_observer;
  struct msg;
  
  TORRENT_EXTRA_EXPORT entry write_nodes_entry(std::vector<node_entry> const& nodes);
  
  class announce_observer : public observer
  {
  public:
  	announce_observer(std::shared_ptr<traversal_algorithm> algo
  		, udp::endpoint const& ep, node_id const& id)
  		: observer(std::move(algo), ep, id)
  	{}
  
  	void reply(msg const&) override { flags |= flag_done; }
  };
  
  struct socket_manager
  {
  	virtual bool has_quota() = 0;
  	virtual bool send_packet(aux::listen_socket_handle const& s, entry& e, udp::endpoint const& addr) = 0;
  protected:
  	~socket_manager() = default;
  };
  
  // get the closest node to the id with the given family_name
  using get_foreign_node_t = std::function<node*(node_id const&, std::string const&)>;
  
  class TORRENT_EXTRA_EXPORT node
  {
  public:
  	node(aux::listen_socket_handle const& sock, socket_manager* sock_man
  		, dht_settings const& settings
  		, node_id const& nid
  		, dht_observer* observer, counters& cnt
  		, get_foreign_node_t get_foreign_node
  		, dht_storage_interface& storage);
  
  	~node();
  
  	node(node const&) = delete;
  	node& operator=(node const&) = delete;
  	node(node&&) = default;
  	node& operator=(node&&) = default;
  
  	void update_node_id();
  
  	void tick();
  	void bootstrap(std::vector<udp::endpoint> const& nodes
  		, find_data::nodes_callback const& f);
  	void add_router_node(udp::endpoint const& router);
  
  	void unreachable(udp::endpoint const& ep);
  	void incoming(aux::listen_socket_handle const& s, msg const& m);
  
  #if TORRENT_ABI_VERSION == 1
  	int num_torrents() const { return int(m_storage.num_torrents()); }
  	int num_peers() const { return int(m_storage.num_peers()); }
  #endif
  
  	int bucket_size(int bucket);
  
  	node_id const& nid() const { return m_id; }
  
  #ifndef TORRENT_DISABLE_LOGGING
  	std::uint32_t search_id() { return m_search_id++; }
  #endif
  
  	std::tuple<int, int, int> size() const { return m_table.size(); }
  	std::int64_t num_global_nodes() const
  	{ return m_table.num_global_nodes(); }
  
  #if TORRENT_ABI_VERSION == 1
  	int data_size() const { return int(m_storage.num_torrents()); }
  #endif
  
  	void get_peers(sha1_hash const& info_hash
  		, std::function<void(std::vector<tcp::endpoint> const&)> dcallback
  		, std::function<void(std::vector<std::pair<node_entry, std::string>> const&)> ncallback
  		, announce_flags_t flags);
  	void announce(sha1_hash const& info_hash, int listen_port, announce_flags_t flags
  		, std::function<void(std::vector<tcp::endpoint> const&)> f);
  
  	void direct_request(udp::endpoint const& ep, entry& e
  		, std::function<void(msg const&)> f);
  
  	void get_item(sha1_hash const& target, std::function<void(item const&)> f);
  	void get_item(public_key const& pk, std::string const& salt, std::function<void(item const&, bool)> f);
  
  	void put_item(sha1_hash const& target, entry const& data, std::function<void(int)> f);
  	void put_item(public_key const& pk, std::string const& salt
  		, std::function<void(item const&, int)> f
  		, std::function<void(item&)> data_cb);
  
  	void sample_infohashes(udp::endpoint const& ep, sha1_hash const& target
  		, std::function<void(time_duration
  			, int, std::vector<sha1_hash>
  			, std::vector<std::pair<sha1_hash, udp::endpoint>>)> f);
  
  	bool verify_token(string_view token, sha1_hash const& info_hash
  		, udp::endpoint const& addr) const;
  
  	std::string generate_token(udp::endpoint const& addr, sha1_hash const& info_hash);
  
  	// the returned time is the delay until connection_timeout()
  	// should be called again the next time
  	time_duration connection_timeout();
  
  	// generates a new secret number used to generate write tokens
  	void new_write_key();
  
  	// pings the given node, and adds it to
  	// the routing table if it response and if the
  	// bucket is not full.
  	void add_node(udp::endpoint const& node);
  
  	int branch_factor() const { return m_settings.search_branching; }
  
  	void add_traversal_algorithm(traversal_algorithm* a)
  	{
  		std::lock_guard<std::mutex> l(m_mutex);
  		m_running_requests.insert(a);
  	}
  
  	void remove_traversal_algorithm(traversal_algorithm* a)
  	{
  		std::lock_guard<std::mutex> l(m_mutex);
  		m_running_requests.erase(a);
  	}
  
  	void status(std::vector<dht_routing_bucket>& table
  		, std::vector<dht_lookup>& requests);
  
  	std::tuple<int, int, int> get_stats_counters() const;
  
  #if TORRENT_ABI_VERSION == 1
  	void status(libtorrent::session_status& s);
  #endif
  
  	dht_settings const& settings() const { return m_settings; }
  	counters& stats_counters() const { return m_counters; }
  
  	dht_observer* observer() const { return m_observer; }
  
  	udp protocol() const { return m_protocol.protocol; }
  	char const* protocol_family_name() const { return m_protocol.family_name; }
  	char const* protocol_nodes_key() const { return m_protocol.nodes_key; }
  
  	bool native_address(udp::endpoint const& ep) const
  	{ return ep.protocol().family() == m_protocol.protocol.family(); }
  	bool native_address(tcp::endpoint const& ep) const
  	{ return ep.protocol().family() == m_protocol.protocol.family(); }
  	bool native_address(address const& addr) const
  	{
  		return (addr.is_v4() && m_protocol.protocol == udp::v4())
  			|| (addr.is_v6() && m_protocol.protocol == udp::v6());
  	}
  
  private:
  
  	void send_single_refresh(udp::endpoint const& ep, int bucket
  		, node_id const& id = node_id());
  	bool lookup_peers(sha1_hash const& info_hash, entry& reply
  		, bool noseed, bool scrape, address const& requester) const;
  
  	dht_settings const& m_settings;
  
  	std::mutex m_mutex;
  
  	// this list must be destructed after the rpc manager
  	// since it might have references to it
  	std::set<traversal_algorithm*> m_running_requests;
  
  	void incoming_request(msg const& h, entry& e);
  
  	void write_nodes_entries(sha1_hash const& info_hash
  		, bdecode_node const& want, entry& r);
  
  	node_id m_id;
  
  public:
  	routing_table m_table;
  	rpc_manager m_rpc;
  	aux::listen_socket_handle const m_sock;
  
  private:
  
  	struct protocol_descriptor
  	{
  		udp protocol;
  		char const* family_name;
  		char const* nodes_key;
  	};
  
  	static protocol_descriptor const& map_protocol_to_descriptor(udp protocol);
  
  	socket_manager* m_sock_man;
  
  	get_foreign_node_t m_get_foreign_node;
  
  	dht_observer* m_observer;
  
  	protocol_descriptor const& m_protocol;
  
  	time_point m_last_tracker_tick;
  
  	// the last time we issued a bootstrap or a refresh on our own ID, to expand
  	// the routing table buckets close to us.
  	time_point m_last_self_refresh;
  
  	// secret random numbers used to create write tokens
  	std::uint32_t m_secret[2];
  
  	counters& m_counters;
  
  	dht_storage_interface& m_storage;
  
  #ifndef TORRENT_DISABLE_LOGGING
  	std::uint32_t m_search_id = 0;
  #endif
  };
  
  } // namespace dht
  } // namespace libtorrent
  
  #endif // NODE_HPP
  