version 1.6, 2000/12/08 06:43:10 |
version 1.7, 2001/10/09 01:36:11 |
|
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* |
* |
* $OpenXM: OpenXM_contrib2/asir2000/engine/Q.c,v 1.5 2000/08/22 05:04:04 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/engine/Q.c,v 1.6 2000/12/08 06:43:10 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "base.h" |
#include "base.h" |
#include "inline.h" |
#include "inline.h" |
|
|
void addq(n1,n2,nr) |
void addq(Q n1,Q n2,Q *nr) |
Q n1,n2,*nr; |
|
{ |
{ |
N nm,dn,nm1,nm2,nm3,dn0,dn1,dn2,g,g1,g0,m; |
N nm,dn,nm1,nm2,nm3,dn0,dn1,dn2,g,g1,g0,m; |
int sgn; |
int sgn; |
|
|
} |
} |
} |
} |
|
|
void subq(n1,n2,nr) |
void subq(Q n1,Q n2,Q *nr) |
Q n1,n2,*nr; |
|
{ |
{ |
Q m; |
Q m; |
|
|
|
|
} |
} |
} |
} |
|
|
void mulq(n1,n2,nr) |
void mulq(Q n1,Q n2,Q *nr) |
Q n1,n2,*nr; |
|
{ |
{ |
N nm,nm1,nm2,dn,dn1,dn2,g; |
N nm,nm1,nm2,dn,dn1,dn2,g; |
int sgn; |
int sgn; |
|
|
} |
} |
} |
} |
|
|
void divq(n1,n2,nq) |
void divq(Q n1,Q n2,Q *nq) |
Q n1,n2,*nq; |
|
{ |
{ |
Q m; |
Q m; |
|
|
|
|
} |
} |
} |
} |
|
|
void divsq(n1,n2,nq) |
void divsq(Q n1,Q n2,Q *nq) |
Q n1,n2,*nq; |
|
{ |
{ |
Q m; |
|
int sgn; |
int sgn; |
N tn; |
N tn; |
|
|
|
|
} |
} |
} |
} |
|
|
void invq(n,nr) |
void invq(Q n,Q *nr) |
Q n,*nr; |
|
{ |
{ |
N nm,dn; |
N nm,dn; |
|
|
|
|
} |
} |
} |
} |
|
|
void chsgnq(n,nr) |
void chsgnq(Q n,Q *nr) |
Q n,*nr; |
|
{ |
{ |
Q t; |
Q t; |
|
|
|
|
} |
} |
} |
} |
|
|
void pwrq(n1,n,nr) |
void pwrq(Q n1,Q n,Q *nr) |
Q n1,n,*nr; |
|
{ |
{ |
N nm,dn; |
N nm,dn; |
int sgn; |
int sgn; |
|
|
} |
} |
} |
} |
|
|
int cmpq(q1,q2) |
int cmpq(Q q1,Q q2) |
Q q1,q2; |
|
{ |
{ |
int sgn; |
int sgn; |
N t,s; |
N t,s; |
|
|
} |
} |
} |
} |
|
|
void remq(n,m,nr) |
void remq(Q n,Q m,Q *nr) |
Q n,m; |
|
Q *nr; |
|
{ |
{ |
N q,r,s; |
N q,r,s; |
|
|
|
|
|
|
/* t = [nC0 nC1 ... nCn] */ |
/* t = [nC0 nC1 ... nCn] */ |
|
|
void mkbc(n,t) |
void mkbc(int n,Q *t) |
int n; |
|
Q *t; |
|
{ |
{ |
int i; |
int i; |
N c,d; |
N c,d; |
|
|
* where W(k,l,i) = i! * kCi * lCi |
* where W(k,l,i) = i! * kCi * lCi |
*/ |
*/ |
|
|
void mkwc(k,l,t) |
void mkwc(int k,int l,Q *t) |
int k,l; |
|
Q *t; |
|
{ |
{ |
int i,n,up,low; |
int i,n,up,low; |
N nm,d,c; |
N nm,d,c; |
|
|
/* mod m table */ |
/* mod m table */ |
/* XXX : should be optimized */ |
/* XXX : should be optimized */ |
|
|
void mkwcm(k,l,m,t) |
void mkwcm(int k,int l,int m,int *t) |
int k,l,m; |
|
int *t; |
|
{ |
{ |
int i,n; |
int i,n; |
Q *s; |
Q *s; |
|
|
} |
} |
} |
} |
|
|
void factorial(n,r) |
void factorial(int n,Q *r) |
int n; |
|
Q *r; |
|
{ |
{ |
Q t,iq,s; |
Q t,iq,s; |
unsigned int i,m,m0; |
unsigned int i,m,m0; |
|
|
} |
} |
} |
} |
|
|
void invl(a,mod,ar) |
void invl(Q a,Q mod,Q *ar) |
Q a,mod,*ar; |
|
{ |
{ |
Q f1,f2,a1,a2,q,m,s; |
Q f1,f2,a1,a2,q,m,s; |
N qn,rn; |
N qn,rn; |
|
|
|
|
int kara_mag=100; |
int kara_mag=100; |
|
|
void kmuln(n1,n2,nr) |
void kmuln(N n1,N n2,N *nr) |
N n1,n2,*nr; |
|
{ |
{ |
N n,t,s,m,carry; |
N n,t,s,m,carry; |
int d,d1,d2,len,i,l; |
int d,d1,d2,len,i,l; |
|
|
bcopy((char *)r0,(char *)BD(t),l*sizeof(int)); |
bcopy((char *)r0,(char *)BD(t),l*sizeof(int)); |
} |
} |
|
|
void extractn(n,index,len,nr) |
void extractn(N n,int index,int len,N *nr) |
N n; |
|
int index,len; |
|
N *nr; |
|
{ |
{ |
unsigned int *m; |
unsigned int *m; |
int l; |
int l; |
|
|
} |
} |
} |
} |
|
|
void copyn(n,len,p) |
void copyn(N n,int len,int *p) |
N n; |
|
int len; |
|
int *p; |
|
{ |
{ |
if ( n ) |
if ( n ) |
bcopy((char *)BD(n),(char *)p,MIN(PL(n),len)*sizeof(int)); |
bcopy((char *)BD(n),(char *)p,MIN(PL(n),len)*sizeof(int)); |
} |
} |
|
|
void dupn(n,p) |
void dupn(N n,N p) |
N n; |
|
N p; |
|
{ |
{ |
if ( n ) |
if ( n ) |
bcopy((char *)n,(char *)p,(1+PL(n))*sizeof(int)); |
bcopy((char *)n,(char *)p,(1+PL(n))*sizeof(int)); |
} |
} |
|
|
void kmulnmain(n1,n2,nr) |
void kmulnmain(N n1,N n2,N *nr) |
N n1,n2,*nr; |
|
{ |
{ |
int d1,d2,h,sgn,sgn1,sgn2,len; |
int d1,d2,h,sgn,sgn1,sgn2,len; |
N n1lo,n1hi,n2lo,n2hi,hi,lo,mid1,mid2,mid,s1,s2,t1,t2; |
N n1lo,n1hi,n2lo,n2hi,hi,lo,mid1,mid2,mid,s1,s2,t1,t2; |