Signed-off-by: Christian Hopps <chopps@labn.net>
__func__, xpath);
return ret;
}
-
+ assert(dnode);
/*
* Create a linked list to sort the data nodes starting from the root.
flags, cb, arg, dnode);
list_delete(&list_dnodes);
- if (dnode) {
- while (lyd_parent(dnode))
- dnode = lyd_parent(dnode);
+ while (lyd_parent(dnode))
+ dnode = lyd_parent(dnode);
- if (tree && ret == NB_OK)
- *tree = dnode;
- else {
- lyd_free_all(dnode);
- if (tree)
- *tree = NULL;
- }
+ if (tree && ret == NB_OK)
+ *tree = dnode;
+ else {
+ lyd_free_all(dnode);
+ if (tree)
+ *tree = NULL;
}
return ret;