crypto/err/err.c:397: error: BUFFER_OVERRUN_L3
  Offset: [-1, +oo] Size: [1, +oo] by call to `lh_delete`.
Showing all 18 steps of the trace


crypto/err/err.c:395:12: Call
393.   
394.       CRYPTO_w_lock(CRYPTO_LOCK_ERR);
395.       hash = int_thread_get(0, 0);
                  ^
396.       if (hash) {
397.           p = lh_ERR_STATE_delete(hash, d);

crypto/err/err.c:325:27: Call
  323.           CRYPTO_w_lock(CRYPTO_LOCK_ERR);
  324.       if (!int_thread_hash && create) {
  325.           int_thread_hash = lh_ERR_STATE_new();
                                   ^
  326.       }
  327.       if (int_thread_hash != NULL) {

crypto/lhash/lhash.c:119:19: Call
    117.       if ((ret = OPENSSL_zalloc(sizeof(*ret))) == NULL)
    118.           goto err0;
    119.       if ((ret->b = OPENSSL_zalloc(sizeof(*ret->b) * MIN_NODES)) == NULL)
                             ^
    120.           goto err1;
    121.       ret->comp = ((c == NULL) ? (LHASH_COMP_FN_TYPE)strcmp : c);

crypto/mem.c:157:1: Parameter `num`
      155.   }
      156.   
      157. > void *CRYPTO_zalloc(size_t num, const char *file, int line)
      158.   {
      159.       void *ret = CRYPTO_malloc(num, file, line);

crypto/mem.c:159:17: Call
      157.   void *CRYPTO_zalloc(size_t num, const char *file, int line)
      158.   {
      159.       void *ret = CRYPTO_malloc(num, file, line);
                             ^
      160.   
      161.       if (ret != NULL)

crypto/mem.c:125:9: Assignment
        123.   
        124.       if (num <= 0)
        125.           return NULL;
                       ^
        126.   
        127.       allow_customize = 0;

crypto/mem.c:159:5: Assignment
      157.   void *CRYPTO_zalloc(size_t num, const char *file, int line)
      158.   {
      159.       void *ret = CRYPTO_malloc(num, file, line);
                 ^
      160.   
      161.       if (ret != NULL)

crypto/mem.c:163:5: Assignment
      161.       if (ret != NULL)
      162.           memset(ret, 0, num);
      163.       return ret;
                 ^
      164.   }
      165.   

crypto/lhash/lhash.c:119:10: Assignment
    117.       if ((ret = OPENSSL_zalloc(sizeof(*ret))) == NULL)
    118.           goto err0;
    119.       if ((ret->b = OPENSSL_zalloc(sizeof(*ret->b) * MIN_NODES)) == NULL)
                    ^
    120.           goto err1;
    121.       ret->comp = ((c == NULL) ? (LHASH_COMP_FN_TYPE)strcmp : c);

crypto/err/err.c:397:13: Call
395.       hash = int_thread_get(0, 0);
396.       if (hash) {
397.           p = lh_ERR_STATE_delete(hash, d);
                   ^
398.           /* If there are no other references, and we just removed the
399.            * last item, delete the int_thread_hash */

crypto/lhash/lhash.c:189:1: Parameter `*lh->b`
  187.   }
  188.   
  189. > void *lh_delete(_LHASH *lh, const void *data)
  190.   {
  191.       unsigned long hash;

crypto/lhash/lhash.c:212:9: Call
  210.       if ((lh->num_nodes > MIN_NODES) &&
  211.           (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)))
  212.           contract(lh);
                 ^
  213.   
  214.       return (ret);

crypto/lhash/lhash.c:323:1: <Offset trace>
321.   }
322.   
323. > static void contract(_LHASH *lh)
324.   {
325.       LHASH_NODE **n, *n1, *np;

crypto/lhash/lhash.c:323:1: Parameter `lh->p`
    321.   }
    322.   
    323. > static void contract(_LHASH *lh)
    324.   {
    325.       LHASH_NODE **n, *n1, *np;

crypto/lhash/lhash.c:343:9: Assignment
    341.           lh->b = n;
    342.       } else
    343.           lh->p--;
                   ^
    344.   
    345.       lh->num_nodes--;

crypto/lhash/lhash.c:323:1: <Length trace>
321.   }
322.   
323. > static void contract(_LHASH *lh)
324.   {
325.       LHASH_NODE **n, *n1, *np;

crypto/lhash/lhash.c:323:1: Parameter `*lh->b`
    321.   }
    322.   
    323. > static void contract(_LHASH *lh)
    324.   {
    325.       LHASH_NODE **n, *n1, *np;

crypto/lhash/lhash.c:348:10: Array access: Offset: [-1, +oo] Size: [1, +oo] by call to `lh_delete` 
    346.       lh->num_contracts++;
    347.   
    348.       n1 = lh->b[(int)lh->p];
                    ^
    349.       if (n1 == NULL)
    350.           lh->b[(int)lh->p] = np;
