OpenXM_contrib2/asir2000/engine/nd.c - diff

Return to nd.c CVS log

Up to [local] / OpenXM_contrib2 / asir2000 / engine

Diff for /OpenXM_contrib2/asir2000/engine/nd.c between version 1.109 and 1.119

version 1.109, 2004/09/21 04:50:15

version 1.119, 2004/12/06 09:29:34

Line 1

/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.108 2004/09/21 02:43:11 noro Exp $ */

/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.118 2004/12/04 09:39:27 noro Exp $ */

#include "nd.h"

Line 8 NM _nm_free_list;

ND _nd_free_list;

ND_pairs _ndp_free_list;

static int nd_nalg;

#if 0

static int ndv_alloc;

#endif

Line 41 static int nd_found,nd_create,nd_notfirst;

Line 42 static int nd_found,nd_create,nd_notfirst;

static int nmv_adv;

static int nd_demand;

NumberField get_numberfield();

UINT *nd_det_compute_bound(NDV **dm,int n,int j);

void nd_det_reconstruct(NDV **dm,int n,int j,NDV d);

int nd_monic(int m,ND *p);

void nd_free_private_storage()

{

_nm_free_list = 0;

Line 724 int ndl_disjoint(UINT *d1,UINT *d2)

Line 730 int ndl_disjoint(UINT *d1,UINT *d2)

#endif

}

int ndl_check_bound2(int index,UINT *d2)

int ndl_check_bound(UINT *d1,UINT *d2)

{

UINT u2;

UINT *d1;

int i,j,ind,k;

d1 = nd_bound[index];

ind = 0;

#if USE_UNROLL

switch ( nd_bpe ) {

Line 819 int ndl_check_bound2(int index,UINT *d2)

Line 823 int ndl_check_bound2(int index,UINT *d2)

#endif

}

int ndl_check_bound2(int index,UINT *d2)

{

return ndl_check_bound(nd_bound[index],d2);

}

INLINE int ndl_hash_value(UINT *d)

{

int i;

Line 1574 NODE nd_gb(int m,int ishomo,int checkonly)

Line 1583 NODE nd_gb(int m,int ishomo,int checkonly)

NODE r,g,t;

ND_pairs d;

ND_pairs l;

ND h,nf,s,head;

ND h,nf,s,head,nf1;

NDV nfv;

Q q,num,den;

union oNDC dn;

Line 1613 again:

Line 1622 again:

if ( checkonly ) return 0;

if ( DP_Print ) { printf("+"); fflush(stdout); }

nd_removecont(m,nf);

if ( !m && nd_nalg ) {

nd_monic(0,&nf);

nd_removecont(m,nf);

}

nfv = ndtondv(m,nf); nd_free(nf);

nh = ndv_newps(m,nfv,0);

d = update_pairs(d,g,nh);

Line 1679 void do_diagonalize_trace(int sugar,int m)

Line 1692 void do_diagonalize_trace(int sugar,int m)

}

static struct oEGT eg_invdalg;

struct oEGT eg_le;

NODE nd_gb_trace(int m,int ishomo)

{

int i,nh,sugar,stat;

Line 1689 NODE nd_gb_trace(int m,int ishomo)

Line 1705 NODE nd_gb_trace(int m,int ishomo)

NDV nfv,nfqv;

Q q,den,num;

union oNDC dn;

struct oEGT eg_monic,egm0,egm1;

init_eg(&eg_monic);

init_eg(&eg_invdalg);

init_eg(&eg_le);

g = 0; d = 0;

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

d = update_pairs(d,g,i);

Line 1737 again:

Line 1757 again:

if ( !rem(NM(HCQ(nfq)),m) ) return 0;

if ( DP_Print ) { printf("+"); fflush(stdout); }

nd_removecont(m,nf); nfv = ndtondv(m,nf); nd_free(nf);

if ( nd_nalg ) {

nd_removecont(0,nfq); nfqv = ndtondv(0,nfq); nd_free(nfq);

/* m|DN(HC(nf)^(-1)) => failure */

get_eg(&egm0);

if ( !nd_monic(m,&nfq) ) return 0;

get_eg(&egm1); add_eg(&eg_monic,&egm0,&egm1);

nd_removecont(0,nfq); nfqv = ndtondv(0,nfq); nd_free(nfq);

nfv = ndv_dup(0,nfqv); ndv_mod(m,nfv); nd_free(nf);

} else {

nd_removecont(0,nfq); nfqv = ndtondv(0,nfq); nd_free(nfq);

nd_removecont(m,nf); nfv = ndtondv(m,nf); nd_free(nf);

}

nh = ndv_newps(0,nfv,nfqv);

d = update_pairs(d,g,nh);

g = update_base(g,nh);

Line 1756 again:

Line 1785 again:

else

for ( t = g; t; t = NEXT(t) )

BDY(t) = (pointer)nd_ps_trace[(int)BDY(t)];

if ( nd_nalg ) {

print_eg("monic",&eg_monic);

print_eg("invdalg",&eg_invdalg);

print_eg("le",&eg_le);

}

return g;

}

Line 2177 void ndv_setup(int mod,int trace,NODE f)

Line 2211 void ndv_setup(int mod,int trace,NODE f)

}

