version 1.1, 1999/12/03 07:39:08 |
version 1.6, 2004/08/18 00:17:02 |
|
|
/* $OpenXM: OpenXM/src/asir99/engine/PD.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/PD.c,v 1.5 2001/10/09 01:36:11 noro Exp $ |
|
*/ |
#ifndef FBASE |
#ifndef FBASE |
#define FBASE |
#define FBASE |
#endif |
#endif |
|
|
#include "b.h" |
#include "b.h" |
#include "ca.h" |
#include "ca.h" |
|
|
void D_DIVSRP(vl,p1,p2,q,r) |
#include "polydiv.c" |
VL vl; |
|
P p1,p2; |
void plisttop(P *f,V v,int n,P *gp) |
P *q,*r; |
|
{ |
{ |
|
int i; |
|
DCP dc,dc0; |
|
|
|
for ( i = n; (i >= 0) && !f[i]; i-- ); |
|
if ( i < 0 ) |
|
*gp = 0; |
|
else if ( i == 0 ) |
|
*gp = f[0]; |
|
else { |
|
for ( dc0 = 0; i >= 0; i-- ) { |
|
if ( !f[i] ) |
|
continue; |
|
NEXTDC(dc0,dc); |
|
if ( i ) |
|
STOQ(i,DEG(dc)); |
|
else |
|
DEG(dc) = 0; |
|
COEF(dc) = f[i]; |
|
} |
|
NEXT(dc) = 0; MKP(v,dc0,*gp); |
|
} |
|
} |
|
|
|
/* for multivariate polynomials over fields */ |
|
|
|
int divtp(VL vl,P p1,P p2,P *q) |
|
{ |
register int i,j; |
register int i,j; |
register DCP dc1,dc2,dc; |
register DCP dc1,dc2,dc; |
P m,s,dvr; |
P m,m1,s,dvr,t; |
P *pq,*pr,*pd; |
P *pq,*pr,*pd; |
V v1,v2; |
V v1,v2; |
Q deg1,deg2; |
Q deg1,deg2; |
int d1,d2,sgn; |
int d1,d2,sgn; |
|
|
if ( !p1 ) { |
if ( !p1 ) { |
*q = 0; *r = 0; |
*q = 0; |
} else if ( NUM(p2) ) |
return 1; |
if ( NUM(p1) ) { |
} else if ( NUM(p2) ) { |
DIVNUM(p1,p2,q); *r = 0; |
divsp(vl,p1,p2,q); |
} else { |
return 1; |
DIVSDCP(vl,p1,p2,q); *r = 0; |
} else if ( NUM(p1) ) { |
} |
*q = 0; |
else if ( NUM(p1) ) { |
return 0; |
*q = 0; *r = p1; |
|
} else if ( ( v1 = VR(p1) ) == ( v2 = VR(p2) ) ) { |
} else if ( ( v1 = VR(p1) ) == ( v2 = VR(p2) ) ) { |
dc1 = DC(p1); dc2 = DC(p2); |
dc1 = DC(p1); dc2 = DC(p2); |
deg1 = DEG(dc1); deg2 = DEG(dc2); |
deg1 = DEG(dc1); deg2 = DEG(dc2); |
sgn = cmpq(deg1,deg2); |
sgn = cmpq(deg1,deg2); |
if ( sgn == 0 ) { |
if ( sgn == 0 ) |
DIVSP(vl,COEF(dc1),COEF(dc2),q); |
if ( !divtp(vl,COEF(dc1),COEF(dc2),&m) ) { |
MULP(vl,p2,*q,&m); SUBP(vl,p1,m,r); |
*q = 0; |
} else if ( sgn < 0 ) { |
return 0; |
*q = 0; *r = p1; |
} else { |
} else { |
mulp(vl,p2,m,&m1); subp(vl,p1,m1,&s); |
if ( (PL(NM(deg1)) > 1) ) |
if ( !s ) { |
error("divsrp : invalid input"); |
*q = m; |
|
return 1; |
|
} else { |
|
*q = 0; |
|
return 0; |
|
} |
|
} |
|
else if ( sgn < 0 ) { |
|
*q = 0; |
|
return 0; |
|
} else { |
|
if ( (PL(NM(deg1)) > 1) ) { |
|
error("divtp : invalid input"); |
|
*q = 0; |
|
return ( 0 ); |
|
} |
d1 = QTOS(deg1); d2 = QTOS(deg2); |
d1 = QTOS(deg1); d2 = QTOS(deg2); |
W_CALLOC(d1-d2,P,pq); W_CALLOC(d1,P,pr); W_CALLOC(d2,P,pd); |
W_CALLOC(d1-d2,P,pq); W_CALLOC(d1,P,pr); W_CALLOC(d2,P,pd); |
for ( dc = dc1; dc; dc = NEXT(dc) ) |
for ( dc = dc1; dc; dc = NEXT(dc) ) |
pr[QTOS(DEG(dc))] = COEF(dc); |
pr[QTOS(DEG(dc))] = COEF(dc); |
for ( dc = dc2; dc; dc = NEXT(dc) ) |
for ( dc = dc2; dc; dc = NEXT(dc) ) |
pd[QTOS(DEG(dc))] = COEF(dc); |
pd[QTOS(DEG(dc))] = COEF(dc); |
for ( dvr = COEF(dc2), i = d1 - d2; i >= 0; i-- ) { |
for ( dvr = COEF(dc2), i = d1 - d2; i >= 0; i-- ) |
if ( !pr[i+d2] ) |
if ( !pr[i+d2] ) |
continue; |
continue; |
DIVSP(vl,pr[i+d2],dvr,&pq[i]); |
else if ( !divtp(vl,pr[i+d2],dvr,&m) ) { |
for ( j = d2; j >= 0; j-- ) { |
*q = 0; |
MULP(vl,pq[i],pd[j],&m); |
return 0; |
SUBP(vl,pr[i + j],m,&s); pr[i + j] = s; |
} else { |
|
pq[i] = m; |
|
for ( j = d2; j >= 0; j-- ) { |
|
mulp(vl,pq[i],pd[j],&m); |
|
subp(vl,pr[i + j],m,&s); pr[i + j] = s; |
|
} |
} |
} |
|
plisttop(pq,v1,d1 - d2,&m); plisttop(pr,v1,d1 - 1,&t); |
|
if ( t ) { |
|
*q = 0; |
|
return 0; |
|
} else { |
|
*q = m; |
|
return 1; |
} |
} |
plisttop(pq,v1,d1 - d2,q); plisttop(pr,v1,d1 - 1,r); |
|
} |
} |
} else { |
} else { |
for ( ; (v1 != vl->v) && (v2 != vl->v); vl = NEXT(vl) ); |
for ( ; (v1 != vl->v) && (v2 != vl->v); vl = NEXT(vl) ); |
if ( v2 == vl->v ) { |
if ( v2 == vl->v ) { |
*q = 0; *r = p1; |
*q = 0; |
} else |
return 0; |
DIVSRDCP(vl,p1,p2,q,r); |
} else |
|
return divtdcp(vl,p1,p2,q); |
} |
} |
} |
} |
|
|
void D_DIVSRDCP(vl,p1,p2,q,r) |
int divtdcp(VL vl,P p1,P p2,P *q) |
VL vl; |
|
P p1,p2,*q,*r; |
|
{ |
{ |
|
|
P qc,rc; |
|
DCP dc,dcq,dcq0,dcr,dcr0; |
|
|
|
for ( dc = DC(p1), dcq0 = 0, dcr0 = 0; dc; dc = NEXT(dc) ) { |
|
DIVSRP(vl,COEF(dc),p2,&qc,&rc); |
|
if ( qc ) { |
|
NEXTDC(dcq0,dcq); DEG(dcq) = DEG(dc); COEF(dcq) = qc; |
|
} |
|
if ( rc ) { |
|
NEXTDC(dcr0,dcr); DEG(dcr) = DEG(dc); COEF(dcr) = rc; |
|
} |
|
} |
|
if ( dcq0 ) { |
|
NEXT(dcq) = 0; MKP(VR(p1),dcq0,*q); |
|
} else |
|
*q = 0; |
|
if ( dcr0 ) { |
|
NEXT(dcr) = 0; MKP(VR(p1),dcr0,*r); |
|
} else |
|
*r = 0; |
|
} |
|
|
|
void D_DIVSP(vl,p1,p2,q) |
|
VL vl; |
|
P p1,p2,*q; |
|
{ |
|
P t; |
|
|
|
DIVSRP(vl,p1,p2,q,&t); |
|
if ( t ) |
|
error("divsp: cannot happen"); |
|
} |
|
|
|
void D_DIVSDCP(vl,p1,p2,q) |
|
VL vl; |
|
P p1,p2,*q; |
|
{ |
|
|
|
P m; |
P m; |
register DCP dc,dcr,dcr0; |
register DCP dc,dcr,dcr0; |
|
|
for ( dc = DC(p1), dcr0 = 0; dc; dc = NEXT(dc) ) { |
for ( dc = DC(p1), dcr0 = 0; dc; dc = NEXT(dc) ) |
DIVSP(vl,COEF(dc),p2,&m); |
if ( !divtp(vl,COEF(dc),p2,&m) ) { |
NEXTDC(dcr0,dcr); DEG(dcr) = DEG(dc); COEF(dcr) = m; NEXT(dcr) = 0; |
*q = 0; |
} |
return 0; |
|
} else { |
|
NEXTDC(dcr0,dcr); DEG(dcr) = DEG(dc); COEF(dcr) = m; NEXT(dcr) = 0; |
|
} |
MKP(VR(p1),dcr0,*q); |
MKP(VR(p1),dcr0,*q); |
|
return 1; |
} |
} |
|
|
#ifdef FBASE |
int divtpz(VL vl,P p1,P p2,P *q) |
void plisttop(f,v,n,gp) |
|
P *f; |
|
V v; |
|
int n; |
|
P *gp; |
|
{ |
{ |
int i; |
|
DCP dc,dc0; |
|
|
|
for ( i = n; (i >= 0) && !f[i]; i-- ); |
|
if ( i < 0 ) |
|
*gp = 0; |
|
else if ( i == 0 ) |
|
*gp = f[0]; |
|
else { |
|
for ( dc0 = 0; i >= 0; i-- ) { |
|
if ( !f[i] ) |
|
continue; |
|
NEXTDC(dc0,dc); |
|
if ( i ) |
|
STOQ(i,DEG(dc)); |
|
else |
|
DEG(dc) = 0; |
|
COEF(dc) = f[i]; |
|
} |
|
NEXT(dc) = 0; MKP(v,dc0,*gp); |
|
} |
|
} |
|
|
|
int divtpz(vl,p1,p2,q) |
|
VL vl; |
|
P p1,p2,*q; |
|
{ |
|
register int i,j; |
register int i,j; |
register DCP dc1,dc2,dc; |
register DCP dc1,dc2,dc; |
P m,m1,s,dvr,t; |
P m,m1,s,dvr,t; |
|
|
} |
} |
} |
} |
|
|
int divtdcpz(vl,p1,p2,q) |
int divtdcpz(VL vl,P p1,P p2,P *q) |
VL vl; |
|
P p1,p2,*q; |
|
{ |
{ |
|
|
P m; |
P m; |
|
|
return ( 1 ); |
return ( 1 ); |
} |
} |
|
|
void udivpz(f1,f2,fqp,frp) |
void udivpz(P f1,P f2,P *fqp,P *frp) |
P f1,f2,*fqp,*frp; |
|
{ |
{ |
register int n1,n2,i,j; |
register int n1,n2,i,j; |
Q *pq,*pr,*pd,d,m,s,q; |
Q *pq,*pr,*pd,d,m,s,q; |
Line 337 P f1,f2,*fqp,*frp; |
|
Line 366 P f1,f2,*fqp,*frp; |
|
plisttop((P *)pq,VR(f1),n1-n2,fqp); plisttop((P *)pr,VR(f1),n2-1,frp); |
plisttop((P *)pq,VR(f1),n1-n2,fqp); plisttop((P *)pr,VR(f1),n2-1,frp); |
} |
} |
|
|
void udivpwm(mod,p1,p2,q,r) |
void udivpwm(Q mod,P p1,P p2,P *q,P *r) |
Q mod; |
|
P p1,p2; |
|
P *q,*r; |
|
{ |
{ |
P s,t,u,tq,tr; |
P s,t,u,tq,tr; |
|
|
|
|
cmp(mod,tr,r); mulpq(tq,t,&s); cmp(mod,s,q); |
cmp(mod,tr,r); mulpq(tq,t,&s); cmp(mod,s,q); |
} |
} |
|
|
void udivpzwm(mod,f1,f2,fqp,frp) |
void udivpzwm(Q mod,P f1,P f2,P *fqp,P *frp) |
Q mod; |
|
P f1,f2,*fqp,*frp; |
|
{ |
{ |
register int n1,n2,i,j; |
register int n1,n2,i,j; |
Q *pq,*pr,*pd,d,m,s,q; |
Q *pq,*pr,*pd,d,m,s,q; |
Line 416 P f1,f2,*fqp,*frp; |
|
Line 440 P f1,f2,*fqp,*frp; |
|
} |
} |
plisttop((P *)pq,VR(f1),n1-n2,fqp); plisttop((P *)pr,VR(f1),n2-1,frp); |
plisttop((P *)pq,VR(f1),n1-n2,fqp); plisttop((P *)pr,VR(f1),n2-1,frp); |
} |
} |
#endif |
|