crypto/store/store_locl.h:59: error: BUFFER_OVERRUN_L3
  Offset: [-1, +oo] Size: [1, +oo] by call to `OPENSSL_LH_delete`.
Showing all 10 steps of the trace


crypto/store/store_locl.h:59:1: Parameter `lh->pmax`
57.       OSSL_STORE_close_fn close;
58.   };
59. > DEFINE_LHASH_OF(OSSL_STORE_LOADER);
60.   
61.   const OSSL_STORE_LOADER *ossl_store_get0_loader_int(const char *scheme);

crypto/store/store_locl.h:59:1: Call
57.       OSSL_STORE_close_fn close;
58.   };
59. > DEFINE_LHASH_OF(OSSL_STORE_LOADER);
60.   
61.   const OSSL_STORE_LOADER *ossl_store_get0_loader_int(const char *scheme);

crypto/lhash/lhash.c:106:1: Parameter `lh->pmax`
  104.   }
  105.   
  106. > void *OPENSSL_LH_delete(OPENSSL_LHASH *lh, const void *data)
  107.   {
  108.       unsigned long hash;

crypto/lhash/lhash.c:129:9: Call
  127.       if ((lh->num_nodes > MIN_NODES) &&
  128.           (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)))
  129.           contract(lh);
                 ^
  130.   
  131.       return (ret);

crypto/lhash/lhash.c:236:1: <Offset trace>
234.   }
235.   
236. > static void contract(OPENSSL_LHASH *lh)
237.   {
238.       OPENSSL_LH_NODE **n, *n1, *np;

crypto/lhash/lhash.c:236:1: Parameter `lh->p`
    234.   }
    235.   
    236. > static void contract(OPENSSL_LHASH *lh)
    237.   {
    238.       OPENSSL_LH_NODE **n, *n1, *np;

crypto/lhash/lhash.c:256:9: Assignment
    254.           lh->b = n;
    255.       } else
    256.           lh->p--;
                   ^
    257.   
    258.       lh->num_nodes--;

crypto/lhash/lhash.c:236:1: <Length trace>
234.   }
235.   
236. > static void contract(OPENSSL_LHASH *lh)
237.   {
238.       OPENSSL_LH_NODE **n, *n1, *np;

crypto/lhash/lhash.c:236:1: Parameter `*lh->b`
    234.   }
    235.   
    236. > static void contract(OPENSSL_LHASH *lh)
    237.   {
    238.       OPENSSL_LH_NODE **n, *n1, *np;

crypto/lhash/lhash.c:261:10: Array access: Offset: [-1, +oo] Size: [1, +oo] by call to `OPENSSL_LH_delete` 
    259.       lh->num_contracts++;
    260.   
    261.       n1 = lh->b[(int)lh->p];
                    ^
    262.       if (n1 == NULL)
    263.           lh->b[(int)lh->p] = np;
