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.110 and 1.125

version 1.110, 2004/09/21 05:23:14

version 1.125, 2005/02/09 08:32:32

Line 1

/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.109 2004/09/21 04:50:15 noro Exp $ */

/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.124 2005/02/09 07:58:43 noro Exp $ */

#include "nd.h"

Line 8 NM _nm_free_list;

ND _nd_free_list;

ND_pairs _ndp_free_list;

static int nd_ntrans;

static int nd_nalg;

#if 0

static int ndv_alloc;

#endif

Line 41 static int nd_found,nd_create,nd_notfirst;

Line 43 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 731 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 824 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 1527 ND normalize_pbucket(int mod,PGeoBucket g)

Line 1537 ND normalize_pbucket(int mod,PGeoBucket g)

return r;

}

void do_diagonalize(int sugar,int m)

int do_diagonalize(int sugar,int m)

{

int i,nh,stat;

NODE r,g,t;

Line 1543 void do_diagonalize(int sugar,int m)

Line 1553 void do_diagonalize(int sugar,int m)

nfv = nd_ps[i];

s = ndvtond(m,nfv);

s = nd_separate_head(s,&head);

nd_nf(m,s,nd_ps,1,&dn,&nf);

stat = nd_nf(m,s,nd_ps,1,&dn,&nf);

if ( !stat ) return 0;

if ( !m ) {

NTOQ(NM(dn.z),SGN(dn.z),num);

mulq(HCQ(head),num,&q); HCQ(head) = q;

Line 1564 void do_diagonalize(int sugar,int m)

Line 1575 void do_diagonalize(int sugar,int m)

} else

nd_ps[i] = nfv;

}

return 1;

}

/* return value = 0 => input is not a GB */

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

Line 1586 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 1589 NODE nd_gb(int m,int ishomo,int checkonly)

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

again:

l = nd_minp(d,&d);

if ( SG(l) != sugar ) {

if ( ishomo ) do_diagonalize(sugar,m);

if ( ishomo ) {

stat = do_diagonalize(sugar,m);

if ( !stat ) {

NEXT(l) = d; d = l;

d = nd_reconstruct(0,d);

goto again;

}

sugar = SG(l);

if ( DP_Print ) fprintf(asir_out,"%d",sugar);

}

Line 1613 again:

Line 1631 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 1632 again:

Line 1654 again:

return g;

}

void do_diagonalize_trace(int sugar,int m)

int do_diagonalize_trace(int sugar,int m)

{

int i,nh,stat;

NODE r,g,t;

Line 1645 void do_diagonalize_trace(int sugar,int m)

Line 1667 void do_diagonalize_trace(int sugar,int m)

/* for nd_ps */

s = ndvtond(m,nd_ps[i]);

s = nd_separate_head(s,&head);

nd_nf_pbucket(m,s,nd_ps,1,&nf);

stat = nd_nf_pbucket(m,s,nd_ps,1,&nf);

if ( !stat ) return 0;

nf = nd_add(m,head,nf);

ndv_free(nd_ps[i]);

nd_ps[i] = ndtondv(m,nf);

Line 1658 void do_diagonalize_trace(int sugar,int m)

Line 1681 void do_diagonalize_trace(int sugar,int m)

nfv = nd_ps_trace[i];

s = ndvtond(0,nfv);

s = nd_separate_head(s,&head);

nd_nf(0,s,nd_ps_trace,1,&dn,&nf);

stat = nd_nf(0,s,nd_ps_trace,1,&dn,&nf);

if ( !stat ) return 0;

NTOQ(NM(dn.z),SGN(dn.z),num);

mulq(HCQ(head),num,&q); HCQ(head) = q;

if ( DN(dn.z) ) {

Line 1677 void do_diagonalize_trace(int sugar,int m)

Line 1701 void do_diagonalize_trace(int sugar,int m)

} else

nd_ps_trace[i] = nfv;

}

return 1;

}

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 1717 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 1700 NODE nd_gb_trace(int m,int ishomo)

Line 1732 NODE nd_gb_trace(int m,int ishomo)

again:

l = nd_minp(d,&d);

