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


crypto/objects/o_names.c:189:18: Call
187.   	on.name=name;
188.   	on.type=type;
189.   	ret=(OBJ_NAME *)lh_delete(names_lh,(char *)&on);
                        ^
190.   	if (ret != NULL)
191.   		{

crypto/lhash/lhash.c:231:1: <LHS trace>
229.   	}
230.   
231. > char *lh_delete(LHASH *lh, char *data)
232.   	{
233.   	unsigned long hash;

crypto/lhash/lhash.c:231:1: Parameter `lh->num_items`
  229.   	}
  230.   
  231. > char *lh_delete(LHASH *lh, char *data)
  232.   	{
  233.   	unsigned long hash;

crypto/lhash/lhash.c:254:2: Binary operation: ([0, +oo] - 1):unsigned64 by call to `lh_delete` 
  252.   		}
  253.   
  254.   	lh->num_items--;
          ^
  255.   	if ((lh->num_nodes > MIN_NODES) &&
  256.   		(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);
	}
['int OBJ_NAME_remove(const char *name, int type)\n\t{\n\tOBJ_NAME on,*ret;\n\tvoid (*f)();\n\tif (names_lh == NULL) return(0);\n\ttype&= ~OBJ_NAME_ALIAS;\n\ton.name=name;\n\ton.type=type;\n\tret=(OBJ_NAME *)lh_delete(names_lh,(char *)&on);\n\tif (ret != NULL)\n\t\t{\n\t\tif ((names_free != NULL) && (sk_num(names_free) > type))\n\t\t\t{\n\t\t\tf=(void (*)())sk_value(names_free,type);\n\t\t\tf(ret->name,ret->type,ret->data);\n\t\t\t}\n\t\tFree((char *)ret);\n\t\treturn(1);\n\t\t}\n\telse\n\t\treturn(0);\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}']