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.43 and 1.55

version 1.43, 2003/08/22 07:12:49

version 1.55, 2003/09/03 07:33:35

Line 1

/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.42 2003/08/21 08:20:06 noro Exp $ */

/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.54 2003/08/31 07:42:23 noro Exp $ */

#include "ca.h"

#include "inline.h"

Line 85 typedef struct oBlockMask {

unsigned int **mask;

} *BlockMask;

int (*nd_compare_function)(unsigned int *a1,unsigned int *a2);

typedef struct oBaseSet {

int len;

NDV *ps;

unsigned int **bound;

} *BaseSet;

int (*ndl_compare_function)(unsigned int *a1,unsigned int *a2);

static double nd_scale=2;

static unsigned int **nd_bound;

static struct order_spec *nd_ord;

Line 103 static ND _nd_free_list;

Line 109 static ND _nd_free_list;

static ND_pairs _ndp_free_list;

static NDV *nd_ps;

static NDV *nd_psq;

static NDV *nd_ps_trace;

static RHist *nd_psh;

static int nd_psn,nd_pslen;

Line 114 static int nm_adv;

Line 120 static int nm_adv;

static int nmv_adv;

static int nd_dcomp;

extern int Top,Reverse,dp_nelim;

extern int Top,Reverse,dp_nelim,do_weyl;

/* fundamental macros */

#define TD(d) (d[0])

Line 130 extern int Top,Reverse,dp_nelim;

Line 136 extern int Top,Reverse,dp_nelim;

#define LCM(a) ((a)->lcm)

#define GET_EXP(d,a) (((d)[nd_epos[a].i]>>nd_epos[a].s)&nd_mask0)

#define PUT_EXP(r,a,e) ((r)[nd_epos[a].i] |= ((e)<<nd_epos[a].s))

#define XOR_EXP(r,a,e) ((r)[nd_epos[a].i] ^= ((e)<<nd_epos[a].s))

/* macros for term comparison */

#define TD_DL_COMPARE(d1,d2)\

Line 139 extern int Top,Reverse,dp_nelim;

Line 146 extern int Top,Reverse,dp_nelim;

(nd_dcomp>0?TD_DL_COMPARE(d1,d2)\

:(nd_dcomp==0?ndl_lex_compare(d1,d2)\

:(nd_blockmask?ndl_block_compare(d1,d2)\

:(*nd_compare_function)(d1,d2))))

:(*ndl_compare_function)(d1,d2))))

#else

#define DL_COMPARE(d1,d2)\

(nd_dcomp>0?TD_DL_COMPARE(d1,d2):(*nd_compare_function)(d1,d2))

(nd_dcomp>0?TD_DL_COMPARE(d1,d2):(*ndl_compare_function)(d1,d2))

#endif

/* allocators */

Line 211 int crit_2( int dp1, int dp2 );

Line 218 int crit_2( int dp1, int dp2 );

/* top level functions */

void nd_gr(LIST f,LIST v,int m,struct order_spec *ord,LIST *rp);

void nd_gr_trace(LIST f,LIST v,int m,int homo,struct order_spec *ord,LIST *rp);

void nd_gr_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp);

NODE nd_gb(int m,int checkonly);

NODE nd_gb_trace(int m);

Line 226 INLINE int ndl_block_compare(unsigned int *d1,unsigned

Line 233 INLINE int ndl_block_compare(unsigned int *d1,unsigned

INLINE int ndl_equal(unsigned int *d1,unsigned int *d2);

INLINE void ndl_copy(unsigned int *d1,unsigned int *d2);

INLINE void ndl_add(unsigned int *d1,unsigned int *d2,unsigned int *d);

INLINE void ndl_addto(unsigned int *d1,unsigned int *d2);

INLINE void ndl_sub(unsigned int *d1,unsigned int *d2,unsigned int *d);

INLINE int ndl_hash_value(unsigned int *d);

/* normal forms */

INLINE int nd_find_reducer(ND g);

INLINE int nd_find_reducer_direct(ND g,NDV *ps,int len);

int nd_sp(int mod,int trace,ND_pairs p,ND *nf);

int nd_nf(int mod,ND g,NDV *ps,int full,ND *nf);

int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *nf);

int nd_nf_direct(int mod,ND g,BaseSet base,int full,ND *rp);

/* normal forms */

int nd_sp(int mod,ND_pairs p,ND *nf);

int nd_find_reducer(ND g);

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

/* finalizers */

NODE nd_reducebase(NODE x);

NODE nd_reduceall(int m,NODE f);

Line 267 void nd_reconstruct_direct(int mod,NDV *ps,int len);

Line 272 void nd_reconstruct_direct(int mod,NDV *ps,int len);

void nd_setup(int mod,int trace,NODE f);

void nd_setup_parameters();

BlockMask nd_create_blockmask(struct order_spec *ord);

int nd_get_exporigin(struct order_spec *ord);

/* ND functions */

int nd_check_candidate(NODE input,NODE cand);

Line 275 void nd_mul_c_q(ND p,Q mul);

Line 281 void nd_mul_c_q(ND p,Q mul);

ND nd_remove_head(ND p);

int nd_length(ND p);

void nd_append_red(unsigned int *d,int i);

unsigned int *nd_compute_bound(ND p);

unsigned int *ndv_compute_bound(NDV p);

unsigned int *dp_compute_bound(DP p);

ND nd_copy(ND p);

ND nd_add(int mod,ND p1,ND p2);

Line 283 ND nd_add_q(ND p1,ND p2);

Line 289 ND nd_add_q(ND p1,ND p2);

INLINE int nd_length(ND p);

/* NDV functions */

ND weyl_ndv_mul_nm(int mod,NM m0,NDV p);

void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *tab,int tlen);

void weyl_mul_nm_nmv_q(int n,NM m0,NMV m1,NM *tab,int tlen);

void ndv_mul_c(int mod,NDV p,int mul);

void ndv_mul_c_q(NDV p,Q mul);

void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos);

ND ndv_mul_nm(int mod,NDV p,NM m0);

ND ndv_mul_nm(int mod,NM m0,NDV p);

void ndv_dehomogenize(NDV p);

void ndv_dehomogenize(NDV p,struct order_spec *spec);

void ndv_removecont(int mod,NDV p);

void ndv_print(NDV p);