if ( SG(l) != sugar ) {

if ( ishomo ) do_diagonalize_trace(sugar,m);

if ( ishomo ) {

stat = do_diagonalize_trace(sugar,m);

if ( !stat ) {

NEXT(l) = d; d = l;

d = nd_reconstruct(1,d);

goto again;

}

sugar = SG(l);

if ( DP_Print ) fprintf(asir_out,"%d",sugar);

}

Line 1737 again:

Line 1776 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 1804 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 2230 void ndv_setup(int mod,int trace,NODE f)

}

struct order_spec *append_block(struct order_spec *spec,

int nv,int nalg,int ord);

extern VECT current_dl_weight_vector_obj;

static VECT prev_weight_vector_obj;

void preprocess_algcoef(VL vv,VL av,struct order_spec *ord,LIST f,

struct order_spec **ord1p,LIST *f1p,NODE *alistp)

{

NODE alist,t,s,r0,r,arg;

VL tv;

P poly;

DP d;

Alg alpha,dp;

DAlg inv,da,hc;

MP m;

int i,nvar,nalg,n;

NumberField nf;

LIST f1,f2;

struct order_spec *current_spec;

VECT obj,obj0;

Obj tmp;

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

for ( nalg = 0, tv = av; tv; tv = NEXT(tv), 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;

/* simplification, makeing polynomials monic */

setfield_dalg(alist);

obj_algtodalg(f,&f1);

for ( t = BDY(f); t; t = NEXT(t) ) {

initd(ord); ptod(vv,vv,(P)BDY(t),&d);

hc = (DAlg)BDY(d)->c;

if ( NID(hc) == N_DA ) {

invdalg(hc,&inv);

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

muldalg(inv,(DAlg)m->c,&da); m->c = (P)da;

}

initd(ord); dtop(vv,vv,d,&poly); BDY(f) = (pointer)poly;

}

obj_dalgtoalg(f1,&f);

/* append alg vars to the var list */

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

NEXT(tv) = av;

/* append a block to ord */

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

/* create generator list */

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);

*alistp = alist;

algobjtorat(f1,f1p);

/* creating a new weight vector */

prev_weight_vector_obj = obj0 = current_dl_weight_vector_obj;

n = nvar+nalg+1;

MKVECT(obj,n);

if ( obj0 && obj0->len == nvar )

for ( i = 0; i < nvar; i++ ) BDY(obj)[i] = BDY(obj0)[i];

else

for ( i = 0; i < nvar; i++ ) BDY(obj)[i] = (pointer)ONE;

for ( i = 0; i < nalg; i++ ) BDY(obj)[i+nvar] = 0;

BDY(obj)[n-1] = (pointer)ONE;

arg = mknode(1,obj);

Pdp_set_weight(arg,&tmp);

}

NODE postprocess_algcoef(VL av,NODE alist,NODE r)

{

NODE s,t,u0,u;

P p;

VL tv;

Obj obj,tmp;

NODE arg;

u0 = 0;

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

p = (P)BDY(t);

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;

}

if ( OID(p) == O_P || (OID(p) == O_N && NID((Num)p) != N_A) ) {

NEXTNODE(u0,u);

BDY(u) = (pointer)p;

}

arg = mknode(1,prev_weight_vector_obj);

Pdp_set_weight(arg,&tmp);

return u0;

}

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;

struct order_spec *ord1;

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 2365 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe

default:

break;

}

nd_nalg = 0;

av = 0;

if ( !m ) {

get_algtree((Obj)f,&av);

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

nd_ntrans = nvar;

nd_nalg = nalg;

/* #i -> t#i */

if ( nalg ) {

preprocess_algcoef(vv,av,ord,f,&ord1,&f1,&alist);

ord = ord1;

f = f1;

}

nvar += nalg;

}

nd_init_ord(ord);

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

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

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

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

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

}

if ( r0 ) NEXT(r) = 0;

if ( nalg )

r0 = postprocess_algcoef(av,alist,r0);

MKLIST(*rp,r0);

#if 0

fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);

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

Line 2416 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,av;

VL tv,fv,vv,vc;

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

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

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;

struct order_spec *ord1;

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 2441 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_ntrans = nvar;

nd_nalg = nalg;

/* #i -> t#i */

if ( nalg ) {

preprocess_algcoef(vv,av,ord,f,&ord1,&f1,&alist);

ord = ord1;

f = f1;

}

nvar += nalg;

nocheck = 0;

mindex = 0;

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

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

if ( in0 ) NEXT(in) = 0;

