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


crypto/objects/obj_dat.c:198:2: Call
196.   	if (added == NULL) return;
197.   	added->down_load=0;
198.   	lh_doall(added,cleanup1); /* zero counters */
        ^
199.   	lh_doall(added,cleanup2); /* set counters */
200.   	lh_doall(added,cleanup3); /* free objects */

crypto/lhash/lhash.c:270:1: Parameter `lh->num_nodes`
  268.   	}
  269.   
  270. > void lh_doall(LHASH *lh, void (*func)())
  271.   	{
  272.   	lh_doall_arg(lh,func,NULL);

crypto/lhash/lhash.c:272:2: Call
  270.   void lh_doall(LHASH *lh, void (*func)())
  271.   	{
  272.   	lh_doall_arg(lh,func,NULL);
          ^
  273.   	}
  274.   

crypto/lhash/lhash.c:275:1: <LHS trace>
273.   	}
274.   
275. > void lh_doall_arg(LHASH *lh, void (*func)(), void *arg)
276.   	{
277.   	int i;

crypto/lhash/lhash.c:275:1: Parameter `lh->num_nodes`
    273.   	}
    274.   
    275. > void lh_doall_arg(LHASH *lh, void (*func)(), void *arg)
    276.   	{
    277.   	int i;

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

void lh_doall_arg(LHASH *lh, void (*func)(), 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;
			func(a->data,arg);
			a=n;
			}
		}
	}
['void OBJ_cleanup(void)\n\t{\n\tif (added == NULL) return;\n\tadded->down_load=0;\n\tlh_doall(added,cleanup1);\n\tlh_doall(added,cleanup2);\n\tlh_doall(added,cleanup3);\n\tlh_free(added);\n\tadded=NULL;\n\t}', 'void lh_doall(LHASH *lh, void (*func)())\n\t{\n\tlh_doall_arg(lh,func,NULL);\n\t}', 'void lh_doall_arg(LHASH *lh, void (*func)(), 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\tfunc(a->data,arg);\n\t\t\ta=n;\n\t\t\t}\n\t\t}\n\t}']