include/libtorrent/kademlia/find_data.hpp

   1 /*
   2
   3 Copyright (c) 2006, Arvid Norberg & Daniel Wallin
   4 All rights reserved.
   5
   6 Redistribution and use in source and binary forms, with or without
   7 modification, are permitted provided that the following conditions
   8 are met:
   9
  10     * Redistributions of source code must retain the above copyright
  11       notice, this list of conditions and the following disclaimer.
  12     * Redistributions in binary form must reproduce the above copyright
  13       notice, this list of conditions and the following disclaimer in
  14       the documentation and/or other materials provided with the distribution.
  15     * Neither the name of the author nor the names of its
  16       contributors may be used to endorse or promote products derived
  17       from this software without specific prior written permission.
  18
  19 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  20 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  21 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  22 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  23 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  24 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  25 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  26 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  27 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  28 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  29 POSSIBILITY OF SUCH DAMAGE.
  30
  31 */
  32
  33 #ifndef FIND_DATA_050323_HPP
  34 #define FIND_DATA_050323_HPP
  35
  36 #include <vector>
  37
  38 #include <libtorrent/kademlia/traversal_algorithm.hpp>
  39 #include <libtorrent/kademlia/node_id.hpp>
  40 #include <libtorrent/kademlia/routing_table.hpp>
  41 #include <libtorrent/kademlia/rpc_manager.hpp>
  42 #include <libtorrent/kademlia/observer.hpp>
  43 #include <libtorrent/kademlia/msg.hpp>
  44
  45 #include <boost/optional.hpp>
  46 #include <boost/function.hpp>
  47
  48 namespace libtorrent { namespace dht
  49 {
  50
  51 typedef std::vector<char> packet_t;
  52
  53 class rpc_manager;
  54
  55 // -------- find data -----------
  56
  57 class find_data : public traversal_algorithm
  58 {
  59 public:
  60         typedef boost::function<void(msg const*)> done_callback;
  61
  62         static void initiate(
  63                 node_id target
  64                 , int branch_factor
  65                 , int max_results
  66                 , routing_table& table
  67                 , rpc_manager& rpc
  68                 , done_callback const& callback
  69         );
  70
  71         void got_data(msg const* m);
  72
  73 private:
  74         void done();
  75         void invoke(node_id const& id, udp::endpoint addr);
  76
  77         find_data(
  78                 node_id target
  79                 , int branch_factor
  80                 , int max_results
  81                 , routing_table& table
  82                 , rpc_manager& rpc
  83                 , done_callback const& callback
  84         );
  85
  86         done_callback m_done_callback;
  87         boost::shared_ptr<packet_t> m_packet;
  88         bool m_done;
  89 };
  90
  91 class find_data_observer : public observer
  92 {
  93 public:
  94         find_data_observer(
  95                 boost::intrusive_ptr<find_data> const& algorithm
  96                 , node_id self
  97                 , node_id target)
  98                 : observer(algorithm->allocator())
  99                 , m_algorithm(algorithm)
 100                 , m_target(target)
 101                 , m_self(self)
 102         {}
 103         ~find_data_observer();
 104
 105         void send(msg& m)
 106         {
 107                 m.reply = false;
 108                 m.message_id = messages::get_peers;
 109                 m.info_hash = m_target;
 110         }
 111
 112         void timeout();
 113         void reply(msg const&);
 114         void abort() { m_algorithm = 0; }
 115
 116 private:
 117         boost::intrusive_ptr<find_data> m_algorithm;
 118         node_id const m_target;
 119         node_id const m_self;
 120 };
 121
 122 } } // namespace libtorrent::dht
 123
 124 #endif // FIND_DATA_050323_HPP
 125