Annotation of OpenXM_contrib2/asir2000/engine/dist.c, Revision 1.31
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.31 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/engine/dist.c,v 1.30 2004/04/14 07:27:41 ohara 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;
602: else {
603: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
604: NEXTMP(mr0,mr); chsgnp(C(m),&C(mr)); mr->dl = m->dl;
605: }
606: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
607: if ( *pr )
608: (*pr)->sugar = p->sugar;
609: }
610: }
611:
1.19 noro 612: void muld(VL vl,DP p1,DP p2,DP *pr)
1.1 noro 613: {
1.2 noro 614: if ( ! do_weyl )
615: comm_muld(vl,p1,p2,pr);
616: else
617: weyl_muld(vl,p1,p2,pr);
618: }
619:
1.19 noro 620: void comm_muld(VL vl,DP p1,DP p2,DP *pr)
1.2 noro 621: {
1.1 noro 622: MP m;
623: DP s,t,u;
1.5 noro 624: int i,l,l1;
625: static MP *w;
626: static int wlen;
1.1 noro 627:
628: if ( !p1 || !p2 )
629: *pr = 0;
630: else if ( OID(p1) <= O_P )
631: muldc(vl,p2,(P)p1,pr);
632: else if ( OID(p2) <= O_P )
633: muldc(vl,p1,(P)p2,pr);
634: else {
1.5 noro 635: for ( m = BDY(p1), l1 = 0; m; m = NEXT(m), l1++ );
1.4 noro 636: for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ );
1.5 noro 637: if ( l1 < l ) {
638: t = p1; p1 = p2; p2 = t;
639: l = l1;
640: }
641: if ( l > wlen ) {
642: if ( w ) GC_free(w);
643: w = (MP *)MALLOC(l*sizeof(MP));
644: wlen = l;
645: }
1.4 noro 646: for ( m = BDY(p2), i = 0; i < l; m = NEXT(m), i++ )
647: w[i] = m;
648: for ( s = 0, i = l-1; i >= 0; i-- ) {
649: muldm(vl,p1,w[i],&t); addd(vl,s,t,&u); s = u;
1.1 noro 650: }
1.5 noro 651: bzero(w,l*sizeof(MP));
1.1 noro 652: *pr = s;
653: }
654: }
655:
1.24 noro 656: /* discard terms which is not a multiple of dl */
657:
658: void comm_muld_trunc(VL vl,DP p1,DP p2,DL dl,DP *pr)
659: {
660: MP m;
661: DP s,t,u;
662: int i,l,l1;
663: static MP *w;
664: static int wlen;
665:
666: if ( !p1 || !p2 )
667: *pr = 0;
668: else if ( OID(p1) <= O_P )
669: muldc_trunc(vl,p2,(P)p1,dl,pr);
670: else if ( OID(p2) <= O_P )
671: muldc_trunc(vl,p1,(P)p2,dl,pr);
672: else {
673: for ( m = BDY(p1), l1 = 0; m; m = NEXT(m), l1++ );
674: for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ );
675: if ( l1 < l ) {
676: t = p1; p1 = p2; p2 = t;
677: l = l1;
678: }
679: if ( l > wlen ) {
680: if ( w ) GC_free(w);
681: w = (MP *)MALLOC(l*sizeof(MP));
682: wlen = l;
683: }
684: for ( m = BDY(p2), i = 0; i < l; m = NEXT(m), i++ )
685: w[i] = m;
686: for ( s = 0, i = l-1; i >= 0; i-- ) {
687: muldm_trunc(vl,p1,w[i],dl,&t); addd(vl,s,t,&u); s = u;
688: }
689: bzero(w,l*sizeof(MP));
690: *pr = s;
691: }
692: }
693:
694: void comm_quod(VL vl,DP p1,DP p2,DP *pr)
695: {
696: MP m,m0;
697: DP s,t;
698: int i,n,sugar;
699: DL d1,d2,d;
700: Q a,b;
701:
702: if ( !p2 )
703: error("comm_quod : invalid input");
704: if ( !p1 )
705: *pr = 0;
706: else {
707: n = NV(p1);
708: d2 = BDY(p2)->dl;
709: m0 = 0;
710: sugar = p1->sugar;
711: while ( p1 ) {
712: d1 = BDY(p1)->dl;
713: NEWDL(d,n);
714: d->td = d1->td - d2->td;
715: for ( i = 0; i < n; i++ )
716: d->d[i] = d1->d[i]-d2->d[i];
717: NEXTMP(m0,m);
718: m->dl = d;
719: divq((Q)BDY(p1)->c,(Q)BDY(p2)->c,&a); chsgnq(a,&b);
720: C(m) = (P)b;
721: muldm_trunc(vl,p2,m,d2,&t);
722: addd(vl,p1,t,&s); p1 = s;
723: C(m) = (P)a;
724: }
725: if ( m0 ) {
726: NEXT(m) = 0; MKDP(n,m0,*pr);
727: } else
728: *pr = 0;
729: /* XXX */
730: if ( *pr )
731: (*pr)->sugar = sugar - d2->td;
732: }
733: }
734:
1.19 noro 735: void muldm(VL vl,DP p,MP m0,DP *pr)
1.1 noro 736: {
737: MP m,mr,mr0;
738: P c;
739: DL d;
740: int n;
741:
742: if ( !p )
743: *pr = 0;
744: else {
745: for ( mr0 = 0, m = BDY(p), c = C(m0), d = m0->dl, n = NV(p);
746: m; m = NEXT(m) ) {
747: NEXTMP(mr0,mr);
748: if ( NUM(C(m)) && RATN(C(m)) && NUM(c) && RATN(c) )
749: mulq((Q)C(m),(Q)c,(Q *)&C(mr));
750: else
751: mulp(vl,C(m),c,&C(mr));
752: adddl(n,m->dl,d,&mr->dl);
753: }
754: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
755: if ( *pr )
756: (*pr)->sugar = p->sugar + m0->dl->td;
1.2 noro 757: }
758: }
759:
1.24 noro 760: void muldm_trunc(VL vl,DP p,MP m0,DL dl,DP *pr)
761: {
762: MP m,mr,mr0;
763: P c;
764: DL d,tdl;
765: int n,i;
766:
767: if ( !p )
768: *pr = 0;
769: else {
770: n = NV(p);
771: NEWDL(tdl,n);
772: for ( mr0 = 0, m = BDY(p), c = C(m0), d = m0->dl;
773: m; m = NEXT(m) ) {
774: _adddl(n,m->dl,d,tdl);
775: for ( i = 0; i < n; i++ )
776: if ( tdl->d[i] < dl->d[i] )
777: break;
778: if ( i < n )
779: continue;
780: NEXTMP(mr0,mr);
781: mr->dl = tdl;
782: NEWDL(tdl,n);
783: if ( NUM(C(m)) && RATN(C(m)) && NUM(c) && RATN(c) )
784: mulq((Q)C(m),(Q)c,(Q *)&C(mr));
785: else
786: mulp(vl,C(m),c,&C(mr));
787: }
788: if ( mr0 ) {
789: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
790: } else
791: *pr = 0;
792: if ( *pr )
793: (*pr)->sugar = p->sugar + m0->dl->td;
794: }
795: }
796:
1.19 noro 797: void weyl_muld(VL vl,DP p1,DP p2,DP *pr)
1.2 noro 798: {
799: MP m;
800: DP s,t,u;
1.4 noro 801: int i,l;
1.5 noro 802: static MP *w;
803: static int wlen;
1.2 noro 804:
805: if ( !p1 || !p2 )
806: *pr = 0;
807: else if ( OID(p1) <= O_P )
808: muldc(vl,p2,(P)p1,pr);
809: else if ( OID(p2) <= O_P )
810: muldc(vl,p1,(P)p2,pr);
811: else {
1.10 noro 812: for ( m = BDY(p1), l = 0; m; m = NEXT(m), l++ );
1.5 noro 813: if ( l > wlen ) {
814: if ( w ) GC_free(w);
815: w = (MP *)MALLOC(l*sizeof(MP));
816: wlen = l;
817: }
1.10 noro 818: for ( m = BDY(p1), i = 0; i < l; m = NEXT(m), i++ )
1.4 noro 819: w[i] = m;
820: for ( s = 0, i = l-1; i >= 0; i-- ) {
1.10 noro 821: weyl_muldm(vl,w[i],p2,&t); addd(vl,s,t,&u); s = u;
1.2 noro 822: }
1.5 noro 823: bzero(w,l*sizeof(MP));
1.2 noro 824: *pr = s;
825: }
826: }
827:
1.10 noro 828: /* monomial * polynomial */
829:
1.19 noro 830: void weyl_muldm(VL vl,MP m0,DP p,DP *pr)
1.2 noro 831: {
832: DP r,t,t1;
833: MP m;
1.10 noro 834: DL d0;
835: int n,n2,l,i,j,tlen;
836: static MP *w,*psum;
837: static struct cdl *tab;
1.5 noro 838: static int wlen;
1.10 noro 839: static int rtlen;
1.2 noro 840:
841: if ( !p )
842: *pr = 0;
843: else {
1.4 noro 844: for ( m = BDY(p), l = 0; m; m = NEXT(m), l++ );
1.5 noro 845: if ( l > wlen ) {
846: if ( w ) GC_free(w);
847: w = (MP *)MALLOC(l*sizeof(MP));
848: wlen = l;
849: }
1.4 noro 850: for ( m = BDY(p), i = 0; i < l; m = NEXT(m), i++ )
851: w[i] = m;
1.10 noro 852:
853: n = NV(p); n2 = n>>1;
854: d0 = m0->dl;
855: for ( i = 0, tlen = 1; i < n2; i++ )
856: tlen *= d0->d[n2+i]+1;
857: if ( tlen > rtlen ) {
858: if ( tab ) GC_free(tab);
859: if ( psum ) GC_free(psum);
860: rtlen = tlen;
861: tab = (struct cdl *)MALLOC(rtlen*sizeof(struct cdl));
862: psum = (MP *)MALLOC(rtlen*sizeof(MP));
863: }
864: bzero(psum,tlen*sizeof(MP));
865: for ( i = l-1; i >= 0; i-- ) {
866: bzero(tab,tlen*sizeof(struct cdl));
867: weyl_mulmm(vl,m0,w[i],n,tab,tlen);
868: for ( j = 0; j < tlen; j++ ) {
869: if ( tab[j].c ) {
870: NEWMP(m); m->dl = tab[j].d; C(m) = tab[j].c; NEXT(m) = psum[j];
871: psum[j] = m;
872: }
873: }
1.2 noro 874: }
1.10 noro 875: for ( j = tlen-1, r = 0; j >= 0; j-- )
876: if ( psum[j] ) {
877: MKDP(n,psum[j],t); addd(vl,r,t,&t1); r = t1;
878: }
1.2 noro 879: if ( r )
880: r->sugar = p->sugar + m0->dl->td;
881: *pr = r;
882: }
883: }
884:
1.10 noro 885: /* m0 = x0^d0*x1^d1*... * dx0^e0*dx1^e1*... */
886: /* rtab : array of length (e0+1)*(e1+1)*... */
1.2 noro 887:
1.19 noro 888: void weyl_mulmm(VL vl,MP m0,MP m1,int n,struct cdl *rtab,int rtablen)
1.2 noro 889: {
1.19 noro 890: P c,c0,c1;
1.10 noro 891: DL d,d0,d1,dt;
892: int i,j,a,b,k,l,n2,s,min,curlen;
893: struct cdl *p;
894: static Q *ctab;
895: static struct cdl *tab;
1.5 noro 896: static int tablen;
1.10 noro 897: static struct cdl *tmptab;
898: static int tmptablen;
1.2 noro 899:
1.10 noro 900:
901: if ( !m0 || !m1 ) {
902: rtab[0].c = 0;
903: rtab[0].d = 0;
904: return;
905: }
906: c0 = C(m0); c1 = C(m1);
907: mulp(vl,c0,c1,&c);
908: d0 = m0->dl; d1 = m1->dl;
909: n2 = n>>1;
910: curlen = 1;
911: NEWDL(d,n);
912: if ( n & 1 )
913: /* offset of h-degree */
914: d->td = d->d[n-1] = d0->d[n-1]+d1->d[n-1];
915: else
916: d->td = 0;
917: rtab[0].c = c;
918: rtab[0].d = d;
919:
920: if ( rtablen > tmptablen ) {
921: if ( tmptab ) GC_free(tmptab);
922: tmptab = (struct cdl *)MALLOC(rtablen*sizeof(struct cdl));
923: tmptablen = rtablen;
924: }
925: for ( i = 0; i < n2; i++ ) {
926: a = d0->d[i]; b = d1->d[n2+i];
927: k = d0->d[n2+i]; l = d1->d[i];
1.20 noro 928:
929: /* degree of xi^a*(Di^k*xi^l)*Di^b */
930: a += l;
931: b += k;
932: s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i);
933:
1.10 noro 934: if ( !k || !l ) {
935: for ( j = 0, p = rtab; j < curlen; j++, p++ ) {
936: if ( p->c ) {
937: dt = p->d;
938: dt->d[i] = a;
939: dt->d[n2+i] = b;
940: dt->td += s;
1.5 noro 941: }
1.10 noro 942: }
943: curlen *= k+1;
944: continue;
945: }
946: if ( k+1 > tablen ) {
947: if ( tab ) GC_free(tab);
948: if ( ctab ) GC_free(ctab);
949: tablen = k+1;
950: tab = (struct cdl *)MALLOC(tablen*sizeof(struct cdl));
951: ctab = (Q *)MALLOC(tablen*sizeof(Q));
952: }
953: /* compute xi^a*(Di^k*xi^l)*Di^b */
954: min = MIN(k,l);
955: mkwc(k,l,ctab);
956: bzero(tab,(k+1)*sizeof(struct cdl));
957: if ( n & 1 )
958: for ( j = 0; j <= min; j++ ) {
959: NEWDL(d,n);
1.20 noro 960: d->d[i] = a-j; d->d[n2+i] = b-j;
1.10 noro 961: d->td = s;
1.20 noro 962: d->d[n-1] = s-(MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i));
1.10 noro 963: tab[j].d = d;
964: tab[j].c = (P)ctab[j];
965: }
966: else
967: for ( j = 0; j <= min; j++ ) {
968: NEWDL(d,n);
1.20 noro 969: d->d[i] = a-j; d->d[n2+i] = b-j;
970: d->td = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i); /* XXX */
1.10 noro 971: tab[j].d = d;
972: tab[j].c = (P)ctab[j];
973: }
974: bzero(ctab,(min+1)*sizeof(Q));
975: comm_muld_tab(vl,n,rtab,curlen,tab,k+1,tmptab);
976: curlen *= k+1;
977: bcopy(tmptab,rtab,curlen*sizeof(struct cdl));
978: }
979: }
980:
981: /* direct product of two cdl tables
982: rt[] = [
983: t[0]*t1[0],...,t[n-1]*t1[0],
984: t[0]*t1[1],...,t[n-1]*t1[1],
985: ...
986: t[0]*t1[n1-1],...,t[n-1]*t1[n1-1]
987: ]
988: */
989:
1.19 noro 990: void comm_muld_tab(VL vl,int nv,struct cdl *t,int n,struct cdl *t1,int n1,struct cdl *rt)
1.10 noro 991: {
992: int i,j;
993: struct cdl *p;
994: P c;
995: DL d;
996:
997: bzero(rt,n*n1*sizeof(struct cdl));
998: for ( j = 0, p = rt; j < n1; j++ ) {
999: c = t1[j].c;
1000: d = t1[j].d;
1001: if ( !c )
1002: break;
1003: for ( i = 0; i < n; i++, p++ ) {
1004: if ( t[i].c ) {
1005: mulp(vl,t[i].c,c,&p->c);
1006: adddl(nv,t[i].d,d,&p->d);
1007: }
1.6 noro 1008: }
1.1 noro 1009: }
1010: }
1011:
1.19 noro 1012: void muldc(VL vl,DP p,P c,DP *pr)
1.1 noro 1013: {
1014: MP m,mr,mr0;
1015:
1016: if ( !p || !c )
1017: *pr = 0;
1018: else if ( NUM(c) && UNIQ((Q)c) )
1019: *pr = p;
1020: else if ( NUM(c) && MUNIQ((Q)c) )
1021: chsgnd(p,pr);
1022: else {
1023: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
1024: NEXTMP(mr0,mr);
1025: if ( NUM(C(m)) && RATN(C(m)) && NUM(c) && RATN(c) )
1026: mulq((Q)C(m),(Q)c,(Q *)&C(mr));
1027: else
1028: mulp(vl,C(m),c,&C(mr));
1029: mr->dl = m->dl;
1030: }
1031: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
1032: if ( *pr )
1033: (*pr)->sugar = p->sugar;
1034: }
1.24 noro 1035: }
1036:
1037: void muldc_trunc(VL vl,DP p,P c,DL dl,DP *pr)
1038: {
1039: MP m,mr,mr0;
1040: DL mdl;
1041: int i,n;
1042:
1043: if ( !p || !c ) {
1044: *pr = 0; return;
1045: }
1046: n = NV(p);
1047: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
1048: mdl = m->dl;
1049: for ( i = 0; i < n; i++ )
1050: if ( mdl->d[i] < dl->d[i] )
1051: break;
1052: if ( i < n )
1053: break;
1054: NEXTMP(mr0,mr);
1055: if ( NUM(C(m)) && RATN(C(m)) && NUM(c) && RATN(c) )
1056: mulq((Q)C(m),(Q)c,(Q *)&C(mr));
1057: else
1058: mulp(vl,C(m),c,&C(mr));
1059: mr->dl = m->dl;
1060: }
1061: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
1062: if ( *pr )
1063: (*pr)->sugar = p->sugar;
1.1 noro 1064: }
1065:
1.19 noro 1066: void divsdc(VL vl,DP p,P c,DP *pr)
1.1 noro 1067: {
1068: MP m,mr,mr0;
1069:
1070: if ( !c )
1071: error("disvsdc : division by 0");
1072: else if ( !p )
1073: *pr = 0;
1074: else {
1075: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
1076: NEXTMP(mr0,mr); divsp(vl,C(m),c,&C(mr)); mr->dl = m->dl;
1077: }
1078: NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
1079: if ( *pr )
1080: (*pr)->sugar = p->sugar;
1081: }
1082: }
1083:
1.19 noro 1084: void adddl(int n,DL d1,DL d2,DL *dr)
1.1 noro 1085: {
1086: DL dt;
1087: int i;
1088:
1089: if ( !d1->td )
1090: *dr = d2;
1091: else if ( !d2->td )
1092: *dr = d1;
1093: else {
1094: *dr = dt = (DL)MALLOC_ATOMIC((n+1)*sizeof(int));
1095: dt->td = d1->td + d2->td;
1096: for ( i = 0; i < n; i++ )
1097: dt->d[i] = d1->d[i]+d2->d[i];
1098: }
1.11 noro 1099: }
1100:
1101: /* d1 += d2 */
1102:
1.19 noro 1103: void adddl_destructive(int n,DL d1,DL d2)
1.11 noro 1104: {
1105: int i;
1106:
1107: d1->td += d2->td;
1108: for ( i = 0; i < n; i++ )
1109: d1->d[i] += d2->d[i];
1.1 noro 1110: }
1111:
1.19 noro 1112: int compd(VL vl,DP p1,DP p2)
1.1 noro 1113: {
1114: int n,t;
1115: MP m1,m2;
1116:
1117: if ( !p1 )
1118: return p2 ? -1 : 0;
1119: else if ( !p2 )
1120: return 1;
1121: else {
1122: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2);
1123: m1 && m2; m1 = NEXT(m1), m2 = NEXT(m2) )
1124: if ( (t = (*cmpdl)(n,m1->dl,m2->dl)) ||
1125: (t = compp(vl,C(m1),C(m2)) ) )
1126: return t;
1127: if ( m1 )
1128: return 1;
1129: else if ( m2 )
1130: return -1;
1131: else
1132: return 0;
1133: }
1134: }
1135:
1.19 noro 1136: int cmpdl_lex(int n,DL d1,DL d2)
1.1 noro 1137: {
1138: int i;
1139:
1140: for ( i = 0; i < n && d1->d[i] == d2->d[i]; i++ );
1141: return i == n ? 0 : (d1->d[i] > d2->d[i] ? 1 : -1);
1142: }
1143:
1.19 noro 1144: int cmpdl_revlex(int n,DL d1,DL d2)
1.1 noro 1145: {
1146: int i;
1147:
1148: for ( i = n - 1; i >= 0 && d1->d[i] == d2->d[i]; i-- );
1149: return i < 0 ? 0 : (d1->d[i] < d2->d[i] ? 1 : -1);
1150: }
1151:
1.19 noro 1152: int cmpdl_gradlex(int n,DL d1,DL d2)
1.1 noro 1153: {
1154: if ( d1->td > d2->td )
1155: return 1;
1156: else if ( d1->td < d2->td )
1157: return -1;
1158: else
1159: return cmpdl_lex(n,d1,d2);
1160: }
1161:
1.19 noro 1162: int cmpdl_revgradlex(int n,DL d1,DL d2)
1.1 noro 1163: {
1.25 noro 1164: register int i,c;
1.7 noro 1165: register int *p1,*p2;
1166:
1.1 noro 1167: if ( d1->td > d2->td )
1168: return 1;
1169: else if ( d1->td < d2->td )
1170: return -1;
1.7 noro 1171: else {
1.25 noro 1172: i = n-1;
1173: p1 = d1->d+n-1;
1174: p2 = d2->d+n-1;
1175: while ( i >= 7 ) {
1176: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1177: c = (*p1--) - (*p2--); if ( c ) goto LAST;
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: i -= 8;
1185: }
1186: switch ( i ) {
1187: case 6:
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: 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: return 0;
1196: case 5:
1197: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1198: c = (*p1--) - (*p2--); if ( c ) goto LAST;
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: return 0;
1204: case 4:
1205: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1206: c = (*p1--) - (*p2--); if ( c ) goto LAST;
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: return 0;
1211: case 3:
1212: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1213: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1214: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1215: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1216: return 0;
1217: case 2:
1218: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1219: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1220: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1221: return 0;
1222: case 1:
1223: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1224: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1225: return 0;
1226: case 0:
1227: c = (*p1--) - (*p2--); if ( c ) goto LAST;
1228: return 0;
1229: default:
1230: return 0;
1231: }
1232: LAST:
1233: if ( c > 0 ) return -1;
1234: else return 1;
1.7 noro 1235: }
1.1 noro 1236: }
1237:
1.19 noro 1238: int cmpdl_blex(int n,DL d1,DL d2)
1.1 noro 1239: {
1240: int c;
1241:
1242: if ( c = cmpdl_lex(n-1,d1,d2) )
1243: return c;
1244: else {
1245: c = d1->d[n-1] - d2->d[n-1];
1246: return c > 0 ? 1 : c < 0 ? -1 : 0;
1247: }
1248: }
1249:
1.19 noro 1250: int cmpdl_bgradlex(int n,DL d1,DL d2)
1.1 noro 1251: {
1252: int e1,e2,c;
1253:
1254: e1 = d1->td - d1->d[n-1]; e2 = d2->td - d2->d[n-1];
1255: if ( e1 > e2 )
1256: return 1;
1257: else if ( e1 < e2 )
1258: return -1;
1259: else {
1260: c = cmpdl_lex(n-1,d1,d2);
1261: if ( c )
1262: return c;
1263: else
1264: return d1->td > d2->td ? 1 : d1->td < d2->td ? -1 : 0;
1265: }
1266: }
1267:
1.19 noro 1268: int cmpdl_brevgradlex(int n,DL d1,DL d2)
1.1 noro 1269: {
1270: int e1,e2,c;
1271:
1272: e1 = d1->td - d1->d[n-1]; e2 = d2->td - d2->d[n-1];
1273: if ( e1 > e2 )
1274: return 1;
1275: else if ( e1 < e2 )
1276: return -1;
1277: else {
1278: c = cmpdl_revlex(n-1,d1,d2);
1279: if ( c )
1280: return c;
1281: else
1282: return d1->td > d2->td ? 1 : d1->td < d2->td ? -1 : 0;
1283: }
1284: }
1285:
1.19 noro 1286: int cmpdl_brevrev(int n,DL d1,DL d2)
1.1 noro 1287: {
1288: int e1,e2,f1,f2,c,i;
1289:
1290: for ( i = 0, e1 = 0, e2 = 0; i < dp_nelim; i++ ) {
1291: e1 += d1->d[i]; e2 += d2->d[i];
1292: }
1293: f1 = d1->td - e1; f2 = d2->td - e2;
1294: if ( e1 > e2 )
1295: return 1;
1296: else if ( e1 < e2 )
1297: return -1;
1298: else {
1299: c = cmpdl_revlex(dp_nelim,d1,d2);
1300: if ( c )
1301: return c;
1302: else if ( f1 > f2 )
1303: return 1;
1304: else if ( f1 < f2 )
1305: return -1;
1306: else {
1307: for ( i = n - 1; i >= dp_nelim && d1->d[i] == d2->d[i]; i-- );
1308: return i < dp_nelim ? 0 : (d1->d[i] < d2->d[i] ? 1 : -1);
1309: }
1310: }
1311: }
1312:
1.19 noro 1313: int cmpdl_bgradrev(int n,DL d1,DL d2)
1.1 noro 1314: {
1315: int e1,e2,f1,f2,c,i;
1316:
1317: for ( i = 0, e1 = 0, e2 = 0; i < dp_nelim; i++ ) {
1318: e1 += d1->d[i]; e2 += d2->d[i];
1319: }
1320: f1 = d1->td - e1; f2 = d2->td - e2;
1321: if ( e1 > e2 )
1322: return 1;
1323: else if ( e1 < e2 )
1324: return -1;
1325: else {
1326: c = cmpdl_lex(dp_nelim,d1,d2);
1327: if ( c )
1328: return c;
1329: else if ( f1 > f2 )
1330: return 1;
1331: else if ( f1 < f2 )
1332: return -1;
1333: else {
1334: for ( i = n - 1; i >= dp_nelim && d1->d[i] == d2->d[i]; i-- );
1335: return i < dp_nelim ? 0 : (d1->d[i] < d2->d[i] ? 1 : -1);
1336: }
1337: }
1338: }
1339:
1.19 noro 1340: int cmpdl_blexrev(int n,DL d1,DL d2)
1.1 noro 1341: {
1342: int e1,e2,f1,f2,c,i;
1343:
1344: for ( i = 0, e1 = 0, e2 = 0; i < dp_nelim; i++ ) {
1345: e1 += d1->d[i]; e2 += d2->d[i];
1346: }
1347: f1 = d1->td - e1; f2 = d2->td - e2;
1348: c = cmpdl_lex(dp_nelim,d1,d2);
1349: if ( c )
1350: return c;
1351: else if ( f1 > f2 )
1352: return 1;
1353: else if ( f1 < f2 )
1354: return -1;
1355: else {
1356: for ( i = n - 1; i >= dp_nelim && d1->d[i] == d2->d[i]; i-- );
1357: return i < dp_nelim ? 0 : (d1->d[i] < d2->d[i] ? 1 : -1);
1358: }
1359: }
1360:
1.19 noro 1361: int cmpdl_elim(int n,DL d1,DL d2)
1.1 noro 1362: {
1363: int e1,e2,i;
1364:
1365: for ( i = 0, e1 = 0, e2 = 0; i < dp_nelim; i++ ) {
1366: e1 += d1->d[i]; e2 += d2->d[i];
1367: }
1368: if ( e1 > e2 )
1369: return 1;
1370: else if ( e1 < e2 )
1371: return -1;
1372: else
1373: return cmpdl_revgradlex(n,d1,d2);
1.12 noro 1374: }
1375:
1.19 noro 1376: int cmpdl_weyl_elim(int n,DL d1,DL d2)
1.12 noro 1377: {
1378: int e1,e2,i;
1379:
1380: for ( i = 1, e1 = 0, e2 = 0; i <= dp_nelim; i++ ) {
1381: e1 += d1->d[n-i]; e2 += d2->d[n-i];
1382: }
1383: if ( e1 > e2 )
1384: return 1;
1385: else if ( e1 < e2 )
1386: return -1;
1387: else if ( d1->td > d2->td )
1388: return 1;
1389: else if ( d1->td < d2->td )
1390: return -1;
1391: else return -cmpdl_revlex(n,d1,d2);
1.13 noro 1392: }
1393:
1394: /*
1395: a special ordering
1396: 1. total order
1397: 2. (-w,w) for the first 2*m variables
1398: 3. DRL for the first 2*m variables
1399: */
1400:
1.20 noro 1401: extern int *current_weyl_weight_vector;
1.13 noro 1402:
1.19 noro 1403: int cmpdl_homo_ww_drl(int n,DL d1,DL d2)
1.13 noro 1404: {
1405: int e1,e2,m,i;
1406: int *p1,*p2;
1407:
1408: if ( d1->td > d2->td )
1409: return 1;
1410: else if ( d1->td < d2->td )
1411: return -1;
1412:
1413: m = n>>1;
1.21 noro 1414: for ( i = 0, e1 = e2 = 0, p1 = d1->d, p2 = d2->d; i < m; i++ ) {
1415: e1 += current_weyl_weight_vector[i]*(p1[m+i] - p1[i]);
1416: e2 += current_weyl_weight_vector[i]*(p2[m+i] - p2[i]);
1.13 noro 1417: }
1418: if ( e1 > e2 )
1419: return 1;
1420: else if ( e1 < e2 )
1421: return -1;
1422:
1423: e1 = d1->td - d1->d[n-1];
1424: e2 = d2->td - d2->d[n-1];
1425: if ( e1 > e2 )
1426: return 1;
1427: else if ( e1 < e2 )
1428: return -1;
1429:
1430: for ( i= n - 1, p1 = d1->d+n-1, p2 = d2->d+n-1;
1431: i >= 0 && *p1 == *p2; i--, p1--, p2-- );
1432: return i < 0 ? 0 : (*p1 < *p2 ? 1 : -1);
1.21 noro 1433: }
1434:
1435: int cmpdl_drl_zigzag(int n,DL d1,DL d2)
1436: {
1437: int i,t,m;
1438: int *p1,*p2;
1439:
1440: if ( d1->td > d2->td )
1441: return 1;
1442: else if ( d1->td < d2->td )
1443: return -1;
1444: else {
1445: m = n>>1;
1446: for ( i= m - 1, p1 = d1->d, p2 = d2->d; i >= 0; i-- ) {
1447: if ( t = p1[m+i] - p2[m+i] ) return t > 0 ? -1 : 1;
1448: if ( t = p1[i] - p2[i] ) return t > 0 ? -1 : 1;
1449: }
1450: return 0;
1451: }
1452: }
1453:
1454: int cmpdl_homo_ww_drl_zigzag(int n,DL d1,DL d2)
1455: {
1456: int e1,e2,m,i,t;
1457: int *p1,*p2;
1458:
1459: if ( d1->td > d2->td )
1460: return 1;
1461: else if ( d1->td < d2->td )
1462: return -1;
1463:
1464: m = n>>1;
1465: for ( i = 0, e1 = e2 = 0, p1 = d1->d, p2 = d2->d; i < m; i++ ) {
1466: e1 += current_weyl_weight_vector[i]*(p1[m+i] - p1[i]);
1467: e2 += current_weyl_weight_vector[i]*(p2[m+i] - p2[i]);
1468: }
1469: if ( e1 > e2 )
1470: return 1;
1471: else if ( e1 < e2 )
1472: return -1;
1473:
1474: e1 = d1->td - d1->d[n-1];
1475: e2 = d2->td - d2->d[n-1];
1476: if ( e1 > e2 )
1477: return 1;
1478: else if ( e1 < e2 )
1479: return -1;
1480:
1481: for ( i= m - 1, p1 = d1->d, p2 = d2->d; i >= 0; i-- ) {
1482: if ( t = p1[m+i] - p2[m+i] ) return t > 0 ? -1 : 1;
1483: if ( t = p1[i] - p2[i] ) return t > 0 ? -1 : 1;
1484: }
1485: return 0;
1.1 noro 1486: }
1487:
1.19 noro 1488: int cmpdl_order_pair(int n,DL d1,DL d2)
1.1 noro 1489: {
1490: int e1,e2,i,j,l;
1491: int *t1,*t2;
1.20 noro 1492: int len,head;
1.1 noro 1493: struct order_pair *pair;
1494:
1.27 noro 1495: len = dp_current_spec->ord.block.length;
1496: pair = dp_current_spec->ord.block.order_pair;
1.1 noro 1497:
1.20 noro 1498: head = 0;
1.1 noro 1499: for ( i = 0, t1 = d1->d, t2 = d2->d; i < len; i++ ) {
1500: l = pair[i].length;
1501: switch ( pair[i].order ) {
1502: case 0:
1503: for ( j = 0, e1 = e2 = 0; j < l; j++ ) {
1.20 noro 1504: e1 += MUL_WEIGHT(t1[j],head+j);
1505: e2 += MUL_WEIGHT(t2[j],head+j);
1.1 noro 1506: }
1507: if ( e1 > e2 )
1508: return 1;
1509: else if ( e1 < e2 )
1510: return -1;
1511: else {
1512: for ( j = l - 1; j >= 0 && t1[j] == t2[j]; j-- );
1513: if ( j >= 0 )
1514: return t1[j] < t2[j] ? 1 : -1;
1515: }
1516: break;
1517: case 1:
1518: for ( j = 0, e1 = e2 = 0; j < l; j++ ) {
1.20 noro 1519: e1 += MUL_WEIGHT(t1[j],head+j);
1520: e2 += MUL_WEIGHT(t2[j],head+j);
1.1 noro 1521: }
1522: if ( e1 > e2 )
1523: return 1;
1524: else if ( e1 < e2 )
1525: return -1;
1526: else {
1527: for ( j = 0; j < l && t1[j] == t2[j]; j++ );
1528: if ( j < l )
1529: return t1[j] > t2[j] ? 1 : -1;
1530: }
1531: break;
1532: case 2:
1533: for ( j = 0; j < l && t1[j] == t2[j]; j++ );
1534: if ( j < l )
1535: return t1[j] > t2[j] ? 1 : -1;
1536: break;
1537: default:
1538: error("cmpdl_order_pair : invalid order"); break;
1539: }
1.20 noro 1540: t1 += l; t2 += l; head += l;
1.28 noro 1541: }
1542: return 0;
1543: }
1544:
1545: int cmpdl_composite(int nv,DL d1,DL d2)
1546: {
1547: int n,i,j,k,start,s,len;
1548: int *dw;
1549: struct sparse_weight *sw;
1550: struct weight_or_block *worb;
1551: int *w,*t1,*t2;
1552:
1553: n = dp_current_spec->ord.composite.length;
1554: worb = dp_current_spec->ord.composite.w_or_b;
1555: w = dp_dl_work;
1556: for ( i = 0, t1 = d1->d, t2 = d2->d; i < nv; i++ )
1557: w[i] = t1[i]-t2[i];
1558: for ( i = 0; i < n; i++, worb++ ) {
1559: len = worb->length;
1560: switch ( worb->type ) {
1561: case IS_DENSE_WEIGHT:
1562: dw = worb->body.dense_weight;
1563: for ( j = 0, s = 0; j < len; j++ )
1564: s += dw[j]*w[j];
1565: if ( s > 0 ) return 1;
1566: else if ( s < 0 ) return -1;
1567: break;
1568: case IS_SPARSE_WEIGHT:
1569: sw = worb->body.sparse_weight;
1570: for ( j = 0, s = 0; j < len; j++ )
1571: s += sw[j].value*w[sw[j].pos];
1572: if ( s > 0 ) return 1;
1573: else if ( s < 0 ) return -1;
1574: break;
1575: case IS_BLOCK:
1576: start = worb->body.block.start;
1577: switch ( worb->body.block.order ) {
1578: case 0:
1579: for ( j = 0, k = start, s = 0; j < len; j++, k++ ) {
1580: s += MUL_WEIGHT(w[k],k);
1581: }
1582: if ( s > 0 ) return 1;
1583: else if ( s < 0 ) return -1;
1584: else {
1585: for ( j = k-1; j >= start && w[j] == 0; j-- );
1586: if ( j >= start )
1587: return w[j] < 0 ? 1 : -1;
1588: }
1589: break;
1590: case 1:
1591: for ( j = 0, k = start, s = 0; j < len; j++, k++ ) {
1592: s += MUL_WEIGHT(w[k],k);
1593: }
1594: if ( s > 0 ) return 1;
1595: else if ( s < 0 ) return -1;
1596: else {
1597: for ( j = 0, k = start; j < len && w[j] == 0; j++, k++ );
1598: if ( j < len )
1599: return w[j] > 0 ? 1 : -1;
1600: }
1601: break;
1602: case 2:
1603: for ( j = 0, k = start; j < len && w[j] == 0; j++, k++ );
1604: if ( j < len )
1605: return w[j] > 0 ? 1 : -1;
1606: break;
1607: }
1608: break;
1609: }
1.1 noro 1610: }
1611: return 0;
1612: }
1613:
1.19 noro 1614: int cmpdl_matrix(int n,DL d1,DL d2)
1.1 noro 1615: {
1616: int *v,*w,*t1,*t2;
1617: int s,i,j,len;
1618: int **matrix;
1619:
1620: for ( i = 0, t1 = d1->d, t2 = d2->d, w = dp_dl_work; i < n; i++ )
1621: w[i] = t1[i]-t2[i];
1.27 noro 1622: len = dp_current_spec->ord.matrix.row;
1623: matrix = dp_current_spec->ord.matrix.matrix;
1.1 noro 1624: for ( j = 0; j < len; j++ ) {
1625: v = matrix[j];
1626: for ( i = 0, s = 0; i < n; i++ )
1627: s += v[i]*w[i];
1628: if ( s > 0 )
1629: return 1;
1630: else if ( s < 0 )
1631: return -1;
1632: }
1633: return 0;
1.25 noro 1634: }
1635:
1636: GeoBucket create_bucket()
1637: {
1638: GeoBucket g;
1639:
1640: g = CALLOC(1,sizeof(struct oGeoBucket));
1641: g->m = 32;
1642: return g;
1643: }
1644:
1645: void add_bucket(GeoBucket g,NODE d,int nv)
1646: {
1647: int l,k,m;
1648:
1649: l = length(d);
1650: for ( k = 0, m = 1; l > m; k++, m <<= 1 );
1651: /* 2^(k-1) < l <= 2^k */
1652: d = symb_merge(g->body[k],d,nv);
1653: for ( ; length(d) > (1<<(k)); k++ ) {
1654: g->body[k] = 0;
1655: d = symb_merge(g->body[k+1],d,nv);
1656: }
1657: g->body[k] = d;
1658: g->m = MAX(g->m,k);
1659: }
1660:
1661: DL remove_head_bucket(GeoBucket g,int nv)
1662: {
1663: int j,i,c,m;
1664: DL d;
1665:
1666: j = -1;
1667: m = g->m;
1668: for ( i = 0; i <= m; i++ ) {
1669: if ( !g->body[i] )
1670: continue;
1671: if ( j < 0 ) j = i;
1672: else {
1673: c = (*cmpdl)(nv,g->body[i]->body,g->body[j]->body);
1674: if ( c > 0 )
1675: j = i;
1676: else if ( c == 0 )
1677: g->body[i] = NEXT(g->body[i]);
1678: }
1679: }
1680: if ( j < 0 )
1681: return 0;
1682: else {
1683: d = g->body[j]->body;
1684: g->body[j] = NEXT(g->body[j]);
1685: return d;
1.31 ! noro 1686: }
! 1687: }
! 1688:
! 1689: /* DPV functions */
! 1690:
! 1691: void adddv(VL vl,DPV p1,DPV p2,DPV *pr)
! 1692: {
! 1693: int i,len;
! 1694: DP *e;
! 1695:
! 1696: if ( !p1 || !p2 )
! 1697: error("adddv : invalid argument");
! 1698: else if ( p1->len != p2->len )
! 1699: error("adddv : size mismatch");
! 1700: else {
! 1701: len = p1->len;
! 1702: e = (DP *)MALLOC(p1->len*sizeof(DP));
! 1703: for ( i = 0; i < len; i++ )
! 1704: addd(vl,p1->body[i],p2->body[i],&e[i]);
! 1705: MKDPV(len,e,*pr);
! 1706: (*pr)->sugar = MAX(p1->sugar,p2->sugar);
! 1707: }
! 1708: }
! 1709:
! 1710: void subdv(VL vl,DPV p1,DPV p2,DPV *pr)
! 1711: {
! 1712: int i,len;
! 1713: DP *e;
! 1714:
! 1715: if ( !p1 || !p2 )
! 1716: error("subdv : invalid argument");
! 1717: else if ( p1->len != p2->len )
! 1718: error("subdv : size mismatch");
! 1719: else {
! 1720: len = p1->len;
! 1721: e = (DP *)MALLOC(p1->len*sizeof(DP));
! 1722: for ( i = 0; i < len; i++ )
! 1723: subd(vl,p1->body[i],p2->body[i],&e[i]);
! 1724: MKDPV(len,e,*pr);
! 1725: (*pr)->sugar = MAX(p1->sugar,p2->sugar);
! 1726: }
! 1727: }
! 1728:
! 1729: void chsgndv(DPV p1,DPV *pr)
! 1730: {
! 1731: int i,len;
! 1732: DP *e;
! 1733:
! 1734: if ( !p1 )
! 1735: error("subdv : invalid argument");
! 1736: else {
! 1737: len = p1->len;
! 1738: e = (DP *)MALLOC(p1->len*sizeof(DP));
! 1739: for ( i = 0; i < len; i++ )
! 1740: chsgnd(p1->body[i],&e[i]);
! 1741: MKDPV(len,e,*pr);
! 1742: (*pr)->sugar = p1->sugar;
! 1743: }
! 1744: }
! 1745:
! 1746: void muldv(VL vl,DP p1,DPV p2,DPV *pr)
! 1747: {
! 1748: int i,len;
! 1749: DP *e;
! 1750:
! 1751: len = p2->len;
! 1752: e = (DP *)MALLOC(p2->len*sizeof(DP));
! 1753: if ( !p1 ) {
! 1754: MKDPV(len,e,*pr);
! 1755: (*pr)->sugar = 0;
! 1756: } else {
! 1757: for ( i = 0; i < len; i++ )
! 1758: muld(vl,p1,p2->body[i],&e[i]);
! 1759: MKDPV(len,e,*pr);
! 1760: (*pr)->sugar = p1->sugar + p2->sugar;
! 1761: }
! 1762: }
! 1763:
! 1764: int compdv(VL vl,DPV p1,DPV p2)
! 1765: {
! 1766: int i,t,len;
! 1767:
! 1768: if ( p1->len != p2->len )
! 1769: error("compdv : size mismatch");
! 1770: else {
! 1771: len = p1->len;
! 1772: for ( i = 0; i < len; i++ )
! 1773: if ( t = compd(vl,p1->body[i],p2->body[i]) )
! 1774: return t;
! 1775: return 0;
1.25 noro 1776: }
1.1 noro 1777: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>