struct order_spec *append_block(struct order_spec *spec,

int nv,int nalg,int ord);

void nd_gr(LIST f,LIST v,int m,int f4,struct order_spec *ord,LIST *rp)

{

VL tv,fv,vv,vc;

VL tv,fv,vv,vc,av;

NODE fd,fd0,r,r0,t,x,s,xx;

NODE fd,fd0,r,r0,t,x,s,xx,alist;

int e,max,nvar;

int e,max,nvar,i;

NDV b;

int ishomo;

int ishomo,nalg;

Alg alpha,dp;

P p;

LIST f1,f2;

Obj obj;

NumberField nf;

if ( !m && Demand ) nd_demand = 1;

else nd_demand = 0;

Line 2201 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe

Line 2243 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe

default:

break;

}

nd_nalg = 0;

if ( !m ) {

get_algtree((Obj)f,&av);

for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++ );

nd_nalg = nalg;

/* #i -> t#i */

if ( nalg ) {

for ( alist = 0, tv = av; tv; tv = NEXT(tv) ) {

NEXTNODE(alist,t); MKV(tv->v,p);

MKAlg(p,alpha); BDY(t) = (pointer)alpha;

tv->v = tv->v->priv;

}

NEXT(t) = 0;

for ( tv = vv; NEXT(tv); tv = NEXT(tv) );

NEXT(tv) = av;

ord = append_block(ord,nvar,nalg,2);

nvar += nalg;

setfield_dalg(alist);

nf = get_numberfield();

for ( i = nalg-1, t = BDY(f); i >= 0; i-- ) {

MKAlg(nf->defpoly[i],dp);

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

}

MKLIST(f1,t);

algobjtorat(f1,&f2); f = f2;

}

nd_init_ord(ord);

for ( t = BDY(f), max = 0; t; t = NEXT(t) )

for ( tv = vv; tv; tv = NEXT(tv) ) {

Line 2225 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe

Line 2294 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe

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

NEXTNODE(r0,r);

BDY(r) = ndvtop(m,CO,vv,BDY(t));

if ( nalg ) {

p = BDY(r);

for ( tv = av, s = alist; tv; tv = NEXT(tv), s = NEXT(s) ) {

substr(CO,0,(Obj)p,tv->v,(Obj)BDY(s),&obj); p = (P)obj;

}

BDY(r) = p;

}

if ( r0 ) NEXT(r) = 0;

MKLIST(*rp,r0);

Line 2236 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe

Line 2312 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe

void nd_gr_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp)

