blob: 7115ad755207460fcaba2b8f7b89b640cc436a24 [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())};
Václav Kubernátb6ff0b62018-08-30 16:14:53 +020043 case SR_DECIMAL64_T:
44 return value->data()->get_decimal64();
45 case SR_CONTAINER_T:
Václav Kubernát144729d2020-01-08 15:20:35 +010046 return special_{SpecialValue::Container};
Václav Kubernátb6ff0b62018-08-30 16:14:53 +020047 case SR_CONTAINER_PRESENCE_T:
Václav Kubernát144729d2020-01-08 15:20:35 +010048 return special_{SpecialValue::PresenceContainer};
Václav Kubernátb6ff0b62018-08-30 16:14:53 +020049 case SR_LIST_T:
Václav Kubernát144729d2020-01-08 15:20:35 +010050 return special_{SpecialValue::List};
Václav Kubernátb6ff0b62018-08-30 16:14:53 +020051 default: // TODO: implement all types
52 return value->val_to_string();
Václav Kubernátc89736b2018-08-30 16:14:05 +020053 }
54}
Václav Kubernát80aacc02018-08-22 17:41:54 +020055
Jan Kundrát68d4a2c2018-10-01 17:17:09 +020056struct valFromValue : boost::static_visitor<sysrepo::S_Val> {
57 sysrepo::S_Val operator()(const enum_& value) const
Václav Kubernát80aacc02018-08-22 17:41:54 +020058 {
Jan Kundrát68d4a2c2018-10-01 17:17:09 +020059 return std::make_shared<sysrepo::Val>(value.m_value.c_str(), SR_ENUM_T);
Václav Kubernát80aacc02018-08-22 17:41:54 +020060 }
61
Václav Kubernátab538992019-03-06 15:30:50 +010062 sysrepo::S_Val operator()(const binary_& value) const
63 {
64 return std::make_shared<sysrepo::Val>(value.m_value.c_str(), SR_BINARY_T);
65 }
66
Václav Kubernáteeb38842019-03-20 19:46:05 +010067 sysrepo::S_Val operator()(const identityRef_& value) const
68 {
69 auto res = value.m_prefix.value().m_name + ":" + value.m_value;
70 return std::make_shared<sysrepo::Val>(res.c_str(), SR_IDENTITYREF_T);
71 }
72
Václav Kubernát144729d2020-01-08 15:20:35 +010073 sysrepo::S_Val operator()(const special_& value) const
74 {
75 throw std::runtime_error("Tried constructing S_Val from a " + specialValueToString(value));
76 }
77
Jan Kundrát68d4a2c2018-10-01 17:17:09 +020078 sysrepo::S_Val operator()(const std::string& value) const
Václav Kubernát80aacc02018-08-22 17:41:54 +020079 {
Jan Kundrát68d4a2c2018-10-01 17:17:09 +020080 return std::make_shared<sysrepo::Val>(value.c_str());
Václav Kubernát80aacc02018-08-22 17:41:54 +020081 }
82
Jan Kundrátbd178362019-02-05 19:00:04 +010083 template <typename T>
84 sysrepo::S_Val operator()(const T& value) const
Václav Kubernát80aacc02018-08-22 17:41:54 +020085 {
Jan Kundrát68d4a2c2018-10-01 17:17:09 +020086 return std::make_shared<sysrepo::Val>(value);
Václav Kubernát80aacc02018-08-22 17:41:54 +020087 }
88};
89
Jan Kundrát6ee84792020-01-24 01:43:36 +010090struct updateSrValFromValue : boost::static_visitor<void> {
91 std::string xpath;
92 sysrepo::S_Val v;
93 updateSrValFromValue(const std::string& xpath, sysrepo::S_Val v)
94 : xpath(xpath)
95 , v(v)
96 {
97 }
98
99 void operator()(const enum_& value) const
100 {
101 v->set(xpath.c_str(), value.m_value.c_str(), SR_ENUM_T);
102 }
103
104 void operator()(const binary_& value) const
105 {
106 v->set(xpath.c_str(), value.m_value.c_str(), SR_BINARY_T);
107 }
108
109 void operator()(const identityRef_& value) const
110 {
111 v->set(xpath.c_str(), (value.m_prefix.value().m_name + ":" + value.m_value).c_str(), SR_IDENTITYREF_T);
112 }
113
114 void operator()(const special_& value) const
115 {
116 throw std::runtime_error("Tried constructing S_Val from a " + specialValueToString(value));
117 }
118
119 void operator()(const std::string& value) const
120 {
121 v->set(xpath.c_str(), value.c_str(), SR_STRING_T);
122 }
123
124 template <typename T>
125 void operator()(const T value) const
126 {
127 v->set(xpath.c_str(), value);
128 }
129};
130
Václav Kubernát812ee282018-08-30 17:10:03 +0200131SysrepoAccess::~SysrepoAccess() = default;
Václav Kubernát80aacc02018-08-22 17:41:54 +0200132
Václav Kubernát715c85c2020-04-14 01:46:08 +0200133sr_datastore_t toSrDatastore(Datastore datastore)
134{
135 switch (datastore) {
136 case Datastore::Running:
137 return SR_DS_RUNNING;
138 case Datastore::Startup:
139 return SR_DS_STARTUP;
140 }
141 __builtin_unreachable();
142}
143
144SysrepoAccess::SysrepoAccess(const std::string& appname, const Datastore datastore)
Jan Kundrát68d4a2c2018-10-01 17:17:09 +0200145 : m_connection(new sysrepo::Connection(appname.c_str()))
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200146 , m_schema(new YangSchema())
Václav Kubernát80aacc02018-08-22 17:41:54 +0200147{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200148 try {
Václav Kubernát715c85c2020-04-14 01:46:08 +0200149 m_session = std::make_shared<sysrepo::Session>(m_connection, toSrDatastore(datastore));
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200150 } catch (sysrepo::sysrepo_exception& ex) {
151 reportErrors();
152 }
Václav Kubernátb52dc252019-12-04 13:03:39 +0100153
154 // If fetching a submodule, sysrepo::Session::get_schema will determine the revision from the main module.
155 // That's why submoduleRevision is ignored.
156 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 +0200157 return fetchSchema(moduleName, revision, submodule);
158 });
159
Václav Kubernátbf9c6112019-11-04 16:03:35 +0100160 for (const auto& it : listSchemas()) {
161 if (it->implemented()) {
162 m_schema->loadModule(it->module_name());
163 for (unsigned int i = 0; i < it->enabled_feature_cnt(); i++) {
164 m_schema->enableFeature(it->module_name(), it->enabled_features(i));
165 }
166 }
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200167 }
Václav Kubernát80aacc02018-08-22 17:41:54 +0200168}
169
Jan Kundrátb331b552020-01-23 15:25:29 +0100170DatastoreAccess::Tree SysrepoAccess::getItems(const std::string& path)
Václav Kubernát80aacc02018-08-22 17:41:54 +0200171{
Václav Kubernátb6ff0b62018-08-30 16:14:53 +0200172 using namespace std::string_literals;
Jan Kundrátb331b552020-01-23 15:25:29 +0100173 Tree res;
Václav Kubernát80aacc02018-08-22 17:41:54 +0200174
Václav Kubernátb6ff0b62018-08-30 16:14:53 +0200175 auto fillMap = [&res](auto items) {
176 if (!items)
177 return;
178 for (unsigned int i = 0; i < items->val_cnt(); i++) {
179 res.emplace(items->val(i)->xpath(), leafValueFromVal(items->val(i)));
180 }
181 };
Václav Kubernátc89736b2018-08-30 16:14:05 +0200182
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200183 try {
184 if (path == "/") {
185 // Sysrepo doesn't have a root node ("/"), so we take all top-level nodes from all schemas
186 auto schemas = m_session->list_schemas();
187 for (unsigned int i = 0; i < schemas->schema_cnt(); i++) {
188 fillMap(m_session->get_items(("/"s + schemas->schema(i)->module_name() + ":*//.").c_str()));
189 }
190 } else {
191 fillMap(m_session->get_items((path + "//.").c_str()));
Václav Kubernátb6ff0b62018-08-30 16:14:53 +0200192 }
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200193 } catch (sysrepo::sysrepo_exception& ex) {
194 reportErrors();
Václav Kubernátc89736b2018-08-30 16:14:05 +0200195 }
Václav Kubernát80aacc02018-08-22 17:41:54 +0200196 return res;
197}
198
199void SysrepoAccess::setLeaf(const std::string& path, leaf_data_ value)
200{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200201 try {
202 m_session->set_item(path.c_str(), boost::apply_visitor(valFromValue(), value));
203 } catch (sysrepo::sysrepo_exception& ex) {
204 reportErrors();
205 }
Václav Kubernát80aacc02018-08-22 17:41:54 +0200206}
207
208void SysrepoAccess::createPresenceContainer(const std::string& path)
209{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200210 try {
211 m_session->set_item(path.c_str());
212 } catch (sysrepo::sysrepo_exception& ex) {
213 reportErrors();
214 }
Václav Kubernát80aacc02018-08-22 17:41:54 +0200215}
216
217void SysrepoAccess::deletePresenceContainer(const std::string& path)
218{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200219 try {
220 m_session->delete_item(path.c_str());
221 } catch (sysrepo::sysrepo_exception& ex) {
222 reportErrors();
223 }
Václav Kubernát80aacc02018-08-22 17:41:54 +0200224}
Václav Kubernát812ee282018-08-30 17:10:03 +0200225
Václav Kubernátf5f64f02019-03-19 17:15:47 +0100226void SysrepoAccess::createListInstance(const std::string& path)
227{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200228 try {
229 m_session->set_item(path.c_str());
230 } catch (sysrepo::sysrepo_exception& ex) {
231 reportErrors();
232 }
Václav Kubernátf5f64f02019-03-19 17:15:47 +0100233}
234
235void SysrepoAccess::deleteListInstance(const std::string& path)
236{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200237 try {
238 m_session->delete_item(path.c_str());
239 } catch (sysrepo::sysrepo_exception& ex) {
240 reportErrors();
241 }
Václav Kubernátf5f64f02019-03-19 17:15:47 +0100242}
243
Václav Kubernát812ee282018-08-30 17:10:03 +0200244void SysrepoAccess::commitChanges()
245{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200246 try {
247 m_session->commit();
248 } catch (sysrepo::sysrepo_exception& ex) {
249 reportErrors();
250 }
Václav Kubernát812ee282018-08-30 17:10:03 +0200251}
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200252
Václav Kubernát6d791432018-10-25 16:00:35 +0200253void SysrepoAccess::discardChanges()
254{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200255 try {
256 m_session->discard_changes();
257 } catch (sysrepo::sysrepo_exception& ex) {
258 reportErrors();
259 }
Václav Kubernát6d791432018-10-25 16:00:35 +0200260}
261
Jan Kundrát6ee84792020-01-24 01:43:36 +0100262DatastoreAccess::Tree SysrepoAccess::executeRpc(const std::string &path, const Tree &input)
263{
264 auto srInput = std::make_shared<sysrepo::Vals>(input.size());
265 {
266 size_t i = 0;
267 for (const auto& [k, v] : input) {
268 boost::apply_visitor(updateSrValFromValue(joinPaths(path, k), srInput->val(i)), v);
269 ++i;
270 }
271 }
272 auto output = m_session->rpc_send(path.c_str(), srInput);
273 Tree res;
274 for (size_t i = 0; i < output->val_cnt(); ++i) {
275 const auto& v = output->val(i);
276 res.emplace(std::string(v->xpath()).substr(joinPaths(path, "/").size()), leafValueFromVal(v));
277 }
278 return res;
279}
280
Václav Kubernát7160a132020-04-03 02:11:01 +0200281void SysrepoAccess::copyConfig(const Datastore source, const Datastore destination)
282{
283 m_session->copy_config(nullptr, toSrDatastore(source), toSrDatastore(destination));
284 if (destination == Datastore::Running) {
285 m_session->refresh();
286 }
287}
288
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200289std::string SysrepoAccess::fetchSchema(const char* module, const char* revision, const char* submodule)
290{
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200291 std::string schema;
292 try {
Václav Kubernátb52dc252019-12-04 13:03:39 +0100293 schema = m_session->get_schema(module, revision, submodule, SR_SCHEMA_YANG);
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200294 } catch (sysrepo::sysrepo_exception& ex) {
295 reportErrors();
296 }
297
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200298 if (schema.empty())
299 throw std::runtime_error(std::string("Module ") + module + " not available");
300
301 return schema;
302}
303
Václav Kubernátbf9c6112019-11-04 16:03:35 +0100304std::vector<std::shared_ptr<sysrepo::Yang_Schema>> SysrepoAccess::listSchemas()
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200305{
Václav Kubernátbf9c6112019-11-04 16:03:35 +0100306 std::vector<sysrepo::S_Yang_Schema> res;
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200307 std::shared_ptr<sysrepo::Yang_Schemas> schemas;
308 try {
309 schemas = m_session->list_schemas();
310 } catch (sysrepo::sysrepo_exception& ex) {
311 reportErrors();
312 }
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200313 for (unsigned int i = 0; i < schemas->schema_cnt(); i++) {
314 auto schema = schemas->schema(i);
Václav Kubernátbf9c6112019-11-04 16:03:35 +0100315 res.push_back(schema);
Václav Kubernáta6c5fff2018-09-07 15:16:25 +0200316 }
317 return res;
318}
319
320std::shared_ptr<Schema> SysrepoAccess::schema()
321{
322 return m_schema;
323}
Václav Kubernátc58e4aa2019-04-03 18:37:32 +0200324
325[[noreturn]] void SysrepoAccess::reportErrors()
326{
327 // I only use get_last_errors to get error info, since the error code from
328 // sysrepo_exception doesn't really give any meaningful information. For
329 // example an "invalid argument" error could mean a node isn't enabled, or
330 // it could mean something totally different and there is no documentation
331 // for that, so it's better to just use the message sysrepo gives me.
332 auto srErrors = m_session->get_last_errors();
333 std::vector<DatastoreError> res;
334
335 for (size_t i = 0; i < srErrors->error_cnt(); i++) {
336 auto error = srErrors->error(i);
337 res.emplace_back(error->message(), error->xpath() ? std::optional<std::string>{error->xpath()} : std::nullopt);
338 }
339
340 throw DatastoreException(res);
341}
Václav Kubernátab612e92019-11-26 19:51:31 +0100342
343std::vector<ListInstance> SysrepoAccess::listInstances(const std::string& path)
344{
345 std::vector<ListInstance> res;
346 auto lists = getItems(path);
347
348 decltype(lists) instances;
349 auto wantedTree = *(m_schema->dataNodeFromPath(path)->find_path(path.c_str())->data().begin());
350 std::copy_if(lists.begin(), lists.end(), std::inserter(instances, instances.end()), [this, pathToCheck=wantedTree->schema()->path()](const auto& item) {
351 // This filters out non-instances.
352 if (item.second.type() != typeid(special_) || boost::get<special_>(item.second).m_value != SpecialValue::List) {
353 return false;
354 }
355
356 // Now, getItems is recursive: it gives everything including nested lists. So I try create a tree from the instance...
357 auto instanceTree = *(m_schema->dataNodeFromPath(item.first)->find_path(item.first.c_str())->data().begin());
358 // And then check if its schema path matches the list we actually want. This filters out lists which are not the ones I requested.
359 return instanceTree->schema()->path() == pathToCheck;
360 });
361
362 // If there are no instances, then just return
363 if (instances.empty()) {
364 return res;
365 }
366
367 // I need to find out which keys does the list have. To do that, I create a
368 // tree from the first instance. This is gives me some top level node,
369 // which will be our list in case out list is a top-level node. In case it
370 // isn't, we have call find_path on the top level node. After that, I just
371 // retrieve the keys.
372 auto topLevelTree = m_schema->dataNodeFromPath(instances.begin()->first);
373 auto list = *(topLevelTree->find_path(path.c_str())->data().begin());
374 auto keys = libyang::Schema_Node_List{list->schema()}.keys();
375
376 // Creating a full tree at the same time from the values sysrepo gives me
377 // would be a pain (and after sysrepo switches to libyang meaningless), so
378 // I just use this algorithm to create data nodes one by one and get the
379 // key values from them.
380 for (const auto& instance : instances) {
381 auto wantedList = *(m_schema->dataNodeFromPath(instance.first)->find_path(path.c_str())->data().begin());
382 ListInstance instanceRes;
383 for (const auto& key : keys) {
384 auto vec = wantedList->find_path(key->name())->data();
385 auto leaf = libyang::Data_Node_Leaf_List{*(vec.begin())};
386 instanceRes.emplace(key->name(), leafValueFromValue(leaf.value(), leaf.leaf_type()->base()));
387 }
388 res.push_back(instanceRes);
389 }
390
391 return res;
392}