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.20 and 1.39

version 1.20, 2003/08/01 05:03:15

version 1.39, 2003/08/21 03:13:01

Line 1

/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.19 2003/07/31 07:30:27 noro Exp $ */

/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.38 2003/08/20 08:56:29 noro Exp $ */

#include "ca.h"

#include "inline.h"

Line 11

#define INLINE

#endif

#define USE_GEOBUCKET 1

#define REDTAB_LEN 32003

typedef struct oPGeoBucket {

Line 21 typedef struct oPGeoBucket {

Line 23 typedef struct oPGeoBucket {

typedef struct oND {

struct oNM *body;

int nv;

int len;

int sugar;

} *ND;

typedef struct oNDV {

struct oNMV *body;

int nv;

int sugar;

int len;

int sugar;

} *NDV;

typedef struct oNM {

Line 37 typedef struct oNM {

Line 40 typedef struct oNM {

int m;

Q z;

} c;

int td;

unsigned int dl[1];

} *NM;

Line 46 typedef struct oNMV {

Line 48 typedef struct oNMV {

int m;

Q z;

} c;

int td;

unsigned int dl[1];

} *NMV;

typedef struct oRHist {

struct oRHist *next;

int index;

int td,sugar;

int sugar;

unsigned int dl[1];

} *RHist;

typedef struct oND_pairs {

struct oND_pairs *next;

int i1,i2;

int td,sugar;

int sugar;

unsigned int lcm[1];

} *ND_pairs;

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

double nd_scale=2;

static unsigned int **nd_bound;

int nd_nvar;

int is_rlex;

int nd_isrlex;

int nd_epw,nd_bpe,nd_wpd;

unsigned int nd_mask[32];

unsigned int nd_mask0,nd_mask1;

Line 77 ND_pairs _ndp_free_list;

Line 81 ND_pairs _ndp_free_list;

static NDV *nd_ps;

static NDV *nd_psq;

int *nd_psl;

RHist *nd_psh;

int nd_psn,nd_pslen;

Line 87 int nd_red_len;

Line 90 int nd_red_len;

int nd_found,nd_create,nd_notfirst;

int nm_adv;

int nmv_adv;

int nmv_len;

int nd_dcomp;

NDV ndv_red;

extern int Top,Reverse;

extern int Top,Reverse,dp_nelim;

#define HTD(d) ((d)->body->td)

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

#define HDL(d) ((d)->body->dl)

#define HTD(d) (TD(HDL(d)))

#define HCM(d) ((d)->body->c.m)

#define HCQ(d) ((d)->body->c.z)

#define CM(a) ((a)->c.m)

#define CQ(a) ((a)->c.z)

#define DL(a) ((a)->dl)

#define TD(a) ((a)->td)

#define SG(a) ((a)->sugar)

#define LEN(a) ((a)->len)

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

#define TD_DL_COMPARE(d1,d2)\

(TD(d1)>TD(d2)?1:(TD(d1)<TD(d2)?-1:ndl_lex_compare(d1+1,d2+1)))

#define DL_COMPARE(d1,d2)\

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

#define NM_ADV(m) (m = (NM)(((char *)m)+nm_adv))

#define NEWRHist(r) \

((r)=(RHist)MALLOC(sizeof(struct oRHist)+(nd_wpd-1)*sizeof(unsigned int)))

((r)=(RHist)MALLOC(sizeof(struct oRHist)+nd_wpd*sizeof(unsigned int)))

#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) \

#define NEWNM(m) if(!_nm_free_list)_NM_alloc(); (m)=_nm_free_list; _nm_free_list = NEXT(_nm_free_list)

if(!_ndp_free_list)_NDP_alloc();\

#define MKND(n,m,d) if(!_nd_free_list)_ND_alloc(); (d)=_nd_free_list; _nd_free_list = (ND)BDY(_nd_free_list); (d)->nv=(n); BDY(d)=(m)

(m)=_ndp_free_list; _ndp_free_list = NEXT(_ndp_free_list)

#define NEWNM(m)\

if(!_nm_free_list)_NM_alloc();\

(m)=_nm_free_list; _nm_free_list = NEXT(_nm_free_list)

#define MKND(n,m,len,d)\

if(!_nd_free_list)_ND_alloc();\

(d)=_nd_free_list; _nd_free_list = (ND)BDY(_nd_free_list);\

NV(d)=(n); LEN(d)=(len); BDY(d)=(m)

#define NEXTRHist(r,c) \

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

Line 116 if(!(r)){NEWRHist(r);(c)=(r);}else{NEWRHist(NEXT(c));(

Line 132 if(!(r)){NEWRHist(r);(c)=(r);}else{NEWRHist(NEXT(c));(

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

#define NEXTNM2(r,c,s) \

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

#define FREENM(m) NEXT(m)=_nm_free_list; _nm_free_list=(m)

#define FREENDP(m) NEXT(m)=_ndp_free_list; _ndp_free_list=(m)

#define FREEND(m) BDY(m)=(NM)_nd_free_list; _nd_free_list=(m)

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

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

#define NEXTND_pairs(r,c) \

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

void nd_init_ord(struct order_spec *spec);

int nd_check_candidate(NODE input,NODE cand);

void nd_removecont(int mod,ND p);

void nd_removecont2(ND p1,ND p2);

void ndv_removecont(int mod,NDV p);

void ndv_dehomogenize(NDV p);

void ndv_mul_c_q(NDV p,Q mul);

void nd_mul_c_q(ND p,Q mul);

ND normalize_pbucket(int mod,PGeoBucket g);

int head_pbucket(int mod,PGeoBucket g);

int head_pbucket_q(PGeoBucket g);

void add_pbucket(int mod,PGeoBucket g,ND d);

void free_pbucket(PGeoBucket b);

void mulq_pbucket(PGeoBucket g,Q c);

PGeoBucket create_pbucket();

ND nd_remove_head(ND p);

void GC_gcollect();

NODE append_one(NODE,int);

NODE nd_reducebase(NODE x);

void removecont_array(Q *c,int n);

ND_pairs crit_B( ND_pairs d, int s );

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,struct order_spec *ord,LIST *rp);

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

NODE nd_setup(int mod,NODE f);

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

int nd_newps(int mod,ND a);

int nd_newps(int mod,ND a,ND aq);

int nd_newps_trace(int mod,ND nf,ND nfq);

ND_pairs nd_minp( ND_pairs d, ND_pairs *prest );

NODE update_base(NODE nd,int ndp);

static ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest );

Line 145 ND_pairs crit_F( ND_pairs d1 );

Line 175 ND_pairs crit_F( ND_pairs d1 );

ND_pairs crit_M( ND_pairs d1 );

ND_pairs nd_newpairs( NODE g, int t );

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

NODE nd_gb(int m,NODE f);

NODE nd_gb(int m,int checkonly);

NODE nd_gb_trace(int m,NODE f);

NODE nd_gb_trace(int m);

void nd_free_private_storage();

void _NM_alloc();

void _ND_alloc();

int ndl_td(unsigned int *d);

int ndl_weight(unsigned int *d);

void ndl_dehomogenize(unsigned int *p);

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

ND nd_add_q(ND p1,ND p2);

ND nd_mul_nm(int mod,ND p,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_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);

ND nd_reduce(ND p1,ND p2);

ND nd_reduce_special(ND p1,ND p2);

NODE nd_reduceall(int m,NODE f);

int nd_gbcheck(int m,NODE f);

int nd_membercheck(int m,NODE f);

void nd_free(ND p);

void ndv_free(NDV p);

void ndl_print(unsigned int *dl);

void nd_print(ND p);

void nd_print_q(ND p);

Line 170 void ndp_print(ND_pairs d);

Line 207 void ndp_print(ND_pairs d);

int nd_length(ND p);

void nd_mul_c(int mod,ND p,int mul);

void nd_free_redlist();

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

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

unsigned int *nd_compute_bound(ND p);

unsigned int *dp_compute_bound(DP p);

ND_pairs nd_reconstruct(int mod,int trace,ND_pairs ndp);

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

void nd_setup_parameters();

void nd_realloc(ND p,int obpe);

ND nd_copy(ND p);

Line 183 void ndl_dup(int obpe,unsigned int *d,unsigned int *r)

Line 221 void ndl_dup(int obpe,unsigned int *d,unsigned int *r)

#define NEWNDV(d) ((d)=(NDV)MALLOC(sizeof(struct oNDV)))

#define MKNDV(n,m,l,d) NEWNDV(d); NV(d)=(n); BDY(d)=(m); LEN(d) = l;

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

ND ndv_add(int mod,ND p1,NDV p2);

ND ndv_add_q(ND p1,NDV p2);

NDV ndtondv(int mod,ND p);

void ndv_mul_nm(int mod,NDV pv,NM m,NDV r);

ND ndvtond(int mod,NDV p);

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

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

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

NDV dptondv(int,DP);

DP ndvtodp(int,NDV);

Line 209 void _NM_alloc()

Line 245 void _NM_alloc()

int i;

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

p = (NM)GC_malloc(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int));

p = (NM)GC_malloc(sizeof(struct oNM)+nd_wpd*sizeof(unsigned int));

p->next = _nm_free_list; _nm_free_list = p;

}

Line 232 void _NDP_alloc()

Line 268 void _NDP_alloc()

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

p = (ND_pairs)GC_malloc(sizeof(struct oND_pairs)

+(nd_wpd-1)*sizeof(unsigned int));

+nd_wpd*sizeof(unsigned int));

p->next = _ndp_free_list; _ndp_free_list = p;

}

INLINE nd_length(ND p)

INLINE int nd_length(ND p)

{

NM m;

int i;

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

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

unsigned int u1,u2;

int i,j;

if ( TD(d1) < TD(d2) ) return 0;

switch ( nd_bpe ) {

case 4:

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

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

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

if ( (u1&0xf0000000) < (u2&0xf0000000) ) return 0;

if ( (u1&0xf000000) < (u2&0xf000000) ) return 0;

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

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

return 1;

break;

case 6:

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

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

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

if ( (u1&0x3f000000) < (u2&0x3f000000) ) return 0;

if ( (u1&0xfc0000) < (u2&0xfc0000) ) return 0;

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

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

return 1;

break;

case 8:

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

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

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

if ( (u1&0xff000000) < (u2&0xff000000) ) return 0;

if ( (u1&0xff0000) < (u2&0xff0000) ) return 0;

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

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

return 1;

break;

case 16:

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

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

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

if ( (u1&0xffff0000) < (u2&0xffff0000) ) return 0;

if ( (u1&0xffff) < (u2&0xffff) ) return 0;

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

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

return 1;

break;

case 32:

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

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

if ( d1[i] < d2[i] ) return 0;

return 1;

break;

default:

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

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

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

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

if ( (u1&nd_mask[j]) < (u2&nd_mask[j]) ) return 0;

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

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

}

void ndl_dehomogenize(unsigned int *d)

{

unsigned int mask;

unsigned int h;

int i,bits;

if ( nd_isrlex ) {

if ( nd_bpe == 32 ) {

h = d[1];

for ( i = 2; 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[1]>>((nd_epw-1)*nd_bpe))&nd_mask0;

for ( i = 1; 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+1]>>

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

{

unsigned int t1,t2,u,u1,u2;

Line 321 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

Line 385 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

switch ( nd_bpe ) {

case 4:

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

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

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

t1 = (u1&0xf0000000); t2 = (u2&0xf0000000); u = t1>t2?t1:t2;

t1 = (u1&0xf000000); t2 = (u2&0xf000000); u |= t1>t2?t1:t2;

Line 335 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

Line 399 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

}

break;

case 6:

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

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

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

t1 = (u1&0x3f000000); t2 = (u2&0x3f000000); u = t1>t2?t1:t2;

t1 = (u1&0xfc0000); t2 = (u2&0xfc0000); u |= t1>t2?t1:t2;

Line 346 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

Line 410 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

}

break;

case 8:

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

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

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

t1 = (u1&0xff000000); t2 = (u2&0xff000000); u = t1>t2?t1:t2;

t1 = (u1&0xff0000); t2 = (u2&0xff0000); u |= t1>t2?t1:t2;

Line 356 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

Line 420 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

}

break;

case 16:

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

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

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

t1 = (u1&0xffff0000); t2 = (u2&0xffff0000); u = t1>t2?t1:t2;

t1 = (u1&0xffff); t2 = (u2&0xffff); u |= t1>t2?t1:t2;

Line 364 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

Line 428 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

}

break;

case 32:

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

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

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

d[i] = u1>u2?u1:u2;

}

break;

default:

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

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

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

for ( j = 0, u = 0; j < nd_epw; j++ ) {

t1 = (u1&nd_mask[j]); t2 = (u2&nd_mask[j]); u |= t1>t2?t1:t2;

Line 379 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

Line 443 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

}

break;

}

TD(d) = ndl_weight(d);

}

int ndl_td(unsigned int *d)

int ndl_weight(unsigned int *d)

{

unsigned int t,u;

int i,j;

for ( t = 0, i = 0; i < nd_wpd; i++ ) {

for ( t = 0, i = 1; i <= nd_wpd; i++ ) {

u = d[i];

for ( j = 0; j < nd_epw; j++, u>>=nd_bpe )

t += (u&nd_mask0);

Line 394 int ndl_td(unsigned int *d)

Line 459 int ndl_td(unsigned int *d)

return t;

}

INLINE int ndl_compare(unsigned int *d1,unsigned int *d2)

INLINE int ndl_lex_compare(unsigned int *d1,unsigned int *d2)

{

int i;

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

if ( *d1 > *d2 )

return is_rlex ? -1 : 1;

return nd_isrlex ? -1 : 1;

else if ( *d1 < *d2 )

return is_rlex ? 1 : -1;

return nd_isrlex ? 1 : -1;

return 0;

}

Line 410 INLINE int ndl_equal(unsigned int *d1,unsigned int *d2

Line 475 INLINE int ndl_equal(unsigned int *d1,unsigned int *d2

{

int i;

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

if ( *d1++ != *d2++ ) return 0;

if ( d1[i] != d2[i] )

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

if ( *d1++ != *d2++ )

return 0;

return 1;

}

Line 422 INLINE void ndl_copy(unsigned int *d1,unsigned int *d2

Line 488 INLINE void ndl_copy(unsigned int *d1,unsigned int *d2

switch ( nd_wpd ) {

case 1:

d2[0] = d1[0];

TD(d2) = TD(d1);

d2[1] = d1[1];

break;

case 2:

d2[0] = d1[0];

TD(d2) = TD(d1);

d2[1] = d1[1];

d2[2] = d1[2];

break;

default:

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

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

d2[i] = d1[i];

break;

}

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

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

{

int i;

TD(d) = TD(d1)+TD(d2);

switch ( nd_wpd ) {

case 1:

d[0] = d1[0]+d2[0];

d[1] = d1[1]+d2[1];

break;

case 2:

d[0] = d1[0]+d2[0];

d[1] = d1[1]+d2[1];

d[2] = d1[2]+d2[2];

break;

default:

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

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

d[i] = d1[i]+d2[i];

break;

}

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

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

{

int i;

switch ( nd_wpd ) {

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

case 1:

d2[0] += d1[0];

break;

case 2:

d2[0] += d1[0];

d2[1] += d1[1];

break;

default:

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

d2[i] += d1[i];

break;

}

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

{

int i;

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

d[i] = d1[i]-d2[i];

}

Line 488 int ndl_disjoint(unsigned int *d1,unsigned int *d2)

Line 538 int ndl_disjoint(unsigned int *d1,unsigned int *d2)

switch ( nd_bpe ) {

case 4:

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

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

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

t1 = u1&0xf0000000; t2 = u2&0xf0000000; if ( t1&&t2 ) return 0;

t1 = u1&0xf000000; t2 = u2&0xf000000; if ( t1&&t2 ) return 0;

Line 502 int ndl_disjoint(unsigned int *d1,unsigned int *d2)

Line 552 int ndl_disjoint(unsigned int *d1,unsigned int *d2)

return 1;

break;

case 6:

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

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

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

t1 = u1&0x3f000000; t2 = u2&0x3f000000; if ( t1&&t2 ) return 0;

t1 = u1&0xfc0000; t2 = u2&0xfc0000; if ( t1&&t2 ) return 0;

Line 513 int ndl_disjoint(unsigned int *d1,unsigned int *d2)

Line 563 int ndl_disjoint(unsigned int *d1,unsigned int *d2)

return 1;

break;

case 8:

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

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

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

t1 = u1&0xff000000; t2 = u2&0xff000000; if ( t1&&t2 ) return 0;

t1 = u1&0xff0000; t2 = u2&0xff0000; if ( t1&&t2 ) return 0;

Line 523 int ndl_disjoint(unsigned int *d1,unsigned int *d2)

Line 573 int ndl_disjoint(unsigned int *d1,unsigned int *d2)

return 1;

break;

case 16:

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

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

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

t1 = u1&0xffff0000; t2 = u2&0xffff0000; if ( t1&&t2 ) return 0;

t1 = u1&0xffff; t2 = u2&0xffff; if ( t1&&t2 ) return 0;

Line 531 int ndl_disjoint(unsigned int *d1,unsigned int *d2)

Line 581 int ndl_disjoint(unsigned int *d1,unsigned int *d2)

return 1;

break;

case 32:

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

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

if ( d1[i] && d2[i] ) return 0;

return 1;

break;

default:

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

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

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

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

if ( (u1&nd_mask0) && (u2&nd_mask0) ) return 0;

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

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

ind = 0;

switch ( nd_bpe ) {

case 4:

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

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

u2 = d2[i];

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

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

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

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

return 0;

break;

case 6:

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

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

u2 = d2[i];

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

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

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

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

return 0;

break;

case 8:

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

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

u2 = d2[i];

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

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

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

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

return 0;

break;

case 16:

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

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

u2 = d2[i];

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

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

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

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

return 0;

break;

case 32:

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

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

if ( d1[i]+d2[i]<d1[i] ) return 1;

return 0;

break;

default:

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

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

u2 = d2[i];

k = (nd_epw-1)*nd_bpe;

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

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

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

}

INLINE int ndl_hash_value(int td,unsigned int *d)

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

{

unsigned int u1,u2;

int i,j,k;

switch ( nd_bpe ) {

case 4:

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

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

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

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

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

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

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

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

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

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

}

return 0;

break;

case 6:

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

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

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

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

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

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

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

}

return 0;

break;

case 8:

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

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

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

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

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

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

}

return 0;

break;

case 16:

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

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

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

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

}

return 0;

break;

case 32:

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

if ( d1[i]+d2[i]<d1[i] ) return 1;

return 0;

break;

default:

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

u1 = d1[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 )

return 1;

}

return 0;

break;

}

INLINE int ndl_hash_value(unsigned int *d)

{

int i;

int r;

r = td;

r = 0;

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

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

r = ((r<<16)+d[i])%REDTAB_LEN;

return r;

}

Line 631 INLINE int ndl_hash_value(int td,unsigned int *d)

Line 748 INLINE int ndl_hash_value(int td,unsigned int *d)

INLINE int nd_find_reducer(ND g)

{

RHist r;

unsigned int *dg;

int d,k,i;

d = ndl_hash_value(HTD(g),HDL(g));

dg = HDL(g);

#if 1

d = ndl_hash_value(HDL(g));

for ( r = nd_red[d], k = 0; r; r = NEXT(r), k++ ) {

if ( HTD(g) == TD(r) && ndl_equal(HDL(g),DL(r)) ) {

if ( ndl_equal(dg,DL(r)) ) {

if ( k > 0 ) nd_notfirst++;

nd_found++;

return r->index;

}

#endif

if ( Reverse )

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

r = nd_psh[i];

if ( HTD(g) >= TD(r) && ndl_reducible(HDL(g),DL(r)) ) {

if ( ndl_reducible(dg,DL(r)) ) {

nd_create++;

nd_append_red(HDL(g),HTD(g),i);

nd_append_red(dg,i);

return i;

}

else

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

r = nd_psh[i];

if ( HTD(g) >= TD(r) && ndl_reducible(HDL(g),DL(r)) ) {

if ( ndl_reducible(dg,DL(r)) ) {

nd_create++;

nd_append_red(HDL(g),HTD(g),i);

nd_append_red(dg,i);

return i;

}

return -1;

}

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

{

NDV r;

RHist s;

int d,k,i;

if ( Reverse )

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

r = ps[i];

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

nd_append_red(HDL(g),i);

return i;

}

return -1;

}

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

{

int n,c;

int t;

int t,can,td1,td2;

ND r;

NM m1,m2,mr0,mr,s;

if ( !p1 )

if ( !p1 ) return p2;

return p2;

else if ( !p2 ) return p1;

else if ( !p2 )

else if ( !mod ) return nd_add_q(p1,p2);

return p1;

else {

can = 0;

for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {

if ( TD(m1) > TD(m2) )

c = DL_COMPARE(DL(m1),DL(m2));

c = 1;

else if ( TD(m1) < TD(m2) )

c = -1;

else

c = ndl_compare(DL(m1),DL(m2));

switch ( c ) {

case 0:

t = ((CM(m1))+(CM(m2))) - mod;

if ( t < 0 )

if ( t < 0 ) t += mod;

t += mod;

s = m1; m1 = NEXT(m1);

if ( t ) {

NEXTNM2(mr0,mr,s); CM(mr) = (t);

can++; NEXTNM2(mr0,mr,s); CM(mr) = (t);

} else {

FREENM(s);

can += 2; FREENM(s);

}

s = m2; m2 = NEXT(m2); FREENM(s);

break;

Line 704 ND nd_add(int mod,ND p1,ND p2)

Line 843 ND nd_add(int mod,ND p1,ND p2)

}

if ( !mr0 )

if ( m1 )

if ( m1 ) mr0 = m1;

mr0 = m1;

else if ( m2 ) mr0 = m2;

else if ( m2 )

else return 0;

mr0 = m2;

else if ( m1 ) NEXT(mr) = m1;

else

else if ( m2 ) NEXT(mr) = m2;

return 0;

else NEXT(mr) = 0;

else if ( m1 )

NEXT(mr) = m1;

else if ( m2 )

NEXT(mr) = m2;

else

NEXT(mr) = 0;

BDY(p1) = mr0;

SG(p1) = MAX(SG(p1),SG(p2));

LEN(p1) = LEN(p1)+LEN(p2)-can;

FREEND(p2);

return p1;

}

Line 725 ND nd_add(int mod,ND p1,ND p2)

Line 859 ND nd_add(int mod,ND p1,ND p2)

ND nd_add_q(ND p1,ND p2)

{

int n,c;

int n,c,can;

ND r;

NM m1,m2,mr0,mr,s;

Q t;

if ( !p1 )

if ( !p1 ) return p2;

return p2;

else if ( !p2 ) return p1;

else if ( !p2 )

return p1;

else {

can = 0;

for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {

if ( TD(m1) > TD(m2) )

c = DL_COMPARE(DL(m1),DL(m2));

c = 1;

else if ( TD(m1) < TD(m2) )

c = -1;

else

c = ndl_compare(DL(m1),DL(m2));

switch ( c ) {

case 0:

addq(CQ(m1),CQ(m2),&t);

s = m1; m1 = NEXT(m1);

if ( t ) {

NEXTNM2(mr0,mr,s); CQ(mr) = (t);

can++; NEXTNM2(mr0,mr,s); CQ(mr) = (t);

} else {

FREENM(s);

can += 2; FREENM(s);

}

s = m2; m2 = NEXT(m2); FREENM(s);

break;

Line 762 ND nd_add_q(ND p1,ND p2)

Line 890 ND nd_add_q(ND p1,ND p2)

}

if ( !mr0 )

if ( m1 )

if ( m1 ) mr0 = m1;

mr0 = m1;

else if ( m2 ) mr0 = m2;

else if ( m2 )

else return 0;

mr0 = m2;

else if ( m1 ) NEXT(mr) = m1;

else

else if ( m2 ) NEXT(mr) = m2;

return 0;

else NEXT(mr) = 0;

else if ( m1 )

NEXT(mr) = m1;

else if ( m2 )

NEXT(mr) = m2;

else

NEXT(mr) = 0;

BDY(p1) = mr0;

SG(p1) = MAX(SG(p1),SG(p2));

LEN(p1) = LEN(p1)+LEN(p2)-can;

FREEND(p2);

return p1;

}

#if 1

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

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

{

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

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

NM m,mrd,tail;

NM mul;

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

int c,c1,c2;

int c,c1,c2,dummy;

RHist h;

NDV p,red;

Q cg,cred,gcd;

double hmag;

if ( !g ) {

*rp = 0;

return 1;

}

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

sugar0 = sugar = SG(g);

n = NV(g);

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

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

for ( d = 0; g; ) {

index = nd_find_reducer(g);

if ( index >= 0 ) {

h = nd_psh[index];

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

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

#if 0

if ( d && (SG(p)+TD(mul)) > sugar ) {

goto afo;

}

#endif

if ( ndl_check_bound2(index,DL(mul)) ) {

nd_free(g); nd_free(d);

return 0;

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

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

chsgnq(cg,&CQ(mul));

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

}

ndv_mul_nm(mod,p,mul,ndv_red);

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

g = ndv_add(mod,g,ndv_red);

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

sugar = MAX(sugar,SG(ndv_red));

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 {

afo:

m = BDY(g);

if ( NEXT(m) ) {

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

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

} else {

FREEND(g); g = 0;

}

if ( d ) {

NEXT(tail)=m;

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

tail=m;

} else {

MKND(n,m,d);

MKND(n,m,1,d); tail = BDY(d);

tail = BDY(d);

}

if ( d )

if ( d ) SG(d) = sugar;

SG(d) = sugar;

*rp = d;

return 1;

}

int nd_nf_pbucket(int mod,ND g,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 ( !mod ) hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;

bucket = create_pbucket();

add_pbucket(mod,bucket,g);

d = 0;

mul = (NM)ALLOCA(sizeof(struct oNM)+nd_wpd*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(g);

if ( index >= 0 ) {

h = nd_psh[index];

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

if ( ndl_check_bound2(index,DL(mul)) ) {

nd_free(d);

free_pbucket(bucket);

*rp = 0;

return 0;

}

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

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

psugar = SG(p)+TD(DL(mul));

sugar = MAX(sugar,psugar);

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

}

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

{

ND d;

NM m,mrd,tail;

NM mul;

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

int c,c1,c2;

RHist h;

NDV p,red;

Q cg,cred,gcd;

double hmag;

if ( !g ) {

*rp = 0;

return 1;

}

#if 0

if ( !mod )

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

#else

/* XXX */

hmag = 0;

#endif

sugar0 = sugar = SG(g);

n = NV(g);

mul = (NM)ALLOCA(sizeof(struct oNM)+nd_wpd*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));

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(DL(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; LEN(g)--;

} else {

FREEND(g); g = 0;

}

if ( d ) {

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

} else {

MKND(n,m,1,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;

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

nd_setup(0,0,cand);

n = length(cand);

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

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

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

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

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

else if ( nf ) return 0;

}

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

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

/* XXX */

return 1;

}

ND nd_remove_head(ND p)

{

NM m;

m = BDY(p);

if ( !NEXT(m) ) {

FREEND(p);

FREEND(p); p = 0;

p = 0;

} else {

} else

BDY(p) = NEXT(m); LEN(p)--;

BDY(p) = NEXT(m);

}

FREENM(m);

return p;

}

Line 879 PGeoBucket create_pbucket()

Line 1288 PGeoBucket create_pbucket()

return g;

}

void free_pbucket(PGeoBucket b) {

int i;

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

if ( b->body[i] ) {

nd_free(b->body[i]);

b->body[i] = 0;

}

GC_free(b);

}

void add_pbucket(int mod,PGeoBucket g,ND d)

{

int l,k,m;

int l,i,k,m;

l = nd_length(d);

if ( !d )

for ( k = 0, m = 1; l > m; k++, m <<= 2 );

return;

/* 4^(k-1) < l <= 4^k */

l = LEN(d);

for ( k = 0, m = 1; l > m; k++, m <<= 1 );

/* 2^(k-1) < l <= 2^k (=m) */

d = nd_add(mod,g->body[k],d);

for ( ; d && nd_length(d) > 1<<(2*k); k++ ) {

for ( ; d && LEN(d) > m; k++, m <<= 1 ) {

g->body[k] = 0;

d = nd_add(int mod,g->body[k+1],d);

d = nd_add(mod,g->body[k+1],d);

}

g->body[k] = d;

g->m = MAX(g->m,k);

}

void mulq_pbucket(PGeoBucket g,Q c)

{

int k;

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

nd_mul_c_q(g->body[k],c);

}

int head_pbucket(int mod,PGeoBucket g)

{

int j,i,c,k,nv,sum;

Line 913 int head_pbucket(int mod,PGeoBucket g)

Line 1343 int head_pbucket(int mod,PGeoBucket g)

dj = HDL(gj);

sum = HCM(gj);

} else {

di = HDL(gi);

c = DL_COMPARE(HDL(gi),dj);

nv = NV(gi);

if ( HTD(gi) > HTD(gj) )

c = 1;

else if ( HTD(gi) < HTD(gj) )

c = -1;

else

c = ndl_compare(di,dj);

if ( c > 0 ) {

if ( sum )

if ( sum ) HCM(gj) = sum;

HCM(gj) = sum;

else g->body[j] = nd_remove_head(gj);

else

g->body[j] = nd_remove_head(gj);

j = i;

gj = g->body[j];

dj = HDL(gj);

sum = HCM(gj);

} else if ( c == 0 ) {

sum = sum+HCM(gi)-mod;

if ( sum < 0 )

if ( sum < 0 ) sum += mod;

sum += mod;

g->body[i] = nd_remove_head(gi);

}

if ( j < 0 )

if ( j < 0 ) return -1;

return -1;

else if ( sum ) {

HCM(gj) = sum;

return j;

Line 948 int head_pbucket(int mod,PGeoBucket g)

Line 1367 int head_pbucket(int mod,PGeoBucket g)

}

ND normalize_pbucket(PGeoBucket g)

int head_pbucket_q(PGeoBucket g)

{

int j,i,c,k,nv;

Q sum,t;

ND gi,gj;

k = g->m;

while ( 1 ) {

j = -1;

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

if ( !(gi = g->body[i]) ) continue;

if ( j < 0 ) {

j = i;

gj = g->body[j];

sum = HCQ(gj);

} else {

nv = NV(gi);

c = DL_COMPARE(HDL(gi),HDL(gj));

if ( c > 0 ) {

if ( sum ) HCQ(gj) = sum;

else g->body[j] = nd_remove_head(gj);

j = i;

gj = g->body[j];

sum = HCQ(gj);

} else if ( c == 0 ) {

addq(sum,HCQ(gi),&t);

sum = t;

g->body[i] = nd_remove_head(gi);

}

if ( j < 0 ) return -1;

else if ( sum ) {

HCQ(gj) = sum;

return j;

} else

g->body[j] = nd_remove_head(gj);

}

ND normalize_pbucket(int mod,PGeoBucket g)

{

int i;

ND r,t;

r = 0;

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

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

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

g->body[i] = 0;

}

g->m = -1;

return r;

}

ND nd_nf(ND g,int full)

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

{

ND u,p,d,red;

NODE l;

NM m,mrd;

int sugar,psugar,n,h_reducible,h;

PGeoBucket bucket;

if ( !g ) {

NODE nd_gb(int m,int checkonly)

return 0;

}

sugar = SG(g);

n = NV(g);

bucket = create_pbucket();

add_pbucket(bucket,g);

d = 0;

while ( 1 ) {

h = head_pbucket(bucket);

if ( h < 0 ) {

if ( d )

SG(d) = sugar;

return d;

}

g = bucket->body[h];

red = nd_find_reducer(g);

if ( red ) {

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

red = nd_remove_head(red);

add_pbucket(bucket,red);

sugar = MAX(sugar,SG(red));

} else if ( !full ) {

g = normalize_pbucket(bucket);

if ( g )

SG(g) = sugar;

return g;

} else {

m = BDY(g);

if ( NEXT(m) ) {

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

} else {

FREEND(g); g = 0;

}

bucket->body[h] = g;

NEXT(m) = 0;

if ( d ) {

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

NEXT(mrd) = m;

} else {

MKND(n,m,d);

}

#endif

NODE nd_gb(int m,NODE f)

{

int i,nh,sugar,stat;

NODE r,g,gall;

NODE r,g,t;

ND_pairs d;

ND_pairs l;

ND h,nf;

for ( gall = g = 0, d = 0, r = f; r; r = NEXT(r) ) {

g = 0; d = 0;

i = (int)BDY(r);

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

d = update_pairs(d,g,i);

g = update_base(g,i);

gall = append_one(gall,i);

}

sugar = 0;

while ( d ) {

Line 1042 again:

Line 1450 again:

d = nd_reconstruct(m,0,d);

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

NEXT(l) = d; d = l;

d = nd_reconstruct(m,0,d);

goto again;

} else if ( nf ) {

if ( checkonly ) return 0;

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

nh = nd_newps(m,nf);

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

d = update_pairs(d,g,nh);

g = update_base(g,nh);

gall = append_one(gall,nh);

FREENDP(l);

} else {

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

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;

}

NODE nd_gb_trace(int m,NODE f)

NODE nd_gb_trace(int m)

{

int i,nh,sugar,stat;

NODE r,g,gall;

NODE r,g,t;

ND_pairs d;

ND_pairs l;

ND h,nf,nfq;

for ( gall = g = 0, d = 0, r = f; r; r = NEXT(r) ) {

g = 0; d = 0;

i = (int)BDY(r);

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

d = update_pairs(d,g,i);

g = update_base(g,i);

gall = append_one(gall,i);

}

sugar = 0;

while ( d ) {

Line 1090 again:

Line 1501 again:

d = nd_reconstruct(m,1,d);

goto again;

}

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

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

if ( !stat ) {

NEXT(l) = d; d = l;

d = nd_reconstruct(m,1,d);

Line 1101 again:

Line 1512 again:

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

if ( nfq ) {

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

nh = nd_newps_trace(m,nf,nfq);

nh = nd_newps(m,nf,nfq);

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

if ( nh < 0 ) return 0;

d = update_pairs(d,g,nh);

g = update_base(g,nh);

gall = append_one(gall,nh);

} else {

printf("*"); fflush(stdout);

}

Line 1113 again:

Line 1525 again:

}

FREENDP(l);

}

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

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

return g;

}

int ndv_compare(NDV *p1,NDV *p2)

{

return DL_COMPARE(HDL(*p1),HDL(*p2));

}

int ndv_compare_rev(NDV *p1,NDV *p2)

{

return -DL_COMPARE(HDL(*p1),HDL(*p2));

}

NODE nd_reduceall(int m,NODE f)

{

int i,j,n,stat;

NDV *w,*ps;

ND nf,g;

NODE t,a0,a;

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

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++ ) {

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

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

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

stat = nd_nf_direct(m,g,w,n-1,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];

n--;

} else {

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

ndv_free(ps[i]);

nd_removecont(m,nf);

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

nd_free(nf);

}

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

NEXTNODE(a0,a);

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

}

NEXT(a) = 0;

return a0;

}

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

{

ND_pairs d1,nd,cur,head,prev,remove;

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

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

while ( cur ) {

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

remove = cur;

if ( !prev ) {

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

head = cur = NEXT(cur);

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

} else {

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

}

FREENDP(remove);

} else {

prev = cur;

prev = cur; cur = NEXT(cur);

cur = NEXT(cur);

}

if ( !d )

return head;

else {

nd = d;

while ( NEXT(nd) )

while ( NEXT(nd) ) nd = NEXT(nd);

nd = NEXT(nd);

NEXT(nd) = head;

return d;

}

Line 1155 ND_pairs nd_newpairs( NODE g, int t )

Line 1615 ND_pairs nd_newpairs( NODE g, int t )

{

NODE h;

unsigned int *dl;

int td,ts,s;

int ts,s;

ND_pairs r,r0;

dl = DL(nd_psh[t]);

td = TD(nd_psh[t]);

ts = SG(nd_psh[t]) - TD(dl);

ts = SG(nd_psh[t]) - td;

for ( r0 = 0, h = g; h; h = NEXT(h) ) {

NEXTND_pairs(r0,r);

r->i1 = (int)BDY(h);

r->i2 = t;

ndl_lcm(DL(nd_psh[r->i1]),dl,r->lcm);

TD(r) = ndl_td(r->lcm);

s = SG(nd_psh[r->i1])-TD(DL(nd_psh[r->i1]));

s = SG(nd_psh[r->i1])-TD(nd_psh[r->i1]);

SG(r) = MAX(s,ts) + TD(LCM(r));

SG(r) = MAX(s,ts) + TD(r);

}

NEXT(r) = 0;

return r0;

Line 1184 ND_pairs crit_B( ND_pairs d, int s )

Line 1642 ND_pairs crit_B( ND_pairs d, int s )

t = DL(nd_psh[s]);

prev = 0;

head = cur = d;

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

lcm = (unsigned int *)ALLOCA((nd_wpd+1)*sizeof(unsigned int));

while ( cur ) {

tl = cur->lcm;

if ( ndl_reducible(tl,t)

Line 1198 ND_pairs crit_B( ND_pairs d, int s )

Line 1656 ND_pairs crit_B( ND_pairs d, int s )

}

FREENDP(remove);

} else {

prev = cur;

prev = cur; cur = NEXT(cur);

cur = NEXT(cur);

}

return head;

}

/* XXX : check is necessary */

ND_pairs crit_M( ND_pairs d1 )

{

ND_pairs e,d2,d3,dd,p;

unsigned int *id,*jd;

int itd,jtd;

for ( dd = 0, e = d1; e; e = d3 ) {

if ( !(d2 = NEXT(e)) ) {

NEXT(e) = dd;

return e;

}

id = e->lcm;

id = LCM(e);

itd = TD(e);

for ( d3 = 0; d2; d2 = p ) {

p = NEXT(d2),

p = NEXT(d2);

jd = d2->lcm;

jd = LCM(d2);

jtd = TD(d2);

if ( ndl_equal(jd,id) )

if ( jtd == itd )

;

if ( id == jd );

else if ( TD(jd) > TD(id) )

else if ( ndl_reducible(jd,id) ) continue;

else if ( ndl_reducible(id,jd) ) goto delit;

else ;

else if ( jtd > itd )

if ( ndl_reducible(jd,id) ) continue;

else ;

else if ( ndl_reducible(id,jd ) ) goto delit;

else if ( ndl_reducible(id,jd) ) goto delit;

NEXT(d2) = d3;

d3 = d2;

}

Line 1301 static ND_pairs equivalent_pairs( ND_pairs d1, ND_pair

Line 1754 static ND_pairs equivalent_pairs( ND_pairs d1, ND_pair

{

ND_pairs w,p,r,s;

unsigned int *d;

int td;

w = d1;

d = w->lcm;

d = LCM(w);

td = TD(w);

s = NEXT(w);

NEXT(w) = 0;

for ( r = 0; s; s = p ) {

p = NEXT(s);

if ( td == TD(s) && ndl_equal(d,s->lcm) ) {

if ( ndl_equal(d,LCM(s)) ) {

NEXT(s) = w;

NEXT(s) = w; w = s;

w = s;

} else {

NEXT(s) = r;

NEXT(s) = r; r = s;

r = s;

}

*prest = r;

Line 1326 NODE update_base(NODE nd,int ndp)

Line 1775 NODE update_base(NODE nd,int ndp)

{

unsigned int *dl, *dln;

NODE last, p, head;

int td,tdn;

dl = DL(nd_psh[ndp]);

td = TD(nd_psh[ndp]);

for ( head = last = 0, p = nd; p; ) {

dln = DL(nd_psh[(int)BDY(p)]);

tdn = TD(nd_psh[(int)BDY(p)]);

if ( ndl_reducible( dln, dl ) ) {

if ( tdn >= td && ndl_reducible( dln, dl ) ) {

p = NEXT(p);

if ( last ) NEXT(last) = p;

} else {

Line 1349 ND_pairs nd_minp( ND_pairs d, ND_pairs *prest )

Line 1795 ND_pairs nd_minp( ND_pairs d, ND_pairs *prest )

{

ND_pairs m,ml,p,l;

unsigned int *lcm;

int s,td,len,tlen,c;

int s,td,len,tlen,c,c1;

if ( !(p = NEXT(m = d)) ) {

*prest = p;

NEXT(m) = 0;

return m;

}

lcm = m->lcm;

s = SG(m);

td = TD(m);

for ( ml = 0, l = m; p; p = NEXT(l = p) )

len = nd_psl[m->i1]+nd_psl[m->i2];

if ( (SG(p) < s)

for ( ml = 0, l = m; p; p = NEXT(l = p) ) {

|| ((SG(p) == s) && (DL_COMPARE(LCM(p),LCM(m)) < 0)) ) {

if (SG(p) < s)

ml = l; m = p; s = SG(m);

goto find;

else if ( SG(p) == s ) {

if ( TD(p) < td )

goto find;

else if ( TD(p) == td ) {

c = ndl_compare(p->lcm,lcm);

if ( c < 0 )

goto find;

#if 0

else if ( c == 0 ) {

tlen = nd_psl[p->i1]+nd_psl[p->i2];

if ( tlen < len )

goto find;

}

#endif

}

continue;

find:

ml = l;

m = p;

lcm = m->lcm;

s = SG(m);

td = TD(m);

len = tlen;

}

if ( !ml ) *prest = NEXT(m);

else {

NEXT(ml) = NEXT(m);

Line 1397 find:

Line 1817 find:

return m;

}

int nd_newps(int mod,ND a)

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

{

int len;

RHist r;

Line 1405 int nd_newps(int mod,ND a)

Line 1825 int nd_newps(int mod,ND a)

if ( nd_psn == nd_pslen ) {

nd_pslen *= 2;

nd_psl = (int *)REALLOC((char *)nd_psl,nd_pslen*sizeof(int));

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

nd_psq = (NDV *)REALLOC((char *)nd_psq,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 *));

}

nd_removecont(mod,a);

if ( a && aq ) {

nd_bound[nd_psn] = nd_compute_bound(a);

/* trace lifting */

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

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

nd_psh[nd_psn] = r;

b = ndtondv(mod,a);

len = LEN(b);

if ( mod )

nd_ps[nd_psn] = b;

else

nd_psq[nd_psn] = b;

nd_psl[nd_psn] = len;

nd_free(a);

if ( len > nmv_len ) {

nmv_len = 2*len;

BDY(ndv_red) = (NMV)REALLOC(BDY(ndv_red),nmv_len*nmv_adv);

}

return nd_psn++;

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

}

if ( aq ) {

nd_removecont(0,aq);

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

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

{

nd_bound[nd_psn] = nd_compute_bound(aq);

int len;

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

RHist r;

NDV b;

if ( nd_psn == nd_pslen ) {

nd_pslen *= 2;

nd_psl = (int *)REALLOC((char *)nd_psl,nd_pslen*sizeof(int));

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

nd_psq = (NDV *)REALLOC((char *)nd_psq,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 *));

}

nd_removecont(mod,nf);

if ( a ) {

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

nd_removecont(mod,a);

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

nd_removecont(0,nfq);

if ( !aq ) {

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

nd_bound[nd_psn] = nd_compute_bound(a);

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

nd_bound[nd_psn] = nd_compute_bound(nfq);

}

NEWRHist(r); SG(r) = SG(nf); TD(r) = HTD(nf); ndl_copy(HDL(nf),DL(r));

nd_psh[nd_psn] = r;

len = LEN(nd_psq[nd_psn]);

nd_psl[nd_psn] = len;

nd_free(nf); nd_free(nfq);

if ( len > nmv_len ) {

nmv_len = 2*len;

BDY(ndv_red) = (NMV)REALLOC(BDY(ndv_red),nmv_len*nmv_adv);

}

nd_free(a); nd_free(aq);

return nd_psn++;

}

NODE nd_setup(int mod,NODE f)

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

{

int i,j,td,len,max;

NODE s,s0,f0;

Line 1478 NODE nd_setup(int mod,NODE f)

Line 1865 NODE nd_setup(int mod,NODE f)

nd_found = 0; nd_notfirst = 0; nd_create = 0;

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

nd_psl = (int *)MALLOC(nd_pslen*sizeof(int));

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

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

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

Line 1492 NODE nd_setup(int mod,NODE f)

Line 1878 NODE nd_setup(int mod,NODE f)

nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist));

bzero(nd_red,REDTAB_LEN*sizeof(RHist));

if ( max < 2 )

if ( max < 2 ) nd_bpe = 2;

nd_bpe = 2;

else if ( max < 4 ) nd_bpe = 4;

else if ( max < 4 )

else if ( max < 64 ) nd_bpe = 6;

nd_bpe = 4;

else if ( max < 256 ) nd_bpe = 8;

else if ( max < 64 )

else if ( max < 65536 ) nd_bpe = 16;

nd_bpe = 6;

else nd_bpe = 32;

else if ( max < 256 )

nd_bpe = 8;

else if ( max < 65536 )

nd_bpe = 16;

else

nd_bpe = 32;

nd_setup_parameters();

nd_free_private_storage();

len = 0;

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

NEWRHist(r);

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

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

ndv_removecont(mod,a);

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

len = MAX(len,LEN(a));

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

if ( trace ) {

if ( mod )

nd_ps[i] = a;

else

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

nd_psq[i] = a;

} else {

if ( mod ) nd_ps[i] = a;

else nd_psq[i] = a;

}

nd_psh[i] = r;

}

nmv_len = 16*len;

NEWNDV(ndv_red);

if ( mod )

BDY(ndv_red) = (NMV)MALLOC_ATOMIC(nmv_len*nmv_adv);

else

BDY(ndv_red) = (NMV)MALLOC(nmv_len*nmv_adv);

for ( s0 = 0, i = 0; i < nd_psn; i++ ) {

NEXTNODE(s0,s); BDY(s) = (pointer)i;

}

if ( s0 ) NEXT(s) = 0;

return s0;

}

NODE nd_setup_trace(int mod,NODE f)

{

int i,j,td,len,max;

NODE s,s0,f0;

unsigned int *d;

RHist r;

NDV a;

nd_found = 0; nd_notfirst = 0; nd_create = 0;

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

nd_psl = (int *)MALLOC(nd_pslen*sizeof(int));

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

nd_psq = (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) ) {

nd_bound[i] = d = dp_compute_bound((DP)BDY(s));

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

max = MAX(d[j],max);

}

if ( !nd_red )

nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist));

bzero(nd_red,REDTAB_LEN*sizeof(RHist));

if ( max < 2 )

nd_bpe = 2;

else if ( max < 4 )

nd_bpe = 4;

else if ( max < 64 )

nd_bpe = 6;

else if ( max < 256 )

nd_bpe = 8;

else if ( max < 65536 )

nd_bpe = 16;

else

nd_bpe = 32;

nd_setup_parameters();

nd_free_private_storage();

len = 0;

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

a = dptondv(mod,(DP)BDY(f)); ndv_removecont(mod,a); nd_ps[i] = a;

a = dptondv(0,(DP)BDY(f)); ndv_removecont(0,a); nd_psq[i] = a;

NEWRHist(r);

len = MAX(len,LEN(a));

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

nd_psh[i] = r;

}

nmv_len = 16*len;

NEWNDV(ndv_red);

BDY(ndv_red) = (NMV)MALLOC(nmv_len*nmv_adv);

for ( s0 = 0, i = 0; i < nd_psn; i++ ) {

NEXTNODE(s0,s); BDY(s) = (pointer)i;

}

if ( s0 ) NEXT(s) = 0;

return s0;

}

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

{

struct order_spec ord1;

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

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

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

nd_nvar = length(vv);

if ( ord->id )

nd_init_ord(ord);

error("nd_gr : unsupported order");

/* XXX for DP */

switch ( ord->ord.simple ) {

case 0:

is_rlex = 1;

break;

case 1:

is_rlex = 0;

break;

default:

error("nd_gr : unsupported order");

}

initd(ord);

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

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

NEXTNODE(fd0,fd); BDY(fd) = (pointer)b;

}

if ( fd0 ) NEXT(fd) = 0;

s = nd_setup(m,fd0);

nd_setup(m,0,fd0);

x = nd_gb(m,s);

x = nd_gb(m,0);

#if 0

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

x = nd_reduceall(x,m);

nd_found,nd_notfirst,nd_create);

#endif

x = nd_reduceall(m,x);

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

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

NEXTNODE(r0,r);

if ( m ) {

a = ndvtodp(m,nd_ps[(int)BDY(x)]);

a = ndvtodp(m,BDY(t));

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

} else {

a = ndvtodp(m,nd_psq[(int)BDY(x)]);

a = ndvtodp(m,BDY(t));

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

}

if ( r0 ) NEXT(r) = 0;

MKLIST(*rp,r0);

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

nd_found,nd_notfirst,nd_create);

}

void nd_gr_trace(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)

{

struct order_spec ord1;

VL fv,vv,vc;

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

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

DP a,b,c;

DP a,b,c,h;

P p;

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

nd_nvar = length(vv);

if ( ord->id )

error("nd_gr : unsupported order");

switch ( ord->ord.simple ) {

case 0:

is_rlex = 1;

break;

case 1:

is_rlex = 0;

break;

default:

error("nd_gr : unsupported order");

}

initd(ord);

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

if ( homo ) {

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

homogenize_order(ord,nd_nvar,&ord1);

if ( c ) {

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

NEXTNODE(fd0,fd); BDY(fd) = (pointer)c;

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

if ( c ) {

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

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

}

if ( fd0 ) NEXT(fd) = 0;

if ( in0 ) NEXT(in) = 0;

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

if ( c ) {

NEXTNODE(fd0,fd); BDY(fd) = (pointer)c;

}

if ( fd0 ) NEXT(fd) = 0;

in0 = fd0;

nd_init_ord(ord);

}

if ( fd0 ) NEXT(fd) = 0;

do {

/* setup over GF(m) */

nd_setup(m,1,fd0);

s = nd_setup_trace(m,fd0);

cand = nd_gb_trace(m);

x = nd_gb_trace(m,s);

if ( !cand ) continue;

#if 0

if ( homo ) {

x = nd_reduceall(x,m);

/* dehomogenization */

#endif

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

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

ndv_dehomogenize((NDV)BDY(t));

NEXTNODE(r0,r);

nd_nvar--;

a = ndvtodp(0,nd_psq[(int)BDY(x)]);

nd_setup_parameters();

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

initd(ord);

cand = nd_reducebase(cand);

}

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

nd_found,nd_notfirst,nd_create);

cand = nd_reduceall(0,cand);

initd(ord);

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

NEXTNODE(r0,r);

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

}

if ( r0 ) NEXT(r) = 0;

cand = r0;

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

/* dp->p */

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

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

BDY(r) = (pointer)p;

}

if ( r0 ) NEXT(r) = 0;

MKLIST(*rp,cand);

MKLIST(*rp,r0);

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

nd_found,nd_notfirst,nd_create);

}

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

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

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

int i;

d = dl->d;

bzero(r,nd_wpd*sizeof(unsigned int));

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

if ( is_rlex )

if ( nd_isrlex )

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

r[(n-1-i)/nd_epw] |= (d[i]<<((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe));

r[(n-1-i)/nd_epw+1] |= (d[i]<<((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe));

else

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

r[i/nd_epw] |= d[i]<<((nd_epw-(i%nd_epw)-1)*nd_bpe);

r[i/nd_epw+1] |= d[i]<<((nd_epw-(i%nd_epw)-1)*nd_bpe);

TD(r) = ndl_weight(r);

}

DL ndltodl(int n,int td,unsigned int *ndl)

DL ndltodl(int n,unsigned int *ndl)

{

DL dl;

int *d;

int i;

NEWDL(dl,n);

TD(dl) = td;

dl->td = TD(ndl);

d = dl->d;

if ( is_rlex )

if ( nd_isrlex )

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

d[i] = (ndl[(n-1-i)/nd_epw]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe))

d[i] = (ndl[(n-1-i)/nd_epw+1]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe))

&((1<<nd_bpe)-1);

else

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

d[i] = (ndl[i/nd_epw]>>((nd_epw-(i%nd_epw)-1)*nd_bpe))

d[i] = (ndl[i/nd_epw+1]>>((nd_epw-(i%nd_epw)-1)*nd_bpe))

&((1<<nd_bpe)-1);

return dl;

}

Line 1726 ND dptond(int mod,DP p)

Line 2049 ND dptond(int mod,DP p)

ND d;

NM m0,m;

MP t;

int n;

int n,l;

if ( !p )

return 0;

n = NV(p);

m0 = 0;

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

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

NEXTNM(m0,m);

if ( mod )

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

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

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

else

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

TD(m) = TD(DL(t));

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

}

NEXT(m) = 0;

MKND(n,m0,d);

MKND(n,m0,l,d);

NV(d) = n;

SG(d) = SG(p);

return d;

}

Line 1761 DP ndtodp(int mod,ND p)

Line 2080 DP ndtodp(int mod,ND p)

m0 = 0;

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

NEXTMP(m0,m);

if ( mod )

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

C(m) = STOI(CM(t));

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

else

DL(m) = ndltodl(n,DL(t));

C(m) = (P)CQ(t);

DL(m) = ndltodl(n,TD(t),DL(t));

}

NEXT(m) = 0;

MKDP(n,m0,d);

Line 1780 void ndl_print(unsigned int *dl)

Line 2097 void ndl_print(unsigned int *dl)

n = nd_nvar;

printf("<<");

if ( is_rlex )

if ( nd_isrlex )

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

printf(i==n-1?"%d":"%d,",

(dl[(n-1-i)/nd_epw]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe))

(dl[(n-1-i)/nd_epw+1]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe))

&((1<<nd_bpe)-1));

else

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

printf(i==n-1?"%d":"%d,",

(dl[i/nd_epw]>>((nd_epw-(i%nd_epw)-1)*nd_bpe))

(dl[i/nd_epw+1]>>((nd_epw-(i%nd_epw)-1)*nd_bpe))

&((1<<nd_bpe)-1));

printf(">>");

}

Line 1829 void ndp_print(ND_pairs d)

Line 2146 void ndp_print(ND_pairs d)

{

ND_pairs t;

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

for ( t = d; t; t = NEXT(t) ) printf("%d,%d ",t->i1,t->i2);

printf("%d,%d ",t->i1,t->i2);

}

printf("\n");

}

Line 1841 void nd_removecont(int mod,ND p)

Line 2156 void nd_removecont(int mod,ND p)

Q *w;

Q dvr,t;

NM m;

struct oVECT v;

N q,r;

if ( mod )

if ( mod ) nd_mul_c(mod,p,invm(HCM(p),mod));

nd_mul_c(mod,p,invm(HCM(p),mod));

else {

for ( m = BDY(p), n = 0; m; m = NEXT(m), n++ );

w = (Q *)ALLOCA(n*sizeof(Q));

for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ )

v.len = n;

w[i] = CQ(m);

v.body = (pointer *)w;

sortbynm(w,n);

for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CQ(m);

qltozl(w,n,&dvr);

removecont_array(w,n);

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

for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) CQ(m) = w[i];

divq(CQ(m),dvr,&t); CQ(m) = t;

}

void nd_removecont2(ND p1,ND p2)

{

int i,n1,n2,n;

Q *w;

Q dvr,t;

NM m;

struct oVECT v;

N q,r;

if ( !p1 ) {

nd_removecont(0,p2); return;

} else if ( !p2 ) {

nd_removecont(0,p1); return;

}

n1 = nd_length(p1);

n2 = nd_length(p2);

n = n1+n2;

w = (Q *)ALLOCA(n*sizeof(Q));

v.len = n;

v.body = (pointer *)w;

for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) w[i] = CQ(m);

for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = CQ(m);

removecont_array(w,n);

for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) CQ(m) = w[i];

for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) CQ(m) = w[i];

}

void ndv_removecont(int mod,NDV p)

{

int i,len;

Line 1869 void ndv_removecont(int mod,NDV p)

Line 2210 void ndv_removecont(int mod,NDV p)

else {

len = p->len;

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

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

for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) w[i] = CQ(m);

w[i] = CQ(m);

sortbynm(w,len);

qltozl(w,len,&dvr);

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

Line 1879 void ndv_removecont(int mod,NDV p)

Line 2219 void ndv_removecont(int mod,NDV p)

}

void ndv_dehomogenize(NDV p)

{

int i,len,newnvar,newwpd,newadv;

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

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+1)*sizeof(unsigned int));

newadv = sizeof(struct oNMV)+newwpd*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));

}

NV(p)--;

}

void removecont_array(Q *c,int n)

{

struct oVECT v;

Q d0,d1,a,u,u1,gcd;

int i;

N qn,rn,gn;

Q *q,*r;

q = (Q *)ALLOCA(n*sizeof(Q));

r = (Q *)ALLOCA(n*sizeof(Q));

v.id = O_VECT; v.len = n; v.body = (pointer *)c;

igcdv_estimate(&v,&d0);

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

divn(NM(c[i]),NM(d0),&qn,&rn);

NTOQ(qn,SGN(c[i])*SGN(d0),q[i]);

NTOQ(rn,SGN(c[i]),r[i]);

}

for ( i = 0; i < n; i++ ) if ( r[i] ) break;

if ( i < n ) {

v.id = O_VECT; v.len = n; v.body = (pointer *)r;

igcdv(&v,&d1);

gcdn(NM(d0),NM(d1),&gn); NTOQ(gn,1,gcd);

divsn(NM(d0),gn,&qn); NTOQ(qn,1,a);

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

mulq(a,q[i],&u);

if ( r[i] ) {

divsn(NM(r[i]),gn,&qn); NTOQ(qn,SGN(r[i]),u1);

addq(u,u1,&q[i]);

} else

q[i] = u;

}

for ( i = 0; i < n; i++ ) c[i] = q[i];

}

void nd_mul_c(int mod,ND p,int mul)

{

NM m;

int c,c1;

if ( !p )

if ( !p ) return;

return;

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

c1 = CM(m);

DMAR(c1,mul,0,mod,c);

Line 1898 void nd_mul_c_q(ND p,Q mul)

Line 2296 void nd_mul_c_q(ND p,Q mul)

NM m;

Q c;

if ( !p )

if ( !p ) return;

return;

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

mulq(CQ(m),mul,&c); CQ(m) = c;

}

Line 1909 void nd_free(ND p)

Line 2306 void nd_free(ND p)

{

NM t,s;

if ( !p )

if ( !p ) return;

return;

t = BDY(p);

while ( t ) {

s = NEXT(t);

Line 1920 void nd_free(ND p)

Line 2316 void nd_free(ND p)

FREEND(p);

}

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

void ndv_free(NDV p)

{

GC_free(BDY(p));

}

void nd_append_red(unsigned int *d,int i)

{

RHist m,m0;

int h;

NEWRHist(m);

h = ndl_hash_value(td,d);

h = ndl_hash_value(d);

m->index = i;

TD(m) = td;

ndl_copy(d,DL(m));

NEXT(m) = nd_red[h];

nd_red[h] = m;

Line 1945 unsigned int *dp_compute_bound(DP p)

Line 2345 unsigned int *dp_compute_bound(DP p)

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

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

m = BDY(p);

bcopy(DL(m)->d,d1,nd_nvar*sizeof(unsigned int));

d = DL(m)->d;

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

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

d = DL(m)->d;

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

Line 1954 unsigned int *dp_compute_bound(DP p)

Line 2355 unsigned int *dp_compute_bound(DP p)

}

l = (nd_nvar+31);

t = (unsigned int *)MALLOC_ATOMIC(l*sizeof(unsigned int));

bzero(t,l*sizeof(unsigned int));

for ( i = 0; i < nd_nvar; i++ ) t[i] = d1[i];

bcopy(d1,t,nd_nvar*sizeof(unsigned int));

for ( ; i < l; i++ ) t[i] = 0;

return t;

}

Line 1969 unsigned int *nd_compute_bound(ND p)

Line 2370 unsigned int *nd_compute_bound(ND p)

return 0;

d1 = (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));

ndl_copy(HDL(p),d1);

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

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

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

}

l = nd_nvar+31;

t = (unsigned int *)MALLOC_ATOMIC(l*sizeof(unsigned int));

bzero(t,l*sizeof(unsigned int));

for ( i = 0; i < l; i++ ) t[i] = 0;

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

t[i] = (d1[i/nd_epw]>>((nd_epw-(i%nd_epw)-1)*nd_bpe))&nd_mask0;

t[i] = (d1[i/nd_epw+1]>>((nd_epw-(i%nd_epw)-1)*nd_bpe))&nd_mask0;

for ( ; i < l; i++ ) t[i] = 0;

return t;

}

Line 1998 void nd_setup_parameters() {

Line 2400 void nd_setup_parameters() {

nd_mask[nd_epw-i-1] = (nd_mask0<<(i*nd_bpe));

nd_mask1 |= (1<<(nd_bpe-1))<<(i*nd_bpe);

}

nm_adv = sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int);

nm_adv = sizeof(struct oNM)+nd_wpd*sizeof(unsigned int);

nmv_adv = sizeof(struct oNMV)+(nd_wpd-1)*sizeof(unsigned int);

nmv_adv = sizeof(struct oNMV)+nd_wpd*sizeof(unsigned int);

}

/* mod < 0 => realloc nd_ps and pd_psq */

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

{

int i,obpe,oadv;

int i,obpe,oadv,h;

NM prev_nm_free_list;

RHist mr0,mr;

RHist r;

RHist *old_red;

ND_pairs s0,s,t,prev_ndp_free_list;

obpe = nd_bpe;

oadv = nmv_adv;

if ( obpe < 4 )

if ( obpe < 4 ) nd_bpe = 4;

nd_bpe = 4;

else if ( obpe < 6 ) nd_bpe = 6;

else if ( obpe < 6 )

else if ( obpe < 8 ) nd_bpe = 8;

nd_bpe = 6;

else if ( obpe < 16 ) nd_bpe = 16;

else if ( obpe < 8 )

else if ( obpe < 32 ) nd_bpe = 32;

nd_bpe = 8;

else error("nd_reconstruct : exponent too large");

else if ( obpe < 16 )

nd_bpe = 16;

else if ( obpe < 32 )

nd_bpe = 32;

else

error("nd_reconstruct : exponent too large");

nd_setup_parameters();

prev_nm_free_list = _nm_free_list;

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

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

_nm_free_list = 0;

_ndp_free_list = 0;

if ( mod != 0 )

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

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

ndv_realloc(nd_ps[i],obpe,oadv);

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

ndv_realloc(nd_psq[i],obpe,oadv);

s0 = 0;

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

NEXTND_pairs(s0,s);

s->i1 = t->i1;

s->i2 = t->i2;

TD(s) = TD(t);

SG(s) = SG(t);

ndl_dup(obpe,t->lcm,s->lcm);

ndl_dup(obpe,LCM(t),LCM(s));

}

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

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

for ( mr0 = 0, r = nd_red[i]; r; r = NEXT(r) ) {

old_red[i] = nd_red[i];

NEXTRHist(mr0,mr);

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

TD(mr) = TD(r);

ndl_dup(obpe,DL(r),DL(mr));

h = ndl_hash_value(DL(mr));

NEXT(mr) = nd_red[h];

nd_red[h] = mr;

}

if ( mr0 ) NEXT(mr) = 0;

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

nd_red[i] = mr0;

old_red = 0;

}

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

NEWRHist(r); SG(r) = SG(nd_psh[i]);

TD(r) = TD(nd_psh[i]); ndl_dup(obpe,DL(nd_psh[i]),DL(r));

ndl_dup(obpe,DL(nd_psh[i]),DL(r));

nd_psh[i] = r;

}

