crypto/bn/bn_mont.c:275: error: INTEGER_OVERFLOW_L2
  (0 - [0, 1]):unsigned64.
Showing all 3 steps of the trace


crypto/bn/bn_mont.c:177:1: <RHS trace>
175.   
176.   #ifdef MONT_WORD
177. > static int BN_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
178.   	{
179.   	BIGNUM *n;

crypto/bn/bn_mont.c:177:1: Parameter `ret->dmax`
175.   
176.   #ifdef MONT_WORD
177. > static int BN_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
178.   	{
179.   	BIGNUM *n;

crypto/bn/bn_mont.c:275:2: Binary operation: (0 - [0, 1]):unsigned64
273.   	 * trick unconditional memcpy below to perform in-place
274.   	 * "refresh" instead of actual copy. */
275.   	m1=0-(size_t)(((al-ri)>>(sizeof(al)*8-1))&1);	/* al<ri */
        ^
276.   	m2=0-(size_t)(((ri-al)>>(sizeof(al)*8-1))&1);	/* al>ri */
277.   	m1|=m2;			/* (al!=ri) */

static int BN_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
	{
	BIGNUM *n;
	BN_ULONG *ap,*np,*rp,n0,v,*nrp;
	int al,nl,max,i,x,ri;
	n= &(mont->N);
	al=ri=mont->ri/BN_BITS2;
	nl=n->top;
	if ((al == 0) || (nl == 0)) { ret->top=0; return(1); }
	max=(nl+al+1);
	if (bn_wexpand(r,max) == NULL) return(0);
	r->neg^=n->neg;
	np=n->d;
	rp=r->d;
	nrp= &(r->d[nl]);
#if 1
	for (i=r->top; i<max; i++)
		r->d[i]=0;
#else
	memset(&(r->d[r->top]),0,(max-r->top)*sizeof(BN_ULONG));
#endif
	r->top=max;
	n0=mont->n0[0];
#ifdef BN_COUNT
	fprintf(stderr,"word BN_from_montgomery_word %d * %d\n",nl,nl);
#endif
	for (i=0; i<nl; i++)
		{
#ifdef __TANDEM
                {
                   long long t1;
                   long long t2;
                   long long t3;
                   t1 = rp[0] * (n0 & 0177777);
                   t2 = 037777600000l;
                   t2 = n0 & t2;
                   t3 = rp[0] & 0177777;
                   t2 = (t3 * t2) & BN_MASK2;
                   t1 = t1 + t2;
                   v=bn_mul_add_words(rp,np,nl,(BN_ULONG) t1);
                }
#else
		v=bn_mul_add_words(rp,np,nl,(rp[0]*n0)&BN_MASK2);
#endif
		nrp++;
		rp++;
		if (((nrp[-1]+=v)&BN_MASK2) >= v)
			continue;
		else
			{
			if (((++nrp[0])&BN_MASK2) != 0) continue;
			if (((++nrp[1])&BN_MASK2) != 0) continue;
			for (x=2; (((++nrp[x])&BN_MASK2) == 0); x++) ;
			}
		}
	bn_correct_top(r);
	if (r->top <= ri)
		{
		ret->top=0;
		return(1);
		}
	al=r->top-ri;
#define BRANCH_FREE 1
#if BRANCH_FREE
	if (bn_wexpand(ret,ri) == NULL) return(0);
	x=0-(((al-ri)>>(sizeof(al)*8-1))&1);
	ret->top=x=(ri&~x)|(al&x);
	ret->neg=r->neg;
	rp=ret->d;
	ap=&(r->d[ri]);
	{
	size_t m1,m2;
	v=bn_sub_words(rp,ap,np,ri);
	m1=0-(size_t)(((al-ri)>>(sizeof(al)*8-1))&1);
	m2=0-(size_t)(((ri-al)>>(sizeof(al)*8-1))&1);
	m1|=m2;
	m1|=(0-(size_t)v);
	m1&=~m2;
	nrp=(BN_ULONG *)(((size_t)rp&~m1)|((size_t)ap&m1));
	}
	for (i=0,ri-=4; i<ri; i+=4)
		{
		BN_ULONG t1,t2,t3,t4;
		t1=nrp[i+0];
		t2=nrp[i+1];
		t3=nrp[i+2];	ap[i+0]=0;
		t4=nrp[i+3];	ap[i+1]=0;
		rp[i+0]=t1;	ap[i+2]=0;
		rp[i+1]=t2;	ap[i+3]=0;
		rp[i+2]=t3;
		rp[i+3]=t4;
		}
	for (ri+=4; i<ri; i++)
		rp[i]=nrp[i], ap[i]=0;
#else
	if (bn_wexpand(ret,al) == NULL) return(0);
	ret->top=al;
	ret->neg=r->neg;
	rp=ret->d;
	ap=&(r->d[ri]);
	al-=4;
	for (i=0; i<al; i+=4)
		{
		BN_ULONG t1,t2,t3,t4;
		t1=ap[i+0];
		t2=ap[i+1];
		t3=ap[i+2];
		t4=ap[i+3];
		rp[i+0]=t1;
		rp[i+1]=t2;
		rp[i+2]=t3;
		rp[i+3]=t4;
		}
	al+=4;
	for (; i<al; i++)
		rp[i]=ap[i];
	if (BN_ucmp(ret, &(mont->N)) >= 0)
		{
		if (!BN_usub(ret,ret,&(mont->N))) return(0);
		}
#endif
	bn_check_top(ret);
	return(1);
	}
['static int BN_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)\n\t{\n\tBIGNUM *n;\n\tBN_ULONG *ap,*np,*rp,n0,v,*nrp;\n\tint al,nl,max,i,x,ri;\n\tn= &(mont->N);\n\tal=ri=mont->ri/BN_BITS2;\n\tnl=n->top;\n\tif ((al == 0) || (nl == 0)) { ret->top=0; return(1); }\n\tmax=(nl+al+1);\n\tif (bn_wexpand(r,max) == NULL) return(0);\n\tr->neg^=n->neg;\n\tnp=n->d;\n\trp=r->d;\n\tnrp= &(r->d[nl]);\n#if 1\n\tfor (i=r->top; i<max; i++)\n\t\tr->d[i]=0;\n#else\n\tmemset(&(r->d[r->top]),0,(max-r->top)*sizeof(BN_ULONG));\n#endif\n\tr->top=max;\n\tn0=mont->n0[0];\n#ifdef BN_COUNT\n\tfprintf(stderr,"word BN_from_montgomery_word %d * %d\\n",nl,nl);\n#endif\n\tfor (i=0; i<nl; i++)\n\t\t{\n#ifdef __TANDEM\n                {\n                   long long t1;\n                   long long t2;\n                   long long t3;\n                   t1 = rp[0] * (n0 & 0177777);\n                   t2 = 037777600000l;\n                   t2 = n0 & t2;\n                   t3 = rp[0] & 0177777;\n                   t2 = (t3 * t2) & BN_MASK2;\n                   t1 = t1 + t2;\n                   v=bn_mul_add_words(rp,np,nl,(BN_ULONG) t1);\n                }\n#else\n\t\tv=bn_mul_add_words(rp,np,nl,(rp[0]*n0)&BN_MASK2);\n#endif\n\t\tnrp++;\n\t\trp++;\n\t\tif (((nrp[-1]+=v)&BN_MASK2) >= v)\n\t\t\tcontinue;\n\t\telse\n\t\t\t{\n\t\t\tif (((++nrp[0])&BN_MASK2) != 0) continue;\n\t\t\tif (((++nrp[1])&BN_MASK2) != 0) continue;\n\t\t\tfor (x=2; (((++nrp[x])&BN_MASK2) == 0); x++) ;\n\t\t\t}\n\t\t}\n\tbn_correct_top(r);\n\tif (r->top <= ri)\n\t\t{\n\t\tret->top=0;\n\t\treturn(1);\n\t\t}\n\tal=r->top-ri;\n#define BRANCH_FREE 1\n#if BRANCH_FREE\n\tif (bn_wexpand(ret,ri) == NULL) return(0);\n\tx=0-(((al-ri)>>(sizeof(al)*8-1))&1);\n\tret->top=x=(ri&~x)|(al&x);\n\tret->neg=r->neg;\n\trp=ret->d;\n\tap=&(r->d[ri]);\n\t{\n\tsize_t m1,m2;\n\tv=bn_sub_words(rp,ap,np,ri);\n\tm1=0-(size_t)(((al-ri)>>(sizeof(al)*8-1))&1);\n\tm2=0-(size_t)(((ri-al)>>(sizeof(al)*8-1))&1);\n\tm1|=m2;\n\tm1|=(0-(size_t)v);\n\tm1&=~m2;\n\tnrp=(BN_ULONG *)(((size_t)rp&~m1)|((size_t)ap&m1));\n\t}\n\tfor (i=0,ri-=4; i<ri; i+=4)\n\t\t{\n\t\tBN_ULONG t1,t2,t3,t4;\n\t\tt1=nrp[i+0];\n\t\tt2=nrp[i+1];\n\t\tt3=nrp[i+2];\tap[i+0]=0;\n\t\tt4=nrp[i+3];\tap[i+1]=0;\n\t\trp[i+0]=t1;\tap[i+2]=0;\n\t\trp[i+1]=t2;\tap[i+3]=0;\n\t\trp[i+2]=t3;\n\t\trp[i+3]=t4;\n\t\t}\n\tfor (ri+=4; i<ri; i++)\n\t\trp[i]=nrp[i], ap[i]=0;\n#else\n\tif (bn_wexpand(ret,al) == NULL) return(0);\n\tret->top=al;\n\tret->neg=r->neg;\n\trp=ret->d;\n\tap=&(r->d[ri]);\n\tal-=4;\n\tfor (i=0; i<al; i+=4)\n\t\t{\n\t\tBN_ULONG t1,t2,t3,t4;\n\t\tt1=ap[i+0];\n\t\tt2=ap[i+1];\n\t\tt3=ap[i+2];\n\t\tt4=ap[i+3];\n\t\trp[i+0]=t1;\n\t\trp[i+1]=t2;\n\t\trp[i+2]=t3;\n\t\trp[i+3]=t4;\n\t\t}\n\tal+=4;\n\tfor (; i<al; i++)\n\t\trp[i]=ap[i];\n\tif (BN_ucmp(ret, &(mont->N)) >= 0)\n\t\t{\n\t\tif (!BN_usub(ret,ret,&(mont->N))) return(0);\n\t\t}\n#endif\n\tbn_check_top(ret);\n\treturn(1);\n\t}']