2018-02-11 05:10:01 +05:30
|
|
|
/* Copyright 2013-2018 MultiMC Contributors
|
2013-11-04 07:23:05 +05:30
|
|
|
*
|
|
|
|
* 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-10-26 23:25:48 +05:30
|
|
|
#include "NetJob.h"
|
2016-05-28 23:24:17 +05:30
|
|
|
#include "Download.h"
|
2013-07-06 05:20:07 +05:30
|
|
|
|
2015-02-02 06:44:14 +05:30
|
|
|
#include <QDebug>
|
2013-09-18 03:30:35 +05:30
|
|
|
|
2017-05-04 02:41:52 +05:30
|
|
|
void NetJob::partSucceeded(int index)
|
2013-09-02 03:55:40 +05:30
|
|
|
{
|
2013-09-10 04:04:34 +05:30
|
|
|
// do progress. all slots are 1 in size at least
|
2017-05-04 02:41:52 +05:30
|
|
|
auto &slot = parts_progress[index];
|
|
|
|
partProgress(index, slot.total_progress, slot.total_progress);
|
2013-09-26 06:28:09 +05:30
|
|
|
|
2015-01-12 02:34:31 +05:30
|
|
|
m_doing.remove(index);
|
|
|
|
m_done.insert(index);
|
2017-05-04 02:41:52 +05:30
|
|
|
downloads[index].get()->disconnect(this);
|
2015-01-12 02:34:31 +05:30
|
|
|
startMoreParts();
|
2013-09-02 03:55:40 +05:30
|
|
|
}
|
|
|
|
|
2017-05-04 02:41:52 +05:30
|
|
|
void NetJob::partFailed(int index)
|
2013-09-02 03:55:40 +05:30
|
|
|
{
|
2015-01-12 02:34:31 +05:30
|
|
|
m_doing.remove(index);
|
2017-05-04 02:41:52 +05:30
|
|
|
auto &slot = parts_progress[index];
|
2013-09-26 06:28:09 +05:30
|
|
|
if (slot.failures == 3)
|
2013-09-02 03:55:40 +05:30
|
|
|
{
|
2015-01-12 02:34:31 +05:30
|
|
|
m_failed.insert(index);
|
2013-09-26 06:28:09 +05:30
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
slot.failures++;
|
2015-01-12 02:34:31 +05:30
|
|
|
m_todo.enqueue(index);
|
2013-09-02 03:55:40 +05:30
|
|
|
}
|
2017-05-04 02:41:52 +05:30
|
|
|
downloads[index].get()->disconnect(this);
|
2015-01-12 02:34:31 +05:30
|
|
|
startMoreParts();
|
2013-09-02 03:55:40 +05:30
|
|
|
}
|
|
|
|
|
2017-05-04 02:41:52 +05:30
|
|
|
void NetJob::partAborted(int index)
|
2016-08-14 06:03:31 +05:30
|
|
|
{
|
|
|
|
m_aborted = true;
|
|
|
|
m_doing.remove(index);
|
|
|
|
m_failed.insert(index);
|
2017-05-04 02:41:52 +05:30
|
|
|
downloads[index].get()->disconnect(this);
|
2016-08-14 06:03:31 +05:30
|
|
|
startMoreParts();
|
|
|
|
}
|
|
|
|
|
2017-05-04 02:41:52 +05:30
|
|
|
void NetJob::partProgress(int index, qint64 bytesReceived, qint64 bytesTotal)
|
2013-09-02 03:55:40 +05:30
|
|
|
{
|
2017-05-04 02:41:52 +05:30
|
|
|
auto &slot = parts_progress[index];
|
2013-09-26 06:28:09 +05:30
|
|
|
slot.current_progress = bytesReceived;
|
|
|
|
slot.total_progress = bytesTotal;
|
2017-07-06 19:08:16 +05:30
|
|
|
|
|
|
|
int done = m_done.size();
|
|
|
|
int doing = m_doing.size();
|
|
|
|
int all = parts_progress.size();
|
|
|
|
|
|
|
|
qint64 bytesAll = 0;
|
|
|
|
qint64 bytesTotalAll = 0;
|
|
|
|
for(auto & partIdx: m_doing)
|
|
|
|
{
|
|
|
|
auto part = parts_progress[partIdx];
|
|
|
|
// do not count parts with unknown/nonsensical total size
|
|
|
|
if(part.total_progress <= 0)
|
|
|
|
{
|
|
|
|
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.
|
|
|
|
if(m_current_progress > current)
|
|
|
|
{
|
|
|
|
current = m_current_progress;
|
|
|
|
}
|
|
|
|
m_current_progress = current;
|
|
|
|
setProgress(current, current_total);
|
2013-09-02 03:55:40 +05:30
|
|
|
}
|
|
|
|
|
2015-04-26 17:17:14 +05:30
|
|
|
void NetJob::executeTask()
|
2013-09-02 03:55:40 +05:30
|
|
|
{
|
2015-03-27 06:33:14 +05:30
|
|
|
// hack that delays early failures so they can be caught easier
|
|
|
|
QMetaObject::invokeMethod(this, "startMoreParts", Qt::QueuedConnection);
|
2015-01-12 02:34:31 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
void NetJob::startMoreParts()
|
|
|
|
{
|
2017-06-26 04:44:32 +05:30
|
|
|
if(!isRunning())
|
|
|
|
{
|
|
|
|
// this actually makes sense. You can put running downloads into a NetJob and then not start it until much later.
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
// OK. We are actively processing tasks, proceed.
|
|
|
|
// Check for final conditions if there's nothing in the queue.
|
2015-01-12 02:34:31 +05:30
|
|
|
if(!m_todo.size())
|
|
|
|
{
|
|
|
|
if(!m_doing.size())
|
|
|
|
{
|
|
|
|
if(!m_failed.size())
|
|
|
|
{
|
2015-04-26 17:17:14 +05:30
|
|
|
emitSucceeded();
|
2015-01-12 02:34:31 +05:30
|
|
|
}
|
2016-08-14 06:03:31 +05:30
|
|
|
else if(m_aborted)
|
|
|
|
{
|
2017-07-07 23:16:56 +05:30
|
|
|
emitAborted();
|
2016-08-14 06:03:31 +05:30
|
|
|
}
|
2015-01-12 02:34:31 +05:30
|
|
|
else
|
|
|
|
{
|
2017-07-07 23:16:56 +05:30
|
|
|
emitFailed(tr("Job '%1' failed to process:\n%2").arg(objectName()).arg(getFailedFiles().join("\n")));
|
2015-01-12 02:34:31 +05:30
|
|
|
}
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
2017-06-26 04:44:32 +05:30
|
|
|
// There's work to do, try to start more parts.
|
2015-01-12 02:34:31 +05:30
|
|
|
while (m_doing.size() < 6)
|
|
|
|
{
|
|
|
|
if(!m_todo.size())
|
|
|
|
return;
|
|
|
|
int doThis = m_todo.dequeue();
|
|
|
|
m_doing.insert(doThis);
|
2017-05-04 02:41:52 +05:30
|
|
|
auto part = downloads[doThis];
|
2015-01-12 02:34:31 +05:30
|
|
|
// connect signals :D
|
2017-05-04 02:41:52 +05:30
|
|
|
connect(part.get(), SIGNAL(succeeded(int)), SLOT(partSucceeded(int)));
|
|
|
|
connect(part.get(), SIGNAL(failed(int)), SLOT(partFailed(int)));
|
|
|
|
connect(part.get(), SIGNAL(aborted(int)), SLOT(partAborted(int)));
|
|
|
|
connect(part.get(), SIGNAL(netActionProgress(int, qint64, qint64)),
|
|
|
|
SLOT(partProgress(int, qint64, qint64)));
|
2015-01-12 02:34:31 +05:30
|
|
|
part->start();
|
2013-09-02 03:55:40 +05:30
|
|
|
}
|
|
|
|
}
|
2013-09-26 06:28:09 +05:30
|
|
|
|
2015-01-12 02:34:31 +05:30
|
|
|
|
2013-10-26 23:25:48 +05:30
|
|
|
QStringList NetJob::getFailedFiles()
|
2013-09-26 06:28:09 +05:30
|
|
|
{
|
|
|
|
QStringList failed;
|
2015-01-12 02:34:31 +05:30
|
|
|
for (auto index: m_failed)
|
2013-09-26 06:28:09 +05:30
|
|
|
{
|
2017-06-26 04:44:32 +05:30
|
|
|
failed.push_back(downloads[index]->url().toString());
|
2013-09-26 06:28:09 +05:30
|
|
|
}
|
2015-01-12 02:34:31 +05:30
|
|
|
failed.sort();
|
2013-09-26 06:28:09 +05:30
|
|
|
return failed;
|
|
|
|
}
|
2016-08-14 06:03:31 +05:30
|
|
|
|
|
|
|
bool NetJob::canAbort() const
|
|
|
|
{
|
|
|
|
bool canFullyAbort = true;
|
|
|
|
// can abort the waiting?
|
|
|
|
for(auto index: m_todo)
|
|
|
|
{
|
2017-05-04 02:41:52 +05:30
|
|
|
auto part = downloads[index];
|
2016-08-14 06:03:31 +05:30
|
|
|
canFullyAbort &= part->canAbort();
|
|
|
|
}
|
|
|
|
// can abort the active?
|
|
|
|
for(auto index: m_doing)
|
|
|
|
{
|
2017-05-04 02:41:52 +05:30
|
|
|
auto part = downloads[index];
|
2016-08-14 06:03:31 +05:30
|
|
|
canFullyAbort &= part->canAbort();
|
|
|
|
}
|
|
|
|
return canFullyAbort;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool NetJob::abort()
|
|
|
|
{
|
|
|
|
bool fullyAborted = true;
|
|
|
|
// fail all waiting
|
|
|
|
m_failed.unite(m_todo.toSet());
|
|
|
|
m_todo.clear();
|
|
|
|
// abort active
|
|
|
|
auto toKill = m_doing.toList();
|
|
|
|
for(auto index: toKill)
|
|
|
|
{
|
2017-05-04 02:41:52 +05:30
|
|
|
auto part = downloads[index];
|
2016-08-14 06:03:31 +05:30
|
|
|
fullyAborted &= part->abort();
|
|
|
|
}
|
|
|
|
return fullyAborted;
|
|
|
|
}
|
2017-06-26 04:44:32 +05:30
|
|
|
|
|
|
|
bool NetJob::addNetAction(NetActionPtr action)
|
|
|
|
{
|
|
|
|
action->m_index_within_job = downloads.size();
|
|
|
|
downloads.append(action);
|
|
|
|
part_info pi;
|
|
|
|
parts_progress.append(pi);
|
2017-07-06 19:08:16 +05:30
|
|
|
partProgress(parts_progress.count() - 1, action->currentProgress(), action->totalProgress());
|
2017-06-26 04:44:32 +05:30
|
|
|
|
|
|
|
if(action->isRunning())
|
|
|
|
{
|
|
|
|
connect(action.get(), SIGNAL(succeeded(int)), SLOT(partSucceeded(int)));
|
|
|
|
connect(action.get(), SIGNAL(failed(int)), SLOT(partFailed(int)));
|
|
|
|
connect(action.get(), SIGNAL(netActionProgress(int, qint64, qint64)), SLOT(partProgress(int, qint64, qint64)));
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
m_todo.append(parts_progress.size() - 1);
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|