2003-10-23 01:00:57 +02:00
|
|
|
/*
|
|
|
|
|
2014-02-23 20:12:25 +01:00
|
|
|
Copyright (c) 2003-2014, Arvid Norberg
|
2003-10-23 01:00:57 +02: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.
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef TORRENT_ENTRY_HPP_INCLUDED
|
|
|
|
#define TORRENT_ENTRY_HPP_INCLUDED
|
|
|
|
|
|
|
|
/*
|
|
|
|
*
|
|
|
|
* This file declares the entry class. It is a
|
|
|
|
* variant-type that can be an integer, list,
|
|
|
|
* dictionary (map) or a string. This type is
|
|
|
|
* used to hold bdecoded data (which is the
|
|
|
|
* encoding BitTorrent messages uses).
|
|
|
|
*
|
|
|
|
* it has 4 accessors to access the actual
|
|
|
|
* type of the object. They are:
|
|
|
|
* integer()
|
|
|
|
* string()
|
|
|
|
* list()
|
|
|
|
* dict()
|
|
|
|
* The actual type has to match the type you
|
|
|
|
* are asking for, otherwise you will get an
|
|
|
|
* assertion failure.
|
|
|
|
* When you default construct an entry, it is
|
|
|
|
* uninitialized. You can initialize it through the
|
|
|
|
* assignment operator, copy-constructor or
|
|
|
|
* the constructor that takes a data_type enum.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2015-04-19 08:28:21 +02:00
|
|
|
#include "libtorrent/config.hpp"
|
|
|
|
|
|
|
|
#include "aux_/disable_warnings_push.hpp"
|
2003-10-23 01:00:57 +02:00
|
|
|
|
|
|
|
#include <map>
|
2004-03-27 23:02:31 +01:00
|
|
|
#include <list>
|
2003-10-23 01:00:57 +02:00
|
|
|
#include <string>
|
|
|
|
#include <stdexcept>
|
2014-12-03 05:32:50 +01:00
|
|
|
#include <boost/cstdint.hpp>
|
2015-04-19 08:28:21 +02:00
|
|
|
#include <boost/config.hpp>
|
|
|
|
#if TORRENT_USE_IOSTREAM
|
|
|
|
#include <iosfwd>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "aux_/disable_warnings_pop.hpp"
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2007-09-01 06:08:39 +02:00
|
|
|
#include "libtorrent/assert.hpp"
|
2009-02-23 02:21:19 +01:00
|
|
|
#include "libtorrent/error_code.hpp"
|
2009-11-23 09:38:50 +01:00
|
|
|
#include "libtorrent/max.hpp"
|
2004-01-18 02:58:33 +01:00
|
|
|
|
2003-10-23 01:00:57 +02:00
|
|
|
namespace libtorrent
|
|
|
|
{
|
2015-03-12 06:20:12 +01:00
|
|
|
#ifndef TORRENT_NO_DEPRECATE
|
2010-03-04 17:42:39 +01:00
|
|
|
struct lazy_entry;
|
2015-03-12 06:20:12 +01:00
|
|
|
#endif
|
|
|
|
struct bdecode_node;
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2013-08-17 04:00:41 +02:00
|
|
|
// thrown by any accessor function of entry if the accessor
|
|
|
|
// function requires a type different than the actual type
|
|
|
|
// of the entry object.
|
2005-11-01 19:30:39 +01:00
|
|
|
struct TORRENT_EXPORT type_error: std::runtime_error
|
2003-10-23 01:00:57 +02:00
|
|
|
{
|
2014-11-29 10:12:44 +01:00
|
|
|
// internal
|
2003-10-23 01:00:57 +02:00
|
|
|
type_error(const char* error): std::runtime_error(error) {}
|
|
|
|
};
|
|
|
|
|
2013-07-26 08:11:10 +02:00
|
|
|
// The ``entry`` class represents one node in a bencoded hierarchy. It works as a
|
|
|
|
// variant type, it can be either a list, a dictionary (``std::map``), an integer
|
|
|
|
// or a string.
|
2005-11-01 19:30:39 +01:00
|
|
|
class TORRENT_EXPORT entry
|
2003-10-23 01:00:57 +02:00
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
2005-08-11 13:06:52 +02:00
|
|
|
// the key is always a string. If a generic entry would be allowed
|
|
|
|
// as a key, sorting would become a problem (e.g. to compare a string
|
|
|
|
// to a list). The definition doesn't mention such a limit though.
|
2005-09-11 11:58:34 +02:00
|
|
|
typedef std::map<std::string, entry> dictionary_type;
|
2003-10-23 01:00:57 +02:00
|
|
|
typedef std::string string_type;
|
2004-03-27 23:02:31 +01:00
|
|
|
typedef std::list<entry> list_type;
|
2014-12-03 05:32:50 +01:00
|
|
|
typedef boost::int64_t integer_type;
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2013-08-17 09:01:03 +02:00
|
|
|
// the types an entry can have
|
2003-10-23 01:00:57 +02:00
|
|
|
enum data_type
|
|
|
|
{
|
|
|
|
int_t,
|
|
|
|
string_t,
|
|
|
|
list_t,
|
|
|
|
dictionary_t,
|
|
|
|
undefined_t
|
|
|
|
};
|
|
|
|
|
2013-08-17 09:01:03 +02:00
|
|
|
// returns the concrete type of the entry
|
2004-03-28 19:45:37 +02:00
|
|
|
data_type type() const;
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2013-08-17 09:01:03 +02:00
|
|
|
// constructors directly from a specific type.
|
|
|
|
// The content of the argument is copied into the
|
|
|
|
// newly constructed entry
|
2006-11-14 01:08:16 +01:00
|
|
|
entry(dictionary_type const&);
|
|
|
|
entry(string_type const&);
|
|
|
|
entry(list_type const&);
|
|
|
|
entry(integer_type const&);
|
2004-01-07 01:48:02 +01:00
|
|
|
|
2013-08-17 09:01:03 +02:00
|
|
|
// construct an empty entry of the specified type.
|
|
|
|
// see data_type enum.
|
2004-03-28 19:45:37 +02:00
|
|
|
entry(data_type t);
|
2013-08-17 09:01:03 +02:00
|
|
|
|
|
|
|
// hidden
|
2006-11-14 01:08:16 +01:00
|
|
|
entry(entry const& e);
|
2013-11-27 21:57:19 +01:00
|
|
|
|
|
|
|
// hidden
|
2013-08-17 09:01:03 +02:00
|
|
|
entry();
|
2013-11-27 21:57:19 +01:00
|
|
|
|
|
|
|
// hidden
|
2004-03-28 19:45:37 +02:00
|
|
|
~entry();
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2013-08-17 09:01:03 +02:00
|
|
|
// hidden
|
2005-08-11 13:06:52 +02:00
|
|
|
bool operator==(entry const& e) const;
|
2013-12-27 05:28:25 +01:00
|
|
|
bool operator!=(entry const& e) const { return !(*this == e); }
|
2013-11-27 21:57:19 +01:00
|
|
|
|
|
|
|
// copies the structure of the right hand side into this
|
|
|
|
// entry.
|
2015-03-12 06:20:12 +01:00
|
|
|
#ifndef TORRENT_NO_DEPRECATE
|
2010-03-04 17:42:39 +01:00
|
|
|
void operator=(lazy_entry const&);
|
2015-03-12 06:20:12 +01:00
|
|
|
#endif
|
|
|
|
void operator=(bdecode_node const&);
|
2005-08-11 13:06:52 +02:00
|
|
|
void operator=(entry const&);
|
|
|
|
void operator=(dictionary_type const&);
|
|
|
|
void operator=(string_type const&);
|
|
|
|
void operator=(list_type const&);
|
|
|
|
void operator=(integer_type const&);
|
2004-01-07 01:48:02 +01:00
|
|
|
|
2013-07-26 08:11:10 +02:00
|
|
|
// The ``integer()``, ``string()``, ``list()`` and ``dict()`` functions
|
2014-02-28 05:02:48 +01:00
|
|
|
// are accessors that return the respective type. If the ``entry`` object
|
|
|
|
// isn't of the type you request, the accessor will throw
|
|
|
|
// libtorrent_exception (which derives from ``std::runtime_error``). You
|
|
|
|
// can ask an ``entry`` for its type through the ``type()`` function.
|
2013-07-26 08:11:10 +02:00
|
|
|
//
|
2014-02-28 05:02:48 +01:00
|
|
|
// If you want to create an ``entry`` you give it the type you want it to
|
|
|
|
// have in its constructor, and then use one of the non-const accessors
|
|
|
|
// to get a reference which you then can assign the value you want it to
|
|
|
|
// have.
|
2013-07-26 08:11:10 +02:00
|
|
|
//
|
2014-02-28 05:02:48 +01:00
|
|
|
// The typical code to get info from a torrent file will then look like
|
2014-09-03 08:52:45 +02:00
|
|
|
// this:
|
|
|
|
//
|
|
|
|
// .. code:: c++
|
2013-07-26 08:11:10 +02:00
|
|
|
//
|
|
|
|
// entry torrent_file;
|
|
|
|
// // ...
|
|
|
|
//
|
|
|
|
// // throws if this is not a dictionary
|
|
|
|
// entry::dictionary_type const& dict = torrent_file.dict();
|
|
|
|
// entry::dictionary_type::const_iterator i;
|
|
|
|
// i = dict.find("announce");
|
|
|
|
// if (i != dict.end())
|
|
|
|
// {
|
|
|
|
// std::string tracker_url = i->second.string();
|
|
|
|
// std::cout << tracker_url << "\n";
|
|
|
|
// }
|
|
|
|
//
|
|
|
|
//
|
2014-09-03 08:52:45 +02:00
|
|
|
// The following code is equivalent, but a little bit shorter:
|
|
|
|
//
|
|
|
|
// .. code:: c++
|
2013-07-26 08:11:10 +02:00
|
|
|
//
|
|
|
|
// entry torrent_file;
|
|
|
|
// // ...
|
|
|
|
//
|
|
|
|
// // throws if this is not a dictionary
|
|
|
|
// if (entry* i = torrent_file.find_key("announce"))
|
|
|
|
// {
|
|
|
|
// std::string tracker_url = i->string();
|
|
|
|
// std::cout << tracker_url << "\n";
|
|
|
|
// }
|
|
|
|
//
|
|
|
|
//
|
2014-02-28 05:02:48 +01:00
|
|
|
// To make it easier to extract information from a torrent file, the
|
|
|
|
// class torrent_info exists.
|
2004-03-28 19:45:37 +02:00
|
|
|
integer_type& integer();
|
|
|
|
const integer_type& integer() const;
|
|
|
|
string_type& string();
|
|
|
|
const string_type& string() const;
|
|
|
|
list_type& list();
|
|
|
|
const list_type& list() const;
|
|
|
|
dictionary_type& dict();
|
|
|
|
const dictionary_type& dict() const;
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2013-08-17 09:01:03 +02:00
|
|
|
// swaps the content of *this* with ``e``.
|
2007-06-10 22:46:09 +02:00
|
|
|
void swap(entry& e);
|
|
|
|
|
2014-02-28 05:02:48 +01:00
|
|
|
// All of these functions requires the entry to be a dictionary, if it
|
|
|
|
// isn't they will throw ``libtorrent::type_error``.
|
2013-07-26 08:11:10 +02:00
|
|
|
//
|
2014-02-28 05:02:48 +01:00
|
|
|
// The non-const versions of the ``operator[]`` will return a reference
|
|
|
|
// to either the existing element at the given key or, if there is no
|
|
|
|
// element with the given key, a reference to a newly inserted element at
|
|
|
|
// that key.
|
2013-07-26 08:11:10 +02:00
|
|
|
//
|
|
|
|
// The const version of ``operator[]`` will only return a reference to an
|
2014-02-28 05:02:48 +01:00
|
|
|
// existing element at the given key. If the key is not found, it will
|
|
|
|
// throw ``libtorrent::type_error``.
|
2013-07-26 08:11:10 +02:00
|
|
|
entry& operator[](char const* key);
|
2004-03-17 13:14:44 +01:00
|
|
|
entry& operator[](std::string const& key);
|
2007-11-02 03:02:52 +01:00
|
|
|
#ifndef BOOST_NO_EXCEPTIONS
|
2004-03-17 13:14:44 +01:00
|
|
|
const entry& operator[](char const* key) const;
|
|
|
|
const entry& operator[](std::string const& key) const;
|
2007-11-02 03:02:52 +01:00
|
|
|
#endif
|
2013-07-26 08:11:10 +02:00
|
|
|
|
2014-02-28 05:02:48 +01:00
|
|
|
// These functions requires the entry to be a dictionary, if it isn't
|
|
|
|
// they will throw ``libtorrent::type_error``.
|
2013-07-26 08:11:10 +02:00
|
|
|
//
|
2014-02-28 05:02:48 +01:00
|
|
|
// They will look for an element at the given key in the dictionary, if
|
|
|
|
// the element cannot be found, they will return 0. If an element with
|
|
|
|
// the given key is found, the return a pointer to it.
|
2004-03-17 13:14:44 +01:00
|
|
|
entry* find_key(char const* key);
|
|
|
|
entry const* find_key(char const* key) const;
|
2008-05-19 09:15:44 +02:00
|
|
|
entry* find_key(std::string const& key);
|
|
|
|
entry const* find_key(std::string const& key) const;
|
2013-07-26 08:11:10 +02:00
|
|
|
|
2014-02-02 04:05:55 +01:00
|
|
|
// returns a pretty-printed string representation
|
|
|
|
// of the bencoded structure, with JSON-style syntax
|
2013-12-19 09:30:17 +01:00
|
|
|
std::string to_string() const;
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2008-04-07 05:03:34 +02:00
|
|
|
protected:
|
2003-10-23 01:00:57 +02:00
|
|
|
|
|
|
|
void construct(data_type t);
|
|
|
|
void copy(const entry& e);
|
|
|
|
void destruct();
|
|
|
|
|
2008-04-07 05:03:34 +02:00
|
|
|
private:
|
|
|
|
|
2013-12-19 09:30:17 +01:00
|
|
|
void to_string_impl(std::string& out, int indent) const;
|
|
|
|
|
2010-03-03 08:42:51 +01:00
|
|
|
#if (defined(_MSC_VER) && _MSC_VER < 1310) || TORRENT_COMPLETE_TYPES_REQUIRED
|
2003-10-31 05:02:51 +01:00
|
|
|
// workaround for msvc-bug.
|
|
|
|
// assumes sizeof(map<string, char>) == sizeof(map<string, entry>)
|
2004-03-30 01:25:13 +02:00
|
|
|
// and sizeof(list<char>) == sizeof(list<entry>)
|
2010-06-06 02:47:39 +02:00
|
|
|
enum { union_size
|
|
|
|
= max4<sizeof(std::list<char>)
|
2010-04-02 05:57:06 +02:00
|
|
|
, sizeof(std::map<std::string, char>)
|
|
|
|
, sizeof(string_type)
|
2010-06-06 02:47:39 +02:00
|
|
|
, sizeof(integer_type)>::value
|
|
|
|
};
|
2003-10-23 01:00:57 +02:00
|
|
|
#else
|
2010-06-06 02:47:39 +02:00
|
|
|
enum { union_size
|
|
|
|
= max4<sizeof(list_type)
|
2010-04-02 05:57:06 +02:00
|
|
|
, sizeof(dictionary_type)
|
|
|
|
, sizeof(string_type)
|
2010-06-06 02:47:39 +02:00
|
|
|
, sizeof(integer_type)>::value
|
|
|
|
};
|
2008-01-03 04:10:25 +01:00
|
|
|
#endif
|
2010-06-06 03:39:05 +02:00
|
|
|
integer_type data[(union_size + sizeof(integer_type) - 1)
|
2010-06-06 02:47:39 +02:00
|
|
|
/ sizeof(integer_type)];
|
2013-11-17 21:37:55 +01:00
|
|
|
|
2014-02-28 05:02:48 +01:00
|
|
|
// the bitfield is used so that the m_type_queried field still fits, so
|
|
|
|
// that the ABI is the same for debug builds and release builds. It
|
|
|
|
// appears to be very hard to match debug builds with debug versions of
|
|
|
|
// libtorrent
|
2013-11-17 21:37:55 +01:00
|
|
|
boost::uint8_t m_type:7;
|
|
|
|
|
|
|
|
public:
|
2014-02-28 05:02:48 +01:00
|
|
|
// in debug mode this is set to false by bdecode to indicate that the
|
|
|
|
// program has not yet queried the type of this entry, and sould not
|
|
|
|
// assume that it has a certain type. This is asserted in the accessor
|
|
|
|
// functions. This does not apply if exceptions are used.
|
2013-11-17 21:37:55 +01:00
|
|
|
mutable boost::uint8_t m_type_queried:1;
|
2003-10-23 01:00:57 +02:00
|
|
|
};
|
|
|
|
|
2013-12-19 09:30:17 +01:00
|
|
|
#if TORRENT_USE_IOSTREAM
|
2014-02-02 04:05:55 +01:00
|
|
|
// prints the bencoded structure to the ostream as a JSON-style structure.
|
2003-10-23 01:00:57 +02:00
|
|
|
inline std::ostream& operator<<(std::ostream& os, const entry& e)
|
|
|
|
{
|
2013-12-19 09:30:17 +01:00
|
|
|
os << e.to_string();
|
2003-10-23 01:00:57 +02:00
|
|
|
return os;
|
|
|
|
}
|
2009-04-04 23:44:04 +02:00
|
|
|
#endif
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2009-02-23 02:21:19 +01:00
|
|
|
#ifndef BOOST_NO_EXCEPTIONS
|
2013-07-21 23:23:21 +02:00
|
|
|
// internal
|
2015-04-19 08:28:21 +02:00
|
|
|
BOOST_NORETURN inline void throw_type_error()
|
2009-02-23 02:21:19 +01:00
|
|
|
{
|
|
|
|
throw libtorrent_exception(error_code(errors::invalid_entry_type
|
2009-11-29 08:06:38 +01:00
|
|
|
, get_libtorrent_category()));
|
2009-02-23 02:21:19 +01:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2003-10-23 01:00:57 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
#endif // TORRENT_ENTRY_HPP_INCLUDED
|
2008-11-29 22:33:21 +01:00
|
|
|
|