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
|
// 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 "module/module_goal_private.hpp"
#include "module/module_sack_impl.hpp"
#include "rpm/solv/goal_private.hpp"
#include "libdnf5/base/goal_elements.hpp"
#include "libdnf5/base/transaction.hpp"
#include "libdnf5/module/module_sack.hpp"
#include "libdnf5/module/module_sack_weak.hpp"
#include "libdnf5/utils/bgettext/bgettext-mark-domain.h"
extern "C" {
#include <solv/queue.h>
#include <solv/solver.h>
}
namespace libdnf5::module {
void ModuleGoalPrivate::add_provide_install(Id reldepid, bool skip_broken, bool best) {
staging.push_back(
SOLVER_INSTALL | SOLVER_SOLVABLE_PROVIDES | SOLVER_SETARCH | SOLVER_SETEVR | (skip_broken ? SOLVER_WEAK : 0) |
(best ? SOLVER_FORCEBEST : 0),
reldepid);
}
void ModuleGoalPrivate::add_install(libdnf5::solv::IdQueue & queue, bool skip_broken, bool best) {
Id what = pool_queuetowhatprovides(module_sack->p_impl->pool, &queue.get_queue());
staging.push_back(
SOLVER_INSTALL | SOLVER_SOLVABLE_ONE_OF | SOLVER_SETARCH | SOLVER_SETEVR | (skip_broken ? SOLVER_WEAK : 0) |
(best ? SOLVER_FORCEBEST : 0),
what);
}
libdnf5::GoalProblem ModuleGoalPrivate::resolve() {
Pool * pool = module_sack->p_impl->pool;
libdnf5::solv::IdQueue job(staging);
if (libsolv_transaction) {
transaction_free(libsolv_transaction);
libsolv_transaction = NULL;
}
libsolv_solver.init(pool);
if (libsolv_solver.solve(job)) {
return libdnf5::GoalProblem::SOLVER_ERROR;
}
libsolv_transaction = libsolv_solver.create_transaction();
return libdnf5::GoalProblem::NO_PROBLEM;
}
libdnf5::solv::IdQueue ModuleGoalPrivate::list_results(Id type_filter1, Id type_filter2) {
/* no transaction */
if (!libsolv_transaction) {
libdnf_assert_goal_resolved();
// TODO(pkratoch) replace with a proper and descriptive exception
throw RuntimeError(M_("no solution possible"));
}
libdnf5::solv::IdQueue result_ids;
const int common_mode = SOLVER_TRANSACTION_SHOW_OBSOLETES | SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
for (int i = 0; i < libsolv_transaction->steps.count; ++i) {
Id p = libsolv_transaction->steps.elements[i];
Id type;
switch (type_filter1) {
case SOLVER_TRANSACTION_OBSOLETED:
type = transaction_type(libsolv_transaction, p, common_mode);
break;
default:
type = transaction_type(
libsolv_transaction, p, common_mode | SOLVER_TRANSACTION_SHOW_ACTIVE | SOLVER_TRANSACTION_SHOW_ALL);
break;
}
if (type == type_filter1 || (type_filter2 && type == type_filter2)) {
result_ids.push_back(p);
}
}
return result_ids;
}
libdnf5::solv::IdQueue ModuleGoalPrivate::list_installs() {
return list_results(SOLVER_TRANSACTION_INSTALL, SOLVER_TRANSACTION_OBSOLETES);
}
std::vector<std::vector<std::tuple<ProblemRules, Id, Id, Id, std::string>>> ModuleGoalPrivate::get_problems() {
auto & pool = module_sack->p_impl->pool;
libdnf_assert_goal_resolved();
auto count_problems = static_cast<int>(libsolv_solver.problem_count());
if (count_problems == 0) {
return {};
}
// std::tuple<ProblemRules, Id source, Id dep, Id target, std::string>>
std::vector<std::vector<std::tuple<ProblemRules, Id, Id, Id, std::string>>> problems;
// libsolv counts problem from 1
for (int i = 1; i <= count_problems; ++i) {
auto problem_queue = libsolv_solver.findallproblemrules(i);
std::vector<std::tuple<ProblemRules, Id, Id, Id, std::string>> problem;
for (int j = 0; j < problem_queue.size(); ++j) {
Id rid = problem_queue[j];
auto descriptions_queue = libsolv_solver.allruleinfos(rid);
if (!descriptions_queue.empty()) {
for (int ir = 0; ir < descriptions_queue.size(); ir += 4) {
SolverRuleinfo type = static_cast<SolverRuleinfo>(descriptions_queue[ir]);
Id source = descriptions_queue[ir + 1];
Id target = descriptions_queue[ir + 2];
Id dep = descriptions_queue[ir + 3];
ProblemRules rule;
const char * solv_string = nullptr;
switch (type) {
case SOLVER_RULE_DISTUPGRADE:
rule = ProblemRules::RULE_MODULE_DISTUPGRADE;
break;
case SOLVER_RULE_INFARCH:
rule = ProblemRules::RULE_MODULE_INFARCH;
break;
case SOLVER_RULE_UPDATE:
rule = ProblemRules::RULE_MODULE_UPDATE;
break;
case SOLVER_RULE_JOB:
rule = ProblemRules::RULE_MODULE_JOB;
break;
case SOLVER_RULE_JOB_UNSUPPORTED:
rule = ProblemRules::RULE_MODULE_JOB_UNSUPPORTED;
break;
case SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP:
rule = ProblemRules::RULE_MODULE_JOB_NOTHING_PROVIDES_DEP;
break;
case SOLVER_RULE_JOB_UNKNOWN_PACKAGE:
rule = ProblemRules::RULE_MODULE_JOB_UNKNOWN_PACKAGE;
break;
case SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM:
rule = ProblemRules::RULE_MODULE_JOB_PROVIDED_BY_SYSTEM;
break;
case SOLVER_RULE_PKG:
rule = ProblemRules::RULE_MODULE_PKG;
break;
case SOLVER_RULE_BEST:
if (source > 0) {
rule = ProblemRules::RULE_MODULE_BEST_1;
break;
}
rule = ProblemRules::RULE_MODULE_BEST_2;
break;
case SOLVER_RULE_PKG_NOT_INSTALLABLE: {
Solvable * solvable = pool_id2solvable(pool, source);
if (pool_disabled_solvable(pool, solvable)) {
// TODO(jmracek) RULE_PKG_NOT_INSTALLABLE_4 not handled
rule = ProblemRules::RULE_MODULE_PKG_NOT_INSTALLABLE_1;
break;
}
if (solvable->arch && solvable->arch != ARCH_SRC && solvable->arch != ARCH_NOSRC &&
pool->id2arch && (solvable->arch > pool->lastarch || !pool->id2arch[solvable->arch])) {
rule = ProblemRules::RULE_MODULE_PKG_NOT_INSTALLABLE_2;
break;
}
rule = ProblemRules::RULE_MODULE_PKG_NOT_INSTALLABLE_3;
} break;
case SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP:
rule = ProblemRules::RULE_MODULE_PKG_NOTHING_PROVIDES_DEP;
break;
case SOLVER_RULE_PKG_SAME_NAME:
rule = ProblemRules::RULE_MODULE_PKG_SAME_NAME;
break;
case SOLVER_RULE_PKG_CONFLICTS:
rule = ProblemRules::RULE_MODULE_PKG_CONFLICTS;
break;
case SOLVER_RULE_PKG_OBSOLETES:
rule = ProblemRules::RULE_MODULE_PKG_OBSOLETES;
break;
case SOLVER_RULE_PKG_INSTALLED_OBSOLETES:
rule = ProblemRules::RULE_MODULE_PKG_INSTALLED_OBSOLETES;
break;
case SOLVER_RULE_PKG_IMPLICIT_OBSOLETES:
rule = ProblemRules::RULE_MODULE_PKG_IMPLICIT_OBSOLETES;
break;
case SOLVER_RULE_PKG_REQUIRES:
rule = ProblemRules::RULE_MODULE_PKG_REQUIRES;
break;
case SOLVER_RULE_PKG_SELF_CONFLICT:
rule = ProblemRules::RULE_MODULE_PKG_SELF_CONFLICT;
break;
case SOLVER_RULE_YUMOBS:
rule = ProblemRules::RULE_MODULE_YUMOBS;
break;
default:
rule = ProblemRules::RULE_MODULE_UNKNOWN;
solv_string = libsolv_solver.problemruleinfo2str(type, source, target, dep);
break;
}
problem.emplace_back(std::make_tuple(
rule, source, dep, target, solv_string ? std::string(solv_string) : std::string()));
}
}
}
problems.push_back(std::move(problem));
}
return problems;
}
// Report packages that have a conflict
libdnf5::solv::IdQueue ModuleGoalPrivate::list_conflicting() {
libdnf5::solv::IdQueue result_ids;
for (auto problem : get_problems()) {
for (auto i : problem) {
if (std::get<0>(i) == ProblemRules::RULE_MODULE_PKG_CONFLICTS ||
std::get<0>(i) == ProblemRules::RULE_MODULE_PKG_SAME_NAME) {
result_ids.push_back(std::get<1>(i));
result_ids.push_back(std::get<3>(i));
} else if (std::get<0>(i) == ProblemRules::RULE_MODULE_PKG_SELF_CONFLICT) {
result_ids.push_back(std::get<1>(i));
}
}
}
return result_ids;
}
void ModuleGoalPrivate::write_debugdata(const std::filesystem::path & abs_dest_dir) {
libdnf_assert_goal_resolved();
libsolv_solver.write_debugdata(abs_dest_dir);
}
} // namespace libdnf5::module
|
