OpenXM_contrib2/asir2000/engine/Hgfs.c - diff

Return to Hgfs.c CVS log

Up to [local] / OpenXM_contrib2 / asir2000 / engine

Diff for /OpenXM_contrib2/asir2000/engine/Hgfs.c between version 1.17 and 1.20

version 1.17, 2001/09/03 07:01:06

version 1.20, 2001/10/30 10:24:35

Line 1

/* $OpenXM: OpenXM_contrib2/asir2000/engine/Hgfs.c,v 1.16 2001/09/03 01:04:26 noro Exp $ */

/* $OpenXM: OpenXM_contrib2/asir2000/engine/Hgfs.c,v 1.19 2001/10/30 07:25:58 noro Exp $ */

#include "ca.h"

struct p_pair {

void lnfsf(int n,UM p0,UM p1,struct p_pair *list,UM np0,UM np1);

UM p0;

void extractcoefbm(BM f,int dx,UM r);

UM p1;

struct p_pair *next;

};

void canzassf(UM,int,UM *);

int comp_dum(DUM a,DUM b)

void lnfsf(int,UM,UM,struct p_pair *,UM,UM);

void minipolysf(UM,UM,UM);

void czsfum(UM,UM *);

void gensqfrsfum(UM,DUM);

void sfbmtop(BM,V,V,P *);

void cont_pp_sfp(VL,P,P *,P *);

void sfcsump(VL,P,P *);

void mulsfbmarray(int,BM,ML,int,int *,V,V,P *);

void const_term(P,UM);

void sfbsqfr(P,V,V,DCP *);

void sfusqfr(P,DCP *);

int comp_dum(a,b)

DUM a,b;

{

if ( DEG(a->f) > DEG(b->f) )

return -1;

Line 33 DUM a,b;

Line 15 DUM a,b;

return 0;

}

void fctrsf(p,dcp)

void fctrsf(P p,DCP *dcp)

P p;

DCP *dcp;

{

int n,i,j,k;

DCP dc,dc0;

P lc;

P zp;

UM mp;

UM *tl;

Obj obj;

struct oDUM *udc,*udc1;

simp_ff(p,&zp); p = zp;

simp_ff((Obj)p,&obj); p = (P)obj;

if ( !p ) {

*dcp = 0; return;

}

Line 92 DCP *dcp;

Line 72 DCP *dcp;

NEXT(dc) = 0; *dcp = dc0;

}

void gensqfrsfum(p,dc)

void gensqfrsfum(UM p,struct oDUM *dc)

UM p;

struct oDUM *dc;

{

int n,i,j,d,mod;

UM t,s,g,f,f1,b;

Line 147 struct oDUM *dc;

Line 125 struct oDUM *dc;

}

void randsfum(d,p)

void randsfum(int d,UM p)

int d;

UM p;

{

int i;

Line 159 UM p;

Line 135 UM p;

p->d = i;

}

void pwrmodsfum(p,e,f,pr)

void pwrmodsfum(UM p,int e,UM f,UM pr)

int e;

UM p,f,pr;

{

UM wt,ws,q;

Line 189 UM p,f,pr;

Line 163 UM p,f,pr;

}

void spwrsfum(m,f,e,r)

void spwrsfum(UM m,UM f,N e,UM r)

UM f,m,r;

N e;

{

UM t,s,q;

N e1;

Line 213 N e;

Line 185 N e;

}

void tracemodsfum(m,f,e,r)

void tracemodsfum(UM m,UM f,int e,UM r)

UM f,m,r;

int e;

{

UM t,s,q,u;

int i;

Line 235 int e;

Line 205 int e;

cpyum(s,r);

}

void make_qmatsf(p,tab,mp)

void make_qmatsf(UM p,UM *tab,int ***mp)

UM p;

UM *tab;

int ***mp;

{

int n,i,j;

int *c;

Line 259 int ***mp;

Line 226 int ***mp;

mat[i][i] = _subsf(mat[i][i],one);

}

void nullsf(mat,n,ind)

void nullsf(int **mat,int n,int *ind)

int **mat;

int *ind;

int n;

{

int i,j,l,s,h,inv;

int *t,*u;

Line 294 int n;

Line 258 int n;

}

void null_to_solsf(mat,ind,n,r)

void null_to_solsf(int **mat,int *ind,int n,UM *r)

int **mat;

int *ind;

int n;

UM *r;