if ( s0 ) NEXT(s) = 0;

prev_nm_free_list = 0;

prev_ndp_free_list = 0;

BDY(ndv_red) = (NMV)REALLOC(BDY(ndv_red),nmv_len*nmv_adv);

GC_gcollect();

return s0;

}

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

{

int i,obpe,oadv,h;

NM prev_nm_free_list;

RHist mr0,mr;

RHist r;

RHist *old_red;

ND_pairs s0,s,t,prev_ndp_free_list;

obpe = nd_bpe;

oadv = nmv_adv;

if ( obpe < 4 ) nd_bpe = 4;

else if ( obpe < 6 ) nd_bpe = 6;

else if ( obpe < 8 ) nd_bpe = 8;

else if ( obpe < 16 ) nd_bpe = 16;

else if ( obpe < 32 ) nd_bpe = 32;

else error("nd_reconstruct_direct : exponent too large");

nd_setup_parameters();

prev_nm_free_list = _nm_free_list;

prev_ndp_free_list = _ndp_free_list;

_nm_free_list = 0; _ndp_free_list = 0;

if ( mod != 0 )

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

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_dup(obpe,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();

}

void ndl_dup(int obpe,unsigned int *d,unsigned int *r)

{

int n,i,ei,oepw,cepw,cbpe;

Line 2079 void ndl_dup(int obpe,unsigned int *d,unsigned int *r)

Line 2525 void ndl_dup(int obpe,unsigned int *d,unsigned int *r)

oepw = (sizeof(unsigned int)*8)/obpe;

cepw = nd_epw;

cbpe = nd_bpe;

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

TD(r) = TD(d);

r[i] = 0;

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

if ( is_rlex )

if ( nd_isrlex )

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

ei = (d[(n-1-i)/oepw]>>((oepw-((n-1-i)%oepw)-1)*obpe))

ei = (d[(n-1-i)/oepw+1]>>((oepw-((n-1-i)%oepw)-1)*obpe))

&((1<<obpe)-1);

r[(n-1-i)/cepw] |= (ei<<((cepw-((n-1-i)%cepw)-1)*cbpe));

r[(n-1-i)/cepw+1] |= (ei<<((cepw-((n-1-i)%cepw)-1)*cbpe));

}

else

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

ei = (d[i/oepw]>>((oepw-(i%oepw)-1)*obpe))

ei = (d[i/oepw+1]>>((oepw-(i%oepw)-1)*obpe))

&((1<<obpe)-1);

r[i/cepw] |= (ei<<((cepw-(i%cepw)-1)*cbpe));

r[i/cepw+1] |= (ei<<((cepw-(i%cepw)-1)*cbpe));

}

