Home
last modified time | relevance | path

Searched refs:MR_DIV (Results 1 – 7 of 7) sorted by relevance

/dports/math/miracl/miracl-5.6/
H A Dmrsmall.c103 q=MR_DIV(x,p); in invers()
132 for (k=0;MR_REMAIN(x,2)==0;k++) x=MR_DIV(x,2); in jac()
164 n=MR_DIV(n,2); in spmd()
201 q=MR_DIV(q,2); in sqrmp()
H A Dmrround.c119 lq=MR_DIV(mr_mip->u,mr_mip->v); in euclid()
124 lq=MR_DIV((mr_mip->u+mr_mip->a),(mr_mip->v+mr_mip->c)); in euclid()
125 if (lq!=MR_DIV((mr_mip->u+mr_mip->b),(mr_mip->v+mr_mip->d))) break; in euclid()
H A Dmrgcd.c144 lq=MR_DIV((u+a),(v+c)); in egcd()
145 if (lq!=MR_DIV((u+b),(v+d))) break; in egcd()
H A Dmrxgcd.c79 lq=8+MR_DIV(x,v); in qdiv()
94 return MR_DIV(u,v); in qdiv()
306 if (q>=MR_DIV(MAXBASE-b,d)) break; in xgcd()
H A Dmrcore.c571 for (i=0;i<n;i++) x=MR_DIV(x,2.0); in mr_shiftbits()
623 temp=MR_DIV(MAXBASE,nb); in mr_setbase()
626 temp=MR_DIV(temp,nb); in mr_setbase()
1178 b=MR_DIV(b,2); in mirsys_basic()
1525 n=MR_DIV(n,mr_mip->apbase); in getdig()
1968 a=MR_DIV(a,m); in mr_testbit()
1970 if ((MR_DIV(a,2.0)*2.0) != a) return 1; in mr_testbit()
H A Dmiracl.h263 #define MR_DIV(a,b) (modf((a)/(b),&dres),dres) macro
274 #define MR_REMAIN(a,b) ((a)-(b)*MR_DIV((a),(b)))
286 #define MR_DIV(a,b) ((a)/(b)) macro
H A Dmrarth2.c88 norm=MR_DIV(mr_mip->base,(mr_small)(y->w[len-1]+1)); in normalise()
925 d=MR_DIV(w0->w[0],y->w[0]); in divide()
929 else if (MR_DIV(w0->w[x0-1],4)<y->w[x0-1]) in divide()