commit 501af03205b78e933ac6545573c1bb1680c2fee6
author Michal Vasko <mvasko@cesnet.cz> Wed Nov 11 20:27:44 2020 +0100
committer Michal Vasko <mvasko@cesnet.cz> Thu Nov 12 16:15:08 2020 +0100
tree 8cf27186b85b2903c0860bac6e25e6db5b56dcd3
parent ba69670d863a46e0b0ded752f1b4bc2c100fbb26

data tree REFACTOR adjust opaque node and attr members

To be more consistent with other structures.

src/tree_data_free.c

diff --git a/src/tree_data_free.c b/src/tree_data_free.c
index fa9eab8..828a152 100644
--- a/src/tree_data_free.c
+++ b/src/tree_data_free.c
@@ -145,7 +145,6 @@
 lyd_free_subtree(struct lyd_node *node, ly_bool top)
 {
     struct lyd_node *iter, *next;
-    struct lyd_node *children;
     struct lyd_node_opaq *opaq = NULL;
 
     assert(node);
@@ -154,24 +153,22 @@
         opaq = (struct lyd_node_opaq *)node;
 
         /* free the children */
-        children = lyd_child(node);
-        LY_LIST_FOR_SAFE(children, next, iter) {
+        LY_LIST_FOR_SAFE(lyd_child(node), next, iter) {
             lyd_free_subtree(iter, 0);
         }
 
         FREE_STRING(LYD_CTX(opaq), opaq->name);
         FREE_STRING(LYD_CTX(opaq), opaq->prefix.id);
         FREE_STRING(LYD_CTX(opaq), opaq->prefix.module_ns);
-        ly_free_prefix_data(opaq->format, opaq->val_prefix_data);
         FREE_STRING(LYD_CTX(opaq), opaq->value);
+        ly_free_prefix_data(opaq->format, opaq->val_prefix_data);
     } else if (node->schema->nodetype & LYD_NODE_INNER) {
         /* remove children hash table in case of inner data node */
         lyht_free(((struct lyd_node_inner *)node)->children_ht);
         ((struct lyd_node_inner *)node)->children_ht = NULL;
 
         /* free the children */
-        children = lyd_child(node);
-        LY_LIST_FOR_SAFE(children, next, iter) {
+        LY_LIST_FOR_SAFE(lyd_child(node), next, iter) {
             lyd_free_subtree(iter, 0);
         }
     } else if (node->schema->nodetype & LYD_NODE_ANY) {