crypto/engine/tb_asnmth.c:236: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `engine_table_doall`.
Showing all 8 steps of the trace


crypto/engine/tb_asnmth.c:236:2: Call
234.   	fstr.len = len;
235.   	CRYPTO_w_lock(CRYPTO_LOCK_ENGINE);
236.   	engine_table_doall(pkey_asn1_meth_table, look_str_cb, &fstr);
        ^
237.   	/* If found obtain a structural reference to engine */
238.   	if (fstr.e)

crypto/engine/eng_table.c:343:1: Parameter `table->piles.num_nodes`
  341.   static IMPLEMENT_LHASH_DOALL_ARG_FN(int_cb, ENGINE_PILE,ENGINE_PILE_DOALL)
  342.   
  343. > void engine_table_doall(ENGINE_TABLE *table, engine_table_doall_cb *cb,
  344.   								void *arg)
  345.   	{

crypto/engine/eng_table.c:350:3: Call
  348.   	dall.arg = arg;
  349.   	if (table)
  350.   		lh_ENGINE_PILE_doall_arg(&table->piles,
           ^
  351.   				LHASH_DOALL_ARG_FN(int_cb),
  352.   				ENGINE_PILE_DOALL, &dall);

crypto/lhash/lhash.c:305:1: Parameter `lh->num_nodes`
    303.   	}
    304.   
    305. > void lh_doall_arg(_LHASH *lh, LHASH_DOALL_ARG_FN_TYPE func, void *arg)
    306.   	{
    307.   	doall_util_fn(lh, 1, (LHASH_DOALL_FN_TYPE)0, func, arg);

crypto/lhash/lhash.c:307:2: Call
    305.   void lh_doall_arg(_LHASH *lh, LHASH_DOALL_ARG_FN_TYPE func, void *arg)
    306.   	{
    307.   	doall_util_fn(lh, 1, (LHASH_DOALL_FN_TYPE)0, func, arg);
            ^
    308.   	}
    309.   

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