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
|
// 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 "solver.hpp"
#include "libdnf5/utils/bgettext/bgettext-mark-domain.h"
#include <filesystem>
extern "C" {
#include <solv/solver.h>
#include <solv/testcase.h>
}
#define solver_initialized_assert() libdnf_assert(solver, "Solver is not initialized.")
namespace libdnf5::solv {
Solver::Solver(Pool & pool) {
solver = ::solver_create(*pool);
}
Solver::~Solver() {
if (solver) {
::solver_free(solver);
}
}
void Solver::init(::Pool * pool) {
if (solver) {
::solver_free(solver);
}
solver = ::solver_create(pool);
}
void Solver::init(Pool & pool) {
init(*pool);
}
void Solver::reset() {
if (solver) {
::solver_free(solver);
solver = nullptr;
}
}
void Solver::write_debugdata(std::filesystem::path debug_dir, bool with_transaction) {
solver_initialized_assert();
std::error_code ec;
std::filesystem::create_directories(debug_dir, ec);
for (const auto & dir_entry : std::filesystem::directory_iterator(debug_dir, ec)) {
std::filesystem::remove(dir_entry);
}
auto ret = ::testcase_write(
solver,
debug_dir.c_str(),
with_transaction ? TESTCASE_RESULT_TRANSACTION | TESTCASE_RESULT_PROBLEMS : 0,
NULL,
NULL);
if (ret == 0) {
std::string libsolv_err_msg = ::pool_errstr(solver->pool);
throw RuntimeError(M_("Writing debugsolver data into \"{}\" failed: {}"), debug_dir.native(), libsolv_err_msg);
}
}
int Solver::solve(IdQueue & job) {
solver_initialized_assert();
return ::solver_solve(solver, &job.get_queue());
}
IdQueue Solver::get_unneeded() {
solver_initialized_assert();
IdQueue unneeded_queue;
::pool_createwhatprovides(solver->pool);
::solver_get_unneeded(solver, &unneeded_queue.get_queue(), 0);
return unneeded_queue;
}
int Solver::set_flag(int flag, int value) {
solver_initialized_assert();
return ::solver_set_flag(solver, flag, value);
}
int Solver::get_decisionlevel(Id p) {
solver_initialized_assert();
return ::solver_get_decisionlevel(solver, p);
}
::Transaction * Solver::create_transaction() {
solver_initialized_assert();
return ::solver_create_transaction(solver);
}
unsigned int Solver::problem_count() {
solver_initialized_assert();
return ::solver_problem_count(solver);
}
IdQueue Solver::findallproblemrules(Id problem) {
solver_initialized_assert();
IdQueue rules;
::solver_findallproblemrules(solver, problem, &rules.get_queue());
return rules;
}
IdQueue Solver::allruleinfos(Id rid) {
solver_initialized_assert();
IdQueue infos;
::solver_allruleinfos(solver, rid, &infos.get_queue());
return infos;
}
const char * Solver::problemruleinfo2str(SolverRuleinfo type, Id source, Id target, Id dep) {
solver_initialized_assert();
return ::solver_problemruleinfo2str(solver, type, source, target, dep);
}
int Solver::describe_decision(Id p, Id * infop) {
solver_initialized_assert();
return ::solver_describe_decision(solver, p, infop);
}
SolverRuleinfo Solver::ruleclass(Id rid) {
solver_initialized_assert();
return ::solver_ruleclass(solver, rid);
}
IdQueue Solver::get_cleandeps() {
solver_initialized_assert();
IdQueue deps;
::solver_get_cleandeps(solver, &deps.get_queue());
return deps;
}
} // namespace libdnf5::solv
|
