blob: bc7431b6691ae871f9e5ce62037ad76eb0669fd7 [file] [log] [blame]
Václav Kubernát80aacc02018-08-22 17:41:54 +02001/*
2 * Copyright (C) 2018 CESNET, https://photonics.cesnet.cz/
3 * Copyright (C) 2018 FIT CVUT, https://fit.cvut.cz/
4 *
5 * Written by Václav Kubernát <kubervac@fit.cvut.cz>
6 *
7*/
8
Václav Kubernátab612e92019-11-26 19:51:31 +01009#include <libyang/Tree_Data.hpp>
10#include <libyang/Tree_Schema.hpp>
Jan Kundrát68d4a2c2018-10-01 17:17:09 +020011#include <sysrepo-cpp/Session.hpp>
Václav Kubernátab612e92019-11-26 19:51:31 +010012#include "libyang_utils.hpp"
Václav Kubernát80aacc02018-08-22 17:41:54 +020013#include "sysrepo_access.hpp"
Jan Kundrát6ee84792020-01-24 01:43:36 +010014#include "utils.hpp"
Václav Kubernáta6c5fff2018-09-07 15:16:25 +020015#include "yang_schema.hpp"
Václav Kubernát80aacc02018-08-22 17:41:54 +020016
Jan Kundrát68d4a2c2018-10-01 17:17:09 +020017leaf_data_ leafValueFromVal(const sysrepo::S_Val& value)
Václav Kubernátc89736b2018-08-30 16:14:05 +020018{
Václav Kubernátb6ff0b62018-08-30 16:14:53 +020019 using namespace std::string_literals;
Václav Kubernátc89736b2018-08-30 16:14:05 +020020 switch (value->type()) {
Ivona Oboňová88c78ca2019-07-02 18:40:07 +020021 case SR_INT8_T:
22 return value->data()->get_int8();
23 case SR_UINT8_T:
24 return value->data()->get_uint8();
25 case SR_INT16_T:
26 return value->data()->get_int16();
27 case SR_UINT16_T:
28 return value->data()->get_uint16();
Václav Kubernátb6ff0b62018-08-30 16:14:53 +020029 case SR_INT32_T:
30 return value->data()->get_int32();
31 case SR_UINT32_T:
32 return value->data()->get_uint32();
Ivona Oboňová88c78ca2019-07-02 18:40:07 +020033 case SR_INT64_T:
34 return value->data()->get_int64();
35 case SR_UINT64_T:
36 return value->data()->get_uint64();
Václav Kubernátb6ff0b62018-08-30 16:14:53 +020037 case SR_BOOL_T:
38 return value->data()->get_bool();
39 case SR_STRING_T:
40 return std::string(value->data()->get_string());
41 case SR_ENUM_T:
Václav Kubernát152ce222019-12-19 12:23:32 +010042 return enum_{std::string(value->data()->get_enum())};
Jan Kundrát0d8abd12020-05-07 02:00:14 +020043 case SR_IDENTITYREF_T:
44 {
45 auto pair = splitModuleNode(value->data()->get_identityref());
46 return identityRef_{*pair.first, pair.second};
47 }
Václav Kubernátb6ff0b62018-08-30 16:14:53 +020048 case SR_DECIMAL64_T:
49 return value->data()->get_decimal64();
50 case SR_CONTAINER_T:
Václav Kubernát144729d2020-01-08 15:20:35 +010051 return special_{SpecialValue::Container};
Václav Kubernátb6ff0b62018-08-30 16:14:53 +020052 case SR_CONTAINER_PRESENCE_T:
Václav Kubernát144729d2020-01-08 15:20:35 +010053 return special_{SpecialValue::PresenceContainer};
Václav Kubernátb6ff0b62018-08-30 16:14:53 +020054 case SR_LIST_T:
Václav Kubernát144729d2020-01-08 15:20:35 +010055 return special_{SpecialValue::List};
Václav Kubernátb6ff0b62018-08-30 16:14:53 +020056 default: // TODO: implement all types
57 return value->val_to_string();
Václav Kubernátc89736b2018-08-30 16:14:05 +020058 }
59}
Václav Kubernát80aacc02018-08-22 17:41:54 +020060
Jan Kundrát68d4a2c2018-10-01 17:17:09 +020061struct valFromValue : boost::static_visitor<sysrepo::S_Val> {
62 sysrepo::S_Val operator()(const enum_& value) const
Václav Kubernát80aacc02018-08-22 17:41:54 +020063 {
Jan Kundrát68d4a2c2018-10-01 17:17:09 +020064 return std::make_shared<sysrepo::Val>(value.m_value.c_str(), SR_ENUM_T);
Václav Kubernát80aacc02018-08-22 17:41:54 +020065 }
66
Václav Kubernátab538992019-03-06 15:30:50 +010067 sysrepo::S_Val operator()(const binary_& value) const
68 {
69 return std::make_shared<sysrepo::Val>(value.m_value.c_str(), SR_BINARY_T);
70 }
71
Václav Kubernáteeb38842019-03-20 19:46:05 +010072 sysrepo::S_Val operator()(const identityRef_& value) const
73 {
Jan Kundrát0d8abd12020-05-07 02:00:14 +020074 auto res = value.m_prefix ? (value.m_prefix.value().m_name + ":" + value.m_value) : value.m_value;
Václav Kubernáteeb38842019-03-20 19:46:05 +010075 return std::make_shared<sysrepo::Val>(res.c_str(), SR_IDENTITYREF_T);
76 }
77
Václav Kubernát144729d2020-01-08 15:20:35 +010078 sysrepo::S_Val operator()(const special_& value) const
79 {
80 throw std::runtime_error("Tried constructing S_Val from a " + specialValueToString(value));
81 }
82
Jan Kundrát68d4a2c2018-10-01 17:17:09 +020083 sysrepo::S_Val operator()(const std::string& value) const
Václav Kubernát80aacc02018-08-22 17:41:54 +020084 {
Jan Kundrát68d4a2c2018-10-01 17:17:09 +020085 return std::make_shared<sysrepo::Val>(value.c_str());
Václav Kubernát80aacc02018-08-22 17:41:54 +020086 }
87
Jan Kundrátbd178362019-02-05 19:00:04 +010088 template <typename T>
89 sysrepo::S_Val operator()(const T& value) const
Václav Kubernát80aacc02018-08-22 17:41:54 +020090 {
Jan Kundrát68d4a2c2018-10-01 17:17:09 +020091 return std::make_shared<sysrepo::Val>(value);
Václav Kubernát80aacc02018-08-22 17:41:54 +020092 }
93};
94
Jan Kundrát6ee84792020-01-24 01:43:36 +010095struct updateSrValFromValue : boost::static_visitor<void> {
96 std::string xpath;
97 sysrepo::S_Val v;
98 updateSrValFromValue(const std::string& xpath, sysrepo::S_Val v)
99 : xpath(xpath)
100 , v(v)
101 {
102 }
103
104 void operator()(const enum_& value) const
105 {
106 v->set(xpath.c_str(), value.m_value.c_str(), SR_ENUM_T);
107 }
108
109 void operator()(const binary_& value) const
110 {
111 v->set(xpath.c_str(), value.m_value.c_str(), SR_BINARY_T);
112 }
113
114 void operator()(const identityRef_& value) const
115 {
116 v->set(xpath.c_str(), (value.m_prefix.value().m_name + ":" + value.m_value).c_str(), SR_IDENTITYREF_T);
117 }
118
119 void operator()(const special_& value) const
120 {
121 throw std::runtime_error("Tried constructing S_Val from a " + specialValueToString(value));
122 }
123
124 void operator()(const std::string& value) const
125 {
126 v->set(xpath.c_str(), value.c_str(), SR_STRING_T);
127 }
128
129 template <typename T>
130 void operator()(const T value) const
131 {
132 v->set(xpath.c_str(), value);
133 }
134};
135
Václav Kubernát812ee282018-08-30 17:10:03 +0200136SysrepoAccess::~SysrepoAccess() = default;
Václav Kubernát80aacc02018-08-22 17:41:54 +0200137
Václav Kubernát715c85c2020-04-14 01:46:08 +0200138sr_datastore_t toSrDatastore(Datastore datastore)
139{
140 switch (datastore) {
141 case Datastore::Running:
142 return SR_DS_RUNNING;
143 case Datastore::Startup:
144 return SR_DS_STARTUP;
145 }
146 __builtin_unreachable();
147}
148
149SysrepoAccess::SysrepoAccess(const std::string& appname, const Datastore datastore)
Jan Kundrát68d4a2c2018-10-01 17:17:09 +0200150 : m_connection(new sysrepo::Connection(appname.c_str()))
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200151 , m_schema(new YangSchema())
Václav Kubernát80aacc02018-08-22 17:41:54 +0200152{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200153 try {
Václav Kubernát715c85c2020-04-14 01:46:08 +0200154 m_session = std::make_shared<sysrepo::Session>(m_connection, toSrDatastore(datastore));
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200155 } catch (sysrepo::sysrepo_exception& ex) {
156 reportErrors();
157 }
Václav Kubernátb52dc252019-12-04 13:03:39 +0100158
159 // If fetching a submodule, sysrepo::Session::get_schema will determine the revision from the main module.
160 // That's why submoduleRevision is ignored.
161 m_schema->registerModuleCallback([this](const char* moduleName, const char* revision, const char* submodule, [[maybe_unused]] const char* submoduleRevision) {
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200162 return fetchSchema(moduleName, revision, submodule);
163 });
164
Václav Kubernátbf9c6112019-11-04 16:03:35 +0100165 for (const auto& it : listSchemas()) {
166 if (it->implemented()) {
167 m_schema->loadModule(it->module_name());
168 for (unsigned int i = 0; i < it->enabled_feature_cnt(); i++) {
169 m_schema->enableFeature(it->module_name(), it->enabled_features(i));
170 }
171 }
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200172 }
Václav Kubernát80aacc02018-08-22 17:41:54 +0200173}
174
Jan Kundrátb331b552020-01-23 15:25:29 +0100175DatastoreAccess::Tree SysrepoAccess::getItems(const std::string& path)
Václav Kubernát80aacc02018-08-22 17:41:54 +0200176{
Václav Kubernátb6ff0b62018-08-30 16:14:53 +0200177 using namespace std::string_literals;
Jan Kundrátb331b552020-01-23 15:25:29 +0100178 Tree res;
Václav Kubernát80aacc02018-08-22 17:41:54 +0200179
Václav Kubernátb6ff0b62018-08-30 16:14:53 +0200180 auto fillMap = [&res](auto items) {
181 if (!items)
182 return;
183 for (unsigned int i = 0; i < items->val_cnt(); i++) {
184 res.emplace(items->val(i)->xpath(), leafValueFromVal(items->val(i)));
185 }
186 };
Václav Kubernátc89736b2018-08-30 16:14:05 +0200187
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200188 try {
189 if (path == "/") {
190 // Sysrepo doesn't have a root node ("/"), so we take all top-level nodes from all schemas
191 auto schemas = m_session->list_schemas();
192 for (unsigned int i = 0; i < schemas->schema_cnt(); i++) {
193 fillMap(m_session->get_items(("/"s + schemas->schema(i)->module_name() + ":*//.").c_str()));
194 }
195 } else {
196 fillMap(m_session->get_items((path + "//.").c_str()));
Václav Kubernátb6ff0b62018-08-30 16:14:53 +0200197 }
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200198 } catch (sysrepo::sysrepo_exception& ex) {
199 reportErrors();
Václav Kubernátc89736b2018-08-30 16:14:05 +0200200 }
Václav Kubernát80aacc02018-08-22 17:41:54 +0200201 return res;
202}
203
204void SysrepoAccess::setLeaf(const std::string& path, leaf_data_ value)
205{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200206 try {
207 m_session->set_item(path.c_str(), boost::apply_visitor(valFromValue(), value));
208 } catch (sysrepo::sysrepo_exception& ex) {
209 reportErrors();
210 }
Václav Kubernát80aacc02018-08-22 17:41:54 +0200211}
212
213void SysrepoAccess::createPresenceContainer(const std::string& path)
214{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200215 try {
216 m_session->set_item(path.c_str());
217 } catch (sysrepo::sysrepo_exception& ex) {
218 reportErrors();
219 }
Václav Kubernát80aacc02018-08-22 17:41:54 +0200220}
221
222void SysrepoAccess::deletePresenceContainer(const std::string& path)
223{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200224 try {
225 m_session->delete_item(path.c_str());
226 } catch (sysrepo::sysrepo_exception& ex) {
227 reportErrors();
228 }
Václav Kubernát80aacc02018-08-22 17:41:54 +0200229}
Václav Kubernát812ee282018-08-30 17:10:03 +0200230
Václav Kubernátf5f64f02019-03-19 17:15:47 +0100231void SysrepoAccess::createListInstance(const std::string& path)
232{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200233 try {
234 m_session->set_item(path.c_str());
235 } catch (sysrepo::sysrepo_exception& ex) {
236 reportErrors();
237 }
Václav Kubernátf5f64f02019-03-19 17:15:47 +0100238}
239
240void SysrepoAccess::deleteListInstance(const std::string& path)
241{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200242 try {
243 m_session->delete_item(path.c_str());
244 } catch (sysrepo::sysrepo_exception& ex) {
245 reportErrors();
246 }
Václav Kubernátf5f64f02019-03-19 17:15:47 +0100247}
248
Václav Kubernát812ee282018-08-30 17:10:03 +0200249void SysrepoAccess::commitChanges()
250{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200251 try {
252 m_session->commit();
253 } catch (sysrepo::sysrepo_exception& ex) {
254 reportErrors();
255 }
Václav Kubernát812ee282018-08-30 17:10:03 +0200256}
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200257
Václav Kubernát6d791432018-10-25 16:00:35 +0200258void SysrepoAccess::discardChanges()
259{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200260 try {
261 m_session->discard_changes();
262 } catch (sysrepo::sysrepo_exception& ex) {
263 reportErrors();
264 }
Václav Kubernát6d791432018-10-25 16:00:35 +0200265}
266
Jan Kundrát6ee84792020-01-24 01:43:36 +0100267DatastoreAccess::Tree SysrepoAccess::executeRpc(const std::string &path, const Tree &input)
268{
269 auto srInput = std::make_shared<sysrepo::Vals>(input.size());
270 {
271 size_t i = 0;
272 for (const auto& [k, v] : input) {
273 boost::apply_visitor(updateSrValFromValue(joinPaths(path, k), srInput->val(i)), v);
274 ++i;
275 }
276 }
277 auto output = m_session->rpc_send(path.c_str(), srInput);
278 Tree res;
279 for (size_t i = 0; i < output->val_cnt(); ++i) {
280 const auto& v = output->val(i);
281 res.emplace(std::string(v->xpath()).substr(joinPaths(path, "/").size()), leafValueFromVal(v));
282 }
283 return res;
284}
285
Václav Kubernát7160a132020-04-03 02:11:01 +0200286void SysrepoAccess::copyConfig(const Datastore source, const Datastore destination)
287{
288 m_session->copy_config(nullptr, toSrDatastore(source), toSrDatastore(destination));
289 if (destination == Datastore::Running) {
290 m_session->refresh();
291 }
292}
293
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200294std::string SysrepoAccess::fetchSchema(const char* module, const char* revision, const char* submodule)
295{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200296 std::string schema;
297 try {
Václav Kubernátb52dc252019-12-04 13:03:39 +0100298 schema = m_session->get_schema(module, revision, submodule, SR_SCHEMA_YANG);
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200299 } catch (sysrepo::sysrepo_exception& ex) {
300 reportErrors();
301 }
302
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200303 if (schema.empty())
304 throw std::runtime_error(std::string("Module ") + module + " not available");
305
306 return schema;
307}
308
Václav Kubernátbf9c6112019-11-04 16:03:35 +0100309std::vector<std::shared_ptr<sysrepo::Yang_Schema>> SysrepoAccess::listSchemas()
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200310{
Václav Kubernátbf9c6112019-11-04 16:03:35 +0100311 std::vector<sysrepo::S_Yang_Schema> res;
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200312 std::shared_ptr<sysrepo::Yang_Schemas> schemas;
313 try {
314 schemas = m_session->list_schemas();
315 } catch (sysrepo::sysrepo_exception& ex) {
316 reportErrors();
317 }
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200318 for (unsigned int i = 0; i < schemas->schema_cnt(); i++) {
319 auto schema = schemas->schema(i);
Václav Kubernátbf9c6112019-11-04 16:03:35 +0100320 res.push_back(schema);
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200321 }
322 return res;
323}
324
325std::shared_ptr<Schema> SysrepoAccess::schema()
326{
327 return m_schema;
328}
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200329
330[[noreturn]] void SysrepoAccess::reportErrors()
331{
332 // I only use get_last_errors to get error info, since the error code from
333 // sysrepo_exception doesn't really give any meaningful information. For
334 // example an "invalid argument" error could mean a node isn't enabled, or
335 // it could mean something totally different and there is no documentation
336 // for that, so it's better to just use the message sysrepo gives me.
337 auto srErrors = m_session->get_last_errors();
338 std::vector<DatastoreError> res;
339
340 for (size_t i = 0; i < srErrors->error_cnt(); i++) {
341 auto error = srErrors->error(i);
342 res.emplace_back(error->message(), error->xpath() ? std::optional<std::string>{error->xpath()} : std::nullopt);
343 }
344
345 throw DatastoreException(res);
346}
Václav Kubernátab612e92019-11-26 19:51:31 +0100347
348std::vector<ListInstance> SysrepoAccess::listInstances(const std::string& path)
349{
350 std::vector<ListInstance> res;
351 auto lists = getItems(path);
352
353 decltype(lists) instances;
354 auto wantedTree = *(m_schema->dataNodeFromPath(path)->find_path(path.c_str())->data().begin());
355 std::copy_if(lists.begin(), lists.end(), std::inserter(instances, instances.end()), [this, pathToCheck=wantedTree->schema()->path()](const auto& item) {
356 // This filters out non-instances.
357 if (item.second.type() != typeid(special_) || boost::get<special_>(item.second).m_value != SpecialValue::List) {
358 return false;
359 }
360
361 // Now, getItems is recursive: it gives everything including nested lists. So I try create a tree from the instance...
362 auto instanceTree = *(m_schema->dataNodeFromPath(item.first)->find_path(item.first.c_str())->data().begin());
363 // And then check if its schema path matches the list we actually want. This filters out lists which are not the ones I requested.
364 return instanceTree->schema()->path() == pathToCheck;
365 });
366
367 // If there are no instances, then just return
368 if (instances.empty()) {
369 return res;
370 }
371
372 // I need to find out which keys does the list have. To do that, I create a
373 // tree from the first instance. This is gives me some top level node,
374 // which will be our list in case out list is a top-level node. In case it
375 // isn't, we have call find_path on the top level node. After that, I just
376 // retrieve the keys.
377 auto topLevelTree = m_schema->dataNodeFromPath(instances.begin()->first);
378 auto list = *(topLevelTree->find_path(path.c_str())->data().begin());
379 auto keys = libyang::Schema_Node_List{list->schema()}.keys();
380
381 // Creating a full tree at the same time from the values sysrepo gives me
382 // would be a pain (and after sysrepo switches to libyang meaningless), so
383 // I just use this algorithm to create data nodes one by one and get the
384 // key values from them.
385 for (const auto& instance : instances) {
386 auto wantedList = *(m_schema->dataNodeFromPath(instance.first)->find_path(path.c_str())->data().begin());
387 ListInstance instanceRes;
388 for (const auto& key : keys) {
389 auto vec = wantedList->find_path(key->name())->data();
390 auto leaf = libyang::Data_Node_Leaf_List{*(vec.begin())};
391 instanceRes.emplace(key->name(), leafValueFromValue(leaf.value(), leaf.leaf_type()->base()));
392 }
393 res.push_back(instanceRes);
394 }
395
396 return res;
397}