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.26 and 1.28

version 1.26, 2003/08/07 09:47:08

version 1.28, 2003/08/11 06:58:01

Line 1

/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.25 2003/08/07 08:46:50 noro Exp $ */

/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.27 2003/08/10 01:31:24 noro Exp $ */

#include "ca.h"

#include "inline.h"

Line 11

#define INLINE

#endif

#define USE_GEOBUCKET 1

#define REDTAB_LEN 32003

typedef struct oPGeoBucket {

Line 122 if(!(r)){(c)=(r)=(s);}else{NEXT(c)=(s);(c)=(s);}

Line 124 if(!(r)){(c)=(r)=(s);}else{NEXT(c)=(s);(c)=(s);}

#define NEXTND_pairs(r,c) \

if(!(r)){NEWND_pairs(r);(c)=(r);}else{NEWND_pairs(NEXT(c));(c)=NEXT(c);}

int nd_check_candidate(NODE input,NODE cand);

void nd_removecont(int mod,ND p);

void nd_removecont2(ND p1,ND p2);

void ndv_removecont(int mod,NDV p);

Line 139 ND nd_remove_head(ND p);

Line 142 ND nd_remove_head(ND p);

void GC_gcollect();

NODE append_one(NODE,int);

NODE nd_reducebase(NODE x);

void removecont_array(Q *c,int n);

ND_pairs crit_B( ND_pairs d, int s );

Line 156 ND_pairs crit_F( ND_pairs d1 );

Line 160 ND_pairs crit_F( ND_pairs d1 );

ND_pairs crit_M( ND_pairs d1 );

ND_pairs nd_newpairs( NODE g, int t );

ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t);

NODE nd_gb(int m);

NODE nd_gb(int m,int checkonly);

NODE nd_gb_trace(int m);

void nd_free_private_storage();

void _NM_alloc();

Line 174 int nd_nf(int mod,ND g,int full,ND *nf);

Line 178 int nd_nf(int mod,ND g,int full,ND *nf);

ND nd_reduce(ND p1,ND p2);

ND nd_reduce_special(ND p1,ND p2);

NODE nd_reduceall(int m,NODE f);

int nd_gbcheck(int m,NODE f);

int nd_membercheck(int m,NODE f);

void nd_free(ND p);

void ndv_free(NDV p);

void ndl_print(unsigned int *dl);

Line 917 ND nd_add_q(ND p1,ND p2)

Line 923 ND nd_add_q(ND p1,ND p2)

}

#if 1

#if !USE_GEOBUCKET

/* ret=1 : success, ret=0 : overflow */

int nd_nf(int mod,ND g,int full,ND *rp)

{

Line 997 afo:

Line 1003 afo:

*rp = d;

return 1;

}

int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full,ND *rp)

{

ND d;

NM m,mrd,tail;

NM mul;

int n,sugar,psugar,sugar0,stat,index;

int c,c1,c2;

RHist h;

NDV p,red;

Q cg,cred,gcd;

double hmag;

if ( !g ) {

*rp = 0;

return 1;

}

#if 0

if ( !mod )

hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;

#else

/* XXX */

hmag = 0;

#endif

sugar0 = sugar = SG(g);

n = NV(g);

mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int));

for ( d = 0; g; ) {

index = nd_find_reducer_direct(g,ps,len);

if ( index >= 0 ) {

p = ps[index];

ndl_sub(HDL(g),HDL(p),DL(mul));

TD(mul) = HTD(g)-HTD(p);

if ( ndl_check_bound2_direct(HDL(p),DL(mul)) ) {

nd_free(g); nd_free(d);

return 0;

}

if ( mod ) {

c1 = invm(HCM(p),mod); c2 = mod-HCM(g);

DMAR(c1,c2,0,mod,c); CM(mul) = c;

} else {

igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred);

chsgnq(cg,&CQ(mul));

nd_mul_c_q(d,cred); nd_mul_c_q(g,cred);

}

g = nd_add(mod,g,ndv_mul_nm(mod,p,mul));

sugar = MAX(sugar,SG(p)+TD(mul));

if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) {

nd_removecont2(d,g);

hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;

}

} else if ( !full ) {

*rp = g;

return 1;

} else {

m = BDY(g);

if ( NEXT(m) ) {

BDY(g) = NEXT(m); NEXT(m) = 0;

} else {

FREEND(g); g = 0;

}

if ( d ) {

NEXT(tail)=m;

tail=m;

} else {

MKND(n,m,d);

tail = BDY(d);

}

if ( d )

SG(d) = sugar;

*rp = d;

return 1;

}

