2022-04-22 02:12:14 +01:00
|
|
|
// SPDX-License-Identifier: GPL-3.0-only
|
|
|
|
/*
|
|
|
|
* PolyMC - Minecraft Launcher
|
2022-05-02 16:56:24 +01:00
|
|
|
* Copyright (c) 2022 flowln <flowlnlnln@gmail.com>
|
2022-05-26 22:18:54 +01:00
|
|
|
* Copyright (C) 2022 Sefa Eyeoglu <contact@scrumplex.net>
|
2013-11-04 01:53:05 +00:00
|
|
|
*
|
2022-04-22 02:12:14 +01:00
|
|
|
* 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, version 3.
|
2013-11-04 01:53:05 +00:00
|
|
|
*
|
2022-04-22 02:12:14 +01:00
|
|
|
* 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.
|
2013-11-04 01:53:05 +00:00
|
|
|
*
|
2022-04-22 02:12:14 +01:00
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
|
|
|
*
|
|
|
|
* This file incorporates work covered by the following copyright and
|
|
|
|
* permission notice:
|
|
|
|
*
|
|
|
|
* Copyright 2013-2021 MultiMC Contributors
|
|
|
|
*
|
|
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
* you may not use this file except in compliance with the License.
|
|
|
|
* You may obtain a copy of the License at
|
|
|
|
*
|
|
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
*
|
|
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
* See the License for the specific language governing permissions and
|
|
|
|
* limitations under the License.
|
2013-11-04 01:53:05 +00:00
|
|
|
*/
|
|
|
|
|
2013-10-26 18:55:48 +01:00
|
|
|
#include "NetJob.h"
|
2016-05-28 18:54:17 +01:00
|
|
|
#include "Download.h"
|
2013-07-06 00:50:07 +01:00
|
|
|
|
2022-04-22 02:12:14 +01:00
|
|
|
auto NetJob::addNetAction(NetAction::Ptr action) -> bool
|
|
|
|
{
|
|
|
|
action->m_index_within_job = m_downloads.size();
|
|
|
|
m_downloads.append(action);
|
|
|
|
part_info pi;
|
|
|
|
m_parts_progress.append(pi);
|
|
|
|
|
|
|
|
partProgress(m_parts_progress.count() - 1, action->getProgress(), action->getTotalProgress());
|
|
|
|
|
|
|
|
if (action->isRunning()) {
|
2022-04-27 01:25:42 +01:00
|
|
|
connect(action.get(), &NetAction::succeeded, [this, action]{ partSucceeded(action->index()); });
|
|
|
|
connect(action.get(), &NetAction::failed, [this, action](QString){ partFailed(action->index()); });
|
2022-05-01 15:05:31 +01:00
|
|
|
connect(action.get(), &NetAction::aborted, [this, action](){ partAborted(action->index()); });
|
2022-04-27 01:25:42 +01:00
|
|
|
connect(action.get(), &NetAction::progress, [this, action](qint64 done, qint64 total) { partProgress(action->index(), done, total); });
|
2022-05-01 15:05:31 +01:00
|
|
|
connect(action.get(), &NetAction::status, this, &NetJob::status);
|
2022-04-22 02:12:14 +01:00
|
|
|
} else {
|
|
|
|
m_todo.append(m_parts_progress.size() - 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
auto NetJob::canAbort() const -> bool
|
|
|
|
{
|
|
|
|
bool canFullyAbort = true;
|
|
|
|
|
|
|
|
// can abort the downloads on the queue?
|
|
|
|
for (auto index : m_todo) {
|
|
|
|
auto part = m_downloads[index];
|
|
|
|
canFullyAbort &= part->canAbort();
|
|
|
|
}
|
|
|
|
// can abort the active downloads?
|
|
|
|
for (auto index : m_doing) {
|
|
|
|
auto part = m_downloads[index];
|
|
|
|
canFullyAbort &= part->canAbort();
|
|
|
|
}
|
|
|
|
|
|
|
|
return canFullyAbort;
|
|
|
|
}
|
|
|
|
|
|
|
|
void NetJob::executeTask()
|
|
|
|
{
|
|
|
|
// hack that delays early failures so they can be caught easier
|
|
|
|
QMetaObject::invokeMethod(this, "startMoreParts", Qt::QueuedConnection);
|
|
|
|
}
|
|
|
|
|
|
|
|
auto NetJob::getFailedFiles() -> QStringList
|
|
|
|
{
|
|
|
|
QStringList failed;
|
|
|
|
for (auto index : m_failed) {
|
|
|
|
failed.push_back(m_downloads[index]->url().toString());
|
|
|
|
}
|
|
|
|
failed.sort();
|
|
|
|
return failed;
|
|
|
|
}
|
|
|
|
|
|
|
|
auto NetJob::abort() -> bool
|
|
|
|
{
|
|
|
|
bool fullyAborted = true;
|
|
|
|
|
|
|
|
// fail all downloads on the queue
|
2022-05-02 18:10:45 +01:00
|
|
|
#if QT_VERSION >= QT_VERSION_CHECK(5, 14, 0)
|
|
|
|
QSet<int> todoSet(m_todo.begin(), m_todo.end());
|
|
|
|
m_failed.unite(todoSet);
|
|
|
|
#else
|
2022-04-22 02:12:14 +01:00
|
|
|
m_failed.unite(m_todo.toSet());
|
2022-05-02 18:10:45 +01:00
|
|
|
#endif
|
2022-04-22 02:12:14 +01:00
|
|
|
m_todo.clear();
|
|
|
|
|
|
|
|
// abort active downloads
|
2022-05-02 20:34:55 +01:00
|
|
|
auto toKill = m_doing.values();
|
2022-04-22 02:12:14 +01:00
|
|
|
for (auto index : toKill) {
|
|
|
|
auto part = m_downloads[index];
|
|
|
|
fullyAborted &= part->abort();
|
|
|
|
}
|
|
|
|
|
|
|
|
return fullyAborted;
|
|
|
|
}
|
2013-09-17 23:00:35 +01:00
|
|
|
|
2017-05-03 22:11:52 +01:00
|
|
|
void NetJob::partSucceeded(int index)
|
2013-09-01 23:25:40 +01:00
|
|
|
{
|
2018-07-15 13:51:05 +01:00
|
|
|
// do progress. all slots are 1 in size at least
|
2022-04-22 02:12:14 +01:00
|
|
|
auto& slot = m_parts_progress[index];
|
2018-07-15 13:51:05 +01:00
|
|
|
partProgress(index, slot.total_progress, slot.total_progress);
|
|
|
|
|
|
|
|
m_doing.remove(index);
|
|
|
|
m_done.insert(index);
|
2022-04-22 02:12:14 +01:00
|
|
|
m_downloads[index].get()->disconnect(this);
|
|
|
|
|
2018-07-15 13:51:05 +01:00
|
|
|
startMoreParts();
|
2013-09-01 23:25:40 +01:00
|
|
|
}
|
|
|
|
|
2017-05-03 22:11:52 +01:00
|
|
|
void NetJob::partFailed(int index)
|
2013-09-01 23:25:40 +01:00
|
|
|
{
|
2018-07-15 13:51:05 +01:00
|
|
|
m_doing.remove(index);
|
2022-04-22 02:12:14 +01:00
|
|
|
|
|
|
|
auto& slot = m_parts_progress[index];
|
|
|
|
// Can try 3 times before failing by definitive
|
|
|
|
if (slot.failures == 3) {
|
2018-07-15 13:51:05 +01:00
|
|
|
m_failed.insert(index);
|
2022-04-22 02:12:14 +01:00
|
|
|
} else {
|
2018-07-15 13:51:05 +01:00
|
|
|
slot.failures++;
|
|
|
|
m_todo.enqueue(index);
|
|
|
|
}
|
2022-04-22 02:12:14 +01:00
|
|
|
|
|
|
|
m_downloads[index].get()->disconnect(this);
|
|
|
|
|
2018-07-15 13:51:05 +01:00
|
|
|
startMoreParts();
|
2013-09-01 23:25:40 +01:00
|
|
|
}
|
|
|
|
|
2017-05-03 22:11:52 +01:00
|
|
|
void NetJob::partAborted(int index)
|
2016-08-14 01:33:31 +01:00
|
|
|
{
|
2018-07-15 13:51:05 +01:00
|
|
|
m_aborted = true;
|
2022-04-22 02:12:14 +01:00
|
|
|
|
2018-07-15 13:51:05 +01:00
|
|
|
m_doing.remove(index);
|
|
|
|
m_failed.insert(index);
|
2022-04-22 02:12:14 +01:00
|
|
|
m_downloads[index].get()->disconnect(this);
|
|
|
|
|
2018-07-15 13:51:05 +01:00
|
|
|
startMoreParts();
|
2016-08-14 01:33:31 +01:00
|
|
|
}
|
|
|
|
|
2017-05-03 22:11:52 +01:00
|
|
|
void NetJob::partProgress(int index, qint64 bytesReceived, qint64 bytesTotal)
|
2013-09-01 23:25:40 +01:00
|
|
|
{
|
2022-04-22 02:12:14 +01:00
|
|
|
auto& slot = m_parts_progress[index];
|
2018-07-15 13:51:05 +01:00
|
|
|
slot.current_progress = bytesReceived;
|
|
|
|
slot.total_progress = bytesTotal;
|
|
|
|
|
|
|
|
int done = m_done.size();
|
|
|
|
int doing = m_doing.size();
|
2022-04-22 02:12:14 +01:00
|
|
|
int all = m_parts_progress.size();
|
2018-07-15 13:51:05 +01:00
|
|
|
|
|
|
|
qint64 bytesAll = 0;
|
|
|
|
qint64 bytesTotalAll = 0;
|
2022-04-22 02:12:14 +01:00
|
|
|
for (auto& partIdx : m_doing) {
|
|
|
|
auto part = m_parts_progress[partIdx];
|
2018-07-15 13:51:05 +01:00
|
|
|
// do not count parts with unknown/nonsensical total size
|
2022-04-22 02:12:14 +01:00
|
|
|
if (part.total_progress <= 0) {
|
2018-07-15 13:51:05 +01:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
bytesAll += part.current_progress;
|
|
|
|
bytesTotalAll += part.total_progress;
|
|
|
|
}
|
|
|
|
|
|
|
|
qint64 inprogress = (bytesTotalAll == 0) ? 0 : (bytesAll * 1000) / bytesTotalAll;
|
|
|
|
auto current = done * 1000 + doing * inprogress;
|
|
|
|
auto current_total = all * 1000;
|
|
|
|
// HACK: make sure it never jumps backwards.
|
|
|
|
// FAIL: This breaks if the size is not known (or is it something else?) and jumps to 1000, so if it is 1000 reset it to inprogress
|
2022-04-22 02:12:14 +01:00
|
|
|
if (m_current_progress == 1000) {
|
2018-07-15 13:51:05 +01:00
|
|
|
m_current_progress = inprogress;
|
|
|
|
}
|
2022-04-22 02:12:14 +01:00
|
|
|
if (m_current_progress > current) {
|
2018-07-15 13:51:05 +01:00
|
|
|
current = m_current_progress;
|
|
|
|
}
|
|
|
|
m_current_progress = current;
|
|
|
|
setProgress(current, current_total);
|
2013-09-01 23:25:40 +01:00
|
|
|
}
|
|
|
|
|
2015-01-11 21:04:31 +00:00
|
|
|
void NetJob::startMoreParts()
|
|
|
|
{
|
2022-04-22 02:12:14 +01:00
|
|
|
if (!isRunning()) {
|
|
|
|
// this actually makes sense. You can put running m_downloads into a NetJob and then not start it until much later.
|
2018-07-15 13:51:05 +01:00
|
|
|
return;
|
|
|
|
}
|
2022-04-22 02:12:14 +01:00
|
|
|
|
2018-07-15 13:51:05 +01:00
|
|
|
// OK. We are actively processing tasks, proceed.
|
|
|
|
// Check for final conditions if there's nothing in the queue.
|
2022-04-22 02:12:14 +01:00
|
|
|
if (!m_todo.size()) {
|
|
|
|
if (!m_doing.size()) {
|
|
|
|
if (!m_failed.size()) {
|
2018-07-15 13:51:05 +01:00
|
|
|
emitSucceeded();
|
2022-04-22 02:12:14 +01:00
|
|
|
} else if (m_aborted) {
|
2018-07-15 13:51:05 +01:00
|
|
|
emitAborted();
|
2022-04-22 02:12:14 +01:00
|
|
|
} else {
|
2018-07-15 13:51:05 +01:00
|
|
|
emitFailed(tr("Job '%1' failed to process:\n%2").arg(objectName()).arg(getFailedFiles().join("\n")));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
2022-04-22 02:12:14 +01:00
|
|
|
|
|
|
|
// There's work to do, try to start more parts, to a maximum of 6 concurrent ones.
|
|
|
|
while (m_doing.size() < 6) {
|
|
|
|
if (m_todo.size() == 0)
|
2018-07-15 13:51:05 +01:00
|
|
|
return;
|
|
|
|
int doThis = m_todo.dequeue();
|
|
|
|
m_doing.insert(doThis);
|
2016-08-14 01:33:31 +01:00
|
|
|
|
2022-04-22 02:12:14 +01:00
|
|
|
auto part = m_downloads[doThis];
|
2016-08-14 01:33:31 +01:00
|
|
|
|
2022-04-22 02:12:14 +01:00
|
|
|
// connect signals :D
|
2022-04-27 01:25:42 +01:00
|
|
|
connect(part.get(), &NetAction::succeeded, this, [this, part]{ partSucceeded(part->index()); });
|
|
|
|
connect(part.get(), &NetAction::failed, this, [this, part](QString){ partFailed(part->index()); });
|
|
|
|
connect(part.get(), &NetAction::aborted, this, [this, part]{ partAborted(part->index()); });
|
|
|
|
connect(part.get(), &NetAction::progress, this, [this, part](qint64 done, qint64 total) { partProgress(part->index(), done, total); });
|
2022-05-01 15:05:31 +01:00
|
|
|
connect(part.get(), &NetAction::status, this, &NetJob::status);
|
2017-06-26 00:14:32 +01:00
|
|
|
|
2022-04-22 02:12:14 +01:00
|
|
|
part->startAction(m_network);
|
2018-07-15 13:51:05 +01:00
|
|
|
}
|
2017-06-26 00:14:32 +01:00
|
|
|
}
|