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


crypto/mem_dbg.c:473:14: Call
471.   
472.   			m.addr=addr;
473.   			mp=(MEM *)lh_delete(mh,(char *)&m);
                    ^
474.   			if (mp != NULL)
475.   				{

crypto/lhash/lhash.c:220:1: <LHS trace>
218.   	}
219.   
220. > char *lh_delete(LHASH *lh, char *data)
221.   	{
222.   	unsigned long hash;

crypto/lhash/lhash.c:220:1: Parameter `lh->num_items`
  218.   	}
  219.   
  220. > char *lh_delete(LHASH *lh, char *data)
  221.   	{
  222.   	unsigned long hash;

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

char *lh_delete(LHASH *lh, char *data)
	{
	unsigned long hash;
	LHASH_NODE *nn,**rn;
	char *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;
		Free((char *)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_free(void *addr, int before_p)\n\t{\n\tMEM m,*mp;\n\tswitch(before_p)\n\t\t{\n\tcase 0:\n\t\tif (addr == NULL)\n\t\t\tbreak;\n\t\tif (is_MemCheck_on() && (mh != NULL))\n\t\t\t{\n\t\t\tMemCheck_off();\n\t\t\tm.addr=addr;\n\t\t\tmp=(MEM *)lh_delete(mh,(char *)&m);\n\t\t\tif (mp != NULL)\n\t\t\t\t{\n#ifdef LEVITTE_DEBUG\n\t\t\tfprintf(stderr, "LEVITTE_DEBUG: [%5d] - 0x%p (%d)\\n",\n\t\t\t\tmp->order, mp->addr, mp->num);\n#endif\n\t\t\t\tif (mp->app_info != NULL)\n\t\t\t\t\t{\n\t\t\t\t\tmp->app_info->references--;\n\t\t\t\t\t}\n\t\t\t\tFree(mp);\n\t\t\t\t}\n\t\t\tMemCheck_on();\n\t\t\t}\n\t\tbreak;\n\tcase 1:\n\t\tbreak;\n\t\t}\n\t}', 'char *lh_delete(LHASH *lh, char *data)\n\t{\n\tunsigned long hash;\n\tLHASH_NODE *nn,**rn;\n\tchar *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\tFree((char *)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}']