2022-04-22 02:12:14 +01:00
|
|
|
// SPDX-License-Identifier: GPL-3.0-only
|
|
|
|
/*
|
2023-04-03 03:40:32 +01:00
|
|
|
* Prism Launcher - 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>
|
2023-04-03 03:40:32 +01:00
|
|
|
* Copyright (C) 2023 Rachel Powers <508861+Ryex@users.noreply.github.com>
|
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"
|
2023-07-14 20:26:22 +01:00
|
|
|
#include "Application.h"
|
|
|
|
|
|
|
|
NetJob::NetJob(QString job_name, shared_qobject_ptr<QNetworkAccessManager> network)
|
|
|
|
: ConcurrentTask(nullptr, job_name, APPLICATION->settings()->get("NumberOfConcurrentDownloads").toInt()), m_network(network)
|
|
|
|
{}
|
2013-07-06 00:50:07 +01:00
|
|
|
|
2022-04-22 02:12:14 +01:00
|
|
|
auto NetJob::addNetAction(NetAction::Ptr action) -> bool
|
|
|
|
{
|
2022-07-22 04:30:27 +01:00
|
|
|
action->setNetwork(m_network);
|
2022-04-22 02:12:14 +01:00
|
|
|
|
2022-11-25 12:23:46 +00:00
|
|
|
addTask(action);
|
|
|
|
|
2022-04-22 02:12:14 +01:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2022-07-22 04:30:27 +01:00
|
|
|
void NetJob::startNext()
|
|
|
|
{
|
|
|
|
if (m_queue.isEmpty() && m_doing.isEmpty()) {
|
|
|
|
// We're finished, check for failures and retry if we can (up to 3 times)
|
|
|
|
if (!m_failed.isEmpty() && m_try < 3) {
|
|
|
|
m_try += 1;
|
|
|
|
while (!m_failed.isEmpty())
|
|
|
|
m_queue.enqueue(m_failed.take(*m_failed.keyBegin()));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ConcurrentTask::startNext();
|
|
|
|
}
|
|
|
|
|
|
|
|
auto NetJob::size() const -> int
|
|
|
|
{
|
|
|
|
return m_queue.size() + m_doing.size() + m_done.size();
|
|
|
|
}
|
|
|
|
|
2022-04-22 02:12:14 +01:00
|
|
|
auto NetJob::canAbort() const -> bool
|
|
|
|
{
|
|
|
|
bool canFullyAbort = true;
|
|
|
|
|
|
|
|
// can abort the downloads on the queue?
|
2022-07-22 04:30:27 +01:00
|
|
|
for (auto part : m_queue)
|
2022-04-22 02:12:14 +01:00
|
|
|
canFullyAbort &= part->canAbort();
|
2022-07-22 04:30:27 +01:00
|
|
|
|
2022-04-22 02:12:14 +01:00
|
|
|
// can abort the active downloads?
|
2022-07-22 04:30:27 +01:00
|
|
|
for (auto part : m_doing)
|
2022-04-22 02:12:14 +01:00
|
|
|
canFullyAbort &= part->canAbort();
|
|
|
|
|
|
|
|
return canFullyAbort;
|
|
|
|
}
|
|
|
|
|
|
|
|
auto NetJob::abort() -> bool
|
|
|
|
{
|
|
|
|
bool fullyAborted = true;
|
|
|
|
|
|
|
|
// fail all downloads on the queue
|
2022-07-22 04:30:27 +01:00
|
|
|
for (auto task : m_queue)
|
|
|
|
m_failed.insert(task.get(), task);
|
|
|
|
m_queue.clear();
|
2022-04-22 02:12:14 +01:00
|
|
|
|
|
|
|
// abort active downloads
|
2022-05-02 20:34:55 +01:00
|
|
|
auto toKill = m_doing.values();
|
2022-07-22 04:30:27 +01:00
|
|
|
for (auto part : toKill) {
|
2022-04-22 02:12:14 +01:00
|
|
|
fullyAborted &= part->abort();
|
|
|
|
}
|
|
|
|
|
2022-09-10 13:10:16 +01:00
|
|
|
if (fullyAborted)
|
|
|
|
emitAborted();
|
|
|
|
else
|
|
|
|
emitFailed(tr("Failed to abort all tasks in the NetJob!"));
|
|
|
|
|
2022-04-22 02:12:14 +01:00
|
|
|
return fullyAborted;
|
|
|
|
}
|
2013-09-17 23:00:35 +01:00
|
|
|
|
2022-07-22 04:30:27 +01:00
|
|
|
auto NetJob::getFailedActions() -> QList<NetAction*>
|
2013-09-01 23:25:40 +01:00
|
|
|
{
|
2022-07-22 04:30:27 +01:00
|
|
|
QList<NetAction*> failed;
|
|
|
|
for (auto index : m_failed) {
|
|
|
|
failed.push_back(dynamic_cast<NetAction*>(index.get()));
|
2013-09-01 23:25:40 +01:00
|
|
|
}
|
2022-07-22 04:30:27 +01:00
|
|
|
return failed;
|
2016-08-14 01:33:31 +01:00
|
|
|
}
|
|
|
|
|
2022-07-22 04:30:27 +01:00
|
|
|
auto NetJob::getFailedFiles() -> QList<QString>
|
2013-09-01 23:25:40 +01:00
|
|
|
{
|
2022-07-22 04:30:27 +01:00
|
|
|
QList<QString> failed;
|
|
|
|
for (auto index : m_failed) {
|
|
|
|
failed.append(static_cast<NetAction*>(index.get())->url().toString());
|
2017-07-06 14:38:16 +01:00
|
|
|
}
|
2022-07-22 04:30:27 +01:00
|
|
|
return failed;
|
2013-09-01 23:25:40 +01:00
|
|
|
}
|
|
|
|
|
2022-07-22 04:30:27 +01:00
|
|
|
void NetJob::updateState()
|
2015-01-11 21:04:31 +00:00
|
|
|
{
|
2022-12-17 15:55:03 +00:00
|
|
|
emit progress(m_done.count(), totalSize());
|
2022-07-22 04:30:27 +01:00
|
|
|
setStatus(tr("Executing %1 task(s) (%2 out of %3 are done)")
|
2022-12-17 15:55:03 +00:00
|
|
|
.arg(QString::number(m_doing.count()), QString::number(m_done.count()), QString::number(totalSize())));
|
2017-06-26 00:14:32 +01:00
|
|
|
}
|