{

int i,j,k,l;

int *c;

Line 327 nullsf(mat,n,ind)

Line 287 nullsf(mat,n,ind)

null_to_solsf(ind,n,r)

void czsfum(f,r)

void czsfum(UM f,UM *r)

UM f,*r;

{

int i,j;

int d,n,ord;

Line 382 UM f,*r;

Line 341 UM f,*r;

r[j] = 0;

}

int berlekampsf(p,df,tab,r)

int berlekampsf(UM p,int df,UM *tab,UM *r)

UM p;

int df;

UM *tab,*r;

{

int n,i,j,k,nf,d,nr;

int **mat;

Line 431 UM *tab,*r;

Line 387 UM *tab,*r;

}

/* NOT REACHED */

error("berlekampsf : cannot happen");

return 0;

}

void minipolysf(f,p,mp)

void minipolysf(UM f,UM p,UM mp)

UM f,p,mp;

{

struct p_pair *list,*l,*l1,*lprev;

int n,d;

Line 469 UM f,p,mp;

Line 427 UM f,p,mp;

}

void lnfsf(n,p0,p1,list,np0,np1)

void lnfsf(int n,UM p0,UM p1,struct p_pair *list,UM np0,UM np1)

int n;

UM p0,p1;

struct p_pair *list;

UM np0,np1;

{

int inv,h,d1;

int h,d1;

UM t0,t1,s0,s1;

struct p_pair *l;

Line 492 UM np0,np1;

Line 446 UM np0,np1;

}

int find_rootsf(p,root)

int find_rootsf(UM p,int *root)

UM p;

int *root;

{

UM *r;

int i,j,n;

int i,n;

n = DEG(p);

r = ALLOCA((DEG(p))*sizeof(UM));

Line 507 int *root;

Line 459 int *root;

return n;

}

void canzassf(f,d,r)

void canzassf(UM f,int d,UM *r)

UM f,*r;

int d;

