1 files changed, 15 insertions, 2 deletions

diff --git a/src/lib/libcrypto/lhash/lhash.c b/src/lib/libcrypto/lhash/lhash.c
index 3adec71ed6..81660419c7 100644
--- a/src/lib/libcrypto/lhash/lhash.c
+++ b/src/lib/libcrypto/lhash/lhash.c
@@ -1,4 +1,4 @@
-/* $OpenBSD: lhash.c,v 1.20 2023/07/07 13:40:44 beck Exp $ */
+/* $OpenBSD: lhash.c,v 1.21 2024/01/24 14:02:52 jsing Exp $ */
 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  * All rights reserved.
  *
@@ -250,12 +250,21 @@ static void
 doall_util_fn(_LHASH *lh, int use_arg, LHASH_DOALL_FN_TYPE func,
     LHASH_DOALL_ARG_FN_TYPE func_arg, void *arg)
 {
-        int i;
         LHASH_NODE *a, *n;
+        int down_load;
+        int i;
 
         if (lh == NULL)
                 return;
 
+        /*
+         * Disable contraction of the hash while walking, as some consumers use
+         * it to delete hash entries. A better option would be to snapshot the
+         * hash, making it insert safe as well.
+         */
+        down_load = lh->down_load;
+        lh->down_load = 0;
+
         /* reverse the order so we search from 'top to bottom'
          * We were having memory leaks otherwise */
         for (i = lh->num_nodes - 1; i >= 0; i--) {
@@ -273,6 +282,10 @@ doall_util_fn(_LHASH *lh, int use_arg, LHASH_DOALL_FN_TYPE func,
                         a = n;
                 }
         }
+
+        /* Restore down load factor and trigger contraction. */
+        lh->down_load = down_load;
+        contract(lh);
 }
 
 void