data tree REFACTOR hash calculation
Now the data parsers do not have to
hash list instances and all the cases
are covered in internal functions.
diff --git a/src/parser_xml.c b/src/parser_xml.c
index 3a3dee3..c382a78 100644
--- a/src/parser_xml.c
+++ b/src/parser_xml.c
@@ -597,10 +597,7 @@
LY_CHECK_GOTO(ret, cleanup);
}
- if (snode->nodetype == LYS_LIST) {
- /* hash now that all keys should be parsed, rehash for key-less list */
- lyd_hash(cur);
- } else if (snode->nodetype & (LYS_RPC | LYS_ACTION | LYS_NOTIF)) {
+ if (snode->nodetype & (LYS_RPC | LYS_ACTION | LYS_NOTIF)) {
/* rememeber the RPC/action/notification */
lydctx->op_ntf = cur;
}