1
0
mirror of https://github.com/d47081/qBittorrent.git synced 2025-01-16 01:30:09 +00:00
qBittorrent/src/base/bittorrent/trackerentry.cpp

162 lines
4.7 KiB
C++
Raw Normal View History

2015-04-19 18:17:47 +03:00
/*
* Bittorrent Client using Qt and libtorrent.
* Copyright (C) 2015 Vladimir Golovnev <glassez@yandex.ru>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* In addition, as a special exception, the copyright holders give permission to
* link this program with the OpenSSL project's "OpenSSL" library (or with
* modified versions of it that use the same license as the "OpenSSL" library),
* and distribute the linked executables. You must obey the GNU General Public
* License in all respects for all of the code used other than "OpenSSL". If you
* modify file(s), you may extend this exception to your version of the file(s),
* but you are not obligated to do so. If you do not wish to do so, delete this
* exception statement from your version.
*/
2018-06-14 14:46:50 +03:00
#include "trackerentry.h"
#include <algorithm>
#include <libtorrent/version.hpp>
2015-04-19 18:17:47 +03:00
#include <QString>
#include <QUrl>
2015-04-19 18:17:47 +03:00
using namespace BitTorrent;
TrackerEntry::TrackerEntry(const QString &url)
: m_nativeEntry(url.toStdString())
2015-04-19 18:17:47 +03:00
{
}
TrackerEntry::TrackerEntry(const lt::announce_entry &nativeEntry)
2015-04-19 18:17:47 +03:00
: m_nativeEntry(nativeEntry)
{
}
QString TrackerEntry::url() const
{
return QString::fromStdString(nativeEntry().url);
2015-04-19 18:17:47 +03:00
}
bool TrackerEntry::isWorking() const
{
#if (LIBTORRENT_VERSION_NUM < 10200)
return nativeEntry().is_working();
#else
const auto &endpoints = nativeEntry().endpoints;
return std::any_of(endpoints.begin(), endpoints.end()
, [](const lt::announce_endpoint &endpoint)
{
return endpoint.is_working();
});
#endif
}
2015-04-19 18:17:47 +03:00
int TrackerEntry::tier() const
{
return nativeEntry().tier;
2015-04-19 18:17:47 +03:00
}
TrackerEntry::Status TrackerEntry::status() const
{
// lt::announce_entry::is_working() returns
2015-11-04 23:37:35 +02:00
// true when the tracker hasn't been tried yet.
if (nativeEntry().verified && isWorking())
2015-04-19 18:17:47 +03:00
return Working;
#if (LIBTORRENT_VERSION_NUM < 10200)
if ((nativeEntry().fails == 0) && nativeEntry().updating)
return Updating;
if (nativeEntry().fails == 0)
return NotContacted;
#else
const auto &endpoints = nativeEntry().endpoints;
const bool allFailed = std::all_of(endpoints.begin(), endpoints.end()
, [](const lt::announce_endpoint &endpoint)
{
return (endpoint.fails > 0);
});
const bool updating = std::any_of(endpoints.begin(), endpoints.end()
, [](const lt::announce_endpoint &endpoint)
{
return endpoint.updating;
});
if (!allFailed && updating)
2015-04-19 18:17:47 +03:00
return Updating;
if (!allFailed)
2015-04-19 18:17:47 +03:00
return NotContacted;
#endif
2019-02-12 20:05:01 +02:00
return NotWorking;
2015-04-19 18:17:47 +03:00
}
void TrackerEntry::setTier(const int value)
2015-04-19 18:17:47 +03:00
{
m_nativeEntry.tier = value;
}
int TrackerEntry::numSeeds() const
{
#if (LIBTORRENT_VERSION_NUM < 10200)
return nativeEntry().scrape_complete;
#else
int max = -1;
return nativeEntry().endpoints.empty() ? -1 : nativeEntry().endpoints[0].scrape_incomplete;
for (const lt::announce_endpoint &endpoint : nativeEntry().endpoints)
max = std::max(max, endpoint.scrape_complete);
return max;
#endif
}
int TrackerEntry::numLeeches() const
{
#if (LIBTORRENT_VERSION_NUM < 10200)
return nativeEntry().scrape_incomplete;
#else
int max = -1;
return nativeEntry().endpoints.empty() ? -1 : nativeEntry().endpoints[0].scrape_incomplete;
for (const lt::announce_endpoint &endpoint : nativeEntry().endpoints)
max = std::max(max, endpoint.scrape_incomplete);
return max;
#endif
}
int TrackerEntry::numDownloaded() const
{
#if (LIBTORRENT_VERSION_NUM < 10200)
return nativeEntry().scrape_downloaded;
#else
int max = -1;
return nativeEntry().endpoints.empty() ? -1 : nativeEntry().endpoints[0].scrape_incomplete;
for (const lt::announce_endpoint &endpoint : nativeEntry().endpoints)
max = std::max(max, endpoint.scrape_downloaded);
return max;
#endif
}
const lt::announce_entry &TrackerEntry::nativeEntry() const
2015-04-19 18:17:47 +03:00
{
return m_nativeEntry;
2015-04-19 18:17:47 +03:00
}
bool BitTorrent::operator==(const TrackerEntry &left, const TrackerEntry &right)
2015-04-19 18:17:47 +03:00
{
return (QUrl(left.url()) == QUrl(right.url()));
2015-04-19 18:17:47 +03:00
}