Annotation of OpenXM_contrib2/asir2018/builtin/dp-supp.c, Revision 1.13
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.13 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2018/builtin/dp-supp.c,v 1.12 2019/12/12 04:44:59 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;
1.12 noro 1896: nv = ps[i]->nv;
1.9 noro 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:
1.13 ! noro 1964: DPM dpm_sp_nf_zlist(VECT psv,VECT psiv,int i,int j,int top,DPM *nf)
1.11 noro 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;
1.12 noro 1977: nv = ps[i]->nv;
1.11 noro 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;
1.13 ! noro 2026: } else if ( !top ) {
1.11 noro 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;
1.13 ! noro 2031: } else {
1.12 noro 2032: *nf = g;
2033: if ( mq0 ) {
2034: NEXT(mq) = 0; MKDPM(nv,mq0,q); q->sugar = sugar;
2035: } else
2036: q = 0;
2037: return q;
1.11 noro 2038: }
2039: }
2040: last:
2041: if ( mr0 ) {
2042: NEXT(mr) = 0; MKDPM(nv,mr0,d); d->sugar = sugar;
2043: } else
2044: d = 0;
2045: NEXT(mq) = 0; MKDPM(nv,mq0,q); q->sugar = sugar;
2046: *nf = d;
2047: return q;
2048: }
2049:
1.1 noro 2050: DP *dp_true_nf_and_quotient_marked_mod(NODE b,DP g,DP *ps,DP *hps,int mod,DP *rp,P *dnp)
2051: {
2052: DP u,p,d,s,t,dmy,hp,mult;
2053: DP *q;
2054: NODE l;
2055: MP m,mr;
2056: int i,n,j;
2057: int *wb;
2058: int sugar,psugar;
2059: P dn,tdn,tdn1;
2060:
2061: for ( n = 0, l = b; l; l = NEXT(l), n++ );
2062: q = (DP *)MALLOC(n*sizeof(DP));
2063: for ( i = 0; i < n; i++ ) q[i] = 0;
2064: dn = (P)ONEM;
2065: if ( !g ) {
2066: *rp = 0; *dnp = dn; return 0;
2067: }
2068: wb = (int *)ALLOCA(n*sizeof(int));
2069: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 2070: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 2071: sugar = g->sugar;
2072: for ( d = 0; g; ) {
2073: for ( u = 0, i = 0; i < n; i++ ) {
2074: if ( dp_redble(g,hp = hps[wb[i]]) ) {
2075: p = ps[wb[i]];
2076: dp_red_marked_mod(d,g,p,hp,mod,&t,&u,&tdn,&mult);
2077: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
2078: sugar = MAX(sugar,psugar);
2079: for ( j = 0; j < n; j++ ) {
2080: mulmdc(CO,mod,q[j],(P)tdn,&dmy); q[j] = dmy;
2081: }
2082: addmd(CO,mod,q[wb[i]],mult,&dmy); q[wb[i]] = dmy;
2083: mulmp(CO,mod,dn,tdn,&tdn1); dn = tdn1;
2084: d = t;
2085: if ( !u ) goto last;
2086: break;
2087: }
2088: }
2089: if ( u )
2090: g = u;
2091: else {
2092: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
2093: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
2094: addmd(CO,mod,d,t,&s); d = s;
2095: dp_rest(g,&t); g = t;
2096: }
2097: }
2098: last:
2099: if ( d )
2100: d->sugar = sugar;
2101: *rp = d; *dnp = dn;
2102: return q;
2103: }
2104:
2105: /* nf computation over Z */
2106:
2107: void dp_nf_z(NODE b,DP g,DP *ps,int full,int multiple,DP *rp)
2108: {
2109: DP u,p,d,s,t,dmy1;
2110: P dmy;
2111: NODE l;
2112: MP m,mr;
2113: int i,n;
2114: int *wb;
2115: int hmag;
2116: int sugar,psugar;
2117:
2118: if ( !g ) {
2119: *rp = 0; return;
2120: }
2121: for ( n = 0, l = b; l; l = NEXT(l), n++ );
2122: wb = (int *)ALLOCA(n*sizeof(int));
2123: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 2124: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 2125:
2126: hmag = multiple*HMAG(g);
2127: sugar = g->sugar;
2128:
2129: for ( d = 0; g; ) {
2130: for ( u = 0, i = 0; i < n; i++ ) {
2131: if ( dp_redble(g,p = ps[wb[i]]) ) {
2132: dp_red(d,g,p,&t,&u,&dmy,&dmy1);
2133: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
2134: sugar = MAX(sugar,psugar);
2135: if ( !u ) {
2136: if ( d )
2137: d->sugar = sugar;
2138: *rp = d; return;
2139: }
2140: d = t;
2141: break;
2142: }
2143: }
2144: if ( u ) {
2145: g = u;
2146: if ( d ) {
2147: if ( multiple && HMAG(d) > hmag ) {
2148: dp_ptozp2(d,g,&t,&u); d = t; g = u;
2149: hmag = multiple*HMAG(d);
2150: }
2151: } else {
2152: if ( multiple && HMAG(g) > hmag ) {
2153: dp_ptozp(g,&t); g = t;
2154: hmag = multiple*HMAG(g);
2155: }
2156: }
2157: }
2158: else if ( !full ) {
2159: if ( g ) {
2160: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
2161: }
2162: *rp = g; return;
2163: } else {
2164: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
2165: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
2166: addd(CO,d,t,&s); d = s;
2167: dp_rest(g,&t); g = t;
2168:
2169: }
2170: }
2171: if ( d )
2172: d->sugar = sugar;
2173: *rp = d;
2174: }
2175:
1.4 noro 2176: void dpm_nf_z(NODE b,DPM g,VECT psv,int full,int multiple,DPM *rp)
1.1 noro 2177: {
1.4 noro 2178: DPM *ps;
1.1 noro 2179: DPM u,p,d,s,t;
2180: DP dmy1;
2181: P dmy;
1.3 noro 2182: Z cont;
1.1 noro 2183: NODE l;
2184: DMM m,mr;
2185: int i,n;
2186: int *wb;
2187: int hmag;
2188: int sugar,psugar;
2189:
2190: if ( !g ) {
2191: *rp = 0; return;
2192: }
1.4 noro 2193: if ( b ) {
2194: for ( n = 0, l = b; l; l = NEXT(l), n++ );
2195: wb = (int *)ALLOCA(n*sizeof(int));
2196: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
2197: wb[i] = ZTOS((Q)BDY(l));
2198: ps = (DPM *)BDY(psv);
2199: } else {
2200: n = psv->len;
2201: wb = (int *)MALLOC(n*sizeof(int));
2202: for ( i = 0; i < n; i++ ) wb[i] = i;
2203: ps = (DPM *)BDY(psv);
2204: }
1.1 noro 2205:
2206: hmag = multiple*HMAG(g);
2207: sugar = g->sugar;
2208:
2209: for ( d = 0; g; ) {
2210: for ( u = 0, i = 0; i < n; i++ ) {
1.4 noro 2211: if ( (p=ps[wb[i]])!=0 && dpm_redble(g,p) ) {
1.5 noro 2212: dpm_red2(g,p,&u,&dmy,&dmy1);
1.1 noro 2213: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
2214: sugar = MAX(sugar,psugar);
1.5 noro 2215: if ( d ) mulcdmm((Obj)dmy,BDY(d));
1.1 noro 2216: if ( !u ) {
2217: if ( d )
2218: d->sugar = sugar;
2219: *rp = d; return;
2220: }
2221: break;
2222: }
2223: }
2224: if ( u ) {
2225: g = u;
2226: if ( d ) {
2227: if ( multiple && HMAG(d) > hmag ) {
2228: dpm_ptozp2(d,g,&t,&u); d = t; g = u;
2229: hmag = multiple*HMAG(d);
2230: }
2231: } else {
2232: if ( multiple && HMAG(g) > hmag ) {
1.3 noro 2233: dpm_ptozp(g,&cont,&t); g = t;
1.1 noro 2234: hmag = multiple*HMAG(g);
2235: }
2236: }
2237: }
2238: else if ( !full ) {
2239: if ( g ) {
2240: MKDPM(g->nv,BDY(g),t); t->sugar = sugar; g = t;
2241: }
2242: *rp = g; return;
2243: } else {
2244: m = BDY(g); NEWDMM(mr); mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos;
2245: NEXT(mr) = 0; MKDPM(g->nv,mr,t); t->sugar = mr->dl->td;
1.5 noro 2246: d = appenddpm(d,t);
1.1 noro 2247: dpm_rest(g,&t); g = t;
2248: }
2249: }
2250: if ( d )
2251: d->sugar = sugar;
2252: *rp = d;
2253: }
2254:
1.3 noro 2255: void dpm_shift(DPM p,int s,DPM *r)
2256: {
2257: DMM m,mr0,mr;
2258: DPM t;
2259:
2260: if ( !p ) *r = 0;
2261: else {
2262: for ( m = BDY(p), mr0 = 0; m; m = NEXT(m) ) {
2263: NEXTDMM(mr0,mr);
2264: mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos-s;
2265: if ( mr->pos <= 0 )
2266: error("dpm_shift : too large shift value");
2267: }
2268: NEXT(mr) = 0;
2269: MKDPM(p->nv,mr0,t); t->sugar = p->sugar;
2270: *r = t;
2271: }
2272: }
2273:
2274: // up=sum{c*<<...:i>>|i<=s}, lo=sum{c*<<...:i>>|i>s}
2275:
2276: void dpm_split(DPM p,int s,DPM *up,DPM *lo)
2277: {
2278: DMM m,mu0,mu,ml0,ml;
2279: DPM t;
2280:
2281: if ( !p ) {
2282: *up = 0; *lo = 0;
2283: } else {
2284: for ( m = BDY(p), mu0 = ml0 = 0; m; m = NEXT(m) ) {
2285: if ( m->pos <= s ) {
2286: NEXTDMM(mu0,mu);
2287: mu->dl = m->dl; mu->c = m->c; mu->pos = m->pos;
2288: } else {
2289: NEXTDMM(ml0,ml);
2290: ml->dl = m->dl; ml->c = m->c; ml->pos = m->pos;
2291: }
2292: }
2293: if ( mu0 ) {
2294: NEXT(mu) = 0; MKDPM(p->nv,mu0,t); t->sugar = p->sugar;
2295: *up = t;
2296: } else
2297: *up = 0;
2298: if ( ml0 ) {
2299: NEXT(ml) = 0; MKDPM(p->nv,ml0,t); t->sugar = p->sugar;
2300: *lo = t;
2301: } else
2302: *lo = 0;
2303: }
2304: }
2305:
1.13 ! noro 2306: /* extract the component in DP of position s */
! 2307: void dpm_extract(DPM p,int s,DP *r)
! 2308: {
! 2309: DMM m;
! 2310: MP mu0,mu;
! 2311: DP t;
! 2312:
! 2313: if ( !p ) {
! 2314: *r = 0; return;
! 2315: }
! 2316: for ( m = BDY(p), mu0 = 0; m; m = NEXT(m) ) {
! 2317: if ( m->pos == s ) {
! 2318: NEXTMP(mu0,mu);
! 2319: mu->dl = m->dl; mu->c = m->c;
! 2320: }
! 2321: }
! 2322: if ( mu0 ) {
! 2323: NEXT(mu) = 0; MKDP(p->nv,mu0,t); t->sugar = p->sugar;
! 2324: *r = t;
! 2325: } else
! 2326: *r = 0;
! 2327: }
! 2328:
1.1 noro 2329: /* nf computation over a field */
2330:
2331: void dp_nf_f(NODE b,DP g,DP *ps,int full,DP *rp)
2332: {
2333: DP u,p,d,s,t;
2334: NODE l;
2335: MP m,mr;
2336: int i,n;
2337: int *wb;
2338: int sugar,psugar;
2339:
2340: if ( !g ) {
2341: *rp = 0; return;
2342: }
2343: for ( n = 0, l = b; l; l = NEXT(l), n++ );
2344: wb = (int *)ALLOCA(n*sizeof(int));
2345: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 2346: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 2347:
2348: sugar = g->sugar;
2349: for ( d = 0; g; ) {
2350: for ( u = 0, i = 0; i < n; i++ ) {
2351: if ( dp_redble(g,p = ps[wb[i]]) ) {
2352: dp_red_f(g,p,&u);
2353: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
2354: sugar = MAX(sugar,psugar);
2355: if ( !u ) {
2356: if ( d )
2357: d->sugar = sugar;
2358: *rp = d; return;
2359: }
2360: break;
2361: }
2362: }
2363: if ( u )
2364: g = u;
2365: else if ( !full ) {
2366: if ( g ) {
2367: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
2368: }
2369: *rp = g; return;
2370: } else {
2371: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
2372: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
2373: addd(CO,d,t,&s); d = s;
2374: dp_rest(g,&t); g = t;
2375: }
2376: }
2377: if ( d )
2378: d->sugar = sugar;
2379: *rp = d;
2380: }
2381:
1.4 noro 2382: void dpm_nf_f(NODE b,DPM g,VECT psv,int full,DPM *rp)
1.1 noro 2383: {
1.4 noro 2384: DPM *ps;
1.1 noro 2385: DPM u,p,d,s,t;
2386: NODE l;
2387: DMM m,mr;
2388: int i,n;
2389: int *wb;
2390: int sugar,psugar;
2391:
2392: if ( !g ) {
2393: *rp = 0; return;
2394: }
1.4 noro 2395: if ( b ) {
2396: for ( n = 0, l = b; l; l = NEXT(l), n++ );
2397: wb = (int *)ALLOCA(n*sizeof(int));
2398: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
2399: wb[i] = ZTOS((Q)BDY(l));
2400: ps = (DPM *)BDY(psv);
2401: } else {
2402: n = psv->len;
2403: wb = (int *)MALLOC(n*sizeof(int));
2404: for ( i = 0; i < n; i++ ) wb[i] = i;
2405: ps = (DPM *)BDY(psv);
2406: }
1.1 noro 2407:
2408: sugar = g->sugar;
2409: for ( d = 0; g; ) {
2410: for ( u = 0, i = 0; i < n; i++ ) {
1.4 noro 2411: if ( ( (p=ps[wb[i]]) != 0 ) && dpm_redble(g,p) ) {
1.1 noro 2412: dpm_red_f(g,p,&u);
2413: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
2414: sugar = MAX(sugar,psugar);
2415: if ( !u ) {
2416: if ( d )
2417: d->sugar = sugar;
2418: *rp = d; return;
2419: }
2420: break;
2421: }
2422: }
2423: if ( u )
2424: g = u;
2425: else if ( !full ) {
2426: if ( g ) {
2427: MKDPM(g->nv,BDY(g),t); t->sugar = sugar; g = t;
2428: }
2429: *rp = g; return;
2430: } else {
2431: m = BDY(g); NEWDMM(mr); mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos;
2432: NEXT(mr) = 0; MKDPM(g->nv,mr,t); t->sugar = mr->dl->td;
2433: adddpm(CO,d,t,&s); d = s;
2434: dpm_rest(g,&t); g = t;
2435: }
2436: }
2437: if ( d )
2438: d->sugar = sugar;
2439: *rp = d;
2440: }
2441:
2442: /* nf computation over GF(mod) (only for internal use) */
2443:
2444: void dp_nf_mod(NODE b,DP g,DP *ps,int mod,int full,DP *rp)
2445: {
2446: DP u,p,d,s,t;
2447: P dmy;
2448: NODE l;
2449: MP m,mr;
2450: int sugar,psugar;
2451:
2452: if ( !g ) {
2453: *rp = 0; return;
2454: }
2455: sugar = g->sugar;
2456: for ( d = 0; g; ) {
2457: for ( u = 0, l = b; l; l = NEXT(l) ) {
2458: if ( dp_redble(g,p = ps[(long)BDY(l)]) ) {
2459: dp_red_mod(d,g,p,mod,&t,&u,&dmy);
2460: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
2461: sugar = MAX(sugar,psugar);
2462: if ( !u ) {
2463: if ( d )
2464: d->sugar = sugar;
2465: *rp = d; return;
2466: }
2467: d = t;
2468: break;
2469: }
2470: }
2471: if ( u )
2472: g = u;
2473: else if ( !full ) {
2474: if ( g ) {
2475: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
2476: }
2477: *rp = g; return;
2478: } else {
2479: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
2480: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
2481: addmd(CO,mod,d,t,&s); d = s;
2482: dp_rest(g,&t); g = t;
2483: }
2484: }
2485: if ( d )
2486: d->sugar = sugar;
2487: *rp = d;
2488: }
2489:
2490: void dp_true_nf_mod(NODE b,DP g,DP *ps,int mod,int full,DP *rp,P *dnp)
2491: {
2492: DP u,p,d,s,t;
2493: NODE l;
2494: MP m,mr;
2495: int i,n;
2496: int *wb;
2497: int sugar,psugar;
2498: P dn,tdn,tdn1;
2499:
2500: dn = (P)ONEM;
2501: if ( !g ) {
2502: *rp = 0; *dnp = dn; return;
2503: }
1.3 noro 2504: for ( n = 0, l = b; l; l = NEXT(l), n++ )
2505: ;
2506: wb = (int *)ALLOCA(n*sizeof(int));
1.1 noro 2507: for ( i = 0, l = b; i < n; l = NEXT(l), i++ )
1.2 noro 2508: wb[i] = ZTOS((Q)BDY(l));
1.1 noro 2509: sugar = g->sugar;
2510: for ( d = 0; g; ) {
2511: for ( u = 0, i = 0; i < n; i++ ) {
2512: if ( dp_redble(g,p = ps[wb[i]]) ) {
2513: dp_red_mod(d,g,p,mod,&t,&u,&tdn);
2514: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
2515: sugar = MAX(sugar,psugar);
2516: if ( !u ) {
2517: if ( d )
2518: d->sugar = sugar;
2519: *rp = d; *dnp = dn; return;
2520: } else {
2521: d = t;
2522: mulmp(CO,mod,dn,tdn,&tdn1); dn = tdn1;
2523: }
2524: break;
2525: }
2526: }
2527: if ( u )
2528: g = u;
2529: else if ( !full ) {
2530: if ( g ) {
2531: MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;
2532: }
2533: *rp = g; *dnp = dn; return;
2534: } else {
2535: m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;
2536: NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;
2537: addmd(CO,mod,d,t,&s); d = s;
2538: dp_rest(g,&t); g = t;
2539: }
2540: }
2541: if ( d )
2542: d->sugar = sugar;
2543: *rp = d; *dnp = dn;
2544: }
2545:
2546: void _dp_nf_mod_destructive(NODE b,DP g,DP *ps,int mod,int full,DP *rp)
2547: {
2548: DP u,p,d;
2549: NODE l;
2550: MP m,mrd;
2551: int sugar,psugar,n,h_reducible;
2552:
2553: if ( !g ) {
2554: *rp = 0; return;
2555: }
2556: sugar = g->sugar;
2557: n = g->nv;
2558: for ( d = 0; g; ) {
2559: for ( h_reducible = 0, l = b; l; l = NEXT(l) ) {
2560: if ( dp_redble(g,p = ps[(long)BDY(l)]) ) {
2561: h_reducible = 1;
2562: psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
2563: _dp_red_mod_destructive(g,p,mod,&u); g = u;
2564: sugar = MAX(sugar,psugar);
2565: if ( !g ) {
2566: if ( d )
2567: d->sugar = sugar;
2568: _dptodp(d,rp); _free_dp(d); return;
2569: }
2570: break;
2571: }
2572: }
2573: if ( !h_reducible ) {
2574: /* head term is not reducible */
2575: if ( !full ) {
2576: if ( g )
2577: g->sugar = sugar;
2578: _dptodp(g,rp); _free_dp(g); return;
2579: } else {
2580: m = BDY(g);
2581: if ( NEXT(m) ) {
2582: BDY(g) = NEXT(m); NEXT(m) = 0;
2583: } else {
2584: _FREEDP(g); g = 0;
2585: }
2586: if ( d ) {
2587: for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) );
2588: NEXT(mrd) = m;
2589: } else {
2590: _MKDP(n,m,d);
2591: }
2592: }
2593: }
2594: }
2595: if ( d )
2596: d->sugar = sugar;
2597: _dptodp(d,rp); _free_dp(d);
2598: }
2599:
2600: /* reduction by linear base over a field */
2601:
2602: void dp_lnf_f(DP p1,DP p2,NODE g,DP *r1p,DP *r2p)
2603: {
2604: DP r1,r2,b1,b2,t,s;
2605: Obj c,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: divr(CO,(Obj)ONE,(Obj)BDY(b1)->c,&c1);
2621: mulr(CO,c1,(Obj)BDY(r1)->c,&c2); chsgnr(c2,&c);
2622: muldc(CO,b1,(Obj)c,&t); addd(CO,r1,t,&s); r1 = s;
2623: muldc(CO,b2,(Obj)c,&t); addd(CO,r2,t,&s); r2 = s;
2624: }
2625: }
2626: *r1p = r1; *r2p = r2;
2627: }
2628:
2629: /* reduction by linear base over GF(mod) */
2630:
2631: void dp_lnf_mod(DP p1,DP p2,NODE g,int mod,DP *r1p,DP *r2p)
2632: {
2633: DP r1,r2,b1,b2,t,s;
2634: P c;
2635: MQ c1,c2;
2636: NODE l,b;
2637: int n;
2638:
2639: if ( !p1 ) {
2640: *r1p = p1; *r2p = p2; return;
2641: }
2642: n = p1->nv;
2643: for ( l = g, r1 = p1, r2 = p2; l; l = NEXT(l) ) {
2644: if ( !r1 ) {
2645: *r1p = r1; *r2p = r2; return;
2646: }
2647: b = BDY((LIST)BDY(l)); b1 = (DP)BDY(b);
2648: if ( dl_equal(n,BDY(r1)->dl,BDY(b1)->dl) ) {
2649: b2 = (DP)BDY(NEXT(b));
2650: invmq(mod,(MQ)BDY(b1)->c,&c1);
2651: mulmq(mod,c1,(MQ)BDY(r1)->c,&c2); chsgnmp(mod,(P)c2,&c);
2652: mulmdc(CO,mod,b1,c,&t); addmd(CO,mod,r1,t,&s); r1 = s;
2653: mulmdc(CO,mod,b2,c,&t); addmd(CO,mod,r2,t,&s); r2 = s;
2654: }
2655: }
2656: *r1p = r1; *r2p = r2;
2657: }
2658:
2659: void dp_nf_tab_mod(DP p,LIST *tab,int mod,DP *rp)
2660: {
2661: DP s,t,u;
2662: MP m;
2663: DL h;
2664: int i,n;
2665:
2666: if ( !p ) {
2667: *rp = p; return;
2668: }
2669: n = p->nv;
2670: for ( s = 0, i = 0, m = BDY(p); m; m = NEXT(m) ) {
2671: h = m->dl;
2672: while ( !dl_equal(n,h,BDY((DP)BDY(BDY(tab[i])))->dl ) )
2673: i++;
2674: mulmdc(CO,mod,(DP)BDY(NEXT(BDY(tab[i]))),(P)m->c,&t);
2675: addmd(CO,mod,s,t,&u); s = u;
2676: }
2677: *rp = s;
2678: }
2679:
2680: void dp_nf_tab_f(DP p,LIST *tab,DP *rp)
2681: {
2682: DP s,t,u;
2683: MP m;
2684: DL h;
2685: int i,n;
2686:
2687: if ( !p ) {
2688: *rp = p; return;
2689: }
2690: n = p->nv;
2691: for ( s = 0, i = 0, m = BDY(p); m; m = NEXT(m) ) {
2692: h = m->dl;
2693: while ( !dl_equal(n,h,BDY((DP)BDY(BDY(tab[i])))->dl ) )
2694: i++;
2695: muldc(CO,(DP)BDY(NEXT(BDY(tab[i]))),m->c,&t);
2696: addd(CO,s,t,&u); s = u;
2697: }
2698: *rp = s;
2699: }
2700:
2701: /*
2702: * setting flags
2703: * call create_order_spec with vl=0 to set old type order.
2704: *
2705: */
2706:
2707: int create_order_spec(VL vl,Obj obj,struct order_spec **specp)
2708: {
2709: int i,j,n,s,row,col,ret,wlen;
2710: struct order_spec *spec;
2711: struct order_pair *l;
2712: Obj wp,wm;
2713: NODE node,t,tn,wpair;
2714: MAT m;
2715: VECT v;
2716: pointer **b,*bv;
2717: int **w;
2718:
2719: if ( vl && obj && OID(obj) == O_LIST ) {
2720: ret = create_composite_order_spec(vl,(LIST)obj,specp);
2721: if ( show_orderspec )
2722: print_composite_order_spec(*specp);
2723: return ret;
2724: }
2725:
2726: *specp = spec = (struct order_spec *)MALLOC(sizeof(struct order_spec));
2727: if ( !obj || NUM(obj) ) {
2728: spec->id = 0; spec->obj = obj;
1.2 noro 2729: spec->ord.simple = ZTOS((Q)obj);
1.1 noro 2730: return 1;
2731: } else if ( OID(obj) == O_LIST ) {
1.6 noro 2732: /* module order */
1.1 noro 2733: node = BDY((LIST)obj);
2734: if ( !BDY(node) || NUM(BDY(node)) ) {
2735: switch ( length(node) ) {
1.6 noro 2736: case 2: /* [n,ord] */
1.1 noro 2737: create_order_spec(0,(Obj)BDY(NEXT(node)),&spec);
2738: spec->id += 256; spec->obj = obj;
2739: spec->top_weight = 0;
2740: spec->module_rank = 0;
2741: spec->module_top_weight = 0;
1.6 noro 2742: spec->module_ordtype = ZTOS((Z)BDY(node));
2743: if ( spec->module_ordtype < 0 ) {
2744: spec->pot_nelim = -spec->module_ordtype;
2745: spec->module_ordtype = 1;
2746: } else
2747: spec->pot_nelim = 0;
2748: break;
2749:
2750: case 3: /* [n,[wv,wm],ord] */
2751: spec->module_ordtype = ZTOS((Z)BDY(node));
2752: if ( spec->module_ordtype < 0 ) {
2753: spec->pot_nelim = -spec->module_ordtype;
2754: spec->module_ordtype = 1;
2755: } else
1.1 noro 2756: spec->pot_nelim = 0;
1.6 noro 2757:
2758: if ( spec->module_ordtype == 3 ) { /* schreyer order */
2759: Obj baseobj;
2760: struct order_spec *basespec;
2761: int len;
2762: NODE in;
2763: LIST *la;
2764: DMMstack stack;
2765: DMMstack push_schreyer_order(LIST l,DMMstack s);
2766:
2767: spec->id = 300; spec->obj = obj;
2768: node = NEXT(node);
2769: if ( !BDY(node) || OID(BDY(node)) != O_LIST )
2770: error("create_order_spec : [mlist1,mlist,...] must be specified for defining a schreyer order");
2771: stack = 0;
2772: in = BDY((LIST)BDY(node));
2773: len = length(in);
2774: la = (LIST *)MALLOC(len*sizeof(LIST));
2775: for ( i = 0; i < len; i++, in = NEXT(in) ) la[i] = (LIST)(BDY(in));
2776: for ( i = len-1; i >= 0; i-- ) stack = push_schreyer_order(la[i],stack);
2777: spec->dmmstack = stack;
2778:
2779: node = NEXT(node);
2780: baseobj = (Obj)BDY(node);
2781: create_order_spec(0,baseobj,&basespec);
2782: basespec->obj = baseobj;
2783: spec->base = basespec;
1.13 ! noro 2784: } else if ( spec->module_ordtype == 4 ) { /* POT with base order [n,bord,ord] */
! 2785: NODE base_ord;
! 2786: int rank;
! 2787:
! 2788: create_order_spec(0,(Obj)BDY(NEXT(NEXT(node))),&spec);
! 2789: spec->id += 256; spec->obj = obj;
! 2790: spec->top_weight = 0;
! 2791: spec->module_rank = 0;
! 2792: spec->module_top_weight = 0;
! 2793: spec->pot_nelim = 0;
! 2794: spec->module_ordtype = 4;
! 2795: node = NEXT(node);
! 2796: if ( !BDY(node) || OID(BDY(node)) != O_LIST )
! 2797: error("create_order_spec : a permitation list must be specified");
! 2798: base_ord = BDY((LIST)BDY(node));
! 2799: spec->module_rank = rank = length(base_ord);
! 2800: spec->module_base_ord = (int *)MALLOC_ATOMIC((rank+1)*sizeof(int));
! 2801: for ( i = 1, t = base_ord; i <= rank; i++, t = NEXT(t) )
! 2802: spec->module_base_ord[ZTOS((Q)BDY(t))] = i;
! 2803: break;
! 2804: } else { /* weighted order * [n,[wv,wm],ord] */
1.7 noro 2805: int ordtype;
2806:
2807: ordtype = spec->module_ordtype;
1.6 noro 2808: create_order_spec(0,(Obj)BDY(NEXT(NEXT(node))),&spec);
1.7 noro 2809: spec->module_ordtype = ordtype;
2810: spec->id += 256; spec->obj = obj;
1.6 noro 2811: node = NEXT(node);
2812: if ( !BDY(node) || OID(BDY(node)) != O_LIST )
2813: error("create_order_spec : [weight_for_poly,weight_for_modlue] must be specified as a module topweight");
2814: wpair = BDY((LIST)BDY(node));
2815: if ( length(wpair) != 2 )
2816: error("create_order_spec : [weight_for_poly,weight_for_modlue] must be specified as a module topweight");
2817:
2818: wp = BDY(wpair);
2819: wm = BDY(NEXT(wpair));
2820: if ( !wp || OID(wp) != O_LIST || !wm || OID(wm) != O_LIST )
2821: error("create_order_spec : [weight_for_poly,weight_for_modlue] must be specified as a module topweight");
2822: spec->nv = length(BDY((LIST)wp));
2823: spec->top_weight = (int *)MALLOC_ATOMIC(spec->nv*sizeof(int));
2824: for ( i = 0, t = BDY((LIST)wp); i < spec->nv; t = NEXT(t), i++ )
2825: spec->top_weight[i] = ZTOS((Q)BDY(t));
2826:
2827: spec->module_rank = length(BDY((LIST)wm));
2828: spec->module_top_weight = (int *)MALLOC_ATOMIC(spec->module_rank*sizeof(int));
2829: for ( i = 0, t = BDY((LIST)wm); i < spec->module_rank; t = NEXT(t), i++ )
2830: spec->module_top_weight[i] = ZTOS((Q)BDY(t));
1.1 noro 2831: }
2832: break;
2833:
2834: default:
2835: error("create_order_spec : invalid arguments for module order");
2836: }
2837:
2838: *specp = spec;
2839: return 1;
2840: } else {
2841: /* block order in polynomial ring */
2842: for ( n = 0, t = node; t; t = NEXT(t), n++ );
2843: l = (struct order_pair *)MALLOC_ATOMIC(n*sizeof(struct order_pair));
2844: for ( i = 0, t = node, s = 0; i < n; t = NEXT(t), i++ ) {
1.2 noro 2845: tn = BDY((LIST)BDY(t)); l[i].order = ZTOS((Q)BDY(tn));
2846: tn = NEXT(tn); l[i].length = ZTOS((Q)BDY(tn));
1.1 noro 2847: s += l[i].length;
2848: }
2849: spec->id = 1; spec->obj = obj;
2850: spec->ord.block.order_pair = l;
2851: spec->ord.block.length = n; spec->nv = s;
2852: return 1;
2853: }
2854: } else if ( OID(obj) == O_MAT ) {
2855: m = (MAT)obj; row = m->row; col = m->col; b = BDY(m);
2856: w = almat(row,col);
2857: for ( i = 0; i < row; i++ )
2858: for ( j = 0; j < col; j++ )
1.2 noro 2859: w[i][j] = ZTOS((Q)b[i][j]);
1.1 noro 2860: spec->id = 2; spec->obj = obj;
2861: spec->nv = col; spec->ord.matrix.row = row;
2862: spec->ord.matrix.matrix = w;
2863: return 1;
2864: } else
2865: return 0;
2866: }
2867:
2868: void print_composite_order_spec(struct order_spec *spec)
2869: {
2870: int nv,n,len,i,j,k,start;
2871: struct weight_or_block *worb;
2872:
2873: nv = spec->nv;
2874: n = spec->ord.composite.length;
2875: worb = spec->ord.composite.w_or_b;
2876: for ( i = 0; i < n; i++, worb++ ) {
2877: len = worb->length;
2878: printf("[ ");
2879: switch ( worb->type ) {
2880: case IS_DENSE_WEIGHT:
2881: for ( j = 0; j < len; j++ )
2882: printf("%d ",worb->body.dense_weight[j]);
2883: for ( ; j < nv; j++ )
2884: printf("0 ");
2885: break;
2886: case IS_SPARSE_WEIGHT:
2887: for ( j = 0, k = 0; j < nv; j++ )
2888: if ( j == worb->body.sparse_weight[k].pos )
2889: printf("%d ",worb->body.sparse_weight[k++].value);
2890: else
2891: printf("0 ");
2892: break;
2893: case IS_BLOCK:
2894: start = worb->body.block.start;
2895: for ( j = 0; j < start; j++ ) printf("0 ");
2896: switch ( worb->body.block.order ) {
2897: case 0:
2898: for ( k = 0; k < len; k++, j++ ) printf("R ");
2899: break;
2900: case 1:
2901: for ( k = 0; k < len; k++, j++ ) printf("G ");
2902: break;
2903: case 2:
2904: for ( k = 0; k < len; k++, j++ ) printf("L ");
2905: break;
2906: }
2907: for ( ; j < nv; j++ ) printf("0 ");
2908: break;
2909: }
2910: printf("]\n");
2911: }
2912: }
2913:
2914: struct order_spec *append_block(struct order_spec *spec,
2915: int nv,int nalg,int ord)
2916: {
2917: MAT m,mat;
2918: int i,j,row,col,n;
2919: Z **b,**wp;
2920: int **w;
2921: NODE t,s,s0;
2922: struct order_pair *l,*l0;
2923: int n0,nv0;
2924: LIST list0,list1,list;
2925: Z oq,nq;
2926: struct order_spec *r;
2927:
2928: r = (struct order_spec *)MALLOC(sizeof(struct order_spec));
2929: switch ( spec->id ) {
2930: case 0:
1.2 noro 2931: STOZ(spec->ord.simple,oq); STOZ(nv,nq);
1.1 noro 2932: t = mknode(2,oq,nq); MKLIST(list0,t);
1.2 noro 2933: STOZ(ord,oq); STOZ(nalg,nq);
1.1 noro 2934: t = mknode(2,oq,nq); MKLIST(list1,t);
2935: t = mknode(2,list0,list1); MKLIST(list,t);
2936: l = (struct order_pair *)MALLOC_ATOMIC(2*sizeof(struct order_pair));
2937: l[0].order = spec->ord.simple; l[0].length = nv;
2938: l[1].order = ord; l[1].length = nalg;
2939: r->id = 1; r->obj = (Obj)list;
2940: r->ord.block.order_pair = l;
2941: r->ord.block.length = 2;
2942: r->nv = nv+nalg;
2943: break;
2944: case 1:
2945: if ( spec->nv != nv )
2946: error("append_block : number of variables mismatch");
2947: l0 = spec->ord.block.order_pair;
2948: n0 = spec->ord.block.length;
2949: nv0 = spec->nv;
2950: list0 = (LIST)spec->obj;
2951: n = n0+1;
2952: l = (struct order_pair *)MALLOC_ATOMIC(n*sizeof(struct order_pair));
2953: for ( i = 0; i < n0; i++ )
2954: l[i] = l0[i];
2955: l[i].order = ord; l[i].length = nalg;
2956: for ( t = BDY(list0), s0 = 0; t; t = NEXT(t) ) {
2957: NEXTNODE(s0,s); BDY(s) = BDY(t);
2958: }
1.2 noro 2959: STOZ(ord,oq); STOZ(nalg,nq);
1.1 noro 2960: t = mknode(2,oq,nq); MKLIST(list,t);
2961: NEXTNODE(s0,s); BDY(s) = (pointer)list; NEXT(s) = 0;
2962: MKLIST(list,s0);
2963: r->id = 1; r->obj = (Obj)list;
2964: r->ord.block.order_pair = l;
2965: r->ord.block.length = n;
2966: r->nv = nv+nalg;
2967: break;
2968: case 2:
2969: if ( spec->nv != nv )
2970: error("append_block : number of variables mismatch");
2971: m = (MAT)spec->obj;
2972: row = m->row; col = m->col; b = (Z **)BDY(m);
2973: w = almat(row+nalg,col+nalg);
2974: MKMAT(mat,row+nalg,col+nalg); wp = (Z **)BDY(mat);
2975: for ( i = 0; i < row; i++ )
2976: for ( j = 0; j < col; j++ ) {
1.2 noro 2977: w[i][j] = ZTOS(b[i][j]);
1.1 noro 2978: wp[i][j] = b[i][j];
2979: }
2980: for ( i = 0; i < nalg; i++ ) {
2981: w[i+row][i+col] = 1;
2982: wp[i+row][i+col] = ONE;
2983: }
2984: r->id = 2; r->obj = (Obj)mat;
2985: r->nv = col+nalg; r->ord.matrix.row = row+nalg;
2986: r->ord.matrix.matrix = w;
2987: break;
2988: case 3:
2989: default:
2990: /* XXX */
2991: error("append_block : not implemented yet");
2992: }
2993: return r;
2994: }
2995:
2996: int comp_sw(struct sparse_weight *a, struct sparse_weight *b)
2997: {
2998: if ( a->pos > b->pos ) return 1;
2999: else if ( a->pos < b->pos ) return -1;
3000: else return 0;
3001: }
3002:
3003: /* order = [w_or_b, w_or_b, ... ] */
3004: /* w_or_b = w or b */
3005: /* w = [1,2,...] or [x,1,y,2,...] */
3006: /* b = [@lex,x,y,...,z] etc */
3007:
3008: int create_composite_order_spec(VL vl,LIST order,struct order_spec **specp)
3009: {
3010: NODE wb,t,p;
3011: struct order_spec *spec;
3012: VL tvl;
3013: int n,i,j,k,l,start,end,len,w;
3014: int *dw;
3015: struct sparse_weight *sw;
3016: struct weight_or_block *w_or_b;
3017: Obj a0;
3018: NODE a;
3019: V v,sv,ev;
3020: SYMBOL sym;
3021: int *top;
3022:
3023: /* l = number of vars in vl */
3024: for ( l = 0, tvl = vl; tvl; tvl = NEXT(tvl), l++ );
3025: /* n = number of primitives in order */
3026: wb = BDY(order);
3027: n = length(wb);
3028: *specp = spec = (struct order_spec *)MALLOC(sizeof(struct order_spec));
3029: spec->id = 3;
3030: spec->obj = (Obj)order;
3031: spec->nv = l;
3032: spec->ord.composite.length = n;
3033: w_or_b = spec->ord.composite.w_or_b = (struct weight_or_block *)
3034: MALLOC(sizeof(struct weight_or_block)*(n+1));
3035:
3036: /* top : register the top variable in each w_or_b specification */
3037: top = (int *)ALLOCA(l*sizeof(int));
3038: for ( i = 0; i < l; i++ ) top[i] = 0;
3039:
3040: for ( t = wb, i = 0; t; t = NEXT(t), i++ ) {
3041: if ( !BDY(t) || OID((Obj)BDY(t)) != O_LIST )
3042: error("a list of lists must be specified for the key \"order\"");
3043: a = BDY((LIST)BDY(t));
3044: len = length(a);
3045: a0 = (Obj)BDY(a);
3046: if ( !a0 || OID(a0) == O_N ) {
3047: /* a is a dense weight vector */
3048: dw = (int *)MALLOC(sizeof(int)*len);
3049: for ( j = 0, p = a; j < len; p = NEXT(p), j++ ) {
3050: if ( !INT((Q)BDY(p)) )
3051: error("a dense weight vector must be specified as a list of integers");
1.2 noro 3052: dw[j] = ZTOS((Q)BDY(p));
1.1 noro 3053: }
3054: w_or_b[i].type = IS_DENSE_WEIGHT;
3055: w_or_b[i].length = len;
3056: w_or_b[i].body.dense_weight = dw;
3057:
3058: /* find the top */
3059: for ( k = 0; k < len && !dw[k]; k++ );
3060: if ( k < len ) top[k] = 1;
3061:
3062: } else if ( OID(a0) == O_P ) {
3063: /* a is a sparse weight vector */
3064: len >>= 1;
3065: sw = (struct sparse_weight *)
3066: MALLOC(sizeof(struct sparse_weight)*len);
3067: for ( j = 0, p = a; j < len; j++ ) {
3068: if ( !BDY(p) || OID((P)BDY(p)) != O_P )
3069: error("a sparse weight vector must be specified as [var1,weight1,...]");
3070: v = VR((P)BDY(p)); p = NEXT(p);
3071: for ( tvl = vl, k = 0; tvl && tvl->v != v;
3072: k++, tvl = NEXT(tvl) );
3073: if ( !tvl )
3074: error("invalid variable name in a sparse weight vector");
3075: sw[j].pos = k;
3076: if ( !INT((Q)BDY(p)) )
3077: error("a sparse weight vector must be specified as [var1,weight1,...]");
1.2 noro 3078: sw[j].value = ZTOS((Q)BDY(p)); p = NEXT(p);
1.1 noro 3079: }
3080: qsort(sw,len,sizeof(struct sparse_weight),
3081: (int (*)(const void *,const void *))comp_sw);
3082: w_or_b[i].type = IS_SPARSE_WEIGHT;
3083: w_or_b[i].length = len;
3084: w_or_b[i].body.sparse_weight = sw;
3085:
3086: /* find the top */
3087: for ( k = 0; k < len && !sw[k].value; k++ );
3088: if ( k < len ) top[sw[k].pos] = 1;
3089: } else if ( OID(a0) == O_RANGE ) {
3090: /* [range(v1,v2),w] */
3091: sv = VR((P)(((RANGE)a0)->start));
3092: ev = VR((P)(((RANGE)a0)->end));
3093: for ( tvl = vl, start = 0; tvl && tvl->v != sv; start++, tvl = NEXT(tvl) );
3094: if ( !tvl )
3095: error("invalid range");
3096: for ( end = start; tvl && tvl->v != ev; end++, tvl = NEXT(tvl) );
3097: if ( !tvl )
3098: error("invalid range");
3099: len = end-start+1;
3100: sw = (struct sparse_weight *)
3101: MALLOC(sizeof(struct sparse_weight)*len);
1.2 noro 3102: w = ZTOS((Q)BDY(NEXT(a)));
1.1 noro 3103: for ( tvl = vl, k = 0; k < start; k++, tvl = NEXT(tvl) );
3104: for ( j = 0 ; k <= end; k++, tvl = NEXT(tvl), j++ ) {
3105: sw[j].pos = k;
3106: sw[j].value = w;
3107: }
3108: w_or_b[i].type = IS_SPARSE_WEIGHT;
3109: w_or_b[i].length = len;
3110: w_or_b[i].body.sparse_weight = sw;
3111:
3112: /* register the top */
3113: if ( w ) top[start] = 1;
3114: } else if ( OID(a0) == O_SYMBOL ) {
3115: /* a is a block */
3116: sym = (SYMBOL)a0; a = NEXT(a); len--;
3117: if ( OID((Obj)BDY(a)) == O_RANGE ) {
3118: sv = VR((P)(((RANGE)BDY(a))->start));
3119: ev = VR((P)(((RANGE)BDY(a))->end));
3120: for ( tvl = vl, start = 0; tvl && tvl->v != sv; start++, tvl = NEXT(tvl) );
3121: if ( !tvl )
3122: error("invalid range");
3123: for ( end = start; tvl && tvl->v != ev; end++, tvl = NEXT(tvl) );
3124: if ( !tvl )
3125: error("invalid range");
3126: len = end-start+1;
3127: } else {
3128: for ( start = 0, tvl = vl; tvl->v != VR((P)BDY(a));
3129: tvl = NEXT(tvl), start++ );
3130: for ( p = NEXT(a), tvl = NEXT(tvl); p;
3131: p = NEXT(p), tvl = NEXT(tvl) ) {
3132: if ( !BDY(p) || OID((P)BDY(p)) != O_P )
3133: error("a block must be specified as [ordsymbol,var1,var2,...]");
3134: if ( tvl->v != VR((P)BDY(p)) ) break;
3135: }
3136: if ( p )
3137: error("a block must be contiguous in the variable list");
3138: }
3139: w_or_b[i].type = IS_BLOCK;
3140: w_or_b[i].length = len;
3141: w_or_b[i].body.block.start = start;
3142: if ( !strcmp(sym->name,"@grlex") )
3143: w_or_b[i].body.block.order = 0;
3144: else if ( !strcmp(sym->name,"@glex") )
3145: w_or_b[i].body.block.order = 1;
3146: else if ( !strcmp(sym->name,"@lex") )
3147: w_or_b[i].body.block.order = 2;
3148: else
3149: error("invalid ordername");
3150: /* register the tops */
3151: for ( j = 0, k = start; j < len; j++, k++ )
3152: top[k] = 1;
3153: }
3154: }
3155: for ( k = 0; k < l && top[k]; k++ );
3156: if ( k < l ) {
3157: /* incomplete order specification; add @grlex */
3158: w_or_b[n].type = IS_BLOCK;
3159: w_or_b[n].length = l;
3160: w_or_b[n].body.block.start = 0;
3161: w_or_b[n].body.block.order = 0;
3162: spec->ord.composite.length = n+1;
3163: }
1.3 noro 3164: return 1;
1.1 noro 3165: }
3166:
3167: /* module order spec */
3168:
3169: void create_modorder_spec(int id,LIST shift,struct modorder_spec **s)
3170: {
3171: struct modorder_spec *spec;
3172: NODE n,t;
3173: LIST list;
3174: int *ds;
3175: int i,l;
3176: Z q;
3177:
3178: *s = spec = (struct modorder_spec *)MALLOC(sizeof(struct modorder_spec));
3179: spec->id = id;
3180: if ( shift ) {
3181: n = BDY(shift);
3182: spec->len = l = length(n);
3183: spec->degree_shift = ds = (int *)MALLOC_ATOMIC(l*sizeof(int));
3184: for ( t = n, i = 0; t; t = NEXT(t), i++ )
1.2 noro 3185: ds[i] = ZTOS((Q)BDY(t));
1.1 noro 3186: } else {
3187: spec->len = 0;
3188: spec->degree_shift = 0;
3189: }
1.2 noro 3190: STOZ(id,q);
1.1 noro 3191: n = mknode(2,q,shift);
3192: MKLIST(list,n);
3193: spec->obj = (Obj)list;
3194: }
3195:
3196: /*
3197: * converters
3198: *
3199: */
3200:
1.7 noro 3201: void dpm_homo(DPM p,DPM *rp)
3202: {
3203: DMM m,mr,mr0,t;
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);
3212: td = 0;
3213: for ( t = m; t; t = NEXT(t) )
3214: if ( m->dl->td > td ) td = m->dl->td;
3215: for ( mr0 = 0; m; m = NEXT(m) ) {
3216: NEXTDMM(mr0,mr); mr->c = m->c; mr->pos = m->pos;
3217: dl = m->dl;
3218: mr->dl = dlh = (DL)MALLOC_ATOMIC((nv+1)*sizeof(int));
3219: dlh->td = td;
3220: for ( i = 0; i < n; i++ )
3221: dlh->d[i] = dl->d[i];
3222: dlh->d[n] = td - dl->td;
3223: }
3224: NEXT(mr) = 0; MKDPM(nv,mr0,*rp); (*rp)->sugar = p->sugar;
3225: }
3226: }
3227:
3228: void dpm_dehomo(DPM p,DPM *rp)
3229: {
3230: DMM m,mr,mr0;
3231: int i,n,nv;
3232: DL dl,dlh;
3233:
3234: if ( !p )
3235: *rp = 0;
3236: else {
3237: n = p->nv; nv = n - 1;
3238: m = BDY(p);
3239: for ( mr0 = 0; m; m = NEXT(m) ) {
3240: NEXTDMM(mr0,mr); mr->c = m->c; mr->pos = m->pos;
3241: dlh = m->dl;
3242: mr->dl = dl = (DL)MALLOC_ATOMIC((nv+1)*sizeof(int));
3243: dl->td = dlh->td - dlh->d[nv];
3244: for ( i = 0; i < nv; i++ )
3245: dl->d[i] = dlh->d[i];
3246: }
3247: NEXT(mr) = 0; MKDPM(nv,mr0,*rp); (*rp)->sugar = p->sugar;
3248: }
3249: }
3250:
1.1 noro 3251: void dp_homo(DP p,DP *rp)
3252: {
3253: MP m,mr,mr0;
3254: int i,n,nv,td;
3255: DL dl,dlh;
3256:
3257: if ( !p )
3258: *rp = 0;
3259: else {
3260: n = p->nv; nv = n + 1;
3261: m = BDY(p); td = sugard(m);
3262: for ( mr0 = 0; m; m = NEXT(m) ) {
3263: NEXTMP(mr0,mr); mr->c = m->c;
3264: dl = m->dl;
3265: mr->dl = dlh = (DL)MALLOC_ATOMIC((nv+1)*sizeof(int));
3266: dlh->td = td;
3267: for ( i = 0; i < n; i++ )
3268: dlh->d[i] = dl->d[i];
3269: dlh->d[n] = td - dl->td;
3270: }
3271: NEXT(mr) = 0; MKDP(nv,mr0,*rp); (*rp)->sugar = p->sugar;
3272: }
3273: }
3274:
3275: void dp_dehomo(DP p,DP *rp)
3276: {
3277: MP m,mr,mr0;
3278: int i,n,nv;
3279: DL dl,dlh;
3280:
3281: if ( !p )
3282: *rp = 0;
3283: else {
3284: n = p->nv; nv = n - 1;
3285: m = BDY(p);
3286: for ( mr0 = 0; m; m = NEXT(m) ) {
3287: NEXTMP(mr0,mr); mr->c = m->c;
3288: dlh = m->dl;
3289: mr->dl = dl = (DL)MALLOC_ATOMIC((nv+1)*sizeof(int));
3290: dl->td = dlh->td - dlh->d[nv];
3291: for ( i = 0; i < nv; i++ )
3292: dl->d[i] = dlh->d[i];
3293: }
3294: NEXT(mr) = 0; MKDP(nv,mr0,*rp); (*rp)->sugar = p->sugar;
3295: }
3296: }
3297:
1.7 noro 3298:
1.1 noro 3299: void dp_mod(DP p,int mod,NODE subst,DP *rp)
3300: {
3301: MP m,mr,mr0;
3302: P t,s,s1;
3303: V v;
3304: NODE tn;
3305:
3306: if ( !p )
3307: *rp = 0;
3308: else {
3309: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
3310: for ( tn = subst, s = (P)m->c; tn; tn = NEXT(tn) ) {
3311: v = VR((P)BDY(tn)); tn = NEXT(tn);
3312: substp(CO,s,v,(P)BDY(tn),&s1); s = s1;
3313: }
3314: ptomp(mod,s,&t);
3315: if ( t ) {
3316: NEXTMP(mr0,mr); mr->c = (Obj)t; mr->dl = m->dl;
3317: }
3318: }
3319: if ( mr0 ) {
3320: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
3321: } else
3322: *rp = 0;
3323: }
3324: }
3325:
3326: void dp_rat(DP p,DP *rp)
3327: {
3328: MP m,mr,mr0;
3329:
3330: if ( !p )
3331: *rp = 0;
3332: else {
3333: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
3334: NEXTMP(mr0,mr); mptop((P)m->c,(P *)&mr->c); mr->dl = m->dl;
3335: }
3336: if ( mr0 ) {
3337: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
3338: } else
3339: *rp = 0;
3340: }
3341: }
3342:
3343:
3344: void homogenize_order(struct order_spec *old,int n,struct order_spec **newp)
3345: {
3346: struct order_pair *l;
3347: int length,nv,row,i,j;
3348: int **newm,**oldm;
3349: struct order_spec *new;
3350: int onv,nnv,nlen,olen,owlen;
3351: struct weight_or_block *owb,*nwb;
3352:
3353: *newp = new = (struct order_spec *)MALLOC(sizeof(struct order_spec));
1.6 noro 3354: bcopy((char *)old,(char *)new,sizeof(struct order_spec));
1.1 noro 3355: switch ( old->id ) {
3356: case 0:
3357: switch ( old->ord.simple ) {
3358: case 0:
1.6 noro 3359: break;
1.1 noro 3360: case 1:
3361: l = (struct order_pair *)
3362: MALLOC_ATOMIC(2*sizeof(struct order_pair));
3363: l[0].length = n; l[0].order = 1;
3364: l[1].length = 1; l[1].order = 2;
3365: new->id = 1;
3366: new->ord.block.order_pair = l;
3367: new->ord.block.length = 2; new->nv = n+1;
3368: break;
3369: case 2:
1.6 noro 3370: new->ord.simple = 1; break;
1.1 noro 3371: case 3: case 4: case 5:
1.6 noro 3372: new->ord.simple = old->ord.simple+3;
1.1 noro 3373: dp_nelim = n-1; break;
3374: case 6: case 7: case 8: case 9:
1.6 noro 3375: break;
1.1 noro 3376: default:
3377: error("homogenize_order : invalid input");
3378: }
3379: break;
3380: case 1: case 257:
3381: length = old->ord.block.length;
3382: l = (struct order_pair *)
3383: MALLOC_ATOMIC((length+1)*sizeof(struct order_pair));
3384: bcopy((char *)old->ord.block.order_pair,(char *)l,length*sizeof(struct order_pair));
3385: l[length].order = 2; l[length].length = 1;
1.6 noro 3386: new->nv = n+1;
1.1 noro 3387: new->ord.block.order_pair = l;
3388: new->ord.block.length = length+1;
3389: break;
3390: case 2: case 258:
3391: nv = old->nv; row = old->ord.matrix.row;
3392: oldm = old->ord.matrix.matrix; newm = almat(row+1,nv+1);
3393: for ( i = 0; i <= nv; i++ )
3394: newm[0][i] = 1;
3395: for ( i = 0; i < row; i++ ) {
3396: for ( j = 0; j < nv; j++ )
3397: newm[i+1][j] = oldm[i][j];
3398: newm[i+1][j] = 0;
3399: }
1.6 noro 3400: new->nv = nv+1;
1.1 noro 3401: new->ord.matrix.row = row+1; new->ord.matrix.matrix = newm;
3402: break;
3403: case 3: case 259:
3404: onv = old->nv;
3405: nnv = onv+1;
3406: olen = old->ord.composite.length;
3407: nlen = olen+1;
3408: owb = old->ord.composite.w_or_b;
3409: nwb = (struct weight_or_block *)
3410: MALLOC(nlen*sizeof(struct weight_or_block));
3411: for ( i = 0; i < olen; i++ ) {
3412: nwb[i].type = owb[i].type;
3413: switch ( owb[i].type ) {
3414: case IS_DENSE_WEIGHT:
3415: owlen = owb[i].length;
3416: nwb[i].length = owlen+1;
3417: nwb[i].body.dense_weight = (int *)MALLOC((owlen+1)*sizeof(int));
3418: for ( j = 0; j < owlen; j++ )
3419: nwb[i].body.dense_weight[j] = owb[i].body.dense_weight[j];
3420: nwb[i].body.dense_weight[owlen] = 0;
3421: break;
3422: case IS_SPARSE_WEIGHT:
3423: nwb[i].length = owb[i].length;
3424: nwb[i].body.sparse_weight = owb[i].body.sparse_weight;
3425: break;
3426: case IS_BLOCK:
3427: nwb[i].length = owb[i].length;
3428: nwb[i].body.block = owb[i].body.block;
3429: break;
3430: }
3431: }
3432: nwb[i].type = IS_SPARSE_WEIGHT;
3433: nwb[i].body.sparse_weight =
3434: (struct sparse_weight *)MALLOC(sizeof(struct sparse_weight));
3435: nwb[i].body.sparse_weight[0].pos = onv;
3436: nwb[i].body.sparse_weight[0].value = 1;
3437: new->nv = nnv;
3438: new->ord.composite.length = nlen;
3439: new->ord.composite.w_or_b = nwb;
3440: print_composite_order_spec(new);
3441: break;
3442: case 256: /* simple module order */
3443: switch ( old->ord.simple ) {
3444: case 0:
1.6 noro 3445: break;
1.1 noro 3446: case 1:
3447: l = (struct order_pair *)
3448: MALLOC_ATOMIC(2*sizeof(struct order_pair));
3449: l[0].length = n; l[0].order = old->ord.simple;
3450: l[1].length = 1; l[1].order = 2;
3451: new->id = 257;
3452: new->ord.block.order_pair = l;
3453: new->ord.block.length = 2; new->nv = n+1;
3454: break;
3455: case 2:
1.6 noro 3456: new->ord.simple = 1; break;
1.1 noro 3457: default:
3458: error("homogenize_order : invalid input");
3459: }
3460: break;
3461: default:
3462: error("homogenize_order : invalid input");
3463: }
3464: }
3465:
3466: int comp_nm(Q *a,Q *b)
3467: {
3468: Z z,nma,nmb;
3469:
3470: nmq(*a,&z); absz(z,&nma);
3471: nmq(*b,&z); absz(z,&nmb);
3472: return cmpz(nma,nmb);
3473: }
3474:
3475: void sortbynm(Q *w,int n)
3476: {
3477: qsort(w,n,sizeof(Q),(int (*)(const void *,const void *))comp_nm);
3478: }
3479:
3480:
3481: /*
3482: * simple operations
3483: *
3484: */
3485:
3486: int dp_redble(DP p1,DP p2)
3487: {
3488: int i,n;
3489: DL d1,d2;
3490:
3491: d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
3492: if ( d1->td < d2->td )
3493: return 0;
3494: else {
3495: for ( i = 0, n = p1->nv; i < n; i++ )
3496: if ( d1->d[i] < d2->d[i] )
3497: return 0;
3498: return 1;
3499: }
3500: }
3501:
3502: int dpm_redble(DPM p1,DPM p2)
3503: {
3504: int i,n;
3505: DL d1,d2;
3506:
3507: if ( BDY(p1)->pos != BDY(p2)->pos ) return 0;
3508: d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
3509: if ( d1->td < d2->td )
3510: return 0;
3511: else {
3512: for ( i = 0, n = p1->nv; i < n; i++ )
3513: if ( d1->d[i] < d2->d[i] )
3514: return 0;
3515: return 1;
3516: }
3517: }
3518:
3519:
3520: void dp_subd(DP p1,DP p2,DP *rp)
3521: {
3522: int i,n;
3523: DL d1,d2,d;
3524: MP m;
3525: DP s;
3526:
3527: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
3528: NEWDL(d,n); d->td = d1->td - d2->td;
3529: for ( i = 0; i < n; i++ )
3530: d->d[i] = d1->d[i]-d2->d[i];
3531: NEWMP(m); m->dl = d; m->c = (Obj)ONE; NEXT(m) = 0;
3532: MKDP(n,m,s); s->sugar = d->td;
3533: *rp = s;
3534: }
3535:
3536: void dltod(DL d,int n,DP *rp)
3537: {
3538: MP m;
3539: DP s;
3540:
3541: NEWMP(m); m->dl = d; m->c = (Obj)ONE; NEXT(m) = 0;
3542: MKDP(n,m,s); s->sugar = d->td;
3543: *rp = s;
3544: }
3545:
3546: void dp_hm(DP p,DP *rp)
3547: {
3548: MP m,mr;
3549:
3550: if ( !p )
3551: *rp = 0;
3552: else {
3553: m = BDY(p);
3554: NEWMP(mr); mr->dl = m->dl; mr->c = m->c; NEXT(mr) = 0;
3555: MKDP(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */
3556: }
3557: }
3558:
3559: void dp_ht(DP p,DP *rp)
3560: {
3561: MP m,mr;
3562:
3563: if ( !p )
3564: *rp = 0;
3565: else {
3566: m = BDY(p);
3567: NEWMP(mr); mr->dl = m->dl; mr->c = (Obj)ONE; NEXT(mr) = 0;
3568: MKDP(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */
3569: }
3570: }
3571:
3572: void dpm_hm(DPM p,DPM *rp)
3573: {
3574: DMM m,mr;
3575:
3576: if ( !p )
3577: *rp = 0;
3578: else {
3579: m = BDY(p);
3580: NEWDMM(mr); mr->dl = m->dl; mr->c = m->c; mr->pos = m->pos; NEXT(mr) = 0;
3581: MKDPM(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */
3582: }
3583: }
3584:
3585: void dpm_ht(DPM p,DPM *rp)
3586: {
3587: DMM m,mr;
3588:
3589: if ( !p )
3590: *rp = 0;
3591: else {
3592: m = BDY(p);
3593: NEWDMM(mr); mr->dl = m->dl; mr->pos = m->pos; mr->c = (Obj)ONE; NEXT(mr) = 0;
3594: MKDPM(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */
3595: }
3596: }
3597:
3598:
3599: void dp_rest(DP p,DP *rp)
3600: {
3601: MP m;
3602:
3603: m = BDY(p);
3604: if ( !NEXT(m) )
3605: *rp = 0;
3606: else {
3607: MKDP(p->nv,NEXT(m),*rp);
3608: if ( *rp )
3609: (*rp)->sugar = p->sugar;
3610: }
3611: }
3612:
3613: void dpm_rest(DPM p,DPM *rp)
3614: {
3615: DMM m;
3616:
3617: m = BDY(p);
3618: if ( !NEXT(m) )
3619: *rp = 0;
3620: else {
3621: MKDPM(p->nv,NEXT(m),*rp);
3622: if ( *rp )
3623: (*rp)->sugar = p->sugar;
3624: }
3625: }
3626:
1.3 noro 3627: int dpm_getdeg(DPM p,int *r)
3628: {
3629: int max,n,i,rank;
3630: DMM m;
3631: int *d;
3632:
3633: if ( !p ) return 0;
3634: n = p->nv;
3635: max = 0;
3636: rank = 0;
3637: for ( m = BDY(p); m; m = NEXT(m) ) {
3638: d = m->dl->d;
3639: for ( i = 0; i < n; i++ )
3640: if ( d[i] > max ) max = d[i];
3641: rank = MAX(rank,m->pos);
3642: }
3643: *r = rank;
3644: return max;
3645: }
3646:
1.1 noro 3647: DL lcm_of_DL(int nv,DL dl1,DL dl2,DL dl)
3648: {
3649: register int i, *d1, *d2, *d, td;
3650:
3651: if ( !dl ) NEWDL(dl,nv);
3652: d = dl->d, d1 = dl1->d, d2 = dl2->d;
3653: for ( td = 0, i = 0; i < nv; d1++, d2++, d++, i++ ) {
3654: *d = *d1 > *d2 ? *d1 : *d2;
3655: td += MUL_WEIGHT(*d,i);
3656: }
3657: dl->td = td;
3658: return dl;
3659: }
3660:
3661: int dl_equal(int nv,DL dl1,DL dl2)
3662: {
3663: register int *d1, *d2, n;
3664:
3665: if ( dl1->td != dl2->td ) return 0;
3666: for ( d1 = dl1->d, d2 = dl2->d, n = nv; --n >= 0; d1++, d2++ )
3667: if ( *d1 != *d2 ) return 0;
3668: return 1;
3669: }
3670:
3671: int dp_nt(DP p)
3672: {
3673: int i;
3674: MP m;
3675:
3676: if ( !p )
3677: return 0;
3678: else {
3679: for ( i = 0, m = BDY(p); m; m = NEXT(m), i++ );
3680: return i;
3681: }
3682: }
3683:
3684: int dp_homogeneous(DP p)
3685: {
3686: MP m;
3687: int d;
3688:
3689: if ( !p )
3690: return 1;
3691: else {
3692: m = BDY(p);
3693: d = m->dl->td;
3694: m = NEXT(m);
3695: for ( ; m; m = NEXT(m) ) {
3696: if ( m->dl->td != d )
3697: return 0;
3698: }
3699: return 1;
3700: }
3701: }
3702:
3703: void _print_mp(int nv,MP m)
3704: {
3705: int i;
3706:
3707: if ( !m )
3708: return;
3709: for ( ; m; m = NEXT(m) ) {
1.3 noro 3710: fprintf(stderr,"%ld<",ITOS(C(m)));
1.1 noro 3711: for ( i = 0; i < nv; i++ ) {
3712: fprintf(stderr,"%d",m->dl->d[i]);
3713: if ( i != nv-1 )
3714: fprintf(stderr," ");
3715: }
1.3 noro 3716: fprintf(stderr,">");
1.1 noro 3717: }
3718: fprintf(stderr,"\n");
3719: }
3720:
3721: static int cmp_mp_nvar;
3722:
3723: int comp_mp(MP *a,MP *b)
3724: {
3725: return -(*cmpdl)(cmp_mp_nvar,(*a)->dl,(*b)->dl);
3726: }
3727:
3728: void dp_sort(DP p,DP *rp)
3729: {
3730: MP t,mp,mp0;
3731: int i,n;
3732: DP r;
3733: MP *w;
3734:
3735: if ( !p ) {
3736: *rp = 0;
3737: return;
3738: }
3739: for ( t = BDY(p), n = 0; t; t = NEXT(t), n++ );
3740: w = (MP *)ALLOCA(n*sizeof(MP));
3741: for ( t = BDY(p), i = 0; i < n; t = NEXT(t), i++ )
3742: w[i] = t;
3743: cmp_mp_nvar = NV(p);
3744: qsort(w,n,sizeof(MP),(int (*)(const void *,const void *))comp_mp);
3745: mp0 = 0;
3746: for ( i = n-1; i >= 0; i-- ) {
3747: NEWMP(mp); mp->dl = w[i]->dl; C(mp) = C(w[i]);
3748: NEXT(mp) = mp0; mp0 = mp;
3749: }
3750: MKDP(p->nv,mp0,r);
3751: r->sugar = p->sugar;
3752: *rp = r;
3753: }
3754:
3755: DP extract_initial_term_from_dp(DP p,int *weight,int n);
3756: LIST extract_initial_term(LIST f,int *weight,int n);
3757:
3758: DP extract_initial_term_from_dp(DP p,int *weight,int n)
3759: {
3760: int w,t,i,top;
3761: MP m,r0,r;
3762: DP dp;
3763:
3764: if ( !p ) return 0;
3765: top = 1;
3766: for ( m = BDY(p); m; m = NEXT(m) ) {
3767: for ( i = 0, t = 0; i < n; i++ )
3768: t += weight[i]*m->dl->d[i];
3769: if ( top || t > w ) {
3770: r0 = 0;
3771: w = t;
3772: top = 0;
3773: }
3774: if ( t == w ) {
3775: NEXTMP(r0,r);
3776: r->dl = m->dl;
3777: r->c = m->c;
3778: }
3779: }
3780: NEXT(r) = 0;
3781: MKDP(p->nv,r0,dp);
3782: return dp;
3783: }
3784:
3785: LIST extract_initial_term(LIST f,int *weight,int n)
3786: {
3787: NODE nd,r0,r;
3788: Obj p;
3789: LIST l;
3790:
3791: nd = BDY(f);
3792: for ( r0 = 0; nd; nd = NEXT(nd) ) {
3793: NEXTNODE(r0,r);
3794: p = (Obj)BDY(nd);
3795: BDY(r) = (pointer)extract_initial_term_from_dp((DP)p,weight,n);
3796: }
3797: if ( r0 ) NEXT(r) = 0;
3798: MKLIST(l,r0);
3799: return l;
3800: }
3801:
3802: LIST dp_initial_term(LIST f,struct order_spec *ord)
3803: {
3804: int n,l,i;
3805: struct weight_or_block *worb;
3806: int *weight;
3807:
3808: switch ( ord->id ) {
3809: case 2: /* matrix order */
3810: /* extract the first row */
3811: n = ord->nv;
3812: weight = ord->ord.matrix.matrix[0];
3813: return extract_initial_term(f,weight,n);
3814: case 3: /* composite order */
3815: /* the first w_or_b */
3816: worb = ord->ord.composite.w_or_b;
3817: switch ( worb->type ) {
3818: case IS_DENSE_WEIGHT:
3819: n = worb->length;
3820: weight = worb->body.dense_weight;
3821: return extract_initial_term(f,weight,n);
3822: case IS_SPARSE_WEIGHT:
3823: n = ord->nv;
3824: weight = (int *)ALLOCA(n*sizeof(int));
3825: for ( i = 0; i < n; i++ ) weight[i] = 0;
3826: l = worb->length;
3827: for ( i = 0; i < l; i++ )
3828: weight[worb->body.sparse_weight[i].pos]
3829: = worb->body.sparse_weight[i].value;
3830: return extract_initial_term(f,weight,n);
3831: default:
3832: error("dp_initial_term : unsupported order");
3833: }
3834: default:
3835: error("dp_initial_term : unsupported order");
3836: }
1.3 noro 3837: return 0;
1.1 noro 3838: }
3839:
3840: int highest_order_dp(DP p,int *weight,int n);
3841: LIST highest_order(LIST f,int *weight,int n);
3842:
3843: int highest_order_dp(DP p,int *weight,int n)
3844: {
3845: int w,t,i,top;
3846: MP m;
3847:
3848: if ( !p ) return -1;
3849: top = 1;
3850: for ( m = BDY(p); m; m = NEXT(m) ) {
3851: for ( i = 0, t = 0; i < n; i++ )
3852: t += weight[i]*m->dl->d[i];
3853: if ( top || t > w ) {
3854: w = t;
3855: top = 0;
3856: }
3857: }
3858: return w;
3859: }
3860:
3861: LIST highest_order(LIST f,int *weight,int n)
3862: {
3863: int h;
3864: NODE nd,r0,r;
3865: Obj p;
3866: LIST l;
3867: Z q;
3868:
3869: nd = BDY(f);
3870: for ( r0 = 0; nd; nd = NEXT(nd) ) {
3871: NEXTNODE(r0,r);
3872: p = (Obj)BDY(nd);
3873: h = highest_order_dp((DP)p,weight,n);
1.2 noro 3874: STOZ(h,q);
1.1 noro 3875: BDY(r) = (pointer)q;
3876: }
3877: if ( r0 ) NEXT(r) = 0;
3878: MKLIST(l,r0);
3879: return l;
3880: }
3881:
3882: LIST dp_order(LIST f,struct order_spec *ord)
3883: {
3884: int n,l,i;
3885: struct weight_or_block *worb;
3886: int *weight;
3887:
3888: switch ( ord->id ) {
3889: case 2: /* matrix order */
3890: /* extract the first row */
3891: n = ord->nv;
3892: weight = ord->ord.matrix.matrix[0];
3893: return highest_order(f,weight,n);
3894: case 3: /* composite order */
3895: /* the first w_or_b */
3896: worb = ord->ord.composite.w_or_b;
3897: switch ( worb->type ) {
3898: case IS_DENSE_WEIGHT:
3899: n = worb->length;
3900: weight = worb->body.dense_weight;
3901: return highest_order(f,weight,n);
3902: case IS_SPARSE_WEIGHT:
3903: n = ord->nv;
3904: weight = (int *)ALLOCA(n*sizeof(int));
3905: for ( i = 0; i < n; i++ ) weight[i] = 0;
3906: l = worb->length;
3907: for ( i = 0; i < l; i++ )
3908: weight[worb->body.sparse_weight[i].pos]
3909: = worb->body.sparse_weight[i].value;
3910: return highest_order(f,weight,n);
3911: default:
3912: error("dp_initial_term : unsupported order");
3913: }
3914: default:
3915: error("dp_initial_term : unsupported order");
3916: }
1.3 noro 3917: return 0;
1.1 noro 3918: }
3919:
3920: int dpv_ht(DPV p,DP *h)
3921: {
3922: int len,max,maxi,i,t;
3923: DP *e;
3924: MP m,mr;
3925:
3926: len = p->len;
3927: e = p->body;
3928: max = -1;
3929: maxi = -1;
3930: for ( i = 0; i < len; i++ )
3931: if ( e[i] && (t = BDY(e[i])->dl->td) > max ) {
3932: max = t;
3933: maxi = i;
3934: }
3935: if ( max < 0 ) {
3936: *h = 0;
3937: return -1;
3938: } else {
3939: m = BDY(e[maxi]);
3940: NEWMP(mr); mr->dl = m->dl; mr->c = (Obj)ONE; NEXT(mr) = 0;
3941: MKDP(e[maxi]->nv,mr,*h); (*h)->sugar = mr->dl->td; /* XXX */
3942: return maxi;
3943: }
3944: }
3945:
3946: /* return 1 if 0 <_w1 v && v <_w2 0 */
3947:
3948: int in_c12(int n,int *v,int row1,int **w1,int row2, int **w2)
3949: {
3950: int t1,t2;
3951:
3952: t1 = compare_zero(n,v,row1,w1);
3953: t2 = compare_zero(n,v,row2,w2);
3954: if ( t1 > 0 && t2 < 0 ) return 1;
3955: else return 0;
3956: }
3957:
3958: /* 0 < u => 1, 0 > u => -1 */
3959:
3960: int compare_zero(int n,int *u,int row,int **w)
3961: {
3962: int i,j,t;
3963: int *wi;
3964:
3965: for ( i = 0; i < row; i++ ) {
3966: wi = w[i];
3967: for ( j = 0, t = 0; j < n; j++ ) t += u[j]*wi[j];
3968: if ( t > 0 ) return 1;
3969: else if ( t < 0 ) return -1;
3970: }
3971: return 0;
3972: }
3973:
3974: /* functions for generic groebner walk */
3975: /* u=0 means u=-infty */
3976:
3977: int compare_facet_preorder(int n,int *u,int *v,
3978: int row1,int **w1,int row2,int **w2)
3979: {
3980: int i,j,s,t,tu,tv;
3981: int *w2i,*uv;
3982:
3983: if ( !u ) return 1;
3984: uv = W_ALLOC(n);
3985: for ( i = 0; i < row2; i++ ) {
3986: w2i = w2[i];
3987: for ( j = 0, tu = tv = 0; j < n; j++ )
1.3 noro 3988: if ( (s = w2i[j]) != 0 ) {
1.1 noro 3989: tu += s*u[j]; tv += s*v[j];
3990: }
3991: for ( j = 0; j < n; j++ ) uv[j] = u[j]*tv-v[j]*tu;
3992: t = compare_zero(n,uv,row1,w1);
3993: if ( t > 0 ) return 1;
3994: else if ( t < 0 ) return 0;
3995: }
3996: return 1;
3997: }
3998:
3999: Q inner_product_with_small_vector(VECT w,int *v)
4000: {
4001: int n,i;
4002: Z q;
4003: Q s,t,u;
4004:
4005: n = w->len;
4006: s = 0;
4007: for ( i = 0; i < n; i++ ) {
1.2 noro 4008: STOZ(v[i],q); mulq((Q)w->body[i],(Q)q,&t); addq(t,s,&u); s = u;
1.1 noro 4009: }
4010: return s;
4011: }
4012:
4013: Q compute_last_t(NODE g,NODE gh,Q t,VECT w1,VECT w2,NODE *homo,VECT *wp)
4014: {
4015: int n,i;
4016: int *wt;
4017: Q last,d1,d2,dn,nm,s,t1;
4018: VECT wd,wt1,wt2,w;
4019: NODE tg,tgh;
4020: MP f;
4021: int *h;
4022: NODE r0,r;
4023: MP m0,m;
4024: DP d;
4025:
4026: n = w1->len;
4027: wt = W_ALLOC(n);
4028: last = (Q)ONE;
4029: /* t1 = 1-t */
4030: for ( tg = g, tgh = gh; tg; tg = NEXT(tg), tgh = NEXT(tgh ) ) {
4031: f = BDY((DP)BDY(tg));
4032: h = BDY((DP)BDY(tgh))->dl->d;
4033: for ( ; f; f = NEXT(f) ) {
4034: for ( i = 0; i < n; i++ ) wt[i] = h[i]-f->dl->d[i];
4035: for ( i = 0; i < n && !wt[i]; i++ );
4036: if ( i == n ) continue;
4037: d1 = inner_product_with_small_vector(w1,wt);
4038: d2 = inner_product_with_small_vector(w2,wt);
4039: nm = d1; subq(d1,d2,&dn);
4040: /* if d1=d2 then nothing happens */
4041: if ( !dn ) continue;
4042: /* s satisfies ds = 0*/
4043: divq(nm,dn,&s);
4044:
4045: if ( cmpq(s,t) > 0 && cmpq(s,last) < 0 )
4046: last = s;
4047: else if ( !cmpq(s,t) ) {
4048: if ( cmpq(d2,0) < 0 ) {
4049: last = t;
4050: break;
4051: }
4052: }
4053: }
4054: }
4055: nmq(last,(Z *)&nm);
4056: dnq(last,(Z *)&dn);
4057: /* (1-n/d)*w1+n/d*w2 -> w=(d-n)*w1+n*w2 */
4058: subq(dn,nm,&t1); mulvect(CO,(Obj)w1,(Obj)t1,(Obj *)&wt1);
4059: mulvect(CO,(Obj)w2,(Obj)nm,(Obj *)&wt2); addvect(CO,wt1,wt2,&w);
4060:
4061: r0 = 0;
4062: for ( tg = g, tgh = gh; tg; tg = NEXT(tg), tgh = NEXT(tgh ) ) {
4063: f = BDY((DP)BDY(tg));
4064: h = BDY((DP)BDY(tgh))->dl->d;
4065: for ( m0 = 0; f; f = NEXT(f) ) {
4066: for ( i = 0; i < n; i++ ) wt[i] = h[i]-f->dl->d[i];
4067: for ( i = 0; i < n && !wt[i]; i++ );
4068: if ( !inner_product_with_small_vector(w,wt) ) {
4069: NEXTMP(m0,m); m->c = f->c; m->dl = f->dl;
4070: }
4071: }
4072: NEXT(m) = 0;
4073: MKDP(((DP)BDY(tg))->nv,m0,d); d->sugar = ((DP)BDY(tg))->sugar;
4074: NEXTNODE(r0,r); BDY(r) = (pointer)d;
4075: }
4076: NEXT(r) = 0;
4077: *homo = r0;
4078: *wp = w;
4079: return last;
4080: }
4081:
4082: /* return 0 if last_w = infty */
4083:
4084: NODE compute_last_w(NODE g,NODE gh,int n,int **w,
4085: int row1,int **w1,int row2,int **w2)
4086: {
4087: DP d;
4088: MP f,m0,m;
4089: int *wt,*v,*h;
4090: NODE t,s,n0,tn,n1,r0,r;
4091: int i;
4092:
4093: wt = W_ALLOC(n);
4094: n0 = 0;
4095: for ( t = g, s = gh; t; t = NEXT(t), s = NEXT(s) ) {
4096: f = BDY((DP)BDY(t));
4097: h = BDY((DP)BDY(s))->dl->d;
4098: for ( ; f; f = NEXT(f) ) {
4099: for ( i = 0; i < n; i++ ) wt[i] = h[i]-f->dl->d[i];
4100: for ( i = 0; i < n && !wt[i]; i++ );
4101: if ( i == n ) continue;
4102:
4103: if ( in_c12(n,wt,row1,w1,row2,w2) &&
4104: compare_facet_preorder(n,*w,wt,row1,w1,row2,w2) ) {
4105: v = (int *)MALLOC_ATOMIC(n*sizeof(int));
4106: for ( i = 0; i < n; i++ ) v[i] = wt[i];
4107: MKNODE(n1,v,n0); n0 = n1;
4108: }
4109: }
4110: }
4111: if ( !n0 ) return 0;
4112: for ( t = n0; t; t = NEXT(t) ) {
4113: v = (int *)BDY(t);
4114: for ( s = n0; s; s = NEXT(s) )
4115: if ( !compare_facet_preorder(n,v,(int *)BDY(s),row1,w1,row2,w2) )
4116: break;
4117: if ( !s ) {
4118: *w = v;
4119: break;
4120: }
4121: }
4122: if ( !t )
4123: error("compute_last_w : cannot happen");
4124: r0 = 0;
4125: for ( t = g, s = gh; t; t = NEXT(t), s = NEXT(s) ) {
4126: f = BDY((DP)BDY(t));
4127: h = BDY((DP)BDY(s))->dl->d;
4128: for ( m0 = 0; f; f = NEXT(f) ) {
4129: for ( i = 0; i < n; i++ ) wt[i] = h[i]-f->dl->d[i];
4130: for ( i = 0; i < n && !wt[i]; i++ );
4131: if ( i == n ||
4132: (compare_facet_preorder(n,wt,*w,row1,w1,row2,w2)
4133: && compare_facet_preorder(n,*w,wt,row1,w1,row2,w2)) ) {
4134: NEXTMP(m0,m); m->c = f->c; m->dl = f->dl;
4135: }
4136: }
4137: NEXT(m) = 0;
4138: MKDP(((DP)BDY(t))->nv,m0,d); d->sugar = ((DP)BDY(t))->sugar;
4139: NEXTNODE(r0,r); BDY(r) = (pointer)d;
4140: }
4141: NEXT(r) = 0;
4142: return r0;
4143: }
4144:
4145: /* compute a sufficient set of d(f)=u-v */
4146:
4147: NODE compute_essential_df(DP *g,DP *gh,int ng)
4148: {
4149: int nv,i,j,k,t,lj;
4150: NODE r,r1,ri,rt,r0;
4151: MP m;
4152: MP *mj;
4153: DL di,hj,dl,dlt;
4154: int *d,*dt;
4155: LIST l;
4156: Z q;
4157:
4158: nv = g[0]->nv;
4159: r = 0;
4160: for ( j = 0; j < ng; j++ ) {
4161: for ( m = BDY(g[j]), lj = 0; m; m = NEXT(m), lj++ );
4162: mj = (MP *)ALLOCA(lj*sizeof(MP));
4163: for ( m = BDY(g[j]), k = 0; m; m = NEXT(m), k++ )
4164: mj[k] = m;
4165: for ( i = 0; i < lj; i++ ) {
4166: for ( di = mj[i]->dl, k = i+1; k < lj; k++ )
4167: if ( _dl_redble(di,mj[k]->dl,nv) ) break;
4168: if ( k < lj ) mj[i] = 0;
4169: }
4170: hj = BDY(gh[j])->dl;
4171: _NEWDL(dl,nv); d = dl->d;
4172: r0 = r;
4173: for ( i = 0; i < lj; i++ ) {
4174: if ( mj[i] && !dl_equal(nv,di=mj[i]->dl,hj) ) {
4175: for ( k = 0, t = 0; k < nv; k++ ) {
4176: d[k] = hj->d[k]-di->d[k];
4177: t += d[k];
4178: }
4179: dl->td = t;
4180: #if 1
4181: for ( rt = r0; rt; rt = NEXT(rt) ) {
4182: dlt = (DL)BDY(rt);
4183: if ( dlt->td != dl->td ) continue;
4184: for ( dt = dlt->d, k = 0; k < nv; k++ )
4185: if ( d[k] != dt[k] ) break;
4186: if ( k == nv ) break;
4187: }
4188: #else
4189: rt = 0;
4190: #endif
4191: if ( !rt ) {
4192: MKNODE(r1,dl,r); r = r1;
4193: _NEWDL(dl,nv); d = dl->d;
4194: }
4195: }
4196: }
4197: }
4198: for ( rt = r; rt; rt = NEXT(rt) ) {
4199: dl = (DL)BDY(rt); d = dl->d;
4200: ri = 0;
4201: for ( k = nv-1; k >= 0; k-- ) {
1.2 noro 4202: STOZ(d[k],q);
1.1 noro 4203: MKNODE(r1,q,ri); ri = r1;
4204: }
4205: MKNODE(r1,0,ri); MKLIST(l,r1);
4206: BDY(rt) = (pointer)l;
4207: }
4208: return r;
4209: }
4210:
4211: int comp_bits_divisible(int *a,int *b,int n)
4212: {
4213: int bpi,i,wi,bi;
4214:
4215: bpi = (sizeof(int)/sizeof(char))*8;
4216: for ( i = 0; i < n; i++ ) {
4217: wi = i/bpi; bi = i%bpi;
4218: if ( !(a[wi]&(1<<bi)) && (b[wi]&(1<<bi)) ) return 0;
4219: }
4220: return 1;
4221: }
4222:
4223: int comp_bits_lex(int *a,int *b,int n)
4224: {
4225: int bpi,i,wi,ba,bb,bi;
4226:
4227: bpi = (sizeof(int)/sizeof(char))*8;
4228: for ( i = 0; i < n; i++ ) {
4229: wi = i/bpi; bi = i%bpi;
4230: ba = (a[wi]&(1<<bi))?1:0;
4231: bb = (b[wi]&(1<<bi))?1:0;
4232: if ( ba > bb ) return 1;
4233: else if ( ba < bb ) return -1;
4234: }
4235: return 0;
4236: }
4237:
4238: NODE mono_raddec(NODE ideal)
4239: {
4240: DP p;
4241: int nv,w,i,bpi,di,c,len;
4242: int *d,*s,*u,*new;
4243: NODE t,t1,v,r,rem,prev;
4244:
4245: if( !ideal ) return 0;
4246: p = (DP)BDY(ideal);
4247: nv = NV(p);
4248: bpi = (sizeof(int)/sizeof(char))*8;
4249: w = (nv+(bpi-1))/bpi;
4250: d = p->body->dl->d;
4251: if ( !NEXT(ideal) ) {
4252: for ( t = 0, i = nv-1; i >= 0; i-- ) {
4253: if ( d[i] ) {
4254: s = (int *)CALLOC(w,sizeof(int));
4255: s[i/bpi] |= 1<<(i%bpi);
4256: MKNODE(t1,s,t);
4257: t = t1;
4258: }
4259: }
4260: return t;
4261: }
4262: rem = mono_raddec(NEXT(ideal));
4263: r = 0;
4264: len = w*sizeof(int);
4265: u = (int *)CALLOC(w,sizeof(int));
4266: for ( i = nv-1; i >= 0; i-- ) {
4267: if ( d[i] ) {
4268: for ( t = rem; t; t = NEXT(t) ) {
4269: bcopy((char *)BDY(t),(char *)u,len);
4270: u[i/bpi] |= 1<<(i%bpi);
4271: for ( v = r; v; v = NEXT(v) ) {
4272: if ( comp_bits_divisible(u,(int *)BDY(v),nv) ) break;
4273: }
4274: if ( v ) continue;
4275: for ( v = r, prev = 0; v; v = NEXT(v) ) {
4276: if ( comp_bits_divisible((int *)BDY(v),u,nv) ) {
4277: if ( prev ) NEXT(prev) = NEXT(v);
4278: else r = NEXT(r);
4279: } else prev =v;
4280: }
4281: for ( v = r, prev = 0; v; prev = v, v = NEXT(v) ) {
4282: if ( comp_bits_lex(u,(int *)BDY(v),nv) < 0 ) break;
4283: }
4284: new = (int *)CALLOC(w,sizeof(int));
4285: bcopy((char *)u,(char *)new,len);
4286: MKNODE(t1,new,v);
4287: if ( prev ) NEXT(prev) = t1;
4288: else r = t1;
4289: }
4290: }
4291: }
4292: return r;
4293: }
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