Annotation of OpenXM_contrib2/asir2018/builtin/dp-supp.c, Revision 1.8
1.1 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
26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
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.8 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2018/builtin/dp-supp.c,v 1.7 2019/10/11 03:45:56 noro Exp $
1.1 noro 49: */
50: #include "ca.h"
51: #include "base.h"
52: #include "inline.h"
53: #include "parse.h"
54: #include "ox.h"
55:
56: #define HMAG(p) (p_mag((P)BDY(p)->c))
57:
58: extern int (*cmpdl)();
59: extern double pz_t_e,pz_t_d,pz_t_d1,pz_t_c;
60: extern int dp_nelim,dp_fcoeffs;
61: extern int NoGCD;
62: extern int GenTrace;
63: extern NODE TraceList;
64:
65: int show_orderspec;
66:
67: void print_composite_order_spec(struct order_spec *spec);
68: void dpm_rest(DPM,DPM *);
69:
70: /*
71: * content reduction
72: *
73: */
74:
75: static NODE RatDenomList;
76:
77: void init_denomlist()
78: {
79: RatDenomList = 0;
80: }
81:
82: void add_denomlist(P f)
83: {
84: NODE n;
85:
86: if ( OID(f)==O_P ) {
87: MKNODE(n,f,RatDenomList); RatDenomList = n;
88: }
89: }
90:
91: LIST get_denomlist()
92: {
93: LIST l;
94:
95: MKLIST(l,RatDenomList); RatDenomList = 0;
96: return l;
97: }
98:
99: void dp_ptozp(DP p,DP *rp)
100: {
101: MP m,mr,mr0;
102: int i,n;
103: Q *w;
104: Z dvr;
105: P t;
106:
107: if ( !p )
108: *rp = 0;
109: else {
110: for ( m =BDY(p), n = 0; m; m = NEXT(m), n++ );
111: w = (Q *)ALLOCA(n*sizeof(Q));
112: for ( m =BDY(p), i = 0; i < n; m = NEXT(m), i++ )
113: if ( NUM(m->c) )
114: w[i] = (Q)m->c;
115: else
116: ptozp((P)m->c,1,&w[i],&t);
117: sortbynm(w,n);
118: qltozl(w,n,&dvr);
119: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
120: NEXTMP(mr0,mr); divsp(CO,(P)m->c,(P)dvr,(P *)&mr->c); mr->dl = m->dl;
121: }
122: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
123: }
124: }
125:
126: void dp_ptozp2(DP p0,DP p1,DP *hp,DP *rp)
127: {
128: DP t,s,h,r;
129: MP m,mr,mr0,m0;
130:
131: addd(CO,p0,p1,&t); dp_ptozp(t,&s);
132: if ( !p0 ) {
133: h = 0; r = s;
134: } else if ( !p1 ) {
135: h = s; r = 0;
136: } else {
137: for ( mr0 = 0, m = BDY(s), m0 = BDY(p0); m0;
138: m = NEXT(m), m0 = NEXT(m0) ) {
139: NEXTMP(mr0,mr); mr->c = m->c; mr->dl = m->dl;
140: }
141: NEXT(mr) = 0; MKDP(p0->nv,mr0,h); MKDP(p0->nv,m,r);
142: }
143: if ( h )
144: h->sugar = p0->sugar;
145: if ( r )
146: r->sugar = p1->sugar;
147: *hp = h; *rp = r;
148: }
149:
1.3 noro 150: void dpm_ptozp(DPM p,Z *cont,DPM *rp)
1.1 noro 151: {
152: DMM m,mr,mr0;
153: int i,n;
154: Q *w;
155: Z dvr;
156: P t;
157:
1.3 noro 158: if ( !p ) {
159: *rp = 0; *cont = ONE;
160: } else {
1.1 noro 161: for ( m =BDY(p), n = 0; m; m = NEXT(m), n++ );
162: w = (Q *)ALLOCA(n*sizeof(Q));
163: for ( m =BDY(p), i = 0; i < n; m = NEXT(m), i++ )
164: if ( NUM(m->c) )
165: w[i] = (Q)m->c;
166: else
167: ptozp((P)m->c,1,&w[i],&t);
168: sortbynm(w,n);
169: qltozl(w,n,&dvr);
170: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
171: NEXTDMM(mr0,mr); divsp(CO,(P)m->c,(P)dvr,(P *)&mr->c); mr->dl = m->dl; mr->pos = m->pos;
172: }
173: NEXT(mr) = 0; MKDPM(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
1.3 noro 174: *cont = dvr;
1.1 noro 175: }
176: }
177:
178: void dpm_ptozp2(DPM p0,DPM p1,DPM *hp,DPM *rp)
179: {
180: DPM t,s,h,r;
181: DMM m,mr,mr0,m0;
1.3 noro 182: Z cont;
1.1 noro 183:
1.3 noro 184: adddpm(CO,p0,p1,&t); dpm_ptozp(t,&cont,&s);
1.1 noro 185: if ( !p0 ) {
186: h = 0; r = s;
187: } else if ( !p1 ) {
188: h = s; r = 0;
189: } else {
190: for ( mr0 = 0, m = BDY(s), m0 = BDY(p0); m0;
191: m = NEXT(m), m0 = NEXT(m0) ) {
192: NEXTDMM(mr0,mr); mr->c = m->c; mr->dl = m->dl; mr->pos = m->pos;
193: }
194: NEXT(mr) = 0; MKDPM(p0->nv,mr0,h); MKDPM(p0->nv,m,r);
195: }
196: if ( h )
197: h->sugar = p0->sugar;
198: if ( r )
199: r->sugar = p1->sugar;
200: *hp = h; *rp = r;
201: }
202:
203:
204: void dp_ptozp3(DP p,Z *dvr,DP *rp)
205: {
206: MP m,mr,mr0;
207: int i,n;
208: Q *w;
209: P t;
210:
211: if ( !p ) {
212: *rp = 0; *dvr = 0;
213: }else {
214: for ( m =BDY(p), n = 0; m; m = NEXT(m), n++ );
215: w = (Q *)ALLOCA(n*sizeof(Q));
216: for ( m =BDY(p), i = 0; i < n; m = NEXT(m), i++ )
217: if ( NUM(m->c) )
218: w[i] = (Q)m->c;
219: else
220: ptozp((P)m->c,1,&w[i],&t);
221: sortbynm(w,n);
222: qltozl(w,n,dvr);
223: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
224: NEXTMP(mr0,mr); divsp(CO,(P)m->c,(P)(*dvr),(P *)&mr->c); mr->dl = m->dl;
225: }
226: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
227: }
228: }
229:
230: void dp_idiv(DP p,Z c,DP *rp)
231: {
232: MP mr0,m,mr;
233:
234: if ( !p )
235: *rp = 0;
236: else if ( MUNIQ((Q)c) )
237: *rp = p;
238: else if ( MUNIQ((Q)c) )
239: chsgnd(p,rp);
240: else {
241: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
242: NEXTMP(mr0,mr);
1.2 noro 243: divsz((Z)(m->c),c,(Z *)&mr->c);
1.1 noro 244: mr->dl = m->dl;
245: }
246: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp);
247: if ( *rp )
248: (*rp)->sugar = p->sugar;
249: }
250: }
251:
252: void dp_mbase(NODE hlist,NODE *mbase)
253: {
254: DL *dl;
255: DL d;
256: int *t;
257: int i,j,k,n,nvar,td;
258:
259: n = length(hlist); nvar = ((DP)BDY(hlist))->nv;
260: dl = (DL *)MALLOC(n*sizeof(DL));
261: NEWDL(d,nvar); *mbase = 0;
262: for ( i = 0; i < n; i++, hlist = NEXT(hlist) ) {
263: dl[i] = BDY((DP)BDY(hlist))->dl;
264: /* trivial ideal check */
265: if ( (*cmpdl)(nvar,d,dl[i]) == 0 ) {
266: return;
267: }
268: }
269: /* zero-dim. ideal check */
270: for ( i = 0; i < nvar; i++ ) {
271: for ( j = 0; j < n; j++ ) {
272: for ( k = 0, t = dl[j]->d; k < nvar; k++ )
273: if ( k != i && t[k] != 0 ) break;
274: if ( k == nvar ) break;
275: }
276: if ( j == n )
277: error("dp_mbase : input ideal is not zero-dimensional");
278: }
279: while ( 1 ) {
280: insert_to_node(d,mbase,nvar);
281: for ( i = nvar-1; i >= 0; ) {
282: d->d[i]++;
283: d->td += MUL_WEIGHT(1,i);
284: for ( j = 0; j < n; j++ ) {
285: if ( _dl_redble(dl[j],d,nvar) )
286: break;
287: }
288: if ( j < n ) {
289: for ( j = nvar-1; j >= i; j-- )
290: d->d[j] = 0;
291: for ( j = 0, td = 0; j < i; j++ )
292: td += MUL_WEIGHT(d->d[j],j);
293: d->td = td;
294: i--;
295: } else
296: break;
297: }
298: if ( i < 0 )
299: break;
300: }
301: }
302:
303: int _dl_redble(DL d1,DL d2,int nvar)
304: {
305: int i;
306:
307: if ( d1->td > d2->td )
308: return 0;
309: for ( i = 0; i < nvar; i++ )
310: if ( d1->d[i] > d2->d[i] )
311: break;
312: if ( i < nvar )
313: return 0;
314: else
315: return 1;
316: }
317:
318: void insert_to_node(DL d,NODE *n,int nvar)
319: {
320: DL d1;
321: MP m;
322: DP dp;
323: NODE n0,n1,n2;
324:
325: NEWDL(d1,nvar); d1->td = d->td;
326: bcopy((char *)d->d,(char *)d1->d,nvar*sizeof(int));
327: NEWMP(m); m->dl = d1; m->c = (Obj)ONE; NEXT(m) = 0;
328: MKDP(nvar,m,dp); dp->sugar = d->td;
329: if ( !(*n) ) {
330: MKNODE(n1,dp,0); *n = n1;
331: } else {
332: for ( n1 = *n, n0 = 0; n1; n0 = n1, n1 = NEXT(n1) )
333: if ( (*cmpdl)(nvar,d,BDY((DP)BDY(n1))->dl) > 0 ) {
334: MKNODE(n2,dp,n1);
335: if ( !n0 )
336: *n = n2;
337: else
338: NEXT(n0) = n2;
339: break;
340: }
341: if ( !n1 ) {
342: MKNODE(n2,dp,0); NEXT(n0) = n2;
343: }
344: }
345: }
346:
347: void dp_vtod(Q *c,DP p,DP *rp)
348: {
349: MP mr0,m,mr;
350: int i;
351:
352: if ( !p )
353: *rp = 0;
354: else {
355: for ( mr0 = 0, m = BDY(p), i = 0; m; m = NEXT(m), i++ ) {
356: NEXTMP(mr0,mr); mr->c = (Obj)c[i]; mr->dl = m->dl;
357: }
358: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp);
359: (*rp)->sugar = p->sugar;
360: }
361: }
362:
363: int have_sf_coef(P p)
364: {
365: DCP dc;
366:
367: if ( !p )
368: return 0;
369: else if ( NUM(p) )
370: return NID((Num)p) == N_GFS ? 1 : 0;
371: else {
372: for ( dc = DC(p); dc; dc = NEXT(dc) )
373: if ( have_sf_coef(COEF(dc)) )
374: return 1;
375: return 0;
376: }
377: }
378:
379: void head_coef(P p,Num *c)
380: {
381: if ( !p )
382: *c = 0;
383: else if ( NUM(p) )
384: *c = (Num)p;
385: else
386: head_coef(COEF(DC(p)),c);
387: }
388:
389: void dp_monic_sf(DP p,DP *rp)
390: {
391: Num c;
392:
393: if ( !p )
394: *rp = 0;
395: else {
396: head_coef((P)BDY(p)->c,&c);
397: divsdc(CO,p,(P)c,rp);
398: }
399: }
400:
401: void dp_prim(DP p,DP *rp)
402: {
403: P t,g;
404: DP p1;
405: MP m,mr,mr0;
406: int i,n;
407: P *w;
408: Q *c;
409: Z dvr;
410: NODE tn;
411:
412: if ( !p )
413: *rp = 0;
414: else if ( dp_fcoeffs == N_GFS ) {
415: for ( m = BDY(p); m; m = NEXT(m) )
416: if ( OID(m->c) == O_N ) {
417: /* GCD of coeffs = 1 */
418: dp_monic_sf(p,rp);
419: return;
420: } else break;
421: /* compute GCD over the finite fieid */
422: for ( m = BDY(p), n = 0; m; m = NEXT(m), n++ );
423: w = (P *)ALLOCA(n*sizeof(P));
424: for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ )
425: w[i] = (P)m->c;
426: gcdsf(CO,w,n,&g);
427: if ( NUM(g) )
428: dp_monic_sf(p,rp);
429: else {
430: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
431: NEXTMP(mr0,mr); divsp(CO,(P)m->c,g,(P *)&mr->c); mr->dl = m->dl;
432: }
433: NEXT(mr) = 0; MKDP(p->nv,mr0,p1); p1->sugar = p->sugar;
434: dp_monic_sf(p1,rp);
435: }
436: return;
437: } else if ( dp_fcoeffs )
438: *rp = p;
439: else if ( NoGCD )
440: dp_ptozp(p,rp);
441: else {
442: dp_ptozp(p,&p1); p = p1;
443: for ( m = BDY(p), n = 0; m; m = NEXT(m), n++ );
444: if ( n == 1 ) {
445: m = BDY(p);
446: NEWMP(mr); mr->dl = m->dl; mr->c = (Obj)ONE; NEXT(mr) = 0;
447: MKDP(p->nv,mr,*rp); (*rp)->sugar = p->sugar;
448: return;
449: }
450: w = (P *)ALLOCA(n*sizeof(P));
451: c = (Q *)ALLOCA(n*sizeof(Q));
452: for ( m =BDY(p), i = 0; i < n; m = NEXT(m), i++ )
453: if ( NUM(m->c) ) {
454: c[i] = (Q)m->c; w[i] = (P)ONE;
455: } else
456: ptozp((P)m->c,1,&c[i],&w[i]);
457: qltozl(c,n,&dvr); heu_nezgcdnpz(CO,w,n,&t); mulp(CO,t,(P)dvr,&g);
458: if ( NUM(g) )
459: *rp = p;
460: else {
461: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
462: NEXTMP(mr0,mr); divsp(CO,(P)m->c,g,(P *)&mr->c); mr->dl = m->dl;
463: }
464: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
465: add_denomlist(g);
466: }
467: }
468: }
469:
470: void heu_nezgcdnpz(VL vl,P *pl,int m,P *pr)
471: {
472: int i,r;
473: P gcd,t,s1,s2,u;
474: Z rq;
475: DCP dc;
476: extern int DP_Print;
477:
478: while ( 1 ) {
479: for ( i = 0, s1 = 0; i < m; i++ ) {
1.2 noro 480: r = random(); UTOZ(r,rq);
1.1 noro 481: mulp(vl,pl[i],(P)rq,&t); addp(vl,s1,t,&u); s1 = u;
482: }
483: for ( i = 0, s2 = 0; i < m; i++ ) {
1.2 noro 484: r = random(); UTOZ(r,rq);
1.1 noro 485: mulp(vl,pl[i],(P)rq,&t); addp(vl,s2,t,&u); s2 = u;
486: }
487: ezgcdp(vl,s1,s2,&gcd);
488: if ( DP_Print > 2 )
489: { fprintf(asir_out,"(%d)",nmonop(gcd)); fflush(asir_out); }
490: for ( i = 0; i < m; i++ ) {
491: if ( !divtpz(vl,pl[i],gcd,&t) )
492: break;
493: }
494: if ( i == m )
495: break;
496: }
497: *pr = gcd;
498: }
499:
500: void dp_prim_mod(DP p,int mod,DP *rp)
501: {
502: P t,g;
503: MP m,mr,mr0;
504:
505: if ( !p )
506: *rp = 0;
507: else if ( NoGCD )
508: *rp = p;
509: else {
510: for ( m = BDY(p), g = (P)m->c, m = NEXT(m); m; m = NEXT(m) ) {
511: gcdprsmp(CO,mod,g,(P)m->c,&t); g = t;
512: }
513: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
514: NEXTMP(mr0,mr); divsmp(CO,mod,(P)m->c,g,(P *)&mr->c); mr->dl = m->dl;
515: }
516: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
517: }
518: }
519:
520: void dp_cont(DP p,Z *rp)
521: {
522: VECT v;
523:
524: dp_dtov(p,&v); gcdvz(v,rp);
525: }
526:
527: void dp_dtov(DP dp,VECT *rp)
528: {
529: MP m,t;
530: int i,n;
531: VECT v;
532: pointer *p;
533:
534: m = BDY(dp);
535: for ( t = m, n = 0; t; t = NEXT(t), n++ );
536: MKVECT(v,n);
537: for ( i = 0, p = BDY(v), t = m; i < n; t = NEXT(t), i++ )
538: p[i] = (pointer)(t->c);
539: *rp = v;
540: }
541:
542: /*
543: * s-poly computation
544: *
545: */
546:
547: void dp_sp(DP p1,DP p2,DP *rp)
548: {
549: int i,n,td;
550: int *w;
551: DL d1,d2,d;
552: MP m;
553: DP t,s1,s2,u;
554: Z c,c1,c2;
555: Z gn;
556:
557: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
558: w = (int *)ALLOCA(n*sizeof(int));
559: for ( i = 0, td = 0; i < n; i++ ) {
560: w[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(w[i],i);
561: }
562:
563: NEWDL(d,n); d->td = td - d1->td;
564: for ( i = 0; i < n; i++ )
565: d->d[i] = w[i] - d1->d[i];
566: c1 = (Z)BDY(p1)->c; c2 = (Z)BDY(p2)->c;
567: if ( INT(c1) && INT(c2) ) {
568: gcdz(c1,c2,&gn);
569: if ( !UNIQ(gn) ) {
1.2 noro 570: divsz(c1,gn,&c); c1 = c;
571: divsz(c2,gn,&c);c2 = c;
1.1 noro 572: }
573: }
574:
575: NEWMP(m); m->dl = d; m->c = (Obj)c2; NEXT(m) = 0;
576: MKDP(n,m,s1); s1->sugar = d->td; muld(CO,s1,p1,&t);
577:
578: NEWDL(d,n); d->td = td - d2->td;
579: for ( i = 0; i < n; i++ )
580: d->d[i] = w[i] - d2->d[i];
581: NEWMP(m); m->dl = d; m->c = (Obj)c1; NEXT(m) = 0;
582: MKDP(n,m,s2); s2->sugar = d->td; muld(CO,s2,p2,&u);
583:
584: subd(CO,t,u,rp);
585: if ( GenTrace ) {
586: LIST hist;
587: NODE node;
588:
589: node = mknode(4,ONE,NULLP,s1,ONE);
590: MKLIST(hist,node);
591: MKNODE(TraceList,hist,0);
592:
593: node = mknode(4,ONE,NULLP,NULLP,ONE);
594: chsgnd(s2,(DP *)&ARG2(node));
595: MKLIST(hist,node);
596: MKNODE(node,hist,TraceList); TraceList = node;
597: }
598: }
599:
1.3 noro 600: void dpm_sp(DPM p1,DPM p2,DPM *rp,DP *mul1,DP *mul2)
1.1 noro 601: {
602: int i,n,td;
603: int *w;
604: DL d1,d2,d;
605: MP m;
606: DP s1,s2;
607: DPM t,u;
608: Z c,c1,c2;
609: Z gn;
610:
611: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
612: if ( BDY(p1)->pos != BDY(p2)->pos ) {
1.3 noro 613: *mul1 = 0; *mul2 = 0; *rp = 0;
1.1 noro 614: return;
615: }
616: w = (int *)ALLOCA(n*sizeof(int));
617: for ( i = 0, td = 0; i < n; i++ ) {
618: w[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(w[i],i);
619: }
620:
621: NEWDL(d,n); d->td = td - d1->td;
622: for ( i = 0; i < n; i++ )
623: d->d[i] = w[i] - d1->d[i];
624: c1 = (Z)BDY(p1)->c; c2 = (Z)BDY(p2)->c;
625: if ( INT(c1) && INT(c2) ) {
626: gcdz(c1,c2,&gn);
627: if ( !UNIQ(gn) ) {
1.2 noro 628: divsz(c1,gn,&c); c1 = c;
629: divsz(c2,gn,&c);c2 = c;
1.1 noro 630: }
631: }
632:
633: NEWMP(m); m->dl = d; m->c = (Obj)c2; NEXT(m) = 0;
634: MKDP(n,m,s1); s1->sugar = d->td; mulobjdpm(CO,(Obj)s1,p1,&t);
1.3 noro 635: *mul1 = s1;
1.1 noro 636:
637: NEWDL(d,n); d->td = td - d2->td;
638: for ( i = 0; i < n; i++ )
639: d->d[i] = w[i] - d2->d[i];
640: NEWMP(m); m->dl = d; m->c = (Obj)c1; NEXT(m) = 0;
641: MKDP(n,m,s2); s2->sugar = d->td; mulobjdpm(CO,(Obj)s2,p2,&u);
1.3 noro 642: *mul2 = s2;
1.1 noro 643:
644: subdpm(CO,t,u,rp);
645: if ( GenTrace ) {
646: LIST hist;
647: NODE node;
648:
649: node = mknode(4,ONE,NULLP,s1,ONE);
650: MKLIST(hist,node);
651: MKNODE(TraceList,hist,0);
652:
653: node = mknode(4,ONE,NULLP,NULLP,ONE);
654: chsgnd(s2,(DP *)&ARG2(node));
655: MKLIST(hist,node);
656: MKNODE(node,hist,TraceList); TraceList = node;
657: }
658: }
659:
1.4 noro 660: DP dpm_sp_hm(DPM p1,DPM p2)
661: {
662: int i,n,td;
663: int *w;
664: DL d1,d2,d;
665: MP m;
666: DP s1;
667:
668: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
669: if ( BDY(p1)->pos != BDY(p2)->pos ) {
670: return 0;
671: }
672: w = (int *)ALLOCA(n*sizeof(int));
673: for ( i = 0, td = 0; i < n; i++ ) {
674: w[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(w[i],i);
675: }
676:
677: NEWDL(d,n); d->td = td - d1->td;
678: for ( i = 0; i < n; i++ )
679: d->d[i] = w[i] - d1->d[i];
680:
681: NEWMP(m); m->dl = d; m->c = (Obj)ONE; NEXT(m) = 0;
682: MKDP(n,m,s1); s1->sugar = d->td;
683: return s1;
684: }
685:
1.1 noro 686: void _dp_sp_dup(DP p1,DP p2,DP *rp)
687: {
688: int i,n,td;
689: int *w;
690: DL d1,d2,d;
691: MP m;
692: DP t,s1,s2,u;
693: Z c,c1,c2;
694: Z gn;
695:
696: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
697: w = (int *)ALLOCA(n*sizeof(int));
698: for ( i = 0, td = 0; i < n; i++ ) {
699: w[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(w[i],i);
700: }
701:
702: _NEWDL(d,n); d->td = td - d1->td;
703: for ( i = 0; i < n; i++ )
704: d->d[i] = w[i] - d1->d[i];
705: c1 = (Z)BDY(p1)->c; c2 = (Z)BDY(p2)->c;
706: if ( INT(c1) && INT(c2) ) {
707: gcdz(c1,c2,&gn);
708: if ( !UNIQ(gn) ) {
1.2 noro 709: divsz(c1,gn,&c); c1 = c;
710: divsz(c2,gn,&c);c2 = c;
1.1 noro 711: }
712: }
713:
714: _NEWMP(m); m->dl = d; m->c = (Obj)c2; NEXT(m) = 0;
715: _MKDP(n,m,s1); s1->sugar = d->td; _muld_dup(CO,s1,p1,&t); _free_dp(s1);
716:
717: _NEWDL(d,n); d->td = td - d2->td;
718: for ( i = 0; i < n; i++ )
719: d->d[i] = w[i] - d2->d[i];
720: _NEWMP(m); m->dl = d; chsgnp((P)c1,(P *)&m->c); NEXT(m) = 0;
721: _MKDP(n,m,s2); s2->sugar = d->td; _muld_dup(CO,s2,p2,&u); _free_dp(s2);
722:
723: _addd_destructive(CO,t,u,rp);
724: if ( GenTrace ) {
725: LIST hist;
726: NODE node;
727:
728: node = mknode(4,ONE,NULLP,s1,ONE);
729: MKLIST(hist,node);
730: MKNODE(TraceList,hist,0);
731:
732: node = mknode(4,ONE,NULLP,NULLP,ONE);
733: chsgnd(s2,(DP *)&ARG2(node));
734: MKLIST(hist,node);
735: MKNODE(node,hist,TraceList); TraceList = node;
736: }
737: }
738:
739: void dp_sp_mod(DP p1,DP p2,int mod,DP *rp)
740: {
741: int i,n,td;
742: int *w;
743: DL d1,d2,d;
744: MP m;
745: DP t,s,u;
746:
747: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
748: w = (int *)ALLOCA(n*sizeof(int));
749: for ( i = 0, td = 0; i < n; i++ ) {
750: w[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(w[i],i);
751: }
752: NEWDL_NOINIT(d,n); d->td = td - d1->td;
753: for ( i = 0; i < n; i++ )
754: d->d[i] = w[i] - d1->d[i];
755: NEWMP(m); m->dl = d; m->c = (Obj)BDY(p2)->c; NEXT(m) = 0;
756: MKDP(n,m,s); s->sugar = d->td; mulmd(CO,mod,p1,s,&t);
757: NEWDL_NOINIT(d,n); d->td = td - d2->td;
758: for ( i = 0; i < n; i++ )
759: d->d[i] = w[i] - d2->d[i];
760: NEWMP(m); m->dl = d; m->c = (Obj)BDY(p1)->c; NEXT(m) = 0;
761: MKDP(n,m,s); s->sugar = d->td; mulmd(CO,mod,p2,s,&u);
762: submd(CO,mod,t,u,rp);
763: }
764:
765: void _dp_sp_mod_dup(DP p1,DP p2,int mod,DP *rp)
766: {
767: int i,n,td;
768: int *w;
769: DL d1,d2,d;
770: MP m;
771: DP t,s,u;
772:
773: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
774: w = (int *)ALLOCA(n*sizeof(int));
775: for ( i = 0, td = 0; i < n; i++ ) {
776: w[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(w[i],i);
777: }
778: _NEWDL(d,n); d->td = td - d1->td;
779: for ( i = 0; i < n; i++ )
780: d->d[i] = w[i] - d1->d[i];
781: _NEWMP(m); m->dl = d; m->c = BDY(p2)->c; NEXT(m) = 0;
782: _MKDP(n,m,s); s->sugar = d->td; _mulmd_dup(mod,s,p1,&t); _free_dp(s);
783: _NEWDL(d,n); d->td = td - d2->td;
784: for ( i = 0; i < n; i++ )
785: d->d[i] = w[i] - d2->d[i];
786: _NEWMP(m); m->dl = d; m->c = (Obj)STOI(mod - ITOS(BDY(p1)->c)); NEXT(m) = 0;
787: _MKDP(n,m,s); s->sugar = d->td; _mulmd_dup(mod,s,p2,&u); _free_dp(s);
788: _addmd_destructive(mod,t,u,rp);
789: }
790:
791: void _dp_sp_mod(DP p1,DP p2,int mod,DP *rp)
792: {
793: int i,n,td;
794: int *w;
795: DL d1,d2,d;
796: MP m;
797: DP t,s,u;
798:
799: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
800: w = (int *)ALLOCA(n*sizeof(int));
801: for ( i = 0, td = 0; i < n; i++ ) {
802: w[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(w[i],i);
803: }
804: NEWDL(d,n); d->td = td - d1->td;
805: for ( i = 0; i < n; i++ )
806: d->d[i] = w[i] - d1->d[i];
807: NEWMP(m); m->dl = d; m->c = BDY(p2)->c; NEXT(m) = 0;
808: MKDP(n,m,s); s->sugar = d->td; mulmd_dup(mod,s,p1,&t);
809: NEWDL(d,n); d->td = td - d2->td;
810: for ( i = 0; i < n; i++ )
811: d->d[i] = w[i] - d2->d[i];
812: NEWMP(m); m->dl = d; m->c = (Obj)STOI(mod - ITOS(BDY(p1)->c)); NEXT(m) = 0;
813: MKDP(n,m,s); s->sugar = d->td; mulmd_dup(mod,s,p2,&u);
814: addmd_destructive(mod,t,u,rp);
815: }
816:
817: /*
818: * m-reduction
819: * do content reduction over Z or Q(x,...)
820: * do nothing over finite fields
821: *
1.3 noro 822: * head+rest = dn*(p0+p1)+mult*p2
1.1 noro 823: */
824:
825: void dp_red(DP p0,DP p1,DP p2,DP *head,DP *rest,P *dnp,DP *multp)
826: {
827: int i,n;
828: DL d1,d2,d;
829: MP m;
830: DP t,s,r,h;
831: Z c,c1,c2,gn;
832: P g,a;
833: P p[2];
834:
835: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
836: NEWDL(d,n); d->td = d1->td - d2->td;
837: for ( i = 0; i < n; i++ )
838: d->d[i] = d1->d[i]-d2->d[i];
839: c1 = (Z)BDY(p1)->c; c2 = (Z)BDY(p2)->c;
840: if ( dp_fcoeffs == N_GFS ) {
841: p[0] = (P)c1; p[1] = (P)c2;
842: gcdsf(CO,p,2,&g);
843: divsp(CO,(P)c1,g,&a); c1 = (Z)a; divsp(CO,(P)c2,g,&a); c2 = (Z)a;
844: } else if ( dp_fcoeffs ) {
845: /* do nothing */
846: } else if ( INT(c1) && INT(c2) ) {
847: gcdz(c1,c2,&gn);
848: if ( !UNIQ(gn) ) {
1.2 noro 849: divsz(c1,gn,&c); c1 = c;
850: divsz(c2,gn,&c); c2 = c;
1.1 noro 851: }
852: } else {
853: ezgcdpz(CO,(P)c1,(P)c2,&g);
854: divsp(CO,(P)c1,g,&a); c1 = (Z)a; divsp(CO,(P)c2,g,&a); c2 = (Z)a;
855: add_denomlist(g);
856: }
857: NEWMP(m); m->dl = d; chsgnp((P)c1,(P *)&m->c); NEXT(m) = 0; MKDP(n,m,s); s->sugar = d->td;
858: *multp = s;
859: muld(CO,s,p2,&t); muldc(CO,p1,(Obj)c2,&s); addd(CO,s,t,&r);
860: muldc(CO,p0,(Obj)c2,&h);
861: *head = h; *rest = r; *dnp = (P)c2;
862: }
863:
1.3 noro 864: // head+rest = dn*(p0+p1)-mult*p2
1.1 noro 865: void dpm_red(DPM p0,DPM p1,DPM p2,DPM *head,DPM *rest,P *dnp,DP *multp)
866: {
867: int i,n,pos;
868: DL d1,d2,d;
869: MP m;
1.4 noro 870: DP s,ms;
1.1 noro 871: DPM t,r,h,u,w;
872: Z c,c1,c2,gn;
873: P g,a;
874: P p[2];
875:
876: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; pos = BDY(p1)->pos;
877: if ( pos != BDY(p2)->pos )
878: error("dpm_red : cannot happen");
879: NEWDL(d,n); d->td = d1->td - d2->td;
880: for ( i = 0; i < n; i++ )
881: d->d[i] = d1->d[i]-d2->d[i];
882: c1 = (Z)BDY(p1)->c; c2 = (Z)BDY(p2)->c;
883: if ( dp_fcoeffs == N_GFS ) {
884: p[0] = (P)c1; p[1] = (P)c2;
885: gcdsf(CO,p,2,&g);
886: divsp(CO,(P)c1,g,&a); c1 = (Z)a; divsp(CO,(P)c2,g,&a); c2 = (Z)a;
887: } else if ( dp_fcoeffs ) {
888: /* do nothing */
889: } else if ( INT(c1) && INT(c2) ) {
890: gcdz(c1,c2,&gn);
891: if ( !UNIQ(gn) ) {
1.2 noro 892: divsz(c1,gn,&c); c1 = c;
893: divsz(c2,gn,&c); c2 = c;
1.1 noro 894: }
895: } else {
896: ezgcdpz(CO,(P)c1,(P)c2,&g);
897: divsp(CO,(P)c1,g,&a); c1 = (Z)a; divsp(CO,(P)c2,g,&a); c2 = (Z)a;
898: add_denomlist(g);
899: }
1.3 noro 900: NEWMP(m); m->dl = d; m->c = (Obj)c1; NEXT(m) = 0; MKDP(n,m,s); s->sugar = d->td;
1.1 noro 901: *multp = s;
1.4 noro 902: chsgnd(s,&ms); mulobjdpm(CO,(Obj)ms,p2,&u); mulobjdpm(CO,(Obj)c2,p1,&w); adddpm(CO,w,u,&r);
1.1 noro 903: mulobjdpm(CO,(Obj)c2,p0,&h);
904: *head = h; *rest = r; *dnp = (P)c2;
905: }
906:
1.5 noro 907: void dpm_red2(DPM p1,DPM p2,DPM *rest,P *dnp,DP *multp)
908: {
909: int i,n,pos;
910: DL d1,d2,d;
911: MP m;
912: DP s,ms;
913: DPM t,r,h,u,w;
914: Z c,c1,c2,gn;
915: P g,a;
916: P p[2];
917:
918: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; pos = BDY(p1)->pos;
919: if ( pos != BDY(p2)->pos )
920: error("dpm_red : cannot happen");
921: NEWDL(d,n); d->td = d1->td - d2->td;
922: for ( i = 0; i < n; i++ )
923: d->d[i] = d1->d[i]-d2->d[i];
924: c1 = (Z)BDY(p1)->c; c2 = (Z)BDY(p2)->c;
925: if ( dp_fcoeffs == N_GFS ) {
926: p[0] = (P)c1; p[1] = (P)c2;
927: gcdsf(CO,p,2,&g);
928: divsp(CO,(P)c1,g,&a); c1 = (Z)a; divsp(CO,(P)c2,g,&a); c2 = (Z)a;
929: } else if ( dp_fcoeffs ) {
930: /* do nothing */
931: } else if ( INT(c1) && INT(c2) ) {
932: gcdz(c1,c2,&gn);
933: if ( !UNIQ(gn) ) {
934: divsz(c1,gn,&c); c1 = c;
935: divsz(c2,gn,&c); c2 = c;
936: }
937: } else {
938: ezgcdpz(CO,(P)c1,(P)c2,&g);
939: divsp(CO,(P)c1,g,&a); c1 = (Z)a; divsp(CO,(P)c2,g,&a); c2 = (Z)a;
940: add_denomlist(g);
941: }
942: NEWMP(m); m->dl = d; m->c = (Obj)c1; NEXT(m) = 0; MKDP(n,m,s); s->sugar = d->td;
943: *multp = s;
944: chsgnd(s,&ms); mulobjdpm(CO,(Obj)ms,p2,&u); mulobjdpm(CO,(Obj)c2,p1,&w); adddpm(CO,w,u,&r);
945: *rest = r; *dnp = (P)c2;
946: }
1.1 noro 947:
948: /*
949: * m-reduction by a marked poly
950: * do content reduction over Z or Q(x,...)
951: * do nothing over finite fields
952: *
953: */
954:
955:
956: void dp_red_marked(DP p0,DP p1,DP p2,DP hp2,DP *head,DP *rest,P *dnp,DP *multp)
957: {
958: int i,n;
959: DL d1,d2,d;
960: MP m;
961: DP t,s,r,h;
962: Z c,c1,c2,gn;
963: P g,a;
964: P p[2];
965:
966: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(hp2)->dl;
967: NEWDL(d,n); d->td = d1->td - d2->td;
968: for ( i = 0; i < n; i++ )
969: d->d[i] = d1->d[i]-d2->d[i];
970: c1 = (Z)BDY(p1)->c; c2 = (Z)BDY(hp2)->c;
971: if ( dp_fcoeffs == N_GFS ) {
972: p[0] = (P)c1; p[1] = (P)c2;
973: gcdsf(CO,p,2,&g);
974: divsp(CO,(P)c1,g,&a); c1 = (Z)a; divsp(CO,(P)c2,g,&a); c2 = (Z)a;
975: } else if ( dp_fcoeffs ) {
976: /* do nothing */
977: } else if ( INT(c1) && INT(c2) ) {
978: gcdz(c1,c2,&gn);
979: if ( !UNIQ(gn) ) {
1.2 noro 980: divsz(c1,gn,&c); c1 = c;
981: divsz(c2,gn,&c); c2 = c;
1.1 noro 982: }
983: } else {
984: ezgcdpz(CO,(P)c1,(P)c2,&g);
985: divsp(CO,(P)c1,g,&a); c1 = (Z)a; divsp(CO,(P)c2,g,&a); c2 = (Z)a;
986: }
987: NEWMP(m); m->dl = d; m->c = (Obj)c1; NEXT(m) = 0; MKDP(n,m,s); s->sugar = d->td;
988: *multp = s;
989: muld(CO,s,p2,&t); muldc(CO,p1,(Obj)c2,&s); subd(CO,s,t,&r);
990: muldc(CO,p0,(Obj)c2,&h);
991: *head = h; *rest = r; *dnp = (P)c2;
992: }
993:
994: void dp_red_marked_mod(DP p0,DP p1,DP p2,DP hp2,int mod,DP *head,DP *rest,P *dnp,DP *multp)
995: {
996: int i,n;
997: DL d1,d2,d;
998: MP m;
999: DP t,s,r,h;
1000: P c1,c2,g,u;
1001:
1002: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(hp2)->dl;
1003: NEWDL(d,n); d->td = d1->td - d2->td;
1004: for ( i = 0; i < n; i++ )
1005: d->d[i] = d1->d[i]-d2->d[i];
1006: c1 = (P)BDY(p1)->c; c2 = (P)BDY(hp2)->c;
1007: gcdprsmp(CO,mod,c1,c2,&g);
1008: divsmp(CO,mod,c1,g,&u); c1 = u; divsmp(CO,mod,c2,g,&u); c2 = u;
1009: if ( NUM(c2) ) {
1010: divsmp(CO,mod,c1,c2,&u); c1 = u; c2 = (P)ONEM;
1011: }
1012: NEWMP(m); m->dl = d; m->c = (Obj)c1; NEXT(m) = 0;
1013: MKDP(n,m,s); s->sugar = d->td;
1014: *multp = s;
1015: mulmd(CO,mod,s,p2,&t);
1016: if ( NUM(c2) ) {
1017: submd(CO,mod,p1,t,&r); h = p0;
1018: } else {
1019: mulmdc(CO,mod,p1,c2,&s); submd(CO,mod,s,t,&r); mulmdc(CO,mod,p0,c2,&h);
1020: }
1021: *head = h; *rest = r; *dnp = c2;
1022: }
1023:
1024: /* m-reduction over a field */
1025:
1026: void dp_red_f(DP p1,DP p2,DP *rest)
1027: {
1028: int i,n;
1029: DL d1,d2,d;
1030: MP m;
1031: DP t,s;
1032: Obj a,b;
1033:
1034: n = p1->nv;
1035: d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
1036:
1037: NEWDL(d,n); d->td = d1->td - d2->td;
1038: for ( i = 0; i < n; i++ )
1039: d->d[i] = d1->d[i]-d2->d[i];
1040:
1041: NEWMP(m); m->dl = d;
1042: divr(CO,(Obj)BDY(p1)->c,(Obj)BDY(p2)->c,&a); chsgnr(a,&b);
1043: C(m) = (Obj)b;
1044: NEXT(m) = 0; MKDP(n,m,s); s->sugar = d->td;
1045:
1046: muld(CO,s,p2,&t); addd(CO,p1,t,rest);
1047: }
1048:
1049: void dpm_red_f(DPM p1,DPM p2,DPM *rest)
1050: {
1051: int i,n;
1052: DL d1,d2,d;
1053: MP m;
1054: DPM t;
1055: DP s;
1056: Obj a,b;
1057:
1058: n = p1->nv;
1059: d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
1060:
1061: NEWDL(d,n); d->td = d1->td - d2->td;
1062: for ( i = 0; i < n; i++ )
1063: d->d[i] = d1->d[i]-d2->d[i];
1064:
1065: NEWMP(m); m->dl = d;
1066: arf_div(CO,(Obj)BDY(p1)->c,(Obj)BDY(p2)->c,&a); arf_chsgn(a,&b);
1067: C(m) = b;
1068: NEXT(m) = 0; MKDP(n,m,s); s->sugar = d->td;
1069:
1070: mulobjdpm(CO,(Obj)s,p2,&t); adddpm(CO,p1,t,rest);
1071: }
1072:
1073:
1074: void dp_red_mod(DP p0,DP p1,DP p2,int mod,DP *head,DP *rest,P *dnp)
1075: {
1076: int i,n;
1077: DL d1,d2,d;
1078: MP m;
1079: DP t,s,r,h;
1080: P c1,c2,g,u;
1081:
1082: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
1083: NEWDL(d,n); d->td = d1->td - d2->td;
1084: for ( i = 0; i < n; i++ )
1085: d->d[i] = d1->d[i]-d2->d[i];
1086: c1 = (P)BDY(p1)->c; c2 = (P)BDY(p2)->c;
1087: gcdprsmp(CO,mod,c1,c2,&g);
1088: divsmp(CO,mod,c1,g,&u); c1 = u; divsmp(CO,mod,c2,g,&u); c2 = u;
1089: if ( NUM(c2) ) {
1090: divsmp(CO,mod,c1,c2,&u); c1 = u; c2 = (P)ONEM;
1091: }
1092: NEWMP(m); m->dl = d; chsgnmp(mod,(P)c1,(P *)&m->c); NEXT(m) = 0;
1093: MKDP(n,m,s); s->sugar = d->td; mulmd(CO,mod,s,p2,&t);
1094: if ( NUM(c2) ) {
1095: addmd(CO,mod,p1,t,&r); h = p0;
1096: } else {
1097: mulmdc(CO,mod,p1,c2,&s); addmd(CO,mod,s,t,&r); mulmdc(CO,mod,p0,c2,&h);
1098: }
1099: *head = h; *rest = r; *dnp = c2;
1100: }
1101:
1102: struct oEGT eg_red_mod;
1103:
1104: void _dp_red_mod_destructive(DP p1,DP p2,int mod,DP *rp)
1105: {
1106: int i,n;
1107: DL d1,d2,d;
1108: MP m;
1109: DP t,s;
1110: int c,c1,c2;
1111: extern int do_weyl;
1112:
1113: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
1114: _NEWDL(d,n); d->td = d1->td - d2->td;
1115: for ( i = 0; i < n; i++ )
1116: d->d[i] = d1->d[i]-d2->d[i];
1117: c = invm(ITOS(BDY(p2)->c),mod);
1118: c2 = ITOS(BDY(p1)->c);
1119: DMAR(c,c2,0,mod,c1);
1120: _NEWMP(m); m->dl = d; m->c = (Obj)STOI(mod-c1); NEXT(m) = 0;
1121: #if 0
1122: _MKDP(n,m,s); s->sugar = d->td;
1123: _mulmd_dup(mod,s,p2,&t); _free_dp(s);
1124: #else
1125: if ( do_weyl ) {
1126: _MKDP(n,m,s); s->sugar = d->td;
1127: _mulmd_dup(mod,s,p2,&t); _free_dp(s);
1128: } else {
1129: _mulmdm_dup(mod,p2,m,&t); _FREEMP(m);
1130: }
1131: #endif
1132: /* get_eg(&t0); */
1133: _addmd_destructive(mod,p1,t,rp);
1134: /* get_eg(&t1); add_eg(&eg_red_mod,&t0,&t1); */
1135: }
1136:
1137: /*
1138: * normal form computation
1139: *
1140: */
1141:
1142: void dp_true_nf(NODE b,DP g,DP *ps,int full,DP *rp,P *dnp)
1143: {
1144: DP u,p,d,s,t,dmy;
1145: NODE l;
1146: MP m,mr;
1147: int i,n;
1148: int *wb;
1149: int sugar,psugar;
1150: P dn,tdn,tdn1;
1151:
1152: dn = (P)ONE;
1153: if ( !g ) {
1154: *rp = 0; *dnp = dn; return;
1155: }
1156: for ( n = 0, l = b; l; l = NEXT(l), n++ );
1157: wb = (int *)ALLOCA(n*sizeof(int));
1158: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1159: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 1160: sugar = g->sugar;
1161: for ( d = 0; g; ) {
1162: for ( u = 0, i = 0; i < n; i++ ) {
1163: if ( dp_redble(g,p = ps[wb[i]]) ) {
1164: dp_red(d,g,p,&t,&u,&tdn,&dmy);
1165: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1166: sugar = MAX(sugar,psugar);
1167: if ( !u ) {
1168: if ( d )
1169: d->sugar = sugar;
1170: *rp = d; *dnp = dn; return;
1171: } else {
1172: d = t;
1173: mulp(CO,dn,tdn,&tdn1); dn = tdn1;
1174: }
1175: break;
1176: }
1177: }
1178: if ( u )
1179: g = u;
1180: else if ( !full ) {
1181: if ( g ) {
1182: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
1183: }
1184: *rp = g; *dnp = dn; return;
1185: } else {
1186: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1187: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1188: addd(CO,d,t,&s); d = s;
1189: dp_rest(g,&t); g = t;
1190: }
1191: }
1192: if ( d )
1193: d->sugar = sugar;
1194: *rp = d; *dnp = dn;
1195: }
1196:
1197: void dp_removecont2(DP p1,DP p2,DP *r1p,DP *r2p,Z *contp)
1198: {
1199: struct oVECT v;
1200: int i,n1,n2,n;
1201: MP m,m0,t;
1202: Z *w;
1203: Z h;
1204:
1205: if ( p1 ) {
1206: for ( i = 0, m = BDY(p1); m; m = NEXT(m), i++ );
1207: n1 = i;
1208: } else
1209: n1 = 0;
1210: if ( p2 ) {
1211: for ( i = 0, m = BDY(p2); m; m = NEXT(m), i++ );
1212: n2 = i;
1213: } else
1214: n2 = 0;
1215: n = n1+n2;
1216: if ( !n ) {
1217: *r1p = 0; *r2p = 0; *contp = ONE; return;
1218: }
1219: w = (Z *)ALLOCA(n*sizeof(Q));
1220: v.len = n;
1221: v.body = (pointer *)w;
1222: i = 0;
1223: if ( p1 )
1224: for ( m = BDY(p1); i < n1; m = NEXT(m), i++ ) w[i] = (Z)m->c;
1225: if ( p2 )
1226: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = (Z)m->c;
1.2 noro 1227: h = w[0]; removecont_array((P *)w,n,1); divsz(h,w[0],contp);
1.1 noro 1228: i = 0;
1229: if ( p1 ) {
1230: for ( m0 = 0, t = BDY(p1); i < n1; i++, t = NEXT(t) ) {
1231: NEXTMP(m0,m); m->c = (Obj)w[i]; m->dl = t->dl;
1232: }
1233: NEXT(m) = 0;
1234: MKDP(p1->nv,m0,*r1p); (*r1p)->sugar = p1->sugar;
1235: } else
1236: *r1p = 0;
1237: if ( p2 ) {
1238: for ( m0 = 0, t = BDY(p2); i < n; i++, t = NEXT(t) ) {
1239: NEXTMP(m0,m); m->c = (Obj)w[i]; m->dl = t->dl;
1240: }
1241: NEXT(m) = 0;
1242: MKDP(p2->nv,m0,*r2p); (*r2p)->sugar = p2->sugar;
1243: } else
1244: *r2p = 0;
1245: }
1246:
1.8 ! noro 1247: void dpm_removecont2(DPM p1,DPM p2,DPM *r1p,DPM *r2p,Z *contp)
! 1248: {
! 1249: struct oVECT v;
! 1250: int i,n1,n2,n;
! 1251: DMM m,m0,t;
! 1252: Z *w;
! 1253: Z h;
! 1254:
! 1255: if ( p1 ) {
! 1256: for ( i = 0, m = BDY(p1); m; m = NEXT(m), i++ );
! 1257: n1 = i;
! 1258: } else
! 1259: n1 = 0;
! 1260: if ( p2 ) {
! 1261: for ( i = 0, m = BDY(p2); m; m = NEXT(m), i++ );
! 1262: n2 = i;
! 1263: } else
! 1264: n2 = 0;
! 1265: n = n1+n2;
! 1266: if ( !n ) {
! 1267: *r1p = 0; *r2p = 0; *contp = ONE; return;
! 1268: }
! 1269: w = (Z *)ALLOCA(n*sizeof(Q));
! 1270: v.len = n;
! 1271: v.body = (pointer *)w;
! 1272: i = 0;
! 1273: if ( p1 )
! 1274: for ( m = BDY(p1); i < n1; m = NEXT(m), i++ ) w[i] = (Z)m->c;
! 1275: if ( p2 )
! 1276: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = (Z)m->c;
! 1277: h = w[0]; removecont_array((P *)w,n,1); divsz(h,w[0],contp);
! 1278: i = 0;
! 1279: if ( p1 ) {
! 1280: for ( m0 = 0, t = BDY(p1); i < n1; i++, t = NEXT(t) ) {
! 1281: NEXTDMM(m0,m); m->c = (Obj)w[i]; m->dl = t->dl; m->pos = t->pos;
! 1282: }
! 1283: NEXT(m) = 0;
! 1284: MKDPM(p1->nv,m0,*r1p); (*r1p)->sugar = p1->sugar;
! 1285: } else
! 1286: *r1p = 0;
! 1287: if ( p2 ) {
! 1288: for ( m0 = 0, t = BDY(p2); i < n; i++, t = NEXT(t) ) {
! 1289: NEXTDMM(m0,m); m->c = (Obj)w[i]; m->dl = t->dl; m->pos = t->pos;
! 1290: }
! 1291: NEXT(m) = 0;
! 1292: MKDPM(p2->nv,m0,*r2p); (*r2p)->sugar = p2->sugar;
! 1293: } else
! 1294: *r2p = 0;
! 1295: }
! 1296:
1.1 noro 1297: /* true nf by a marked GB */
1298:
1299: void dp_true_nf_marked(NODE b,DP g,DP *ps,DP *hps,DP *rp,P *nmp,P *dnp)
1300: {
1301: DP u,p,d,s,t,dmy,hp;
1302: NODE l;
1303: MP m,mr;
1304: int i,n,hmag;
1305: int *wb;
1306: int sugar,psugar,multiple;
1307: P nm,tnm1,dn,tdn,tdn1;
1308: Z cont;
1309:
1310: multiple = 0;
1311: hmag = multiple*HMAG(g);
1312: nm = (P)ONE;
1313: dn = (P)ONE;
1314: if ( !g ) {
1315: *rp = 0; *dnp = dn; return;
1316: }
1317: for ( n = 0, l = b; l; l = NEXT(l), n++ );
1318: wb = (int *)ALLOCA(n*sizeof(int));
1319: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1320: wb[i] = ZTOS((Z)BDY(l));
1.1 noro 1321: sugar = g->sugar;
1322: for ( d = 0; g; ) {
1323: for ( u = 0, i = 0; i < n; i++ ) {
1324: if ( dp_redble(g,hp = hps[wb[i]]) ) {
1325: p = ps[wb[i]];
1326: dp_red_marked(d,g,p,hp,&t,&u,&tdn,&dmy);
1327: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1328: sugar = MAX(sugar,psugar);
1329: if ( !u ) {
1330: goto last;
1331: } else {
1332: d = t;
1333: mulp(CO,dn,tdn,&tdn1); dn = tdn1;
1334: }
1335: break;
1336: }
1337: }
1338: if ( u ) {
1339: g = u;
1340: if ( multiple && ((d && HMAG(d)>hmag) || (HMAG(g)>hmag)) ) {
1341: dp_removecont2(d,g,&t,&u,&cont); d = t; g = u;
1342: mulp(CO,nm,(P)cont,&tnm1); nm = tnm1;
1343: if ( d )
1344: hmag = multiple*HMAG(d);
1345: else
1346: hmag = multiple*HMAG(g);
1347: }
1348: } else {
1349: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1350: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1351: addd(CO,d,t,&s); d = s;
1352: dp_rest(g,&t); g = t;
1353: }
1354: }
1355: last:
1356: if ( d ) {
1357: dp_removecont2(d,0,&t,&u,&cont); d = t;
1358: mulp(CO,nm,(P)cont,&tnm1); nm = tnm1;
1359: d->sugar = sugar;
1360: }
1361: *rp = d; *nmp = nm; *dnp = dn;
1362: }
1363:
1364: void dp_true_nf_marked_mod(NODE b,DP g,DP *ps,DP *hps,int mod,DP *rp,P *dnp)
1365: {
1366: DP hp,u,p,d,s,t,dmy;
1367: NODE l;
1368: MP m,mr;
1369: int i,n;
1370: int *wb;
1371: int sugar,psugar;
1372: P dn,tdn,tdn1;
1373:
1374: dn = (P)ONEM;
1375: if ( !g ) {
1376: *rp = 0; *dnp = dn; return;
1377: }
1.3 noro 1378: for ( n = 0, l = b; l; l = NEXT(l), n++ )
1379: ;
1380: wb = (int *)ALLOCA(n*sizeof(int));
1.1 noro 1381: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1382: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 1383: sugar = g->sugar;
1384: for ( d = 0; g; ) {
1385: for ( u = 0, i = 0; i < n; i++ ) {
1386: if ( dp_redble(g,hp = hps[wb[i]]) ) {
1387: p = ps[wb[i]];
1388: dp_red_marked_mod(d,g,p,hp,mod,&t,&u,&tdn,&dmy);
1389: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1390: sugar = MAX(sugar,psugar);
1391: if ( !u ) {
1392: if ( d )
1393: d->sugar = sugar;
1394: *rp = d; *dnp = dn; return;
1395: } else {
1396: d = t;
1397: mulmp(CO,mod,dn,tdn,&tdn1); dn = tdn1;
1398: }
1399: break;
1400: }
1401: }
1402: if ( u )
1403: g = u;
1404: else {
1405: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1406: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1407: addmd(CO,mod,d,t,&s); d = s;
1408: dp_rest(g,&t); g = t;
1409: }
1410: }
1411: if ( d )
1412: d->sugar = sugar;
1413: *rp = d; *dnp = dn;
1414: }
1415:
1416: /* true nf by a marked GB and collect quotients */
1417:
1418: DP *dp_true_nf_and_quotient_marked (NODE b,DP g,DP *ps,DP *hps,DP *rp,P *dnp)
1419: {
1420: DP u,p,d,s,t,dmy,hp,mult;
1421: DP *q;
1422: NODE l;
1423: MP m,mr;
1424: int i,n,j;
1425: int *wb;
1426: int sugar,psugar,multiple;
1427: P nm,tnm1,dn,tdn,tdn1;
1428: Q cont;
1429:
1430: dn = (P)ONE;
1431: if ( !g ) {
1432: *rp = 0; *dnp = dn; return 0;
1433: }
1434: for ( n = 0, l = b; l; l = NEXT(l), n++ );
1435: wb = (int *)ALLOCA(n*sizeof(int));
1436: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1437: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 1438: q = (DP *)MALLOC(n*sizeof(DP));
1439: for ( i = 0; i < n; i++ ) q[i] = 0;
1440: sugar = g->sugar;
1441: for ( d = 0; g; ) {
1442: for ( u = 0, i = 0; i < n; i++ ) {
1443: if ( dp_redble(g,hp = hps[wb[i]]) ) {
1444: p = ps[wb[i]];
1445: dp_red_marked(d,g,p,hp,&t,&u,&tdn,&mult);
1446: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1447: sugar = MAX(sugar,psugar);
1448: for ( j = 0; j < n; j++ ) {
1449: muldc(CO,q[j],(Obj)tdn,&dmy); q[j] = dmy;
1450: }
1451: addd(CO,q[wb[i]],mult,&dmy); q[wb[i]] = dmy;
1452: mulp(CO,dn,tdn,&tdn1); dn = tdn1;
1453: d = t;
1454: if ( !u ) goto last;
1455: break;
1456: }
1457: }
1458: if ( u ) {
1459: g = u;
1460: } else {
1461: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1462: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1463: addd(CO,d,t,&s); d = s;
1464: dp_rest(g,&t); g = t;
1465: }
1466: }
1467: last:
1468: if ( d ) d->sugar = sugar;
1469: *rp = d; *dnp = dn;
1470: return q;
1471: }
1472:
1.5 noro 1473: struct oEGT egred;
1474:
1475: void mulcmp(Obj c,MP m);
1476: void mulcdmm(Obj c,DMM m);
1477:
1478: DP appendd(DP d,DP m)
1479: {
1480: MP t;
1481:
1482: if ( !d ) return m;
1483: for ( t = BDY(d); NEXT(t); t = NEXT(t) );
1484: NEXT(t) = BDY(m);
1485: return d;
1486: }
1487:
1488: DPM appenddpm(DPM d,DPM m)
1489: {
1490: DMM t;
1491:
1492: if ( !d ) return m;
1493: for ( t = BDY(d); NEXT(t); t = NEXT(t) );
1494: NEXT(t) = BDY(m);
1495: return d;
1496: }
1.4 noro 1497:
1.3 noro 1498: DP *dpm_nf_and_quotient(NODE b,DPM g,VECT psv,DPM *rp,P *dnp)
1499: {
1.5 noro 1500: DPM u,p,s,t,d;
1501: DP dmy,mult,zzz;
1.3 noro 1502: DPM *ps;
1503: DP *q;
1504: NODE l;
1505: DMM m,mr;
1.5 noro 1506: MP mp;
1507: int i,n,j,len,nv;
1.3 noro 1508: int *wb;
1509: int sugar,psugar,multiple;
1510: P nm,tnm1,dn,tdn,tdn1;
1511: Q cont;
1.4 noro 1512: struct oEGT eg0,eg1;
1.3 noro 1513:
1514: dn = (P)ONE;
1515: if ( !g ) {
1516: *rp = 0; *dnp = dn; return 0;
1517: }
1.5 noro 1518: nv = NV(g);
1.3 noro 1519: ps = (DPM *)BDY(psv);
1520: len = psv->len;
1521: if ( b ) {
1522: for ( n = 0, l = b; l; l = NEXT(l), n++ )
1523: ;
1524: wb = (int *)ALLOCA(n*sizeof(int));
1525: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1526: wb[i] = ZTOS((Q)BDY(l));
1527: } else {
1528: wb = (int *)ALLOCA(len*sizeof(int));
1529: for ( i = j = 0; i < len; i++ )
1530: if ( ps[i] ) wb[j++] = i;
1531: n = j;
1532: }
1533: q = (DP *)MALLOC(len*sizeof(DP));
1534: for ( i = 0; i < len; i++ ) q[i] = 0;
1535: sugar = g->sugar;
1536: for ( d = 0; g; ) {
1537: for ( u = 0, i = 0; i < n; i++ ) {
1538: if ( dpm_redble(g,p = ps[wb[i]]) ) {
1.5 noro 1539: // get_eg(&eg0);
1540: dpm_red2(g,p,&u,&tdn,&mult);
1541: // get_eg(&eg1); add_eg(&egred,&eg0,&eg1);
1.3 noro 1542: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1543: sugar = MAX(sugar,psugar);
1544: for ( j = 0; j < len; j++ ) {
1.5 noro 1545: if ( q[j] ) { mulcmp((Obj)tdn,BDY(q[j])); }
1.3 noro 1546: }
1.5 noro 1547: q[wb[i]] = appendd(q[wb[i]],mult);
1.3 noro 1548: mulp(CO,dn,tdn,&tdn1); dn = tdn1;
1.5 noro 1549: if ( d ) mulcdmm((Obj)tdn,BDY(d));
1.3 noro 1550: if ( !u ) goto last;
1551: break;
1552: }
1553: }
1554: if ( u ) {
1555: g = u;
1556: } else {
1557: m = BDY(g); NEWDMM(mr); mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos;
1558: NEXT(mr) = 0; MKDPM(g->nv,mr,t); t->sugar = mr->dl->td;
1.5 noro 1559: d = appenddpm(d,t);
1.3 noro 1560: dpm_rest(g,&t); g = t;
1561: }
1562: }
1563: last:
1564: if ( d ) d->sugar = sugar;
1565: *rp = d; *dnp = dn;
1566: return q;
1567: }
1568:
1.1 noro 1569: DP *dp_true_nf_and_quotient_marked_mod(NODE b,DP g,DP *ps,DP *hps,int mod,DP *rp,P *dnp)
1570: {
1571: DP u,p,d,s,t,dmy,hp,mult;
1572: DP *q;
1573: NODE l;
1574: MP m,mr;
1575: int i,n,j;
1576: int *wb;
1577: int sugar,psugar;
1578: P dn,tdn,tdn1;
1579:
1580: for ( n = 0, l = b; l; l = NEXT(l), n++ );
1581: q = (DP *)MALLOC(n*sizeof(DP));
1582: for ( i = 0; i < n; i++ ) q[i] = 0;
1583: dn = (P)ONEM;
1584: if ( !g ) {
1585: *rp = 0; *dnp = dn; return 0;
1586: }
1587: wb = (int *)ALLOCA(n*sizeof(int));
1588: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1589: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 1590: sugar = g->sugar;
1591: for ( d = 0; g; ) {
1592: for ( u = 0, i = 0; i < n; i++ ) {
1593: if ( dp_redble(g,hp = hps[wb[i]]) ) {
1594: p = ps[wb[i]];
1595: dp_red_marked_mod(d,g,p,hp,mod,&t,&u,&tdn,&mult);
1596: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1597: sugar = MAX(sugar,psugar);
1598: for ( j = 0; j < n; j++ ) {
1599: mulmdc(CO,mod,q[j],(P)tdn,&dmy); q[j] = dmy;
1600: }
1601: addmd(CO,mod,q[wb[i]],mult,&dmy); q[wb[i]] = dmy;
1602: mulmp(CO,mod,dn,tdn,&tdn1); dn = tdn1;
1603: d = t;
1604: if ( !u ) goto last;
1605: break;
1606: }
1607: }
1608: if ( u )
1609: g = u;
1610: else {
1611: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1612: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1613: addmd(CO,mod,d,t,&s); d = s;
1614: dp_rest(g,&t); g = t;
1615: }
1616: }
1617: last:
1618: if ( d )
1619: d->sugar = sugar;
1620: *rp = d; *dnp = dn;
1621: return q;
1622: }
1623:
1624: /* nf computation over Z */
1625:
1626: void dp_nf_z(NODE b,DP g,DP *ps,int full,int multiple,DP *rp)
1627: {
1628: DP u,p,d,s,t,dmy1;
1629: P dmy;
1630: NODE l;
1631: MP m,mr;
1632: int i,n;
1633: int *wb;
1634: int hmag;
1635: int sugar,psugar;
1636:
1637: if ( !g ) {
1638: *rp = 0; return;
1639: }
1640: for ( n = 0, l = b; l; l = NEXT(l), n++ );
1641: wb = (int *)ALLOCA(n*sizeof(int));
1642: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1643: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 1644:
1645: hmag = multiple*HMAG(g);
1646: sugar = g->sugar;
1647:
1648: for ( d = 0; g; ) {
1649: for ( u = 0, i = 0; i < n; i++ ) {
1650: if ( dp_redble(g,p = ps[wb[i]]) ) {
1651: dp_red(d,g,p,&t,&u,&dmy,&dmy1);
1652: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1653: sugar = MAX(sugar,psugar);
1654: if ( !u ) {
1655: if ( d )
1656: d->sugar = sugar;
1657: *rp = d; return;
1658: }
1659: d = t;
1660: break;
1661: }
1662: }
1663: if ( u ) {
1664: g = u;
1665: if ( d ) {
1666: if ( multiple && HMAG(d) > hmag ) {
1667: dp_ptozp2(d,g,&t,&u); d = t; g = u;
1668: hmag = multiple*HMAG(d);
1669: }
1670: } else {
1671: if ( multiple && HMAG(g) > hmag ) {
1672: dp_ptozp(g,&t); g = t;
1673: hmag = multiple*HMAG(g);
1674: }
1675: }
1676: }
1677: else if ( !full ) {
1678: if ( g ) {
1679: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
1680: }
1681: *rp = g; return;
1682: } else {
1683: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1684: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1685: addd(CO,d,t,&s); d = s;
1686: dp_rest(g,&t); g = t;
1687:
1688: }
1689: }
1690: if ( d )
1691: d->sugar = sugar;
1692: *rp = d;
1693: }
1694:
1.4 noro 1695: void dpm_nf_z(NODE b,DPM g,VECT psv,int full,int multiple,DPM *rp)
1.1 noro 1696: {
1.4 noro 1697: DPM *ps;
1.1 noro 1698: DPM u,p,d,s,t;
1699: DP dmy1;
1700: P dmy;
1.3 noro 1701: Z cont;
1.1 noro 1702: NODE l;
1703: DMM m,mr;
1704: int i,n;
1705: int *wb;
1706: int hmag;
1707: int sugar,psugar;
1708:
1709: if ( !g ) {
1710: *rp = 0; return;
1711: }
1.4 noro 1712: if ( b ) {
1713: for ( n = 0, l = b; l; l = NEXT(l), n++ );
1714: wb = (int *)ALLOCA(n*sizeof(int));
1715: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1716: wb[i] = ZTOS((Q)BDY(l));
1717: ps = (DPM *)BDY(psv);
1718: } else {
1719: n = psv->len;
1720: wb = (int *)MALLOC(n*sizeof(int));
1721: for ( i = 0; i < n; i++ ) wb[i] = i;
1722: ps = (DPM *)BDY(psv);
1723: }
1.1 noro 1724:
1725: hmag = multiple*HMAG(g);
1726: sugar = g->sugar;
1727:
1728: for ( d = 0; g; ) {
1729: for ( u = 0, i = 0; i < n; i++ ) {
1.4 noro 1730: if ( (p=ps[wb[i]])!=0 && dpm_redble(g,p) ) {
1.5 noro 1731: dpm_red2(g,p,&u,&dmy,&dmy1);
1.1 noro 1732: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1733: sugar = MAX(sugar,psugar);
1.5 noro 1734: if ( d ) mulcdmm((Obj)dmy,BDY(d));
1.1 noro 1735: if ( !u ) {
1736: if ( d )
1737: d->sugar = sugar;
1738: *rp = d; return;
1739: }
1740: break;
1741: }
1742: }
1743: if ( u ) {
1744: g = u;
1745: if ( d ) {
1746: if ( multiple && HMAG(d) > hmag ) {
1747: dpm_ptozp2(d,g,&t,&u); d = t; g = u;
1748: hmag = multiple*HMAG(d);
1749: }
1750: } else {
1751: if ( multiple && HMAG(g) > hmag ) {
1.3 noro 1752: dpm_ptozp(g,&cont,&t); g = t;
1.1 noro 1753: hmag = multiple*HMAG(g);
1754: }
1755: }
1756: }
1757: else if ( !full ) {
1758: if ( g ) {
1759: MKDPM(g->nv,BDY(g),t); t->sugar = sugar; g = t;
1760: }
1761: *rp = g; return;
1762: } else {
1763: m = BDY(g); NEWDMM(mr); mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos;
1764: NEXT(mr) = 0; MKDPM(g->nv,mr,t); t->sugar = mr->dl->td;
1.5 noro 1765: d = appenddpm(d,t);
1.1 noro 1766: dpm_rest(g,&t); g = t;
1767: }
1768: }
1769: if ( d )
1770: d->sugar = sugar;
1771: *rp = d;
1772: }
1773:
1.3 noro 1774: void dpm_shift(DPM p,int s,DPM *r)
1775: {
1776: DMM m,mr0,mr;
1777: DPM t;
1778:
1779: if ( !p ) *r = 0;
1780: else {
1781: for ( m = BDY(p), mr0 = 0; m; m = NEXT(m) ) {
1782: NEXTDMM(mr0,mr);
1783: mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos-s;
1784: if ( mr->pos <= 0 )
1785: error("dpm_shift : too large shift value");
1786: }
1787: NEXT(mr) = 0;
1788: MKDPM(p->nv,mr0,t); t->sugar = p->sugar;
1789: *r = t;
1790: }
1791: }
1792:
1793: // up=sum{c*<<...:i>>|i<=s}, lo=sum{c*<<...:i>>|i>s}
1794:
1795: void dpm_split(DPM p,int s,DPM *up,DPM *lo)
1796: {
1797: DMM m,mu0,mu,ml0,ml;
1798: DPM t;
1799:
1800: if ( !p ) {
1801: *up = 0; *lo = 0;
1802: } else {
1803: for ( m = BDY(p), mu0 = ml0 = 0; m; m = NEXT(m) ) {
1804: if ( m->pos <= s ) {
1805: NEXTDMM(mu0,mu);
1806: mu->dl = m->dl; mu->c = m->c; mu->pos = m->pos;
1807: } else {
1808: NEXTDMM(ml0,ml);
1809: ml->dl = m->dl; ml->c = m->c; ml->pos = m->pos;
1810: }
1811: }
1812: if ( mu0 ) {
1813: NEXT(mu) = 0; MKDPM(p->nv,mu0,t); t->sugar = p->sugar;
1814: *up = t;
1815: } else
1816: *up = 0;
1817: if ( ml0 ) {
1818: NEXT(ml) = 0; MKDPM(p->nv,ml0,t); t->sugar = p->sugar;
1819: *lo = t;
1820: } else
1821: *lo = 0;
1822: }
1823: }
1824:
1.1 noro 1825: /* nf computation over a field */
1826:
1827: void dp_nf_f(NODE b,DP g,DP *ps,int full,DP *rp)
1828: {
1829: DP u,p,d,s,t;
1830: NODE l;
1831: MP m,mr;
1832: int i,n;
1833: int *wb;
1834: int sugar,psugar;
1835:
1836: if ( !g ) {
1837: *rp = 0; return;
1838: }
1839: for ( n = 0, l = b; l; l = NEXT(l), n++ );
1840: wb = (int *)ALLOCA(n*sizeof(int));
1841: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1842: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 1843:
1844: sugar = g->sugar;
1845: for ( d = 0; g; ) {
1846: for ( u = 0, i = 0; i < n; i++ ) {
1847: if ( dp_redble(g,p = ps[wb[i]]) ) {
1848: dp_red_f(g,p,&u);
1849: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1850: sugar = MAX(sugar,psugar);
1851: if ( !u ) {
1852: if ( d )
1853: d->sugar = sugar;
1854: *rp = d; return;
1855: }
1856: break;
1857: }
1858: }
1859: if ( u )
1860: g = u;
1861: else if ( !full ) {
1862: if ( g ) {
1863: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
1864: }
1865: *rp = g; return;
1866: } else {
1867: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1868: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1869: addd(CO,d,t,&s); d = s;
1870: dp_rest(g,&t); g = t;
1871: }
1872: }
1873: if ( d )
1874: d->sugar = sugar;
1875: *rp = d;
1876: }
1877:
1.4 noro 1878: void dpm_nf_f(NODE b,DPM g,VECT psv,int full,DPM *rp)
1.1 noro 1879: {
1.4 noro 1880: DPM *ps;
1.1 noro 1881: DPM u,p,d,s,t;
1882: NODE l;
1883: DMM m,mr;
1884: int i,n;
1885: int *wb;
1886: int sugar,psugar;
1887:
1888: if ( !g ) {
1889: *rp = 0; return;
1890: }
1.4 noro 1891: if ( b ) {
1892: for ( n = 0, l = b; l; l = NEXT(l), n++ );
1893: wb = (int *)ALLOCA(n*sizeof(int));
1894: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1895: wb[i] = ZTOS((Q)BDY(l));
1896: ps = (DPM *)BDY(psv);
1897: } else {
1898: n = psv->len;
1899: wb = (int *)MALLOC(n*sizeof(int));
1900: for ( i = 0; i < n; i++ ) wb[i] = i;
1901: ps = (DPM *)BDY(psv);
1902: }
1.1 noro 1903:
1904: sugar = g->sugar;
1905: for ( d = 0; g; ) {
1906: for ( u = 0, i = 0; i < n; i++ ) {
1.4 noro 1907: if ( ( (p=ps[wb[i]]) != 0 ) && dpm_redble(g,p) ) {
1.1 noro 1908: dpm_red_f(g,p,&u);
1909: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1910: sugar = MAX(sugar,psugar);
1911: if ( !u ) {
1912: if ( d )
1913: d->sugar = sugar;
1914: *rp = d; return;
1915: }
1916: break;
1917: }
1918: }
1919: if ( u )
1920: g = u;
1921: else if ( !full ) {
1922: if ( g ) {
1923: MKDPM(g->nv,BDY(g),t); t->sugar = sugar; g = t;
1924: }
1925: *rp = g; return;
1926: } else {
1927: m = BDY(g); NEWDMM(mr); mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos;
1928: NEXT(mr) = 0; MKDPM(g->nv,mr,t); t->sugar = mr->dl->td;
1929: adddpm(CO,d,t,&s); d = s;
1930: dpm_rest(g,&t); g = t;
1931: }
1932: }
1933: if ( d )
1934: d->sugar = sugar;
1935: *rp = d;
1936: }
1937:
1938: /* nf computation over GF(mod) (only for internal use) */
1939:
1940: void dp_nf_mod(NODE b,DP g,DP *ps,int mod,int full,DP *rp)
1941: {
1942: DP u,p,d,s,t;
1943: P dmy;
1944: NODE l;
1945: MP m,mr;
1946: int sugar,psugar;
1947:
1948: if ( !g ) {
1949: *rp = 0; return;
1950: }
1951: sugar = g->sugar;
1952: for ( d = 0; g; ) {
1953: for ( u = 0, l = b; l; l = NEXT(l) ) {
1954: if ( dp_redble(g,p = ps[(long)BDY(l)]) ) {
1955: dp_red_mod(d,g,p,mod,&t,&u,&dmy);
1956: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1957: sugar = MAX(sugar,psugar);
1958: if ( !u ) {
1959: if ( d )
1960: d->sugar = sugar;
1961: *rp = d; return;
1962: }
1963: d = t;
1964: break;
1965: }
1966: }
1967: if ( u )
1968: g = u;
1969: else if ( !full ) {
1970: if ( g ) {
1971: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
1972: }
1973: *rp = g; return;
1974: } else {
1975: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1976: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1977: addmd(CO,mod,d,t,&s); d = s;
1978: dp_rest(g,&t); g = t;
1979: }
1980: }
1981: if ( d )
1982: d->sugar = sugar;
1983: *rp = d;
1984: }
1985:
1986: void dp_true_nf_mod(NODE b,DP g,DP *ps,int mod,int full,DP *rp,P *dnp)
1987: {
1988: DP u,p,d,s,t;
1989: NODE l;
1990: MP m,mr;
1991: int i,n;
1992: int *wb;
1993: int sugar,psugar;
1994: P dn,tdn,tdn1;
1995:
1996: dn = (P)ONEM;
1997: if ( !g ) {
1998: *rp = 0; *dnp = dn; return;
1999: }
1.3 noro 2000: for ( n = 0, l = b; l; l = NEXT(l), n++ )
2001: ;
2002: wb = (int *)ALLOCA(n*sizeof(int));
1.1 noro 2003: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 2004: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 2005: sugar = g->sugar;
2006: for ( d = 0; g; ) {
2007: for ( u = 0, i = 0; i < n; i++ ) {
2008: if ( dp_redble(g,p = ps[wb[i]]) ) {
2009: dp_red_mod(d,g,p,mod,&t,&u,&tdn);
2010: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
2011: sugar = MAX(sugar,psugar);
2012: if ( !u ) {
2013: if ( d )
2014: d->sugar = sugar;
2015: *rp = d; *dnp = dn; return;
2016: } else {
2017: d = t;
2018: mulmp(CO,mod,dn,tdn,&tdn1); dn = tdn1;
2019: }
2020: break;
2021: }
2022: }
2023: if ( u )
2024: g = u;
2025: else if ( !full ) {
2026: if ( g ) {
2027: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
2028: }
2029: *rp = g; *dnp = dn; return;
2030: } else {
2031: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
2032: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
2033: addmd(CO,mod,d,t,&s); d = s;
2034: dp_rest(g,&t); g = t;
2035: }
2036: }
2037: if ( d )
2038: d->sugar = sugar;
2039: *rp = d; *dnp = dn;
2040: }
2041:
2042: void _dp_nf_mod_destructive(NODE b,DP g,DP *ps,int mod,int full,DP *rp)
2043: {
2044: DP u,p,d;
2045: NODE l;
2046: MP m,mrd;
2047: int sugar,psugar,n,h_reducible;
2048:
2049: if ( !g ) {
2050: *rp = 0; return;
2051: }
2052: sugar = g->sugar;
2053: n = g->nv;
2054: for ( d = 0; g; ) {
2055: for ( h_reducible = 0, l = b; l; l = NEXT(l) ) {
2056: if ( dp_redble(g,p = ps[(long)BDY(l)]) ) {
2057: h_reducible = 1;
2058: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
2059: _dp_red_mod_destructive(g,p,mod,&u); g = u;
2060: sugar = MAX(sugar,psugar);
2061: if ( !g ) {
2062: if ( d )
2063: d->sugar = sugar;
2064: _dptodp(d,rp); _free_dp(d); return;
2065: }
2066: break;
2067: }
2068: }
2069: if ( !h_reducible ) {
2070: /* head term is not reducible */
2071: if ( !full ) {
2072: if ( g )
2073: g->sugar = sugar;
2074: _dptodp(g,rp); _free_dp(g); return;
2075: } else {
2076: m = BDY(g);
2077: if ( NEXT(m) ) {
2078: BDY(g) = NEXT(m); NEXT(m) = 0;
2079: } else {
2080: _FREEDP(g); g = 0;
2081: }
2082: if ( d ) {
2083: for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) );
2084: NEXT(mrd) = m;
2085: } else {
2086: _MKDP(n,m,d);
2087: }
2088: }
2089: }
2090: }
2091: if ( d )
2092: d->sugar = sugar;
2093: _dptodp(d,rp); _free_dp(d);
2094: }
2095:
2096: /* reduction by linear base over a field */
2097:
2098: void dp_lnf_f(DP p1,DP p2,NODE g,DP *r1p,DP *r2p)
2099: {
2100: DP r1,r2,b1,b2,t,s;
2101: Obj c,c1,c2;
2102: NODE l,b;
2103: int n;
2104:
2105: if ( !p1 ) {
2106: *r1p = p1; *r2p = p2; return;
2107: }
2108: n = p1->nv;
2109: for ( l = g, r1 = p1, r2 = p2; l; l = NEXT(l) ) {
2110: if ( !r1 ) {
2111: *r1p = r1; *r2p = r2; return;
2112: }
2113: b = BDY((LIST)BDY(l)); b1 = (DP)BDY(b);
2114: if ( dl_equal(n,BDY(r1)->dl,BDY(b1)->dl) ) {
2115: b2 = (DP)BDY(NEXT(b));
2116: divr(CO,(Obj)ONE,(Obj)BDY(b1)->c,&c1);
2117: mulr(CO,c1,(Obj)BDY(r1)->c,&c2); chsgnr(c2,&c);
2118: muldc(CO,b1,(Obj)c,&t); addd(CO,r1,t,&s); r1 = s;
2119: muldc(CO,b2,(Obj)c,&t); addd(CO,r2,t,&s); r2 = s;
2120: }
2121: }
2122: *r1p = r1; *r2p = r2;
2123: }
2124:
2125: /* reduction by linear base over GF(mod) */
2126:
2127: void dp_lnf_mod(DP p1,DP p2,NODE g,int mod,DP *r1p,DP *r2p)
2128: {
2129: DP r1,r2,b1,b2,t,s;
2130: P c;
2131: MQ c1,c2;
2132: NODE l,b;
2133: int n;
2134:
2135: if ( !p1 ) {
2136: *r1p = p1; *r2p = p2; return;
2137: }
2138: n = p1->nv;
2139: for ( l = g, r1 = p1, r2 = p2; l; l = NEXT(l) ) {
2140: if ( !r1 ) {
2141: *r1p = r1; *r2p = r2; return;
2142: }
2143: b = BDY((LIST)BDY(l)); b1 = (DP)BDY(b);
2144: if ( dl_equal(n,BDY(r1)->dl,BDY(b1)->dl) ) {
2145: b2 = (DP)BDY(NEXT(b));
2146: invmq(mod,(MQ)BDY(b1)->c,&c1);
2147: mulmq(mod,c1,(MQ)BDY(r1)->c,&c2); chsgnmp(mod,(P)c2,&c);
2148: mulmdc(CO,mod,b1,c,&t); addmd(CO,mod,r1,t,&s); r1 = s;
2149: mulmdc(CO,mod,b2,c,&t); addmd(CO,mod,r2,t,&s); r2 = s;
2150: }
2151: }
2152: *r1p = r1; *r2p = r2;
2153: }
2154:
2155: void dp_nf_tab_mod(DP p,LIST *tab,int mod,DP *rp)
2156: {
2157: DP s,t,u;
2158: MP m;
2159: DL h;
2160: int i,n;
2161:
2162: if ( !p ) {
2163: *rp = p; return;
2164: }
2165: n = p->nv;
2166: for ( s = 0, i = 0, m = BDY(p); m; m = NEXT(m) ) {
2167: h = m->dl;
2168: while ( !dl_equal(n,h,BDY((DP)BDY(BDY(tab[i])))->dl ) )
2169: i++;
2170: mulmdc(CO,mod,(DP)BDY(NEXT(BDY(tab[i]))),(P)m->c,&t);
2171: addmd(CO,mod,s,t,&u); s = u;
2172: }
2173: *rp = s;
2174: }
2175:
2176: void dp_nf_tab_f(DP p,LIST *tab,DP *rp)
2177: {
2178: DP s,t,u;
2179: MP m;
2180: DL h;
2181: int i,n;
2182:
2183: if ( !p ) {
2184: *rp = p; return;
2185: }
2186: n = p->nv;
2187: for ( s = 0, i = 0, m = BDY(p); m; m = NEXT(m) ) {
2188: h = m->dl;
2189: while ( !dl_equal(n,h,BDY((DP)BDY(BDY(tab[i])))->dl ) )
2190: i++;
2191: muldc(CO,(DP)BDY(NEXT(BDY(tab[i]))),m->c,&t);
2192: addd(CO,s,t,&u); s = u;
2193: }
2194: *rp = s;
2195: }
2196:
2197: /*
2198: * setting flags
2199: * call create_order_spec with vl=0 to set old type order.
2200: *
2201: */
2202:
2203: int create_order_spec(VL vl,Obj obj,struct order_spec **specp)
2204: {
2205: int i,j,n,s,row,col,ret,wlen;
2206: struct order_spec *spec;
2207: struct order_pair *l;
2208: Obj wp,wm;
2209: NODE node,t,tn,wpair;
2210: MAT m;
2211: VECT v;
2212: pointer **b,*bv;
2213: int **w;
2214:
2215: if ( vl && obj && OID(obj) == O_LIST ) {
2216: ret = create_composite_order_spec(vl,(LIST)obj,specp);
2217: if ( show_orderspec )
2218: print_composite_order_spec(*specp);
2219: return ret;
2220: }
2221:
2222: *specp = spec = (struct order_spec *)MALLOC(sizeof(struct order_spec));
2223: if ( !obj || NUM(obj) ) {
2224: spec->id = 0; spec->obj = obj;
1.2 noro 2225: spec->ord.simple = ZTOS((Q)obj);
1.1 noro 2226: return 1;
2227: } else if ( OID(obj) == O_LIST ) {
1.6 noro 2228: /* module order */
1.1 noro 2229: node = BDY((LIST)obj);
2230: if ( !BDY(node) || NUM(BDY(node)) ) {
2231: switch ( length(node) ) {
1.6 noro 2232: case 2: /* [n,ord] */
1.1 noro 2233: create_order_spec(0,(Obj)BDY(NEXT(node)),&spec);
2234: spec->id += 256; spec->obj = obj;
2235: spec->top_weight = 0;
2236: spec->module_rank = 0;
2237: spec->module_top_weight = 0;
1.6 noro 2238: spec->module_ordtype = ZTOS((Z)BDY(node));
2239: if ( spec->module_ordtype < 0 ) {
2240: spec->pot_nelim = -spec->module_ordtype;
2241: spec->module_ordtype = 1;
2242: } else
2243: spec->pot_nelim = 0;
2244: break;
2245:
2246: case 3: /* [n,[wv,wm],ord] */
2247: spec->module_ordtype = ZTOS((Z)BDY(node));
2248: if ( spec->module_ordtype < 0 ) {
2249: spec->pot_nelim = -spec->module_ordtype;
2250: spec->module_ordtype = 1;
2251: } else
1.1 noro 2252: spec->pot_nelim = 0;
1.6 noro 2253:
2254: if ( spec->module_ordtype == 3 ) { /* schreyer order */
2255: Obj baseobj;
2256: struct order_spec *basespec;
2257: int len;
2258: NODE in;
2259: LIST *la;
2260: DMMstack stack;
2261: DMMstack push_schreyer_order(LIST l,DMMstack s);
2262:
2263: spec->id = 300; spec->obj = obj;
2264: node = NEXT(node);
2265: if ( !BDY(node) || OID(BDY(node)) != O_LIST )
2266: error("create_order_spec : [mlist1,mlist,...] must be specified for defining a schreyer order");
2267: stack = 0;
2268: in = BDY((LIST)BDY(node));
2269: len = length(in);
2270: la = (LIST *)MALLOC(len*sizeof(LIST));
2271: for ( i = 0; i < len; i++, in = NEXT(in) ) la[i] = (LIST)(BDY(in));
2272: for ( i = len-1; i >= 0; i-- ) stack = push_schreyer_order(la[i],stack);
2273: spec->dmmstack = stack;
2274:
2275: node = NEXT(node);
2276: baseobj = (Obj)BDY(node);
2277: create_order_spec(0,baseobj,&basespec);
2278: basespec->obj = baseobj;
2279: spec->base = basespec;
2280: } else { /* weighted order */
1.7 noro 2281: int ordtype;
2282:
2283: ordtype = spec->module_ordtype;
1.6 noro 2284: create_order_spec(0,(Obj)BDY(NEXT(NEXT(node))),&spec);
1.7 noro 2285: spec->module_ordtype = ordtype;
2286: spec->id += 256; spec->obj = obj;
1.6 noro 2287: node = NEXT(node);
2288: if ( !BDY(node) || OID(BDY(node)) != O_LIST )
2289: error("create_order_spec : [weight_for_poly,weight_for_modlue] must be specified as a module topweight");
2290: wpair = BDY((LIST)BDY(node));
2291: if ( length(wpair) != 2 )
2292: error("create_order_spec : [weight_for_poly,weight_for_modlue] must be specified as a module topweight");
2293:
2294: wp = BDY(wpair);
2295: wm = BDY(NEXT(wpair));
2296: if ( !wp || OID(wp) != O_LIST || !wm || OID(wm) != O_LIST )
2297: error("create_order_spec : [weight_for_poly,weight_for_modlue] must be specified as a module topweight");
2298: spec->nv = length(BDY((LIST)wp));
2299: spec->top_weight = (int *)MALLOC_ATOMIC(spec->nv*sizeof(int));
2300: for ( i = 0, t = BDY((LIST)wp); i < spec->nv; t = NEXT(t), i++ )
2301: spec->top_weight[i] = ZTOS((Q)BDY(t));
2302:
2303: spec->module_rank = length(BDY((LIST)wm));
2304: spec->module_top_weight = (int *)MALLOC_ATOMIC(spec->module_rank*sizeof(int));
2305: for ( i = 0, t = BDY((LIST)wm); i < spec->module_rank; t = NEXT(t), i++ )
2306: spec->module_top_weight[i] = ZTOS((Q)BDY(t));
1.1 noro 2307: }
2308: break;
2309:
2310: default:
2311: error("create_order_spec : invalid arguments for module order");
2312: }
2313:
2314: *specp = spec;
2315: return 1;
2316: } else {
2317: /* block order in polynomial ring */
2318: for ( n = 0, t = node; t; t = NEXT(t), n++ );
2319: l = (struct order_pair *)MALLOC_ATOMIC(n*sizeof(struct order_pair));
2320: for ( i = 0, t = node, s = 0; i < n; t = NEXT(t), i++ ) {
1.2 noro 2321: tn = BDY((LIST)BDY(t)); l[i].order = ZTOS((Q)BDY(tn));
2322: tn = NEXT(tn); l[i].length = ZTOS((Q)BDY(tn));
1.1 noro 2323: s += l[i].length;
2324: }
2325: spec->id = 1; spec->obj = obj;
2326: spec->ord.block.order_pair = l;
2327: spec->ord.block.length = n; spec->nv = s;
2328: return 1;
2329: }
2330: } else if ( OID(obj) == O_MAT ) {
2331: m = (MAT)obj; row = m->row; col = m->col; b = BDY(m);
2332: w = almat(row,col);
2333: for ( i = 0; i < row; i++ )
2334: for ( j = 0; j < col; j++ )
1.2 noro 2335: w[i][j] = ZTOS((Q)b[i][j]);
1.1 noro 2336: spec->id = 2; spec->obj = obj;
2337: spec->nv = col; spec->ord.matrix.row = row;
2338: spec->ord.matrix.matrix = w;
2339: return 1;
2340: } else
2341: return 0;
2342: }
2343:
2344: void print_composite_order_spec(struct order_spec *spec)
2345: {
2346: int nv,n,len,i,j,k,start;
2347: struct weight_or_block *worb;
2348:
2349: nv = spec->nv;
2350: n = spec->ord.composite.length;
2351: worb = spec->ord.composite.w_or_b;
2352: for ( i = 0; i < n; i++, worb++ ) {
2353: len = worb->length;
2354: printf("[ ");
2355: switch ( worb->type ) {
2356: case IS_DENSE_WEIGHT:
2357: for ( j = 0; j < len; j++ )
2358: printf("%d ",worb->body.dense_weight[j]);
2359: for ( ; j < nv; j++ )
2360: printf("0 ");
2361: break;
2362: case IS_SPARSE_WEIGHT:
2363: for ( j = 0, k = 0; j < nv; j++ )
2364: if ( j == worb->body.sparse_weight[k].pos )
2365: printf("%d ",worb->body.sparse_weight[k++].value);
2366: else
2367: printf("0 ");
2368: break;
2369: case IS_BLOCK:
2370: start = worb->body.block.start;
2371: for ( j = 0; j < start; j++ ) printf("0 ");
2372: switch ( worb->body.block.order ) {
2373: case 0:
2374: for ( k = 0; k < len; k++, j++ ) printf("R ");
2375: break;
2376: case 1:
2377: for ( k = 0; k < len; k++, j++ ) printf("G ");
2378: break;
2379: case 2:
2380: for ( k = 0; k < len; k++, j++ ) printf("L ");
2381: break;
2382: }
2383: for ( ; j < nv; j++ ) printf("0 ");
2384: break;
2385: }
2386: printf("]\n");
2387: }
2388: }
2389:
2390: struct order_spec *append_block(struct order_spec *spec,
2391: int nv,int nalg,int ord)
2392: {
2393: MAT m,mat;
2394: int i,j,row,col,n;
2395: Z **b,**wp;
2396: int **w;
2397: NODE t,s,s0;
2398: struct order_pair *l,*l0;
2399: int n0,nv0;
2400: LIST list0,list1,list;
2401: Z oq,nq;
2402: struct order_spec *r;
2403:
2404: r = (struct order_spec *)MALLOC(sizeof(struct order_spec));
2405: switch ( spec->id ) {
2406: case 0:
1.2 noro 2407: STOZ(spec->ord.simple,oq); STOZ(nv,nq);
1.1 noro 2408: t = mknode(2,oq,nq); MKLIST(list0,t);
1.2 noro 2409: STOZ(ord,oq); STOZ(nalg,nq);
1.1 noro 2410: t = mknode(2,oq,nq); MKLIST(list1,t);
2411: t = mknode(2,list0,list1); MKLIST(list,t);
2412: l = (struct order_pair *)MALLOC_ATOMIC(2*sizeof(struct order_pair));
2413: l[0].order = spec->ord.simple; l[0].length = nv;
2414: l[1].order = ord; l[1].length = nalg;
2415: r->id = 1; r->obj = (Obj)list;
2416: r->ord.block.order_pair = l;
2417: r->ord.block.length = 2;
2418: r->nv = nv+nalg;
2419: break;
2420: case 1:
2421: if ( spec->nv != nv )
2422: error("append_block : number of variables mismatch");
2423: l0 = spec->ord.block.order_pair;
2424: n0 = spec->ord.block.length;
2425: nv0 = spec->nv;
2426: list0 = (LIST)spec->obj;
2427: n = n0+1;
2428: l = (struct order_pair *)MALLOC_ATOMIC(n*sizeof(struct order_pair));
2429: for ( i = 0; i < n0; i++ )
2430: l[i] = l0[i];
2431: l[i].order = ord; l[i].length = nalg;
2432: for ( t = BDY(list0), s0 = 0; t; t = NEXT(t) ) {
2433: NEXTNODE(s0,s); BDY(s) = BDY(t);
2434: }
1.2 noro 2435: STOZ(ord,oq); STOZ(nalg,nq);
1.1 noro 2436: t = mknode(2,oq,nq); MKLIST(list,t);
2437: NEXTNODE(s0,s); BDY(s) = (pointer)list; NEXT(s) = 0;
2438: MKLIST(list,s0);
2439: r->id = 1; r->obj = (Obj)list;
2440: r->ord.block.order_pair = l;
2441: r->ord.block.length = n;
2442: r->nv = nv+nalg;
2443: break;
2444: case 2:
2445: if ( spec->nv != nv )
2446: error("append_block : number of variables mismatch");
2447: m = (MAT)spec->obj;
2448: row = m->row; col = m->col; b = (Z **)BDY(m);
2449: w = almat(row+nalg,col+nalg);
2450: MKMAT(mat,row+nalg,col+nalg); wp = (Z **)BDY(mat);
2451: for ( i = 0; i < row; i++ )
2452: for ( j = 0; j < col; j++ ) {
1.2 noro 2453: w[i][j] = ZTOS(b[i][j]);
1.1 noro 2454: wp[i][j] = b[i][j];
2455: }
2456: for ( i = 0; i < nalg; i++ ) {
2457: w[i+row][i+col] = 1;
2458: wp[i+row][i+col] = ONE;
2459: }
2460: r->id = 2; r->obj = (Obj)mat;
2461: r->nv = col+nalg; r->ord.matrix.row = row+nalg;
2462: r->ord.matrix.matrix = w;
2463: break;
2464: case 3:
2465: default:
2466: /* XXX */
2467: error("append_block : not implemented yet");
2468: }
2469: return r;
2470: }
2471:
2472: int comp_sw(struct sparse_weight *a, struct sparse_weight *b)
2473: {
2474: if ( a->pos > b->pos ) return 1;
2475: else if ( a->pos < b->pos ) return -1;
2476: else return 0;
2477: }
2478:
2479: /* order = [w_or_b, w_or_b, ... ] */
2480: /* w_or_b = w or b */
2481: /* w = [1,2,...] or [x,1,y,2,...] */
2482: /* b = [@lex,x,y,...,z] etc */
2483:
2484: int create_composite_order_spec(VL vl,LIST order,struct order_spec **specp)
2485: {
2486: NODE wb,t,p;
2487: struct order_spec *spec;
2488: VL tvl;
2489: int n,i,j,k,l,start,end,len,w;
2490: int *dw;
2491: struct sparse_weight *sw;
2492: struct weight_or_block *w_or_b;
2493: Obj a0;
2494: NODE a;
2495: V v,sv,ev;
2496: SYMBOL sym;
2497: int *top;
2498:
2499: /* l = number of vars in vl */
2500: for ( l = 0, tvl = vl; tvl; tvl = NEXT(tvl), l++ );
2501: /* n = number of primitives in order */
2502: wb = BDY(order);
2503: n = length(wb);
2504: *specp = spec = (struct order_spec *)MALLOC(sizeof(struct order_spec));
2505: spec->id = 3;
2506: spec->obj = (Obj)order;
2507: spec->nv = l;
2508: spec->ord.composite.length = n;
2509: w_or_b = spec->ord.composite.w_or_b = (struct weight_or_block *)
2510: MALLOC(sizeof(struct weight_or_block)*(n+1));
2511:
2512: /* top : register the top variable in each w_or_b specification */
2513: top = (int *)ALLOCA(l*sizeof(int));
2514: for ( i = 0; i < l; i++ ) top[i] = 0;
2515:
2516: for ( t = wb, i = 0; t; t = NEXT(t), i++ ) {
2517: if ( !BDY(t) || OID((Obj)BDY(t)) != O_LIST )
2518: error("a list of lists must be specified for the key \"order\"");
2519: a = BDY((LIST)BDY(t));
2520: len = length(a);
2521: a0 = (Obj)BDY(a);
2522: if ( !a0 || OID(a0) == O_N ) {
2523: /* a is a dense weight vector */
2524: dw = (int *)MALLOC(sizeof(int)*len);
2525: for ( j = 0, p = a; j < len; p = NEXT(p), j++ ) {
2526: if ( !INT((Q)BDY(p)) )
2527: error("a dense weight vector must be specified as a list of integers");
1.2 noro 2528: dw[j] = ZTOS((Q)BDY(p));
1.1 noro 2529: }
2530: w_or_b[i].type = IS_DENSE_WEIGHT;
2531: w_or_b[i].length = len;
2532: w_or_b[i].body.dense_weight = dw;
2533:
2534: /* find the top */
2535: for ( k = 0; k < len && !dw[k]; k++ );
2536: if ( k < len ) top[k] = 1;
2537:
2538: } else if ( OID(a0) == O_P ) {
2539: /* a is a sparse weight vector */
2540: len >>= 1;
2541: sw = (struct sparse_weight *)
2542: MALLOC(sizeof(struct sparse_weight)*len);
2543: for ( j = 0, p = a; j < len; j++ ) {
2544: if ( !BDY(p) || OID((P)BDY(p)) != O_P )
2545: error("a sparse weight vector must be specified as [var1,weight1,...]");
2546: v = VR((P)BDY(p)); p = NEXT(p);
2547: for ( tvl = vl, k = 0; tvl && tvl->v != v;
2548: k++, tvl = NEXT(tvl) );
2549: if ( !tvl )
2550: error("invalid variable name in a sparse weight vector");
2551: sw[j].pos = k;
2552: if ( !INT((Q)BDY(p)) )
2553: error("a sparse weight vector must be specified as [var1,weight1,...]");
1.2 noro 2554: sw[j].value = ZTOS((Q)BDY(p)); p = NEXT(p);
1.1 noro 2555: }
2556: qsort(sw,len,sizeof(struct sparse_weight),
2557: (int (*)(const void *,const void *))comp_sw);
2558: w_or_b[i].type = IS_SPARSE_WEIGHT;
2559: w_or_b[i].length = len;
2560: w_or_b[i].body.sparse_weight = sw;
2561:
2562: /* find the top */
2563: for ( k = 0; k < len && !sw[k].value; k++ );
2564: if ( k < len ) top[sw[k].pos] = 1;
2565: } else if ( OID(a0) == O_RANGE ) {
2566: /* [range(v1,v2),w] */
2567: sv = VR((P)(((RANGE)a0)->start));
2568: ev = VR((P)(((RANGE)a0)->end));
2569: for ( tvl = vl, start = 0; tvl && tvl->v != sv; start++, tvl = NEXT(tvl) );
2570: if ( !tvl )
2571: error("invalid range");
2572: for ( end = start; tvl && tvl->v != ev; end++, tvl = NEXT(tvl) );
2573: if ( !tvl )
2574: error("invalid range");
2575: len = end-start+1;
2576: sw = (struct sparse_weight *)
2577: MALLOC(sizeof(struct sparse_weight)*len);
1.2 noro 2578: w = ZTOS((Q)BDY(NEXT(a)));
1.1 noro 2579: for ( tvl = vl, k = 0; k < start; k++, tvl = NEXT(tvl) );
2580: for ( j = 0 ; k <= end; k++, tvl = NEXT(tvl), j++ ) {
2581: sw[j].pos = k;
2582: sw[j].value = w;
2583: }
2584: w_or_b[i].type = IS_SPARSE_WEIGHT;
2585: w_or_b[i].length = len;
2586: w_or_b[i].body.sparse_weight = sw;
2587:
2588: /* register the top */
2589: if ( w ) top[start] = 1;
2590: } else if ( OID(a0) == O_SYMBOL ) {
2591: /* a is a block */
2592: sym = (SYMBOL)a0; a = NEXT(a); len--;
2593: if ( OID((Obj)BDY(a)) == O_RANGE ) {
2594: sv = VR((P)(((RANGE)BDY(a))->start));
2595: ev = VR((P)(((RANGE)BDY(a))->end));
2596: for ( tvl = vl, start = 0; tvl && tvl->v != sv; start++, tvl = NEXT(tvl) );
2597: if ( !tvl )
2598: error("invalid range");
2599: for ( end = start; tvl && tvl->v != ev; end++, tvl = NEXT(tvl) );
2600: if ( !tvl )
2601: error("invalid range");
2602: len = end-start+1;
2603: } else {
2604: for ( start = 0, tvl = vl; tvl->v != VR((P)BDY(a));
2605: tvl = NEXT(tvl), start++ );
2606: for ( p = NEXT(a), tvl = NEXT(tvl); p;
2607: p = NEXT(p), tvl = NEXT(tvl) ) {
2608: if ( !BDY(p) || OID((P)BDY(p)) != O_P )
2609: error("a block must be specified as [ordsymbol,var1,var2,...]");
2610: if ( tvl->v != VR((P)BDY(p)) ) break;
2611: }
2612: if ( p )
2613: error("a block must be contiguous in the variable list");
2614: }
2615: w_or_b[i].type = IS_BLOCK;
2616: w_or_b[i].length = len;
2617: w_or_b[i].body.block.start = start;
2618: if ( !strcmp(sym->name,"@grlex") )
2619: w_or_b[i].body.block.order = 0;
2620: else if ( !strcmp(sym->name,"@glex") )
2621: w_or_b[i].body.block.order = 1;
2622: else if ( !strcmp(sym->name,"@lex") )
2623: w_or_b[i].body.block.order = 2;
2624: else
2625: error("invalid ordername");
2626: /* register the tops */
2627: for ( j = 0, k = start; j < len; j++, k++ )
2628: top[k] = 1;
2629: }
2630: }
2631: for ( k = 0; k < l && top[k]; k++ );
2632: if ( k < l ) {
2633: /* incomplete order specification; add @grlex */
2634: w_or_b[n].type = IS_BLOCK;
2635: w_or_b[n].length = l;
2636: w_or_b[n].body.block.start = 0;
2637: w_or_b[n].body.block.order = 0;
2638: spec->ord.composite.length = n+1;
2639: }
1.3 noro 2640: return 1;
1.1 noro 2641: }
2642:
2643: /* module order spec */
2644:
2645: void create_modorder_spec(int id,LIST shift,struct modorder_spec **s)
2646: {
2647: struct modorder_spec *spec;
2648: NODE n,t;
2649: LIST list;
2650: int *ds;
2651: int i,l;
2652: Z q;
2653:
2654: *s = spec = (struct modorder_spec *)MALLOC(sizeof(struct modorder_spec));
2655: spec->id = id;
2656: if ( shift ) {
2657: n = BDY(shift);
2658: spec->len = l = length(n);
2659: spec->degree_shift = ds = (int *)MALLOC_ATOMIC(l*sizeof(int));
2660: for ( t = n, i = 0; t; t = NEXT(t), i++ )
1.2 noro 2661: ds[i] = ZTOS((Q)BDY(t));
1.1 noro 2662: } else {
2663: spec->len = 0;
2664: spec->degree_shift = 0;
2665: }
1.2 noro 2666: STOZ(id,q);
1.1 noro 2667: n = mknode(2,q,shift);
2668: MKLIST(list,n);
2669: spec->obj = (Obj)list;
2670: }
2671:
2672: /*
2673: * converters
2674: *
2675: */
2676:
1.7 noro 2677: void dpm_homo(DPM p,DPM *rp)
2678: {
2679: DMM m,mr,mr0,t;
2680: int i,n,nv,td;
2681: DL dl,dlh;
2682:
2683: if ( !p )
2684: *rp = 0;
2685: else {
2686: n = p->nv; nv = n + 1;
2687: m = BDY(p);
2688: td = 0;
2689: for ( t = m; t; t = NEXT(t) )
2690: if ( m->dl->td > td ) td = m->dl->td;
2691: for ( mr0 = 0; m; m = NEXT(m) ) {
2692: NEXTDMM(mr0,mr); mr->c = m->c; mr->pos = m->pos;
2693: dl = m->dl;
2694: mr->dl = dlh = (DL)MALLOC_ATOMIC((nv+1)*sizeof(int));
2695: dlh->td = td;
2696: for ( i = 0; i < n; i++ )
2697: dlh->d[i] = dl->d[i];
2698: dlh->d[n] = td - dl->td;
2699: }
2700: NEXT(mr) = 0; MKDPM(nv,mr0,*rp); (*rp)->sugar = p->sugar;
2701: }
2702: }
2703:
2704: void dpm_dehomo(DPM p,DPM *rp)
2705: {
2706: DMM m,mr,mr0;
2707: int i,n,nv;
2708: DL dl,dlh;
2709:
2710: if ( !p )
2711: *rp = 0;
2712: else {
2713: n = p->nv; nv = n - 1;
2714: m = BDY(p);
2715: for ( mr0 = 0; m; m = NEXT(m) ) {
2716: NEXTDMM(mr0,mr); mr->c = m->c; mr->pos = m->pos;
2717: dlh = m->dl;
2718: mr->dl = dl = (DL)MALLOC_ATOMIC((nv+1)*sizeof(int));
2719: dl->td = dlh->td - dlh->d[nv];
2720: for ( i = 0; i < nv; i++ )
2721: dl->d[i] = dlh->d[i];
2722: }
2723: NEXT(mr) = 0; MKDPM(nv,mr0,*rp); (*rp)->sugar = p->sugar;
2724: }
2725: }
2726:
1.1 noro 2727: void dp_homo(DP p,DP *rp)
2728: {
2729: MP m,mr,mr0;
2730: int i,n,nv,td;
2731: DL dl,dlh;
2732:
2733: if ( !p )
2734: *rp = 0;
2735: else {
2736: n = p->nv; nv = n + 1;
2737: m = BDY(p); td = sugard(m);
2738: for ( mr0 = 0; m; m = NEXT(m) ) {
2739: NEXTMP(mr0,mr); mr->c = m->c;
2740: dl = m->dl;
2741: mr->dl = dlh = (DL)MALLOC_ATOMIC((nv+1)*sizeof(int));
2742: dlh->td = td;
2743: for ( i = 0; i < n; i++ )
2744: dlh->d[i] = dl->d[i];
2745: dlh->d[n] = td - dl->td;
2746: }
2747: NEXT(mr) = 0; MKDP(nv,mr0,*rp); (*rp)->sugar = p->sugar;
2748: }
2749: }
2750:
2751: void dp_dehomo(DP p,DP *rp)
2752: {
2753: MP m,mr,mr0;
2754: int i,n,nv;
2755: DL dl,dlh;
2756:
2757: if ( !p )
2758: *rp = 0;
2759: else {
2760: n = p->nv; nv = n - 1;
2761: m = BDY(p);
2762: for ( mr0 = 0; m; m = NEXT(m) ) {
2763: NEXTMP(mr0,mr); mr->c = m->c;
2764: dlh = m->dl;
2765: mr->dl = dl = (DL)MALLOC_ATOMIC((nv+1)*sizeof(int));
2766: dl->td = dlh->td - dlh->d[nv];
2767: for ( i = 0; i < nv; i++ )
2768: dl->d[i] = dlh->d[i];
2769: }
2770: NEXT(mr) = 0; MKDP(nv,mr0,*rp); (*rp)->sugar = p->sugar;
2771: }
2772: }
2773:
1.7 noro 2774:
1.1 noro 2775: void dp_mod(DP p,int mod,NODE subst,DP *rp)
2776: {
2777: MP m,mr,mr0;
2778: P t,s,s1;
2779: V v;
2780: NODE tn;
2781:
2782: if ( !p )
2783: *rp = 0;
2784: else {
2785: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
2786: for ( tn = subst, s = (P)m->c; tn; tn = NEXT(tn) ) {
2787: v = VR((P)BDY(tn)); tn = NEXT(tn);
2788: substp(CO,s,v,(P)BDY(tn),&s1); s = s1;
2789: }
2790: ptomp(mod,s,&t);
2791: if ( t ) {
2792: NEXTMP(mr0,mr); mr->c = (Obj)t; mr->dl = m->dl;
2793: }
2794: }
2795: if ( mr0 ) {
2796: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
2797: } else
2798: *rp = 0;
2799: }
2800: }
2801:
2802: void dp_rat(DP p,DP *rp)
2803: {
2804: MP m,mr,mr0;
2805:
2806: if ( !p )
2807: *rp = 0;
2808: else {
2809: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
2810: NEXTMP(mr0,mr); mptop((P)m->c,(P *)&mr->c); mr->dl = m->dl;
2811: }
2812: if ( mr0 ) {
2813: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
2814: } else
2815: *rp = 0;
2816: }
2817: }
2818:
2819:
2820: void homogenize_order(struct order_spec *old,int n,struct order_spec **newp)
2821: {
2822: struct order_pair *l;
2823: int length,nv,row,i,j;
2824: int **newm,**oldm;
2825: struct order_spec *new;
2826: int onv,nnv,nlen,olen,owlen;
2827: struct weight_or_block *owb,*nwb;
2828:
2829: *newp = new = (struct order_spec *)MALLOC(sizeof(struct order_spec));
1.6 noro 2830: bcopy((char *)old,(char *)new,sizeof(struct order_spec));
1.1 noro 2831: switch ( old->id ) {
2832: case 0:
2833: switch ( old->ord.simple ) {
2834: case 0:
1.6 noro 2835: break;
1.1 noro 2836: case 1:
2837: l = (struct order_pair *)
2838: MALLOC_ATOMIC(2*sizeof(struct order_pair));
2839: l[0].length = n; l[0].order = 1;
2840: l[1].length = 1; l[1].order = 2;
2841: new->id = 1;
2842: new->ord.block.order_pair = l;
2843: new->ord.block.length = 2; new->nv = n+1;
2844: break;
2845: case 2:
1.6 noro 2846: new->ord.simple = 1; break;
1.1 noro 2847: case 3: case 4: case 5:
1.6 noro 2848: new->ord.simple = old->ord.simple+3;
1.1 noro 2849: dp_nelim = n-1; break;
2850: case 6: case 7: case 8: case 9:
1.6 noro 2851: break;
1.1 noro 2852: default:
2853: error("homogenize_order : invalid input");
2854: }
2855: break;
2856: case 1: case 257:
2857: length = old->ord.block.length;
2858: l = (struct order_pair *)
2859: MALLOC_ATOMIC((length+1)*sizeof(struct order_pair));
2860: bcopy((char *)old->ord.block.order_pair,(char *)l,length*sizeof(struct order_pair));
2861: l[length].order = 2; l[length].length = 1;
1.6 noro 2862: new->nv = n+1;
1.1 noro 2863: new->ord.block.order_pair = l;
2864: new->ord.block.length = length+1;
2865: break;
2866: case 2: case 258:
2867: nv = old->nv; row = old->ord.matrix.row;
2868: oldm = old->ord.matrix.matrix; newm = almat(row+1,nv+1);
2869: for ( i = 0; i <= nv; i++ )
2870: newm[0][i] = 1;
2871: for ( i = 0; i < row; i++ ) {
2872: for ( j = 0; j < nv; j++ )
2873: newm[i+1][j] = oldm[i][j];
2874: newm[i+1][j] = 0;
2875: }
1.6 noro 2876: new->nv = nv+1;
1.1 noro 2877: new->ord.matrix.row = row+1; new->ord.matrix.matrix = newm;
2878: break;
2879: case 3: case 259:
2880: onv = old->nv;
2881: nnv = onv+1;
2882: olen = old->ord.composite.length;
2883: nlen = olen+1;
2884: owb = old->ord.composite.w_or_b;
2885: nwb = (struct weight_or_block *)
2886: MALLOC(nlen*sizeof(struct weight_or_block));
2887: for ( i = 0; i < olen; i++ ) {
2888: nwb[i].type = owb[i].type;
2889: switch ( owb[i].type ) {
2890: case IS_DENSE_WEIGHT:
2891: owlen = owb[i].length;
2892: nwb[i].length = owlen+1;
2893: nwb[i].body.dense_weight = (int *)MALLOC((owlen+1)*sizeof(int));
2894: for ( j = 0; j < owlen; j++ )
2895: nwb[i].body.dense_weight[j] = owb[i].body.dense_weight[j];
2896: nwb[i].body.dense_weight[owlen] = 0;
2897: break;
2898: case IS_SPARSE_WEIGHT:
2899: nwb[i].length = owb[i].length;
2900: nwb[i].body.sparse_weight = owb[i].body.sparse_weight;
2901: break;
2902: case IS_BLOCK:
2903: nwb[i].length = owb[i].length;
2904: nwb[i].body.block = owb[i].body.block;
2905: break;
2906: }
2907: }
2908: nwb[i].type = IS_SPARSE_WEIGHT;
2909: nwb[i].body.sparse_weight =
2910: (struct sparse_weight *)MALLOC(sizeof(struct sparse_weight));
2911: nwb[i].body.sparse_weight[0].pos = onv;
2912: nwb[i].body.sparse_weight[0].value = 1;
2913: new->nv = nnv;
2914: new->ord.composite.length = nlen;
2915: new->ord.composite.w_or_b = nwb;
2916: print_composite_order_spec(new);
2917: break;
2918: case 256: /* simple module order */
2919: switch ( old->ord.simple ) {
2920: case 0:
1.6 noro 2921: break;
1.1 noro 2922: case 1:
2923: l = (struct order_pair *)
2924: MALLOC_ATOMIC(2*sizeof(struct order_pair));
2925: l[0].length = n; l[0].order = old->ord.simple;
2926: l[1].length = 1; l[1].order = 2;
2927: new->id = 257;
2928: new->ord.block.order_pair = l;
2929: new->ord.block.length = 2; new->nv = n+1;
2930: break;
2931: case 2:
1.6 noro 2932: new->ord.simple = 1; break;
1.1 noro 2933: default:
2934: error("homogenize_order : invalid input");
2935: }
2936: break;
2937: default:
2938: error("homogenize_order : invalid input");
2939: }
2940: }
2941:
2942: int comp_nm(Q *a,Q *b)
2943: {
2944: Z z,nma,nmb;
2945:
2946: nmq(*a,&z); absz(z,&nma);
2947: nmq(*b,&z); absz(z,&nmb);
2948: return cmpz(nma,nmb);
2949: }
2950:
2951: void sortbynm(Q *w,int n)
2952: {
2953: qsort(w,n,sizeof(Q),(int (*)(const void *,const void *))comp_nm);
2954: }
2955:
2956:
2957: /*
2958: * simple operations
2959: *
2960: */
2961:
2962: int dp_redble(DP p1,DP p2)
2963: {
2964: int i,n;
2965: DL d1,d2;
2966:
2967: d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
2968: if ( d1->td < d2->td )
2969: return 0;
2970: else {
2971: for ( i = 0, n = p1->nv; i < n; i++ )
2972: if ( d1->d[i] < d2->d[i] )
2973: return 0;
2974: return 1;
2975: }
2976: }
2977:
2978: int dpm_redble(DPM p1,DPM p2)
2979: {
2980: int i,n;
2981: DL d1,d2;
2982:
2983: if ( BDY(p1)->pos != BDY(p2)->pos ) return 0;
2984: d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
2985: if ( d1->td < d2->td )
2986: return 0;
2987: else {
2988: for ( i = 0, n = p1->nv; i < n; i++ )
2989: if ( d1->d[i] < d2->d[i] )
2990: return 0;
2991: return 1;
2992: }
2993: }
2994:
2995:
2996: void dp_subd(DP p1,DP p2,DP *rp)
2997: {
2998: int i,n;
2999: DL d1,d2,d;
3000: MP m;
3001: DP s;
3002:
3003: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
3004: NEWDL(d,n); d->td = d1->td - d2->td;
3005: for ( i = 0; i < n; i++ )
3006: d->d[i] = d1->d[i]-d2->d[i];
3007: NEWMP(m); m->dl = d; m->c = (Obj)ONE; NEXT(m) = 0;
3008: MKDP(n,m,s); s->sugar = d->td;
3009: *rp = s;
3010: }
3011:
3012: void dltod(DL d,int n,DP *rp)
3013: {
3014: MP m;
3015: DP s;
3016:
3017: NEWMP(m); m->dl = d; m->c = (Obj)ONE; NEXT(m) = 0;
3018: MKDP(n,m,s); s->sugar = d->td;
3019: *rp = s;
3020: }
3021:
3022: void dp_hm(DP p,DP *rp)
3023: {
3024: MP m,mr;
3025:
3026: if ( !p )
3027: *rp = 0;
3028: else {
3029: m = BDY(p);
3030: NEWMP(mr); mr->dl = m->dl; mr->c = m->c; NEXT(mr) = 0;
3031: MKDP(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */
3032: }
3033: }
3034:
3035: void dp_ht(DP p,DP *rp)
3036: {
3037: MP m,mr;
3038:
3039: if ( !p )
3040: *rp = 0;
3041: else {
3042: m = BDY(p);
3043: NEWMP(mr); mr->dl = m->dl; mr->c = (Obj)ONE; NEXT(mr) = 0;
3044: MKDP(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */
3045: }
3046: }
3047:
3048: void dpm_hm(DPM p,DPM *rp)
3049: {
3050: DMM m,mr;
3051:
3052: if ( !p )
3053: *rp = 0;
3054: else {
3055: m = BDY(p);
3056: NEWDMM(mr); mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos; NEXT(mr) = 0;
3057: MKDPM(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */
3058: }
3059: }
3060:
3061: void dpm_ht(DPM p,DPM *rp)
3062: {
3063: DMM m,mr;
3064:
3065: if ( !p )
3066: *rp = 0;
3067: else {
3068: m = BDY(p);
3069: NEWDMM(mr); mr->dl = m->dl; mr->pos = m->pos; mr->c = (Obj)ONE; NEXT(mr) = 0;
3070: MKDPM(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */
3071: }
3072: }
3073:
3074:
3075: void dp_rest(DP p,DP *rp)
3076: {
3077: MP m;
3078:
3079: m = BDY(p);
3080: if ( !NEXT(m) )
3081: *rp = 0;
3082: else {
3083: MKDP(p->nv,NEXT(m),*rp);
3084: if ( *rp )
3085: (*rp)->sugar = p->sugar;
3086: }
3087: }
3088:
3089: void dpm_rest(DPM p,DPM *rp)
3090: {
3091: DMM m;
3092:
3093: m = BDY(p);
3094: if ( !NEXT(m) )
3095: *rp = 0;
3096: else {
3097: MKDPM(p->nv,NEXT(m),*rp);
3098: if ( *rp )
3099: (*rp)->sugar = p->sugar;
3100: }
3101: }
3102:
1.3 noro 3103: int dpm_getdeg(DPM p,int *r)
3104: {
3105: int max,n,i,rank;
3106: DMM m;
3107: int *d;
3108:
3109: if ( !p ) return 0;
3110: n = p->nv;
3111: max = 0;
3112: rank = 0;
3113: for ( m = BDY(p); m; m = NEXT(m) ) {
3114: d = m->dl->d;
3115: for ( i = 0; i < n; i++ )
3116: if ( d[i] > max ) max = d[i];
3117: rank = MAX(rank,m->pos);
3118: }
3119: *r = rank;
3120: return max;
3121: }
3122:
1.1 noro 3123: DL lcm_of_DL(int nv,DL dl1,DL dl2,DL dl)
3124: {
3125: register int i, *d1, *d2, *d, td;
3126:
3127: if ( !dl ) NEWDL(dl,nv);
3128: d = dl->d, d1 = dl1->d, d2 = dl2->d;
3129: for ( td = 0, i = 0; i < nv; d1++, d2++, d++, i++ ) {
3130: *d = *d1 > *d2 ? *d1 : *d2;
3131: td += MUL_WEIGHT(*d,i);
3132: }
3133: dl->td = td;
3134: return dl;
3135: }
3136:
3137: int dl_equal(int nv,DL dl1,DL dl2)
3138: {
3139: register int *d1, *d2, n;
3140:
3141: if ( dl1->td != dl2->td ) return 0;
3142: for ( d1 = dl1->d, d2 = dl2->d, n = nv; --n >= 0; d1++, d2++ )
3143: if ( *d1 != *d2 ) return 0;
3144: return 1;
3145: }
3146:
3147: int dp_nt(DP p)
3148: {
3149: int i;
3150: MP m;
3151:
3152: if ( !p )
3153: return 0;
3154: else {
3155: for ( i = 0, m = BDY(p); m; m = NEXT(m), i++ );
3156: return i;
3157: }
3158: }
3159:
3160: int dp_homogeneous(DP p)
3161: {
3162: MP m;
3163: int d;
3164:
3165: if ( !p )
3166: return 1;
3167: else {
3168: m = BDY(p);
3169: d = m->dl->td;
3170: m = NEXT(m);
3171: for ( ; m; m = NEXT(m) ) {
3172: if ( m->dl->td != d )
3173: return 0;
3174: }
3175: return 1;
3176: }
3177: }
3178:
3179: void _print_mp(int nv,MP m)
3180: {
3181: int i;
3182:
3183: if ( !m )
3184: return;
3185: for ( ; m; m = NEXT(m) ) {
1.3 noro 3186: fprintf(stderr,"%ld<",ITOS(C(m)));
1.1 noro 3187: for ( i = 0; i < nv; i++ ) {
3188: fprintf(stderr,"%d",m->dl->d[i]);
3189: if ( i != nv-1 )
3190: fprintf(stderr," ");
3191: }
1.3 noro 3192: fprintf(stderr,">");
1.1 noro 3193: }
3194: fprintf(stderr,"\n");
3195: }
3196:
3197: static int cmp_mp_nvar;
3198:
3199: int comp_mp(MP *a,MP *b)
3200: {
3201: return -(*cmpdl)(cmp_mp_nvar,(*a)->dl,(*b)->dl);
3202: }
3203:
3204: void dp_sort(DP p,DP *rp)
3205: {
3206: MP t,mp,mp0;
3207: int i,n;
3208: DP r;
3209: MP *w;
3210:
3211: if ( !p ) {
3212: *rp = 0;
3213: return;
3214: }
3215: for ( t = BDY(p), n = 0; t; t = NEXT(t), n++ );
3216: w = (MP *)ALLOCA(n*sizeof(MP));
3217: for ( t = BDY(p), i = 0; i < n; t = NEXT(t), i++ )
3218: w[i] = t;
3219: cmp_mp_nvar = NV(p);
3220: qsort(w,n,sizeof(MP),(int (*)(const void *,const void *))comp_mp);
3221: mp0 = 0;
3222: for ( i = n-1; i >= 0; i-- ) {
3223: NEWMP(mp); mp->dl = w[i]->dl; C(mp) = C(w[i]);
3224: NEXT(mp) = mp0; mp0 = mp;
3225: }
3226: MKDP(p->nv,mp0,r);
3227: r->sugar = p->sugar;
3228: *rp = r;
3229: }
3230:
3231: DP extract_initial_term_from_dp(DP p,int *weight,int n);
3232: LIST extract_initial_term(LIST f,int *weight,int n);
3233:
3234: DP extract_initial_term_from_dp(DP p,int *weight,int n)
3235: {
3236: int w,t,i,top;
3237: MP m,r0,r;
3238: DP dp;
3239:
3240: if ( !p ) return 0;
3241: top = 1;
3242: for ( m = BDY(p); m; m = NEXT(m) ) {
3243: for ( i = 0, t = 0; i < n; i++ )
3244: t += weight[i]*m->dl->d[i];
3245: if ( top || t > w ) {
3246: r0 = 0;
3247: w = t;
3248: top = 0;
3249: }
3250: if ( t == w ) {
3251: NEXTMP(r0,r);
3252: r->dl = m->dl;
3253: r->c = m->c;
3254: }
3255: }
3256: NEXT(r) = 0;
3257: MKDP(p->nv,r0,dp);
3258: return dp;
3259: }
3260:
3261: LIST extract_initial_term(LIST f,int *weight,int n)
3262: {
3263: NODE nd,r0,r;
3264: Obj p;
3265: LIST l;
3266:
3267: nd = BDY(f);
3268: for ( r0 = 0; nd; nd = NEXT(nd) ) {
3269: NEXTNODE(r0,r);
3270: p = (Obj)BDY(nd);
3271: BDY(r) = (pointer)extract_initial_term_from_dp((DP)p,weight,n);
3272: }
3273: if ( r0 ) NEXT(r) = 0;
3274: MKLIST(l,r0);
3275: return l;
3276: }
3277:
3278: LIST dp_initial_term(LIST f,struct order_spec *ord)
3279: {
3280: int n,l,i;
3281: struct weight_or_block *worb;
3282: int *weight;
3283:
3284: switch ( ord->id ) {
3285: case 2: /* matrix order */
3286: /* extract the first row */
3287: n = ord->nv;
3288: weight = ord->ord.matrix.matrix[0];
3289: return extract_initial_term(f,weight,n);
3290: case 3: /* composite order */
3291: /* the first w_or_b */
3292: worb = ord->ord.composite.w_or_b;
3293: switch ( worb->type ) {
3294: case IS_DENSE_WEIGHT:
3295: n = worb->length;
3296: weight = worb->body.dense_weight;
3297: return extract_initial_term(f,weight,n);
3298: case IS_SPARSE_WEIGHT:
3299: n = ord->nv;
3300: weight = (int *)ALLOCA(n*sizeof(int));
3301: for ( i = 0; i < n; i++ ) weight[i] = 0;
3302: l = worb->length;
3303: for ( i = 0; i < l; i++ )
3304: weight[worb->body.sparse_weight[i].pos]
3305: = worb->body.sparse_weight[i].value;
3306: return extract_initial_term(f,weight,n);
3307: default:
3308: error("dp_initial_term : unsupported order");
3309: }
3310: default:
3311: error("dp_initial_term : unsupported order");
3312: }
1.3 noro 3313: return 0;
1.1 noro 3314: }
3315:
3316: int highest_order_dp(DP p,int *weight,int n);
3317: LIST highest_order(LIST f,int *weight,int n);
3318:
3319: int highest_order_dp(DP p,int *weight,int n)
3320: {
3321: int w,t,i,top;
3322: MP m;
3323:
3324: if ( !p ) return -1;
3325: top = 1;
3326: for ( m = BDY(p); m; m = NEXT(m) ) {
3327: for ( i = 0, t = 0; i < n; i++ )
3328: t += weight[i]*m->dl->d[i];
3329: if ( top || t > w ) {
3330: w = t;
3331: top = 0;
3332: }
3333: }
3334: return w;
3335: }
3336:
3337: LIST highest_order(LIST f,int *weight,int n)
3338: {
3339: int h;
3340: NODE nd,r0,r;
3341: Obj p;
3342: LIST l;
3343: Z q;
3344:
3345: nd = BDY(f);
3346: for ( r0 = 0; nd; nd = NEXT(nd) ) {
3347: NEXTNODE(r0,r);
3348: p = (Obj)BDY(nd);
3349: h = highest_order_dp((DP)p,weight,n);
1.2 noro 3350: STOZ(h,q);
1.1 noro 3351: BDY(r) = (pointer)q;
3352: }
3353: if ( r0 ) NEXT(r) = 0;
3354: MKLIST(l,r0);
3355: return l;
3356: }
3357:
3358: LIST dp_order(LIST f,struct order_spec *ord)
3359: {
3360: int n,l,i;
3361: struct weight_or_block *worb;
3362: int *weight;
3363:
3364: switch ( ord->id ) {
3365: case 2: /* matrix order */
3366: /* extract the first row */
3367: n = ord->nv;
3368: weight = ord->ord.matrix.matrix[0];
3369: return highest_order(f,weight,n);
3370: case 3: /* composite order */
3371: /* the first w_or_b */
3372: worb = ord->ord.composite.w_or_b;
3373: switch ( worb->type ) {
3374: case IS_DENSE_WEIGHT:
3375: n = worb->length;
3376: weight = worb->body.dense_weight;
3377: return highest_order(f,weight,n);
3378: case IS_SPARSE_WEIGHT:
3379: n = ord->nv;
3380: weight = (int *)ALLOCA(n*sizeof(int));
3381: for ( i = 0; i < n; i++ ) weight[i] = 0;
3382: l = worb->length;
3383: for ( i = 0; i < l; i++ )
3384: weight[worb->body.sparse_weight[i].pos]
3385: = worb->body.sparse_weight[i].value;
3386: return highest_order(f,weight,n);
3387: default:
3388: error("dp_initial_term : unsupported order");
3389: }
3390: default:
3391: error("dp_initial_term : unsupported order");
3392: }
1.3 noro 3393: return 0;
1.1 noro 3394: }
3395:
3396: int dpv_ht(DPV p,DP *h)
3397: {
3398: int len,max,maxi,i,t;
3399: DP *e;
3400: MP m,mr;
3401:
3402: len = p->len;
3403: e = p->body;
3404: max = -1;
3405: maxi = -1;
3406: for ( i = 0; i < len; i++ )
3407: if ( e[i] && (t = BDY(e[i])->dl->td) > max ) {
3408: max = t;
3409: maxi = i;
3410: }
3411: if ( max < 0 ) {
3412: *h = 0;
3413: return -1;
3414: } else {
3415: m = BDY(e[maxi]);
3416: NEWMP(mr); mr->dl = m->dl; mr->c = (Obj)ONE; NEXT(mr) = 0;
3417: MKDP(e[maxi]->nv,mr,*h); (*h)->sugar = mr->dl->td; /* XXX */
3418: return maxi;
3419: }
3420: }
3421:
3422: /* return 1 if 0 <_w1 v && v <_w2 0 */
3423:
3424: int in_c12(int n,int *v,int row1,int **w1,int row2, int **w2)
3425: {
3426: int t1,t2;
3427:
3428: t1 = compare_zero(n,v,row1,w1);
3429: t2 = compare_zero(n,v,row2,w2);
3430: if ( t1 > 0 && t2 < 0 ) return 1;
3431: else return 0;
3432: }
3433:
3434: /* 0 < u => 1, 0 > u => -1 */
3435:
3436: int compare_zero(int n,int *u,int row,int **w)
3437: {
3438: int i,j,t;
3439: int *wi;
3440:
3441: for ( i = 0; i < row; i++ ) {
3442: wi = w[i];
3443: for ( j = 0, t = 0; j < n; j++ ) t += u[j]*wi[j];
3444: if ( t > 0 ) return 1;
3445: else if ( t < 0 ) return -1;
3446: }
3447: return 0;
3448: }
3449:
3450: /* functions for generic groebner walk */
3451: /* u=0 means u=-infty */
3452:
3453: int compare_facet_preorder(int n,int *u,int *v,
3454: int row1,int **w1,int row2,int **w2)
3455: {
3456: int i,j,s,t,tu,tv;
3457: int *w2i,*uv;
3458:
3459: if ( !u ) return 1;
3460: uv = W_ALLOC(n);
3461: for ( i = 0; i < row2; i++ ) {
3462: w2i = w2[i];
3463: for ( j = 0, tu = tv = 0; j < n; j++ )
1.3 noro 3464: if ( (s = w2i[j]) != 0 ) {
1.1 noro 3465: tu += s*u[j]; tv += s*v[j];
3466: }
3467: for ( j = 0; j < n; j++ ) uv[j] = u[j]*tv-v[j]*tu;
3468: t = compare_zero(n,uv,row1,w1);
3469: if ( t > 0 ) return 1;
3470: else if ( t < 0 ) return 0;
3471: }
3472: return 1;
3473: }
3474:
3475: Q inner_product_with_small_vector(VECT w,int *v)
3476: {
3477: int n,i;
3478: Z q;
3479: Q s,t,u;
3480:
3481: n = w->len;
3482: s = 0;
3483: for ( i = 0; i < n; i++ ) {
1.2 noro 3484: STOZ(v[i],q); mulq((Q)w->body[i],(Q)q,&t); addq(t,s,&u); s = u;
1.1 noro 3485: }
3486: return s;
3487: }
3488:
3489: Q compute_last_t(NODE g,NODE gh,Q t,VECT w1,VECT w2,NODE *homo,VECT *wp)
3490: {
3491: int n,i;
3492: int *wt;
3493: Q last,d1,d2,dn,nm,s,t1;
3494: VECT wd,wt1,wt2,w;
3495: NODE tg,tgh;
3496: MP f;
3497: int *h;
3498: NODE r0,r;
3499: MP m0,m;
3500: DP d;
3501:
3502: n = w1->len;
3503: wt = W_ALLOC(n);
3504: last = (Q)ONE;
3505: /* t1 = 1-t */
3506: for ( tg = g, tgh = gh; tg; tg = NEXT(tg), tgh = NEXT(tgh ) ) {
3507: f = BDY((DP)BDY(tg));
3508: h = BDY((DP)BDY(tgh))->dl->d;
3509: for ( ; f; f = NEXT(f) ) {
3510: for ( i = 0; i < n; i++ ) wt[i] = h[i]-f->dl->d[i];
3511: for ( i = 0; i < n && !wt[i]; i++ );
3512: if ( i == n ) continue;
3513: d1 = inner_product_with_small_vector(w1,wt);
3514: d2 = inner_product_with_small_vector(w2,wt);
3515: nm = d1; subq(d1,d2,&dn);
3516: /* if d1=d2 then nothing happens */
3517: if ( !dn ) continue;
3518: /* s satisfies ds = 0*/
3519: divq(nm,dn,&s);
3520:
3521: if ( cmpq(s,t) > 0 && cmpq(s,last) < 0 )
3522: last = s;
3523: else if ( !cmpq(s,t) ) {
3524: if ( cmpq(d2,0) < 0 ) {
3525: last = t;
3526: break;
3527: }
3528: }
3529: }
3530: }
3531: nmq(last,(Z *)&nm);
3532: dnq(last,(Z *)&dn);
3533: /* (1-n/d)*w1+n/d*w2 -> w=(d-n)*w1+n*w2 */
3534: subq(dn,nm,&t1); mulvect(CO,(Obj)w1,(Obj)t1,(Obj *)&wt1);
3535: mulvect(CO,(Obj)w2,(Obj)nm,(Obj *)&wt2); addvect(CO,wt1,wt2,&w);
3536:
3537: r0 = 0;
3538: for ( tg = g, tgh = gh; tg; tg = NEXT(tg), tgh = NEXT(tgh ) ) {
3539: f = BDY((DP)BDY(tg));
3540: h = BDY((DP)BDY(tgh))->dl->d;
3541: for ( m0 = 0; f; f = NEXT(f) ) {
3542: for ( i = 0; i < n; i++ ) wt[i] = h[i]-f->dl->d[i];
3543: for ( i = 0; i < n && !wt[i]; i++ );
3544: if ( !inner_product_with_small_vector(w,wt) ) {
3545: NEXTMP(m0,m); m->c = f->c; m->dl = f->dl;
3546: }
3547: }
3548: NEXT(m) = 0;
3549: MKDP(((DP)BDY(tg))->nv,m0,d); d->sugar = ((DP)BDY(tg))->sugar;
3550: NEXTNODE(r0,r); BDY(r) = (pointer)d;
3551: }
3552: NEXT(r) = 0;
3553: *homo = r0;
3554: *wp = w;
3555: return last;
3556: }
3557:
3558: /* return 0 if last_w = infty */
3559:
3560: NODE compute_last_w(NODE g,NODE gh,int n,int **w,
3561: int row1,int **w1,int row2,int **w2)
3562: {
3563: DP d;
3564: MP f,m0,m;
3565: int *wt,*v,*h;
3566: NODE t,s,n0,tn,n1,r0,r;
3567: int i;
3568:
3569: wt = W_ALLOC(n);
3570: n0 = 0;
3571: for ( t = g, s = gh; t; t = NEXT(t), s = NEXT(s) ) {
3572: f = BDY((DP)BDY(t));
3573: h = BDY((DP)BDY(s))->dl->d;
3574: for ( ; f; f = NEXT(f) ) {
3575: for ( i = 0; i < n; i++ ) wt[i] = h[i]-f->dl->d[i];
3576: for ( i = 0; i < n && !wt[i]; i++ );
3577: if ( i == n ) continue;
3578:
3579: if ( in_c12(n,wt,row1,w1,row2,w2) &&
3580: compare_facet_preorder(n,*w,wt,row1,w1,row2,w2) ) {
3581: v = (int *)MALLOC_ATOMIC(n*sizeof(int));
3582: for ( i = 0; i < n; i++ ) v[i] = wt[i];
3583: MKNODE(n1,v,n0); n0 = n1;
3584: }
3585: }
3586: }
3587: if ( !n0 ) return 0;
3588: for ( t = n0; t; t = NEXT(t) ) {
3589: v = (int *)BDY(t);
3590: for ( s = n0; s; s = NEXT(s) )
3591: if ( !compare_facet_preorder(n,v,(int *)BDY(s),row1,w1,row2,w2) )
3592: break;
3593: if ( !s ) {
3594: *w = v;
3595: break;
3596: }
3597: }
3598: if ( !t )
3599: error("compute_last_w : cannot happen");
3600: r0 = 0;
3601: for ( t = g, s = gh; t; t = NEXT(t), s = NEXT(s) ) {
3602: f = BDY((DP)BDY(t));
3603: h = BDY((DP)BDY(s))->dl->d;
3604: for ( m0 = 0; f; f = NEXT(f) ) {
3605: for ( i = 0; i < n; i++ ) wt[i] = h[i]-f->dl->d[i];
3606: for ( i = 0; i < n && !wt[i]; i++ );
3607: if ( i == n ||
3608: (compare_facet_preorder(n,wt,*w,row1,w1,row2,w2)
3609: && compare_facet_preorder(n,*w,wt,row1,w1,row2,w2)) ) {
3610: NEXTMP(m0,m); m->c = f->c; m->dl = f->dl;
3611: }
3612: }
3613: NEXT(m) = 0;
3614: MKDP(((DP)BDY(t))->nv,m0,d); d->sugar = ((DP)BDY(t))->sugar;
3615: NEXTNODE(r0,r); BDY(r) = (pointer)d;
3616: }
3617: NEXT(r) = 0;
3618: return r0;
3619: }
3620:
3621: /* compute a sufficient set of d(f)=u-v */
3622:
3623: NODE compute_essential_df(DP *g,DP *gh,int ng)
3624: {
3625: int nv,i,j,k,t,lj;
3626: NODE r,r1,ri,rt,r0;
3627: MP m;
3628: MP *mj;
3629: DL di,hj,dl,dlt;
3630: int *d,*dt;
3631: LIST l;
3632: Z q;
3633:
3634: nv = g[0]->nv;
3635: r = 0;
3636: for ( j = 0; j < ng; j++ ) {
3637: for ( m = BDY(g[j]), lj = 0; m; m = NEXT(m), lj++ );
3638: mj = (MP *)ALLOCA(lj*sizeof(MP));
3639: for ( m = BDY(g[j]), k = 0; m; m = NEXT(m), k++ )
3640: mj[k] = m;
3641: for ( i = 0; i < lj; i++ ) {
3642: for ( di = mj[i]->dl, k = i+1; k < lj; k++ )
3643: if ( _dl_redble(di,mj[k]->dl,nv) ) break;
3644: if ( k < lj ) mj[i] = 0;
3645: }
3646: hj = BDY(gh[j])->dl;
3647: _NEWDL(dl,nv); d = dl->d;
3648: r0 = r;
3649: for ( i = 0; i < lj; i++ ) {
3650: if ( mj[i] && !dl_equal(nv,di=mj[i]->dl,hj) ) {
3651: for ( k = 0, t = 0; k < nv; k++ ) {
3652: d[k] = hj->d[k]-di->d[k];
3653: t += d[k];
3654: }
3655: dl->td = t;
3656: #if 1
3657: for ( rt = r0; rt; rt = NEXT(rt) ) {
3658: dlt = (DL)BDY(rt);
3659: if ( dlt->td != dl->td ) continue;
3660: for ( dt = dlt->d, k = 0; k < nv; k++ )
3661: if ( d[k] != dt[k] ) break;
3662: if ( k == nv ) break;
3663: }
3664: #else
3665: rt = 0;
3666: #endif
3667: if ( !rt ) {
3668: MKNODE(r1,dl,r); r = r1;
3669: _NEWDL(dl,nv); d = dl->d;
3670: }
3671: }
3672: }
3673: }
3674: for ( rt = r; rt; rt = NEXT(rt) ) {
3675: dl = (DL)BDY(rt); d = dl->d;
3676: ri = 0;
3677: for ( k = nv-1; k >= 0; k-- ) {
1.2 noro 3678: STOZ(d[k],q);
1.1 noro 3679: MKNODE(r1,q,ri); ri = r1;
3680: }
3681: MKNODE(r1,0,ri); MKLIST(l,r1);
3682: BDY(rt) = (pointer)l;
3683: }
3684: return r;
3685: }
3686:
3687: int comp_bits_divisible(int *a,int *b,int n)
3688: {
3689: int bpi,i,wi,bi;
3690:
3691: bpi = (sizeof(int)/sizeof(char))*8;
3692: for ( i = 0; i < n; i++ ) {
3693: wi = i/bpi; bi = i%bpi;
3694: if ( !(a[wi]&(1<<bi)) && (b[wi]&(1<<bi)) ) return 0;
3695: }
3696: return 1;
3697: }
3698:
3699: int comp_bits_lex(int *a,int *b,int n)
3700: {
3701: int bpi,i,wi,ba,bb,bi;
3702:
3703: bpi = (sizeof(int)/sizeof(char))*8;
3704: for ( i = 0; i < n; i++ ) {
3705: wi = i/bpi; bi = i%bpi;
3706: ba = (a[wi]&(1<<bi))?1:0;
3707: bb = (b[wi]&(1<<bi))?1:0;
3708: if ( ba > bb ) return 1;
3709: else if ( ba < bb ) return -1;
3710: }
3711: return 0;
3712: }
3713:
3714: NODE mono_raddec(NODE ideal)
3715: {
3716: DP p;
3717: int nv,w,i,bpi,di,c,len;
3718: int *d,*s,*u,*new;
3719: NODE t,t1,v,r,rem,prev;
3720:
3721: if( !ideal ) return 0;
3722: p = (DP)BDY(ideal);
3723: nv = NV(p);
3724: bpi = (sizeof(int)/sizeof(char))*8;
3725: w = (nv+(bpi-1))/bpi;
3726: d = p->body->dl->d;
3727: if ( !NEXT(ideal) ) {
3728: for ( t = 0, i = nv-1; i >= 0; i-- ) {
3729: if ( d[i] ) {
3730: s = (int *)CALLOC(w,sizeof(int));
3731: s[i/bpi] |= 1<<(i%bpi);
3732: MKNODE(t1,s,t);
3733: t = t1;
3734: }
3735: }
3736: return t;
3737: }
3738: rem = mono_raddec(NEXT(ideal));
3739: r = 0;
3740: len = w*sizeof(int);
3741: u = (int *)CALLOC(w,sizeof(int));
3742: for ( i = nv-1; i >= 0; i-- ) {
3743: if ( d[i] ) {
3744: for ( t = rem; t; t = NEXT(t) ) {
3745: bcopy((char *)BDY(t),(char *)u,len);
3746: u[i/bpi] |= 1<<(i%bpi);
3747: for ( v = r; v; v = NEXT(v) ) {
3748: if ( comp_bits_divisible(u,(int *)BDY(v),nv) ) break;
3749: }
3750: if ( v ) continue;
3751: for ( v = r, prev = 0; v; v = NEXT(v) ) {
3752: if ( comp_bits_divisible((int *)BDY(v),u,nv) ) {
3753: if ( prev ) NEXT(prev) = NEXT(v);
3754: else r = NEXT(r);
3755: } else prev =v;
3756: }
3757: for ( v = r, prev = 0; v; prev = v, v = NEXT(v) ) {
3758: if ( comp_bits_lex(u,(int *)BDY(v),nv) < 0 ) break;
3759: }
3760: new = (int *)CALLOC(w,sizeof(int));
3761: bcopy((char *)u,(char *)new,len);
3762: MKNODE(t1,new,v);
3763: if ( prev ) NEXT(prev) = t1;
3764: else r = t1;
3765: }
3766: }
3767: }
3768: return r;
3769: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>