Home | History | Annotate | Download | only in bn

Lines Matching refs:n2

206 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t)
208 int n=n2/2;
213 fprintf(stderr," bn_sqr_recursive %d * %d\n",n2,n2);
215 if (n2 == 4)
224 else if (n2 == 8)
233 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL)
235 bn_sqr_normal(r,a,n2,t);
249 p= &(t[n2*2]);
252 bn_sqr_recursive(&(t[n2]),t,n,p);
254 memset(&(t[n2]),0,n2*sizeof(BN_ULONG));
256 bn_sqr_recursive(&(r[n2]),&(a[n]),n,p);
263 c1=(int)(bn_add_words(t,r,&(r[n2]),n2));
266 c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2));
273 c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2));
276 p= &(r[n+n2]);