if ( fd0 ) NEXT(fd) = 0;

if ( !ishomo && homo ) {

for ( t = in0, wmax = 0; t; t = NEXT(t) ) {

for ( t = in0, wmax = max; t; t = NEXT(t) ) {

c = (NDV)BDY(t); len = LEN(c);

for ( a = BDY(c), i = 0; i < len; i++, NMV_ADV(a) )

wmax = MAX(TD(DL(a)),wmax);

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

Line 2543 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 )

cand = postprocess_algcoef(av,alist,cand);

MKLIST(*rp,cand);

}

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

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

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

int i,j;

N qn,rn,gn;

Q *t,*q,*r;

Q *q,*r;

t = (Q *)ALLOCA(n*sizeof(Q));

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

if ( c[i] )

t[j++] = c[i];

n = j;

c = t;

q = (Q *)ALLOCA(n*sizeof(Q));

r = (Q *)ALLOCA(n*sizeof(Q));

v.id = O_VECT; v.len = n; v.body = (pointer *)c;

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

Line 2818 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 2637 void nd_mul_c_q(ND p,Q mul)

Line 2834 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 3217 ND nd_quo(int mod,PGeoBucket bucket,NDV d)

Line 3415 ND nd_quo(int mod,PGeoBucket bucket,NDV d)

ND p,t,r;

N tnm;

if ( !p ) return 0;

if ( bucket->m < 0 ) return 0;

else {

nv = NV(d);

mq0 = 0;

Line 3338 ND nd_dup(ND p)

Line 3536 ND nd_dup(ND p)

void ndv_mod(int mod,NDV p)

{

NMV t,d;

int r;

int r,s,u;

int i,len,dlen;

Obj gfs;

Line 3360 void ndv_mod(int mod,NDV p)

Line 3558 void ndv_mod(int mod,NDV p)

if ( r ) {

if ( SGN(CQ(t)) < 0 )

r = mod-r;

if ( DN(CQ(t)) ) {

s = rem(DN(CQ(t)),mod);

if ( !s )

error("ndv_mod : division by 0");

s = invm(s,mod);

DMAR(r,s,0,mod,u); r = u;

}

CM(d) = r;

ndl_copy(DL(t),DL(d));

NMV_ADV(d);

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

Line 3920 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 4888 void nd_det(int mod,MAT f,P *rp)

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

int n,i,j,max,e,nvar,sgn,k0,l0,len0,len,k,l,a;

pointer **m;

Q mone;

P **w;

P mp;

NDV **dm;

NDV *t,*mi,*mj;

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 5114 void nd_det(int mod,MAT f,P *rp)

if ( f->row != f->col )

error("nd_det : non-square matrix");

n = f->row;

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

m = f->body;

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

if ( !nvar ) {

if ( !mod )

detp(CO,(P **)m,n,rp);

else {

w = (P **)almat_pointer(n,n);

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

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

ptomp(mod,(P)m[i][j],&w[i][j]);

detmp(CO,mod,w,n,&mp);

mptop(mp,rp);

}

return;

}

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

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

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

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 4922 void nd_det(int mod,MAT f,P *rp)

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

if ( mod ) ndv_mod(mod,d);

chsgnq(ONE,&mone);

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

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

if ( DP_Print ) fprintf(stderr,".",j);

for ( i = j; i < n && !dm[i][j]; i++ );

if ( i == n ) {

*rp = 0;

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

Line 5171 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 4971 void nd_det(int mod,MAT f,P *rp)

Line 5202 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;

}

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

if ( sgn < 0 )

if ( mod )

ndv_mul_c(mod,d,mod-1);

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

Line 5263 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,td,i,e,j;

DL a;

ndl_zero(trans);

td = 0;

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

e = GET_EXP(d,i);

PUT_EXP(trans,i,e);

td += MUL_WEIGHT(e,i);

}

if ( nd_ntrans+nd_nalg < nd_nvar ) {

/* homogenized */

i = nd_nvar-1;

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 = 0; i < nd_nalg; i++ ) {

j = nd_ntrans+i;

e = GET_EXP(d,j);

a->d[i] = 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");

/* 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 = 0; i < nd_nalg; i++ ) {

e = dl->d[i];

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

td += MUL_WEIGHT(e,i+nd_ntrans);

}

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>