![[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.27 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/engine/dist.c,v 1.26 2003/08/22 08:14:45 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;
1.27 ! noro 75: struct order_spec *dp_current_spec;
1.1 noro 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: }
1.27 ! noro 154: dp_current_spec = spec;
1.1 noro 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);
1.26 noro 412: #if 1
413: switch ( (*cmpdl)(n,(DL)BDY(cur),(DL)BDY(m)) ) {
414: #else
415: /* XXX only valid for DRL */
1.25 noro 416: if ( d1->td > d2->td )
417: c = 1;
418: else if ( d1->td < d2->td )
419: c = -1;
420: else {
421: for ( i = n-1; i >= 0 && d1->d[i] == d2->d[i]; i-- );
422: if ( i < 0 )
423: c = 0;
424: else if ( d1->d[i] < d2->d[i] )
425: c = 1;
426: else
427: c = -1;
428: }
429: switch ( c ) {
430: #endif
1.3 noro 431: case 0:
432: m = NEXT(m);
433: prev = cur; cur = NEXT(cur);
434: break;
435: case 1:
436: t = NEXT(cur); NEXT(cur) = m; m = t;
437: prev = cur; cur = NEXT(cur);
438: break;
439: case -1:
440: NEXT(prev) = m; m = cur;
441: prev = NEXT(prev); cur = NEXT(prev);
442: break;
1.18 noro 443: }
444: }
445: if ( !cur )
446: NEXT(prev) = m;
1.23 noro 447: return top;
448: }
449: }
450:
451: void _adddl(int n,DL d1,DL d2,DL d3)
452: {
453: int i;
454:
455: d3->td = d1->td+d2->td;
456: for ( i = 0; i < n; i++ )
457: d3->d[i] = d1->d[i]+d2->d[i];
458: }
459:
460: /* m1 <- m1 U dl*f, destructive */
461:
462: NODE mul_dllist(DL dl,DP f);
463:
464: NODE symb_mul_merge(NODE m1,DL dl,DP f,int n)
465: {
466: NODE top,prev,cur,n1;
467: DP g;
468: DL t,s;
469: MP m;
470:
471: if ( !m1 )
472: return mul_dllist(dl,f);
473: else if ( !f )
474: return m1;
475: else {
476: m = BDY(f);
477: NEWDL_NOINIT(t,n);
478: _adddl(n,m->dl,dl,t);
479: top = m1; prev = 0; cur = m1;
480: while ( m ) {
481: switch ( (*cmpdl)(n,(DL)BDY(cur),t) ) {
482: case 0:
483: prev = cur; cur = NEXT(cur);
484: if ( !cur ) {
485: MKDP(n,m,g);
486: NEXT(prev) = mul_dllist(dl,g);
487: return;
488: }
489: m = NEXT(m);
490: if ( m ) _adddl(n,m->dl,dl,t);
491: break;
492: case 1:
493: prev = cur; cur = NEXT(cur);
494: if ( !cur ) {
495: MKDP(n,m,g);
496: NEXT(prev) = mul_dllist(dl,g);
497: return;
498: }
499: break;
500: case -1:
501: NEWDL_NOINIT(s,n);
502: s->td = t->td;
503: bcopy(t->d,s->d,n*sizeof(int));
504: NEWNODE(n1);
505: n1->body = (pointer)s;
506: NEXT(n1) = cur;
507: if ( !prev ) {
508: top = n1; cur = n1;
509: } else {
510: NEXT(prev) = n1; prev = n1;
511: }
512: m = NEXT(m);
513: if ( m ) _adddl(n,m->dl,dl,t);
514: break;
515: }
516: }
1.18 noro 517: return top;
518: }
519: }
520:
1.19 noro 521: DLBUCKET symb_merge_bucket(DLBUCKET m1,DLBUCKET m2,int n)
1.18 noro 522: {
523: DLBUCKET top,prev,cur,m,t;
524:
525: if ( !m1 )
526: return m2;
527: else if ( !m2 )
528: return m1;
529: else {
530: if ( m1->td == m2->td ) {
531: top = m1;
532: BDY(top) = symb_merge(BDY(top),BDY(m2),n);
533: m = NEXT(m2);
534: } else if ( m1->td > m2->td ) {
535: top = m1; m = m2;
536: } else {
537: top = m2; m = m1;
538: }
539: prev = top; cur = NEXT(top);
540: /* prev->td > m->td always holds */
541: while ( cur && m ) {
542: if ( cur->td == m->td ) {
543: BDY(cur) = symb_merge(BDY(cur),BDY(m),n);
544: m = NEXT(m);
545: prev = cur; cur = NEXT(cur);
546: } else if ( cur->td > m->td ) {
547: t = NEXT(cur); NEXT(cur) = m; m = t;
548: prev = cur; cur = NEXT(cur);
549: } else {
550: NEXT(prev) = m; m = cur;
551: prev = NEXT(prev); cur = NEXT(prev);
1.3 noro 552: }
553: }
554: if ( !cur )
555: NEXT(prev) = m;
556: return top;
1.1 noro 557: }
558: }
559:
1.19 noro 560: void subd(VL vl,DP p1,DP p2,DP *pr)
1.1 noro 561: {
562: DP t;
563:
564: if ( !p2 )
565: *pr = p1;
566: else {
567: chsgnd(p2,&t); addd(vl,p1,t,pr);
568: }
569: }
570:
1.19 noro 571: void chsgnd(DP p,DP *pr)
1.1 noro 572: {
573: MP m,mr,mr0;
574:
575: if ( !p )
576: *pr = 0;
577: else {
578: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
579: NEXTMP(mr0,mr); chsgnp(C(m),&C(mr)); mr->dl = m->dl;
580: }
581: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
582: if ( *pr )
583: (*pr)->sugar = p->sugar;
584: }
585: }
586:
1.19 noro 587: void muld(VL vl,DP p1,DP p2,DP *pr)
1.1 noro 588: {
1.2 noro 589: if ( ! do_weyl )
590: comm_muld(vl,p1,p2,pr);
591: else
592: weyl_muld(vl,p1,p2,pr);
593: }
594:
1.19 noro 595: void comm_muld(VL vl,DP p1,DP p2,DP *pr)
1.2 noro 596: {
1.1 noro 597: MP m;
598: DP s,t,u;
1.5 noro 599: int i,l,l1;
600: static MP *w;
601: static int wlen;
1.1 noro 602:
603: if ( !p1 || !p2 )
604: *pr = 0;
605: else if ( OID(p1) <= O_P )
606: muldc(vl,p2,(P)p1,pr);
607: else if ( OID(p2) <= O_P )
608: muldc(vl,p1,(P)p2,pr);
609: else {
1.5 noro 610: for ( m = BDY(p1), l1 = 0; m; m = NEXT(m), l1++ );
1.4 noro 611: for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ );
1.5 noro 612: if ( l1 < l ) {
613: t = p1; p1 = p2; p2 = t;
614: l = l1;
615: }
616: if ( l > wlen ) {
617: if ( w ) GC_free(w);
618: w = (MP *)MALLOC(l*sizeof(MP));
619: wlen = l;
620: }
1.4 noro 621: for ( m = BDY(p2), i = 0; i < l; m = NEXT(m), i++ )
622: w[i] = m;
623: for ( s = 0, i = l-1; i >= 0; i-- ) {
624: muldm(vl,p1,w[i],&t); addd(vl,s,t,&u); s = u;
1.1 noro 625: }
1.5 noro 626: bzero(w,l*sizeof(MP));
1.1 noro 627: *pr = s;
628: }
629: }
630:
1.24 noro 631: /* discard terms which is not a multiple of dl */
632:
633: void comm_muld_trunc(VL vl,DP p1,DP p2,DL dl,DP *pr)
634: {
635: MP m;
636: DP s,t,u;
637: int i,l,l1;
638: static MP *w;
639: static int wlen;
640:
641: if ( !p1 || !p2 )
642: *pr = 0;
643: else if ( OID(p1) <= O_P )
644: muldc_trunc(vl,p2,(P)p1,dl,pr);
645: else if ( OID(p2) <= O_P )
646: muldc_trunc(vl,p1,(P)p2,dl,pr);
647: else {
648: for ( m = BDY(p1), l1 = 0; m; m = NEXT(m), l1++ );
649: for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ );
650: if ( l1 < l ) {
651: t = p1; p1 = p2; p2 = t;
652: l = l1;
653: }
654: if ( l > wlen ) {
655: if ( w ) GC_free(w);
656: w = (MP *)MALLOC(l*sizeof(MP));
657: wlen = l;
658: }
659: for ( m = BDY(p2), i = 0; i < l; m = NEXT(m), i++ )
660: w[i] = m;
661: for ( s = 0, i = l-1; i >= 0; i-- ) {
662: muldm_trunc(vl,p1,w[i],dl,&t); addd(vl,s,t,&u); s = u;
663: }
664: bzero(w,l*sizeof(MP));
665: *pr = s;
666: }
667: }
668:
669: void comm_quod(VL vl,DP p1,DP p2,DP *pr)
670: {
671: MP m,m0;
672: DP s,t;
673: int i,n,sugar;
674: DL d1,d2,d;
675: Q a,b;
676:
677: if ( !p2 )
678: error("comm_quod : invalid input");
679: if ( !p1 )
680: *pr = 0;
681: else {
682: n = NV(p1);
683: d2 = BDY(p2)->dl;
684: m0 = 0;
685: sugar = p1->sugar;
686: while ( p1 ) {
687: d1 = BDY(p1)->dl;
688: NEWDL(d,n);
689: d->td = d1->td - d2->td;
690: for ( i = 0; i < n; i++ )
691: d->d[i] = d1->d[i]-d2->d[i];
692: NEXTMP(m0,m);
693: m->dl = d;
694: divq((Q)BDY(p1)->c,(Q)BDY(p2)->c,&a); chsgnq(a,&b);
695: C(m) = (P)b;
696: muldm_trunc(vl,p2,m,d2,&t);
697: addd(vl,p1,t,&s); p1 = s;
698: C(m) = (P)a;
699: }
700: if ( m0 ) {
701: NEXT(m) = 0; MKDP(n,m0,*pr);
702: } else
703: *pr = 0;
704: /* XXX */
705: if ( *pr )
706: (*pr)->sugar = sugar - d2->td;
707: }
708: }
709:
1.19 noro 710: void muldm(VL vl,DP p,MP m0,DP *pr)
1.1 noro 711: {
712: MP m,mr,mr0;
713: P c;
714: DL d;
715: int n;
716:
717: if ( !p )
718: *pr = 0;
719: else {
720: for ( mr0 = 0, m = BDY(p), c = C(m0), d = m0->dl, n = NV(p);
721: m; m = NEXT(m) ) {
722: NEXTMP(mr0,mr);
723: if ( NUM(C(m)) && RATN(C(m)) && NUM(c) && RATN(c) )
724: mulq((Q)C(m),(Q)c,(Q *)&C(mr));
725: else
726: mulp(vl,C(m),c,&C(mr));
727: adddl(n,m->dl,d,&mr->dl);
728: }
729: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
730: if ( *pr )
731: (*pr)->sugar = p->sugar + m0->dl->td;
1.2 noro 732: }
733: }
734:
1.24 noro 735: void muldm_trunc(VL vl,DP p,MP m0,DL dl,DP *pr)
736: {
737: MP m,mr,mr0;
738: P c;
739: DL d,tdl;
740: int n,i;
741:
742: if ( !p )
743: *pr = 0;
744: else {
745: n = NV(p);
746: NEWDL(tdl,n);
747: for ( mr0 = 0, m = BDY(p), c = C(m0), d = m0->dl;
748: m; m = NEXT(m) ) {
749: _adddl(n,m->dl,d,tdl);
750: for ( i = 0; i < n; i++ )
751: if ( tdl->d[i] < dl->d[i] )
752: break;
753: if ( i < n )
754: continue;
755: NEXTMP(mr0,mr);
756: mr->dl = tdl;
757: NEWDL(tdl,n);
758: if ( NUM(C(m)) && RATN(C(m)) && NUM(c) && RATN(c) )
759: mulq((Q)C(m),(Q)c,(Q *)&C(mr));
760: else
761: mulp(vl,C(m),c,&C(mr));
762: }
763: if ( mr0 ) {
764: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
765: } else
766: *pr = 0;
767: if ( *pr )
768: (*pr)->sugar = p->sugar + m0->dl->td;
769: }
770: }
771:
1.19 noro 772: void weyl_muld(VL vl,DP p1,DP p2,DP *pr)
1.2 noro 773: {
774: MP m;
775: DP s,t,u;
1.4 noro 776: int i,l;
1.5 noro 777: static MP *w;
778: static int wlen;
1.2 noro 779:
780: if ( !p1 || !p2 )
781: *pr = 0;
782: else if ( OID(p1) <= O_P )
783: muldc(vl,p2,(P)p1,pr);
784: else if ( OID(p2) <= O_P )
785: muldc(vl,p1,(P)p2,pr);
786: else {
1.10 noro 787: for ( m = BDY(p1), l = 0; m; m = NEXT(m), l++ );
1.5 noro 788: if ( l > wlen ) {
789: if ( w ) GC_free(w);
790: w = (MP *)MALLOC(l*sizeof(MP));
791: wlen = l;
792: }
1.10 noro 793: for ( m = BDY(p1), i = 0; i < l; m = NEXT(m), i++ )
1.4 noro 794: w[i] = m;
795: for ( s = 0, i = l-1; i >= 0; i-- ) {
1.10 noro 796: weyl_muldm(vl,w[i],p2,&t); addd(vl,s,t,&u); s = u;
1.2 noro 797: }
1.5 noro 798: bzero(w,l*sizeof(MP));
1.2 noro 799: *pr = s;
800: }
801: }
802:
1.10 noro 803: /* monomial * polynomial */
804:
1.19 noro 805: void weyl_muldm(VL vl,MP m0,DP p,DP *pr)
1.2 noro 806: {
807: DP r,t,t1;
808: MP m;
1.10 noro 809: DL d0;
810: int n,n2,l,i,j,tlen;
811: static MP *w,*psum;
812: static struct cdl *tab;
1.5 noro 813: static int wlen;
1.10 noro 814: static int rtlen;
1.2 noro 815:
816: if ( !p )
817: *pr = 0;
818: else {
1.4 noro 819: for ( m = BDY(p), l = 0; m; m = NEXT(m), l++ );
1.5 noro 820: if ( l > wlen ) {
821: if ( w ) GC_free(w);
822: w = (MP *)MALLOC(l*sizeof(MP));
823: wlen = l;
824: }
1.4 noro 825: for ( m = BDY(p), i = 0; i < l; m = NEXT(m), i++ )
826: w[i] = m;
1.10 noro 827:
828: n = NV(p); n2 = n>>1;
829: d0 = m0->dl;
830: for ( i = 0, tlen = 1; i < n2; i++ )
831: tlen *= d0->d[n2+i]+1;
832: if ( tlen > rtlen ) {
833: if ( tab ) GC_free(tab);
834: if ( psum ) GC_free(psum);
835: rtlen = tlen;
836: tab = (struct cdl *)MALLOC(rtlen*sizeof(struct cdl));
837: psum = (MP *)MALLOC(rtlen*sizeof(MP));
838: }
839: bzero(psum,tlen*sizeof(MP));
840: for ( i = l-1; i >= 0; i-- ) {
841: bzero(tab,tlen*sizeof(struct cdl));
842: weyl_mulmm(vl,m0,w[i],n,tab,tlen);
843: for ( j = 0; j < tlen; j++ ) {
844: if ( tab[j].c ) {
845: NEWMP(m); m->dl = tab[j].d; C(m) = tab[j].c; NEXT(m) = psum[j];
846: psum[j] = m;
847: }
848: }
1.2 noro 849: }
1.10 noro 850: for ( j = tlen-1, r = 0; j >= 0; j-- )
851: if ( psum[j] ) {
852: MKDP(n,psum[j],t); addd(vl,r,t,&t1); r = t1;
853: }
1.2 noro 854: if ( r )
855: r->sugar = p->sugar + m0->dl->td;
856: *pr = r;
857: }
858: }
859:
1.10 noro 860: /* m0 = x0^d0*x1^d1*... * dx0^e0*dx1^e1*... */
861: /* rtab : array of length (e0+1)*(e1+1)*... */
1.2 noro 862:
1.19 noro 863: void weyl_mulmm(VL vl,MP m0,MP m1,int n,struct cdl *rtab,int rtablen)
1.2 noro 864: {
1.19 noro 865: P c,c0,c1;
1.10 noro 866: DL d,d0,d1,dt;
867: int i,j,a,b,k,l,n2,s,min,curlen;
868: struct cdl *p;
869: static Q *ctab;
870: static struct cdl *tab;
1.5 noro 871: static int tablen;
1.10 noro 872: static struct cdl *tmptab;
873: static int tmptablen;
1.2 noro 874:
1.10 noro 875:
876: if ( !m0 || !m1 ) {
877: rtab[0].c = 0;
878: rtab[0].d = 0;
879: return;
880: }
881: c0 = C(m0); c1 = C(m1);
882: mulp(vl,c0,c1,&c);
883: d0 = m0->dl; d1 = m1->dl;
884: n2 = n>>1;
885: curlen = 1;
886: NEWDL(d,n);
887: if ( n & 1 )
888: /* offset of h-degree */
889: d->td = d->d[n-1] = d0->d[n-1]+d1->d[n-1];
890: else
891: d->td = 0;
892: rtab[0].c = c;
893: rtab[0].d = d;
894:
895: if ( rtablen > tmptablen ) {
896: if ( tmptab ) GC_free(tmptab);
897: tmptab = (struct cdl *)MALLOC(rtablen*sizeof(struct cdl));
898: tmptablen = rtablen;
899: }
900: for ( i = 0; i < n2; i++ ) {
901: a = d0->d[i]; b = d1->d[n2+i];
902: k = d0->d[n2+i]; l = d1->d[i];
1.20 noro 903:
904: /* degree of xi^a*(Di^k*xi^l)*Di^b */
905: a += l;
906: b += k;
907: s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i);
908:
1.10 noro 909: if ( !k || !l ) {
910: for ( j = 0, p = rtab; j < curlen; j++, p++ ) {
911: if ( p->c ) {
912: dt = p->d;
913: dt->d[i] = a;
914: dt->d[n2+i] = b;
915: dt->td += s;
1.5 noro 916: }
1.10 noro 917: }
918: curlen *= k+1;
919: continue;
920: }
921: if ( k+1 > tablen ) {
922: if ( tab ) GC_free(tab);
923: if ( ctab ) GC_free(ctab);
924: tablen = k+1;
925: tab = (struct cdl *)MALLOC(tablen*sizeof(struct cdl));
926: ctab = (Q *)MALLOC(tablen*sizeof(Q));
927: }
928: /* compute xi^a*(Di^k*xi^l)*Di^b */
929: min = MIN(k,l);
930: mkwc(k,l,ctab);
931: bzero(tab,(k+1)*sizeof(struct cdl));
932: if ( n & 1 )
933: for ( j = 0; j <= min; j++ ) {
934: NEWDL(d,n);
1.20 noro 935: d->d[i] = a-j; d->d[n2+i] = b-j;
1.10 noro 936: d->td = s;
1.20 noro 937: d->d[n-1] = s-(MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i));
1.10 noro 938: tab[j].d = d;
939: tab[j].c = (P)ctab[j];
940: }
941: else
942: for ( j = 0; j <= min; j++ ) {
943: NEWDL(d,n);
1.20 noro 944: d->d[i] = a-j; d->d[n2+i] = b-j;
945: d->td = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i); /* XXX */
1.10 noro 946: tab[j].d = d;
947: tab[j].c = (P)ctab[j];
948: }
949: bzero(ctab,(min+1)*sizeof(Q));
950: comm_muld_tab(vl,n,rtab,curlen,tab,k+1,tmptab);
951: curlen *= k+1;
952: bcopy(tmptab,rtab,curlen*sizeof(struct cdl));
953: }
954: }
955:
956: /* direct product of two cdl tables
957: rt[] = [
958: t[0]*t1[0],...,t[n-1]*t1[0],
959: t[0]*t1[1],...,t[n-1]*t1[1],
960: ...
961: t[0]*t1[n1-1],...,t[n-1]*t1[n1-1]
962: ]
963: */
964:
1.19 noro 965: void comm_muld_tab(VL vl,int nv,struct cdl *t,int n,struct cdl *t1,int n1,struct cdl *rt)
1.10 noro 966: {
967: int i,j;
968: struct cdl *p;
969: P c;
970: DL d;
971:
972: bzero(rt,n*n1*sizeof(struct cdl));
973: for ( j = 0, p = rt; j < n1; j++ ) {
974: c = t1[j].c;
975: d = t1[j].d;
976: if ( !c )
977: break;
978: for ( i = 0; i < n; i++, p++ ) {
979: if ( t[i].c ) {
980: mulp(vl,t[i].c,c,&p->c);
981: adddl(nv,t[i].d,d,&p->d);
982: }
1.6 noro 983: }
1.1 noro 984: }
985: }
986:
1.19 noro 987: void muldc(VL vl,DP p,P c,DP *pr)
1.1 noro 988: {
989: MP m,mr,mr0;
990:
991: if ( !p || !c )
992: *pr = 0;
993: else if ( NUM(c) && UNIQ((Q)c) )
994: *pr = p;
995: else if ( NUM(c) && MUNIQ((Q)c) )
996: chsgnd(p,pr);
997: else {
998: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
999: NEXTMP(mr0,mr);
1000: if ( NUM(C(m)) && RATN(C(m)) && NUM(c) && RATN(c) )
1001: mulq((Q)C(m),(Q)c,(Q *)&C(mr));
1002: else
1003: mulp(vl,C(m),c,&C(mr));
1004: mr->dl = m->dl;
1005: }
1006: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
1007: if ( *pr )
1008: (*pr)->sugar = p->sugar;
1009: }
1.24 noro 1010: }
1011:
1012: void muldc_trunc(VL vl,DP p,P c,DL dl,DP *pr)
1013: {
1014: MP m,mr,mr0;
1015: DL mdl;
1016: int i,n;
1017:
1018: if ( !p || !c ) {
1019: *pr = 0; return;
1020: }
1021: n = NV(p);
1022: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
1023: mdl = m->dl;
1024: for ( i = 0; i < n; i++ )
1025: if ( mdl->d[i] < dl->d[i] )
1026: break;
1027: if ( i < n )
1028: break;
1029: NEXTMP(mr0,mr);
1030: if ( NUM(C(m)) && RATN(C(m)) && NUM(c) && RATN(c) )
1031: mulq((Q)C(m),(Q)c,(Q *)&C(mr));
1032: else
1033: mulp(vl,C(m),c,&C(mr));
1034: mr->dl = m->dl;
1035: }
1036: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
1037: if ( *pr )
1038: (*pr)->sugar = p->sugar;
1.1 noro 1039: }
1040:
1.19 noro 1041: void divsdc(VL vl,DP p,P c,DP *pr)
1.1 noro 1042: {
1043: MP m,mr,mr0;
1044:
1045: if ( !c )
1046: error("disvsdc : division by 0");
1047: else if ( !p )
1048: *pr = 0;
1049: else {
1050: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
1051: NEXTMP(mr0,mr); divsp(vl,C(m),c,&C(mr)); mr->dl = m->dl;
1052: }
1053: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
1054: if ( *pr )
1055: (*pr)->sugar = p->sugar;
1056: }
1057: }
1058:
1.19 noro 1059: void adddl(int n,DL d1,DL d2,DL *dr)
1.1 noro 1060: {
1061: DL dt;
1062: int i;
1063:
1064: if ( !d1->td )
1065: *dr = d2;
1066: else if ( !d2->td )
1067: *dr = d1;
1068: else {
1069: *dr = dt = (DL)MALLOC_ATOMIC((n+1)*sizeof(int));
1070: dt->td = d1->td + d2->td;
1071: for ( i = 0; i < n; i++ )
1072: dt->d[i] = d1->d[i]+d2->d[i];
1073: }
1.11 noro 1074: }
1075:
1076: /* d1 += d2 */
1077:
1.19 noro 1078: void adddl_destructive(int n,DL d1,DL d2)
1.11 noro 1079: {
1080: int i;
1081:
1082: d1->td += d2->td;
1083: for ( i = 0; i < n; i++ )
1084: d1->d[i] += d2->d[i];
1.1 noro 1085: }
1086:
1.19 noro 1087: int compd(VL vl,DP p1,DP p2)
1.1 noro 1088: {
1089: int n,t;
1090: MP m1,m2;
1091:
1092: if ( !p1 )
1093: return p2 ? -1 : 0;
1094: else if ( !p2 )
1095: return 1;
1096: else {
1097: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2);
1098: m1 && m2; m1 = NEXT(m1), m2 = NEXT(m2) )
1099: if ( (t = (*cmpdl)(n,m1->dl,m2->dl)) ||
1100: (t = compp(vl,C(m1),C(m2)) ) )
1101: return t;
1102: if ( m1 )
1103: return 1;
1104: else if ( m2 )
1105: return -1;
1106: else
1107: return 0;
1108: }
1109: }
1110:
1.19 noro 1111: int cmpdl_lex(int n,DL d1,DL d2)
1.1 noro 1112: {
1113: int i;
1114:
1115: for ( i = 0; i < n && d1->d[i] == d2->d[i]; i++ );
1116: return i == n ? 0 : (d1->d[i] > d2->d[i] ? 1 : -1);
1117: }
1118:
1.19 noro 1119: int cmpdl_revlex(int n,DL d1,DL d2)
1.1 noro 1120: {
1121: int i;
1122:
1123: for ( i = n - 1; i >= 0 && d1->d[i] == d2->d[i]; i-- );
1124: return i < 0 ? 0 : (d1->d[i] < d2->d[i] ? 1 : -1);
1125: }
1126:
1.19 noro 1127: int cmpdl_gradlex(int n,DL d1,DL d2)
1.1 noro 1128: {
1129: if ( d1->td > d2->td )
1130: return 1;
1131: else if ( d1->td < d2->td )
1132: return -1;
1133: else
1134: return cmpdl_lex(n,d1,d2);
1135: }
1136:
1.19 noro 1137: int cmpdl_revgradlex(int n,DL d1,DL d2)
1.1 noro 1138: {
1.25 noro 1139: register int i,c;
1.7 noro 1140: register int *p1,*p2;
1141:
1.1 noro 1142: if ( d1->td > d2->td )
1143: return 1;
1144: else if ( d1->td < d2->td )
1145: return -1;
1.7 noro 1146: else {
1.25 noro 1147: i = n-1;
1148: p1 = d1->d+n-1;
1149: p2 = d2->d+n-1;
1150: while ( i >= 7 ) {
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: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1159: i -= 8;
1160: }
1161: switch ( i ) {
1162: case 6:
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: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1170: return 0;
1171: case 5:
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: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1178: return 0;
1179: case 4:
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: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1185: return 0;
1186: case 3:
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: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1191: return 0;
1192: case 2:
1193: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1194: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1195: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1196: return 0;
1197: case 1:
1198: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1199: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1200: return 0;
1201: case 0:
1202: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1203: return 0;
1204: default:
1205: return 0;
1206: }
1207: LAST:
1208: if ( c > 0 ) return -1;
1209: else return 1;
1.7 noro 1210: }
1.1 noro 1211: }
1212:
1.19 noro 1213: int cmpdl_blex(int n,DL d1,DL d2)
1.1 noro 1214: {
1215: int c;
1216:
1217: if ( c = cmpdl_lex(n-1,d1,d2) )
1218: return c;
1219: else {
1220: c = d1->d[n-1] - d2->d[n-1];
1221: return c > 0 ? 1 : c < 0 ? -1 : 0;
1222: }
1223: }
1224:
1.19 noro 1225: int cmpdl_bgradlex(int n,DL d1,DL d2)
1.1 noro 1226: {
1227: int e1,e2,c;
1228:
1229: e1 = d1->td - d1->d[n-1]; e2 = d2->td - d2->d[n-1];
1230: if ( e1 > e2 )
1231: return 1;
1232: else if ( e1 < e2 )
1233: return -1;
1234: else {
1235: c = cmpdl_lex(n-1,d1,d2);
1236: if ( c )
1237: return c;
1238: else
1239: return d1->td > d2->td ? 1 : d1->td < d2->td ? -1 : 0;
1240: }
1241: }
1242:
1.19 noro 1243: int cmpdl_brevgradlex(int n,DL d1,DL d2)
1.1 noro 1244: {
1245: int e1,e2,c;
1246:
1247: e1 = d1->td - d1->d[n-1]; e2 = d2->td - d2->d[n-1];
1248: if ( e1 > e2 )
1249: return 1;
1250: else if ( e1 < e2 )
1251: return -1;
1252: else {
1253: c = cmpdl_revlex(n-1,d1,d2);
1254: if ( c )
1255: return c;
1256: else
1257: return d1->td > d2->td ? 1 : d1->td < d2->td ? -1 : 0;
1258: }
1259: }
1260:
1.19 noro 1261: int cmpdl_brevrev(int n,DL d1,DL d2)
1.1 noro 1262: {
1263: int e1,e2,f1,f2,c,i;
1264:
1265: for ( i = 0, e1 = 0, e2 = 0; i < dp_nelim; i++ ) {
1266: e1 += d1->d[i]; e2 += d2->d[i];
1267: }
1268: f1 = d1->td - e1; f2 = d2->td - e2;
1269: if ( e1 > e2 )
1270: return 1;
1271: else if ( e1 < e2 )
1272: return -1;
1273: else {
1274: c = cmpdl_revlex(dp_nelim,d1,d2);
1275: if ( c )
1276: return c;
1277: else if ( f1 > f2 )
1278: return 1;
1279: else if ( f1 < f2 )
1280: return -1;
1281: else {
1282: for ( i = n - 1; i >= dp_nelim && d1->d[i] == d2->d[i]; i-- );
1283: return i < dp_nelim ? 0 : (d1->d[i] < d2->d[i] ? 1 : -1);
1284: }
1285: }
1286: }
1287:
1.19 noro 1288: int cmpdl_bgradrev(int n,DL d1,DL d2)
1.1 noro 1289: {
1290: int e1,e2,f1,f2,c,i;
1291:
1292: for ( i = 0, e1 = 0, e2 = 0; i < dp_nelim; i++ ) {
1293: e1 += d1->d[i]; e2 += d2->d[i];
1294: }
1295: f1 = d1->td - e1; f2 = d2->td - e2;
1296: if ( e1 > e2 )
1297: return 1;
1298: else if ( e1 < e2 )
1299: return -1;
1300: else {
1301: c = cmpdl_lex(dp_nelim,d1,d2);
1302: if ( c )
1303: return c;
1304: else if ( f1 > f2 )
1305: return 1;
1306: else if ( f1 < f2 )
1307: return -1;
1308: else {
1309: for ( i = n - 1; i >= dp_nelim && d1->d[i] == d2->d[i]; i-- );
1310: return i < dp_nelim ? 0 : (d1->d[i] < d2->d[i] ? 1 : -1);
1311: }
1312: }
1313: }
1314:
1.19 noro 1315: int cmpdl_blexrev(int n,DL d1,DL d2)
1.1 noro 1316: {
1317: int e1,e2,f1,f2,c,i;
1318:
1319: for ( i = 0, e1 = 0, e2 = 0; i < dp_nelim; i++ ) {
1320: e1 += d1->d[i]; e2 += d2->d[i];
1321: }
1322: f1 = d1->td - e1; f2 = d2->td - e2;
1323: c = cmpdl_lex(dp_nelim,d1,d2);
1324: if ( c )
1325: return c;
1326: else if ( f1 > f2 )
1327: return 1;
1328: else if ( f1 < f2 )
1329: return -1;
1330: else {
1331: for ( i = n - 1; i >= dp_nelim && d1->d[i] == d2->d[i]; i-- );
1332: return i < dp_nelim ? 0 : (d1->d[i] < d2->d[i] ? 1 : -1);
1333: }
1334: }
1335:
1.19 noro 1336: int cmpdl_elim(int n,DL d1,DL d2)
1.1 noro 1337: {
1338: int e1,e2,i;
1339:
1340: for ( i = 0, e1 = 0, e2 = 0; i < dp_nelim; i++ ) {
1341: e1 += d1->d[i]; e2 += d2->d[i];
1342: }
1343: if ( e1 > e2 )
1344: return 1;
1345: else if ( e1 < e2 )
1346: return -1;
1347: else
1348: return cmpdl_revgradlex(n,d1,d2);
1.12 noro 1349: }
1350:
1.19 noro 1351: int cmpdl_weyl_elim(int n,DL d1,DL d2)
1.12 noro 1352: {
1353: int e1,e2,i;
1354:
1355: for ( i = 1, e1 = 0, e2 = 0; i <= dp_nelim; i++ ) {
1356: e1 += d1->d[n-i]; e2 += d2->d[n-i];
1357: }
1358: if ( e1 > e2 )
1359: return 1;
1360: else if ( e1 < e2 )
1361: return -1;
1362: else if ( d1->td > d2->td )
1363: return 1;
1364: else if ( d1->td < d2->td )
1365: return -1;
1366: else return -cmpdl_revlex(n,d1,d2);
1.13 noro 1367: }
1368:
1369: /*
1370: a special ordering
1371: 1. total order
1372: 2. (-w,w) for the first 2*m variables
1373: 3. DRL for the first 2*m variables
1374: */
1375:
1.20 noro 1376: extern int *current_weyl_weight_vector;
1.13 noro 1377:
1.19 noro 1378: int cmpdl_homo_ww_drl(int n,DL d1,DL d2)
1.13 noro 1379: {
1380: int e1,e2,m,i;
1381: int *p1,*p2;
1382:
1383: if ( d1->td > d2->td )
1384: return 1;
1385: else if ( d1->td < d2->td )
1386: return -1;
1387:
1388: m = n>>1;
1.21 noro 1389: for ( i = 0, e1 = e2 = 0, p1 = d1->d, p2 = d2->d; i < m; i++ ) {
1390: e1 += current_weyl_weight_vector[i]*(p1[m+i] - p1[i]);
1391: e2 += current_weyl_weight_vector[i]*(p2[m+i] - p2[i]);
1.13 noro 1392: }
1393: if ( e1 > e2 )
1394: return 1;
1395: else if ( e1 < e2 )
1396: return -1;
1397:
1398: e1 = d1->td - d1->d[n-1];
1399: e2 = d2->td - d2->d[n-1];
1400: if ( e1 > e2 )
1401: return 1;
1402: else if ( e1 < e2 )
1403: return -1;
1404:
1405: for ( i= n - 1, p1 = d1->d+n-1, p2 = d2->d+n-1;
1406: i >= 0 && *p1 == *p2; i--, p1--, p2-- );
1407: return i < 0 ? 0 : (*p1 < *p2 ? 1 : -1);
1.21 noro 1408: }
1409:
1410: int cmpdl_drl_zigzag(int n,DL d1,DL d2)
1411: {
1412: int i,t,m;
1413: int *p1,*p2;
1414:
1415: if ( d1->td > d2->td )
1416: return 1;
1417: else if ( d1->td < d2->td )
1418: return -1;
1419: else {
1420: m = n>>1;
1421: for ( i= m - 1, p1 = d1->d, p2 = d2->d; i >= 0; i-- ) {
1422: if ( t = p1[m+i] - p2[m+i] ) return t > 0 ? -1 : 1;
1423: if ( t = p1[i] - p2[i] ) return t > 0 ? -1 : 1;
1424: }
1425: return 0;
1426: }
1427: }
1428:
1429: int cmpdl_homo_ww_drl_zigzag(int n,DL d1,DL d2)
1430: {
1431: int e1,e2,m,i,t;
1432: int *p1,*p2;
1433:
1434: if ( d1->td > d2->td )
1435: return 1;
1436: else if ( d1->td < d2->td )
1437: return -1;
1438:
1439: m = n>>1;
1440: for ( i = 0, e1 = e2 = 0, p1 = d1->d, p2 = d2->d; i < m; i++ ) {
1441: e1 += current_weyl_weight_vector[i]*(p1[m+i] - p1[i]);
1442: e2 += current_weyl_weight_vector[i]*(p2[m+i] - p2[i]);
1443: }
1444: if ( e1 > e2 )
1445: return 1;
1446: else if ( e1 < e2 )
1447: return -1;
1448:
1449: e1 = d1->td - d1->d[n-1];
1450: e2 = d2->td - d2->d[n-1];
1451: if ( e1 > e2 )
1452: return 1;
1453: else if ( e1 < e2 )
1454: return -1;
1455:
1456: for ( i= m - 1, p1 = d1->d, p2 = d2->d; i >= 0; i-- ) {
1457: if ( t = p1[m+i] - p2[m+i] ) return t > 0 ? -1 : 1;
1458: if ( t = p1[i] - p2[i] ) return t > 0 ? -1 : 1;
1459: }
1460: return 0;
1.1 noro 1461: }
1462:
1.19 noro 1463: int cmpdl_order_pair(int n,DL d1,DL d2)
1.1 noro 1464: {
1465: int e1,e2,i,j,l;
1466: int *t1,*t2;
1.20 noro 1467: int len,head;
1.1 noro 1468: struct order_pair *pair;
1469:
1.27 ! noro 1470: len = dp_current_spec->ord.block.length;
! 1471: pair = dp_current_spec->ord.block.order_pair;
1.1 noro 1472:
1.20 noro 1473: head = 0;
1.1 noro 1474: for ( i = 0, t1 = d1->d, t2 = d2->d; i < len; i++ ) {
1475: l = pair[i].length;
1476: switch ( pair[i].order ) {
1477: case 0:
1478: for ( j = 0, e1 = e2 = 0; j < l; j++ ) {
1.20 noro 1479: e1 += MUL_WEIGHT(t1[j],head+j);
1480: e2 += MUL_WEIGHT(t2[j],head+j);
1.1 noro 1481: }
1482: if ( e1 > e2 )
1483: return 1;
1484: else if ( e1 < e2 )
1485: return -1;
1486: else {
1487: for ( j = l - 1; j >= 0 && t1[j] == t2[j]; j-- );
1488: if ( j >= 0 )
1489: return t1[j] < t2[j] ? 1 : -1;
1490: }
1491: break;
1492: case 1:
1493: for ( j = 0, e1 = e2 = 0; j < l; j++ ) {
1.20 noro 1494: e1 += MUL_WEIGHT(t1[j],head+j);
1495: e2 += MUL_WEIGHT(t2[j],head+j);
1.1 noro 1496: }
1497: if ( e1 > e2 )
1498: return 1;
1499: else if ( e1 < e2 )
1500: return -1;
1501: else {
1502: for ( j = 0; j < l && t1[j] == t2[j]; j++ );
1503: if ( j < l )
1504: return t1[j] > t2[j] ? 1 : -1;
1505: }
1506: break;
1507: case 2:
1508: for ( j = 0; j < l && t1[j] == t2[j]; j++ );
1509: if ( j < l )
1510: return t1[j] > t2[j] ? 1 : -1;
1511: break;
1512: default:
1513: error("cmpdl_order_pair : invalid order"); break;
1514: }
1.20 noro 1515: t1 += l; t2 += l; head += l;
1.1 noro 1516: }
1517: return 0;
1518: }
1519:
1.19 noro 1520: int cmpdl_matrix(int n,DL d1,DL d2)
1.1 noro 1521: {
1522: int *v,*w,*t1,*t2;
1523: int s,i,j,len;
1524: int **matrix;
1525:
1526: for ( i = 0, t1 = d1->d, t2 = d2->d, w = dp_dl_work; i < n; i++ )
1527: w[i] = t1[i]-t2[i];
1.27 ! noro 1528: len = dp_current_spec->ord.matrix.row;
! 1529: matrix = dp_current_spec->ord.matrix.matrix;
1.1 noro 1530: for ( j = 0; j < len; j++ ) {
1531: v = matrix[j];
1532: for ( i = 0, s = 0; i < n; i++ )
1533: s += v[i]*w[i];
1534: if ( s > 0 )
1535: return 1;
1536: else if ( s < 0 )
1537: return -1;
1538: }
1539: return 0;
1.25 noro 1540: }
1541:
1542: GeoBucket create_bucket()
1543: {
1544: GeoBucket g;
1545:
1546: g = CALLOC(1,sizeof(struct oGeoBucket));
1547: g->m = 32;
1548: return g;
1549: }
1550:
1551: void add_bucket(GeoBucket g,NODE d,int nv)
1552: {
1553: int l,k,m;
1554:
1555: l = length(d);
1556: for ( k = 0, m = 1; l > m; k++, m <<= 1 );
1557: /* 2^(k-1) < l <= 2^k */
1558: d = symb_merge(g->body[k],d,nv);
1559: for ( ; length(d) > (1<<(k)); k++ ) {
1560: g->body[k] = 0;
1561: d = symb_merge(g->body[k+1],d,nv);
1562: }
1563: g->body[k] = d;
1564: g->m = MAX(g->m,k);
1565: }
1566:
1567: DL remove_head_bucket(GeoBucket g,int nv)
1568: {
1569: int j,i,c,m;
1570: DL d;
1571:
1572: j = -1;
1573: m = g->m;
1574: for ( i = 0; i <= m; i++ ) {
1575: if ( !g->body[i] )
1576: continue;
1577: if ( j < 0 ) j = i;
1578: else {
1579: c = (*cmpdl)(nv,g->body[i]->body,g->body[j]->body);
1580: if ( c > 0 )
1581: j = i;
1582: else if ( c == 0 )
1583: g->body[i] = NEXT(g->body[i]);
1584: }
1585: }
1586: if ( j < 0 )
1587: return 0;
1588: else {
1589: d = g->body[j]->body;
1590: g->body[j] = NEXT(g->body[j]);
1591: return d;
1592: }
1.1 noro 1593: }