crypto/objects/o_names.c:350: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `lh_doall`.
Showing all 6 steps of the trace


crypto/objects/o_names.c:350:2: Call
348.   	names_lh->down_load=0;
349.   
350.   	lh_doall(names_lh,LHASH_DOALL_FN(names_lh_free));
        ^
351.   	if (type < 0)
352.   		{

crypto/lhash/lhash.c:295:1: Parameter `lh->num_nodes`
  293.   	}
  294.   
  295. > void lh_doall(LHASH *lh, LHASH_DOALL_FN_TYPE func)
  296.   	{
  297.   	doall_util_fn(lh, 0, func, (LHASH_DOALL_ARG_FN_TYPE)0, NULL);

crypto/lhash/lhash.c:297:2: Call
  295.   void lh_doall(LHASH *lh, LHASH_DOALL_FN_TYPE func)
  296.   	{
  297.   	doall_util_fn(lh, 0, func, (LHASH_DOALL_ARG_FN_TYPE)0, NULL);
          ^
  298.   	}
  299.   

crypto/lhash/lhash.c:270:1: <LHS trace>
268.   	}
269.   
270. > static void doall_util_fn(LHASH *lh, int use_arg, LHASH_DOALL_FN_TYPE func,
271.   			  LHASH_DOALL_ARG_FN_TYPE func_arg, void *arg)
272.   	{

crypto/lhash/lhash.c:270:1: Parameter `lh->num_nodes`
    268.   	}
    269.   
    270. > static void doall_util_fn(LHASH *lh, int use_arg, LHASH_DOALL_FN_TYPE func,
    271.   			  LHASH_DOALL_ARG_FN_TYPE func_arg, void *arg)
    272.   	{

crypto/lhash/lhash.c:278:7: Binary operation: ([0, +oo] - 1):unsigned32 by call to `lh_doall` 
    276.   	/* reverse the order so we search from 'top to bottom'
    277.   	 * We were having memory leaks otherwise */
    278.   	for (i=lh->num_nodes-1; i>=0; i--)
                 ^
    279.   		{
    280.   		a=lh->b[i];

static void doall_util_fn(LHASH *lh, int use_arg, LHASH_DOALL_FN_TYPE func,
			  LHASH_DOALL_ARG_FN_TYPE func_arg, void *arg)
	{
	int i;
	LHASH_NODE *a,*n;
	for (i=lh->num_nodes-1; i>=0; i--)
		{
		a=lh->b[i];
		while (a != NULL)
			{
			n=a->next;
			if(use_arg)
				func_arg(a->data,arg);
			else
				func(a->data);
			a=n;
			}
		}
	}
['void OBJ_NAME_cleanup(int type)\n\t{\n\tunsigned long down_load;\n\tif (names_lh == NULL) return;\n\tfree_type=type;\n\tdown_load=names_lh->down_load;\n\tnames_lh->down_load=0;\n\tlh_doall(names_lh,LHASH_DOALL_FN(names_lh_free));\n\tif (type < 0)\n\t\t{\n\t\tlh_free(names_lh);\n\t\tsk_NAME_FUNCS_pop_free(name_funcs_stack,name_funcs_free);\n\t\tnames_lh=NULL;\n\t\tname_funcs_stack = NULL;\n\t\t}\n\telse\n\t\tnames_lh->down_load=down_load;\n\t}', 'void lh_doall(LHASH *lh, LHASH_DOALL_FN_TYPE func)\n\t{\n\tdoall_util_fn(lh, 0, func, (LHASH_DOALL_ARG_FN_TYPE)0, NULL);\n\t}', 'static void doall_util_fn(LHASH *lh, int use_arg, LHASH_DOALL_FN_TYPE func,\n\t\t\t  LHASH_DOALL_ARG_FN_TYPE func_arg, void *arg)\n\t{\n\tint i;\n\tLHASH_NODE *a,*n;\n\tfor (i=lh->num_nodes-1; i>=0; i--)\n\t\t{\n\t\ta=lh->b[i];\n\t\twhile (a != NULL)\n\t\t\t{\n\t\t\tn=a->next;\n\t\t\tif(use_arg)\n\t\t\t\tfunc_arg(a->data,arg);\n\t\t\telse\n\t\t\t\tfunc(a->data);\n\t\t\ta=n;\n\t\t\t}\n\t\t}\n\t}']