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.33 and 1.34

version 1.33, 2003/08/19 05:29:11

version 1.34, 2003/08/20 06:06:07

Line 1

/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.32 2003/08/19 04:38:09 noro Exp $ */

/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.33 2003/08/19 05:29:11 noro Exp $ */

#include "ca.h"

#include "inline.h"

Line 40 typedef struct oNM {

int m;

Q z;

} c;

int td;

unsigned int dl[1];

} *NM;

Line 49 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 (*nm_compare_function)(NM a,NM b);

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

int (*nmv_compare_function)(NMV a,NMV b);

int (*ndp_compare_function)(ND_pairs a,ND_pairs b);

double nd_scale=2;

static unsigned int **nd_bound;

Line 94 int nd_red_len;

Line 90 int nd_red_len;

int nd_found,nd_create,nd_notfirst;

int nm_adv;

int nmv_adv;

int nd_degcompat;

int nd_dcomp;

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 NM_COMPARE(m1,m2)\

#define TD_DL_COMPARE(d1,d2)\

(nd_degcompat?(TD(m1)>TD(m2)?1\

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

:(TD(m1)<TD(m2)?-1:ndl_compare(DL(m1),DL(m2))))\

:(*nm_compare_function)(m1,m2))

#define DL_COMPARE(d1,d2)\

#define NMV_COMPARE(m1,m2)\

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

(nd_degcompat?(TD(m1)>TD(m2)?1\

:(TD(m1)<TD(m2)?-1:ndl_compare(DL(m1),DL(m2))))\

:(*nmv_compare_function)(m1,m2))

#define NDP_COMPARE(m1,m2)\

(nd_degcompat?(TD(m1)>TD(m2)?1\

:(TD(m1)<TD(m2)?-1:ndl_compare(LCM(m1),LCM(m2))))\

:(*ndp_compare_function)(m1,m2))

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

(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 135 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 185 void nd_free_private_storage();

Line 183 void nd_free_private_storage();

void _NM_alloc();

void _ND_alloc();

int ndl_td(unsigned int *d);

int ndl_dehomogenize(unsigned int *p);

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

Line 213 void ndp_print(ND_pairs d);

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

Line 251 void _NM_alloc()

Line 247 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 274 void _NDP_alloc()

Line 270 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;

}

Line 292 INLINE int nd_length(ND p)

Line 288 INLINE int nd_length(ND p)

}

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

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