void ndv_print_q(NDV p);

Line 422 INLINE int ndl_reducible(unsigned int *d1,unsigned int

Line 431 INLINE int ndl_reducible(unsigned int *d1,unsigned int

}

/* XXX : block order not supported */

void ndl_dehomogenize(unsigned int *d)

{

unsigned int mask;

unsigned int h;

int i,bits;

if ( nd_isrlex ) {

if ( nd_blockmask ) {

if ( nd_bpe == 32 ) {

h = GET_EXP(d,nd_nvar-1);

h = d[nd_exporigin];

XOR_EXP(d,nd_nvar-1,h);

for ( i = nd_exporigin+1; i < nd_wpd; i++ )

TD(d) -= h;

d[i-1] = d[i];

d[nd_exporigin-1] -= h;

d[i-1] = 0;

} else {

TD(d) -= h;

if ( nd_isrlex ) {

if ( nd_bpe == 32 ) {

h = d[nd_exporigin];

for ( i = nd_exporigin+1; i < nd_wpd; i++ )

d[i-1] = d[i];

d[i-1] = 0;

TD(d) -= h;

} else {

bits = nd_epw*nd_bpe;

mask = bits==32?0xffffffff:((1<<(nd_epw*nd_bpe))-1);

h = (d[nd_exporigin]>>((nd_epw-1)*nd_bpe))&nd_mask0;

for ( i = nd_exporigin; i < nd_wpd; i++ )

d[i] = ((d[i]<<nd_bpe)&mask)

|(i+1<nd_wpd?((d[i+1]>>((nd_epw-1)*nd_bpe))&nd_mask0):0);

TD(d) -= h;

}

} else {

bits = nd_epw*nd_bpe;

h = GET_EXP(d,nd_nvar-1);

mask = bits==32?0xffffffff:((1<<(nd_epw*nd_bpe))-1);

XOR_EXP(d,nd_nvar-1,h);

h = (d[nd_exporigin]>>((nd_epw-1)*nd_bpe))&nd_mask0;

for ( i = nd_exporigin; i < nd_wpd; i++ )

d[i] = ((d[i]<<nd_bpe)&mask)

|(i+1<nd_wpd?((d[i+1]>>((nd_epw-1)*nd_bpe))&nd_mask0):0);

TD(d) -= h;

}

} else

}

TD(d) -= ((d[(nd_nvar-1)/nd_epw+nd_exporigin]>>

((nd_epw-((nd_nvar-1)%nd_epw)-1)*nd_bpe))&((1<<nd_bpe)-1));

}

void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned int *d)

Line 570 int ndl_block_compare(unsigned int *d1,unsigned int *d

Line 586 int ndl_block_compare(unsigned int *d1,unsigned int *d

{

int i,l,j,ord_o,ord_l;

struct order_pair *op;

unsigned int t1,t2;

unsigned int t1,t2,m;

unsigned int *mask;

l = nd_blockmask->n;

Line 579 int ndl_block_compare(unsigned int *d1,unsigned int *d

Line 595 int ndl_block_compare(unsigned int *d1,unsigned int *d

mask = nd_blockmask->mask[j];

ord_o = op[j].order;

if ( ord_o < 2 )

if ( d1[j+1] > d2[j+1] ) return 1;

if ( (t1=d1[j+1]) > (t2=d2[j+1]) ) return 1;

else if ( d1[j+1] < d2[j+1] ) return -1;

else if ( t1 < t2 ) return -1;

for ( i = nd_exporigin; i < nd_wpd; i++ ) {

t1 = d1[i]&mask[i];

m = mask[i];

t2 = d2[i]&mask[i];

t1 = d1[i]&m;

t2 = d2[i]&m;

if ( t1 > t2 )

return !ord_o ? -1 : 1;

else if ( t1 < t2 )

Line 648 INLINE void ndl_add(unsigned int *d1,unsigned int *d2,

Line 665 INLINE void ndl_add(unsigned int *d1,unsigned int *d2,

#endif

}

/* d1 += d2 */

INLINE void ndl_addto(unsigned int *d1,unsigned int *d2)

{

int i;

#if 1

switch ( nd_wpd ) {

case 2:

TD(d1) += TD(d2);

d1[1] += d2[1];

break;

case 3:

TD(d1) += TD(d2);

d1[1] += d2[1];

d1[2] += d2[2];

break;

default:

for ( i = 0; i < nd_wpd; i++ ) d1[i] += d2[i];

break;

}

#else

for ( i = 0; i < nd_wpd; i++ ) d1[i] += d2[i];

#endif

}

INLINE void ndl_sub(unsigned int *d1,unsigned int *d2,unsigned int *d)

{

int i;

Line 793 int ndl_check_bound2(int index,unsigned int *d2)

Line 835 int ndl_check_bound2(int index,unsigned int *d2)

int ndl_check_bound2_direct(unsigned int *d1,unsigned int *d2)

{

unsigned int u1,u2;

unsigned int u2;

int i,j,k;

int i,j,ind,k;

ind = 0;

switch ( nd_bpe ) {

case 4:

for ( i = nd_exporigin; i < nd_wpd; i++ ) {

u1 = d1[i]; u2 = d2[i];

u2 = d2[i];

if ( ((u1>>28)&0xf)+((u2>>28)&0xf) >= 0x10 ) return 1;

if ( d1[ind++]+((u2>>28)&0xf) >= 0x10 ) return 1;

if ( ((u1>>24)&0xf)+((u2>>24)&0xf) >= 0x10 ) return 1;

if ( d1[ind++]+((u2>>24)&0xf) >= 0x10 ) return 1;

if ( ((u1>>20)&0xf)+((u2>>20)&0xf) >= 0x10 ) return 1;

if ( d1[ind++]+((u2>>20)&0xf) >= 0x10 ) return 1;

if ( ((u1>>16)&0xf)+((u2>>16)&0xf) >= 0x10 ) return 1;

if ( d1[ind++]+((u2>>16)&0xf) >= 0x10 ) return 1;

if ( ((u1>>12)&0xf)+((u2>>12)&0xf) >= 0x10 ) return 1;

if ( d1[ind++]+((u2>>12)&0xf) >= 0x10 ) return 1;

if ( ((u1>>8)&0xf)+((u2>>8)&0xf) >= 0x10 ) return 1;

if ( d1[ind++]+((u2>>8)&0xf) >= 0x10 ) return 1;

if ( ((u1>>4)&0xf)+((u2>>4)&0xf) >= 0x10 ) return 1;

if ( d1[ind++]+((u2>>4)&0xf) >= 0x10 ) return 1;

if ( (u1&0xf)+(u2&0xf) >= 0x10 ) return 1;

if ( d1[ind++]+(u2&0xf) >= 0x10 ) return 1;

}

return 0;

break;

case 6:

for ( i = nd_exporigin; i < nd_wpd; i++ ) {

u1 = d1[i]; u2 = d2[i];

u2 = d2[i];

if ( ((u1>>24)&0x3f)+((u2>>24)&0x3f) >= 0x40 ) return 1;

if ( d1[ind++]+((u2>>24)&0x3f) >= 0x40 ) return 1;

if ( ((u1>>18)&0x3f)+((u2>>18)&0x3f) >= 0x40 ) return 1;

if ( d1[ind++]+((u2>>18)&0x3f) >= 0x40 ) return 1;

if ( ((u1>>12)&0x3f)+((u2>>12)&0x3f) >= 0x40 ) return 1;

if ( d1[ind++]+((u2>>12)&0x3f) >= 0x40 ) return 1;

if ( ((u1>>6)&0x3f)+((u2>>6)&0x3f) >= 0x40 ) return 1;

if ( d1[ind++]+((u2>>6)&0x3f) >= 0x40 ) return 1;

if ( (u1&0x3f)+(u2&0x3f) >= 0x40 ) return 1;

if ( d1[ind++]+(u2&0x3f) >= 0x40 ) return 1;

}

return 0;

break;

case 8:

for ( i = nd_exporigin; i < nd_wpd; i++ ) {

u1 = d1[i]; u2 = d2[i];

u2 = d2[i];

if ( ((u1>>24)&0xff)+((u2>>24)&0xff) >= 0x100 ) return 1;

if ( d1[ind++]+((u2>>24)&0xff) >= 0x100 ) return 1;

if ( ((u1>>16)&0xff)+((u2>>16)&0xff) >= 0x100 ) return 1;

if ( d1[ind++]+((u2>>16)&0xff) >= 0x100 ) return 1;

if ( ((u1>>8)&0xff)+((u2>>8)&0xff) >= 0x100 ) return 1;

if ( d1[ind++]+((u2>>8)&0xff) >= 0x100 ) return 1;

if ( (u1&0xff)+(u2&0xff) >= 0x100 ) return 1;

if ( d1[ind++]+(u2&0xff) >= 0x100 ) return 1;

}

return 0;

break;

case 16:

for ( i = nd_exporigin; i < nd_wpd; i++ ) {

u1 = d1[i]; u2 = d2[i];

u2 = d2[i];

if ( ((u1>>16)&0xffff)+((u2>>16)&0xffff) > 0x10000 ) return 1;

if ( d1[ind++]+((u2>>16)&0xffff) > 0x10000 ) return 1;

if ( (u2&0xffff)+(u2&0xffff) > 0x10000 ) return 1;

if ( d1[ind++]+(u2&0xffff) > 0x10000 ) return 1;

}

return 0;

break;

Line 847 int ndl_check_bound2_direct(unsigned int *d1,unsigned

Line 890 int ndl_check_bound2_direct(unsigned int *d1,unsigned

break;

default:

for ( i = nd_exporigin; i < nd_wpd; i++ ) {

u1 = d1[i]; u2 = d2[i];

u2 = d2[i];

k = (nd_epw-1)*nd_bpe;

for ( j = 0; j < nd_epw; j++, k -= nd_bpe )

if ( ((u1>>k)&nd_mask0)+((u2>>k)&nd_mask0) > nd_mask0 )

if ( d1[ind++]+((u2>>k)&nd_mask0) > nd_mask0 ) return 1;

return 1;

}

return 0;

break;

Line 916 INLINE int nd_find_reducer_direct(ND g,NDV *ps,int len

Line 958 INLINE int nd_find_reducer_direct(ND g,NDV *ps,int len

if ( Reverse )

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

r = ps[i];

if ( ndl_reducible(HDL(g),HDL(r)) ) {

if ( ndl_reducible(HDL(g),HDL(r)) )

nd_append_red(HDL(g),i);

return i;

}

else

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

r = ps[i];

if ( ndl_reducible(HDL(g),HDL(r)) ) {

if ( ndl_reducible(HDL(g),HDL(r)) )

nd_append_red(HDL(g),i);

return i;

}

return -1;

}

Line 1029 ND nd_add_q(ND p1,ND p2)

Line 1067 ND nd_add_q(ND p1,ND p2)

}

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

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

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

{

ND d;

NM m,mrd,tail;

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

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

nd_free(g); nd_free(d);

return 0;

}

p = ps[index];

if ( mod ) {

p = nd_ps[index];

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

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

} else {

p = nd_psq[index];

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

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

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

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

nd_removecont2(d,g);

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

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

return 1;

}

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

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

{

int hindex,index;

NDV p;

Line 1140 int nd_nf_pbucket(int mod,ND g,int full,ND *rp)

Line 1177 int nd_nf_pbucket(int mod,ND g,int full,ND *rp)

*rp = 0;

return 0;

}

p = ps[index];

if ( mod ) {

p = nd_ps[index];

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

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

} else {

p = nd_psq[index];

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

chsgnq(cg,&CQ(mul));

nd_mul_c_q(d,cred);

Line 1153 int nd_nf_pbucket(int mod,ND g,int full,ND *rp)

Line 1189 int nd_nf_pbucket(int mod,ND g,int full,ND *rp)

g = bucket->body[hindex];

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

}

red = ndv_mul_nm(mod,p,mul);

red = ndv_mul_nm(mod,mul,p);

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

red = nd_remove_head(red);

add_pbucket(mod,bucket,red);

Line 1193 int nd_nf_pbucket(int mod,ND g,int full,ND *rp)

Line 1229 int nd_nf_pbucket(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,BaseSet base,int full,ND *rp)

{

ND d;

NM m,mrd,tail;

NM mul;

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

NDV *ps;

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

int c,c1,c2;

unsigned int **bound;

RHist h;

NDV p,red;

Q cg,cred,gcd;

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

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

hmag = 0;

#endif

ps = base->ps;

bound = base->bound;

len = base->len;

sugar0 = sugar = SG(g);

n = NV(g);

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

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

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

if ( index >= 0 ) {

p = ps[index];

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

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

if ( ndl_check_bound2_direct(bound[index],DL(mul)) ) {

nd_free(g); nd_free(d);

return 0;

}

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

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

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

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

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

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

nd_removecont2(d,g);

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

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

return 1;

}

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

{

int hindex,index;

NDV p;

ND u,d,red;

NODE l;

NM mul,m,mrd,tail;

int sugar,psugar,n,h_reducible;

PGeoBucket bucket;

int c,c1,c2;

Q cg,cred,gcd,zzz;

RHist h;

double hmag,gmag;

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;

#else

/* XXX */

hmag = 0;

#endif

bucket = create_pbucket();

add_pbucket(mod,bucket,g);

d = 0;

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

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

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

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

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

sugar = MAX(sugar,SG(p)+TD(DL(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);

}

} else if ( !full ) {

g = normalize_pbucket(mod,bucket);

if ( g ) SG(g) = sugar;

*rp = g;

return 1;

} else {

m = BDY(g);

if ( NEXT(m) ) {

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

} else {

FREEND(g); g = 0;

}

bucket->body[hindex] = g;

NEXT(m) = 0;

if ( d ) {

NEXT(tail)=m; tail=m; LEN(d)++;

} else {

MKND(n,m,1,d); tail = BDY(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;

NODE t,s;

#if 0

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

MKNODE(s,BDY(cand),t); t = s;

}

cand = t;

#endif

nd_setup(0,0,cand);

n = length(cand);

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

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

again:

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

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

stat = nd_nf(0,d,nd_ps,0,&nf);

if ( !stat ) nd_reconstruct_direct(0,nd_psq,n);

if ( !stat ) {

else if ( nf ) return 0;

nd_reconstruct(0,0,0);

goto again;

} else if ( nf ) return 0;

printf("."); fflush(stdout);

}

printf("\n");

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

if ( !nd_gb(0,1) ) return 0;

/* XXX */

Line 1568 again:

Line 1521 again:

sugar = SG(l);

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

}

stat = nd_sp(m,l,&h);

stat = nd_sp(m,0,l,&h);

if ( !stat ) {

NEXT(l) = d; d = l;

d = nd_reconstruct(m,0,d);

goto again;

}

#if USE_GEOBUCKET

stat = m?nd_nf_pbucket(m,h,!Top,&nf):nd_nf(m,h,!Top,&nf);

stat = m?nd_nf_pbucket(m,h,nd_ps,!Top,&nf):nd_nf(m,h,nd_ps,!Top,&nf);

#else

stat = nd_nf(m,h,!Top,&nf);

stat = nd_nf(m,h,nd_ps,!Top,&nf);

#endif

if ( !stat ) {

NEXT(l) = d; d = l;

Line 1586 again:

Line 1539 again:

} else if ( nf ) {

if ( checkonly ) return 0;

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

nh = m?nd_newps(m,nf,0):nd_newps(m,0,nf);

nh = nd_newps(m,nf,0);

d = update_pairs(d,g,nh);

g = update_base(g,nh);

FREENDP(l);

Line 1595 again:

Line 1548 again:

FREENDP(l);

}

if ( m )

for ( t = g; t; t = NEXT(t) ) BDY(t) = (pointer)nd_ps[(int)BDY(t)];

else

for ( t = g; t; t = NEXT(t) ) BDY(t) = (pointer)nd_psq[(int)BDY(t)];

return g;

}

Line 1623 again:

Line 1573 again:

sugar = SG(l);

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

}

stat = nd_sp(m,l,&h);

stat = nd_sp(m,0,l,&h);

if ( !stat ) {

NEXT(l) = d; d = l;

d = nd_reconstruct(m,1,d);

goto again;

}

#if USE_GEOBUCKET

stat = nd_nf_pbucket(m,h,!Top,&nf);

stat = nd_nf_pbucket(m,h,nd_ps,!Top,&nf);

#else

stat = nd_nf(m,h,!Top,&nf);

stat = nd_nf(m,h,nd_ps,!Top,&nf);

#endif

if ( !stat ) {

NEXT(l) = d; d = l;

Line 1640 again:

Line 1590 again:

goto again;

} else if ( nf ) {

/* overflow does not occur */

nd_sp(0,l,&h);

nd_sp(0,1,l,&h);

nd_nf(0,h,!Top,&nfq);

nd_nf(0,h,nd_ps_trace,!Top,&nfq);

if ( nfq ) {

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

nh = nd_newps(m,nf,nfq);

Line 1658 again:

Line 1608 again:

FREENDP(l);

}

for ( t = g; t; t = NEXT(t) )

BDY(t) = (pointer)nd_psq[(int)BDY(t)];

BDY(t) = (pointer)nd_ps_trace[(int)BDY(t)];

return g;

}

Line 1678 NODE nd_reduceall(int m,NODE f)

Line 1628 NODE nd_reduceall(int m,NODE f)

NDV *w,*ps;

ND nf,g;

NODE t,a0,a;

struct oBaseSet base;

unsigned int **bound;

for ( n = 0, t = f; t; t = NEXT(t), n++ );

ps = (NDV *)ALLOCA(n*sizeof(NDV));

for ( i = 0, t = f; i < n; i++, t = NEXT(t) )

bound = (unsigned int **)ALLOCA(n*sizeof(unsigned int *));

ps[i] = (NDV)BDY(t);

for ( i = 0, t = f; i < n; i++, t = NEXT(t) ) ps[i] = (NDV)BDY(t);

qsort(ps,n,sizeof(NDV),(int (*)(const void *,const void *))ndv_compare);

w = (NDV *)ALLOCA((n-1)*sizeof(NDV));

for ( i = 0; i < n; i++ ) bound[i] = ndv_compute_bound(ps[i]);

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

base.ps = (NDV *)ALLOCA((n-1)*sizeof(NDV));

for ( j = 0; j < i; j++ ) w[j] = (NDV)ps[j];

base.bound = (unsigned int **)ALLOCA((n-1)*sizeof(unsigned int *));

for ( j = i+1; j < n; j++ ) w[j-1] = ps[j];

base.len = n-1;

i = 0;

while ( i < n ) {

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

base.ps[j] = ps[j]; base.bound[j] = bound[j];

}

for ( j = i+1; j < n; j++ ) {

base.ps[j-1] = ps[j]; base.bound[j-1] = bound[j];

}

g = ndvtond(m,ps[i]);

stat = nd_nf_direct(m,g,w,n-1,1,&nf);

stat = nd_nf_direct(m,g,&base,1,&nf);

if ( !stat )

nd_reconstruct_direct(m,ps,n);

else if ( !nf ) {

printf("."); fflush(stdout);

ndv_free(ps[i]);

for ( j = i+1; j < n; j++ ) ps[j-1] = ps[j];

for ( j = i+1; j < n; j++ ) {

ps[j-1] = ps[j]; bound[j-1] = bound[j];

}

n--;

base.len = n-1;

} else {

printf("."); fflush(stdout);

ndv_free(ps[i]);

nd_removecont(m,nf);

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

bound[i] = ndv_compute_bound(ps[i]);

nd_free(nf);

i++;

}

printf("\n");

for ( a0 = 0, i = 0; i < n; i++ ) {

NEXTNODE(a0,a);

BDY(a) = (pointer)ps[i];

Line 1722 ND_pairs update_pairs( ND_pairs d, NODE /* of index */

Line 1688 ND_pairs update_pairs( ND_pairs d, NODE /* of index */

d1 = nd_newpairs(g,t);

d1 = crit_M(d1);

d1 = crit_F(d1);

prev = 0; cur = head = d1;

if ( do_weyl )

while ( cur ) {

head = d1;

if ( crit_2( cur->i1,cur->i2 ) ) {

else {

remove = cur;

prev = 0; cur = head = d1;

if ( !prev ) head = cur = NEXT(cur);

while ( cur ) {

else cur = NEXT(prev) = NEXT(cur);

if ( crit_2( cur->i1,cur->i2 ) ) {

FREENDP(remove);

remove = cur;

} else {

if ( !prev ) head = cur = NEXT(cur);

prev = cur; cur = NEXT(cur);

else cur = NEXT(prev) = NEXT(cur);

FREENDP(remove);

} else {

prev = cur; cur = NEXT(cur);

}

if ( !d )

Line 1955 int nd_newps(int mod,ND a,ND aq)

Line 1925 int nd_newps(int mod,ND a,ND aq)

RHist r;

NDV b;

if ( aq ) {

/* trace lifting */

if ( !rem(NM(HCQ(aq)),mod) )

return -1;

}

if ( nd_psn == nd_pslen ) {

nd_pslen *= 2;

nd_ps = (NDV *)REALLOC((char *)nd_ps,nd_pslen*sizeof(NDV));

nd_psq = (NDV *)REALLOC((char *)nd_psq,nd_pslen*sizeof(NDV));

nd_ps_trace = (NDV *)REALLOC((char *)nd_ps_trace,nd_pslen*sizeof(NDV));

nd_psh = (RHist *)REALLOC((char *)nd_psh,nd_pslen*sizeof(RHist));

nd_bound = (unsigned int **)

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

}

if ( a && aq ) {

/* trace lifting */

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

}

NEWRHist(r); nd_psh[nd_psn] = r;

nd_removecont(mod,a); nd_ps[nd_psn] = ndtondv(mod,a);

if ( aq ) {

nd_removecont(0,aq);

nd_removecont(0,aq); nd_ps_trace[nd_psn] = ndtondv(0,aq);

nd_psq[nd_psn] = ndtondv(0,aq);

nd_bound[nd_psn] = ndv_compute_bound(nd_ps_trace[nd_psn]);

nd_bound[nd_psn] = nd_compute_bound(aq);

SG(r) = SG(aq); ndl_copy(HDL(aq),DL(r));

nd_free(a); nd_free(aq);

} else {

nd_bound[nd_psn] = ndv_compute_bound(nd_ps[nd_psn]);

SG(r) = SG(a); ndl_copy(HDL(a),DL(r));

nd_free(a);

}

if ( a ) {

nd_removecont(mod,a);

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

if ( !aq ) {

nd_bound[nd_psn] = nd_compute_bound(a);

SG(r) = SG(a); ndl_copy(HDL(a),DL(r));

}

nd_free(a); nd_free(aq);

return nd_psn++;

}

Line 1998 void nd_setup(int mod,int trace,NODE f)

Line 1965 void nd_setup(int mod,int trace,NODE f)

nd_psn = length(f); nd_pslen = 2*nd_psn;

nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV));

nd_psq = (NDV *)MALLOC(nd_pslen*sizeof(NDV));

nd_ps_trace = (NDV *)MALLOC(nd_pslen*sizeof(NDV));

nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist));

nd_bound = (unsigned int **)MALLOC(nd_pslen*sizeof(unsigned int *));

for ( max = 0, i = 0, s = f; i < nd_psn; i++, s = NEXT(s) ) {

Line 2024 void nd_setup(int mod,int trace,NODE f)

Line 1991 void nd_setup(int mod,int trace,NODE f)

a = dptondv(mod,(DP)BDY(f)); ndv_removecont(mod,a);

SG(r) = HTD(a); ndl_copy(HDL(a),DL(r));

nd_ps[i] = a;

if ( trace ) {

nd_ps[i] = a;

a = dptondv(0,(DP)BDY(f)); ndv_removecont(0,a);

nd_psq[i] = a;

nd_ps_trace[i] = a;

} else {

if ( mod ) nd_ps[i] = a;

else nd_psq[i] = a;

}

nd_psh[i] = r;

}

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

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

x = nd_gb(m,0);

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

nd_found,nd_notfirst,nd_create);

x = nd_reducebase(x);

x = nd_reduceall(m,x);

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

NEXTNODE(r0,r);

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

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

MKLIST(*rp,r0);

}

void nd_gr_trace(LIST f,LIST v,int m,int homo,struct order_spec *ord,LIST *rp)

void nd_gr_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp)

{

struct order_spec ord1;

VL fv,vv,vc;

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

int m,nocheck,nvar,mindex;

DP a,b,c,h;

P p;

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

nd_nvar = length(vv);

nvar = length(vv);

nocheck = 0;

mindex = 0;

/* setup modulus */

if ( trace < 0 ) {

trace = -trace;

nocheck = 1;

}

m = trace > 1 ? trace : get_lprime(mindex);

initd(ord);

if ( homo ) {

homogenize_order(ord,nd_nvar,&ord1);

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

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

}

if ( fd0 ) NEXT(fd) = 0;

if ( in0 ) NEXT(in) = 0;

nd_init_ord(&ord1);

initd(&ord1);

nd_nvar++;

} else {

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

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

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

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

}

if ( fd0 ) NEXT(fd) = 0;

in0 = fd0;

nd_init_ord(ord);

}

do {

while ( 1 ) {

if ( homo ) {

nd_init_ord(&ord1);

initd(&ord1);

nd_nvar = nvar+1;

} else {

nd_init_ord(ord);

nd_nvar = nvar;

}

nd_setup(m,1,fd0);

cand = nd_gb_trace(m);

if ( !cand ) continue;

if ( !cand ) {

/* failure */

if ( trace > 1 ) {

*rp = 0; return;

} else

m = get_lprime(++mindex);

continue;

}

if ( homo ) {

/* dehomogenization */

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

ndv_dehomogenize((NDV)BDY(t));

ndv_dehomogenize((NDV)BDY(t),ord);

nd_nvar--;

nd_nvar = nvar;

nd_setup_parameters();

initd(ord);

cand = nd_reducebase(cand);

nd_init_ord(ord);

nd_setup_parameters();

}

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

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

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

}

if ( r0 ) NEXT(r) = 0;

cand = r0;

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

if ( nocheck || nd_check_candidate(in0,cand) )

/* success */

break;

else if ( trace > 1 ) {

/* failure */

*rp = 0; return;

} else

/* try the next modulus */

m = get_lprime(++mindex);

}

/* dp->p */

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

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

Line 2394 void ndv_removecont(int mod,NDV p)

Line 2392 void ndv_removecont(int mod,NDV p)

}

void ndv_dehomogenize(NDV p)

void ndv_dehomogenize(NDV p,struct order_spec *ord)

{

int i,len,newnvar,newwpd,newadv;

int i,j,adj,len,newnvar,newwpd,newadv,newexporigin;

Q *w;

Q dvr,t;

NMV m,r;

unsigned int *d;

#define NEWADV(m) (m = (NMV)(((char *)m)+newadv))

len = p->len;

newnvar = nd_nvar-1;

newwpd = newnvar/nd_epw+(newnvar%nd_epw?1:0)+nd_exporigin;

newexporigin = nd_get_exporigin(ord);

newwpd = newnvar/nd_epw+(newnvar%nd_epw?1:0)+newexporigin;

for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ )

ndl_dehomogenize(DL(m));

if ( newwpd != nd_wpd ) {

d = (unsigned int *)ALLOCA(newwpd*sizeof(unsigned int));

newadv = sizeof(struct oNMV)+(newwpd-1)*sizeof(unsigned int);

for ( m = r = BDY(p), i = 0; i < len; NMV_ADV(m), NEWADV(r), i++ ) {

CQ(r) = CQ(m); ndl_copy(DL(m),d); ndl_copy(d,DL(r));

CQ(r) = CQ(m);

for ( j = 0; j < newexporigin; j++ ) DL(r)[j] = DL(m)[j];

adj = nd_exporigin-newexporigin;

for ( ; j < newwpd; j++ ) DL(r)[j] = DL(m)[j+adj];

}

NV(p)--;

Line 2535 unsigned int *dp_compute_bound(DP p)

return t;

}

unsigned int *nd_compute_bound(ND p)

unsigned int *ndv_compute_bound(NDV p)

{

unsigned int *d1,*d2,*t;

int i,l;

int i,l,len;

NM m;

NMV m;

if ( !p )

return 0;

d1 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int));

d2 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int));

ndl_copy(HDL(p),d1);

len = LEN(p);

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

m = BDY(p); ndl_copy(DL(m),d1); NMV_ADV(m);

for ( i = 1; i < len; i++, NMV_ADV(m) ) {

ndl_lcm(DL(m),d1,d2);

t = d1; d1 = d2; d2 = t;

}

Line 2557 unsigned int *nd_compute_bound(ND p)

Line 2558 unsigned int *nd_compute_bound(ND p)

return t;

}

void nd_setup_parameters() {

int nd_get_exporigin(struct order_spec *ord)

int i,n,elen;

{

switch ( ord->id ) {

nd_epw = (sizeof(unsigned int)*8)/nd_bpe;

elen = nd_nvar/nd_epw+(nd_nvar%nd_epw?1:0);

switch ( nd_ord->id ) {

case 0:

nd_exporigin = 1;

return 1;

break;

case 1:

/* block order */

/* d[0]:weight d[1]:w0,...,d[nd_exporigin-1]:w(n-1) */

nd_exporigin = nd_ord->ord.block.length+1;

return ord->ord.block.length+1;

break;

case 2:

error("nd_setup_parameters : matrix order is not supported yet.");

error("nd_get_exporigin : matrix order is not supported yet.");

break;

}

void nd_setup_parameters() {

int i,n,elen;

nd_epw = (sizeof(unsigned int)*8)/nd_bpe;

elen = nd_nvar/nd_epw+(nd_nvar%nd_epw?1:0);

nd_exporigin = nd_get_exporigin(nd_ord);

nd_wpd = nd_exporigin+elen;

nd_epos = (EPOS)MALLOC_ATOMIC(nd_nvar*sizeof(struct oEPOS));

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

Line 2623 ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d)

Line 2626 ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d)

prev_ndp_free_list = _ndp_free_list;

_nm_free_list = 0;

_ndp_free_list = 0;

if ( mod != 0 )

for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_ps[i],obpe,oadv,oepos);

if ( trace )

if ( !mod || trace )

for ( i = nd_psn-1; i >= 0; i-- )

for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_psq[i],obpe,oadv,oepos);

ndv_realloc(nd_ps_trace[i],obpe,oadv,oepos);

s0 = 0;

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

NEXTND_pairs(s0,s);

Line 2668 ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d)

Line 2671 ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d)

void nd_reconstruct_direct(int mod,NDV *ps,int len)

{

int i,obpe,oadv,h;

unsigned int **bound;

NM prev_nm_free_list;

RHist mr0,mr;

RHist r;

Line 2690 void nd_reconstruct_direct(int mod,NDV *ps,int len)

Line 2694 void nd_reconstruct_direct(int mod,NDV *ps,int len)

prev_ndp_free_list = _ndp_free_list;

_nm_free_list = 0; _ndp_free_list = 0;

for ( i = len-1; i >= 0; i-- ) ndv_realloc(ps[i],obpe,oadv,oepos);

old_red = (RHist *)ALLOCA(REDTAB_LEN*sizeof(RHist));

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

old_red[i] = nd_red[i];

nd_red[i] = 0;

}

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

for ( r = old_red[i]; r; r = NEXT(r) ) {

NEWRHist(mr);

mr->index = r->index;

SG(mr) = SG(r);

ndl_reconstruct(obpe,oepos,DL(r),DL(mr));

h = ndl_hash_value(DL(mr));

NEXT(mr) = nd_red[h];

nd_red[h] = mr;

}

for ( i = 0; i < REDTAB_LEN; i++ ) old_red[i] = 0;

old_red = 0;

prev_nm_free_list = 0;

prev_ndp_free_list = 0;

GC_gcollect();

Line 2779 ND nd_copy(ND p)

Line 2766 ND nd_copy(ND p)

}

int nd_sp(int mod,ND_pairs p,ND *rp)

int nd_sp(int mod,int trace,ND_pairs p,ND *rp)

{

NM m;

NDV p1,p2;

Line 2787 int nd_sp(int mod,ND_pairs p,ND *rp)

Line 2774 int nd_sp(int mod,ND_pairs p,ND *rp)

unsigned int *lcm;

int td;

if ( mod ) {

if ( trace ) {

p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2];

p1 = nd_ps_trace[p->i1]; p2 = nd_ps_trace[p->i2];

} else {

p1 = nd_psq[p->i1]; p2 = nd_psq[p->i2];

p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2];

}

lcm = LCM(p);

NEWNM(m);

CQ(m) = HCQ(p2);

ndl_sub(lcm,HDL(p1),DL(m));

if ( ndl_check_bound2(p->i1,DL(m)) ) return 0;

t1 = ndv_mul_nm(mod,p1,m);

t1 = ndv_mul_nm(mod,m,p1);

if ( mod ) CM(m) = mod-HCM(p1);

else chsgnq(HCQ(p1),&CQ(m));

ndl_sub(lcm,HDL(p2),DL(m));

Line 2805 int nd_sp(int mod,ND_pairs p,ND *rp)

Line 2792 int nd_sp(int mod,ND_pairs p,ND *rp)

nd_free(t1);

return 0;

}

t2 = ndv_mul_nm(mod,p2,m);

t2 = ndv_mul_nm(mod,m,p2);

*rp = nd_add(mod,t1,t2);

FREENM(m);

return 1;

Line 2836 void ndv_mul_c_q(NDV p,Q mul)

Line 2823 void ndv_mul_c_q(NDV p,Q mul)

}

ND ndv_mul_nm(int mod,NDV p,NM m0)

ND weyl_ndv_mul_nm(int mod,NM m0,NDV p) {

int n2,i,j,l,n,tlen;

unsigned int *d0;

NM *tab,*psum;

ND s,r;

NM t;

NMV m1;

if ( !p ) return 0;

n = NV(p); n2 = n>>1;

d0 = DL(m0);

l = LEN(p);

for ( i = 0, tlen = 1; i < n2; i++ ) tlen *= (GET_EXP(d0,n2+i)+1);

tab = (NM *)ALLOCA(tlen*sizeof(NM));

psum = (NM *)ALLOCA(tlen*sizeof(NM));

for ( i = 0; i < tlen; i++ ) psum[i] = 0;

for ( i = l-1, m1 = BDY(p)+nmv_adv*(l-1); i >= 0; i--, m1 -= nmv_adv ) {

/* m0(NM) * m1(NMV) => tab(NM) */

if ( mod )

weyl_mul_nm_nmv(mod,n,m0,m1,tab,tlen);

else

weyl_mul_nm_nmv_q(n,m0,m1,tab,tlen);

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

if ( tab[j] ) {

NEXT(tab[j]) = psum[j]; psum[j] = tab[j];

}

for ( i = tlen-1, r = 0; i >= 0; i-- )

if ( psum[i] ) {

for ( j = 0, t = psum[i]; t; t = NEXT(t), j++ );

MKND(n,psum[i],j,s);

r = nd_add(mod,r,s);

}

if ( s ) SG(s) = SG(p)+TD(d0);

return s;

}

void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *tab,int tlen)

{

int i,n2,j,s,curlen,homo,h,a,b,k,l,min;

unsigned int *d0,*d1,*d,*ctab;

unsigned int c0,c1,c;

NM *p;

NM m,t;

for ( i = 0; i < tlen; i++ ) tab[i] = 0;

if ( !m0 || !m1 ) return;

d0 = DL(m0); d1 = DL(m1); n2 = n>>1;

NEWNM(m); d = DL(m);

c0 = CM(m0); c1 = CM(m1); DMAR(c1,c,0,mod,c); CM(m) = c;

for ( i = 0; i < nd_wpd; i++ ) d[i] = 0;

homo = n&1 ? 1 : 0;

if ( homo ) {

/* offset of h-degree */

h = GET_EXP(d0,n-1)+GET_EXP(d1,n-1);

PUT_EXP(DL(m),n-1,h);

TD(DL(m)) = h;

/* XXX other weights */

}

tab[0] = m;

curlen = 1;

s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i);

NEWNM(m); d = DL(m);

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

a = GET_EXP(d0,i); b = GET_EXP(d1,n2+i);

k = GET_EXP(d0,n2+i); l = GET_EXP(d1,i);

/* xi^a*(Di^k*xi^l)*Di^b */

a += l; b += k;

if ( !k || !l ) {

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

if ( m = tab[j] ) {

d = DL(m);

PUT_EXP(d,i,a); PUT_EXP(d,n2+i,b); TD(d) += s;

/* XXX other weights */

}

curlen *= k+1;

continue;

}

min = MIN(k,l);

ctab = (unsigned int *)ALLOCA((min+1)*sizeof(unsigned int));

mkwcm(k,l,mod,ctab);

for ( j = 0; j < nd_wpd; i++ ) d[j] = 0;

p = tab+curlen;

for ( j = 1; j <= min; j++ ) {

PUT_EXP(d,i,a-j); PUT_EXP(d,n2+i,b-j);

h = s-(MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i));

if ( homo ) {

TD(d) = s;

PUT_EXP(d,n-1,h);

} else TD(d) = h;

/* XXX other weights */

c = ctab[j];

for ( k = 0; k < curlen; k++, p++ ) {

NEWNM(t);

ndl_add(DL(tab[k]),d,DL(t));

c0 = CM(tab[k]); DMAR(c0,c,0,mod,c1); CM(t) = c1;

*p = t;

}

/* destructive for j = 0 */

PUT_EXP(d,i,a); PUT_EXP(d,n2+i,b);

h = s-(MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i));

if ( homo ) {

TD(d) = s;

PUT_EXP(d,n-1,h);

} else TD(d) = h;

/* XXX other weights */

c = ctab[0];

p = tab;

for ( k = 0; k < curlen; k++, p++ ) {

ndl_addto(DL(tab[k]),d);

c0 = CM(tab[k]); DMAR(c0,c,0,mod,c1); CM(tab[k]) = c1;

}

curlen *= k+1;

}

