OpenXM_contrib2/asir2000/builtin/gf.c - diff

Return to gf.c CVS log

Up to [local] / OpenXM_contrib2 / asir2000 / builtin

Diff for /OpenXM_contrib2/asir2000/builtin/gf.c between version 1.9 and 1.15

version 1.9, 2001/06/28 08:57:20

version 1.15, 2002/03/15 02:52:09

Line 45

* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,

* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.

* $OpenXM: OpenXM_contrib2/asir2000/builtin/gf.c,v 1.8 2001/06/25 10:01:27 noro Exp $

* $OpenXM: OpenXM_contrib2/asir2000/builtin/gf.c,v 1.14 2001/10/09 01:36:06 noro Exp $

#include "ca.h"

#include "parse.h"

Line 56 struct resf_dlist {

int resf_degtest(int,int *,int,struct resf_dlist *);

void uhensel(P,NODE,int,int,NODE *);

void uhensel_incremental(P,NODE,int,int,int,NODE *);

void resf_hensel(int,P,int,P *,ML *);

void resf_dtest(P,ML,int,int *,int *,DCP *);

void resf_dtest_special(P,ML,int,int *,int *,DCP *);

Line 67 void nullspace_lm(LM **,int,int *);

Line 68 void nullspace_lm(LM **,int,int *);

void nullspace_gf2n(GF2N **,int,int *);

void nullspace_gfpn(GFPN **,int,int *);

void nullspace_gfs(GFS **,int,int *);

void nullspace_gfsn(GFSN **,int,int *);

void null_to_sol(int **,int *,int,int,UM *);

void showgfmat(UM **,int);

Line 74 void pwr_mod(P,P,V,P,int,N,P *);

Line 76 void pwr_mod(P,P,V,P,int,N,P *);

void rem_mod(P,P,V,P,int,P *);

void Pnullspace(),Pgcda_mod(),Pftest(),Presfmain(),Ppwr_mod(),Puhensel();

void Puhensel_incremental();

void Psfuhensel();

void Pnullspace_ff();

Line 97 struct ftab gf_tab[] = {

Line 100 struct ftab gf_tab[] = {

{"resfmain",Presfmain,4},

{"pwr_mod",Ppwr_mod,6},

{"uhensel",Puhensel,4},

{"uhensel_incremental",Puhensel_incremental,5},

{"sfuhensel",Psfuhensel,4},

{0,0,0},

};

Line 150 LIST *rp;

Line 154 LIST *rp;

MKLIST(*rp,r);

}

void Puhensel_incremental(arg,rp)

NODE arg;

LIST *rp;

{

P f;

NODE mfl,r;

int mod,bound,start;

f = (P)ARG0(arg);

mfl = BDY((LIST)ARG1(arg));

mod = QTOS((Q)ARG2(arg));

start = QTOS((Q)ARG3(arg));

bound = QTOS((Q)ARG4(arg));

uhensel_incremental(f,mfl,mod,start,bound,&r);

MKLIST(*rp,r);

}

void uhensel(f,mfl,mod,bound,rp)

P f;

NODE mfl;

Line 182 NODE *rp;

Line 203 NODE *rp;

*rp = top;

}

void uhensel_incremental(f,mfl,mod,start,bound,rp)

P f;

NODE mfl;

int mod,start,bound;

NODE *rp;

{

ML blist,clist,rlist;

LUM fl;

LUM *lblist;

int nf,i,j,k;

int **p;

P s;

V v;

NODE t,top;

nf = length(mfl);

blist = MLALLOC(nf); blist->n = nf; blist->mod = mod;

lblist = (LUM *)MALLOC(nf*sizeof(LUM));

for ( i = 0, t = mfl; i < nf; i++, t = NEXT(t) ) {

blist->c[i] = (pointer)UMALLOC(UDEG((P)BDY(t)));

ptoum(mod,(P)BDY(t),blist->c[i]);

W_LUMALLOC((int)UDEG((P)BDY(t)),bound,lblist[i]);

ptolum(mod,start,(P)BDY(t),lblist[i]);

p = lblist[i]->c;

for ( j = DEG(lblist[i]); j >= 0; j-- )

for ( k = start; k < bound; k++ )

p[j][k] = 0;

}

gcdgen(f,blist,&clist);

clist->bound = bound;

W_LUMALLOC((int)UDEG(f),bound,fl);

ptolum(mod,bound,f,fl);

henmain_incremental(fl,lblist,clist,nf,mod,start,bound);

v = VR(f);

for ( i = nf-1, top = 0; i >= 0; i-- ) {

lumtop_unsigned(v,mod,bound,lblist[i],&s);

MKNODE(t,s,top); top = t;

}

*rp = top;

}

