![[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.32 ! ohara 48: * $OpenXM: OpenXM_contrib2/asir2000/engine/dist.c,v 1.31 2004/05/14 06:02:54 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.31 noro 76: struct modorder_spec *dp_current_modspec;
1.1 noro 77: int *dp_dl_work;
78:
1.24 noro 79: void comm_muld_trunc(VL vl,DP p1,DP p2,DL dl,DP *pr);
80: void comm_quod(VL vl,DP p1,DP p2,DP *pr);
81: void muldm_trunc(VL vl,DP p,MP m0,DL dl,DP *pr);
82: void muldc_trunc(VL vl,DP p,P c,DL dl,DP *pr);
1.29 noro 83:
84: void order_init()
85: {
86: struct order_spec *spec;
87:
88: create_order_spec(0,0,&spec);
89: initd(spec);
1.31 noro 90: create_modorder_spec(0,0,&dp_current_modspec);
1.29 noro 91: }
1.24 noro 92:
1.22 noro 93: int has_sfcoef(DP f)
1.1 noro 94: {
95: MP t;
96:
97: if ( !f )
98: return 0;
99: for ( t = BDY(f); t; t = NEXT(t) )
1.22 noro 100: if ( has_sfcoef_p(t->c) )
1.1 noro 101: break;
102: return t ? 1 : 0;
103: }
104:
1.22 noro 105: int has_sfcoef_p(P f)
1.1 noro 106: {
107: DCP dc;
108:
109: if ( !f )
110: return 0;
111: else if ( NUM(f) )
1.22 noro 112: return (NID((Num)f) == N_GFS) ? 1 : 0;
1.1 noro 113: else {
114: for ( dc = DC(f); dc; dc = NEXT(dc) )
1.22 noro 115: if ( has_sfcoef_p(COEF(dc)) )
1.1 noro 116: return 1;
117: return 0;
118: }
119: }
120:
1.19 noro 121: void initd(struct order_spec *spec)
1.1 noro 122: {
123: switch ( spec->id ) {
1.28 noro 124: case 3:
125: cmpdl = cmpdl_composite;
126: dp_dl_work = (int *)MALLOC_ATOMIC(spec->nv*sizeof(int));
127: break;
1.1 noro 128: case 2:
129: cmpdl = cmpdl_matrix;
130: dp_dl_work = (int *)MALLOC_ATOMIC(spec->nv*sizeof(int));
131: break;
132: case 1:
133: cmpdl = cmpdl_order_pair;
134: break;
135: default:
136: switch ( spec->ord.simple ) {
137: case ORD_REVGRADLEX:
138: cmpdl = cmpdl_revgradlex; break;
139: case ORD_GRADLEX:
140: cmpdl = cmpdl_gradlex; break;
141: case ORD_BREVGRADLEX:
142: cmpdl = cmpdl_brevgradlex; break;
143: case ORD_BGRADLEX:
144: cmpdl = cmpdl_bgradlex; break;
145: case ORD_BLEX:
146: cmpdl = cmpdl_blex; break;
147: case ORD_BREVREV:
148: cmpdl = cmpdl_brevrev; break;
149: case ORD_BGRADREV:
150: cmpdl = cmpdl_bgradrev; break;
151: case ORD_BLEXREV:
152: cmpdl = cmpdl_blexrev; break;
153: case ORD_ELIM:
154: cmpdl = cmpdl_elim; break;
1.12 noro 155: case ORD_WEYL_ELIM:
156: cmpdl = cmpdl_weyl_elim; break;
1.13 noro 157: case ORD_HOMO_WW_DRL:
158: cmpdl = cmpdl_homo_ww_drl; break;
1.21 noro 159: case ORD_DRL_ZIGZAG:
160: cmpdl = cmpdl_drl_zigzag; break;
161: case ORD_HOMO_WW_DRL_ZIGZAG:
162: cmpdl = cmpdl_homo_ww_drl_zigzag; break;
1.1 noro 163: case ORD_LEX: default:
164: cmpdl = cmpdl_lex; break;
165: }
166: break;
167: }
1.27 noro 168: dp_current_spec = spec;
1.1 noro 169: }
170:
1.19 noro 171: void ptod(VL vl,VL dvl,P p,DP *pr)
1.1 noro 172: {
173: int isconst = 0;
1.16 noro 174: int n,i,j,k;
1.1 noro 175: VL tvl;
176: V v;
177: DL d;
178: MP m;
179: DCP dc;
1.16 noro 180: DCP *w;
1.1 noro 181: DP r,s,t,u;
182: P x,c;
183:
184: if ( !p )
185: *pr = 0;
186: else {
187: for ( n = 0, tvl = dvl; tvl; tvl = NEXT(tvl), n++ );
188: if ( NUM(p) ) {
189: NEWDL(d,n);
190: NEWMP(m); m->dl = d; C(m) = p; NEXT(m) = 0; MKDP(n,m,*pr); (*pr)->sugar = 0;
191: } else {
192: for ( i = 0, tvl = dvl, v = VR(p);
193: tvl && tvl->v != v; tvl = NEXT(tvl), i++ );
194: if ( !tvl ) {
1.16 noro 195: for ( dc = DC(p), k = 0; dc; dc = NEXT(dc), k++ );
196: w = (DCP *)ALLOCA(k*sizeof(DCP));
197: for ( dc = DC(p), j = 0; j < k; dc = NEXT(dc), j++ )
198: w[j] = dc;
199:
200: for ( j = k-1, s = 0, MKV(v,x); j >= 0; j-- ) {
201: ptod(vl,dvl,COEF(w[j]),&t); pwrp(vl,x,DEG(w[j]),&c);
1.1 noro 202: muldc(vl,t,c,&r); addd(vl,r,s,&t); s = t;
203: }
204: *pr = s;
205: } else {
1.16 noro 206: for ( dc = DC(p), k = 0; dc; dc = NEXT(dc), k++ );
207: w = (DCP *)ALLOCA(k*sizeof(DCP));
208: for ( dc = DC(p), j = 0; j < k; dc = NEXT(dc), j++ )
209: w[j] = dc;
210:
211: for ( j = k-1, s = 0; j >= 0; j-- ) {
212: ptod(vl,dvl,COEF(w[j]),&t);
1.20 noro 213: NEWDL(d,n); d->d[i] = QTOS(DEG(w[j]));
214: d->td = MUL_WEIGHT(d->d[i],i);
1.1 noro 215: NEWMP(m); m->dl = d; C(m) = (P)ONE; NEXT(m) = 0; MKDP(n,m,u); u->sugar = d->td;
1.2 noro 216: comm_muld(vl,t,u,&r); addd(vl,r,s,&t); s = t;
1.1 noro 217: }
218: *pr = s;
219: }
220: }
221: }
1.17 noro 222: #if 0
1.22 noro 223: if ( !dp_fcoeffs && has_sfcoef(*pr) )
224: dp_fcoeffs = N_GFS;
1.17 noro 225: #endif
1.1 noro 226: }
227:
1.19 noro 228: void dtop(VL vl,VL dvl,DP p,P *pr)
1.1 noro 229: {
1.16 noro 230: int n,i,j,k;
1.1 noro 231: DL d;
232: MP m;
1.16 noro 233: MP *a;
1.1 noro 234: P r,s,t,u,w;
235: Q q;
236: VL tvl;
237:
238: if ( !p )
239: *pr = 0;
240: else {
1.16 noro 241: for ( k = 0, m = BDY(p); m; m = NEXT(m), k++ );
242: a = (MP *)ALLOCA(k*sizeof(MP));
243: for ( j = 0, m = BDY(p); j < k; m = NEXT(m), j++ )
244: a[j] = m;
245:
246: for ( n = p->nv, j = k-1, s = 0; j >= 0; j-- ) {
247: m = a[j];
1.1 noro 248: t = C(m);
249: if ( NUM(t) && NID((Num)t) == N_M ) {
250: mptop(t,&u); t = u;
251: }
252: for ( i = 0, d = m->dl, tvl = dvl;
253: i < n; tvl = NEXT(tvl), i++ ) {
254: MKV(tvl->v,r); STOQ(d->d[i],q); pwrp(vl,r,q,&u);
255: mulp(vl,t,u,&w); t = w;
256: }
257: addp(vl,s,t,&u); s = u;
258: }
259: *pr = s;
260: }
261: }
262:
1.19 noro 263: void nodetod(NODE node,DP *dp)
1.1 noro 264: {
265: NODE t;
266: int len,i,td;
267: Q e;
268: DL d;
269: MP m;
270: DP u;
271:
272: for ( t = node, len = 0; t; t = NEXT(t), len++ );
273: NEWDL(d,len);
274: for ( t = node, i = 0, td = 0; i < len; t = NEXT(t), i++ ) {
275: e = (Q)BDY(t);
276: if ( !e )
277: d->d[i] = 0;
278: else if ( !NUM(e) || !RATN(e) || !INT(e) )
279: error("nodetod : invalid input");
280: else {
1.20 noro 281: d->d[i] = QTOS((Q)e); td += MUL_WEIGHT(d->d[i],i);
1.1 noro 282: }
283: }
284: d->td = td;
285: NEWMP(m); m->dl = d; C(m) = (P)ONE; NEXT(m) = 0;
286: MKDP(len,m,u); u->sugar = td; *dp = u;
287: }
288:
1.19 noro 289: int sugard(MP m)
1.1 noro 290: {
291: int s;
292:
293: for ( s = 0; m; m = NEXT(m) )
294: s = MAX(s,m->dl->td);
295: return s;
296: }
297:
1.19 noro 298: void addd(VL vl,DP p1,DP p2,DP *pr)
1.1 noro 299: {
300: int n;
301: MP m1,m2,mr,mr0;
302: P t;
1.30 ohara 303: DL d;
1.1 noro 304:
305: if ( !p1 )
306: *pr = p2;
307: else if ( !p2 )
308: *pr = p1;
309: else {
1.30 ohara 310: if ( OID(p1) <= O_R ) {
311: n = NV(p2); NEWDL(d,n);
1.31 noro 312: NEWMP(m1); m1->dl = d; C(m1) = (P)p1; NEXT(m1) = 0;
1.30 ohara 313: MKDP(n,m1,p1); (p1)->sugar = 0;
314: }
315: if ( OID(p2) <= O_R ) {
316: n = NV(p1); NEWDL(d,n);
1.31 noro 317: NEWMP(m2); m2->dl = d; C(m2) = (P)p2; NEXT(m2) = 0;
1.30 ohara 318: MKDP(n,m2,p2); (p2)->sugar = 0;
319: }
1.1 noro 320: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; )
321: switch ( (*cmpdl)(n,m1->dl,m2->dl) ) {
322: case 0:
323: addp(vl,C(m1),C(m2),&t);
324: if ( t ) {
325: NEXTMP(mr0,mr); mr->dl = m1->dl; C(mr) = t;
326: }
327: m1 = NEXT(m1); m2 = NEXT(m2); break;
328: case 1:
329: NEXTMP(mr0,mr); mr->dl = m1->dl; C(mr) = C(m1);
330: m1 = NEXT(m1); break;
331: case -1:
332: NEXTMP(mr0,mr); mr->dl = m2->dl; C(mr) = C(m2);
333: m2 = NEXT(m2); break;
334: }
335: if ( !mr0 )
336: if ( m1 )
337: mr0 = m1;
338: else if ( m2 )
339: mr0 = m2;
340: else {
341: *pr = 0;
342: return;
343: }
344: else if ( m1 )
345: NEXT(mr) = m1;
346: else if ( m2 )
347: NEXT(mr) = m2;
348: else
349: NEXT(mr) = 0;
350: MKDP(NV(p1),mr0,*pr);
351: if ( *pr )
352: (*pr)->sugar = MAX(p1->sugar,p2->sugar);
353: }
354: }
355:
356: /* for F4 symbolic reduction */
357:
1.19 noro 358: void symb_addd(DP p1,DP p2,DP *pr)
1.1 noro 359: {
360: int n;
361: MP m1,m2,mr,mr0;
362:
363: if ( !p1 )
364: *pr = p2;
365: else if ( !p2 )
366: *pr = p1;
367: else {
368: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
369: NEXTMP(mr0,mr); C(mr) = (P)ONE;
370: switch ( (*cmpdl)(n,m1->dl,m2->dl) ) {
371: case 0:
372: mr->dl = m1->dl;
373: m1 = NEXT(m1); m2 = NEXT(m2); break;
374: case 1:
375: mr->dl = m1->dl;
376: m1 = NEXT(m1); break;
377: case -1:
378: mr->dl = m2->dl;
379: m2 = NEXT(m2); break;
380: }
381: }
382: if ( !mr0 )
383: if ( m1 )
384: mr0 = m1;
385: else if ( m2 )
386: mr0 = m2;
387: else {
388: *pr = 0;
389: return;
390: }
391: else if ( m1 )
392: NEXT(mr) = m1;
393: else if ( m2 )
394: NEXT(mr) = m2;
395: else
396: NEXT(mr) = 0;
397: MKDP(NV(p1),mr0,*pr);
398: if ( *pr )
399: (*pr)->sugar = MAX(p1->sugar,p2->sugar);
1.3 noro 400: }
401: }
402:
403: /*
404: * destructive merge of two list
405: *
406: * p1, p2 : list of DL
407: * return : a merged list
408: */
409:
1.19 noro 410: NODE symb_merge(NODE m1,NODE m2,int n)
1.3 noro 411: {
412: NODE top,prev,cur,m,t;
1.25 noro 413: int c,i;
414: DL d1,d2;
1.3 noro 415:
416: if ( !m1 )
417: return m2;
418: else if ( !m2 )
419: return m1;
420: else {
421: switch ( (*cmpdl)(n,(DL)BDY(m1),(DL)BDY(m2)) ) {
422: case 0:
423: top = m1; m = NEXT(m2);
424: break;
425: case 1:
426: top = m1; m = m2;
427: break;
428: case -1:
429: top = m2; m = m1;
430: break;
431: }
432: prev = top; cur = NEXT(top);
433: /* BDY(prev) > BDY(m) always holds */
434: while ( cur && m ) {
1.25 noro 435: d1 = (DL)BDY(cur);
436: d2 = (DL)BDY(m);
1.26 noro 437: #if 1
438: switch ( (*cmpdl)(n,(DL)BDY(cur),(DL)BDY(m)) ) {
439: #else
440: /* XXX only valid for DRL */
1.25 noro 441: if ( d1->td > d2->td )
442: c = 1;
443: else if ( d1->td < d2->td )
444: c = -1;
445: else {
446: for ( i = n-1; i >= 0 && d1->d[i] == d2->d[i]; i-- );
447: if ( i < 0 )
448: c = 0;
449: else if ( d1->d[i] < d2->d[i] )
450: c = 1;
451: else
452: c = -1;
453: }
454: switch ( c ) {
455: #endif
1.3 noro 456: case 0:
457: m = NEXT(m);
458: prev = cur; cur = NEXT(cur);
459: break;
460: case 1:
461: t = NEXT(cur); NEXT(cur) = m; m = t;
462: prev = cur; cur = NEXT(cur);
463: break;
464: case -1:
465: NEXT(prev) = m; m = cur;
466: prev = NEXT(prev); cur = NEXT(prev);
467: break;
1.18 noro 468: }
469: }
470: if ( !cur )
471: NEXT(prev) = m;
1.23 noro 472: return top;
473: }
474: }
475:
476: void _adddl(int n,DL d1,DL d2,DL d3)
477: {
478: int i;
479:
480: d3->td = d1->td+d2->td;
481: for ( i = 0; i < n; i++ )
482: d3->d[i] = d1->d[i]+d2->d[i];
483: }
484:
485: /* m1 <- m1 U dl*f, destructive */
486:
487: NODE mul_dllist(DL dl,DP f);
488:
489: NODE symb_mul_merge(NODE m1,DL dl,DP f,int n)
490: {
491: NODE top,prev,cur,n1;
492: DP g;
493: DL t,s;
494: MP m;
495:
496: if ( !m1 )
497: return mul_dllist(dl,f);
498: else if ( !f )
499: return m1;
500: else {
501: m = BDY(f);
502: NEWDL_NOINIT(t,n);
503: _adddl(n,m->dl,dl,t);
504: top = m1; prev = 0; cur = m1;
505: while ( m ) {
506: switch ( (*cmpdl)(n,(DL)BDY(cur),t) ) {
507: case 0:
508: prev = cur; cur = NEXT(cur);
509: if ( !cur ) {
510: MKDP(n,m,g);
511: NEXT(prev) = mul_dllist(dl,g);
512: return;
513: }
514: m = NEXT(m);
515: if ( m ) _adddl(n,m->dl,dl,t);
516: break;
517: case 1:
518: prev = cur; cur = NEXT(cur);
519: if ( !cur ) {
520: MKDP(n,m,g);
521: NEXT(prev) = mul_dllist(dl,g);
522: return;
523: }
524: break;
525: case -1:
526: NEWDL_NOINIT(s,n);
527: s->td = t->td;
528: bcopy(t->d,s->d,n*sizeof(int));
529: NEWNODE(n1);
530: n1->body = (pointer)s;
531: NEXT(n1) = cur;
532: if ( !prev ) {
533: top = n1; cur = n1;
534: } else {
535: NEXT(prev) = n1; prev = n1;
536: }
537: m = NEXT(m);
538: if ( m ) _adddl(n,m->dl,dl,t);
539: break;
540: }
541: }
1.18 noro 542: return top;
543: }
544: }
545:
1.19 noro 546: DLBUCKET symb_merge_bucket(DLBUCKET m1,DLBUCKET m2,int n)
1.18 noro 547: {
548: DLBUCKET top,prev,cur,m,t;
549:
550: if ( !m1 )
551: return m2;
552: else if ( !m2 )
553: return m1;
554: else {
555: if ( m1->td == m2->td ) {
556: top = m1;
557: BDY(top) = symb_merge(BDY(top),BDY(m2),n);
558: m = NEXT(m2);
559: } else if ( m1->td > m2->td ) {
560: top = m1; m = m2;
561: } else {
562: top = m2; m = m1;
563: }
564: prev = top; cur = NEXT(top);
565: /* prev->td > m->td always holds */
566: while ( cur && m ) {
567: if ( cur->td == m->td ) {
568: BDY(cur) = symb_merge(BDY(cur),BDY(m),n);
569: m = NEXT(m);
570: prev = cur; cur = NEXT(cur);
571: } else if ( cur->td > m->td ) {
572: t = NEXT(cur); NEXT(cur) = m; m = t;
573: prev = cur; cur = NEXT(cur);
574: } else {
575: NEXT(prev) = m; m = cur;
576: prev = NEXT(prev); cur = NEXT(prev);
1.3 noro 577: }
578: }
579: if ( !cur )
580: NEXT(prev) = m;
581: return top;
1.1 noro 582: }
583: }
584:
1.19 noro 585: void subd(VL vl,DP p1,DP p2,DP *pr)
1.1 noro 586: {
587: DP t;
588:
589: if ( !p2 )
590: *pr = p1;
591: else {
592: chsgnd(p2,&t); addd(vl,p1,t,pr);
593: }
594: }
595:
1.19 noro 596: void chsgnd(DP p,DP *pr)
1.1 noro 597: {
598: MP m,mr,mr0;
599:
600: if ( !p )
601: *pr = 0;
1.32 ! ohara 602: else if ( OID(p) <= O_R )
! 603: chsgnr(p,pr);
1.1 noro 604: else {
605: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
606: NEXTMP(mr0,mr); chsgnp(C(m),&C(mr)); mr->dl = m->dl;
607: }
608: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
609: if ( *pr )
610: (*pr)->sugar = p->sugar;
611: }
612: }
613:
1.19 noro 614: void muld(VL vl,DP p1,DP p2,DP *pr)
1.1 noro 615: {
1.2 noro 616: if ( ! do_weyl )
617: comm_muld(vl,p1,p2,pr);
618: else
619: weyl_muld(vl,p1,p2,pr);
620: }
621:
1.19 noro 622: void comm_muld(VL vl,DP p1,DP p2,DP *pr)
1.2 noro 623: {
1.1 noro 624: MP m;
625: DP s,t,u;
1.5 noro 626: int i,l,l1;
627: static MP *w;
628: static int wlen;
1.1 noro 629:
630: if ( !p1 || !p2 )
631: *pr = 0;
632: else if ( OID(p1) <= O_P )
633: muldc(vl,p2,(P)p1,pr);
634: else if ( OID(p2) <= O_P )
635: muldc(vl,p1,(P)p2,pr);
636: else {
1.5 noro 637: for ( m = BDY(p1), l1 = 0; m; m = NEXT(m), l1++ );
1.4 noro 638: for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ );
1.5 noro 639: if ( l1 < l ) {
640: t = p1; p1 = p2; p2 = t;
641: l = l1;
642: }
643: if ( l > wlen ) {
644: if ( w ) GC_free(w);
645: w = (MP *)MALLOC(l*sizeof(MP));
646: wlen = l;
647: }
1.4 noro 648: for ( m = BDY(p2), i = 0; i < l; m = NEXT(m), i++ )
649: w[i] = m;
650: for ( s = 0, i = l-1; i >= 0; i-- ) {
651: muldm(vl,p1,w[i],&t); addd(vl,s,t,&u); s = u;
1.1 noro 652: }
1.5 noro 653: bzero(w,l*sizeof(MP));
1.1 noro 654: *pr = s;
655: }
656: }
657:
1.24 noro 658: /* discard terms which is not a multiple of dl */
659:
660: void comm_muld_trunc(VL vl,DP p1,DP p2,DL dl,DP *pr)
661: {
662: MP m;
663: DP s,t,u;
664: int i,l,l1;
665: static MP *w;
666: static int wlen;
667:
668: if ( !p1 || !p2 )
669: *pr = 0;
670: else if ( OID(p1) <= O_P )
671: muldc_trunc(vl,p2,(P)p1,dl,pr);
672: else if ( OID(p2) <= O_P )
673: muldc_trunc(vl,p1,(P)p2,dl,pr);
674: else {
675: for ( m = BDY(p1), l1 = 0; m; m = NEXT(m), l1++ );
676: for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ );
677: if ( l1 < l ) {
678: t = p1; p1 = p2; p2 = t;
679: l = l1;
680: }
681: if ( l > wlen ) {
682: if ( w ) GC_free(w);
683: w = (MP *)MALLOC(l*sizeof(MP));
684: wlen = l;
685: }
686: for ( m = BDY(p2), i = 0; i < l; m = NEXT(m), i++ )
687: w[i] = m;
688: for ( s = 0, i = l-1; i >= 0; i-- ) {
689: muldm_trunc(vl,p1,w[i],dl,&t); addd(vl,s,t,&u); s = u;
690: }
691: bzero(w,l*sizeof(MP));
692: *pr = s;
693: }
694: }
695:
696: void comm_quod(VL vl,DP p1,DP p2,DP *pr)
697: {
698: MP m,m0;
699: DP s,t;
700: int i,n,sugar;
701: DL d1,d2,d;
702: Q a,b;
703:
704: if ( !p2 )
705: error("comm_quod : invalid input");
706: if ( !p1 )
707: *pr = 0;
708: else {
709: n = NV(p1);
710: d2 = BDY(p2)->dl;
711: m0 = 0;
712: sugar = p1->sugar;
713: while ( p1 ) {
714: d1 = BDY(p1)->dl;
715: NEWDL(d,n);
716: d->td = d1->td - d2->td;
717: for ( i = 0; i < n; i++ )
718: d->d[i] = d1->d[i]-d2->d[i];
719: NEXTMP(m0,m);
720: m->dl = d;
721: divq((Q)BDY(p1)->c,(Q)BDY(p2)->c,&a); chsgnq(a,&b);
722: C(m) = (P)b;
723: muldm_trunc(vl,p2,m,d2,&t);
724: addd(vl,p1,t,&s); p1 = s;
725: C(m) = (P)a;
726: }
727: if ( m0 ) {
728: NEXT(m) = 0; MKDP(n,m0,*pr);
729: } else
730: *pr = 0;
731: /* XXX */
732: if ( *pr )
733: (*pr)->sugar = sugar - d2->td;
734: }
735: }
736:
1.19 noro 737: void muldm(VL vl,DP p,MP m0,DP *pr)
1.1 noro 738: {
739: MP m,mr,mr0;
740: P c;
741: DL d;
742: int n;
743:
744: if ( !p )
745: *pr = 0;
746: else {
747: for ( mr0 = 0, m = BDY(p), c = C(m0), d = m0->dl, n = NV(p);
748: m; m = NEXT(m) ) {
749: NEXTMP(mr0,mr);
750: if ( NUM(C(m)) && RATN(C(m)) && NUM(c) && RATN(c) )
751: mulq((Q)C(m),(Q)c,(Q *)&C(mr));
752: else
753: mulp(vl,C(m),c,&C(mr));
754: adddl(n,m->dl,d,&mr->dl);
755: }
756: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
757: if ( *pr )
758: (*pr)->sugar = p->sugar + m0->dl->td;
1.2 noro 759: }
760: }
761:
1.24 noro 762: void muldm_trunc(VL vl,DP p,MP m0,DL dl,DP *pr)
763: {
764: MP m,mr,mr0;
765: P c;
766: DL d,tdl;
767: int n,i;
768:
769: if ( !p )
770: *pr = 0;
771: else {
772: n = NV(p);
773: NEWDL(tdl,n);
774: for ( mr0 = 0, m = BDY(p), c = C(m0), d = m0->dl;
775: m; m = NEXT(m) ) {
776: _adddl(n,m->dl,d,tdl);
777: for ( i = 0; i < n; i++ )
778: if ( tdl->d[i] < dl->d[i] )
779: break;
780: if ( i < n )
781: continue;
782: NEXTMP(mr0,mr);
783: mr->dl = tdl;
784: NEWDL(tdl,n);
785: if ( NUM(C(m)) && RATN(C(m)) && NUM(c) && RATN(c) )
786: mulq((Q)C(m),(Q)c,(Q *)&C(mr));
787: else
788: mulp(vl,C(m),c,&C(mr));
789: }
790: if ( mr0 ) {
791: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
792: } else
793: *pr = 0;
794: if ( *pr )
795: (*pr)->sugar = p->sugar + m0->dl->td;
796: }
797: }
798:
1.19 noro 799: void weyl_muld(VL vl,DP p1,DP p2,DP *pr)
1.2 noro 800: {
801: MP m;
802: DP s,t,u;
1.4 noro 803: int i,l;
1.5 noro 804: static MP *w;
805: static int wlen;
1.2 noro 806:
807: if ( !p1 || !p2 )
808: *pr = 0;
809: else if ( OID(p1) <= O_P )
810: muldc(vl,p2,(P)p1,pr);
811: else if ( OID(p2) <= O_P )
812: muldc(vl,p1,(P)p2,pr);
813: else {
1.10 noro 814: for ( m = BDY(p1), l = 0; m; m = NEXT(m), l++ );
1.5 noro 815: if ( l > wlen ) {
816: if ( w ) GC_free(w);
817: w = (MP *)MALLOC(l*sizeof(MP));
818: wlen = l;
819: }
1.10 noro 820: for ( m = BDY(p1), i = 0; i < l; m = NEXT(m), i++ )
1.4 noro 821: w[i] = m;
822: for ( s = 0, i = l-1; i >= 0; i-- ) {
1.10 noro 823: weyl_muldm(vl,w[i],p2,&t); addd(vl,s,t,&u); s = u;
1.2 noro 824: }
1.5 noro 825: bzero(w,l*sizeof(MP));
1.2 noro 826: *pr = s;
827: }
828: }
829:
1.10 noro 830: /* monomial * polynomial */
831:
1.19 noro 832: void weyl_muldm(VL vl,MP m0,DP p,DP *pr)
1.2 noro 833: {
834: DP r,t,t1;
835: MP m;
1.10 noro 836: DL d0;
837: int n,n2,l,i,j,tlen;
838: static MP *w,*psum;
839: static struct cdl *tab;
1.5 noro 840: static int wlen;
1.10 noro 841: static int rtlen;
1.2 noro 842:
843: if ( !p )
844: *pr = 0;
845: else {
1.4 noro 846: for ( m = BDY(p), l = 0; m; m = NEXT(m), l++ );
1.5 noro 847: if ( l > wlen ) {
848: if ( w ) GC_free(w);
849: w = (MP *)MALLOC(l*sizeof(MP));
850: wlen = l;
851: }
1.4 noro 852: for ( m = BDY(p), i = 0; i < l; m = NEXT(m), i++ )
853: w[i] = m;
1.10 noro 854:
855: n = NV(p); n2 = n>>1;
856: d0 = m0->dl;
857: for ( i = 0, tlen = 1; i < n2; i++ )
858: tlen *= d0->d[n2+i]+1;
859: if ( tlen > rtlen ) {
860: if ( tab ) GC_free(tab);
861: if ( psum ) GC_free(psum);
862: rtlen = tlen;
863: tab = (struct cdl *)MALLOC(rtlen*sizeof(struct cdl));
864: psum = (MP *)MALLOC(rtlen*sizeof(MP));
865: }
866: bzero(psum,tlen*sizeof(MP));
867: for ( i = l-1; i >= 0; i-- ) {
868: bzero(tab,tlen*sizeof(struct cdl));
869: weyl_mulmm(vl,m0,w[i],n,tab,tlen);
870: for ( j = 0; j < tlen; j++ ) {
871: if ( tab[j].c ) {
872: NEWMP(m); m->dl = tab[j].d; C(m) = tab[j].c; NEXT(m) = psum[j];
873: psum[j] = m;
874: }
875: }
1.2 noro 876: }
1.10 noro 877: for ( j = tlen-1, r = 0; j >= 0; j-- )
878: if ( psum[j] ) {
879: MKDP(n,psum[j],t); addd(vl,r,t,&t1); r = t1;
880: }
1.2 noro 881: if ( r )
882: r->sugar = p->sugar + m0->dl->td;
883: *pr = r;
884: }
885: }
886:
1.10 noro 887: /* m0 = x0^d0*x1^d1*... * dx0^e0*dx1^e1*... */
888: /* rtab : array of length (e0+1)*(e1+1)*... */
1.2 noro 889:
1.19 noro 890: void weyl_mulmm(VL vl,MP m0,MP m1,int n,struct cdl *rtab,int rtablen)
1.2 noro 891: {
1.19 noro 892: P c,c0,c1;
1.10 noro 893: DL d,d0,d1,dt;
894: int i,j,a,b,k,l,n2,s,min,curlen;
895: struct cdl *p;
896: static Q *ctab;
897: static struct cdl *tab;
1.5 noro 898: static int tablen;
1.10 noro 899: static struct cdl *tmptab;
900: static int tmptablen;
1.2 noro 901:
1.10 noro 902:
903: if ( !m0 || !m1 ) {
904: rtab[0].c = 0;
905: rtab[0].d = 0;
906: return;
907: }
908: c0 = C(m0); c1 = C(m1);
909: mulp(vl,c0,c1,&c);
910: d0 = m0->dl; d1 = m1->dl;
911: n2 = n>>1;
912: curlen = 1;
913: NEWDL(d,n);
914: if ( n & 1 )
915: /* offset of h-degree */
916: d->td = d->d[n-1] = d0->d[n-1]+d1->d[n-1];
917: else
918: d->td = 0;
919: rtab[0].c = c;
920: rtab[0].d = d;
921:
922: if ( rtablen > tmptablen ) {
923: if ( tmptab ) GC_free(tmptab);
924: tmptab = (struct cdl *)MALLOC(rtablen*sizeof(struct cdl));
925: tmptablen = rtablen;
926: }
927: for ( i = 0; i < n2; i++ ) {
928: a = d0->d[i]; b = d1->d[n2+i];
929: k = d0->d[n2+i]; l = d1->d[i];
1.20 noro 930:
931: /* degree of xi^a*(Di^k*xi^l)*Di^b */
932: a += l;
933: b += k;
934: s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i);
935:
1.10 noro 936: if ( !k || !l ) {
937: for ( j = 0, p = rtab; j < curlen; j++, p++ ) {
938: if ( p->c ) {
939: dt = p->d;
940: dt->d[i] = a;
941: dt->d[n2+i] = b;
942: dt->td += s;
1.5 noro 943: }
1.10 noro 944: }
945: curlen *= k+1;
946: continue;
947: }
948: if ( k+1 > tablen ) {
949: if ( tab ) GC_free(tab);
950: if ( ctab ) GC_free(ctab);
951: tablen = k+1;
952: tab = (struct cdl *)MALLOC(tablen*sizeof(struct cdl));
953: ctab = (Q *)MALLOC(tablen*sizeof(Q));
954: }
955: /* compute xi^a*(Di^k*xi^l)*Di^b */
956: min = MIN(k,l);
957: mkwc(k,l,ctab);
958: bzero(tab,(k+1)*sizeof(struct cdl));
959: if ( n & 1 )
960: for ( j = 0; j <= min; j++ ) {
961: NEWDL(d,n);
1.20 noro 962: d->d[i] = a-j; d->d[n2+i] = b-j;
1.10 noro 963: d->td = s;
1.20 noro 964: d->d[n-1] = s-(MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i));
1.10 noro 965: tab[j].d = d;
966: tab[j].c = (P)ctab[j];
967: }
968: else
969: for ( j = 0; j <= min; j++ ) {
970: NEWDL(d,n);
1.20 noro 971: d->d[i] = a-j; d->d[n2+i] = b-j;
972: d->td = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i); /* XXX */
1.10 noro 973: tab[j].d = d;
974: tab[j].c = (P)ctab[j];
975: }
976: bzero(ctab,(min+1)*sizeof(Q));
977: comm_muld_tab(vl,n,rtab,curlen,tab,k+1,tmptab);
978: curlen *= k+1;
979: bcopy(tmptab,rtab,curlen*sizeof(struct cdl));
980: }
981: }
982:
983: /* direct product of two cdl tables
984: rt[] = [
985: t[0]*t1[0],...,t[n-1]*t1[0],
986: t[0]*t1[1],...,t[n-1]*t1[1],
987: ...
988: t[0]*t1[n1-1],...,t[n-1]*t1[n1-1]
989: ]
990: */
991:
1.19 noro 992: void comm_muld_tab(VL vl,int nv,struct cdl *t,int n,struct cdl *t1,int n1,struct cdl *rt)
1.10 noro 993: {
994: int i,j;
995: struct cdl *p;
996: P c;
997: DL d;
998:
999: bzero(rt,n*n1*sizeof(struct cdl));
1000: for ( j = 0, p = rt; j < n1; j++ ) {
1001: c = t1[j].c;
1002: d = t1[j].d;
1003: if ( !c )
1004: break;
1005: for ( i = 0; i < n; i++, p++ ) {
1006: if ( t[i].c ) {
1007: mulp(vl,t[i].c,c,&p->c);
1008: adddl(nv,t[i].d,d,&p->d);
1009: }
1.6 noro 1010: }
1.1 noro 1011: }
1012: }
1013:
1.19 noro 1014: void muldc(VL vl,DP p,P c,DP *pr)
1.1 noro 1015: {
1016: MP m,mr,mr0;
1017:
1018: if ( !p || !c )
1019: *pr = 0;
1020: else if ( NUM(c) && UNIQ((Q)c) )
1021: *pr = p;
1022: else if ( NUM(c) && MUNIQ((Q)c) )
1023: chsgnd(p,pr);
1024: else {
1025: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
1026: NEXTMP(mr0,mr);
1027: if ( NUM(C(m)) && RATN(C(m)) && NUM(c) && RATN(c) )
1028: mulq((Q)C(m),(Q)c,(Q *)&C(mr));
1029: else
1030: mulp(vl,C(m),c,&C(mr));
1031: mr->dl = m->dl;
1032: }
1033: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
1034: if ( *pr )
1035: (*pr)->sugar = p->sugar;
1036: }
1.24 noro 1037: }
1038:
1039: void muldc_trunc(VL vl,DP p,P c,DL dl,DP *pr)
1040: {
1041: MP m,mr,mr0;
1042: DL mdl;
1043: int i,n;
1044:
1045: if ( !p || !c ) {
1046: *pr = 0; return;
1047: }
1048: n = NV(p);
1049: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
1050: mdl = m->dl;
1051: for ( i = 0; i < n; i++ )
1052: if ( mdl->d[i] < dl->d[i] )
1053: break;
1054: if ( i < n )
1055: break;
1056: NEXTMP(mr0,mr);
1057: if ( NUM(C(m)) && RATN(C(m)) && NUM(c) && RATN(c) )
1058: mulq((Q)C(m),(Q)c,(Q *)&C(mr));
1059: else
1060: mulp(vl,C(m),c,&C(mr));
1061: mr->dl = m->dl;
1062: }
1063: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
1064: if ( *pr )
1065: (*pr)->sugar = p->sugar;
1.1 noro 1066: }
1067:
1.19 noro 1068: void divsdc(VL vl,DP p,P c,DP *pr)
1.1 noro 1069: {
1070: MP m,mr,mr0;
1071:
1072: if ( !c )
1073: error("disvsdc : division by 0");
1074: else if ( !p )
1075: *pr = 0;
1076: else {
1077: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
1078: NEXTMP(mr0,mr); divsp(vl,C(m),c,&C(mr)); mr->dl = m->dl;
1079: }
1080: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
1081: if ( *pr )
1082: (*pr)->sugar = p->sugar;
1083: }
1084: }
1085:
1.19 noro 1086: void adddl(int n,DL d1,DL d2,DL *dr)
1.1 noro 1087: {
1088: DL dt;
1089: int i;
1090:
1091: if ( !d1->td )
1092: *dr = d2;
1093: else if ( !d2->td )
1094: *dr = d1;
1095: else {
1096: *dr = dt = (DL)MALLOC_ATOMIC((n+1)*sizeof(int));
1097: dt->td = d1->td + d2->td;
1098: for ( i = 0; i < n; i++ )
1099: dt->d[i] = d1->d[i]+d2->d[i];
1100: }
1.11 noro 1101: }
1102:
1103: /* d1 += d2 */
1104:
1.19 noro 1105: void adddl_destructive(int n,DL d1,DL d2)
1.11 noro 1106: {
1107: int i;
1108:
1109: d1->td += d2->td;
1110: for ( i = 0; i < n; i++ )
1111: d1->d[i] += d2->d[i];
1.1 noro 1112: }
1113:
1.19 noro 1114: int compd(VL vl,DP p1,DP p2)
1.1 noro 1115: {
1116: int n,t;
1117: MP m1,m2;
1118:
1119: if ( !p1 )
1120: return p2 ? -1 : 0;
1121: else if ( !p2 )
1122: return 1;
1123: else {
1124: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2);
1125: m1 && m2; m1 = NEXT(m1), m2 = NEXT(m2) )
1126: if ( (t = (*cmpdl)(n,m1->dl,m2->dl)) ||
1127: (t = compp(vl,C(m1),C(m2)) ) )
1128: return t;
1129: if ( m1 )
1130: return 1;
1131: else if ( m2 )
1132: return -1;
1133: else
1134: return 0;
1135: }
1136: }
1137:
1.19 noro 1138: int cmpdl_lex(int n,DL d1,DL d2)
1.1 noro 1139: {
1140: int i;
1141:
1142: for ( i = 0; i < n && d1->d[i] == d2->d[i]; i++ );
1143: return i == n ? 0 : (d1->d[i] > d2->d[i] ? 1 : -1);
1144: }
1145:
1.19 noro 1146: int cmpdl_revlex(int n,DL d1,DL d2)
1.1 noro 1147: {
1148: int i;
1149:
1150: for ( i = n - 1; i >= 0 && d1->d[i] == d2->d[i]; i-- );
1151: return i < 0 ? 0 : (d1->d[i] < d2->d[i] ? 1 : -1);
1152: }
1153:
1.19 noro 1154: int cmpdl_gradlex(int n,DL d1,DL d2)
1.1 noro 1155: {
1156: if ( d1->td > d2->td )
1157: return 1;
1158: else if ( d1->td < d2->td )
1159: return -1;
1160: else
1161: return cmpdl_lex(n,d1,d2);
1162: }
1163:
1.19 noro 1164: int cmpdl_revgradlex(int n,DL d1,DL d2)
1.1 noro 1165: {
1.25 noro 1166: register int i,c;
1.7 noro 1167: register int *p1,*p2;
1168:
1.1 noro 1169: if ( d1->td > d2->td )
1170: return 1;
1171: else if ( d1->td < d2->td )
1172: return -1;
1.7 noro 1173: else {
1.25 noro 1174: i = n-1;
1175: p1 = d1->d+n-1;
1176: p2 = d2->d+n-1;
1177: while ( i >= 7 ) {
1178: c = (*p1--) - (*p2--); if ( c ) goto LAST;
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: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1185: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1186: i -= 8;
1187: }
1188: switch ( i ) {
1189: case 6:
1190: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1191: c = (*p1--) - (*p2--); if ( c ) goto LAST;
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: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1196: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1197: return 0;
1198: case 5:
1199: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1200: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1201: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1202: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1203: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1204: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1205: return 0;
1206: case 4:
1207: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1208: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1209: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1210: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1211: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1212: return 0;
1213: case 3:
1214: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1215: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1216: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1217: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1218: return 0;
1219: case 2:
1220: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1221: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1222: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1223: return 0;
1224: case 1:
1225: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1226: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1227: return 0;
1228: case 0:
1229: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1230: return 0;
1231: default:
1232: return 0;
1233: }
1234: LAST:
1235: if ( c > 0 ) return -1;
1236: else return 1;
1.7 noro 1237: }
1.1 noro 1238: }
1239:
1.19 noro 1240: int cmpdl_blex(int n,DL d1,DL d2)
1.1 noro 1241: {
1242: int c;
1243:
1244: if ( c = cmpdl_lex(n-1,d1,d2) )
1245: return c;
1246: else {
1247: c = d1->d[n-1] - d2->d[n-1];
1248: return c > 0 ? 1 : c < 0 ? -1 : 0;
1249: }
1250: }
1251:
1.19 noro 1252: int cmpdl_bgradlex(int n,DL d1,DL d2)
1.1 noro 1253: {
1254: int e1,e2,c;
1255:
1256: e1 = d1->td - d1->d[n-1]; e2 = d2->td - d2->d[n-1];
1257: if ( e1 > e2 )
1258: return 1;
1259: else if ( e1 < e2 )
1260: return -1;
1261: else {
1262: c = cmpdl_lex(n-1,d1,d2);
1263: if ( c )
1264: return c;
1265: else
1266: return d1->td > d2->td ? 1 : d1->td < d2->td ? -1 : 0;
1267: }
1268: }
1269:
1.19 noro 1270: int cmpdl_brevgradlex(int n,DL d1,DL d2)
1.1 noro 1271: {
1272: int e1,e2,c;
1273:
1274: e1 = d1->td - d1->d[n-1]; e2 = d2->td - d2->d[n-1];
1275: if ( e1 > e2 )
1276: return 1;
1277: else if ( e1 < e2 )
1278: return -1;
1279: else {
1280: c = cmpdl_revlex(n-1,d1,d2);
1281: if ( c )
1282: return c;
1283: else
1284: return d1->td > d2->td ? 1 : d1->td < d2->td ? -1 : 0;
1285: }
1286: }
1287:
1.19 noro 1288: int cmpdl_brevrev(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_revlex(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_bgradrev(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: if ( e1 > e2 )
1324: return 1;
1325: else if ( e1 < e2 )
1326: return -1;
1327: else {
1328: c = cmpdl_lex(dp_nelim,d1,d2);
1329: if ( c )
1330: return c;
1331: else if ( f1 > f2 )
1332: return 1;
1333: else if ( f1 < f2 )
1334: return -1;
1335: else {
1336: for ( i = n - 1; i >= dp_nelim && d1->d[i] == d2->d[i]; i-- );
1337: return i < dp_nelim ? 0 : (d1->d[i] < d2->d[i] ? 1 : -1);
1338: }
1339: }
1340: }
1341:
1.19 noro 1342: int cmpdl_blexrev(int n,DL d1,DL d2)
1.1 noro 1343: {
1344: int e1,e2,f1,f2,c,i;
1345:
1346: for ( i = 0, e1 = 0, e2 = 0; i < dp_nelim; i++ ) {
1347: e1 += d1->d[i]; e2 += d2->d[i];
1348: }
1349: f1 = d1->td - e1; f2 = d2->td - e2;
1350: c = cmpdl_lex(dp_nelim,d1,d2);
1351: if ( c )
1352: return c;
1353: else if ( f1 > f2 )
1354: return 1;
1355: else if ( f1 < f2 )
1356: return -1;
1357: else {
1358: for ( i = n - 1; i >= dp_nelim && d1->d[i] == d2->d[i]; i-- );
1359: return i < dp_nelim ? 0 : (d1->d[i] < d2->d[i] ? 1 : -1);
1360: }
1361: }
1362:
1.19 noro 1363: int cmpdl_elim(int n,DL d1,DL d2)
1.1 noro 1364: {
1365: int e1,e2,i;
1366:
1367: for ( i = 0, e1 = 0, e2 = 0; i < dp_nelim; i++ ) {
1368: e1 += d1->d[i]; e2 += d2->d[i];
1369: }
1370: if ( e1 > e2 )
1371: return 1;
1372: else if ( e1 < e2 )
1373: return -1;
1374: else
1375: return cmpdl_revgradlex(n,d1,d2);
1.12 noro 1376: }
1377:
1.19 noro 1378: int cmpdl_weyl_elim(int n,DL d1,DL d2)
1.12 noro 1379: {
1380: int e1,e2,i;
1381:
1382: for ( i = 1, e1 = 0, e2 = 0; i <= dp_nelim; i++ ) {
1383: e1 += d1->d[n-i]; e2 += d2->d[n-i];
1384: }
1385: if ( e1 > e2 )
1386: return 1;
1387: else if ( e1 < e2 )
1388: return -1;
1389: else if ( d1->td > d2->td )
1390: return 1;
1391: else if ( d1->td < d2->td )
1392: return -1;
1393: else return -cmpdl_revlex(n,d1,d2);
1.13 noro 1394: }
1395:
1396: /*
1397: a special ordering
1398: 1. total order
1399: 2. (-w,w) for the first 2*m variables
1400: 3. DRL for the first 2*m variables
1401: */
1402:
1.20 noro 1403: extern int *current_weyl_weight_vector;
1.13 noro 1404:
1.19 noro 1405: int cmpdl_homo_ww_drl(int n,DL d1,DL d2)
1.13 noro 1406: {
1407: int e1,e2,m,i;
1408: int *p1,*p2;
1409:
1410: if ( d1->td > d2->td )
1411: return 1;
1412: else if ( d1->td < d2->td )
1413: return -1;
1414:
1415: m = n>>1;
1.21 noro 1416: for ( i = 0, e1 = e2 = 0, p1 = d1->d, p2 = d2->d; i < m; i++ ) {
1417: e1 += current_weyl_weight_vector[i]*(p1[m+i] - p1[i]);
1418: e2 += current_weyl_weight_vector[i]*(p2[m+i] - p2[i]);
1.13 noro 1419: }
1420: if ( e1 > e2 )
1421: return 1;
1422: else if ( e1 < e2 )
1423: return -1;
1424:
1425: e1 = d1->td - d1->d[n-1];
1426: e2 = d2->td - d2->d[n-1];
1427: if ( e1 > e2 )
1428: return 1;
1429: else if ( e1 < e2 )
1430: return -1;
1431:
1432: for ( i= n - 1, p1 = d1->d+n-1, p2 = d2->d+n-1;
1433: i >= 0 && *p1 == *p2; i--, p1--, p2-- );
1434: return i < 0 ? 0 : (*p1 < *p2 ? 1 : -1);
1.21 noro 1435: }
1436:
1437: int cmpdl_drl_zigzag(int n,DL d1,DL d2)
1438: {
1439: int i,t,m;
1440: int *p1,*p2;
1441:
1442: if ( d1->td > d2->td )
1443: return 1;
1444: else if ( d1->td < d2->td )
1445: return -1;
1446: else {
1447: m = n>>1;
1448: for ( i= m - 1, p1 = d1->d, p2 = d2->d; i >= 0; i-- ) {
1449: if ( t = p1[m+i] - p2[m+i] ) return t > 0 ? -1 : 1;
1450: if ( t = p1[i] - p2[i] ) return t > 0 ? -1 : 1;
1451: }
1452: return 0;
1453: }
1454: }
1455:
1456: int cmpdl_homo_ww_drl_zigzag(int n,DL d1,DL d2)
1457: {
1458: int e1,e2,m,i,t;
1459: int *p1,*p2;
1460:
1461: if ( d1->td > d2->td )
1462: return 1;
1463: else if ( d1->td < d2->td )
1464: return -1;
1465:
1466: m = n>>1;
1467: for ( i = 0, e1 = e2 = 0, p1 = d1->d, p2 = d2->d; i < m; i++ ) {
1468: e1 += current_weyl_weight_vector[i]*(p1[m+i] - p1[i]);
1469: e2 += current_weyl_weight_vector[i]*(p2[m+i] - p2[i]);
1470: }
1471: if ( e1 > e2 )
1472: return 1;
1473: else if ( e1 < e2 )
1474: return -1;
1475:
1476: e1 = d1->td - d1->d[n-1];
1477: e2 = d2->td - d2->d[n-1];
1478: if ( e1 > e2 )
1479: return 1;
1480: else if ( e1 < e2 )
1481: return -1;
1482:
1483: for ( i= m - 1, p1 = d1->d, p2 = d2->d; i >= 0; i-- ) {
1484: if ( t = p1[m+i] - p2[m+i] ) return t > 0 ? -1 : 1;
1485: if ( t = p1[i] - p2[i] ) return t > 0 ? -1 : 1;
1486: }
1487: return 0;
1.1 noro 1488: }
1489:
1.19 noro 1490: int cmpdl_order_pair(int n,DL d1,DL d2)
1.1 noro 1491: {
1492: int e1,e2,i,j,l;
1493: int *t1,*t2;
1.20 noro 1494: int len,head;
1.1 noro 1495: struct order_pair *pair;
1496:
1.27 noro 1497: len = dp_current_spec->ord.block.length;
1498: pair = dp_current_spec->ord.block.order_pair;
1.1 noro 1499:
1.20 noro 1500: head = 0;
1.1 noro 1501: for ( i = 0, t1 = d1->d, t2 = d2->d; i < len; i++ ) {
1502: l = pair[i].length;
1503: switch ( pair[i].order ) {
1504: case 0:
1505: for ( j = 0, e1 = e2 = 0; j < l; j++ ) {
1.20 noro 1506: e1 += MUL_WEIGHT(t1[j],head+j);
1507: e2 += MUL_WEIGHT(t2[j],head+j);
1.1 noro 1508: }
1509: if ( e1 > e2 )
1510: return 1;
1511: else if ( e1 < e2 )
1512: return -1;
1513: else {
1514: for ( j = l - 1; j >= 0 && t1[j] == t2[j]; j-- );
1515: if ( j >= 0 )
1516: return t1[j] < t2[j] ? 1 : -1;
1517: }
1518: break;
1519: case 1:
1520: for ( j = 0, e1 = e2 = 0; j < l; j++ ) {
1.20 noro 1521: e1 += MUL_WEIGHT(t1[j],head+j);
1522: e2 += MUL_WEIGHT(t2[j],head+j);
1.1 noro 1523: }
1524: if ( e1 > e2 )
1525: return 1;
1526: else if ( e1 < e2 )
1527: return -1;
1528: else {
1529: for ( j = 0; j < l && t1[j] == t2[j]; j++ );
1530: if ( j < l )
1531: return t1[j] > t2[j] ? 1 : -1;
1532: }
1533: break;
1534: case 2:
1535: for ( j = 0; j < l && t1[j] == t2[j]; j++ );
1536: if ( j < l )
1537: return t1[j] > t2[j] ? 1 : -1;
1538: break;
1539: default:
1540: error("cmpdl_order_pair : invalid order"); break;
1541: }
1.20 noro 1542: t1 += l; t2 += l; head += l;
1.28 noro 1543: }
1544: return 0;
1545: }
1546:
1547: int cmpdl_composite(int nv,DL d1,DL d2)
1548: {
1549: int n,i,j,k,start,s,len;
1550: int *dw;
1551: struct sparse_weight *sw;
1552: struct weight_or_block *worb;
1553: int *w,*t1,*t2;
1554:
1555: n = dp_current_spec->ord.composite.length;
1556: worb = dp_current_spec->ord.composite.w_or_b;
1557: w = dp_dl_work;
1558: for ( i = 0, t1 = d1->d, t2 = d2->d; i < nv; i++ )
1559: w[i] = t1[i]-t2[i];
1560: for ( i = 0; i < n; i++, worb++ ) {
1561: len = worb->length;
1562: switch ( worb->type ) {
1563: case IS_DENSE_WEIGHT:
1564: dw = worb->body.dense_weight;
1565: for ( j = 0, s = 0; j < len; j++ )
1566: s += dw[j]*w[j];
1567: if ( s > 0 ) return 1;
1568: else if ( s < 0 ) return -1;
1569: break;
1570: case IS_SPARSE_WEIGHT:
1571: sw = worb->body.sparse_weight;
1572: for ( j = 0, s = 0; j < len; j++ )
1573: s += sw[j].value*w[sw[j].pos];
1574: if ( s > 0 ) return 1;
1575: else if ( s < 0 ) return -1;
1576: break;
1577: case IS_BLOCK:
1578: start = worb->body.block.start;
1579: switch ( worb->body.block.order ) {
1580: case 0:
1581: for ( j = 0, k = start, s = 0; j < len; j++, k++ ) {
1582: s += MUL_WEIGHT(w[k],k);
1583: }
1584: if ( s > 0 ) return 1;
1585: else if ( s < 0 ) return -1;
1586: else {
1587: for ( j = k-1; j >= start && w[j] == 0; j-- );
1588: if ( j >= start )
1589: return w[j] < 0 ? 1 : -1;
1590: }
1591: break;
1592: case 1:
1593: for ( j = 0, k = start, s = 0; j < len; j++, k++ ) {
1594: s += MUL_WEIGHT(w[k],k);
1595: }
1596: if ( s > 0 ) return 1;
1597: else if ( s < 0 ) return -1;
1598: else {
1599: for ( j = 0, k = start; j < len && w[j] == 0; j++, k++ );
1600: if ( j < len )
1601: return w[j] > 0 ? 1 : -1;
1602: }
1603: break;
1604: case 2:
1605: for ( j = 0, k = start; j < len && w[j] == 0; j++, k++ );
1606: if ( j < len )
1607: return w[j] > 0 ? 1 : -1;
1608: break;
1609: }
1610: break;
1611: }
1.1 noro 1612: }
1613: return 0;
1614: }
1615:
1.19 noro 1616: int cmpdl_matrix(int n,DL d1,DL d2)
1.1 noro 1617: {
1618: int *v,*w,*t1,*t2;
1619: int s,i,j,len;
1620: int **matrix;
1621:
1622: for ( i = 0, t1 = d1->d, t2 = d2->d, w = dp_dl_work; i < n; i++ )
1623: w[i] = t1[i]-t2[i];
1.27 noro 1624: len = dp_current_spec->ord.matrix.row;
1625: matrix = dp_current_spec->ord.matrix.matrix;
1.1 noro 1626: for ( j = 0; j < len; j++ ) {
1627: v = matrix[j];
1628: for ( i = 0, s = 0; i < n; i++ )
1629: s += v[i]*w[i];
1630: if ( s > 0 )
1631: return 1;
1632: else if ( s < 0 )
1633: return -1;
1634: }
1635: return 0;
1.25 noro 1636: }
1637:
1638: GeoBucket create_bucket()
1639: {
1640: GeoBucket g;
1641:
1642: g = CALLOC(1,sizeof(struct oGeoBucket));
1643: g->m = 32;
1644: return g;
1645: }
1646:
1647: void add_bucket(GeoBucket g,NODE d,int nv)
1648: {
1649: int l,k,m;
1650:
1651: l = length(d);
1652: for ( k = 0, m = 1; l > m; k++, m <<= 1 );
1653: /* 2^(k-1) < l <= 2^k */
1654: d = symb_merge(g->body[k],d,nv);
1655: for ( ; length(d) > (1<<(k)); k++ ) {
1656: g->body[k] = 0;
1657: d = symb_merge(g->body[k+1],d,nv);
1658: }
1659: g->body[k] = d;
1660: g->m = MAX(g->m,k);
1661: }
1662:
1663: DL remove_head_bucket(GeoBucket g,int nv)
1664: {
1665: int j,i,c,m;
1666: DL d;
1667:
1668: j = -1;
1669: m = g->m;
1670: for ( i = 0; i <= m; i++ ) {
1671: if ( !g->body[i] )
1672: continue;
1673: if ( j < 0 ) j = i;
1674: else {
1675: c = (*cmpdl)(nv,g->body[i]->body,g->body[j]->body);
1676: if ( c > 0 )
1677: j = i;
1678: else if ( c == 0 )
1679: g->body[i] = NEXT(g->body[i]);
1680: }
1681: }
1682: if ( j < 0 )
1683: return 0;
1684: else {
1685: d = g->body[j]->body;
1686: g->body[j] = NEXT(g->body[j]);
1687: return d;
1.31 noro 1688: }
1689: }
1690:
1691: /* DPV functions */
1692:
1693: void adddv(VL vl,DPV p1,DPV p2,DPV *pr)
1694: {
1695: int i,len;
1696: DP *e;
1697:
1698: if ( !p1 || !p2 )
1699: error("adddv : invalid argument");
1700: else if ( p1->len != p2->len )
1701: error("adddv : size mismatch");
1702: else {
1703: len = p1->len;
1704: e = (DP *)MALLOC(p1->len*sizeof(DP));
1705: for ( i = 0; i < len; i++ )
1706: addd(vl,p1->body[i],p2->body[i],&e[i]);
1707: MKDPV(len,e,*pr);
1708: (*pr)->sugar = MAX(p1->sugar,p2->sugar);
1709: }
1710: }
1711:
1712: void subdv(VL vl,DPV p1,DPV p2,DPV *pr)
1713: {
1714: int i,len;
1715: DP *e;
1716:
1717: if ( !p1 || !p2 )
1718: error("subdv : invalid argument");
1719: else if ( p1->len != p2->len )
1720: error("subdv : size mismatch");
1721: else {
1722: len = p1->len;
1723: e = (DP *)MALLOC(p1->len*sizeof(DP));
1724: for ( i = 0; i < len; i++ )
1725: subd(vl,p1->body[i],p2->body[i],&e[i]);
1726: MKDPV(len,e,*pr);
1727: (*pr)->sugar = MAX(p1->sugar,p2->sugar);
1728: }
1729: }
1730:
1731: void chsgndv(DPV p1,DPV *pr)
1732: {
1733: int i,len;
1734: DP *e;
1735:
1736: if ( !p1 )
1737: error("subdv : invalid argument");
1738: else {
1739: len = p1->len;
1740: e = (DP *)MALLOC(p1->len*sizeof(DP));
1741: for ( i = 0; i < len; i++ )
1742: chsgnd(p1->body[i],&e[i]);
1743: MKDPV(len,e,*pr);
1744: (*pr)->sugar = p1->sugar;
1745: }
1746: }
1747:
1748: void muldv(VL vl,DP p1,DPV p2,DPV *pr)
1749: {
1750: int i,len;
1751: DP *e;
1752:
1753: len = p2->len;
1754: e = (DP *)MALLOC(p2->len*sizeof(DP));
1755: if ( !p1 ) {
1756: MKDPV(len,e,*pr);
1757: (*pr)->sugar = 0;
1758: } else {
1759: for ( i = 0; i < len; i++ )
1760: muld(vl,p1,p2->body[i],&e[i]);
1761: MKDPV(len,e,*pr);
1762: (*pr)->sugar = p1->sugar + p2->sugar;
1763: }
1764: }
1765:
1766: int compdv(VL vl,DPV p1,DPV p2)
1767: {
1768: int i,t,len;
1769:
1770: if ( p1->len != p2->len )
1771: error("compdv : size mismatch");
1772: else {
1773: len = p1->len;
1774: for ( i = 0; i < len; i++ )
1775: if ( t = compd(vl,p1->body[i],p2->body[i]) )
1776: return t;
1777: return 0;
1.25 noro 1778: }
1.1 noro 1779: }