![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to dist.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 dist.c CVS log | Up to [local] / OpenXM_contrib2 / asir2000 / engine |
1.8 noro 1: /*
2: * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
3: * All rights reserved.
4: *
5: * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
6: * non-exclusive and royalty-free license to use, copy, modify and
7: * redistribute, solely for non-commercial and non-profit purposes, the
8: * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
9: * conditions of this Agreement. For the avoidance of doubt, you acquire
10: * only a limited right to use the SOFTWARE hereunder, and FLL or any
11: * third party developer retains all rights, including but not limited to
12: * copyrights, in and to the SOFTWARE.
13: *
14: * (1) FLL does not grant you a license in any way for commercial
15: * purposes. You may use the SOFTWARE only for non-commercial and
16: * non-profit purposes only, such as academic, research and internal
17: * business use.
18: * (2) The SOFTWARE is protected by the Copyright Law of Japan and
19: * international copyright treaties. If you make copies of the SOFTWARE,
20: * with or without modification, as permitted hereunder, you shall affix
21: * to all such copies of the SOFTWARE the above copyright notice.
22: * (3) An explicit reference to this SOFTWARE and its copyright owner
23: * shall be made on your publication or presentation in any form of the
24: * results obtained by use of the SOFTWARE.
25: * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
1.9 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.8 noro 27: * for such modification or the source code of the modified part of the
28: * SOFTWARE.
29: *
30: * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
31: * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
32: * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
33: * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
34: * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
35: * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
36: * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
37: * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
38: * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
39: * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
40: * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
41: * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
42: * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
43: * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
44: * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
45: * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
46: * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
47: *
1.25 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/engine/dist.c,v 1.24 2003/06/19 07:08:19 noro Exp $
1.8 noro 49: */
1.1 noro 50: #include "ca.h"
51:
52: #define ORD_REVGRADLEX 0
53: #define ORD_GRADLEX 1
54: #define ORD_LEX 2
55: #define ORD_BREVGRADLEX 3
56: #define ORD_BGRADLEX 4
57: #define ORD_BLEX 5
58: #define ORD_BREVREV 6
59: #define ORD_BGRADREV 7
60: #define ORD_BLEXREV 8
61: #define ORD_ELIM 9
1.12 noro 62: #define ORD_WEYL_ELIM 10
1.13 noro 63: #define ORD_HOMO_WW_DRL 11
1.21 noro 64: #define ORD_DRL_ZIGZAG 12
65: #define ORD_HOMO_WW_DRL_ZIGZAG 13
66:
67: int cmpdl_drl_zigzag(), cmpdl_homo_ww_drl_zigzag();
1.1 noro 68:
69: int (*cmpdl)()=cmpdl_revgradlex;
70: int (*primitive_cmpdl[3])() = {cmpdl_revgradlex,cmpdl_gradlex,cmpdl_lex};
71:
1.2 noro 72: int do_weyl;
73:
1.1 noro 74: int dp_nelim,dp_fcoeffs;
75: struct order_spec dp_current_spec;
76: int *dp_dl_work;
77:
1.24 noro 78: void comm_muld_trunc(VL vl,DP p1,DP p2,DL dl,DP *pr);
79: void comm_quod(VL vl,DP p1,DP p2,DP *pr);
80: void muldm_trunc(VL vl,DP p,MP m0,DL dl,DP *pr);
81: void muldc_trunc(VL vl,DP p,P c,DL dl,DP *pr);
82:
1.22 noro 83: int has_sfcoef(DP f)
1.1 noro 84: {
85: MP t;
86:
87: if ( !f )
88: return 0;
89: for ( t = BDY(f); t; t = NEXT(t) )
1.22 noro 90: if ( has_sfcoef_p(t->c) )
1.1 noro 91: break;
92: return t ? 1 : 0;
93: }
94:
1.22 noro 95: int has_sfcoef_p(P f)
1.1 noro 96: {
97: DCP dc;
98:
99: if ( !f )
100: return 0;
101: else if ( NUM(f) )
1.22 noro 102: return (NID((Num)f) == N_GFS) ? 1 : 0;
1.1 noro 103: else {
104: for ( dc = DC(f); dc; dc = NEXT(dc) )
1.22 noro 105: if ( has_sfcoef_p(COEF(dc)) )
1.1 noro 106: return 1;
107: return 0;
108: }
109: }
110:
1.19 noro 111: void initd(struct order_spec *spec)
1.1 noro 112: {
113: switch ( spec->id ) {
114: case 2:
115: cmpdl = cmpdl_matrix;
116: dp_dl_work = (int *)MALLOC_ATOMIC(spec->nv*sizeof(int));
117: break;
118: case 1:
119: cmpdl = cmpdl_order_pair;
120: break;
121: default:
122: switch ( spec->ord.simple ) {
123: case ORD_REVGRADLEX:
124: cmpdl = cmpdl_revgradlex; break;
125: case ORD_GRADLEX:
126: cmpdl = cmpdl_gradlex; break;
127: case ORD_BREVGRADLEX:
128: cmpdl = cmpdl_brevgradlex; break;
129: case ORD_BGRADLEX:
130: cmpdl = cmpdl_bgradlex; break;
131: case ORD_BLEX:
132: cmpdl = cmpdl_blex; break;
133: case ORD_BREVREV:
134: cmpdl = cmpdl_brevrev; break;
135: case ORD_BGRADREV:
136: cmpdl = cmpdl_bgradrev; break;
137: case ORD_BLEXREV:
138: cmpdl = cmpdl_blexrev; break;
139: case ORD_ELIM:
140: cmpdl = cmpdl_elim; break;
1.12 noro 141: case ORD_WEYL_ELIM:
142: cmpdl = cmpdl_weyl_elim; break;
1.13 noro 143: case ORD_HOMO_WW_DRL:
144: cmpdl = cmpdl_homo_ww_drl; break;
1.21 noro 145: case ORD_DRL_ZIGZAG:
146: cmpdl = cmpdl_drl_zigzag; break;
147: case ORD_HOMO_WW_DRL_ZIGZAG:
148: cmpdl = cmpdl_homo_ww_drl_zigzag; break;
1.1 noro 149: case ORD_LEX: default:
150: cmpdl = cmpdl_lex; break;
151: }
152: break;
153: }
154: dp_current_spec = *spec;
155: }
156:
1.19 noro 157: void ptod(VL vl,VL dvl,P p,DP *pr)
1.1 noro 158: {
159: int isconst = 0;
1.16 noro 160: int n,i,j,k;
1.1 noro 161: VL tvl;
162: V v;
163: DL d;
164: MP m;
165: DCP dc;
1.16 noro 166: DCP *w;
1.1 noro 167: DP r,s,t,u;
168: P x,c;
169:
170: if ( !p )
171: *pr = 0;
172: else {
173: for ( n = 0, tvl = dvl; tvl; tvl = NEXT(tvl), n++ );
174: if ( NUM(p) ) {
175: NEWDL(d,n);
176: NEWMP(m); m->dl = d; C(m) = p; NEXT(m) = 0; MKDP(n,m,*pr); (*pr)->sugar = 0;
177: } else {
178: for ( i = 0, tvl = dvl, v = VR(p);
179: tvl && tvl->v != v; tvl = NEXT(tvl), i++ );
180: if ( !tvl ) {
1.16 noro 181: for ( dc = DC(p), k = 0; dc; dc = NEXT(dc), k++ );
182: w = (DCP *)ALLOCA(k*sizeof(DCP));
183: for ( dc = DC(p), j = 0; j < k; dc = NEXT(dc), j++ )
184: w[j] = dc;
185:
186: for ( j = k-1, s = 0, MKV(v,x); j >= 0; j-- ) {
187: ptod(vl,dvl,COEF(w[j]),&t); pwrp(vl,x,DEG(w[j]),&c);
1.1 noro 188: muldc(vl,t,c,&r); addd(vl,r,s,&t); s = t;
189: }
190: *pr = s;
191: } else {
1.16 noro 192: for ( dc = DC(p), k = 0; dc; dc = NEXT(dc), k++ );
193: w = (DCP *)ALLOCA(k*sizeof(DCP));
194: for ( dc = DC(p), j = 0; j < k; dc = NEXT(dc), j++ )
195: w[j] = dc;
196:
197: for ( j = k-1, s = 0; j >= 0; j-- ) {
198: ptod(vl,dvl,COEF(w[j]),&t);
1.20 noro 199: NEWDL(d,n); d->d[i] = QTOS(DEG(w[j]));
200: d->td = MUL_WEIGHT(d->d[i],i);
1.1 noro 201: NEWMP(m); m->dl = d; C(m) = (P)ONE; NEXT(m) = 0; MKDP(n,m,u); u->sugar = d->td;
1.2 noro 202: comm_muld(vl,t,u,&r); addd(vl,r,s,&t); s = t;
1.1 noro 203: }
204: *pr = s;
205: }
206: }
207: }
1.17 noro 208: #if 0
1.22 noro 209: if ( !dp_fcoeffs && has_sfcoef(*pr) )
210: dp_fcoeffs = N_GFS;
1.17 noro 211: #endif
1.1 noro 212: }
213:
1.19 noro 214: void dtop(VL vl,VL dvl,DP p,P *pr)
1.1 noro 215: {
1.16 noro 216: int n,i,j,k;
1.1 noro 217: DL d;
218: MP m;
1.16 noro 219: MP *a;
1.1 noro 220: P r,s,t,u,w;
221: Q q;
222: VL tvl;
223:
224: if ( !p )
225: *pr = 0;
226: else {
1.16 noro 227: for ( k = 0, m = BDY(p); m; m = NEXT(m), k++ );
228: a = (MP *)ALLOCA(k*sizeof(MP));
229: for ( j = 0, m = BDY(p); j < k; m = NEXT(m), j++ )
230: a[j] = m;
231:
232: for ( n = p->nv, j = k-1, s = 0; j >= 0; j-- ) {
233: m = a[j];
1.1 noro 234: t = C(m);
235: if ( NUM(t) && NID((Num)t) == N_M ) {
236: mptop(t,&u); t = u;
237: }
238: for ( i = 0, d = m->dl, tvl = dvl;
239: i < n; tvl = NEXT(tvl), i++ ) {
240: MKV(tvl->v,r); STOQ(d->d[i],q); pwrp(vl,r,q,&u);
241: mulp(vl,t,u,&w); t = w;
242: }
243: addp(vl,s,t,&u); s = u;
244: }
245: *pr = s;
246: }
247: }
248:
1.19 noro 249: void nodetod(NODE node,DP *dp)
1.1 noro 250: {
251: NODE t;
252: int len,i,td;
253: Q e;
254: DL d;
255: MP m;
256: DP u;
257:
258: for ( t = node, len = 0; t; t = NEXT(t), len++ );
259: NEWDL(d,len);
260: for ( t = node, i = 0, td = 0; i < len; t = NEXT(t), i++ ) {
261: e = (Q)BDY(t);
262: if ( !e )
263: d->d[i] = 0;
264: else if ( !NUM(e) || !RATN(e) || !INT(e) )
265: error("nodetod : invalid input");
266: else {
1.20 noro 267: d->d[i] = QTOS((Q)e); td += MUL_WEIGHT(d->d[i],i);
1.1 noro 268: }
269: }
270: d->td = td;
271: NEWMP(m); m->dl = d; C(m) = (P)ONE; NEXT(m) = 0;
272: MKDP(len,m,u); u->sugar = td; *dp = u;
273: }
274:
1.19 noro 275: int sugard(MP m)
1.1 noro 276: {
277: int s;
278:
279: for ( s = 0; m; m = NEXT(m) )
280: s = MAX(s,m->dl->td);
281: return s;
282: }
283:
1.19 noro 284: void addd(VL vl,DP p1,DP p2,DP *pr)
1.1 noro 285: {
286: int n;
287: MP m1,m2,mr,mr0;
288: P t;
289:
290: if ( !p1 )
291: *pr = p2;
292: else if ( !p2 )
293: *pr = p1;
294: else {
295: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; )
296: switch ( (*cmpdl)(n,m1->dl,m2->dl) ) {
297: case 0:
298: addp(vl,C(m1),C(m2),&t);
299: if ( t ) {
300: NEXTMP(mr0,mr); mr->dl = m1->dl; C(mr) = t;
301: }
302: m1 = NEXT(m1); m2 = NEXT(m2); break;
303: case 1:
304: NEXTMP(mr0,mr); mr->dl = m1->dl; C(mr) = C(m1);
305: m1 = NEXT(m1); break;
306: case -1:
307: NEXTMP(mr0,mr); mr->dl = m2->dl; C(mr) = C(m2);
308: m2 = NEXT(m2); break;
309: }
310: if ( !mr0 )
311: if ( m1 )
312: mr0 = m1;
313: else if ( m2 )
314: mr0 = m2;
315: else {
316: *pr = 0;
317: return;
318: }
319: else if ( m1 )
320: NEXT(mr) = m1;
321: else if ( m2 )
322: NEXT(mr) = m2;
323: else
324: NEXT(mr) = 0;
325: MKDP(NV(p1),mr0,*pr);
326: if ( *pr )
327: (*pr)->sugar = MAX(p1->sugar,p2->sugar);
328: }
329: }
330:
331: /* for F4 symbolic reduction */
332:
1.19 noro 333: void symb_addd(DP p1,DP p2,DP *pr)
1.1 noro 334: {
335: int n;
336: MP m1,m2,mr,mr0;
337:
338: if ( !p1 )
339: *pr = p2;
340: else if ( !p2 )
341: *pr = p1;
342: else {
343: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
344: NEXTMP(mr0,mr); C(mr) = (P)ONE;
345: switch ( (*cmpdl)(n,m1->dl,m2->dl) ) {
346: case 0:
347: mr->dl = m1->dl;
348: m1 = NEXT(m1); m2 = NEXT(m2); break;
349: case 1:
350: mr->dl = m1->dl;
351: m1 = NEXT(m1); break;
352: case -1:
353: mr->dl = m2->dl;
354: m2 = NEXT(m2); break;
355: }
356: }
357: if ( !mr0 )
358: if ( m1 )
359: mr0 = m1;
360: else if ( m2 )
361: mr0 = m2;
362: else {
363: *pr = 0;
364: return;
365: }
366: else if ( m1 )
367: NEXT(mr) = m1;
368: else if ( m2 )
369: NEXT(mr) = m2;
370: else
371: NEXT(mr) = 0;
372: MKDP(NV(p1),mr0,*pr);
373: if ( *pr )
374: (*pr)->sugar = MAX(p1->sugar,p2->sugar);
1.3 noro 375: }
376: }
377:
378: /*
379: * destructive merge of two list
380: *
381: * p1, p2 : list of DL
382: * return : a merged list
383: */
384:
1.19 noro 385: NODE symb_merge(NODE m1,NODE m2,int n)
1.3 noro 386: {
387: NODE top,prev,cur,m,t;
1.25 ! noro 388: int c,i;
! 389: DL d1,d2;
1.3 noro 390:
391: if ( !m1 )
392: return m2;
393: else if ( !m2 )
394: return m1;
395: else {
396: switch ( (*cmpdl)(n,(DL)BDY(m1),(DL)BDY(m2)) ) {
397: case 0:
398: top = m1; m = NEXT(m2);
399: break;
400: case 1:
401: top = m1; m = m2;
402: break;
403: case -1:
404: top = m2; m = m1;
405: break;
406: }
407: prev = top; cur = NEXT(top);
408: /* BDY(prev) > BDY(m) always holds */
409: while ( cur && m ) {
1.25 ! noro 410: d1 = (DL)BDY(cur);
! 411: d2 = (DL)BDY(m);
! 412: if ( d1->td > d2->td )
! 413: c = 1;
! 414: else if ( d1->td < d2->td )
! 415: c = -1;
! 416: else {
! 417: for ( i = n-1; i >= 0 && d1->d[i] == d2->d[i]; i-- );
! 418: if ( i < 0 )
! 419: c = 0;
! 420: else if ( d1->d[i] < d2->d[i] )
! 421: c = 1;
! 422: else
! 423: c = -1;
! 424: }
! 425: #if 0
1.3 noro 426: switch ( (*cmpdl)(n,(DL)BDY(cur),(DL)BDY(m)) ) {
1.25 ! noro 427: #else
! 428: switch ( c ) {
! 429: #endif
1.3 noro 430: case 0:
431: m = NEXT(m);
432: prev = cur; cur = NEXT(cur);
433: break;
434: case 1:
435: t = NEXT(cur); NEXT(cur) = m; m = t;
436: prev = cur; cur = NEXT(cur);
437: break;
438: case -1:
439: NEXT(prev) = m; m = cur;
440: prev = NEXT(prev); cur = NEXT(prev);
441: break;
1.18 noro 442: }
443: }
444: if ( !cur )
445: NEXT(prev) = m;
1.23 noro 446: return top;
447: }
448: }
449:
450: void _adddl(int n,DL d1,DL d2,DL d3)
451: {
452: int i;
453:
454: d3->td = d1->td+d2->td;
455: for ( i = 0; i < n; i++ )
456: d3->d[i] = d1->d[i]+d2->d[i];
457: }
458:
459: /* m1 <- m1 U dl*f, destructive */
460:
461: NODE mul_dllist(DL dl,DP f);
462:
463: NODE symb_mul_merge(NODE m1,DL dl,DP f,int n)
464: {
465: NODE top,prev,cur,n1;
466: DP g;
467: DL t,s;
468: MP m;
469:
470: if ( !m1 )
471: return mul_dllist(dl,f);
472: else if ( !f )
473: return m1;
474: else {
475: m = BDY(f);
476: NEWDL_NOINIT(t,n);
477: _adddl(n,m->dl,dl,t);
478: top = m1; prev = 0; cur = m1;
479: while ( m ) {
480: switch ( (*cmpdl)(n,(DL)BDY(cur),t) ) {
481: case 0:
482: prev = cur; cur = NEXT(cur);
483: if ( !cur ) {
484: MKDP(n,m,g);
485: NEXT(prev) = mul_dllist(dl,g);
486: return;
487: }
488: m = NEXT(m);
489: if ( m ) _adddl(n,m->dl,dl,t);
490: break;
491: case 1:
492: prev = cur; cur = NEXT(cur);
493: if ( !cur ) {
494: MKDP(n,m,g);
495: NEXT(prev) = mul_dllist(dl,g);
496: return;
497: }
498: break;
499: case -1:
500: NEWDL_NOINIT(s,n);
501: s->td = t->td;
502: bcopy(t->d,s->d,n*sizeof(int));
503: NEWNODE(n1);
504: n1->body = (pointer)s;
505: NEXT(n1) = cur;
506: if ( !prev ) {
507: top = n1; cur = n1;
508: } else {
509: NEXT(prev) = n1; prev = n1;
510: }
511: m = NEXT(m);
512: if ( m ) _adddl(n,m->dl,dl,t);
513: break;
514: }
515: }
1.18 noro 516: return top;
517: }
518: }
519:
1.19 noro 520: DLBUCKET symb_merge_bucket(DLBUCKET m1,DLBUCKET m2,int n)
1.18 noro 521: {
522: DLBUCKET top,prev,cur,m,t;
523:
524: if ( !m1 )
525: return m2;
526: else if ( !m2 )
527: return m1;
528: else {
529: if ( m1->td == m2->td ) {
530: top = m1;
531: BDY(top) = symb_merge(BDY(top),BDY(m2),n);
532: m = NEXT(m2);
533: } else if ( m1->td > m2->td ) {
534: top = m1; m = m2;
535: } else {
536: top = m2; m = m1;
537: }
538: prev = top; cur = NEXT(top);
539: /* prev->td > m->td always holds */
540: while ( cur && m ) {
541: if ( cur->td == m->td ) {
542: BDY(cur) = symb_merge(BDY(cur),BDY(m),n);
543: m = NEXT(m);
544: prev = cur; cur = NEXT(cur);
545: } else if ( cur->td > m->td ) {
546: t = NEXT(cur); NEXT(cur) = m; m = t;
547: prev = cur; cur = NEXT(cur);
548: } else {
549: NEXT(prev) = m; m = cur;
550: prev = NEXT(prev); cur = NEXT(prev);
1.3 noro 551: }
552: }
553: if ( !cur )
554: NEXT(prev) = m;
555: return top;
1.1 noro 556: }
557: }
558:
1.19 noro 559: void subd(VL vl,DP p1,DP p2,DP *pr)
1.1 noro 560: {
561: DP t;
562:
563: if ( !p2 )
564: *pr = p1;
565: else {
566: chsgnd(p2,&t); addd(vl,p1,t,pr);
567: }
568: }
569:
1.19 noro 570: void chsgnd(DP p,DP *pr)
1.1 noro 571: {
572: MP m,mr,mr0;
573:
574: if ( !p )
575: *pr = 0;
576: else {
577: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
578: NEXTMP(mr0,mr); chsgnp(C(m),&C(mr)); mr->dl = m->dl;
579: }
580: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
581: if ( *pr )
582: (*pr)->sugar = p->sugar;
583: }
584: }
585:
1.19 noro 586: void muld(VL vl,DP p1,DP p2,DP *pr)
1.1 noro 587: {
1.2 noro 588: if ( ! do_weyl )
589: comm_muld(vl,p1,p2,pr);
590: else
591: weyl_muld(vl,p1,p2,pr);
592: }
593:
1.19 noro 594: void comm_muld(VL vl,DP p1,DP p2,DP *pr)
1.2 noro 595: {
1.1 noro 596: MP m;
597: DP s,t,u;
1.5 noro 598: int i,l,l1;
599: static MP *w;
600: static int wlen;
1.1 noro 601:
602: if ( !p1 || !p2 )
603: *pr = 0;
604: else if ( OID(p1) <= O_P )
605: muldc(vl,p2,(P)p1,pr);
606: else if ( OID(p2) <= O_P )
607: muldc(vl,p1,(P)p2,pr);
608: else {
1.5 noro 609: for ( m = BDY(p1), l1 = 0; m; m = NEXT(m), l1++ );
1.4 noro 610: for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ );
1.5 noro 611: if ( l1 < l ) {
612: t = p1; p1 = p2; p2 = t;
613: l = l1;
614: }
615: if ( l > wlen ) {
616: if ( w ) GC_free(w);
617: w = (MP *)MALLOC(l*sizeof(MP));
618: wlen = l;
619: }
1.4 noro 620: for ( m = BDY(p2), i = 0; i < l; m = NEXT(m), i++ )
621: w[i] = m;
622: for ( s = 0, i = l-1; i >= 0; i-- ) {
623: muldm(vl,p1,w[i],&t); addd(vl,s,t,&u); s = u;
1.1 noro 624: }
1.5 noro 625: bzero(w,l*sizeof(MP));
1.1 noro 626: *pr = s;
627: }
628: }
629:
1.24 noro 630: /* discard terms which is not a multiple of dl */
631:
632: void comm_muld_trunc(VL vl,DP p1,DP p2,DL dl,DP *pr)
633: {
634: MP m;
635: DP s,t,u;
636: int i,l,l1;
637: static MP *w;
638: static int wlen;
639:
640: if ( !p1 || !p2 )
641: *pr = 0;
642: else if ( OID(p1) <= O_P )
643: muldc_trunc(vl,p2,(P)p1,dl,pr);
644: else if ( OID(p2) <= O_P )
645: muldc_trunc(vl,p1,(P)p2,dl,pr);
646: else {
647: for ( m = BDY(p1), l1 = 0; m; m = NEXT(m), l1++ );
648: for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ );
649: if ( l1 < l ) {
650: t = p1; p1 = p2; p2 = t;
651: l = l1;
652: }
653: if ( l > wlen ) {
654: if ( w ) GC_free(w);
655: w = (MP *)MALLOC(l*sizeof(MP));
656: wlen = l;
657: }
658: for ( m = BDY(p2), i = 0; i < l; m = NEXT(m), i++ )
659: w[i] = m;
660: for ( s = 0, i = l-1; i >= 0; i-- ) {
661: muldm_trunc(vl,p1,w[i],dl,&t); addd(vl,s,t,&u); s = u;
662: }
663: bzero(w,l*sizeof(MP));
664: *pr = s;
665: }
666: }
667:
668: void comm_quod(VL vl,DP p1,DP p2,DP *pr)
669: {
670: MP m,m0;
671: DP s,t;
672: int i,n,sugar;
673: DL d1,d2,d;
674: Q a,b;
675:
676: if ( !p2 )
677: error("comm_quod : invalid input");
678: if ( !p1 )
679: *pr = 0;
680: else {
681: n = NV(p1);
682: d2 = BDY(p2)->dl;
683: m0 = 0;
684: sugar = p1->sugar;
685: while ( p1 ) {
686: d1 = BDY(p1)->dl;
687: NEWDL(d,n);
688: d->td = d1->td - d2->td;
689: for ( i = 0; i < n; i++ )
690: d->d[i] = d1->d[i]-d2->d[i];
691: NEXTMP(m0,m);
692: m->dl = d;
693: divq((Q)BDY(p1)->c,(Q)BDY(p2)->c,&a); chsgnq(a,&b);
694: C(m) = (P)b;
695: muldm_trunc(vl,p2,m,d2,&t);
696: addd(vl,p1,t,&s); p1 = s;
697: C(m) = (P)a;
698: }
699: if ( m0 ) {
700: NEXT(m) = 0; MKDP(n,m0,*pr);
701: } else
702: *pr = 0;
703: /* XXX */
704: if ( *pr )
705: (*pr)->sugar = sugar - d2->td;
706: }
707: }
708:
1.19 noro 709: void muldm(VL vl,DP p,MP m0,DP *pr)
1.1 noro 710: {
711: MP m,mr,mr0;
712: P c;
713: DL d;
714: int n;
715:
716: if ( !p )
717: *pr = 0;
718: else {
719: for ( mr0 = 0, m = BDY(p), c = C(m0), d = m0->dl, n = NV(p);
720: m; m = NEXT(m) ) {
721: NEXTMP(mr0,mr);
722: if ( NUM(C(m)) && RATN(C(m)) && NUM(c) && RATN(c) )
723: mulq((Q)C(m),(Q)c,(Q *)&C(mr));
724: else
725: mulp(vl,C(m),c,&C(mr));
726: adddl(n,m->dl,d,&mr->dl);
727: }
728: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
729: if ( *pr )
730: (*pr)->sugar = p->sugar + m0->dl->td;
1.2 noro 731: }
732: }
733:
1.24 noro 734: void muldm_trunc(VL vl,DP p,MP m0,DL dl,DP *pr)
735: {
736: MP m,mr,mr0;
737: P c;
738: DL d,tdl;
739: int n,i;
740:
741: if ( !p )
742: *pr = 0;
743: else {
744: n = NV(p);
745: NEWDL(tdl,n);
746: for ( mr0 = 0, m = BDY(p), c = C(m0), d = m0->dl;
747: m; m = NEXT(m) ) {
748: _adddl(n,m->dl,d,tdl);
749: for ( i = 0; i < n; i++ )
750: if ( tdl->d[i] < dl->d[i] )
751: break;
752: if ( i < n )
753: continue;
754: NEXTMP(mr0,mr);
755: mr->dl = tdl;
756: NEWDL(tdl,n);
757: if ( NUM(C(m)) && RATN(C(m)) && NUM(c) && RATN(c) )
758: mulq((Q)C(m),(Q)c,(Q *)&C(mr));
759: else
760: mulp(vl,C(m),c,&C(mr));
761: }
762: if ( mr0 ) {
763: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
764: } else
765: *pr = 0;
766: if ( *pr )
767: (*pr)->sugar = p->sugar + m0->dl->td;
768: }
769: }
770:
1.19 noro 771: void weyl_muld(VL vl,DP p1,DP p2,DP *pr)
1.2 noro 772: {
773: MP m;
774: DP s,t,u;
1.4 noro 775: int i,l;
1.5 noro 776: static MP *w;
777: static int wlen;
1.2 noro 778:
779: if ( !p1 || !p2 )
780: *pr = 0;
781: else if ( OID(p1) <= O_P )
782: muldc(vl,p2,(P)p1,pr);
783: else if ( OID(p2) <= O_P )
784: muldc(vl,p1,(P)p2,pr);
785: else {
1.10 noro 786: for ( m = BDY(p1), l = 0; m; m = NEXT(m), l++ );
1.5 noro 787: if ( l > wlen ) {
788: if ( w ) GC_free(w);
789: w = (MP *)MALLOC(l*sizeof(MP));
790: wlen = l;
791: }
1.10 noro 792: for ( m = BDY(p1), i = 0; i < l; m = NEXT(m), i++ )
1.4 noro 793: w[i] = m;
794: for ( s = 0, i = l-1; i >= 0; i-- ) {
1.10 noro 795: weyl_muldm(vl,w[i],p2,&t); addd(vl,s,t,&u); s = u;
1.2 noro 796: }
1.5 noro 797: bzero(w,l*sizeof(MP));
1.2 noro 798: *pr = s;
799: }
800: }
801:
1.10 noro 802: /* monomial * polynomial */
803:
1.19 noro 804: void weyl_muldm(VL vl,MP m0,DP p,DP *pr)
1.2 noro 805: {
806: DP r,t,t1;
807: MP m;
1.10 noro 808: DL d0;
809: int n,n2,l,i,j,tlen;
810: static MP *w,*psum;
811: static struct cdl *tab;
1.5 noro 812: static int wlen;
1.10 noro 813: static int rtlen;
1.2 noro 814:
815: if ( !p )
816: *pr = 0;
817: else {
1.4 noro 818: for ( m = BDY(p), l = 0; m; m = NEXT(m), l++ );
1.5 noro 819: if ( l > wlen ) {
820: if ( w ) GC_free(w);
821: w = (MP *)MALLOC(l*sizeof(MP));
822: wlen = l;
823: }
1.4 noro 824: for ( m = BDY(p), i = 0; i < l; m = NEXT(m), i++ )
825: w[i] = m;
1.10 noro 826:
827: n = NV(p); n2 = n>>1;
828: d0 = m0->dl;
829: for ( i = 0, tlen = 1; i < n2; i++ )
830: tlen *= d0->d[n2+i]+1;
831: if ( tlen > rtlen ) {
832: if ( tab ) GC_free(tab);
833: if ( psum ) GC_free(psum);
834: rtlen = tlen;
835: tab = (struct cdl *)MALLOC(rtlen*sizeof(struct cdl));
836: psum = (MP *)MALLOC(rtlen*sizeof(MP));
837: }
838: bzero(psum,tlen*sizeof(MP));
839: for ( i = l-1; i >= 0; i-- ) {
840: bzero(tab,tlen*sizeof(struct cdl));
841: weyl_mulmm(vl,m0,w[i],n,tab,tlen);
842: for ( j = 0; j < tlen; j++ ) {
843: if ( tab[j].c ) {
844: NEWMP(m); m->dl = tab[j].d; C(m) = tab[j].c; NEXT(m) = psum[j];
845: psum[j] = m;
846: }
847: }
1.2 noro 848: }
1.10 noro 849: for ( j = tlen-1, r = 0; j >= 0; j-- )
850: if ( psum[j] ) {
851: MKDP(n,psum[j],t); addd(vl,r,t,&t1); r = t1;
852: }
1.2 noro 853: if ( r )
854: r->sugar = p->sugar + m0->dl->td;
855: *pr = r;
856: }
857: }
858:
1.10 noro 859: /* m0 = x0^d0*x1^d1*... * dx0^e0*dx1^e1*... */
860: /* rtab : array of length (e0+1)*(e1+1)*... */
1.2 noro 861:
1.19 noro 862: void weyl_mulmm(VL vl,MP m0,MP m1,int n,struct cdl *rtab,int rtablen)
1.2 noro 863: {
1.19 noro 864: P c,c0,c1;
1.10 noro 865: DL d,d0,d1,dt;
866: int i,j,a,b,k,l,n2,s,min,curlen;
867: struct cdl *p;
868: static Q *ctab;
869: static struct cdl *tab;
1.5 noro 870: static int tablen;
1.10 noro 871: static struct cdl *tmptab;
872: static int tmptablen;
1.2 noro 873:
1.10 noro 874:
875: if ( !m0 || !m1 ) {
876: rtab[0].c = 0;
877: rtab[0].d = 0;
878: return;
879: }
880: c0 = C(m0); c1 = C(m1);
881: mulp(vl,c0,c1,&c);
882: d0 = m0->dl; d1 = m1->dl;
883: n2 = n>>1;
884: curlen = 1;
885: NEWDL(d,n);
886: if ( n & 1 )
887: /* offset of h-degree */
888: d->td = d->d[n-1] = d0->d[n-1]+d1->d[n-1];
889: else
890: d->td = 0;
891: rtab[0].c = c;
892: rtab[0].d = d;
893:
894: if ( rtablen > tmptablen ) {
895: if ( tmptab ) GC_free(tmptab);
896: tmptab = (struct cdl *)MALLOC(rtablen*sizeof(struct cdl));
897: tmptablen = rtablen;
898: }
899: for ( i = 0; i < n2; i++ ) {
900: a = d0->d[i]; b = d1->d[n2+i];
901: k = d0->d[n2+i]; l = d1->d[i];
1.20 noro 902:
903: /* degree of xi^a*(Di^k*xi^l)*Di^b */
904: a += l;
905: b += k;
906: s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i);
907:
1.10 noro 908: if ( !k || !l ) {
909: for ( j = 0, p = rtab; j < curlen; j++, p++ ) {
910: if ( p->c ) {
911: dt = p->d;
912: dt->d[i] = a;
913: dt->d[n2+i] = b;
914: dt->td += s;
1.5 noro 915: }
1.10 noro 916: }
917: curlen *= k+1;
918: continue;
919: }
920: if ( k+1 > tablen ) {
921: if ( tab ) GC_free(tab);
922: if ( ctab ) GC_free(ctab);
923: tablen = k+1;
924: tab = (struct cdl *)MALLOC(tablen*sizeof(struct cdl));
925: ctab = (Q *)MALLOC(tablen*sizeof(Q));
926: }
927: /* compute xi^a*(Di^k*xi^l)*Di^b */
928: min = MIN(k,l);
929: mkwc(k,l,ctab);
930: bzero(tab,(k+1)*sizeof(struct cdl));
931: if ( n & 1 )
932: for ( j = 0; j <= min; j++ ) {
933: NEWDL(d,n);
1.20 noro 934: d->d[i] = a-j; d->d[n2+i] = b-j;
1.10 noro 935: d->td = s;
1.20 noro 936: d->d[n-1] = s-(MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i));
1.10 noro 937: tab[j].d = d;
938: tab[j].c = (P)ctab[j];
939: }
940: else
941: for ( j = 0; j <= min; j++ ) {
942: NEWDL(d,n);
1.20 noro 943: d->d[i] = a-j; d->d[n2+i] = b-j;
944: d->td = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i); /* XXX */
1.10 noro 945: tab[j].d = d;
946: tab[j].c = (P)ctab[j];
947: }
948: bzero(ctab,(min+1)*sizeof(Q));
949: comm_muld_tab(vl,n,rtab,curlen,tab,k+1,tmptab);
950: curlen *= k+1;
951: bcopy(tmptab,rtab,curlen*sizeof(struct cdl));
952: }
953: }
954:
955: /* direct product of two cdl tables
956: rt[] = [
957: t[0]*t1[0],...,t[n-1]*t1[0],
958: t[0]*t1[1],...,t[n-1]*t1[1],
959: ...
960: t[0]*t1[n1-1],...,t[n-1]*t1[n1-1]
961: ]
962: */
963:
1.19 noro 964: void comm_muld_tab(VL vl,int nv,struct cdl *t,int n,struct cdl *t1,int n1,struct cdl *rt)
1.10 noro 965: {
966: int i,j;
967: struct cdl *p;
968: P c;
969: DL d;
970:
971: bzero(rt,n*n1*sizeof(struct cdl));
972: for ( j = 0, p = rt; j < n1; j++ ) {
973: c = t1[j].c;
974: d = t1[j].d;
975: if ( !c )
976: break;
977: for ( i = 0; i < n; i++, p++ ) {
978: if ( t[i].c ) {
979: mulp(vl,t[i].c,c,&p->c);
980: adddl(nv,t[i].d,d,&p->d);
981: }
1.6 noro 982: }
1.1 noro 983: }
984: }
985:
1.19 noro 986: void muldc(VL vl,DP p,P c,DP *pr)
1.1 noro 987: {
988: MP m,mr,mr0;
989:
990: if ( !p || !c )
991: *pr = 0;
992: else if ( NUM(c) && UNIQ((Q)c) )
993: *pr = p;
994: else if ( NUM(c) && MUNIQ((Q)c) )
995: chsgnd(p,pr);
996: else {
997: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
998: NEXTMP(mr0,mr);
999: if ( NUM(C(m)) && RATN(C(m)) && NUM(c) && RATN(c) )
1000: mulq((Q)C(m),(Q)c,(Q *)&C(mr));
1001: else
1002: mulp(vl,C(m),c,&C(mr));
1003: mr->dl = m->dl;
1004: }
1005: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
1006: if ( *pr )
1007: (*pr)->sugar = p->sugar;
1008: }
1.24 noro 1009: }
1010:
1011: void muldc_trunc(VL vl,DP p,P c,DL dl,DP *pr)
1012: {
1013: MP m,mr,mr0;
1014: DL mdl;
1015: int i,n;
1016:
1017: if ( !p || !c ) {
1018: *pr = 0; return;
1019: }
1020: n = NV(p);
1021: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
1022: mdl = m->dl;
1023: for ( i = 0; i < n; i++ )
1024: if ( mdl->d[i] < dl->d[i] )
1025: break;
1026: if ( i < n )
1027: break;
1028: NEXTMP(mr0,mr);
1029: if ( NUM(C(m)) && RATN(C(m)) && NUM(c) && RATN(c) )
1030: mulq((Q)C(m),(Q)c,(Q *)&C(mr));
1031: else
1032: mulp(vl,C(m),c,&C(mr));
1033: mr->dl = m->dl;
1034: }
1035: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
1036: if ( *pr )
1037: (*pr)->sugar = p->sugar;
1.1 noro 1038: }
1039:
1.19 noro 1040: void divsdc(VL vl,DP p,P c,DP *pr)
1.1 noro 1041: {
1042: MP m,mr,mr0;
1043:
1044: if ( !c )
1045: error("disvsdc : division by 0");
1046: else if ( !p )
1047: *pr = 0;
1048: else {
1049: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
1050: NEXTMP(mr0,mr); divsp(vl,C(m),c,&C(mr)); mr->dl = m->dl;
1051: }
1052: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
1053: if ( *pr )
1054: (*pr)->sugar = p->sugar;
1055: }
1056: }
1057:
1.19 noro 1058: void adddl(int n,DL d1,DL d2,DL *dr)
1.1 noro 1059: {
1060: DL dt;
1061: int i;
1062:
1063: if ( !d1->td )
1064: *dr = d2;
1065: else if ( !d2->td )
1066: *dr = d1;
1067: else {
1068: *dr = dt = (DL)MALLOC_ATOMIC((n+1)*sizeof(int));
1069: dt->td = d1->td + d2->td;
1070: for ( i = 0; i < n; i++ )
1071: dt->d[i] = d1->d[i]+d2->d[i];
1072: }
1.11 noro 1073: }
1074:
1075: /* d1 += d2 */
1076:
1.19 noro 1077: void adddl_destructive(int n,DL d1,DL d2)
1.11 noro 1078: {
1079: int i;
1080:
1081: d1->td += d2->td;
1082: for ( i = 0; i < n; i++ )
1083: d1->d[i] += d2->d[i];
1.1 noro 1084: }
1085:
1.19 noro 1086: int compd(VL vl,DP p1,DP p2)
1.1 noro 1087: {
1088: int n,t;
1089: MP m1,m2;
1090:
1091: if ( !p1 )
1092: return p2 ? -1 : 0;
1093: else if ( !p2 )
1094: return 1;
1095: else {
1096: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2);
1097: m1 && m2; m1 = NEXT(m1), m2 = NEXT(m2) )
1098: if ( (t = (*cmpdl)(n,m1->dl,m2->dl)) ||
1099: (t = compp(vl,C(m1),C(m2)) ) )
1100: return t;
1101: if ( m1 )
1102: return 1;
1103: else if ( m2 )
1104: return -1;
1105: else
1106: return 0;
1107: }
1108: }
1109:
1.19 noro 1110: int cmpdl_lex(int n,DL d1,DL d2)
1.1 noro 1111: {
1112: int i;
1113:
1114: for ( i = 0; i < n && d1->d[i] == d2->d[i]; i++ );
1115: return i == n ? 0 : (d1->d[i] > d2->d[i] ? 1 : -1);
1116: }
1117:
1.19 noro 1118: int cmpdl_revlex(int n,DL d1,DL d2)
1.1 noro 1119: {
1120: int i;
1121:
1122: for ( i = n - 1; i >= 0 && d1->d[i] == d2->d[i]; i-- );
1123: return i < 0 ? 0 : (d1->d[i] < d2->d[i] ? 1 : -1);
1124: }
1125:
1.19 noro 1126: int cmpdl_gradlex(int n,DL d1,DL d2)
1.1 noro 1127: {
1128: if ( d1->td > d2->td )
1129: return 1;
1130: else if ( d1->td < d2->td )
1131: return -1;
1132: else
1133: return cmpdl_lex(n,d1,d2);
1134: }
1135:
1.19 noro 1136: int cmpdl_revgradlex(int n,DL d1,DL d2)
1.1 noro 1137: {
1.25 ! noro 1138: register int i,c;
1.7 noro 1139: register int *p1,*p2;
1140:
1.1 noro 1141: if ( d1->td > d2->td )
1142: return 1;
1143: else if ( d1->td < d2->td )
1144: return -1;
1.7 noro 1145: else {
1.25 ! noro 1146: i = n-1;
! 1147: p1 = d1->d+n-1;
! 1148: p2 = d2->d+n-1;
! 1149: while ( i >= 7 ) {
! 1150: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1151: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1152: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1153: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1154: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1155: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1156: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1157: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1158: i -= 8;
! 1159: }
! 1160: switch ( i ) {
! 1161: case 6:
! 1162: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1163: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1164: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1165: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1166: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1167: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1168: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1169: return 0;
! 1170: case 5:
! 1171: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1172: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1173: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1174: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1175: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1176: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1177: return 0;
! 1178: case 4:
! 1179: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1180: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1181: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1182: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1183: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1184: return 0;
! 1185: case 3:
! 1186: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1187: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1188: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1189: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1190: return 0;
! 1191: case 2:
! 1192: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1193: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1194: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1195: return 0;
! 1196: case 1:
! 1197: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1198: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1199: return 0;
! 1200: case 0:
! 1201: c = (*p1--) - (*p2--); if ( c ) goto LAST;
! 1202: return 0;
! 1203: default:
! 1204: return 0;
! 1205: }
! 1206: LAST:
! 1207: if ( c > 0 ) return -1;
! 1208: else return 1;
1.7 noro 1209: }
1.1 noro 1210: }
1211:
1.19 noro 1212: int cmpdl_blex(int n,DL d1,DL d2)
1.1 noro 1213: {
1214: int c;
1215:
1216: if ( c = cmpdl_lex(n-1,d1,d2) )
1217: return c;
1218: else {
1219: c = d1->d[n-1] - d2->d[n-1];
1220: return c > 0 ? 1 : c < 0 ? -1 : 0;
1221: }
1222: }
1223:
1.19 noro 1224: int cmpdl_bgradlex(int n,DL d1,DL d2)
1.1 noro 1225: {
1226: int e1,e2,c;
1227:
1228: e1 = d1->td - d1->d[n-1]; e2 = d2->td - d2->d[n-1];
1229: if ( e1 > e2 )
1230: return 1;
1231: else if ( e1 < e2 )
1232: return -1;
1233: else {
1234: c = cmpdl_lex(n-1,d1,d2);
1235: if ( c )
1236: return c;
1237: else
1238: return d1->td > d2->td ? 1 : d1->td < d2->td ? -1 : 0;
1239: }
1240: }
1241:
1.19 noro 1242: int cmpdl_brevgradlex(int n,DL d1,DL d2)
1.1 noro 1243: {
1244: int e1,e2,c;
1245:
1246: e1 = d1->td - d1->d[n-1]; e2 = d2->td - d2->d[n-1];
1247: if ( e1 > e2 )
1248: return 1;
1249: else if ( e1 < e2 )
1250: return -1;
1251: else {
1252: c = cmpdl_revlex(n-1,d1,d2);
1253: if ( c )
1254: return c;
1255: else
1256: return d1->td > d2->td ? 1 : d1->td < d2->td ? -1 : 0;
1257: }
1258: }
1259:
1.19 noro 1260: int cmpdl_brevrev(int n,DL d1,DL d2)
1.1 noro 1261: {
1262: int e1,e2,f1,f2,c,i;
1263:
1264: for ( i = 0, e1 = 0, e2 = 0; i < dp_nelim; i++ ) {
1265: e1 += d1->d[i]; e2 += d2->d[i];
1266: }
1267: f1 = d1->td - e1; f2 = d2->td - e2;
1268: if ( e1 > e2 )
1269: return 1;
1270: else if ( e1 < e2 )
1271: return -1;
1272: else {
1273: c = cmpdl_revlex(dp_nelim,d1,d2);
1274: if ( c )
1275: return c;
1276: else if ( f1 > f2 )
1277: return 1;
1278: else if ( f1 < f2 )
1279: return -1;
1280: else {
1281: for ( i = n - 1; i >= dp_nelim && d1->d[i] == d2->d[i]; i-- );
1282: return i < dp_nelim ? 0 : (d1->d[i] < d2->d[i] ? 1 : -1);
1283: }
1284: }
1285: }
1286:
1.19 noro 1287: int cmpdl_bgradrev(int n,DL d1,DL d2)
1.1 noro 1288: {
1289: int e1,e2,f1,f2,c,i;
1290:
1291: for ( i = 0, e1 = 0, e2 = 0; i < dp_nelim; i++ ) {
1292: e1 += d1->d[i]; e2 += d2->d[i];
1293: }
1294: f1 = d1->td - e1; f2 = d2->td - e2;
1295: if ( e1 > e2 )
1296: return 1;
1297: else if ( e1 < e2 )
1298: return -1;
1299: else {
1300: c = cmpdl_lex(dp_nelim,d1,d2);
1301: if ( c )
1302: return c;
1303: else if ( f1 > f2 )
1304: return 1;
1305: else if ( f1 < f2 )
1306: return -1;
1307: else {
1308: for ( i = n - 1; i >= dp_nelim && d1->d[i] == d2->d[i]; i-- );
1309: return i < dp_nelim ? 0 : (d1->d[i] < d2->d[i] ? 1 : -1);
1310: }
1311: }
1312: }
1313:
1.19 noro 1314: int cmpdl_blexrev(int n,DL d1,DL d2)
1.1 noro 1315: {
1316: int e1,e2,f1,f2,c,i;
1317:
1318: for ( i = 0, e1 = 0, e2 = 0; i < dp_nelim; i++ ) {
1319: e1 += d1->d[i]; e2 += d2->d[i];
1320: }
1321: f1 = d1->td - e1; f2 = d2->td - e2;
1322: c = cmpdl_lex(dp_nelim,d1,d2);
1323: if ( c )
1324: return c;
1325: else if ( f1 > f2 )
1326: return 1;
1327: else if ( f1 < f2 )
1328: return -1;
1329: else {
1330: for ( i = n - 1; i >= dp_nelim && d1->d[i] == d2->d[i]; i-- );
1331: return i < dp_nelim ? 0 : (d1->d[i] < d2->d[i] ? 1 : -1);
1332: }
1333: }
1334:
1.19 noro 1335: int cmpdl_elim(int n,DL d1,DL d2)
1.1 noro 1336: {
1337: int e1,e2,i;
1338:
1339: for ( i = 0, e1 = 0, e2 = 0; i < dp_nelim; i++ ) {
1340: e1 += d1->d[i]; e2 += d2->d[i];
1341: }
1342: if ( e1 > e2 )
1343: return 1;
1344: else if ( e1 < e2 )
1345: return -1;
1346: else
1347: return cmpdl_revgradlex(n,d1,d2);
1.12 noro 1348: }
1349:
1.19 noro 1350: int cmpdl_weyl_elim(int n,DL d1,DL d2)
1.12 noro 1351: {
1352: int e1,e2,i;
1353:
1354: for ( i = 1, e1 = 0, e2 = 0; i <= dp_nelim; i++ ) {
1355: e1 += d1->d[n-i]; e2 += d2->d[n-i];
1356: }
1357: if ( e1 > e2 )
1358: return 1;
1359: else if ( e1 < e2 )
1360: return -1;
1361: else if ( d1->td > d2->td )
1362: return 1;
1363: else if ( d1->td < d2->td )
1364: return -1;
1365: else return -cmpdl_revlex(n,d1,d2);
1.13 noro 1366: }
1367:
1368: /*
1369: a special ordering
1370: 1. total order
1371: 2. (-w,w) for the first 2*m variables
1372: 3. DRL for the first 2*m variables
1373: */
1374:
1.20 noro 1375: extern int *current_weyl_weight_vector;
1.13 noro 1376:
1.19 noro 1377: int cmpdl_homo_ww_drl(int n,DL d1,DL d2)
1.13 noro 1378: {
1379: int e1,e2,m,i;
1380: int *p1,*p2;
1381:
1382: if ( d1->td > d2->td )
1383: return 1;
1384: else if ( d1->td < d2->td )
1385: return -1;
1386:
1387: m = n>>1;
1.21 noro 1388: for ( i = 0, e1 = e2 = 0, p1 = d1->d, p2 = d2->d; i < m; i++ ) {
1389: e1 += current_weyl_weight_vector[i]*(p1[m+i] - p1[i]);
1390: e2 += current_weyl_weight_vector[i]*(p2[m+i] - p2[i]);
1.13 noro 1391: }
1392: if ( e1 > e2 )
1393: return 1;
1394: else if ( e1 < e2 )
1395: return -1;
1396:
1397: e1 = d1->td - d1->d[n-1];
1398: e2 = d2->td - d2->d[n-1];
1399: if ( e1 > e2 )
1400: return 1;
1401: else if ( e1 < e2 )
1402: return -1;
1403:
1404: for ( i= n - 1, p1 = d1->d+n-1, p2 = d2->d+n-1;
1405: i >= 0 && *p1 == *p2; i--, p1--, p2-- );
1406: return i < 0 ? 0 : (*p1 < *p2 ? 1 : -1);
1.21 noro 1407: }
1408:
1409: int cmpdl_drl_zigzag(int n,DL d1,DL d2)
1410: {
1411: int i,t,m;
1412: int *p1,*p2;
1413:
1414: if ( d1->td > d2->td )
1415: return 1;
1416: else if ( d1->td < d2->td )
1417: return -1;
1418: else {
1419: m = n>>1;
1420: for ( i= m - 1, p1 = d1->d, p2 = d2->d; i >= 0; i-- ) {
1421: if ( t = p1[m+i] - p2[m+i] ) return t > 0 ? -1 : 1;
1422: if ( t = p1[i] - p2[i] ) return t > 0 ? -1 : 1;
1423: }
1424: return 0;
1425: }
1426: }
1427:
1428: int cmpdl_homo_ww_drl_zigzag(int n,DL d1,DL d2)
1429: {
1430: int e1,e2,m,i,t;
1431: int *p1,*p2;
1432:
1433: if ( d1->td > d2->td )
1434: return 1;
1435: else if ( d1->td < d2->td )
1436: return -1;
1437:
1438: m = n>>1;
1439: for ( i = 0, e1 = e2 = 0, p1 = d1->d, p2 = d2->d; i < m; i++ ) {
1440: e1 += current_weyl_weight_vector[i]*(p1[m+i] - p1[i]);
1441: e2 += current_weyl_weight_vector[i]*(p2[m+i] - p2[i]);
1442: }
1443: if ( e1 > e2 )
1444: return 1;
1445: else if ( e1 < e2 )
1446: return -1;
1447:
1448: e1 = d1->td - d1->d[n-1];
1449: e2 = d2->td - d2->d[n-1];
1450: if ( e1 > e2 )
1451: return 1;
1452: else if ( e1 < e2 )
1453: return -1;
1454:
1455: for ( i= m - 1, p1 = d1->d, p2 = d2->d; i >= 0; i-- ) {
1456: if ( t = p1[m+i] - p2[m+i] ) return t > 0 ? -1 : 1;
1457: if ( t = p1[i] - p2[i] ) return t > 0 ? -1 : 1;
1458: }
1459: return 0;
1.1 noro 1460: }
1461:
1.19 noro 1462: int cmpdl_order_pair(int n,DL d1,DL d2)
1.1 noro 1463: {
1464: int e1,e2,i,j,l;
1465: int *t1,*t2;
1.20 noro 1466: int len,head;
1.1 noro 1467: struct order_pair *pair;
1468:
1469: len = dp_current_spec.ord.block.length;
1470: pair = dp_current_spec.ord.block.order_pair;
1471:
1.20 noro 1472: head = 0;
1.1 noro 1473: for ( i = 0, t1 = d1->d, t2 = d2->d; i < len; i++ ) {
1474: l = pair[i].length;
1475: switch ( pair[i].order ) {
1476: case 0:
1477: for ( j = 0, e1 = e2 = 0; j < l; j++ ) {
1.20 noro 1478: e1 += MUL_WEIGHT(t1[j],head+j);
1479: e2 += MUL_WEIGHT(t2[j],head+j);
1.1 noro 1480: }
1481: if ( e1 > e2 )
1482: return 1;
1483: else if ( e1 < e2 )
1484: return -1;
1485: else {
1486: for ( j = l - 1; j >= 0 && t1[j] == t2[j]; j-- );
1487: if ( j >= 0 )
1488: return t1[j] < t2[j] ? 1 : -1;
1489: }
1490: break;
1491: case 1:
1492: for ( j = 0, e1 = e2 = 0; j < l; j++ ) {
1.20 noro 1493: e1 += MUL_WEIGHT(t1[j],head+j);
1494: e2 += MUL_WEIGHT(t2[j],head+j);
1.1 noro 1495: }
1496: if ( e1 > e2 )
1497: return 1;
1498: else if ( e1 < e2 )
1499: return -1;
1500: else {
1501: for ( j = 0; j < l && t1[j] == t2[j]; j++ );
1502: if ( j < l )
1503: return t1[j] > t2[j] ? 1 : -1;
1504: }
1505: break;
1506: case 2:
1507: for ( j = 0; j < l && t1[j] == t2[j]; j++ );
1508: if ( j < l )
1509: return t1[j] > t2[j] ? 1 : -1;
1510: break;
1511: default:
1512: error("cmpdl_order_pair : invalid order"); break;
1513: }
1.20 noro 1514: t1 += l; t2 += l; head += l;
1.1 noro 1515: }
1516: return 0;
1517: }
1518:
1.19 noro 1519: int cmpdl_matrix(int n,DL d1,DL d2)
1.1 noro 1520: {
1521: int *v,*w,*t1,*t2;
1522: int s,i,j,len;
1523: int **matrix;
1524:
1525: for ( i = 0, t1 = d1->d, t2 = d2->d, w = dp_dl_work; i < n; i++ )
1526: w[i] = t1[i]-t2[i];
1527: len = dp_current_spec.ord.matrix.row;
1528: matrix = dp_current_spec.ord.matrix.matrix;
1529: for ( j = 0; j < len; j++ ) {
1530: v = matrix[j];
1531: for ( i = 0, s = 0; i < n; i++ )
1532: s += v[i]*w[i];
1533: if ( s > 0 )
1534: return 1;
1535: else if ( s < 0 )
1536: return -1;
1537: }
1538: return 0;
1.25 ! noro 1539: }
! 1540:
! 1541: GeoBucket create_bucket()
! 1542: {
! 1543: GeoBucket g;
! 1544:
! 1545: g = CALLOC(1,sizeof(struct oGeoBucket));
! 1546: g->m = 32;
! 1547: return g;
! 1548: }
! 1549:
! 1550: void add_bucket(GeoBucket g,NODE d,int nv)
! 1551: {
! 1552: int l,k,m;
! 1553:
! 1554: l = length(d);
! 1555: for ( k = 0, m = 1; l > m; k++, m <<= 1 );
! 1556: /* 2^(k-1) < l <= 2^k */
! 1557: d = symb_merge(g->body[k],d,nv);
! 1558: for ( ; length(d) > (1<<(k)); k++ ) {
! 1559: g->body[k] = 0;
! 1560: d = symb_merge(g->body[k+1],d,nv);
! 1561: }
! 1562: g->body[k] = d;
! 1563: g->m = MAX(g->m,k);
! 1564: }
! 1565:
! 1566: DL remove_head_bucket(GeoBucket g,int nv)
! 1567: {
! 1568: int j,i,c,m;
! 1569: DL d;
! 1570:
! 1571: j = -1;
! 1572: m = g->m;
! 1573: for ( i = 0; i <= m; i++ ) {
! 1574: if ( !g->body[i] )
! 1575: continue;
! 1576: if ( j < 0 ) j = i;
! 1577: else {
! 1578: c = (*cmpdl)(nv,g->body[i]->body,g->body[j]->body);
! 1579: if ( c > 0 )
! 1580: j = i;
! 1581: else if ( c == 0 )
! 1582: g->body[i] = NEXT(g->body[i]);
! 1583: }
! 1584: }
! 1585: if ( j < 0 )
! 1586: return 0;
! 1587: else {
! 1588: d = g->body[j]->body;
! 1589: g->body[j] = NEXT(g->body[j]);
! 1590: return d;
! 1591: }
1.1 noro 1592: }