#else

int nd_nf(int mod,ND g,int full,ND *rp)

{

int hindex,index;

Line 1010 int nd_nf(int mod,ND g,int full,ND *rp)

Line 1092 int nd_nf(int mod,ND g,int full,ND *rp)

int c,c1,c2;

Q cg,cred,gcd,zzz;

RHist h;

double hmag,gmag;

if ( !g ) {

*rp = 0;

Line 1017 int nd_nf(int mod,ND g,int full,ND *rp)

Line 1100 int nd_nf(int mod,ND g,int full,ND *rp)

}

sugar = SG(g);

n = NV(g);

if ( !mod )

hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;

bucket = create_pbucket();

add_pbucket(mod,bucket,g,nd_length(g));

d = 0;

Line 1052 int nd_nf(int mod,ND g,int full,ND *rp)

Line 1137 int nd_nf(int mod,ND g,int full,ND *rp)

nd_mul_c_q(d,cred);

mulq_pbucket(bucket,cred);

g = bucket->body[hindex];

gmag = (double)p_mag((P)HCQ(g));

}

red = ndv_mul_nm(mod,p,mul);

bucket->body[hindex] = nd_remove_head(g);

red = nd_remove_head(red);

add_pbucket(mod,bucket,red,LEN(p)-1);

sugar = MAX(sugar,SG(p)+TD(mul));

if ( !mod && hmag && (gmag > hmag) ) {

g = normalize_pbucket(mod,bucket);

if ( !g ) {

if ( d )

SG(d) = sugar;

*rp = d;

return 1;

}

nd_removecont2(d,g);

hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;

add_pbucket(mod,bucket,g,nd_length(g)-1);

}

} else if ( !full ) {

g = normalize_pbucket(mod,bucket);

if ( g )

Line 1082 int nd_nf(int mod,ND g,int full,ND *rp)

Line 1180 int nd_nf(int mod,ND g,int full,ND *rp)

}

#endif

int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full,ND *rp)

{

ND d;

int hindex,index;

NM m,mrd,tail;

NDV p;

NM mul;

ND u,d,red;

int n,sugar,psugar,sugar0,stat,index;

NODE l;

NM mul,m,mrd;

int sugar,psugar,n,h_reducible;

PGeoBucket bucket;

int c,c1,c2;

Q cg,cred,gcd,zzz;

RHist h;

NDV p,red;

double hmag,gmag;

Q cg,cred,gcd;

double hmag;

if ( !g ) {

*rp = 0;

return 1;

}

sugar = SG(g);

n = NV(g);

#if 0

if ( !mod )

hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;

Line 1107 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full

Line 1208 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full

/* XXX */

hmag = 0;

#endif

bucket = create_pbucket();

sugar0 = sugar = SG(g);

add_pbucket(mod,bucket,g,nd_length(g));

n = NV(g);

d = 0;

mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int));

for ( d = 0; g; ) {

while ( 1 ) {

hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket);

if ( hindex < 0 ) {

if ( d )

SG(d) = sugar;

*rp = d;

return 1;

}

g = bucket->body[hindex];

index = nd_find_reducer_direct(g,ps,len);

if ( index >= 0 ) {

p = ps[index];

ndl_sub(HDL(g),HDL(p),DL(mul));

TD(mul) = HTD(g)-HTD(p);

if ( ndl_check_bound2_direct(HDL(p),DL(mul)) ) {

nd_free(g); nd_free(d);

nd_free(d);

free_pbucket(bucket);

*rp = 0;

return 0;

}

if ( mod ) {

c1 = invm(HCM(p),mod); c2 = mod-HCM(g);

DMAR(c1,c2,0,mod,c); CM(mul) = c;

} else {

igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred);

chsgnq(cg,&CQ(mul));

nd_mul_c_q(d,cred); nd_mul_c_q(g,cred);

nd_mul_c_q(d,cred);

mulq_pbucket(bucket,cred);

g = bucket->body[hindex];

gmag = (double)p_mag((P)HCQ(g));

}

g = nd_add(mod,g,ndv_mul_nm(mod,p,mul));

red = ndv_mul_nm(mod,p,mul);

bucket->body[hindex] = nd_remove_head(g);

red = nd_remove_head(red);

add_pbucket(mod,bucket,red,LEN(p)-1);

sugar = MAX(sugar,SG(p)+TD(mul));

if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) {

if ( !mod && hmag && (gmag > hmag) ) {

g = normalize_pbucket(mod,bucket);

if ( !g ) {

if ( d )

SG(d) = sugar;

*rp = d;

return 1;

}

nd_removecont2(d,g);

hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;

add_pbucket(mod,bucket,g,nd_length(g)-1);

}

} else if ( !full ) {

g = normalize_pbucket(mod,bucket);

if ( g )

SG(g) = sugar;

*rp = g;

return 1;

} else {

Line 1145 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full

Line 1273 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full

} else {

FREEND(g); g = 0;

}