Line 2104 void nd_realloc(ND p,int obpe)

Line 2550 void nd_realloc(ND p,int obpe)

for ( mr0 = 0; m; m = NEXT(m) ) {

NEXTNM(mr0,mr);

CM(mr) = CM(m);

TD(mr) = TD(m);

ndl_dup(obpe,DL(m),DL(mr));

}

NEXT(mr) = 0;

Line 2121 ND nd_copy(ND p)

Line 2566 ND nd_copy(ND p)

if ( !p )

return 0;

else {

s = sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int);

s = sizeof(struct oNM)+nd_wpd*sizeof(unsigned int);

for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {

NEXTNM(mr0,mr);

CM(mr) = CM(m);

TD(mr) = TD(m);

ndl_copy(DL(m),DL(mr));

}

NEXT(mr) = 0;

MKND(NV(p),mr0,r);

MKND(NV(p),mr0,LEN(p),r);

SG(r) = SG(p);

return r;

}

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

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

} else {

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

}

lcm = p->lcm;

lcm = LCM(p);

td = TD(p);

NEWNM(m);

CQ(m) = HCQ(p2);

TD(m) = td-HTD(p1); ndl_sub(lcm,HDL(p1),DL(m));

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

if ( ndl_check_bound2(p->i1,DL(m)) )

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

