OpenXM_contrib2/asir2000/builtin/gr.c - diff

Return to gr.c CVS log

Up to [local] / OpenXM_contrib2 / asir2000 / builtin

Diff for /OpenXM_contrib2/asir2000/builtin/gr.c between version 1.23 and 1.28

version 1.23, 2001/09/05 08:09:10

version 1.28, 2001/09/13 03:04:27

Line 45

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

* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.

* $OpenXM: OpenXM_contrib2/asir2000/builtin/gr.c,v 1.22 2001/09/05 01:57:32 noro Exp $

* $OpenXM: OpenXM_contrib2/asir2000/builtin/gr.c,v 1.27 2001/09/11 08:56:47 noro Exp $

#include "ca.h"

#include "parse.h"

#include "base.h"

#include "ox.h"

#if defined(__GNUC__)

#define INLINE inline

#elif defined(VISUAL)

#define INLINE __inline

#else

#define INLINE

#endif

#define ITOS(p) (((unsigned int)(p))&0x7fffffff)

#define STOI(i) ((P)((unsigned int)(i)|0x80000000))

Line 142 double get_rtime();

Line 150 double get_rtime();

void _dpmod_to_vect(DP,DL *,int *);

void dp_to_vect(DP,DL *,Q *);

NODE dp_dllist(DP f);

DLBUCKET dp_dllist_bucket(DP f);

NODE symb_merge(NODE,NODE,int),_symb_merge(NODE,NODE,int);

DLBUCKET symb_merge_bucket(DLBUCKET,DLBUCKET,int);

extern int dp_nelim;

extern int dp_fcoeffs;

static DP *ps,*psm;

Line 182 int doing_f4;

Line 192 int doing_f4;

NODE TraceList;

NODE AllTraceList;

int eqdl(nv,dl1,dl2)

INLINE int eqdl(nv,dl1,dl2)

int nv;

DL dl1,dl2;

{

Line 217 int *b;

Line 227 int *b;

}

/* create compressed poly */

void _dpmod_to_vect_compress(f,at,b)

DP f;

DL *at;

CDP *b;

{

int i,j,nv,len;

MP m;

CDP r;

nv = f->nv;

for ( m = BDY(f), len = 0; m; m = NEXT(m), len++ );

r = (CDP)MALLOC(sizeof(struct oCDP));

r->len = len;

r->body = (CM)MALLOC(sizeof(struct oCM)*len);

for ( m = BDY(f), i = j = 0; m; m = NEXT(m), j++ ) {

for ( ; !eqdl(nv,m->dl,at[i]); i++ );

r->body[j].index = i;

r->body[j].c = ITOS(m->c);

}

*b = r;

}

/* dense vector -> CDP */

void compress_vect(a,n,rp)

int *a;

int n;

CDP *rp;

{

int i,j,nz;

CDP r;

for ( i = 0, nz = 0; i < n; i++ )

if ( a[i] ) nz++;

*rp = r = (CDP)MALLOC(sizeof(struct oCDP));

r->len = nz;

r->body = (CM)MALLOC(sizeof(struct oCM)*nz);

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

if ( a[i] ) {

r->body[j].index = i;

r->body[j].c = ITOS(a[i]);

j++;

}

void dp_to_vect(f,at,b)

DP f;

DL *at;

Line 248 DP f;

Line 306 DP f;

return mp0;

}

void print_dlbucket(d,nv)

DLBUCKET d;

int nv;

{

int i;

NODE n;

for ( ; d; d = NEXT(d) ) {

fprintf(stderr,"td = %d\n",d->td);

for ( n = BDY(d); n; n = NEXT(n) ) {

fprintf(stderr,"<");

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

fprintf(stderr,"%d",((DL)BDY(n))->d[i]);

if ( i != nv-1 )

fprintf(stderr," ");

}

fprintf(stderr,">");

}

fprintf(stderr,"\n");

}

DLBUCKET dp_dllist_bucket(f)

DP f;

{

MP m;

NODE n,n0;

DLBUCKET d,d0;

int td;

if ( !f )

return 0;

d0 = 0;

m = BDY(f);

do {

NEXTDLBUCKET(d0,d);

n0 = 0;

d->td = td = m->dl->td;

do {

NEXTNODE(n0,n);

BDY(n) = (pointer)m->dl;

m = NEXT(m);

} while ( m && m->dl->td == td );

NEXT(n) = 0;

BDY(d) = n0;

} while ( m );

NEXT(d) = 0;

return d0;

}

void pdl(f)

NODE f;

