![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to F.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / engine|
Return to F.c CVS log | Up to [local] / OpenXM_contrib2 / asir2000 / engine |
1.3 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
1.4 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.3 noro 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/asir2000/engine/F.c,v 1.5 2001/04/19 04:52:41 noro Exp $
1.3 noro 49: */
1.1 noro 50: #include "ca.h"
51: #include <math.h>
52:
53: void homfctr();
54:
55: void fctrp(vl,f,dcp)
56: VL vl;
57: P f;
58: DCP *dcp;
59: {
60: VL nvl;
61: DCP dc;
62:
63: if ( !f || NUM(f) ) {
64: NEWDC(dc); COEF(dc) = f; DEG(dc) = ONE;
65: NEXT(dc) = 0; *dcp = dc;
66: return;
67: } else if ( !qpcheck((Obj)f) )
68: error("fctrp : invalid argument");
69: else {
70: clctv(vl,f,&nvl);
71: if ( !NEXT(nvl) )
72: ufctr(f,1,dcp);
73: else
74: mfctr(nvl,f,dcp);
75: }
76: }
77:
78: void homfctr(vl,g,dcp)
79: VL vl;
80: P g;
81: DCP *dcp;
82: {
83: P s,t,u,f,h,x;
84: Q e;
85: int d,d0;
86: DCP dc,dct;
87:
88: substp(vl,g,vl->v,(P)ONE,&t); fctrp(vl,t,&dc); MKV(vl->v,x);
89: for ( dct = dc; dct; dct = NEXT(dct) )
90: if ( !NUM(dc->c) ) {
91: for ( s = 0, f = dc->c, d = d0 = homdeg(f); f; d = homdeg(f) ) {
92: exthp(vl,f,d,&h); STOQ(d0-d,e); pwrp(vl,x,e,&t);
93: mulp(vl,t,h,&u); addp(vl,s,u,&t); s = t;
94: subp(vl,f,h,&u); f = u;
95: }
96: dc->c = s;
97: }
98: *dcp = dc;
99: }
100:
101: void mfctr(vl,f,dcp)
102: VL vl;
103: P f;
104: DCP *dcp;
105: {
106: DCP dc,dc0,dct,dcs,dcr;
107: P p,pmin,ppmin,cmin,t;
108: VL mvl;
109: Q c;
110:
111: ptozp(f,1,&c,&p);
112: NEWDC(dc0); dc = dc0; COEF(dc) = (P)c; DEG(dc) = ONE; NEXT(dc) = 0;
113: msqfr(vl,p,&dct);
114: for ( ; dct; dct = NEXT(dct) ) {
115: mindegp(vl,COEF(dct),&mvl,&pmin);
116: #if 0
117: minlcdegp(vl,COEF(dct),&mvl,&pmin);
118: min_common_vars_in_coefp(vl,COEF(dct),&mvl,&pmin);
119: #endif
120: pcp(mvl,pmin,&ppmin,&cmin);
121: if ( !NUM(cmin) ) {
122: mfctrmain(mvl,cmin,&dcs);
123: for ( dcr = dcs; dcr; dcr = NEXT(dcr) ) {
124: DEG(dcr) = DEG(dct);
125: reorderp(vl,mvl,COEF(dcr),&t); COEF(dcr) = t;
126: }
127: for ( ; NEXT(dc); dc = NEXT(dc) );
128: NEXT(dc) = dcs;
129: }
130: mfctrmain(mvl,ppmin,&dcs);
131: for ( dcr = dcs; dcr; dcr = NEXT(dcr) ) {
132: DEG(dcr) = DEG(dct);
133: reorderp(vl,mvl,COEF(dcr),&t); COEF(dcr) = t;
134: }
135: for ( ; NEXT(dc); dc = NEXT(dc) );
136: NEXT(dc) = dcs;
137: }
138: adjsgn(f,dc0); *dcp = dc0;
139: }
140:
1.2 noro 141: #if 0
1.1 noro 142: void adjsgn(p,dc)
143: P p;
144: DCP dc;
145: {
146: int sgn;
147: DCP dct;
148: P c;
149:
150: for ( dct = dc, sgn = headsgn(p); dct; dct = NEXT(dct) )
151: if ( !EVENN(NM(dct->d)) )
152: sgn *= headsgn(COEF(dct));
153: if ( sgn < 0 ) {
154: chsgnp(COEF(dc),&c); COEF(dc) = c;
155: }
156: }
1.2 noro 157: #else
158: void adjsgn(p,dc)
159: P p;
160: DCP dc;
161: {
162: int sgn;
163: DCP dct;
164: P c;
165:
166: if ( headsgn(COEF(dc)) != headsgn(p) ) {
167: chsgnp(COEF(dc),&c); COEF(dc) = c;
168: }
169: for ( dct = NEXT(dc); dct; dct = NEXT(dct) )
170: if ( headsgn(COEF(dct)) < 0 ) {
171: chsgnp(COEF(dct),&c); COEF(dct) = c;
172: }
173: }
174: #endif
1.1 noro 175:
176: int headsgn(p)
177: P p;
178: {
179: if ( !p )
180: return 0;
181: else {
182: while ( !NUM(p) )
183: p = COEF(DC(p));
184: return SGN((Q)p);
185: }
186: }
187:
188: void fctrwithmvp(vl,f,v,dcp)
189: VL vl;
190: P f;
191: V v;
192: DCP *dcp;
193: {
194: VL nvl;
195: DCP dc;
196:
197: if ( NUM(f) ) {
198: NEWDC(dc); COEF(dc) = f; DEG(dc) = ONE;
199: NEXT(dc) = 0; *dcp = dc;
200: return;
201: }
202:
203: clctv(vl,f,&nvl);
204: if ( !NEXT(nvl) )
205: ufctr(f,1,dcp);
206: else
207: mfctrwithmv(nvl,f,v,dcp);
208: }
209:
210: void mfctrwithmv(vl,f,v,dcp)
211: VL vl;
212: P f;
213: V v;
214: DCP *dcp;
215: {
216: DCP dc,dc0,dct,dcs,dcr;
217: P p,pmin,ppmin,cmin,t;
218: VL mvl;
219: Q c;
220:
221: ptozp(f,1,&c,&p);
222: NEWDC(dc0); dc = dc0; COEF(dc) = (P)c; DEG(dc) = ONE; NEXT(dc) = 0;
223: msqfr(vl,p,&dct);
224: for ( ; dct; dct = NEXT(dct) ) {
225: if ( !v )
226: mindegp(vl,COEF(dct),&mvl,&pmin);
227: else {
228: reordvar(vl,v,&mvl); reorderp(mvl,vl,COEF(dct),&pmin);
229: }
230: pcp(mvl,pmin,&ppmin,&cmin);
231: if ( !NUM(cmin) ) {
232: mfctrmain(mvl,cmin,&dcs);
233: for ( dcr = dcs; dcr; dcr = NEXT(dcr) ) {
234: DEG(dcr) = DEG(dct);
235: reorderp(vl,mvl,COEF(dcr),&t); COEF(dcr) = t;
236: }
237: for ( ; NEXT(dc); dc = NEXT(dc) );
238: NEXT(dc) = dcs;
239: }
240: mfctrmain(mvl,ppmin,&dcs);
241: for ( dcr = dcs; dcr; dcr = NEXT(dcr) ) {
242: DEG(dcr) = DEG(dct);
243: reorderp(vl,mvl,COEF(dcr),&t); COEF(dcr) = t;
244: }
245: for ( ; NEXT(dc); dc = NEXT(dc) );
246: NEXT(dc) = dcs;
247: }
248: *dcp = dc0;
249: }
250:
251: void ufctr(f,hint,dcp)
252: P f;
253: int hint;
254: DCP *dcp;
255: {
256: P p,c;
257: DCP dc,dct,dcs,dcr;
258:
259: ptozp(f,SGN((Q)UCOEF(f)),(Q *)&c,&p);
260: NEWDC(dc); COEF(dc) = c; DEG(dc) = ONE; NEXT(dc) = 0;
261: usqp(p,&dct);
262: for ( *dcp = dc; dct; dct = NEXT(dct) ) {
263: ufctrmain(COEF(dct),hint,&dcs);
264: for ( dcr = dcs; dcr; dcr = NEXT(dcr) )
265: DEG(dcr) = DEG(dct);
266: for ( ; NEXT(dc); dc = NEXT(dc) );
267: NEXT(dc) = dcs;
268: }
269: }
270:
271: void mfctrmain(vl,p,dcp)
272: VL vl;
273: P p;
274: DCP *dcp;
275: {
1.5 noro 276: int i,j,k,*win,np,x;
1.1 noro 277: VL nvl,tvl;
278: VN vn,vnt,vn1;
279: P p0,f,g,f0,g0,s,t,lp,m;
280: P *fp0,*fpt,*l,*tl;
281: DCP dc,dc0,dcl;
282: int count,nv;
1.5 noro 283: int *nonzero;
1.1 noro 284:
285: if ( !cmpq(DEG(DC(p)),ONE) ) {
286: NEWDC(dc); DEG(dc) = ONE; COEF(dc) = p; NEXT(dc) = 0;
287: *dcp = dc; return;
288: }
289: lp = LC(p); fctrp(vl,lp,&dcl); clctv(vl,p,&nvl);
290: for ( nv = 0, tvl = nvl; tvl; tvl = NEXT(tvl), nv++);
291: W_CALLOC(nv,struct oVN,vn); W_CALLOC(nv,struct oVN,vnt);
292: W_CALLOC(nv,struct oVN,vn1);
1.5 noro 293: W_CALLOC(nv,int,nonzero);
294:
1.1 noro 295: for ( i = 0, tvl = NEXT(nvl); tvl; tvl = NEXT(tvl), i++ )
296: vn1[i].v = vn[i].v = tvl->v;
297: vn1[i].v = vn[i].v = 0;
1.5 noro 298:
299: /* determine a heuristic bound of deg(GCD(p,p')) */
300: while ( 1 ) {
301: for ( i = 0; vn1[i].v; i++ )
302: vn1[i].n = ((unsigned int)random())%256+1;
303: substvp(nvl,LC(p),vn1,&p0);
304: if ( p0 ) {
305: substvp(nvl,p,vn1,&p0);
306: if ( sqfrchk(p0) ) {
307: ufctr(p0,1,&dc0);
308: if ( NEXT(NEXT(dc0)) == 0 ) {
309: NEWDC(dc); DEG(dc) = ONE; COEF(dc) = p; NEXT(dc) = 0;
310: *dcp = dc;
311: return;
312: } else {
313: for ( dc0 = NEXT(dc0), np = 0; dc0; dc0 = NEXT(dc0), np++ );
314: break;
315: }
316: }
317: }
318: }
319:
1.6 ! noro 320: /* determine the position of variables which is not allowed to
! 321: be set to 0 */
1.5 noro 322: for ( i = 0; vn1[i].v; i++ ) {
323: x = vn1[i].n; vn1[i].n = 0;
324: substvp(nvl,LC(p),vn1,&p0);
325: if ( !p0 )
326: vn1[i].n = x;
327: else {
328: substvp(nvl,p,vn1,&p0);
329: if ( !sqfrchk(p0) )
330: vn1[i].n = x;
331: else {
332: ufctr(p0,1,&dc0);
333: for ( dc0 = NEXT(dc0), j = 0; dc0; dc0 = NEXT(dc0), j++ );
334: if ( j > np )
335: vn1[i].n = x;
336: }
337: }
338: }
339: for ( i = 0; vn1[i].v; i++ )
340: if (vn1[i].n )
341: nonzero[i] = 1;
342:
1.1 noro 343: count = 0;
344: while ( 1 ) {
345: while ( 1 ) {
346: count++;
347: for ( i = 0, j = 0; vn[i].v; i++ )
348: if ( vn[i].n )
349: vnt[j++].v = (V)i;
350: vnt[j].n = 0; mulsgn(vn,vnt,j,vn1);
351: for ( i = 0; vn1[i].v; i++ )
352: if ( vn1[i].n ) {
353: if ( vn1[i].n > 0 )
354: vn1[i].n = sprime[vn1[i].n];
355: else
356: vn1[i].n = -sprime[-vn1[i].n];
357: }
358: if ( valideval(nvl,dcl,vn1) ) {
359: substvp(nvl,p,vn1,&p0);
360: if ( sqfrchk(p0) ) {
361: ufctr(p0,1,&dc0);
362: if ( NEXT(NEXT(dc0)) == 0 ) {
363: NEWDC(dc); DEG(dc) = ONE; COEF(dc) = p; NEXT(dc) = 0;
364: *dcp = dc;
365: return;
1.5 noro 366: } else {
367: for ( dc = NEXT(dc0), i = 0; dc; dc = NEXT(dc), i++ );
368: if ( i <= np )
369: goto MAIN;
370: if ( i < np )
371: np = i;
372: }
373: }
1.1 noro 374: }
375: if ( nextbin(vnt,j) )
376: break;
377: }
1.5 noro 378: while ( 1 ) {
379: next(vn);
380: for ( i = 0; vn[i].v; i++ )
381: if ( nonzero[i] && !vn[i].n )
382: break;
383: if ( !vn[i].v )
384: break;
385: }
1.1 noro 386: }
387: MAIN :
388: #if 0
389: for ( i = 0; vn1[i].v; i++ )
390: fprintf(stderr,"%d ",vn1[i].n);
391: fprintf(stderr,"\n");
392: #endif
393: for ( np = 0, dc = NEXT(dc0); dc; dc = NEXT(dc), np++ );
394: fp0 = (P *)ALLOCA((np + 1)*sizeof(P));
395: fpt = (P *)ALLOCA((np + 1)*sizeof(P));
396: l = tl = (P *)ALLOCA((np + 1)*sizeof(P));
397: for ( i = 1, dc = NEXT(dc0); dc; i++, dc = NEXT(dc) )
398: fp0[i-1] = COEF(dc);
399: #if 0
400: sort_by_deg(np,fp0,fpt);
401: sort_by_deg_rev(np-1,fpt+1,fp0+1);
402: #endif
403: #if 0
404: sort_by_deg_rev(np,fp0,fpt); fp0[0] = fpt[0];
405: sort_by_deg(np-1,fpt+1,fp0+1); fp0[np] = 0;
406: #endif
407: fp0[np] = 0;
408: win = W_ALLOC(np + 1); f = p; divsp(vl,p0,COEF(dc0),&f0);
409: for ( k = 1, win[0] = 1, --np; ; ) {
410: P h0,lcg,lch;
411: Q c;
412:
413: g0 = fp0[win[0]];
414: for ( i = 1; i < k; i++ ) {
415: mulp(vl,g0,fp0[win[i]],&m); g0 = m;
416: }
417: mulq((Q)LC(g0),(Q)COEF(dc0),&c); estimatelc(nvl,c,dcl,vn1,&lcg);
418: divsp(nvl,f0,g0,&h0);
419: mulq((Q)LC(h0),(Q)COEF(dc0),&c); estimatelc(nvl,c,dcl,vn1,&lch);
420: mfctrhen2(nvl,vn1,f,f0,g0,h0,lcg,lch,&g);
421: if ( g ) {
422: *tl++ = g; divsp(vl,f,g,&t);
423: f = t; divsp(vl,f0,g0,&t); ptozp(t,1,(Q *)&s,&f0);
424: for ( i = 0; i < k - 1; i++ )
425: for ( j = win[i] + 1; j < win[i + 1]; j++ )
426: fp0[j - i - 1] = fp0[j];
427: for ( j = win[k - 1] + 1; j <= np; j++ )
428: fp0[j - k] = fp0[j];
429: if ( ( np -= k ) < k ) break;
430: if ( np - win[0] + 1 < k )
431: if ( ++k <= np ) {
432: for ( i = 0; i < k; i++ ) win[i] = i + 1;
433: continue;
434: } else
435: break;
436: else for ( i = 1; i < k; i++ ) win[i] = win[0] + i;
437: } else {
438: if ( ncombi(1,np,k,win) == 0 )
439: if ( k == np ) break;
440: else for ( i = 0, ++k; i < k; i++ ) win[i] = i + 1;
441: }
442: }
443: *tl++ = f; *tl = 0;
444: for ( dc0 = 0; *l; l++ ) {
445: NEXTDC(dc0,dc); DEG(dc) = ONE; COEF(dc) = *l;
446: }
447: NEXT(dc) = 0; *dcp = dc0;
448: }
449:
450: void ufctrmain(p,hint,dcp)
451: P p;
452: int hint;
453: DCP *dcp;
454: {
455: ML list;
456: DCP dc;
457:
458: if ( NUM(p) || (UDEG(p) == 1) ) {
459: NEWDC(dc); DEG(dc) = ONE; COEF(dc) = p; NEXT(dc) = 0;
460: *dcp = dc;
461: } else if ( iscycm(p) )
462: cycm(VR(p),UDEG(p),dcp);
463: else if ( iscycp(p) )
464: cycp(VR(p),UDEG(p),dcp);
465: else {
466: hensel(5,5,p,&list);
467: if ( list->n == 1 ) {
468: NEWDC(dc); DEG(dc) = ONE; COEF(dc) = p; NEXT(dc) = 0;
469: *dcp = dc;
470: } else
471: dtest(p,list,hint,dcp);
472: }
473: }
474:
475: struct oMF {
476: int m;
477: P f;
478: };
479:
480: void calcphi();
481:
482: void cycm(v,n,dcp)
483: V v;
484: register int n;
485: DCP *dcp;
486: {
487: register int i,j;
488: struct oMF *mfp;
489: DCP dc,dc0;
490:
491: if ( n == 1 ) {
492: NEWDC(dc); mkssum(v,1,1,-1,&COEF(dc)); DEG(dc) = ONE;
493: } else {
494: mfp = (struct oMF *) ALLOCA((n+1)*sizeof(struct oMF));
495: bzero((char *)mfp,(int)(sizeof(struct oMF)*(n+1)));
496: for ( i = 1, j = 0; i <= n; i++ )
497: if ( !(n%i) ) mfp[j++].m = i;
498: mkssum(v,1,1,-1,&mfp[0].f);
499: for ( i = 1; i < j; i++ )
500: calcphi(v,i,mfp);
501: for ( dc0 = 0, i = 0; i < j; i++ ) {
502: NEXTDC(dc0,dc); COEF(dc) = mfp[i].f; DEG(dc) = ONE;
503: }
504: }
505: NEXT(dc) = 0; *dcp = dc0;
506: }
507:
508: void cycp(v,n,dcp)
509: V v;
510: register int n;
511: DCP *dcp;
512: {
513: register int i,j;
514: int n0;
515: struct oMF *mfp;
516: DCP dc,dc0;
517:
518: if ( n == 1 ) {
519: NEWDC(dc); mkssum(v,1,1,1,&COEF(dc)); DEG(dc) = ONE;
520: } else {
521: n0 = n; n *= 2;
522: mfp = (struct oMF *) ALLOCA((n+1)*sizeof(struct oMF));
523: bzero((char *)mfp,(int)(sizeof(struct oMF)*(n+1)));
524: for ( i = 1, j = 0; i <= n; i++ )
525: if ( !(n%i) ) mfp[j++].m = i;
526: mkssum(v,1,1,-1,&mfp[0].f);
527: for ( i = 1; i < j; i++ )
528: calcphi(v,i,mfp);
529: for ( dc0 = 0, i = 0; i < j; i++ )
530: if ( n0 % mfp[i].m ) {
531: NEXTDC(dc0,dc); COEF(dc) = mfp[i].f; DEG(dc) = ONE;
532: }
533: }
534: NEXT(dc) = 0; *dcp = dc0;
535: }
536:
537: void calcphi(v,n,mfp)
538: V v;
539: int n;
540: register struct oMF *mfp;
541: {
542: register int i,m;
543: P t,s,tmp;
544:
545: for ( t = (P)ONE, i = 0, m = mfp[n].m; i < n; i++ )
546: if ( !(m%mfp[i].m) ) {
547: mulp(CO,t,mfp[i].f,&s); t = s;
548: }
549: mkssum(v,m,1,-1,&s); udivpz(s,t,&mfp[n].f,&tmp);
550: if ( tmp )
551: error("calcphi: cannot happen");
552: }
553:
554: void mkssum(v,e,s,sgn,r)
555: V v;
556: int e,s,sgn;
557: P *r;
558: {
559: register int i,sgnt;
560: DCP dc,dc0;
561: Q q;
562:
563: for ( dc0 = 0, i = s, sgnt = 1; i >= 0; i--, sgnt *= sgn ) {
564: if ( !dc0 ) {
565: NEWDC(dc0); dc = dc0;
566: } else {
567: NEWDC(NEXT(dc)); dc = NEXT(dc);
568: }
569: STOQ(i*e,DEG(dc)); STOQ(sgnt,q),COEF(dc) = (P)q;
570: }
571: NEXT(dc) = 0; MKP(v,dc0,*r);
572: }
573:
574: int iscycp(f)
575: P f;
576: {
577: DCP dc;
578: dc = DC(f);
579:
580: if ( !UNIQ((Q)COEF(dc)) )
581: return ( 0 );
582: dc = NEXT(dc);
583: if ( NEXT(dc) || DEG(dc) || !UNIQ((Q)COEF(dc)) )
584: return ( 0 );
585: return ( 1 );
586: }
587:
588: int iscycm(f)
589: P f;
590: {
591: DCP dc;
592:
593: dc = DC(f);
594: if ( !UNIQ((Q)COEF(dc)) )
595: return ( 0 );
596: dc = NEXT(dc);
597: if ( NEXT(dc) || DEG(dc) || !MUNIQ((Q)COEF(dc)) )
598: return ( 0 );
599: return ( 1 );
600: }
601:
602: void sortfs(dcp)
603: DCP *dcp;
604: {
605: int i,k,n,k0,d;
606: DCP dc,dct,t;
607: DCP *a;
608:
609: dc = *dcp;
610: for ( n = 0, dct = dc; dct; dct = NEXT(dct), n++ );
611: a = (DCP *)ALLOCA((n+1)*(sizeof(DCP)));
612: for ( i = 0, dct = dc; dct; dct = NEXT(dct), i++ )
613: a[i] = dct;
614: a[n] = 0;
615:
616: for ( i = 0; i < n; i++ ) {
617: for ( k0 = k = i, d = UDEG(COEF(a[i])); k < n; k++ )
618: if ( (int)UDEG(COEF(a[k])) < d ) {
619: k0 = k;
620: d = UDEG(COEF(a[k]));
621: }
622: if ( i != k0 ) {
623: t = a[i]; a[i] = a[k0]; a[k0] = t;
624: }
625: }
626: for ( *dcp = dct = a[0], i = 1; i < n; i++ )
627: dct = NEXT(dct) = a[i];
628: NEXT(dct) = 0;
629: }
630:
631: void sortfsrev(dcp)
632: DCP *dcp;
633: {
634: int i,k,n,k0,d;
635: DCP dc,dct,t;
636: DCP *a;
637:
638: dc = *dcp;
639: for ( n = 0, dct = dc; dct; dct = NEXT(dct), n++ );
640: a = (DCP *)ALLOCA((n+1)*(sizeof(DCP)));
641: for ( i = 0, dct = dc; dct; dct = NEXT(dct), i++ )
642: a[i] = dct;
643: a[n] = 0;
644:
645: for ( i = 0; i < n; i++ ) {
646: for ( k0 = k = i, d = UDEG(COEF(a[i])); k < n; k++ )
647: if ( (int)UDEG(COEF(a[k])) > d ) {
648: k0 = k;
649: d = UDEG(COEF(a[k]));
650: }
651: if ( i != k0 ) {
652: t = a[i]; a[i] = a[k0]; a[k0] = t;
653: }
654: }
655: for ( *dcp = dct = a[0], i = 1; i < n; i++ )
656: dct = NEXT(dct) = a[i];
657: NEXT(dct) = 0;
658: }
659:
660: void nthrootchk(f,dc,fp,dcp)
661: P f;
662: struct oDUM *dc;
663: ML fp;
664: DCP *dcp;
665: {
666: register int i,k;
667: int e,n,dr,tmp,t;
668: int *tmpp,**tmppp;
669: int **pp,**wpp;
670: LUM fpa,tpa,f0l;
671: UM wt,wq,ws,dvr,f0,fe;
672: N lc;
673: int lcm;
674: int m,b;
675:
676: m = fp->mod; b = fp->bound; fe = *((UM *)fp->c);
677: e = dc->n; f0 = dc->f; nthrootn(NM((Q)COEF(DC(f))),e,&lc);
678: if ( !lc ) {
679: *dcp = 0;
680: return;
681: }
682: lcm = rem(lc,m); W_LUMALLOC(DEG(f0),b,f0l);
683: for ( i = DEG(f0), tmppp = COEF(f0l), tmpp = COEF(f0);
684: i >= 0; i-- )
685: *(tmppp[i]) = dmb(m,tmpp[i],lcm,&tmp);
686: dtestroot(m,1,f,f0l,dc,dcp);
687: if ( *dcp )
688: return;
689: n = UDEG(f); W_LUMALLOC(n,b,fpa); W_LUMALLOC(n,b,tpa);
690: ptolum(m,b,f,fpa);
691: dvr = W_UMALLOC(n); wq = W_UMALLOC(n);
692: wt = W_UMALLOC(n); ws = W_UMALLOC(n);
693: cpyum(fe,dvr); divum(m,dvr,f0,wq);
694: t = dmb(m,pwrm(m,lcm,e-1),e,&tmp); DEG(dvr) = DEG(wq);
695: for ( k = 0; k <= DEG(wq); k++ )
696: COEF(dvr)[k] = dmb(m,COEF(wq)[k],t,&tmp);
697: for ( i = 1; i < b; i++ ) {
698: pwrlum(m,i+1,f0l,e,tpa);
699: for ( k = 0, pp = COEF(fpa), wpp = COEF(tpa);
700: k <= n; k++ )
701: COEF(wt)[k] = (pp[k][i]-wpp[k][i]+m)%m;
702: degum(wt,n); dr = divum(m,wt,dvr,ws);
703: if ( dr >= 0 ) {
704: *dcp = 0;
705: return;
706: }
707: for ( k = 0, pp = COEF(f0l); k <= DEG(ws); k++ )
708: pp[k][i] = COEF(ws)[k];
709: dtestroot(m,i+1,f,f0l,dc,dcp);
710: if ( *dcp )
711: return;
712: }
713: }
714:
715: void sqfrp(vl,f,dcp)
716: VL vl;
717: P f;
718: DCP *dcp;
719: {
720: P c,p;
721: DCP dc,dc0;
722:
723: if ( !f || NUM(f) ) {
724: NEWDC(dc0); *dcp = dc0; DEG(dc0) = ONE;
725: COEF(dc0) = f; NEXT(dc0) = 0;
726: } else if ( !qpcheck((Obj)f) )
727: error("sqfrp : invalid argument");
728: else {
729: NEWDC(dc0); *dcp = dc0; DEG(dc0) = ONE;
730: ptozp(f,1,(Q *)&c,&p); msqfr(vl,p,&dc);
731: COEF(dc0) = c; NEXT(dc0) = dc;
732: adjsgn(f,dc0);
733: }
734: }
735:
736: /*
737: * f : must be a poly with int coef, ignore int content
738: */
739: void msqfr(vl,f,dcp)
740: VL vl;
741: P f;
742: DCP *dcp;
743: {
744: DCP dc,dct,dcs;
745: P c,p,t,s,pc;
746: VL mvl;
747:
748: ptozp(f,1,(Q *)&c,&t); monomialfctr(vl,t,&p,&dc);
749: if ( NUM(p) ) {
750: *dcp = dc;
751: return;
752: }
753: mindegp(vl,p,&mvl,&s);
754: #if 0
755: minlcdegp(vl,p,&mvl,&s);
756: min_common_vars_in_coefp(vl,p,&mvl,&s);
757: #endif
758: pcp(mvl,s,&p,&pc);
759: if ( !NUM(pc) ) {
760: msqfr(mvl,pc,&dcs);
761: if ( !dc )
762: dc = dcs;
763: else {
764: for ( dct = dc; NEXT(dct); dct = NEXT(dct) );
765: NEXT(dct) = dcs;
766: }
767: }
768: msqfrmain(mvl,p,&dcs);
769: for ( dct = dcs; dct; dct = NEXT(dct) ) {
770: reorderp(vl,mvl,COEF(dct),&t); COEF(dct) = t;
771: }
772: if ( !dc )
773: *dcp = dcs;
774: else {
775: for ( dct = dc; NEXT(dct); dct = NEXT(dct) );
776: NEXT(dct) = dcs; *dcp = dc;
777: }
778: }
779:
780: void usqp(f,dcp)
781: P f;
782: DCP *dcp;
783: {
784: int index,nindex;
785: P g,c,h;
786: DCP dc;
787:
788: ptozp(f,1,(Q *)&c,&h);
789: if ( SGN((Q)LC(h)) < 0 )
790: chsgnp(h,&g);
791: else
792: g = h;
793: for ( index = 0, dc = 0; !dc; index = nindex )
794: hsq(index,5,g,&nindex,&dc);
795: *dcp = dc;
796: }
797:
798: void msqfrmain(vl,p,dcp)
799: VL vl;
800: P p;
801: DCP *dcp;
802: {
803: int i,j;
804: VL nvl,tvl;
805: VN vn,vnt,vn1;
806: P gg,tmp,p0,g;
807: DCP dc,dc0,dcr,dcr0;
808: int nv,d,d1;
809: int found;
810: VN svn1;
811: P sp0;
812: DCP sdc0;
813:
814: if ( deg(VR(p),p) == 1 ) {
815: NEWDC(dc); DEG(dc) = ONE; COEF(dc) = p; NEXT(dc) = 0;
816: *dcp = dc;
817: return;
818: }
819: clctv(vl,p,&nvl);
820: for ( nv = 0, tvl = nvl; tvl; tvl = NEXT(tvl), nv++);
821: if ( nv == 1 ) {
822: usqp(p,dcp);
823: return;
824: }
825: #if 0
826: if ( heusqfrchk(nvl,p) ) {
827: NEWDC(dc); DEG(dc) = ONE; COEF(dc) = p; NEXT(dc) = 0;
828: *dcp = dc;
829: return;
830: }
831: #endif
832: W_CALLOC(nv,struct oVN,vn);
833: W_CALLOC(nv,struct oVN,vnt);
834: W_CALLOC(nv,struct oVN,vn1);
835: W_CALLOC(nv,struct oVN,svn1);
836: for ( i = 0, tvl = NEXT(nvl); tvl; tvl = NEXT(tvl), i++ )
837: vn1[i].v = vn[i].v = tvl->v;
838: vn1[i].v = vn[i].v = 0;
1.5 noro 839:
840: /* determine a heuristic bound of deg(GCD(p,p')) */
841: while ( 1 ) {
842: for ( i = 0; vn1[i].v; i++ )
843: vn1[i].n = ((unsigned int)random())%256+1;
844: substvp(nvl,LC(p),vn1,&tmp);
845: if ( tmp ) {
846: substvp(nvl,p,vn1,&p0);
847: usqp(p0,&dc0);
848: for ( d1 = 0, dc = dc0; dc; dc = NEXT(dc) )
849: if ( DEG(dc) )
850: d1 += (QTOS(DEG(dc))-1)*UDEG(COEF(dc));
851: if ( d1 == 0 ) {
852: /* p is squarefree */
853: NEWDC(dc); DEG(dc) = ONE; COEF(dc) = p; NEXT(dc) = 0;
854: *dcp = dc;
855: return;
856: } else {
857: d = d1;
1.6 ! noro 858: found = 1;
! 859: sp0 = p0; sdc0 = dc0;
! 860: bcopy((char *)vn1,(char *)svn1,(int)(sizeof(struct oVN)*nv));
1.5 noro 861: break;
862: }
863: }
864: }
1.1 noro 865:
1.6 ! noro 866: for ( dcr0 = 0, g = p; ; ) {
1.1 noro 867: while ( 1 ) {
868: for ( i = 0, j = 0; vn[i].v; i++ )
869: if ( vn[i].n ) vnt[j++].v = (V)i;
870: vnt[j].n = 0;
871:
872: mulsgn(vn,vnt,j,vn1);
873: substvp(nvl,LC(g),vn1,&tmp);
874: if ( tmp ) {
875: substvp(nvl,g,vn1,&p0);
876: usqp(p0,&dc0);
877: for ( d1 = 0, dc = dc0; dc; dc = NEXT(dc) )
878: if ( DEG(dc) )
879: d1 += (QTOS(DEG(dc))-1)*UDEG(COEF(dc));
880:
881: if ( d1 == 0 ) {
882: NEWDC(dc); DEG(dc) = ONE; COEF(dc) = g; NEXT(dc) = 0;
883: if ( !dcr0 )
884: dcr0 = dc;
885: else
886: NEXT(dcr) = dc;
887: *dcp = dcr0;
888: return;
889: }
890:
891: if ( d < d1 )
892: goto END;
893: if ( d > d1 ) {
894: d = d1;
895: found = 1;
896: bcopy((char *)vn1,(char *)svn1,(int)(sizeof(struct oVN)*nv));
897: sp0 = p0; sdc0 = dc0;
898: goto END;
899: }
900: /* d1 == d */
901: if ( found ) {
902: found = 0;
903: #if 0
904: if ( d > d1 ) {
905: d = d1;
906: /*} */
907: #endif
908: msqfrmainmain(nvl,g,svn1,sp0,sdc0,&dc,&gg); g = gg;
909: if ( dc ) {
910: if ( !dcr0 )
911: dcr0 = dc;
912: else
913: NEXT(dcr) = dc;
914: for ( dcr = dc; NEXT(dcr); dcr = NEXT(dcr) );
915: if ( NUM(g) ) {
916: NEXT(dcr) = 0; *dcp = dcr0;
917: return;
918: }
919: d = deg(VR(g),g);
920: }
921: }
922: }
923: END:
924: if ( nextbin(vnt,j) )
925: break;
926: }
927: next(vn);
928: }
929: }
930:
931: void msqfrmainmain(vl,p,vn,p0,dc0,dcp,pp)
932: VL vl;
933: P p;
934: VN vn;
935: P p0;
936: DCP dc0;
937: DCP *dcp;
938: P *pp;
939: {
940: int i,j,k,np;
941: DCP *a;
942: DCP dc,dcr,dcr0,dct;
943: P g,t,s,u,t0,f,f0,d,d0,g0,h0,x,xx;
944: Q q;
945: V v;
946:
947: for ( np = 0, dc = dc0; dc; dc = NEXT(dc), np++ );
948: a = (DCP *)ALLOCA((np + 1)*sizeof(DCP));
949: for ( i = 0, dc = dc0; dc; i++, dc = NEXT(dc) )
950: a[np-i-1] = dc;
951:
952: for ( i = 0, dcr0 = 0, f = p, f0 = p0, v = VR(p);
953: i < np; i++ ) {
954: if ( (i == (np-1))&&UNIQ(DEG(a[i])) ) {
955: NEXTDC(dcr0,dcr);
956: DEG(dcr) = DEG(a[i]);
957: COEF(dcr) = f;
958: f = (P)ONE;
959: } else if ( (i == (np-1))&&UNIQ(DEG(DC(COEF(a[i])))) ) {
960: diffp(vl,f,v,&s); pcp(vl,s,&t,&u);
961: if ( divtpz(vl,f,t,&s) ) {
962: NEXTDC(dcr0,dcr);
963: DEG(dcr) = DEG(a[i]);
964: COEF(dcr) = s;
965: f = (P)ONE;
966: } else
967: break;
968: } else {
969: for ( t = f, t0 = f0,
970: j = 0, k = QTOS(DEG(a[i]))-1; j < k; j++ ) {
971: diffp(vl,t,v,&s); t = s;
972: diffp(vl,t0,v,&s); t0 = s;
973: }
974: factorial(k,&q);
975: divsp(vl,t,(P)q,&s);
976: for ( dct = DC(s); NEXT(dct); dct = NEXT(dct) );
977: if ( DEG(dct) ) {
978: MKV(VR(s),x); pwrp(vl,x,DEG(dct),&xx);
979: divsp(vl,s,xx,&d);
980: } else {
981: xx = (P)ONE; d = s;
982: }
983: divsp(vl,t0,xx,&t);
984: divsp(vl,t,(P)q,&s);
985: ptozp(s,1,(Q *)&t,&d0);
986:
987: for ( dct = DC(COEF(a[i])); NEXT(dct); dct = NEXT(dct) );
988: if ( DEG(dct) )
989: divsp(vl,COEF(a[i]),xx,&g0);
990: else {
991: xx = (P)ONE; g0 = COEF(a[i]);
992: }
993:
994: pcp(vl,d,&t,&u); d = t;
995: ptozp(g0,1,(Q *)&u,&t); g0 = t;
996:
997: {
998: DCP dca,dcb;
999:
1000: fctrp(vl,LC(d),&dca);
1001: for ( dcb = dca, u = (P)ONE; dcb; dcb = NEXT(dcb) ) {
1002: if ( NUM(COEF(dcb)) ) {
1003: mulp(vl,u,COEF(dcb),&t); u = t;
1004: } else {
1005: Q qq;
1006: P tt;
1007:
1008: pwrp(vl,COEF(dcb),DEG(a[i]),&s);
1009: for ( t = LC(f), j = 0; divtpz(vl,t,s,&tt); j++, t = tt );
1010: STOQ(j,qq);
1011: if ( cmpq(qq,DEG(dcb)) > 0 )
1012: qq = DEG(dcb);
1013: pwrp(vl,COEF(dcb),qq,&t); mulp(vl,u,t,&s); u = s;
1014: }
1015: }
1016: divsp(vl,d0,g0,&h0);
1017: }
1018: mfctrhen2(vl,vn,d,d0,g0,h0,u,LC(d),&s);
1019: if ( s ) {
1020: mulp(vl,s,xx,&g);
1021: pwrp(vl,g,DEG(a[i]),&t);
1022: if ( divtpz(vl,f,t,&s) ) {
1023: NEXTDC(dcr0,dcr);
1024: DEG(dcr) = DEG(a[i]); COEF(dcr) = g;
1025: f = s; substvp(vl,f,vn,&f0);
1026: } else
1027: break;
1028: } else
1029: break;
1030: }
1031: }
1032: *pp = f;
1033: if ( dcr0 )
1034: NEXT(dcr) = 0;
1035: *dcp = dcr0;
1036: }
1037:
1038: void mfctrhen2(vl,vn,f,f0,g0,h0,lcg,lch,gp)
1039: VL vl;
1040: VN vn;
1041: P f;
1042: P f0,g0,h0,lcg,lch;
1043: P *gp;
1044: {
1045: V v;
1046: P f1,lc,lc0,lcg0,lch0;
1047: P m,ff0,gg0,hh0,gk,hk,ggg,gggr,hhh,ak,bk,tmp;
1048: Q bb,qk,s;
1049: Q cbd;
1050: int dbd;
1051: int d;
1052:
1053: if ( NUM(g0) ) {
1054: *gp = (P)ONE;
1055: return;
1056: }
1057:
1058: v = VR(f); d = deg(v,f);
1059: if ( d == deg(v,g0) ) {
1060: pcp(vl,f,gp,&tmp);
1061: return;
1062: }
1063:
1064: mulp(vl,lcg,lch,&lc);
1065: if ( !divtpz(vl,lc,LC(f),(P *)&s) ) {
1066: *gp = 0;
1067: return;
1068: }
1069: mulp(vl,(P)s,f,&f1);
1070: dbd = dbound(VR(f1),f1) + 1; cbound(vl,f1,&cbd);
1071:
1072: substvp(vl,lc,vn,&lc0);
1073: divq((Q)lc0,(Q)LC(f0),(Q *)&m); mulp(vl,f0,m,&ff0);
1074: substvp(vl,lcg,vn,&lcg0);
1075: divq((Q)lcg0,(Q)LC(g0),(Q *)&m); mulp(vl,g0,m,&gg0);
1076: substvp(vl,lch,vn,&lch0);
1077: divq((Q)lch0,(Q)LC(h0),(Q *)&m); mulp(vl,h0,m,&hh0);
1078: addq(cbd,cbd,&bb);
1079: henzq1(gg0,hh0,bb,&bk,&ak,&qk); gk = gg0; hk = hh0;
1080: henmv(vl,vn,f1,gk,hk,ak,bk,
1081: lcg,lch,lcg0,lch0,qk,dbd,&ggg,&hhh);
1082:
1083: if ( divtpz(vl,f1,ggg,&gggr) )
1084: pcp(vl,ggg,gp,&tmp);
1085: else
1086: *gp = 0;
1087: }
1088:
1089: int sqfrchk(p)
1090: P p;
1091: {
1092: Q c;
1093: P f;
1094: DCP dc;
1095:
1096: ptozp(p,SGN((Q)UCOEF(p)),&c,&f); usqp(f,&dc);
1097: if ( NEXT(dc) || !UNIQ(DEG(dc)) )
1098: return ( 0 );
1099: else
1100: return ( 1 );
1101: }
1102:
1103: int cycchk(p)
1104: P p;
1105: {
1106: Q c;
1107: P f;
1108:
1109: ptozp(p,SGN((Q)UCOEF(p)),&c,&f);
1110: if ( iscycp(f) || iscycm(f) )
1111: return 0;
1112: else
1113: return 1;
1114: }
1115:
1116: int zerovpchk(vl,p,vn)
1117: VL vl;
1118: P p;
1119: VN vn;
1120: {
1121: P t;
1122:
1123: substvp(vl,p,vn,&t);
1124: if ( t )
1125: return ( 0 );
1126: else
1127: return ( 1 );
1128: }
1129:
1130: int valideval(vl,dc,vn)
1131: VL vl;
1132: DCP dc;
1133: VN vn;
1134: {
1135: DCP dct;
1136: Q *a;
1137: int i,j,n;
1138: N q,r;
1139:
1140: for ( dct = NEXT(dc), n = 0; dct; dct = NEXT(dct), n++ );
1141: W_CALLOC(n,Q,a);
1142: for ( dct = NEXT(dc), i = 0; dct; dct = NEXT(dct), i++ ) {
1143: substvp(vl,COEF(dct),vn,(P *)&a[i]);
1144: if ( !a[i] )
1145: return ( 0 );
1146:
1147: for ( j = 0; j < i; j++ ) {
1148: divn(NM(a[j]),NM(a[i]),&q,&r);
1149: if ( !r )
1150: return ( 0 );
1151: divn(NM(a[i]),NM(a[j]),&q,&r);
1152: if ( !r )
1153: return ( 0 );
1154: }
1155: }
1156: return ( 1 );
1157: }
1158:
1159: void estimatelc(vl,c,dc,vn,lcp)
1160: VL vl;
1161: Q c;
1162: DCP dc;
1163: VN vn;
1164: P *lcp;
1165: {
1166: int i;
1167: DCP dct;
1168: P r,s,t;
1169: Q c0,c1,c2;
1170:
1171: for ( dct = dc, r = (P)ONE; dct; dct = NEXT(dct) ) {
1172: if ( NUM(COEF(dct)) ) {
1173: mulp(vl,r,COEF(dct),&s); r = s;
1174: } else {
1175: substvp(vl,COEF(dct),vn,(P *)&c0);
1176: for ( i = 0, c1 = c; i < (int)QTOS(DEG(dct)); i++ ) {
1177: divq(c1,c0,&c2);
1178: if ( !INT(c2) )
1179: break;
1180: else
1181: c1 = c2;
1182: }
1183: if ( i ) {
1184: STOQ(i,c1);
1185: pwrp(vl,COEF(dct),c1,&s); mulp(vl,r,s,&t); r = t;
1186: }
1187: }
1188: }
1189: *lcp = r;
1190: }
1191:
1192: void monomialfctr(vl,p,pr,dcp)
1193: VL vl;
1194: P p;
1195: P *pr;
1196: DCP *dcp;
1197: {
1198: VL nvl,avl;
1199: Q d;
1200: P f,t,s;
1201: DCP dc0,dc;
1202:
1203: clctv(vl,p,&nvl);
1204: for ( dc0 = 0, avl = nvl, f = p; avl; avl = NEXT(avl) ) {
1205: getmindeg(avl->v,f,&d);
1206: if ( d ) {
1207: MKV(avl->v,t); NEXTDC(dc0,dc); DEG(dc) = d; COEF(dc) = t;
1208: pwrp(vl,t,d,&s); divsp(vl,f,s,&t); f = t;
1209: }
1210: }
1211: if ( dc0 )
1212: NEXT(dc) = 0;
1213: *pr = f; *dcp = dc0;
1214: }
1215:
1216: void afctr(vl,p0,p,dcp)
1217: VL vl;
1218: P p,p0;
1219: DCP *dcp;
1220: {
1221: DCP dc,dc0,dcr,dct,dcs;
1222: P t;
1223: VL nvl;
1224:
1225: if ( VR(p) == VR(p0) ) {
1226: NEWDC(dc);
1227: DEG(dc) = ONE;
1228: COEF(dc) = p;
1229: NEXT(dc) = 0;
1230: *dcp = dc;
1231: return;
1232: }
1233:
1234: clctv(vl,p,&nvl);
1235: if ( !NEXT(nvl) )
1236: ufctr(p,1,&dc);
1237: else {
1238: sqa(vl,p0,p,&dc);
1239: for ( dct = dc; dct; dct = NEXT(dct) ) {
1240: pmonic(vl,p0,COEF(dct),&t); COEF(dct) = t;
1241: }
1242: }
1243: if ( NUM(COEF(dc)) )
1244: dcr = NEXT(dc);
1245: else
1246: dcr = dc;
1247: for ( dc0 = 0; dcr; dcr = NEXT(dcr) ) {
1248: afctrmain(vl,p0,COEF(dcr),1,&dcs);
1249:
1250: for ( dct = dcs; dct; dct = NEXT(dct) )
1251: DEG(dct) = DEG(dcr);
1252: if ( !dc0 )
1253: dc0 = dcs;
1254: else {
1255: for ( dct = dc0; NEXT(dct); dct = NEXT(dct) );
1256: NEXT(dct) = dcs;
1257: }
1258: }
1259: *dcp = dc0;
1260: }
1261:
1262: void afctrmain(vl,p0,p,init,dcp)
1263: VL vl;
1264: P p,p0;
1265: int init;
1266: DCP *dcp;
1267: {
1268: P x,y,s,m,a,t,u,pt,pt1,res,g;
1269: Q q;
1270: DCP dc,dc0,dcsq0,dcr0,dcr,dct,dcs;
1271: V v,v0;
1272:
1273: if ( !cmpq(DEG(DC(p)),ONE) ) {
1274: NEWDC(dc); DEG(dc) = ONE; NEXT(dc) = 0;
1275: pmonic(vl,p0,p,&COEF(dc)); *dcp = dc;
1276: return;
1277: }
1278:
1279: v = VR(p); MKV(v,x);
1280: v0 = VR(p0); MKV(v0,y);
1281: STOQ(init,q),s = (P)q;
1282: mulp(vl,s,y,&m); subp(vl,x,m,&t); addp(vl,x,m,&a);
1283: substp(vl,p,v,t,&pt);
1284: remsdcp(vl,pt,p0,&pt1);
1285:
1286: /*
1287: if ( ( deg(v0,p0) <= 3 ) || ( TCPQ(p0) <= 2 ) )
1288: resultp(vl,v0,p0,pt1,&res);
1289: else
1290: srcrnorm(vl,v0,pt1,p0,&res);
1291: */
1292: #if 0
1293: srcr(vl,v0,pt1,p0,&res);
1294: #endif
1295: resultp(vl,v0,p0,pt1,&res);
1296: usqp(res,&dcsq0);
1297: for ( dc0 = 0, dct = dcsq0; dct; dct = NEXT(dct) ) {
1298: if ( UNIQ(DEG(dct)) )
1299: ufctr(COEF(dct),deg(v0,p0),&dcs);
1300: else
1301: ufctr(COEF(dct),1,&dcs);
1302: for ( dcr = dcs; dcr; dcr = NEXT(dcr) )
1303: DEG(dcr) = DEG(dct);
1304: if ( !dc0 ) {
1305: dc0 = NEXT(dcs);
1306: dc = dc0;
1307: } else {
1308: for ( ; NEXT(dc); dc = NEXT(dc) );
1309: NEXT(dc) = NEXT(dcs);
1310: }
1311: }
1312: sortfs(&dc0);
1313:
1314: for ( g = p, dcr = dcr0 = 0, dc = dc0; dc; dc = NEXT(dc) ) {
1315: if ( !UNIQ(DEG(dc)) ) {
1316: substp(vl,COEF(dc),v,a,&pt); remsdcp(vl,pt,p0,&s);
1317: gcda(vl,p0,s,g,&u);
1318: if ( !NUM(u) && (VR(u) == v)) {
1319: afctrmain(vl,p0,u,init+1,&dct);
1320: for ( dcs = dct, t = (P)ONE; dcs; dcs = NEXT(dcs) ) {
1321: mulp(vl,t,COEF(dcs),&s); remsdcp(vl,s,p0,&t);
1322: }
1323: pdiva(vl,p0,g,t,&s); g = s;
1324: if ( !dcr0 )
1325: dcr0 = dct;
1326: else
1327: NEXT(dcr) = dct;
1328: for ( dcr = dct; NEXT(dcr); dcr = NEXT(dcr) );
1329: }
1330: } else {
1331: substp(vl,COEF(dc),v,a,&pt); remsdcp(vl,pt,p0,&s);
1332: gcda(vl,p0,s,g,&u);
1333: if ( !NUM(u) && (VR(u) == v)) {
1334: NEXTDC(dcr0,dcr);
1335: DEG(dcr) = ONE;
1336: COEF(dcr) = u;
1337: pdiva(vl,p0,g,u,&t); g = t;
1338: }
1339: }
1340: }
1341: if ( dcr0 )
1342: NEXT(dcr) = 0;
1343: *dcp = dcr0;
1344: }