bucket->body[hindex] = g;

NEXT(m) = 0;

if ( d ) {

NEXT(tail)=m;

for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) );

tail=m;

NEXT(mrd) = m;

} else {

MKND(n,m,d);

tail = BDY(d);

}

if ( d )

}

SG(d) = sugar;

#endif

*rp = d;

/* input : list of DP, cand : list of DP */

int nd_check_candidate(NODE input,NODE cand)

{

int n,i,stat;

ND nf,d;

NODE t;

nd_setup(0,cand);

/* membercheck : list is a subset of Id(cand) ? */

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

d = dptond(0,(DP)BDY(t));

stat = nd_nf_direct(0,d,nd_psq,n,0,&nf);

if ( !stat )

nd_reconstruct_direct(0,nd_psq,n);

else if ( nf )

return 0;

}

/* gbcheck : cand is a GB of Id(cand) ? */

if ( !nd_gb(0,1) )

return 0;

/* XXX */

return 1;

}

Line 1330 ND normalize_pbucket(int mod,PGeoBucket g)

Line 1482 ND normalize_pbucket(int mod,PGeoBucket g)

ND r,t;

r = 0;

for ( i = 0; i <= g->m; i++ )

for ( i = 0; i <= g->m; i++ ) {

r = nd_add(mod,r,g->body[i]);

g->body[i] = 0;

}

g->m = -1;

return r;

}

NODE nd_gb(int m)

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

NODE nd_gb(int m,int checkonly)

