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
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
|
// Copyright Contributors to the DNF5 project.
// Copyright Contributors to the libdnf project.
// SPDX-License-Identifier: LGPL-2.1-or-later
//
// This file is part of libdnf: https://github.com/rpm-software-management/libdnf/
//
// Libdnf 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 2.1 of the License, or
// (at your option) any later version.
//
// Libdnf 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 libdnf. If not, see <https://www.gnu.org/licenses/>.
#include "libdnf5/advisory/advisory_query.hpp"
#include "advisory_package_private.hpp"
#include "advisory_set_impl.hpp"
#include "base/base_impl.hpp"
#include "common/sack/query_cmp_private.hpp"
#include "solv/pool.hpp"
#include "solv/solv_map.hpp"
#include "libdnf5/utils/patterns.hpp"
#include <libdnf5/rpm/nevra.hpp>
#include <solv/evr.h>
// For glob support
#include <fnmatch.h>
namespace libdnf5::advisory {
class AdvisoryQuery::Impl {
public:
explicit Impl(const libdnf5::BaseWeakPtr & base) : base(base) {}
private:
friend AdvisoryQuery;
BaseWeakPtr base;
};
AdvisoryQuery::AdvisoryQuery(const BaseWeakPtr & base) : AdvisorySet(base), p_impl(std::make_unique<Impl>(base)) {
*AdvisorySet::p_impl |= base->p_impl->get_rpm_advisory_sack()->get_solvables();
}
AdvisoryQuery::AdvisoryQuery(Base & base) : AdvisoryQuery(base.get_weak_ptr()) {}
AdvisoryQuery::~AdvisoryQuery() = default;
AdvisoryQuery::AdvisoryQuery(const AdvisoryQuery & src) : AdvisorySet(src), p_impl(new Impl(*src.p_impl)) {}
AdvisoryQuery::AdvisoryQuery(AdvisoryQuery && src) noexcept = default;
AdvisoryQuery & AdvisoryQuery::operator=(const AdvisoryQuery & src) {
AdvisorySet::operator=(src);
if (this != &src) {
if (p_impl) {
*p_impl = *src.p_impl;
} else {
p_impl = std::make_unique<Impl>(*src.p_impl);
}
}
return *this;
}
AdvisoryQuery & AdvisoryQuery::operator=(AdvisoryQuery && src) noexcept = default;
static int libsolv_cmp_flags(libdnf5::sack::QueryCmp cmp_type, const char * pattern) {
// Remove GLOB when the pattern is not a glob
if ((cmp_type & libdnf5::sack::QueryCmp::GLOB) == libdnf5::sack::QueryCmp::GLOB &&
!libdnf5::utils::is_glob_pattern(pattern)) {
cmp_type = (cmp_type - libdnf5::sack::QueryCmp::GLOB) | libdnf5::sack::QueryCmp::EQ;
}
switch (cmp_type) {
case libdnf5::sack::QueryCmp::EQ:
return SEARCH_STRING;
case libdnf5::sack::QueryCmp::IEXACT:
return SEARCH_NOCASE | SEARCH_STRING;
case libdnf5::sack::QueryCmp::GLOB:
return SEARCH_GLOB;
case libdnf5::sack::QueryCmp::IGLOB:
return SEARCH_NOCASE | SEARCH_GLOB;
case libdnf5::sack::QueryCmp::CONTAINS:
return SEARCH_SUBSTRING;
case libdnf5::sack::QueryCmp::ICONTAINS:
return SEARCH_NOCASE | SEARCH_SUBSTRING;
default:
libdnf_throw_assert_unsupported_query_cmp_type(cmp_type);
}
}
static void filter_dataiterator_internal(
Pool * pool,
Id keyname,
libdnf5::solv::SolvMap & candidates,
libdnf5::sack::QueryCmp cmp_type,
const std::vector<std::string> & patterns) {
libdnf5::solv::SolvMap filter_result(pool->nsolvables);
bool cmp_not = (cmp_type & libdnf5::sack::QueryCmp::NOT) == libdnf5::sack::QueryCmp::NOT;
if (cmp_not) {
// Removal of NOT CmpType makes following comparisons easier and more effective
cmp_type = cmp_type - libdnf5::sack::QueryCmp::NOT;
}
for (auto & pattern : patterns) {
int flags = libsolv_cmp_flags(cmp_type, pattern.c_str());
Dataiterator di;
for (Id candidate_id : candidates) {
dataiterator_init(&di, pool, nullptr, candidate_id, keyname, pattern.c_str(), flags);
if (dataiterator_step(&di) != 0) {
filter_result.add_unsafe(candidate_id);
}
dataiterator_free(&di);
}
}
// Apply filter results to query
if (cmp_not) {
candidates -= filter_result;
} else {
candidates &= filter_result;
}
}
static void filter_reference_by_type_and_id(
libdnf5::solv::RpmPool & pool,
libdnf5::solv::SolvMap & candidates,
libdnf5::sack::QueryCmp cmp_type,
const std::vector<std::string> & patterns,
const std::optional<std::string> type) {
libdnf5::solv::SolvMap filter_result((*pool)->nsolvables);
bool cmp_not = (cmp_type & libdnf5::sack::QueryCmp::NOT) == libdnf5::sack::QueryCmp::NOT;
if (cmp_not) {
// Removal of NOT CmpType makes following comparisons easier and more effective
cmp_type = cmp_type - libdnf5::sack::QueryCmp::NOT;
}
for (auto & pattern : patterns) {
int flags = libsolv_cmp_flags(cmp_type, pattern.c_str());
Dataiterator di;
for (Id candidate_id : candidates) {
dataiterator_init(&di, *pool, nullptr, candidate_id, UPDATE_REFERENCE_ID, pattern.c_str(), flags);
dataiterator_prepend_keyname(&di, UPDATE_REFERENCE);
while (dataiterator_step(&di) != 0) {
dataiterator_setpos_parent(&di);
const char * current_type = pool.lookup_str(SOLVID_POS, UPDATE_REFERENCE_TYPE);
if (type && current_type) {
if (!strcmp(type->c_str(), current_type)) {
filter_result.add_unsafe(candidate_id);
break;
}
} else {
filter_result.add_unsafe(candidate_id);
break;
}
}
dataiterator_free(&di);
}
}
// Apply filter results to query
if (cmp_not) {
candidates -= filter_result;
} else {
candidates &= filter_result;
}
}
void AdvisoryQuery::filter_name(const std::string & pattern, sack::QueryCmp cmp_type) {
filter_dataiterator_internal(
*get_rpm_pool(p_impl->base),
SOLVABLE_NAME,
*AdvisorySet::p_impl,
cmp_type,
{std::string(libdnf5::solv::SOLVABLE_NAME_ADVISORY_PREFIX) + pattern});
}
void AdvisoryQuery::filter_name(const std::vector<std::string> & patterns, sack::QueryCmp cmp_type) {
std::vector<std::string> prefixed_patterns;
for (std::string pattern : patterns) {
prefixed_patterns.push_back(std::string(libdnf5::solv::SOLVABLE_NAME_ADVISORY_PREFIX) + pattern);
}
filter_dataiterator_internal(
*get_rpm_pool(p_impl->base), SOLVABLE_NAME, *AdvisorySet::p_impl, cmp_type, prefixed_patterns);
}
void AdvisoryQuery::filter_type(const std::string & type, sack::QueryCmp cmp_type) {
filter_dataiterator_internal(
*get_rpm_pool(p_impl->base), SOLVABLE_PATCHCATEGORY, *AdvisorySet::p_impl, cmp_type, {type});
}
void AdvisoryQuery::filter_type(const std::vector<std::string> & types, sack::QueryCmp cmp_type) {
filter_dataiterator_internal(
*get_rpm_pool(p_impl->base), SOLVABLE_PATCHCATEGORY, *AdvisorySet::p_impl, cmp_type, types);
}
void AdvisoryQuery::filter_reference(const std::string & pattern, sack::QueryCmp cmp_type) {
filter_reference_by_type_and_id(
get_rpm_pool(p_impl->base), *AdvisorySet::p_impl, cmp_type, {pattern}, std::nullopt);
}
void AdvisoryQuery::filter_reference(const std::string & pattern, const std::string & type, sack::QueryCmp cmp_type) {
filter_reference_by_type_and_id(get_rpm_pool(p_impl->base), *AdvisorySet::p_impl, cmp_type, {pattern}, type);
}
void AdvisoryQuery::filter_reference(const std::vector<std::string> & patterns, sack::QueryCmp cmp_type) {
filter_reference_by_type_and_id(get_rpm_pool(p_impl->base), *AdvisorySet::p_impl, cmp_type, patterns, std::nullopt);
}
void AdvisoryQuery::filter_reference(
const std::vector<std::string> & patterns, const std::string & type, sack::QueryCmp cmp_type) {
filter_reference_by_type_and_id(get_rpm_pool(p_impl->base), *AdvisorySet::p_impl, cmp_type, patterns, type);
}
void AdvisoryQuery::filter_severity(const std::string & severity, sack::QueryCmp cmp_type) {
filter_dataiterator_internal(
*get_rpm_pool(p_impl->base), UPDATE_SEVERITY, *AdvisorySet::p_impl, cmp_type, {severity});
}
void AdvisoryQuery::filter_severity(const std::vector<std::string> & severities, sack::QueryCmp cmp_type) {
filter_dataiterator_internal(
*get_rpm_pool(p_impl->base), UPDATE_SEVERITY, *AdvisorySet::p_impl, cmp_type, severities);
}
void AdvisoryQuery::filter_packages(const std::vector<libdnf5::rpm::Nevra> & nevras, sack::QueryCmp cmp_type) {
auto & pool = get_rpm_pool(p_impl->base);
libdnf5::solv::SolvMap filter_result(pool.get_nsolvables());
std::vector<AdvisoryPackage> adv_pkgs = get_advisory_packages_sorted_by_name_arch_evr_string();
bool cmp_not = (cmp_type & libdnf5::sack::QueryCmp::NOT) == libdnf5::sack::QueryCmp::NOT;
if (cmp_not) {
// Removal of NOT CmpType makes following comparisons easier and more effective
cmp_type = cmp_type - libdnf5::sack::QueryCmp::NOT;
}
switch (cmp_type) {
case libdnf5::sack::QueryCmp::EQ:
//TODO(amatej): faster EQ specific version (we can compare whole NEVRA)
case libdnf5::sack::QueryCmp::GT:
case libdnf5::sack::QueryCmp::LT:
case libdnf5::sack::QueryCmp::GTE:
case libdnf5::sack::QueryCmp::LTE: {
for (const auto & nevra : nevras) {
auto low = std::lower_bound(
adv_pkgs.begin(), adv_pkgs.end(), nevra, AdvisoryPackage::Impl::name_arch_compare_lower_nevra);
while (low != adv_pkgs.end() && low->get_name() == nevra.get_name() &&
low->get_arch() == nevra.get_arch()) {
int evr_cmp = libdnf5::rpm::evrcmp(*low, nevra);
if (((evr_cmp > 0) && ((cmp_type & sack::QueryCmp::GT) == sack::QueryCmp::GT)) ||
((evr_cmp < 0) && ((cmp_type & sack::QueryCmp::LT) == sack::QueryCmp::LT)) ||
((evr_cmp == 0) && ((cmp_type & sack::QueryCmp::EQ) == sack::QueryCmp::EQ))) {
filter_result.add_unsafe((*low).get_advisory_id().id);
}
++low;
}
}
} break;
default:
libdnf_throw_assert_unsupported_query_cmp_type(cmp_type);
}
// Apply filter results to query
if (cmp_not) {
*AdvisorySet::p_impl -= filter_result;
} else {
*AdvisorySet::p_impl &= filter_result;
}
}
void AdvisoryQuery::filter_packages(const libdnf5::rpm::PackageSet & package_set, sack::QueryCmp cmp_type) {
auto & pool = get_rpm_pool(p_impl->base);
libdnf5::solv::SolvMap filter_result(pool.get_nsolvables());
std::vector<AdvisoryPackage> adv_pkgs = get_advisory_packages_sorted_by_name_arch_evr();
bool cmp_not = (cmp_type & libdnf5::sack::QueryCmp::NOT) == libdnf5::sack::QueryCmp::NOT;
if (cmp_not) {
// Removal of NOT CmpType makes following comparisons easier and more effective
cmp_type = cmp_type - libdnf5::sack::QueryCmp::NOT;
}
switch (cmp_type) {
case libdnf5::sack::QueryCmp::EQ:
//TODO(amatej): faster EQ specific version (we can compare whole NEVRA)
case libdnf5::sack::QueryCmp::GT:
case libdnf5::sack::QueryCmp::LT:
case libdnf5::sack::QueryCmp::GTE:
case libdnf5::sack::QueryCmp::LTE: {
for (libdnf5::rpm::PackageSet::iterator package = package_set.begin(); package != package_set.end();
package++) {
Solvable * solvable = pool.id2solvable((*package).get_id().id);
auto low = std::lower_bound(
adv_pkgs.begin(), adv_pkgs.end(), *package, AdvisoryPackage::Impl::name_arch_compare_lower_id);
while (low != adv_pkgs.end() && low->p_impl.get()->get_name_id() == solvable->name &&
low->p_impl.get()->get_arch_id() == solvable->arch) {
int libsolv_cmp = pool.evrcmp(low->p_impl.get()->get_evr_id(), solvable->evr, EVRCMP_COMPARE);
if (((libsolv_cmp > 0) && ((cmp_type & sack::QueryCmp::GT) == sack::QueryCmp::GT)) ||
((libsolv_cmp < 0) && ((cmp_type & sack::QueryCmp::LT) == sack::QueryCmp::LT)) ||
((libsolv_cmp == 0) && ((cmp_type & sack::QueryCmp::EQ) == sack::QueryCmp::EQ))) {
filter_result.add_unsafe((*low).get_advisory_id().id);
}
++low;
}
}
} break;
default:
libdnf_throw_assert_unsupported_query_cmp_type(cmp_type);
}
// Apply filter results to query
if (cmp_not) {
*AdvisorySet::p_impl -= filter_result;
} else {
*AdvisorySet::p_impl &= filter_result;
}
}
std::vector<AdvisoryPackage> AdvisoryQuery::get_advisory_packages_sorted(
const libdnf5::rpm::PackageSet & package_set, sack::QueryCmp cmp_type) const {
std::vector<AdvisoryPackage> adv_pkgs = get_advisory_packages_sorted_by_name_arch_evr();
std::vector<AdvisoryPackage> after_filter;
auto & pool = get_rpm_pool(p_impl->base);
switch (cmp_type) {
case libdnf5::sack::QueryCmp::EQ:
//TODO(amatej): faster EQ specific version (we can compare whole NEVRA)
case libdnf5::sack::QueryCmp::GT:
case libdnf5::sack::QueryCmp::LT:
case libdnf5::sack::QueryCmp::GTE:
case libdnf5::sack::QueryCmp::LTE: {
for (libdnf5::rpm::PackageSet::iterator package = package_set.begin(); package != package_set.end();
package++) {
Solvable * solvable = pool.id2solvable((*package).get_id().id);
auto low = std::lower_bound(
adv_pkgs.begin(), adv_pkgs.end(), *package, AdvisoryPackage::Impl::name_arch_compare_lower_id);
while (low != adv_pkgs.end() && low->p_impl.get()->get_name_id() == solvable->name &&
low->p_impl.get()->get_arch_id() == solvable->arch) {
int libsolv_cmp = pool.evrcmp(low->p_impl.get()->get_evr_id(), solvable->evr, EVRCMP_COMPARE);
if (((libsolv_cmp > 0) && ((cmp_type & sack::QueryCmp::GT) == sack::QueryCmp::GT)) ||
((libsolv_cmp < 0) && ((cmp_type & sack::QueryCmp::LT) == sack::QueryCmp::LT)) ||
((libsolv_cmp == 0) && ((cmp_type & sack::QueryCmp::EQ) == sack::QueryCmp::EQ))) {
after_filter.push_back(*low);
}
++low;
}
}
} break;
default:
libdnf_throw_assert_unsupported_query_cmp_type(cmp_type);
}
//after_filter contains just advisoryPackages which comply to condition with package_set
return after_filter;
}
} // namespace libdnf5::advisory
|
