crypto/bn/bn_sqr.c:266: error: INTEGER_OVERFLOW_L2
  ([0, max(4294967295, `*t`)] - [0, max(4294967295, `*t`)]):unsigned32 by call to `bn_sub_words`.
Showing all 11 steps of the trace


crypto/bn/bn_sqr.c:206:1: Parameter `*t`
204.    * a[1]*b[1]
205.    */
206. > void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t)
207.   	{
208.   	int n=n2/2;

crypto/bn/bn_sqr.c:263:11: Call
261.   	 */
262.   
263.   	c1=(int)(bn_add_words(t,r,&(r[n2]),n2));
                 ^
264.   
265.   	/* t[32] is negative */

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

crypto/bn/bn_sqr.c:266:12: Call
264.   
265.   	/* t[32] is negative */
266.   	c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2));
                  ^
267.   
268.   	/* t[32] holds (a[0]-a[1])*(a[1]-a[0])+(a[0]*a[0])+(a[1]*a[1])

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, max(4294967295, *t)] - [0, max(4294967295, *t)]):unsigned32 by call to `bn_sub_words` 
  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];