{

int i,nh,sugar,stat;

NODE r,g,t;

Line 1368 again:

Line 1525 again:

d = nd_reconstruct(m,0,d);

goto again;

} else if ( nf ) {

if ( checkonly ) return 0;

printf("+"); fflush(stdout);

nh = nd_newps(m,nf);

d = update_pairs(d,g,nh);

Line 1426 again:

Line 1584 again:

if ( nfq ) {

printf("+"); fflush(stdout);

nh = nd_newps_trace(m,nf,nfq);

/* failure; m|HC(nfq) */

if ( nf < 0 ) return 0;

d = update_pairs(d,g,nh);

g = update_base(g,nh);

} else {

Line 1826 int nd_newps_trace(int mod,ND nf,ND nfq)

Line 1986 int nd_newps_trace(int mod,ND nf,ND nfq)

nd_bound = (unsigned int **)

REALLOC((char *)nd_bound,nd_pslen*sizeof(unsigned int *));

}

if ( !rem(NM(HCQ(nfq)),mod) ) return -1;

nd_removecont(mod,nf);

nd_ps[nd_psn] = ndtondv(mod,nf);

Line 1977 void nd_gr(LIST f,LIST v,int m,struct order_spec *ord,

Line 2138 void nd_gr(LIST f,LIST v,int m,struct order_spec *ord,

}

if ( fd0 ) NEXT(fd) = 0;

nd_setup(m,fd0);

x = nd_gb(m);

x = nd_gb(m,0);

fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n",

nd_found,nd_notfirst,nd_create);

x = nd_reduceall(m,x);

Line 1999 void nd_gr_trace(LIST f,LIST v,int m,int homo,struct o

Line 2160 void nd_gr_trace(LIST f,LIST v,int m,int homo,struct o

{

struct order_spec ord1;

VL fv,vv,vc;

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

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

DP a,b,c,h;

NDV *w;

P p;

int len,i,j;

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

nd_nvar = length(vv);

Line 2016 void nd_gr_trace(LIST f,LIST v,int m,int homo,struct o

Line 2176 void nd_gr_trace(LIST f,LIST v,int m,int homo,struct o

case 1: is_rlex = 0; break;

default: error("nd_gr : unsupported order");

}

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

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

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

if ( c ) {

dp_homo(c,&h); NEXTNODE(fd0,fd); BDY(fd) = (pointer)h;

NEXTNODE(in0,in); BDY(in) = (pointer)c;

}

if ( fd0 ) NEXT(fd) = 0;

if ( in0 ) NEXT(in) = 0;

initd(&ord1);

nd_nvar++;

nd_setup_trace(m,fd0);

x = nd_gb_trace(m);

/* dehomogenization */

for ( t = x; t; t = NEXT(t) )

ndv_dehomogenize((NDV)BDY(t));

nd_nvar--;

nd_setup_parameters();

initd(ord);

len = length(x);

w = (NDV *)ALLOCA(len*sizeof(NDV));

for ( i = 0, t = x; i < len; i++, t = NEXT(t) ) w[i] = BDY(t);

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

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

if ( w[i] && w[j] )

if ( ndl_reducible(HDL(w[i]),HDL(w[j])) ) w[i] = 0;

else if ( ndl_reducible(HDL(w[j]),HDL(w[i])) ) w[j] = 0;

}

for ( i = len-1, t0 = 0; i >= 0; i-- ) {

if ( w[i] ) { NEXTNODE(t0,t); BDY(t) = (pointer)w[i]; }

}

NEXT(t) = 0; x = t0;

} else {

switch ( ord->ord.simple ) {

case 0: is_rlex = 1; break;

Line 2061 void nd_gr_trace(LIST f,LIST v,int m,int homo,struct o

Line 2200 void nd_gr_trace(LIST f,LIST v,int m,int homo,struct o

}

if ( fd0 ) NEXT(fd) = 0;

/* setup over GF(m) */

in0 = fd0;

}

do {

nd_setup_trace(m,fd0);

x = nd_gb_trace(m);

cand = nd_gb_trace(m);

if ( !cand ) continue;

if ( homo ) {

/* dehomogenization */

for ( t = cand; t; t = NEXT(t) )

ndv_dehomogenize((NDV)BDY(t));

nd_nvar--;

nd_setup_parameters();

initd(ord);

cand = nd_reducebase(cand);

}

fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n",

nd_found,nd_notfirst,nd_create);

cand = nd_reduceall(0,cand);

initd(ord);

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

NEXTNODE(r0,r);

BDY(r) = (pointer)ndvtodp(0,(NDV)BDY(cand));

}

if ( r0 ) NEXT(r) = 0;

cand = r0;

} while ( !nd_check_candidate(in0,cand) );

/* dp->p */

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

dtop(CO,vv,BDY(r),&p);

BDY(r) = (pointer)p;

}

fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n",

MKLIST(*rp,cand);

nd_found,nd_notfirst,nd_create);

x = nd_reduceall(0,x);

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

NEXTNODE(r0,r);

a = ndvtodp(0,(NDV)BDY(x));

dtop(CO,vv,a,(P *)&BDY(r));

}

if ( r0 ) NEXT(r) = 0;

MKLIST(*rp,r0);

}

void dltondl(int n,DL dl,unsigned int *r)

Line 2944 int nd_equal(ND a,ND b)

Line 3101 int nd_equal(ND a,ND b)

}

if ( !ma && !mb ) return 1;

else return 0;

}

NODE nd_reducebase(NODE x)

{

int len,i,j;

NDV *w;

NODE t,t0;

len = length(x);

w = (NDV *)ALLOCA(len*sizeof(NDV));

for ( i = 0, t = x; i < len; i++, t = NEXT(t) ) w[i] = BDY(t);

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

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

if ( w[i] && w[j] )

if ( ndl_reducible(HDL(w[i]),HDL(w[j])) ) w[i] = 0;

else if ( ndl_reducible(HDL(w[j]),HDL(w[i])) ) w[j] = 0;

}

for ( i = len-1, t0 = 0; i >= 0; i-- ) {

if ( w[i] ) { NEXTNODE(t0,t); BDY(t) = (pointer)w[i]; }

}

NEXT(t) = 0; x = t0;

return x;

}

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