version 1.18, 2001/09/17 10:32:40 |
version 1.25, 2003/01/18 02:38:56 |
|
|
* 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/builtin/dp-supp.c,v 1.17 2001/09/17 02:58:27 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/dp-supp.c,v 1.24 2003/01/15 04:53:03 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "base.h" |
#include "base.h" |
Line 67 extern NODE TraceList; |
|
Line 67 extern NODE TraceList; |
|
* |
* |
*/ |
*/ |
|
|
void dp_ptozp(p,rp) |
void dp_ptozp(DP p,DP *rp) |
DP p,*rp; |
|
{ |
{ |
MP m,mr,mr0; |
MP m,mr,mr0; |
int i,n; |
int i,n; |
|
|
} |
} |
} |
} |
|
|
void dp_ptozp2(p0,p1,hp,rp) |
void dp_ptozp2(DP p0,DP p1,DP *hp,DP *rp) |
DP p0,p1; |
|
DP *hp,*rp; |
|
{ |
{ |
DP t,s,h,r; |
DP t,s,h,r; |
MP m,mr,mr0,m0; |
MP m,mr,mr0,m0; |
|
|
*hp = h; *rp = r; |
*hp = h; *rp = r; |
} |
} |
|
|
void dp_idiv(p,c,rp) |
void dp_idiv(DP p,Q c,DP *rp) |
DP p; |
|
Q c; |
|
DP *rp; |
|
{ |
{ |
Q t; |
Q t; |
N nm,q; |
N nm,q; |
|
|
} |
} |
} |
} |
|
|
void dp_mbase(hlist,mbase) |
void dp_mbase(NODE hlist,NODE *mbase) |
NODE hlist; |
|
NODE *mbase; |
|
{ |
{ |
DL *dl; |
DL *dl; |
DL d; |
DL d; |
|
|
while ( 1 ) { |
while ( 1 ) { |
insert_to_node(d,mbase,nvar); |
insert_to_node(d,mbase,nvar); |
for ( i = nvar-1; i >= 0; ) { |
for ( i = nvar-1; i >= 0; ) { |
d->d[i]++; d->td++; |
d->d[i]++; |
|
d->td += MUL_WEIGHT(1,i); |
for ( j = 0; j < n; j++ ) { |
for ( j = 0; j < n; j++ ) { |
if ( _dl_redble(dl[j],d,nvar) ) |
if ( _dl_redble(dl[j],d,nvar) ) |
break; |
break; |
|
|
for ( j = nvar-1; j >= i; j-- ) |
for ( j = nvar-1; j >= i; j-- ) |
d->d[j] = 0; |
d->d[j] = 0; |
for ( j = 0, td = 0; j < i; j++ ) |
for ( j = 0, td = 0; j < i; j++ ) |
td += d->d[j]; |
td += MUL_WEIGHT(d->d[j],j); |
d->td = td; |
d->td = td; |
i--; |
i--; |
} else |
} else |
|
|
} |
} |
} |
} |
|
|
int _dl_redble(d1,d2,nvar) |
int _dl_redble(DL d1,DL d2,int nvar) |
DL d1,d2; |
|
int nvar; |
|
{ |
{ |
int i; |
int i; |
|
|
|
|
return 1; |
return 1; |
} |
} |
|
|
void insert_to_node(d,n,nvar) |
void insert_to_node(DL d,NODE *n,int nvar) |
DL d; |
|
NODE *n; |
|
int nvar; |
|
{ |
{ |
DL d1; |
DL d1; |
MP m; |
MP m; |
|
|
} |
} |
} |
} |
|
|
void dp_vtod(c,p,rp) |
void dp_vtod(Q *c,DP p,DP *rp) |
Q *c; |
|
DP p; |
|
DP *rp; |
|
{ |
{ |
MP mr0,m,mr; |
MP mr0,m,mr; |
int i; |
int i; |
|
|
extern int mpi_mag; |
extern int mpi_mag; |
extern int PCoeffs; |
extern int PCoeffs; |
|
|
void dp_ptozp_d(p,rp) |
void dp_ptozp_d(DP p,DP *rp) |
DP p,*rp; |
|
{ |
{ |
int i,j,k,l,n,nsep; |
int i,j,k,l,n,nsep; |
MP m; |
MP m; |
|
|
VECT c,cs; |
VECT c,cs; |
VECT qi,ri; |
VECT qi,ri; |
LIST *qr; |
LIST *qr; |
int s,id; |
|
Obj dmy; |
Obj dmy; |
Q d0,d1,gcd,a,u,u1; |
Q d0,d1,gcd,a,u,u1; |
Q *q,*r; |
Q *q,*r; |
|
|
double t_e,t_d,t_d1,t_c; |
double t_e,t_d,t_d1,t_c; |
extern int DP_NFStat; |
extern int DP_NFStat; |
extern LIST Dist; |
extern LIST Dist; |
|
void Pox_rpc(); |
|
void Pox_pop_local(); |
|
|
if ( !p ) |
if ( !p ) |
*rp = 0; |
*rp = 0; |
|
|
} |
} |
} |
} |
|
|
void dp_ptozp2_d(p0,p1,hp,rp) |
void dp_ptozp2_d(DP p0,DP p1,DP *hp,DP *rp) |
DP p0,p1; |
|
DP *hp,*rp; |
|
{ |
{ |
DP t,s,h,r; |
DP t,s,h,r; |
MP m,mr,mr0,m0; |
MP m,mr,mr0,m0; |
|
|
*hp = h; *rp = r; |
*hp = h; *rp = r; |
} |
} |
|
|
void dp_prim(p,rp) |
int have_sf_coef(P p) |
DP p,*rp; |
|
{ |
{ |
|
DCP dc; |
|
|
|
if ( !p ) |
|
return 0; |
|
else if ( NUM(p) ) |
|
return NID((Num)p) == N_GFS ? 1 : 0; |
|
else { |
|
for ( dc = DC(p); dc; dc = NEXT(dc) ) |
|
if ( have_sf_coef(COEF(dc)) ) |
|
return 1; |
|
return 0; |
|
} |
|
} |
|
|
|
void head_coef(P p,Num *c) |
|
{ |
|
if ( !p ) |
|
*c = 0; |
|
else if ( NUM(p) ) |
|
*c = (Num)p; |
|
else |
|
head_coef(COEF(DC(p)),c); |
|
} |
|
|
|
void dp_monic_sf(DP p,DP *rp) |
|
{ |
|
Num c; |
|
|
|
if ( !p ) |
|
*rp = 0; |
|
else { |
|
head_coef(BDY(p)->c,&c); |
|
divsdc(CO,p,(P)c,rp); |
|
} |
|
} |
|
|
|
void dp_prim(DP p,DP *rp) |
|
{ |
P t,g; |
P t,g; |
DP p1; |
DP p1; |
MP m,mr,mr0; |
MP m,mr,mr0; |
|
|
|
|
if ( !p ) |
if ( !p ) |
*rp = 0; |
*rp = 0; |
else if ( dp_fcoeffs ) |
else if ( dp_fcoeffs == N_GFS ) { |
|
for ( m = BDY(p); m; m = NEXT(m) ) |
|
if ( OID(m->c) == O_N ) { |
|
/* GCD of coeffs = 1 */ |
|
dp_monic_sf(p,rp); |
|
return; |
|
} else break; |
|
/* compute GCD over the finite fieid */ |
|
for ( m = BDY(p), n = 0; m; m = NEXT(m), n++ ); |
|
w = (P *)ALLOCA(n*sizeof(P)); |
|
for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) |
|
w[i] = m->c; |
|
gcdsf(CO,w,n,&g); |
|
if ( NUM(g) ) |
|
dp_monic_sf(p,rp); |
|
else { |
|
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
|
NEXTMP(mr0,mr); divsp(CO,m->c,g,&mr->c); mr->dl = m->dl; |
|
} |
|
NEXT(mr) = 0; MKDP(p->nv,mr0,p1); p1->sugar = p->sugar; |
|
dp_monic_sf(p1,rp); |
|
} |
|
return; |
|
} else if ( dp_fcoeffs ) |
*rp = p; |
*rp = p; |
else if ( NoGCD ) |
else if ( NoGCD ) |
dp_ptozp(p,rp); |
dp_ptozp(p,rp); |
|
|
} |
} |
} |
} |
|
|
void heu_nezgcdnpz(vl,pl,m,pr) |
void heu_nezgcdnpz(VL vl,P *pl,int m,P *pr) |
VL vl; |
|
P *pl,*pr; |
|
int m; |
|
{ |
{ |
int i,r; |
int i,r; |
P gcd,t,s1,s2,u; |
P gcd,t,s1,s2,u; |
|
|
*pr = gcd; |
*pr = gcd; |
} |
} |
|
|
void dp_prim_mod(p,mod,rp) |
void dp_prim_mod(DP p,int mod,DP *rp) |
int mod; |
|
DP p,*rp; |
|
{ |
{ |
P t,g; |
P t,g; |
MP m,mr,mr0; |
MP m,mr,mr0; |
|
|
} |
} |
} |
} |
|
|
void dp_cont(p,rp) |
void dp_cont(DP p,Q *rp) |
DP p; |
|
Q *rp; |
|
{ |
{ |
VECT v; |
VECT v; |
|
|
dp_dtov(p,&v); igcdv(v,rp); |
dp_dtov(p,&v); igcdv(v,rp); |
} |
} |
|
|
void dp_dtov(dp,rp) |
void dp_dtov(DP dp,VECT *rp) |
DP dp; |
|
VECT *rp; |
|
{ |
{ |
MP m,t; |
MP m,t; |
int i,n; |
int i,n; |
|
|
* |
* |
*/ |
*/ |
|
|
void dp_sp(p1,p2,rp) |
void dp_sp(DP p1,DP p2,DP *rp) |
DP p1,p2; |
|
DP *rp; |
|
{ |
{ |
int i,n,td; |
int i,n,td; |
int *w; |
int *w; |
|
|
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
w = (int *)ALLOCA(n*sizeof(int)); |
w = (int *)ALLOCA(n*sizeof(int)); |
for ( i = 0, td = 0; i < n; i++ ) { |
for ( i = 0, td = 0; i < n; i++ ) { |
w[i] = MAX(d1->d[i],d2->d[i]); td += w[i]; |
w[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(w[i],i); |
} |
} |
|
|
NEWDL(d,n); d->td = td - d1->td; |
NEWDL(d,n); d->td = td - d1->td; |
|
|
} |
} |
} |
} |
|
|
void _dp_sp_dup(p1,p2,rp) |
void _dp_sp_dup(DP p1,DP p2,DP *rp) |
DP p1,p2; |
|
DP *rp; |
|
{ |
{ |
int i,n,td; |
int i,n,td; |
int *w; |
int *w; |
|
|
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
w = (int *)ALLOCA(n*sizeof(int)); |
w = (int *)ALLOCA(n*sizeof(int)); |
for ( i = 0, td = 0; i < n; i++ ) { |
for ( i = 0, td = 0; i < n; i++ ) { |
w[i] = MAX(d1->d[i],d2->d[i]); td += w[i]; |
w[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(w[i],i); |
} |
} |
|
|
_NEWDL(d,n); d->td = td - d1->td; |
_NEWDL(d,n); d->td = td - d1->td; |
|
|
} |
} |
} |
} |
|
|
void dp_sp_mod(p1,p2,mod,rp) |
void dp_sp_mod(DP p1,DP p2,int mod,DP *rp) |
DP p1,p2; |
|
int mod; |
|
DP *rp; |
|
{ |
{ |
int i,n,td; |
int i,n,td; |
int *w; |
int *w; |
|
|
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
w = (int *)ALLOCA(n*sizeof(int)); |
w = (int *)ALLOCA(n*sizeof(int)); |
for ( i = 0, td = 0; i < n; i++ ) { |
for ( i = 0, td = 0; i < n; i++ ) { |
w[i] = MAX(d1->d[i],d2->d[i]); td += w[i]; |
w[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(w[i],i); |
} |
} |
NEWDL_NOINIT(d,n); d->td = td - d1->td; |
NEWDL_NOINIT(d,n); d->td = td - d1->td; |
for ( i = 0; i < n; i++ ) |
for ( i = 0; i < n; i++ ) |
|
|
submd(CO,mod,t,u,rp); |
submd(CO,mod,t,u,rp); |
} |
} |
|
|
void _dp_sp_mod_dup(p1,p2,mod,rp) |
void _dp_sp_mod_dup(DP p1,DP p2,int mod,DP *rp) |
DP p1,p2; |
|
int mod; |
|
DP *rp; |
|
{ |
{ |
int i,n,td; |
int i,n,td; |
int *w; |
int *w; |
|
|
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
w = (int *)ALLOCA(n*sizeof(int)); |
w = (int *)ALLOCA(n*sizeof(int)); |
for ( i = 0, td = 0; i < n; i++ ) { |
for ( i = 0, td = 0; i < n; i++ ) { |
w[i] = MAX(d1->d[i],d2->d[i]); td += w[i]; |
w[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(w[i],i); |
} |
} |
_NEWDL(d,n); d->td = td - d1->td; |
_NEWDL(d,n); d->td = td - d1->td; |
for ( i = 0; i < n; i++ ) |
for ( i = 0; i < n; i++ ) |
|
|
_addmd_destructive(mod,t,u,rp); |
_addmd_destructive(mod,t,u,rp); |
} |
} |
|
|
void _dp_sp_mod(p1,p2,mod,rp) |
void _dp_sp_mod(DP p1,DP p2,int mod,DP *rp) |
DP p1,p2; |
|
int mod; |
|
DP *rp; |
|
{ |
{ |
int i,n,td; |
int i,n,td; |
int *w; |
int *w; |
|
|
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
w = (int *)ALLOCA(n*sizeof(int)); |
w = (int *)ALLOCA(n*sizeof(int)); |
for ( i = 0, td = 0; i < n; i++ ) { |
for ( i = 0, td = 0; i < n; i++ ) { |
w[i] = MAX(d1->d[i],d2->d[i]); td += w[i]; |
w[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(w[i],i); |
} |
} |
NEWDL(d,n); d->td = td - d1->td; |
NEWDL(d,n); d->td = td - d1->td; |
for ( i = 0; i < n; i++ ) |
for ( i = 0; i < n; i++ ) |
|
|
* |
* |
*/ |
*/ |
|
|
void dp_red(p0,p1,p2,head,rest,dnp,multp) |
void dp_red(DP p0,DP p1,DP p2,DP *head,DP *rest,P *dnp,DP *multp) |
DP p0,p1,p2; |
|
DP *head,*rest; |
|
P *dnp; |
|
DP *multp; |
|
{ |
{ |
int i,n; |
int i,n; |
DL d1,d2,d; |
DL d1,d2,d; |
|
|
Q c,c1,c2; |
Q c,c1,c2; |
N gn,tn; |
N gn,tn; |
P g,a; |
P g,a; |
|
P p[2]; |
|
|
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
NEWDL(d,n); d->td = d1->td - d2->td; |
NEWDL(d,n); d->td = d1->td - d2->td; |
for ( i = 0; i < n; i++ ) |
for ( i = 0; i < n; i++ ) |
d->d[i] = d1->d[i]-d2->d[i]; |
d->d[i] = d1->d[i]-d2->d[i]; |
c1 = (Q)BDY(p1)->c; c2 = (Q)BDY(p2)->c; |
c1 = (Q)BDY(p1)->c; c2 = (Q)BDY(p2)->c; |
if ( dp_fcoeffs ) { |
if ( dp_fcoeffs == N_GFS ) { |
|
p[0] = (P)c1; p[1] = (P)c2; |
|
gcdsf(CO,p,2,&g); |
|
divsp(CO,(P)c1,g,&a); c1 = (Q)a; divsp(CO,(P)c2,g,&a); c2 = (Q)a; |
|
} else if ( dp_fcoeffs ) { |
/* do nothing */ |
/* do nothing */ |
} else if ( INT(c1) && INT(c2) ) { |
} else if ( INT(c1) && INT(c2) ) { |
gcdn(NM(c1),NM(c2),&gn); |
gcdn(NM(c1),NM(c2),&gn); |
|
|
|
|
/* m-reduction over a field */ |
/* m-reduction over a field */ |
|
|
void dp_red_f(p1,p2,rest) |
void dp_red_f(DP p1,DP p2,DP *rest) |
DP p1,p2; |
|
DP *rest; |
|
{ |
{ |
int i,n; |
int i,n; |
DL d1,d2,d; |
DL d1,d2,d; |
MP m; |
MP m; |
DP t,s,r,h; |
DP t,s; |
Obj a,b; |
Obj a,b; |
|
|
n = p1->nv; |
n = p1->nv; |
|
|
muld(CO,s,p2,&t); addd(CO,p1,t,rest); |
muld(CO,s,p2,&t); addd(CO,p1,t,rest); |
} |
} |
|
|
void dp_red_mod(p0,p1,p2,mod,head,rest,dnp) |
void dp_red_mod(DP p0,DP p1,DP p2,int mod,DP *head,DP *rest,P *dnp) |
DP p0,p1,p2; |
|
int mod; |
|
DP *head,*rest; |
|
P *dnp; |
|
{ |
{ |
int i,n; |
int i,n; |
DL d1,d2,d; |
DL d1,d2,d; |
|
|
|
|
struct oEGT eg_red_mod; |
struct oEGT eg_red_mod; |
|
|
void _dp_red_mod_destructive(p1,p2,mod,rp) |
void _dp_red_mod_destructive(DP p1,DP p2,int mod,DP *rp) |
DP p1,p2; |
|
int mod; |
|
DP *rp; |
|
{ |
{ |
int i,n; |
int i,n; |
DL d1,d2,d; |
DL d1,d2,d; |
MP m; |
MP m; |
DP t,s; |
DP t,s; |
int c,c1,c2; |
int c,c1,c2; |
struct oEGT t0,t1; |
|
extern int do_weyl; |
extern int do_weyl; |
|
|
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
|
|
_mulmd_dup(mod,s,p2,&t); _free_dp(s); |
_mulmd_dup(mod,s,p2,&t); _free_dp(s); |
#else |
#else |
if ( do_weyl ) { |
if ( do_weyl ) { |
_weyl_mulmdm_dup(mod,p2,m,&t); _FREEMP(m); |
_MKDP(n,m,s); s->sugar = d->td; |
|
_mulmd_dup(mod,s,p2,&t); _free_dp(s); |
} else { |
} else { |
_mulmdm_dup(mod,p2,m,&t); _FREEMP(m); |
_mulmdm_dup(mod,p2,m,&t); _FREEMP(m); |
} |
} |
|
|
* |
* |
*/ |
*/ |
|
|
void dp_true_nf(b,g,ps,full,rp,dnp) |
void dp_true_nf(NODE b,DP g,DP *ps,int full,DP *rp,P *dnp) |
NODE b; |
|
DP g; |
|
DP *ps; |
|
int full; |
|
DP *rp; |
|
P *dnp; |
|
{ |
{ |
DP u,p,d,s,t,dmy; |
DP u,p,d,s,t,dmy; |
NODE l; |
NODE l; |
|
|
|
|
/* nf computation over Z */ |
/* nf computation over Z */ |
|
|
void dp_nf_z(b,g,ps,full,multiple,rp) |
void dp_nf_z(NODE b,DP g,DP *ps,int full,int multiple,DP *rp) |
NODE b; |
|
DP g; |
|
DP *ps; |
|
int full,multiple; |
|
DP *rp; |
|
{ |
{ |
DP u,p,d,s,t,dmy1; |
DP u,p,d,s,t,dmy1; |
P dmy; |
P dmy; |
|
|
|
|
/* nf computation over a field */ |
/* nf computation over a field */ |
|
|
void dp_nf_f(b,g,ps,full,rp) |
void dp_nf_f(NODE b,DP g,DP *ps,int full,DP *rp) |
NODE b; |
|
DP g; |
|
DP *ps; |
|
int full; |
|
DP *rp; |
|
{ |
{ |
DP u,p,d,s,t; |
DP u,p,d,s,t; |
P dmy; |
|
NODE l; |
NODE l; |
MP m,mr; |
MP m,mr; |
int i,n; |
int i,n; |
|
|
|
|
/* nf computation over GF(mod) (only for internal use) */ |
/* nf computation over GF(mod) (only for internal use) */ |
|
|
void dp_nf_mod(b,g,ps,mod,full,rp) |
void dp_nf_mod(NODE b,DP g,DP *ps,int mod,int full,DP *rp) |
NODE b; |
|
DP g; |
|
DP *ps; |
|
int mod,full; |
|
DP *rp; |
|
{ |
{ |
DP u,p,d,s,t; |
DP u,p,d,s,t; |
P dmy; |
P dmy; |
|
|
*rp = d; |
*rp = d; |
} |
} |
|
|
void dp_true_nf_mod(b,g,ps,mod,full,rp,dnp) |
void dp_true_nf_mod(NODE b,DP g,DP *ps,int mod,int full,DP *rp,P *dnp) |
NODE b; |
|
DP g; |
|
DP *ps; |
|
int mod,full; |
|
DP *rp; |
|
P *dnp; |
|
{ |
{ |
DP u,p,d,s,t; |
DP u,p,d,s,t; |
NODE l; |
NODE l; |
|
|
*rp = d; *dnp = dn; |
*rp = d; *dnp = dn; |
} |
} |
|
|
void _dp_nf_mod_destructive(b,g,ps,mod,full,rp) |
void _dp_nf_mod_destructive(NODE b,DP g,DP *ps,int mod,int full,DP *rp) |
NODE b; |
|
DP g; |
|
DP *ps; |
|
int mod,full; |
|
DP *rp; |
|
{ |
{ |
DP u,p,d,s,t; |
DP u,p,d; |
NODE l; |
NODE l; |
MP m,mr,mrd; |
MP m,mrd; |
int sugar,psugar,n,h_reducible,i; |
int sugar,psugar,n,h_reducible; |
|
|
if ( !g ) { |
if ( !g ) { |
*rp = 0; return; |
*rp = 0; return; |
|
|
|
|
/* reduction by linear base over a field */ |
/* reduction by linear base over a field */ |
|
|
void dp_lnf_f(p1,p2,g,r1p,r2p) |
void dp_lnf_f(DP p1,DP p2,NODE g,DP *r1p,DP *r2p) |
DP p1,p2; |
|
NODE g; |
|
DP *r1p,*r2p; |
|
{ |
{ |
DP r1,r2,b1,b2,t,s; |
DP r1,r2,b1,b2,t,s; |
Obj c,c1,c2; |
Obj c,c1,c2; |
|
|
|
|
/* reduction by linear base over GF(mod) */ |
/* reduction by linear base over GF(mod) */ |
|
|
void dp_lnf_mod(p1,p2,g,mod,r1p,r2p) |
void dp_lnf_mod(DP p1,DP p2,NODE g,int mod,DP *r1p,DP *r2p) |
DP p1,p2; |
|
NODE g; |
|
int mod; |
|
DP *r1p,*r2p; |
|
{ |
{ |
DP r1,r2,b1,b2,t,s; |
DP r1,r2,b1,b2,t,s; |
P c; |
P c; |
|
|
*r1p = r1; *r2p = r2; |
*r1p = r1; *r2p = r2; |
} |
} |
|
|
void dp_nf_tab_mod(p,tab,mod,rp) |
void dp_nf_tab_mod(DP p,LIST *tab,int mod,DP *rp) |
DP p; |
|
LIST *tab; |
|
int mod; |
|
DP *rp; |
|
{ |
{ |
DP s,t,u; |
DP s,t,u; |
MP m; |
MP m; |
|
|
*rp = s; |
*rp = s; |
} |
} |
|
|
|
void dp_nf_tab_f(DP p,LIST *tab,DP *rp) |
|
{ |
|
DP s,t,u; |
|
MP m; |
|
DL h; |
|
int i,n; |
|
|
|
if ( !p ) { |
|
*rp = p; return; |
|
} |
|
n = p->nv; |
|
for ( s = 0, i = 0, m = BDY(p); m; m = NEXT(m) ) { |
|
h = m->dl; |
|
while ( !dl_equal(n,h,BDY((DP)BDY(BDY(tab[i])))->dl ) ) |
|
i++; |
|
muldc(CO,(DP)BDY(NEXT(BDY(tab[i]))),m->c,&t); |
|
addd(CO,s,t,&u); s = u; |
|
} |
|
*rp = s; |
|
} |
|
|
/* |
/* |
* setting flags |
* setting flags |
* |
* |
*/ |
*/ |
|
|
int create_order_spec(obj,spec) |
int create_order_spec(Obj obj,struct order_spec *spec) |
Obj obj; |
|
struct order_spec *spec; |
|
{ |
{ |
int i,j,n,s,row,col; |
int i,j,n,s,row,col; |
struct order_pair *l; |
struct order_pair *l; |
Line 1371 struct order_spec *spec; |
|
Line 1359 struct order_spec *spec; |
|
* |
* |
*/ |
*/ |
|
|
void dp_homo(p,rp) |
void dp_homo(DP p,DP *rp) |
DP p; |
|
DP *rp; |
|
{ |
{ |
MP m,mr,mr0; |
MP m,mr,mr0; |
int i,n,nv,td; |
int i,n,nv,td; |
|
|
} |
} |
} |
} |
|
|
void dp_dehomo(p,rp) |
void dp_dehomo(DP p,DP *rp) |
DP p; |
|
DP *rp; |
|
{ |
{ |
MP m,mr,mr0; |
MP m,mr,mr0; |
int i,n,nv; |
int i,n,nv; |
|
|
} |
} |
} |
} |
|
|
void dp_mod(p,mod,subst,rp) |
void dp_mod(DP p,int mod,NODE subst,DP *rp) |
DP p; |
|
int mod; |
|
NODE subst; |
|
DP *rp; |
|
{ |
{ |
MP m,mr,mr0; |
MP m,mr,mr0; |
P t,s,s1; |
P t,s,s1; |
|
|
} |
} |
} |
} |
|
|
void dp_rat(p,rp) |
void dp_rat(DP p,DP *rp) |
DP p; |
|
DP *rp; |
|
{ |
{ |
MP m,mr,mr0; |
MP m,mr,mr0; |
|
|
|
|
} |
} |
|
|
|
|
void homogenize_order(old,n,new) |
void homogenize_order(struct order_spec *old,int n,struct order_spec *new) |
struct order_spec *old,*new; |
|
int n; |
|
{ |
{ |
struct order_pair *l; |
struct order_pair *l; |
int length,nv,row,i,j; |
int length,nv,row,i,j; |
|
|
} |
} |
} |
} |
|
|
void qltozl(w,n,dvr) |
void qltozl(Q *w,int n,Q *dvr) |
Q *w,*dvr; |
|
int n; |
|
{ |
{ |
N nm,dn; |
N nm,dn; |
N g,l1,l2,l3; |
N g,l1,l2,l3; |
|
|
*dvr = d; |
*dvr = d; |
} |
} |
|
|
int comp_nm(a,b) |
int comp_nm(Q *a,Q *b) |
Q *a,*b; |
|
{ |
{ |
return cmpn((*a)?NM(*a):0,(*b)?NM(*b):0); |
return cmpn((*a)?NM(*a):0,(*b)?NM(*b):0); |
} |
} |
|
|
void sortbynm(w,n) |
void sortbynm(Q *w,int n) |
Q *w; |
|
int n; |
|
{ |
{ |
qsort(w,n,sizeof(Q),(int (*)(const void *,const void *))comp_nm); |
qsort(w,n,sizeof(Q),(int (*)(const void *,const void *))comp_nm); |
} |
} |
|
|
* |
* |
*/ |
*/ |
|
|
int dp_redble(p1,p2) |
int dp_redble(DP p1,DP p2) |
DP p1,p2; |
|
{ |
{ |
int i,n; |
int i,n; |
DL d1,d2; |
DL d1,d2; |
|
|
} |
} |
} |
} |
|
|
void dp_subd(p1,p2,rp) |
void dp_subd(DP p1,DP p2,DP *rp) |
DP p1,p2; |
|
DP *rp; |
|
{ |
{ |
int i,n; |
int i,n; |
DL d1,d2,d; |
DL d1,d2,d; |
|
|
*rp = s; |
*rp = s; |
} |
} |
|
|
void dltod(d,n,rp) |
void dltod(DL d,int n,DP *rp) |
DL d; |
|
int n; |
|
DP *rp; |
|
{ |
{ |
MP m; |
MP m; |
DP s; |
DP s; |
|
|
*rp = s; |
*rp = s; |
} |
} |
|
|
void dp_hm(p,rp) |
void dp_hm(DP p,DP *rp) |
DP p; |
|
DP *rp; |
|
{ |
{ |
MP m,mr; |
MP m,mr; |
|
|
|
|
} |
} |
} |
} |
|
|
void dp_rest(p,rp) |
void dp_rest(DP p,DP *rp) |
DP p,*rp; |
|
{ |
{ |
MP m; |
MP m; |
|
|
|
|
} |
} |
} |
} |
|
|
DL lcm_of_DL(nv,dl1,dl2,dl) |
DL lcm_of_DL(int nv,DL dl1,DL dl2,DL dl) |
int nv; |
|
DL dl1,dl2; |
|
register DL dl; |
|
{ |
{ |
register int n, *d1, *d2, *d, td; |
register int i, *d1, *d2, *d, td; |
|
|
if ( !dl ) NEWDL(dl,nv); |
if ( !dl ) NEWDL(dl,nv); |
d = dl->d, d1 = dl1->d, d2 = dl2->d; |
d = dl->d, d1 = dl1->d, d2 = dl2->d; |
for ( td = 0, n = nv; --n >= 0; d1++, d2++, d++ ) |
for ( td = 0, i = 0; i < nv; d1++, d2++, d++, i++ ) { |
td += (*d = *d1 > *d2 ? *d1 : *d2 ); |
*d = *d1 > *d2 ? *d1 : *d2; |
|
td += MUL_WEIGHT(*d,i); |
|
} |
dl->td = td; |
dl->td = td; |
return dl; |
return dl; |
} |
} |
|
|
int dl_equal(nv,dl1,dl2) |
int dl_equal(int nv,DL dl1,DL dl2) |
int nv; |
|
DL dl1, dl2; |
|
{ |
{ |
register int *d1, *d2, n; |
register int *d1, *d2, n; |
|
|
|
|
return 1; |
return 1; |
} |
} |
|
|
int dp_nt(p) |
int dp_nt(DP p) |
DP p; |
|
{ |
{ |
int i; |
int i; |
MP m; |
MP m; |
|
|
} |
} |
} |
} |
|
|
int dp_homogeneous(p) |
int dp_homogeneous(DP p) |
DP p; |
|
{ |
{ |
MP m; |
MP m; |
int d; |
int d; |
|
|
} |
} |
} |
} |
|
|
_print_mp(nv,m) |
void _print_mp(int nv,MP m) |
int nv; |
|
MP m; |
|
{ |
{ |
int i; |
int i; |
|
|