=================================================================== RCS file: /home/cvs/OpenXM_contrib2/asir2000/engine/Q.c,v retrieving revision 1.1.1.1 retrieving revision 1.7 diff -u -p -r1.1.1.1 -r1.7 --- OpenXM_contrib2/asir2000/engine/Q.c 1999/12/03 07:39:08 1.1.1.1 +++ OpenXM_contrib2/asir2000/engine/Q.c 2001/10/09 01:36:11 1.7 @@ -1,10 +1,57 @@ -/* $OpenXM: OpenXM/src/asir99/engine/Q.c,v 1.1.1.1 1999/11/10 08:12:26 noro Exp $ */ +/* + * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED + * All rights reserved. + * + * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited, + * non-exclusive and royalty-free license to use, copy, modify and + * redistribute, solely for non-commercial and non-profit purposes, the + * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and + * conditions of this Agreement. For the avoidance of doubt, you acquire + * only a limited right to use the SOFTWARE hereunder, and FLL or any + * third party developer retains all rights, including but not limited to + * copyrights, in and to the SOFTWARE. + * + * (1) FLL does not grant you a license in any way for commercial + * purposes. You may use the SOFTWARE only for non-commercial and + * non-profit purposes only, such as academic, research and internal + * business use. + * (2) The SOFTWARE is protected by the Copyright Law of Japan and + * international copyright treaties. If you make copies of the SOFTWARE, + * with or without modification, as permitted hereunder, you shall affix + * to all such copies of the SOFTWARE the above copyright notice. + * (3) An explicit reference to this SOFTWARE and its copyright owner + * shall be made on your publication or presentation in any form of the + * results obtained by use of the SOFTWARE. + * (4) In the event that you modify the SOFTWARE, you shall notify FLL by + * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification + * for such modification or the source code of the modified part of the + * SOFTWARE. + * + * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL + * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND + * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS + * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES' + * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY + * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY. + * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT, + * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY + * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL + * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES + * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES + * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY + * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF + * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART + * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY + * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, + * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. + * + * $OpenXM: OpenXM_contrib2/asir2000/engine/Q.c,v 1.6 2000/12/08 06:43:10 noro Exp $ +*/ #include "ca.h" #include "base.h" #include "inline.h" -void addq(n1,n2,nr) -Q n1,n2,*nr; +void addq(Q n1,Q n2,Q *nr) { N nm,dn,nm1,nm2,nm3,dn0,dn1,dn2,g,g1,g0,m; int sgn; @@ -87,8 +134,7 @@ Q n1,n2,*nr; } } -void subq(n1,n2,nr) -Q n1,n2,*nr; +void subq(Q n1,Q n2,Q *nr) { Q m; @@ -107,8 +153,7 @@ Q n1,n2,*nr; } } -void mulq(n1,n2,nr) -Q n1,n2,*nr; +void mulq(Q n1,Q n2,Q *nr) { N nm,nm1,nm2,dn,dn1,dn2,g; int sgn; @@ -154,8 +199,7 @@ Q n1,n2,*nr; } } -void divq(n1,n2,nq) -Q n1,n2,*nq; +void divq(Q n1,Q n2,Q *nq) { Q m; @@ -172,9 +216,28 @@ Q n1,n2,*nq; } } -void invq(n,nr) -Q n,*nr; +void divsq(Q n1,Q n2,Q *nq) { + int sgn; + N tn; + + if ( !n2 ) { + error("division by 0"); + *nq = 0; + return; + } else if ( !n1 ) + *nq = 0; + else if ( n1 == n2 ) + *nq = ONE; + else { + divsn(NM(n1),NM(n2),&tn); + sgn = SGN(n1)*SGN(n2); + NTOQ(tn,sgn,*nq); + } +} + +void invq(Q n,Q *nr) +{ N nm,dn; if ( INT(n) ) @@ -194,8 +257,7 @@ Q n,*nr; } } -void chsgnq(n,nr) -Q n,*nr; +void chsgnq(Q n,Q *nr) { Q t; @@ -206,8 +268,7 @@ Q n,*nr; } } -void pwrq(n1,n,nr) -Q n1,n,*nr; +void pwrq(Q n1,Q n,Q *nr) { N nm,dn; int sgn; @@ -247,8 +308,7 @@ Q n1,n,*nr; } } -int cmpq(q1,q2) -Q q1,q2; +int cmpq(Q q1,Q q2) { int sgn; N t,s; @@ -282,9 +342,7 @@ Q q1,q2; } } -void remq(n,m,nr) -Q n,m; -Q *nr; +void remq(Q n,Q m,Q *nr) { N q,r,s; @@ -302,9 +360,9 @@ Q *nr; } } -void mkbc(n,t) -int n; -Q *t; +/* t = [nC0 nC1 ... nCn] */ + +void mkbc(int n,Q *t) { int i; N c,d; @@ -317,10 +375,48 @@ Q *t; t[i] = t[n-i]; } -void factorial(n,r) -int n; -Q *r; +/* + * Dx^k*x^l = W(k,l,0)*x^l*Dx^k+W(k,l,1)*x^(l-1)*x^(k-1)*+... + * + * t = [W(k,l,0) W(k,l,1) ... W(k,l,min(k,l)] + * where W(k,l,i) = i! * kCi * lCi + */ + +void mkwc(int k,int l,Q *t) { + int i,n,up,low; + N nm,d,c; + + n = MIN(k,l); + for ( t[0] = ONE, i = 1; i <= n; i++ ) { + DM(k-i+1,l-i+1,up,low); + if ( up ) { + nm = NALLOC(2); PL(nm) = 2; BD(nm)[0] = low; BD(nm)[1] = up; + } else { + nm = NALLOC(1); PL(nm) = 1; BD(nm)[0] = low; + } + kmuln(NM(t[i-1]),nm,&d); divin(d,i,&c); NTOQ(c,1,t[i]); + } +} + +/* mod m table */ +/* XXX : should be optimized */ + +void mkwcm(int k,int l,int m,int *t) +{ + int i,n; + Q *s; + + n = MIN(k,l); + s = (Q *)ALLOCA((n+1)*sizeof(Q)); + mkwc(k,l,s); + for ( i = 0; i <= n; i++ ) { + t[i] = rem(NM(s[i]),m); + } +} + +void factorial(int n,Q *r) +{ Q t,iq,s; unsigned int i,m,m0; unsigned int c; @@ -343,8 +439,7 @@ Q *r; } } -void invl(a,mod,ar) -Q a,mod,*ar; +void invl(Q a,Q mod,Q *ar) { Q f1,f2,a1,a2,q,m,s; N qn,rn; @@ -384,8 +479,7 @@ Q a,mod,*ar; int kara_mag=100; -void kmuln(n1,n2,nr) -N n1,n2,*nr; +void kmuln(N n1,N n2,N *nr) { N n,t,s,m,carry; int d,d1,d2,len,i,l; @@ -428,10 +522,7 @@ N n1,n2,*nr; bcopy((char *)r0,(char *)BD(t),l*sizeof(int)); } -void extractn(n,index,len,nr) -N n; -int index,len; -N *nr; +void extractn(N n,int index,int len,N *nr) { unsigned int *m; int l; @@ -453,25 +544,19 @@ N *nr; } } -void copyn(n,len,p) -N n; -int len; -int *p; +void copyn(N n,int len,int *p) { if ( n ) bcopy((char *)BD(n),(char *)p,MIN(PL(n),len)*sizeof(int)); } -void dupn(n,p) -N n; -N p; +void dupn(N n,N p) { if ( n ) bcopy((char *)n,(char *)p,(1+PL(n))*sizeof(int)); } -void kmulnmain(n1,n2,nr) -N n1,n2,*nr; +void kmulnmain(N n1,N n2,N *nr) { int d1,d2,h,sgn,sgn1,sgn2,len; N n1lo,n1hi,n2lo,n2hi,hi,lo,mid1,mid2,mid,s1,s2,t1,t2;