apps/ca.c:1954: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `CONF_load`.
Showing all 10 steps of the trace


apps/ca.c:1954:8: Call
1952.   	 * STACK format).
1953.   	 */
1954.   	parms=CONF_load(NULL,infile,&errline);
               ^
1955.   	if (parms == NULL)
1956.   		{

crypto/conf/conf.c:86:1: Parameter `h->num_nodes`
  84.   
  85.   
  86. > LHASH *CONF_load(LHASH *h, const char *file, long *line)
  87.   	{
  88.   	LHASH *ltmp;

crypto/conf/conf.c:98:9: Call
  96.   		}
  97.   
  98.   	ltmp = CONF_load_bio(h, in, line);
                 ^
  99.   	BIO_free(in);
  100.   

crypto/conf/conf.c:118:1: Parameter `h->num_nodes`
    116.   #endif
    117.   
    118. > LHASH *CONF_load_bio(LHASH *h, BIO *in, long *line)
    119.   	{
    120.   	LHASH *ret=NULL;

crypto/conf/conf.c:355:35: Call
    353.   	sprintf(btmp,"%ld",eline);
    354.   	ERR_add_error_data(2,"line ",btmp);
    355.   	if ((h != ret) && (ret != NULL)) CONF_free(ret);
                                             ^
    356.   	if (v != NULL)
    357.   		{

crypto/conf/conf.c:436:1: Parameter `conf->num_nodes`
      434.   	}
      435.   
      436. > void CONF_free(LHASH *conf)
      437.   	{
      438.   	if (conf == NULL) return;

crypto/conf/conf.c:442:2: Call
      440.   	conf->down_load=0; 	/* evil thing to make sure the 'Free()'
      441.   				 * works as expected */
      442.   	lh_doall_arg(conf,(void (*)())value_free_hash,(char *)conf);
              ^
      443.   
      444.   	/* We now have only 'section' entries in the hash table.

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

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

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