{

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 313 INLINE int ndl_reducible(unsigned int *d1,unsigned int

Line 310 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 324 INLINE int ndl_reducible(unsigned int *d1,unsigned int

Line 321 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 334 INLINE int ndl_reducible(unsigned int *d1,unsigned int

Line 331 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 342 INLINE int ndl_reducible(unsigned int *d1,unsigned int

Line 339 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 356 INLINE int ndl_reducible(unsigned int *d1,unsigned int

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

}

/* returns the exponent of homo variable */

void ndl_dehomogenize(unsigned int *d)

int ndl_dehomogenize(unsigned int *d)

{

unsigned int mask;

unsigned int h;

Line 366 int ndl_dehomogenize(unsigned int *d)

Line 361 int ndl_dehomogenize(unsigned int *d)

if ( nd_isrlex ) {

if ( nd_bpe == 32 ) {

h = d[0];

h = d[1];

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

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

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

d[i-1] = 0;

return h;

TD(d) -= h;

} else {

bits = nd_epw*nd_bpe;

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

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

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

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

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

return h;

TD(d) -= h;

}

} else {

} else

/* do nothing */

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

return d[nd_wpd-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)

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

Line 387 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 407 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

Line 401 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 418 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

Line 412 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 428 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

Line 422 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 436 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

Line 430 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 451 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in

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

}

break;

}

TD(d) = ndl_td(d);

}

int ndl_td(unsigned int *d)

Line 458 int ndl_td(unsigned int *d)

Line 453 int ndl_td(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 466 int ndl_td(unsigned int *d)

Line 461 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;

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

Line 477 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 494 INLINE void ndl_copy(unsigned int *d1,unsigned int *d2

Line 490 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;

}

/* XXX : TD is not added */

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

{

int i;

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 560 int ndl_disjoint(unsigned int *d1,unsigned int *d2)

Line 541 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 574 int ndl_disjoint(unsigned int *d1,unsigned int *d2)

Line 555 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 585 int ndl_disjoint(unsigned int *d1,unsigned int *d2)

Line 566 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 595 int ndl_disjoint(unsigned int *d1,unsigned int *d2)

Line 576 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 603 int ndl_disjoint(unsigned int *d1,unsigned int *d2)

Line 584 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 630 int ndl_check_bound2(int index,unsigned int *d2)

Line 611 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 644 int ndl_check_bound2(int index,unsigned int *d2)

Line 625 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 655 int ndl_check_bound2(int index,unsigned int *d2)

Line 636 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 665 int ndl_check_bound2(int index,unsigned int *d2)

Line 646 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 673 int ndl_check_bound2(int index,unsigned int *d2)

Line 654 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 696 int ndl_check_bound2_direct(unsigned int *d1,unsigned

Line 677 int ndl_check_bound2_direct(unsigned int *d1,unsigned

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>>28)&0xf)+((u2>>28)&0xf) >= 0x10 ) return 1;

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

Line 710 int ndl_check_bound2_direct(unsigned int *d1,unsigned

Line 691 int ndl_check_bound2_direct(unsigned int *d1,unsigned

return 0;

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>>24)&0x3f)+((u2>>24)&0x3f) >= 0x40 ) return 1;

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

Line 721 int ndl_check_bound2_direct(unsigned int *d1,unsigned

Line 702 int ndl_check_bound2_direct(unsigned int *d1,unsigned

return 0;

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>>24)&0xff)+((u2>>24)&0xff) >= 0x100 ) return 1;

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

Line 731 int ndl_check_bound2_direct(unsigned int *d1,unsigned

Line 712 int ndl_check_bound2_direct(unsigned int *d1,unsigned

return 0;

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>>16)&0xffff)+((u2>>16)&0xffff) > 0x10000 ) return 1;

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

Line 739 int ndl_check_bound2_direct(unsigned int *d1,unsigned

Line 720 int ndl_check_bound2_direct(unsigned int *d1,unsigned

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

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

k = (nd_epw-1)*nd_bpe;

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

Line 756 int ndl_check_bound2_direct(unsigned int *d1,unsigned

Line 737 int ndl_check_bound2_direct(unsigned int *d1,unsigned

}

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

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 770 INLINE int ndl_hash_value(int td,unsigned int *d)

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

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;

Line 783 INLINE int nd_find_reducer(ND g)

Line 766 INLINE int nd_find_reducer(ND g)

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;

}

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

Line 793 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 ( HTD(g) >= HTD(r) && ndl_reducible(HDL(g),HDL(r)) ) {

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

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

nd_append_red(HDL(g),i);

return i;

}

else

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

r = ps[i];

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

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

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

nd_append_red(HDL(g),i);

return i;

}

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

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

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

{

int n,c;

int t,can;

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 if ( !mod )

return nd_add_q(p1,p2);

else {

can = 0;

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

c = NM_COMPARE(m1,m2);

c = DL_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 ) {

can++;

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

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

} else {

can += 2;

can += 2; FREENM(s);

FREENM(s);

}

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

break;

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

Line 844 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;

Line 894 ND nd_add_q(ND p1,ND p2)

Line 865 ND nd_add_q(ND p1,ND p2)

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

c = NM_COMPARE(m1,m2);

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

switch ( c ) {

case 0:

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

s = m1; m1 = NEXT(m1);

if ( t ) {

can++;

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

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

} else {

can += 2;

can += 2; FREENM(s);

FREENM(s);

}

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

break;

Line 924 ND nd_add_q(ND p1,ND p2)

Line 891 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;

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

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

*rp = 0;

return 1;

}

if ( !mod )

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

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 993 int nd_nf(int mod,ND g,int full,ND *rp)

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

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

}

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

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

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;

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

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

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

LEN(g)--;

} else {

FREEND(g); g = 0;

}

if ( d ) {

NEXT(tail)=m;

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

tail=m;

LEN(d)++;

} else {

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

}

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

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

}