FREENM(m);

}

void weyl_mul_nm_nmv_q(int n,NM m0,NMV m1,NM *tab,int tlen)

{

int i,n2,j,s,curlen,homo,h,a,b,k,l,min;

unsigned int *d0,*d1,*d;

Q *ctab;

Q c0,c1,c;

NM *p;

NM m,t;

for ( i = 0; i < tlen; i++ ) tab[i] = 0;

if ( !m0 || !m1 ) return;

d0 = DL(m0); d1 = DL(m1); n2 = n>>1;

NEWNM(m); d = DL(m);

mulq(CQ(m0),CQ(m1),&CQ(m));

for ( i = 0; i < nd_wpd; i++ ) d[i] = 0;

homo = n&1 ? 1 : 0;

if ( homo ) {

/* offset of h-degree */

h = GET_EXP(d0,n-1)+GET_EXP(d1,n-1);

PUT_EXP(DL(m),n-1,h);

TD(DL(m)) = h;

/* XXX other weights */

}

tab[0] = m;

curlen = 1;

s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i);

NEWNM(m); d = DL(m);

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

a = GET_EXP(d0,i); b = GET_EXP(d1,n2+i);

k = GET_EXP(d0,n2+i); l = GET_EXP(d1,i);

/* xi^a*(Di^k*xi^l)*Di^b */

