Annotation of OpenXM_contrib2/asir2018/builtin/dp-supp.c, Revision 1.9
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.9 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2018/builtin/dp-supp.c,v 1.8 2019/11/01 04:28:52 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.9 ! noro 1569: DPM dpm_nf_and_quotient2(NODE b,DPM g,VECT psv,DPM *rp,P *dnp)
! 1570: {
! 1571: DPM u,p,s,t,d,q;
! 1572: DP dmy,mult,zzz;
! 1573: DPM *ps;
! 1574: NODE l;
! 1575: DMM mr0,mq0,mr,mq,m;
! 1576: MP mp;
! 1577: int i,n,j,len,nv;
! 1578: int *wb;
! 1579: int sugar,psugar,multiple;
! 1580: P nm,tnm1,dn,tdn,tdn1;
! 1581: Q cont;
! 1582: Obj c1;
! 1583: struct oEGT eg0,eg1;
! 1584:
! 1585: dn = (P)ONE;
! 1586: if ( !g ) {
! 1587: *rp = 0; *dnp = dn; return 0;
! 1588: }
! 1589: nv = NV(g);
! 1590: ps = (DPM *)BDY(psv);
! 1591: len = psv->len;
! 1592: if ( b ) {
! 1593: for ( n = 0, l = b; l; l = NEXT(l), n++ )
! 1594: ;
! 1595: wb = (int *)ALLOCA(n*sizeof(int));
! 1596: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
! 1597: wb[i] = ZTOS((Q)BDY(l));
! 1598: } else {
! 1599: wb = (int *)ALLOCA(len*sizeof(int));
! 1600: for ( i = j = 0; i < len; i++ )
! 1601: if ( ps[i] ) wb[j++] = i;
! 1602: n = j;
! 1603: }
! 1604: sugar = g->sugar;
! 1605: mq0 = 0;
! 1606: mr0 = 0;
! 1607: for ( ; g; ) {
! 1608: for ( u = 0, i = 0; i < n; i++ ) {
! 1609: if ( dpm_redble(g,p = ps[wb[i]]) ) {
! 1610: dpm_red2(g,p,&u,&tdn,&mult);
! 1611: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
! 1612: sugar = MAX(sugar,psugar);
! 1613: for ( m = mq0; m; m = NEXT(m) ) {
! 1614: arf_mul(CO,(Obj)tdn,m->c,&c1); m->c = c1;
! 1615: }
! 1616: for ( m = mr0; m; m = NEXT(m) ) {
! 1617: arf_mul(CO,(Obj)tdn,m->c,&c1); m->c = c1;
! 1618: }
! 1619: NEXTDMM(mq0,mq);
! 1620: mq->c = BDY(mult)->c; mq->dl = BDY(mult)->dl; mq->pos = wb[i]+1;
! 1621: mulp(CO,dn,tdn,&tdn1); dn = tdn1;
! 1622: if ( !u ) goto last;
! 1623: break;
! 1624: }
! 1625: }
! 1626: if ( u ) {
! 1627: g = u;
! 1628: } else {
! 1629: m = BDY(g);
! 1630: NEXTDMM(mr0,mr);
! 1631: mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos;
! 1632: dpm_rest(g,&t); g = t;
! 1633: }
! 1634: }
! 1635: last:
! 1636: if ( mr0 ) {
! 1637: NEXT(mr) = 0;
! 1638: MKDPM(nv,mr0,d); d->sugar = sugar;
! 1639: } else
! 1640: d = 0;
! 1641: if ( mq0 ) {
! 1642: NEXT(mq) = 0;
! 1643: MKDPM(nv,mq0,q); q->sugar = sugar;
! 1644: } else
! 1645: q = 0;
! 1646: *rp = d; *dnp = dn;
! 1647: return q;
! 1648: }
! 1649:
! 1650: DPM dpm_nf_and_quotient3(DPM g,VECT psv,DPM *rp,P *dnp)
! 1651: {
! 1652: DPM u,p,s,t,d,q;
! 1653: DP dmy,mult,zzz;
! 1654: DPM *ps;
! 1655: NODE2 nd;
! 1656: DMM mr0,mq0,mr,mq,m;
! 1657: MP mp;
! 1658: int i,n,j,len,nv,pos,max;
! 1659: int *wb;
! 1660: int sugar,psugar,multiple;
! 1661: P nm,tnm1,dn,tdn,tdn1;
! 1662: Q cont;
! 1663: Obj c1;
! 1664: struct oEGT eg0,eg1;
! 1665:
! 1666: dn = (P)ONE;
! 1667: if ( !g ) {
! 1668: *rp = 0; *dnp = dn; return 0;
! 1669: }
! 1670: nv = NV(g);
! 1671: sugar = g->sugar;
! 1672: mq0 = 0;
! 1673: mr0 = 0;
! 1674: max = psv->len;
! 1675: for ( ; g; ) {
! 1676: pos = BDY(g)->pos;
! 1677: u = 0;
! 1678: if ( pos < max ) {
! 1679: nd = (NODE2)BDY(psv)[pos];
! 1680: for ( u = 0; nd; nd = NEXT(nd) ) {
! 1681: if ( dpm_redble(g,p = (DPM)(nd->body1)) ) {
! 1682: dpm_red2(g,p,&u,&tdn,&mult);
! 1683: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
! 1684: sugar = MAX(sugar,psugar);
! 1685: if ( !UNIZ(tdn) ) {
! 1686: for ( m = mq0; m; m = NEXT(m) ) {
! 1687: arf_mul(CO,(Obj)tdn,m->c,&c1); m->c = c1;
! 1688: }
! 1689: for ( m = mr0; m; m = NEXT(m) ) {
! 1690: arf_mul(CO,(Obj)tdn,m->c,&c1); m->c = c1;
! 1691: }
! 1692: }
! 1693: NEXTDMM(mq0,mq);
! 1694: mq->c = BDY(mult)->c; mq->dl = BDY(mult)->dl; mq->pos = (long)nd->body2;
! 1695: mulp(CO,dn,tdn,&tdn1); dn = tdn1;
! 1696: if ( !u ) goto last;
! 1697: break;
! 1698: }
! 1699: }
! 1700: }
! 1701: if ( u ) {
! 1702: g = u;
! 1703: } else {
! 1704: m = BDY(g);
! 1705: NEXTDMM(mr0,mr);
! 1706: mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos;
! 1707: dpm_rest(g,&t); g = t;
! 1708: }
! 1709: }
! 1710: last:
! 1711: if ( mr0 ) {
! 1712: NEXT(mr) = 0;
! 1713: MKDPM(nv,mr0,d); d->sugar = sugar;
! 1714: } else
! 1715: d = 0;
! 1716: if ( mq0 ) {
! 1717: NEXT(mq) = 0;
! 1718: MKDPM(nv,mq0,q); q->sugar = sugar;
! 1719: } else
! 1720: q = 0;
! 1721: *rp = d; *dnp = dn;
! 1722: return q;
! 1723: }
! 1724:
! 1725: DPM dpm_nf_and_quotient4(DPM g,DPM *ps,VECT psiv,DPM head,DPM *rp,P *dnp)
! 1726: {
! 1727: DPM u,p,s,t,d,q;
! 1728: DP dmy,mult,zzz;
! 1729: NODE nd;
! 1730: DMM mr0,mq0,mr,mq,m;
! 1731: MP mp;
! 1732: int i,n,j,len,nv,pos,max;
! 1733: int *wb;
! 1734: int sugar,psugar,multiple;
! 1735: P nm,tnm1,dn,tdn,tdn1,c;
! 1736: Q cont;
! 1737: Obj c1;
! 1738: struct oEGT eg0,eg1;
! 1739:
! 1740: dn = (P)ONE;
! 1741: if ( !g ) {
! 1742: *rp = 0; *dnp = dn; return 0;
! 1743: }
! 1744: nv = NV(g);
! 1745: sugar = g->sugar;
! 1746: mq0 = 0;
! 1747: if ( head ) {
! 1748: for ( m = BDY(head); m; m = NEXT(m) ) {
! 1749: NEXTDMM(mq0,mq);
! 1750: mq->c = m->c; mq->dl = m->dl; mq->pos = m->pos;
! 1751: }
! 1752: }
! 1753: mr0 = 0;
! 1754: max = psiv->len;
! 1755: for ( ; g; ) {
! 1756: pos = BDY(g)->pos;
! 1757: u = 0;
! 1758: if ( pos < max ) {
! 1759: nd = (NODE)BDY(psiv)[pos];
! 1760: for ( u = 0; nd; nd = NEXT(nd) ) {
! 1761: if ( dpm_redble(g,p = ps[(long)(BDY(nd))-1]) ) {
! 1762: dpm_red2(g,p,&u,&tdn,&mult);
! 1763: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
! 1764: sugar = MAX(sugar,psugar);
! 1765: if ( !UNIZ(tdn) ) {
! 1766: for ( m = mq0; m; m = NEXT(m) ) {
! 1767: arf_mul(CO,(Obj)tdn,m->c,&c1); m->c = c1;
! 1768: }
! 1769: for ( m = mr0; m; m = NEXT(m) ) {
! 1770: arf_mul(CO,(Obj)tdn,m->c,&c1); m->c = c1;
! 1771: }
! 1772: }
! 1773: NEXTDMM(mq0,mq);
! 1774: mq->c = BDY(mult)->c;
! 1775: mq->dl = BDY(mult)->dl; mq->pos = (long)BDY(nd);
! 1776: mulp(CO,dn,tdn,&tdn1); dn = tdn1;
! 1777: if ( !u ) goto last;
! 1778: break;
! 1779: }
! 1780: }
! 1781: }
! 1782: if ( u ) {
! 1783: g = u;
! 1784: } else {
! 1785: m = BDY(g);
! 1786: NEXTDMM(mr0,mr);
! 1787: mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos;
! 1788: dpm_rest(g,&t); g = t;
! 1789: }
! 1790: }
! 1791: last:
! 1792: if ( mr0 ) {
! 1793: NEXT(mr) = 0;
! 1794: MKDPM(nv,mr0,d); d->sugar = sugar;
! 1795: } else
! 1796: d = 0;
! 1797: if ( mq0 ) {
! 1798: NEXT(mq) = 0;
! 1799: MKDPM(nv,mq0,q); q->sugar = sugar;
! 1800: } else
! 1801: q = 0;
! 1802: *rp = d; *dnp = dn;
! 1803: return q;
! 1804: }
! 1805:
! 1806: DPM dpm_sp_nf(VECT psv,VECT psiv,int i,int j,DPM *nf)
! 1807: {
! 1808: DPM *ps;
! 1809: int n,nv,s1,s2,sugar,max,pos,psugar;
! 1810: DPM g,u,p,d,q,t;
! 1811: DMM mq0,mq,mr0,mr,m;
! 1812: DP mult,t1,t2;
! 1813: P dn,tdn,tdn1;
! 1814: NODE nd;
! 1815: Obj c1;
! 1816:
! 1817: ps = (DPM *)BDY(psv);
! 1818: n = psv->len;
! 1819: nv = ps[1]->nv;
! 1820: dpm_sp(ps[i],ps[j],&g,&t1,&t2);
! 1821: mq0 = 0;
! 1822: NEXTDMM(mq0,mq); mq->c = BDY(t1)->c; mq->pos = i; mq->dl = BDY(t1)->dl;
! 1823: NEXTDMM(mq0,mq); chsgnp((P)BDY(t2)->c,(P *)&mq->c); mq->pos = j; mq->dl = BDY(t2)->dl;
! 1824:
! 1825: if ( !g ) {
! 1826: NEXT(mq) = 0;
! 1827: MKDPM(nv,mq0,d);
! 1828: s1 = BDY(t1)->dl->td + ps[i]->sugar;
! 1829: s2 = BDY(t2)->dl->td + ps[j]->sugar;
! 1830: d->sugar = MAX(s1,s2);
! 1831: *nf = 0;
! 1832: return d;
! 1833: }
! 1834:
! 1835: dn = (P)ONE;
! 1836: sugar = g->sugar;
! 1837: mr0 = 0;
! 1838: max = psiv->len;
! 1839: while ( g ) {
! 1840: pos = BDY(g)->pos;
! 1841: u = 0;
! 1842: if ( pos < max ) {
! 1843: nd = (NODE)BDY(psiv)[pos];
! 1844: for ( u = 0; nd; nd = NEXT(nd) ) {
! 1845: if ( dpm_redble(g,p = ps[(long)(BDY(nd))]) ) {
! 1846: dpm_red2(g,p,&u,&tdn,&mult);
! 1847: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
! 1848: sugar = MAX(sugar,psugar);
! 1849: if ( !UNIZ(tdn) ) {
! 1850: for ( m = mq0; m; m = NEXT(m) ) {
! 1851: arf_mul(CO,(Obj)tdn,m->c,&c1); m->c = c1;
! 1852: }
! 1853: for ( m = mr0; m; m = NEXT(m) ) {
! 1854: arf_mul(CO,(Obj)tdn,m->c,&c1); m->c = c1;
! 1855: }
! 1856: }
! 1857: NEXTDMM(mq0,mq);
! 1858: chsgnp((P)BDY(mult)->c,(P *)&mq->c);
! 1859: mq->dl = BDY(mult)->dl; mq->pos = (long)BDY(nd);
! 1860: mulp(CO,dn,tdn,&tdn1); dn = tdn1;
! 1861: if ( !u ) goto last;
! 1862: break;
! 1863: }
! 1864: }
! 1865: }
! 1866: if ( u ) {
! 1867: g = u;
! 1868: } else {
! 1869: m = BDY(g);
! 1870: NEXTDMM(mr0,mr);
! 1871: mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos;
! 1872: dpm_rest(g,&t); g = t;
! 1873: }
! 1874: }
! 1875: last:
! 1876: if ( mr0 ) {
! 1877: NEXT(mr) = 0; MKDPM(nv,mr0,d); d->sugar = sugar;
! 1878: } else
! 1879: d = 0;
! 1880: NEXT(mq) = 0; MKDPM(nv,mq0,q); q->sugar = sugar;
! 1881: *nf = d;
! 1882: return q;
! 1883: }
! 1884:
1.1 noro 1885: DP *dp_true_nf_and_quotient_marked_mod(NODE b,DP g,DP *ps,DP *hps,int mod,DP *rp,P *dnp)
1886: {
1887: DP u,p,d,s,t,dmy,hp,mult;
1888: DP *q;
1889: NODE l;
1890: MP m,mr;
1891: int i,n,j;
1892: int *wb;
1893: int sugar,psugar;
1894: P dn,tdn,tdn1;
1895:
1896: for ( n = 0, l = b; l; l = NEXT(l), n++ );
1897: q = (DP *)MALLOC(n*sizeof(DP));
1898: for ( i = 0; i < n; i++ ) q[i] = 0;
1899: dn = (P)ONEM;
1900: if ( !g ) {
1901: *rp = 0; *dnp = dn; return 0;
1902: }
1903: wb = (int *)ALLOCA(n*sizeof(int));
1904: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1905: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 1906: sugar = g->sugar;
1907: for ( d = 0; g; ) {
1908: for ( u = 0, i = 0; i < n; i++ ) {
1909: if ( dp_redble(g,hp = hps[wb[i]]) ) {
1910: p = ps[wb[i]];
1911: dp_red_marked_mod(d,g,p,hp,mod,&t,&u,&tdn,&mult);
1912: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1913: sugar = MAX(sugar,psugar);
1914: for ( j = 0; j < n; j++ ) {
1915: mulmdc(CO,mod,q[j],(P)tdn,&dmy); q[j] = dmy;
1916: }
1917: addmd(CO,mod,q[wb[i]],mult,&dmy); q[wb[i]] = dmy;
1918: mulmp(CO,mod,dn,tdn,&tdn1); dn = tdn1;
1919: d = t;
1920: if ( !u ) goto last;
1921: break;
1922: }
1923: }
1924: if ( u )
1925: g = u;
1926: else {
1927: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1928: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1929: addmd(CO,mod,d,t,&s); d = s;
1930: dp_rest(g,&t); g = t;
1931: }
1932: }
1933: last:
1934: if ( d )
1935: d->sugar = sugar;
1936: *rp = d; *dnp = dn;
1937: return q;
1938: }
1939:
1940: /* nf computation over Z */
1941:
1942: void dp_nf_z(NODE b,DP g,DP *ps,int full,int multiple,DP *rp)
1943: {
1944: DP u,p,d,s,t,dmy1;
1945: P dmy;
1946: NODE l;
1947: MP m,mr;
1948: int i,n;
1949: int *wb;
1950: int hmag;
1951: int sugar,psugar;
1952:
1953: if ( !g ) {
1954: *rp = 0; return;
1955: }
1956: for ( n = 0, l = b; l; l = NEXT(l), n++ );
1957: wb = (int *)ALLOCA(n*sizeof(int));
1958: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1959: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 1960:
1961: hmag = multiple*HMAG(g);
1962: sugar = g->sugar;
1963:
1964: for ( d = 0; g; ) {
1965: for ( u = 0, i = 0; i < n; i++ ) {
1966: if ( dp_redble(g,p = ps[wb[i]]) ) {
1967: dp_red(d,g,p,&t,&u,&dmy,&dmy1);
1968: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1969: sugar = MAX(sugar,psugar);
1970: if ( !u ) {
1971: if ( d )
1972: d->sugar = sugar;
1973: *rp = d; return;
1974: }
1975: d = t;
1976: break;
1977: }
1978: }
1979: if ( u ) {
1980: g = u;
1981: if ( d ) {
1982: if ( multiple && HMAG(d) > hmag ) {
1983: dp_ptozp2(d,g,&t,&u); d = t; g = u;
1984: hmag = multiple*HMAG(d);
1985: }
1986: } else {
1987: if ( multiple && HMAG(g) > hmag ) {
1988: dp_ptozp(g,&t); g = t;
1989: hmag = multiple*HMAG(g);
1990: }
1991: }
1992: }
1993: else if ( !full ) {
1994: if ( g ) {
1995: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
1996: }
1997: *rp = g; return;
1998: } else {
1999: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
2000: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
2001: addd(CO,d,t,&s); d = s;
2002: dp_rest(g,&t); g = t;
2003:
2004: }
2005: }
2006: if ( d )
2007: d->sugar = sugar;
2008: *rp = d;
2009: }
2010:
1.4 noro 2011: void dpm_nf_z(NODE b,DPM g,VECT psv,int full,int multiple,DPM *rp)
1.1 noro 2012: {
1.4 noro 2013: DPM *ps;
1.1 noro 2014: DPM u,p,d,s,t;
2015: DP dmy1;
2016: P dmy;
1.3 noro 2017: Z cont;
1.1 noro 2018: NODE l;
2019: DMM m,mr;
2020: int i,n;
2021: int *wb;
2022: int hmag;
2023: int sugar,psugar;
2024:
2025: if ( !g ) {
2026: *rp = 0; return;
2027: }
1.4 noro 2028: if ( b ) {
2029: for ( n = 0, l = b; l; l = NEXT(l), n++ );
2030: wb = (int *)ALLOCA(n*sizeof(int));
2031: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
2032: wb[i] = ZTOS((Q)BDY(l));
2033: ps = (DPM *)BDY(psv);
2034: } else {
2035: n = psv->len;
2036: wb = (int *)MALLOC(n*sizeof(int));
2037: for ( i = 0; i < n; i++ ) wb[i] = i;
2038: ps = (DPM *)BDY(psv);
2039: }
1.1 noro 2040:
2041: hmag = multiple*HMAG(g);
2042: sugar = g->sugar;
2043:
2044: for ( d = 0; g; ) {
2045: for ( u = 0, i = 0; i < n; i++ ) {
1.4 noro 2046: if ( (p=ps[wb[i]])!=0 && dpm_redble(g,p) ) {
1.5 noro 2047: dpm_red2(g,p,&u,&dmy,&dmy1);
1.1 noro 2048: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
2049: sugar = MAX(sugar,psugar);
1.5 noro 2050: if ( d ) mulcdmm((Obj)dmy,BDY(d));
1.1 noro 2051: if ( !u ) {
2052: if ( d )
2053: d->sugar = sugar;
2054: *rp = d; return;
2055: }
2056: break;
2057: }
2058: }
2059: if ( u ) {
2060: g = u;
2061: if ( d ) {
2062: if ( multiple && HMAG(d) > hmag ) {
2063: dpm_ptozp2(d,g,&t,&u); d = t; g = u;
2064: hmag = multiple*HMAG(d);
2065: }
2066: } else {
2067: if ( multiple && HMAG(g) > hmag ) {
1.3 noro 2068: dpm_ptozp(g,&cont,&t); g = t;
1.1 noro 2069: hmag = multiple*HMAG(g);
2070: }
2071: }
2072: }
2073: else if ( !full ) {
2074: if ( g ) {
2075: MKDPM(g->nv,BDY(g),t); t->sugar = sugar; g = t;
2076: }
2077: *rp = g; return;
2078: } else {
2079: m = BDY(g); NEWDMM(mr); mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos;
2080: NEXT(mr) = 0; MKDPM(g->nv,mr,t); t->sugar = mr->dl->td;
1.5 noro 2081: d = appenddpm(d,t);
1.1 noro 2082: dpm_rest(g,&t); g = t;
2083: }
2084: }
2085: if ( d )
2086: d->sugar = sugar;
2087: *rp = d;
2088: }
2089:
1.3 noro 2090: void dpm_shift(DPM p,int s,DPM *r)
2091: {
2092: DMM m,mr0,mr;
2093: DPM t;
2094:
2095: if ( !p ) *r = 0;
2096: else {
2097: for ( m = BDY(p), mr0 = 0; m; m = NEXT(m) ) {
2098: NEXTDMM(mr0,mr);
2099: mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos-s;
2100: if ( mr->pos <= 0 )
2101: error("dpm_shift : too large shift value");
2102: }
2103: NEXT(mr) = 0;
2104: MKDPM(p->nv,mr0,t); t->sugar = p->sugar;
2105: *r = t;
2106: }
2107: }
2108:
2109: // up=sum{c*<<...:i>>|i<=s}, lo=sum{c*<<...:i>>|i>s}
2110:
2111: void dpm_split(DPM p,int s,DPM *up,DPM *lo)
2112: {
2113: DMM m,mu0,mu,ml0,ml;
2114: DPM t;
2115:
2116: if ( !p ) {
2117: *up = 0; *lo = 0;
2118: } else {
2119: for ( m = BDY(p), mu0 = ml0 = 0; m; m = NEXT(m) ) {
2120: if ( m->pos <= s ) {
2121: NEXTDMM(mu0,mu);
2122: mu->dl = m->dl; mu->c = m->c; mu->pos = m->pos;
2123: } else {
2124: NEXTDMM(ml0,ml);
2125: ml->dl = m->dl; ml->c = m->c; ml->pos = m->pos;
2126: }
2127: }
2128: if ( mu0 ) {
2129: NEXT(mu) = 0; MKDPM(p->nv,mu0,t); t->sugar = p->sugar;
2130: *up = t;
2131: } else
2132: *up = 0;
2133: if ( ml0 ) {
2134: NEXT(ml) = 0; MKDPM(p->nv,ml0,t); t->sugar = p->sugar;
2135: *lo = t;
2136: } else
2137: *lo = 0;
2138: }
2139: }
2140:
1.1 noro 2141: /* nf computation over a field */
2142:
2143: void dp_nf_f(NODE b,DP g,DP *ps,int full,DP *rp)
2144: {
2145: DP u,p,d,s,t;
2146: NODE l;
2147: MP m,mr;
2148: int i,n;
2149: int *wb;
2150: int sugar,psugar;
2151:
2152: if ( !g ) {
2153: *rp = 0; return;
2154: }
2155: for ( n = 0, l = b; l; l = NEXT(l), n++ );
2156: wb = (int *)ALLOCA(n*sizeof(int));
2157: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 2158: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 2159:
2160: sugar = g->sugar;
2161: for ( d = 0; g; ) {
2162: for ( u = 0, i = 0; i < n; i++ ) {
2163: if ( dp_redble(g,p = ps[wb[i]]) ) {
2164: dp_red_f(g,p,&u);
2165: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
2166: sugar = MAX(sugar,psugar);
2167: if ( !u ) {
2168: if ( d )
2169: d->sugar = sugar;
2170: *rp = d; return;
2171: }
2172: break;
2173: }
2174: }
2175: if ( u )
2176: g = u;
2177: else if ( !full ) {
2178: if ( g ) {
2179: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
2180: }
2181: *rp = g; return;
2182: } else {
2183: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
2184: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
2185: addd(CO,d,t,&s); d = s;
2186: dp_rest(g,&t); g = t;
2187: }
2188: }
2189: if ( d )
2190: d->sugar = sugar;
2191: *rp = d;
2192: }
2193:
1.4 noro 2194: void dpm_nf_f(NODE b,DPM g,VECT psv,int full,DPM *rp)
1.1 noro 2195: {
1.4 noro 2196: DPM *ps;
1.1 noro 2197: DPM u,p,d,s,t;
2198: NODE l;
2199: DMM m,mr;
2200: int i,n;
2201: int *wb;
2202: int sugar,psugar;
2203:
2204: if ( !g ) {
2205: *rp = 0; return;
2206: }
1.4 noro 2207: if ( b ) {
2208: for ( n = 0, l = b; l; l = NEXT(l), n++ );
2209: wb = (int *)ALLOCA(n*sizeof(int));
2210: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
2211: wb[i] = ZTOS((Q)BDY(l));
2212: ps = (DPM *)BDY(psv);
2213: } else {
2214: n = psv->len;
2215: wb = (int *)MALLOC(n*sizeof(int));
2216: for ( i = 0; i < n; i++ ) wb[i] = i;
2217: ps = (DPM *)BDY(psv);
2218: }
1.1 noro 2219:
2220: sugar = g->sugar;
2221: for ( d = 0; g; ) {
2222: for ( u = 0, i = 0; i < n; i++ ) {
1.4 noro 2223: if ( ( (p=ps[wb[i]]) != 0 ) && dpm_redble(g,p) ) {
1.1 noro 2224: dpm_red_f(g,p,&u);
2225: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
2226: sugar = MAX(sugar,psugar);
2227: if ( !u ) {
2228: if ( d )
2229: d->sugar = sugar;
2230: *rp = d; return;
2231: }
2232: break;
2233: }
2234: }
2235: if ( u )
2236: g = u;
2237: else if ( !full ) {
2238: if ( g ) {
2239: MKDPM(g->nv,BDY(g),t); t->sugar = sugar; g = t;
2240: }
2241: *rp = g; return;
2242: } else {
2243: m = BDY(g); NEWDMM(mr); mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos;
2244: NEXT(mr) = 0; MKDPM(g->nv,mr,t); t->sugar = mr->dl->td;
2245: adddpm(CO,d,t,&s); d = s;
2246: dpm_rest(g,&t); g = t;
2247: }
2248: }
2249: if ( d )
2250: d->sugar = sugar;
2251: *rp = d;
2252: }
2253:
2254: /* nf computation over GF(mod) (only for internal use) */
2255:
2256: void dp_nf_mod(NODE b,DP g,DP *ps,int mod,int full,DP *rp)
2257: {
2258: DP u,p,d,s,t;
2259: P dmy;
2260: NODE l;
2261: MP m,mr;
2262: int sugar,psugar;
2263:
2264: if ( !g ) {
2265: *rp = 0; return;
2266: }
2267: sugar = g->sugar;
2268: for ( d = 0; g; ) {
2269: for ( u = 0, l = b; l; l = NEXT(l) ) {
2270: if ( dp_redble(g,p = ps[(long)BDY(l)]) ) {
2271: dp_red_mod(d,g,p,mod,&t,&u,&dmy);
2272: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
2273: sugar = MAX(sugar,psugar);
2274: if ( !u ) {
2275: if ( d )
2276: d->sugar = sugar;
2277: *rp = d; return;
2278: }
2279: d = t;
2280: break;
2281: }
2282: }
2283: if ( u )
2284: g = u;
2285: else if ( !full ) {
2286: if ( g ) {
2287: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
2288: }
2289: *rp = g; return;
2290: } else {
2291: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
2292: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
2293: addmd(CO,mod,d,t,&s); d = s;
2294: dp_rest(g,&t); g = t;
2295: }
2296: }
2297: if ( d )
2298: d->sugar = sugar;
2299: *rp = d;
2300: }
2301:
2302: void dp_true_nf_mod(NODE b,DP g,DP *ps,int mod,int full,DP *rp,P *dnp)
2303: {
2304: DP u,p,d,s,t;
2305: NODE l;
2306: MP m,mr;
2307: int i,n;
2308: int *wb;
2309: int sugar,psugar;
2310: P dn,tdn,tdn1;
2311:
2312: dn = (P)ONEM;
2313: if ( !g ) {
2314: *rp = 0; *dnp = dn; return;
2315: }
1.3 noro 2316: for ( n = 0, l = b; l; l = NEXT(l), n++ )
2317: ;
2318: wb = (int *)ALLOCA(n*sizeof(int));
1.1 noro 2319: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 2320: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 2321: sugar = g->sugar;
2322: for ( d = 0; g; ) {
2323: for ( u = 0, i = 0; i < n; i++ ) {
2324: if ( dp_redble(g,p = ps[wb[i]]) ) {
2325: dp_red_mod(d,g,p,mod,&t,&u,&tdn);
2326: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
2327: sugar = MAX(sugar,psugar);
2328: if ( !u ) {
2329: if ( d )
2330: d->sugar = sugar;
2331: *rp = d; *dnp = dn; return;
2332: } else {
2333: d = t;
2334: mulmp(CO,mod,dn,tdn,&tdn1); dn = tdn1;
2335: }
2336: break;
2337: }
2338: }
2339: if ( u )
2340: g = u;
2341: else if ( !full ) {
2342: if ( g ) {
2343: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
2344: }
2345: *rp = g; *dnp = dn; return;
2346: } else {
2347: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
2348: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
2349: addmd(CO,mod,d,t,&s); d = s;
2350: dp_rest(g,&t); g = t;
2351: }
2352: }
2353: if ( d )
2354: d->sugar = sugar;
2355: *rp = d; *dnp = dn;
2356: }
2357:
2358: void _dp_nf_mod_destructive(NODE b,DP g,DP *ps,int mod,int full,DP *rp)
2359: {
2360: DP u,p,d;
2361: NODE l;
2362: MP m,mrd;
2363: int sugar,psugar,n,h_reducible;
2364:
2365: if ( !g ) {
2366: *rp = 0; return;
2367: }
2368: sugar = g->sugar;
2369: n = g->nv;
2370: for ( d = 0; g; ) {
2371: for ( h_reducible = 0, l = b; l; l = NEXT(l) ) {
2372: if ( dp_redble(g,p = ps[(long)BDY(l)]) ) {
2373: h_reducible = 1;
2374: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
2375: _dp_red_mod_destructive(g,p,mod,&u); g = u;
2376: sugar = MAX(sugar,psugar);
2377: if ( !g ) {
2378: if ( d )
2379: d->sugar = sugar;
2380: _dptodp(d,rp); _free_dp(d); return;
2381: }
2382: break;
2383: }
2384: }
2385: if ( !h_reducible ) {
2386: /* head term is not reducible */
2387: if ( !full ) {
2388: if ( g )
2389: g->sugar = sugar;
2390: _dptodp(g,rp); _free_dp(g); return;
2391: } else {
2392: m = BDY(g);
2393: if ( NEXT(m) ) {
2394: BDY(g) = NEXT(m); NEXT(m) = 0;
2395: } else {
2396: _FREEDP(g); g = 0;
2397: }
2398: if ( d ) {
2399: for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) );
2400: NEXT(mrd) = m;
2401: } else {
2402: _MKDP(n,m,d);
2403: }
2404: }
2405: }
2406: }
2407: if ( d )
2408: d->sugar = sugar;
2409: _dptodp(d,rp); _free_dp(d);
2410: }
2411:
2412: /* reduction by linear base over a field */
2413:
2414: void dp_lnf_f(DP p1,DP p2,NODE g,DP *r1p,DP *r2p)
2415: {
2416: DP r1,r2,b1,b2,t,s;
2417: Obj c,c1,c2;
2418: NODE l,b;
2419: int n;
2420:
2421: if ( !p1 ) {
2422: *r1p = p1; *r2p = p2; return;
2423: }
2424: n = p1->nv;
2425: for ( l = g, r1 = p1, r2 = p2; l; l = NEXT(l) ) {
2426: if ( !r1 ) {
2427: *r1p = r1; *r2p = r2; return;
2428: }
2429: b = BDY((LIST)BDY(l)); b1 = (DP)BDY(b);
2430: if ( dl_equal(n,BDY(r1)->dl,BDY(b1)->dl) ) {
2431: b2 = (DP)BDY(NEXT(b));
2432: divr(CO,(Obj)ONE,(Obj)BDY(b1)->c,&c1);
2433: mulr(CO,c1,(Obj)BDY(r1)->c,&c2); chsgnr(c2,&c);
2434: muldc(CO,b1,(Obj)c,&t); addd(CO,r1,t,&s); r1 = s;
2435: muldc(CO,b2,(Obj)c,&t); addd(CO,r2,t,&s); r2 = s;
2436: }
2437: }
2438: *r1p = r1; *r2p = r2;
2439: }
2440:
2441: /* reduction by linear base over GF(mod) */
2442:
2443: void dp_lnf_mod(DP p1,DP p2,NODE g,int mod,DP *r1p,DP *r2p)
2444: {
2445: DP r1,r2,b1,b2,t,s;
2446: P c;
2447: MQ c1,c2;
2448: NODE l,b;
2449: int n;
2450:
2451: if ( !p1 ) {
2452: *r1p = p1; *r2p = p2; return;
2453: }
2454: n = p1->nv;
2455: for ( l = g, r1 = p1, r2 = p2; l; l = NEXT(l) ) {
2456: if ( !r1 ) {
2457: *r1p = r1; *r2p = r2; return;
2458: }
2459: b = BDY((LIST)BDY(l)); b1 = (DP)BDY(b);
2460: if ( dl_equal(n,BDY(r1)->dl,BDY(b1)->dl) ) {
2461: b2 = (DP)BDY(NEXT(b));
2462: invmq(mod,(MQ)BDY(b1)->c,&c1);
2463: mulmq(mod,c1,(MQ)BDY(r1)->c,&c2); chsgnmp(mod,(P)c2,&c);
2464: mulmdc(CO,mod,b1,c,&t); addmd(CO,mod,r1,t,&s); r1 = s;
2465: mulmdc(CO,mod,b2,c,&t); addmd(CO,mod,r2,t,&s); r2 = s;
2466: }
2467: }
2468: *r1p = r1; *r2p = r2;
2469: }
2470:
2471: void dp_nf_tab_mod(DP p,LIST *tab,int mod,DP *rp)
2472: {
2473: DP s,t,u;
2474: MP m;
2475: DL h;
2476: int i,n;
2477:
2478: if ( !p ) {
2479: *rp = p; return;
2480: }
2481: n = p->nv;
2482: for ( s = 0, i = 0, m = BDY(p); m; m = NEXT(m) ) {
2483: h = m->dl;
2484: while ( !dl_equal(n,h,BDY((DP)BDY(BDY(tab[i])))->dl ) )
2485: i++;
2486: mulmdc(CO,mod,(DP)BDY(NEXT(BDY(tab[i]))),(P)m->c,&t);
2487: addmd(CO,mod,s,t,&u); s = u;
2488: }
2489: *rp = s;
2490: }
2491:
2492: void dp_nf_tab_f(DP p,LIST *tab,DP *rp)
2493: {
2494: DP s,t,u;
2495: MP m;
2496: DL h;
2497: int i,n;
2498:
2499: if ( !p ) {
2500: *rp = p; return;
2501: }
2502: n = p->nv;
2503: for ( s = 0, i = 0, m = BDY(p); m; m = NEXT(m) ) {
2504: h = m->dl;
2505: while ( !dl_equal(n,h,BDY((DP)BDY(BDY(tab[i])))->dl ) )
2506: i++;
2507: muldc(CO,(DP)BDY(NEXT(BDY(tab[i]))),m->c,&t);
2508: addd(CO,s,t,&u); s = u;
2509: }
2510: *rp = s;
2511: }
2512:
2513: /*
2514: * setting flags
2515: * call create_order_spec with vl=0 to set old type order.
2516: *
2517: */
2518:
2519: int create_order_spec(VL vl,Obj obj,struct order_spec **specp)
2520: {
2521: int i,j,n,s,row,col,ret,wlen;
2522: struct order_spec *spec;
2523: struct order_pair *l;
2524: Obj wp,wm;
2525: NODE node,t,tn,wpair;
2526: MAT m;
2527: VECT v;
2528: pointer **b,*bv;
2529: int **w;
2530:
2531: if ( vl && obj && OID(obj) == O_LIST ) {
2532: ret = create_composite_order_spec(vl,(LIST)obj,specp);
2533: if ( show_orderspec )
2534: print_composite_order_spec(*specp);
2535: return ret;
2536: }
2537:
2538: *specp = spec = (struct order_spec *)MALLOC(sizeof(struct order_spec));
2539: if ( !obj || NUM(obj) ) {
2540: spec->id = 0; spec->obj = obj;
1.2 noro 2541: spec->ord.simple = ZTOS((Q)obj);
1.1 noro 2542: return 1;
2543: } else if ( OID(obj) == O_LIST ) {
1.6 noro 2544: /* module order */
1.1 noro 2545: node = BDY((LIST)obj);
2546: if ( !BDY(node) || NUM(BDY(node)) ) {
2547: switch ( length(node) ) {
1.6 noro 2548: case 2: /* [n,ord] */
1.1 noro 2549: create_order_spec(0,(Obj)BDY(NEXT(node)),&spec);
2550: spec->id += 256; spec->obj = obj;
2551: spec->top_weight = 0;
2552: spec->module_rank = 0;
2553: spec->module_top_weight = 0;
1.6 noro 2554: spec->module_ordtype = ZTOS((Z)BDY(node));
2555: if ( spec->module_ordtype < 0 ) {
2556: spec->pot_nelim = -spec->module_ordtype;
2557: spec->module_ordtype = 1;
2558: } else
2559: spec->pot_nelim = 0;
2560: break;
2561:
2562: case 3: /* [n,[wv,wm],ord] */
2563: spec->module_ordtype = ZTOS((Z)BDY(node));
2564: if ( spec->module_ordtype < 0 ) {
2565: spec->pot_nelim = -spec->module_ordtype;
2566: spec->module_ordtype = 1;
2567: } else
1.1 noro 2568: spec->pot_nelim = 0;
1.6 noro 2569:
2570: if ( spec->module_ordtype == 3 ) { /* schreyer order */
2571: Obj baseobj;
2572: struct order_spec *basespec;
2573: int len;
2574: NODE in;
2575: LIST *la;
2576: DMMstack stack;
2577: DMMstack push_schreyer_order(LIST l,DMMstack s);
2578:
2579: spec->id = 300; spec->obj = obj;
2580: node = NEXT(node);
2581: if ( !BDY(node) || OID(BDY(node)) != O_LIST )
2582: error("create_order_spec : [mlist1,mlist,...] must be specified for defining a schreyer order");
2583: stack = 0;
2584: in = BDY((LIST)BDY(node));
2585: len = length(in);
2586: la = (LIST *)MALLOC(len*sizeof(LIST));
2587: for ( i = 0; i < len; i++, in = NEXT(in) ) la[i] = (LIST)(BDY(in));
2588: for ( i = len-1; i >= 0; i-- ) stack = push_schreyer_order(la[i],stack);
2589: spec->dmmstack = stack;
2590:
2591: node = NEXT(node);
2592: baseobj = (Obj)BDY(node);
2593: create_order_spec(0,baseobj,&basespec);
2594: basespec->obj = baseobj;
2595: spec->base = basespec;
2596: } else { /* weighted order */
1.7 noro 2597: int ordtype;
2598:
2599: ordtype = spec->module_ordtype;
1.6 noro 2600: create_order_spec(0,(Obj)BDY(NEXT(NEXT(node))),&spec);
1.7 noro 2601: spec->module_ordtype = ordtype;
2602: spec->id += 256; spec->obj = obj;
1.6 noro 2603: node = NEXT(node);
2604: if ( !BDY(node) || OID(BDY(node)) != O_LIST )
2605: error("create_order_spec : [weight_for_poly,weight_for_modlue] must be specified as a module topweight");
2606: wpair = BDY((LIST)BDY(node));
2607: if ( length(wpair) != 2 )
2608: error("create_order_spec : [weight_for_poly,weight_for_modlue] must be specified as a module topweight");
2609:
2610: wp = BDY(wpair);
2611: wm = BDY(NEXT(wpair));
2612: if ( !wp || OID(wp) != O_LIST || !wm || OID(wm) != O_LIST )
2613: error("create_order_spec : [weight_for_poly,weight_for_modlue] must be specified as a module topweight");
2614: spec->nv = length(BDY((LIST)wp));
2615: spec->top_weight = (int *)MALLOC_ATOMIC(spec->nv*sizeof(int));
2616: for ( i = 0, t = BDY((LIST)wp); i < spec->nv; t = NEXT(t), i++ )
2617: spec->top_weight[i] = ZTOS((Q)BDY(t));
2618:
2619: spec->module_rank = length(BDY((LIST)wm));
2620: spec->module_top_weight = (int *)MALLOC_ATOMIC(spec->module_rank*sizeof(int));
2621: for ( i = 0, t = BDY((LIST)wm); i < spec->module_rank; t = NEXT(t), i++ )
2622: spec->module_top_weight[i] = ZTOS((Q)BDY(t));
1.1 noro 2623: }
2624: break;
2625:
2626: default:
2627: error("create_order_spec : invalid arguments for module order");
2628: }
2629:
2630: *specp = spec;
2631: return 1;
2632: } else {
2633: /* block order in polynomial ring */
2634: for ( n = 0, t = node; t; t = NEXT(t), n++ );
2635: l = (struct order_pair *)MALLOC_ATOMIC(n*sizeof(struct order_pair));
2636: for ( i = 0, t = node, s = 0; i < n; t = NEXT(t), i++ ) {
1.2 noro 2637: tn = BDY((LIST)BDY(t)); l[i].order = ZTOS((Q)BDY(tn));
2638: tn = NEXT(tn); l[i].length = ZTOS((Q)BDY(tn));
1.1 noro 2639: s += l[i].length;
2640: }
2641: spec->id = 1; spec->obj = obj;
2642: spec->ord.block.order_pair = l;
2643: spec->ord.block.length = n; spec->nv = s;
2644: return 1;
2645: }
2646: } else if ( OID(obj) == O_MAT ) {
2647: m = (MAT)obj; row = m->row; col = m->col; b = BDY(m);
2648: w = almat(row,col);
2649: for ( i = 0; i < row; i++ )
2650: for ( j = 0; j < col; j++ )
1.2 noro 2651: w[i][j] = ZTOS((Q)b[i][j]);
1.1 noro 2652: spec->id = 2; spec->obj = obj;
2653: spec->nv = col; spec->ord.matrix.row = row;
2654: spec->ord.matrix.matrix = w;
2655: return 1;
2656: } else
2657: return 0;
2658: }
2659:
2660: void print_composite_order_spec(struct order_spec *spec)
2661: {
2662: int nv,n,len,i,j,k,start;
2663: struct weight_or_block *worb;
2664:
2665: nv = spec->nv;
2666: n = spec->ord.composite.length;
2667: worb = spec->ord.composite.w_or_b;
2668: for ( i = 0; i < n; i++, worb++ ) {
2669: len = worb->length;
2670: printf("[ ");
2671: switch ( worb->type ) {
2672: case IS_DENSE_WEIGHT:
2673: for ( j = 0; j < len; j++ )
2674: printf("%d ",worb->body.dense_weight[j]);
2675: for ( ; j < nv; j++ )
2676: printf("0 ");
2677: break;
2678: case IS_SPARSE_WEIGHT:
2679: for ( j = 0, k = 0; j < nv; j++ )
2680: if ( j == worb->body.sparse_weight[k].pos )
2681: printf("%d ",worb->body.sparse_weight[k++].value);
2682: else
2683: printf("0 ");
2684: break;
2685: case IS_BLOCK:
2686: start = worb->body.block.start;
2687: for ( j = 0; j < start; j++ ) printf("0 ");
2688: switch ( worb->body.block.order ) {
2689: case 0:
2690: for ( k = 0; k < len; k++, j++ ) printf("R ");
2691: break;
2692: case 1:
2693: for ( k = 0; k < len; k++, j++ ) printf("G ");
2694: break;
2695: case 2:
2696: for ( k = 0; k < len; k++, j++ ) printf("L ");
2697: break;
2698: }
2699: for ( ; j < nv; j++ ) printf("0 ");
2700: break;
2701: }
2702: printf("]\n");
2703: }
2704: }
2705:
2706: struct order_spec *append_block(struct order_spec *spec,
2707: int nv,int nalg,int ord)
2708: {
2709: MAT m,mat;
2710: int i,j,row,col,n;
2711: Z **b,**wp;
2712: int **w;
2713: NODE t,s,s0;
2714: struct order_pair *l,*l0;
2715: int n0,nv0;
2716: LIST list0,list1,list;
2717: Z oq,nq;
2718: struct order_spec *r;
2719:
2720: r = (struct order_spec *)MALLOC(sizeof(struct order_spec));
2721: switch ( spec->id ) {
2722: case 0:
1.2 noro 2723: STOZ(spec->ord.simple,oq); STOZ(nv,nq);
1.1 noro 2724: t = mknode(2,oq,nq); MKLIST(list0,t);
1.2 noro 2725: STOZ(ord,oq); STOZ(nalg,nq);
1.1 noro 2726: t = mknode(2,oq,nq); MKLIST(list1,t);
2727: t = mknode(2,list0,list1); MKLIST(list,t);
2728: l = (struct order_pair *)MALLOC_ATOMIC(2*sizeof(struct order_pair));
2729: l[0].order = spec->ord.simple; l[0].length = nv;
2730: l[1].order = ord; l[1].length = nalg;
2731: r->id = 1; r->obj = (Obj)list;
2732: r->ord.block.order_pair = l;
2733: r->ord.block.length = 2;
2734: r->nv = nv+nalg;
2735: break;
2736: case 1:
2737: if ( spec->nv != nv )
2738: error("append_block : number of variables mismatch");
2739: l0 = spec->ord.block.order_pair;
2740: n0 = spec->ord.block.length;
2741: nv0 = spec->nv;
2742: list0 = (LIST)spec->obj;
2743: n = n0+1;
2744: l = (struct order_pair *)MALLOC_ATOMIC(n*sizeof(struct order_pair));
2745: for ( i = 0; i < n0; i++ )
2746: l[i] = l0[i];
2747: l[i].order = ord; l[i].length = nalg;
2748: for ( t = BDY(list0), s0 = 0; t; t = NEXT(t) ) {
2749: NEXTNODE(s0,s); BDY(s) = BDY(t);
2750: }
1.2 noro 2751: STOZ(ord,oq); STOZ(nalg,nq);
1.1 noro 2752: t = mknode(2,oq,nq); MKLIST(list,t);
2753: NEXTNODE(s0,s); BDY(s) = (pointer)list; NEXT(s) = 0;
2754: MKLIST(list,s0);
2755: r->id = 1; r->obj = (Obj)list;
2756: r->ord.block.order_pair = l;
2757: r->ord.block.length = n;
2758: r->nv = nv+nalg;
2759: break;
2760: case 2:
2761: if ( spec->nv != nv )
2762: error("append_block : number of variables mismatch");
2763: m = (MAT)spec->obj;
2764: row = m->row; col = m->col; b = (Z **)BDY(m);
2765: w = almat(row+nalg,col+nalg);
2766: MKMAT(mat,row+nalg,col+nalg); wp = (Z **)BDY(mat);
2767: for ( i = 0; i < row; i++ )
2768: for ( j = 0; j < col; j++ ) {
1.2 noro 2769: w[i][j] = ZTOS(b[i][j]);
1.1 noro 2770: wp[i][j] = b[i][j];
2771: }
2772: for ( i = 0; i < nalg; i++ ) {
2773: w[i+row][i+col] = 1;
2774: wp[i+row][i+col] = ONE;
2775: }
2776: r->id = 2; r->obj = (Obj)mat;
2777: r->nv = col+nalg; r->ord.matrix.row = row+nalg;
2778: r->ord.matrix.matrix = w;
2779: break;
2780: case 3:
2781: default:
2782: /* XXX */
2783: error("append_block : not implemented yet");
2784: }
2785: return r;
2786: }
2787:
2788: int comp_sw(struct sparse_weight *a, struct sparse_weight *b)
2789: {
2790: if ( a->pos > b->pos ) return 1;
2791: else if ( a->pos < b->pos ) return -1;
2792: else return 0;
2793: }
2794:
2795: /* order = [w_or_b, w_or_b, ... ] */
2796: /* w_or_b = w or b */
2797: /* w = [1,2,...] or [x,1,y,2,...] */
2798: /* b = [@lex,x,y,...,z] etc */
2799:
2800: int create_composite_order_spec(VL vl,LIST order,struct order_spec **specp)
2801: {
2802: NODE wb,t,p;
2803: struct order_spec *spec;
2804: VL tvl;
2805: int n,i,j,k,l,start,end,len,w;
2806: int *dw;
2807: struct sparse_weight *sw;
2808: struct weight_or_block *w_or_b;
2809: Obj a0;
2810: NODE a;
2811: V v,sv,ev;
2812: SYMBOL sym;
2813: int *top;
2814:
2815: /* l = number of vars in vl */
2816: for ( l = 0, tvl = vl; tvl; tvl = NEXT(tvl), l++ );
2817: /* n = number of primitives in order */
2818: wb = BDY(order);
2819: n = length(wb);
2820: *specp = spec = (struct order_spec *)MALLOC(sizeof(struct order_spec));
2821: spec->id = 3;
2822: spec->obj = (Obj)order;
2823: spec->nv = l;
2824: spec->ord.composite.length = n;
2825: w_or_b = spec->ord.composite.w_or_b = (struct weight_or_block *)
2826: MALLOC(sizeof(struct weight_or_block)*(n+1));
2827:
2828: /* top : register the top variable in each w_or_b specification */
2829: top = (int *)ALLOCA(l*sizeof(int));
2830: for ( i = 0; i < l; i++ ) top[i] = 0;
2831:
2832: for ( t = wb, i = 0; t; t = NEXT(t), i++ ) {
2833: if ( !BDY(t) || OID((Obj)BDY(t)) != O_LIST )
2834: error("a list of lists must be specified for the key \"order\"");
2835: a = BDY((LIST)BDY(t));
2836: len = length(a);
2837: a0 = (Obj)BDY(a);
2838: if ( !a0 || OID(a0) == O_N ) {
2839: /* a is a dense weight vector */
2840: dw = (int *)MALLOC(sizeof(int)*len);
2841: for ( j = 0, p = a; j < len; p = NEXT(p), j++ ) {
2842: if ( !INT((Q)BDY(p)) )
2843: error("a dense weight vector must be specified as a list of integers");
1.2 noro 2844: dw[j] = ZTOS((Q)BDY(p));
1.1 noro 2845: }
2846: w_or_b[i].type = IS_DENSE_WEIGHT;
2847: w_or_b[i].length = len;
2848: w_or_b[i].body.dense_weight = dw;
2849:
2850: /* find the top */
2851: for ( k = 0; k < len && !dw[k]; k++ );
2852: if ( k < len ) top[k] = 1;
2853:
2854: } else if ( OID(a0) == O_P ) {
2855: /* a is a sparse weight vector */
2856: len >>= 1;
2857: sw = (struct sparse_weight *)
2858: MALLOC(sizeof(struct sparse_weight)*len);
2859: for ( j = 0, p = a; j < len; j++ ) {
2860: if ( !BDY(p) || OID((P)BDY(p)) != O_P )
2861: error("a sparse weight vector must be specified as [var1,weight1,...]");
2862: v = VR((P)BDY(p)); p = NEXT(p);
2863: for ( tvl = vl, k = 0; tvl && tvl->v != v;
2864: k++, tvl = NEXT(tvl) );
2865: if ( !tvl )
2866: error("invalid variable name in a sparse weight vector");
2867: sw[j].pos = k;
2868: if ( !INT((Q)BDY(p)) )
2869: error("a sparse weight vector must be specified as [var1,weight1,...]");
1.2 noro 2870: sw[j].value = ZTOS((Q)BDY(p)); p = NEXT(p);
1.1 noro 2871: }
2872: qsort(sw,len,sizeof(struct sparse_weight),
2873: (int (*)(const void *,const void *))comp_sw);
2874: w_or_b[i].type = IS_SPARSE_WEIGHT;
2875: w_or_b[i].length = len;
2876: w_or_b[i].body.sparse_weight = sw;
2877:
2878: /* find the top */
2879: for ( k = 0; k < len && !sw[k].value; k++ );
2880: if ( k < len ) top[sw[k].pos] = 1;
2881: } else if ( OID(a0) == O_RANGE ) {
2882: /* [range(v1,v2),w] */
2883: sv = VR((P)(((RANGE)a0)->start));
2884: ev = VR((P)(((RANGE)a0)->end));
2885: for ( tvl = vl, start = 0; tvl && tvl->v != sv; start++, tvl = NEXT(tvl) );
2886: if ( !tvl )
2887: error("invalid range");
2888: for ( end = start; tvl && tvl->v != ev; end++, tvl = NEXT(tvl) );
2889: if ( !tvl )
2890: error("invalid range");
2891: len = end-start+1;
2892: sw = (struct sparse_weight *)
2893: MALLOC(sizeof(struct sparse_weight)*len);
1.2 noro 2894: w = ZTOS((Q)BDY(NEXT(a)));
1.1 noro 2895: for ( tvl = vl, k = 0; k < start; k++, tvl = NEXT(tvl) );
2896: for ( j = 0 ; k <= end; k++, tvl = NEXT(tvl), j++ ) {
2897: sw[j].pos = k;
2898: sw[j].value = w;
2899: }
2900: w_or_b[i].type = IS_SPARSE_WEIGHT;
2901: w_or_b[i].length = len;
2902: w_or_b[i].body.sparse_weight = sw;
2903:
2904: /* register the top */
2905: if ( w ) top[start] = 1;
2906: } else if ( OID(a0) == O_SYMBOL ) {
2907: /* a is a block */
2908: sym = (SYMBOL)a0; a = NEXT(a); len--;
2909: if ( OID((Obj)BDY(a)) == O_RANGE ) {
2910: sv = VR((P)(((RANGE)BDY(a))->start));
2911: ev = VR((P)(((RANGE)BDY(a))->end));
2912: for ( tvl = vl, start = 0; tvl && tvl->v != sv; start++, tvl = NEXT(tvl) );
2913: if ( !tvl )
2914: error("invalid range");
2915: for ( end = start; tvl && tvl->v != ev; end++, tvl = NEXT(tvl) );
2916: if ( !tvl )
2917: error("invalid range");
2918: len = end-start+1;
2919: } else {
2920: for ( start = 0, tvl = vl; tvl->v != VR((P)BDY(a));
2921: tvl = NEXT(tvl), start++ );
2922: for ( p = NEXT(a), tvl = NEXT(tvl); p;
2923: p = NEXT(p), tvl = NEXT(tvl) ) {
2924: if ( !BDY(p) || OID((P)BDY(p)) != O_P )
2925: error("a block must be specified as [ordsymbol,var1,var2,...]");
2926: if ( tvl->v != VR((P)BDY(p)) ) break;
2927: }
2928: if ( p )
2929: error("a block must be contiguous in the variable list");
2930: }
2931: w_or_b[i].type = IS_BLOCK;
2932: w_or_b[i].length = len;
2933: w_or_b[i].body.block.start = start;
2934: if ( !strcmp(sym->name,"@grlex") )
2935: w_or_b[i].body.block.order = 0;
2936: else if ( !strcmp(sym->name,"@glex") )
2937: w_or_b[i].body.block.order = 1;
2938: else if ( !strcmp(sym->name,"@lex") )
2939: w_or_b[i].body.block.order = 2;
2940: else
2941: error("invalid ordername");
2942: /* register the tops */
2943: for ( j = 0, k = start; j < len; j++, k++ )
2944: top[k] = 1;
2945: }
2946: }
2947: for ( k = 0; k < l && top[k]; k++ );
2948: if ( k < l ) {
2949: /* incomplete order specification; add @grlex */
2950: w_or_b[n].type = IS_BLOCK;
2951: w_or_b[n].length = l;
2952: w_or_b[n].body.block.start = 0;
2953: w_or_b[n].body.block.order = 0;
2954: spec->ord.composite.length = n+1;
2955: }
1.3 noro 2956: return 1;
1.1 noro 2957: }
2958:
2959: /* module order spec */
2960:
2961: void create_modorder_spec(int id,LIST shift,struct modorder_spec **s)
2962: {
2963: struct modorder_spec *spec;
2964: NODE n,t;
2965: LIST list;
2966: int *ds;
2967: int i,l;
2968: Z q;
2969:
2970: *s = spec = (struct modorder_spec *)MALLOC(sizeof(struct modorder_spec));
2971: spec->id = id;
2972: if ( shift ) {
2973: n = BDY(shift);
2974: spec->len = l = length(n);
2975: spec->degree_shift = ds = (int *)MALLOC_ATOMIC(l*sizeof(int));
2976: for ( t = n, i = 0; t; t = NEXT(t), i++ )
1.2 noro 2977: ds[i] = ZTOS((Q)BDY(t));
1.1 noro 2978: } else {
2979: spec->len = 0;
2980: spec->degree_shift = 0;
2981: }
1.2 noro 2982: STOZ(id,q);
1.1 noro 2983: n = mknode(2,q,shift);
2984: MKLIST(list,n);
2985: spec->obj = (Obj)list;
2986: }
2987:
2988: /*
2989: * converters
2990: *
2991: */
2992:
1.7 noro 2993: void dpm_homo(DPM p,DPM *rp)
2994: {
2995: DMM m,mr,mr0,t;
2996: int i,n,nv,td;
2997: DL dl,dlh;
2998:
2999: if ( !p )
3000: *rp = 0;
3001: else {
3002: n = p->nv; nv = n + 1;
3003: m = BDY(p);
3004: td = 0;
3005: for ( t = m; t; t = NEXT(t) )
3006: if ( m->dl->td > td ) td = m->dl->td;
3007: for ( mr0 = 0; m; m = NEXT(m) ) {
3008: NEXTDMM(mr0,mr); mr->c = m->c; mr->pos = m->pos;
3009: dl = m->dl;
3010: mr->dl = dlh = (DL)MALLOC_ATOMIC((nv+1)*sizeof(int));
3011: dlh->td = td;
3012: for ( i = 0; i < n; i++ )
3013: dlh->d[i] = dl->d[i];
3014: dlh->d[n] = td - dl->td;
3015: }
3016: NEXT(mr) = 0; MKDPM(nv,mr0,*rp); (*rp)->sugar = p->sugar;
3017: }
3018: }
3019:
3020: void dpm_dehomo(DPM p,DPM *rp)
3021: {
3022: DMM m,mr,mr0;
3023: int i,n,nv;
3024: DL dl,dlh;
3025:
3026: if ( !p )
3027: *rp = 0;
3028: else {
3029: n = p->nv; nv = n - 1;
3030: m = BDY(p);
3031: for ( mr0 = 0; m; m = NEXT(m) ) {
3032: NEXTDMM(mr0,mr); mr->c = m->c; mr->pos = m->pos;
3033: dlh = m->dl;
3034: mr->dl = dl = (DL)MALLOC_ATOMIC((nv+1)*sizeof(int));
3035: dl->td = dlh->td - dlh->d[nv];
3036: for ( i = 0; i < nv; i++ )
3037: dl->d[i] = dlh->d[i];
3038: }
3039: NEXT(mr) = 0; MKDPM(nv,mr0,*rp); (*rp)->sugar = p->sugar;
3040: }
3041: }
3042:
1.1 noro 3043: void dp_homo(DP p,DP *rp)
3044: {
3045: MP m,mr,mr0;
3046: int i,n,nv,td;
3047: DL dl,dlh;
3048:
3049: if ( !p )
3050: *rp = 0;
3051: else {
3052: n = p->nv; nv = n + 1;
3053: m = BDY(p); td = sugard(m);
3054: for ( mr0 = 0; m; m = NEXT(m) ) {
3055: NEXTMP(mr0,mr); mr->c = m->c;
3056: dl = m->dl;
3057: mr->dl = dlh = (DL)MALLOC_ATOMIC((nv+1)*sizeof(int));
3058: dlh->td = td;
3059: for ( i = 0; i < n; i++ )
3060: dlh->d[i] = dl->d[i];
3061: dlh->d[n] = td - dl->td;
3062: }
3063: NEXT(mr) = 0; MKDP(nv,mr0,*rp); (*rp)->sugar = p->sugar;
3064: }
3065: }
3066:
3067: void dp_dehomo(DP p,DP *rp)
3068: {
3069: MP m,mr,mr0;
3070: int i,n,nv;
3071: DL dl,dlh;
3072:
3073: if ( !p )
3074: *rp = 0;
3075: else {
3076: n = p->nv; nv = n - 1;
3077: m = BDY(p);
3078: for ( mr0 = 0; m; m = NEXT(m) ) {
3079: NEXTMP(mr0,mr); mr->c = m->c;
3080: dlh = m->dl;
3081: mr->dl = dl = (DL)MALLOC_ATOMIC((nv+1)*sizeof(int));
3082: dl->td = dlh->td - dlh->d[nv];
3083: for ( i = 0; i < nv; i++ )
3084: dl->d[i] = dlh->d[i];
3085: }
3086: NEXT(mr) = 0; MKDP(nv,mr0,*rp); (*rp)->sugar = p->sugar;
3087: }
3088: }
3089:
1.7 noro 3090:
1.1 noro 3091: void dp_mod(DP p,int mod,NODE subst,DP *rp)
3092: {
3093: MP m,mr,mr0;
3094: P t,s,s1;
3095: V v;
3096: NODE tn;
3097:
3098: if ( !p )
3099: *rp = 0;
3100: else {
3101: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
3102: for ( tn = subst, s = (P)m->c; tn; tn = NEXT(tn) ) {
3103: v = VR((P)BDY(tn)); tn = NEXT(tn);
3104: substp(CO,s,v,(P)BDY(tn),&s1); s = s1;
3105: }
3106: ptomp(mod,s,&t);
3107: if ( t ) {
3108: NEXTMP(mr0,mr); mr->c = (Obj)t; mr->dl = m->dl;
3109: }
3110: }
3111: if ( mr0 ) {
3112: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
3113: } else
3114: *rp = 0;
3115: }
3116: }
3117:
3118: void dp_rat(DP p,DP *rp)
3119: {
3120: MP m,mr,mr0;
3121:
3122: if ( !p )
3123: *rp = 0;
3124: else {
3125: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
3126: NEXTMP(mr0,mr); mptop((P)m->c,(P *)&mr->c); mr->dl = m->dl;
3127: }
3128: if ( mr0 ) {
3129: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
3130: } else
3131: *rp = 0;
3132: }
3133: }
3134:
3135:
3136: void homogenize_order(struct order_spec *old,int n,struct order_spec **newp)
3137: {
3138: struct order_pair *l;
3139: int length,nv,row,i,j;
3140: int **newm,**oldm;
3141: struct order_spec *new;
3142: int onv,nnv,nlen,olen,owlen;
3143: struct weight_or_block *owb,*nwb;
3144:
3145: *newp = new = (struct order_spec *)MALLOC(sizeof(struct order_spec));
1.6 noro 3146: bcopy((char *)old,(char *)new,sizeof(struct order_spec));
1.1 noro 3147: switch ( old->id ) {
3148: case 0:
3149: switch ( old->ord.simple ) {
3150: case 0:
1.6 noro 3151: break;
1.1 noro 3152: case 1:
3153: l = (struct order_pair *)
3154: MALLOC_ATOMIC(2*sizeof(struct order_pair));
3155: l[0].length = n; l[0].order = 1;
3156: l[1].length = 1; l[1].order = 2;
3157: new->id = 1;
3158: new->ord.block.order_pair = l;
3159: new->ord.block.length = 2; new->nv = n+1;
3160: break;
3161: case 2:
1.6 noro 3162: new->ord.simple = 1; break;
1.1 noro 3163: case 3: case 4: case 5:
1.6 noro 3164: new->ord.simple = old->ord.simple+3;
1.1 noro 3165: dp_nelim = n-1; break;
3166: case 6: case 7: case 8: case 9:
1.6 noro 3167: break;
1.1 noro 3168: default:
3169: error("homogenize_order : invalid input");
3170: }
3171: break;
3172: case 1: case 257:
3173: length = old->ord.block.length;
3174: l = (struct order_pair *)
3175: MALLOC_ATOMIC((length+1)*sizeof(struct order_pair));
3176: bcopy((char *)old->ord.block.order_pair,(char *)l,length*sizeof(struct order_pair));
3177: l[length].order = 2; l[length].length = 1;
1.6 noro 3178: new->nv = n+1;
1.1 noro 3179: new->ord.block.order_pair = l;
3180: new->ord.block.length = length+1;
3181: break;
3182: case 2: case 258:
3183: nv = old->nv; row = old->ord.matrix.row;
3184: oldm = old->ord.matrix.matrix; newm = almat(row+1,nv+1);
3185: for ( i = 0; i <= nv; i++ )
3186: newm[0][i] = 1;
3187: for ( i = 0; i < row; i++ ) {
3188: for ( j = 0; j < nv; j++ )
3189: newm[i+1][j] = oldm[i][j];
3190: newm[i+1][j] = 0;
3191: }
1.6 noro 3192: new->nv = nv+1;
1.1 noro 3193: new->ord.matrix.row = row+1; new->ord.matrix.matrix = newm;
3194: break;
3195: case 3: case 259:
3196: onv = old->nv;
3197: nnv = onv+1;
3198: olen = old->ord.composite.length;
3199: nlen = olen+1;
3200: owb = old->ord.composite.w_or_b;
3201: nwb = (struct weight_or_block *)
3202: MALLOC(nlen*sizeof(struct weight_or_block));
3203: for ( i = 0; i < olen; i++ ) {
3204: nwb[i].type = owb[i].type;
3205: switch ( owb[i].type ) {
3206: case IS_DENSE_WEIGHT:
3207: owlen = owb[i].length;
3208: nwb[i].length = owlen+1;
3209: nwb[i].body.dense_weight = (int *)MALLOC((owlen+1)*sizeof(int));
3210: for ( j = 0; j < owlen; j++ )
3211: nwb[i].body.dense_weight[j] = owb[i].body.dense_weight[j];
3212: nwb[i].body.dense_weight[owlen] = 0;
3213: break;
3214: case IS_SPARSE_WEIGHT:
3215: nwb[i].length = owb[i].length;
3216: nwb[i].body.sparse_weight = owb[i].body.sparse_weight;
3217: break;
3218: case IS_BLOCK:
3219: nwb[i].length = owb[i].length;
3220: nwb[i].body.block = owb[i].body.block;
3221: break;
3222: }
3223: }
3224: nwb[i].type = IS_SPARSE_WEIGHT;
3225: nwb[i].body.sparse_weight =
3226: (struct sparse_weight *)MALLOC(sizeof(struct sparse_weight));
3227: nwb[i].body.sparse_weight[0].pos = onv;
3228: nwb[i].body.sparse_weight[0].value = 1;
3229: new->nv = nnv;
3230: new->ord.composite.length = nlen;
3231: new->ord.composite.w_or_b = nwb;
3232: print_composite_order_spec(new);
3233: break;
3234: case 256: /* simple module order */
3235: switch ( old->ord.simple ) {
3236: case 0:
1.6 noro 3237: break;
1.1 noro 3238: case 1:
3239: l = (struct order_pair *)
3240: MALLOC_ATOMIC(2*sizeof(struct order_pair));
3241: l[0].length = n; l[0].order = old->ord.simple;
3242: l[1].length = 1; l[1].order = 2;
3243: new->id = 257;
3244: new->ord.block.order_pair = l;
3245: new->ord.block.length = 2; new->nv = n+1;
3246: break;
3247: case 2:
1.6 noro 3248: new->ord.simple = 1; break;
1.1 noro 3249: default:
3250: error("homogenize_order : invalid input");
3251: }
3252: break;
3253: default:
3254: error("homogenize_order : invalid input");
3255: }
3256: }
3257:
3258: int comp_nm(Q *a,Q *b)
3259: {
3260: Z z,nma,nmb;
3261:
3262: nmq(*a,&z); absz(z,&nma);
3263: nmq(*b,&z); absz(z,&nmb);
3264: return cmpz(nma,nmb);
3265: }
3266:
3267: void sortbynm(Q *w,int n)
3268: {
3269: qsort(w,n,sizeof(Q),(int (*)(const void *,const void *))comp_nm);
3270: }
3271:
3272:
3273: /*
3274: * simple operations
3275: *
3276: */
3277:
3278: int dp_redble(DP p1,DP p2)
3279: {
3280: int i,n;
3281: DL d1,d2;
3282:
3283: d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
3284: if ( d1->td < d2->td )
3285: return 0;
3286: else {
3287: for ( i = 0, n = p1->nv; i < n; i++ )
3288: if ( d1->d[i] < d2->d[i] )
3289: return 0;
3290: return 1;
3291: }
3292: }
3293:
3294: int dpm_redble(DPM p1,DPM p2)
3295: {
3296: int i,n;
3297: DL d1,d2;
3298:
3299: if ( BDY(p1)->pos != BDY(p2)->pos ) return 0;
3300: d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
3301: if ( d1->td < d2->td )
3302: return 0;
3303: else {
3304: for ( i = 0, n = p1->nv; i < n; i++ )
3305: if ( d1->d[i] < d2->d[i] )
3306: return 0;
3307: return 1;
3308: }
3309: }
3310:
3311:
3312: void dp_subd(DP p1,DP p2,DP *rp)
3313: {
3314: int i,n;
3315: DL d1,d2,d;
3316: MP m;
3317: DP s;
3318:
3319: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
3320: NEWDL(d,n); d->td = d1->td - d2->td;
3321: for ( i = 0; i < n; i++ )
3322: d->d[i] = d1->d[i]-d2->d[i];
3323: NEWMP(m); m->dl = d; m->c = (Obj)ONE; NEXT(m) = 0;
3324: MKDP(n,m,s); s->sugar = d->td;
3325: *rp = s;
3326: }
3327:
3328: void dltod(DL d,int n,DP *rp)
3329: {
3330: MP m;
3331: DP s;
3332:
3333: NEWMP(m); m->dl = d; m->c = (Obj)ONE; NEXT(m) = 0;
3334: MKDP(n,m,s); s->sugar = d->td;
3335: *rp = s;
3336: }
3337:
3338: void dp_hm(DP p,DP *rp)
3339: {
3340: MP m,mr;
3341:
3342: if ( !p )
3343: *rp = 0;
3344: else {
3345: m = BDY(p);
3346: NEWMP(mr); mr->dl = m->dl; mr->c = m->c; NEXT(mr) = 0;
3347: MKDP(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */
3348: }
3349: }
3350:
3351: void dp_ht(DP p,DP *rp)
3352: {
3353: MP m,mr;
3354:
3355: if ( !p )
3356: *rp = 0;
3357: else {
3358: m = BDY(p);
3359: NEWMP(mr); mr->dl = m->dl; mr->c = (Obj)ONE; NEXT(mr) = 0;
3360: MKDP(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */
3361: }
3362: }
3363:
3364: void dpm_hm(DPM p,DPM *rp)
3365: {
3366: DMM m,mr;
3367:
3368: if ( !p )
3369: *rp = 0;
3370: else {
3371: m = BDY(p);
3372: NEWDMM(mr); mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos; NEXT(mr) = 0;
3373: MKDPM(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */
3374: }
3375: }
3376:
3377: void dpm_ht(DPM p,DPM *rp)
3378: {
3379: DMM m,mr;
3380:
3381: if ( !p )
3382: *rp = 0;
3383: else {
3384: m = BDY(p);
3385: NEWDMM(mr); mr->dl = m->dl; mr->pos = m->pos; mr->c = (Obj)ONE; NEXT(mr) = 0;
3386: MKDPM(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */
3387: }
3388: }
3389:
3390:
3391: void dp_rest(DP p,DP *rp)
3392: {
3393: MP m;
3394:
3395: m = BDY(p);
3396: if ( !NEXT(m) )
3397: *rp = 0;
3398: else {
3399: MKDP(p->nv,NEXT(m),*rp);
3400: if ( *rp )
3401: (*rp)->sugar = p->sugar;
3402: }
3403: }
3404:
3405: void dpm_rest(DPM p,DPM *rp)
3406: {
3407: DMM m;
3408:
3409: m = BDY(p);
3410: if ( !NEXT(m) )
3411: *rp = 0;
3412: else {
3413: MKDPM(p->nv,NEXT(m),*rp);
3414: if ( *rp )
3415: (*rp)->sugar = p->sugar;
3416: }
3417: }
3418:
1.3 noro 3419: int dpm_getdeg(DPM p,int *r)
3420: {
3421: int max,n,i,rank;
3422: DMM m;
3423: int *d;
3424:
3425: if ( !p ) return 0;
3426: n = p->nv;
3427: max = 0;
3428: rank = 0;
3429: for ( m = BDY(p); m; m = NEXT(m) ) {
3430: d = m->dl->d;
3431: for ( i = 0; i < n; i++ )
3432: if ( d[i] > max ) max = d[i];
3433: rank = MAX(rank,m->pos);
3434: }
3435: *r = rank;
3436: return max;
3437: }
3438:
1.1 noro 3439: DL lcm_of_DL(int nv,DL dl1,DL dl2,DL dl)
3440: {
3441: register int i, *d1, *d2, *d, td;
3442:
3443: if ( !dl ) NEWDL(dl,nv);
3444: d = dl->d, d1 = dl1->d, d2 = dl2->d;
3445: for ( td = 0, i = 0; i < nv; d1++, d2++, d++, i++ ) {
3446: *d = *d1 > *d2 ? *d1 : *d2;
3447: td += MUL_WEIGHT(*d,i);
3448: }
3449: dl->td = td;
3450: return dl;
3451: }
3452:
3453: int dl_equal(int nv,DL dl1,DL dl2)
3454: {
3455: register int *d1, *d2, n;
3456:
3457: if ( dl1->td != dl2->td ) return 0;
3458: for ( d1 = dl1->d, d2 = dl2->d, n = nv; --n >= 0; d1++, d2++ )
3459: if ( *d1 != *d2 ) return 0;
3460: return 1;
3461: }
3462:
3463: int dp_nt(DP p)
3464: {
3465: int i;
3466: MP m;
3467:
3468: if ( !p )
3469: return 0;
3470: else {
3471: for ( i = 0, m = BDY(p); m; m = NEXT(m), i++ );
3472: return i;
3473: }
3474: }
3475:
3476: int dp_homogeneous(DP p)
3477: {
3478: MP m;
3479: int d;
3480:
3481: if ( !p )
3482: return 1;
3483: else {
3484: m = BDY(p);
3485: d = m->dl->td;
3486: m = NEXT(m);
3487: for ( ; m; m = NEXT(m) ) {
3488: if ( m->dl->td != d )
3489: return 0;
3490: }
3491: return 1;
3492: }
3493: }
3494:
3495: void _print_mp(int nv,MP m)
3496: {
3497: int i;
3498:
3499: if ( !m )
3500: return;
3501: for ( ; m; m = NEXT(m) ) {
1.3 noro 3502: fprintf(stderr,"%ld<",ITOS(C(m)));
1.1 noro 3503: for ( i = 0; i < nv; i++ ) {
3504: fprintf(stderr,"%d",m->dl->d[i]);
3505: if ( i != nv-1 )
3506: fprintf(stderr," ");
3507: }
1.3 noro 3508: fprintf(stderr,">");
1.1 noro 3509: }
3510: fprintf(stderr,"\n");
3511: }
3512:
3513: static int cmp_mp_nvar;
3514:
3515: int comp_mp(MP *a,MP *b)
3516: {
3517: return -(*cmpdl)(cmp_mp_nvar,(*a)->dl,(*b)->dl);
3518: }
3519:
3520: void dp_sort(DP p,DP *rp)
3521: {
3522: MP t,mp,mp0;
3523: int i,n;
3524: DP r;
3525: MP *w;
3526:
3527: if ( !p ) {
3528: *rp = 0;
3529: return;
3530: }
3531: for ( t = BDY(p), n = 0; t; t = NEXT(t), n++ );
3532: w = (MP *)ALLOCA(n*sizeof(MP));
3533: for ( t = BDY(p), i = 0; i < n; t = NEXT(t), i++ )
3534: w[i] = t;
3535: cmp_mp_nvar = NV(p);
3536: qsort(w,n,sizeof(MP),(int (*)(const void *,const void *))comp_mp);
3537: mp0 = 0;
3538: for ( i = n-1; i >= 0; i-- ) {
3539: NEWMP(mp); mp->dl = w[i]->dl; C(mp) = C(w[i]);
3540: NEXT(mp) = mp0; mp0 = mp;
3541: }
3542: MKDP(p->nv,mp0,r);
3543: r->sugar = p->sugar;
3544: *rp = r;
3545: }
3546:
3547: DP extract_initial_term_from_dp(DP p,int *weight,int n);
3548: LIST extract_initial_term(LIST f,int *weight,int n);
3549:
3550: DP extract_initial_term_from_dp(DP p,int *weight,int n)
3551: {
3552: int w,t,i,top;
3553: MP m,r0,r;
3554: DP dp;
3555:
3556: if ( !p ) return 0;
3557: top = 1;
3558: for ( m = BDY(p); m; m = NEXT(m) ) {
3559: for ( i = 0, t = 0; i < n; i++ )
3560: t += weight[i]*m->dl->d[i];
3561: if ( top || t > w ) {
3562: r0 = 0;
3563: w = t;
3564: top = 0;
3565: }
3566: if ( t == w ) {
3567: NEXTMP(r0,r);
3568: r->dl = m->dl;
3569: r->c = m->c;
3570: }
3571: }
3572: NEXT(r) = 0;
3573: MKDP(p->nv,r0,dp);
3574: return dp;
3575: }
3576:
3577: LIST extract_initial_term(LIST f,int *weight,int n)
3578: {
3579: NODE nd,r0,r;
3580: Obj p;
3581: LIST l;
3582:
3583: nd = BDY(f);
3584: for ( r0 = 0; nd; nd = NEXT(nd) ) {
3585: NEXTNODE(r0,r);
3586: p = (Obj)BDY(nd);
3587: BDY(r) = (pointer)extract_initial_term_from_dp((DP)p,weight,n);
3588: }
3589: if ( r0 ) NEXT(r) = 0;
3590: MKLIST(l,r0);
3591: return l;
3592: }
3593:
3594: LIST dp_initial_term(LIST f,struct order_spec *ord)
3595: {
3596: int n,l,i;
3597: struct weight_or_block *worb;
3598: int *weight;
3599:
3600: switch ( ord->id ) {
3601: case 2: /* matrix order */
3602: /* extract the first row */
3603: n = ord->nv;
3604: weight = ord->ord.matrix.matrix[0];
3605: return extract_initial_term(f,weight,n);
3606: case 3: /* composite order */
3607: /* the first w_or_b */
3608: worb = ord->ord.composite.w_or_b;
3609: switch ( worb->type ) {
3610: case IS_DENSE_WEIGHT:
3611: n = worb->length;
3612: weight = worb->body.dense_weight;
3613: return extract_initial_term(f,weight,n);
3614: case IS_SPARSE_WEIGHT:
3615: n = ord->nv;
3616: weight = (int *)ALLOCA(n*sizeof(int));
3617: for ( i = 0; i < n; i++ ) weight[i] = 0;
3618: l = worb->length;
3619: for ( i = 0; i < l; i++ )
3620: weight[worb->body.sparse_weight[i].pos]
3621: = worb->body.sparse_weight[i].value;
3622: return extract_initial_term(f,weight,n);
3623: default:
3624: error("dp_initial_term : unsupported order");
3625: }
3626: default:
3627: error("dp_initial_term : unsupported order");
3628: }
1.3 noro 3629: return 0;
1.1 noro 3630: }
3631:
3632: int highest_order_dp(DP p,int *weight,int n);
3633: LIST highest_order(LIST f,int *weight,int n);
3634:
3635: int highest_order_dp(DP p,int *weight,int n)
3636: {
3637: int w,t,i,top;
3638: MP m;
3639:
3640: if ( !p ) return -1;
3641: top = 1;
3642: for ( m = BDY(p); m; m = NEXT(m) ) {
3643: for ( i = 0, t = 0; i < n; i++ )
3644: t += weight[i]*m->dl->d[i];
3645: if ( top || t > w ) {
3646: w = t;
3647: top = 0;
3648: }
3649: }
3650: return w;
3651: }
3652:
3653: LIST highest_order(LIST f,int *weight,int n)
3654: {
3655: int h;
3656: NODE nd,r0,r;
3657: Obj p;
3658: LIST l;
3659: Z q;
3660:
3661: nd = BDY(f);
3662: for ( r0 = 0; nd; nd = NEXT(nd) ) {
3663: NEXTNODE(r0,r);
3664: p = (Obj)BDY(nd);
3665: h = highest_order_dp((DP)p,weight,n);
1.2 noro 3666: STOZ(h,q);
1.1 noro 3667: BDY(r) = (pointer)q;
3668: }
3669: if ( r0 ) NEXT(r) = 0;
3670: MKLIST(l,r0);
3671: return l;
3672: }
3673:
3674: LIST dp_order(LIST f,struct order_spec *ord)
3675: {
3676: int n,l,i;
3677: struct weight_or_block *worb;
3678: int *weight;
3679:
3680: switch ( ord->id ) {
3681: case 2: /* matrix order */
3682: /* extract the first row */
3683: n = ord->nv;
3684: weight = ord->ord.matrix.matrix[0];
3685: return highest_order(f,weight,n);
3686: case 3: /* composite order */
3687: /* the first w_or_b */
3688: worb = ord->ord.composite.w_or_b;
3689: switch ( worb->type ) {
3690: case IS_DENSE_WEIGHT:
3691: n = worb->length;
3692: weight = worb->body.dense_weight;
3693: return highest_order(f,weight,n);
3694: case IS_SPARSE_WEIGHT:
3695: n = ord->nv;
3696: weight = (int *)ALLOCA(n*sizeof(int));
3697: for ( i = 0; i < n; i++ ) weight[i] = 0;
3698: l = worb->length;
3699: for ( i = 0; i < l; i++ )
3700: weight[worb->body.sparse_weight[i].pos]
3701: = worb->body.sparse_weight[i].value;
3702: return highest_order(f,weight,n);
3703: default:
3704: error("dp_initial_term : unsupported order");
3705: }
3706: default:
3707: error("dp_initial_term : unsupported order");
3708: }
1.3 noro 3709: return 0;
1.1 noro 3710: }
3711:
3712: int dpv_ht(DPV p,DP *h)
3713: {
3714: int len,max,maxi,i,t;
3715: DP *e;
3716: MP m,mr;
3717:
3718: len = p->len;
3719: e = p->body;
3720: max = -1;
3721: maxi = -1;
3722: for ( i = 0; i < len; i++ )
3723: if ( e[i] && (t = BDY(e[i])->dl->td) > max ) {
3724: max = t;
3725: maxi = i;
3726: }
3727: if ( max < 0 ) {
3728: *h = 0;
3729: return -1;
3730: } else {
3731: m = BDY(e[maxi]);
3732: NEWMP(mr); mr->dl = m->dl; mr->c = (Obj)ONE; NEXT(mr) = 0;
3733: MKDP(e[maxi]->nv,mr,*h); (*h)->sugar = mr->dl->td; /* XXX */
3734: return maxi;
3735: }
3736: }
3737:
3738: /* return 1 if 0 <_w1 v && v <_w2 0 */
3739:
3740: int in_c12(int n,int *v,int row1,int **w1,int row2, int **w2)
3741: {
3742: int t1,t2;
3743:
3744: t1 = compare_zero(n,v,row1,w1);
3745: t2 = compare_zero(n,v,row2,w2);
3746: if ( t1 > 0 && t2 < 0 ) return 1;
3747: else return 0;
3748: }
3749:
3750: /* 0 < u => 1, 0 > u => -1 */
3751:
3752: int compare_zero(int n,int *u,int row,int **w)
3753: {
3754: int i,j,t;
3755: int *wi;
3756:
3757: for ( i = 0; i < row; i++ ) {
3758: wi = w[i];
3759: for ( j = 0, t = 0; j < n; j++ ) t += u[j]*wi[j];
3760: if ( t > 0 ) return 1;
3761: else if ( t < 0 ) return -1;
3762: }
3763: return 0;
3764: }
3765:
3766: /* functions for generic groebner walk */
3767: /* u=0 means u=-infty */
3768:
3769: int compare_facet_preorder(int n,int *u,int *v,
3770: int row1,int **w1,int row2,int **w2)
3771: {
3772: int i,j,s,t,tu,tv;
3773: int *w2i,*uv;
3774:
3775: if ( !u ) return 1;
3776: uv = W_ALLOC(n);
3777: for ( i = 0; i < row2; i++ ) {
3778: w2i = w2[i];
3779: for ( j = 0, tu = tv = 0; j < n; j++ )
1.3 noro 3780: if ( (s = w2i[j]) != 0 ) {
1.1 noro 3781: tu += s*u[j]; tv += s*v[j];
3782: }
3783: for ( j = 0; j < n; j++ ) uv[j] = u[j]*tv-v[j]*tu;
3784: t = compare_zero(n,uv,row1,w1);
3785: if ( t > 0 ) return 1;
3786: else if ( t < 0 ) return 0;
3787: }
3788: return 1;
3789: }
3790:
3791: Q inner_product_with_small_vector(VECT w,int *v)
3792: {
3793: int n,i;
3794: Z q;
3795: Q s,t,u;
3796:
3797: n = w->len;
3798: s = 0;
3799: for ( i = 0; i < n; i++ ) {
1.2 noro 3800: STOZ(v[i],q); mulq((Q)w->body[i],(Q)q,&t); addq(t,s,&u); s = u;
1.1 noro 3801: }
3802: return s;
3803: }
3804:
3805: Q compute_last_t(NODE g,NODE gh,Q t,VECT w1,VECT w2,NODE *homo,VECT *wp)
3806: {
3807: int n,i;
3808: int *wt;
3809: Q last,d1,d2,dn,nm,s,t1;
3810: VECT wd,wt1,wt2,w;
3811: NODE tg,tgh;
3812: MP f;
3813: int *h;
3814: NODE r0,r;
3815: MP m0,m;
3816: DP d;
3817:
3818: n = w1->len;
3819: wt = W_ALLOC(n);
3820: last = (Q)ONE;
3821: /* t1 = 1-t */
3822: for ( tg = g, tgh = gh; tg; tg = NEXT(tg), tgh = NEXT(tgh ) ) {
3823: f = BDY((DP)BDY(tg));
3824: h = BDY((DP)BDY(tgh))->dl->d;
3825: for ( ; f; f = NEXT(f) ) {
3826: for ( i = 0; i < n; i++ ) wt[i] = h[i]-f->dl->d[i];
3827: for ( i = 0; i < n && !wt[i]; i++ );
3828: if ( i == n ) continue;
3829: d1 = inner_product_with_small_vector(w1,wt);
3830: d2 = inner_product_with_small_vector(w2,wt);
3831: nm = d1; subq(d1,d2,&dn);
3832: /* if d1=d2 then nothing happens */
3833: if ( !dn ) continue;
3834: /* s satisfies ds = 0*/
3835: divq(nm,dn,&s);
3836:
3837: if ( cmpq(s,t) > 0 && cmpq(s,last) < 0 )
3838: last = s;
3839: else if ( !cmpq(s,t) ) {
3840: if ( cmpq(d2,0) < 0 ) {
3841: last = t;
3842: break;
3843: }
3844: }
3845: }
3846: }
3847: nmq(last,(Z *)&nm);
3848: dnq(last,(Z *)&dn);
3849: /* (1-n/d)*w1+n/d*w2 -> w=(d-n)*w1+n*w2 */
3850: subq(dn,nm,&t1); mulvect(CO,(Obj)w1,(Obj)t1,(Obj *)&wt1);
3851: mulvect(CO,(Obj)w2,(Obj)nm,(Obj *)&wt2); addvect(CO,wt1,wt2,&w);
3852:
3853: r0 = 0;
3854: for ( tg = g, tgh = gh; tg; tg = NEXT(tg), tgh = NEXT(tgh ) ) {
3855: f = BDY((DP)BDY(tg));
3856: h = BDY((DP)BDY(tgh))->dl->d;
3857: for ( m0 = 0; f; f = NEXT(f) ) {
3858: for ( i = 0; i < n; i++ ) wt[i] = h[i]-f->dl->d[i];
3859: for ( i = 0; i < n && !wt[i]; i++ );
3860: if ( !inner_product_with_small_vector(w,wt) ) {
3861: NEXTMP(m0,m); m->c = f->c; m->dl = f->dl;
3862: }
3863: }
3864: NEXT(m) = 0;
3865: MKDP(((DP)BDY(tg))->nv,m0,d); d->sugar = ((DP)BDY(tg))->sugar;
3866: NEXTNODE(r0,r); BDY(r) = (pointer)d;
3867: }
3868: NEXT(r) = 0;
3869: *homo = r0;
3870: *wp = w;
3871: return last;
3872: }
3873:
3874: /* return 0 if last_w = infty */
3875:
3876: NODE compute_last_w(NODE g,NODE gh,int n,int **w,
3877: int row1,int **w1,int row2,int **w2)
3878: {
3879: DP d;
3880: MP f,m0,m;
3881: int *wt,*v,*h;
3882: NODE t,s,n0,tn,n1,r0,r;
3883: int i;
3884:
3885: wt = W_ALLOC(n);
3886: n0 = 0;
3887: for ( t = g, s = gh; t; t = NEXT(t), s = NEXT(s) ) {
3888: f = BDY((DP)BDY(t));
3889: h = BDY((DP)BDY(s))->dl->d;
3890: for ( ; f; f = NEXT(f) ) {
3891: for ( i = 0; i < n; i++ ) wt[i] = h[i]-f->dl->d[i];
3892: for ( i = 0; i < n && !wt[i]; i++ );
3893: if ( i == n ) continue;
3894:
3895: if ( in_c12(n,wt,row1,w1,row2,w2) &&
3896: compare_facet_preorder(n,*w,wt,row1,w1,row2,w2) ) {
3897: v = (int *)MALLOC_ATOMIC(n*sizeof(int));
3898: for ( i = 0; i < n; i++ ) v[i] = wt[i];
3899: MKNODE(n1,v,n0); n0 = n1;
3900: }
3901: }
3902: }
3903: if ( !n0 ) return 0;
3904: for ( t = n0; t; t = NEXT(t) ) {
3905: v = (int *)BDY(t);
3906: for ( s = n0; s; s = NEXT(s) )
3907: if ( !compare_facet_preorder(n,v,(int *)BDY(s),row1,w1,row2,w2) )
3908: break;
3909: if ( !s ) {
3910: *w = v;
3911: break;
3912: }
3913: }
3914: if ( !t )
3915: error("compute_last_w : cannot happen");
3916: r0 = 0;
3917: for ( t = g, s = gh; t; t = NEXT(t), s = NEXT(s) ) {
3918: f = BDY((DP)BDY(t));
3919: h = BDY((DP)BDY(s))->dl->d;
3920: for ( m0 = 0; f; f = NEXT(f) ) {
3921: for ( i = 0; i < n; i++ ) wt[i] = h[i]-f->dl->d[i];
3922: for ( i = 0; i < n && !wt[i]; i++ );
3923: if ( i == n ||
3924: (compare_facet_preorder(n,wt,*w,row1,w1,row2,w2)
3925: && compare_facet_preorder(n,*w,wt,row1,w1,row2,w2)) ) {
3926: NEXTMP(m0,m); m->c = f->c; m->dl = f->dl;
3927: }
3928: }
3929: NEXT(m) = 0;
3930: MKDP(((DP)BDY(t))->nv,m0,d); d->sugar = ((DP)BDY(t))->sugar;
3931: NEXTNODE(r0,r); BDY(r) = (pointer)d;
3932: }
3933: NEXT(r) = 0;
3934: return r0;
3935: }
3936:
3937: /* compute a sufficient set of d(f)=u-v */
3938:
3939: NODE compute_essential_df(DP *g,DP *gh,int ng)
3940: {
3941: int nv,i,j,k,t,lj;
3942: NODE r,r1,ri,rt,r0;
3943: MP m;
3944: MP *mj;
3945: DL di,hj,dl,dlt;
3946: int *d,*dt;
3947: LIST l;
3948: Z q;
3949:
3950: nv = g[0]->nv;
3951: r = 0;
3952: for ( j = 0; j < ng; j++ ) {
3953: for ( m = BDY(g[j]), lj = 0; m; m = NEXT(m), lj++ );
3954: mj = (MP *)ALLOCA(lj*sizeof(MP));
3955: for ( m = BDY(g[j]), k = 0; m; m = NEXT(m), k++ )
3956: mj[k] = m;
3957: for ( i = 0; i < lj; i++ ) {
3958: for ( di = mj[i]->dl, k = i+1; k < lj; k++ )
3959: if ( _dl_redble(di,mj[k]->dl,nv) ) break;
3960: if ( k < lj ) mj[i] = 0;
3961: }
3962: hj = BDY(gh[j])->dl;
3963: _NEWDL(dl,nv); d = dl->d;
3964: r0 = r;
3965: for ( i = 0; i < lj; i++ ) {
3966: if ( mj[i] && !dl_equal(nv,di=mj[i]->dl,hj) ) {
3967: for ( k = 0, t = 0; k < nv; k++ ) {
3968: d[k] = hj->d[k]-di->d[k];
3969: t += d[k];
3970: }
3971: dl->td = t;
3972: #if 1
3973: for ( rt = r0; rt; rt = NEXT(rt) ) {
3974: dlt = (DL)BDY(rt);
3975: if ( dlt->td != dl->td ) continue;
3976: for ( dt = dlt->d, k = 0; k < nv; k++ )
3977: if ( d[k] != dt[k] ) break;
3978: if ( k == nv ) break;
3979: }
3980: #else
3981: rt = 0;
3982: #endif
3983: if ( !rt ) {
3984: MKNODE(r1,dl,r); r = r1;
3985: _NEWDL(dl,nv); d = dl->d;
3986: }
3987: }
3988: }
3989: }
3990: for ( rt = r; rt; rt = NEXT(rt) ) {
3991: dl = (DL)BDY(rt); d = dl->d;
3992: ri = 0;
3993: for ( k = nv-1; k >= 0; k-- ) {
1.2 noro 3994: STOZ(d[k],q);
1.1 noro 3995: MKNODE(r1,q,ri); ri = r1;
3996: }
3997: MKNODE(r1,0,ri); MKLIST(l,r1);
3998: BDY(rt) = (pointer)l;
3999: }
4000: return r;
4001: }
4002:
4003: int comp_bits_divisible(int *a,int *b,int n)
4004: {
4005: int bpi,i,wi,bi;
4006:
4007: bpi = (sizeof(int)/sizeof(char))*8;
4008: for ( i = 0; i < n; i++ ) {
4009: wi = i/bpi; bi = i%bpi;
4010: if ( !(a[wi]&(1<<bi)) && (b[wi]&(1<<bi)) ) return 0;
4011: }
4012: return 1;
4013: }
4014:
4015: int comp_bits_lex(int *a,int *b,int n)
4016: {
4017: int bpi,i,wi,ba,bb,bi;
4018:
4019: bpi = (sizeof(int)/sizeof(char))*8;
4020: for ( i = 0; i < n; i++ ) {
4021: wi = i/bpi; bi = i%bpi;
4022: ba = (a[wi]&(1<<bi))?1:0;
4023: bb = (b[wi]&(1<<bi))?1:0;
4024: if ( ba > bb ) return 1;
4025: else if ( ba < bb ) return -1;
4026: }
4027: return 0;
4028: }
4029:
4030: NODE mono_raddec(NODE ideal)
4031: {
4032: DP p;
4033: int nv,w,i,bpi,di,c,len;
4034: int *d,*s,*u,*new;
4035: NODE t,t1,v,r,rem,prev;
4036:
4037: if( !ideal ) return 0;
4038: p = (DP)BDY(ideal);
4039: nv = NV(p);
4040: bpi = (sizeof(int)/sizeof(char))*8;
4041: w = (nv+(bpi-1))/bpi;
4042: d = p->body->dl->d;
4043: if ( !NEXT(ideal) ) {
4044: for ( t = 0, i = nv-1; i >= 0; i-- ) {
4045: if ( d[i] ) {
4046: s = (int *)CALLOC(w,sizeof(int));
4047: s[i/bpi] |= 1<<(i%bpi);
4048: MKNODE(t1,s,t);
4049: t = t1;
4050: }
4051: }
4052: return t;
4053: }
4054: rem = mono_raddec(NEXT(ideal));
4055: r = 0;
4056: len = w*sizeof(int);
4057: u = (int *)CALLOC(w,sizeof(int));
4058: for ( i = nv-1; i >= 0; i-- ) {
4059: if ( d[i] ) {
4060: for ( t = rem; t; t = NEXT(t) ) {
4061: bcopy((char *)BDY(t),(char *)u,len);
4062: u[i/bpi] |= 1<<(i%bpi);
4063: for ( v = r; v; v = NEXT(v) ) {
4064: if ( comp_bits_divisible(u,(int *)BDY(v),nv) ) break;
4065: }
4066: if ( v ) continue;
4067: for ( v = r, prev = 0; v; v = NEXT(v) ) {
4068: if ( comp_bits_divisible((int *)BDY(v),u,nv) ) {
4069: if ( prev ) NEXT(prev) = NEXT(v);
4070: else r = NEXT(r);
4071: } else prev =v;
4072: }
4073: for ( v = r, prev = 0; v; prev = v, v = NEXT(v) ) {
4074: if ( comp_bits_lex(u,(int *)BDY(v),nv) < 0 ) break;
4075: }
4076: new = (int *)CALLOC(w,sizeof(int));
4077: bcopy((char *)u,(char *)new,len);
4078: MKNODE(t1,new,v);
4079: if ( prev ) NEXT(prev) = t1;
4080: else r = t1;
4081: }
4082: }
4083: }
4084: return r;
4085: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to dp-supp.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2018 / builtin