crypto/mem_dbg.c:629: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned64 by call to `lh_delete`.
Showing all 4 steps of the trace


crypto/mem_dbg.c:629:7: Call
627.   
628.   			m.addr=addr1;
629.   			mp=lh_MEM_delete(mh,&m);
             ^
630.   			if (mp != NULL)
631.   				{

crypto/lhash/lhash.c:217:1: <LHS trace>
215.   	}
216.   
217. > void *lh_delete(_LHASH *lh, const void *data)
218.   	{
219.   	unsigned long hash;

crypto/lhash/lhash.c:217:1: Parameter `lh->num_items`
  215.   	}
  216.   
  217. > void *lh_delete(_LHASH *lh, const void *data)
  218.   	{
  219.   	unsigned long hash;

crypto/lhash/lhash.c:240:2: Binary operation: ([0, +oo] - 1):unsigned64 by call to `lh_delete` 
  238.   		}
  239.   
  240.   	lh->num_items--;
          ^
  241.   	if ((lh->num_nodes > MIN_NODES) &&
  242.   		(lh->down_load >= (lh->num_items*LH_LOAD_MULT/lh->num_nodes)))

void *lh_delete(_LHASH *lh, const void *data)
	{
	unsigned long hash;
	LHASH_NODE *nn,**rn;
	void *ret;
	lh->error=0;
	rn=getrn(lh,data,&hash);
	if (*rn == NULL)
		{
		lh->num_no_delete++;
		return(NULL);
		}
	else
		{
		nn= *rn;
		*rn=nn->next;
		ret=nn->data;
		OPENSSL_free(nn);
		lh->num_delete++;
		}
	lh->num_items--;
	if ((lh->num_nodes > MIN_NODES) &&
		(lh->down_load >= (lh->num_items*LH_LOAD_MULT/lh->num_nodes)))
		contract(lh);
	return(ret);
	}
['void CRYPTO_dbg_realloc(void *addr1, void *addr2, int num,\n\tconst char *file, int line, int before_p)\n\t{\n\tMEM m,*mp;\n#ifdef LEVITTE_DEBUG_MEM\n\tfprintf(stderr, "LEVITTE_DEBUG_MEM: --> CRYPTO_dbg_malloc(addr1 = %p, addr2 = %p, num = %d, file = \\"%s\\", line = %d, before_p = %d)\\n",\n\t\taddr1, addr2, num, file, line, before_p);\n#endif\n\tswitch(before_p)\n\t\t{\n\tcase 0:\n\t\tbreak;\n\tcase 1:\n\t\tif (addr2 == NULL)\n\t\t\tbreak;\n\t\tif (addr1 == NULL)\n\t\t\t{\n\t\t\tCRYPTO_dbg_malloc(addr2, num, file, line, 128 | before_p);\n\t\t\tbreak;\n\t\t\t}\n\t\tif (is_MemCheck_on())\n\t\t\t{\n\t\t\tMemCheck_off();\n\t\t\tm.addr=addr1;\n\t\t\tmp=lh_MEM_delete(mh,&m);\n\t\t\tif (mp != NULL)\n\t\t\t\t{\n#ifdef LEVITTE_DEBUG_MEM\n\t\t\t\tfprintf(stderr, "LEVITTE_DEBUG_MEM: [%5ld] * 0x%p (%d) -> 0x%p (%d)\\n",\n\t\t\t\t\tmp->order,\n\t\t\t\t\tmp->addr, mp->num,\n\t\t\t\t\taddr2, num);\n#endif\n\t\t\t\tmp->addr=addr2;\n\t\t\t\tmp->num=num;\n\t\t\t\tlh_MEM_insert(mh,mp);\n\t\t\t\t}\n\t\t\tMemCheck_on();\n\t\t\t}\n\t\tbreak;\n\t\t}\n\treturn;\n\t}', 'void *lh_delete(_LHASH *lh, const void *data)\n\t{\n\tunsigned long hash;\n\tLHASH_NODE *nn,**rn;\n\tvoid *ret;\n\tlh->error=0;\n\trn=getrn(lh,data,&hash);\n\tif (*rn == NULL)\n\t\t{\n\t\tlh->num_no_delete++;\n\t\treturn(NULL);\n\t\t}\n\telse\n\t\t{\n\t\tnn= *rn;\n\t\t*rn=nn->next;\n\t\tret=nn->data;\n\t\tOPENSSL_free(nn);\n\t\tlh->num_delete++;\n\t\t}\n\tlh->num_items--;\n\tif ((lh->num_nodes > MIN_NODES) &&\n\t\t(lh->down_load >= (lh->num_items*LH_LOAD_MULT/lh->num_nodes)))\n\t\tcontract(lh);\n\treturn(ret);\n\t}']