2006-04-25 23:04:48 +02:00
|
|
|
/*
|
|
|
|
|
|
|
|
Copyright (c) 2003, 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 TORRENT_WEB_PEER_CONNECTION_HPP_INCLUDED
|
|
|
|
#define TORRENT_WEB_PEER_CONNECTION_HPP_INCLUDED
|
|
|
|
|
|
|
|
#include <ctime>
|
|
|
|
#include <algorithm>
|
|
|
|
#include <vector>
|
|
|
|
#include <deque>
|
|
|
|
#include <string>
|
|
|
|
|
|
|
|
#include "libtorrent/debug.hpp"
|
|
|
|
|
|
|
|
#ifdef _MSC_VER
|
|
|
|
#pragma warning(push, 1)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include <boost/smart_ptr.hpp>
|
|
|
|
#include <boost/weak_ptr.hpp>
|
|
|
|
#include <boost/noncopyable.hpp>
|
|
|
|
#include <boost/array.hpp>
|
|
|
|
#include <boost/optional.hpp>
|
|
|
|
#include <boost/cstdint.hpp>
|
|
|
|
|
|
|
|
#ifdef _MSC_VER
|
|
|
|
#pragma warning(pop)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "libtorrent/buffer.hpp"
|
|
|
|
#include "libtorrent/peer_connection.hpp"
|
|
|
|
#include "libtorrent/socket.hpp"
|
|
|
|
#include "libtorrent/peer_id.hpp"
|
|
|
|
#include "libtorrent/storage.hpp"
|
|
|
|
#include "libtorrent/stat.hpp"
|
|
|
|
#include "libtorrent/alert.hpp"
|
|
|
|
#include "libtorrent/torrent_handle.hpp"
|
|
|
|
#include "libtorrent/torrent.hpp"
|
|
|
|
#include "libtorrent/peer_request.hpp"
|
|
|
|
#include "libtorrent/piece_block_progress.hpp"
|
|
|
|
#include "libtorrent/config.hpp"
|
|
|
|
// parse_url
|
|
|
|
#include "libtorrent/tracker_manager.hpp"
|
2008-01-31 09:24:01 +01:00
|
|
|
#include "libtorrent/http_parser.hpp"
|
2006-04-25 23:04:48 +02:00
|
|
|
|
|
|
|
namespace libtorrent
|
|
|
|
{
|
|
|
|
class torrent;
|
|
|
|
|
|
|
|
namespace detail
|
|
|
|
{
|
|
|
|
struct session_impl;
|
|
|
|
}
|
|
|
|
|
|
|
|
class TORRENT_EXPORT web_peer_connection
|
|
|
|
: public peer_connection
|
|
|
|
{
|
|
|
|
friend class invariant_access;
|
|
|
|
public:
|
|
|
|
|
|
|
|
// this is the constructor where the we are the active part.
|
|
|
|
// The peer_conenction should handshake and verify that the
|
|
|
|
// other end has the correct id
|
|
|
|
web_peer_connection(
|
2006-10-11 16:02:21 +02:00
|
|
|
aux::session_impl& ses
|
2006-04-25 23:04:48 +02:00
|
|
|
, boost::weak_ptr<torrent> t
|
2007-04-23 23:36:21 +02:00
|
|
|
, boost::shared_ptr<socket_type> s
|
2006-04-25 23:04:48 +02:00
|
|
|
, tcp::endpoint const& remote
|
2007-04-10 23:23:13 +02:00
|
|
|
, std::string const& url
|
|
|
|
, policy::peer* peerinfo);
|
2006-04-25 23:04:48 +02:00
|
|
|
|
|
|
|
~web_peer_connection();
|
|
|
|
|
|
|
|
// called from the main loop when this connection has any
|
|
|
|
// work to do.
|
2008-05-03 18:05:42 +02:00
|
|
|
void on_sent(error_code const& error
|
2006-04-25 23:04:48 +02:00
|
|
|
, std::size_t bytes_transferred);
|
2008-05-03 18:05:42 +02:00
|
|
|
void on_receive(error_code const& error
|
2006-04-25 23:04:48 +02:00
|
|
|
, std::size_t bytes_transferred);
|
|
|
|
|
|
|
|
std::string const& url() const { return m_url; }
|
|
|
|
|
2007-05-25 21:42:10 +02:00
|
|
|
virtual void get_specific_peer_info(peer_info& p) const;
|
2007-01-29 08:39:33 +01:00
|
|
|
virtual bool in_handshake() const;
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
// the following functions appends messages
|
|
|
|
// to the send buffer
|
|
|
|
void write_choke() {}
|
|
|
|
void write_unchoke() {}
|
|
|
|
void write_interested() {}
|
|
|
|
void write_not_interested() {}
|
|
|
|
void write_request(peer_request const& r);
|
2008-01-02 04:18:29 +01:00
|
|
|
void write_cancel(peer_request const& r)
|
|
|
|
{ incoming_reject_request(r); }
|
2006-04-25 23:04:48 +02:00
|
|
|
void write_have(int index) {}
|
2008-04-10 12:03:23 +02:00
|
|
|
void write_piece(peer_request const& r, disk_buffer_holder& buffer) { TORRENT_ASSERT(false); }
|
2006-04-25 23:04:48 +02:00
|
|
|
void write_keepalive() {}
|
|
|
|
void on_connected();
|
2007-08-14 19:47:48 +02:00
|
|
|
void write_reject_request(peer_request const&) {}
|
|
|
|
void write_allow_fast(int) {}
|
2006-04-25 23:04:48 +02:00
|
|
|
|
|
|
|
#ifndef NDEBUG
|
|
|
|
void check_invariant() const;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
|
|
|
// returns the block currently being
|
|
|
|
// downloaded. And the progress of that
|
|
|
|
// block. If the peer isn't downloading
|
|
|
|
// a piece for the moment, the boost::optional
|
|
|
|
// will be invalid.
|
|
|
|
boost::optional<piece_block_progress> downloading_piece_progress() const;
|
|
|
|
|
|
|
|
// this has one entry per bittorrent request
|
|
|
|
std::deque<peer_request> m_requests;
|
|
|
|
// this has one entry per http-request
|
|
|
|
// (might be more than the bt requests)
|
|
|
|
std::deque<int> m_file_requests;
|
|
|
|
|
|
|
|
std::string m_server_string;
|
|
|
|
http_parser m_parser;
|
2007-05-22 22:44:18 +02:00
|
|
|
std::string m_auth;
|
2006-04-25 23:04:48 +02:00
|
|
|
std::string m_host;
|
|
|
|
int m_port;
|
|
|
|
std::string m_path;
|
|
|
|
std::string m_url;
|
|
|
|
|
|
|
|
// the first request will contain a little bit more data
|
|
|
|
// than subsequent ones, things that aren't critical are left
|
|
|
|
// out to save bandwidth.
|
|
|
|
bool m_first_request;
|
|
|
|
|
|
|
|
// this is used for intermediate storage of pieces
|
|
|
|
// that is received in more than on HTTP responses
|
|
|
|
std::vector<char> m_piece;
|
|
|
|
// the mapping of the data in the m_piece buffer
|
|
|
|
peer_request m_intermediate_piece;
|
2007-05-11 20:40:22 +02:00
|
|
|
|
|
|
|
// the number of bytes into the receive buffer where
|
|
|
|
// current read cursor is.
|
|
|
|
int m_body_start;
|
|
|
|
// the number of bytes received in the current HTTP
|
|
|
|
// response. used to know where in the buffer the
|
|
|
|
// next response starts
|
|
|
|
int m_received_body;
|
2008-06-03 17:17:09 +02:00
|
|
|
|
|
|
|
// position in the current range response
|
|
|
|
int m_range_pos;
|
2006-04-25 23:04:48 +02:00
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif // TORRENT_WEB_PEER_CONNECTION_HPP_INCLUDED
|
|
|
|
|