tree_data OPTIMIZE don't check dups on htable insertion

When inserting a node into the children hash table, we check that it was not already added, using a pointer comparison. This check can take a lot of time if there are a lot of collisions in the hash table, which is the case for keyless lists. Use the new API lyht_insert_no_check() to optimize the insertion. Signed-off-by: Olivier Matz <[email protected]>
CESNET · Sep 28, 2023 · 0f75ab7 · 0f75ab7
1 parent df57138
commit 0f75ab7
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/src/tree_data_hash.c b/src/tree_data_hash.c
@@ -128,7 +128,7 @@ lyd_insert_hash_add(struct ly_ht *ht, struct lyd_node *node, ly_bool empty_ht)
     assert(ht && node && node->schema);
 
     /* add node itself */
-    if (lyht_insert(ht, &node, node->hash, NULL)) {
+    if (lyht_insert_no_check(ht, &node, node->hash, NULL)) {
         LOGINT_RET(LYD_CTX(node));
     }