{

struct order_spec *ord1;

VL tv,fv,vv,vc;

VL tv,fv,vv,vc,av;

NODE fd,fd0,in0,in,r,r0,t,s,cand;

NODE fd,fd0,in0,in,r,r0,t,s,cand,alist;

int m,nocheck,nvar,mindex,e,max;

NDV c;

NMV a;

P p;

EPOS oepos;

int obpe,oadv,wmax,i,len,cbpe,ishomo;

int obpe,oadv,wmax,i,len,cbpe,ishomo,nalg;

Alg alpha,dp;

P poly;

LIST f1,f2;

Obj obj;

NumberField nf;

get_vars((Obj)f,&fv); pltovl(v,&vv);

for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );

Line 2255 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru

Line 2336 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru

default:

break;

}

get_algtree((Obj)f,&av);

for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++ );

nd_nalg = nalg;

/* #i -> t#i */

if ( nalg ) {

for ( alist = 0, tv = av; tv; tv = NEXT(tv) ) {

NEXTNODE(alist,t); MKV(tv->v,poly);

MKAlg(poly,alpha); BDY(t) = (pointer)alpha;

tv->v = tv->v->priv;

}

NEXT(t) = 0;

for ( tv = vv; NEXT(tv); tv = NEXT(tv) );

NEXT(tv) = av;

ord = append_block(ord,nvar,nalg,2);

nvar += nalg;

setfield_dalg(alist);

nf = get_numberfield();

for ( i = nalg-1, t = BDY(f); i >= 0; i-- ) {

MKAlg(nf->defpoly[i],dp);

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

}

MKLIST(f1,t);

algobjtorat(f1,&f2); f = f2;

}

nocheck = 0;

mindex = 0;

Line 2344 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru

Line 2451 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru

/* dp->p */

nd_bpe = cbpe;

nd_setup_parameters(nd_nvar,0);

for ( r = cand; r; r = NEXT(r) ) BDY(r) = (pointer)ndvtop(0,CO,vv,BDY(r));

for ( r = cand; r; r = NEXT(r) ) {

BDY(r) = (pointer)ndvtop(0,CO,vv,BDY(r));

if ( nalg ) {

poly = BDY(r);

for ( tv = av, s = alist; tv; tv = NEXT(tv), s = NEXT(s) ) {

substr(CO,0,(Obj)poly,tv->v,(Obj)BDY(s),&obj); poly = (P)obj;

}

BDY(r) = poly;

}

MKLIST(*rp,cand);

}

Line 2579 void removecont_array(Q *c,int n)

Line 2695 void removecont_array(Q *c,int n)

{

struct oVECT v;

Q d0,d1,a,u,u1,gcd;

int i;

int i,j;

N qn,rn,gn;

Q *q,*r;

Line 2616 void nd_mul_c(int mod,ND p,int mul)

Line 2732 void nd_mul_c(int mod,ND p,int mul)

int c,c1;

if ( !p ) return;

if ( mul == 1 ) return;

if ( mod == -1 )

for ( m = BDY(p); m; m = NEXT(m) )

CM(m) = _mulsf(CM(m),mul);

Line 2631 void nd_mul_c_q(ND p,Q mul)

Line 2748 void nd_mul_c_q(ND p,Q mul)

Q c;

if ( !p ) return;

if ( UNIQ(mul) ) return;

for ( m = BDY(p); m; m = NEXT(m) ) {

mulq(CQ(m),mul,&c); CQ(m) = c;

}

Line 3709 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec

Line 3827 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec

int stat,nvar,max,e;

union oNDC dn;

if ( !f ) {

*rp = 0;

return;

}

pltovl(v,&vv);

for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );

Line 3857 int ndv_reduce_vect_q(Q *svect,int col,IndArray *imat,

Line 3979 int ndv_reduce_vect_q(Q *svect,int col,IndArray *imat,

len = LEN(redv); mr = BDY(redv);

igcd_cofactor(svect[k],CQ(mr),&gcd,&cs,&cr);

chsgnq(cs,&mcs);

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

if ( !UNIQ(cr) ) {

mulq(svect[j],cr,&c1); svect[j] = c1;

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

mulq(svect[j],cr,&c1); svect[j] = c1;

}

svect[k] = 0; prev = k;

switch ( ivect->width ) {

Line 4885 void nd_det(int mod,MAT f,P *rp)

Line 5009 void nd_det(int mod,MAT f,P *rp)

NDV d,s,mij,mjj;

ND u;

NMV nmv;

UINT *bound;

PGeoBucket bucket;

struct order_spec *ord;

Line 4902 void nd_det(int mod,MAT f,P *rp)

Line 5027 void nd_det(int mod,MAT f,P *rp)

e = getdeg(tv->v,(P)m[i][j]);

max = MAX(e,max);

}

nd_setup_parameters(nvar,1024);

nd_setup_parameters(nvar,max);

dm = (NDV **)almat_pointer(n,n);

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

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

Line 4936 void nd_det(int mod,MAT f,P *rp)

Line 5061 void nd_det(int mod,MAT f,P *rp)

}

sgn = -sgn;

}

bound = nd_det_compute_bound(dm,n,j);

if ( ndl_check_bound(bound,bound) )

nd_det_reconstruct(dm,n,j,d);

for ( i = j+1, mj = dm[j], mjj = mj[j]; i < n; i++ ) {

if ( DP_Print ) fprintf(stderr," i=%d\n ",i);

/* if ( DP_Print ) fprintf(stderr," i=%d\n ",i); */

mi = dm[i]; mij = mi[j];

if ( mod )

ndv_mul_c(mod,mij,mod-1);

else

ndv_mul_c_q(mij,mone);

for ( k = j+1; k < n; k++ ) {

if ( DP_Print ) fprintf(stderr,"k=%d ",k);

/* if ( DP_Print ) fprintf(stderr,"k=%d ",k); */

bucket = create_pbucket();

if ( mi[k] ) {

nmv = BDY(mjj); len = LEN(mjj);

Line 4963 void nd_det(int mod,MAT f,P *rp)

Line 5092 void nd_det(int mod,MAT f,P *rp)

u = nd_quo(mod,bucket,d);

mi[k] = ndtondv(mod,u);

}

if ( DP_Print ) fprintf(stderr,"\n",k);

/* if ( DP_Print ) fprintf(stderr,"\n",k); */

}

d = mjj;

}

Line 5023 ND ndv_mul_nmv_trunc(int mod,NMV m0,NDV p,UINT *d)

Line 5152 ND ndv_mul_nmv_trunc(int mod,NMV m0,NDV p,UINT *d)

return r;

}

void nd_det_reconstruct(NDV **dm,int n,int j,NDV d)

{

int i,obpe,oadv,h,k,l;

static NM prev_nm_free_list;

EPOS oepos;

obpe = nd_bpe;

oadv = nmv_adv;

oepos = nd_epos;

if ( obpe < 2 ) nd_bpe = 2;

else if ( obpe < 3 ) nd_bpe = 3;

else if ( obpe < 4 ) nd_bpe = 4;

else if ( obpe < 5 ) nd_bpe = 5;

else if ( obpe < 6 ) nd_bpe = 6;

else if ( obpe < 8 ) nd_bpe = 8;

else if ( obpe < 10 ) nd_bpe = 10;

else if ( obpe < 16 ) nd_bpe = 16;

else if ( obpe < 32 ) nd_bpe = 32;

else error("nd_det_reconstruct : exponent too large");

nd_setup_parameters(nd_nvar,0);

prev_nm_free_list = _nm_free_list;

_nm_free_list = 0;

for ( k = j; k < n; k++ )

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

ndv_realloc(dm[k][l],obpe,oadv,oepos);

ndv_realloc(d,obpe,oadv,oepos);

prev_nm_free_list = 0;

#if 0

GC_gcollect();

#endif

}

UINT *nd_det_compute_bound(NDV **dm,int n,int j)

{

UINT *d0,*d1,*d,*t,*r;

int k,l;

d0 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));

d1 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));

for ( k = 0; k < nd_wpd; k++ ) d0[k] = 0;

for ( k = j; k < n; k++ )

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

