blob: 7fbaf65f17cea7130c8eeb9c510b19c39a455d89 (
plain)
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
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
|
/****************************************************************************
**
** 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 "requestedartifacts.h"
#include "productbuilddata.h"
#include <language/filetags.h>
#include <language/language.h>
#include <logging/categories.h>
#include <tools/persistence.h>
#include <tools/qbsassert.h>
#include <algorithm>
namespace qbs {
namespace Internal {
bool RequestedArtifacts::isUpToDate(const TopLevelProject *project) const
{
if (m_requestedArtifactsPerProduct.empty())
return true;
const std::vector<ResolvedProductPtr> &allProducts = project->allProducts();
for (auto it = m_requestedArtifactsPerProduct.cbegin();
it != m_requestedArtifactsPerProduct.cend(); ++it) {
const QString &productName = it->first;
const auto findProduct = [productName](const ResolvedProductConstPtr &p) {
return p->uniqueName() == productName;
};
const auto productIt = std::find_if(allProducts.begin(), allProducts.end(), findProduct);
if (productIt == allProducts.end()) {
qCDebug(lcBuildGraph) << "artifacts map not up to date: product" << productName
<< "does not exist anymore";
return false;
}
if (!it->second.isUpToDate(productIt->get()))
return false;
}
return true;
}
void RequestedArtifacts::setAllArtifactTags(const ResolvedProduct *product, bool forceUpdate)
{
RequestedArtifactsPerProduct &ra = m_requestedArtifactsPerProduct[product->uniqueName()];
if (!ra.allTags.empty() && !forceUpdate)
return;
ra.allTags.clear();
const ArtifactSetByFileTag artifactsMap = product->buildData->artifactsByFileTag();
for (auto it = artifactsMap.begin(); it != artifactsMap.end(); ++it)
ra.allTags.insert(it.key().toString());
}
void RequestedArtifacts::setArtifactsForTag(const ResolvedProduct *product,
const FileTag &tag)
{
RequestedArtifactsPerProduct &ra = m_requestedArtifactsPerProduct[product->uniqueName()];
QBS_ASSERT(!ra.allTags.empty(), ;);
Set<QString> &filePaths = ra.requestedTags[tag.toString()];
for (const Artifact * const a : product->buildData->artifactsByFileTag().value(tag))
filePaths.insert(a->filePath());
}
void RequestedArtifacts::setNonExistingTagRequested(const ResolvedProduct *product,
const QString &tag)
{
RequestedArtifactsPerProduct &ra = m_requestedArtifactsPerProduct[product->uniqueName()];
QBS_ASSERT(!ra.allTags.empty(), ;);
Set<QString> &filePaths = ra.requestedTags[tag];
QBS_CHECK(filePaths.empty());
}
void RequestedArtifacts::setArtifactsEnumerated(const ResolvedProduct *product)
{
m_requestedArtifactsPerProduct[product->uniqueName()].artifactsEnumerated = true;
}
void RequestedArtifacts::unite(const RequestedArtifacts &other)
{
for (auto it = other.m_requestedArtifactsPerProduct.begin();
it != other.m_requestedArtifactsPerProduct.end(); ++it) {
m_requestedArtifactsPerProduct[it->first].unite(it->second);
}
}
void RequestedArtifacts::doSanityChecks() const
{
for (auto it = m_requestedArtifactsPerProduct.cbegin();
it != m_requestedArtifactsPerProduct.cend(); ++it) {
it->second.doSanityChecks();
}
}
void RequestedArtifacts::load(PersistentPool &pool)
{
serializationOp<PersistentPool::Load>(pool);
}
void RequestedArtifacts::store(PersistentPool &pool)
{
serializationOp<PersistentPool::Store>(pool);
}
bool RequestedArtifacts::RequestedArtifactsPerProduct::isUpToDate(
const ResolvedProduct *product) const
{
if (!product->buildData) {
qCDebug(lcBuildGraph) << "artifacts map not up to date: product" << product->uniqueName()
<< "is now disabled";
return false;
}
if (!artifactsEnumerated && requestedTags.empty())
return true;
const ArtifactSetByFileTag currentArtifacts = product->buildData->artifactsByFileTag();
for (auto reqIt = requestedTags.cbegin(); reqIt != requestedTags.cend(); ++reqIt) {
const FileTag tag = FileTag(reqIt->first.toUtf8());
const auto currentIt = currentArtifacts.constFind(tag);
Set<QString> currentFilePathsForTag;
if (currentIt != currentArtifacts.constEnd()) {
for (const Artifact * const a : currentIt.value())
currentFilePathsForTag.insert(a->filePath());
}
if (currentFilePathsForTag != reqIt->second) {
qCDebug(lcBuildGraph) << "artifacts map not up to date: requested artifact set for "
"file tag" << reqIt->first << "in product"
<< product->uniqueName() << "differs from the current one";
return false;
}
}
if (!artifactsEnumerated)
return true;
Set<QString> currentTags;
for (auto it = currentArtifacts.begin(); it != currentArtifacts.end(); ++it)
currentTags.insert(it.key().toString());
if (currentTags != allTags) {
qCDebug(lcBuildGraph) << "artifacts map not up to date: overall file tags differ for "
<< "product" << product->uniqueName();
return false;
}
return true;
}
void RequestedArtifacts::RequestedArtifactsPerProduct::unite(
const RequestedArtifactsPerProduct &other)
{
if (allTags.empty()) {
*this = other;
return;
}
allTags = other.allTags;
for (auto it = other.requestedTags.begin(); it != other.requestedTags.end(); ++it)
requestedTags[it->first] = it->second;
}
void RequestedArtifacts::RequestedArtifactsPerProduct::doSanityChecks() const
{
for (auto it = requestedTags.begin(); it != requestedTags.end(); ++it)
QBS_CHECK(allTags.contains(it->first) || it->second.empty());
}
void RequestedArtifacts::RequestedArtifactsPerProduct::load(PersistentPool &pool)
{
serializationOp<PersistentPool::Load>(pool);
}
void RequestedArtifacts::RequestedArtifactsPerProduct::store(PersistentPool &pool)
{
serializationOp<PersistentPool::Store>(pool);
}
} // namespace Internal
} // namespace qbs
|