return 0;

t1 = ndv_mul_nm(mod,p1,m);

t1 = ndv_mul_nm_create(mod,p1,m);

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

if ( mod )

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

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

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

else

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

TD(m) = td-HTD(p2); ndl_sub(lcm,HDL(p2),DL(m));

if ( ndl_check_bound2(p->i2,DL(m)) ) {

nd_free(t1);

return 0;

}

ndv_mul_nm(mod,p2,m,ndv_red);

t2 = ndv_mul_nm(mod,p2,m);

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

FREENM(m);

*rp = ndv_add(mod,t1,ndv_red);

return 1;

}

Line 2176 void ndv_mul_c(int mod,NDV p,int mul)

Line 2616 void ndv_mul_c(int mod,NDV p,int mul)

NMV m;

int c,c1,len,i;

if ( !p )

if ( !p ) return;

return;

len = LEN(p);

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

c1 = CM(m);

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

DMAR(c1,mul,0,mod,c);

CM(m) = c;

}

Line 2192 void ndv_mul_c_q(NDV p,Q mul)

Line 2629 void ndv_mul_c_q(NDV p,Q mul)

Q c;

int len,i;

if ( !p )

if ( !p ) return;

return;

len = LEN(p);

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

mulq(CQ(m),mul,&c); CQ(m) = c;

}

