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