version 1.1, 2003/07/23 01:22:51 |
version 1.3, 2003/07/23 07:50:32 |
|
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.2 2003/07/23 01:23:34 noro Exp $ */ |
|
|
#include "ca.h" |
#include "ca.h" |
#include "inline.h" |
#include "inline.h" |
|
|
Line 22 typedef struct oND { |
|
Line 24 typedef struct oND { |
|
int sugar; |
int sugar; |
} *ND; |
} *ND; |
|
|
|
typedef struct oNDV { |
|
struct oNMV *body; |
|
int nv; |
|
int sugar; |
|
int len; |
|
} *NDV; |
|
|
typedef struct oNM { |
typedef struct oNM { |
struct oNM *next; |
struct oNM *next; |
int td; |
int td; |
Line 29 typedef struct oNM { |
|
Line 38 typedef struct oNM { |
|
unsigned int dl[1]; |
unsigned int dl[1]; |
} *NM; |
} *NM; |
|
|
|
typedef struct oNMV { |
|
int td; |
|
int c; |
|
unsigned int dl[1]; |
|
} *NMV; |
|
|
typedef struct oND_pairs { |
typedef struct oND_pairs { |
struct oND_pairs *next; |
struct oND_pairs *next; |
int i1,i2; |
int i1,i2; |
Line 37 typedef struct oND_pairs { |
|
Line 52 typedef struct oND_pairs { |
|
} *ND_pairs; |
} *ND_pairs; |
|
|
static ND *nd_ps; |
static ND *nd_ps; |
|
static NDV *nd_psv; |
static unsigned int **nd_bound; |
static unsigned int **nd_bound; |
int nd_mod,nd_nvar; |
int nd_mod,nd_nvar; |
int is_rlex; |
int is_rlex; |
Line 48 ND _nd_free_list; |
|
Line 64 ND _nd_free_list; |
|
ND_pairs _ndp_free_list; |
ND_pairs _ndp_free_list; |
NM *nd_red; |
NM *nd_red; |
int nd_red_len; |
int nd_red_len; |
|
int nmv_adv; |
|
int nmv_len; |
|
NDV ndv_red; |
|
|
extern int Top,Reverse; |
extern int Top,Reverse; |
int nd_psn,nd_pslen; |
int nd_psn,nd_pslen; |
Line 59 NODE append_one(NODE,int); |
|
Line 78 NODE append_one(NODE,int); |
|
#define HTD(d) ((d)->body->td) |
#define HTD(d) ((d)->body->td) |
#define HDL(d) ((d)->body->dl) |
#define HDL(d) ((d)->body->dl) |
#define HC(d) ((d)->body->c) |
#define HC(d) ((d)->body->c) |
|
#define NMV_ADV(m) (m = (NMV)(((char *)m)+nmv_adv)) |
|
|
#define NEWND_pairs(m) if(!_ndp_free_list)_NDP_alloc(); (m)=_ndp_free_list; _ndp_free_list = NEXT(_ndp_free_list) |
#define NEWND_pairs(m) if(!_ndp_free_list)_NDP_alloc(); (m)=_ndp_free_list; _ndp_free_list = NEXT(_ndp_free_list) |
#define NEWNM(m) if(!_nm_free_list)_NM_alloc(); (m)=_nm_free_list; _nm_free_list = NEXT(_nm_free_list) |
#define NEWNM(m) if(!_nm_free_list)_NM_alloc(); (m)=_nm_free_list; _nm_free_list = NEXT(_nm_free_list) |
#define MKND(n,m,d) if(!_nd_free_list)_ND_alloc(); (d)=_nd_free_list; _nd_free_list = (ND)BDY(_nd_free_list); (d)->nv=(n); BDY(d)=(m) |
#define MKND(n,m,d) if(!_nd_free_list)_ND_alloc(); (d)=_nd_free_list; _nd_free_list = (ND)BDY(_nd_free_list); (d)->nv=(n); BDY(d)=(m) |
|
|
|
#define NEWNDV(d) ((d)=(NDV)MALLOC(sizeof(struct oNDV))) |
|
#define MKNDV(n,m,l,d) NEWNDV(d); (d)->nv=(n); BDY(d)=(m); (d)->len = l; |
|
|
#define NEXTNM(r,c) \ |
#define NEXTNM(r,c) \ |
if(!(r)){NEWNM(r);(c)=(r);}else{NEWNM(NEXT(c));(c)=NEXT(c);} |
if(!(r)){NEWNM(r);(c)=(r);}else{NEWNM(NEXT(c));(c)=NEXT(c);} |
#define NEXTNM2(r,c,s) \ |
#define NEXTNM2(r,c,s) \ |
Line 93 void _NM_alloc(); |
|
Line 116 void _NM_alloc(); |
|
void _ND_alloc(); |
void _ND_alloc(); |
int ndl_td(unsigned int *d); |
int ndl_td(unsigned int *d); |
ND nd_add(ND p1,ND p2); |
ND nd_add(ND p1,ND p2); |
|
ND ndv_add(ND p1,NDV p2); |
ND nd_mul_nm(ND p,NM m0); |
ND nd_mul_nm(ND p,NM m0); |
ND nd_mul_term(ND p,int td,unsigned int *d); |
ND nd_mul_term(ND p,int td,unsigned int *d); |
int nd_sp(ND_pairs p,ND *nf); |
int nd_sp(ND_pairs p,ND *nf); |
int nd_find_reducer(ND g,ND *red); |
int nd_find_reducer(ND g,ND *red); |
|
int ndv_find_reducer(ND g,NDV red); |
int nd_nf(ND g,int full,ND *nf); |
int nd_nf(ND g,int full,ND *nf); |
ND nd_reduce(ND p1,ND p2); |
ND nd_reduce(ND p1,ND p2); |
ND nd_reduce_special(ND p1,ND p2); |
ND nd_reduce_special(ND p1,ND p2); |
Line 114 ND_pairs nd_reconstruct(ND_pairs); |
|
Line 139 ND_pairs nd_reconstruct(ND_pairs); |
|
void nd_setup_parameters(); |
void nd_setup_parameters(); |
ND nd_dup(ND p,int obpe); |
ND nd_dup(ND p,int obpe); |
void ndl_dup(int obpe,unsigned int *d,unsigned int *r); |
void ndl_dup(int obpe,unsigned int *d,unsigned int *r); |
|
NDV ndtondv(ND p); |
|
void ndv_mul_nm(NDV pv,NM m,NDV r); |
|
|
void nd_free_private_storage() |
void nd_free_private_storage() |
{ |
{ |
Line 520 ND nd_reduce(ND p1,ND p2) |
|
Line 547 ND nd_reduce(ND p1,ND p2) |
|
} |
} |
} |
} |
|
|
|
ND ndv_add(ND p1,NDV p2) |
|
{ |
|
int c,c1,c2,t,td,td2,mul,len,i; |
|
NM prev,head,cur,new; |
|
unsigned int *d; |
|
NMV m2; |
|
|
|
if ( !p1 ) |
|
return 0; |
|
else { |
|
prev = 0; head = cur = BDY(p1); |
|
NEWNM(new); |
|
len = p2->len; |
|
for ( m2 = BDY(p2), i = 0; i < len; ) { |
|
td2 = new->td = m2->td; |
|
if ( !cur ) { |
|
C(new) = C(m2); |
|
bcopy(m2->dl,new->dl,nd_wpd*sizeof(unsigned int)); |
|
if ( !prev ) { |
|
prev = new; |
|
NEXT(prev) = 0; |
|
head = prev; |
|
} else { |
|
NEXT(prev) = new; |
|
NEXT(new) = 0; |
|
prev = new; |
|
} |
|
NMV_ADV(m2); i++; |
|
NEWNM(new); |
|
continue; |
|
} |
|
if ( cur->td > td2 ) |
|
c = 1; |
|
else if ( cur->td < td2 ) |
|
c = -1; |
|
else |
|
c = ndl_compare(cur->dl,m2->dl); |
|
switch ( c ) { |
|
case 0: |
|
t = C(m2)+C(cur)-nd_mod; |
|
if ( t < 0 ) |
|
t += nd_mod; |
|
if ( t ) |
|
C(cur) = t; |
|
else if ( !prev ) { |
|
head = NEXT(cur); |
|
FREENM(cur); |
|
cur = head; |
|
} else { |
|
NEXT(prev) = NEXT(cur); |
|
FREENM(cur); |
|
cur = NEXT(prev); |
|
} |
|
NMV_ADV(m2); i++; |
|
break; |
|
case 1: |
|
prev = cur; |
|
cur = NEXT(cur); |
|
break; |
|
case -1: |
|
if ( !prev ) { |
|
/* cur = head */ |
|
prev = new; |
|
bcopy(m2->dl,new->dl,nd_wpd*sizeof(unsigned int)); |
|
C(prev) = C(m2); |
|
NEXT(prev) = head; |
|
head = prev; |
|
} else { |
|
C(new) = C(m2); |
|
bcopy(m2->dl,new->dl,nd_wpd*sizeof(unsigned int)); |
|
NEXT(prev) = new; |
|
NEXT(new) = cur; |
|
prev = new; |
|
} |
|
NEWNM(new); |
|
NMV_ADV(m2); i++; |
|
break; |
|
} |
|
} |
|
FREENM(new); |
|
if ( head ) { |
|
BDY(p1) = head; |
|
p1->sugar = MAX(p1->sugar,p2->sugar+td); |
|
return p1; |
|
} else { |
|
FREEND(p1); |
|
return 0; |
|
} |
|
|
|
} |
|
} |
|
|
/* HDL(p1) = HDL(p2) */ |
/* HDL(p1) = HDL(p2) */ |
|
|
ND nd_reduce_special(ND p1,ND p2) |
ND nd_reduce_special(ND p1,ND p2) |
|
|
return 1; |
return 1; |
} |
} |
|
|
|
int ndv_find_reducer(ND g, NDV red) |
|
{ |
|
NM m; |
|
ND r,p; |
|
int i,c1,c2,c; |
|
int d,k,append,index; |
|
unsigned int *check; |
|
NM t; |
|
NDV pv; |
|
|
|
d = ndl_hash_value(HTD(g),HDL(g)); |
|
for ( m = nd_red[d], k = 0; m; m = NEXT(m), k++ ) { |
|
if ( HTD(g) == m->td && ndl_equal(HDL(g),m->dl) ) { |
|
if ( k > 0 ) nd_notfirst++; |
|
index = m->c; |
|
append = 0; |
|
nd_found++; |
|
goto found; |
|
} |
|
} |
|
|
|
for ( i = 0; i < nd_psn; i++ ) { |
|
p = nd_ps[i]; |
|
if ( HTD(g) >= HTD(p) && ndl_reducible(HDL(g),HDL(p)) ) { |
|
index = i; |
|
append = 1; |
|
nd_create++; |
|
goto found; |
|
} |
|
} |
|
return 0; |
|
|
|
found: |
|
NEWNM(m); |
|
p = nd_ps[index]; |
|
pv = nd_psv[index]; |
|
ndl_sub(HDL(g),HDL(p),m->dl); |
|
|
|
check = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
|
ndl_add(nd_bound[index],m->dl,check); |
|
if ( ndl_check_bound(check) ) { |
|
FREENM(m); |
|
return -1; |
|
} |
|
|
|
c1 = invm(HC(p),nd_mod); |
|
c2 = nd_mod-HC(g); |
|
DMAR(c1,c2,0,nd_mod,c); |
|
C(m) = c; |
|
m->td = HTD(g)-HTD(p); |
|
NEXT(m) = 0; |
|
ndv_mul_nm(pv,m,red); |
|
FREENM(m); |
|
|
|
if ( append ) nd_append_red(HDL(g),HTD(g),i); |
|
return 1; |
|
} |
|
|
ND nd_find_monic_reducer(ND g) |
ND nd_find_monic_reducer(ND g) |
{ |
{ |
int *d; |
int *d; |
Line 833 ND nd_mul_nm(ND p,NM m0) |
|
Line 1010 ND nd_mul_nm(ND p,NM m0) |
|
} |
} |
} |
} |
|
|
|
void ndv_mul_nm(NDV p,NM m0,NDV r) |
|
{ |
|
NMV m,mr,mr0; |
|
unsigned int *d,*dt,*dm; |
|
int c,n,td,i,c1,c2,len; |
|
|
|
if ( !p ) |
|
/* XXX */ |
|
r->len = 0; |
|
else { |
|
n = NV(p); m = BDY(p); len = p->len; |
|
d = m0->dl; td = m0->td; c = C(m0); |
|
mr = BDY(r); |
|
for ( i = 0; i < len; i++, NMV_ADV(m), NMV_ADV(mr) ) { |
|
c1 = C(m); |
|
DMAR(c1,c,0,nd_mod,c2); |
|
C(mr) = c2; |
|
mr->td = m->td+td; |
|
ndl_add(m->dl,d,mr->dl); |
|
} |
|
NV(r) = NV(p); |
|
r->len = p->len; |
|
r->sugar = p->sugar + td; |
|
} |
|
} |
|
|
ND nd_mul_term(ND p,int td,unsigned int *d) |
ND nd_mul_term(ND p,int td,unsigned int *d) |
{ |
{ |
NM m,mr,mr0; |
NM m,mr,mr0; |
Line 860 ND nd_mul_term(ND p,int td,unsigned int *d) |
|
Line 1063 ND nd_mul_term(ND p,int td,unsigned int *d) |
|
/* ret=1 : success, ret=0 : overflow */ |
/* ret=1 : success, ret=0 : overflow */ |
int nd_nf(ND g,int full,ND *rp) |
int nd_nf(ND g,int full,ND *rp) |
{ |
{ |
ND p,d,red; |
ND p,d; |
NM m,mrd,tail; |
NM m,mrd,tail; |
int n,sugar,psugar,stat; |
int n,sugar,psugar,stat; |
|
NDV red; |
|
|
if ( !g ) { |
if ( !g ) { |
*rp = 0; |
*rp = 0; |
Line 872 int nd_nf(ND g,int full,ND *rp) |
|
Line 1076 int nd_nf(ND g,int full,ND *rp) |
|
n = NV(g); |
n = NV(g); |
for ( d = 0; g; ) { |
for ( d = 0; g; ) { |
/* stat=1 : found, stat=0 : not found, stat=-1 : overflow */ |
/* stat=1 : found, stat=0 : not found, stat=-1 : overflow */ |
|
#if 0 |
stat = nd_find_reducer(g,&red); |
stat = nd_find_reducer(g,&red); |
|
#else |
|
stat = ndv_find_reducer(g,ndv_red); |
|
#endif |
if ( stat == 1 ) { |
if ( stat == 1 ) { |
#if 1 |
#if 0 |
g = nd_add(g,red); |
g = nd_add(g,red); |
sugar = MAX(sugar,red->sugar); |
|
#else |
#else |
psugar = (HTD(g)-HTD(red))+red->sugar; |
g = ndv_add(g,ndv_red); |
g = nd_reduce(g,red); |
|
sugar = MAX(sugar,psugar); |
|
#endif |
#endif |
|
sugar = MAX(sugar,ndv_red->sugar); |
} else if ( stat == -1 ) { |
} else if ( stat == -1 ) { |
nd_free(g); |
nd_free(g); |
nd_free(d); |
nd_free(d); |
|
|
|
|
int nd_newps(ND a) |
int nd_newps(ND a) |
{ |
{ |
|
int len; |
|
|
if ( nd_psn == nd_pslen ) { |
if ( nd_psn == nd_pslen ) { |
nd_pslen *= 2; |
nd_pslen *= 2; |
nd_ps = (ND *)REALLOC((char *)nd_ps,nd_pslen*sizeof(ND)); |
nd_ps = (ND *)REALLOC((char *)nd_ps,nd_pslen*sizeof(ND)); |
|
nd_psv = (NDV *)REALLOC((char *)nd_psv,nd_pslen*sizeof(NDV)); |
nd_bound = (unsigned int **) |
nd_bound = (unsigned int **) |
REALLOC((char *)nd_bound,nd_pslen*sizeof(unsigned int *)); |
REALLOC((char *)nd_bound,nd_pslen*sizeof(unsigned int *)); |
} |
} |
nd_monic(a); |
nd_monic(a); |
nd_ps[nd_psn] = a; |
nd_ps[nd_psn] = a; |
|
nd_psv[nd_psn] = ndtondv(a); |
nd_bound[nd_psn] = nd_compute_bound(a); |
nd_bound[nd_psn] = nd_compute_bound(a); |
|
len = nd_psv[nd_psn]->len; |
|
if ( len > nmv_len ) { |
|
nmv_len = 2*len; |
|
BDY(ndv_red) = (NMV)REALLOC(BDY(ndv_red),nmv_len*nmv_adv); |
|
} |
return nd_psn++; |
return nd_psn++; |
} |
} |
|
|
|
|
|
|
NODE nd_setup(NODE f) |
NODE nd_setup(NODE f) |
{ |
{ |
int i,td; |
int i,td,len; |
NODE s,s0,f0; |
NODE s,s0,f0; |
|
|
nd_found = 0; |
nd_found = 0; |
Line 1428 NODE nd_setup(NODE f) |
|
Line 1643 NODE nd_setup(NODE f) |
|
#endif |
#endif |
nd_psn = length(f); nd_pslen = 2*nd_psn; |
nd_psn = length(f); nd_pslen = 2*nd_psn; |
nd_ps = (ND *)MALLOC(nd_pslen*sizeof(ND)); |
nd_ps = (ND *)MALLOC(nd_pslen*sizeof(ND)); |
|
nd_psv = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
nd_bound = (unsigned int **)MALLOC(nd_pslen*sizeof(unsigned int *)); |
nd_bound = (unsigned int **)MALLOC(nd_pslen*sizeof(unsigned int *)); |
nd_bpe = 4; |
nd_bpe = 4; |
nd_setup_parameters(); |
nd_setup_parameters(); |
nd_free_private_storage(); |
nd_free_private_storage(); |
|
len = 0; |
for ( i = 0; i < nd_psn; i++, f = NEXT(f) ) { |
for ( i = 0; i < nd_psn; i++, f = NEXT(f) ) { |
nd_ps[i] = dptond((DP)BDY(f)); |
nd_ps[i] = dptond((DP)BDY(f)); |
|
nd_psv[i] = ndtondv(nd_ps[i]); |
nd_monic(nd_ps[i]); |
nd_monic(nd_ps[i]); |
nd_bound[i] = nd_compute_bound(nd_ps[i]); |
nd_bound[i] = nd_compute_bound(nd_ps[i]); |
|
len = MAX(len,nd_psv[i]->len); |
} |
} |
nd_red = (NM *)MALLOC(REDTAB_LEN*sizeof(NM)); |
nd_red = (NM *)MALLOC(REDTAB_LEN*sizeof(NM)); |
|
nmv_len = 16*len; |
|
NEWNDV(ndv_red); |
|
BDY(ndv_red) = (NMV)MALLOC_ATOMIC(nmv_len*nmv_adv); |
for ( s0 = 0, i = 0; i < nd_psn; i++ ) { |
for ( s0 = 0, i = 0; i < nd_psn; i++ ) { |
NEXTNODE(s0,s); BDY(s) = (pointer)i; |
NEXTNODE(s0,s); BDY(s) = (pointer)i; |
} |
} |
Line 1704 void nd_setup_parameters() { |
|
Line 1926 void nd_setup_parameters() { |
|
nd_mask[nd_epw-i-1] = (nd_mask0<<(i*nd_bpe)); |
nd_mask[nd_epw-i-1] = (nd_mask0<<(i*nd_bpe)); |
nd_mask1 |= (1<<(nd_bpe-1))<<(i*nd_bpe); |
nd_mask1 |= (1<<(nd_bpe-1))<<(i*nd_bpe); |
} |
} |
|
nmv_adv = sizeof(struct oNMV)+(nd_wpd-1)*sizeof(unsigned int); |
} |
} |
|
|
ND_pairs nd_reconstruct(ND_pairs d) |
ND_pairs nd_reconstruct(ND_pairs d) |
Line 1726 ND_pairs nd_reconstruct(ND_pairs d) |
|
Line 1949 ND_pairs nd_reconstruct(ND_pairs d) |
|
_ndp_free_list = 0; |
_ndp_free_list = 0; |
for ( i = 0; i < nd_psn; i++ ) { |
for ( i = 0; i < nd_psn; i++ ) { |
nd_ps[i] = nd_dup(nd_ps[i],obpe); |
nd_ps[i] = nd_dup(nd_ps[i],obpe); |
|
nd_psv[i] = ndtondv(nd_ps[i]); |
nd_bound[i] = nd_compute_bound(nd_ps[i]); |
nd_bound[i] = nd_compute_bound(nd_ps[i]); |
} |
} |
s0 = 0; |
s0 = 0; |
Line 1740 ND_pairs nd_reconstruct(ND_pairs d) |
|
Line 1964 ND_pairs nd_reconstruct(ND_pairs d) |
|
if ( s0 ) NEXT(s) = 0; |
if ( s0 ) NEXT(s) = 0; |
prev_nm_free_list = 0; |
prev_nm_free_list = 0; |
prev_ndp_free_list = 0; |
prev_ndp_free_list = 0; |
|
BDY(ndv_red) = (NMV)REALLOC(BDY(ndv_red),nmv_len*nmv_adv); |
GC_gcollect(); |
GC_gcollect(); |
return s0; |
return s0; |
} |
} |
Line 1788 ND nd_dup(ND p,int obpe) |
|
Line 2013 ND nd_dup(ND p,int obpe) |
|
return r; |
return r; |
} |
} |
} |
} |
|
|
|
NDV ndtondv(ND p) |
|
{ |
|
NDV d; |
|
NMV m,m0; |
|
NM t; |
|
int i,len; |
|
|
|
if ( !p ) |
|
return 0; |
|
len = nd_length(p); |
|
m0 = m = (NMV)MALLOC_ATOMIC(len*nmv_adv); |
|
for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, NMV_ADV(m) ) { |
|
m->td = t->td; |
|
bcopy(t->dl,m->dl,nd_wpd*sizeof(unsigned int)); |
|
m->c = t->c; |
|
} |
|
MKNDV(NV(p),m0,len,d); |
|
d->sugar = p->sugar; |
|
return d; |
|
} |
|
|
|
void ndv_print(NDV p) |
|
{ |
|
NMV m; |
|
int i,len; |
|
|
|
if ( !p ) |
|
printf("0\n"); |
|
else { |
|
len = p->len; |
|
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
|
printf("+%d*",m->c); |
|
ndl_print(m->dl); |
|
} |
|
printf("\n"); |
|
} |
|
} |
|
|