|
@@ -0,0 +1,169 @@
|
|
|
+#include <stdlib.h>
|
|
|
+#include <stdint.h>
|
|
|
+#include <stdio.h>
|
|
|
+#include <string.h>
|
|
|
+#include <assert.h>
|
|
|
+
|
|
|
+#include <faux/faux.h>
|
|
|
+#include <faux/str.h>
|
|
|
+#include <faux/list.h>
|
|
|
+#include <faux/argv.h>
|
|
|
+
|
|
|
+#include <sysrepo.h>
|
|
|
+#include <sysrepo/xpath.h>
|
|
|
+#include <sysrepo/values.h>
|
|
|
+#include <libyang/tree_edit.h>
|
|
|
+
|
|
|
+#include "sr_copypaste.h"
|
|
|
+#include "pline.h"
|
|
|
+#include "show.h"
|
|
|
+
|
|
|
+#define LEVEL_SPACES_NUM 2
|
|
|
+
|
|
|
+
|
|
|
+static void show_container(const struct lyd_node *node, size_t level, uint32_t flags);
|
|
|
+static void show_list(const struct lyd_node *node, size_t level, uint32_t flags);
|
|
|
+static void show_leaf(const struct lyd_node *node, size_t level, uint32_t flags);
|
|
|
+static void show_leaflist(const struct lyd_node *node, size_t level, uint32_t flags);
|
|
|
+static void show_node(const struct lyd_node *node, size_t level, uint32_t flags);
|
|
|
+static void show_subtree(const struct lyd_node *nodes_list, size_t level, uint32_t flags);
|
|
|
+
|
|
|
+
|
|
|
+static void show_container(const struct lyd_node *node, size_t level, uint32_t flags)
|
|
|
+{
|
|
|
+ if (!node)
|
|
|
+ return;
|
|
|
+
|
|
|
+ printf("%*s%s\n", (int)(level * LEVEL_SPACES_NUM), "", node->schema->name);
|
|
|
+
|
|
|
+ show_subtree(lyd_child(node), level + 1, flags);
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+static void show_list(const struct lyd_node *node, size_t level, uint32_t flags)
|
|
|
+{
|
|
|
+ size_t keys_num = 0;
|
|
|
+ bool_t with_stmt = BOOL_FALSE;
|
|
|
+ const struct lyd_node *iter = NULL;
|
|
|
+
|
|
|
+ if (!node)
|
|
|
+ return;
|
|
|
+
|
|
|
+ printf("%*s%s", (int)(level * LEVEL_SPACES_NUM), "", node->schema->name);
|
|
|
+
|
|
|
+ with_stmt = list_key_with_stmt(node->schema, flags);
|
|
|
+
|
|
|
+ LY_LIST_FOR(lyd_child(node), iter) {
|
|
|
+ if (!(iter->schema->nodetype & LYS_LEAF))
|
|
|
+ continue;
|
|
|
+ if (!(iter->schema->flags & LYS_KEY))
|
|
|
+ continue;
|
|
|
+ if (with_stmt)
|
|
|
+ printf(" %s", iter->schema->name);
|
|
|
+ printf(" %s", lyd_get_value(iter));
|
|
|
+ }
|
|
|
+ printf("\n");
|
|
|
+
|
|
|
+ show_subtree(lyd_child(node), level + 1, flags);
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+static void show_leaf(const struct lyd_node *node, size_t level, uint32_t flags)
|
|
|
+{
|
|
|
+ struct lysc_node_leaf *leaf = (struct lysc_node_leaf *)node;
|
|
|
+
|
|
|
+ if (!node)
|
|
|
+ return;
|
|
|
+ if (node->schema->flags & LYS_KEY)
|
|
|
+ return;
|
|
|
+
|
|
|
+ printf("%*s%s", (int)(level * LEVEL_SPACES_NUM), "", node->schema->name);
|
|
|
+
|
|
|
+ leaf = (struct lysc_node_leaf *)node->schema;
|
|
|
+ if (leaf->type->basetype != LY_TYPE_EMPTY)
|
|
|
+ printf(" %s", lyd_get_value(node));
|
|
|
+
|
|
|
+ printf("\n");
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+static void show_leaflist(const struct lyd_node *node, size_t level, uint32_t flags)
|
|
|
+{
|
|
|
+
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+static void show_node(const struct lyd_node *node, size_t level, uint32_t flags)
|
|
|
+{
|
|
|
+ const struct lysc_node *schema = NULL;
|
|
|
+
|
|
|
+ if (!node)
|
|
|
+ return;
|
|
|
+
|
|
|
+ if (node->flags & LYD_DEFAULT)
|
|
|
+ return;
|
|
|
+ schema = node->schema;
|
|
|
+ if (!schema)
|
|
|
+ return;
|
|
|
+ if (!(schema->nodetype & SRP_NODETYPE_CONF))
|
|
|
+ return;
|
|
|
+ if (!(schema->flags & LYS_CONFIG_W))
|
|
|
+ return;
|
|
|
+
|
|
|
+
|
|
|
+ if (schema->nodetype & LYS_CONTAINER) {
|
|
|
+ show_container((const struct lyd_node *)node, level, flags);
|
|
|
+
|
|
|
+
|
|
|
+ } else if (schema->nodetype & LYS_LIST) {
|
|
|
+ show_list((const struct lyd_node *)node, level, flags);
|
|
|
+
|
|
|
+
|
|
|
+ } else if (schema->nodetype & LYS_LEAF) {
|
|
|
+ show_leaf((const struct lyd_node *)node, level, flags);
|
|
|
+
|
|
|
+
|
|
|
+ } else if (schema->nodetype & LYS_LEAFLIST) {
|
|
|
+ show_leaflist((const struct lyd_node *)node, level, flags);
|
|
|
+
|
|
|
+ } else {
|
|
|
+ return;
|
|
|
+ }
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+static void show_subtree(const struct lyd_node *nodes_list, size_t level, uint32_t flags)
|
|
|
+{
|
|
|
+ const struct lyd_node *iter = NULL;
|
|
|
+
|
|
|
+ if(!nodes_list)
|
|
|
+ return;
|
|
|
+
|
|
|
+ LY_LIST_FOR(nodes_list, iter) {
|
|
|
+ show_node(iter, level, flags);
|
|
|
+ }
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+bool_t show_xpath(sr_session_ctx_t *sess, const char *xpath, uint32_t flags)
|
|
|
+{
|
|
|
+ sr_data_t *data = NULL;
|
|
|
+ struct lyd_node *nodes_list = NULL;
|
|
|
+
|
|
|
+ assert(sess);
|
|
|
+
|
|
|
+ if (xpath) {
|
|
|
+ if (sr_get_subtree(sess, xpath, 0, &data) != SR_ERR_OK)
|
|
|
+ return BOOL_FALSE;
|
|
|
+ nodes_list = lyd_child(data->tree);
|
|
|
+ } else {
|
|
|
+ if (sr_get_data(sess, "/*", 0, 0, 0, &data) != SR_ERR_OK)
|
|
|
+ return BOOL_FALSE;
|
|
|
+ nodes_list = data->tree;
|
|
|
+ }
|
|
|
+
|
|
|
+ show_subtree(nodes_list, 0, flags);
|
|
|
+ sr_release_data(data);
|
|
|
+
|
|
|
+ return BOOL_TRUE;
|
|
|
+}
|