void ndv_mul_nm(int mod,NDV p,NM m0,NDV r)

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

{

NMV m,mr,mr0;

unsigned int *d,*dt,*dm;

int c,n,td,i,c1,c2,len;

Q q;

if ( !p )

/* XXX */

LEN(r) = 0;

else {

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

d = DL(m0); td = TD(m0);

mr = BDY(r);

if ( mod ) {

c = CM(m0);

for ( ; len > 0; len--, NMV_ADV(m), NMV_ADV(mr) ) {

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

TD(mr) = TD(m)+td; ndl_add(DL(m),d,DL(mr));

}

} else {

q = CQ(m0);

for ( ; len > 0; len--, NMV_ADV(m), NMV_ADV(mr) ) {

mulq(CQ(m),q,&CQ(mr));

TD(mr) = TD(m)+td; ndl_add(DL(m),d,DL(mr));

}

NV(r) = NV(p);

LEN(r) = LEN(p);

SG(r) = SG(p) + td;

}

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

{

NM mr,mr0;

NMV m;

unsigned int *d,*dt,*dm;

Line 2242 ND ndv_mul_nm_create(int mod,NDV p,NM m0)

Line 2645 ND ndv_mul_nm_create(int mod,NDV p,NM m0)

Q q;

ND r;

if ( !p )

if ( !p ) return 0;

return 0;

else {

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

d = DL(m0); td = TD(m0);

d = DL(m0);

len = LEN(p);

mr0 = 0;

td = TD(d);

if ( mod ) {

c = CM(m0);

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

Line 2256 ND ndv_mul_nm_create(int mod,NDV p,NM m0)

Line 2659 ND ndv_mul_nm_create(int mod,NDV p,NM m0)

c1 = CM(m);

DMAR(c1,c,0,mod,c2);

CM(mr) = c2;

TD(mr) = TD(m)+td;

ndl_add(DL(m),d,DL(mr));

}

} else {

Line 2264 ND ndv_mul_nm_create(int mod,NDV p,NM m0)

Line 2666 ND ndv_mul_nm_create(int mod,NDV p,NM m0)

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

NEXTNM(mr0,mr);

mulq(CQ(m),q,&CQ(mr));

TD(mr) = TD(m)+td;

ndl_add(DL(m),d,DL(mr));

}

NEXT(mr) = 0;

MKND(NV(p),mr0,r);

MKND(NV(p),mr0,len,r);

SG(r) = SG(p) + td;

SG(r) = SG(p) + TD(d);

return r;

}

ND ndv_add(int mod,ND p1,NDV p2)

{

int c,c1,c2,t,td,td2,mul,len,i;

NM head;

unsigned int *d;

NMV m2;

Q q;

if ( !p1 )

return 0;

else if ( !mod )

return ndv_add_q(p1,p2);

else {

prev = 0; head = cur = BDY(p1);

NEWNM(new); len = LEN(p2);

for ( m2 = BDY(p2), i = 0; cur && i < len; ) {

td2 = TD(new) = TD(m2);

if ( TD(cur) > td2 ) {

prev = cur; cur = NEXT(cur);

continue;

} else if ( TD(cur) < td2 ) c = -1;

else if ( nd_wpd == 1 ) {

if ( DL(cur)[0] > DL(m2)[0] ) c = is_rlex ? -1 : 1;

else if ( DL(cur)[0] < DL(m2)[0] ) c = is_rlex ? 1 : -1;

else c = 0;

}

else c = ndl_compare(DL(cur),DL(m2));

switch ( c ) {

case 0:

t = CM(m2)+CM(cur)-mod;

if ( t < 0 ) t += mod;

if ( t ) CM(cur) = t;

else if ( !prev ) {

head = NEXT(cur); FREENM(cur); cur = head;

} else {

NEXT(prev) = NEXT(cur); FREENM(cur); cur = NEXT(prev);

}

NMV_ADV(m2); i++;

break;

case 1:

prev = cur; cur = NEXT(cur);

break;

case -1:

ndl_copy(DL(m2),DL(new));

CQ(new) = CQ(m2);

if ( !prev ) {

/* cur = head */

prev = new; NEXT(prev) = head; head = prev;

} else {

NEXT(prev) = new; NEXT(new) = cur; prev = new;

}

NEWNM(new); NMV_ADV(m2); i++;

break;

}

for ( ; i < len; i++, NMV_ADV(m2) ) {

td2 = TD(new) = TD(m2); CQ(new) = CQ(m2); ndl_copy(DL(m2),DL(new));

if ( !prev ) {

prev = new; NEXT(prev) = 0; head = prev;

} else {

NEXT(prev) = new; NEXT(new) = 0; prev = new;

}

NEWNM(new);

}

FREENM(new);

if ( head ) {

BDY(p1) = head; SG(p1) = MAX(SG(p1),SG(p2));

return p1;

} else {

FREEND(p1);

return 0;

}

ND ndv_add_q(ND p1,NDV p2)

{

int c,c1,c2,t,td,td2,mul,len,i;

NM head;

unsigned int *d;

NMV m2;

Q q;

if ( !p1 )

return 0;

else {

prev = 0; head = cur = BDY(p1);

NEWNM(new); len = LEN(p2);

for ( m2 = BDY(p2), i = 0; cur && i < len; ) {

td2 = TD(new) = TD(m2);

if ( TD(cur) > td2 ) {

prev = cur; cur = NEXT(cur);

continue;

} else if ( TD(cur) < td2 ) c = -1;

else if ( nd_wpd == 1 ) {

if ( DL(cur)[0] > DL(m2)[0] ) c = is_rlex ? -1 : 1;

else if ( DL(cur)[0] < DL(m2)[0] ) c = is_rlex ? 1 : -1;

else c = 0;

}

else c = ndl_compare(DL(cur),DL(m2));

switch ( c ) {

case 0:

addq(CQ(cur),CQ(m2),&q);

if ( q )

CQ(cur) = q;

else if ( !prev ) {

head = NEXT(cur); FREENM(cur); cur = head;

} else {

NEXT(prev) = NEXT(cur); FREENM(cur); cur = NEXT(prev);

}

NMV_ADV(m2); i++;

break;

case 1:

prev = cur; cur = NEXT(cur);

break;

case -1:

ndl_copy(DL(m2),DL(new));

CQ(new) = CQ(m2);

if ( !prev ) {

/* cur = head */

prev = new; NEXT(prev) = head; head = prev;

} else {

NEXT(prev) = new; NEXT(new) = cur; prev = new;

}

NEWNM(new); NMV_ADV(m2); i++;

break;

}

for ( ; i < len; i++, NMV_ADV(m2) ) {

td2 = TD(new) = TD(m2); CQ(new) = CQ(m2); ndl_copy(DL(m2),DL(new));

if ( !prev ) {

prev = new; NEXT(prev) = 0; head = prev;

} else {

NEXT(prev) = new; NEXT(new) = 0; prev = new;

}

NEWNM(new);

}

FREENM(new);

if ( head ) {

BDY(p1) = head; SG(p1) = MAX(SG(p1),SG(p2));

return p1;

} else {

FREEND(p1);

return 0;

}

void ndv_realloc(NDV p,int obpe,int oadv)

{

NMV m,mr,mr0,t;

Line 2437 void ndv_realloc(NDV p,int obpe,int oadv)

Line 2686 void ndv_realloc(NDV p,int obpe,int oadv)

if ( p ) {

m = BDY(p); len = LEN(p);

if ( nmv_adv > oadv )

mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p);

mr0 = (NMV)REALLOC(BDY(p),len*nmv_adv);

else

mr0 = BDY(p);

m = (NMV)((char *)mr0+(len-1)*oadv);

mr = (NMV)((char *)mr0+(len-1)*nmv_adv);

t = (NMV)ALLOCA(nmv_adv);

for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) {

CQ(t) = CQ(m);

TD(t) = TD(m);

for ( k = 0; k < nd_wpd; k++ ) DL(t)[k] = 0;

ndl_dup(obpe,DL(m),DL(t));

CQ(mr) = CQ(t);

TD(mr) = TD(t);

ndl_copy(DL(t),DL(mr));

}

BDY(p) = mr0;

Line 2464 NDV ndtondv(int mod,ND p)

Line 2708 NDV ndtondv(int mod,ND p)

NM t;

int i,len;

if ( !p )

if ( !p ) return 0;

return 0;

len = LEN(p);

len = nd_length(p);

m0 = m = (NMV)(mod?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv));

if ( mod )

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

else

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

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

TD(m) = TD(t);

ndl_copy(DL(t),DL(m));

CQ(m) = CQ(t);

}

Line 2481 NDV ndtondv(int mod,ND p)

Line 2720 NDV ndtondv(int mod,ND p)

return d;

}

ND ndvtond(int mod,NDV p)

{

ND d;

NM m,m0;

NMV t;

int i,len;

if ( !p ) return 0;

m0 = 0;

len = p->len;

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

NEXTNM(m0,m);

ndl_copy(DL(t),DL(m));

CQ(m) = CQ(t);

}

NEXT(m) = 0;

MKND(NV(p),m0,len,d);

SG(d) = SG(p);

return d;

}

NDV dptondv(int mod,DP p)

{

NDV d;

Line 2489 NDV dptondv(int mod,DP p)

Line 2749 NDV dptondv(int mod,DP p)

DP q;

int l,i,n;

if ( !p )

if ( !p ) return 0;

return 0;

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

if ( mod ) {

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

Line 2499 NDV dptondv(int mod,DP p)

Line 2758 NDV dptondv(int mod,DP p)

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

if ( mod )

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

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

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

else

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

TD(m) = TD(DL(t));

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

}

MKNDV(n,m0,l,d);

Line 2518 DP ndvtodp(int mod,NDV p)

Line 2774 DP ndvtodp(int mod,NDV p)

NMV t;

int len,i,n;

if ( !p )

if ( !p ) return 0;

return 0;

m0 = 0;

len = LEN(p);

n = NV(p);

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

NEXTMP(m0,m);

if ( mod )

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

C(m) = STOI(CM(t));

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

else

DL(m) = ndltodl(n,DL(t));

C(m) = (P)CQ(t);

DL(m) = ndltodl(n,TD(t),DL(t));

}

NEXT(m) = 0;

MKDP(NV(p),m0,d);

Line 2542 void ndv_print(NDV p)

Line 2795 void ndv_print(NDV p)

NMV m;

int i,len;

if ( !p )

if ( !p ) printf("0\n");

printf("0\n");

else {

len = LEN(p);

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

Line 2559 void ndv_print_q(NDV p)

Line 2811 void ndv_print_q(NDV p)

NMV m;

int i,len;

if ( !p )

if ( !p ) printf("0\n");

printf("0\n");

else {

len = LEN(p);

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

Line 2572 void ndv_print_q(NDV p)

Line 2823 void ndv_print_q(NDV p)

printf("\n");

}

NODE nd_reducebase(NODE x)

{

int len,i,j;

NDV *w;

NODE t,t0;

len = length(x);

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

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

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

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

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

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

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

}

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

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

}

NEXT(t) = 0; x = t0;

return x;

}

void nd_init_ord(struct order_spec *ord)

{

if ( ord->id )

error("nd_gr : unsupported order");

nd_dcomp = 0;

switch ( ord->ord.simple ) {

case 0:

nd_dcomp = 1;

nd_isrlex = 1;

break;

case 1:

nd_dcomp = 1;

nd_isrlex = 0;

break;

case 9:

/* td1->td->rlex */

nd_dcomp = -dp_nelim;

nd_isrlex = 1;

break;

default:

error("nd_gr : unsupported order");

}

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