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
|
// 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 "utils/iniparser.hpp"
#include "libdnf5/utils/bgettext/bgettext-mark-domain.h"
namespace libdnf5 {
constexpr char DELIMITER = '\n';
namespace {
// Returns the position of the first ']' character that does not define a list/range.
std::size_t find_end_of_section_name(const std::string & str, std::size_t pos) {
if (pos >= str.size()) {
return std::string::npos;
}
bool range = false;
for (std::size_t idx = pos;; ++idx) {
const auto ch = str[idx];
if (ch == ']') {
if (range) {
range = false;
} else {
return idx;
}
} else if (ch == '[') {
range = true;
} else if (ch == '\0' || ch == '\n' || ch == '\r') {
return std::string::npos;
}
}
}
} // namespace
IniParser::IniParser(const std::string & file_path) : file(file_path, "r") {}
void IniParser::trim_value() noexcept {
auto end = value.find_last_not_of(DELIMITER);
if (end != std::string::npos) {
value.resize(end + 1);
}
if (value.length() > 1 && value.front() == value.back() && (value.front() == '\"' || value.front() == '\'')) {
value.erase(--value.end());
value.erase(value.begin());
}
}
IniParser::ItemType IniParser::next() {
bool previous_line_with_key_val = false;
raw_item.clear();
while (true) {
if (!line_ready) {
if (!file.read_line(line)) {
if (previous_line_with_key_val) {
trim_value();
return ItemType::KEY_VAL;
}
return ItemType::END_OF_INPUT;
}
++line_number;
line_ready = true;
}
// remove UTF-8 BOM (Byte order mark)
constexpr const char * utf8_bom = "\xEF\xBB\xBF";
if (line_number == 1 && line.compare(0, 3, utf8_bom) == 0) {
line.erase(0, 3);
}
if (line.empty() || line[0] == '#' || line[0] == ';') { // do not support [rR][eE][mM] comment
if (previous_line_with_key_val) {
trim_value();
return ItemType::KEY_VAL;
}
if (line.empty()) {
line_ready = false;
raw_item = DELIMITER;
return ItemType::EMPTY_LINE;
}
raw_item = line + DELIMITER;
line_ready = false;
return ItemType::COMMENT_LINE;
}
auto start = line.find_first_not_of(" \t\r");
if (start == std::string::npos) {
if (previous_line_with_key_val) {
value += DELIMITER;
raw_item += line + DELIMITER;
line_ready = false;
continue;
}
raw_item = line + DELIMITER;
line_ready = false;
return ItemType::EMPTY_LINE;
}
auto end = line.find_last_not_of(" \t\r");
if (previous_line_with_key_val && (start == 0 || line[start] == '[')) {
trim_value();
return ItemType::KEY_VAL;
}
if (line[start] == '[') {
auto end_sect_pos = find_end_of_section_name(line, ++start);
if (end_sect_pos == std::string::npos) {
throw IniParserMissingBracketError(M_("Missing ']' on line {}"), line_number);
}
if (end_sect_pos == start) {
throw IniParserEmptySectionNameError(M_("Empty section name on line {}"), line_number);
}
for (auto idx = end_sect_pos + 1; idx < end; ++idx) {
auto ch = line[idx];
if (ch == '#' || ch == ';') {
break;
}
if (ch != ' ' && ch != '\t' && ch != '\r') {
throw IniParserTextAfterSectionError(M_("Text after section on line {}"), line_number);
}
}
this->section = line.substr(start, end_sect_pos - start);
raw_item = line + DELIMITER;
line_ready = false;
return ItemType::SECTION;
}
if (section.empty()) {
throw IniParserMissingSectionHeaderError(M_("Missing section header on line {}"), line_number);
}
if (start > 0) {
if (!previous_line_with_key_val) {
throw IniParserIllegalContinuationLineError(M_("Illegal continuation line on line {}"), line_number);
}
value += DELIMITER + line.substr(start, end - start + 1);
raw_item += line + DELIMITER;
line_ready = false;
} else {
if (line[start] == '=') {
throw IniParserMissingKeyError(M_("Missing option name on line {}"), line_number);
}
auto eql_pos = line.find_first_of('=');
if (eql_pos == std::string::npos) {
throw IniParserMissingEqualError(M_("Missing '=' on line {}"), line_number);
}
auto endkeypos = line.find_last_not_of(" \t", eql_pos - 1);
auto valuepos = line.find_first_not_of(" \t", eql_pos + 1);
key = line.substr(start, endkeypos - start + 1);
if (valuepos != std::string::npos) {
value = line.substr(valuepos, end - valuepos + 1);
} else {
value.clear();
}
previous_line_with_key_val = true;
raw_item = line + DELIMITER;
line_ready = false;
}
}
}
} // namespace libdnf5
|
