crypto/bn/bn_mul.c:709: error: INTEGER_OVERFLOW_L2
  ([0, max(4294967295, `*r`)] + [-oo, 6]):unsigned32.
Showing all 18 steps of the trace


crypto/bn/bn_mul.c:550:1: <LHS trace>
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:550:1: Parameter `*r`
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:626:3: Call
624.   		p= &(t[n2*2]);
625.   		bn_mul_recursive(&(t[n2]),t,&(t[n]),n,0,0,p);
626.   		bn_mul_recursive(r,a,b,n,0,0,p);
         ^
627.   		i=n/2;
628.   		/* If there is only a bottom half to the number,

crypto/bn/bn_mul.c:525:6: Call
  523.   	 * c1 holds the carry bits
  524.   	 */
  525.   	c1+=bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2);
              ^
  526.   	if (c1)
  527.   		{

crypto/bn/bn_asm.c:346:14: Assignment
    344.   
    345.   	assert(n >= 0);
    346.   	if (n <= 0) return((BN_ULONG)0);
                        ^
    347.   
    348.   	c=0;

crypto/bn/bn_mul.c:525:2: Assignment
  523.   	 * c1 holds the carry bits
  524.   	 */
  525.   	c1+=bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2);
          ^
  526.   	if (c1)
  527.   		{

crypto/bn/bn_mul.c:530:3: Assignment
  528.   		p= &(r[n+n2]);
  529.   		lo= *p;
  530.   		ln=(lo+c1)&BN_MASK2;
           ^
  531.   		*p=ln;
  532.   

crypto/bn/bn_mul.c:531:3: Assignment
  529.   		lo= *p;
  530.   		ln=(lo+c1)&BN_MASK2;
  531.   		*p=ln;
           ^
  532.   
  533.   		/* The overflow will stop before we over write

crypto/bn/bn_mul.c:687:11: Call
685.   	 */
686.   
687.   	c1=(int)(bn_add_words(t,r,&(r[n2]),n2));
                 ^
688.   
689.   	if (neg) /* if t[32] is negative */

crypto/bn/bn_asm.c:341:1: Parameter `*a`
  339.   	}
  340.   #else /* !BN_LLONG */
  341. > BN_ULONG bn_add_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, size_t n)
  342.           {
  343.   	BN_ULONG c,l,t;

crypto/bn/bn_mul.c:704:12: Call
702.   	 * c1 holds the carry bits
703.   	 */
704.   	c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2));
                  ^
705.   	if (c1)
706.   		{

crypto/bn/bn_asm.c:341:1: Parameter `*a`
  339.   	}
  340.   #else /* !BN_LLONG */
  341. > BN_ULONG bn_add_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, size_t n)
  342.           {
  343.   	BN_ULONG c,l,t;

crypto/bn/bn_mul.c:708:3: Assignment
706.   		{
707.   		p= &(r[n+n2]);
708.   		lo= *p;
         ^
709.   		ln=(lo+c1)&BN_MASK2;
710.   		*p=ln;

crypto/bn/bn_mul.c:704:12: <RHS trace>
702.   	 * c1 holds the carry bits
703.   	 */
704.   	c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2));
                  ^
705.   	if (c1)
706.   		{

crypto/bn/bn_mul.c:704:12: Call
702.   	 * c1 holds the carry bits
703.   	 */
704.   	c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2));
                  ^
705.   	if (c1)
706.   		{

crypto/bn/bn_asm.c:346:14: Assignment
  344.   
  345.   	assert(n >= 0);
  346.   	if (n <= 0) return((BN_ULONG)0);
                      ^
  347.   
  348.   	c=0;

crypto/bn/bn_mul.c:704:2: Assignment
702.   	 * c1 holds the carry bits
703.   	 */
704.   	c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2));
        ^
705.   	if (c1)
706.   		{

crypto/bn/bn_mul.c:709:3: Binary operation: ([0, max(4294967295, *r)] + [-oo, 6]):unsigned32
707.   		p= &(r[n+n2]);
708.   		lo= *p;
709.   		ln=(lo+c1)&BN_MASK2;
         ^
710.   		*p=ln;
711.   
