![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to nd.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / engine|
Return to nd.c CVS log | Up to [local] / OpenXM_contrib2 / asir2000 / engine |
1.1 ! noro 1: #include "ca.h"
! 2: #include "inline.h"
! 3:
! 4: #if defined(__GNUC__)
! 5: #define INLINE inline
! 6: #elif defined(VISUAL)
! 7: #define INLINE __inline
! 8: #else
! 9: #define INLINE
! 10: #endif
! 11:
! 12: #define REDTAB_LEN 32003
! 13:
! 14: typedef struct oPGeoBucket {
! 15: int m;
! 16: struct oND *body[32];
! 17: } *PGeoBucket;
! 18:
! 19: typedef struct oND {
! 20: struct oNM *body;
! 21: int nv;
! 22: int sugar;
! 23: } *ND;
! 24:
! 25: typedef struct oNM {
! 26: struct oNM *next;
! 27: int td;
! 28: int c;
! 29: unsigned int dl[1];
! 30: } *NM;
! 31:
! 32: typedef struct oND_pairs {
! 33: struct oND_pairs *next;
! 34: int i1,i2;
! 35: int td,sugar;
! 36: unsigned int lcm[1];
! 37: } *ND_pairs;
! 38:
! 39: static ND *nd_ps;
! 40: static unsigned int **nd_bound;
! 41: int nd_mod,nd_nvar;
! 42: int is_rlex;
! 43: int nd_epw,nd_bpe,nd_wpd;
! 44: unsigned int nd_mask[32];
! 45: unsigned int nd_mask0,nd_mask1;
! 46: NM _nm_free_list;
! 47: ND _nd_free_list;
! 48: ND_pairs _ndp_free_list;
! 49: NM *nd_red;
! 50: int nd_red_len;
! 51:
! 52: extern int Top,Reverse;
! 53: int nd_psn,nd_pslen;
! 54: int nd_found,nd_create,nd_notfirst;
! 55:
! 56: void GC_gcollect();
! 57: NODE append_one(NODE,int);
! 58:
! 59: #define HTD(d) ((d)->body->td)
! 60: #define HDL(d) ((d)->body->dl)
! 61: #define HC(d) ((d)->body->c)
! 62:
! 63: #define NEWND_pairs(m) if(!_ndp_free_list)_NDP_alloc(); (m)=_ndp_free_list; _ndp_free_list = NEXT(_ndp_free_list)
! 64: #define NEWNM(m) if(!_nm_free_list)_NM_alloc(); (m)=_nm_free_list; _nm_free_list = NEXT(_nm_free_list)
! 65: #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)
! 66:
! 67: #define NEXTNM(r,c) \
! 68: if(!(r)){NEWNM(r);(c)=(r);}else{NEWNM(NEXT(c));(c)=NEXT(c);}
! 69: #define NEXTNM2(r,c,s) \
! 70: if(!(r)){(c)=(r)=(s);}else{NEXT(c)=(s);(c)=(s);}
! 71: #define FREENM(m) NEXT(m)=_nm_free_list; _nm_free_list=(m)
! 72: #define FREENDP(m) NEXT(m)=_ndp_free_list; _ndp_free_list=(m)
! 73: #define FREEND(m) BDY(m)=(NM)_nd_free_list; _nd_free_list=(m)
! 74:
! 75: #define NEXTND_pairs(r,c) \
! 76: if(!(r)){NEWND_pairs(r);(c)=(r);}else{NEWND_pairs(NEXT(c));(c)=NEXT(c);}
! 77:
! 78: ND_pairs crit_B( ND_pairs d, int s );
! 79: void nd_gr(LIST f,LIST v,int m,struct order_spec *ord,LIST *rp);
! 80: NODE nd_setup(NODE f);
! 81: int nd_newps(ND a);
! 82: ND_pairs nd_minp( ND_pairs d, ND_pairs *prest );
! 83: NODE update_base(NODE nd,int ndp);
! 84: static ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest );
! 85: int crit_2( int dp1, int dp2 );
! 86: ND_pairs crit_F( ND_pairs d1 );
! 87: ND_pairs crit_M( ND_pairs d1 );
! 88: ND_pairs nd_newpairs( NODE g, int t );
! 89: ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t);
! 90: NODE nd_gb(NODE f);
! 91: void nd_free_private_storage();
! 92: void _NM_alloc();
! 93: void _ND_alloc();
! 94: int ndl_td(unsigned int *d);
! 95: ND nd_add(ND p1,ND p2);
! 96: ND nd_mul_nm(ND p,NM m0);
! 97: ND nd_mul_term(ND p,int td,unsigned int *d);
! 98: int nd_sp(ND_pairs p,ND *nf);
! 99: int nd_find_reducer(ND g,ND *red);
! 100: int nd_nf(ND g,int full,ND *nf);
! 101: ND nd_reduce(ND p1,ND p2);
! 102: ND nd_reduce_special(ND p1,ND p2);
! 103: void nd_free(ND p);
! 104: void ndl_print(unsigned int *dl);
! 105: void nd_print(ND p);
! 106: void ndp_print(ND_pairs d);
! 107: int nd_length(ND p);
! 108: void nd_monic(ND p);
! 109: void nd_mul_c(ND p,int mul);
! 110: void nd_free_redlist();
! 111: void nd_append_red(unsigned int *d,int td,int i);
! 112: unsigned int *nd_compute_bound(ND p);
! 113: ND_pairs nd_reconstruct(ND_pairs);
! 114: void nd_setup_parameters();
! 115: ND nd_dup(ND p,int obpe);
! 116: void ndl_dup(int obpe,unsigned int *d,unsigned int *r);
! 117:
! 118: void nd_free_private_storage()
! 119: {
! 120: _nd_free_list = 0;
! 121: _nm_free_list = 0;
! 122: nd_red = 0;
! 123: GC_gcollect();
! 124: }
! 125:
! 126: void _NM_alloc()
! 127: {
! 128: NM p;
! 129: int i;
! 130:
! 131: for ( i = 0; i < 16; i++ ) {
! 132: p = (NM)GC_malloc(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int));
! 133: p->next = _nm_free_list; _nm_free_list = p;
! 134: }
! 135: }
! 136:
! 137: void _ND_alloc()
! 138: {
! 139: ND p;
! 140: int i;
! 141:
! 142: for ( i = 0; i < 1024; i++ ) {
! 143: p = (ND)GC_malloc(sizeof(struct oND));
! 144: p->body = (NM)_nd_free_list; _nd_free_list = p;
! 145: }
! 146: }
! 147:
! 148: void _NDP_alloc()
! 149: {
! 150: ND_pairs p;
! 151: int i;
! 152:
! 153: for ( i = 0; i < 10240; i++ ) {
! 154: p = (ND_pairs)GC_malloc(sizeof(struct oND_pairs)
! 155: +(nd_wpd-1)*sizeof(unsigned int));
! 156: p->next = _ndp_free_list; _ndp_free_list = p;
! 157: }
! 158: }
! 159:
! 160: INLINE nd_length(ND p)
! 161: {
! 162: NM m;
! 163: int i;
! 164:
! 165: if ( !p )
! 166: return 0;
! 167: else {
! 168: for ( i = 0, m = BDY(p); m; m = NEXT(m), i++ );
! 169: return i;
! 170: }
! 171: }
! 172:
! 173: INLINE int ndl_reducible(unsigned int *d1,unsigned int *d2)
! 174: {
! 175: unsigned int u1,u2;
! 176: int i,j;
! 177:
! 178: switch ( nd_bpe ) {
! 179: case 4:
! 180: for ( i = 0; i < nd_wpd; i++ ) {
! 181: u1 = d1[i]; u2 = d2[i];
! 182: if ( (u1&0xf0000000) < (u2&0xf0000000) ) return 0;
! 183: if ( (u1&0xf000000) < (u2&0xf000000) ) return 0;
! 184: if ( (u1&0xf00000) < (u2&0xf00000) ) return 0;
! 185: if ( (u1&0xf0000) < (u2&0xf0000) ) return 0;
! 186: if ( (u1&0xf000) < (u2&0xf000) ) return 0;
! 187: if ( (u1&0xf00) < (u2&0xf00) ) return 0;
! 188: if ( (u1&0xf0) < (u2&0xf0) ) return 0;
! 189: if ( (u1&0xf) < (u2&0xf) ) return 0;
! 190: }
! 191: return 1;
! 192: break;
! 193: case 6:
! 194: for ( i = 0; i < nd_wpd; i++ ) {
! 195: u1 = d1[i]; u2 = d2[i];
! 196: if ( (u1&0x3f000000) < (u2&0x3f000000) ) return 0;
! 197: if ( (u1&0xfc0000) < (u2&0xfc0000) ) return 0;
! 198: if ( (u1&0x3f000) < (u2&0x3f000) ) return 0;
! 199: if ( (u1&0xfc0) < (u2&0xfc0) ) return 0;
! 200: if ( (u1&0x3f) < (u2&0x3f) ) return 0;
! 201: }
! 202: return 1;
! 203: break;
! 204: case 8:
! 205: for ( i = 0; i < nd_wpd; i++ ) {
! 206: u1 = d1[i]; u2 = d2[i];
! 207: if ( (u1&0xff000000) < (u2&0xff000000) ) return 0;
! 208: if ( (u1&0xff0000) < (u2&0xff0000) ) return 0;
! 209: if ( (u1&0xff00) < (u2&0xff00) ) return 0;
! 210: if ( (u1&0xff) < (u2&0xff) ) return 0;
! 211: }
! 212: return 1;
! 213: break;
! 214: case 16:
! 215: for ( i = 0; i < nd_wpd; i++ ) {
! 216: u1 = d1[i]; u2 = d2[i];
! 217: if ( (u1&0xffff0000) < (u2&0xffff0000) ) return 0;
! 218: if ( (u1&0xffff) < (u2&0xffff) ) return 0;
! 219: }
! 220: return 1;
! 221: break;
! 222: case 32:
! 223: for ( i = 0; i < nd_wpd; i++ )
! 224: if ( d1[i] < d2[i] ) return 0;
! 225: return 1;
! 226: break;
! 227: default:
! 228: for ( i = 0; i < nd_wpd; i++ ) {
! 229: u1 = d1[i]; u2 = d2[i];
! 230: for ( j = 0; j < nd_epw; j++ )
! 231: if ( (u1&nd_mask[j]) < (u2&nd_mask[j]) ) return 0;
! 232: }
! 233: return 1;
! 234: }
! 235: }
! 236:
! 237: void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned int *d)
! 238: {
! 239: unsigned int t1,t2,u,u1,u2;
! 240: int i,j;
! 241:
! 242: switch ( nd_bpe ) {
! 243: case 4:
! 244: for ( i = 0; i < nd_wpd; i++ ) {
! 245: u1 = d1[i]; u2 = d2[i];
! 246: t1 = (u1&0xf0000000); t2 = (u2&0xf0000000); u = t1>t2?t1:t2;
! 247: t1 = (u1&0xf000000); t2 = (u2&0xf000000); u |= t1>t2?t1:t2;
! 248: t1 = (u1&0xf00000); t2 = (u2&0xf00000); u |= t1>t2?t1:t2;
! 249: t1 = (u1&0xf0000); t2 = (u2&0xf0000); u |= t1>t2?t1:t2;
! 250: t1 = (u1&0xf000); t2 = (u2&0xf000); u |= t1>t2?t1:t2;
! 251: t1 = (u1&0xf00); t2 = (u2&0xf00); u |= t1>t2?t1:t2;
! 252: t1 = (u1&0xf0); t2 = (u2&0xf0); u |= t1>t2?t1:t2;
! 253: t1 = (u1&0xf); t2 = (u2&0xf); u |= t1>t2?t1:t2;
! 254: d[i] = u;
! 255: }
! 256: break;
! 257: case 6:
! 258: for ( i = 0; i < nd_wpd; i++ ) {
! 259: u1 = d1[i]; u2 = d2[i];
! 260: t1 = (u1&0x3f000000); t2 = (u2&0x3f000000); u = t1>t2?t1:t2;
! 261: t1 = (u1&0xfc0000); t2 = (u2&0xfc0000); u |= t1>t2?t1:t2;
! 262: t1 = (u1&0x3f000); t2 = (u2&0x3f000); u |= t1>t2?t1:t2;
! 263: t1 = (u1&0xfc0); t2 = (u2&0xfc0); u |= t1>t2?t1:t2;
! 264: t1 = (u1&0x3f); t2 = (u2&0x3f); u |= t1>t2?t1:t2;
! 265: d[i] = u;
! 266: }
! 267: break;
! 268: case 8:
! 269: for ( i = 0; i < nd_wpd; i++ ) {
! 270: u1 = d1[i]; u2 = d2[i];
! 271: t1 = (u1&0xff000000); t2 = (u2&0xff000000); u = t1>t2?t1:t2;
! 272: t1 = (u1&0xff0000); t2 = (u2&0xff0000); u |= t1>t2?t1:t2;
! 273: t1 = (u1&0xff00); t2 = (u2&0xff00); u |= t1>t2?t1:t2;
! 274: t1 = (u1&0xff); t2 = (u2&0xff); u |= t1>t2?t1:t2;
! 275: d[i] = u;
! 276: }
! 277: break;
! 278: case 16:
! 279: for ( i = 0; i < nd_wpd; i++ ) {
! 280: u1 = d1[i]; u2 = d2[i];
! 281: t1 = (u1&0xffff0000); t2 = (u2&0xffff0000); u = t1>t2?t1:t2;
! 282: t1 = (u1&0xffff); t2 = (u2&0xffff); u |= t1>t2?t1:t2;
! 283: d[i] = u;
! 284: }
! 285: break;
! 286: case 32:
! 287: for ( i = 0; i < nd_wpd; i++ ) {
! 288: u1 = d1[i]; u2 = d2[i];
! 289: d[i] = u1>u2?u1:u2;
! 290: }
! 291: break;
! 292: default:
! 293: for ( i = 0; i < nd_wpd; i++ ) {
! 294: u1 = d1[i]; u2 = d2[i];
! 295: for ( j = 0, u = 0; j < nd_epw; j++ ) {
! 296: t1 = (u1&nd_mask[j]); t2 = (u2&nd_mask[j]); u |= t1>t2?t1:t2;
! 297: }
! 298: d[i] = u;
! 299: }
! 300: break;
! 301: }
! 302: }
! 303:
! 304: int ndl_td(unsigned int *d)
! 305: {
! 306: unsigned int t,u;
! 307: int i,j;
! 308:
! 309: for ( t = 0, i = 0; i < nd_wpd; i++ ) {
! 310: u = d[i];
! 311: for ( j = 0; j < nd_epw; j++, u>>=nd_bpe )
! 312: t += (u&nd_mask0);
! 313: }
! 314: return t;
! 315: }
! 316:
! 317: INLINE int ndl_compare(unsigned int *d1,unsigned int *d2)
! 318: {
! 319: int i;
! 320:
! 321: for ( i = 0; i < nd_wpd; i++, d1++, d2++ )
! 322: if ( *d1 > *d2 )
! 323: return is_rlex ? -1 : 1;
! 324: else if ( *d1 < *d2 )
! 325: return is_rlex ? 1 : -1;
! 326: return 0;
! 327: }
! 328:
! 329: INLINE int ndl_equal(unsigned int *d1,unsigned int *d2)
! 330: {
! 331: int i;
! 332:
! 333: for ( i = 0; i < nd_wpd; i++ )
! 334: if ( d1[i] != d2[i] )
! 335: return 0;
! 336: return 1;
! 337: }
! 338:
! 339: INLINE void ndl_add(unsigned int *d1,unsigned int *d2,unsigned int *d)
! 340: {
! 341: int i;
! 342:
! 343: for ( i = 0; i < nd_wpd; i++ ) {
! 344: d[i] = d1[i]+d2[i];
! 345: }
! 346: }
! 347:
! 348: void ndl_sub(unsigned int *d1,unsigned int *d2,unsigned int *d)
! 349: {
! 350: int i;
! 351:
! 352: for ( i = 0; i < nd_wpd; i++ )
! 353: d[i] = d1[i]-d2[i];
! 354: }
! 355:
! 356: int ndl_disjoint(unsigned int *d1,unsigned int *d2)
! 357: {
! 358: unsigned int t1,t2,u,u1,u2;
! 359: int i,j;
! 360:
! 361: switch ( nd_bpe ) {
! 362: case 4:
! 363: for ( i = 0; i < nd_wpd; i++ ) {
! 364: u1 = d1[i]; u2 = d2[i];
! 365: t1 = u1&0xf0000000; t2 = u2&0xf0000000; if ( t1&&t2 ) return 0;
! 366: t1 = u1&0xf000000; t2 = u2&0xf000000; if ( t1&&t2 ) return 0;
! 367: t1 = u1&0xf00000; t2 = u2&0xf00000; if ( t1&&t2 ) return 0;
! 368: t1 = u1&0xf0000; t2 = u2&0xf0000; if ( t1&&t2 ) return 0;
! 369: t1 = u1&0xf000; t2 = u2&0xf000; if ( t1&&t2 ) return 0;
! 370: t1 = u1&0xf00; t2 = u2&0xf00; if ( t1&&t2 ) return 0;
! 371: t1 = u1&0xf0; t2 = u2&0xf0; if ( t1&&t2 ) return 0;
! 372: t1 = u1&0xf; t2 = u2&0xf; if ( t1&&t2 ) return 0;
! 373: }
! 374: return 1;
! 375: break;
! 376: case 6:
! 377: for ( i = 0; i < nd_wpd; i++ ) {
! 378: u1 = d1[i]; u2 = d2[i];
! 379: t1 = u1&0x3f000000; t2 = u2&0x3f000000; if ( t1&&t2 ) return 0;
! 380: t1 = u1&0xfc0000; t2 = u2&0xfc0000; if ( t1&&t2 ) return 0;
! 381: t1 = u1&0x3f000; t2 = u2&0x3f000; if ( t1&&t2 ) return 0;
! 382: t1 = u1&0xfc0; t2 = u2&0xfc0; if ( t1&&t2 ) return 0;
! 383: t1 = u1&0x3f; t2 = u2&0x3f; if ( t1&&t2 ) return 0;
! 384: }
! 385: return 1;
! 386: break;
! 387: case 8:
! 388: for ( i = 0; i < nd_wpd; i++ ) {
! 389: u1 = d1[i]; u2 = d2[i];
! 390: t1 = u1&0xff000000; t2 = u2&0xff000000; if ( t1&&t2 ) return 0;
! 391: t1 = u1&0xff0000; t2 = u2&0xff0000; if ( t1&&t2 ) return 0;
! 392: t1 = u1&0xff00; t2 = u2&0xff00; if ( t1&&t2 ) return 0;
! 393: t1 = u1&0xff; t2 = u2&0xff; if ( t1&&t2 ) return 0;
! 394: }
! 395: return 1;
! 396: break;
! 397: case 16:
! 398: for ( i = 0; i < nd_wpd; i++ ) {
! 399: u1 = d1[i]; u2 = d2[i];
! 400: t1 = u1&0xffff0000; t2 = u2&0xffff0000; if ( t1&&t2 ) return 0;
! 401: t1 = u1&0xffff; t2 = u2&0xffff; if ( t1&&t2 ) return 0;
! 402: }
! 403: return 1;
! 404: break;
! 405: case 32:
! 406: for ( i = 0; i < nd_wpd; i++ )
! 407: if ( d1[i] && d2[i] ) return 0;
! 408: return 1;
! 409: break;
! 410: default:
! 411: for ( i = 0; i < nd_wpd; i++ ) {
! 412: u1 = d1[i]; u2 = d2[i];
! 413: for ( j = 0; j < nd_epw; j++ ) {
! 414: if ( (u1&nd_mask0) && (u2&nd_mask0) ) return 0;
! 415: u1 >>= nd_bpe; u2 >>= nd_bpe;
! 416: }
! 417: }
! 418: return 1;
! 419: break;
! 420: }
! 421: }
! 422:
! 423: ND nd_reduce(ND p1,ND p2)
! 424: {
! 425: int c,c1,c2,t,td,td2,mul;
! 426: NM m2,prev,head,cur,new;
! 427: unsigned int *d;
! 428:
! 429: if ( !p1 )
! 430: return 0;
! 431: else {
! 432: c2 = invm(HC(p2),nd_mod);
! 433: c1 = nd_mod-HC(p1);
! 434: DMAR(c1,c2,0,nd_mod,mul);
! 435: td = HTD(p1)-HTD(p2);
! 436: d = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int));
! 437: ndl_sub(HDL(p1),HDL(p2),d);
! 438: prev = 0; head = cur = BDY(p1);
! 439: NEWNM(new);
! 440: for ( m2 = BDY(p2); m2; ) {
! 441: td2 = new->td = m2->td+td;
! 442: ndl_add(m2->dl,d,new->dl);
! 443: if ( !cur ) {
! 444: c1 = C(m2);
! 445: DMAR(c1,mul,0,nd_mod,c2);
! 446: C(new) = c2;
! 447: if ( !prev ) {
! 448: prev = new;
! 449: NEXT(prev) = 0;
! 450: head = prev;
! 451: } else {
! 452: NEXT(prev) = new;
! 453: NEXT(new) = 0;
! 454: prev = new;
! 455: }
! 456: m2 = NEXT(m2);
! 457: NEWNM(new);
! 458: continue;
! 459: }
! 460: if ( cur->td > td2 )
! 461: c = 1;
! 462: else if ( cur->td < td2 )
! 463: c = -1;
! 464: else
! 465: c = ndl_compare(cur->dl,new->dl);
! 466: switch ( c ) {
! 467: case 0:
! 468: c2 = C(m2);
! 469: c1 = C(cur);
! 470: DMAR(c2,mul,c1,nd_mod,t);
! 471: if ( t )
! 472: C(cur) = t;
! 473: else if ( !prev ) {
! 474: head = NEXT(cur);
! 475: FREENM(cur);
! 476: cur = head;
! 477: } else {
! 478: NEXT(prev) = NEXT(cur);
! 479: FREENM(cur);
! 480: cur = NEXT(prev);
! 481: }
! 482: m2 = NEXT(m2);
! 483: break;
! 484: case 1:
! 485: prev = cur;
! 486: cur = NEXT(cur);
! 487: break;
! 488: case -1:
! 489: if ( !prev ) {
! 490: /* cur = head */
! 491: prev = new;
! 492: c2 = C(m2);
! 493: DMAR(c2,mul,0,nd_mod,c1);
! 494: C(prev) = c1;
! 495: NEXT(prev) = head;
! 496: head = prev;
! 497: } else {
! 498: c2 = C(m2);
! 499: DMAR(c2,mul,0,nd_mod,c1);
! 500: C(new) = c1;
! 501: NEXT(prev) = new;
! 502: NEXT(new) = cur;
! 503: prev = new;
! 504: }
! 505: NEWNM(new);
! 506: m2 = NEXT(m2);
! 507: break;
! 508: }
! 509: }
! 510: FREENM(new);
! 511: if ( head ) {
! 512: BDY(p1) = head;
! 513: p1->sugar = MAX(p1->sugar,p2->sugar+td);
! 514: return p1;
! 515: } else {
! 516: FREEND(p1);
! 517: return 0;
! 518: }
! 519:
! 520: }
! 521: }
! 522:
! 523: /* HDL(p1) = HDL(p2) */
! 524:
! 525: ND nd_reduce_special(ND p1,ND p2)
! 526: {
! 527: int c,c1,c2,t,td,td2,mul;
! 528: NM m2,prev,head,cur,new;
! 529:
! 530: if ( !p1 )
! 531: return 0;
! 532: else {
! 533: c2 = invm(HC(p2),nd_mod);
! 534: c1 = nd_mod-HC(p1);
! 535: DMAR(c1,c2,0,nd_mod,mul);
! 536: prev = 0; head = cur = BDY(p1);
! 537: NEWNM(new);
! 538: for ( m2 = BDY(p2); m2; ) {
! 539: td2 = new->td = m2->td;
! 540: if ( !cur ) {
! 541: c1 = C(m2);
! 542: DMAR(c1,mul,0,nd_mod,c2);
! 543: C(new) = c2;
! 544: bcopy(m2->dl,new->dl,nd_wpd*sizeof(unsigned int));
! 545: if ( !prev ) {
! 546: prev = new;
! 547: NEXT(prev) = 0;
! 548: head = prev;
! 549: } else {
! 550: NEXT(prev) = new;
! 551: NEXT(new) = 0;
! 552: prev = new;
! 553: }
! 554: m2 = NEXT(m2);
! 555: NEWNM(new);
! 556: continue;
! 557: }
! 558: if ( cur->td > td2 )
! 559: c = 1;
! 560: else if ( cur->td < td2 )
! 561: c = -1;
! 562: else
! 563: c = ndl_compare(cur->dl,m2->dl);
! 564: switch ( c ) {
! 565: case 0:
! 566: c2 = C(m2);
! 567: c1 = C(cur);
! 568: DMAR(c2,mul,c1,nd_mod,t);
! 569: if ( t )
! 570: C(cur) = t;
! 571: else if ( !prev ) {
! 572: head = NEXT(cur);
! 573: FREENM(cur);
! 574: cur = head;
! 575: } else {
! 576: NEXT(prev) = NEXT(cur);
! 577: FREENM(cur);
! 578: cur = NEXT(prev);
! 579: }
! 580: m2 = NEXT(m2);
! 581: break;
! 582: case 1:
! 583: prev = cur;
! 584: cur = NEXT(cur);
! 585: break;
! 586: case -1:
! 587: bcopy(m2->dl,new->dl,nd_wpd*sizeof(unsigned int));
! 588: if ( !prev ) {
! 589: /* cur = head */
! 590: prev = new;
! 591: c2 = C(m2);
! 592: DMAR(c2,mul,0,nd_mod,c1);
! 593: C(prev) = c1;
! 594: NEXT(prev) = head;
! 595: head = prev;
! 596: } else {
! 597: c2 = C(m2);
! 598: DMAR(c2,mul,0,nd_mod,c1);
! 599: C(new) = c1;
! 600: NEXT(prev) = new;
! 601: NEXT(new) = cur;
! 602: prev = new;
! 603: }
! 604: NEWNM(new);
! 605: m2 = NEXT(m2);
! 606: break;
! 607: }
! 608: }
! 609: FREENM(new);
! 610: if ( head ) {
! 611: BDY(p1) = head;
! 612: p1->sugar = MAX(p1->sugar,p2->sugar+td);
! 613: return p1;
! 614: } else {
! 615: FREEND(p1);
! 616: return 0;
! 617: }
! 618:
! 619: }
! 620: }
! 621:
! 622: INLINE int ndl_check_bound(unsigned int *d)
! 623: {
! 624: int i;
! 625:
! 626: for ( i = 0; i < nd_wpd; i++ )
! 627: if ( d[i] & nd_mask1 )
! 628: return 1;
! 629: return 0;
! 630: }
! 631:
! 632: int nd_sp(ND_pairs p,ND *rp)
! 633: {
! 634: NM m;
! 635: ND p1,p2,t1,t2;
! 636: unsigned int *lcm,*check;
! 637: int td;
! 638:
! 639: check = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int));
! 640: p1 = nd_ps[p->i1];
! 641: p2 = nd_ps[p->i2];
! 642: lcm = p->lcm;
! 643: td = p->td;
! 644: NEWNM(m);
! 645: C(m) = HC(p2); m->td = td-HTD(p1); ndl_sub(lcm,HDL(p1),m->dl); NEXT(m) = 0;
! 646: ndl_add(nd_bound[p->i1],m->dl,check);
! 647: if ( ndl_check_bound(check) )
! 648: return 0;
! 649: t1 = nd_mul_nm(p1,m);
! 650: C(m) = nd_mod-HC(p1); m->td = td-HTD(p2); ndl_sub(lcm,HDL(p2),m->dl);
! 651: ndl_add(nd_bound[p->i2],m->dl,check);
! 652: if ( ndl_check_bound(check) ) {
! 653: nd_free(t1);
! 654: return 0;
! 655: }
! 656: t2 = nd_mul_nm(p2,m);
! 657: FREENM(m);
! 658: *rp = nd_add(t1,t2);
! 659: return 1;
! 660: }
! 661:
! 662: int ndl_hash_value(int td,unsigned int *d)
! 663: {
! 664: int i;
! 665: int r;
! 666:
! 667: r = td;
! 668: for ( i = 0; i < nd_wpd; i++ )
! 669: r = ((r<<16)+d[i])%REDTAB_LEN;
! 670: return r;
! 671: }
! 672:
! 673: int nd_find_reducer(ND g, ND *rp)
! 674: {
! 675: NM m;
! 676: ND r,p;
! 677: int i,c1,c2,c;
! 678: int d,k,append,index;
! 679: unsigned int *check;
! 680: NM t;
! 681:
! 682: d = ndl_hash_value(HTD(g),HDL(g));
! 683: for ( m = nd_red[d], k = 0; m; m = NEXT(m), k++ ) {
! 684: if ( HTD(g) == m->td && ndl_equal(HDL(g),m->dl) ) {
! 685: if ( k > 0 ) nd_notfirst++;
! 686: index = m->c;
! 687: append = 0;
! 688: nd_found++;
! 689: goto found;
! 690: }
! 691: }
! 692:
! 693: for ( i = 0; i < nd_psn; i++ ) {
! 694: p = nd_ps[i];
! 695: if ( HTD(g) >= HTD(p) && ndl_reducible(HDL(g),HDL(p)) ) {
! 696: index = i;
! 697: append = 1;
! 698: nd_create++;
! 699: goto found;
! 700: }
! 701: }
! 702: return 0;
! 703:
! 704: found:
! 705: NEWNM(m);
! 706: p = nd_ps[index];
! 707: ndl_sub(HDL(g),HDL(p),m->dl);
! 708:
! 709: check = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int));
! 710: ndl_add(nd_bound[index],m->dl,check);
! 711: if ( ndl_check_bound(check) ) {
! 712: FREENM(m);
! 713: return -1;
! 714: }
! 715:
! 716: c1 = invm(HC(p),nd_mod);
! 717: c2 = nd_mod-HC(g);
! 718: DMAR(c1,c2,0,nd_mod,c);
! 719: C(m) = c;
! 720: m->td = HTD(g)-HTD(p);
! 721: NEXT(m) = 0;
! 722: *rp = r = nd_mul_nm(p,m);
! 723: FREENM(m);
! 724:
! 725: if ( append ) nd_append_red(HDL(g),HTD(g),i);
! 726: return 1;
! 727: }
! 728:
! 729: ND nd_find_monic_reducer(ND g)
! 730: {
! 731: int *d;
! 732: ND p,r;
! 733: int i;
! 734:
! 735: for ( i = 0; i < nd_psn; i++ ) {
! 736: p = nd_ps[i];
! 737: if ( HTD(g) >= HTD(p) && ndl_reducible(HDL(g),HDL(p)) ) {
! 738: d = (int *)ALLOCA(nd_wpd*sizeof(int));
! 739: ndl_sub(HDL(g),HDL(p),d);
! 740: r = nd_mul_term(p,HTD(g)-HTD(p),d);
! 741: return r;
! 742: }
! 743: }
! 744: return 0;
! 745: }
! 746:
! 747: ND nd_add(ND p1,ND p2)
! 748: {
! 749: int n,c;
! 750: int t;
! 751: ND r;
! 752: NM m1,m2,mr0,mr,s;
! 753:
! 754: if ( !p1 )
! 755: return p2;
! 756: else if ( !p2 )
! 757: return p1;
! 758: else {
! 759: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
! 760: if ( m1->td > m2->td )
! 761: c = 1;
! 762: else if ( m1->td < m2->td )
! 763: c = -1;
! 764: else
! 765: c = ndl_compare(m1->dl,m2->dl);
! 766: switch ( c ) {
! 767: case 0:
! 768: t = ((C(m1))+(C(m2))) - nd_mod;
! 769: if ( t < 0 )
! 770: t += nd_mod;
! 771: s = m1; m1 = NEXT(m1);
! 772: if ( t ) {
! 773: NEXTNM2(mr0,mr,s); C(mr) = (t);
! 774: } else {
! 775: FREENM(s);
! 776: }
! 777: s = m2; m2 = NEXT(m2); FREENM(s);
! 778: break;
! 779: case 1:
! 780: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
! 781: break;
! 782: case -1:
! 783: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
! 784: break;
! 785: }
! 786: }
! 787: if ( !mr0 )
! 788: if ( m1 )
! 789: mr0 = m1;
! 790: else if ( m2 )
! 791: mr0 = m2;
! 792: else
! 793: return 0;
! 794: else if ( m1 )
! 795: NEXT(mr) = m1;
! 796: else if ( m2 )
! 797: NEXT(mr) = m2;
! 798: else
! 799: NEXT(mr) = 0;
! 800: BDY(p1) = mr0;
! 801: p1->sugar = MAX(p1->sugar,p2->sugar);
! 802: FREEND(p2);
! 803: return p1;
! 804: }
! 805: }
! 806:
! 807: ND nd_mul_nm(ND p,NM m0)
! 808: {
! 809: NM m,mr,mr0;
! 810: unsigned int *d,*dt,*dm;
! 811: int c,n,td,i,c1,c2;
! 812: int *pt,*p1,*p2;
! 813: ND r;
! 814:
! 815: if ( !p )
! 816: return 0;
! 817: else {
! 818: n = NV(p); m = BDY(p);
! 819: d = m0->dl; td = m0->td; c = C(m0);
! 820: mr0 = 0;
! 821: for ( ; m; m = NEXT(m) ) {
! 822: NEXTNM(mr0,mr);
! 823: c1 = C(m);
! 824: DMAR(c1,c,0,nd_mod,c2);
! 825: C(mr) = c2;
! 826: mr->td = m->td+td;
! 827: ndl_add(m->dl,d,mr->dl);
! 828: }
! 829: NEXT(mr) = 0;
! 830: MKND(NV(p),mr0,r);
! 831: r->sugar = p->sugar + td;
! 832: return r;
! 833: }
! 834: }
! 835:
! 836: ND nd_mul_term(ND p,int td,unsigned int *d)
! 837: {
! 838: NM m,mr,mr0;
! 839: int c,n;
! 840: ND r;
! 841:
! 842: if ( !p )
! 843: return 0;
! 844: else {
! 845: n = NV(p); m = BDY(p);
! 846: for ( mr0 = 0; m; m = NEXT(m) ) {
! 847: NEXTNM(mr0,mr);
! 848: C(mr) = C(m);
! 849: mr->td = m->td+td;
! 850: ndl_add(m->dl,d,mr->dl);
! 851: }
! 852: NEXT(mr) = 0;
! 853: MKND(NV(p),mr0,r);
! 854: r->sugar = p->sugar + td;
! 855: return r;
! 856: }
! 857: }
! 858:
! 859: #if 1
! 860: /* ret=1 : success, ret=0 : overflow */
! 861: int nd_nf(ND g,int full,ND *rp)
! 862: {
! 863: ND p,d,red;
! 864: NM m,mrd,tail;
! 865: int n,sugar,psugar,stat;
! 866:
! 867: if ( !g ) {
! 868: *rp = 0;
! 869: return 1;
! 870: }
! 871: sugar = g->sugar;
! 872: n = NV(g);
! 873: for ( d = 0; g; ) {
! 874: /* stat=1 : found, stat=0 : not found, stat=-1 : overflow */
! 875: stat = nd_find_reducer(g,&red);
! 876: if ( stat == 1 ) {
! 877: #if 1
! 878: g = nd_add(g,red);
! 879: sugar = MAX(sugar,red->sugar);
! 880: #else
! 881: psugar = (HTD(g)-HTD(red))+red->sugar;
! 882: g = nd_reduce(g,red);
! 883: sugar = MAX(sugar,psugar);
! 884: #endif
! 885: } else if ( stat == -1 ) {
! 886: nd_free(g);
! 887: nd_free(d);
! 888: return 0;
! 889: } else if ( !full ) {
! 890: *rp = g;
! 891: return 1;
! 892: } else {
! 893: m = BDY(g);
! 894: if ( NEXT(m) ) {
! 895: BDY(g) = NEXT(m); NEXT(m) = 0;
! 896: } else {
! 897: FREEND(g); g = 0;
! 898: }
! 899: if ( d ) {
! 900: NEXT(tail)=m;
! 901: tail=m;
! 902: } else {
! 903: MKND(n,m,d);
! 904: tail = BDY(d);
! 905: }
! 906: }
! 907: }
! 908: if ( d )
! 909: d->sugar = sugar;
! 910: *rp = d;
! 911: return 1;
! 912: }
! 913: #else
! 914:
! 915: ND nd_remove_head(ND p)
! 916: {
! 917: NM m;
! 918:
! 919: m = BDY(p);
! 920: if ( !NEXT(m) ) {
! 921: FREEND(p);
! 922: p = 0;
! 923: } else
! 924: BDY(p) = NEXT(m);
! 925: FREENM(m);
! 926: return p;
! 927: }
! 928:
! 929: PGeoBucket create_pbucket()
! 930: {
! 931: PGeoBucket g;
! 932:
! 933: g = CALLOC(1,sizeof(struct oPGeoBucket));
! 934: g->m = -1;
! 935: return g;
! 936: }
! 937:
! 938: void add_pbucket(PGeoBucket g,ND d)
! 939: {
! 940: int l,k,m;
! 941:
! 942: l = nd_length(d);
! 943: for ( k = 0, m = 1; l > m; k++, m <<= 2 );
! 944: /* 4^(k-1) < l <= 4^k */
! 945: d = nd_add(g->body[k],d);
! 946: for ( ; d && nd_length(d) > 1<<(2*k); k++ ) {
! 947: g->body[k] = 0;
! 948: d = nd_add(g->body[k+1],d);
! 949: }
! 950: g->body[k] = d;
! 951: g->m = MAX(g->m,k);
! 952: }
! 953:
! 954: int head_pbucket(PGeoBucket g)
! 955: {
! 956: int j,i,c,k,nv,sum;
! 957: unsigned int *di,*dj;
! 958: ND gi,gj;
! 959:
! 960: k = g->m;
! 961: while ( 1 ) {
! 962: j = -1;
! 963: for ( i = 0; i <= k; i++ ) {
! 964: if ( !(gi = g->body[i]) )
! 965: continue;
! 966: if ( j < 0 ) {
! 967: j = i;
! 968: gj = g->body[j];
! 969: dj = HDL(gj);
! 970: sum = HC(gj);
! 971: } else {
! 972: di = HDL(gi);
! 973: nv = NV(gi);
! 974: if ( HTD(gi) > HTD(gj) )
! 975: c = 1;
! 976: else if ( HTD(gi) < HTD(gj) )
! 977: c = -1;
! 978: else
! 979: c = ndl_compare(di,dj);
! 980: if ( c > 0 ) {
! 981: if ( sum )
! 982: HC(gj) = sum;
! 983: else
! 984: g->body[j] = nd_remove_head(gj);
! 985: j = i;
! 986: gj = g->body[j];
! 987: dj = HDL(gj);
! 988: sum = HC(gj);
! 989: } else if ( c == 0 ) {
! 990: sum = sum+HC(gi)-nd_mod;
! 991: if ( sum < 0 )
! 992: sum += nd_mod;
! 993: g->body[i] = nd_remove_head(gi);
! 994: }
! 995: }
! 996: }
! 997: if ( j < 0 )
! 998: return -1;
! 999: else if ( sum ) {
! 1000: HC(gj) = sum;
! 1001: return j;
! 1002: } else
! 1003: g->body[j] = nd_remove_head(gj);
! 1004: }
! 1005: }
! 1006:
! 1007: ND normalize_pbucket(PGeoBucket g)
! 1008: {
! 1009: int i;
! 1010: ND r,t;
! 1011:
! 1012: r = 0;
! 1013: for ( i = 0; i <= g->m; i++ )
! 1014: r = nd_add(r,g->body[i]);
! 1015: return r;
! 1016: }
! 1017:
! 1018: ND nd_nf(ND g,int full)
! 1019: {
! 1020: ND u,p,d,red;
! 1021: NODE l;
! 1022: NM m,mrd;
! 1023: int sugar,psugar,n,h_reducible,h;
! 1024: PGeoBucket bucket;
! 1025:
! 1026: if ( !g ) {
! 1027: return 0;
! 1028: }
! 1029: sugar = g->sugar;
! 1030: n = g->nv;
! 1031: bucket = create_pbucket();
! 1032: add_pbucket(bucket,g);
! 1033: d = 0;
! 1034: while ( 1 ) {
! 1035: h = head_pbucket(bucket);
! 1036: if ( h < 0 ) {
! 1037: if ( d )
! 1038: d->sugar = sugar;
! 1039: return d;
! 1040: }
! 1041: g = bucket->body[h];
! 1042: red = nd_find_reducer(g);
! 1043: if ( red ) {
! 1044: bucket->body[h] = nd_remove_head(g);
! 1045: red = nd_remove_head(red);
! 1046: add_pbucket(bucket,red);
! 1047: sugar = MAX(sugar,red->sugar);
! 1048: } else if ( !full ) {
! 1049: g = normalize_pbucket(bucket);
! 1050: if ( g )
! 1051: g->sugar = sugar;
! 1052: return g;
! 1053: } else {
! 1054: m = BDY(g);
! 1055: if ( NEXT(m) ) {
! 1056: BDY(g) = NEXT(m); NEXT(m) = 0;
! 1057: } else {
! 1058: FREEND(g); g = 0;
! 1059: }
! 1060: bucket->body[h] = g;
! 1061: NEXT(m) = 0;
! 1062: if ( d ) {
! 1063: for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) );
! 1064: NEXT(mrd) = m;
! 1065: } else {
! 1066: MKND(n,m,d);
! 1067: }
! 1068: }
! 1069: }
! 1070: }
! 1071: #endif
! 1072:
! 1073: NODE nd_gb(NODE f)
! 1074: {
! 1075: int i,nh,sugar,stat;
! 1076: NODE r,g,gall;
! 1077: ND_pairs d;
! 1078: ND_pairs l;
! 1079: ND h,nf;
! 1080:
! 1081: for ( gall = g = 0, d = 0, r = f; r; r = NEXT(r) ) {
! 1082: i = (int)BDY(r);
! 1083: d = update_pairs(d,g,i);
! 1084: g = update_base(g,i);
! 1085: gall = append_one(gall,i);
! 1086: }
! 1087: sugar = 0;
! 1088: while ( d ) {
! 1089: again:
! 1090: l = nd_minp(d,&d);
! 1091: if ( l->sugar != sugar ) {
! 1092: sugar = l->sugar;
! 1093: fprintf(asir_out,"%d",sugar);
! 1094: }
! 1095: stat = nd_sp(l,&h);
! 1096: if ( !stat ) {
! 1097: NEXT(l) = d; d = l;
! 1098: d = nd_reconstruct(d);
! 1099: goto again;
! 1100: }
! 1101: stat = nd_nf(h,!Top,&nf);
! 1102: if ( !stat ) {
! 1103: NEXT(l) = d; d = l;
! 1104: d = nd_reconstruct(d);
! 1105: goto again;
! 1106: } else if ( nf ) {
! 1107: printf("+"); fflush(stdout);
! 1108: nh = nd_newps(nf);
! 1109: d = update_pairs(d,g,nh);
! 1110: g = update_base(g,nh);
! 1111: gall = append_one(gall,nh);
! 1112: FREENDP(l);
! 1113: } else {
! 1114: printf("."); fflush(stdout);
! 1115: FREENDP(l);
! 1116: }
! 1117: }
! 1118: return g;
! 1119: }
! 1120:
! 1121: ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t)
! 1122: {
! 1123: ND_pairs d1,nd,cur,head,prev,remove;
! 1124:
! 1125: if ( !g ) return d;
! 1126: d = crit_B(d,t);
! 1127: d1 = nd_newpairs(g,t);
! 1128: d1 = crit_M(d1);
! 1129: d1 = crit_F(d1);
! 1130: prev = 0; cur = head = d1;
! 1131: while ( cur ) {
! 1132: if ( crit_2( cur->i1,cur->i2 ) ) {
! 1133: remove = cur;
! 1134: if ( !prev ) {
! 1135: head = cur = NEXT(cur);
! 1136: } else {
! 1137: cur = NEXT(prev) = NEXT(cur);
! 1138: }
! 1139: FREENDP(remove);
! 1140: } else {
! 1141: prev = cur;
! 1142: cur = NEXT(cur);
! 1143: }
! 1144: }
! 1145: if ( !d )
! 1146: return head;
! 1147: else {
! 1148: nd = d;
! 1149: while ( NEXT(nd) )
! 1150: nd = NEXT(nd);
! 1151: NEXT(nd) = head;
! 1152: return d;
! 1153: }
! 1154: }
! 1155:
! 1156: ND_pairs nd_newpairs( NODE g, int t )
! 1157: {
! 1158: NODE h;
! 1159: unsigned int *dl;
! 1160: int td,ts,s;
! 1161: ND_pairs r,r0;
! 1162:
! 1163: dl = HDL(nd_ps[t]);
! 1164: td = HTD(nd_ps[t]);
! 1165: ts = nd_ps[t]->sugar - td;
! 1166: for ( r0 = 0, h = g; h; h = NEXT(h) ) {
! 1167: NEXTND_pairs(r0,r);
! 1168: r->i1 = (int)BDY(h);
! 1169: r->i2 = t;
! 1170: ndl_lcm(HDL(nd_ps[r->i1]),dl,r->lcm);
! 1171: r->td = ndl_td(r->lcm);
! 1172: s = nd_ps[r->i1]->sugar-HTD(nd_ps[r->i1]);
! 1173: r->sugar = MAX(s,ts) + r->td;
! 1174: }
! 1175: NEXT(r) = 0;
! 1176: return r0;
! 1177: }
! 1178:
! 1179: ND_pairs crit_B( ND_pairs d, int s )
! 1180: {
! 1181: ND_pairs cur,head,prev,remove;
! 1182: unsigned int *t,*tl,*lcm;
! 1183: int td,tdl;
! 1184:
! 1185: if ( !d ) return 0;
! 1186: t = HDL(nd_ps[s]);
! 1187: prev = 0;
! 1188: head = cur = d;
! 1189: lcm = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int));
! 1190: while ( cur ) {
! 1191: tl = cur->lcm;
! 1192: if ( ndl_reducible(tl,t)
! 1193: && (ndl_lcm(HDL(nd_ps[cur->i1]),t,lcm),!ndl_equal(lcm,tl))
! 1194: && (ndl_lcm(HDL(nd_ps[cur->i2]),t,lcm),!ndl_equal(lcm,tl)) ) {
! 1195: remove = cur;
! 1196: if ( !prev ) {
! 1197: head = cur = NEXT(cur);
! 1198: } else {
! 1199: cur = NEXT(prev) = NEXT(cur);
! 1200: }
! 1201: FREENDP(remove);
! 1202: } else {
! 1203: prev = cur;
! 1204: cur = NEXT(cur);
! 1205: }
! 1206: }
! 1207: return head;
! 1208: }
! 1209:
! 1210: ND_pairs crit_M( ND_pairs d1 )
! 1211: {
! 1212: ND_pairs e,d2,d3,dd,p;
! 1213: unsigned int *id,*jd;
! 1214: int itd,jtd;
! 1215:
! 1216: for ( dd = 0, e = d1; e; e = d3 ) {
! 1217: if ( !(d2 = NEXT(e)) ) {
! 1218: NEXT(e) = dd;
! 1219: return e;
! 1220: }
! 1221: id = e->lcm;
! 1222: itd = e->td;
! 1223: for ( d3 = 0; d2; d2 = p ) {
! 1224: p = NEXT(d2),
! 1225: jd = d2->lcm;
! 1226: jtd = d2->td;
! 1227: if ( jtd == itd )
! 1228: if ( id == jd );
! 1229: else if ( ndl_reducible(jd,id) ) continue;
! 1230: else if ( ndl_reducible(id,jd) ) goto delit;
! 1231: else ;
! 1232: else if ( jtd > itd )
! 1233: if ( ndl_reducible(jd,id) ) continue;
! 1234: else ;
! 1235: else if ( ndl_reducible(id,jd ) ) goto delit;
! 1236: NEXT(d2) = d3;
! 1237: d3 = d2;
! 1238: }
! 1239: NEXT(e) = dd;
! 1240: dd = e;
! 1241: continue;
! 1242: /**/
! 1243: delit: NEXT(d2) = d3;
! 1244: d3 = d2;
! 1245: for ( ; p; p = d2 ) {
! 1246: d2 = NEXT(p);
! 1247: NEXT(p) = d3;
! 1248: d3 = p;
! 1249: }
! 1250: FREENDP(e);
! 1251: }
! 1252: return dd;
! 1253: }
! 1254:
! 1255: ND_pairs crit_F( ND_pairs d1 )
! 1256: {
! 1257: ND_pairs rest, head,remove;
! 1258: ND_pairs last, p, r, w;
! 1259: int s;
! 1260:
! 1261: for ( head = last = 0, p = d1; NEXT(p); ) {
! 1262: r = w = equivalent_pairs(p,&rest);
! 1263: s = r->sugar;
! 1264: w = NEXT(w);
! 1265: while ( w ) {
! 1266: if ( crit_2(w->i1,w->i2) ) {
! 1267: r = w;
! 1268: w = NEXT(w);
! 1269: while ( w ) {
! 1270: remove = w;
! 1271: w = NEXT(w);
! 1272: FREENDP(remove);
! 1273: }
! 1274: break;
! 1275: } else if ( w->sugar < s ) {
! 1276: FREENDP(r);
! 1277: r = w;
! 1278: s = r->sugar;
! 1279: w = NEXT(w);
! 1280: } else {
! 1281: remove = w;
! 1282: w = NEXT(w);
! 1283: FREENDP(remove);
! 1284: }
! 1285: }
! 1286: if ( last ) NEXT(last) = r;
! 1287: else head = r;
! 1288: NEXT(last = r) = 0;
! 1289: p = rest;
! 1290: if ( !p ) return head;
! 1291: }
! 1292: if ( !last ) return p;
! 1293: NEXT(last) = p;
! 1294: return head;
! 1295: }
! 1296:
! 1297: int crit_2( int dp1, int dp2 )
! 1298: {
! 1299: return ndl_disjoint(HDL(nd_ps[dp1]),HDL(nd_ps[dp2]));
! 1300: }
! 1301:
! 1302: static ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest )
! 1303: {
! 1304: ND_pairs w,p,r,s;
! 1305: unsigned int *d;
! 1306: int td;
! 1307:
! 1308: w = d1;
! 1309: d = w->lcm;
! 1310: td = w->td;
! 1311: s = NEXT(w);
! 1312: NEXT(w) = 0;
! 1313: for ( r = 0; s; s = p ) {
! 1314: p = NEXT(s);
! 1315: if ( td == s->td && ndl_equal(d,s->lcm) ) {
! 1316: NEXT(s) = w;
! 1317: w = s;
! 1318: } else {
! 1319: NEXT(s) = r;
! 1320: r = s;
! 1321: }
! 1322: }
! 1323: *prest = r;
! 1324: return w;
! 1325: }
! 1326:
! 1327: NODE update_base(NODE nd,int ndp)
! 1328: {
! 1329: unsigned int *dl, *dln;
! 1330: NODE last, p, head;
! 1331: int td,tdn;
! 1332:
! 1333: dl = HDL(nd_ps[ndp]);
! 1334: td = HTD(nd_ps[ndp]);
! 1335: for ( head = last = 0, p = nd; p; ) {
! 1336: dln = HDL(nd_ps[(int)BDY(p)]);
! 1337: tdn = HTD(nd_ps[(int)BDY(p)]);
! 1338: if ( tdn >= td && ndl_reducible( dln, dl ) ) {
! 1339: p = NEXT(p);
! 1340: if ( last ) NEXT(last) = p;
! 1341: } else {
! 1342: if ( !last ) head = p;
! 1343: p = NEXT(last = p);
! 1344: }
! 1345: }
! 1346: head = append_one(head,ndp);
! 1347: return head;
! 1348: }
! 1349:
! 1350: ND_pairs nd_minp( ND_pairs d, ND_pairs *prest )
! 1351: {
! 1352: ND_pairs m,ml,p,l;
! 1353: unsigned int *lcm;
! 1354: int s,td,len,tlen,c;
! 1355:
! 1356: if ( !(p = NEXT(m = d)) ) {
! 1357: *prest = p;
! 1358: NEXT(m) = 0;
! 1359: return m;
! 1360: }
! 1361: lcm = m->lcm;
! 1362: s = m->sugar;
! 1363: td = m->td;
! 1364: len = nd_length(nd_ps[m->i1])+nd_length(nd_ps[m->i2]);
! 1365: for ( ml = 0, l = m; p; p = NEXT(l = p) ) {
! 1366: if (p->sugar < s)
! 1367: goto find;
! 1368: else if ( p->sugar == s ) {
! 1369: if ( p->td < td )
! 1370: goto find;
! 1371: else if ( p->td == td ) {
! 1372: c = ndl_compare(p->lcm,lcm);
! 1373: if ( c < 0 )
! 1374: goto find;
! 1375: else if ( c == 0 ) {
! 1376: tlen = nd_length(nd_ps[p->i1])+nd_length(nd_ps[p->i2]);
! 1377: if ( tlen < len )
! 1378: goto find;
! 1379: }
! 1380: }
! 1381: }
! 1382: continue;
! 1383: find:
! 1384: ml = l;
! 1385: m = p;
! 1386: lcm = m->lcm;
! 1387: s = m->sugar;
! 1388: td = m->td;
! 1389: len = tlen;
! 1390: }
! 1391: if ( !ml ) *prest = NEXT(m);
! 1392: else {
! 1393: NEXT(ml) = NEXT(m);
! 1394: *prest = d;
! 1395: }
! 1396: NEXT(m) = 0;
! 1397: return m;
! 1398: }
! 1399:
! 1400: int nd_newps(ND a)
! 1401: {
! 1402: if ( nd_psn == nd_pslen ) {
! 1403: nd_pslen *= 2;
! 1404: nd_ps = (ND *)REALLOC((char *)nd_ps,nd_pslen*sizeof(ND));
! 1405: nd_bound = (unsigned int **)
! 1406: REALLOC((char *)nd_bound,nd_pslen*sizeof(unsigned int *));
! 1407: }
! 1408: nd_monic(a);
! 1409: nd_ps[nd_psn] = a;
! 1410: nd_bound[nd_psn] = nd_compute_bound(a);
! 1411: return nd_psn++;
! 1412: }
! 1413:
! 1414: NODE NODE_sortb(NODE f,int);
! 1415: ND dptond(DP);
! 1416: DP ndtodp(ND);
! 1417:
! 1418: NODE nd_setup(NODE f)
! 1419: {
! 1420: int i,td;
! 1421: NODE s,s0,f0;
! 1422:
! 1423: nd_found = 0;
! 1424: nd_notfirst = 0;
! 1425: nd_create = 0;
! 1426: #if 0
! 1427: f0 = f = NODE_sortb(f,1);
! 1428: #endif
! 1429: nd_psn = length(f); nd_pslen = 2*nd_psn;
! 1430: nd_ps = (ND *)MALLOC(nd_pslen*sizeof(ND));
! 1431: nd_bound = (unsigned int **)MALLOC(nd_pslen*sizeof(unsigned int *));
! 1432: nd_bpe = 4;
! 1433: nd_setup_parameters();
! 1434: nd_free_private_storage();
! 1435: for ( i = 0; i < nd_psn; i++, f = NEXT(f) ) {
! 1436: nd_ps[i] = dptond((DP)BDY(f));
! 1437: nd_monic(nd_ps[i]);
! 1438: nd_bound[i] = nd_compute_bound(nd_ps[i]);
! 1439: }
! 1440: nd_red = (NM *)MALLOC(REDTAB_LEN*sizeof(NM));
! 1441: for ( s0 = 0, i = 0; i < nd_psn; i++ ) {
! 1442: NEXTNODE(s0,s); BDY(s) = (pointer)i;
! 1443: }
! 1444: if ( s0 ) NEXT(s) = 0;
! 1445: return s0;
! 1446: }
! 1447:
! 1448: void nd_gr(LIST f,LIST v,int m,struct order_spec *ord,LIST *rp)
! 1449: {
! 1450: struct order_spec ord1;
! 1451: VL fv,vv,vc;
! 1452: NODE fd,fd0,r,r0,t,x,s,xx;
! 1453: DP a,b,c;
! 1454:
! 1455: get_vars((Obj)f,&fv); pltovl(v,&vv);
! 1456: nd_nvar = length(vv);
! 1457: if ( ord->id )
! 1458: error("nd_gr : unsupported order");
! 1459: switch ( ord->ord.simple ) {
! 1460: case 0:
! 1461: is_rlex = 1;
! 1462: break;
! 1463: case 1:
! 1464: is_rlex = 0;
! 1465: break;
! 1466: default:
! 1467: error("nd_gr : unsupported order");
! 1468: }
! 1469: initd(ord);
! 1470: nd_mod = m;
! 1471: for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
! 1472: ptod(CO,vv,(P)BDY(t),&b);
! 1473: _dp_mod(b,m,0,&c);
! 1474: if ( c ) {
! 1475: NEXTNODE(fd0,fd); BDY(fd) = (pointer)c;
! 1476: }
! 1477: }
! 1478: if ( fd0 ) NEXT(fd) = 0;
! 1479: s = nd_setup(fd0);
! 1480: x = nd_gb(s);
! 1481: #if 0
! 1482: x = nd_reduceall(x,m);
! 1483: #endif
! 1484: for ( r0 = 0; x; x = NEXT(x) ) {
! 1485: NEXTNODE(r0,r);
! 1486: a = ndtodp(nd_ps[(int)BDY(x)]);
! 1487: _dtop_mod(CO,vv,a,(P *)&BDY(r));
! 1488: }
! 1489: if ( r0 ) NEXT(r) = 0;
! 1490: MKLIST(*rp,r0);
! 1491: fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n",
! 1492: nd_found,nd_notfirst,nd_create);
! 1493: }
! 1494:
! 1495: void dltondl(int n,DL dl,unsigned int *r)
! 1496: {
! 1497: unsigned int *d;
! 1498: int i;
! 1499:
! 1500: d = dl->d;
! 1501: bzero(r,nd_wpd*sizeof(unsigned int));
! 1502: if ( is_rlex )
! 1503: for ( i = 0; i < n; i++ )
! 1504: r[(n-1-i)/nd_epw] |= (d[i]<<((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe));
! 1505: else
! 1506: for ( i = 0; i < n; i++ )
! 1507: r[i/nd_epw] |= d[i]<<((nd_epw-(i%nd_epw)-1)*nd_bpe);
! 1508: }
! 1509:
! 1510: DL ndltodl(int n,int td,unsigned int *ndl)
! 1511: {
! 1512: DL dl;
! 1513: int *d;
! 1514: int i;
! 1515:
! 1516: NEWDL(dl,n);
! 1517: dl->td = td;
! 1518: d = dl->d;
! 1519: if ( is_rlex )
! 1520: for ( i = 0; i < n; i++ )
! 1521: d[i] = (ndl[(n-1-i)/nd_epw]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe))
! 1522: &((1<<nd_bpe)-1);
! 1523: else
! 1524: for ( i = 0; i < n; i++ )
! 1525: d[i] = (ndl[i/nd_epw]>>((nd_epw-(i%nd_epw)-1)*nd_bpe))
! 1526: &((1<<nd_bpe)-1);
! 1527: return dl;
! 1528: }
! 1529:
! 1530: ND dptond(DP p)
! 1531: {
! 1532: ND d;
! 1533: NM m0,m;
! 1534: MP t;
! 1535: int n;
! 1536:
! 1537: if ( !p )
! 1538: return 0;
! 1539: n = NV(p);
! 1540: m0 = 0;
! 1541: for ( t = BDY(p); t; t = NEXT(t) ) {
! 1542: NEXTNM(m0,m);
! 1543: m->c = ITOS(t->c);
! 1544: m->td = t->dl->td;
! 1545: dltondl(n,t->dl,m->dl);
! 1546: }
! 1547: NEXT(m) = 0;
! 1548: MKND(n,m0,d);
! 1549: d->nv = n;
! 1550: d->sugar = p->sugar;
! 1551: return d;
! 1552: }
! 1553:
! 1554: DP ndtodp(ND p)
! 1555: {
! 1556: DP d;
! 1557: MP m0,m;
! 1558: NM t;
! 1559: int n;
! 1560:
! 1561: if ( !p )
! 1562: return 0;
! 1563: n = NV(p);
! 1564: m0 = 0;
! 1565: for ( t = BDY(p); t; t = NEXT(t) ) {
! 1566: NEXTMP(m0,m);
! 1567: m->c = STOI(t->c);
! 1568: m->dl = ndltodl(n,t->td,t->dl);
! 1569: }
! 1570: NEXT(m) = 0;
! 1571: MKDP(n,m0,d);
! 1572: d->sugar = p->sugar;
! 1573: return d;
! 1574: }
! 1575:
! 1576: void ndl_print(unsigned int *dl)
! 1577: {
! 1578: int n;
! 1579: int i;
! 1580:
! 1581: n = nd_nvar;
! 1582: printf("<<");
! 1583: if ( is_rlex )
! 1584: for ( i = 0; i < n; i++ )
! 1585: printf(i==n-1?"%d":"%d,",
! 1586: (dl[(n-1-i)/nd_epw]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe))
! 1587: &((1<<nd_bpe)-1));
! 1588: else
! 1589: for ( i = 0; i < n; i++ )
! 1590: printf(i==n-1?"%d":"%d,",
! 1591: (dl[i/nd_epw]>>((nd_epw-(i%nd_epw)-1)*nd_bpe))
! 1592: &((1<<nd_bpe)-1));
! 1593: printf(">>");
! 1594: }
! 1595:
! 1596: void nd_print(ND p)
! 1597: {
! 1598: NM m;
! 1599:
! 1600: if ( !p )
! 1601: printf("0\n");
! 1602: else {
! 1603: for ( m = BDY(p); m; m = NEXT(m) ) {
! 1604: printf("+%d*",m->c);
! 1605: ndl_print(m->dl);
! 1606: }
! 1607: printf("\n");
! 1608: }
! 1609: }
! 1610:
! 1611: void ndp_print(ND_pairs d)
! 1612: {
! 1613: ND_pairs t;
! 1614:
! 1615: for ( t = d; t; t = NEXT(t) ) {
! 1616: printf("%d,%d ",t->i1,t->i2);
! 1617: }
! 1618: printf("\n");
! 1619: }
! 1620:
! 1621: void nd_monic(ND p)
! 1622: {
! 1623: if ( !p )
! 1624: return;
! 1625: else
! 1626: nd_mul_c(p,invm(HC(p),nd_mod));
! 1627: }
! 1628:
! 1629: void nd_mul_c(ND p,int mul)
! 1630: {
! 1631: NM m;
! 1632: int c,c1;
! 1633:
! 1634: if ( !p )
! 1635: return;
! 1636: for ( m = BDY(p); m; m = NEXT(m) ) {
! 1637: c1 = C(m);
! 1638: DMAR(c1,mul,0,nd_mod,c);
! 1639: C(m) = c;
! 1640: }
! 1641: }
! 1642:
! 1643: void nd_free(ND p)
! 1644: {
! 1645: NM t,s;
! 1646:
! 1647: if ( !p )
! 1648: return;
! 1649: t = BDY(p);
! 1650: while ( t ) {
! 1651: s = NEXT(t);
! 1652: FREENM(t);
! 1653: t = s;
! 1654: }
! 1655: FREEND(p);
! 1656: }
! 1657:
! 1658: void nd_append_red(unsigned int *d,int td,int i)
! 1659: {
! 1660: NM m,m0;
! 1661: int h;
! 1662:
! 1663: NEWNM(m);
! 1664: h = ndl_hash_value(td,d);
! 1665: m->c = i;
! 1666: m->td = td;
! 1667: bcopy(d,m->dl,nd_wpd*sizeof(unsigned int));
! 1668: NEXT(m) = nd_red[h];
! 1669: nd_red[h] = m;
! 1670: }
! 1671:
! 1672: unsigned int *nd_compute_bound(ND p)
! 1673: {
! 1674: unsigned int *d1,*d2,*t;
! 1675: NM m;
! 1676:
! 1677: if ( !p )
! 1678: return 0;
! 1679: d1 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int));
! 1680: d2 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int));
! 1681: bcopy(HDL(p),d1,nd_wpd*sizeof(unsigned int));
! 1682: for ( m = NEXT(BDY(p)); m; m = NEXT(m) ) {
! 1683: ndl_lcm(m->dl,d1,d2);
! 1684: t = d1; d1 = d2; d2 = t;
! 1685: }
! 1686: t = (unsigned int *)MALLOC_ATOMIC(nd_wpd*sizeof(unsigned int));
! 1687: bcopy(d1,t,nd_wpd*sizeof(unsigned int));
! 1688: return t;
! 1689: }
! 1690:
! 1691: void nd_setup_parameters() {
! 1692: int i;
! 1693:
! 1694: nd_epw = (sizeof(unsigned int)*8)/nd_bpe;
! 1695: nd_wpd = nd_nvar/nd_epw+(nd_nvar%nd_epw?1:0);
! 1696: if ( nd_bpe < 32 ) {
! 1697: nd_mask0 = (1<<nd_bpe)-1;
! 1698: } else {
! 1699: nd_mask0 = 0xffffffff;
! 1700: }
! 1701: bzero(nd_mask,sizeof(nd_mask));
! 1702: nd_mask1 = 0;
! 1703: for ( i = 0; i < nd_epw; i++ ) {
! 1704: nd_mask[nd_epw-i-1] = (nd_mask0<<(i*nd_bpe));
! 1705: nd_mask1 |= (1<<(nd_bpe-1))<<(i*nd_bpe);
! 1706: }
! 1707: }
! 1708:
! 1709: ND_pairs nd_reconstruct(ND_pairs d)
! 1710: {
! 1711: int i,obpe;
! 1712: NM prev_nm_free_list;
! 1713: ND_pairs s0,s,t,prev_ndp_free_list;
! 1714:
! 1715: obpe = nd_bpe;
! 1716: switch ( nd_bpe ) {
! 1717: case 4: nd_bpe = 6; break;
! 1718: case 6: nd_bpe = 8; break;
! 1719: case 8: nd_bpe = 16; break;
! 1720: case 16: nd_bpe = 32; break;
! 1721: }
! 1722: nd_setup_parameters();
! 1723: prev_nm_free_list = _nm_free_list;
! 1724: prev_ndp_free_list = _ndp_free_list;
! 1725: _nm_free_list = 0;
! 1726: _ndp_free_list = 0;
! 1727: for ( i = 0; i < nd_psn; i++ ) {
! 1728: nd_ps[i] = nd_dup(nd_ps[i],obpe);
! 1729: nd_bound[i] = nd_compute_bound(nd_ps[i]);
! 1730: }
! 1731: s0 = 0;
! 1732: for ( t = d; t; t = NEXT(t) ) {
! 1733: NEXTND_pairs(s0,s);
! 1734: s->i1 = t->i1;
! 1735: s->i2 = t->i2;
! 1736: s->td = t->td;
! 1737: s->sugar = t->sugar;
! 1738: ndl_dup(obpe,t->lcm,s->lcm);
! 1739: }
! 1740: if ( s0 ) NEXT(s) = 0;
! 1741: prev_nm_free_list = 0;
! 1742: prev_ndp_free_list = 0;
! 1743: GC_gcollect();
! 1744: return s0;
! 1745: }
! 1746:
! 1747: void ndl_dup(int obpe,unsigned int *d,unsigned int *r)
! 1748: {
! 1749: int n,i,ei,oepw,cepw,cbpe;
! 1750:
! 1751: n = nd_nvar;
! 1752: oepw = (sizeof(unsigned int)*8)/obpe;
! 1753: cepw = nd_epw;
! 1754: cbpe = nd_bpe;
! 1755: if ( is_rlex )
! 1756: for ( i = 0; i < n; i++ ) {
! 1757: ei = (d[(n-1-i)/oepw]>>((oepw-((n-1-i)%oepw)-1)*obpe))
! 1758: &((1<<obpe)-1);
! 1759: r[(n-1-i)/cepw] |= (ei<<((cepw-((n-1-i)%cepw)-1)*cbpe));
! 1760: }
! 1761: else
! 1762: for ( i = 0; i < n; i++ ) {
! 1763: ei = (d[i/oepw]>>((oepw-(i%oepw)-1)*obpe))
! 1764: &((1<<obpe)-1);
! 1765: r[i/cepw] |= (ei<<((cepw-(i%cepw)-1)*cbpe));
! 1766: }
! 1767: }
! 1768:
! 1769: ND nd_dup(ND p,int obpe)
! 1770: {
! 1771: NM m,mr,mr0;
! 1772: int c,n;
! 1773: ND r;
! 1774:
! 1775: if ( !p )
! 1776: return 0;
! 1777: else {
! 1778: n = NV(p); m = BDY(p);
! 1779: for ( mr0 = 0; m; m = NEXT(m) ) {
! 1780: NEXTNM(mr0,mr);
! 1781: C(mr) = C(m);
! 1782: mr->td = m->td;
! 1783: ndl_dup(obpe,m->dl,mr->dl);
! 1784: }
! 1785: NEXT(mr) = 0;
! 1786: MKND(NV(p),mr0,r);
! 1787: r->sugar = p->sugar;
! 1788: return r;
! 1789: }
! 1790: }