{

Line 438 LIST f,v;

Line 546 LIST f,v;

struct order_spec *ord;

LIST *rp;

{

int i,mindex,m,nochk;

int i,mindex,m,nochk,homogen;

struct order_spec ord1;

VL fv,vv,vc;

NODE fd,fd0,fi,fi0,r,r0,t,subst,x,s,xx;

Line 450 LIST *rp;

Line 558 LIST *rp;

if ( ord->id && NVars != ord->nv )

error("dp_f4_main : invalid order specification");

initd(ord);

for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {

for ( fd0 = 0, t = BDY(f), homogen = 1; t; t = NEXT(t) ) {

NEXTNODE(fd0,fd); ptod(CO,vv,(P)BDY(t),(DP *)&BDY(fd));

if ( homogen )

homogen = dp_homogeneous(BDY(fd));

}

if ( fd0 ) NEXT(fd) = 0;

setup_arrays(fd0,0,&s);

x = gb_f4(s);

reduceall(x,&xx); x = xx;

if ( !homogen ) {

reduceall(x,&xx); x = xx;

}

for ( r0 = 0; x; x = NEXT(x) ) {

NEXTNODE(r0,r); dp_load((int)BDY(x),&ps[(int)BDY(x)]);

dtop(CO,vv,ps[(int)BDY(x)],(P *)&BDY(r));

Line 471 int m;

Line 583 int m;

struct order_spec *ord;

LIST *rp;

{

int i;

int i,homogen;

struct order_spec ord1;

VL fv,vv,vc;

DP b,c,c1;

Line 484 LIST *rp;

Line 596 LIST *rp;

if ( ord->id && NVars != ord->nv )

error("dp_f4_mod_main : invalid order specification");

initd(ord);

for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {

for ( fd0 = 0, t = BDY(f), homogen = 1; t; t = NEXT(t) ) {

ptod(CO,vv,(P)BDY(t),&b);

if ( homogen )

homogen = dp_homogeneous(b);

_dp_mod(b,m,0,&c);

_dp_monic(c,m,&c1);

if ( c ) {

Line 495 LIST *rp;

Line 609 LIST *rp;

if ( fd0 ) NEXT(fd) = 0;

setup_arrays(fd0,m,&s);

x = gb_f4_mod(s,m);

reduceall_mod(x,m,&xx); x = xx;

if ( !homogen ) {

reduceall_mod(x,m,&xx); x = xx;

}

for ( r0 = 0; x; x = NEXT(x) ) {

NEXTNODE(r0,r); _dtop_mod(CO,vv,ps[(int)BDY(x)],(P *)&BDY(r));

}

Line 630 int m;

Line 746 int m;

{

int i,j,k,nh,row,col,nv;

NODE r,g,gall;

NODE s,s0;

NODE sb;

DLBUCKET s,s0,s1;

DP_pairs d,dm,dr,t;

DP h,nf,f1,f2,f21,f21r,sp,sp1,sd,sdm,tdp;

MP mp,mp0;

NODE blist,bt,nt;

DL *ht,*at,*st;

int **spmat,**redmat;

int **spmat;

int *colstat,*w;

CDP *redmat;

int *colstat,*w,*w1;

int rank,nred,nsp,nonzero,spcol;

int *indred,*isred,*ri;

int *indred,*isred;

CDP ri;

struct oEGT tmp0,tmp1,tmp2,eg_split_symb,eg_split_elim1,eg_split_elim2;

extern struct oEGT eg_symb,eg_elim1,eg_elim2;

Line 663 int m;

Line 782 int m;

_dp_sp_mod(ps[t->dp1],ps[t->dp2],m,&sp);

if ( sp ) {

MKNODE(bt,sp,blist); blist = bt;

s0 = symb_merge(s0,dp_dllist(sp),nv);

s0 = symb_merge_bucket(s0,dp_dllist_bucket(sp),nv);

/* print_dlbucket(s0,nv); */

}

/* s0 : all the terms appeared in symbolic redunction */

/* s0 : all the terms appeared in symbolic reduction */

#if 0

for ( s = s0, nred = 0; s; s = NEXT(s) ) {

for ( r = gall; r; r = NEXT(r) )

sb = BDY(s);

if ( _dl_redble(BDY(ps[(int)BDY(r)])->dl,BDY(s),nv) )

for ( ; sb; sb = NEXT(sb) ) {

break;

for ( j = psn-1; j >= 0; j-- )

if ( r ) {

if ( _dl_redble(BDY(ps[j])->dl,BDY(sb),nv) )

dltod(BDY(s),nv,&tdp);

break;

dp_subd(tdp,ps[(int)BDY(r)],&sd);

if ( j >= 0 ) {

_dp_mod(sd,m,0,&sdm);

dltod(BDY(sb),nv,&tdp);

mulmd_dup(m,sdm,ps[(int)BDY(r)],&f2);

dp_subd(tdp,ps[j],&sd);

MKNODE(bt,f2,blist); blist = bt;

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

s = symb_merge(s,dp_dllist(f2),nv);

if ( BDY(sd)->dl->d[k] )

nred++;

i++;

fprintf(stderr,"%c ",i<=1 ? 'o' : 'x');

_dp_mod(sd,m,0,&sdm);

mulmd_dup(m,sdm,ps[j],&f2);

MKNODE(bt,f2,blist); blist = bt;

/* merge the highest degree part into sb */

s1 = dp_dllist_bucket(f2);

symb_merge(sb,BDY(s1),nv);

/* merge the rest into s */

symb_merge_bucket(s,NEXT(s1),nv);

nred++;

}

#else

for ( s = s0, nred = 0; s; s = NEXT(s) ) {

sb = BDY(s);

for ( ; sb; sb = NEXT(sb) ) {

for ( r = gall; r; r = NEXT(r) )

if ( _dl_redble(BDY(ps[(int)BDY(r)])->dl,BDY(sb),nv) )

break;

if ( r ) {

dltod(BDY(sb),nv,&tdp);

dp_subd(tdp,ps[(int)BDY(r)],&sd);

_dp_mod(sd,m,0,&sdm);

mulmd_dup(m,sdm,ps[(int)BDY(r)],&f2);

MKNODE(bt,f2,blist); blist = bt;

/* merge the highest degree part into sb */

s1 = dp_dllist_bucket(f2);

symb_merge(sb,BDY(s1),nv);

/* merge the rest into s */

symb_merge_bucket(s,NEXT(s1),nv);

nred++;

}

#endif

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

init_eg(&eg_split_symb); add_eg(&eg_split_symb,&tmp0,&tmp1);

Line 695 int m;

Line 849 int m;

ht[i] = BDY((DP)BDY(r))->dl;

/* col = number of all terms */

for ( s = s0, col = 0; s; s = NEXT(s), col++ );

for ( s = s0, col = 0; s; s = NEXT(s) )

for ( sb = BDY(s); sb; sb = NEXT(sb) )

col++;

/* head terms of all terms */

at = (DL *)MALLOC(col*sizeof(DL));

for ( s = s0, i = 0; i < col; s = NEXT(s), i++ )

for ( s = s0, i = 0; i < col; s = NEXT(s) )

at[i] = (DL)BDY(s);

for ( sb = BDY(s); sb; sb = NEXT(sb), i++ )

at[i] = (DL)BDY(sb);

/* store coefficients separately in spmat and redmat */

nsp = row-nred;

/* reducer matrix */

redmat = (int **)almat(nred,col);

/* indred : register the position of the head term */

#if 0

reduce_reducers_mod_compress(blist,nred,at,col,m,&redmat,&indred);

isred = (int *)MALLOC(col*sizeof(int));

bzero(isred,col*sizeof(int));

for ( i = 0; i < nred; i++ )

isred[indred[i]] = 1;

#else

redmat = (CDP *)MALLOC(nred*sizeof(CDP));

for ( i = 0, r = blist; i < nred; r = NEXT(r), i++ )

_dpmod_to_vect(BDY(r),at,redmat[i]);

_dpmod_to_vect_compress(BDY(r),at,&redmat[i]);

/* XXX */

/* reduce_reducers_mod(redmat,nred,col,m); */

/* register the position of the head term */

Line 718 int m;

Line 883 int m;

bzero(isred,col*sizeof(int));

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

ri = redmat[i];

for ( j = 0; j < col && !ri[j]; j++ );

indred[i] = ri->body[0].index;

indred[i] = j;

isred[indred[i]] = 1;

isred[j] = 1;

}

#endif

spcol = col-nred;

/* head terms not in ht */

Line 730 int m;

Line 895 int m;

if ( !isred[j] )

st[k++] = at[j];

get_eg(&tmp1);

/* spoly matrix; stored in reduced form; terms in ht[] are omitted */

spmat = almat(nsp,spcol);

spmat = (int **)MALLOC(nsp*sizeof(int *));

w = (int *)MALLOC(col*sizeof(int));

for ( ; i < row; r = NEXT(r), i++ ) {

/* skip reducers in blist */

for ( i = 0, r = blist; i < nred; r = NEXT(r), i++ );

for ( i = 0; r; r = NEXT(r) ) {

bzero(w,col*sizeof(int));

_dpmod_to_vect(BDY(r),at,w);

reduce_sp_by_red_mod(w,redmat,indred,nred,col,m);

reduce_sp_by_red_mod_compress(w,redmat,indred,nred,col,m);

for ( j = 0, k = 0; j < col; j++ )

for ( j = 0; j < col; j++ )

if ( !isred[j] )

if ( w[j] )

spmat[i-nred][k++] = w[j];

break;

if ( j < col ) {

w1 = (int *)MALLOC_ATOMIC(spcol*sizeof(int));

for ( j = 0, k = 0; j < col; j++ )

if ( !isred[j] )

w1[k++] = w[j];

spmat[i] = w1;

i++;

}

/* update nsp */

nsp = i;

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

init_eg(&eg_split_elim1); add_eg(&eg_split_elim1,&tmp1,&tmp0);

colstat = (int *)MALLOC_ATOMIC(spcol*sizeof(int));

bzero(colstat,spcol*sizeof(int));

for ( i = 0, nonzero=0; i < nsp; i++ )

for ( j = 0; j < spcol; j++ )

if ( spmat[i][j] )

Line 767 int m;

Line 947 int m;

print_eg("Elim2",&eg_split_elim2);

fprintf(asir_out,"\n");

}

if ( !rank )

continue;

for ( j = 0, i = 0; j < spcol; j++ )

if ( colstat[j] ) {

mp0 = 0;

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