133 lines
4.1 KiB
C++
133 lines
4.1 KiB
C++
/*
|
|
|
|
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 <iostream>
|
|
#include <fstream>
|
|
#include <iterator>
|
|
#include <iomanip>
|
|
|
|
#include "libtorrent/entry.hpp"
|
|
#include "libtorrent/bencode.hpp"
|
|
#include "libtorrent/torrent_info.hpp"
|
|
#include "libtorrent/lazy_entry.hpp"
|
|
#include "libtorrent/magnet_uri.hpp"
|
|
|
|
|
|
int main(int argc, char* argv[])
|
|
{
|
|
using namespace libtorrent;
|
|
|
|
if (argc != 2)
|
|
{
|
|
std::cerr << "usage: dump_torrent torrent-file\n";
|
|
return 1;
|
|
}
|
|
|
|
int size = file_size(argv[1]);
|
|
if (size > 10 * 1000000)
|
|
{
|
|
std::cerr << "file too big (" << size << "), aborting\n";
|
|
return 1;
|
|
}
|
|
std::vector<char> buf(size);
|
|
std::ifstream(argv[1], std::ios_base::binary).read(&buf[0], size);
|
|
lazy_entry e;
|
|
int ret = lazy_bdecode(&buf[0], &buf[0] + buf.size(), e);
|
|
|
|
if (ret != 0)
|
|
{
|
|
std::cerr << "invalid bencoding: " << ret << std::endl;
|
|
return 1;
|
|
}
|
|
|
|
std::cout << "\n\n----- raw info -----\n\n";
|
|
std::cout << print_entry(e) << std::endl;
|
|
|
|
error_code ec;
|
|
torrent_info t(e, ec);
|
|
if (ec)
|
|
{
|
|
std::cout << ec.message() << std::endl;
|
|
return 1;
|
|
}
|
|
|
|
// print info about torrent
|
|
std::cout << "\n\n----- torrent file info -----\n\n";
|
|
std::cout << "nodes:\n";
|
|
typedef std::vector<std::pair<std::string, int> > node_vec;
|
|
node_vec const& nodes = t.nodes();
|
|
for (node_vec::const_iterator i = nodes.begin(), end(nodes.end());
|
|
i != end; ++i)
|
|
{
|
|
std::cout << i->first << ":" << i->second << "\n";
|
|
}
|
|
std::cout << "trackers:\n";
|
|
for (std::vector<announce_entry>::const_iterator i = t.trackers().begin();
|
|
i != t.trackers().end(); ++i)
|
|
{
|
|
std::cout << i->tier << ": " << i->url << "\n";
|
|
}
|
|
|
|
std::cout << "number of pieces: " << t.num_pieces() << "\n";
|
|
std::cout << "piece length: " << t.piece_length() << "\n";
|
|
char ih[41];
|
|
to_hex((char const*)&t.info_hash()[0], 20, ih);
|
|
std::cout << "info hash: " << ih << "\n";
|
|
std::cout << "comment: " << t.comment() << "\n";
|
|
std::cout << "created by: " << t.creator() << "\n";
|
|
std::cout << "magnet link: " << make_magnet_uri(t) << "\n";
|
|
std::cout << "name: " << t.name() << "\n";
|
|
std::cout << "files:\n";
|
|
int index = 0;
|
|
for (torrent_info::file_iterator i = t.begin_files();
|
|
i != t.end_files(); ++i, ++index)
|
|
{
|
|
int first = t.map_file(index, 0, 0).piece;
|
|
int last = t.map_file(index, (std::max)(i->size-1, size_type(0)), 0).piece;
|
|
std::cout << " " << std::setw(11) << i->size
|
|
<< " "
|
|
<< (i->pad_file?'p':'-')
|
|
<< (i->executable_attribute?'x':'-')
|
|
<< (i->hidden_attribute?'h':'-')
|
|
<< (i->symlink_attribute?'l':'-')
|
|
<< " "
|
|
<< "[ " << std::setw(4) << first << ", " << std::setw(4) << last << " ]\t"
|
|
<< i->path;
|
|
if (i->symlink_attribute)
|
|
std::cout << " -> " << i->symlink_path;
|
|
std::cout << std::endl;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|