if ( dm[k][l] ) {

d = ndv_compute_bound(dm[k][l]);

ndl_lcm(d,d0,d1);

t = d1; d1 = d0; d0 = t;

}

r = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));

for ( k = 0; k < nd_wpd; k++ ) r[k] = d0[k];

return r;

}

DL nd_separate_d(UINT *d,UINT *trans)

{

int n,ntrans,td,i,e;

DL a;

n = nd_nvar; ntrans = n-nd_nalg;

ndl_zero(trans);

td = 0;

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

e = GET_EXP(d,i);

PUT_EXP(trans,i,e);

td += MUL_WEIGHT(e,i);

}

TD(trans) = td;

if ( nd_blockmask) ndl_weight_mask(trans);

NEWDL(a,nd_nalg);

td = 0;

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

e = GET_EXP(d,i);

a->d[i-ntrans] = e;

td += e;

}

a->td = td;

return a;

}

int nd_monic(int mod,ND *p)

{

UINT *trans,*t;

DL alg;

MP mp0,mp;

NM m,m0,m1,ma0,ma,mb,mr0,mr;

ND r;

DL dl;

DP nm;

NDV ndv;

DAlg inv,cd;

ND s,c;

Q l,mul;

N ln;

int n,ntrans,i,e,td,is_lc,len;

NumberField nf;

struct oEGT eg0,eg1;

if ( !(nf = get_numberfield()) )

error("nd_monic : current_numberfield is not set");

n = nd_nvar; ntrans = n-nd_nalg;

/* Q coef -> DAlg coef */

NEWNM(ma0); ma = ma0;

m = BDY(*p);

is_lc = 1;

while ( 1 ) {

NEWMP(mp0); mp = mp0;

mp->c = (P)CQ(m);

mp->dl = nd_separate_d(DL(m),DL(ma));

NEWNM(mb);

for ( m = NEXT(m); m; m = NEXT(m) ) {

alg = nd_separate_d(DL(m),DL(mb));

if ( !ndl_equal(DL(ma),DL(mb)) )

break;

NEXTMP(mp0,mp); mp->c = (P)CQ(m); mp->dl = alg;

}

NEXT(mp) = 0;

MKDP(nd_nalg,mp0,nm);

MKDAlg(nm,ONE,cd);

if ( is_lc == 1 ) {

/* if the lc is a rational number, we have nothing to do */

if ( !mp0->dl->td )

return 1;

get_eg(&eg0);

invdalg(cd,&inv);

get_eg(&eg1); add_eg(&eg_invdalg,&eg0,&eg1);

/* check the validity of inv */

if ( mod && !rem(NM(inv->dn),mod) )

return 0;

CA(ma) = nf->one;

is_lc = 0;

ln = ONEN;

} else {

muldalg(cd,inv,&CA(ma));

lcmn(ln,NM(CA(ma)->dn),&ln);

}

if ( m ) {

NEXT(ma) = mb; ma = mb;

} else {

NEXT(ma) = 0;

break;

}

/* l = lcm(denoms) */

NTOQ(ln,1,l);

for ( mr0 = 0, m = ma0; m; m = NEXT(m) ) {

divq(l,CA(m)->dn,&mul);

for ( mp = BDY(CA(m)->nm); mp; mp = NEXT(mp) ) {

NEXTNM(mr0,mr);

mulq((Q)mp->c,mul,&CQ(mr));

dl = mp->dl;

td = TD(DL(m));

ndl_copy(DL(m),DL(mr));

for ( i = ntrans; i < n; i++ ) {

e = dl->d[i-ntrans];

PUT_EXP(DL(mr),i,e);

td += MUL_WEIGHT(e,i);

}

TD(DL(mr)) = td;

if ( nd_blockmask) ndl_weight_mask(DL(mr));

}

NEXT(mr) = 0;

for ( len = 0, mr = mr0; mr; mr = NEXT(mr), len++ );

MKND(NV(*p),mr0,len,r);

/* XXX */

SG(r) = SG(*p);

nd_free(*p);

*p = r;

return 1;

}

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