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


crypto/objects/o_names.c:278:5: Call
276.       d.arg = arg;
277.   
278.       lh_OBJ_NAME_doall_OBJ_DOALL(names_lh, do_all_fn, &d);
           ^
279.   }
280.   

crypto/objects/o_names.c:267:1: Parameter `lh->num_nodes`
  265.   }
  266.   
  267. > IMPLEMENT_LHASH_DOALL_ARG_CONST(OBJ_NAME, OBJ_DOALL);
  268.   
  269.   void OBJ_NAME_do_all(int type, void (*fn) (const OBJ_NAME *, void *arg),

crypto/objects/o_names.c:267:1: Call
  265.   }
  266.   
  267. > IMPLEMENT_LHASH_DOALL_ARG_CONST(OBJ_NAME, OBJ_DOALL);
  268.   
  269.   void OBJ_NAME_do_all(int type, void (*fn) (const OBJ_NAME *, void *arg),

crypto/lhash/lhash.c:182:1: Parameter `lh->num_nodes`
    180.   }
    181.   
    182. > void OPENSSL_LH_doall_arg(OPENSSL_LHASH *lh, OPENSSL_LH_DOALL_FUNCARG func, void *arg)
    183.   {
    184.       doall_util_fn(lh, 1, (OPENSSL_LH_DOALL_FUNC)0, func, arg);

crypto/lhash/lhash.c:184:5: Call
    182.   void OPENSSL_LH_doall_arg(OPENSSL_LHASH *lh, OPENSSL_LH_DOALL_FUNCARG func, void *arg)
    183.   {
    184.       doall_util_fn(lh, 1, (OPENSSL_LH_DOALL_FUNC)0, func, arg);
               ^
    185.   }
    186.   

crypto/lhash/lhash.c:150:1: <LHS trace>
148.   }
149.   
150. > static void doall_util_fn(OPENSSL_LHASH *lh, int use_arg,
151.                             OPENSSL_LH_DOALL_FUNC func,
152.                             OPENSSL_LH_DOALL_FUNCARG func_arg, void *arg)

crypto/lhash/lhash.c:150:1: Parameter `lh->num_nodes`
      148.   }
      149.   
      150. > static void doall_util_fn(OPENSSL_LHASH *lh, int use_arg,
      151.                             OPENSSL_LH_DOALL_FUNC func,
      152.                             OPENSSL_LH_DOALL_FUNCARG func_arg, void *arg)

crypto/lhash/lhash.c:164:10: Binary operation: ([0, +oo] - 1):unsigned32 by call to `lh_OBJ_NAME_doall_OBJ_DOALL` 
      162.        * memory leaks otherwise
      163.        */
      164.       for (i = lh->num_nodes - 1; i >= 0; i--) {
                      ^
      165.           a = lh->b[i];
      166.           while (a != NULL) {