void Psfuhensel(arg,rp)

NODE arg;

LIST *rp;

Line 209 NODE *rp;

Line 271 NODE *rp;

BM fl;

BM *r;

VL vl,nvl;

int i,fn,dx,dy;

int i,fn,dx,dy,d;

NODE t,top;

UM fm,hm,q;

UM *gm;

Line 229 NODE *rp;

Line 291 NODE *rp;

x = VR((P)BDY(mfl));

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

for ( i = 0, t = mfl; i < fn; i++, t = NEXT(t) ) {

for ( i = 0, t = mfl, d = 0; i < fn; i++, t = NEXT(t) ) {

gm[i] = (pointer)UMALLOC(getdeg(x,(P)BDY(t)));

ptosfum((P)BDY(t),gm[i]);

d += DEG(gm[i]);

}

/* reorder f if necessary */

Line 240 NODE *rp;

Line 303 NODE *rp;

vl = nvl; f = g;

}

dx = getdeg(x,f);

if ( dx != d )

error("sfuhensel : product of factors has incompatible degree");

dy = getdeg(y,f);

if ( bound < dy+1 ) bound = dy+1;

dy = MAX(dy,bound);

fl = BMALLOC(dx,bound);

fl = BMALLOC(dx,dy);

ptosfbm(bound,f,fl);

ptosfbm(dy,f,fl);

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

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

/* fm = fl mod y */

fm = W_UMALLOC(dx);

Line 265 NODE *rp;

Line 331 NODE *rp;

r[i] = fl;

for ( i = fn-1, top = 0; i >= 0; i-- ) {

sfbmtop(bound,r[i],x,y,&s);

sfbmtop(r[i],x,y,&s);

reorderp(CO,vl,s,&u);

MKNODE(t,u,top); top = t;

}

Line 879 NODE arg;

Line 945 NODE arg;

LIST *rp;

{

int i,j,n;

Q mod;

MAT mat,r;

VECT u;

Q q;

Line 905 LIST *rp;

Line 970 LIST *rp;

nullspace_gfpn((GFPN **)w,n,ind); break;

case FF_GFS:

nullspace_gfs((GFS **)w,n,ind); break;

case FF_GFSN:

nullspace_gfsn((GFSN **)w,n,ind); break;

default:

error("nullspace_ff : current_ff is not set");

}

Line 1081 int *ind;

Line 1148 int *ind;

chsgngfs(u[j],&h);

for ( s = j; s < n; s++ ) {

mulgfs(h,t[s],&w); addgfs(w,u[s],&w1); u[s] = w1;

}

void nullspace_gfsn(mat,n,ind)

GFSN **mat;

int n;

int *ind;

{

int i,j,l,s;

GFSN w,w1,h,inv;

GFSN *t,*u;

bzero(ind,n*sizeof(int));

ind[0] = 0;

for ( i = j = 0; j < n; i++, j++ ) {

for ( ; j < n; j++ ) {

for ( l = i; l < n; l++ )

if ( mat[l][j] )

break;

if ( l < n ) {

t = mat[i]; mat[i] = mat[l]; mat[l] = t; break;

} else

ind[j] = 1;

}

if ( j == n )

break;

invgfsn(mat[i][j],&inv);

for ( s = j, t = mat[i]; s < n; s++ ) {

mulgfsn(t[s],inv,&w); t[s] = w;

}

for ( l = 0; l < n; l++ ) {

if ( l == i )

continue;

u = mat[l];

chsgngfsn(u[j],&h);

for ( s = j; s < n; s++ ) {

mulgfsn(h,t[s],&w); addgfsn(w,u[s],&w1); u[s] = w1;

}

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