src/kademlia/find_data.cpp

   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 #include "libtorrent/pch.hpp"
  34
  35 #include <libtorrent/kademlia/find_data.hpp>
  36 #include <libtorrent/kademlia/routing_table.hpp>
  37 #include <libtorrent/kademlia/rpc_manager.hpp>
  38 #include <libtorrent/io.hpp>
  39 #include <libtorrent/socket.hpp>
  40
  41 namespace libtorrent { namespace dht
  42 {
  43
  44 find_data_observer::~find_data_observer()
  45 {
  46         if (m_algorithm) m_algorithm->failed(m_self);
  47 }
  48
  49 void find_data_observer::reply(msg const& m)
  50 {
  51         if (!m_algorithm)
  52         {
  53                 TORRENT_ASSERT(false);
  54                 return;
  55         }
  56
  57         if (!m.peers.empty())
  58         {
  59                 m_algorithm->got_data(&m);
  60         }
  61         else
  62         {
  63                 for (msg::nodes_t::const_iterator i = m.nodes.begin()
  64                         , end(m.nodes.end()); i != end; ++i)
  65                 {
  66                         m_algorithm->traverse(i->id, i->addr);
  67                 }
  68         }
  69         m_algorithm->finished(m_self);
  70         m_algorithm = 0;
  71 }
  72
  73 void find_data_observer::timeout()
  74 {
  75         if (!m_algorithm) return;
  76         m_algorithm->failed(m_self);
  77         m_algorithm = 0;
  78 }
  79
  80
  81 find_data::find_data(
  82         node_id target
  83         , int branch_factor
  84         , int max_results
  85         , routing_table& table
  86         , rpc_manager& rpc
  87         , done_callback const& callback
  88 )
  89         : traversal_algorithm(
  90                 target
  91                 , branch_factor
  92                 , max_results
  93                 , table
  94                 , rpc
  95                 , table.begin()
  96                 , table.end()
  97         )
  98         , m_done_callback(callback)
  99         , m_done(false)
 100 {
 101         boost::intrusive_ptr<find_data> self(this);
 102         add_requests();
 103 }
 104
 105 void find_data::invoke(node_id const& id, udp::endpoint addr)
 106 {
 107         if (m_done)
 108         {
 109                 m_invoke_count = -1;
 110                 return;
 111         }
 112
 113         TORRENT_ASSERT(m_rpc.allocation_size() >= sizeof(find_data_observer));
 114         observer_ptr o(new (m_rpc.allocator().malloc()) find_data_observer(this, id, m_target));
 115 #ifndef NDEBUG
 116         o->m_in_constructor = false;
 117 #endif
 118         m_rpc.invoke(messages::get_peers, addr, o);
 119 }
 120
 121 void find_data::got_data(msg const* m)
 122 {
 123         m_done = true;
 124         m_done_callback(m);
 125 }
 126
 127 void find_data::done()
 128 {
 129         if (m_invoke_count != 0) return;
 130         if (!m_done) m_done_callback(0);
 131 }
 132
 133 void find_data::initiate(
 134         node_id target
 135         , int branch_factor
 136         , int max_results
 137         , routing_table& table
 138         , rpc_manager& rpc
 139         , done_callback const& callback
 140 )
 141 {
 142         std::cerr << "find_data::initiate, key: " << target << "\n";
 143         new find_data(target, branch_factor, max_results, table, rpc, callback);
 144 }
 145
 146 } } // namespace libtorrent::dht
 147