version 1.13, 2003/07/30 00:55:41 |
version 1.14, 2003/07/30 07:57:45 |
|
|
/* $OpenXM$ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.13 2003/07/30 00:55:41 noro Exp $ */ |
|
|
#include "ca.h" |
#include "ca.h" |
#include "inline.h" |
#include "inline.h" |
Line 35 typedef struct oNDV { |
|
Line 35 typedef struct oNDV { |
|
|
|
typedef struct oNM { |
typedef struct oNM { |
struct oNM *next; |
struct oNM *next; |
int c; |
union { |
|
int m; |
|
Q z; |
|
} c; |
int td; |
int td; |
unsigned int dl[1]; |
unsigned int dl[1]; |
} *NM; |
} *NM; |
|
|
typedef struct oNMV { |
typedef struct oNMV { |
int c; |
union { |
|
int m; |
|
Q z; |
|
} c; |
int td; |
int td; |
unsigned int dl[1]; |
unsigned int dl[1]; |
} *NMV; |
} *NMV; |
Line 85 NODE append_one(NODE,int); |
|
Line 91 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 HCM(d) ((d)->body->c.m) |
|
#define CM(a) ((a)->c.m) |
|
#define DL(a) ((a)->dl) |
|
#define TD(a) ((a)->td) |
|
#define SG(a) ((a)->sugar) |
|
#define LEN(a) ((a)->len) |
|
|
#define NEWRHist(r) ((r)=(RHist)MALLOC(sizeof(struct oRHist))) |
#define NEWRHist(r) ((r)=(RHist)MALLOC(sizeof(struct oRHist))) |
#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) |
Line 153 static NDV *nd_ps; |
|
Line 164 static NDV *nd_ps; |
|
|
|
#define NMV_ADV(m) (m = (NMV)(((char *)m)+nmv_adv)) |
#define NMV_ADV(m) (m = (NMV)(((char *)m)+nmv_adv)) |
#define NEWNDV(d) ((d)=(NDV)MALLOC(sizeof(struct oNDV))) |
#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 MKNDV(n,m,l,d) NEWNDV(d); NV(d)=(n); BDY(d)=(m); LEN(d) = l; |
|
|
int nmv_adv; |
int nmv_adv; |
int nmv_len; |
int nmv_len; |
Line 536 ND nd_reduce(ND p1,ND p2) |
|
Line 547 ND nd_reduce(ND p1,ND p2) |
|
if ( !p1 ) |
if ( !p1 ) |
return 0; |
return 0; |
else { |
else { |
c2 = invm(HC(p2),nd_mod); |
c2 = invm(HCM(p2),nd_mod); |
c1 = nd_mod-HC(p1); |
c1 = nd_mod-HCM(p1); |
DMAR(c1,c2,0,nd_mod,mul); |
DMAR(c1,c2,0,nd_mod,mul); |
td = HTD(p1)-HTD(p2); |
td = HTD(p1)-HTD(p2); |
d = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
d = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
Line 545 ND nd_reduce(ND p1,ND p2) |
|
Line 556 ND nd_reduce(ND p1,ND p2) |
|
prev = 0; head = cur = BDY(p1); |
prev = 0; head = cur = BDY(p1); |
NEWNM(new); |
NEWNM(new); |
for ( m2 = BDY(p2); m2; ) { |
for ( m2 = BDY(p2); m2; ) { |
td2 = new->td = m2->td+td; |
td2 = TD(new) = TD(m2)+td; |
ndl_add(m2->dl,d,new->dl); |
ndl_add(DL(m2),d,DL(new)); |
if ( !cur ) { |
if ( !cur ) { |
c1 = C(m2); |
c1 = CM(m2); |
DMAR(c1,mul,0,nd_mod,c2); |
DMAR(c1,mul,0,nd_mod,c2); |
C(new) = c2; |
CM(new) = c2; |
if ( !prev ) { |
if ( !prev ) { |
prev = new; |
prev = new; |
NEXT(prev) = 0; |
NEXT(prev) = 0; |
Line 564 ND nd_reduce(ND p1,ND p2) |
|
Line 575 ND nd_reduce(ND p1,ND p2) |
|
NEWNM(new); |
NEWNM(new); |
continue; |
continue; |
} |
} |
if ( cur->td > td2 ) |
if ( TD(cur) > td2 ) |
c = 1; |
c = 1; |
else if ( cur->td < td2 ) |
else if ( TD(cur) < td2 ) |
c = -1; |
c = -1; |
else |
else |
c = ndl_compare(cur->dl,new->dl); |
c = ndl_compare(DL(cur),DL(new)); |
switch ( c ) { |
switch ( c ) { |
case 0: |
case 0: |
c2 = C(m2); |
c2 = CM(m2); |
c1 = C(cur); |
c1 = CM(cur); |
DMAR(c2,mul,c1,nd_mod,t); |
DMAR(c2,mul,c1,nd_mod,t); |
if ( t ) |
if ( t ) |
C(cur) = t; |
CM(cur) = t; |
else if ( !prev ) { |
else if ( !prev ) { |
head = NEXT(cur); |
head = NEXT(cur); |
FREENM(cur); |
FREENM(cur); |
Line 596 ND nd_reduce(ND p1,ND p2) |
|
Line 607 ND nd_reduce(ND p1,ND p2) |
|
if ( !prev ) { |
if ( !prev ) { |
/* cur = head */ |
/* cur = head */ |
prev = new; |
prev = new; |
c2 = C(m2); |
c2 = CM(m2); |
DMAR(c2,mul,0,nd_mod,c1); |
DMAR(c2,mul,0,nd_mod,c1); |
C(prev) = c1; |
CM(prev) = c1; |
NEXT(prev) = head; |
NEXT(prev) = head; |
head = prev; |
head = prev; |
} else { |
} else { |
c2 = C(m2); |
c2 = CM(m2); |
DMAR(c2,mul,0,nd_mod,c1); |
DMAR(c2,mul,0,nd_mod,c1); |
C(new) = c1; |
CM(new) = c1; |
NEXT(prev) = new; |
NEXT(prev) = new; |
NEXT(new) = cur; |
NEXT(new) = cur; |
prev = new; |
prev = new; |
Line 617 ND nd_reduce(ND p1,ND p2) |
|
Line 628 ND nd_reduce(ND p1,ND p2) |
|
FREENM(new); |
FREENM(new); |
if ( head ) { |
if ( head ) { |
BDY(p1) = head; |
BDY(p1) = head; |
p1->sugar = MAX(p1->sugar,p2->sugar+td); |
SG(p1) = MAX(SG(p1),SG(p2)+td); |
return p1; |
return p1; |
} else { |
} else { |
FREEND(p1); |
FREEND(p1); |
Line 637 ND nd_reduce_special(ND p1,ND p2) |
|
Line 648 ND nd_reduce_special(ND p1,ND p2) |
|
if ( !p1 ) |
if ( !p1 ) |
return 0; |
return 0; |
else { |
else { |
c2 = invm(HC(p2),nd_mod); |
c2 = invm(HCM(p2),nd_mod); |
c1 = nd_mod-HC(p1); |
c1 = nd_mod-HCM(p1); |
DMAR(c1,c2,0,nd_mod,mul); |
DMAR(c1,c2,0,nd_mod,mul); |
prev = 0; head = cur = BDY(p1); |
prev = 0; head = cur = BDY(p1); |
NEWNM(new); |
NEWNM(new); |
for ( m2 = BDY(p2); m2; ) { |
for ( m2 = BDY(p2); m2; ) { |
td2 = new->td = m2->td; |
td2 = TD(new) = TD(m2); |
if ( !cur ) { |
if ( !cur ) { |
c1 = C(m2); |
c1 = CM(m2); |
DMAR(c1,mul,0,nd_mod,c2); |
DMAR(c1,mul,0,nd_mod,c2); |
C(new) = c2; |
CM(new) = c2; |
bcopy(m2->dl,new->dl,nd_wpd*sizeof(unsigned int)); |
bcopy(DL(m2),DL(new),nd_wpd*sizeof(unsigned int)); |
if ( !prev ) { |
if ( !prev ) { |
prev = new; |
prev = new; |
NEXT(prev) = 0; |
NEXT(prev) = 0; |
Line 662 ND nd_reduce_special(ND p1,ND p2) |
|
Line 673 ND nd_reduce_special(ND p1,ND p2) |
|
NEWNM(new); |
NEWNM(new); |
continue; |
continue; |
} |
} |
if ( cur->td > td2 ) |
if ( TD(cur) > td2 ) |
c = 1; |
c = 1; |
else if ( cur->td < td2 ) |
else if ( TD(cur) < td2 ) |
c = -1; |
c = -1; |
else |
else |
c = ndl_compare(cur->dl,m2->dl); |
c = ndl_compare(DL(cur),DL(m2)); |
switch ( c ) { |
switch ( c ) { |
case 0: |
case 0: |
c2 = C(m2); |
c2 = CM(m2); |
c1 = C(cur); |
c1 = CM(cur); |
DMAR(c2,mul,c1,nd_mod,t); |
DMAR(c2,mul,c1,nd_mod,t); |
if ( t ) |
if ( t ) |
C(cur) = t; |
CM(cur) = t; |
else if ( !prev ) { |
else if ( !prev ) { |
head = NEXT(cur); |
head = NEXT(cur); |
FREENM(cur); |
FREENM(cur); |
Line 691 ND nd_reduce_special(ND p1,ND p2) |
|
Line 702 ND nd_reduce_special(ND p1,ND p2) |
|
cur = NEXT(cur); |
cur = NEXT(cur); |
break; |
break; |
case -1: |
case -1: |
bcopy(m2->dl,new->dl,nd_wpd*sizeof(unsigned int)); |
bcopy(DL(m2),DL(new),nd_wpd*sizeof(unsigned int)); |
if ( !prev ) { |
if ( !prev ) { |
/* cur = head */ |
/* cur = head */ |
prev = new; |
prev = new; |
c2 = C(m2); |
c2 = CM(m2); |
DMAR(c2,mul,0,nd_mod,c1); |
DMAR(c2,mul,0,nd_mod,c1); |
C(prev) = c1; |
CM(prev) = c1; |
NEXT(prev) = head; |
NEXT(prev) = head; |
head = prev; |
head = prev; |
} else { |
} else { |
c2 = C(m2); |
c2 = CM(m2); |
DMAR(c2,mul,0,nd_mod,c1); |
DMAR(c2,mul,0,nd_mod,c1); |
C(new) = c1; |
CM(new) = c1; |
NEXT(prev) = new; |
NEXT(prev) = new; |
NEXT(new) = cur; |
NEXT(new) = cur; |
prev = new; |
prev = new; |
Line 716 ND nd_reduce_special(ND p1,ND p2) |
|
Line 727 ND nd_reduce_special(ND p1,ND p2) |
|
FREENM(new); |
FREENM(new); |
if ( head ) { |
if ( head ) { |
BDY(p1) = head; |
BDY(p1) = head; |
p1->sugar = MAX(p1->sugar,p2->sugar+td); |
SG(p1)= MAX(SG(p1),SG(p2)+td); |
return p1; |
return p1; |
} else { |
} else { |
FREEND(p1); |
FREEND(p1); |
Line 813 INLINE int nd_find_reducer(ND g) |
|
Line 824 INLINE int nd_find_reducer(ND g) |
|
|
|
d = ndl_hash_value(HTD(g),HDL(g)); |
d = ndl_hash_value(HTD(g),HDL(g)); |
for ( r = nd_red[d], k = 0; r; r = NEXT(r), k++ ) { |
for ( r = nd_red[d], k = 0; r; r = NEXT(r), k++ ) { |
if ( HTD(g) == r->td && ndl_equal(HDL(g),r->dl) ) { |
if ( HTD(g) == TD(r) && ndl_equal(HDL(g),DL(r)) ) { |
if ( k > 0 ) nd_notfirst++; |
if ( k > 0 ) nd_notfirst++; |
nd_found++; |
nd_found++; |
return r->index; |
return r->index; |
Line 823 INLINE int nd_find_reducer(ND g) |
|
Line 834 INLINE int nd_find_reducer(ND g) |
|
if ( Reverse ) |
if ( Reverse ) |
for ( i = nd_psn-1; i >= 0; i-- ) { |
for ( i = nd_psn-1; i >= 0; i-- ) { |
r = nd_psh[i]; |
r = nd_psh[i]; |
if ( HTD(g) >= r->td && ndl_reducible(HDL(g),r->dl) ) { |
if ( HTD(g) >= TD(r) && ndl_reducible(HDL(g),DL(r)) ) { |
nd_create++; |
nd_create++; |
nd_append_red(HDL(g),HTD(g),i); |
nd_append_red(HDL(g),HTD(g),i); |
return i; |
return i; |
Line 832 INLINE int nd_find_reducer(ND g) |
|
Line 843 INLINE int nd_find_reducer(ND g) |
|
else |
else |
for ( i = 0; i < nd_psn; i++ ) { |
for ( i = 0; i < nd_psn; i++ ) { |
r = nd_psh[i]; |
r = nd_psh[i]; |
if ( HTD(g) >= r->td && ndl_reducible(HDL(g),r->dl) ) { |
if ( HTD(g) >= TD(r) && ndl_reducible(HDL(g),DL(r)) ) { |
nd_create++; |
nd_create++; |
nd_append_red(HDL(g),HTD(g),i); |
nd_append_red(HDL(g),HTD(g),i); |
return i; |
return i; |
Line 854 ND nd_add(ND p1,ND p2) |
|
Line 865 ND nd_add(ND p1,ND p2) |
|
return p1; |
return p1; |
else { |
else { |
for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) { |
for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) { |
if ( m1->td > m2->td ) |
if ( TD(m1) > TD(m2) ) |
c = 1; |
c = 1; |
else if ( m1->td < m2->td ) |
else if ( TD(m1) < TD(m2) ) |
c = -1; |
c = -1; |
else |
else |
c = ndl_compare(m1->dl,m2->dl); |
c = ndl_compare(DL(m1),DL(m2)); |
switch ( c ) { |
switch ( c ) { |
case 0: |
case 0: |
t = ((C(m1))+(C(m2))) - nd_mod; |
t = ((CM(m1))+(CM(m2))) - nd_mod; |
if ( t < 0 ) |
if ( t < 0 ) |
t += nd_mod; |
t += nd_mod; |
s = m1; m1 = NEXT(m1); |
s = m1; m1 = NEXT(m1); |
if ( t ) { |
if ( t ) { |
NEXTNM2(mr0,mr,s); C(mr) = (t); |
NEXTNM2(mr0,mr,s); CM(mr) = (t); |
} else { |
} else { |
FREENM(s); |
FREENM(s); |
} |
} |
Line 895 ND nd_add(ND p1,ND p2) |
|
Line 906 ND nd_add(ND p1,ND p2) |
|
else |
else |
NEXT(mr) = 0; |
NEXT(mr) = 0; |
BDY(p1) = mr0; |
BDY(p1) = mr0; |
p1->sugar = MAX(p1->sugar,p2->sugar); |
SG(p1) = MAX(SG(p1),SG(p2)); |
FREEND(p2); |
FREEND(p2); |
return p1; |
return p1; |
} |
} |
Line 920 int nd_nf(ND g,int full,ND *rp) |
|
Line 931 int nd_nf(ND g,int full,ND *rp) |
|
*rp = 0; |
*rp = 0; |
return 1; |
return 1; |
} |
} |
sugar0 = sugar = g->sugar; |
sugar0 = sugar = SG(g); |
n = NV(g); |
n = NV(g); |
mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int)); |
mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int)); |
for ( d = 0; g; ) { |
for ( d = 0; g; ) { |
index = nd_find_reducer(g); |
index = nd_find_reducer(g); |
if ( index >= 0 ) { |
if ( index >= 0 ) { |
p = nd_ps[index]; |
p = nd_ps[index]; |
ndl_sub(HDL(g),HDL(p),mul->dl); |
ndl_sub(HDL(g),HDL(p),DL(mul)); |
mul->td = HTD(g)-HTD(p); |
TD(mul) = HTD(g)-HTD(p); |
#if 0 |
#if 0 |
if ( d && (p->sugar+mul->td) > sugar ) { |
if ( d && (SG(p)+TD(mul)) > sugar ) { |
goto afo; |
goto afo; |
} |
} |
#endif |
#endif |
if ( ndl_check_bound2(index,mul->dl) ) { |
if ( ndl_check_bound2(index,DL(mul)) ) { |
nd_free(g); nd_free(d); |
nd_free(g); nd_free(d); |
return 0; |
return 0; |
} |
} |
c1 = invm(HC(p),nd_mod); c2 = nd_mod-HC(g); |
c1 = invm(HCM(p),nd_mod); c2 = nd_mod-HCM(g); |
DMAR(c1,c2,0,nd_mod,c); C(mul) = c; |
DMAR(c1,c2,0,nd_mod,c); CM(mul) = c; |
#if USE_NDV |
#if USE_NDV |
ndv_mul_nm(nd_ps[index],mul,ndv_red); |
ndv_mul_nm(nd_ps[index],mul,ndv_red); |
g = ndv_add(g,ndv_red); |
g = ndv_add(g,ndv_red); |
sugar = MAX(sugar,ndv_red->sugar); |
sugar = MAX(sugar,SG(ndv_red)); |
#else |
#else |
red = nd_mul_ind_nm(index,mul); |
red = nd_mul_ind_nm(index,mul); |
g = nd_add(g,red); |
g = nd_add(g,red); |
sugar = MAX(sugar,red->sugar); |
sugar = MAX(sugar,SG(red)); |
#endif |
#endif |
} else if ( !full ) { |
} else if ( !full ) { |
*rp = g; |
*rp = g; |
|
|
} |
} |
} |
} |
if ( d ) |
if ( d ) |
d->sugar = sugar; |
SG(d) = sugar; |
*rp = d; |
*rp = d; |
return 1; |
return 1; |
} |
} |
Line 1031 int head_pbucket(PGeoBucket g) |
|
Line 1042 int head_pbucket(PGeoBucket g) |
|
j = i; |
j = i; |
gj = g->body[j]; |
gj = g->body[j]; |
dj = HDL(gj); |
dj = HDL(gj); |
sum = HC(gj); |
sum = HCM(gj); |
} else { |
} else { |
di = HDL(gi); |
di = HDL(gi); |
nv = NV(gi); |
nv = NV(gi); |
Line 1043 int head_pbucket(PGeoBucket g) |
|
Line 1054 int head_pbucket(PGeoBucket g) |
|
c = ndl_compare(di,dj); |
c = ndl_compare(di,dj); |
if ( c > 0 ) { |
if ( c > 0 ) { |
if ( sum ) |
if ( sum ) |
HC(gj) = sum; |
HCM(gj) = sum; |
else |
else |
g->body[j] = nd_remove_head(gj); |
g->body[j] = nd_remove_head(gj); |
j = i; |
j = i; |
gj = g->body[j]; |
gj = g->body[j]; |
dj = HDL(gj); |
dj = HDL(gj); |
sum = HC(gj); |
sum = HCM(gj); |
} else if ( c == 0 ) { |
} else if ( c == 0 ) { |
sum = sum+HC(gi)-nd_mod; |
sum = sum+HCM(gi)-nd_mod; |
if ( sum < 0 ) |
if ( sum < 0 ) |
sum += nd_mod; |
sum += nd_mod; |
g->body[i] = nd_remove_head(gi); |
g->body[i] = nd_remove_head(gi); |
Line 1061 int head_pbucket(PGeoBucket g) |
|
Line 1072 int head_pbucket(PGeoBucket g) |
|
if ( j < 0 ) |
if ( j < 0 ) |
return -1; |
return -1; |
else if ( sum ) { |
else if ( sum ) { |
HC(gj) = sum; |
HCM(gj) = sum; |
return j; |
return j; |
} else |
} else |
g->body[j] = nd_remove_head(gj); |
g->body[j] = nd_remove_head(gj); |
Line 1090 ND nd_nf(ND g,int full) |
|
Line 1101 ND nd_nf(ND g,int full) |
|
if ( !g ) { |
if ( !g ) { |
return 0; |
return 0; |
} |
} |
sugar = g->sugar; |
sugar = SG(g); |
n = g->nv; |
n = NV(g); |
bucket = create_pbucket(); |
bucket = create_pbucket(); |
add_pbucket(bucket,g); |
add_pbucket(bucket,g); |
d = 0; |
d = 0; |
Line 1099 ND nd_nf(ND g,int full) |
|
Line 1110 ND nd_nf(ND g,int full) |
|
h = head_pbucket(bucket); |
h = head_pbucket(bucket); |
if ( h < 0 ) { |
if ( h < 0 ) { |
if ( d ) |
if ( d ) |
d->sugar = sugar; |
SG(d) = sugar; |
return d; |
return d; |
} |
} |
g = bucket->body[h]; |
g = bucket->body[h]; |
Line 1108 ND nd_nf(ND g,int full) |
|
Line 1119 ND nd_nf(ND g,int full) |
|
bucket->body[h] = nd_remove_head(g); |
bucket->body[h] = nd_remove_head(g); |
red = nd_remove_head(red); |
red = nd_remove_head(red); |
add_pbucket(bucket,red); |
add_pbucket(bucket,red); |
sugar = MAX(sugar,red->sugar); |
sugar = MAX(sugar,SG(red)); |
} else if ( !full ) { |
} else if ( !full ) { |
g = normalize_pbucket(bucket); |
g = normalize_pbucket(bucket); |
if ( g ) |
if ( g ) |
g->sugar = sugar; |
SG(g) = sugar; |
return g; |
return g; |
} else { |
} else { |
m = BDY(g); |
m = BDY(g); |
Line 1152 NODE nd_gb(NODE f) |
|
Line 1163 NODE nd_gb(NODE f) |
|
while ( d ) { |
while ( d ) { |
again: |
again: |
l = nd_minp(d,&d); |
l = nd_minp(d,&d); |
if ( l->sugar != sugar ) { |
if ( SG(l) != sugar ) { |
sugar = l->sugar; |
sugar = SG(l); |
fprintf(asir_out,"%d",sugar); |
fprintf(asir_out,"%d",sugar); |
} |
} |
stat = nd_sp(l,&h); |
stat = nd_sp(l,&h); |
Line 1226 ND_pairs nd_newpairs( NODE g, int t ) |
|
Line 1237 ND_pairs nd_newpairs( NODE g, int t ) |
|
|
|
dl = HDL(nd_ps[t]); |
dl = HDL(nd_ps[t]); |
td = HTD(nd_ps[t]); |
td = HTD(nd_ps[t]); |
ts = nd_ps[t]->sugar - td; |
ts = SG(nd_ps[t]) - td; |
for ( r0 = 0, h = g; h; h = NEXT(h) ) { |
for ( r0 = 0, h = g; h; h = NEXT(h) ) { |
NEXTND_pairs(r0,r); |
NEXTND_pairs(r0,r); |
r->i1 = (int)BDY(h); |
r->i1 = (int)BDY(h); |
r->i2 = t; |
r->i2 = t; |
ndl_lcm(HDL(nd_ps[r->i1]),dl,r->lcm); |
ndl_lcm(HDL(nd_ps[r->i1]),dl,r->lcm); |
r->td = ndl_td(r->lcm); |
TD(r) = ndl_td(r->lcm); |
s = nd_ps[r->i1]->sugar-HTD(nd_ps[r->i1]); |
s = SG(nd_ps[r->i1])-HTD(nd_ps[r->i1]); |
r->sugar = MAX(s,ts) + r->td; |
SG(r) = MAX(s,ts) + TD(r); |
} |
} |
NEXT(r) = 0; |
NEXT(r) = 0; |
return r0; |
return r0; |
Line 1283 ND_pairs crit_M( ND_pairs d1 ) |
|
Line 1294 ND_pairs crit_M( ND_pairs d1 ) |
|
return e; |
return e; |
} |
} |
id = e->lcm; |
id = e->lcm; |
itd = e->td; |
itd = TD(e); |
for ( d3 = 0; d2; d2 = p ) { |
for ( d3 = 0; d2; d2 = p ) { |
p = NEXT(d2), |
p = NEXT(d2), |
jd = d2->lcm; |
jd = d2->lcm; |
jtd = d2->td; |
jtd = TD(d2); |
if ( jtd == itd ) |
if ( jtd == itd ) |
if ( id == jd ); |
if ( id == jd ); |
else if ( ndl_reducible(jd,id) ) continue; |
else if ( ndl_reducible(jd,id) ) continue; |
Line 1324 ND_pairs crit_F( ND_pairs d1 ) |
|
Line 1335 ND_pairs crit_F( ND_pairs d1 ) |
|
|
|
for ( head = last = 0, p = d1; NEXT(p); ) { |
for ( head = last = 0, p = d1; NEXT(p); ) { |
r = w = equivalent_pairs(p,&rest); |
r = w = equivalent_pairs(p,&rest); |
s = r->sugar; |
s = SG(r); |
w = NEXT(w); |
w = NEXT(w); |
while ( w ) { |
while ( w ) { |
if ( crit_2(w->i1,w->i2) ) { |
if ( crit_2(w->i1,w->i2) ) { |
Line 1336 ND_pairs crit_F( ND_pairs d1 ) |
|
Line 1347 ND_pairs crit_F( ND_pairs d1 ) |
|
FREENDP(remove); |
FREENDP(remove); |
} |
} |
break; |
break; |
} else if ( w->sugar < s ) { |
} else if ( SG(w) < s ) { |
FREENDP(r); |
FREENDP(r); |
r = w; |
r = w; |
s = r->sugar; |
s = SG(r); |
w = NEXT(w); |
w = NEXT(w); |
} else { |
} else { |
remove = w; |
remove = w; |
Line 1371 static ND_pairs equivalent_pairs( ND_pairs d1, ND_pair |
|
Line 1382 static ND_pairs equivalent_pairs( ND_pairs d1, ND_pair |
|
|
|
w = d1; |
w = d1; |
d = w->lcm; |
d = w->lcm; |
td = w->td; |
td = TD(w); |
s = NEXT(w); |
s = NEXT(w); |
NEXT(w) = 0; |
NEXT(w) = 0; |
for ( r = 0; s; s = p ) { |
for ( r = 0; s; s = p ) { |
p = NEXT(s); |
p = NEXT(s); |
if ( td == s->td && ndl_equal(d,s->lcm) ) { |
if ( td == TD(s) && ndl_equal(d,s->lcm) ) { |
NEXT(s) = w; |
NEXT(s) = w; |
w = s; |
w = s; |
} else { |
} else { |
Line 1423 ND_pairs nd_minp( ND_pairs d, ND_pairs *prest ) |
|
Line 1434 ND_pairs nd_minp( ND_pairs d, ND_pairs *prest ) |
|
return m; |
return m; |
} |
} |
lcm = m->lcm; |
lcm = m->lcm; |
s = m->sugar; |
s = SG(m); |
td = m->td; |
td = TD(m); |
len = nd_psl[m->i1]+nd_psl[m->i2]; |
len = nd_psl[m->i1]+nd_psl[m->i2]; |
for ( ml = 0, l = m; p; p = NEXT(l = p) ) { |
for ( ml = 0, l = m; p; p = NEXT(l = p) ) { |
if (p->sugar < s) |
if (SG(p) < s) |
goto find; |
goto find; |
else if ( p->sugar == s ) { |
else if ( SG(p) == s ) { |
if ( p->td < td ) |
if ( TD(p) < td ) |
goto find; |
goto find; |
else if ( p->td == td ) { |
else if ( TD(p) == td ) { |
c = ndl_compare(p->lcm,lcm); |
c = ndl_compare(p->lcm,lcm); |
if ( c < 0 ) |
if ( c < 0 ) |
goto find; |
goto find; |
|
|
ml = l; |
ml = l; |
m = p; |
m = p; |
lcm = m->lcm; |
lcm = m->lcm; |
s = m->sugar; |
s = SG(m); |
td = m->td; |
td = TD(m); |
len = tlen; |
len = tlen; |
} |
} |
if ( !ml ) *prest = NEXT(m); |
if ( !ml ) *prest = NEXT(m); |
Line 1482 int nd_newps(ND a) |
|
Line 1493 int nd_newps(ND a) |
|
} |
} |
nd_monic(a); |
nd_monic(a); |
nd_bound[nd_psn] = nd_compute_bound(a); |
nd_bound[nd_psn] = nd_compute_bound(a); |
NEWRHist(r); r->td = HTD(a); ndl_copy(HDL(a),r->dl); nd_psh[nd_psn] = r; |
NEWRHist(r); TD(r) = HTD(a); ndl_copy(HDL(a),DL(r)); nd_psh[nd_psn] = r; |
#if USE_NDV |
#if USE_NDV |
nd_ps[nd_psn]= ndtondv(a); |
nd_ps[nd_psn]= ndtondv(a); |
nd_free(a); |
nd_free(a); |
nd_psl[nd_psn] = len = nd_ps[nd_psn]->len; |
nd_psl[nd_psn] = len = LEN(nd_ps[nd_psn]); |
if ( len > nmv_len ) { |
if ( len > nmv_len ) { |
nmv_len = 2*len; |
nmv_len = 2*len; |
BDY(ndv_red) = (NMV)REALLOC(BDY(ndv_red),nmv_len*nmv_adv); |
BDY(ndv_red) = (NMV)REALLOC(BDY(ndv_red),nmv_len*nmv_adv); |
Line 1544 NODE nd_setup(NODE f) |
|
Line 1555 NODE nd_setup(NODE f) |
|
for ( i = 0; i < nd_psn; i++, f = NEXT(f) ) { |
for ( i = 0; i < nd_psn; i++, f = NEXT(f) ) { |
#if USE_NDV |
#if USE_NDV |
nd_ps[i] = dptondv((DP)BDY(f)); |
nd_ps[i] = dptondv((DP)BDY(f)); |
ndv_mul_c(nd_ps[i],invm(HC(nd_ps[i]),nd_mod)); |
ndv_mul_c(nd_ps[i],invm(HCM(nd_ps[i]),nd_mod)); |
len = MAX(len,nd_ps[i]->len); |
len = MAX(len,LEN(nd_ps[i])); |
#else |
#else |
nd_ps[i] = dptond((DP)BDY(f)); |
nd_ps[i] = dptond((DP)BDY(f)); |
nd_mul_c(nd_ps[i],1); |
nd_mul_c(nd_ps[i],1); |
nd_psl[i] = nd_length(nd_ps[i]); |
nd_psl[i] = nd_length(nd_ps[i]); |
#endif |
#endif |
NEWRHist(r); r->td = HTD(nd_ps[i]); ndl_copy(HDL(nd_ps[i]),r->dl); |
NEWRHist(r); TD(r) = HTD(nd_ps[i]); ndl_copy(HDL(nd_ps[i]),DL(r)); |
nd_psh[i] = r; |
nd_psh[i] = r; |
} |
} |
#if USE_NDV |
#if USE_NDV |
Line 1639 DL ndltodl(int n,int td,unsigned int *ndl) |
|
Line 1650 DL ndltodl(int n,int td,unsigned int *ndl) |
|
int i; |
int i; |
|
|
NEWDL(dl,n); |
NEWDL(dl,n); |
dl->td = td; |
TD(dl) = td; |
d = dl->d; |
d = dl->d; |
if ( is_rlex ) |
if ( is_rlex ) |
for ( i = 0; i < n; i++ ) |
for ( i = 0; i < n; i++ ) |
Line 1665 ND dptond(DP p) |
|
Line 1676 ND dptond(DP p) |
|
m0 = 0; |
m0 = 0; |
for ( t = BDY(p); t; t = NEXT(t) ) { |
for ( t = BDY(p); t; t = NEXT(t) ) { |
NEXTNM(m0,m); |
NEXTNM(m0,m); |
m->c = ITOS(t->c); |
CM(m) = ITOS(C(t)); |
m->td = t->dl->td; |
TD(m) = TD(DL(t)); |
dltondl(n,t->dl,m->dl); |
dltondl(n,DL(t),DL(m)); |
} |
} |
NEXT(m) = 0; |
NEXT(m) = 0; |
MKND(n,m0,d); |
MKND(n,m0,d); |
d->nv = n; |
NV(d) = n; |
d->sugar = p->sugar; |
SG(d) = SG(p); |
return d; |
return d; |
} |
} |
|
|
Line 1689 DP ndtodp(ND p) |
|
Line 1700 DP ndtodp(ND p) |
|
m0 = 0; |
m0 = 0; |
for ( t = BDY(p); t; t = NEXT(t) ) { |
for ( t = BDY(p); t; t = NEXT(t) ) { |
NEXTMP(m0,m); |
NEXTMP(m0,m); |
m->c = STOI(t->c); |
C(m) = STOI(CM(t)); |
m->dl = ndltodl(n,t->td,t->dl); |
DL(m) = ndltodl(n,TD(t),DL(t)); |
} |
} |
NEXT(m) = 0; |
NEXT(m) = 0; |
MKDP(n,m0,d); |
MKDP(n,m0,d); |
d->sugar = p->sugar; |
SG(d) = SG(p); |
return d; |
return d; |
} |
} |
|
|
Line 1726 void nd_print(ND p) |
|
Line 1737 void nd_print(ND p) |
|
printf("0\n"); |
printf("0\n"); |
else { |
else { |
for ( m = BDY(p); m; m = NEXT(m) ) { |
for ( m = BDY(p); m; m = NEXT(m) ) { |
printf("+%d*",m->c); |
printf("+%d*",CM(m)); |
ndl_print(m->dl); |
ndl_print(DL(m)); |
} |
} |
printf("\n"); |
printf("\n"); |
} |
} |
Line 1748 void nd_monic(ND p) |
|
Line 1759 void nd_monic(ND p) |
|
if ( !p ) |
if ( !p ) |
return; |
return; |
else |
else |
nd_mul_c(p,invm(HC(p),nd_mod)); |
nd_mul_c(p,invm(HCM(p),nd_mod)); |
} |
} |
|
|
void nd_mul_c(ND p,int mul) |
void nd_mul_c(ND p,int mul) |
Line 1759 void nd_mul_c(ND p,int mul) |
|
Line 1770 void nd_mul_c(ND p,int mul) |
|
if ( !p ) |
if ( !p ) |
return; |
return; |
for ( m = BDY(p); m; m = NEXT(m) ) { |
for ( m = BDY(p); m; m = NEXT(m) ) { |
c1 = C(m); |
c1 = CM(m); |
DMAR(c1,mul,0,nd_mod,c); |
DMAR(c1,mul,0,nd_mod,c); |
C(m) = c; |
CM(m) = c; |
} |
} |
} |
} |
|
|
Line 1788 void nd_append_red(unsigned int *d,int td,int i) |
|
Line 1799 void nd_append_red(unsigned int *d,int td,int i) |
|
NEWRHist(m); |
NEWRHist(m); |
h = ndl_hash_value(td,d); |
h = ndl_hash_value(td,d); |
m->index = i; |
m->index = i; |
m->td = td; |
TD(m) = td; |
ndl_copy(d,m->dl); |
ndl_copy(d,DL(m)); |
NEXT(m) = nd_red[h]; |
NEXT(m) = nd_red[h]; |
nd_red[h] = m; |
nd_red[h] = m; |
} |
} |
Line 1805 unsigned int *dp_compute_bound(DP p) |
|
Line 1816 unsigned int *dp_compute_bound(DP p) |
|
d1 = (unsigned int *)ALLOCA(nd_nvar*sizeof(unsigned int)); |
d1 = (unsigned int *)ALLOCA(nd_nvar*sizeof(unsigned int)); |
d2 = (unsigned int *)ALLOCA(nd_nvar*sizeof(unsigned int)); |
d2 = (unsigned int *)ALLOCA(nd_nvar*sizeof(unsigned int)); |
m = BDY(p); |
m = BDY(p); |
bcopy(m->dl->d,d1,nd_nvar*sizeof(unsigned int)); |
bcopy(DL(m)->d,d1,nd_nvar*sizeof(unsigned int)); |
for ( m = NEXT(BDY(p)); m; m = NEXT(m) ) { |
for ( m = NEXT(BDY(p)); m; m = NEXT(m) ) { |
d = m->dl->d; |
d = DL(m)->d; |
for ( i = 0; i < nd_nvar; i++ ) |
for ( i = 0; i < nd_nvar; i++ ) |
d2[i] = d[i] > d1[i] ? d[i] : d1[i]; |
d2[i] = d[i] > d1[i] ? d[i] : d1[i]; |
t = d1; d1 = d2; d2 = t; |
t = d1; d1 = d2; d2 = t; |
Line 1831 unsigned int *nd_compute_bound(ND p) |
|
Line 1842 unsigned int *nd_compute_bound(ND p) |
|
d2 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
d2 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
bcopy(HDL(p),d1,nd_wpd*sizeof(unsigned int)); |
bcopy(HDL(p),d1,nd_wpd*sizeof(unsigned int)); |
for ( m = NEXT(BDY(p)); m; m = NEXT(m) ) { |
for ( m = NEXT(BDY(p)); m; m = NEXT(m) ) { |
ndl_lcm(m->dl,d1,d2); |
ndl_lcm(DL(m),d1,d2); |
t = d1; d1 = d2; d2 = t; |
t = d1; d1 = d2; d2 = t; |
} |
} |
l = nd_nvar+31; |
l = nd_nvar+31; |
Line 1906 ND_pairs nd_reconstruct(ND_pairs d) |
|
Line 1917 ND_pairs nd_reconstruct(ND_pairs d) |
|
NEXTND_pairs(s0,s); |
NEXTND_pairs(s0,s); |
s->i1 = t->i1; |
s->i1 = t->i1; |
s->i2 = t->i2; |
s->i2 = t->i2; |
s->td = t->td; |
TD(s) = TD(t); |
s->sugar = t->sugar; |
SG(s) = SG(t); |
ndl_dup(obpe,t->lcm,s->lcm); |
ndl_dup(obpe,t->lcm,s->lcm); |
} |
} |
for ( i = 0; i < REDTAB_LEN; i++ ) { |
for ( i = 0; i < REDTAB_LEN; i++ ) { |
for ( mr0 = 0, r = nd_red[i]; r; r = NEXT(r) ) { |
for ( mr0 = 0, r = nd_red[i]; r; r = NEXT(r) ) { |
NEXTRHist(mr0,r); |
NEXTRHist(mr0,r); |
mr->index = r->index; |
mr->index = r->index; |
mr->td = r->td; |
TD(mr) = TD(r); |
ndl_dup(obpe,r->dl,mr->dl); |
ndl_dup(obpe,DL(r),DL(mr)); |
} |
} |
if ( mr0 ) NEXT(mr) = 0; |
if ( mr0 ) NEXT(mr) = 0; |
nd_red[i] = mr0; |
nd_red[i] = mr0; |
} |
} |
for ( i = 0; i < nd_psn; i++ ) { |
for ( i = 0; i < nd_psn; i++ ) { |
NEWRHist(r); r->td = nd_psh[i]->td; ndl_dup(obpe,nd_psh[i]->dl,r->dl); |
NEWRHist(r); TD(r) = TD(nd_psh[i]); ndl_dup(obpe,DL(nd_psh[i]),DL(r)); |
nd_psh[i] = r; |
nd_psh[i] = r; |
} |
} |
if ( s0 ) NEXT(s) = 0; |
if ( s0 ) NEXT(s) = 0; |
Line 1964 void nd_realloc(ND p,int obpe) |
|
Line 1975 void nd_realloc(ND p,int obpe) |
|
m = BDY(p); |
m = BDY(p); |
for ( mr0 = 0; m; m = NEXT(m) ) { |
for ( mr0 = 0; m; m = NEXT(m) ) { |
NEXTNM(mr0,mr); |
NEXTNM(mr0,mr); |
C(mr) = C(m); |
CM(mr) = CM(m); |
mr->td = m->td; |
TD(mr) = TD(m); |
ndl_dup(obpe,m->dl,mr->dl); |
ndl_dup(obpe,DL(m),DL(mr)); |
} |
} |
NEXT(mr) = 0; |
NEXT(mr) = 0; |
BDY(p) = mr0; |
BDY(p) = mr0; |
Line 1985 ND nd_copy(ND p) |
|
Line 1996 ND nd_copy(ND p) |
|
s = sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int); |
s = sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int); |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
NEXTNM(mr0,mr); |
NEXTNM(mr0,mr); |
C(mr) = C(m); |
CM(mr) = CM(m); |
mr->td = m->td; |
TD(mr) = TD(m); |
ndl_copy(m->dl,mr->dl); |
ndl_copy(DL(m),DL(mr)); |
} |
} |
NEXT(mr) = 0; |
NEXT(mr) = 0; |
MKND(NV(p),mr0,r); |
MKND(NV(p),mr0,r); |
r->sugar = p->sugar; |
SG(r) = SG(p); |
return r; |
return r; |
} |
} |
} |
} |
Line 2008 int nd_sp(ND_pairs p,ND *rp) |
|
Line 2019 int nd_sp(ND_pairs p,ND *rp) |
|
p1 = nd_ps[p->i1]; |
p1 = nd_ps[p->i1]; |
p2 = nd_ps[p->i2]; |
p2 = nd_ps[p->i2]; |
lcm = p->lcm; |
lcm = p->lcm; |
td = p->td; |
td = TD(p); |
NEWNM(m); |
NEWNM(m); |
C(m) = HC(p2); m->td = td-HTD(p1); ndl_sub(lcm,HDL(p1),m->dl); |
CM(m) = HCM(p2); TD(m) = td-HTD(p1); ndl_sub(lcm,HDL(p1),DL(m)); |
if ( ndl_check_bound2(p->i1,m->dl) ) |
if ( ndl_check_bound2(p->i1,DL(m)) ) |
return 0; |
return 0; |
t1 = ndv_mul_nm_create(p1,m); |
t1 = ndv_mul_nm_create(p1,m); |
C(m) = nd_mod-HC(p1); m->td = td-HTD(p2); ndl_sub(lcm,HDL(p2),m->dl); |
CM(m) = nd_mod-HCM(p1); TD(m) = td-HTD(p2); ndl_sub(lcm,HDL(p2),DL(m)); |
if ( ndl_check_bound2(p->i2,m->dl) ) { |
if ( ndl_check_bound2(p->i2,DL(m)) ) { |
nd_free(t1); |
nd_free(t1); |
return 0; |
return 0; |
} |
} |
Line 2032 void ndv_mul_c(NDV p,int mul) |
|
Line 2043 void ndv_mul_c(NDV p,int mul) |
|
|
|
if ( !p ) |
if ( !p ) |
return; |
return; |
len = p->len; |
len = LEN(p); |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
c1 = C(m); |
c1 = CM(m); |
DMAR(c1,mul,0,nd_mod,c); |
DMAR(c1,mul,0,nd_mod,c); |
C(m) = c; |
CM(m) = c; |
} |
} |
} |
} |
|
|
Line 2048 void ndv_mul_nm(NDV p,NM m0,NDV r) |
|
Line 2059 void ndv_mul_nm(NDV p,NM m0,NDV r) |
|
|
|
if ( !p ) |
if ( !p ) |
/* XXX */ |
/* XXX */ |
r->len = 0; |
LEN(r) = 0; |
else { |
else { |
n = NV(p); m = BDY(p); len = p->len; |
n = NV(p); m = BDY(p); len = LEN(p); |
d = m0->dl; td = m0->td; c = C(m0); |
d = DL(m0); td = TD(m0); c = CM(m0); |
mr = BDY(r); |
mr = BDY(r); |
for ( ; len > 0; len--, NMV_ADV(m), NMV_ADV(mr) ) { |
for ( ; len > 0; len--, NMV_ADV(m), NMV_ADV(mr) ) { |
c1 = C(m); DMAR(c1,c,0,nd_mod,c2); C(mr) = c2; |
c1 = CM(m); DMAR(c1,c,0,nd_mod,c2); CM(mr) = c2; |
mr->td = m->td+td; ndl_add(m->dl,d,mr->dl); |
TD(mr) = TD(m)+td; ndl_add(DL(m),d,DL(mr)); |
} |
} |
NV(r) = NV(p); |
NV(r) = NV(p); |
r->len = p->len; |
LEN(r) = LEN(p); |
r->sugar = p->sugar + td; |
SG(r) = SG(p) + td; |
} |
} |
} |
} |
|
|
Line 2075 ND ndv_mul_nm_create(NDV p,NM m0) |
|
Line 2086 ND ndv_mul_nm_create(NDV p,NM m0) |
|
return 0; |
return 0; |
else { |
else { |
n = NV(p); m = BDY(p); |
n = NV(p); m = BDY(p); |
d = m0->dl; td = m0->td; c = C(m0); |
d = DL(m0); td = TD(m0); c = CM(m0); |
len = p->len; |
len = LEN(p); |
mr0 = 0; |
mr0 = 0; |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
NEXTNM(mr0,mr); |
NEXTNM(mr0,mr); |
c1 = C(m); |
c1 = CM(m); |
DMAR(c1,c,0,nd_mod,c2); |
DMAR(c1,c,0,nd_mod,c2); |
C(mr) = c2; |
CM(mr) = c2; |
mr->td = m->td+td; |
TD(mr) = TD(m)+td; |
ndl_add(m->dl,d,mr->dl); |
ndl_add(DL(m),d,DL(mr)); |
} |
} |
NEXT(mr) = 0; |
NEXT(mr) = 0; |
MKND(NV(p),mr0,r); |
MKND(NV(p),mr0,r); |
r->sugar = p->sugar + td; |
SG(r) = SG(p) + td; |
return r; |
return r; |
} |
} |
} |
} |
Line 2105 ND ndv_add(ND p1,NDV p2) |
|
Line 2116 ND ndv_add(ND p1,NDV p2) |
|
return 0; |
return 0; |
else { |
else { |
prev = 0; head = cur = BDY(p1); |
prev = 0; head = cur = BDY(p1); |
NEWNM(new); len = p2->len; |
NEWNM(new); len = LEN(p2); |
for ( m2 = BDY(p2), i = 0; cur && i < len; ) { |
for ( m2 = BDY(p2), i = 0; cur && i < len; ) { |
td2 = new->td = m2->td; |
td2 = TD(new) = TD(m2); |
if ( cur->td > td2 ) { |
if ( TD(cur) > td2 ) { |
prev = cur; cur = NEXT(cur); |
prev = cur; cur = NEXT(cur); |
continue; |
continue; |
} else if ( cur->td < td2 ) c = -1; |
} else if ( TD(cur) < td2 ) c = -1; |
else if ( nd_wpd == 1 ) { |
else if ( nd_wpd == 1 ) { |
if ( cur->dl[0] > m2->dl[0] ) c = is_rlex ? -1 : 1; |
if ( DL(cur)[0] > DL(m2)[0] ) c = is_rlex ? -1 : 1; |
else if ( cur->dl[0] < m2->dl[0] ) c = is_rlex ? 1 : -1; |
else if ( DL(cur)[0] < DL(m2)[0] ) c = is_rlex ? 1 : -1; |
else c = 0; |
else c = 0; |
} |
} |
else c = ndl_compare(cur->dl,m2->dl); |
else c = ndl_compare(DL(cur),DL(m2)); |
switch ( c ) { |
switch ( c ) { |
case 0: |
case 0: |
t = C(m2)+C(cur)-nd_mod; |
t = CM(m2)+CM(cur)-nd_mod; |
if ( t < 0 ) t += nd_mod; |
if ( t < 0 ) t += nd_mod; |
if ( t ) C(cur) = t; |
if ( t ) CM(cur) = t; |
else if ( !prev ) { |
else if ( !prev ) { |
head = NEXT(cur); FREENM(cur); cur = head; |
head = NEXT(cur); FREENM(cur); cur = head; |
} else { |
} else { |
Line 2134 ND ndv_add(ND p1,NDV p2) |
|
Line 2145 ND ndv_add(ND p1,NDV p2) |
|
prev = cur; cur = NEXT(cur); |
prev = cur; cur = NEXT(cur); |
break; |
break; |
case -1: |
case -1: |
ndl_copy(m2->dl,new->dl); |
ndl_copy(DL(m2),DL(new)); |
C(new) = C(m2); |
CM(new) = CM(m2); |
if ( !prev ) { |
if ( !prev ) { |
/* cur = head */ |
/* cur = head */ |
prev = new; NEXT(prev) = head; head = prev; |
prev = new; NEXT(prev) = head; head = prev; |
Line 2147 ND ndv_add(ND p1,NDV p2) |
|
Line 2158 ND ndv_add(ND p1,NDV p2) |
|
} |
} |
} |
} |
for ( ; i < len; i++, NMV_ADV(m2) ) { |
for ( ; i < len; i++, NMV_ADV(m2) ) { |
td2 = new->td = m2->td; C(new) = C(m2); ndl_copy(m2->dl,new->dl); |
td2 = TD(new) = TD(m2); CM(new) = CM(m2); ndl_copy(DL(m2),DL(new)); |
if ( !prev ) { |
if ( !prev ) { |
prev = new; NEXT(prev) = 0; head = prev; |
prev = new; NEXT(prev) = 0; head = prev; |
} else { |
} else { |
Line 2157 ND ndv_add(ND p1,NDV p2) |
|
Line 2168 ND ndv_add(ND p1,NDV p2) |
|
} |
} |
FREENM(new); |
FREENM(new); |
if ( head ) { |
if ( head ) { |
BDY(p1) = head; p1->sugar = MAX(p1->sugar,p2->sugar); |
BDY(p1) = head; SG(p1) = MAX(SG(p1),SG(p2)); |
return p1; |
return p1; |
} else { |
} else { |
FREEND(p1); |
FREEND(p1); |
Line 2176 void ndv_realloc(NDV p,int obpe,int oadv) |
|
Line 2187 void ndv_realloc(NDV p,int obpe,int oadv) |
|
#define NMV_PREV(m) (m = (NMV)(((char *)m)-nmv_adv)) |
#define NMV_PREV(m) (m = (NMV)(((char *)m)-nmv_adv)) |
|
|
if ( p ) { |
if ( p ) { |
m = BDY(p); len = p->len; |
m = BDY(p); len = LEN(p); |
mr0 = (NMV)REALLOC(BDY(p),len*nmv_adv); |
mr0 = (NMV)REALLOC(BDY(p),len*nmv_adv); |
m = (NMV)((char *)mr0+(len-1)*oadv); |
m = (NMV)((char *)mr0+(len-1)*oadv); |
mr = (NMV)((char *)mr0+(len-1)*nmv_adv); |
mr = (NMV)((char *)mr0+(len-1)*nmv_adv); |
t = (NMV)ALLOCA(nmv_adv); |
t = (NMV)ALLOCA(nmv_adv); |
for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) { |
for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) { |
C(t) = C(m); |
CM(t) = CM(m); |
t->td = m->td; |
TD(t) = TD(m); |
for ( k = 0; k < nd_wpd; k++ ) t->dl[k] = 0; |
for ( k = 0; k < nd_wpd; k++ ) DL(t)[k] = 0; |
ndl_dup(obpe,m->dl,t->dl); |
ndl_dup(obpe,DL(m),DL(t)); |
C(mr) = C(t); |
CM(mr) = CM(t); |
mr->td = t->td; |
TD(mr) = TD(t); |
ndl_copy(t->dl,mr->dl); |
ndl_copy(DL(t),DL(mr)); |
} |
} |
BDY(p) = mr0; |
BDY(p) = mr0; |
} |
} |
Line 2206 NDV ndtondv(ND p) |
|
Line 2217 NDV ndtondv(ND p) |
|
len = nd_length(p); |
len = nd_length(p); |
m0 = m = (NMV)MALLOC_ATOMIC(len*nmv_adv); |
m0 = m = (NMV)MALLOC_ATOMIC(len*nmv_adv); |
for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, NMV_ADV(m) ) { |
for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, NMV_ADV(m) ) { |
m->td = t->td; |
TD(m) = TD(t); |
ndl_copy(t->dl,m->dl); |
ndl_copy(DL(t),DL(m)); |
m->c = t->c; |
CM(m) = CM(t); |
} |
} |
MKNDV(NV(p),m0,len,d); |
MKNDV(NV(p),m0,len,d); |
d->sugar = p->sugar; |
SG(d) = SG(p); |
return d; |
return d; |
} |
} |
|
|
Line 2228 NDV dptondv(DP p) |
|
Line 2239 NDV dptondv(DP p) |
|
m0 = m = (NMV)MALLOC_ATOMIC(l*nmv_adv); |
m0 = m = (NMV)MALLOC_ATOMIC(l*nmv_adv); |
n = NV(p); |
n = NV(p); |
for ( t = BDY(p), i = 0; i < l; i++, t = NEXT(t), NMV_ADV(m) ) { |
for ( t = BDY(p), i = 0; i < l; i++, t = NEXT(t), NMV_ADV(m) ) { |
m->c = ITOS(t->c); |
CM(m) = ITOS(C(t)); |
m->td = t->dl->td; |
TD(m) = TD(DL(t)); |
dltondl(n,t->dl,m->dl); |
dltondl(n,DL(t),DL(m)); |
} |
} |
MKNDV(n,m0,l,d); |
MKNDV(n,m0,l,d); |
d->sugar = p->sugar; |
SG(d) = SG(p); |
return d; |
return d; |
} |
} |
|
|
Line 2247 DP ndvtodp(NDV p) |
|
Line 2258 DP ndvtodp(NDV p) |
|
if ( !p ) |
if ( !p ) |
return 0; |
return 0; |
m0 = 0; |
m0 = 0; |
len = p->len; |
len = LEN(p); |
n = NV(p); |
n = NV(p); |
for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) { |
for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) { |
NEXTMP(m0,m); |
NEXTMP(m0,m); |
m->c = STOI(t->c); |
C(m) = STOI(CM(t)); |
m->dl = ndltodl(n,t->td,t->dl); |
DL(m) = ndltodl(n,TD(t),DL(t)); |
} |
} |
NEXT(m) = 0; |
NEXT(m) = 0; |
MKDP(NV(p),m0,d); |
MKDP(NV(p),m0,d); |
d->sugar = p->sugar; |
SG(d) = SG(p); |
return d; |
return d; |
} |
} |
|
|
Line 2268 void ndv_print(NDV p) |
|
Line 2279 void ndv_print(NDV p) |
|
if ( !p ) |
if ( !p ) |
printf("0\n"); |
printf("0\n"); |
else { |
else { |
len = p->len; |
len = LEN(p); |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
printf("+%d*",m->c); |
printf("+%d*",CM(m)); |
ndl_print(m->dl); |
ndl_print(DL(m)); |
} |
} |
printf("\n"); |
printf("\n"); |
} |
} |
Line 2288 int nd_sp(ND_pairs p,ND *rp) |
|
Line 2299 int nd_sp(ND_pairs p,ND *rp) |
|
p1 = nd_ps[p->i1]; |
p1 = nd_ps[p->i1]; |
p2 = nd_ps[p->i2]; |
p2 = nd_ps[p->i2]; |
lcm = p->lcm; |
lcm = p->lcm; |
td = p->td; |
td = TD(p); |
NEWNM(m); |
NEWNM(m); |
C(m) = HC(p2); m->td = td-HTD(p1); ndl_sub(lcm,HDL(p1),m->dl); |
CM(m) = HCM(p2); TD(m) = td-HTD(p1); ndl_sub(lcm,HDL(p1),DL(m)); |
if ( ndl_check_bound2(p->i1,m->dl) ) |
if ( ndl_check_bound2(p->i1,DL(m)) ) |
return 0; |
return 0; |
t1 = nd_mul_ind_nm(p->i1,m); |
t1 = nd_mul_ind_nm(p->i1,m); |
C(m) = nd_mod-HC(p1); m->td = td-HTD(p2); ndl_sub(lcm,HDL(p2),m->dl); |
CM(m) = nd_mod-HCM(p1); TD(m) = td-HTD(p2); ndl_sub(lcm,HDL(p2),DL(m)); |
if ( ndl_check_bound2(p->i2,m->dl) ) { |
if ( ndl_check_bound2(p->i2,DL(m)) ) { |
nd_free(t1); |
nd_free(t1); |
return 0; |
return 0; |
} |
} |
Line 2317 ND nd_mul_nm(ND p,NM m0) |
|
Line 2328 ND nd_mul_nm(ND p,NM m0) |
|
return 0; |
return 0; |
else { |
else { |
n = NV(p); m = BDY(p); |
n = NV(p); m = BDY(p); |
d = m0->dl; td = m0->td; c = C(m0); |
d = DL(m0); td = TD(m0); c = CM(m0); |
mr0 = 0; |
mr0 = 0; |
for ( ; m; m = NEXT(m) ) { |
for ( ; m; m = NEXT(m) ) { |
NEXTNM(mr0,mr); |
NEXTNM(mr0,mr); |
c1 = C(m); |
c1 = CM(m); |
DMAR(c1,c,0,nd_mod,c2); |
DMAR(c1,c,0,nd_mod,c2); |
C(mr) = c2; |
CM(mr) = c2; |
mr->td = m->td+td; |
TD(mr) = TD(m)+td; |
ndl_add(m->dl,d,mr->dl); |
ndl_add(DL(m),d,DL(mr)); |
} |
} |
NEXT(mr) = 0; |
NEXT(mr) = 0; |
MKND(NV(p),mr0,r); |
MKND(NV(p),mr0,r); |
r->sugar = p->sugar + td; |
SG(r) = SG(p) + td; |
return r; |
return r; |
} |
} |
} |
} |
Line 2346 ND nd_mul_ind_nm(int index,NM m0) |
|
Line 2357 ND nd_mul_ind_nm(int index,NM m0) |
|
p = nd_ps[index]; |
p = nd_ps[index]; |
len = nd_psl[index]; |
len = nd_psl[index]; |
n = NV(p); m = BDY(p); |
n = NV(p); m = BDY(p); |
d = m0->dl; td = m0->td; c = C(m0); |
d = DL(m0); td = TD(m0); c = CM(m0); |
|
|
NEWNM(mr0); |
NEWNM(mr0); |
c1 = C(m); DMAR(c1,c,0,nd_mod,c2); C(mr0) = c2; |
c1 = CM(m); DMAR(c1,c,0,nd_mod,c2); CM(mr0) = c2; |
mr0->td = m->td+td; ndl_add(m->dl,d,mr0->dl); |
TD(mr0) = TD(m)+td; ndl_add(DL(m),d,DL(mr0)); |
prev = mr0; m = NEXT(m); |
prev = mr0; m = NEXT(m); |
len--; |
len--; |
|
|
Line 2358 ND nd_mul_ind_nm(int index,NM m0) |
|
Line 2369 ND nd_mul_ind_nm(int index,NM m0) |
|
case 1: |
case 1: |
d0 = d[0]; |
d0 = d[0]; |
while ( len-- ) { |
while ( len-- ) { |
c1 = C(m); DMAR(c1,c,0,nd_mod,c2); |
c1 = CM(m); DMAR(c1,c,0,nd_mod,c2); |
NEWNM(new); C(new) = c2; |
NEWNM(new); CM(new) = c2; |
new->td = m->td+td; new->dl[0] = m->dl[0]+d0; |
TD(new) = TD(m)+td; DL(new)[0] = DL(m)[0]+d0; |
m = NEXT(m); NEXT(prev) = new; prev = new; |
m = NEXT(m); NEXT(prev) = new; prev = new; |
} |
} |
break; |
break; |
case 2: |
case 2: |
d0 = d[0]; d1 = d[1]; |
d0 = d[0]; d1 = d[1]; |
while ( len-- ) { |
while ( len-- ) { |
c1 = C(m); DMAR(c1,c,0,nd_mod,c2); |
c1 = CM(m); DMAR(c1,c,0,nd_mod,c2); |
NEWNM(new); C(new) = c2; |
NEWNM(new); CM(new) = c2; |
new->td = m->td+td; |
TD(new) = TD(m)+td; |
new->dl[0] = m->dl[0]+d0; |
DL(new)[0] = DL(m)[0]+d0; |
new->dl[1] = m->dl[1]+d1; |
DL(new)[1] = DL(m)[1]+d1; |
m = NEXT(m); NEXT(prev) = new; prev = new; |
m = NEXT(m); NEXT(prev) = new; prev = new; |
} |
} |
break; |
break; |
default: |
default: |
while ( len-- ) { |
while ( len-- ) { |
c1 = C(m); DMAR(c1,c,0,nd_mod,c2); |
c1 = CM(m); DMAR(c1,c,0,nd_mod,c2); |
NEWNM(new); C(new) = c2; |
NEWNM(new); CM(new) = c2; |
new->td = m->td+td; ndl_add(m->dl,d,new->dl); |
TD(new) = TD(m)+td; ndl_add(DL(m),d,DL(new)); |
m = NEXT(m); NEXT(prev) = new; prev = new; |
m = NEXT(m); NEXT(prev) = new; prev = new; |
} |
} |
break; |
break; |
Line 2387 ND nd_mul_ind_nm(int index,NM m0) |
|
Line 2398 ND nd_mul_ind_nm(int index,NM m0) |
|
|
|
NEXT(prev) = 0; |
NEXT(prev) = 0; |
MKND(NV(p),mr0,r); |
MKND(NV(p),mr0,r); |
r->sugar = p->sugar + td; |
SG(r) = SG(p) + td; |
return r; |
return r; |
} |
} |
#endif |
#endif |