a += l; b += k;

if ( !k || !l ) {

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

if ( m = tab[j] ) {

d = DL(m);

PUT_EXP(d,i,a); PUT_EXP(d,n2+i,b); TD(d) += s;

/* XXX other weights */

}

curlen *= k+1;

continue;

}

min = MIN(k,l);

ctab = (Q *)ALLOCA((min+1)*sizeof(Q));

mkwc(k,l,ctab);

for ( j = 0; j < nd_wpd; i++ ) d[j] = 0;

p = tab+curlen;

for ( j = 1; j <= min; j++ ) {

PUT_EXP(d,i,a-j); PUT_EXP(d,n2+i,b-j);

h = s-(MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i));

if ( homo ) {

TD(d) = s;

PUT_EXP(d,n-1,h);

} else TD(d) = h;

/* XXX other weights */

c = ctab[j];

for ( k = 0; k < curlen; k++, p++ ) {

NEWNM(t);

ndl_add(DL(tab[k]),d,DL(t));

mulq(CQ(tab[k]),c,&CQ(t));

*p = t;

}

/* destructive for j = 0 */

PUT_EXP(d,i,a); PUT_EXP(d,n2+i,b);

h = s-(MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i));

if ( homo ) {

TD(d) = s;

PUT_EXP(d,n-1,h);

} else TD(d) = h;

