version 1.28, 2003/08/11 06:58:01 |
version 1.30, 2003/08/12 09:07:19 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.27 2003/08/10 01:31:24 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.29 2003/08/11 07:37:08 noro Exp $ */ |
|
|
#include "ca.h" |
#include "ca.h" |
#include "inline.h" |
#include "inline.h" |
|
|
typedef struct oPGeoBucket { |
typedef struct oPGeoBucket { |
int m; |
int m; |
struct oND *body[32]; |
struct oND *body[32]; |
|
int len[32]; |
} *PGeoBucket; |
} *PGeoBucket; |
|
|
typedef struct oND { |
typedef struct oND { |
Line 167 void _NM_alloc(); |
|
Line 168 void _NM_alloc(); |
|
void _ND_alloc(); |
void _ND_alloc(); |
int ndl_td(unsigned int *d); |
int ndl_td(unsigned int *d); |
int ndl_dehomogenize(unsigned int *p); |
int ndl_dehomogenize(unsigned int *p); |
ND nd_add(int mod,ND p1,ND p2); |
ND nd_add(int mod,ND p1,ND p2,int *cancel); |
ND nd_add_q(ND p1,ND p2); |
ND nd_add_q(ND p1,ND p2,int *cancel); |
ND nd_mul_nm(int mod,ND p,NM m0); |
ND nd_mul_nm(int mod,ND p,NM m0); |
ND nd_mul_ind_nm(int mod,int index,NM m0); |
ND nd_mul_ind_nm(int mod,int index,NM m0); |
int nd_sp(int mod,ND_pairs p,ND *nf); |
int nd_sp(int mod,ND_pairs p,ND *nf); |
int nd_find_reducer(ND g); |
int nd_find_reducer(ND g); |
int nd_find_reducer_direct(ND g,NDV *ps,int len); |
int nd_find_reducer_direct(ND g,NDV *ps,int len); |
int nd_nf(int mod,ND g,int full,ND *nf); |
int nd_nf(int mod,ND g,int full,ND *nf); |
|
int nd_nf_pbucket(int mod,ND g,int full,ND *nf); |
|
int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full,ND *rp); |
|
int nd_nf_direct_pbucket(int mod,ND g,NDV *ps,int len,int full,ND *rp); |
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); |
NODE nd_reduceall(int m,NODE f); |
NODE nd_reduceall(int m,NODE f); |
Line 257 void _NDP_alloc() |
|
Line 261 void _NDP_alloc() |
|
} |
} |
} |
} |
|
|
INLINE nd_length(ND p) |
INLINE int nd_length(ND p) |
{ |
{ |
NM m; |
NM m; |
int i; |
int i; |
Line 757 INLINE int nd_find_reducer(ND g) |
|
Line 761 INLINE int nd_find_reducer(ND g) |
|
return r->index; |
return r->index; |
} |
} |
} |
} |
|
|
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]; |
Line 803 INLINE int nd_find_reducer_direct(ND g,NDV *ps,int len |
|
Line 806 INLINE int nd_find_reducer_direct(ND g,NDV *ps,int len |
|
return -1; |
return -1; |
} |
} |
|
|
ND nd_add(int mod,ND p1,ND p2) |
ND nd_add(int mod,ND p1,ND p2,int *cancel) |
{ |
{ |
int n,c; |
int n,c; |
int t; |
int t,can; |
ND r; |
ND r; |
NM m1,m2,mr0,mr,s; |
NM m1,m2,mr0,mr,s; |
|
|
if ( !p1 ) |
if ( !p1 ) { |
|
*cancel = 0; |
return p2; |
return p2; |
else if ( !p2 ) |
} else if ( !p2 ) { |
|
*cancel = 0; |
return p1; |
return p1; |
else if ( !mod ) |
} else if ( !mod ) |
return nd_add_q(p1,p2); |
return nd_add_q(p1,p2,cancel); |
else { |
else { |
|
can = 0; |
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 ( TD(m1) > TD(m2) ) |
if ( TD(m1) > TD(m2) ) |
c = 1; |
c = 1; |
Line 831 ND nd_add(int mod,ND p1,ND p2) |
|
Line 837 ND nd_add(int mod,ND p1,ND p2) |
|
t += mod; |
t += mod; |
s = m1; m1 = NEXT(m1); |
s = m1; m1 = NEXT(m1); |
if ( t ) { |
if ( t ) { |
|
can++; |
NEXTNM2(mr0,mr,s); CM(mr) = (t); |
NEXTNM2(mr0,mr,s); CM(mr) = (t); |
} else { |
} else { |
|
can += 2; |
FREENM(s); |
FREENM(s); |
} |
} |
s = m2; m2 = NEXT(m2); FREENM(s); |
s = m2; m2 = NEXT(m2); FREENM(s); |
Line 845 ND nd_add(int mod,ND p1,ND p2) |
|
Line 853 ND nd_add(int mod,ND p1,ND p2) |
|
break; |
break; |
} |
} |
} |
} |
|
*cancel = can; |
if ( !mr0 ) |
if ( !mr0 ) |
if ( m1 ) |
if ( m1 ) |
mr0 = m1; |
mr0 = m1; |
Line 865 ND nd_add(int mod,ND p1,ND p2) |
|
Line 874 ND nd_add(int mod,ND p1,ND p2) |
|
} |
} |
} |
} |
|
|
ND nd_add_q(ND p1,ND p2) |
ND nd_add_q(ND p1,ND p2,int *cancel) |
{ |
{ |
int n,c; |
int n,c,can; |
ND r; |
ND r; |
NM m1,m2,mr0,mr,s; |
NM m1,m2,mr0,mr,s; |
Q t; |
Q t; |
|
|
if ( !p1 ) |
if ( !p1 ) { |
|
*cancel = 0; |
return p2; |
return p2; |
else if ( !p2 ) |
} else if ( !p2 ) { |
|
*cancel = 0; |
return p1; |
return p1; |
else { |
} else { |
|
can = 0; |
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 ( TD(m1) > TD(m2) ) |
if ( TD(m1) > TD(m2) ) |
c = 1; |
c = 1; |
Line 889 ND nd_add_q(ND p1,ND p2) |
|
Line 901 ND nd_add_q(ND p1,ND p2) |
|
addq(CQ(m1),CQ(m2),&t); |
addq(CQ(m1),CQ(m2),&t); |
s = m1; m1 = NEXT(m1); |
s = m1; m1 = NEXT(m1); |
if ( t ) { |
if ( t ) { |
|
can++; |
NEXTNM2(mr0,mr,s); CQ(mr) = (t); |
NEXTNM2(mr0,mr,s); CQ(mr) = (t); |
} else { |
} else { |
|
can += 2; |
FREENM(s); |
FREENM(s); |
} |
} |
s = m2; m2 = NEXT(m2); FREENM(s); |
s = m2; m2 = NEXT(m2); FREENM(s); |
Line 903 ND nd_add_q(ND p1,ND p2) |
|
Line 917 ND nd_add_q(ND p1,ND p2) |
|
break; |
break; |
} |
} |
} |
} |
|
*cancel = can; |
if ( !mr0 ) |
if ( !mr0 ) |
if ( m1 ) |
if ( m1 ) |
mr0 = m1; |
mr0 = m1; |
Line 923 ND nd_add_q(ND p1,ND p2) |
|
Line 938 ND nd_add_q(ND p1,ND p2) |
|
} |
} |
} |
} |
|
|
#if !USE_GEOBUCKET |
|
/* ret=1 : success, ret=0 : overflow */ |
/* ret=1 : success, ret=0 : overflow */ |
int nd_nf(int mod,ND g,int full,ND *rp) |
int nd_nf(int mod,ND g,int full,ND *rp) |
{ |
{ |
Line 931 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 945 int nd_nf(int mod,ND g,int full,ND *rp) |
|
NM m,mrd,tail; |
NM m,mrd,tail; |
NM mul; |
NM mul; |
int n,sugar,psugar,sugar0,stat,index; |
int n,sugar,psugar,sugar0,stat,index; |
int c,c1,c2; |
int c,c1,c2,dummy; |
RHist h; |
RHist h; |
NDV p,red; |
NDV p,red; |
Q cg,cred,gcd; |
Q cg,cred,gcd; |
Line 972 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 986 int nd_nf(int mod,ND g,int full,ND *rp) |
|
chsgnq(cg,&CQ(mul)); |
chsgnq(cg,&CQ(mul)); |
nd_mul_c_q(d,cred); nd_mul_c_q(g,cred); |
nd_mul_c_q(d,cred); nd_mul_c_q(g,cred); |
} |
} |
g = nd_add(mod,g,ndv_mul_nm(mod,p,mul)); |
g = nd_add(mod,g,ndv_mul_nm(mod,p,mul),&dummy); |
sugar = MAX(sugar,SG(p)+TD(mul)); |
sugar = MAX(sugar,SG(p)+TD(mul)); |
if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) { |
if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) { |
nd_removecont2(d,g); |
nd_removecont2(d,g); |
|
|
return 1; |
return 1; |
} |
} |
|
|
int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full,ND *rp) |
int nd_nf_pbucket(int mod,ND g,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; |
int hindex,index; |
NDV p; |
NDV p; |
ND u,d,red; |
ND u,d,red; |
Line 1141 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 1079 int nd_nf(int mod,ND g,int full,ND *rp) |
|
} |
} |
red = ndv_mul_nm(mod,p,mul); |
red = ndv_mul_nm(mod,p,mul); |
bucket->body[hindex] = nd_remove_head(g); |
bucket->body[hindex] = nd_remove_head(g); |
|
bucket->len[hindex]--; |
red = nd_remove_head(red); |
red = nd_remove_head(red); |
add_pbucket(mod,bucket,red,LEN(p)-1); |
add_pbucket(mod,bucket,red,LEN(p)-1); |
sugar = MAX(sugar,SG(p)+TD(mul)); |
sugar = MAX(sugar,SG(p)+TD(mul)); |
Line 1170 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 1109 int nd_nf(int mod,ND g,int full,ND *rp) |
|
FREEND(g); g = 0; |
FREEND(g); g = 0; |
} |
} |
bucket->body[hindex] = g; |
bucket->body[hindex] = g; |
|
bucket->len[hindex]--; |
NEXT(m) = 0; |
NEXT(m) = 0; |
if ( d ) { |
if ( d ) { |
for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) ); |
for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) ); |
Line 1183 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 1123 int nd_nf(int mod,ND g,int full,ND *rp) |
|
|
|
int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full,ND *rp) |
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,dummy; |
|
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),&dummy); |
|
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; |
|
} |
|
|
|
int nd_nf_direct_pbucket(int mod,ND g,NDV *ps,int len,int full,ND *rp) |
|
{ |
int hindex,index; |
int hindex,index; |
NDV p; |
NDV p; |
ND u,d,red; |
ND u,d,red; |
Line 1245 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full |
|
Line 1261 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full |
|
} |
} |
red = ndv_mul_nm(mod,p,mul); |
red = ndv_mul_nm(mod,p,mul); |
bucket->body[hindex] = nd_remove_head(g); |
bucket->body[hindex] = nd_remove_head(g); |
|
bucket->len[hindex]--; |
red = nd_remove_head(red); |
red = nd_remove_head(red); |
add_pbucket(mod,bucket,red,LEN(p)-1); |
add_pbucket(mod,bucket,red,LEN(p)-1); |
sugar = MAX(sugar,SG(p)+TD(mul)); |
sugar = MAX(sugar,SG(p)+TD(mul)); |
Line 1274 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full |
|
Line 1291 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full |
|
FREEND(g); g = 0; |
FREEND(g); g = 0; |
} |
} |
bucket->body[hindex] = g; |
bucket->body[hindex] = g; |
|
bucket->len[hindex]--; |
NEXT(m) = 0; |
NEXT(m) = 0; |
if ( d ) { |
if ( d ) { |
for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) ); |
for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) ); |
Line 1284 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full |
|
Line 1302 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full |
|
} |
} |
} |
} |
} |
} |
#endif |
|
|
|
/* input : list of DP, cand : list of DP */ |
/* input : list of DP, cand : list of DP */ |
|
|
Line 1342 void free_pbucket(PGeoBucket b) { |
|
Line 1359 void free_pbucket(PGeoBucket b) { |
|
if ( b->body[i] ) { |
if ( b->body[i] ) { |
nd_free(b->body[i]); |
nd_free(b->body[i]); |
b->body[i] = 0; |
b->body[i] = 0; |
|
b->len[i] = 0; |
} |
} |
GC_free(b); |
GC_free(b); |
} |
} |
|
|
void add_pbucket(int mod,PGeoBucket g,ND d,int l) |
void add_pbucket(int mod,PGeoBucket g,ND d,int l) |
{ |
{ |
int k,m; |
int i,k,m,cancel; |
|
|
for ( k = 0, m = 1; l > m; k++, m <<= 2 ); |
for ( k = 0, m = 1; l > m; k++, m <<= 1 ); |
/* 4^(k-1) < l <= 4^k */ |
/* 2^(k-1) < l <= 2^k (=m) */ |
d = nd_add(mod,g->body[k],d); |
d = nd_add(mod,g->body[k],d,&cancel); |
for ( ; d && nd_length(d) > 1<<(2*k); k++ ) { |
l = g->len[k]+l-cancel; |
|
for ( ; d && l > m; k++, m <<= 1 ) { |
g->body[k] = 0; |
g->body[k] = 0; |
d = nd_add(mod,g->body[k+1],d); |
g->len[k] = 0; |
|
d = nd_add(mod,g->body[k+1],d,&cancel); |
|
l = g->len[k+1]+l-cancel; |
} |
} |
g->body[k] = d; |
g->body[k] = d; |
|
g->len[k] = l; |
g->m = MAX(g->m,k); |
g->m = MAX(g->m,k); |
} |
} |
|
|
Line 1399 int head_pbucket(int mod,PGeoBucket g) |
|
Line 1421 int head_pbucket(int mod,PGeoBucket g) |
|
if ( c > 0 ) { |
if ( c > 0 ) { |
if ( sum ) |
if ( sum ) |
HCM(gj) = sum; |
HCM(gj) = sum; |
else |
else { |
g->body[j] = nd_remove_head(gj); |
g->body[j] = nd_remove_head(gj); |
|
g->len[j]--; |
|
} |
j = i; |
j = i; |
gj = g->body[j]; |
gj = g->body[j]; |
dj = HDL(gj); |
dj = HDL(gj); |
Line 1410 int head_pbucket(int mod,PGeoBucket g) |
|
Line 1434 int head_pbucket(int mod,PGeoBucket g) |
|
if ( sum < 0 ) |
if ( sum < 0 ) |
sum += mod; |
sum += mod; |
g->body[i] = nd_remove_head(gi); |
g->body[i] = nd_remove_head(gi); |
|
g->len[i]--; |
} |
} |
} |
} |
} |
} |
Line 1418 int head_pbucket(int mod,PGeoBucket g) |
|
Line 1443 int head_pbucket(int mod,PGeoBucket g) |
|
else if ( sum ) { |
else if ( sum ) { |
HCM(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); |
|
g->len[j]--; |
|
} |
} |
} |
} |
} |
|
|
Line 1453 int head_pbucket_q(PGeoBucket g) |
|
Line 1480 int head_pbucket_q(PGeoBucket g) |
|
if ( c > 0 ) { |
if ( c > 0 ) { |
if ( sum ) |
if ( sum ) |
HCQ(gj) = sum; |
HCQ(gj) = sum; |
else |
else { |
g->body[j] = nd_remove_head(gj); |
g->body[j] = nd_remove_head(gj); |
|
g->len[j]--; |
|
} |
j = i; |
j = i; |
gj = g->body[j]; |
gj = g->body[j]; |
dj = HDL(gj); |
dj = HDL(gj); |
Line 1463 int head_pbucket_q(PGeoBucket g) |
|
Line 1492 int head_pbucket_q(PGeoBucket g) |
|
addq(sum,HCQ(gi),&t); |
addq(sum,HCQ(gi),&t); |
sum = t; |
sum = t; |
g->body[i] = nd_remove_head(gi); |
g->body[i] = nd_remove_head(gi); |
|
g->len[i]--; |
} |
} |
} |
} |
} |
} |
Line 1471 int head_pbucket_q(PGeoBucket g) |
|
Line 1501 int head_pbucket_q(PGeoBucket g) |
|
else if ( sum ) { |
else if ( sum ) { |
HCQ(gj) = sum; |
HCQ(gj) = sum; |
return j; |
return j; |
} else |
} else { |
g->body[j] = nd_remove_head(gj); |
g->body[j] = nd_remove_head(gj); |
|
g->len[j]--; |
|
} |
} |
} |
} |
} |
|
|
ND normalize_pbucket(int mod,PGeoBucket g) |
ND normalize_pbucket(int mod,PGeoBucket g) |
{ |
{ |
int i; |
int i,dummy; |
ND r,t; |
ND r,t; |
|
|
r = 0; |
r = 0; |
for ( i = 0; i <= g->m; i++ ) { |
for ( i = 0; i <= g->m; i++ ) { |
r = nd_add(mod,r,g->body[i]); |
r = nd_add(mod,r,g->body[i],&dummy); |
g->body[i] = 0; |
g->body[i] = 0; |
|
g->len[i] = 0; |
} |
} |
g->m = -1; |
g->m = -1; |
return r; |
return r; |
|
|
d = nd_reconstruct(m,0,d); |
d = nd_reconstruct(m,0,d); |
goto again; |
goto again; |
} |
} |
stat = nd_nf(m,h,!Top,&nf); |
stat = m?nd_nf_pbucket(m,h,!Top,&nf):nd_nf(m,h,!Top,&nf); |
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
d = nd_reconstruct(m,0,d); |
d = nd_reconstruct(m,0,d); |
|
|
d = nd_reconstruct(m,1,d); |
d = nd_reconstruct(m,1,d); |
goto again; |
goto again; |
} |
} |
stat = nd_nf(m,h,!Top,&nf); |
stat = nd_nf_pbucket(m,h,!Top,&nf); |
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
d = nd_reconstruct(m,1,d); |
d = nd_reconstruct(m,1,d); |
Line 2821 int nd_sp(int mod,ND_pairs p,ND *rp) |
|
Line 2854 int nd_sp(int mod,ND_pairs p,ND *rp) |
|
NDV p1,p2; |
NDV p1,p2; |
ND t1,t2; |
ND t1,t2; |
unsigned int *lcm; |
unsigned int *lcm; |
int td; |
int td,dummy; |
|
|
if ( mod ) { |
if ( mod ) { |
p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2]; |
p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2]; |
Line 2846 int nd_sp(int mod,ND_pairs p,ND *rp) |
|
Line 2879 int nd_sp(int mod,ND_pairs p,ND *rp) |
|
return 0; |
return 0; |
} |
} |
t2 = ndv_mul_nm(mod,p2,m); |
t2 = ndv_mul_nm(mod,p2,m); |
*rp = nd_add(mod,t1,t2); |
*rp = nd_add(mod,t1,t2,&dummy); |
FREENM(m); |
FREENM(m); |
return 1; |
return 1; |
} |
} |