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