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 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516
|
// 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/conf/vars.hpp"
#include "rpm/rpm_log_guard.hpp"
#include "utils/system.hpp"
#include "libdnf5/base/base.hpp"
#include "libdnf5/common/exception.hpp"
#include "libdnf5/rpm/arch.hpp"
#include "libdnf5/utils/bgettext/bgettext-mark-domain.h"
#include "libdnf5/utils/fs/file.hpp"
#include <dirent.h>
#include <rpm/rpmdb.h>
#include <rpm/rpmlib.h>
#include <rpm/rpmmacro.h>
#include <rpm/rpmts.h>
#include <stdlib.h>
#include <sys/auxv.h>
#include <sys/types.h>
#include <sys/utsname.h>
#include <algorithm>
#include <cstring>
#include <filesystem>
#include <memory>
#define ASCII_LOWERCASE "abcdefghijklmnopqrstuvwxyz"
#define ASCII_UPPERCASE "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define ASCII_LETTERS ASCII_LOWERCASE ASCII_UPPERCASE
#define DIGITS "0123456789"
extern char ** environ;
namespace libdnf5 {
static const std::unordered_set<std::string> READ_ONLY_VARIABLES = {};
static constexpr const char * DISTROVERPKGS[] = {
"system-release(releasever)",
"system-release",
"distribution-release(releasever)",
"distribution-release",
"redhat-release",
"suse-release"};
static constexpr const char * DISTROVER_MAJOR_PKG = "system-release(releasever_major)";
static constexpr const char * DISTROVER_MINOR_PKG = "system-release(releasever_minor)";
class Vars::Impl {
public:
Impl(const BaseWeakPtr & base);
private:
friend Vars;
std::map<std::string, Variable> variables;
BaseWeakPtr base;
};
Vars::Impl::Impl(const BaseWeakPtr & base) : base(base) {}
std::unique_ptr<std::string> Vars::detect_release(const BaseWeakPtr & base, const std::string & install_root_path) {
return std::get<0>(detect_releasevers(base, install_root_path));
}
std::tuple<std::unique_ptr<std::string>, std::unique_ptr<std::string>, std::unique_ptr<std::string>>
Vars::detect_releasevers(const BaseWeakPtr & base, const std::string & install_root_path) {
std::unique_ptr<std::string> releasever;
std::unique_ptr<std::string> releasever_major;
std::unique_ptr<std::string> releasever_minor;
libdnf5::rpm::RpmLogGuard rpm_log_guard(base);
auto ts = rpmtsCreate();
rpmtsSetRootDir(ts, install_root_path.c_str());
for (auto distroverpkg : DISTROVERPKGS) {
auto mi = rpmtsInitIterator(ts, RPMTAG_PROVIDENAME, distroverpkg, 0);
if (auto hdr = rpmdbNextIterator(mi)) {
const char * version = headerGetString(hdr, RPMTAG_VERSION);
const char * version_major = "";
const char * version_minor = "";
rpmds ds = rpmdsNew(hdr, RPMTAG_PROVIDENAME, 0);
while (rpmdsNext(ds) >= 0) {
if (rpmdsFlags(ds) == RPMSENSE_EQUAL) {
if (std::strcmp(rpmdsN(ds), distroverpkg) == 0) {
const char * evr = rpmdsEVR(ds);
if (evr && evr[0] != '\0') {
version = evr;
}
} else if (std::strcmp(rpmdsN(ds), DISTROVER_MAJOR_PKG) == 0) {
const char * evr = rpmdsEVR(ds);
if (evr && evr[0] != '\0') {
version_major = evr;
}
} else if (std::strcmp(rpmdsN(ds), DISTROVER_MINOR_PKG) == 0) {
const char * evr = rpmdsEVR(ds);
if (evr && evr[0] != '\0') {
version_minor = evr;
}
}
}
}
if (version) {
// Is the result of rpmdsEVR(ds) valid after rpmdsFree(ds)? Make a copy to be sure.
releasever = std::make_unique<std::string>(version);
}
if (version_major) {
releasever_major = std::make_unique<std::string>(version_major);
}
if (version_minor) {
releasever_minor = std::make_unique<std::string>(version_minor);
}
rpmdsFree(ds);
}
rpmdbFreeIterator(mi);
if (releasever) {
break;
}
}
rpmtsFree(ts);
return std::make_tuple(std::move(releasever), std::move(releasever_major), std::move(releasever_minor));
}
Vars::Vars(Base & base) : Vars(base.get_weak_ptr()) {}
Vars::Vars(const libdnf5::BaseWeakPtr & base) : p_impl(std::make_unique<Impl>(base)) {}
Vars::~Vars() = default;
const unsigned int MAXIMUM_EXPRESSION_DEPTH = 32;
// Expand variables in a subexpression
//
// @param text String with variable expressions
// @param depth The recursive depth
// @return Pair of the resulting string and the number of characters scanned in `text`
std::pair<std::string, size_t> Vars::substitute_expression(std::string_view text, unsigned int depth) const {
if (depth > MAXIMUM_EXPRESSION_DEPTH) {
return std::make_pair(std::string(text), text.length());
}
std::string res{text};
// The total number of characters read in the replacee
size_t total_scanned = 0;
size_t pos = 0;
while (pos < res.length()) {
if (res[pos] == '}' && depth > 0) {
return std::make_pair(res.substr(0, pos), total_scanned);
}
if (res[pos] == '\\') {
// Escape the next character (if there is one)
if (pos + 1 >= res.length()) {
break;
}
res.erase(pos, 1);
total_scanned += 2;
pos += 1;
continue;
}
if (res[pos] == '$') {
// variable expression starts after the $ and includes the braces
// ${variable:-word}
// ^-- pos_variable_expression
size_t pos_variable_expression = pos + 1;
if (pos_variable_expression >= res.length()) {
break;
}
// Does the variable expression use braces? If so, the variable name
// starts one character after the start of the variable_expression
bool has_braces;
size_t pos_variable;
if (res[pos_variable_expression] == '{') {
has_braces = true;
pos_variable = pos_variable_expression + 1;
if (pos_variable >= res.length()) {
break;
}
} else {
has_braces = false;
pos_variable = pos_variable_expression;
}
// Find the end of the variable name
auto it = std::find_if_not(res.begin() + static_cast<long>(pos_variable), res.end(), [](char c) {
return (c >= '0' && c <= '9') || (c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z') || c == '_';
});
auto pos_after_variable = static_cast<size_t>(std::distance(res.begin(), it));
// Find the substituting string and the end of the variable expression
auto variable_mapping = p_impl->variables.find(res.substr(pos_variable, pos_after_variable - pos_variable));
std::optional<std::string> subst_str{std::nullopt};
size_t pos_after_variable_expression;
if (has_braces) {
if (pos_after_variable >= res.length()) {
break;
}
if (res[pos_after_variable] == ':') {
if (pos_after_variable + 1 >= res.length()) {
break;
}
char expansion_mode = res[pos_after_variable + 1];
size_t pos_word = pos_after_variable + 2;
if (pos_word >= res.length()) {
break;
}
// Expand the default/alternate expression
auto word_str = std::string_view(res).substr(pos_word);
auto [expanded_word, scanned] = substitute_expression(word_str, depth + 1);
auto pos_after_word = pos_word + scanned;
if (pos_after_word >= res.length()) {
break;
}
if (res[pos_after_word] != '}') {
// The variable expression doesn't end in a '}',
// continue after the word and don't expand it
total_scanned += pos_after_word - pos;
pos = pos_after_word;
continue;
}
if (expansion_mode == '-') {
// ${variable:-word} (default value)
// If variable is unset or empty, the expansion of word is
// substituted. Otherwise, the value of variable is
// substituted.
if (variable_mapping == p_impl->variables.end() || variable_mapping->second.value.empty()) {
subst_str = expanded_word;
} else {
subst_str = variable_mapping->second.value;
}
} else if (expansion_mode == '+') {
// ${variable:+word} (alternate value)
// If variable is unset or empty nothing is substituted.
// Otherwise, the expansion of word is substituted.
if (variable_mapping == p_impl->variables.end() || variable_mapping->second.value.empty()) {
subst_str = "";
} else {
subst_str = expanded_word;
}
} else {
// Unknown expansion mode, continue after the ':'
pos = pos_after_variable + 1;
continue;
}
pos_after_variable_expression = pos_after_word + 1;
} else if (res[pos_after_variable] == '}') {
// ${variable}
if (variable_mapping != p_impl->variables.end()) {
subst_str = variable_mapping->second.value;
}
// Move past the closing '}'
pos_after_variable_expression = pos_after_variable + 1;
} else {
// Variable expression doesn't end in a '}', continue after the variable
pos = pos_after_variable;
continue;
}
} else {
// No braces, we have a $variable
if (variable_mapping != p_impl->variables.end()) {
subst_str = variable_mapping->second.value;
}
pos_after_variable_expression = pos_after_variable;
}
// If there is no substitution to make, move past the variable expression and continue.
if (!subst_str.has_value()) {
total_scanned += pos_after_variable_expression - pos;
pos = pos_after_variable_expression;
continue;
}
res.replace(pos, pos_after_variable_expression - pos, *subst_str);
total_scanned += pos_after_variable_expression - pos;
pos += subst_str->length();
} else {
total_scanned += 1;
pos += 1;
}
}
// We have reached the end of the text
if (depth > 0) {
// If we are in a subexpression and we didn't find a closing '}', make no substitutions.
return std::make_pair(std::string{text}, text.length());
}
return std::make_pair(res, text.length());
}
std::string Vars::substitute(const std::string & text) const {
return substitute_expression(text, 0).first;
}
std::tuple<std::string, std::string> Vars::split_releasever(const std::string & releasever) {
// Uses the same logic as splitReleaseverTo in libzypp
std::string releasever_major;
std::string releasever_minor;
const auto pos = releasever.find('.');
if (pos == std::string::npos) {
releasever_major = releasever;
} else {
releasever_major = releasever.substr(0, pos);
releasever_minor = releasever.substr(pos + 1);
}
return std::make_tuple(releasever_major, releasever_minor);
}
bool Vars::is_read_only(const std::string & name) const {
return READ_ONLY_VARIABLES.contains(name);
}
void Vars::set(const std::string & name, const std::string & value, Priority prio) {
if (is_read_only(name)) {
throw ReadOnlyVariableError(M_("Variable \"{}\" is read-only"), name);
}
// set_unsafe sets the variable without checking whether it's read-only
std::function<void(const std::string, const std::string, Priority)> set_unsafe =
[&](const std::string & name, const std::string & value, Priority prio) {
auto it = p_impl->variables.find(name);
// Do nothing if the var is already set with a higher priority
if (it != p_impl->variables.end() && prio < it->second.priority) {
return;
}
// Whenever releasever is set, split it into major and minor parts
if (name == "releasever") {
const auto [releasever_major, releasever_minor] = split_releasever(value);
if (!releasever_major.empty()) {
set_unsafe("releasever_major", releasever_major, prio);
}
if (!releasever_minor.empty()) {
set_unsafe("releasever_minor", releasever_minor, prio);
}
}
if (it == p_impl->variables.end()) {
p_impl->variables.insert({name, {value, prio}});
} else {
it->second.value = value;
it->second.priority = prio;
}
};
set_unsafe(name, value, prio);
}
bool Vars::unset(const std::string & name, Priority prio) {
auto it = p_impl->variables.find(name);
if (it == p_impl->variables.end()) {
return true;
}
if (is_read_only(name)) {
throw ReadOnlyVariableError(M_("Variable \"{}\" is read-only"), name);
}
// Do nothing if the var is already set with a higher priority
if (prio < it->second.priority) {
return false;
}
p_impl->variables.erase(it);
return true;
}
void Vars::set_lazy(
const std::string & name,
const std::function<const std::unique_ptr<const std::string>()> & get_value,
const Priority prio) {
auto it = p_impl->variables.find(name);
if (it == p_impl->variables.end() || prio > it->second.priority) {
const auto maybe_value = get_value();
if (maybe_value != nullptr) {
set(name, *maybe_value, prio);
}
}
}
void Vars::load(const std::string & installroot, const std::vector<std::string> & directories) {
load_from_env();
const std::filesystem::path installroot_path{installroot};
for (const auto & dir : directories) {
load_from_dir(installroot_path / std::filesystem::path(dir).relative_path());
}
detect_vars(installroot);
}
void Vars::detect_vars(const std::string & installroot) {
set_lazy("arch", []() -> auto { return std::make_unique<std::string>(utils::detect_arch()); }, Priority::AUTO);
utils::init_lib_rpm(get_value("arch").c_str());
set_lazy(
"basearch",
[this]() -> auto {
auto base_arch = libdnf5::rpm::get_base_arch(p_impl->variables["arch"].value);
return base_arch.empty() ? nullptr : std::make_unique<std::string>(std::move(base_arch));
},
Priority::AUTO);
auto it = p_impl->variables.find("releasever");
if (it == p_impl->variables.end() || it->second.priority <= Priority::AUTO) {
const auto & [releasever, releasever_major, releasever_minor] = detect_releasevers(p_impl->base, installroot);
if (releasever != nullptr) {
set("releasever", *releasever, Priority::AUTO);
}
if (releasever_major != nullptr) {
set("releasever_major", *releasever_major, Priority::AUTO);
}
if (releasever_minor != nullptr) {
set("releasever_minor", *releasever_minor, Priority::AUTO);
}
}
}
static void dir_close(DIR * d) {
closedir(d);
}
void Vars::load_from_dir(const std::string & directory) {
auto & logger = *p_impl->base->get_logger();
if (DIR * dir = opendir(directory.c_str())) {
std::unique_ptr<DIR, decltype(&dir_close)> dir_guard(dir, &dir_close);
while (auto ent = readdir(dir)) {
auto dname = ent->d_name;
if (dname[0] == '.' && (dname[1] == '\0' || (dname[1] == '.' && dname[2] == '\0')))
continue;
auto full_path = directory;
if (full_path.back() != '/') {
full_path += "/";
}
full_path += dname;
std::string line;
try {
utils::fs::File file(full_path, "r");
file.read_line(line);
} catch (const FileSystemError & e) {
logger.warning("Cannot load variable from file \"{}\": {}", full_path.c_str(), e.what());
continue;
}
set(dname, line, Priority::VARSDIR);
}
}
}
void Vars::load_from_env() {
if (!environ) {
return;
}
for (const char * const * var_ptr = environ; *var_ptr; ++var_ptr) {
auto var = *var_ptr;
if (auto eql_ptr = strchr(var, '=')) {
auto eql_idx = eql_ptr - var;
if (eql_idx == 4 && strncmp("DNF", var, 3) == 0 && isdigit(var[3]) != 0) {
// DNF[0-9]
set(std::string(var, static_cast<size_t>(eql_idx)), eql_ptr + 1, Priority::ENVIRONMENT);
} else if (
// DNF_VAR_[A-Za-z0-9_]+ , DNF_VAR_ prefix is cut off
eql_idx > 8 && strncmp("DNF_VAR_", var, 8) == 0 &&
static_cast<int>(strspn(var + 8, ASCII_LETTERS DIGITS "_")) == eql_idx - 8) {
set(std::string(var + 8, static_cast<size_t>(eql_idx - 8)), eql_ptr + 1, Priority::ENVIRONMENT);
}
}
}
}
const std::map<std::string, Vars::Variable> & Vars::get_variables() const {
return p_impl->variables;
}
bool Vars::contains(const std::string & name) const {
return p_impl->variables.find(name) != p_impl->variables.end();
}
const std::string & Vars::get_value(const std::string & name) const {
return p_impl->variables.at(name).value;
}
const Vars::Variable & Vars::get(const std::string & name) const {
return p_impl->variables.at(name);
}
} // namespace libdnf5
|