transmission/qt/TorrentModel.cc

487 lines
11 KiB
C++

/*
* This file Copyright (C) 2009-2015 Mnemosyne LLC
*
* It may be used under the GNU GPL versions 2 or 3
* or any future license endorsed by Mnemosyne LLC.
*
*/
#include <algorithm>
#include <iostream>
#include <utility>
#include <libtransmission/transmission.h>
#include <libtransmission/variant.h>
#include "Speed.h"
#include "Torrent.h"
#include "TorrentDelegate.h"
#include "TorrentModel.h"
/***
****
***/
namespace
{
struct TorrentIdLessThan
{
bool operator ()(Torrent* left, Torrent* right) const
{
return left->id() < right->id();
}
bool operator ()(int leftId, Torrent* right) const
{
return leftId < right->id();
}
bool operator ()(Torrent* left, int rightId) const
{
return left->id() < rightId;
}
};
template<typename Iter>
auto getIds(Iter it, Iter end)
{
torrent_ids_t ids;
for ( ; it != end; ++it)
{
ids.insert((*it)->id());
}
return ids;
}
} // namespace
/***
****
***/
TorrentModel::TorrentModel(Prefs const& prefs) :
myPrefs(prefs)
{
}
TorrentModel::~TorrentModel()
{
clear();
}
void TorrentModel::clear()
{
beginResetModel();
qDeleteAll(myTorrents);
myTorrents.clear();
endResetModel();
}
int TorrentModel::rowCount(QModelIndex const& parent) const
{
Q_UNUSED(parent)
return myTorrents.size();
}
QVariant TorrentModel::data(QModelIndex const& index, int role) const
{
QVariant var;
Torrent const* t = myTorrents.value(index.row(), nullptr);
if (t != nullptr)
{
switch (role)
{
case Qt::DisplayRole:
var.setValue(t->name());
break;
case Qt::DecorationRole:
var.setValue(t->getMimeTypeIcon());
break;
case TorrentRole:
var = qVariantFromValue(t);
break;
default:
// std::cerr << "Unhandled role: " << role << std::endl;
break;
}
}
return var;
}
/***
****
***/
void TorrentModel::removeTorrents(tr_variant* list)
{
torrents_t torrents;
torrents.reserve(tr_variantListSize(list));
int i = 0;
tr_variant* child;
while ((child = tr_variantListChild(list, i++)) != nullptr)
{
int64_t id;
Torrent* torrent = nullptr;
if (tr_variantGetInt(child, &id))
{
torrent = getTorrentFromId(id);
}
if (torrent != nullptr)
{
torrents.push_back(torrent);
}
}
if (!torrents.empty())
{
rowsRemove(torrents);
}
}
void TorrentModel::updateTorrents(tr_variant* torrents, bool isCompleteList)
{
auto const old = isCompleteList ? myTorrents : torrents_t{};
auto added = torrent_ids_t{};
auto changed = torrent_ids_t{};
auto completed = torrent_ids_t{};
auto instantiated = torrents_t{};
auto needinfo = torrent_ids_t{};
auto processed = torrents_t{};
auto const now = time(nullptr);
auto const recently_added = [now](auto const& tor)
{
static auto constexpr max_age = 60;
auto const date = tor->dateAdded();
return (date != 0) && (difftime(now, date) < max_age);
};
// build a list of the property keys
tr_variant* const firstChild = tr_variantListChild(torrents, 0);
bool const table = tr_variantIsList(firstChild);
std::vector<tr_quark> keys;
if (table)
{
// In 'table' format, the first entry in 'torrents' is an array of keys.
// All the other entries are an array of the values for one torrent.
char const* str;
size_t len;
size_t i = 0;
keys.reserve(tr_variantListSize(firstChild));
while (tr_variantGetStr(tr_variantListChild(firstChild, i++), &str, &len))
{
keys.push_back(tr_quark_new(str, len));
}
}
else
{
// In 'object' format, every entry is an object with the same set of properties
size_t i = 0;
tr_quark key;
tr_variant* value;
while (firstChild && tr_variantDictChild(firstChild, i++, &key, &value))
{
keys.push_back(key);
}
}
// Find the position of TR_KEY_id so we can do torrent lookup
auto const id_it = std::find(std::begin(keys), std::end(keys), TR_KEY_id);
if (id_it == std::end(keys)) // no ids provided; we can't proceed
{
return;
}
auto const id_pos = std::distance(std::begin(keys), id_it);
// Loop through the torrent records...
std::vector<tr_variant*> values;
values.reserve(keys.size());
size_t tor_index = table ? 1 : 0;
tr_variant* v;
processed.reserve(tr_variantListSize(torrents));
while ((v = tr_variantListChild(torrents, tor_index++)))
{
// Build an array of values
values.clear();
if (table)
{
// In table mode, v is already a list of values
size_t i = 0;
tr_variant* val;
while ((val = tr_variantListChild(v, i++)))
{
values.push_back(val);
}
}
else
{
// In object mode, v is an object of torrent property key/vals
size_t i = 0;
tr_quark key;
tr_variant* value;
while (tr_variantDictChild(v, i++, &key, &value))
{
values.push_back(value);
}
}
// Find the torrent id
int64_t id;
if (!tr_variantGetInt(values[id_pos], &id))
{
continue;
}
Torrent* tor = getTorrentFromId(id);
std::optional<uint64_t> leftUntilDone;
bool is_new = false;
if (tor == nullptr)
{
tor = new Torrent(myPrefs, id);
instantiated.push_back(tor);
is_new = true;
}
else
{
leftUntilDone = tor->leftUntilDone();
}
if (tor->update(keys.data(), values.data(), keys.size()))
{
changed.insert(id);
}
if (is_new && !tor->hasName())
{
needinfo.insert(id);
}
if (recently_added(tor) && tor->hasName() && !myAlreadyAdded.count(id))
{
added.insert(id);
myAlreadyAdded.insert(id);
}
if (leftUntilDone && (*leftUntilDone > 0) && (tor->leftUntilDone() == 0) && (tor->downloadedEver() > 0))
{
completed.insert(id);
}
processed.push_back(tor);
}
// model upkeep
if (!instantiated.empty())
{
rowsAdd(instantiated);
}
if (!changed.empty())
{
rowsEmitChanged(changed);
}
// emit signals
if (!added.empty())
{
emit torrentsAdded(added);
}
if (!needinfo.empty())
{
emit torrentsNeedInfo(needinfo);
}
if (!changed.empty())
{
emit torrentsChanged(changed);
}
if (!completed.empty())
{
emit torrentsCompleted(completed);
}
// model upkeep
if (isCompleteList)
{
std::sort(processed.begin(), processed.end(), TorrentIdLessThan());
torrents_t removed;
removed.reserve(old.size());
std::set_difference(old.begin(), old.end(), processed.begin(), processed.end(), std::back_inserter(removed));
rowsRemove(removed);
}
}
/***
****
***/
std::optional<int> TorrentModel::getRow(int id) const
{
std::optional<int> row;
auto const it = std::equal_range(myTorrents.begin(), myTorrents.end(), id, TorrentIdLessThan());
if (it.first != it.second)
{
row = std::distance(myTorrents.begin(), it.first);
assert(myTorrents[*row]->id() == id);
}
return row;
}
std::optional<int> TorrentModel::getRow(Torrent const* tor) const
{
return getRow(tor->id());
}
Torrent* TorrentModel::getTorrentFromId(int id)
{
auto const row = getRow(id);
return row ? myTorrents[*row] : nullptr;
}
Torrent const* TorrentModel::getTorrentFromId(int id) const
{
auto const row = getRow(id);
return row ? myTorrents[*row] : nullptr;
}
/***
****
***/
std::vector<TorrentModel::span_t> TorrentModel::getSpans(torrent_ids_t const& ids) const
{
// ids -> rows
std::vector<int> rows;
rows.reserve(ids.size());
for (auto const& id : ids)
{
auto const row = getRow(id);
if (row)
{
rows.push_back(*row);
}
}
std::sort(rows.begin(), rows.end());
// rows -> spans
std::vector<span_t> spans;
spans.reserve(rows.size());
span_t span;
bool in_span = false;
for (auto const& row : rows)
{
if (in_span)
{
if (span.second + 1 == row)
{
span.second = row;
}
else
{
spans.push_back(span);
in_span = false;
}
}
if (!in_span)
{
span.first = span.second = row;
in_span = true;
}
}
if (in_span)
{
spans.push_back(span);
}
return spans;
}
/***
****
***/
void TorrentModel::rowsEmitChanged(torrent_ids_t const& ids)
{
for (auto const& span : getSpans(ids))
{
emit dataChanged(index(span.first), index(span.second));
}
}
void TorrentModel::rowsAdd(torrents_t const& torrents)
{
auto const compare = TorrentIdLessThan();
if (myTorrents.empty())
{
beginInsertRows(QModelIndex(), 0, torrents.size() - 1);
myTorrents = torrents;
std::sort(myTorrents.begin(), myTorrents.end(), TorrentIdLessThan());
endInsertRows();
}
else
{
for (auto const& tor : torrents)
{
auto const it = std::lower_bound(myTorrents.begin(), myTorrents.end(), tor, compare);
auto const row = std::distance(myTorrents.begin(), it);
beginInsertRows(QModelIndex(), row, row);
myTorrents.insert(it, tor);
endInsertRows();
}
}
}
void TorrentModel::rowsRemove(torrents_t const& torrents)
{
// must walk in reverse to avoid invalidating row numbers
auto const& spans = getSpans(getIds(torrents.begin(), torrents.end()));
for (auto it = spans.rbegin(), end = spans.rend(); it != end; ++it)
{
auto const& span = *it;
beginRemoveRows(QModelIndex(), span.first, span.second);
auto const n = span.second + 1 - span.first;
myTorrents.remove(span.first, n);
endRemoveRows();
}
qDeleteAll(torrents);
}
/***
****
***/
bool TorrentModel::hasTorrent(QString const& hashString) const
{
auto test = [hashString](auto const& tor) { return tor->hashString() == hashString; };
return std::any_of(myTorrents.cbegin(), myTorrents.cend(), test);
}