sugar = SG(g);

n = NV(g);

if ( !mod )

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

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

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 )

if ( d ) SG(d) = sugar;

SG(d) = sugar;

*rp = d;

return 1;

}

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

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

if ( index >= 0 ) {

h = nd_psh[index];

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

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

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

nd_free(d);

free_pbucket(bucket);

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

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

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

red = nd_remove_head(red);

add_pbucket(mod,bucket,red);

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

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

sugar = MAX(sugar,psugar);

if ( !mod && hmag && (gmag > hmag) ) {

g = normalize_pbucket(mod,bucket);

if ( !g ) {

if ( d )

if ( d ) SG(d) = sugar;

SG(d) = sugar;

*rp = d;

return 1;

}

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

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

}

} else if ( !full ) {

g = normalize_pbucket(mod,bucket);

if ( g )

if ( g ) SG(g) = sugar;

SG(g) = sugar;

*rp = g;

return 1;

} else {

m = BDY(g);

if ( NEXT(m) ) {

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

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

LEN(g)--;

} else {

FREEND(g); g = 0;

}

bucket->body[hindex] = g;

NEXT(m) = 0;

if ( d ) {

NEXT(tail)=m;

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

tail=m;

LEN(d)++;

} else {

MKND(n,m,1,d);

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

tail = BDY(d);

}

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

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

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_direct(g,ps,len);

if ( index >= 0 ) {

p = ps[index];

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

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

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

nd_free(g); nd_free(d);

return 0;

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

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

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

}

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

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

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;

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

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

} else {

m = BDY(g);

if ( NEXT(m) ) {

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

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

LEN(g)--;

} else {

FREEND(g); g = 0;

}

if ( d ) {

NEXT(tail)=m;

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

tail=m;

LEN(d)++;

} else {

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

}

Line 1238 int nd_nf_direct_pbucket(int mod,ND g,NDV *ps,int len,

Line 1172 int nd_nf_direct_pbucket(int mod,ND g,NDV *ps,int len,

bucket = create_pbucket();

add_pbucket(mod,bucket,g);

d = 0;

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

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

Line 1252 int nd_nf_direct_pbucket(int mod,ND g,NDV *ps,int len,

Line 1186 int nd_nf_direct_pbucket(int mod,ND g,NDV *ps,int len,

if ( index >= 0 ) {

p = ps[index];

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

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

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

nd_free(d);

free_pbucket(bucket);

Line 1274 int nd_nf_direct_pbucket(int mod,ND g,NDV *ps,int len,

Line 1207 int nd_nf_direct_pbucket(int mod,ND g,NDV *ps,int len,

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

red = nd_remove_head(red);

add_pbucket(mod,bucket,red);

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

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

if ( !mod && hmag && (gmag > hmag) ) {

g = normalize_pbucket(mod,bucket);

if ( !g ) {

if ( d )

if ( d ) SG(d) = sugar;

SG(d) = sugar;

*rp = d;

return 1;

}

Line 1289 int nd_nf_direct_pbucket(int mod,ND g,NDV *ps,int len,

Line 1221 int nd_nf_direct_pbucket(int mod,ND g,NDV *ps,int len,

}

} else if ( !full ) {

g = normalize_pbucket(mod,bucket);

if ( g )

if ( g ) SG(g) = sugar;

SG(g) = sugar;

*rp = g;

return 1;

} else {

m = BDY(g);

if ( NEXT(m) ) {

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

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

LEN(g)--;

} else {

FREEND(g); g = 0;

}

bucket->body[hindex] = g;

NEXT(m) = 0;

if ( d ) {

NEXT(tail)=m;

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

tail=m;

LEN(d)++;

} else {

MKND(n,m,1,d);

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

tail = BDY(d);

}

Line 1330 int nd_check_candidate(NODE input,NODE cand)

Line 1257 int nd_check_candidate(NODE input,NODE 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 )

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

nd_reconstruct_direct(0,nd_psq,n);

else if ( nf ) return 0;

else if ( nf )

return 0;

}

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

if ( !nd_gb(0,1) )

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

return 0;

/* XXX */

return 1;

}

Line 1348 ND nd_remove_head(ND p)

Line 1272 ND nd_remove_head(ND p)

m = BDY(p);

if ( !NEXT(m) ) {

FREEND(p);

FREEND(p); p = 0;

p = 0;

} else {

BDY(p) = NEXT(m);

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

LEN(p)--;

}

FREENM(m);

return p;

Line 1404 void mulq_pbucket(PGeoBucket g,Q c)

Line 1326 void mulq_pbucket(PGeoBucket g,Q c)

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

}

/* XXX not completed */

int head_pbucket(int mod,PGeoBucket g)

{

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

Line 1423 int head_pbucket(int mod,PGeoBucket g)

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

c = NM_COMPARE(BDY(gi),BDY(gj));

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 1457 int head_pbucket_q(PGeoBucket g)

Line 1372 int head_pbucket_q(PGeoBucket g)

{

int j,i,c,k,nv;

Q sum,t;

unsigned int *di,*dj;

ND gi,gj;

k = g->m;

while ( 1 ) {

j = -1;

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

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

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

continue;

if ( j < 0 ) {

j = i;

gj = g->body[j];

dj = HDL(gj);

sum = HCQ(gj);

} else {

di = HDL(gi);

nv = NV(gi);

c = NM_COMPARE(BDY(gi),BDY(gj));

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

if ( c > 0 ) {

if ( sum )

if ( sum ) HCQ(gj) = sum;

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

} else if ( c == 0 ) {

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

Line 1491 int head_pbucket_q(PGeoBucket g)

Line 1399 int head_pbucket_q(PGeoBucket g)

}

if ( j < 0 )

if ( j < 0 ) return -1;

return -1;

else if ( sum ) {

HCQ(gj) = sum;

return j;

Line 1562 again:

Line 1469 again:

}

if ( m )

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

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

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

else

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

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

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

return g;

}

Line 1628 again:

Line 1533 again:

int ndv_compare(NDV *p1,NDV *p2)

{

return NMV_COMPARE(BDY(*p1),BDY(*p2));

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

}

int ndv_compare_rev(NDV *p1,NDV *p2)

{

return -NMV_COMPARE(BDY(*p1),BDY(*p2));

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

}

NODE nd_reduceall(int m,NODE f)

Line 1650 NODE nd_reduceall(int m,NODE f)

Line 1555 NODE nd_reduceall(int m,NODE f)

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

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

w[j] = (NDV)ps[j];

for ( j = i+1; j < n; j++ ) w[j-1] = 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 )

Line 1661 NODE nd_reduceall(int m,NODE f)

Line 1564 NODE nd_reduceall(int m,NODE f)

else if ( !nf ) {

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

ndv_free(ps[i]);

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

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

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

n--;

} else {

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

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

Line 1595 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 1719 ND_pairs nd_newpairs( NODE g, int t )

Line 1616 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 1748 ND_pairs crit_B( ND_pairs d, int s )

Line 1643 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 1762 ND_pairs crit_B( ND_pairs d, int s )

Line 1657 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 1865 static ND_pairs equivalent_pairs( ND_pairs d1, ND_pair

Line 1755 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;

w = s;

} else {

Line 1890 NODE update_base(NODE nd,int ndp)

Line 1778 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 1922 ND_pairs nd_minp( ND_pairs d, ND_pairs *prest )

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

}

s = SG(m);

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

if ( (SG(p) < s) || ((SG(p) == s) && (NDP_COMPARE(p,m) < 0)) ) {

if ( (SG(p) < s)

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

ml = l;

m = p;

s = SG(m);

Line 1952 int nd_newps(int mod,ND a)

Line 1838 int nd_newps(int mod,ND a)

}

nd_removecont(mod,a);

nd_bound[nd_psn] = nd_compute_bound(a);

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

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

nd_psh[nd_psn] = r;

b = ndtondv(mod,a);

len = LEN(b);

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

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

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

nd_bound[nd_psn] = nd_compute_bound(nfq);

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

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

nd_psh[nd_psn] = r;

nd_free(nf); nd_free(nfq);

return nd_psn++;

Line 2016 void nd_setup(int mod,NODE f)

Line 1902 void 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();

Line 2037 void nd_setup(int mod,NODE f)

Line 1917 void nd_setup(int mod,NODE f)

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

ndv_removecont(mod,a);

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

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

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

if ( mod )

if ( mod ) nd_ps[i] = a;

nd_ps[i] = a;

else nd_psq[i] = a;

else

nd_psq[i] = a;

nd_psh[i] = r;

}

Line 2070 void nd_setup_trace(int mod,NODE f)

Line 1948 void nd_setup_trace(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();

Line 2091 void nd_setup_trace(int mod,NODE f)

Line 1963 void nd_setup_trace(int mod,NODE f)

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

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

nd_psh[i] = r;

}

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

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

int i;

d = dl->d;

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

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

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_td(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 ( 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 2248 ND dptond(int mod,DP p)

Line 2121 ND dptond(int mod,DP p)

m0 = 0;

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;

Line 2274 DP ndtodp(int mod,ND p)

Line 2144 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 2296 void ndl_print(unsigned int *dl)

Line 2164 void ndl_print(unsigned int *dl)

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 2342 void ndp_print(ND_pairs d)

Line 2210 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 2357 void nd_removecont(int mod,ND p)

Line 2223 void nd_removecont(int mod,ND p)

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

v.len = n;

v.body = (pointer *)w;

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

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

w[i] = CQ(m);

removecont_array(w,n);

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

}

Line 2391 void nd_removecont2(ND p1,ND p2)

Line 2255 void nd_removecont2(ND p1,ND p2)

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

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

w[i] = CQ(m);

for ( m = BDY(p2); i < n; 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];

Line 2412 void ndv_removecont(int mod,NDV p)

Line 2274 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 2435 void ndv_dehomogenize(NDV p)

Line 2296 void ndv_dehomogenize(NDV p)

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

TD(m) -= ndl_dehomogenize(DL(m));

ndl_dehomogenize(DL(m));

if ( newwpd != nd_wpd ) {

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

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

newadv = sizeof(struct oNMV)+(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); TD(r) = TD(m); ndl_copy(DL(m),d); ndl_copy(d,DL(r));

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

}

NV(p)--;

Line 2463 void removecont_array(Q *c,int n)

Line 2324 void removecont_array(Q *c,int n)

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

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

}

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

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

if ( r[i] )

break;

if ( i < n ) {

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

igcdv(&v,&d1);

Line 2480 void removecont_array(Q *c,int n)

Line 2339 void removecont_array(Q *c,int n)

q[i] = u;

}

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

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

c[i] = q[i];

}

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

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

Line 2347 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 2503 void nd_mul_c_q(ND p,Q mul)

Line 2360 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 2514 void nd_free(ND p)

Line 2370 void nd_free(ND p)

{

NM t,s;

if ( !p )

if ( !p ) return;

return;

t = BDY(p);

while ( t ) {

s = NEXT(t);

Line 2530 void ndv_free(NDV p)

Line 2385 void ndv_free(NDV p)

GC_free(BDY(p));

}

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

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 2588 unsigned int *nd_compute_bound(ND p)

Line 2442 unsigned int *nd_compute_bound(ND p)

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

return t;

}

Line 2608 void nd_setup_parameters() {

Line 2462 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 */

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

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

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 2643 ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d)

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

}

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

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

NEXTRHist(mr0,mr);

mr->index = r->index;

SG(mr) = SG(r);

TD(mr) = TD(r);

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

}

if ( mr0 ) NEXT(mr) = 0;

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

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

}

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;

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

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

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_direct : exponent too large");

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;

_nm_free_list = 0; _ndp_free_list = 0;

_ndp_free_list = 0;

if ( mod != 0 )

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

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

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

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

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

NEXTRHist(mr0,mr);

mr->index = r->index;

SG(mr) = SG(r);

TD(mr) = TD(r);

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

}

if ( mr0 ) NEXT(mr) = 0;

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

Line 2570 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 ( 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 2760 void nd_realloc(ND p,int obpe)

Line 2595 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 2777 ND nd_copy(ND p)

Line 2611 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;

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

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

if ( mod )

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

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

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

else

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

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;

Line 2832 void ndv_mul_c(int mod,NDV p,int mul)

Line 2661 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 2848 void ndv_mul_c_q(NDV p,Q mul)

Line 2674 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;

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

Line 2690 ND ndv_mul_nm(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 2879 ND ndv_mul_nm(int mod,NDV p,NM m0)

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

c1 = CM(m);

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

CM(mr) = c2;

TD(mr) = TD(m)+td;

TD(DL(mr)) = TD(DL(m))+td;

ndl_add(DL(m),d,DL(mr));

}

} else {

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

Line 2712 ND ndv_mul_nm(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;

TD(DL(mr)) = TD(DL(m))+td;

ndl_add(DL(m),d,DL(mr));

}

NEXT(mr) = 0;

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

SG(r) = SG(p) + td;

SG(r) = SG(p) + TD(d);

return r;

}

Line 2908 void ndv_realloc(NDV p,int obpe,int oadv)

Line 2733 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 2935 NDV ndtondv(int mod,ND p)

Line 2755 NDV ndtondv(int mod,ND p)

NM t;

int i,len;

if ( !p )

if ( !p ) return 0;

return 0;

len = LEN(p);

if ( mod )

m0 = m = (NMV)(mod?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv));

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 2959 ND ndvtond(int mod,NDV p)

Line 2774 ND ndvtond(int mod,NDV p)

NMV t;

int i,len;

if ( !p )

if ( !p ) return 0;

return 0;

m0 = 0;

len = p->len;

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

NEXTNM(m0,m);

TD(m) = TD(t);

ndl_copy(DL(t),DL(m));

CQ(m) = CQ(t);

}

Line 2983 NDV dptondv(int mod,DP p)

Line 2796 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 2993 NDV dptondv(int mod,DP p)

Line 2805 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 3012 DP ndvtodp(int mod,NDV p)

Line 2821 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 3036 void ndv_print(NDV p)

Line 2842 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 3053 void ndv_print_q(NDV p)

Line 2858 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 3067 void ndv_print_q(NDV p)

Line 2871 void ndv_print_q(NDV p)

}

int nd_equal(ND a,ND b)

{

NM ma,mb;

if ( (!a && b)||(a&& !b)||(NV(a) != NV(b))||(SG(a) != SG(b)) ) return 0;

for ( ma = BDY(a), mb = BDY(b); ma && mb; ma = NEXT(ma), mb = NEXT(mb) ) {

if ( (TD(ma) != TD(mb)) || !ndl_equal(DL(ma),DL(mb)) ) return 0;

}

if ( !ma && !mb ) return 1;

else return 0;

}

NODE nd_reducebase(NODE x)

{

int len,i,j;

Line 3106 void nd_init_ord(struct order_spec *ord)

Line 2898 void nd_init_ord(struct order_spec *ord)

{

if ( ord->id )

error("nd_gr : unsupported order");

nd_degcompat = 0;

nd_dcomp = 0;

switch ( ord->ord.simple ) {

case 0:

nd_degcompat = 1;

nd_dcomp = 1;

nd_isrlex = 1;

break;

case 1:

nd_degcompat = 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>