twisterp2pnetworkbittorrentblockchainmicrobloggingipv6social-networkdhtdecentralizedtwister-servertwister-ipv6twister-coretwisterarmyp2p-network
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
563 lines
12 KiB
563 lines
12 KiB
/* |
|
|
|
Copyright (c) 2003-2012, 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 "libtorrent/pch.hpp" |
|
|
|
#include <algorithm> |
|
#if (defined TORRENT_VERBOSE_LOGGING || defined TORRENT_DEBUG) && TORRENT_USE_IOSTREAM |
|
#include <iomanip> |
|
#include <iostream> |
|
#endif |
|
#include <boost/bind.hpp> |
|
#include "libtorrent/entry.hpp" |
|
#include "libtorrent/config.hpp" |
|
#include "libtorrent/escape_string.hpp" |
|
#include "libtorrent/lazy_entry.hpp" |
|
|
|
#if defined(_MSC_VER) |
|
#define for if (false) {} else for |
|
#endif |
|
|
|
namespace |
|
{ |
|
template <class T> |
|
void call_destructor(T* o) |
|
{ |
|
TORRENT_ASSERT(o); |
|
o->~T(); |
|
} |
|
} |
|
|
|
namespace libtorrent |
|
{ |
|
namespace detail |
|
{ |
|
TORRENT_EXPORT char const* integer_to_str(char* buf, int size, entry::integer_type val) |
|
{ |
|
int sign = 0; |
|
if (val < 0) |
|
{ |
|
sign = 1; |
|
val = -val; |
|
} |
|
buf[--size] = '\0'; |
|
if (val == 0) buf[--size] = '0'; |
|
for (; size > sign && val != 0;) |
|
{ |
|
buf[--size] = '0' + char(val % 10); |
|
val /= 10; |
|
} |
|
if (sign) buf[--size] = '-'; |
|
return buf + size; |
|
} |
|
} |
|
|
|
entry& entry::operator[](char const* key) |
|
{ |
|
dictionary_type::iterator i = dict().find(key); |
|
if (i != dict().end()) return i->second; |
|
dictionary_type::iterator ret = dict().insert( |
|
std::pair<const std::string, entry>(key, entry())).first; |
|
return ret->second; |
|
} |
|
|
|
entry& entry::operator[](std::string const& key) |
|
{ |
|
dictionary_type::iterator i = dict().find(key); |
|
if (i != dict().end()) return i->second; |
|
dictionary_type::iterator ret = dict().insert( |
|
std::make_pair(key, entry())).first; |
|
return ret->second; |
|
} |
|
|
|
entry* entry::find_key(char const* key) |
|
{ |
|
dictionary_type::iterator i = dict().find(key); |
|
if (i == dict().end()) return 0; |
|
return &i->second; |
|
} |
|
|
|
entry const* entry::find_key(char const* key) const |
|
{ |
|
dictionary_type::const_iterator i = dict().find(key); |
|
if (i == dict().end()) return 0; |
|
return &i->second; |
|
} |
|
|
|
entry* entry::find_key(std::string const& key) |
|
{ |
|
dictionary_type::iterator i = dict().find(key); |
|
if (i == dict().end()) return 0; |
|
return &i->second; |
|
} |
|
|
|
entry const* entry::find_key(std::string const& key) const |
|
{ |
|
dictionary_type::const_iterator i = dict().find(key); |
|
if (i == dict().end()) return 0; |
|
return &i->second; |
|
} |
|
|
|
#ifndef BOOST_NO_EXCEPTIONS |
|
const entry& entry::operator[](char const* key) const |
|
{ |
|
dictionary_type::const_iterator i = dict().find(key); |
|
if (i == dict().end()) throw type_error( |
|
(std::string("key not found: ") + key).c_str()); |
|
return i->second; |
|
} |
|
|
|
const entry& entry::operator[](std::string const& key) const |
|
{ |
|
return (*this)[key.c_str()]; |
|
} |
|
#endif |
|
|
|
entry::data_type entry::type() const |
|
{ |
|
#ifdef TORRENT_DEBUG |
|
m_type_queried = true; |
|
#endif |
|
return m_type; |
|
} |
|
|
|
entry::~entry() { destruct(); } |
|
|
|
void entry::operator=(const entry& e) |
|
{ |
|
destruct(); |
|
copy(e); |
|
} |
|
|
|
entry::integer_type& entry::integer() |
|
{ |
|
if (m_type == undefined_t) construct(int_t); |
|
#ifndef BOOST_NO_EXCEPTIONS |
|
if (m_type != int_t) throw_type_error(); |
|
#elif defined TORRENT_DEBUG |
|
TORRENT_ASSERT(m_type_queried); |
|
#endif |
|
TORRENT_ASSERT(m_type == int_t); |
|
return *reinterpret_cast<integer_type*>(data); |
|
} |
|
|
|
entry::integer_type const& entry::integer() const |
|
{ |
|
#ifndef BOOST_NO_EXCEPTIONS |
|
if (m_type != int_t) throw_type_error(); |
|
#elif defined TORRENT_DEBUG |
|
TORRENT_ASSERT(m_type_queried); |
|
#endif |
|
TORRENT_ASSERT(m_type == int_t); |
|
return *reinterpret_cast<const integer_type*>(data); |
|
} |
|
|
|
entry::string_type& entry::string() |
|
{ |
|
if (m_type == undefined_t) construct(string_t); |
|
#ifndef BOOST_NO_EXCEPTIONS |
|
if (m_type != string_t) throw_type_error(); |
|
#elif defined TORRENT_DEBUG |
|
TORRENT_ASSERT(m_type_queried); |
|
#endif |
|
TORRENT_ASSERT(m_type == string_t); |
|
return *reinterpret_cast<string_type*>(data); |
|
} |
|
|
|
entry::string_type const& entry::string() const |
|
{ |
|
#ifndef BOOST_NO_EXCEPTIONS |
|
if (m_type != string_t) throw_type_error(); |
|
#elif defined TORRENT_DEBUG |
|
TORRENT_ASSERT(m_type_queried); |
|
#endif |
|
TORRENT_ASSERT(m_type == string_t); |
|
return *reinterpret_cast<const string_type*>(data); |
|
} |
|
|
|
entry::list_type& entry::list() |
|
{ |
|
if (m_type == undefined_t) construct(list_t); |
|
#ifndef BOOST_NO_EXCEPTIONS |
|
if (m_type != list_t) throw_type_error(); |
|
#elif defined TORRENT_DEBUG |
|
TORRENT_ASSERT(m_type_queried); |
|
#endif |
|
TORRENT_ASSERT(m_type == list_t); |
|
return *reinterpret_cast<list_type*>(data); |
|
} |
|
|
|
entry::list_type const& entry::list() const |
|
{ |
|
#ifndef BOOST_NO_EXCEPTIONS |
|
if (m_type != list_t) throw_type_error(); |
|
#elif defined TORRENT_DEBUG |
|
TORRENT_ASSERT(m_type_queried); |
|
#endif |
|
TORRENT_ASSERT(m_type == list_t); |
|
return *reinterpret_cast<const list_type*>(data); |
|
} |
|
|
|
entry::dictionary_type& entry::dict() |
|
{ |
|
if (m_type == undefined_t) construct(dictionary_t); |
|
#ifndef BOOST_NO_EXCEPTIONS |
|
if (m_type != dictionary_t) throw_type_error(); |
|
#elif defined TORRENT_DEBUG |
|
TORRENT_ASSERT(m_type_queried); |
|
#endif |
|
TORRENT_ASSERT(m_type == dictionary_t); |
|
return *reinterpret_cast<dictionary_type*>(data); |
|
} |
|
|
|
entry::dictionary_type const& entry::dict() const |
|
{ |
|
#ifndef BOOST_NO_EXCEPTIONS |
|
if (m_type != dictionary_t) throw_type_error(); |
|
#elif defined TORRENT_DEBUG |
|
TORRENT_ASSERT(m_type_queried); |
|
#endif |
|
TORRENT_ASSERT(m_type == dictionary_t); |
|
return *reinterpret_cast<const dictionary_type*>(data); |
|
} |
|
|
|
entry::entry() |
|
: m_type(undefined_t) |
|
{ |
|
#ifdef TORRENT_DEBUG |
|
m_type_queried = true; |
|
#endif |
|
} |
|
|
|
entry::entry(data_type t) |
|
: m_type(undefined_t) |
|
{ |
|
construct(t); |
|
#ifdef TORRENT_DEBUG |
|
m_type_queried = true; |
|
#endif |
|
} |
|
|
|
entry::entry(const entry& e) |
|
: m_type(undefined_t) |
|
{ |
|
copy(e); |
|
#ifdef TORRENT_DEBUG |
|
m_type_queried = e.m_type_queried; |
|
#endif |
|
} |
|
|
|
entry::entry(dictionary_type const& v) |
|
: m_type(undefined_t) |
|
{ |
|
#ifdef TORRENT_DEBUG |
|
m_type_queried = true; |
|
#endif |
|
new(data) dictionary_type(v); |
|
m_type = dictionary_t; |
|
} |
|
|
|
entry::entry(string_type const& v) |
|
: m_type(undefined_t) |
|
{ |
|
#ifdef TORRENT_DEBUG |
|
m_type_queried = true; |
|
#endif |
|
new(data) string_type(v); |
|
m_type = string_t; |
|
} |
|
|
|
entry::entry(list_type const& v) |
|
: m_type(undefined_t) |
|
{ |
|
#ifdef TORRENT_DEBUG |
|
m_type_queried = true; |
|
#endif |
|
new(data) list_type(v); |
|
m_type = list_t; |
|
} |
|
|
|
entry::entry(integer_type const& v) |
|
: m_type(undefined_t) |
|
{ |
|
#ifdef TORRENT_DEBUG |
|
m_type_queried = true; |
|
#endif |
|
new(data) integer_type(v); |
|
m_type = int_t; |
|
} |
|
|
|
// convert a lazy_entry into an old skool entry |
|
void entry::operator=(lazy_entry const& e) |
|
{ |
|
switch (e.type()) |
|
{ |
|
case lazy_entry::string_t: |
|
this->string() = e.string_value(); |
|
break; |
|
case lazy_entry::int_t: |
|
this->integer() = e.int_value(); |
|
break; |
|
case lazy_entry::dict_t: |
|
{ |
|
dictionary_type& d = this->dict(); |
|
for (int i = 0; i < e.dict_size(); ++i) |
|
{ |
|
std::pair<std::string, lazy_entry const*> elem = e.dict_at(i); |
|
d[elem.first] = *elem.second; |
|
} |
|
break; |
|
} |
|
case lazy_entry::list_t: |
|
{ |
|
list_type& l = this->list(); |
|
for (int i = 0; i < e.list_size(); ++i) |
|
{ |
|
l.push_back(entry()); |
|
l.back() = *e.list_at(i); |
|
} |
|
break; |
|
} |
|
case lazy_entry::none_t: |
|
destruct(); |
|
break; |
|
} |
|
} |
|
|
|
void entry::operator=(dictionary_type const& v) |
|
{ |
|
destruct(); |
|
new(data) dictionary_type(v); |
|
m_type = dictionary_t; |
|
#ifdef TORRENT_DEBUG |
|
m_type_queried = true; |
|
#endif |
|
} |
|
|
|
void entry::operator=(string_type const& v) |
|
{ |
|
destruct(); |
|
new(data) string_type(v); |
|
m_type = string_t; |
|
#ifdef TORRENT_DEBUG |
|
m_type_queried = true; |
|
#endif |
|
} |
|
|
|
void entry::operator=(list_type const& v) |
|
{ |
|
destruct(); |
|
new(data) list_type(v); |
|
m_type = list_t; |
|
#ifdef TORRENT_DEBUG |
|
m_type_queried = true; |
|
#endif |
|
} |
|
|
|
void entry::operator=(integer_type const& v) |
|
{ |
|
destruct(); |
|
new(data) integer_type(v); |
|
m_type = int_t; |
|
#ifdef TORRENT_DEBUG |
|
m_type_queried = true; |
|
#endif |
|
} |
|
|
|
bool entry::operator==(entry const& e) const |
|
{ |
|
if (m_type != e.m_type) return false; |
|
|
|
switch(m_type) |
|
{ |
|
case int_t: |
|
return integer() == e.integer(); |
|
case string_t: |
|
return string() == e.string(); |
|
case list_t: |
|
return list() == e.list(); |
|
case dictionary_t: |
|
return dict() == e.dict(); |
|
default: |
|
TORRENT_ASSERT(m_type == undefined_t); |
|
return true; |
|
} |
|
} |
|
|
|
void entry::construct(data_type t) |
|
{ |
|
switch(t) |
|
{ |
|
case int_t: |
|
new(data) integer_type; |
|
break; |
|
case string_t: |
|
new(data) string_type; |
|
break; |
|
case list_t: |
|
new(data) list_type; |
|
break; |
|
case dictionary_t: |
|
new (data) dictionary_type; |
|
break; |
|
default: |
|
TORRENT_ASSERT(t == undefined_t); |
|
} |
|
m_type = t; |
|
#ifdef TORRENT_DEBUG |
|
m_type_queried = true; |
|
#endif |
|
} |
|
|
|
void entry::copy(entry const& e) |
|
{ |
|
switch (e.type()) |
|
{ |
|
case int_t: |
|
new(data) integer_type(e.integer()); |
|
break; |
|
case string_t: |
|
new(data) string_type(e.string()); |
|
break; |
|
case list_t: |
|
new(data) list_type(e.list()); |
|
break; |
|
case dictionary_t: |
|
new (data) dictionary_type(e.dict()); |
|
break; |
|
default: |
|
TORRENT_ASSERT(e.type() == undefined_t); |
|
} |
|
m_type = e.type(); |
|
#ifdef TORRENT_DEBUG |
|
m_type_queried = true; |
|
#endif |
|
} |
|
|
|
void entry::destruct() |
|
{ |
|
switch(m_type) |
|
{ |
|
case int_t: |
|
call_destructor(reinterpret_cast<integer_type*>(data)); |
|
break; |
|
case string_t: |
|
call_destructor(reinterpret_cast<string_type*>(data)); |
|
break; |
|
case list_t: |
|
call_destructor(reinterpret_cast<list_type*>(data)); |
|
break; |
|
case dictionary_t: |
|
call_destructor(reinterpret_cast<dictionary_type*>(data)); |
|
break; |
|
default: |
|
TORRENT_ASSERT(m_type == undefined_t); |
|
break; |
|
} |
|
m_type = undefined_t; |
|
#ifdef TORRENT_DEBUG |
|
m_type_queried = false; |
|
#endif |
|
} |
|
|
|
void entry::swap(entry& e) |
|
{ |
|
// not implemented |
|
TORRENT_ASSERT(false); |
|
} |
|
|
|
#if (defined TORRENT_VERBOSE_LOGGING || defined TORRENT_DEBUG) && TORRENT_USE_IOSTREAM |
|
void entry::print(std::ostream& os, int indent) const |
|
{ |
|
TORRENT_ASSERT(indent >= 0); |
|
for (int i = 0; i < indent; ++i) os << " "; |
|
switch (m_type) |
|
{ |
|
case int_t: |
|
os << integer() << "\n"; |
|
break; |
|
case string_t: |
|
{ |
|
bool binary_string = false; |
|
for (std::string::const_iterator i = string().begin(); i != string().end(); ++i) |
|
{ |
|
if (!is_print(static_cast<unsigned char>(*i))) |
|
{ |
|
binary_string = true; |
|
break; |
|
} |
|
} |
|
if (binary_string) os << to_hex(string()) << "\n"; |
|
else os << string() << "\n"; |
|
} break; |
|
case list_t: |
|
{ |
|
os << "list\n"; |
|
for (list_type::const_iterator i = list().begin(); i != list().end(); ++i) |
|
{ |
|
i->print(os, indent+1); |
|
} |
|
} break; |
|
case dictionary_t: |
|
{ |
|
os << "dictionary\n"; |
|
for (dictionary_type::const_iterator i = dict().begin(); i != dict().end(); ++i) |
|
{ |
|
bool binary_string = false; |
|
for (std::string::const_iterator k = i->first.begin(); k != i->first.end(); ++k) |
|
{ |
|
if (!is_print(static_cast<unsigned char>(*k))) |
|
{ |
|
binary_string = true; |
|
break; |
|
} |
|
} |
|
for (int j = 0; j < indent+1; ++j) os << " "; |
|
os << "["; |
|
if (binary_string) os << to_hex(i->first); |
|
else os << i->first; |
|
os << "]"; |
|
|
|
if (i->second.type() != entry::string_t |
|
&& i->second.type() != entry::int_t) |
|
os << "\n"; |
|
else os << " "; |
|
i->second.print(os, indent+2); |
|
} |
|
} break; |
|
default: |
|
os << "<uninitialized>\n"; |
|
} |
|
} |
|
#endif |
|
} |
|
|
|
|