mirror of
https://github.com/JakubMelka/PDF4QT.git
synced 2025-06-05 21:59:17 +02:00
Use LF instead of CRLF
This commit is contained in:
Jakub Melka
@@ -1,187 +1,187 @@
|
||||
// Copyright (C) 2020-2021 Jakub Melka
|
||||
//
|
||||
// This file is part of PDF4QT.
|
||||
//
|
||||
// PDF4QT is free software: you can redistribute it and/or modify
|
||||
// it under the terms of the GNU Lesser General Public License as published by
|
||||
// the Free Software Foundation, either version 3 of the License, or
|
||||
// with the written consent of the copyright owner, any later version.
|
||||
//
|
||||
// PDF4QT 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 Lesser General Public License for more details.
|
||||
//
|
||||
// You should have received a copy of the GNU Lesser General Public License
|
||||
// along with PDF4QT. If not, see <https://www.gnu.org/licenses/>.
|
||||
|
||||
#ifndef PDFEXECUTIONPOLICY_H
|
||||
#define PDFEXECUTIONPOLICY_H
|
||||
|
||||
#include "pdfglobal.h"
|
||||
|
||||
#include <QSemaphore>
|
||||
#include <QThreadPool>
|
||||
|
||||
#include <atomic>
|
||||
#include <execution>
|
||||
|
||||
namespace pdf
|
||||
{
|
||||
struct PDFExecutionPolicyHolder;
|
||||
|
||||
/// Defines thread execution policy based on settings and actual number of page content
|
||||
/// streams being processed. It can regulate number of threads executed at each
|
||||
/// point, where execution policy is used.
|
||||
class PDF4QTLIBSHARED_EXPORT PDFExecutionPolicy
|
||||
{
|
||||
public:
|
||||
|
||||
enum class Scope
|
||||
{
|
||||
Page, ///< Used, when we are processing page objects
|
||||
Content, ///< Used, when we are processing objects from page content streams
|
||||
Unknown ///< Unknown scope, usually tries to parallelize
|
||||
};
|
||||
|
||||
enum class Strategy
|
||||
{
|
||||
SingleThreaded,
|
||||
PageMultithreaded,
|
||||
AlwaysMultithreaded
|
||||
};
|
||||
|
||||
/// Sets multithreading strategy
|
||||
/// \param strategy Strategy
|
||||
static void setStrategy(Strategy strategy);
|
||||
|
||||
/// Determines, if we should parallelize for scope
|
||||
/// \param scope Scope for which we want to determine execution policy
|
||||
static bool isParallelizing(Scope scope);
|
||||
|
||||
template<typename ForwardIt, typename UnaryFunction>
|
||||
class Runnable : public QRunnable
|
||||
{
|
||||
public:
|
||||
explicit inline Runnable(ForwardIt it, ForwardIt itEnd, UnaryFunction* function, QSemaphore* semaphore) :
|
||||
m_forwardIt(qMove(it)),
|
||||
m_forwardItEnd(qMove(itEnd)),
|
||||
m_function(function),
|
||||
m_semaphore(semaphore),
|
||||
m_packSize(static_cast<int>(std::distance(m_forwardIt, m_forwardItEnd)))
|
||||
{
|
||||
setAutoDelete(true);
|
||||
}
|
||||
|
||||
virtual void run() override
|
||||
{
|
||||
QSemaphoreReleaser semaphoreReleaser(m_semaphore, m_packSize);
|
||||
for (auto it = m_forwardIt; it != m_forwardItEnd; ++it)
|
||||
{
|
||||
(*m_function)(*it);
|
||||
}
|
||||
}
|
||||
|
||||
private:
|
||||
ForwardIt m_forwardIt;
|
||||
ForwardIt m_forwardItEnd;
|
||||
UnaryFunction* m_function;
|
||||
QSemaphore* m_semaphore;
|
||||
int m_packSize;
|
||||
};
|
||||
|
||||
template<typename ForwardIt, typename UnaryFunction>
|
||||
static void execute(Scope scope, ForwardIt first, ForwardIt last, UnaryFunction f)
|
||||
{
|
||||
if (isParallelizing(scope))
|
||||
{
|
||||
QSemaphore semaphore(0);
|
||||
int count = static_cast<int>(std::distance(first, last));
|
||||
int remainder = count;
|
||||
|
||||
int bucketSize = 1;
|
||||
|
||||
// For page scope, we do not divide the tasks into buckets, i.e.
|
||||
// each bucket will have size 1. But if we are in a content scope,
|
||||
// then we are processing smaller task, so we divide the work
|
||||
// into buckets of appropriate size.
|
||||
if (scope != Scope::Page)
|
||||
{
|
||||
const int buckets = 32 * QThread::idealThreadCount();
|
||||
bucketSize = qMax(1, count / buckets);
|
||||
}
|
||||
|
||||
QThreadPool* pool = getThreadPool(scope);
|
||||
|
||||
// Divide tasks into buckets with given bucket size
|
||||
auto it = first;
|
||||
while (remainder > 0)
|
||||
{
|
||||
const int currentSize = qMin(remainder, bucketSize);
|
||||
|
||||
auto itStart = it;
|
||||
auto itEnd = std::next(it, currentSize);
|
||||
pool->start(new Runnable(itStart, itEnd, &f, &semaphore));
|
||||
|
||||
remainder -= currentSize;
|
||||
std::advance(it, currentSize);
|
||||
}
|
||||
|
||||
Q_ASSERT(it == last);
|
||||
|
||||
semaphore.acquire(count);
|
||||
}
|
||||
else
|
||||
{
|
||||
std::for_each(std::execution::sequenced_policy(), first, last, f);
|
||||
}
|
||||
}
|
||||
|
||||
template<typename ForwardIt, typename Comparator>
|
||||
static void sort(Scope scope, ForwardIt first, ForwardIt last, Comparator f)
|
||||
{
|
||||
Q_UNUSED(scope);
|
||||
|
||||
// We always sort by single thread
|
||||
std::sort(std::execution::sequenced_policy(), first, last, f);
|
||||
}
|
||||
|
||||
/// Returns number of active threads for given scope
|
||||
static int getActiveThreadCount(Scope scope);
|
||||
|
||||
/// Returns maximal number of threads for given scope
|
||||
static int getMaxThreadCount(Scope scope);
|
||||
|
||||
/// Sets maximal number of threads for given scope
|
||||
static void setMaxThreadCount(Scope scope, int count);
|
||||
|
||||
/// Returns ideal thread count for given scope
|
||||
static int getIdealThreadCount(Scope scope);
|
||||
|
||||
/// Returns number of currently processed content streams
|
||||
static int getContentStreamCount();
|
||||
|
||||
/// Starts processing content stream
|
||||
static void startProcessingContentStream();
|
||||
|
||||
/// Ends processing content stream
|
||||
static void endProcessingContentStream();
|
||||
|
||||
/// Finalize multithreading - must be called at the end of program
|
||||
static void finalize();
|
||||
|
||||
private:
|
||||
friend struct PDFExecutionPolicyHolder;
|
||||
|
||||
/// Returns thread pool based on scope
|
||||
static QThreadPool* getThreadPool(Scope scope);
|
||||
|
||||
explicit PDFExecutionPolicy();
|
||||
|
||||
std::atomic<int> m_contentStreamsCount;
|
||||
std::atomic<Strategy> m_strategy;
|
||||
};
|
||||
|
||||
} // namespace pdf
|
||||
|
||||
#endif // PDFEXECUTIONPOLICY_H
|
||||
// Copyright (C) 2020-2021 Jakub Melka
|
||||
//
|
||||
// This file is part of PDF4QT.
|
||||
//
|
||||
// PDF4QT is free software: you can redistribute it and/or modify
|
||||
// it under the terms of the GNU Lesser General Public License as published by
|
||||
// the Free Software Foundation, either version 3 of the License, or
|
||||
// with the written consent of the copyright owner, any later version.
|
||||
//
|
||||
// PDF4QT 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 Lesser General Public License for more details.
|
||||
//
|
||||
// You should have received a copy of the GNU Lesser General Public License
|
||||
// along with PDF4QT. If not, see <https://www.gnu.org/licenses/>.
|
||||
|
||||
#ifndef PDFEXECUTIONPOLICY_H
|
||||
#define PDFEXECUTIONPOLICY_H
|
||||
|
||||
#include "pdfglobal.h"
|
||||
|
||||
#include <QSemaphore>
|
||||
#include <QThreadPool>
|
||||
|
||||
#include <atomic>
|
||||
#include <execution>
|
||||
|
||||
namespace pdf
|
||||
{
|
||||
struct PDFExecutionPolicyHolder;
|
||||
|
||||
/// Defines thread execution policy based on settings and actual number of page content
|
||||
/// streams being processed. It can regulate number of threads executed at each
|
||||
/// point, where execution policy is used.
|
||||
class PDF4QTLIBSHARED_EXPORT PDFExecutionPolicy
|
||||
{
|
||||
public:
|
||||
|
||||
enum class Scope
|
||||
{
|
||||
Page, ///< Used, when we are processing page objects
|
||||
Content, ///< Used, when we are processing objects from page content streams
|
||||
Unknown ///< Unknown scope, usually tries to parallelize
|
||||
};
|
||||
|
||||
enum class Strategy
|
||||
{
|
||||
SingleThreaded,
|
||||
PageMultithreaded,
|
||||
AlwaysMultithreaded
|
||||
};
|
||||
|
||||
/// Sets multithreading strategy
|
||||
/// \param strategy Strategy
|
||||
static void setStrategy(Strategy strategy);
|
||||
|
||||
/// Determines, if we should parallelize for scope
|
||||
/// \param scope Scope for which we want to determine execution policy
|
||||
static bool isParallelizing(Scope scope);
|
||||
|
||||
template<typename ForwardIt, typename UnaryFunction>
|
||||
class Runnable : public QRunnable
|
||||
{
|
||||
public:
|
||||
explicit inline Runnable(ForwardIt it, ForwardIt itEnd, UnaryFunction* function, QSemaphore* semaphore) :
|
||||
m_forwardIt(qMove(it)),
|
||||
m_forwardItEnd(qMove(itEnd)),
|
||||
m_function(function),
|
||||
m_semaphore(semaphore),
|
||||
m_packSize(static_cast<int>(std::distance(m_forwardIt, m_forwardItEnd)))
|
||||
{
|
||||
setAutoDelete(true);
|
||||
}
|
||||
|
||||
virtual void run() override
|
||||
{
|
||||
QSemaphoreReleaser semaphoreReleaser(m_semaphore, m_packSize);
|
||||
for (auto it = m_forwardIt; it != m_forwardItEnd; ++it)
|
||||
{
|
||||
(*m_function)(*it);
|
||||
}
|
||||
}
|
||||
|
||||
private:
|
||||
ForwardIt m_forwardIt;
|
||||
ForwardIt m_forwardItEnd;
|
||||
UnaryFunction* m_function;
|
||||
QSemaphore* m_semaphore;
|
||||
int m_packSize;
|
||||
};
|
||||
|
||||
template<typename ForwardIt, typename UnaryFunction>
|
||||
static void execute(Scope scope, ForwardIt first, ForwardIt last, UnaryFunction f)
|
||||
{
|
||||
if (isParallelizing(scope))
|
||||
{
|
||||
QSemaphore semaphore(0);
|
||||
int count = static_cast<int>(std::distance(first, last));
|
||||
int remainder = count;
|
||||
|
||||
int bucketSize = 1;
|
||||
|
||||
// For page scope, we do not divide the tasks into buckets, i.e.
|
||||
// each bucket will have size 1. But if we are in a content scope,
|
||||
// then we are processing smaller task, so we divide the work
|
||||
// into buckets of appropriate size.
|
||||
if (scope != Scope::Page)
|
||||
{
|
||||
const int buckets = 32 * QThread::idealThreadCount();
|
||||
bucketSize = qMax(1, count / buckets);
|
||||
}
|
||||
|
||||
QThreadPool* pool = getThreadPool(scope);
|
||||
|
||||
// Divide tasks into buckets with given bucket size
|
||||
auto it = first;
|
||||
while (remainder > 0)
|
||||
{
|
||||
const int currentSize = qMin(remainder, bucketSize);
|
||||
|
||||
auto itStart = it;
|
||||
auto itEnd = std::next(it, currentSize);
|
||||
pool->start(new Runnable(itStart, itEnd, &f, &semaphore));
|
||||
|
||||
remainder -= currentSize;
|
||||
std::advance(it, currentSize);
|
||||
}
|
||||
|
||||
Q_ASSERT(it == last);
|
||||
|
||||
semaphore.acquire(count);
|
||||
}
|
||||
else
|
||||
{
|
||||
std::for_each(std::execution::sequenced_policy(), first, last, f);
|
||||
}
|
||||
}
|
||||
|
||||
template<typename ForwardIt, typename Comparator>
|
||||
static void sort(Scope scope, ForwardIt first, ForwardIt last, Comparator f)
|
||||
{
|
||||
Q_UNUSED(scope);
|
||||
|
||||
// We always sort by single thread
|
||||
std::sort(std::execution::sequenced_policy(), first, last, f);
|
||||
}
|
||||
|
||||
/// Returns number of active threads for given scope
|
||||
static int getActiveThreadCount(Scope scope);
|
||||
|
||||
/// Returns maximal number of threads for given scope
|
||||
static int getMaxThreadCount(Scope scope);
|
||||
|
||||
/// Sets maximal number of threads for given scope
|
||||
static void setMaxThreadCount(Scope scope, int count);
|
||||
|
||||
/// Returns ideal thread count for given scope
|
||||
static int getIdealThreadCount(Scope scope);
|
||||
|
||||
/// Returns number of currently processed content streams
|
||||
static int getContentStreamCount();
|
||||
|
||||
/// Starts processing content stream
|
||||
static void startProcessingContentStream();
|
||||
|
||||
/// Ends processing content stream
|
||||
static void endProcessingContentStream();
|
||||
|
||||
/// Finalize multithreading - must be called at the end of program
|
||||
static void finalize();
|
||||
|
||||
private:
|
||||
friend struct PDFExecutionPolicyHolder;
|
||||
|
||||
/// Returns thread pool based on scope
|
||||
static QThreadPool* getThreadPool(Scope scope);
|
||||
|
||||
explicit PDFExecutionPolicy();
|
||||
|
||||
std::atomic<int> m_contentStreamsCount;
|
||||
std::atomic<Strategy> m_strategy;
|
||||
};
|
||||
|
||||
} // namespace pdf
|
||||
|
||||
#endif // PDFEXECUTIONPOLICY_H
|
||||
|
||||
Reference in New Issue
Block a user