2004-03-26 12:39:17 +01:00
|
|
|
/*
|
|
|
|
|
2016-01-18 00:57:46 +01:00
|
|
|
Copyright (c) 2003-2016, Arvid Norberg
|
2004-03-26 12:39:17 +01:00
|
|
|
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.
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
2015-04-18 23:21:22 +02:00
|
|
|
#include "libtorrent/config.hpp"
|
|
|
|
|
2004-03-26 12:39:17 +01:00
|
|
|
#include <string>
|
|
|
|
#include <cctype>
|
|
|
|
#include <algorithm>
|
2016-05-01 00:54:23 +02:00
|
|
|
#include <mutex>
|
2009-01-27 20:11:39 +01:00
|
|
|
#include <cstring>
|
2004-03-26 12:39:17 +01:00
|
|
|
|
2009-06-23 03:57:53 +02:00
|
|
|
#ifdef TORRENT_WINDOWS
|
2009-11-23 00:55:54 +01:00
|
|
|
#ifndef WIN32_LEAN_AND_MEAN
|
|
|
|
#define WIN32_LEAN_AND_MEAN
|
|
|
|
#endif
|
2009-03-01 01:02:33 +01:00
|
|
|
#include <windows.h>
|
|
|
|
#endif
|
|
|
|
|
2015-04-18 04:33:39 +02:00
|
|
|
#if TORRENT_USE_ICONV
|
|
|
|
#include <iconv.h>
|
|
|
|
#include <locale.h>
|
2015-08-02 05:57:11 +02:00
|
|
|
#endif
|
2015-04-18 04:33:39 +02:00
|
|
|
|
|
|
|
#include "libtorrent/assert.hpp"
|
|
|
|
#include "libtorrent/parse_url.hpp"
|
|
|
|
|
2009-03-01 01:02:33 +01:00
|
|
|
#include "libtorrent/utf8.hpp"
|
2015-03-15 00:10:20 +01:00
|
|
|
#include "libtorrent/aux_/escape_string.hpp"
|
2016-05-17 15:24:06 +02:00
|
|
|
#include "libtorrent/aux_/max_path.hpp" // for TORRENT_MAX_PATH
|
2015-03-15 00:10:20 +01:00
|
|
|
#include "libtorrent/string_util.hpp" // for to_string
|
2017-02-05 04:05:53 +01:00
|
|
|
#include "libtorrent/aux_/array.hpp"
|
2015-03-15 00:10:20 +01:00
|
|
|
|
2004-03-26 12:39:17 +01:00
|
|
|
namespace libtorrent
|
|
|
|
{
|
2015-04-21 02:23:00 +02:00
|
|
|
// defined in hex.cpp
|
2016-06-04 16:01:43 +02:00
|
|
|
namespace aux {
|
|
|
|
extern const char hex_chars[];
|
|
|
|
}
|
2009-01-27 07:17:55 +01:00
|
|
|
|
2017-03-31 04:55:54 +02:00
|
|
|
std::string unescape_string(string_view s, error_code& ec)
|
2004-03-26 12:39:17 +01:00
|
|
|
{
|
|
|
|
std::string ret;
|
2017-03-31 04:55:54 +02:00
|
|
|
for (auto i = s.begin(); i != s.end(); ++i)
|
2004-03-26 12:39:17 +01:00
|
|
|
{
|
2017-03-31 04:55:54 +02:00
|
|
|
if (*i == '+')
|
2004-03-26 12:39:17 +01:00
|
|
|
{
|
2004-06-14 01:30:42 +02:00
|
|
|
ret += ' ';
|
2004-03-26 12:39:17 +01:00
|
|
|
}
|
|
|
|
else if (*i != '%')
|
|
|
|
{
|
|
|
|
ret += *i;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
++i;
|
|
|
|
if (i == s.end())
|
2009-02-23 02:21:19 +01:00
|
|
|
{
|
2009-11-29 08:06:38 +01:00
|
|
|
ec = errors::invalid_escaped_string;
|
2007-12-29 02:35:50 +01:00
|
|
|
return ret;
|
2009-02-23 02:21:19 +01:00
|
|
|
}
|
2004-03-26 12:39:17 +01:00
|
|
|
|
|
|
|
int high;
|
2017-03-31 04:55:54 +02:00
|
|
|
if (*i >= '0' && *i <= '9') high = *i - '0';
|
|
|
|
else if (*i >= 'A' && *i <= 'F') high = *i + 10 - 'A';
|
|
|
|
else if (*i >= 'a' && *i <= 'f') high = *i + 10 - 'a';
|
2007-12-29 02:35:50 +01:00
|
|
|
else
|
2009-02-23 02:21:19 +01:00
|
|
|
{
|
2009-11-29 08:06:38 +01:00
|
|
|
ec = errors::invalid_escaped_string;
|
2007-12-29 02:35:50 +01:00
|
|
|
return ret;
|
2009-02-23 02:21:19 +01:00
|
|
|
}
|
2004-03-26 12:39:17 +01:00
|
|
|
|
|
|
|
++i;
|
|
|
|
if (i == s.end())
|
2009-02-23 02:21:19 +01:00
|
|
|
{
|
2009-11-29 08:06:38 +01:00
|
|
|
ec = errors::invalid_escaped_string;
|
2007-12-29 02:35:50 +01:00
|
|
|
return ret;
|
2009-02-23 02:21:19 +01:00
|
|
|
}
|
2004-03-26 12:39:17 +01:00
|
|
|
|
|
|
|
int low;
|
2004-06-14 01:30:42 +02:00
|
|
|
if(*i >= '0' && *i <= '9') low = *i - '0';
|
|
|
|
else if(*i >= 'A' && *i <= 'F') low = *i + 10 - 'A';
|
|
|
|
else if(*i >= 'a' && *i <= 'f') low = *i + 10 - 'a';
|
2007-12-29 02:35:50 +01:00
|
|
|
else
|
2009-02-23 02:21:19 +01:00
|
|
|
{
|
2009-11-29 08:06:38 +01:00
|
|
|
ec = errors::invalid_escaped_string;
|
2007-12-29 02:35:50 +01:00
|
|
|
return ret;
|
2009-02-23 02:21:19 +01:00
|
|
|
}
|
2004-03-26 12:39:17 +01:00
|
|
|
|
|
|
|
ret += char(high * 16 + low);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2009-04-04 11:52:25 +02:00
|
|
|
// http://www.ietf.org/rfc/rfc2396.txt
|
|
|
|
// section 2.3
|
2016-06-04 16:01:43 +02:00
|
|
|
static char const unreserved_chars[] =
|
2009-09-05 03:08:56 +02:00
|
|
|
// when determining if a url needs encoding
|
|
|
|
// % should be ok
|
|
|
|
"%+"
|
|
|
|
// reserved
|
2010-03-29 02:31:30 +02:00
|
|
|
";?:@=&,$/"
|
2009-09-05 03:08:56 +02:00
|
|
|
// unreserved (special characters) ' excluded,
|
|
|
|
// since some buggy trackers fail with those
|
2010-03-29 02:31:30 +02:00
|
|
|
"-_!.~*()"
|
2009-09-05 03:08:56 +02:00
|
|
|
// unreserved (alphanumerics)
|
2009-04-04 11:52:25 +02:00
|
|
|
"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"
|
|
|
|
"0123456789";
|
2009-09-05 03:08:56 +02:00
|
|
|
|
2016-06-04 16:01:43 +02:00
|
|
|
namespace {
|
|
|
|
|
2009-06-19 20:18:49 +02:00
|
|
|
// the offset is used to ignore the first characters in the unreserved_chars table.
|
2016-06-04 16:01:43 +02:00
|
|
|
std::string escape_string_impl(const char* str, int len, int offset)
|
2004-03-26 12:39:17 +01:00
|
|
|
{
|
2016-07-09 22:26:26 +02:00
|
|
|
TORRENT_ASSERT(str != nullptr);
|
2007-10-05 02:30:00 +02:00
|
|
|
TORRENT_ASSERT(len >= 0);
|
2009-06-19 20:18:49 +02:00
|
|
|
TORRENT_ASSERT(offset >= 0);
|
2016-08-30 04:37:19 +02:00
|
|
|
TORRENT_ASSERT(offset < int(sizeof(unreserved_chars)) - 1);
|
2009-04-04 11:52:25 +02:00
|
|
|
|
|
|
|
std::string ret;
|
2004-03-26 12:39:17 +01:00
|
|
|
for (int i = 0; i < len; ++i)
|
|
|
|
{
|
2016-08-30 04:37:19 +02:00
|
|
|
if (std::strchr(unreserved_chars + offset, *str) && *str != 0)
|
2004-03-26 12:39:17 +01:00
|
|
|
{
|
2009-04-04 11:52:25 +02:00
|
|
|
ret += *str;
|
2004-03-26 12:39:17 +01:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2009-04-04 11:52:25 +02:00
|
|
|
ret += '%';
|
2016-06-18 20:01:38 +02:00
|
|
|
ret += aux::hex_chars[std::uint8_t(*str) >> 4];
|
|
|
|
ret += aux::hex_chars[std::uint8_t(*str) & 15];
|
2004-03-26 12:39:17 +01:00
|
|
|
}
|
|
|
|
++str;
|
|
|
|
}
|
2009-04-04 11:52:25 +02:00
|
|
|
return ret;
|
2004-03-26 12:39:17 +01:00
|
|
|
}
|
2015-08-02 05:57:11 +02:00
|
|
|
|
2016-06-04 16:01:43 +02:00
|
|
|
} // anonymous namespace
|
|
|
|
|
2016-08-30 04:37:19 +02:00
|
|
|
std::string escape_string(string_view str)
|
2009-06-19 20:18:49 +02:00
|
|
|
{
|
2016-08-30 04:37:19 +02:00
|
|
|
return escape_string_impl(str.data(), int(str.size()), 11);
|
2009-06-19 20:18:49 +02:00
|
|
|
}
|
|
|
|
|
2016-08-30 04:37:19 +02:00
|
|
|
std::string escape_path(string_view str)
|
2006-04-25 23:04:48 +02:00
|
|
|
{
|
2016-08-30 04:37:19 +02:00
|
|
|
return escape_string_impl(str.data(), int(str.size()), 10);
|
2009-06-19 20:18:49 +02:00
|
|
|
}
|
2006-04-25 23:04:48 +02:00
|
|
|
|
2009-09-05 03:08:56 +02:00
|
|
|
bool need_encoding(char const* str, int len)
|
2009-06-19 20:18:49 +02:00
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
for (int i = 0; i < len; ++i)
|
|
|
|
{
|
2016-07-09 22:26:26 +02:00
|
|
|
if (std::strchr(unreserved_chars, *str) == nullptr || *str == 0)
|
2009-06-19 20:18:49 +02:00
|
|
|
return true;
|
2006-04-25 23:04:48 +02:00
|
|
|
++str;
|
|
|
|
}
|
2009-06-19 20:18:49 +02:00
|
|
|
return false;
|
|
|
|
}
|
2015-08-02 05:57:11 +02:00
|
|
|
|
2009-10-30 04:42:29 +01:00
|
|
|
void convert_path_to_posix(std::string& path)
|
|
|
|
{
|
|
|
|
for (std::string::iterator i = path.begin()
|
|
|
|
, end(path.end()); i != end; ++i)
|
|
|
|
if (*i == '\\') *i = '/';
|
|
|
|
}
|
|
|
|
|
2014-07-06 21:18:00 +02:00
|
|
|
#ifdef TORRENT_WINDOWS
|
|
|
|
void convert_path_to_windows(std::string& path)
|
|
|
|
{
|
|
|
|
for (std::string::iterator i = path.begin()
|
|
|
|
, end(path.end()); i != end; ++i)
|
|
|
|
if (*i == '/') *i = '\\';
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2015-03-15 00:10:20 +01:00
|
|
|
// TODO: 2 this should probably be moved into string_util.cpp
|
2009-08-25 20:13:46 +02:00
|
|
|
std::string read_until(char const*& str, char delim, char const* end)
|
|
|
|
{
|
|
|
|
TORRENT_ASSERT(str <= end);
|
|
|
|
|
|
|
|
std::string ret;
|
|
|
|
while (str != end && *str != delim)
|
|
|
|
{
|
|
|
|
ret += *str;
|
|
|
|
++str;
|
|
|
|
}
|
|
|
|
// skip the delimiter as well
|
|
|
|
while (str != end && *str == delim) ++str;
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2009-06-19 20:18:49 +02:00
|
|
|
std::string maybe_url_encode(std::string const& url)
|
|
|
|
{
|
|
|
|
std::string protocol, host, auth, path;
|
|
|
|
int port;
|
|
|
|
error_code ec;
|
2016-06-20 17:32:06 +02:00
|
|
|
std::tie(protocol, auth, host, port, path) = parse_url_components(url, ec);
|
2009-06-19 20:18:49 +02:00
|
|
|
if (ec) return url;
|
2016-05-17 15:24:06 +02:00
|
|
|
|
2009-06-19 20:18:49 +02:00
|
|
|
// first figure out if this url contains unencoded characters
|
2016-04-25 23:22:09 +02:00
|
|
|
if (!need_encoding(path.c_str(), int(path.size())))
|
2009-06-19 20:18:49 +02:00
|
|
|
return url;
|
|
|
|
|
2017-02-17 05:47:08 +01:00
|
|
|
std::string msg;
|
|
|
|
std::string escaped_path { escape_path(path) };
|
|
|
|
// reserve enough space so further append will
|
|
|
|
// only copy values to existing location
|
|
|
|
msg.reserve(protocol.size() + 3 + // protocol part
|
|
|
|
auth.size() + 1 + // auth part
|
|
|
|
host.size() + // host part
|
|
|
|
1 + 5 + // port part
|
|
|
|
escaped_path.size());
|
|
|
|
msg.append(protocol);
|
|
|
|
msg.append("://");
|
|
|
|
if (!auth.empty())
|
|
|
|
{
|
|
|
|
msg.append(auth);
|
|
|
|
msg.append("@");
|
|
|
|
}
|
|
|
|
msg.append(host);
|
|
|
|
if (port != -1)
|
|
|
|
{
|
|
|
|
msg.append(":");
|
|
|
|
msg.append(to_string(port).data());
|
|
|
|
}
|
|
|
|
msg.append(escaped_path);
|
|
|
|
|
2009-06-19 20:18:49 +02:00
|
|
|
return msg;
|
2006-04-25 23:04:48 +02:00
|
|
|
}
|
2007-12-02 19:34:37 +01:00
|
|
|
|
2017-03-23 23:19:40 +01:00
|
|
|
#ifndef TORRENT_NO_DEPRECATE
|
2014-07-06 21:18:00 +02:00
|
|
|
std::string resolve_file_url(std::string const& url)
|
|
|
|
{
|
|
|
|
TORRENT_ASSERT(url.substr(0, 7) == "file://");
|
|
|
|
// first, strip the file:// part.
|
|
|
|
// On windows, we have
|
|
|
|
// to strip the first / as well
|
2017-02-05 04:05:53 +01:00
|
|
|
std::size_t num_to_strip = 7;
|
2014-07-06 21:18:00 +02:00
|
|
|
#ifdef TORRENT_WINDOWS
|
|
|
|
if (url[7] == '/' || url[7] == '\\') ++num_to_strip;
|
|
|
|
#endif
|
|
|
|
std::string ret = url.substr(num_to_strip);
|
|
|
|
|
|
|
|
// we also need to URL-decode it
|
|
|
|
error_code ec;
|
|
|
|
std::string unescaped = unescape_string(ret, ec);
|
|
|
|
if (ec) unescaped = ret;
|
|
|
|
|
|
|
|
// on windows, we need to convert forward slashes
|
|
|
|
// to backslashes
|
|
|
|
#ifdef TORRENT_WINDOWS
|
|
|
|
convert_path_to_windows(unescaped);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
return unescaped;
|
|
|
|
}
|
2017-03-23 23:19:40 +01:00
|
|
|
#endif
|
2014-07-06 21:18:00 +02:00
|
|
|
|
2007-12-02 19:34:37 +01:00
|
|
|
std::string base64encode(const std::string& s)
|
|
|
|
{
|
2016-06-04 16:01:43 +02:00
|
|
|
static char const base64_table[] =
|
2007-12-02 19:34:37 +01:00
|
|
|
{
|
|
|
|
'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', '+', '/'
|
|
|
|
};
|
|
|
|
|
2017-02-05 04:05:53 +01:00
|
|
|
aux::array<std::uint8_t, 3> inbuf;
|
|
|
|
aux::array<std::uint8_t, 4> outbuf;
|
2016-09-22 04:59:43 +02:00
|
|
|
|
2007-12-02 19:34:37 +01:00
|
|
|
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
|
2016-11-27 05:38:25 +01:00
|
|
|
int available_input = std::min(int(inbuf.size()), int(s.end() - i));
|
2007-12-02 19:34:37 +01:00
|
|
|
|
|
|
|
// clear input buffer
|
2016-11-27 05:38:25 +01:00
|
|
|
inbuf.fill(0);
|
2007-12-02 19:34:37 +01:00
|
|
|
|
|
|
|
// read a chunk of input into inbuf
|
2016-11-27 05:38:25 +01:00
|
|
|
std::copy(i, i + available_input, inbuf.begin());
|
2007-12-03 07:03:16 +01:00
|
|
|
i += available_input;
|
2007-12-02 19:34:37 +01:00
|
|
|
|
|
|
|
// encode inbuf to outbuf
|
|
|
|
outbuf[0] = (inbuf[0] & 0xfc) >> 2;
|
2016-11-25 17:17:25 +01:00
|
|
|
outbuf[1] = (((inbuf[0] & 0x03) << 4) | ((inbuf [1] & 0xf0) >> 4)) & 0xff;
|
|
|
|
outbuf[2] = (((inbuf[1] & 0x0f) << 2) | ((inbuf [2] & 0xc0) >> 6)) & 0xff;
|
2007-12-02 19:34:37 +01:00
|
|
|
outbuf[3] = inbuf[2] & 0x3f;
|
|
|
|
|
|
|
|
// write output
|
2016-11-27 05:38:25 +01:00
|
|
|
for (int j = 0; j < available_input + 1; ++j)
|
2007-12-02 19:34:37 +01:00
|
|
|
{
|
|
|
|
ret += base64_table[outbuf[j]];
|
|
|
|
}
|
|
|
|
|
|
|
|
// write pad
|
2016-11-27 14:46:53 +01:00
|
|
|
for (int j = 0; j < int(inbuf.size()) - available_input; ++j)
|
2007-12-02 19:34:37 +01:00
|
|
|
{
|
|
|
|
ret += '=';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2017-03-31 03:04:48 +02:00
|
|
|
#if TORRENT_USE_I2P
|
2017-03-31 04:55:54 +02:00
|
|
|
std::string base32encode(string_view s, int flags)
|
2007-12-02 19:34:37 +01:00
|
|
|
{
|
2016-06-04 16:01:43 +02:00
|
|
|
static char const base32_table_canonical[] =
|
2007-12-02 19:34:37 +01:00
|
|
|
{
|
|
|
|
'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', '2', '3', '4', '5', '6', '7'
|
|
|
|
};
|
2016-06-04 16:01:43 +02:00
|
|
|
static char const base32_table_lowercase[] =
|
2015-06-17 05:39:36 +02:00
|
|
|
{
|
|
|
|
'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', '2', '3', '4', '5', '6', '7'
|
|
|
|
};
|
2016-06-20 17:32:06 +02:00
|
|
|
char const *base32_table = 0 != (flags & string::lowercase) ? base32_table_lowercase : base32_table_canonical;
|
|
|
|
|
2017-02-05 04:05:53 +01:00
|
|
|
static aux::array<int, 6> const input_output_mapping{{{0, 2, 4, 5, 7, 8}}};
|
2016-06-20 17:32:06 +02:00
|
|
|
|
2017-02-05 04:05:53 +01:00
|
|
|
aux::array<std::uint8_t, 5> inbuf;
|
|
|
|
aux::array<std::uint8_t, 8> outbuf;
|
2007-12-02 19:34:37 +01:00
|
|
|
|
|
|
|
std::string ret;
|
2017-03-31 04:55:54 +02:00
|
|
|
for (auto i = s.begin(); i != s.end();)
|
2007-12-02 19:34:37 +01:00
|
|
|
{
|
2016-11-27 05:38:25 +01:00
|
|
|
int available_input = std::min(int(inbuf.size()), int(s.end()-i));
|
2007-12-02 19:34:37 +01:00
|
|
|
|
|
|
|
// clear input buffer
|
2016-11-27 05:38:25 +01:00
|
|
|
inbuf.fill(0);
|
2007-12-02 19:34:37 +01:00
|
|
|
|
|
|
|
// read a chunk of input into inbuf
|
2016-11-27 05:38:25 +01:00
|
|
|
std::copy(i, i + available_input, inbuf.begin());
|
2007-12-03 07:03:16 +01:00
|
|
|
i += available_input;
|
2007-12-02 19:34:37 +01:00
|
|
|
|
|
|
|
// encode inbuf to outbuf
|
|
|
|
outbuf[0] = (inbuf[0] & 0xf8) >> 3;
|
2016-11-25 17:17:25 +01:00
|
|
|
outbuf[1] = (((inbuf[0] & 0x07) << 2) | ((inbuf[1] & 0xc0) >> 6)) & 0xff;
|
2007-12-02 19:34:37 +01:00
|
|
|
outbuf[2] = ((inbuf[1] & 0x3e) >> 1);
|
2016-11-25 17:17:25 +01:00
|
|
|
outbuf[3] = (((inbuf[1] & 0x01) << 4) | ((inbuf[2] & 0xf0) >> 4)) & 0xff;
|
|
|
|
outbuf[4] = (((inbuf[2] & 0x0f) << 1) | ((inbuf[3] & 0x80) >> 7)) & 0xff;
|
2007-12-02 19:34:37 +01:00
|
|
|
outbuf[5] = ((inbuf[3] & 0x7c) >> 2);
|
2016-11-25 17:17:25 +01:00
|
|
|
outbuf[6] = (((inbuf[3] & 0x03) << 3) | ((inbuf[4] & 0xe0) >> 5)) & 0xff;
|
2007-12-02 19:34:37 +01:00
|
|
|
outbuf[7] = inbuf[4] & 0x1f;
|
|
|
|
|
|
|
|
// write output
|
2016-11-27 05:38:25 +01:00
|
|
|
int const num_out = input_output_mapping[available_input];
|
2007-12-02 19:34:37 +01:00
|
|
|
for (int j = 0; j < num_out; ++j)
|
|
|
|
{
|
|
|
|
ret += base32_table[outbuf[j]];
|
|
|
|
}
|
|
|
|
|
2015-06-17 05:39:36 +02:00
|
|
|
if (0 == (flags & string::no_padding))
|
2007-12-02 19:34:37 +01:00
|
|
|
{
|
2015-06-17 05:39:36 +02:00
|
|
|
// write pad
|
2016-11-27 14:46:53 +01:00
|
|
|
for (int j = 0; j < int(outbuf.size()) - num_out; ++j)
|
2015-06-17 05:39:36 +02:00
|
|
|
{
|
|
|
|
ret += '=';
|
|
|
|
}
|
2007-12-02 19:34:37 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
2017-03-31 03:04:48 +02:00
|
|
|
#endif // TORRENT_USE_I2P
|
2007-12-02 20:10:45 +01:00
|
|
|
|
2017-03-31 04:55:54 +02:00
|
|
|
std::string base32decode(string_view s)
|
2007-12-03 07:03:16 +01:00
|
|
|
{
|
2017-02-05 04:05:53 +01:00
|
|
|
aux::array<std::uint8_t, 8> inbuf;
|
|
|
|
aux::array<std::uint8_t, 5> outbuf;
|
2016-10-22 17:47:24 +02:00
|
|
|
|
2007-12-03 07:03:16 +01:00
|
|
|
std::string ret;
|
2017-03-31 04:55:54 +02:00
|
|
|
for (auto i = s.begin(); i != s.end();)
|
2007-12-03 07:03:16 +01:00
|
|
|
{
|
2016-11-27 05:38:25 +01:00
|
|
|
int available_input = std::min(int(inbuf.size()), int(s.end() - i));
|
2007-12-03 07:03:16 +01:00
|
|
|
|
|
|
|
int pad_start = 0;
|
|
|
|
if (available_input < 8) pad_start = available_input;
|
|
|
|
|
|
|
|
// clear input buffer
|
2016-11-27 05:38:25 +01:00
|
|
|
inbuf.fill(0);
|
2007-12-03 07:03:16 +01:00
|
|
|
for (int j = 0; j < available_input; ++j)
|
|
|
|
{
|
2016-11-25 17:17:25 +01:00
|
|
|
char const in = char(std::toupper(*i++));
|
2007-12-03 07:03:16 +01:00
|
|
|
if (in >= 'A' && in <= 'Z')
|
2017-02-05 04:05:53 +01:00
|
|
|
inbuf[j] = (in - 'A') & 0xff;
|
2007-12-03 07:03:16 +01:00
|
|
|
else if (in >= '2' && in <= '7')
|
2017-02-05 04:05:53 +01:00
|
|
|
inbuf[j] = (in - '2' + ('Z' - 'A') + 1) & 0xff;
|
2007-12-03 07:03:16 +01:00
|
|
|
else if (in == '=')
|
|
|
|
{
|
|
|
|
inbuf[j] = 0;
|
|
|
|
if (pad_start == 0) pad_start = j;
|
|
|
|
}
|
|
|
|
else if (in == '1')
|
|
|
|
inbuf[j] = 'I' - 'A';
|
|
|
|
else
|
|
|
|
return std::string();
|
|
|
|
TORRENT_ASSERT(inbuf[j] == (inbuf[j] & 0x1f));
|
|
|
|
}
|
|
|
|
|
|
|
|
// decode inbuf to outbuf
|
2016-11-25 17:17:25 +01:00
|
|
|
outbuf[0] = (inbuf[0] << 3) & 0xff;
|
2007-12-03 07:03:16 +01:00
|
|
|
outbuf[0] |= inbuf[1] >> 2;
|
2016-11-25 17:17:25 +01:00
|
|
|
outbuf[1] = ((inbuf[1] & 0x3) << 6) & 0xff;
|
2007-12-03 07:03:16 +01:00
|
|
|
outbuf[1] |= inbuf[2] << 1;
|
|
|
|
outbuf[1] |= (inbuf[3] & 0x10) >> 4;
|
2016-11-25 17:17:25 +01:00
|
|
|
outbuf[2] = ((inbuf[3] & 0x0f) << 4) & 0xff;
|
2007-12-03 07:03:16 +01:00
|
|
|
outbuf[2] |= (inbuf[4] & 0x1e) >> 1;
|
2016-11-25 17:17:25 +01:00
|
|
|
outbuf[3] = ((inbuf[4] & 0x01) << 7) & 0xff;
|
2007-12-03 07:03:16 +01:00
|
|
|
outbuf[3] |= (inbuf[5] & 0x1f) << 2;
|
|
|
|
outbuf[3] |= (inbuf[6] & 0x18) >> 3;
|
2016-11-25 17:17:25 +01:00
|
|
|
outbuf[4] = ((inbuf[6] & 0x07) << 5) & 0xff;
|
2007-12-03 07:03:16 +01:00
|
|
|
outbuf[4] |= inbuf[7];
|
|
|
|
|
|
|
|
int input_output_mapping[] = {5, 1, 1, 2, 2, 3, 4, 4, 5};
|
|
|
|
int num_out = input_output_mapping[pad_start];
|
|
|
|
|
|
|
|
// write output
|
2016-11-27 05:38:25 +01:00
|
|
|
std::copy(outbuf.begin(), outbuf.begin() + num_out, std::back_inserter(ret));
|
2007-12-03 07:03:16 +01:00
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2017-03-31 04:55:54 +02:00
|
|
|
string_view trim(string_view str)
|
|
|
|
{
|
|
|
|
auto const first = str.find_first_not_of(" \t\n\r");
|
|
|
|
auto const last = str.find_last_not_of(" \t\n\r");
|
|
|
|
return str.substr(first, last - first + 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
string_view::size_type find(string_view haystack, string_view needle, string_view::size_type pos)
|
|
|
|
{
|
|
|
|
auto const p = haystack.substr(pos).find(needle);
|
|
|
|
if (p == string_view::npos) return p;
|
|
|
|
return pos + p;
|
|
|
|
}
|
|
|
|
|
|
|
|
string_view url_has_argument(
|
|
|
|
string_view url, std::string argument, std::string::size_type* out_pos)
|
2007-12-02 20:10:45 +01:00
|
|
|
{
|
2017-03-31 04:55:54 +02:00
|
|
|
auto i = url.find('?');
|
|
|
|
if (i == std::string::npos) return {};
|
2007-12-02 20:10:45 +01:00
|
|
|
++i;
|
|
|
|
|
|
|
|
argument += '=';
|
|
|
|
|
2017-03-31 04:55:54 +02:00
|
|
|
if (url.substr(i, argument.size()) == argument)
|
2007-12-02 20:10:45 +01:00
|
|
|
{
|
2017-03-31 04:55:54 +02:00
|
|
|
auto pos = i + argument.size();
|
2010-03-01 07:46:57 +01:00
|
|
|
if (out_pos) *out_pos = pos;
|
2017-03-31 04:55:54 +02:00
|
|
|
return url.substr(pos, url.substr(pos).find('&'));
|
2007-12-02 20:10:45 +01:00
|
|
|
}
|
|
|
|
argument.insert(0, "&");
|
2017-03-31 04:55:54 +02:00
|
|
|
i = find(url, argument, i);
|
|
|
|
if (i == std::string::npos) return {};
|
|
|
|
auto pos = i + argument.size();
|
2010-03-01 07:46:57 +01:00
|
|
|
if (out_pos) *out_pos = pos;
|
2017-03-31 04:55:54 +02:00
|
|
|
return url.substr(pos, find(url, "&", pos) - pos);
|
2007-12-02 20:10:45 +01:00
|
|
|
}
|
|
|
|
|
2010-02-15 06:49:10 +01:00
|
|
|
#if defined TORRENT_WINDOWS && TORRENT_USE_WSTRING
|
2009-03-01 01:02:33 +01:00
|
|
|
std::wstring convert_to_wstring(std::string const& s)
|
|
|
|
{
|
2016-09-25 04:16:10 +02:00
|
|
|
error_code ec;
|
|
|
|
std::wstring ret = libtorrent::utf8_wchar(s, ec);
|
|
|
|
if (!ec) return ret;
|
2009-03-01 01:02:33 +01:00
|
|
|
|
|
|
|
ret.clear();
|
|
|
|
const char* end = &s[0] + s.size();
|
|
|
|
for (const char* i = &s[0]; i < end;)
|
|
|
|
{
|
|
|
|
wchar_t c = '.';
|
2016-09-25 04:16:10 +02:00
|
|
|
int const result = std::mbtowc(&c, i, end - i);
|
2009-03-01 01:02:33 +01:00
|
|
|
if (result > 0) i += result;
|
|
|
|
else ++i;
|
|
|
|
ret += c;
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2009-10-26 02:29:39 +01:00
|
|
|
std::string convert_from_wstring(std::wstring const& s)
|
2009-06-22 04:19:11 +02:00
|
|
|
{
|
2016-09-25 04:16:10 +02:00
|
|
|
error_code ec;
|
|
|
|
std::string ret = libtorrent::wchar_utf8(s, ec);
|
|
|
|
if (!ec) return ret;
|
2009-10-26 02:29:39 +01:00
|
|
|
|
|
|
|
ret.clear();
|
|
|
|
const wchar_t* end = &s[0] + s.size();
|
|
|
|
for (const wchar_t* i = &s[0]; i < end;)
|
2009-06-22 04:19:11 +02:00
|
|
|
{
|
2009-10-26 02:29:39 +01:00
|
|
|
char c[10];
|
2016-12-09 14:23:54 +01:00
|
|
|
TORRENT_ASSERT(sizeof(c) >= std::size_t(MB_CUR_MAX));
|
2016-09-25 04:16:10 +02:00
|
|
|
int const result = std::wctomb(c, *i);
|
2009-10-26 02:29:39 +01:00
|
|
|
if (result > 0)
|
|
|
|
{
|
|
|
|
i += result;
|
|
|
|
ret.append(c, result);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
++i;
|
|
|
|
ret += ".";
|
|
|
|
}
|
2009-06-22 04:19:11 +02:00
|
|
|
}
|
2009-10-26 02:29:39 +01:00
|
|
|
return ret;
|
2009-06-22 04:19:11 +02:00
|
|
|
}
|
2009-10-26 02:29:39 +01:00
|
|
|
#endif
|
2009-06-22 04:19:11 +02:00
|
|
|
|
2011-02-07 18:25:24 +01:00
|
|
|
#if TORRENT_USE_ICONV
|
2009-10-26 02:29:39 +01:00
|
|
|
std::string iconv_convert_impl(std::string const& s, iconv_t h)
|
|
|
|
{
|
2009-03-01 01:02:33 +01:00
|
|
|
std::string ret;
|
|
|
|
size_t insize = s.size();
|
|
|
|
size_t outsize = insize * 4;
|
|
|
|
ret.resize(outsize);
|
2010-03-04 04:28:18 +01:00
|
|
|
char const* in = s.c_str();
|
2009-03-01 01:02:33 +01:00
|
|
|
char* out = &ret[0];
|
2011-07-23 21:30:23 +02:00
|
|
|
// posix has a weird iconv signature. implementations
|
|
|
|
// differ on what this signature should be, so we use
|
|
|
|
// a macro to let config.hpp determine it
|
|
|
|
size_t retval = iconv(h, TORRENT_ICONV_ARG &in, &insize,
|
2009-03-01 01:02:33 +01:00
|
|
|
&out, &outsize);
|
|
|
|
if (retval == (size_t)-1) return s;
|
2010-03-04 04:28:18 +01:00
|
|
|
// if this string has an invalid utf-8 sequence in it, don't touch it
|
|
|
|
if (insize != 0) return s;
|
|
|
|
// not sure why this would happen, but it seems to be possible
|
|
|
|
if (outsize > s.size() * 4) return s;
|
2010-10-18 09:15:57 +02:00
|
|
|
// outsize is the number of bytes unused of the out-buffer
|
|
|
|
TORRENT_ASSERT(ret.size() >= outsize);
|
|
|
|
ret.resize(ret.size() - outsize);
|
2009-03-01 01:02:33 +01:00
|
|
|
return ret;
|
|
|
|
}
|
2009-10-26 02:29:39 +01:00
|
|
|
|
|
|
|
std::string convert_to_native(std::string const& s)
|
|
|
|
{
|
2016-05-01 00:54:23 +02:00
|
|
|
static std::mutex iconv_mutex;
|
2011-01-22 05:33:21 +01:00
|
|
|
// only one thread can use this handle at a time
|
2016-05-01 00:54:23 +02:00
|
|
|
std::lock_guard<std::mutex> l(iconv_mutex);
|
2011-01-22 05:33:21 +01:00
|
|
|
|
2009-10-26 02:29:39 +01:00
|
|
|
// the empty string represents the local dependent encoding
|
|
|
|
static iconv_t iconv_handle = iconv_open("", "UTF-8");
|
|
|
|
if (iconv_handle == iconv_t(-1)) return s;
|
|
|
|
return iconv_convert_impl(s, iconv_handle);
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string convert_from_native(std::string const& s)
|
|
|
|
{
|
2016-05-01 00:54:23 +02:00
|
|
|
static std::mutex iconv_mutex;
|
2011-01-22 05:33:21 +01:00
|
|
|
// only one thread can use this handle at a time
|
2016-05-01 00:54:23 +02:00
|
|
|
std::lock_guard<std::mutex> l(iconv_mutex);
|
2011-01-22 05:33:21 +01:00
|
|
|
|
2009-10-26 02:29:39 +01:00
|
|
|
// the empty string represents the local dependent encoding
|
|
|
|
static iconv_t iconv_handle = iconv_open("UTF-8", "");
|
|
|
|
if (iconv_handle == iconv_t(-1)) return s;
|
|
|
|
return iconv_convert_impl(s, iconv_handle);
|
|
|
|
}
|
2011-02-22 04:09:13 +01:00
|
|
|
|
2013-01-21 19:54:45 +01:00
|
|
|
#elif defined TORRENT_WINDOWS
|
|
|
|
|
|
|
|
std::string convert_to_native(std::string const& s)
|
|
|
|
{
|
2016-09-25 04:16:10 +02:00
|
|
|
std::wstring ws = libtorrent::utf8_wchar(s);
|
2013-01-21 19:54:45 +01:00
|
|
|
std::string ret;
|
2013-08-11 01:01:40 +02:00
|
|
|
ret.resize(ws.size() * 4 + 1);
|
2016-06-20 17:32:06 +02:00
|
|
|
std::size_t size = WideCharToMultiByte(CP_ACP, 0, ws.c_str(), -1, &ret[0], int(ret.size()), nullptr, nullptr);
|
2013-01-21 19:54:45 +01:00
|
|
|
if (size == std::size_t(-1)) return s;
|
2014-06-25 19:43:25 +02:00
|
|
|
if (size != 0 && ret[size - 1] == '\0') --size;
|
2013-01-21 19:54:45 +01:00
|
|
|
ret.resize(size);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string convert_from_native(std::string const& s)
|
|
|
|
{
|
|
|
|
std::wstring ws;
|
2013-08-11 01:01:40 +02:00
|
|
|
ws.resize(s.size() + 1);
|
2016-04-25 23:22:09 +02:00
|
|
|
std::size_t size = MultiByteToWideChar(CP_ACP, 0, s.c_str(), -1, &ws[0], int(ws.size()));
|
2013-01-21 19:54:45 +01:00
|
|
|
if (size == std::size_t(-1)) return s;
|
2014-06-27 04:04:37 +02:00
|
|
|
if (size != 0 && ws[size - 1] == '\0') --size;
|
2013-01-21 19:54:45 +01:00
|
|
|
ws.resize(size);
|
2016-09-25 04:16:10 +02:00
|
|
|
return libtorrent::wchar_utf8(ws);
|
2013-01-21 19:54:45 +01:00
|
|
|
}
|
|
|
|
|
2011-02-22 04:09:13 +01:00
|
|
|
#elif TORRENT_USE_LOCALE
|
|
|
|
|
2011-02-07 18:25:24 +01:00
|
|
|
std::string convert_to_native(std::string const& s)
|
|
|
|
{
|
2016-09-25 04:16:10 +02:00
|
|
|
std::wstring ws = libtorrent::utf8_wchar(s);
|
2011-02-07 18:25:24 +01:00
|
|
|
std::size_t size = wcstombs(0, ws.c_str(), 0);
|
|
|
|
if (size == std::size_t(-1)) return s;
|
|
|
|
std::string ret;
|
|
|
|
ret.resize(size);
|
|
|
|
size = wcstombs(&ret[0], ws.c_str(), size + 1);
|
|
|
|
if (size == std::size_t(-1)) return s;
|
|
|
|
ret.resize(size);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string convert_from_native(std::string const& s)
|
|
|
|
{
|
|
|
|
std::wstring ws;
|
|
|
|
ws.resize(s.size());
|
|
|
|
std::size_t size = mbstowcs(&ws[0], s.c_str(), s.size());
|
|
|
|
if (size == std::size_t(-1)) return s;
|
|
|
|
std::string ret;
|
2016-09-25 04:16:10 +02:00
|
|
|
return libtorrent::wchar_utf8(ws);
|
2011-02-07 18:25:24 +01:00
|
|
|
}
|
2011-02-22 04:09:13 +01:00
|
|
|
|
2009-03-01 01:02:33 +01:00
|
|
|
#endif
|
|
|
|
|
2004-03-26 12:39:17 +01:00
|
|
|
}
|