crypto/ecdsa/ecdsatest.c:219: error: INTEGER_OVERFLOW_L2
  ([0, 1] - 1):unsigned64 by call to `BN_cmp`.
Showing all 10 steps of the trace


crypto/ecdsa/ecdsatest.c:214:37: Call
212.   	(void)BIO_flush(out);
213.   	/* compare the created signature with the expected signature */
214.   	if ((r = BN_new()) == NULL || (s = BN_new()) == NULL)
                                           ^
215.   		goto x962_int_err;
216.   	if (!BN_dec2bn(&r, r_in) ||

crypto/bn/bn_lib.c:308:2: Assignment
  306.   		}
  307.   	ret->flags=BN_FLG_MALLOCED;
  308.   	ret->top=0;
          ^
  309.   	ret->neg=0;
  310.   	ret->dmax=0;

crypto/ecdsa/ecdsatest.c:216:7: Call
214.   	if ((r = BN_new()) == NULL || (s = BN_new()) == NULL)
215.   		goto x962_int_err;
216.   	if (!BN_dec2bn(&r, r_in) ||
             ^
217.   	    !BN_dec2bn(&s, s_in))
218.   		goto x962_int_err;

crypto/bn/bn_print.c:239:1: Parameter `(*bn)->top`
  237.   	}
  238.   
  239. > int BN_dec2bn(BIGNUM **bn, const char *a)
  240.   	{
  241.   	BIGNUM *ret=NULL;

crypto/ecdsa/ecdsatest.c:217:7: Call
215.   		goto x962_int_err;
216.   	if (!BN_dec2bn(&r, r_in) ||
217.   	    !BN_dec2bn(&s, s_in))
             ^
218.   		goto x962_int_err;
219.   	if (BN_cmp(signature->r ,r) || BN_cmp(signature->s, s))

crypto/bn/bn_print.c:239:1: Parameter `(*bn)->top`
  237.   	}
  238.   
  239. > int BN_dec2bn(BIGNUM **bn, const char *a)
  240.   	{
  241.   	BIGNUM *ret=NULL;

crypto/ecdsa/ecdsatest.c:219:6: Call
217.   	    !BN_dec2bn(&s, s_in))
218.   		goto x962_int_err;
219.   	if (BN_cmp(signature->r ,r) || BN_cmp(signature->s, s))
            ^
220.   		goto x962_int_err;
221.   	BIO_printf(out, ".");

crypto/bn/bn_lib.c:678:1: <LHS trace>
676.   	}
677.   
678. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
679.   	{
680.   	int i;

crypto/bn/bn_lib.c:678:1: Parameter `a->top`
  676.   	}
  677.   
  678. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
  679.   	{
  680.   	int i;

crypto/bn/bn_lib.c:709:7: Binary operation: ([0, 1] - 1):unsigned64 by call to `BN_cmp` 
  707.   	if (a->top > b->top) return(gt);
  708.   	if (a->top < b->top) return(lt);
  709.   	for (i=a->top-1; i>=0; i--)
               ^
  710.   		{
  711.   		t1=a->d[i];
