1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
|
/****************************************************************************
**
** Copyright (C) 2018 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of Qbs.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 3 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL3 included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 3 requirements
** will be met: https://www.gnu.org/licenses/lgpl-3.0.html.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 2.0 or (at your option) the GNU General
** Public license version 3 or any later version approved by the KDE Free
** Qt Foundation. The licenses are as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-2.0.html and
** https://www.gnu.org/licenses/gpl-3.0.html.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "joblimits.h"
#include <tools/persistence.h>
#include <utility>
#include <vector>
namespace qbs {
namespace Internal {
static int transformLimit(int limitFromUser)
{
return limitFromUser == 0
? std::numeric_limits<int>::max()
: limitFromUser < -1 ? -1
: limitFromUser;
}
class JobLimitPrivate : public QSharedData
{
public:
JobLimitPrivate(const QString &pool, int limit)
: jobLimit(std::make_pair(pool, transformLimit(limit)))
{
}
template<PersistentPool::OpType opType> void serializationOp(PersistentPool &pool)
{
pool.serializationOp<opType>(jobLimit);
}
std::pair<QString, int> jobLimit;
};
class JobLimitsPrivate : public QSharedData
{
public:
template<PersistentPool::OpType opType> void serializationOp(PersistentPool &pool)
{
pool.serializationOp<opType>(jobLimits);
}
std::vector<JobLimit> jobLimits;
};
} // namespace Internal
JobLimit::JobLimit() : JobLimit(QString(), -1)
{
}
JobLimit::JobLimit(const QString &pool, int limit) : d(new Internal::JobLimitPrivate(pool, limit))
{
}
JobLimit::JobLimit(const JobLimit &other) : d(other.d) { }
JobLimit &JobLimit::operator=(const JobLimit &other)
{
d = other.d;
return *this;
}
JobLimit::~JobLimit() {}
QString JobLimit::pool() const { return d->jobLimit.first; }
int JobLimit::limit() const { return d->jobLimit.second; }
void JobLimit::load(Internal::PersistentPool &pool)
{
d->serializationOp<Internal::PersistentPool::Load>(pool);
}
void JobLimit::store(Internal::PersistentPool &pool)
{
d->serializationOp<Internal::PersistentPool::Store>(pool);
}
JobLimits::JobLimits() : d(new Internal::JobLimitsPrivate) { }
JobLimits::JobLimits(const JobLimits &other) : d(other.d) { }
JobLimits &JobLimits::operator=(const JobLimits &other)
{
d = other.d;
return *this;
}
JobLimits::~JobLimits() {}
void JobLimits::setJobLimit(const JobLimit &limit)
{
for (auto ¤tLimit : d->jobLimits) {
if (currentLimit.pool() == limit.pool()) {
if (currentLimit.limit() != limit.limit())
currentLimit = limit;
return;
}
}
d->jobLimits.push_back(limit);
}
void JobLimits::setJobLimit(const QString &pool, int limit)
{
setJobLimit(JobLimit(pool, limit));
}
int JobLimits::getLimit(const QString &pool) const
{
for (const JobLimit &l : d->jobLimits) {
if (l.pool() == pool)
return l.limit();
}
return -1;
}
bool JobLimits::isEmpty() const
{
return d->jobLimits.empty();
}
int JobLimits::count() const
{
return d->jobLimits.size();
}
JobLimit JobLimits::jobLimitAt(int i) const
{
return d->jobLimits.at(i);
}
JobLimits &JobLimits::update(const JobLimits &other)
{
if (isEmpty()) {
*this = other;
} else {
for (int i = 0; i < other.count(); ++i) {
const JobLimit &l = other.jobLimitAt(i);
if (l.limit() != -1)
setJobLimit(l);
}
}
return *this;
}
void JobLimits::load(Internal::PersistentPool &pool)
{
d->serializationOp<Internal::PersistentPool::Load>(pool);
}
void JobLimits::store(Internal::PersistentPool &pool)
{
d->serializationOp<Internal::PersistentPool::Store>(pool);
}
} // namespace qbs
|
