crypto/bn/bn_exp2.c:243: error: INTEGER_OVERFLOW_L2
  ([0, 1] - [0, 1]):unsigned32 by call to `BN_mod_mul_montgomery`.
Showing all 20 steps of the trace


crypto/bn/bn_exp2.c:243:7: Call
241.   	wpos2=0;    /* If wvalue2 > 0, the bottom bit of the second window */
242.   
243.   	if (!BN_to_montgomery(r,BN_value_one(),mont,ctx)) goto err;
             ^
244.   	for (b=bits-1; b>=0; b--)
245.   		{

crypto/bn/bn_lib.c:136:2: Assignment
  134.   const BIGNUM *BN_value_one(void)
  135.   	{
  136.   	static const BN_ULONG data_one=1L;
          ^
  137.   	static const BIGNUM const_one={(BN_ULONG *)&data_one,1,1,0,BN_FLG_STATIC_DATA};
  138.   

crypto/bn/bn_exp2.c:243:7: Call
241.   	wpos2=0;    /* If wvalue2 > 0, the bottom bit of the second window */
242.   
243.   	if (!BN_to_montgomery(r,BN_value_one(),mont,ctx)) goto err;
             ^
244.   	for (b=bits-1; b>=0; b--)
245.   		{

crypto/bn/bn_mont.c:129:1: Parameter `*a->d`
  127.   #endif
  128.   
  129. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  130.   			  BN_MONT_CTX *mont, BN_CTX *ctx)
  131.   	{

crypto/bn/bn_mont.c:161:8: Call
  159.   	else
  160.   		{
  161.   		if (!BN_mul(tmp,a,b,ctx)) goto err;
                ^
  162.   		}
  163.   	/* reduce from aRR to aR */

crypto/bn/bn_mul.c:943:1: Parameter `*a->d`
    941.   #endif /* BN_RECURSION */
    942.   
    943. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    944.   	{
    945.   	int ret=0;

crypto/bn/bn_mul.c:1032:5: Call
    1030.   				if (bn_wexpand(t,k*4) == NULL) goto err;
    1031.   				if (bn_wexpand(rr,k*4) == NULL) goto err;
    1032.   				bn_mul_part_recursive(rr->d,a->d,b->d,
                ^
    1033.   					j,al-j,bl-j,t->d);
    1034.   				}

crypto/bn/bn_mul.c:550:1: Parameter `*a`
      548.    * t needs to be n*4 is size, as does r */
      549.   /* tnX may not be negative but less than n */
      550. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
      551.   	     int tna, int tnb, BN_ULONG *t)
      552.   	{

crypto/bn/bn_mul.c:568:5: Call
      566.   
      567.   	/* r=(a[0]-a[1])*(b[1]-b[0]) */
      568.   	c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna);
                 ^
      569.   	c2=bn_cmp_part_words(&(b[n]),b,tnb,tnb-n);
      570.   	neg=0;

crypto/bn/bn_lib.c:822:1: Parameter `*b`
        820.      All lengths are the number of BN_ULONGs...  */
        821.   
        822. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b,
        823.   	int cl, int dl)
        824.   	{

crypto/bn/bn_mul.c:574:3: Call
      572.   		{
      573.   	case -4:
      574.   		bn_sub_part_words(t,      &(a[n]),a,      tna,tna-n); /* - */
               ^
      575.   		bn_sub_part_words(&(t[n]),b,      &(b[n]),tnb,n-tnb); /* - */
      576.   		break;

crypto/bn/bn_mul.c:80:1: Parameter `*b`
        78.      assembler counterparts for the systems that use assembler files.  */
        79.   
        80. > BN_ULONG bn_sub_part_words(BN_ULONG *r,
        81.   	const BN_ULONG *a, const BN_ULONG *b,
        82.   	int cl, int dl)

crypto/bn/bn_mul.c:87:6: Call
        85.   
        86.   	assert(cl >= 0);
        87.   	c = bn_sub_words(r, a, b, cl);
                   ^
        88.   
        89.   	if (dl == 0)

crypto/bn/bn_asm.c:393:1: <LHS trace>
391.   #endif /* !BN_LLONG */
392.   
393. > BN_ULONG bn_sub_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
394.           {
395.   	BN_ULONG t1,t2;

crypto/bn/bn_asm.c:393:1: Parameter `*a`
          391.   #endif /* !BN_LLONG */
          392.   
          393. > BN_ULONG bn_sub_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
          394.           {
          395.   	BN_ULONG t1,t2;

crypto/bn/bn_asm.c:404:3: Assignment
          402.   	while (n&~3)
          403.   		{
          404.   		t1=a[0]; t2=b[0];
                   ^
          405.   		r[0]=(t1-t2-c)&BN_MASK2;
          406.   		if (t1 != t2) c=(t1 < t2);

crypto/bn/bn_asm.c:393:1: <RHS trace>
391.   #endif /* !BN_LLONG */
392.   
393. > BN_ULONG bn_sub_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
394.           {
395.   	BN_ULONG t1,t2;

crypto/bn/bn_asm.c:393:1: Parameter `*b`
          391.   #endif /* !BN_LLONG */
          392.   
          393. > BN_ULONG bn_sub_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
          394.           {
          395.   	BN_ULONG t1,t2;

crypto/bn/bn_asm.c:404:12: Assignment
          402.   	while (n&~3)
          403.   		{
          404.   		t1=a[0]; t2=b[0];
                            ^
          405.   		r[0]=(t1-t2-c)&BN_MASK2;
          406.   		if (t1 != t2) c=(t1 < t2);

crypto/bn/bn_asm.c:405:3: Binary operation: ([0, 1] - [0, 1]):unsigned32 by call to `BN_mod_mul_montgomery` 
          403.   		{
          404.   		t1=a[0]; t2=b[0];
          405.   		r[0]=(t1-t2-c)&BN_MASK2;
                   ^
          406.   		if (t1 != t2) c=(t1 < t2);
          407.   		t1=a[1]; t2=b[1];
