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