/* 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. */ #include #include #include #include #include #include "zlib.h" #include #include "libtorrent/tracker_manager.hpp" #include "libtorrent/http_tracker_connection.hpp" #include "libtorrent/udp_tracker_connection.hpp" #include "libtorrent/entry.hpp" #include "libtorrent/bencode.hpp" #include "libtorrent/torrent.hpp" using namespace libtorrent; using boost::tuples::make_tuple; using boost::tuples::tuple; using boost::bind; namespace { enum { minimum_tracker_response_length = 3, http_buffer_size = 2048 }; enum { FTEXT = 0x01, FHCRC = 0x02, FEXTRA = 0x04, FNAME = 0x08, FCOMMENT = 0x10, FRESERVED = 0xe0, GZIP_MAGIC0 = 0x1f, GZIP_MAGIC1 = 0x8b }; } namespace libtorrent { using boost::posix_time::second_clock; using boost::posix_time::seconds; using boost::posix_time::ptime; using boost::posix_time::time_duration; // returns -1 if gzip header is invalid or the header size in bytes int gzip_header(const char* buf, int size) { assert(buf != 0); assert(size > 0); const unsigned char* buffer = reinterpret_cast(buf); const int total_size = size; // The zip header cannot be shorter than 10 bytes if (size < 10) return -1; // check the magic header of gzip if ((buffer[0] != GZIP_MAGIC0) || (buffer[1] != GZIP_MAGIC1)) return -1; int method = buffer[2]; int flags = buffer[3]; // check for reserved flag and make sure it's compressed with the correct metod if (method != Z_DEFLATED || (flags & FRESERVED) != 0) return -1; // skip time, xflags, OS code size -= 10; buffer += 10; if (flags & FEXTRA) { int extra_len; if (size < 2) return -1; extra_len = (buffer[1] << 8) | buffer[0]; if (size < (extra_len+2)) return -1; size -= (extra_len + 2); buffer += (extra_len + 2); } if (flags & FNAME) { while (size && *buffer) { --size; ++buffer; } if (!size || *buffer) return -1; --size; ++buffer; } if (flags & FCOMMENT) { while (size && *buffer) { --size; ++buffer; } if (!size || *buffer) return -1; --size; ++buffer; } if (flags & FHCRC) { if (size < 2) return -1; size -= 2; buffer += 2; } return total_size - size; } bool inflate_gzip( std::vector& buffer , tracker_request const& req , request_callback* requester , int maximum_tracker_response_length) { assert(maximum_tracker_response_length > 0); int header_len = gzip_header(&buffer[0], (int)buffer.size()); if (header_len < 0) { requester->tracker_request_error(req, 200, "invalid gzip header in tracker response"); return true; } // start off wth one kilobyte and grow // if needed std::vector inflate_buffer(1024); // initialize the zlib-stream z_stream str; // subtract 8 from the end of the buffer since that's CRC32 and input size // and those belong to the gzip file str.avail_in = (int)buffer.size() - header_len - 8; str.next_in = reinterpret_cast(&buffer[header_len]); str.next_out = reinterpret_cast(&inflate_buffer[0]); str.avail_out = (int)inflate_buffer.size(); str.zalloc = Z_NULL; str.zfree = Z_NULL; str.opaque = 0; // -15 is really important. It will make inflate() not look for a zlib header // and just deflate the buffer if (inflateInit2(&str, -15) != Z_OK) { requester->tracker_request_error(req, 200, "gzip out of memory"); return true; } // inflate and grow inflate_buffer as needed int ret = inflate(&str, Z_SYNC_FLUSH); while (ret == Z_OK) { if (str.avail_out == 0) { if (inflate_buffer.size() >= (unsigned)maximum_tracker_response_length) { inflateEnd(&str); requester->tracker_request_error(req, 200 , "tracker response too large"); return true; } int new_size = (int)inflate_buffer.size() * 2; if (new_size > maximum_tracker_response_length) new_size = maximum_tracker_response_length; int old_size = (int)inflate_buffer.size(); inflate_buffer.resize(new_size); str.next_out = reinterpret_cast(&inflate_buffer[old_size]); str.avail_out = new_size - old_size; } ret = inflate(&str, Z_SYNC_FLUSH); } inflate_buffer.resize(inflate_buffer.size() - str.avail_out); inflateEnd(&str); if (ret != Z_STREAM_END) { requester->tracker_request_error(req, 200, "gzip error"); return true; } // commit the resulting buffer std::swap(buffer, inflate_buffer); return false; } std::string base64encode(const std::string& s) { static const char base64_table[] = { 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '+', '/' }; unsigned char inbuf[3]; unsigned char outbuf[4]; std::string ret; for (std::string::const_iterator i = s.begin(); i != s.end();) { // available input is 1,2 or 3 bytes // since we read 3 bytes at a time at most int available_input = std::min(3, (int)std::distance(i, s.end())); // clear input buffer std::fill(inbuf, inbuf+3, 0); // read a chunk of input into inbuf for (int j = 0; j < available_input; ++j) { inbuf[j] = *i; ++i; } // encode inbuf to outbuf outbuf[0] = (inbuf[0] & 0xfc) >> 2; outbuf[1] = ((inbuf[0] & 0x03) << 4) | ((inbuf [1] & 0xf0) >> 4); outbuf[2] = ((inbuf[1] & 0x0f) << 2) | ((inbuf [2] & 0xc0) >> 6); outbuf[3] = inbuf[2] & 0x3f; // write output for (int j = 0; j < available_input+1; ++j) { ret += base64_table[outbuf[j]]; } // write pad for (int j = 0; j < 3 - available_input; ++j) { ret += '='; } } return ret; } void intrusive_ptr_add_ref(timeout_handler const* c) { assert(c != 0); assert(c->m_refs >= 0); timeout_handler::mutex_t::scoped_lock l(c->m_mutex); ++c->m_refs; } void intrusive_ptr_release(timeout_handler const* c) { assert(c != 0); assert(c->m_refs > 0); timeout_handler::mutex_t::scoped_lock l(c->m_mutex); --c->m_refs; if (c->m_refs == 0) { l.unlock(); delete c; } } timeout_handler::timeout_handler(demuxer& d) : m_demuxer(d) , m_start_time(second_clock::universal_time()) , m_read_time(second_clock::universal_time()) , m_timeout(d) , m_completion_timeout(0) , m_read_timeout(0) , m_refs(0) {} void timeout_handler::set_timeout(int completion_timeout, int read_timeout) { m_completion_timeout = completion_timeout; m_read_timeout = read_timeout; m_start_time = second_clock::universal_time(); m_read_time = second_clock::universal_time(); m_timeout.expires_at(std::min( m_read_time + seconds(m_read_timeout) , m_start_time + seconds(m_completion_timeout))); m_timeout.async_wait(bind(&timeout_handler::timeout_callback, self(), _1)); } void timeout_handler::restart_read_timeout() { m_read_time = second_clock::universal_time(); } void timeout_handler::cancel() { m_timeout.cancel(); m_completion_timeout = 0; } void timeout_handler::timeout_callback(asio::error const& error) try { if (error) return; if (m_completion_timeout == 0) return; ptime now(second_clock::universal_time()); time_duration receive_timeout = now - m_read_time; time_duration completion_timeout = now - m_start_time; if (m_read_timeout < receive_timeout.total_seconds() || m_completion_timeout < completion_timeout.total_seconds()) { on_timeout(); return; } m_timeout.expires_at(std::min( m_read_time + seconds(m_read_timeout) , m_start_time + seconds(m_completion_timeout))); m_timeout.async_wait(bind(&timeout_handler::timeout_callback, self(), _1)); } catch (std::exception& e) { assert(false); } tracker_connection::tracker_connection( tracker_manager& man , tracker_request req , demuxer& d , boost::weak_ptr r) : timeout_handler(d) , m_requester(r) , m_man(man) , m_req(req) {} request_callback& tracker_connection::requester() { boost::shared_ptr r = m_requester.lock(); assert(r); return *r; } void tracker_connection::fail(int code, char const* msg) { if (has_requester()) requester().tracker_request_error( m_req, code, msg); close(); } void tracker_connection::fail_timeout() { if (has_requester()) requester().tracker_request_timed_out(m_req); close(); } void tracker_connection::close() { m_man.remove_request(this); cancel(); } void tracker_manager::remove_request(tracker_connection const* c) { mutex_t::scoped_lock l(m_mutex); tracker_connections_t::iterator i = std::find(m_connections.begin() , m_connections.end(), boost::intrusive_ptr(c)); if (i == m_connections.end()) return; m_connections.erase(i); } tuple parse_url_components(std::string url) { std::string hostname; // hostname only std::string protocol; // should be http int port = 80; // PARSE URL std::string::iterator start = url.begin(); // remove white spaces in front of the url while (start != url.end() && (*start == ' ' || *start == '\t')) ++start; std::string::iterator end = std::find(url.begin(), url.end(), ':'); protocol = std::string(start, end); if (end == url.end()) throw std::runtime_error("invalid url"); ++end; if (end == url.end()) throw std::runtime_error("invalid url"); if (*end != '/') throw std::runtime_error("invalid url"); ++end; if (end == url.end()) throw std::runtime_error("invalid url"); if (*end != '/') throw std::runtime_error("invalid url"); ++end; start = end; end = std::find(start, url.end(), '/'); std::string::iterator port_pos = std::find(start, url.end(), ':'); if (port_pos < end) { hostname.assign(start, port_pos); ++port_pos; try { port = boost::lexical_cast(std::string(port_pos, end)); } catch(boost::bad_lexical_cast&) { throw std::runtime_error("invalid url: \"" + url + "\", port number expected"); } } else { hostname.assign(start, end); } start = end; return make_tuple(protocol, hostname, port , std::string(start, url.end())); } void tracker_manager::queue_request( demuxer& d , tracker_request req , std::string const& auth , boost::weak_ptr c) { mutex_t::scoped_lock l(m_mutex); assert(req.num_want >= 0); if (req.event == tracker_request::stopped) req.num_want = 0; try { std::string protocol; std::string hostname; int port; std::string request_string; boost::tie(protocol, hostname, port, request_string) = parse_url_components(req.url); boost::intrusive_ptr con; if (protocol == "http") { con = new http_tracker_connection( d , *this , req , hostname , port , request_string , c , m_settings , auth); } else if (protocol == "udp") { con = new udp_tracker_connection( d , *this , req , hostname , port , c , m_settings); } else { throw std::runtime_error("unkown protocol in tracker url"); } m_connections.push_back(con); if (con->has_requester()) con->requester().m_manager = this; } catch (std::exception& e) { if (boost::shared_ptr r = c.lock()) r->tracker_request_error(req, -1, e.what()); } } void tracker_manager::abort_all_requests() { // removes all connections from m_connections // except those with a requester == 0 (since those are // 'event=stopped'-requests) mutex_t::scoped_lock l(m_mutex); tracker_connections_t keep_connections; for (tracker_connections_t::const_iterator i = m_connections.begin(); i != m_connections.end(); ++i) { tracker_request const& req = (*i)->tracker_req(); if (req.event == tracker_request::stopped) keep_connections.push_back(*i); } std::swap(m_connections, keep_connections); } }