{

UM t,s,u,w,g,o;

N n1,n2,n3,n4,n5;

UM *b;

int n,m,i,q,ed;

int n,q,ed;

if ( DEG(f) == d ) {

r[0] = UMALLOC(d); cpyum(f,r[0]);

Line 560 void ptosfbm(int,P,BM);

Line 510 void ptosfbm(int,P,BM);

/* f = f(x,y) */

void sfhensel(count,f,x,evp,sfp,listp)

void sfhensel(int count,P f,V x,GFS *evp,P *sfp,ML *listp)

int count;

P f;

V x;

GFS *evp;

P *sfp;

ML *listp;

{

int i,j;

int i;

int fn,n;

int fn;

ML rlist;

BM fl;

VL vl,nvl;

V y;

int dx,dy,mev;

int dx,dy,bound;

GFS ev;

P f1,t,yev,c,sf;

P f1,t,c,sf;

DCP dc;

UM w,w1,q,fm,hm;

UM q,fm,hm;

UM *gm;

struct oEGT tmp0,tmp1,eg_hensel,eg_hensel_t;

Line 611 ML *listp;

Line 555 ML *listp;

ptosfum(dc->c,gm[i]);

}

/* set bound */

/* g | f, lc_y(g) = lc_y(f) => deg_y(g) <= deg_y(f) */

/* so, bound = dy is sufficient, but we use slightly large value */

bound = dy+2;

/* f(x,y) -> f(x,y+ev) */

fl = BMALLOC(dx,dy);

fl = BMALLOC(dx,bound);

ptosfbm(dy,f,fl);

ptosfbm(bound,f,fl);

if ( ev ) shiftsfbm(fl,FTOIF(CONT(ev)));

/* sf = f(x+ev) */

Line 625 ML *listp;

Line 574 ML *listp;

hm = W_UMALLOC(dx);

q = W_UMALLOC(dx);

rlist = MLALLOC(fn); rlist->n = fn; rlist->bound = dy;

rlist = MLALLOC(fn); rlist->n = fn; rlist->bound = bound;

fprintf(asir_out,"%d candidates\n",fn);

init_eg(&eg_hensel);

for ( i = 0; i < fn-1; i++ ) {

Line 635 ML *listp;

Line 584 ML *listp;

get_eg(&tmp0);

/* fl = gm[i]*hm mod y */

divsfum(fm,gm[i],hm);

/* fl is replaced by the cofactor of gk mod y^dy */

/* fl is replaced by the cofactor of gk mod y^bound */

/* rlist->c[i] = gk */

sfhenmain2(fl,gm[i],hm,dy,(BM *)&rlist->c[i]);

sfhenmain2(fl,gm[i],hm,bound,(BM *)&rlist->c[i]);

cpyum(hm,fm);

get_eg(&tmp1); add_eg(&eg_hensel_t,&tmp0,&tmp1);

add_eg(&eg_hensel,&tmp0,&tmp1);

Line 662 ML *listp;

Line 611 ML *listp;

/* main variable of f = x */

int sfberle(vl,f,count,ev,dcp)

int sfberle(VL vl,P f,int count,GFS *ev,DCP *dcp)

VL vl;

P f;

int count;

GFS *ev;

DCP *dcp;

{

UM wf,wf1,wf2,wfs,gcd;

ML flist;

int fn,n;

int fn,fn1,n;

GFS m,fm;

DCP dc,dct,dc0;

VL nvl;

V x,y;

P g,lc,lc0,f0;

P lc,lc0,f0;

Obj obj;

int j,q1,index,i;

clctv(vl,f,&nvl); vl = nvl;

x = vl->v; y = vl->next->v;

simp_ff(f,&g); g = f;

simp_ff((Obj)f,&obj); f = (P)obj;

n = QTOS(DEG(DC(f)));

wf = W_UMALLOC(n); wf1 = W_UMALLOC(n); wf2 = W_UMALLOC(n);

wfs = W_UMALLOC(n); gcd = W_UMALLOC(n);

Line 716 DCP *dcp;

Line 660 DCP *dcp;

}

void sfgcdgen(f,blist,clistp)

void sfgcdgen(P f,ML blist,ML *clistp)

P f;

ML blist,*clistp;

{

int i;

int n,d,np;

Line 747 ML blist,*clistp;

Line 689 ML blist,*clistp;

/* f = g0*h0 mod y -> f = gk*hk mod y^(dy+1), f is replaced by hk */

void sfhenmain2(f,g0,h0,dy,gp)

void sfhenmain2(BM f,UM g0,UM h0,int dy,BM *gp)

BM f;

UM g0,h0;

int dy;

BM *gp;

{

int i,j,k,l;

int i,k;

int *px,*py;

int dx;

int **pp,**pp1;

UM wt,wa,wb,q,w1,w2,wh1,wg1,ws;

int dx,np,dr,tmp;

UM wt,wa,wb,wm,q,w1,w2,wh1,wg1,ws;

UM wc,wd,we,wz;

BM wb0,wb1;

int dg,dh;

Line 858 BM *gp;

Line 794 BM *gp;

/* fl->c[i] = coef_y(f,i) */

void ptosfbm(dy,f,fl)

void ptosfbm(int dy,P f,BM fl)

int dy;

P f;

BM fl;

{

DCP dc;

int d,i,dx;

Line 885 BM fl;

Line 818 BM fl;

/* x : main variable */

void sfbmtop(f,x,y,fp)

void sfbmtop(BM f,V x,V y,P *fp)

BM f;

V x,y;

P *fp;

{

UM *c;

int i,j,d,a,dy;

Line 926 P *fp;

Line 856 P *fp;

*fp = 0;

}

void sfsqfr(f,dcp)

void sfsqfr(P f,DCP *dcp)

P f;

DCP *dcp;

{

P g;

Obj obj;

V x;

DCP dc;

VL vl;

simp_ff(f,&g); f = g;

simp_ff((Obj)f,&obj); f = (P)obj;

clctv(CO,f,&vl);

if ( !vl ) {

/* f is a const */

Line 943 DCP *dcp;

Line 870 DCP *dcp;

} else if ( !NEXT(vl) )

sfusqfr(f,dcp);

else if ( !NEXT(NEXT(vl)) )

sfbsqfr(f,x,NEXT(vl)->v,dcp);

sfbsqfr(f,vl->v,NEXT(vl)->v,dcp);

else

error("sfsqfr : not implemented yet");

}

void sfusqfr(f,dcp)

void sfusqfr(P f,DCP *dcp)

P f;

DCP *dcp;

{

DCP dc,dct;

struct oDUM *udc;

Line 978 DCP *dcp;

Line 903 DCP *dcp;

*dcp = dct;

}

void sfbsqfr(f,x,y,dcp)

void sfbsqfr(P f,V x,V y,DCP *dcp)

P f;

V x,y;

DCP *dcp;

{

P t,rf,cx,cy;

VL vl,rvl;

Line 1005 DCP *dcp;

Line 927 DCP *dcp;

void sfdtest(P,ML,V,V,DCP *);

void sfbfctr(f,x,y,dcp)

void sfbfctr(P f,V x,V y,DCP *dcp)

P f;

V x,y;

DCP *dcp;

{

ML list;

P sf;

Line 1043 DCP *dcp;

Line 962 DCP *dcp;

/* f = f(x,y) = list->c[0]*list->c[1]*... mod y^(list->bound+1) */

void sfdtest(f,list,x,y,dcp)

void sfdtest(P f,ML list,V x,V y,DCP *dcp)

P f;

ML list;

V x,y;

DCP *dcp;

{

int np,dx,dy;

int i,j,k;

int i,j,k,bound;

int *win;

P g,lcg,factor,cofactor,lcyx;

P t,csum;

P csum;

DCP dcf,dcf0,dc;

BM *c;

BM lcy;

UM lcg0;

UM lcg0,lcy0,w;

UM *d1c;

ML wlist;

struct oVL vl1,vl0;

VL vl;

int z;

int z,dt,dtok;

/* vl = [x,y] */

vl0.v = x; vl0.next = &vl1; vl1.v = y; vl1.next = 0; vl = &vl0;

Line 1073 DCP *dcp;

Line 989 DCP *dcp;

win = W_ALLOC(np+1);

wlist = W_MLALLOC(np);

wlist->n = list->n;

wlist->bound = dy;

bound = wlist->bound = list->bound;

c = (BM *)COEF(wlist);

bcopy((char *)COEF(list),(char *)c,(int)(sizeof(BM)*np));

Line 1097 DCP *dcp;

Line 1013 DCP *dcp;

NEWP(lcyx); VR(lcyx) = x; DC(lcyx) = dc;

ptosfbm(dy,lcyx,lcy);

/* initialize lcy0 by LC(f) */

lcy0 = W_UMALLOC(bound);

ptosfum(COEF(DC(g)),lcy0);

/* ((d-1 coefs)*lcy0 */

d1c = (UM *)W_ALLOC(np*sizeof(UM));

w = W_UMALLOC(2*bound);

for ( i = 1; i < np; i++ ) {

extractcoefbm(c[i],degbm(c[i])-1,w);

d1c[i] = W_UMALLOC(2*bound);

mulsfum(w,lcy0,d1c[i]);

/* d1c[i] = d1c[i] mod y^(bound+1) */

if ( DEG(d1c[i]) > bound ) {

for ( j = DEG(d1c[i]); j > bound; j-- )

COEF(d1c[i])[j] = 0;

degum(d1c[i],bound);

}

fprintf(stderr,"np = %d\n",np);

dtok = 0;

for ( g = f, k = 1, dcf = dcf0 = 0, win[0] = 1, --np, z = 0; ; z++ ) {

if ( !(z % 1000) ) fprintf(stderr,".");

if ( sfdtestmain(vl,lcg,lcg0,lcy,csum,wlist,k,win,&factor,&cofactor) ) {

dt = sfdegtest(dy,bound,d1c,k,win);

if ( dt )

dtok++;

if ( dt && sfdtestmain(vl,lcg,lcg0,lcy,csum,wlist,

k,win,&factor,&cofactor) ) {

NEXTDC(dcf0,dcf); DEG(dcf) = ONE; COEF(dcf) = factor;

g = cofactor;

Line 1113 DCP *dcp;

Line 1053 DCP *dcp;

/* update csum */

sfcsump(vl,lcg,&csum);

/* update dy */

dy = getdeg(y,g);

/* update lcy */

clearbm(0,lcy);

COEF(dc) = COEF(DC(g));

Line 1134 DCP *dcp;

Line 1077 DCP *dcp;

else

for ( i = 1; i < k; i++ )

win[i] = win[0] + i;

/* update lcy0 */

ptosfum(COEF(DC(g)),lcy0);

/* update d-1 coeffs */

for ( i = 1; i <= np; i++ ) {

extractcoefbm(c[i],degbm(c[i])-1,w);

mulsfum(w,lcy0,d1c[i]);

/* d1c[i] = d1c[1] mod y^(bound+1) */

if ( DEG(d1c[i]) > bound ) {

for ( j = DEG(d1c[i]); j > bound; j-- )

COEF(d1c[i])[j] = 0;

degum(d1c[i],bound);

}

} else if ( !ncombi(1,np,k,win) )

if ( k == np )

break;

Line 1141 DCP *dcp;

Line 1100 DCP *dcp;

for ( i = 0, ++k; i < k; i++ )

win[i] = i + 1;

}

fprintf(stderr,"\n");

fprintf(stderr,"total %d, omitted by degtest %d\n",z,z-dtok);

NEXTDC(dcf0,dcf); COEF(dcf) = g;

DEG(dcf) = ONE; NEXT(dcf) = 0; *dcp = dcf0;

}

void extractcoefbm(BM f,int dx,UM r)

{

int j;

UM fj;

for ( j = DEG(f); j >= 0; j-- ) {

fj = COEF(f)[j];

if ( fj && DEG(fj) >= dx ) {

COEF(r)[j] = COEF(fj)[dx];

} else

COEF(r)[j] = 0;

}

degum(r,DEG(f));

}

/* deg_y(prod mod y^(bound+1)) <= dy ? */

int sfdegtest(int dy,int bound,UM *d1c,int k,int *in)

{

int i,j;

UM w,w1,wt;

BM t;

w = W_UMALLOC(bound);

w1 = W_UMALLOC(bound);

clearum(w,bound);

for ( i = 0; i < k; i++ ) {

addsfum(w,d1c[in[i]],w1); wt = w; w = w1; w1 = wt;

}

return DEG(w) <= dy ? 1 : 0;

}

/* lcy = LC(g), lcg = lcy*g, lcg0 = const part of lcg */

int sfdtestmain(vl,lcg,lcg0,lcy,csum,list,k,in,fp,cofp)

VL vl;

int sfdtestmain(VL vl,P lcg,UM lcg0,BM lcy,P csum,ML list,

P lcg;

int k,int *in,P *fp,P *cofp)

UM lcg0;

BM lcy;

P csum;

ML list;

int k;

int *in;

P *fp,*cofp;

{

P fmul,csumg,q,cont;

V x,y;

Line 1181 P *fp,*cofp;

Line 1165 P *fp,*cofp;

return 0;

}

void const_term(f,c)

void const_term(P f,UM c)

P f;

UM c;

{

DCP dc;

Line 1194 UM c;

Line 1176 UM c;

DEG(c) = -1;

}

void const_term_sfbm(f,c)

void const_term_sfbm(BM f,UM c)

BM f;

UM c;

{

int i,dy;

Line 1211 UM c;

Line 1191 UM c;

/* lcy*(product of const part) | lcg0 ? */

int sfctest(lcg0,lcy,list,k,in)

int sfctest(UM lcg0,BM lcy,ML list,int k,int *in)

UM lcg0;

BM lcy;

ML list;

int k;

int *in;

{

DCP dc;

int dy,i,dr;

UM t,s,u,w;

BM *l;

Line 1249 int *in;

Line 1223 int *in;

/* main var of f is x */

void mulsfbmarray(dx,lcy,list,k,in,x,y,g)

void mulsfbmarray(int dx,BM lcy,ML list,int k,int *in,V x,V y,P *g)

int dx;

BM lcy;

ML list;

int k;

int *in;

V x,y;

P *g;

{

int dy,i;

BM wb0,wb1,t,lcbm;

BM wb0,wb1,t;

BM *l;

dy = list->bound;

Line 1275 P *g;

Line 1242 P *g;

sfbmtop(wb0,x,y,g);

}

void sfcsump(vl,f,s)

void sfcsump(VL vl,P f,P *s)

VL vl;

P f;

P *s;

{

P t,u;

DCP dc;

Line 1291 P *s;

Line 1255 P *s;

/* *fp = primitive part of f w.r.t. x */

void cont_pp_sfp(vl,f,cp,fp)

void cont_pp_sfp(VL vl,P f,P *cp,P *fp)

VL vl;

P f;

P *cp,*fp;

{

V x,y;

int d;

Line 1325 P *cp,*fp;

Line 1286 P *cp,*fp;

}

int divtp_by_sfbm(vl,f,g,qp)

int divtp_by_sfbm(VL vl,P f,P g,P *qp)

VL vl;

P f,g;

P *qp;

{

V x,y;

int fx,fy,gx,gy;

Line 1369 P *qp;

Line 1327 P *qp;

if ( j >= 0 )

return 0;

sfbmtop(ql,x,y,qp);

return 1;

}

/* XXX generate an irreducible poly of degree n */

extern int current_gfs_q1;

void generate_defpoly_sfum(n,dp)

void generate_defpoly_sfum(int n,UM *dp)

int n;

UM *dp;

{

UM r,dr,t,g;

UM *f;

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>