forked from premiere/premiere-libtorrent
83 lines
2.6 KiB
C++
83 lines
2.6 KiB
C++
|
/*
|
||
|
|
||
|
Copyright (c) 2013, Steven Siloti
|
||
|
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 LIBTORRENT_GET_ITEM_HPP
|
||
|
#define LIBTORRENT_GET_ITEM_HPP
|
||
|
|
||
|
#include <string>
|
||
|
#include <libtorrent/kademlia/find_data.hpp>
|
||
|
#include <libtorrent/kademlia/item.hpp>
|
||
|
|
||
|
namespace libtorrent { namespace dht
|
||
|
{
|
||
|
|
||
|
class get_item : public find_data
|
||
|
{
|
||
|
public:
|
||
|
typedef boost::function<bool(item&)> data_callback;
|
||
|
|
||
|
void got_data(lazy_entry const* v,
|
||
|
char const* pk,
|
||
|
boost::uint64_t seq,
|
||
|
char const* sig);
|
||
|
|
||
|
get_item(node_impl& node, node_id target, data_callback const& dcallback);
|
||
|
|
||
|
virtual char const* name() const;
|
||
|
|
||
|
protected:
|
||
|
virtual observer_ptr new_observer(void* ptr, udp::endpoint const& ep, node_id const& id);
|
||
|
virtual bool invoke(observer_ptr o);
|
||
|
virtual void done();
|
||
|
|
||
|
void put(std::vector<std::pair<node_entry, std::string> > const& v);
|
||
|
|
||
|
data_callback m_data_callback;
|
||
|
item m_data;
|
||
|
};
|
||
|
|
||
|
class get_item_observer : public find_data_observer
|
||
|
{
|
||
|
public:
|
||
|
get_item_observer(
|
||
|
boost::intrusive_ptr<traversal_algorithm> const& algorithm
|
||
|
, udp::endpoint const& ep, node_id const& id)
|
||
|
: find_data_observer(algorithm, ep, id)
|
||
|
{}
|
||
|
|
||
|
virtual void reply(msg const&);
|
||
|
};
|
||
|
|
||
|
} } // namespace libtorrent::dht
|
||
|
|
||
|
#endif // LIBTORRENT_GET_ITEM_HPP
|