Annotation of OpenXM_contrib2/asir2018/builtin/dp-supp.c, Revision 1.4
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.4 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2018/builtin/dp-supp.c,v 1.3 2019/08/21 00:37:47 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:
907:
908: /*
909: * m-reduction by a marked poly
910: * do content reduction over Z or Q(x,...)
911: * do nothing over finite fields
912: *
913: */
914:
915:
916: void dp_red_marked(DP p0,DP p1,DP p2,DP hp2,DP *head,DP *rest,P *dnp,DP *multp)
917: {
918: int i,n;
919: DL d1,d2,d;
920: MP m;
921: DP t,s,r,h;
922: Z c,c1,c2,gn;
923: P g,a;
924: P p[2];
925:
926: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(hp2)->dl;
927: NEWDL(d,n); d->td = d1->td - d2->td;
928: for ( i = 0; i < n; i++ )
929: d->d[i] = d1->d[i]-d2->d[i];
930: c1 = (Z)BDY(p1)->c; c2 = (Z)BDY(hp2)->c;
931: if ( dp_fcoeffs == N_GFS ) {
932: p[0] = (P)c1; p[1] = (P)c2;
933: gcdsf(CO,p,2,&g);
934: divsp(CO,(P)c1,g,&a); c1 = (Z)a; divsp(CO,(P)c2,g,&a); c2 = (Z)a;
935: } else if ( dp_fcoeffs ) {
936: /* do nothing */
937: } else if ( INT(c1) && INT(c2) ) {
938: gcdz(c1,c2,&gn);
939: if ( !UNIQ(gn) ) {
1.2 noro 940: divsz(c1,gn,&c); c1 = c;
941: divsz(c2,gn,&c); c2 = c;
1.1 noro 942: }
943: } else {
944: ezgcdpz(CO,(P)c1,(P)c2,&g);
945: divsp(CO,(P)c1,g,&a); c1 = (Z)a; divsp(CO,(P)c2,g,&a); c2 = (Z)a;
946: }
947: NEWMP(m); m->dl = d; m->c = (Obj)c1; NEXT(m) = 0; MKDP(n,m,s); s->sugar = d->td;
948: *multp = s;
949: muld(CO,s,p2,&t); muldc(CO,p1,(Obj)c2,&s); subd(CO,s,t,&r);
950: muldc(CO,p0,(Obj)c2,&h);
951: *head = h; *rest = r; *dnp = (P)c2;
952: }
953:
954: void dp_red_marked_mod(DP p0,DP p1,DP p2,DP hp2,int mod,DP *head,DP *rest,P *dnp,DP *multp)
955: {
956: int i,n;
957: DL d1,d2,d;
958: MP m;
959: DP t,s,r,h;
960: P c1,c2,g,u;
961:
962: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(hp2)->dl;
963: NEWDL(d,n); d->td = d1->td - d2->td;
964: for ( i = 0; i < n; i++ )
965: d->d[i] = d1->d[i]-d2->d[i];
966: c1 = (P)BDY(p1)->c; c2 = (P)BDY(hp2)->c;
967: gcdprsmp(CO,mod,c1,c2,&g);
968: divsmp(CO,mod,c1,g,&u); c1 = u; divsmp(CO,mod,c2,g,&u); c2 = u;
969: if ( NUM(c2) ) {
970: divsmp(CO,mod,c1,c2,&u); c1 = u; c2 = (P)ONEM;
971: }
972: NEWMP(m); m->dl = d; m->c = (Obj)c1; NEXT(m) = 0;
973: MKDP(n,m,s); s->sugar = d->td;
974: *multp = s;
975: mulmd(CO,mod,s,p2,&t);
976: if ( NUM(c2) ) {
977: submd(CO,mod,p1,t,&r); h = p0;
978: } else {
979: mulmdc(CO,mod,p1,c2,&s); submd(CO,mod,s,t,&r); mulmdc(CO,mod,p0,c2,&h);
980: }
981: *head = h; *rest = r; *dnp = c2;
982: }
983:
984: /* m-reduction over a field */
985:
986: void dp_red_f(DP p1,DP p2,DP *rest)
987: {
988: int i,n;
989: DL d1,d2,d;
990: MP m;
991: DP t,s;
992: Obj a,b;
993:
994: n = p1->nv;
995: d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
996:
997: NEWDL(d,n); d->td = d1->td - d2->td;
998: for ( i = 0; i < n; i++ )
999: d->d[i] = d1->d[i]-d2->d[i];
1000:
1001: NEWMP(m); m->dl = d;
1002: divr(CO,(Obj)BDY(p1)->c,(Obj)BDY(p2)->c,&a); chsgnr(a,&b);
1003: C(m) = (Obj)b;
1004: NEXT(m) = 0; MKDP(n,m,s); s->sugar = d->td;
1005:
1006: muld(CO,s,p2,&t); addd(CO,p1,t,rest);
1007: }
1008:
1009: void dpm_red_f(DPM p1,DPM p2,DPM *rest)
1010: {
1011: int i,n;
1012: DL d1,d2,d;
1013: MP m;
1014: DPM t;
1015: DP s;
1016: Obj a,b;
1017:
1018: n = p1->nv;
1019: d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
1020:
1021: NEWDL(d,n); d->td = d1->td - d2->td;
1022: for ( i = 0; i < n; i++ )
1023: d->d[i] = d1->d[i]-d2->d[i];
1024:
1025: NEWMP(m); m->dl = d;
1026: arf_div(CO,(Obj)BDY(p1)->c,(Obj)BDY(p2)->c,&a); arf_chsgn(a,&b);
1027: C(m) = b;
1028: NEXT(m) = 0; MKDP(n,m,s); s->sugar = d->td;
1029:
1030: mulobjdpm(CO,(Obj)s,p2,&t); adddpm(CO,p1,t,rest);
1031: }
1032:
1033:
1034: void dp_red_mod(DP p0,DP p1,DP p2,int mod,DP *head,DP *rest,P *dnp)
1035: {
1036: int i,n;
1037: DL d1,d2,d;
1038: MP m;
1039: DP t,s,r,h;
1040: P c1,c2,g,u;
1041:
1042: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
1043: NEWDL(d,n); d->td = d1->td - d2->td;
1044: for ( i = 0; i < n; i++ )
1045: d->d[i] = d1->d[i]-d2->d[i];
1046: c1 = (P)BDY(p1)->c; c2 = (P)BDY(p2)->c;
1047: gcdprsmp(CO,mod,c1,c2,&g);
1048: divsmp(CO,mod,c1,g,&u); c1 = u; divsmp(CO,mod,c2,g,&u); c2 = u;
1049: if ( NUM(c2) ) {
1050: divsmp(CO,mod,c1,c2,&u); c1 = u; c2 = (P)ONEM;
1051: }
1052: NEWMP(m); m->dl = d; chsgnmp(mod,(P)c1,(P *)&m->c); NEXT(m) = 0;
1053: MKDP(n,m,s); s->sugar = d->td; mulmd(CO,mod,s,p2,&t);
1054: if ( NUM(c2) ) {
1055: addmd(CO,mod,p1,t,&r); h = p0;
1056: } else {
1057: mulmdc(CO,mod,p1,c2,&s); addmd(CO,mod,s,t,&r); mulmdc(CO,mod,p0,c2,&h);
1058: }
1059: *head = h; *rest = r; *dnp = c2;
1060: }
1061:
1062: struct oEGT eg_red_mod;
1063:
1064: void _dp_red_mod_destructive(DP p1,DP p2,int mod,DP *rp)
1065: {
1066: int i,n;
1067: DL d1,d2,d;
1068: MP m;
1069: DP t,s;
1070: int c,c1,c2;
1071: extern int do_weyl;
1072:
1073: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
1074: _NEWDL(d,n); d->td = d1->td - d2->td;
1075: for ( i = 0; i < n; i++ )
1076: d->d[i] = d1->d[i]-d2->d[i];
1077: c = invm(ITOS(BDY(p2)->c),mod);
1078: c2 = ITOS(BDY(p1)->c);
1079: DMAR(c,c2,0,mod,c1);
1080: _NEWMP(m); m->dl = d; m->c = (Obj)STOI(mod-c1); NEXT(m) = 0;
1081: #if 0
1082: _MKDP(n,m,s); s->sugar = d->td;
1083: _mulmd_dup(mod,s,p2,&t); _free_dp(s);
1084: #else
1085: if ( do_weyl ) {
1086: _MKDP(n,m,s); s->sugar = d->td;
1087: _mulmd_dup(mod,s,p2,&t); _free_dp(s);
1088: } else {
1089: _mulmdm_dup(mod,p2,m,&t); _FREEMP(m);
1090: }
1091: #endif
1092: /* get_eg(&t0); */
1093: _addmd_destructive(mod,p1,t,rp);
1094: /* get_eg(&t1); add_eg(&eg_red_mod,&t0,&t1); */
1095: }
1096:
1097: /*
1098: * normal form computation
1099: *
1100: */
1101:
1102: void dp_true_nf(NODE b,DP g,DP *ps,int full,DP *rp,P *dnp)
1103: {
1104: DP u,p,d,s,t,dmy;
1105: NODE l;
1106: MP m,mr;
1107: int i,n;
1108: int *wb;
1109: int sugar,psugar;
1110: P dn,tdn,tdn1;
1111:
1112: dn = (P)ONE;
1113: if ( !g ) {
1114: *rp = 0; *dnp = dn; return;
1115: }
1116: for ( n = 0, l = b; l; l = NEXT(l), n++ );
1117: wb = (int *)ALLOCA(n*sizeof(int));
1118: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1119: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 1120: sugar = g->sugar;
1121: for ( d = 0; g; ) {
1122: for ( u = 0, i = 0; i < n; i++ ) {
1123: if ( dp_redble(g,p = ps[wb[i]]) ) {
1124: dp_red(d,g,p,&t,&u,&tdn,&dmy);
1125: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1126: sugar = MAX(sugar,psugar);
1127: if ( !u ) {
1128: if ( d )
1129: d->sugar = sugar;
1130: *rp = d; *dnp = dn; return;
1131: } else {
1132: d = t;
1133: mulp(CO,dn,tdn,&tdn1); dn = tdn1;
1134: }
1135: break;
1136: }
1137: }
1138: if ( u )
1139: g = u;
1140: else if ( !full ) {
1141: if ( g ) {
1142: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
1143: }
1144: *rp = g; *dnp = dn; return;
1145: } else {
1146: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1147: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1148: addd(CO,d,t,&s); d = s;
1149: dp_rest(g,&t); g = t;
1150: }
1151: }
1152: if ( d )
1153: d->sugar = sugar;
1154: *rp = d; *dnp = dn;
1155: }
1156:
1157: void dp_removecont2(DP p1,DP p2,DP *r1p,DP *r2p,Z *contp)
1158: {
1159: struct oVECT v;
1160: int i,n1,n2,n;
1161: MP m,m0,t;
1162: Z *w;
1163: Z h;
1164:
1165: if ( p1 ) {
1166: for ( i = 0, m = BDY(p1); m; m = NEXT(m), i++ );
1167: n1 = i;
1168: } else
1169: n1 = 0;
1170: if ( p2 ) {
1171: for ( i = 0, m = BDY(p2); m; m = NEXT(m), i++ );
1172: n2 = i;
1173: } else
1174: n2 = 0;
1175: n = n1+n2;
1176: if ( !n ) {
1177: *r1p = 0; *r2p = 0; *contp = ONE; return;
1178: }
1179: w = (Z *)ALLOCA(n*sizeof(Q));
1180: v.len = n;
1181: v.body = (pointer *)w;
1182: i = 0;
1183: if ( p1 )
1184: for ( m = BDY(p1); i < n1; m = NEXT(m), i++ ) w[i] = (Z)m->c;
1185: if ( p2 )
1186: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = (Z)m->c;
1.2 noro 1187: h = w[0]; removecont_array((P *)w,n,1); divsz(h,w[0],contp);
1.1 noro 1188: i = 0;
1189: if ( p1 ) {
1190: for ( m0 = 0, t = BDY(p1); i < n1; i++, t = NEXT(t) ) {
1191: NEXTMP(m0,m); m->c = (Obj)w[i]; m->dl = t->dl;
1192: }
1193: NEXT(m) = 0;
1194: MKDP(p1->nv,m0,*r1p); (*r1p)->sugar = p1->sugar;
1195: } else
1196: *r1p = 0;
1197: if ( p2 ) {
1198: for ( m0 = 0, t = BDY(p2); i < n; i++, t = NEXT(t) ) {
1199: NEXTMP(m0,m); m->c = (Obj)w[i]; m->dl = t->dl;
1200: }
1201: NEXT(m) = 0;
1202: MKDP(p2->nv,m0,*r2p); (*r2p)->sugar = p2->sugar;
1203: } else
1204: *r2p = 0;
1205: }
1206:
1207: /* true nf by a marked GB */
1208:
1209: void dp_true_nf_marked(NODE b,DP g,DP *ps,DP *hps,DP *rp,P *nmp,P *dnp)
1210: {
1211: DP u,p,d,s,t,dmy,hp;
1212: NODE l;
1213: MP m,mr;
1214: int i,n,hmag;
1215: int *wb;
1216: int sugar,psugar,multiple;
1217: P nm,tnm1,dn,tdn,tdn1;
1218: Z cont;
1219:
1220: multiple = 0;
1221: hmag = multiple*HMAG(g);
1222: nm = (P)ONE;
1223: dn = (P)ONE;
1224: if ( !g ) {
1225: *rp = 0; *dnp = dn; return;
1226: }
1227: for ( n = 0, l = b; l; l = NEXT(l), n++ );
1228: wb = (int *)ALLOCA(n*sizeof(int));
1229: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1230: wb[i] = ZTOS((Z)BDY(l));
1.1 noro 1231: sugar = g->sugar;
1232: for ( d = 0; g; ) {
1233: for ( u = 0, i = 0; i < n; i++ ) {
1234: if ( dp_redble(g,hp = hps[wb[i]]) ) {
1235: p = ps[wb[i]];
1236: dp_red_marked(d,g,p,hp,&t,&u,&tdn,&dmy);
1237: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1238: sugar = MAX(sugar,psugar);
1239: if ( !u ) {
1240: goto last;
1241: } else {
1242: d = t;
1243: mulp(CO,dn,tdn,&tdn1); dn = tdn1;
1244: }
1245: break;
1246: }
1247: }
1248: if ( u ) {
1249: g = u;
1250: if ( multiple && ((d && HMAG(d)>hmag) || (HMAG(g)>hmag)) ) {
1251: dp_removecont2(d,g,&t,&u,&cont); d = t; g = u;
1252: mulp(CO,nm,(P)cont,&tnm1); nm = tnm1;
1253: if ( d )
1254: hmag = multiple*HMAG(d);
1255: else
1256: hmag = multiple*HMAG(g);
1257: }
1258: } else {
1259: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1260: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1261: addd(CO,d,t,&s); d = s;
1262: dp_rest(g,&t); g = t;
1263: }
1264: }
1265: last:
1266: if ( d ) {
1267: dp_removecont2(d,0,&t,&u,&cont); d = t;
1268: mulp(CO,nm,(P)cont,&tnm1); nm = tnm1;
1269: d->sugar = sugar;
1270: }
1271: *rp = d; *nmp = nm; *dnp = dn;
1272: }
1273:
1274: void dp_true_nf_marked_mod(NODE b,DP g,DP *ps,DP *hps,int mod,DP *rp,P *dnp)
1275: {
1276: DP hp,u,p,d,s,t,dmy;
1277: NODE l;
1278: MP m,mr;
1279: int i,n;
1280: int *wb;
1281: int sugar,psugar;
1282: P dn,tdn,tdn1;
1283:
1284: dn = (P)ONEM;
1285: if ( !g ) {
1286: *rp = 0; *dnp = dn; return;
1287: }
1.3 noro 1288: for ( n = 0, l = b; l; l = NEXT(l), n++ )
1289: ;
1290: wb = (int *)ALLOCA(n*sizeof(int));
1.1 noro 1291: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1292: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 1293: sugar = g->sugar;
1294: for ( d = 0; g; ) {
1295: for ( u = 0, i = 0; i < n; i++ ) {
1296: if ( dp_redble(g,hp = hps[wb[i]]) ) {
1297: p = ps[wb[i]];
1298: dp_red_marked_mod(d,g,p,hp,mod,&t,&u,&tdn,&dmy);
1299: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1300: sugar = MAX(sugar,psugar);
1301: if ( !u ) {
1302: if ( d )
1303: d->sugar = sugar;
1304: *rp = d; *dnp = dn; return;
1305: } else {
1306: d = t;
1307: mulmp(CO,mod,dn,tdn,&tdn1); dn = tdn1;
1308: }
1309: break;
1310: }
1311: }
1312: if ( u )
1313: g = u;
1314: else {
1315: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1316: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1317: addmd(CO,mod,d,t,&s); d = s;
1318: dp_rest(g,&t); g = t;
1319: }
1320: }
1321: if ( d )
1322: d->sugar = sugar;
1323: *rp = d; *dnp = dn;
1324: }
1325:
1326: /* true nf by a marked GB and collect quotients */
1327:
1328: DP *dp_true_nf_and_quotient_marked (NODE b,DP g,DP *ps,DP *hps,DP *rp,P *dnp)
1329: {
1330: DP u,p,d,s,t,dmy,hp,mult;
1331: DP *q;
1332: NODE l;
1333: MP m,mr;
1334: int i,n,j;
1335: int *wb;
1336: int sugar,psugar,multiple;
1337: P nm,tnm1,dn,tdn,tdn1;
1338: Q cont;
1339:
1340: dn = (P)ONE;
1341: if ( !g ) {
1342: *rp = 0; *dnp = dn; return 0;
1343: }
1344: for ( n = 0, l = b; l; l = NEXT(l), n++ );
1345: wb = (int *)ALLOCA(n*sizeof(int));
1346: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1347: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 1348: q = (DP *)MALLOC(n*sizeof(DP));
1349: for ( i = 0; i < n; i++ ) q[i] = 0;
1350: sugar = g->sugar;
1351: for ( d = 0; g; ) {
1352: for ( u = 0, i = 0; i < n; i++ ) {
1353: if ( dp_redble(g,hp = hps[wb[i]]) ) {
1354: p = ps[wb[i]];
1355: dp_red_marked(d,g,p,hp,&t,&u,&tdn,&mult);
1356: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1357: sugar = MAX(sugar,psugar);
1358: for ( j = 0; j < n; j++ ) {
1359: muldc(CO,q[j],(Obj)tdn,&dmy); q[j] = dmy;
1360: }
1361: addd(CO,q[wb[i]],mult,&dmy); q[wb[i]] = dmy;
1362: mulp(CO,dn,tdn,&tdn1); dn = tdn1;
1363: d = t;
1364: if ( !u ) goto last;
1365: break;
1366: }
1367: }
1368: if ( u ) {
1369: g = u;
1370: } else {
1371: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1372: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1373: addd(CO,d,t,&s); d = s;
1374: dp_rest(g,&t); g = t;
1375: }
1376: }
1377: last:
1378: if ( d ) d->sugar = sugar;
1379: *rp = d; *dnp = dn;
1380: return q;
1381: }
1382:
1.4 ! noro 1383: // struct oEGT egc;
! 1384:
1.3 noro 1385: DP *dpm_nf_and_quotient(NODE b,DPM g,VECT psv,DPM *rp,P *dnp)
1386: {
1387: DPM u,p,d,s,t;
1388: DP dmy,mult;
1389: DPM *ps;
1390: DP *q;
1391: NODE l;
1392: DMM m,mr;
1393: int i,n,j,len;
1394: int *wb;
1395: int sugar,psugar,multiple;
1396: P nm,tnm1,dn,tdn,tdn1;
1397: Q cont;
1.4 ! noro 1398: struct oEGT eg0,eg1;
1.3 noro 1399:
1400: dn = (P)ONE;
1401: if ( !g ) {
1402: *rp = 0; *dnp = dn; return 0;
1403: }
1404: ps = (DPM *)BDY(psv);
1405: len = psv->len;
1406: if ( b ) {
1407: for ( n = 0, l = b; l; l = NEXT(l), n++ )
1408: ;
1409: wb = (int *)ALLOCA(n*sizeof(int));
1410: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1411: wb[i] = ZTOS((Q)BDY(l));
1412: } else {
1413: wb = (int *)ALLOCA(len*sizeof(int));
1414: for ( i = j = 0; i < len; i++ )
1415: if ( ps[i] ) wb[j++] = i;
1416: n = j;
1417: }
1418: q = (DP *)MALLOC(len*sizeof(DP));
1419: for ( i = 0; i < len; i++ ) q[i] = 0;
1420: sugar = g->sugar;
1421: for ( d = 0; g; ) {
1422: for ( u = 0, i = 0; i < n; i++ ) {
1423: if ( dpm_redble(g,p = ps[wb[i]]) ) {
1424: dpm_red(d,g,p,&t,&u,&tdn,&mult);
1425: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1426: sugar = MAX(sugar,psugar);
1.4 ! noro 1427: // get_eg(&eg0);
1.3 noro 1428: for ( j = 0; j < len; j++ ) {
1429: muldc(CO,q[j],(Obj)tdn,&dmy); q[j] = dmy;
1430: }
1431: addd(CO,q[wb[i]],mult,&dmy); q[wb[i]] = dmy;
1.4 ! noro 1432: // get_eg(&eg1); add_eg(&egc,&eg0,&eg1);
1.3 noro 1433: mulp(CO,dn,tdn,&tdn1); dn = tdn1;
1434: d = t;
1435: if ( !u ) goto last;
1436: break;
1437: }
1438: }
1439: if ( u ) {
1440: g = u;
1441: } else {
1442: m = BDY(g); NEWDMM(mr); mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos;
1443: NEXT(mr) = 0; MKDPM(g->nv,mr,t); t->sugar = mr->dl->td;
1444: adddpm(CO,d,t,&s); d = s;
1445: dpm_rest(g,&t); g = t;
1446: }
1447: }
1448: last:
1449: if ( d ) d->sugar = sugar;
1450: *rp = d; *dnp = dn;
1451: return q;
1452: }
1453:
1.1 noro 1454: DP *dp_true_nf_and_quotient_marked_mod(NODE b,DP g,DP *ps,DP *hps,int mod,DP *rp,P *dnp)
1455: {
1456: DP u,p,d,s,t,dmy,hp,mult;
1457: DP *q;
1458: NODE l;
1459: MP m,mr;
1460: int i,n,j;
1461: int *wb;
1462: int sugar,psugar;
1463: P dn,tdn,tdn1;
1464:
1465: for ( n = 0, l = b; l; l = NEXT(l), n++ );
1466: q = (DP *)MALLOC(n*sizeof(DP));
1467: for ( i = 0; i < n; i++ ) q[i] = 0;
1468: dn = (P)ONEM;
1469: if ( !g ) {
1470: *rp = 0; *dnp = dn; return 0;
1471: }
1472: wb = (int *)ALLOCA(n*sizeof(int));
1473: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1474: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 1475: sugar = g->sugar;
1476: for ( d = 0; g; ) {
1477: for ( u = 0, i = 0; i < n; i++ ) {
1478: if ( dp_redble(g,hp = hps[wb[i]]) ) {
1479: p = ps[wb[i]];
1480: dp_red_marked_mod(d,g,p,hp,mod,&t,&u,&tdn,&mult);
1481: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1482: sugar = MAX(sugar,psugar);
1483: for ( j = 0; j < n; j++ ) {
1484: mulmdc(CO,mod,q[j],(P)tdn,&dmy); q[j] = dmy;
1485: }
1486: addmd(CO,mod,q[wb[i]],mult,&dmy); q[wb[i]] = dmy;
1487: mulmp(CO,mod,dn,tdn,&tdn1); dn = tdn1;
1488: d = t;
1489: if ( !u ) goto last;
1490: break;
1491: }
1492: }
1493: if ( u )
1494: g = u;
1495: else {
1496: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1497: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1498: addmd(CO,mod,d,t,&s); d = s;
1499: dp_rest(g,&t); g = t;
1500: }
1501: }
1502: last:
1503: if ( d )
1504: d->sugar = sugar;
1505: *rp = d; *dnp = dn;
1506: return q;
1507: }
1508:
1509: /* nf computation over Z */
1510:
1511: void dp_nf_z(NODE b,DP g,DP *ps,int full,int multiple,DP *rp)
1512: {
1513: DP u,p,d,s,t,dmy1;
1514: P dmy;
1515: NODE l;
1516: MP m,mr;
1517: int i,n;
1518: int *wb;
1519: int hmag;
1520: int sugar,psugar;
1521:
1522: if ( !g ) {
1523: *rp = 0; return;
1524: }
1525: for ( n = 0, l = b; l; l = NEXT(l), n++ );
1526: wb = (int *)ALLOCA(n*sizeof(int));
1527: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1528: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 1529:
1530: hmag = multiple*HMAG(g);
1531: sugar = g->sugar;
1532:
1533: for ( d = 0; g; ) {
1534: for ( u = 0, i = 0; i < n; i++ ) {
1535: if ( dp_redble(g,p = ps[wb[i]]) ) {
1536: dp_red(d,g,p,&t,&u,&dmy,&dmy1);
1537: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1538: sugar = MAX(sugar,psugar);
1539: if ( !u ) {
1540: if ( d )
1541: d->sugar = sugar;
1542: *rp = d; return;
1543: }
1544: d = t;
1545: break;
1546: }
1547: }
1548: if ( u ) {
1549: g = u;
1550: if ( d ) {
1551: if ( multiple && HMAG(d) > hmag ) {
1552: dp_ptozp2(d,g,&t,&u); d = t; g = u;
1553: hmag = multiple*HMAG(d);
1554: }
1555: } else {
1556: if ( multiple && HMAG(g) > hmag ) {
1557: dp_ptozp(g,&t); g = t;
1558: hmag = multiple*HMAG(g);
1559: }
1560: }
1561: }
1562: else if ( !full ) {
1563: if ( g ) {
1564: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
1565: }
1566: *rp = g; return;
1567: } else {
1568: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1569: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1570: addd(CO,d,t,&s); d = s;
1571: dp_rest(g,&t); g = t;
1572:
1573: }
1574: }
1575: if ( d )
1576: d->sugar = sugar;
1577: *rp = d;
1578: }
1579:
1.4 ! noro 1580: void dpm_nf_z(NODE b,DPM g,VECT psv,int full,int multiple,DPM *rp)
1.1 noro 1581: {
1.4 ! noro 1582: DPM *ps;
1.1 noro 1583: DPM u,p,d,s,t;
1584: DP dmy1;
1585: P dmy;
1.3 noro 1586: Z cont;
1.1 noro 1587: NODE l;
1588: DMM m,mr;
1589: int i,n;
1590: int *wb;
1591: int hmag;
1592: int sugar,psugar;
1593:
1594: if ( !g ) {
1595: *rp = 0; return;
1596: }
1.4 ! noro 1597: if ( b ) {
! 1598: for ( n = 0, l = b; l; l = NEXT(l), n++ );
! 1599: wb = (int *)ALLOCA(n*sizeof(int));
! 1600: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
! 1601: wb[i] = ZTOS((Q)BDY(l));
! 1602: ps = (DPM *)BDY(psv);
! 1603: } else {
! 1604: n = psv->len;
! 1605: wb = (int *)MALLOC(n*sizeof(int));
! 1606: for ( i = 0; i < n; i++ ) wb[i] = i;
! 1607: ps = (DPM *)BDY(psv);
! 1608: }
1.1 noro 1609:
1610: hmag = multiple*HMAG(g);
1611: sugar = g->sugar;
1612:
1613: for ( d = 0; g; ) {
1614: for ( u = 0, i = 0; i < n; i++ ) {
1.4 ! noro 1615: if ( (p=ps[wb[i]])!=0 && dpm_redble(g,p) ) {
1.1 noro 1616: dpm_red(d,g,p,&t,&u,&dmy,&dmy1);
1617: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1618: sugar = MAX(sugar,psugar);
1619: if ( !u ) {
1620: if ( d )
1621: d->sugar = sugar;
1622: *rp = d; return;
1623: }
1624: d = t;
1625: break;
1626: }
1627: }
1628: if ( u ) {
1629: g = u;
1630: if ( d ) {
1631: if ( multiple && HMAG(d) > hmag ) {
1632: dpm_ptozp2(d,g,&t,&u); d = t; g = u;
1633: hmag = multiple*HMAG(d);
1634: }
1635: } else {
1636: if ( multiple && HMAG(g) > hmag ) {
1.3 noro 1637: dpm_ptozp(g,&cont,&t); g = t;
1.1 noro 1638: hmag = multiple*HMAG(g);
1639: }
1640: }
1641: }
1642: else if ( !full ) {
1643: if ( g ) {
1644: MKDPM(g->nv,BDY(g),t); t->sugar = sugar; g = t;
1645: }
1646: *rp = g; return;
1647: } else {
1648: m = BDY(g); NEWDMM(mr); mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos;
1649: NEXT(mr) = 0; MKDPM(g->nv,mr,t); t->sugar = mr->dl->td;
1650: adddpm(CO,d,t,&s); d = s;
1651: dpm_rest(g,&t); g = t;
1652: }
1653: }
1654: if ( d )
1655: d->sugar = sugar;
1656: *rp = d;
1657: }
1658:
1.3 noro 1659: void dpm_shift(DPM p,int s,DPM *r)
1660: {
1661: DMM m,mr0,mr;
1662: DPM t;
1663:
1664: if ( !p ) *r = 0;
1665: else {
1666: for ( m = BDY(p), mr0 = 0; m; m = NEXT(m) ) {
1667: NEXTDMM(mr0,mr);
1668: mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos-s;
1669: if ( mr->pos <= 0 )
1670: error("dpm_shift : too large shift value");
1671: }
1672: NEXT(mr) = 0;
1673: MKDPM(p->nv,mr0,t); t->sugar = p->sugar;
1674: *r = t;
1675: }
1676: }
1677:
1678: // up=sum{c*<<...:i>>|i<=s}, lo=sum{c*<<...:i>>|i>s}
1679:
1680: void dpm_split(DPM p,int s,DPM *up,DPM *lo)
1681: {
1682: DMM m,mu0,mu,ml0,ml;
1683: DPM t;
1684:
1685: if ( !p ) {
1686: *up = 0; *lo = 0;
1687: } else {
1688: for ( m = BDY(p), mu0 = ml0 = 0; m; m = NEXT(m) ) {
1689: if ( m->pos <= s ) {
1690: NEXTDMM(mu0,mu);
1691: mu->dl = m->dl; mu->c = m->c; mu->pos = m->pos;
1692: } else {
1693: NEXTDMM(ml0,ml);
1694: ml->dl = m->dl; ml->c = m->c; ml->pos = m->pos;
1695: }
1696: }
1697: if ( mu0 ) {
1698: NEXT(mu) = 0; MKDPM(p->nv,mu0,t); t->sugar = p->sugar;
1699: *up = t;
1700: } else
1701: *up = 0;
1702: if ( ml0 ) {
1703: NEXT(ml) = 0; MKDPM(p->nv,ml0,t); t->sugar = p->sugar;
1704: *lo = t;
1705: } else
1706: *lo = 0;
1707: }
1708: }
1709:
1.1 noro 1710: /* nf computation over a field */
1711:
1712: void dp_nf_f(NODE b,DP g,DP *ps,int full,DP *rp)
1713: {
1714: DP u,p,d,s,t;
1715: NODE l;
1716: MP m,mr;
1717: int i,n;
1718: int *wb;
1719: int sugar,psugar;
1720:
1721: if ( !g ) {
1722: *rp = 0; return;
1723: }
1724: for ( n = 0, l = b; l; l = NEXT(l), n++ );
1725: wb = (int *)ALLOCA(n*sizeof(int));
1726: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1727: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 1728:
1729: sugar = g->sugar;
1730: for ( d = 0; g; ) {
1731: for ( u = 0, i = 0; i < n; i++ ) {
1732: if ( dp_redble(g,p = ps[wb[i]]) ) {
1733: dp_red_f(g,p,&u);
1734: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1735: sugar = MAX(sugar,psugar);
1736: if ( !u ) {
1737: if ( d )
1738: d->sugar = sugar;
1739: *rp = d; return;
1740: }
1741: break;
1742: }
1743: }
1744: if ( u )
1745: g = u;
1746: else if ( !full ) {
1747: if ( g ) {
1748: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
1749: }
1750: *rp = g; return;
1751: } else {
1752: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1753: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1754: addd(CO,d,t,&s); d = s;
1755: dp_rest(g,&t); g = t;
1756: }
1757: }
1758: if ( d )
1759: d->sugar = sugar;
1760: *rp = d;
1761: }
1762:
1.4 ! noro 1763: void dpm_nf_f(NODE b,DPM g,VECT psv,int full,DPM *rp)
1.1 noro 1764: {
1.4 ! noro 1765: DPM *ps;
1.1 noro 1766: DPM u,p,d,s,t;
1767: NODE l;
1768: DMM m,mr;
1769: int i,n;
1770: int *wb;
1771: int sugar,psugar;
1772:
1773: if ( !g ) {
1774: *rp = 0; return;
1775: }
1.4 ! noro 1776: if ( b ) {
! 1777: for ( n = 0, l = b; l; l = NEXT(l), n++ );
! 1778: wb = (int *)ALLOCA(n*sizeof(int));
! 1779: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
! 1780: wb[i] = ZTOS((Q)BDY(l));
! 1781: ps = (DPM *)BDY(psv);
! 1782: } else {
! 1783: n = psv->len;
! 1784: wb = (int *)MALLOC(n*sizeof(int));
! 1785: for ( i = 0; i < n; i++ ) wb[i] = i;
! 1786: ps = (DPM *)BDY(psv);
! 1787: }
1.1 noro 1788:
1789: sugar = g->sugar;
1790: for ( d = 0; g; ) {
1791: for ( u = 0, i = 0; i < n; i++ ) {
1.4 ! noro 1792: if ( ( (p=ps[wb[i]]) != 0 ) && dpm_redble(g,p) ) {
1.1 noro 1793: dpm_red_f(g,p,&u);
1794: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1795: sugar = MAX(sugar,psugar);
1796: if ( !u ) {
1797: if ( d )
1798: d->sugar = sugar;
1799: *rp = d; return;
1800: }
1801: break;
1802: }
1803: }
1804: if ( u )
1805: g = u;
1806: else if ( !full ) {
1807: if ( g ) {
1808: MKDPM(g->nv,BDY(g),t); t->sugar = sugar; g = t;
1809: }
1810: *rp = g; return;
1811: } else {
1812: m = BDY(g); NEWDMM(mr); mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos;
1813: NEXT(mr) = 0; MKDPM(g->nv,mr,t); t->sugar = mr->dl->td;
1814: adddpm(CO,d,t,&s); d = s;
1815: dpm_rest(g,&t); g = t;
1816: }
1817: }
1818: if ( d )
1819: d->sugar = sugar;
1820: *rp = d;
1821: }
1822:
1823: /* nf computation over GF(mod) (only for internal use) */
1824:
1825: void dp_nf_mod(NODE b,DP g,DP *ps,int mod,int full,DP *rp)
1826: {
1827: DP u,p,d,s,t;
1828: P dmy;
1829: NODE l;
1830: MP m,mr;
1831: int sugar,psugar;
1832:
1833: if ( !g ) {
1834: *rp = 0; return;
1835: }
1836: sugar = g->sugar;
1837: for ( d = 0; g; ) {
1838: for ( u = 0, l = b; l; l = NEXT(l) ) {
1839: if ( dp_redble(g,p = ps[(long)BDY(l)]) ) {
1840: dp_red_mod(d,g,p,mod,&t,&u,&dmy);
1841: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1842: sugar = MAX(sugar,psugar);
1843: if ( !u ) {
1844: if ( d )
1845: d->sugar = sugar;
1846: *rp = d; return;
1847: }
1848: d = t;
1849: break;
1850: }
1851: }
1852: if ( u )
1853: g = u;
1854: else if ( !full ) {
1855: if ( g ) {
1856: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
1857: }
1858: *rp = g; return;
1859: } else {
1860: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1861: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1862: addmd(CO,mod,d,t,&s); d = s;
1863: dp_rest(g,&t); g = t;
1864: }
1865: }
1866: if ( d )
1867: d->sugar = sugar;
1868: *rp = d;
1869: }
1870:
1871: void dp_true_nf_mod(NODE b,DP g,DP *ps,int mod,int full,DP *rp,P *dnp)
1872: {
1873: DP u,p,d,s,t;
1874: NODE l;
1875: MP m,mr;
1876: int i,n;
1877: int *wb;
1878: int sugar,psugar;
1879: P dn,tdn,tdn1;
1880:
1881: dn = (P)ONEM;
1882: if ( !g ) {
1883: *rp = 0; *dnp = dn; return;
1884: }
1.3 noro 1885: for ( n = 0, l = b; l; l = NEXT(l), n++ )
1886: ;
1887: wb = (int *)ALLOCA(n*sizeof(int));
1.1 noro 1888: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 1889: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 1890: sugar = g->sugar;
1891: for ( d = 0; g; ) {
1892: for ( u = 0, i = 0; i < n; i++ ) {
1893: if ( dp_redble(g,p = ps[wb[i]]) ) {
1894: dp_red_mod(d,g,p,mod,&t,&u,&tdn);
1895: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1896: sugar = MAX(sugar,psugar);
1897: if ( !u ) {
1898: if ( d )
1899: d->sugar = sugar;
1900: *rp = d; *dnp = dn; return;
1901: } else {
1902: d = t;
1903: mulmp(CO,mod,dn,tdn,&tdn1); dn = tdn1;
1904: }
1905: break;
1906: }
1907: }
1908: if ( u )
1909: g = u;
1910: else if ( !full ) {
1911: if ( g ) {
1912: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
1913: }
1914: *rp = g; *dnp = dn; return;
1915: } else {
1916: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
1917: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
1918: addmd(CO,mod,d,t,&s); d = s;
1919: dp_rest(g,&t); g = t;
1920: }
1921: }
1922: if ( d )
1923: d->sugar = sugar;
1924: *rp = d; *dnp = dn;
1925: }
1926:
1927: void _dp_nf_mod_destructive(NODE b,DP g,DP *ps,int mod,int full,DP *rp)
1928: {
1929: DP u,p,d;
1930: NODE l;
1931: MP m,mrd;
1932: int sugar,psugar,n,h_reducible;
1933:
1934: if ( !g ) {
1935: *rp = 0; return;
1936: }
1937: sugar = g->sugar;
1938: n = g->nv;
1939: for ( d = 0; g; ) {
1940: for ( h_reducible = 0, l = b; l; l = NEXT(l) ) {
1941: if ( dp_redble(g,p = ps[(long)BDY(l)]) ) {
1942: h_reducible = 1;
1943: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
1944: _dp_red_mod_destructive(g,p,mod,&u); g = u;
1945: sugar = MAX(sugar,psugar);
1946: if ( !g ) {
1947: if ( d )
1948: d->sugar = sugar;
1949: _dptodp(d,rp); _free_dp(d); return;
1950: }
1951: break;
1952: }
1953: }
1954: if ( !h_reducible ) {
1955: /* head term is not reducible */
1956: if ( !full ) {
1957: if ( g )
1958: g->sugar = sugar;
1959: _dptodp(g,rp); _free_dp(g); return;
1960: } else {
1961: m = BDY(g);
1962: if ( NEXT(m) ) {
1963: BDY(g) = NEXT(m); NEXT(m) = 0;
1964: } else {
1965: _FREEDP(g); g = 0;
1966: }
1967: if ( d ) {
1968: for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) );
1969: NEXT(mrd) = m;
1970: } else {
1971: _MKDP(n,m,d);
1972: }
1973: }
1974: }
1975: }
1976: if ( d )
1977: d->sugar = sugar;
1978: _dptodp(d,rp); _free_dp(d);
1979: }
1980:
1981: /* reduction by linear base over a field */
1982:
1983: void dp_lnf_f(DP p1,DP p2,NODE g,DP *r1p,DP *r2p)
1984: {
1985: DP r1,r2,b1,b2,t,s;
1986: Obj c,c1,c2;
1987: NODE l,b;
1988: int n;
1989:
1990: if ( !p1 ) {
1991: *r1p = p1; *r2p = p2; return;
1992: }
1993: n = p1->nv;
1994: for ( l = g, r1 = p1, r2 = p2; l; l = NEXT(l) ) {
1995: if ( !r1 ) {
1996: *r1p = r1; *r2p = r2; return;
1997: }
1998: b = BDY((LIST)BDY(l)); b1 = (DP)BDY(b);
1999: if ( dl_equal(n,BDY(r1)->dl,BDY(b1)->dl) ) {
2000: b2 = (DP)BDY(NEXT(b));
2001: divr(CO,(Obj)ONE,(Obj)BDY(b1)->c,&c1);
2002: mulr(CO,c1,(Obj)BDY(r1)->c,&c2); chsgnr(c2,&c);
2003: muldc(CO,b1,(Obj)c,&t); addd(CO,r1,t,&s); r1 = s;
2004: muldc(CO,b2,(Obj)c,&t); addd(CO,r2,t,&s); r2 = s;
2005: }
2006: }
2007: *r1p = r1; *r2p = r2;
2008: }
2009:
2010: /* reduction by linear base over GF(mod) */
2011:
2012: void dp_lnf_mod(DP p1,DP p2,NODE g,int mod,DP *r1p,DP *r2p)
2013: {
2014: DP r1,r2,b1,b2,t,s;
2015: P c;
2016: MQ c1,c2;
2017: NODE l,b;
2018: int n;
2019:
2020: if ( !p1 ) {
2021: *r1p = p1; *r2p = p2; return;
2022: }
2023: n = p1->nv;
2024: for ( l = g, r1 = p1, r2 = p2; l; l = NEXT(l) ) {
2025: if ( !r1 ) {
2026: *r1p = r1; *r2p = r2; return;
2027: }
2028: b = BDY((LIST)BDY(l)); b1 = (DP)BDY(b);
2029: if ( dl_equal(n,BDY(r1)->dl,BDY(b1)->dl) ) {
2030: b2 = (DP)BDY(NEXT(b));
2031: invmq(mod,(MQ)BDY(b1)->c,&c1);
2032: mulmq(mod,c1,(MQ)BDY(r1)->c,&c2); chsgnmp(mod,(P)c2,&c);
2033: mulmdc(CO,mod,b1,c,&t); addmd(CO,mod,r1,t,&s); r1 = s;
2034: mulmdc(CO,mod,b2,c,&t); addmd(CO,mod,r2,t,&s); r2 = s;
2035: }
2036: }
2037: *r1p = r1; *r2p = r2;
2038: }
2039:
2040: void dp_nf_tab_mod(DP p,LIST *tab,int mod,DP *rp)
2041: {
2042: DP s,t,u;
2043: MP m;
2044: DL h;
2045: int i,n;
2046:
2047: if ( !p ) {
2048: *rp = p; return;
2049: }
2050: n = p->nv;
2051: for ( s = 0, i = 0, m = BDY(p); m; m = NEXT(m) ) {
2052: h = m->dl;
2053: while ( !dl_equal(n,h,BDY((DP)BDY(BDY(tab[i])))->dl ) )
2054: i++;
2055: mulmdc(CO,mod,(DP)BDY(NEXT(BDY(tab[i]))),(P)m->c,&t);
2056: addmd(CO,mod,s,t,&u); s = u;
2057: }
2058: *rp = s;
2059: }
2060:
2061: void dp_nf_tab_f(DP p,LIST *tab,DP *rp)
2062: {
2063: DP s,t,u;
2064: MP m;
2065: DL h;
2066: int i,n;
2067:
2068: if ( !p ) {
2069: *rp = p; return;
2070: }
2071: n = p->nv;
2072: for ( s = 0, i = 0, m = BDY(p); m; m = NEXT(m) ) {
2073: h = m->dl;
2074: while ( !dl_equal(n,h,BDY((DP)BDY(BDY(tab[i])))->dl ) )
2075: i++;
2076: muldc(CO,(DP)BDY(NEXT(BDY(tab[i]))),m->c,&t);
2077: addd(CO,s,t,&u); s = u;
2078: }
2079: *rp = s;
2080: }
2081:
2082: /*
2083: * setting flags
2084: * call create_order_spec with vl=0 to set old type order.
2085: *
2086: */
2087:
2088: int create_order_spec(VL vl,Obj obj,struct order_spec **specp)
2089: {
2090: int i,j,n,s,row,col,ret,wlen;
2091: struct order_spec *spec;
2092: struct order_pair *l;
2093: Obj wp,wm;
2094: NODE node,t,tn,wpair;
2095: MAT m;
2096: VECT v;
2097: pointer **b,*bv;
2098: int **w;
2099:
2100: if ( vl && obj && OID(obj) == O_LIST ) {
2101: ret = create_composite_order_spec(vl,(LIST)obj,specp);
2102: if ( show_orderspec )
2103: print_composite_order_spec(*specp);
2104: return ret;
2105: }
2106:
2107: *specp = spec = (struct order_spec *)MALLOC(sizeof(struct order_spec));
2108: if ( !obj || NUM(obj) ) {
2109: spec->id = 0; spec->obj = obj;
1.2 noro 2110: spec->ord.simple = ZTOS((Q)obj);
1.1 noro 2111: return 1;
2112: } else if ( OID(obj) == O_LIST ) {
2113: /* module order; obj = [0|1,w,ord] or [0|1,ord] */
2114: node = BDY((LIST)obj);
2115: if ( !BDY(node) || NUM(BDY(node)) ) {
2116: switch ( length(node) ) {
2117: case 2:
2118: create_order_spec(0,(Obj)BDY(NEXT(node)),&spec);
2119: spec->id += 256; spec->obj = obj;
2120: spec->top_weight = 0;
2121: spec->module_rank = 0;
2122: spec->module_top_weight = 0;
2123: spec->ispot = (BDY(node)!=0);
2124: if ( spec->ispot ) {
1.2 noro 2125: n = ZTOS((Q)BDY(node));
1.1 noro 2126: if ( n < 0 )
2127: spec->pot_nelim = -n;
2128: else
2129: spec->pot_nelim = 0;
2130: }
2131: break;
2132:
2133: case 3:
2134: create_order_spec(0,(Obj)BDY(NEXT(NEXT(node))),&spec);
2135: spec->id += 256; spec->obj = obj;
2136: spec->ispot = (BDY(node)!=0);
2137: node = NEXT(node);
2138: if ( !BDY(node) || OID(BDY(node)) != O_LIST )
2139: error("create_order_spec : [weight_for_poly,weight_for_modlue] must be specified as a module topweight");
2140: wpair = BDY((LIST)BDY(node));
2141: if ( length(wpair) != 2 )
2142: error("create_order_spec : [weight_for_poly,weight_for_modlue] must be specified as a module topweight");
2143:
2144: wp = BDY(wpair);
2145: wm = BDY(NEXT(wpair));
2146: if ( !wp || OID(wp) != O_LIST || !wm || OID(wm) != O_LIST )
2147: error("create_order_spec : [weight_for_poly,weight_for_modlue] must be specified as a module topweight");
2148: spec->nv = length(BDY((LIST)wp));
2149: spec->top_weight = (int *)MALLOC_ATOMIC(spec->nv*sizeof(int));
2150: for ( i = 0, t = BDY((LIST)wp); i < spec->nv; t = NEXT(t), i++ )
1.2 noro 2151: spec->top_weight[i] = ZTOS((Q)BDY(t));
1.1 noro 2152:
2153: spec->module_rank = length(BDY((LIST)wm));
2154: spec->module_top_weight = (int *)MALLOC_ATOMIC(spec->module_rank*sizeof(int));
2155: for ( i = 0, t = BDY((LIST)wm); i < spec->module_rank; t = NEXT(t), i++ )
1.2 noro 2156: spec->module_top_weight[i] = ZTOS((Q)BDY(t));
1.1 noro 2157: break;
2158: default:
2159: error("create_order_spec : invalid arguments for module order");
2160: }
2161:
2162: *specp = spec;
2163: return 1;
2164: } else {
2165: /* block order in polynomial ring */
2166: for ( n = 0, t = node; t; t = NEXT(t), n++ );
2167: l = (struct order_pair *)MALLOC_ATOMIC(n*sizeof(struct order_pair));
2168: for ( i = 0, t = node, s = 0; i < n; t = NEXT(t), i++ ) {
1.2 noro 2169: tn = BDY((LIST)BDY(t)); l[i].order = ZTOS((Q)BDY(tn));
2170: tn = NEXT(tn); l[i].length = ZTOS((Q)BDY(tn));
1.1 noro 2171: s += l[i].length;
2172: }
2173: spec->id = 1; spec->obj = obj;
2174: spec->ord.block.order_pair = l;
2175: spec->ord.block.length = n; spec->nv = s;
2176: return 1;
2177: }
2178: } else if ( OID(obj) == O_MAT ) {
2179: m = (MAT)obj; row = m->row; col = m->col; b = BDY(m);
2180: w = almat(row,col);
2181: for ( i = 0; i < row; i++ )
2182: for ( j = 0; j < col; j++ )
1.2 noro 2183: w[i][j] = ZTOS((Q)b[i][j]);
1.1 noro 2184: spec->id = 2; spec->obj = obj;
2185: spec->nv = col; spec->ord.matrix.row = row;
2186: spec->ord.matrix.matrix = w;
2187: return 1;
2188: } else
2189: return 0;
2190: }
2191:
2192: void print_composite_order_spec(struct order_spec *spec)
2193: {
2194: int nv,n,len,i,j,k,start;
2195: struct weight_or_block *worb;
2196:
2197: nv = spec->nv;
2198: n = spec->ord.composite.length;
2199: worb = spec->ord.composite.w_or_b;
2200: for ( i = 0; i < n; i++, worb++ ) {
2201: len = worb->length;
2202: printf("[ ");
2203: switch ( worb->type ) {
2204: case IS_DENSE_WEIGHT:
2205: for ( j = 0; j < len; j++ )
2206: printf("%d ",worb->body.dense_weight[j]);
2207: for ( ; j < nv; j++ )
2208: printf("0 ");
2209: break;
2210: case IS_SPARSE_WEIGHT:
2211: for ( j = 0, k = 0; j < nv; j++ )
2212: if ( j == worb->body.sparse_weight[k].pos )
2213: printf("%d ",worb->body.sparse_weight[k++].value);
2214: else
2215: printf("0 ");
2216: break;
2217: case IS_BLOCK:
2218: start = worb->body.block.start;
2219: for ( j = 0; j < start; j++ ) printf("0 ");
2220: switch ( worb->body.block.order ) {
2221: case 0:
2222: for ( k = 0; k < len; k++, j++ ) printf("R ");
2223: break;
2224: case 1:
2225: for ( k = 0; k < len; k++, j++ ) printf("G ");
2226: break;
2227: case 2:
2228: for ( k = 0; k < len; k++, j++ ) printf("L ");
2229: break;
2230: }
2231: for ( ; j < nv; j++ ) printf("0 ");
2232: break;
2233: }
2234: printf("]\n");
2235: }
2236: }
2237:
2238: struct order_spec *append_block(struct order_spec *spec,
2239: int nv,int nalg,int ord)
2240: {
2241: MAT m,mat;
2242: int i,j,row,col,n;
2243: Z **b,**wp;
2244: int **w;
2245: NODE t,s,s0;
2246: struct order_pair *l,*l0;
2247: int n0,nv0;
2248: LIST list0,list1,list;
2249: Z oq,nq;
2250: struct order_spec *r;
2251:
2252: r = (struct order_spec *)MALLOC(sizeof(struct order_spec));
2253: switch ( spec->id ) {
2254: case 0:
1.2 noro 2255: STOZ(spec->ord.simple,oq); STOZ(nv,nq);
1.1 noro 2256: t = mknode(2,oq,nq); MKLIST(list0,t);
1.2 noro 2257: STOZ(ord,oq); STOZ(nalg,nq);
1.1 noro 2258: t = mknode(2,oq,nq); MKLIST(list1,t);
2259: t = mknode(2,list0,list1); MKLIST(list,t);
2260: l = (struct order_pair *)MALLOC_ATOMIC(2*sizeof(struct order_pair));
2261: l[0].order = spec->ord.simple; l[0].length = nv;
2262: l[1].order = ord; l[1].length = nalg;
2263: r->id = 1; r->obj = (Obj)list;
2264: r->ord.block.order_pair = l;
2265: r->ord.block.length = 2;
2266: r->nv = nv+nalg;
2267: break;
2268: case 1:
2269: if ( spec->nv != nv )
2270: error("append_block : number of variables mismatch");
2271: l0 = spec->ord.block.order_pair;
2272: n0 = spec->ord.block.length;
2273: nv0 = spec->nv;
2274: list0 = (LIST)spec->obj;
2275: n = n0+1;
2276: l = (struct order_pair *)MALLOC_ATOMIC(n*sizeof(struct order_pair));
2277: for ( i = 0; i < n0; i++ )
2278: l[i] = l0[i];
2279: l[i].order = ord; l[i].length = nalg;
2280: for ( t = BDY(list0), s0 = 0; t; t = NEXT(t) ) {
2281: NEXTNODE(s0,s); BDY(s) = BDY(t);
2282: }
1.2 noro 2283: STOZ(ord,oq); STOZ(nalg,nq);
1.1 noro 2284: t = mknode(2,oq,nq); MKLIST(list,t);
2285: NEXTNODE(s0,s); BDY(s) = (pointer)list; NEXT(s) = 0;
2286: MKLIST(list,s0);
2287: r->id = 1; r->obj = (Obj)list;
2288: r->ord.block.order_pair = l;
2289: r->ord.block.length = n;
2290: r->nv = nv+nalg;
2291: break;
2292: case 2:
2293: if ( spec->nv != nv )
2294: error("append_block : number of variables mismatch");
2295: m = (MAT)spec->obj;
2296: row = m->row; col = m->col; b = (Z **)BDY(m);
2297: w = almat(row+nalg,col+nalg);
2298: MKMAT(mat,row+nalg,col+nalg); wp = (Z **)BDY(mat);
2299: for ( i = 0; i < row; i++ )
2300: for ( j = 0; j < col; j++ ) {
1.2 noro 2301: w[i][j] = ZTOS(b[i][j]);
1.1 noro 2302: wp[i][j] = b[i][j];
2303: }
2304: for ( i = 0; i < nalg; i++ ) {
2305: w[i+row][i+col] = 1;
2306: wp[i+row][i+col] = ONE;
2307: }
2308: r->id = 2; r->obj = (Obj)mat;
2309: r->nv = col+nalg; r->ord.matrix.row = row+nalg;
2310: r->ord.matrix.matrix = w;
2311: break;
2312: case 3:
2313: default:
2314: /* XXX */
2315: error("append_block : not implemented yet");
2316: }
2317: return r;
2318: }
2319:
2320: int comp_sw(struct sparse_weight *a, struct sparse_weight *b)
2321: {
2322: if ( a->pos > b->pos ) return 1;
2323: else if ( a->pos < b->pos ) return -1;
2324: else return 0;
2325: }
2326:
2327: /* order = [w_or_b, w_or_b, ... ] */
2328: /* w_or_b = w or b */
2329: /* w = [1,2,...] or [x,1,y,2,...] */
2330: /* b = [@lex,x,y,...,z] etc */
2331:
2332: int create_composite_order_spec(VL vl,LIST order,struct order_spec **specp)
2333: {
2334: NODE wb,t,p;
2335: struct order_spec *spec;
2336: VL tvl;
2337: int n,i,j,k,l,start,end,len,w;
2338: int *dw;
2339: struct sparse_weight *sw;
2340: struct weight_or_block *w_or_b;
2341: Obj a0;
2342: NODE a;
2343: V v,sv,ev;
2344: SYMBOL sym;
2345: int *top;
2346:
2347: /* l = number of vars in vl */
2348: for ( l = 0, tvl = vl; tvl; tvl = NEXT(tvl), l++ );
2349: /* n = number of primitives in order */
2350: wb = BDY(order);
2351: n = length(wb);
2352: *specp = spec = (struct order_spec *)MALLOC(sizeof(struct order_spec));
2353: spec->id = 3;
2354: spec->obj = (Obj)order;
2355: spec->nv = l;
2356: spec->ord.composite.length = n;
2357: w_or_b = spec->ord.composite.w_or_b = (struct weight_or_block *)
2358: MALLOC(sizeof(struct weight_or_block)*(n+1));
2359:
2360: /* top : register the top variable in each w_or_b specification */
2361: top = (int *)ALLOCA(l*sizeof(int));
2362: for ( i = 0; i < l; i++ ) top[i] = 0;
2363:
2364: for ( t = wb, i = 0; t; t = NEXT(t), i++ ) {
2365: if ( !BDY(t) || OID((Obj)BDY(t)) != O_LIST )
2366: error("a list of lists must be specified for the key \"order\"");
2367: a = BDY((LIST)BDY(t));
2368: len = length(a);
2369: a0 = (Obj)BDY(a);
2370: if ( !a0 || OID(a0) == O_N ) {
2371: /* a is a dense weight vector */
2372: dw = (int *)MALLOC(sizeof(int)*len);
2373: for ( j = 0, p = a; j < len; p = NEXT(p), j++ ) {
2374: if ( !INT((Q)BDY(p)) )
2375: error("a dense weight vector must be specified as a list of integers");
1.2 noro 2376: dw[j] = ZTOS((Q)BDY(p));
1.1 noro 2377: }
2378: w_or_b[i].type = IS_DENSE_WEIGHT;
2379: w_or_b[i].length = len;
2380: w_or_b[i].body.dense_weight = dw;
2381:
2382: /* find the top */
2383: for ( k = 0; k < len && !dw[k]; k++ );
2384: if ( k < len ) top[k] = 1;
2385:
2386: } else if ( OID(a0) == O_P ) {
2387: /* a is a sparse weight vector */
2388: len >>= 1;
2389: sw = (struct sparse_weight *)
2390: MALLOC(sizeof(struct sparse_weight)*len);
2391: for ( j = 0, p = a; j < len; j++ ) {
2392: if ( !BDY(p) || OID((P)BDY(p)) != O_P )
2393: error("a sparse weight vector must be specified as [var1,weight1,...]");
2394: v = VR((P)BDY(p)); p = NEXT(p);
2395: for ( tvl = vl, k = 0; tvl && tvl->v != v;
2396: k++, tvl = NEXT(tvl) );
2397: if ( !tvl )
2398: error("invalid variable name in a sparse weight vector");
2399: sw[j].pos = k;
2400: if ( !INT((Q)BDY(p)) )
2401: error("a sparse weight vector must be specified as [var1,weight1,...]");
1.2 noro 2402: sw[j].value = ZTOS((Q)BDY(p)); p = NEXT(p);
1.1 noro 2403: }
2404: qsort(sw,len,sizeof(struct sparse_weight),
2405: (int (*)(const void *,const void *))comp_sw);
2406: w_or_b[i].type = IS_SPARSE_WEIGHT;
2407: w_or_b[i].length = len;
2408: w_or_b[i].body.sparse_weight = sw;
2409:
2410: /* find the top */
2411: for ( k = 0; k < len && !sw[k].value; k++ );
2412: if ( k < len ) top[sw[k].pos] = 1;
2413: } else if ( OID(a0) == O_RANGE ) {
2414: /* [range(v1,v2),w] */
2415: sv = VR((P)(((RANGE)a0)->start));
2416: ev = VR((P)(((RANGE)a0)->end));
2417: for ( tvl = vl, start = 0; tvl && tvl->v != sv; start++, tvl = NEXT(tvl) );
2418: if ( !tvl )
2419: error("invalid range");
2420: for ( end = start; tvl && tvl->v != ev; end++, tvl = NEXT(tvl) );
2421: if ( !tvl )
2422: error("invalid range");
2423: len = end-start+1;
2424: sw = (struct sparse_weight *)
2425: MALLOC(sizeof(struct sparse_weight)*len);
1.2 noro 2426: w = ZTOS((Q)BDY(NEXT(a)));
1.1 noro 2427: for ( tvl = vl, k = 0; k < start; k++, tvl = NEXT(tvl) );
2428: for ( j = 0 ; k <= end; k++, tvl = NEXT(tvl), j++ ) {
2429: sw[j].pos = k;
2430: sw[j].value = w;
2431: }
2432: w_or_b[i].type = IS_SPARSE_WEIGHT;
2433: w_or_b[i].length = len;
2434: w_or_b[i].body.sparse_weight = sw;
2435:
2436: /* register the top */
2437: if ( w ) top[start] = 1;
2438: } else if ( OID(a0) == O_SYMBOL ) {
2439: /* a is a block */
2440: sym = (SYMBOL)a0; a = NEXT(a); len--;
2441: if ( OID((Obj)BDY(a)) == O_RANGE ) {
2442: sv = VR((P)(((RANGE)BDY(a))->start));
2443: ev = VR((P)(((RANGE)BDY(a))->end));
2444: for ( tvl = vl, start = 0; tvl && tvl->v != sv; start++, tvl = NEXT(tvl) );
2445: if ( !tvl )
2446: error("invalid range");
2447: for ( end = start; tvl && tvl->v != ev; end++, tvl = NEXT(tvl) );
2448: if ( !tvl )
2449: error("invalid range");
2450: len = end-start+1;
2451: } else {
2452: for ( start = 0, tvl = vl; tvl->v != VR((P)BDY(a));
2453: tvl = NEXT(tvl), start++ );
2454: for ( p = NEXT(a), tvl = NEXT(tvl); p;
2455: p = NEXT(p), tvl = NEXT(tvl) ) {
2456: if ( !BDY(p) || OID((P)BDY(p)) != O_P )
2457: error("a block must be specified as [ordsymbol,var1,var2,...]");
2458: if ( tvl->v != VR((P)BDY(p)) ) break;
2459: }
2460: if ( p )
2461: error("a block must be contiguous in the variable list");
2462: }
2463: w_or_b[i].type = IS_BLOCK;
2464: w_or_b[i].length = len;
2465: w_or_b[i].body.block.start = start;
2466: if ( !strcmp(sym->name,"@grlex") )
2467: w_or_b[i].body.block.order = 0;
2468: else if ( !strcmp(sym->name,"@glex") )
2469: w_or_b[i].body.block.order = 1;
2470: else if ( !strcmp(sym->name,"@lex") )
2471: w_or_b[i].body.block.order = 2;
2472: else
2473: error("invalid ordername");
2474: /* register the tops */
2475: for ( j = 0, k = start; j < len; j++, k++ )
2476: top[k] = 1;
2477: }
2478: }
2479: for ( k = 0; k < l && top[k]; k++ );
2480: if ( k < l ) {
2481: /* incomplete order specification; add @grlex */
2482: w_or_b[n].type = IS_BLOCK;
2483: w_or_b[n].length = l;
2484: w_or_b[n].body.block.start = 0;
2485: w_or_b[n].body.block.order = 0;
2486: spec->ord.composite.length = n+1;
2487: }
1.3 noro 2488: return 1;
1.1 noro 2489: }
2490:
2491: /* module order spec */
2492:
2493: void create_modorder_spec(int id,LIST shift,struct modorder_spec **s)
2494: {
2495: struct modorder_spec *spec;
2496: NODE n,t;
2497: LIST list;
2498: int *ds;
2499: int i,l;
2500: Z q;
2501:
2502: *s = spec = (struct modorder_spec *)MALLOC(sizeof(struct modorder_spec));
2503: spec->id = id;
2504: if ( shift ) {
2505: n = BDY(shift);
2506: spec->len = l = length(n);
2507: spec->degree_shift = ds = (int *)MALLOC_ATOMIC(l*sizeof(int));
2508: for ( t = n, i = 0; t; t = NEXT(t), i++ )
1.2 noro 2509: ds[i] = ZTOS((Q)BDY(t));
1.1 noro 2510: } else {
2511: spec->len = 0;
2512: spec->degree_shift = 0;
2513: }
1.2 noro 2514: STOZ(id,q);
1.1 noro 2515: n = mknode(2,q,shift);
2516: MKLIST(list,n);
2517: spec->obj = (Obj)list;
2518: }
2519:
2520: /*
2521: * converters
2522: *
2523: */
2524:
2525: void dp_homo(DP p,DP *rp)
2526: {
2527: MP m,mr,mr0;
2528: int i,n,nv,td;
2529: DL dl,dlh;
2530:
2531: if ( !p )
2532: *rp = 0;
2533: else {
2534: n = p->nv; nv = n + 1;
2535: m = BDY(p); td = sugard(m);
2536: for ( mr0 = 0; m; m = NEXT(m) ) {
2537: NEXTMP(mr0,mr); mr->c = m->c;
2538: dl = m->dl;
2539: mr->dl = dlh = (DL)MALLOC_ATOMIC((nv+1)*sizeof(int));
2540: dlh->td = td;
2541: for ( i = 0; i < n; i++ )
2542: dlh->d[i] = dl->d[i];
2543: dlh->d[n] = td - dl->td;
2544: }
2545: NEXT(mr) = 0; MKDP(nv,mr0,*rp); (*rp)->sugar = p->sugar;
2546: }
2547: }
2548:
2549: void dp_dehomo(DP p,DP *rp)
2550: {
2551: MP m,mr,mr0;
2552: int i,n,nv;
2553: DL dl,dlh;
2554:
2555: if ( !p )
2556: *rp = 0;
2557: else {
2558: n = p->nv; nv = n - 1;
2559: m = BDY(p);
2560: for ( mr0 = 0; m; m = NEXT(m) ) {
2561: NEXTMP(mr0,mr); mr->c = m->c;
2562: dlh = m->dl;
2563: mr->dl = dl = (DL)MALLOC_ATOMIC((nv+1)*sizeof(int));
2564: dl->td = dlh->td - dlh->d[nv];
2565: for ( i = 0; i < nv; i++ )
2566: dl->d[i] = dlh->d[i];
2567: }
2568: NEXT(mr) = 0; MKDP(nv,mr0,*rp); (*rp)->sugar = p->sugar;
2569: }
2570: }
2571:
2572: void dp_mod(DP p,int mod,NODE subst,DP *rp)
2573: {
2574: MP m,mr,mr0;
2575: P t,s,s1;
2576: V v;
2577: NODE tn;
2578:
2579: if ( !p )
2580: *rp = 0;
2581: else {
2582: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
2583: for ( tn = subst, s = (P)m->c; tn; tn = NEXT(tn) ) {
2584: v = VR((P)BDY(tn)); tn = NEXT(tn);
2585: substp(CO,s,v,(P)BDY(tn),&s1); s = s1;
2586: }
2587: ptomp(mod,s,&t);
2588: if ( t ) {
2589: NEXTMP(mr0,mr); mr->c = (Obj)t; mr->dl = m->dl;
2590: }
2591: }
2592: if ( mr0 ) {
2593: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
2594: } else
2595: *rp = 0;
2596: }
2597: }
2598:
2599: void dp_rat(DP p,DP *rp)
2600: {
2601: MP m,mr,mr0;
2602:
2603: if ( !p )
2604: *rp = 0;
2605: else {
2606: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
2607: NEXTMP(mr0,mr); mptop((P)m->c,(P *)&mr->c); mr->dl = m->dl;
2608: }
2609: if ( mr0 ) {
2610: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
2611: } else
2612: *rp = 0;
2613: }
2614: }
2615:
2616:
2617: void homogenize_order(struct order_spec *old,int n,struct order_spec **newp)
2618: {
2619: struct order_pair *l;
2620: int length,nv,row,i,j;
2621: int **newm,**oldm;
2622: struct order_spec *new;
2623: int onv,nnv,nlen,olen,owlen;
2624: struct weight_or_block *owb,*nwb;
2625:
2626: *newp = new = (struct order_spec *)MALLOC(sizeof(struct order_spec));
2627: switch ( old->id ) {
2628: case 0:
2629: switch ( old->ord.simple ) {
2630: case 0:
2631: new->id = 0; new->ord.simple = 0; break;
2632: case 1:
2633: l = (struct order_pair *)
2634: MALLOC_ATOMIC(2*sizeof(struct order_pair));
2635: l[0].length = n; l[0].order = 1;
2636: l[1].length = 1; l[1].order = 2;
2637: new->id = 1;
2638: new->ord.block.order_pair = l;
2639: new->ord.block.length = 2; new->nv = n+1;
2640: break;
2641: case 2:
2642: new->id = 0; new->ord.simple = 1; break;
2643: case 3: case 4: case 5:
2644: new->id = 0; new->ord.simple = old->ord.simple+3;
2645: dp_nelim = n-1; break;
2646: case 6: case 7: case 8: case 9:
2647: new->id = 0; new->ord.simple = old->ord.simple; break;
2648: default:
2649: error("homogenize_order : invalid input");
2650: }
2651: break;
2652: case 1: case 257:
2653: length = old->ord.block.length;
2654: l = (struct order_pair *)
2655: MALLOC_ATOMIC((length+1)*sizeof(struct order_pair));
2656: bcopy((char *)old->ord.block.order_pair,(char *)l,length*sizeof(struct order_pair));
2657: l[length].order = 2; l[length].length = 1;
2658: new->id = old->id; new->nv = n+1;
2659: new->ord.block.order_pair = l;
2660: new->ord.block.length = length+1;
2661: new->ispot = old->ispot;
2662: break;
2663: case 2: case 258:
2664: nv = old->nv; row = old->ord.matrix.row;
2665: oldm = old->ord.matrix.matrix; newm = almat(row+1,nv+1);
2666: for ( i = 0; i <= nv; i++ )
2667: newm[0][i] = 1;
2668: for ( i = 0; i < row; i++ ) {
2669: for ( j = 0; j < nv; j++ )
2670: newm[i+1][j] = oldm[i][j];
2671: newm[i+1][j] = 0;
2672: }
2673: new->id = old->id; new->nv = nv+1;
2674: new->ord.matrix.row = row+1; new->ord.matrix.matrix = newm;
2675: new->ispot = old->ispot;
2676: break;
2677: case 3: case 259:
2678: onv = old->nv;
2679: nnv = onv+1;
2680: olen = old->ord.composite.length;
2681: nlen = olen+1;
2682: owb = old->ord.composite.w_or_b;
2683: nwb = (struct weight_or_block *)
2684: MALLOC(nlen*sizeof(struct weight_or_block));
2685: for ( i = 0; i < olen; i++ ) {
2686: nwb[i].type = owb[i].type;
2687: switch ( owb[i].type ) {
2688: case IS_DENSE_WEIGHT:
2689: owlen = owb[i].length;
2690: nwb[i].length = owlen+1;
2691: nwb[i].body.dense_weight = (int *)MALLOC((owlen+1)*sizeof(int));
2692: for ( j = 0; j < owlen; j++ )
2693: nwb[i].body.dense_weight[j] = owb[i].body.dense_weight[j];
2694: nwb[i].body.dense_weight[owlen] = 0;
2695: break;
2696: case IS_SPARSE_WEIGHT:
2697: nwb[i].length = owb[i].length;
2698: nwb[i].body.sparse_weight = owb[i].body.sparse_weight;
2699: break;
2700: case IS_BLOCK:
2701: nwb[i].length = owb[i].length;
2702: nwb[i].body.block = owb[i].body.block;
2703: break;
2704: }
2705: }
2706: nwb[i].type = IS_SPARSE_WEIGHT;
2707: nwb[i].body.sparse_weight =
2708: (struct sparse_weight *)MALLOC(sizeof(struct sparse_weight));
2709: nwb[i].body.sparse_weight[0].pos = onv;
2710: nwb[i].body.sparse_weight[0].value = 1;
2711: new->id = old->id;
2712: new->nv = nnv;
2713: new->ord.composite.length = nlen;
2714: new->ord.composite.w_or_b = nwb;
2715: new->ispot = old->ispot;
2716: print_composite_order_spec(new);
2717: break;
2718: case 256: /* simple module order */
2719: switch ( old->ord.simple ) {
2720: case 0:
2721: new->id = 256; new->ord.simple = 0; break;
2722: case 1:
2723: l = (struct order_pair *)
2724: MALLOC_ATOMIC(2*sizeof(struct order_pair));
2725: l[0].length = n; l[0].order = old->ord.simple;
2726: l[1].length = 1; l[1].order = 2;
2727: new->id = 257;
2728: new->ord.block.order_pair = l;
2729: new->ord.block.length = 2; new->nv = n+1;
2730: break;
2731: case 2:
2732: new->id = 256; new->ord.simple = 1; break;
2733: default:
2734: error("homogenize_order : invalid input");
2735: }
2736: new->ispot = old->ispot;
2737: break;
2738: default:
2739: error("homogenize_order : invalid input");
2740: }
2741: }
2742:
2743: int comp_nm(Q *a,Q *b)
2744: {
2745: Z z,nma,nmb;
2746:
2747: nmq(*a,&z); absz(z,&nma);
2748: nmq(*b,&z); absz(z,&nmb);
2749: return cmpz(nma,nmb);
2750: }
2751:
2752: void sortbynm(Q *w,int n)
2753: {
2754: qsort(w,n,sizeof(Q),(int (*)(const void *,const void *))comp_nm);
2755: }
2756:
2757:
2758: /*
2759: * simple operations
2760: *
2761: */
2762:
2763: int dp_redble(DP p1,DP p2)
2764: {
2765: int i,n;
2766: DL d1,d2;
2767:
2768: d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
2769: if ( d1->td < d2->td )
2770: return 0;
2771: else {
2772: for ( i = 0, n = p1->nv; i < n; i++ )
2773: if ( d1->d[i] < d2->d[i] )
2774: return 0;
2775: return 1;
2776: }
2777: }
2778:
2779: int dpm_redble(DPM p1,DPM p2)
2780: {
2781: int i,n;
2782: DL d1,d2;
2783:
2784: if ( BDY(p1)->pos != BDY(p2)->pos ) return 0;
2785: d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
2786: if ( d1->td < d2->td )
2787: return 0;
2788: else {
2789: for ( i = 0, n = p1->nv; i < n; i++ )
2790: if ( d1->d[i] < d2->d[i] )
2791: return 0;
2792: return 1;
2793: }
2794: }
2795:
2796:
2797: void dp_subd(DP p1,DP p2,DP *rp)
2798: {
2799: int i,n;
2800: DL d1,d2,d;
2801: MP m;
2802: DP s;
2803:
2804: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
2805: NEWDL(d,n); d->td = d1->td - d2->td;
2806: for ( i = 0; i < n; i++ )
2807: d->d[i] = d1->d[i]-d2->d[i];
2808: NEWMP(m); m->dl = d; m->c = (Obj)ONE; NEXT(m) = 0;
2809: MKDP(n,m,s); s->sugar = d->td;
2810: *rp = s;
2811: }
2812:
2813: void dltod(DL d,int n,DP *rp)
2814: {
2815: MP m;
2816: DP s;
2817:
2818: NEWMP(m); m->dl = d; m->c = (Obj)ONE; NEXT(m) = 0;
2819: MKDP(n,m,s); s->sugar = d->td;
2820: *rp = s;
2821: }
2822:
2823: void dp_hm(DP p,DP *rp)
2824: {
2825: MP m,mr;
2826:
2827: if ( !p )
2828: *rp = 0;
2829: else {
2830: m = BDY(p);
2831: NEWMP(mr); mr->dl = m->dl; mr->c = m->c; NEXT(mr) = 0;
2832: MKDP(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */
2833: }
2834: }
2835:
2836: void dp_ht(DP p,DP *rp)
2837: {
2838: MP m,mr;
2839:
2840: if ( !p )
2841: *rp = 0;
2842: else {
2843: m = BDY(p);
2844: NEWMP(mr); mr->dl = m->dl; mr->c = (Obj)ONE; NEXT(mr) = 0;
2845: MKDP(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */
2846: }
2847: }
2848:
2849: void dpm_hm(DPM p,DPM *rp)
2850: {
2851: DMM m,mr;
2852:
2853: if ( !p )
2854: *rp = 0;
2855: else {
2856: m = BDY(p);
2857: NEWDMM(mr); mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos; NEXT(mr) = 0;
2858: MKDPM(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */
2859: }
2860: }
2861:
2862: void dpm_ht(DPM p,DPM *rp)
2863: {
2864: DMM m,mr;
2865:
2866: if ( !p )
2867: *rp = 0;
2868: else {
2869: m = BDY(p);
2870: NEWDMM(mr); mr->dl = m->dl; mr->pos = m->pos; mr->c = (Obj)ONE; NEXT(mr) = 0;
2871: MKDPM(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */
2872: }
2873: }
2874:
2875:
2876: void dp_rest(DP p,DP *rp)
2877: {
2878: MP m;
2879:
2880: m = BDY(p);
2881: if ( !NEXT(m) )
2882: *rp = 0;
2883: else {
2884: MKDP(p->nv,NEXT(m),*rp);
2885: if ( *rp )
2886: (*rp)->sugar = p->sugar;
2887: }
2888: }
2889:
2890: void dpm_rest(DPM p,DPM *rp)
2891: {
2892: DMM m;
2893:
2894: m = BDY(p);
2895: if ( !NEXT(m) )
2896: *rp = 0;
2897: else {
2898: MKDPM(p->nv,NEXT(m),*rp);
2899: if ( *rp )
2900: (*rp)->sugar = p->sugar;
2901: }
2902: }
2903:
1.3 noro 2904: int dpm_getdeg(DPM p,int *r)
2905: {
2906: int max,n,i,rank;
2907: DMM m;
2908: int *d;
2909:
2910: if ( !p ) return 0;
2911: n = p->nv;
2912: max = 0;
2913: rank = 0;
2914: for ( m = BDY(p); m; m = NEXT(m) ) {
2915: d = m->dl->d;
2916: for ( i = 0; i < n; i++ )
2917: if ( d[i] > max ) max = d[i];
2918: rank = MAX(rank,m->pos);
2919: }
2920: *r = rank;
2921: return max;
2922: }
2923:
1.1 noro 2924: DL lcm_of_DL(int nv,DL dl1,DL dl2,DL dl)
2925: {
2926: register int i, *d1, *d2, *d, td;
2927:
2928: if ( !dl ) NEWDL(dl,nv);
2929: d = dl->d, d1 = dl1->d, d2 = dl2->d;
2930: for ( td = 0, i = 0; i < nv; d1++, d2++, d++, i++ ) {
2931: *d = *d1 > *d2 ? *d1 : *d2;
2932: td += MUL_WEIGHT(*d,i);
2933: }
2934: dl->td = td;
2935: return dl;
2936: }
2937:
2938: int dl_equal(int nv,DL dl1,DL dl2)
2939: {
2940: register int *d1, *d2, n;
2941:
2942: if ( dl1->td != dl2->td ) return 0;
2943: for ( d1 = dl1->d, d2 = dl2->d, n = nv; --n >= 0; d1++, d2++ )
2944: if ( *d1 != *d2 ) return 0;
2945: return 1;
2946: }
2947:
2948: int dp_nt(DP p)
2949: {
2950: int i;
2951: MP m;
2952:
2953: if ( !p )
2954: return 0;
2955: else {
2956: for ( i = 0, m = BDY(p); m; m = NEXT(m), i++ );
2957: return i;
2958: }
2959: }
2960:
2961: int dp_homogeneous(DP p)
2962: {
2963: MP m;
2964: int d;
2965:
2966: if ( !p )
2967: return 1;
2968: else {
2969: m = BDY(p);
2970: d = m->dl->td;
2971: m = NEXT(m);
2972: for ( ; m; m = NEXT(m) ) {
2973: if ( m->dl->td != d )
2974: return 0;
2975: }
2976: return 1;
2977: }
2978: }
2979:
2980: void _print_mp(int nv,MP m)
2981: {
2982: int i;
2983:
2984: if ( !m )
2985: return;
2986: for ( ; m; m = NEXT(m) ) {
1.3 noro 2987: fprintf(stderr,"%ld<",ITOS(C(m)));
1.1 noro 2988: for ( i = 0; i < nv; i++ ) {
2989: fprintf(stderr,"%d",m->dl->d[i]);
2990: if ( i != nv-1 )
2991: fprintf(stderr," ");
2992: }
1.3 noro 2993: fprintf(stderr,">");
1.1 noro 2994: }
2995: fprintf(stderr,"\n");
2996: }
2997:
2998: static int cmp_mp_nvar;
2999:
3000: int comp_mp(MP *a,MP *b)
3001: {
3002: return -(*cmpdl)(cmp_mp_nvar,(*a)->dl,(*b)->dl);
3003: }
3004:
3005: void dp_sort(DP p,DP *rp)
3006: {
3007: MP t,mp,mp0;
3008: int i,n;
3009: DP r;
3010: MP *w;
3011:
3012: if ( !p ) {
3013: *rp = 0;
3014: return;
3015: }
3016: for ( t = BDY(p), n = 0; t; t = NEXT(t), n++ );
3017: w = (MP *)ALLOCA(n*sizeof(MP));
3018: for ( t = BDY(p), i = 0; i < n; t = NEXT(t), i++ )
3019: w[i] = t;
3020: cmp_mp_nvar = NV(p);
3021: qsort(w,n,sizeof(MP),(int (*)(const void *,const void *))comp_mp);
3022: mp0 = 0;
3023: for ( i = n-1; i >= 0; i-- ) {
3024: NEWMP(mp); mp->dl = w[i]->dl; C(mp) = C(w[i]);
3025: NEXT(mp) = mp0; mp0 = mp;
3026: }
3027: MKDP(p->nv,mp0,r);
3028: r->sugar = p->sugar;
3029: *rp = r;
3030: }
3031:
3032: DP extract_initial_term_from_dp(DP p,int *weight,int n);
3033: LIST extract_initial_term(LIST f,int *weight,int n);
3034:
3035: DP extract_initial_term_from_dp(DP p,int *weight,int n)
3036: {
3037: int w,t,i,top;
3038: MP m,r0,r;
3039: DP dp;
3040:
3041: if ( !p ) return 0;
3042: top = 1;
3043: for ( m = BDY(p); m; m = NEXT(m) ) {
3044: for ( i = 0, t = 0; i < n; i++ )
3045: t += weight[i]*m->dl->d[i];
3046: if ( top || t > w ) {
3047: r0 = 0;
3048: w = t;
3049: top = 0;
3050: }
3051: if ( t == w ) {
3052: NEXTMP(r0,r);
3053: r->dl = m->dl;
3054: r->c = m->c;
3055: }
3056: }
3057: NEXT(r) = 0;
3058: MKDP(p->nv,r0,dp);
3059: return dp;
3060: }
3061:
3062: LIST extract_initial_term(LIST f,int *weight,int n)
3063: {
3064: NODE nd,r0,r;
3065: Obj p;
3066: LIST l;
3067:
3068: nd = BDY(f);
3069: for ( r0 = 0; nd; nd = NEXT(nd) ) {
3070: NEXTNODE(r0,r);
3071: p = (Obj)BDY(nd);
3072: BDY(r) = (pointer)extract_initial_term_from_dp((DP)p,weight,n);
3073: }
3074: if ( r0 ) NEXT(r) = 0;
3075: MKLIST(l,r0);
3076: return l;
3077: }
3078:
3079: LIST dp_initial_term(LIST f,struct order_spec *ord)
3080: {
3081: int n,l,i;
3082: struct weight_or_block *worb;
3083: int *weight;
3084:
3085: switch ( ord->id ) {
3086: case 2: /* matrix order */
3087: /* extract the first row */
3088: n = ord->nv;
3089: weight = ord->ord.matrix.matrix[0];
3090: return extract_initial_term(f,weight,n);
3091: case 3: /* composite order */
3092: /* the first w_or_b */
3093: worb = ord->ord.composite.w_or_b;
3094: switch ( worb->type ) {
3095: case IS_DENSE_WEIGHT:
3096: n = worb->length;
3097: weight = worb->body.dense_weight;
3098: return extract_initial_term(f,weight,n);
3099: case IS_SPARSE_WEIGHT:
3100: n = ord->nv;
3101: weight = (int *)ALLOCA(n*sizeof(int));
3102: for ( i = 0; i < n; i++ ) weight[i] = 0;
3103: l = worb->length;
3104: for ( i = 0; i < l; i++ )
3105: weight[worb->body.sparse_weight[i].pos]
3106: = worb->body.sparse_weight[i].value;
3107: return extract_initial_term(f,weight,n);
3108: default:
3109: error("dp_initial_term : unsupported order");
3110: }
3111: default:
3112: error("dp_initial_term : unsupported order");
3113: }
1.3 noro 3114: return 0;
1.1 noro 3115: }
3116:
3117: int highest_order_dp(DP p,int *weight,int n);
3118: LIST highest_order(LIST f,int *weight,int n);
3119:
3120: int highest_order_dp(DP p,int *weight,int n)
3121: {
3122: int w,t,i,top;
3123: MP m;
3124:
3125: if ( !p ) return -1;
3126: top = 1;
3127: for ( m = BDY(p); m; m = NEXT(m) ) {
3128: for ( i = 0, t = 0; i < n; i++ )
3129: t += weight[i]*m->dl->d[i];
3130: if ( top || t > w ) {
3131: w = t;
3132: top = 0;
3133: }
3134: }
3135: return w;
3136: }
3137:
3138: LIST highest_order(LIST f,int *weight,int n)
3139: {
3140: int h;
3141: NODE nd,r0,r;
3142: Obj p;
3143: LIST l;
3144: Z q;
3145:
3146: nd = BDY(f);
3147: for ( r0 = 0; nd; nd = NEXT(nd) ) {
3148: NEXTNODE(r0,r);
3149: p = (Obj)BDY(nd);
3150: h = highest_order_dp((DP)p,weight,n);
1.2 noro 3151: STOZ(h,q);
1.1 noro 3152: BDY(r) = (pointer)q;
3153: }
3154: if ( r0 ) NEXT(r) = 0;
3155: MKLIST(l,r0);
3156: return l;
3157: }
3158:
3159: LIST dp_order(LIST f,struct order_spec *ord)
3160: {
3161: int n,l,i;
3162: struct weight_or_block *worb;
3163: int *weight;
3164:
3165: switch ( ord->id ) {
3166: case 2: /* matrix order */
3167: /* extract the first row */
3168: n = ord->nv;
3169: weight = ord->ord.matrix.matrix[0];
3170: return highest_order(f,weight,n);
3171: case 3: /* composite order */
3172: /* the first w_or_b */
3173: worb = ord->ord.composite.w_or_b;
3174: switch ( worb->type ) {
3175: case IS_DENSE_WEIGHT:
3176: n = worb->length;
3177: weight = worb->body.dense_weight;
3178: return highest_order(f,weight,n);
3179: case IS_SPARSE_WEIGHT:
3180: n = ord->nv;
3181: weight = (int *)ALLOCA(n*sizeof(int));
3182: for ( i = 0; i < n; i++ ) weight[i] = 0;
3183: l = worb->length;
3184: for ( i = 0; i < l; i++ )
3185: weight[worb->body.sparse_weight[i].pos]
3186: = worb->body.sparse_weight[i].value;
3187: return highest_order(f,weight,n);
3188: default:
3189: error("dp_initial_term : unsupported order");
3190: }
3191: default:
3192: error("dp_initial_term : unsupported order");
3193: }
1.3 noro 3194: return 0;
1.1 noro 3195: }
3196:
3197: int dpv_ht(DPV p,DP *h)
3198: {
3199: int len,max,maxi,i,t;
3200: DP *e;
3201: MP m,mr;
3202:
3203: len = p->len;
3204: e = p->body;
3205: max = -1;
3206: maxi = -1;
3207: for ( i = 0; i < len; i++ )
3208: if ( e[i] && (t = BDY(e[i])->dl->td) > max ) {
3209: max = t;
3210: maxi = i;
3211: }
3212: if ( max < 0 ) {
3213: *h = 0;
3214: return -1;
3215: } else {
3216: m = BDY(e[maxi]);
3217: NEWMP(mr); mr->dl = m->dl; mr->c = (Obj)ONE; NEXT(mr) = 0;
3218: MKDP(e[maxi]->nv,mr,*h); (*h)->sugar = mr->dl->td; /* XXX */
3219: return maxi;
3220: }
3221: }
3222:
3223: /* return 1 if 0 <_w1 v && v <_w2 0 */
3224:
3225: int in_c12(int n,int *v,int row1,int **w1,int row2, int **w2)
3226: {
3227: int t1,t2;
3228:
3229: t1 = compare_zero(n,v,row1,w1);
3230: t2 = compare_zero(n,v,row2,w2);
3231: if ( t1 > 0 && t2 < 0 ) return 1;
3232: else return 0;
3233: }
3234:
3235: /* 0 < u => 1, 0 > u => -1 */
3236:
3237: int compare_zero(int n,int *u,int row,int **w)
3238: {
3239: int i,j,t;
3240: int *wi;
3241:
3242: for ( i = 0; i < row; i++ ) {
3243: wi = w[i];
3244: for ( j = 0, t = 0; j < n; j++ ) t += u[j]*wi[j];
3245: if ( t > 0 ) return 1;
3246: else if ( t < 0 ) return -1;
3247: }
3248: return 0;
3249: }
3250:
3251: /* functions for generic groebner walk */
3252: /* u=0 means u=-infty */
3253:
3254: int compare_facet_preorder(int n,int *u,int *v,
3255: int row1,int **w1,int row2,int **w2)
3256: {
3257: int i,j,s,t,tu,tv;
3258: int *w2i,*uv;
3259:
3260: if ( !u ) return 1;
3261: uv = W_ALLOC(n);
3262: for ( i = 0; i < row2; i++ ) {
3263: w2i = w2[i];
3264: for ( j = 0, tu = tv = 0; j < n; j++ )
1.3 noro 3265: if ( (s = w2i[j]) != 0 ) {
1.1 noro 3266: tu += s*u[j]; tv += s*v[j];
3267: }
3268: for ( j = 0; j < n; j++ ) uv[j] = u[j]*tv-v[j]*tu;
3269: t = compare_zero(n,uv,row1,w1);
3270: if ( t > 0 ) return 1;
3271: else if ( t < 0 ) return 0;
3272: }
3273: return 1;
3274: }
3275:
3276: Q inner_product_with_small_vector(VECT w,int *v)
3277: {
3278: int n,i;
3279: Z q;
3280: Q s,t,u;
3281:
3282: n = w->len;
3283: s = 0;
3284: for ( i = 0; i < n; i++ ) {
1.2 noro 3285: STOZ(v[i],q); mulq((Q)w->body[i],(Q)q,&t); addq(t,s,&u); s = u;
1.1 noro 3286: }
3287: return s;
3288: }
3289:
3290: Q compute_last_t(NODE g,NODE gh,Q t,VECT w1,VECT w2,NODE *homo,VECT *wp)
3291: {
3292: int n,i;
3293: int *wt;
3294: Q last,d1,d2,dn,nm,s,t1;
3295: VECT wd,wt1,wt2,w;
3296: NODE tg,tgh;
3297: MP f;
3298: int *h;
3299: NODE r0,r;
3300: MP m0,m;
3301: DP d;
3302:
3303: n = w1->len;
3304: wt = W_ALLOC(n);
3305: last = (Q)ONE;
3306: /* t1 = 1-t */
3307: for ( tg = g, tgh = gh; tg; tg = NEXT(tg), tgh = NEXT(tgh ) ) {
3308: f = BDY((DP)BDY(tg));
3309: h = BDY((DP)BDY(tgh))->dl->d;
3310: for ( ; f; f = NEXT(f) ) {
3311: for ( i = 0; i < n; i++ ) wt[i] = h[i]-f->dl->d[i];
3312: for ( i = 0; i < n && !wt[i]; i++ );
3313: if ( i == n ) continue;
3314: d1 = inner_product_with_small_vector(w1,wt);
3315: d2 = inner_product_with_small_vector(w2,wt);
3316: nm = d1; subq(d1,d2,&dn);
3317: /* if d1=d2 then nothing happens */
3318: if ( !dn ) continue;
3319: /* s satisfies ds = 0*/
3320: divq(nm,dn,&s);
3321:
3322: if ( cmpq(s,t) > 0 && cmpq(s,last) < 0 )
3323: last = s;
3324: else if ( !cmpq(s,t) ) {
3325: if ( cmpq(d2,0) < 0 ) {
3326: last = t;
3327: break;
3328: }
3329: }
3330: }
3331: }
3332: nmq(last,(Z *)&nm);
3333: dnq(last,(Z *)&dn);
3334: /* (1-n/d)*w1+n/d*w2 -> w=(d-n)*w1+n*w2 */
3335: subq(dn,nm,&t1); mulvect(CO,(Obj)w1,(Obj)t1,(Obj *)&wt1);
3336: mulvect(CO,(Obj)w2,(Obj)nm,(Obj *)&wt2); addvect(CO,wt1,wt2,&w);
3337:
3338: r0 = 0;
3339: for ( tg = g, tgh = gh; tg; tg = NEXT(tg), tgh = NEXT(tgh ) ) {
3340: f = BDY((DP)BDY(tg));
3341: h = BDY((DP)BDY(tgh))->dl->d;
3342: for ( m0 = 0; f; f = NEXT(f) ) {
3343: for ( i = 0; i < n; i++ ) wt[i] = h[i]-f->dl->d[i];
3344: for ( i = 0; i < n && !wt[i]; i++ );
3345: if ( !inner_product_with_small_vector(w,wt) ) {
3346: NEXTMP(m0,m); m->c = f->c; m->dl = f->dl;
3347: }
3348: }
3349: NEXT(m) = 0;
3350: MKDP(((DP)BDY(tg))->nv,m0,d); d->sugar = ((DP)BDY(tg))->sugar;
3351: NEXTNODE(r0,r); BDY(r) = (pointer)d;
3352: }
3353: NEXT(r) = 0;
3354: *homo = r0;
3355: *wp = w;
3356: return last;
3357: }
3358:
3359: /* return 0 if last_w = infty */
3360:
3361: NODE compute_last_w(NODE g,NODE gh,int n,int **w,
3362: int row1,int **w1,int row2,int **w2)
3363: {
3364: DP d;
3365: MP f,m0,m;
3366: int *wt,*v,*h;
3367: NODE t,s,n0,tn,n1,r0,r;
3368: int i;
3369:
3370: wt = W_ALLOC(n);
3371: n0 = 0;
3372: for ( t = g, s = gh; t; t = NEXT(t), s = NEXT(s) ) {
3373: f = BDY((DP)BDY(t));
3374: h = BDY((DP)BDY(s))->dl->d;
3375: for ( ; f; f = NEXT(f) ) {
3376: for ( i = 0; i < n; i++ ) wt[i] = h[i]-f->dl->d[i];
3377: for ( i = 0; i < n && !wt[i]; i++ );
3378: if ( i == n ) continue;
3379:
3380: if ( in_c12(n,wt,row1,w1,row2,w2) &&
3381: compare_facet_preorder(n,*w,wt,row1,w1,row2,w2) ) {
3382: v = (int *)MALLOC_ATOMIC(n*sizeof(int));
3383: for ( i = 0; i < n; i++ ) v[i] = wt[i];
3384: MKNODE(n1,v,n0); n0 = n1;
3385: }
3386: }
3387: }
3388: if ( !n0 ) return 0;
3389: for ( t = n0; t; t = NEXT(t) ) {
3390: v = (int *)BDY(t);
3391: for ( s = n0; s; s = NEXT(s) )
3392: if ( !compare_facet_preorder(n,v,(int *)BDY(s),row1,w1,row2,w2) )
3393: break;
3394: if ( !s ) {
3395: *w = v;
3396: break;
3397: }
3398: }
3399: if ( !t )
3400: error("compute_last_w : cannot happen");
3401: r0 = 0;
3402: for ( t = g, s = gh; t; t = NEXT(t), s = NEXT(s) ) {
3403: f = BDY((DP)BDY(t));
3404: h = BDY((DP)BDY(s))->dl->d;
3405: for ( m0 = 0; f; f = NEXT(f) ) {
3406: for ( i = 0; i < n; i++ ) wt[i] = h[i]-f->dl->d[i];
3407: for ( i = 0; i < n && !wt[i]; i++ );
3408: if ( i == n ||
3409: (compare_facet_preorder(n,wt,*w,row1,w1,row2,w2)
3410: && compare_facet_preorder(n,*w,wt,row1,w1,row2,w2)) ) {
3411: NEXTMP(m0,m); m->c = f->c; m->dl = f->dl;
3412: }
3413: }
3414: NEXT(m) = 0;
3415: MKDP(((DP)BDY(t))->nv,m0,d); d->sugar = ((DP)BDY(t))->sugar;
3416: NEXTNODE(r0,r); BDY(r) = (pointer)d;
3417: }
3418: NEXT(r) = 0;
3419: return r0;
3420: }
3421:
3422: /* compute a sufficient set of d(f)=u-v */
3423:
3424: NODE compute_essential_df(DP *g,DP *gh,int ng)
3425: {
3426: int nv,i,j,k,t,lj;
3427: NODE r,r1,ri,rt,r0;
3428: MP m;
3429: MP *mj;
3430: DL di,hj,dl,dlt;
3431: int *d,*dt;
3432: LIST l;
3433: Z q;
3434:
3435: nv = g[0]->nv;
3436: r = 0;
3437: for ( j = 0; j < ng; j++ ) {
3438: for ( m = BDY(g[j]), lj = 0; m; m = NEXT(m), lj++ );
3439: mj = (MP *)ALLOCA(lj*sizeof(MP));
3440: for ( m = BDY(g[j]), k = 0; m; m = NEXT(m), k++ )
3441: mj[k] = m;
3442: for ( i = 0; i < lj; i++ ) {
3443: for ( di = mj[i]->dl, k = i+1; k < lj; k++ )
3444: if ( _dl_redble(di,mj[k]->dl,nv) ) break;
3445: if ( k < lj ) mj[i] = 0;
3446: }
3447: hj = BDY(gh[j])->dl;
3448: _NEWDL(dl,nv); d = dl->d;
3449: r0 = r;
3450: for ( i = 0; i < lj; i++ ) {
3451: if ( mj[i] && !dl_equal(nv,di=mj[i]->dl,hj) ) {
3452: for ( k = 0, t = 0; k < nv; k++ ) {
3453: d[k] = hj->d[k]-di->d[k];
3454: t += d[k];
3455: }
3456: dl->td = t;
3457: #if 1
3458: for ( rt = r0; rt; rt = NEXT(rt) ) {
3459: dlt = (DL)BDY(rt);
3460: if ( dlt->td != dl->td ) continue;
3461: for ( dt = dlt->d, k = 0; k < nv; k++ )
3462: if ( d[k] != dt[k] ) break;
3463: if ( k == nv ) break;
3464: }
3465: #else
3466: rt = 0;
3467: #endif
3468: if ( !rt ) {
3469: MKNODE(r1,dl,r); r = r1;
3470: _NEWDL(dl,nv); d = dl->d;
3471: }
3472: }
3473: }
3474: }
3475: for ( rt = r; rt; rt = NEXT(rt) ) {
3476: dl = (DL)BDY(rt); d = dl->d;
3477: ri = 0;
3478: for ( k = nv-1; k >= 0; k-- ) {
1.2 noro 3479: STOZ(d[k],q);
1.1 noro 3480: MKNODE(r1,q,ri); ri = r1;
3481: }
3482: MKNODE(r1,0,ri); MKLIST(l,r1);
3483: BDY(rt) = (pointer)l;
3484: }
3485: return r;
3486: }
3487:
3488: int comp_bits_divisible(int *a,int *b,int n)
3489: {
3490: int bpi,i,wi,bi;
3491:
3492: bpi = (sizeof(int)/sizeof(char))*8;
3493: for ( i = 0; i < n; i++ ) {
3494: wi = i/bpi; bi = i%bpi;
3495: if ( !(a[wi]&(1<<bi)) && (b[wi]&(1<<bi)) ) return 0;
3496: }
3497: return 1;
3498: }
3499:
3500: int comp_bits_lex(int *a,int *b,int n)
3501: {
3502: int bpi,i,wi,ba,bb,bi;
3503:
3504: bpi = (sizeof(int)/sizeof(char))*8;
3505: for ( i = 0; i < n; i++ ) {
3506: wi = i/bpi; bi = i%bpi;
3507: ba = (a[wi]&(1<<bi))?1:0;
3508: bb = (b[wi]&(1<<bi))?1:0;
3509: if ( ba > bb ) return 1;
3510: else if ( ba < bb ) return -1;
3511: }
3512: return 0;
3513: }
3514:
3515: NODE mono_raddec(NODE ideal)
3516: {
3517: DP p;
3518: int nv,w,i,bpi,di,c,len;
3519: int *d,*s,*u,*new;
3520: NODE t,t1,v,r,rem,prev;
3521:
3522: if( !ideal ) return 0;
3523: p = (DP)BDY(ideal);
3524: nv = NV(p);
3525: bpi = (sizeof(int)/sizeof(char))*8;
3526: w = (nv+(bpi-1))/bpi;
3527: d = p->body->dl->d;
3528: if ( !NEXT(ideal) ) {
3529: for ( t = 0, i = nv-1; i >= 0; i-- ) {
3530: if ( d[i] ) {
3531: s = (int *)CALLOC(w,sizeof(int));
3532: s[i/bpi] |= 1<<(i%bpi);
3533: MKNODE(t1,s,t);
3534: t = t1;
3535: }
3536: }
3537: return t;
3538: }
3539: rem = mono_raddec(NEXT(ideal));
3540: r = 0;
3541: len = w*sizeof(int);
3542: u = (int *)CALLOC(w,sizeof(int));
3543: for ( i = nv-1; i >= 0; i-- ) {
3544: if ( d[i] ) {
3545: for ( t = rem; t; t = NEXT(t) ) {
3546: bcopy((char *)BDY(t),(char *)u,len);
3547: u[i/bpi] |= 1<<(i%bpi);
3548: for ( v = r; v; v = NEXT(v) ) {
3549: if ( comp_bits_divisible(u,(int *)BDY(v),nv) ) break;
3550: }
3551: if ( v ) continue;
3552: for ( v = r, prev = 0; v; v = NEXT(v) ) {
3553: if ( comp_bits_divisible((int *)BDY(v),u,nv) ) {
3554: if ( prev ) NEXT(prev) = NEXT(v);
3555: else r = NEXT(r);
3556: } else prev =v;
3557: }
3558: for ( v = r, prev = 0; v; prev = v, v = NEXT(v) ) {
3559: if ( comp_bits_lex(u,(int *)BDY(v),nv) < 0 ) break;
3560: }
3561: new = (int *)CALLOC(w,sizeof(int));
3562: bcopy((char *)u,(char *)new,len);
3563: MKNODE(t1,new,v);
3564: if ( prev ) NEXT(prev) = t1;
3565: else r = t1;
3566: }
3567: }
3568: }
3569: return r;
3570: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>