/* XXX other weights */

c = ctab[0];

p = tab;

for ( k = 0; k < curlen; k++, p++ ) {

ndl_addto(DL(tab[k]),d);

mulq(CQ(tab[k]),c,&CQ(tab[k]));

}

curlen *= k+1;

}

FREENM(m);

}

ND ndv_mul_nm(int mod,NM m0,NDV p)

{

NM mr,mr0;

NMV m;

unsigned int *d,*dt,*dm;

Line 2846 ND ndv_mul_nm(int mod,NDV p,NM m0)

Line 3034 ND ndv_mul_nm(int mod,NDV p,NM m0)

ND r;

if ( !p ) return 0;

else if ( do_weyl )

return weyl_ndv_mul_nm(mod,m0,p);

else {

n = NV(p); m = BDY(p);

d = DL(m0);

Line 2949 NDV dptondv(int mod,DP p)

Line 3139 NDV dptondv(int mod,DP p)

DP q;

int l,i,n;

if ( !p ) return 0;

for ( t = BDY(p), l = 0; t; t = NEXT(t), l++ );

if ( mod ) {

_dp_mod(p,mod,0,&q); p = q;

}

if ( !p ) return 0;

for ( t = BDY(p), l = 0; t; t = NEXT(t), l++ );

if ( mod )

m0 = m = (NMV)MALLOC_ATOMIC(l*nmv_adv);

} else

else

m0 = m = (NMV)MALLOC(l*nmv_adv);

n = NV(p);

for ( t = BDY(p), i = 0; i < l; i++, t = NEXT(t), NMV_ADV(m) ) {

for ( t = BDY(p); t; t = NEXT(t), NMV_ADV(m) ) {

if ( mod ) CM(m) = ITOS(C(t));

else CQ(m) = (Q)C(t);

dltondl(n,DL(t),DL(m));

Line 3065 void nd_init_ord(struct order_spec *ord)

Line 3257 void nd_init_ord(struct order_spec *ord)

case 2:

nd_dcomp = 0;

nd_isrlex = 0;

ndl_compare_function = ndl_lex_compare;

break;

default:

error("nd_gr : unsupported order");

Line 3074 void nd_init_ord(struct order_spec *ord)

Line 3267 void nd_init_ord(struct order_spec *ord)

/* XXX */

nd_dcomp = -1;

nd_isrlex = 0;

nd_compare_function = ndl_block_compare;

ndl_compare_function = ndl_block_compare;

break;

case 2:

error("nd_init_ord : matrix order is not supported yet.");

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