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