Annotation of OpenXM_contrib2/asir2018/builtin/dp.c, Revision 1.7
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.7 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2018/builtin/dp.c,v 1.6 2019/03/18 07:00:33 noro Exp $
1.1 noro 49: */
50: #include "ca.h"
51: #include "base.h"
52: #include "parse.h"
53:
54: extern int dp_fcoeffs;
55: extern int dp_nelim;
56: extern int dp_order_pair_length;
57: extern struct order_pair *dp_order_pair;
58: extern struct order_spec *dp_current_spec;
59: extern struct modorder_spec *dp_current_modspec;
60: extern int nd_rref2;
61:
62: int do_weyl;
63:
1.3 noro 64: void Pdp_monomial_hilbert_poincare();
1.1 noro 65: void Pdp_sort();
66: void Pdp_mul_trunc(),Pdp_quo();
67: void Pdp_ord(), Pdp_ptod(), Pdp_dtop(), Phomogenize();
68: void Pdp_ptozp(), Pdp_ptozp2(), Pdp_red(), Pdp_red2(), Pdp_lcm(), Pdp_redble();
69: void Pdp_sp(), Pdp_hm(), Pdp_ht(), Pdp_hc(), Pdp_rest(), Pdp_td(), Pdp_sugar();
70: void Pdp_set_sugar();
71: void Pdp_cri1(),Pdp_cri2(),Pdp_subd(),Pdp_mod(),Pdp_red_mod(),Pdp_tdiv();
72: void Pdp_prim(),Pdp_red_coef(),Pdp_mag(),Pdp_set_kara(),Pdp_rat();
73: void Pdp_nf(),Pdp_true_nf(),Pdp_true_nf_marked(),Pdp_true_nf_marked_mod();
74:
75: void Pdp_true_nf_and_quotient(),Pdp_true_nf_and_quotient_mod();
76: void Pdp_true_nf_and_quotient_marked(),Pdp_true_nf_and_quotient_marked_mod();
77:
78: void Pdp_nf_mod(),Pdp_true_nf_mod();
79: void Pdp_criB(),Pdp_nelim();
80: void Pdp_minp(),Pdp_sp_mod();
81: void Pdp_homo(),Pdp_dehomo();
82: void Pdp_gr_mod_main(),Pdp_gr_f_main();
83: void Pdp_gr_main(),Pdp_gr_hm_main(),Pdp_gr_d_main(),Pdp_gr_flags();
84: void Pdp_interreduce();
85: void Pdp_f4_main(),Pdp_f4_mod_main(),Pdp_f4_f_main();
86: void Pdp_gr_print();
87: void Pdp_mbase(),Pdp_lnf_mod(),Pdp_nf_tab_mod(),Pdp_mdtod(), Pdp_nf_tab_f();
88: void Pdp_vtoe(), Pdp_etov(), Pdp_dtov(), Pdp_idiv(), Pdp_sep();
89: void Pdp_cont();
90: void Pdp_gr_checklist();
91: void Pdp_ltod(),Pdpv_ord(),Pdpv_ht(),Pdpv_hm(),Pdpv_hc();
92: void Pdpm_ltod(),Pdpm_dtol(),Pdpm_ord(),Pdpm_nf(),Pdpm_weyl_nf(),Pdpm_sp(),Pdpm_weyl_sp();
93: void Pdpm_hm(),Pdpm_ht(),Pdpm_hc();
94:
95: void Pdp_weyl_red();
96: void Pdp_weyl_sp();
97:
98: void Pdp_weyl_nf(),Pdp_weyl_nf_mod();
99: void Pdp_weyl_true_nf_and_quotient(),Pdp_weyl_true_nf_and_quotient_mod();
100: void Pdp_weyl_true_nf_and_quotient_marked(),Pdp_weyl_true_nf_and_quotient_marked_mod();
101:
102: void Pdp_weyl_gr_main(),Pdp_weyl_gr_mod_main(),Pdp_weyl_gr_f_main();
103: void Pdp_weyl_f4_main(),Pdp_weyl_f4_mod_main(),Pdp_weyl_f4_f_main();
104: void Pdp_weyl_mul(),Pdp_weyl_mul_mod(),Pdp_weyl_act();
105: void Pdp_weyl_set_weight();
106: void Pdp_set_weight(),Pdp_set_top_weight(),Pdp_set_module_weight();
107: void Pdp_nf_f(),Pdp_weyl_nf_f();
108: void Pdpm_nf_f(),Pdpm_weyl_nf_f();
109: void Pdp_lnf_f();
110: void Pnd_gr(),Pnd_gr_trace(),Pnd_f4(),Pnd_f4_trace();
111: void Pnd_gr_postproc(), Pnd_weyl_gr_postproc();
112: void Pnd_gr_recompute_trace(), Pnd_btog();
113: void Pnd_weyl_gr(),Pnd_weyl_gr_trace();
114: void Pnd_nf(),Pnd_weyl_nf();
115: void Pdp_initial_term();
116: void Pdp_order();
117: void Pdp_inv_or_split();
118: void Pdp_compute_last_t();
119: void Pdp_compute_last_w();
120: void Pdp_compute_essential_df();
121: void Pdp_get_denomlist();
122: void Pdp_symb_add();
123: void Pdp_mono_raddec();
124: void Pdp_mono_reduce();
125: void Pdp_rref2(),Psumi_updatepairs(),Psumi_symbolic();
126:
127: LIST dp_initial_term();
128: LIST dp_order();
129: void parse_gr_option(LIST f,NODE opt,LIST *v,Num *homo,
130: int *modular,struct order_spec **ord);
131: NODE dp_inv_or_split(NODE gb,DP f,struct order_spec *spec, DP *inv);
132:
133: LIST remove_zero_from_list(LIST);
134:
135: struct ftab dp_tab[] = {
136: /* content reduction */
137: {"dp_ptozp",Pdp_ptozp,1},
138: {"dp_ptozp2",Pdp_ptozp2,2},
139: {"dp_prim",Pdp_prim,1},
140: {"dp_red_coef",Pdp_red_coef,2},
141: {"dp_cont",Pdp_cont,1},
142:
143: /* polynomial ring */
144: /* special operations */
145: {"dp_mul_trunc",Pdp_mul_trunc,3},
146: {"dp_quo",Pdp_quo,2},
147:
148: /* s-poly */
149: {"dp_sp",Pdp_sp,2},
150: {"dp_sp_mod",Pdp_sp_mod,3},
151:
152: /* m-reduction */
153: {"dp_red",Pdp_red,3},
154: {"dp_red_mod",Pdp_red_mod,4},
155:
156: /* normal form */
157: {"dp_nf",Pdp_nf,4},
158: {"dp_nf_mod",Pdp_nf_mod,5},
159: {"dp_nf_f",Pdp_nf_f,4},
160: {"dpm_nf_f",Pdpm_nf_f,4},
161: {"dpm_weyl_nf_f",Pdpm_weyl_nf_f,4},
162: {"dpm_nf",Pdpm_nf,4},
163: {"dpm_sp",Pdpm_sp,2},
164: {"dpm_weyl_sp",Pdpm_weyl_sp,2},
165:
166: {"dp_true_nf",Pdp_true_nf,4},
167: {"dp_true_nf_mod",Pdp_true_nf_mod,5},
168: {"dp_true_nf_marked",Pdp_true_nf_marked,4},
169: {"dp_true_nf_marked_mod",Pdp_true_nf_marked_mod,5},
170:
171: {"dp_true_nf_and_quotient",Pdp_true_nf_and_quotient,3},
172: {"dp_true_nf_and_quotient_mod",Pdp_true_nf_and_quotient_mod,4},
173: {"dp_true_nf_and_quotient_marked",Pdp_true_nf_and_quotient_marked,4},
174: {"dp_true_nf_and_quotient_marked_mod",Pdp_true_nf_and_quotient_marked_mod,5},
175:
176: {"dp_lnf_mod",Pdp_lnf_mod,3},
177: {"dp_nf_tab_f",Pdp_nf_tab_f,2},
178: {"dp_nf_tab_mod",Pdp_nf_tab_mod,3},
179: {"dp_lnf_f",Pdp_lnf_f,2},
180:
181: /* Buchberger algorithm */
182: {"dp_gr_main",Pdp_gr_main,-5},
183: {"dp_interreduce",Pdp_interreduce,3},
184: {"dp_gr_mod_main",Pdp_gr_mod_main,5},
185: {"dp_gr_f_main",Pdp_gr_f_main,4},
186: {"dp_gr_checklist",Pdp_gr_checklist,2},
187: {"nd_f4",Pnd_f4,-4},
188: {"nd_gr",Pnd_gr,-4},
189: {"nd_gr_trace",Pnd_gr_trace,-5},
190: {"nd_f4_trace",Pnd_f4_trace,-5},
191: {"nd_gr_postproc",Pnd_gr_postproc,5},
192: {"nd_gr_recompute_trace",Pnd_gr_recompute_trace,5},
193: {"nd_btog",Pnd_btog,-6},
194: {"nd_weyl_gr_postproc",Pnd_weyl_gr_postproc,5},
195: {"nd_weyl_gr",Pnd_weyl_gr,-4},
196: {"nd_weyl_gr_trace",Pnd_weyl_gr_trace,-5},
197: {"nd_nf",Pnd_nf,5},
198: {"nd_weyl_nf",Pnd_weyl_nf,5},
199:
200: /* F4 algorithm */
201: {"dp_f4_main",Pdp_f4_main,3},
202: {"dp_f4_mod_main",Pdp_f4_mod_main,4},
203:
204: /* weyl algebra */
205: /* multiplication */
206: {"dp_weyl_mul",Pdp_weyl_mul,2},
207: {"dp_weyl_mul_mod",Pdp_weyl_mul_mod,3},
208: {"dp_weyl_act",Pdp_weyl_act,2},
209:
210: /* s-poly */
211: {"dp_weyl_sp",Pdp_weyl_sp,2},
212:
213: /* m-reduction */
214: {"dp_weyl_red",Pdp_weyl_red,3},
215:
216: /* normal form */
217: {"dp_weyl_nf",Pdp_weyl_nf,4},
218: {"dpm_weyl_nf",Pdpm_weyl_nf,4},
219: {"dp_weyl_nf_mod",Pdp_weyl_nf_mod,5},
220: {"dp_weyl_nf_f",Pdp_weyl_nf_f,4},
221:
222: {"dp_weyl_true_nf_and_quotient",Pdp_weyl_true_nf_and_quotient,3},
223: {"dp_weyl_true_nf_and_quotient_mod",Pdp_weyl_true_nf_and_quotient_mod,4},
224: {"dp_weyl_true_nf_and_quotient_marked",Pdp_weyl_true_nf_and_quotient_marked,4},
225: {"dp_weyl_true_nf_and_quotient_marked_mod",Pdp_weyl_true_nf_and_quotient_marked_mod,5},
226:
227:
228: /* Buchberger algorithm */
229: {"dp_weyl_gr_main",Pdp_weyl_gr_main,-5},
230: {"dp_weyl_gr_mod_main",Pdp_weyl_gr_mod_main,5},
231: {"dp_weyl_gr_f_main",Pdp_weyl_gr_f_main,4},
232:
233: /* F4 algorithm */
234: {"dp_weyl_f4_main",Pdp_weyl_f4_main,3},
235: {"dp_weyl_f4_mod_main",Pdp_weyl_f4_mod_main,4},
236:
1.3 noro 237: /* Hilbert function */
238: {"dp_monomial_hilbert_poincare",Pdp_monomial_hilbert_poincare,2},
239:
1.1 noro 240: /* misc */
241: {"dp_inv_or_split",Pdp_inv_or_split,3},
242: {"dp_set_weight",Pdp_set_weight,-1},
243: {"dp_set_module_weight",Pdp_set_module_weight,-1},
244: {"dp_set_top_weight",Pdp_set_top_weight,-1},
245: {"dp_weyl_set_weight",Pdp_weyl_set_weight,-1},
246:
247: {"dp_get_denomlist",Pdp_get_denomlist,0},
248: {0,0,0},
249: };
250:
251: struct ftab dp_supp_tab[] = {
252: /* setting flags */
253: {"dp_sort",Pdp_sort,1},
254: {"dp_ord",Pdp_ord,-1},
255: {"dpm_ord",Pdpm_ord,-1},
256: {"dpv_ord",Pdpv_ord,-2},
257: {"dp_set_kara",Pdp_set_kara,-1},
258: {"dp_nelim",Pdp_nelim,-1},
259: {"dp_gr_flags",Pdp_gr_flags,-1},
260: {"dp_gr_print",Pdp_gr_print,-1},
261:
262: /* converters */
263: {"homogenize",Phomogenize,3},
264: {"dp_ptod",Pdp_ptod,-2},
265: {"dp_dtop",Pdp_dtop,2},
266: {"dp_homo",Pdp_homo,1},
267: {"dp_dehomo",Pdp_dehomo,1},
268: {"dp_etov",Pdp_etov,1},
269: {"dp_vtoe",Pdp_vtoe,1},
270: {"dp_dtov",Pdp_dtov,1},
271: {"dp_mdtod",Pdp_mdtod,1},
272: {"dp_mod",Pdp_mod,3},
273: {"dp_rat",Pdp_rat,1},
274: {"dp_ltod",Pdp_ltod,-2},
275:
276: {"dpm_ltod",Pdpm_ltod,2},
277: {"dpm_dtol",Pdpm_dtol,3},
278:
279: /* criteria */
280: {"dp_cri1",Pdp_cri1,2},
281: {"dp_cri2",Pdp_cri2,2},
282: {"dp_criB",Pdp_criB,3},
283:
284: /* simple operation */
285: {"dp_subd",Pdp_subd,2},
286: {"dp_lcm",Pdp_lcm,2},
287: {"dp_hm",Pdp_hm,1},
288: {"dp_ht",Pdp_ht,1},
289: {"dp_hc",Pdp_hc,1},
290: {"dpv_hm",Pdpv_hm,1},
291: {"dpv_ht",Pdpv_ht,1},
292: {"dpv_hc",Pdpv_hc,1},
293: {"dpm_hm",Pdpm_hm,1},
294: {"dpm_ht",Pdpm_ht,1},
295: {"dpm_hc",Pdpm_hc,1},
296: {"dp_rest",Pdp_rest,1},
297: {"dp_initial_term",Pdp_initial_term,1},
298: {"dp_order",Pdp_order,1},
299: {"dp_symb_add",Pdp_symb_add,2},
300:
301: /* degree and size */
302: {"dp_td",Pdp_td,1},
303: {"dp_mag",Pdp_mag,1},
304: {"dp_sugar",Pdp_sugar,1},
305: {"dp_set_sugar",Pdp_set_sugar,2},
306:
307: /* misc */
308: {"dp_mbase",Pdp_mbase,1},
309: {"dp_redble",Pdp_redble,2},
310: {"dp_sep",Pdp_sep,2},
311: {"dp_idiv",Pdp_idiv,2},
312: {"dp_tdiv",Pdp_tdiv,2},
313: {"dp_minp",Pdp_minp,2},
314: {"dp_compute_last_w",Pdp_compute_last_w,5},
315: {"dp_compute_last_t",Pdp_compute_last_t,5},
316: {"dp_compute_essential_df",Pdp_compute_essential_df,2},
317: {"dp_mono_raddec",Pdp_mono_raddec,2},
318: {"dp_mono_reduce",Pdp_mono_reduce,2},
319:
320: {"dp_rref2",Pdp_rref2,2},
321: {"sumi_updatepairs",Psumi_updatepairs,3},
322: {"sumi_symbolic",Psumi_symbolic,5},
323:
324: {0,0,0}
325: };
326:
327: NODE compute_last_w(NODE g,NODE gh,int n,int **v,int row1,int **m1,int row2,int **m2);
328: Q compute_last_t(NODE g,NODE gh,Q t,VECT w1,VECT w2,NODE *homo,VECT *wp);
329:
1.3 noro 330: int comp_by_tdeg(DP *a,DP *b)
331: {
332: int da,db;
333:
334: da = BDY(*a)->dl->td;
335: db = BDY(*b)->dl->td;
336: if ( da>db ) return 1;
337: else if ( da<db ) return -1;
338: else return 0;
339: }
340:
341: void dl_print(DL d,int n)
342: {
343: int i;
344:
345: printf("<<");
346: for ( i = 0; i < n; i++ )
347: printf("%d ",d->d[i]);
348: printf(">>\n");
349: }
350:
351: int simple_check(VECT b,int nv)
352: {
353: int n,i,j;
354: DL *p;
355:
356: n = b->len; p = (DL *)b->body;
357: for ( i = 0; i < n; i++ ) {
358: for ( j = 0; j < nv; j++ ) {
359: if ( p[i]->d[j] ) break;
360: }
361: if ( p[i]->d[j] != p[i]->td ) return 0;
362: }
363: return 1;
364: }
365:
366: void make_reduced(VECT b,int nv)
367: {
368: int n,i,j;
369: DL *p;
370: DL pi;
371:
372: n = b->len;
373: p = (DL *)BDY(b);
374: for ( i = 0; i < n; i++ ) {
375: pi = p[i];
376: if ( !pi ) continue;
377: for ( j = 0; j < n; j++ )
378: if ( i != j && p[j] && _dl_redble(pi,p[j],nv) ) p[j] = 0;
379: }
380: for ( i = j = 0; i < n; i++ )
381: if ( p[i] ) p[j++] = p[i];
382: b->len = j;
383: }
384:
385: void make_reduced2(VECT b,int k,int nv)
386: {
387: int n,i,j,l;
388: DL *p;
389: DL pi;
390:
391: n = b->len;
392: p = (DL *)BDY(b);
393: for ( i = l = k; i < n; i++ ) {
394: pi = p[i];
395: for ( j = 0; j < k; j++ )
396: if ( _dl_redble(p[j],pi,nv) ) break;
397: if ( j == k )
398: p[l++] = pi;
399: }
400: b->len = l;
401: }
402:
403: int i_all,i_simple;
404:
405: P mhp_simple(VECT b,VECT x,P t)
406: {
407: int n,i,j,nv;
408: DL *p;
409: P hp,mt,s,w;
410: Z z;
411:
412: n = b->len; nv = x->len; p = (DL *)BDY(b);
413: hp = (P)ONE;
414: for ( i = 0; i < n; i++ ) {
415: for ( j = 0; j < nv; j++ )
416: if ( p[i]->d[j] ) break;
417: STOZ(p[i]->d[j],z);
418: chsgnp(t,&mt); mt->dc->d =z;
419: addp(CO,mt,(P)ONE,&s); mulp(CO,hp,s,&w); hp = w;
420: }
421: return hp;
422: }
423:
424: struct oEGT eg_comp;
425:
426: void mhp_rec(VECT b,VECT x,P t,P *r)
427: {
428: int n,i,j,k,l,i2,nv,len;
429: int *d;
430: Z mone,z;
431: DCP dc,dc1;
432: P s;
433: P *r2;
434: DL *p,*q;
435: DL pi,xj,d1;
436: VECT c;
437: struct oEGT eg0,eg1;
438:
439: i_all++;
440: n = b->len; nv = x->len; p = (DL *)BDY(b);
441: if ( !n ) {
442: r[0] = (P)ONE;
443: return;
444: }
445: if ( n == 1 && p[0]->td == 0 )
446: return;
447: for ( i = 0; i < n; i++ )
448: if ( p[i]->td > 1 ) break;
449: if ( i == n ) {
450: r[n] = (P)ONE;
451: return;
452: }
453: #if 0
454: if ( simple_check(b,nv) ) {
455: i_simple++;
456: r[0] = mhp_simple(b,x,t);
457: return;
458: }
459: #endif
460: for ( j = 0, d = p[i]->d; j < nv; j++ )
461: if ( d[j] ) break;
462: xj = BDY(x)[j];
463: MKVECT(c,n); q = (DL *)BDY(c);
464: for ( i = k = l = 0; i < n; i++ )
465: if ( p[i]->d[j] ) {
466: pi = p[i];
467: NEWDL(d1,nv); d1->td =pi->td - 1;
468: memcpy(d1->d,pi->d,nv*sizeof(int));
469: d1->d[j]--;
470: p[k++] = d1;
471: } else
472: q[l++] = p[i];
473: for ( i = k, i2 = 0; i2 < l; i++, i2++ )
474: p[i] = q[i2];
475: /* b=(b[0]/xj,...,b[k-1]/xj,b[k],...b[n-1]) where
476: b[0],...,b[k-1] are divisible by k */
477: make_reduced2(b,k,nv);
478: mhp_rec(b,x,t,r);
479: /* c = (b[0],...,b[l-1],xj) */
480: q[l] = xj; c->len = l+1;
481: r2 = (P *)CALLOC(nv+1,sizeof(P));
482: mhp_rec(c,x,t,r2);
483: // get_eg(&eg0);
484: for ( i = 0; i <= nv; i++ ) {
485: mulp(CO,r[i],t,&s); addp(CO,s,r2[i],&r[i]);
486: }
487: // get_eg(&eg1); add_eg(&eg_comp,&eg0,&eg1);
488: }
489:
1.4 noro 490: /* (n+a)Cb as a polynomial of n; return (n+a)*...*(n+a-b+1) */
491:
492: P binpoly(P n,int a,int b)
493: {
494: Z z;
495: P s,r,t;
496: int i;
497:
498: STOZ(a,z); addp(CO,n,(P)z,&s); r = (P)ONE;
499: for ( i = 0; i < b; i++ ) {
500: mulp(CO,r,s,&t); r = t;
501: subp(CO,s,(P)ONE,&t); s = t;
502: }
503: return r;
504: }
505:
1.5 noro 506: void mhp_to_hf(VL vl,P hp,int n,P *plist,VECT *head,P *hf,Z *den)
507: {
508: P tv,gcd,q,h,hphead,tt,ai,hpoly,nv,bp,w;
509: Z d;
510: DCP dc,topdc;
511: VECT hfhead;
512: int i,s,qd;
513:
514: if ( !hp ) {
515: MKVECT(hfhead,0); *head = hfhead;
516: *hf = 0; *den = ONE;
517: } else {
518: makevar("t",&tv);
519: ezgcdp(CO,hp,plist[n],&gcd);
520: if ( NUM(gcd) ) {
521: s = n;
522: q = hp;
523: } else {
524: s = n-ZTOS(DEG(DC(gcd)));
525: divsp(CO,hp,plist[n-s],&q);
526: }
527: if ( NUM(q) ) qd = 0;
528: else qd = ZTOS(DEG(DC(q)));
1.6 noro 529: if ( s == 0 ) {
530: MKVECT(hfhead,qd+1);
531: for ( i = 0; i <= qd; i++ ) {
532: coefp(q,i,(P *)&BDY(hfhead)[i]);
1.5 noro 533: }
1.6 noro 534: *head = hfhead;
535: *hf = 0;
536: *den = ONE;
537: } else {
538: if ( qd ) {
539: topdc = 0;
540: for ( i = 0; i < qd; i++ ) {
541: NEWDC(dc); NEXT(dc) = topdc;
542: ibin(i+s-1,s-1,&COEF(dc));
543: STOZ(i,d); DEG(dc) = d;
544: topdc = dc;
545: }
546: MKP(VR(tv),topdc,h);
547: mulp(CO,h,q,&hphead);
548: }
549: MKVECT(hfhead,qd);
550: for ( i = 0; i < qd; i++ )
551: coefp(hphead,i,(P *)&BDY(hfhead)[i]);
552: *head = hfhead;
553: hpoly = 0;
554: makevar("n",&nv);
555: for ( i = 0; i <= qd; i++ ) {
556: coefp(q,i,&ai);
557: bp = binpoly(nv,s-i-1,s-1);
558: mulp(CO,ai,bp,&tt);
559: addp(CO,hpoly,tt,&w);
560: hpoly = w;
561: }
562: *hf = hpoly;
563: factorialz(s-1,den);
1.5 noro 564: }
565: }
566: }
567:
568: /* create (1,1-t,...,(1-t)^n) */
569:
570: P *mhp_prep(int n,P *tv) {
571: P *plist;
572: P mt,t1;
573: int i;
574:
575: plist = (P *)MALLOC((n+1)*sizeof(P));
576: /* t1 = 1-t */
577: makevar("t",tv); chsgnp(*tv,&mt); addp(CO,mt,(P)ONE,&t1);
578: for ( plist[0] = (P)ONE, i = 1; i <= n; i++ )
579: mulp(CO,plist[i-1],t1,&plist[i]);
580: return plist;
581: }
582:
583: P mhp_ctop(P *r,P *plist,int n)
584: {
585: int i;
586: P hp,u,w;
587:
588: for ( hp = 0, i = 0; i <= n; i++ ) {
589: mulp(CO,plist[i],r[i],&u); addp(CO,u,hp,&w); hp = w;
590: }
591: return hp;
592: }
593:
1.3 noro 594: void Pdp_monomial_hilbert_poincare(NODE arg,LIST *rp)
595: {
596: LIST g,v;
597: VL vl;
1.5 noro 598: int m,n,i;
599: VECT b,x,hfhead;
1.3 noro 600: NODE t,nd;
1.5 noro 601: Z z,den;
602: P hp,tv,mt,t1,u,w,hpoly;
1.3 noro 603: DP a;
604: DL *p;
605: P *plist,*r;
1.4 noro 606: Obj val;
1.3 noro 607:
608: i_simple = i_all = 0;
609: g = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
610: pltovl(v,&vl);
611: m = length(BDY(g)); MKVECT(b,m); p = (DL *)BDY(b);
612: for ( t = BDY(g), i = 0; t; t = NEXT(t), i++ ) {
1.5 noro 613: if ( !BDY(t) )
614: p[i] = 0;
615: else {
616: ptod(CO,vl,(P)BDY(t),&a); p[i] = BDY(a)->dl;
617: }
1.3 noro 618: }
619: n = length(BDY(v)); MKVECT(x,n); p = (DL *)BDY(x);
620: for ( t = BDY(v), i = 0; t; t = NEXT(t), i++ ) {
621: ptod(CO,vl,(P)BDY(t),&a); p[i] = BDY(a)->dl;
622: }
1.5 noro 623:
1.3 noro 624: r = (P *)CALLOC(n+1,sizeof(P));
1.5 noro 625: plist = mhp_prep(n,&tv);
1.3 noro 626: make_reduced(b,n);
627: mhp_rec(b,x,tv,r);
1.5 noro 628: hp = mhp_ctop(r,plist,n);
629: mhp_to_hf(CO,hp,n,plist,&hfhead,&hpoly,&den);
1.4 noro 630: UTOZ(n,z);
1.5 noro 631: nd = mknode(5,hp,z,hfhead,hpoly,den);
632: MKLIST(*rp,nd);
1.3 noro 633: }
1.5 noro 634:
1.1 noro 635: void Pdp_compute_last_t(NODE arg,LIST *rp)
636: {
637: NODE g,gh,homo,n;
638: LIST hlist;
639: VECT v1,v2,w;
640: Q t;
641:
642: g = (NODE)BDY((LIST)ARG0(arg));
643: gh = (NODE)BDY((LIST)ARG1(arg));
644: t = (Q)ARG2(arg);
645: v1 = (VECT)ARG3(arg);
646: v2 = (VECT)ARG4(arg);
647: t = compute_last_t(g,gh,t,v1,v2,&homo,&w);
648: MKLIST(hlist,homo);
649: n = mknode(3,t,w,hlist);
650: MKLIST(*rp,n);
651: }
652:
653: void Pdp_compute_last_w(NODE arg,LIST *rp)
654: {
655: NODE g,gh,r;
656: VECT w,rv;
657: LIST l;
658: MAT w1,w2;
659: int row1,row2,i,j,n;
660: int *v;
661: int **m1,**m2;
662: Z q;
663:
664: g = (NODE)BDY((LIST)ARG0(arg));
665: gh = (NODE)BDY((LIST)ARG1(arg));
666: w = (VECT)ARG2(arg);
667: w1 = (MAT)ARG3(arg);
668: w2 = (MAT)ARG4(arg);
669: n = w1->col;
670: row1 = w1->row;
671: row2 = w2->row;
672: if ( w ) {
673: v = W_ALLOC(n);
1.2 noro 674: for ( i = 0; i < n; i++ ) v[i] = ZTOS((Q)w->body[i]);
1.1 noro 675: } else v = 0;
676: m1 = almat(row1,n);
677: for ( i = 0; i < row1; i++ )
1.2 noro 678: for ( j = 0; j < n; j++ ) m1[i][j] = ZTOS((Q)w1->body[i][j]);
1.1 noro 679: m2 = almat(row2,n);
680: for ( i = 0; i < row2; i++ )
1.2 noro 681: for ( j = 0; j < n; j++ ) m2[i][j] = ZTOS((Q)w2->body[i][j]);
1.1 noro 682: r = compute_last_w(g,gh,n,&v,row1,m1,row2,m2);
683: if ( !r ) *rp = 0;
684: else {
685: MKVECT(rv,n);
686: for ( i = 0; i < n; i++ ) {
1.2 noro 687: STOZ(v[i],q); rv->body[i] = (pointer)q;
1.1 noro 688: }
689: MKLIST(l,r);
690: r = mknode(2,rv,l);
691: MKLIST(*rp,r);
692: }
693: }
694:
695: NODE compute_essential_df(DP *g,DP *gh,int n);
696:
697: void Pdp_compute_essential_df(NODE arg,LIST *rp)
698: {
699: VECT g,gh;
700: NODE r;
701:
702: g = (VECT)ARG0(arg);
703: gh = (VECT)ARG1(arg);
704: r = (NODE)compute_essential_df((DP *)BDY(g),(DP *)BDY(gh),g->len);
705: MKLIST(*rp,r);
706: }
707:
708: void Pdp_inv_or_split(NODE arg,Obj *rp)
709: {
710: NODE gb,newgb;
711: DP f,inv;
712: struct order_spec *spec;
713: LIST list;
714:
715: do_weyl = 0; dp_fcoeffs = 0;
716: asir_assert(ARG0(arg),O_LIST,"dp_inv_or_split");
717: asir_assert(ARG1(arg),O_DP,"dp_inv_or_split");
718: if ( !create_order_spec(0,(Obj)ARG2(arg),&spec) )
719: error("dp_inv_or_split : invalid order specification");
720: gb = BDY((LIST)ARG0(arg));
721: f = (DP)ARG1(arg);
722: newgb = (NODE)dp_inv_or_split(gb,f,spec,&inv);
723: if ( !newgb ) {
724: /* invertible */
725: *rp = (Obj)inv;
726: } else {
727: MKLIST(list,newgb);
728: *rp = (Obj)list;
729: }
730: }
731:
732: void Pdp_sort(NODE arg,DP *rp)
733: {
734: dp_sort((DP)ARG0(arg),rp);
735: }
736:
737: void Pdp_mdtod(NODE arg,DP *rp)
738: {
739: MP m,mr,mr0;
740: DP p;
741: P t;
742:
743: p = (DP)ARG0(arg);
744: if ( !p )
745: *rp = 0;
746: else {
747: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
748: mptop((P)m->c,&t); NEXTMP(mr0,mr); mr->c = (Obj)t; mr->dl = m->dl;
749: }
750: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
751: }
752: }
753:
754: void Pdp_sep(NODE arg,VECT *rp)
755: {
756: DP p,r;
757: MP m,t;
758: MP *w0,*w;
759: int i,n,d,nv,sugar;
760: VECT v;
761: pointer *pv;
762:
763: p = (DP)ARG0(arg); m = BDY(p);
1.2 noro 764: d = ZTOS((Q)ARG1(arg));
1.1 noro 765: for ( t = m, n = 0; t; t = NEXT(t), n++ );
766: if ( d > n )
767: d = n;
768: MKVECT(v,d); *rp = v;
769: pv = BDY(v); nv = p->nv; sugar = p->sugar;
770: w0 = (MP *)MALLOC(d*sizeof(MP)); bzero(w0,d*sizeof(MP));
771: w = (MP *)MALLOC(d*sizeof(MP)); bzero(w,d*sizeof(MP));
772: for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, i %= d ) {
773: NEXTMP(w0[i],w[i]); w[i]->c = t->c; w[i]->dl = t->dl;
774: }
775: for ( i = 0; i < d; i++ ) {
776: NEXT(w[i]) = 0; MKDP(nv,w0[i],r); r->sugar = sugar;
777: pv[i] = (pointer)r;
778: }
779: }
780:
781: void Pdp_idiv(NODE arg,DP *rp)
782: {
783: dp_idiv((DP)ARG0(arg),(Z)ARG1(arg),rp);
784: }
785:
786: void Pdp_cont(NODE arg,Z *rp)
787: {
788: dp_cont((DP)ARG0(arg),rp);
789: }
790:
791: void Pdp_dtov(NODE arg,VECT *rp)
792: {
793: dp_dtov((DP)ARG0(arg),rp);
794: }
795:
796: void Pdp_mbase(NODE arg,LIST *rp)
797: {
798: NODE mb;
799:
800: asir_assert(ARG0(arg),O_LIST,"dp_mbase");
801: dp_mbase(BDY((LIST)ARG0(arg)),&mb);
802: MKLIST(*rp,mb);
803: }
804:
805: void Pdp_etov(NODE arg,VECT *rp)
806: {
807: DP dp;
808: int n,i;
809: int *d;
810: VECT v;
811: Z t;
812:
813: dp = (DP)ARG0(arg);
814: asir_assert(dp,O_DP,"dp_etov");
815: n = dp->nv; d = BDY(dp)->dl->d;
816: MKVECT(v,n);
817: for ( i = 0; i < n; i++ ) {
1.2 noro 818: STOZ(d[i],t); v->body[i] = (pointer)t;
1.1 noro 819: }
820: *rp = v;
821: }
822:
823: void Pdp_vtoe(NODE arg,DP *rp)
824: {
825: DP dp;
826: DL dl;
827: MP m;
828: int n,i,td;
829: int *d;
830: VECT v;
831:
832: v = (VECT)ARG0(arg);
833: asir_assert(v,O_VECT,"dp_vtoe");
834: n = v->len;
835: NEWDL(dl,n); d = dl->d;
836: for ( i = 0, td = 0; i < n; i++ ) {
1.2 noro 837: d[i] = ZTOS((Q)(v->body[i])); td += MUL_WEIGHT(d[i],i);
1.1 noro 838: }
839: dl->td = td;
840: NEWMP(m); m->dl = dl; m->c = (Obj)ONE; NEXT(m) = 0;
841: MKDP(n,m,dp); dp->sugar = td;
842: *rp = dp;
843: }
844:
845: void Pdp_lnf_mod(NODE arg,LIST *rp)
846: {
847: DP r1,r2;
848: NODE b,g,n;
849: int mod;
850:
851: asir_assert(ARG0(arg),O_LIST,"dp_lnf_mod");
852: asir_assert(ARG1(arg),O_LIST,"dp_lnf_mod");
853: asir_assert(ARG2(arg),O_N,"dp_lnf_mod");
854: b = BDY((LIST)ARG0(arg)); g = BDY((LIST)ARG1(arg));
1.2 noro 855: mod = ZTOS((Q)ARG2(arg));
1.1 noro 856: dp_lnf_mod((DP)BDY(b),(DP)BDY(NEXT(b)),g,mod,&r1,&r2);
857: NEWNODE(n); BDY(n) = (pointer)r1;
858: NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)r2;
859: NEXT(NEXT(n)) = 0; MKLIST(*rp,n);
860: }
861:
862: void Pdp_lnf_f(NODE arg,LIST *rp)
863: {
864: DP r1,r2;
865: NODE b,g,n;
866:
867: asir_assert(ARG0(arg),O_LIST,"dp_lnf_f");
868: asir_assert(ARG1(arg),O_LIST,"dp_lnf_f");
869: b = BDY((LIST)ARG0(arg)); g = BDY((LIST)ARG1(arg));
870: dp_lnf_f((DP)BDY(b),(DP)BDY(NEXT(b)),g,&r1,&r2);
871: NEWNODE(n); BDY(n) = (pointer)r1;
872: NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)r2;
873: NEXT(NEXT(n)) = 0; MKLIST(*rp,n);
874: }
875:
876: void Pdp_nf_tab_mod(NODE arg,DP *rp)
877: {
878: asir_assert(ARG0(arg),O_DP,"dp_nf_tab_mod");
879: asir_assert(ARG1(arg),O_VECT,"dp_nf_tab_mod");
880: asir_assert(ARG2(arg),O_N,"dp_nf_tab_mod");
881: dp_nf_tab_mod((DP)ARG0(arg),(LIST *)BDY((VECT)ARG1(arg)),
1.2 noro 882: ZTOS((Q)ARG2(arg)),rp);
1.1 noro 883: }
884:
885: void Pdp_nf_tab_f(NODE arg,DP *rp)
886: {
887: asir_assert(ARG0(arg),O_DP,"dp_nf_tab_f");
888: asir_assert(ARG1(arg),O_VECT,"dp_nf_tab_f");
889: dp_nf_tab_f((DP)ARG0(arg),(LIST *)BDY((VECT)ARG1(arg)),rp);
890: }
891:
892: void Pdp_ord(NODE arg,Obj *rp)
893: {
894: struct order_spec *spec;
895: LIST v;
896: struct oLIST f;
897: Num homo;
898: int modular;
899:
900: f.id = O_LIST; f.body = 0;
901: if ( !arg && !current_option )
902: *rp = dp_current_spec->obj;
903: else {
904: if ( current_option )
905: parse_gr_option(&f,current_option,&v,&homo,&modular,&spec);
906: else if ( !create_order_spec(0,(Obj)ARG0(arg),&spec) )
907: error("dp_ord : invalid order specification");
908: initd(spec); *rp = spec->obj;
909: }
910: }
911:
912: void Pdp_ptod(NODE arg,DP *rp)
913: {
914: P p;
915: NODE n;
916: VL vl,tvl;
917: struct oLIST f;
918: int ac;
919: LIST v;
920: Num homo;
921: int modular;
922: struct order_spec *ord;
923:
924: asir_assert(ARG0(arg),O_P,"dp_ptod");
925: p = (P)ARG0(arg);
926: ac = argc(arg);
927: if ( ac == 1 ) {
928: if ( current_option ) {
929: f.id = O_LIST; f.body = mknode(1,p);
930: parse_gr_option(&f,current_option,&v,&homo,&modular,&ord);
931: initd(ord);
932: } else
933: error("dp_ptod : invalid argument");
934: } else {
935: asir_assert(ARG1(arg),O_LIST,"dp_ptod");
936: v = (LIST)ARG1(arg);
937: }
938: for ( vl = 0, n = BDY(v); n; n = NEXT(n) ) {
939: if ( !vl ) {
940: NEWVL(vl); tvl = vl;
941: } else {
942: NEWVL(NEXT(tvl)); tvl = NEXT(tvl);
943: }
944: VR(tvl) = VR((P)BDY(n));
945: }
946: if ( vl )
947: NEXT(tvl) = 0;
948: ptod(CO,vl,p,rp);
949: }
950:
951: void Phomogenize(NODE arg,Obj *rp)
952: {
953: P p;
954: DP d,h;
955: NODE n;
956: V hv;
957: VL vl,tvl,last;
958: struct oLIST f;
959: LIST v;
960:
961: asir_assert(ARG0(arg),O_P,"homogenize");
962: p = (P)ARG0(arg);
963: asir_assert(ARG1(arg),O_LIST,"homogenize");
964: v = (LIST)ARG1(arg);
965: asir_assert(ARG2(arg),O_P,"homogenize");
966: hv = VR((P)ARG2(arg));
967: for ( vl = 0, n = BDY(v); n; n = NEXT(n) ) {
968: if ( !vl ) {
969: NEWVL(vl); tvl = vl;
970: } else {
971: NEWVL(NEXT(tvl)); tvl = NEXT(tvl);
972: }
973: VR(tvl) = VR((P)BDY(n));
974: }
975: if ( vl ) {
976: last = tvl;
977: NEXT(tvl) = 0;
978: }
979: ptod(CO,vl,p,&d);
980: dp_homo(d,&h);
981: NEWVL(NEXT(last)); last = NEXT(last);
982: VR(last) = hv; NEXT(last) = 0;
983: dtop(CO,vl,h,rp);
984: }
985:
986: void Pdp_ltod(NODE arg,DPV *rp)
987: {
988: NODE n;
989: VL vl,tvl;
990: LIST f,v;
991: int sugar,i,len,ac,modular;
992: Num homo;
993: struct order_spec *ord;
994: DP *e;
995: NODE nd,t;
996:
997: ac = argc(arg);
998: asir_assert(ARG0(arg),O_LIST,"dp_ptod");
999: f = (LIST)ARG0(arg);
1000: if ( ac == 1 ) {
1001: if ( current_option ) {
1002: parse_gr_option(f,current_option,&v,&homo,&modular,&ord);
1003: initd(ord);
1004: } else
1005: error("dp_ltod : invalid argument");
1006: } else {
1007: asir_assert(ARG1(arg),O_LIST,"dp_ptod");
1008: v = (LIST)ARG1(arg);
1009: }
1010: for ( vl = 0, n = BDY(v); n; n = NEXT(n) ) {
1011: if ( !vl ) {
1012: NEWVL(vl); tvl = vl;
1013: } else {
1014: NEWVL(NEXT(tvl)); tvl = NEXT(tvl);
1015: }
1016: VR(tvl) = VR((P)BDY(n));
1017: }
1018: if ( vl )
1019: NEXT(tvl) = 0;
1020:
1021: nd = BDY(f);
1022: len = length(nd);
1023: e = (DP *)MALLOC(len*sizeof(DP));
1024: sugar = 0;
1025: for ( i = 0, t = nd; i < len; i++, t = NEXT(t) ) {
1026: ptod(CO,vl,(P)BDY(t),&e[i]);
1027: if ( e[i] )
1028: sugar = MAX(sugar,e[i]->sugar);
1029: }
1030: MKDPV(len,e,*rp);
1031: }
1032:
1033: void Pdpm_ltod(NODE arg,DPM *rp)
1034: {
1035: NODE n;
1036: VL vl,tvl;
1037: LIST f,v;
1038: int i,len;
1039: NODE nd;
1040: NODE t;
1041: DP d;
1042: DPM s,u,w;
1043:
1044: f = (LIST)ARG0(arg);
1045: v = (LIST)ARG1(arg);
1046: for ( vl = 0, n = BDY(v); n; n = NEXT(n) ) {
1047: if ( !vl ) {
1048: NEWVL(vl); tvl = vl;
1049: } else {
1050: NEWVL(NEXT(tvl)); tvl = NEXT(tvl);
1051: }
1052: VR(tvl) = VR((P)BDY(n));
1053: }
1054: if ( vl )
1055: NEXT(tvl) = 0;
1056:
1057: nd = BDY(f);
1058: len = length(nd);
1059: for ( i = 0, t = nd, s = 0; i < len; i++, t = NEXT(t) ) {
1060: ptod(CO,vl,(P)BDY(t),&d);
1061: dtodpm(d,i,&u);
1062: adddpm(CO,s,u,&w); s = w;
1063: }
1064: *rp = s;
1065: }
1066:
1067: void Pdpm_dtol(NODE arg,LIST *rp)
1068: {
1069: DPM a;
1070: NODE nd,nd1;
1071: VL vl,tvl;
1072: int n,len,i,pos,nv;
1073: MP *w;
1074: DMM t;
1075: DMM *wa;
1076: MP m;
1077: DP u;
1078: Obj s;
1079:
1080: a = (DPM)ARG0(arg);
1081: for ( vl = 0, nd = BDY((LIST)ARG1(arg)), nv = 0; nd; nd = NEXT(nd), nv++ ) {
1082: if ( !vl ) {
1083: NEWVL(vl); tvl = vl;
1084: } else {
1085: NEWVL(NEXT(tvl)); tvl = NEXT(tvl);
1086: }
1087: VR(tvl) = VR((P)BDY(nd));
1088: }
1089: if ( vl )
1090: NEXT(tvl) = 0;
1.2 noro 1091: n = ZTOS((Q)ARG2(arg));
1.1 noro 1092: w = (MP *)CALLOC(n,sizeof(MP));
1093: for ( t = BDY(a), len = 0; t; t = NEXT(t) ) len++;
1094: wa = (DMM *)MALLOC(len*sizeof(DMM));
1095: for ( t = BDY(a), i = 0; t; t = NEXT(t), i++ ) wa[i] = t;
1096: for ( i = len-1; i >= 0; i-- ) {
1097: NEWMP(m); m->dl = wa[i]->dl; C(m) = C(wa[i]);
1098: pos = wa[i]->pos;
1099: NEXT(m) = w[pos];
1100: w[pos] = m;
1101: }
1102: nd = 0;
1103: for ( i = n-1; i >= 0; i-- ) {
1104: MKDP(nv,w[i],u); u->sugar = a->sugar; /* XXX */
1105: dtop(CO,vl,u,&s);
1106: MKNODE(nd1,s,nd); nd = nd1;
1107: }
1108: MKLIST(*rp,nd);
1109: }
1110:
1111: void Pdp_dtop(NODE arg,Obj *rp)
1112: {
1113: NODE n;
1114: VL vl,tvl;
1115:
1116: asir_assert(ARG0(arg),O_DP,"dp_dtop");
1117: asir_assert(ARG1(arg),O_LIST,"dp_dtop");
1118: for ( vl = 0, n = BDY((LIST)ARG1(arg)); n; n = NEXT(n) ) {
1119: if ( !vl ) {
1120: NEWVL(vl); tvl = vl;
1121: } else {
1122: NEWVL(NEXT(tvl)); tvl = NEXT(tvl);
1123: }
1124: VR(tvl) = VR((P)BDY(n));
1125: }
1126: if ( vl )
1127: NEXT(tvl) = 0;
1128: dtop(CO,vl,(DP)ARG0(arg),rp);
1129: }
1130:
1131: extern LIST Dist;
1132:
1133: void Pdp_ptozp(NODE arg,Obj *rp)
1134: {
1135: Z t;
1136: NODE tt,p;
1137: NODE n,n0;
1138: char *key;
1139: DP pp;
1140: LIST list;
1141: int get_factor=0;
1142:
1143: asir_assert(ARG0(arg),O_DP,"dp_ptozp");
1144:
1145: /* analyze the option */
1146: if ( current_option ) {
1147: for ( tt = current_option; tt; tt = NEXT(tt) ) {
1148: p = BDY((LIST)BDY(tt));
1149: key = BDY((STRING)BDY(p));
1150: /* value = (Obj)BDY(NEXT(p)); */
1151: if ( !strcmp(key,"factor") ) get_factor=1;
1152: else {
1153: error("ptozp: unknown option.");
1154: }
1155: }
1156: }
1157:
1158: dp_ptozp3((DP)ARG0(arg),&t,&pp);
1159:
1160: /* printexpr(NULL,t); */
1161: /* if the option factor is given, then it returns the answer
1162: in the format [zpoly, num] where num*zpoly is equal to the argument.*/
1163: if (get_factor) {
1164: n0 = mknode(2,pp,t);
1165: MKLIST(list,n0);
1166: *rp = (Obj)list;
1167: } else
1168: *rp = (Obj)pp;
1169: }
1170:
1171: void Pdp_ptozp2(NODE arg,LIST *rp)
1172: {
1173: DP p0,p1,h,r;
1174: NODE n0;
1175:
1176: p0 = (DP)ARG0(arg); p1 = (DP)ARG1(arg);
1177: asir_assert(p0,O_DP,"dp_ptozp2");
1178: asir_assert(p1,O_DP,"dp_ptozp2");
1179: dp_ptozp2(p0,p1,&h,&r);
1180: NEWNODE(n0); BDY(n0) = (pointer)h;
1181: NEWNODE(NEXT(n0)); BDY(NEXT(n0)) = (pointer)r;
1182: NEXT(NEXT(n0)) = 0;
1183: MKLIST(*rp,n0);
1184: }
1185:
1186: void Pdp_prim(NODE arg,DP *rp)
1187: {
1188: DP t;
1189:
1190: asir_assert(ARG0(arg),O_DP,"dp_prim");
1191: dp_prim((DP)ARG0(arg),&t); dp_ptozp(t,rp);
1192: }
1193:
1194: void Pdp_mod(NODE arg,DP *rp)
1195: {
1196: DP p;
1197: int mod;
1198: NODE subst;
1199:
1200: asir_assert(ARG0(arg),O_DP,"dp_mod");
1201: asir_assert(ARG1(arg),O_N,"dp_mod");
1202: asir_assert(ARG2(arg),O_LIST,"dp_mod");
1.2 noro 1203: p = (DP)ARG0(arg); mod = ZTOS((Q)ARG1(arg));
1.1 noro 1204: subst = BDY((LIST)ARG2(arg));
1205: dp_mod(p,mod,subst,rp);
1206: }
1207:
1208: void Pdp_rat(NODE arg,DP *rp)
1209: {
1210: asir_assert(ARG0(arg),O_DP,"dp_rat");
1211: dp_rat((DP)ARG0(arg),rp);
1212: }
1213:
1214: extern int DP_Multiple;
1215:
1216: void Pdp_nf(NODE arg,DP *rp)
1217: {
1218: NODE b;
1219: DP *ps;
1220: DP g;
1221: int full;
1222:
1223: do_weyl = 0; dp_fcoeffs = 0;
1224: asir_assert(ARG0(arg),O_LIST,"dp_nf");
1225: asir_assert(ARG1(arg),O_DP,"dp_nf");
1226: asir_assert(ARG2(arg),O_VECT,"dp_nf");
1227: asir_assert(ARG3(arg),O_N,"dp_nf");
1228: if ( !(g = (DP)ARG1(arg)) ) {
1229: *rp = 0; return;
1230: }
1231: b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg));
1232: full = (Q)ARG3(arg) ? 1 : 0;
1233: dp_nf_z(b,g,ps,full,DP_Multiple,rp);
1234: }
1235:
1236: void Pdp_weyl_nf(NODE arg,DP *rp)
1237: {
1238: NODE b;
1239: DP *ps;
1240: DP g;
1241: int full;
1242:
1243: asir_assert(ARG0(arg),O_LIST,"dp_weyl_nf");
1244: asir_assert(ARG1(arg),O_DP,"dp_weyl_nf");
1245: asir_assert(ARG2(arg),O_VECT,"dp_weyl_nf");
1246: asir_assert(ARG3(arg),O_N,"dp_weyl_nf");
1247: if ( !(g = (DP)ARG1(arg)) ) {
1248: *rp = 0; return;
1249: }
1250: b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg));
1251: full = (Q)ARG3(arg) ? 1 : 0;
1252: do_weyl = 1;
1253: dp_nf_z(b,g,ps,full,DP_Multiple,rp);
1254: do_weyl = 0;
1255: }
1256:
1257: void Pdpm_nf(NODE arg,DPM *rp)
1258: {
1259: NODE b;
1260: DPM *ps;
1261: DPM g;
1262: int full;
1263:
1264: if ( !(g = (DPM)ARG1(arg)) ) {
1265: *rp = 0; return;
1266: }
1267: do_weyl = 0; dp_fcoeffs = 0;
1268: asir_assert(ARG0(arg),O_LIST,"dpm_nf");
1269: asir_assert(ARG1(arg),O_DPM,"dpm_nf");
1270: asir_assert(ARG2(arg),O_VECT,"dpm_nf");
1271: asir_assert(ARG3(arg),O_N,"dpm_nf");
1272: b = BDY((LIST)ARG0(arg)); ps = (DPM *)BDY((VECT)ARG2(arg));
1273: full = (Q)ARG3(arg) ? 1 : 0;
1274: dpm_nf_z(b,g,ps,full,DP_Multiple,rp);
1275: }
1276:
1277: void Pdpm_weyl_nf(NODE arg,DPM *rp)
1278: {
1279: NODE b;
1280: DPM *ps;
1281: DPM g;
1282: int full;
1283:
1284: if ( !(g = (DPM)ARG1(arg)) ) {
1285: *rp = 0; return;
1286: }
1287: asir_assert(ARG0(arg),O_LIST,"dpm_weyl_nf");
1288: asir_assert(ARG1(arg),O_DPM,"dpm_weyl_nf");
1289: asir_assert(ARG2(arg),O_VECT,"dpm_weyl_nf");
1290: asir_assert(ARG3(arg),O_N,"dpm_weyl_nf");
1291: b = BDY((LIST)ARG0(arg)); ps = (DPM *)BDY((VECT)ARG2(arg));
1292: full = (Q)ARG3(arg) ? 1 : 0;
1293: do_weyl = 1;
1294: dpm_nf_z(b,g,ps,full,DP_Multiple,rp);
1295: do_weyl = 0;
1296: }
1297:
1298: /* nf computation using field operations */
1299:
1300: void Pdp_nf_f(NODE arg,DP *rp)
1301: {
1302: NODE b;
1303: DP *ps;
1304: DP g;
1305: int full;
1306:
1307: do_weyl = 0;
1308: asir_assert(ARG0(arg),O_LIST,"dp_nf_f");
1309: asir_assert(ARG1(arg),O_DP,"dp_nf_f");
1310: asir_assert(ARG2(arg),O_VECT,"dp_nf_f");
1311: asir_assert(ARG3(arg),O_N,"dp_nf_f");
1312: if ( !(g = (DP)ARG1(arg)) ) {
1313: *rp = 0; return;
1314: }
1315: b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg));
1316: full = (Q)ARG3(arg) ? 1 : 0;
1317: dp_nf_f(b,g,ps,full,rp);
1318: }
1319:
1320: void Pdp_weyl_nf_f(NODE arg,DP *rp)
1321: {
1322: NODE b;
1323: DP *ps;
1324: DP g;
1325: int full;
1326:
1327: asir_assert(ARG0(arg),O_LIST,"dp_weyl_nf_f");
1328: asir_assert(ARG1(arg),O_DP,"dp_weyl_nf_f");
1329: asir_assert(ARG2(arg),O_VECT,"dp_weyl_nf_f");
1330: asir_assert(ARG3(arg),O_N,"dp_weyl_nf_f");
1331: if ( !(g = (DP)ARG1(arg)) ) {
1332: *rp = 0; return;
1333: }
1334: b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg));
1335: full = (Q)ARG3(arg) ? 1 : 0;
1336: do_weyl = 1;
1337: dp_nf_f(b,g,ps,full,rp);
1338: do_weyl = 0;
1339: }
1340:
1341: void Pdpm_nf_f(NODE arg,DPM *rp)
1342: {
1343: NODE b;
1344: DPM *ps;
1345: DPM g;
1346: int full;
1347:
1348: if ( !(g = (DPM)ARG1(arg)) ) {
1349: *rp = 0; return;
1350: }
1351: asir_assert(ARG0(arg),O_LIST,"dpm_nf_f");
1352: asir_assert(ARG1(arg),O_DPM,"dpm_nf_f");
1353: asir_assert(ARG2(arg),O_VECT,"dpm_nf_f");
1354: asir_assert(ARG3(arg),O_N,"dpm_nf_f");
1355: b = BDY((LIST)ARG0(arg)); ps = (DPM *)BDY((VECT)ARG2(arg));
1356: full = (Q)ARG3(arg) ? 1 : 0;
1357: dpm_nf_f(b,g,ps,full,rp);
1358: }
1359:
1360: void Pdpm_weyl_nf_f(NODE arg,DPM *rp)
1361: {
1362: NODE b;
1363: DPM *ps;
1364: DPM g;
1365: int full;
1366:
1367: if ( !(g = (DPM)ARG1(arg)) ) {
1368: *rp = 0; return;
1369: }
1370: asir_assert(ARG0(arg),O_LIST,"dpm_weyl_nf_f");
1371: asir_assert(ARG1(arg),O_DP,"dpm_weyl_nf_f");
1372: asir_assert(ARG2(arg),O_VECT,"dpm_weyl_nf_f");
1373: asir_assert(ARG3(arg),O_N,"dpm_weyl_nf_f");
1374: b = BDY((LIST)ARG0(arg)); ps = (DPM *)BDY((VECT)ARG2(arg));
1375: full = (Q)ARG3(arg) ? 1 : 0;
1376: do_weyl = 1;
1377: dpm_nf_f(b,g,ps,full,rp);
1378: do_weyl = 0;
1379: }
1380:
1381:
1382: void Pdp_nf_mod(NODE arg,DP *rp)
1383: {
1384: NODE b;
1385: DP g;
1386: DP *ps;
1387: int mod,full,ac;
1388: NODE n,n0;
1389:
1390: do_weyl = 0;
1391: ac = argc(arg);
1392: asir_assert(ARG0(arg),O_LIST,"dp_nf_mod");
1393: asir_assert(ARG1(arg),O_DP,"dp_nf_mod");
1394: asir_assert(ARG2(arg),O_VECT,"dp_nf_mod");
1395: asir_assert(ARG3(arg),O_N,"dp_nf_mod");
1396: asir_assert(ARG4(arg),O_N,"dp_nf_mod");
1397: if ( !(g = (DP)ARG1(arg)) ) {
1398: *rp = 0; return;
1399: }
1400: b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg));
1.2 noro 1401: full = ZTOS((Q)ARG3(arg)); mod = ZTOS((Q)ARG4(arg));
1.1 noro 1402: for ( n0 = n = 0; b; b = NEXT(b) ) {
1403: NEXTNODE(n0,n);
1.2 noro 1404: BDY(n) = (pointer)ZTOS((Q)BDY(b));
1.1 noro 1405: }
1406: if ( n0 )
1407: NEXT(n) = 0;
1408: dp_nf_mod(n0,g,ps,mod,full,rp);
1409: }
1410:
1411: void Pdp_true_nf(NODE arg,LIST *rp)
1412: {
1413: NODE b,n;
1414: DP *ps;
1415: DP g;
1416: DP nm;
1417: P dn;
1418: int full;
1419:
1420: do_weyl = 0; dp_fcoeffs = 0;
1421: asir_assert(ARG0(arg),O_LIST,"dp_true_nf");
1422: asir_assert(ARG1(arg),O_DP,"dp_true_nf");
1423: asir_assert(ARG2(arg),O_VECT,"dp_true_nf");
1424: asir_assert(ARG3(arg),O_N,"dp_nf");
1425: if ( !(g = (DP)ARG1(arg)) ) {
1426: nm = 0; dn = (P)ONE;
1427: } else {
1428: b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg));
1429: full = (Q)ARG3(arg) ? 1 : 0;
1430: dp_true_nf(b,g,ps,full,&nm,&dn);
1431: }
1432: NEWNODE(n); BDY(n) = (pointer)nm;
1433: NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)dn;
1434: NEXT(NEXT(n)) = 0; MKLIST(*rp,n);
1435: }
1436:
1437: DP *dp_true_nf_and_quotient_marked(NODE b,DP g,DP *ps,DP *hps,DP *rp,P *dnp);
1438:
1439: void Pdp_true_nf_and_quotient_marked(NODE arg,LIST *rp)
1440: {
1441: NODE b,n;
1442: DP *ps,*hps;
1443: DP g;
1444: DP nm;
1445: VECT quo;
1446: P dn;
1447: int full;
1448:
1449: do_weyl = 0; dp_fcoeffs = 0;
1450: asir_assert(ARG0(arg),O_LIST,"dp_true_nf_and_quotient_marked");
1451: asir_assert(ARG1(arg),O_DP,"dp_true_nf_and_quotient_marked");
1452: asir_assert(ARG2(arg),O_VECT,"dp_true_nf_and_quotient_marked");
1453: asir_assert(ARG3(arg),O_VECT,"dp_true_nf_and_quotient_marked");
1454: if ( !(g = (DP)ARG1(arg)) ) {
1455: nm = 0; dn = (P)ONE;
1456: } else {
1457: b = BDY((LIST)ARG0(arg));
1458: ps = (DP *)BDY((VECT)ARG2(arg));
1459: hps = (DP *)BDY((VECT)ARG3(arg));
1460: NEWVECT(quo); quo->len = ((VECT)ARG2(arg))->len;
1461: quo->body = (pointer *)dp_true_nf_and_quotient_marked(b,g,ps,hps,&nm,&dn);
1462: }
1463: n = mknode(3,nm,dn,quo);
1464: MKLIST(*rp,n);
1465: }
1466:
1467: void Pdp_true_nf_and_quotient(NODE arg,LIST *rp)
1468: {
1469: NODE narg = mknode(4,ARG0(arg),ARG1(arg),ARG2(arg),ARG2(arg));
1470: Pdp_true_nf_and_quotient_marked(narg,rp);
1471: }
1472:
1473:
1474: DP *dp_true_nf_and_quotient_marked_mod (NODE b,DP g,DP *ps,DP *hps,int mod,DP *rp,P *dnp);
1475:
1476: void Pdp_true_nf_and_quotient_marked_mod(NODE arg,LIST *rp)
1477: {
1478: NODE b,n;
1479: DP *ps,*hps;
1480: DP g;
1481: DP nm;
1482: VECT quo;
1483: P dn;
1484: int full,mod;
1485:
1486: do_weyl = 0; dp_fcoeffs = 0;
1487: asir_assert(ARG0(arg),O_LIST,"dp_true_nf_and_quotient_marked_mod");
1488: asir_assert(ARG1(arg),O_DP,"dp_true_nf_and_quotient_marked_mod");
1489: asir_assert(ARG2(arg),O_VECT,"dp_true_nf_and_quotient_marked_mod");
1490: asir_assert(ARG3(arg),O_VECT,"dp_true_nf_and_quotient_marked_mod");
1491: asir_assert(ARG4(arg),O_N,"dp_true_nf_and_quotient_marked_mod");
1492: if ( !(g = (DP)ARG1(arg)) ) {
1493: nm = 0; dn = (P)ONE;
1494: } else {
1495: b = BDY((LIST)ARG0(arg));
1496: ps = (DP *)BDY((VECT)ARG2(arg));
1497: hps = (DP *)BDY((VECT)ARG3(arg));
1.2 noro 1498: mod = ZTOS((Q)ARG4(arg));
1.1 noro 1499: NEWVECT(quo); quo->len = ((VECT)ARG2(arg))->len;
1500: quo->body = (pointer *)dp_true_nf_and_quotient_marked_mod(b,g,ps,hps,mod,&nm,&dn);
1501: }
1502: n = mknode(3,nm,dn,quo);
1503: MKLIST(*rp,n);
1504: }
1505:
1506: void Pdp_true_nf_and_quotient_mod(NODE arg,LIST *rp)
1507: {
1508: NODE narg = mknode(5,ARG0(arg),ARG1(arg),ARG2(arg),ARG2(arg),ARG3(arg));
1509: Pdp_true_nf_and_quotient_marked_mod(narg,rp);
1510: }
1511:
1512: void Pdp_true_nf_marked(NODE arg,LIST *rp)
1513: {
1514: NODE b,n;
1515: DP *ps,*hps;
1516: DP g;
1517: DP nm;
1518: Q cont;
1519: P dn;
1520: int full;
1521:
1522: do_weyl = 0; dp_fcoeffs = 0;
1523: asir_assert(ARG0(arg),O_LIST,"dp_true_nf_marked");
1524: asir_assert(ARG1(arg),O_DP,"dp_true_nf_marked");
1525: asir_assert(ARG2(arg),O_VECT,"dp_true_nf_marked");
1526: asir_assert(ARG3(arg),O_VECT,"dp_true_nf_marked");
1527: if ( !(g = (DP)ARG1(arg)) ) {
1528: nm = 0; dn = (P)ONE;
1529: } else {
1530: b = BDY((LIST)ARG0(arg));
1531: ps = (DP *)BDY((VECT)ARG2(arg));
1532: hps = (DP *)BDY((VECT)ARG3(arg));
1533: dp_true_nf_marked(b,g,ps,hps,&nm,(P *)&cont,(P *)&dn);
1534: }
1535: n = mknode(3,nm,cont,dn);
1536: MKLIST(*rp,n);
1537: }
1538:
1539: void Pdp_true_nf_marked_mod(NODE arg,LIST *rp)
1540: {
1541: NODE b,n;
1542: DP *ps,*hps;
1543: DP g;
1544: DP nm;
1545: P dn;
1546: int mod;
1547:
1548: do_weyl = 0; dp_fcoeffs = 0;
1549: asir_assert(ARG0(arg),O_LIST,"dp_true_nf_marked_mod");
1550: asir_assert(ARG1(arg),O_DP,"dp_true_nf_marked_mod");
1551: asir_assert(ARG2(arg),O_VECT,"dp_true_nf_marked_mod");
1552: asir_assert(ARG3(arg),O_VECT,"dp_true_nf_marked_mod");
1553: asir_assert(ARG4(arg),O_N,"dp_true_nf_marked_mod");
1554: if ( !(g = (DP)ARG1(arg)) ) {
1555: nm = 0; dn = (P)ONE;
1556: } else {
1557: b = BDY((LIST)ARG0(arg));
1558: ps = (DP *)BDY((VECT)ARG2(arg));
1559: hps = (DP *)BDY((VECT)ARG3(arg));
1.2 noro 1560: mod = ZTOS((Q)ARG4(arg));
1.1 noro 1561: dp_true_nf_marked_mod(b,g,ps,hps,mod,&nm,&dn);
1562: }
1563: n = mknode(2,nm,dn);
1564: MKLIST(*rp,n);
1565: }
1566:
1567: void Pdp_weyl_nf_mod(NODE arg,DP *rp)
1568: {
1569: NODE b;
1570: DP g;
1571: DP *ps;
1572: int mod,full,ac;
1573: NODE n,n0;
1574:
1575: ac = argc(arg);
1576: asir_assert(ARG0(arg),O_LIST,"dp_weyl_nf_mod");
1577: asir_assert(ARG1(arg),O_DP,"dp_weyl_nf_mod");
1578: asir_assert(ARG2(arg),O_VECT,"dp_weyl_nf_mod");
1579: asir_assert(ARG3(arg),O_N,"dp_weyl_nf_mod");
1580: asir_assert(ARG4(arg),O_N,"dp_weyl_nf_mod");
1581: if ( !(g = (DP)ARG1(arg)) ) {
1582: *rp = 0; return;
1583: }
1584: b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg));
1.2 noro 1585: full = ZTOS((Q)ARG3(arg)); mod = ZTOS((Q)ARG4(arg));
1.1 noro 1586: for ( n0 = n = 0; b; b = NEXT(b) ) {
1587: NEXTNODE(n0,n);
1.2 noro 1588: BDY(n) = (pointer)ZTOS((Q)BDY(b));
1.1 noro 1589: }
1590: if ( n0 )
1591: NEXT(n) = 0;
1592: do_weyl = 1;
1593: dp_nf_mod(n0,g,ps,mod,full,rp);
1594: do_weyl = 0;
1595: }
1596:
1597: void Pdp_true_nf_mod(NODE arg,LIST *rp)
1598: {
1599: NODE b;
1600: DP g,nm;
1601: P dn;
1602: DP *ps;
1603: int mod,full;
1604: NODE n;
1605:
1606: do_weyl = 0;
1607: asir_assert(ARG0(arg),O_LIST,"dp_nf_mod");
1608: asir_assert(ARG1(arg),O_DP,"dp_nf_mod");
1609: asir_assert(ARG2(arg),O_VECT,"dp_nf_mod");
1610: asir_assert(ARG3(arg),O_N,"dp_nf_mod");
1611: asir_assert(ARG4(arg),O_N,"dp_nf_mod");
1612: if ( !(g = (DP)ARG1(arg)) ) {
1613: nm = 0; dn = (P)ONEM;
1614: } else {
1615: b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg));
1.2 noro 1616: full = ZTOS((Q)ARG3(arg)); mod = ZTOS((Q)ARG4(arg));
1.1 noro 1617: dp_true_nf_mod(b,g,ps,mod,full,&nm,&dn);
1618: }
1619: NEWNODE(n); BDY(n) = (pointer)nm;
1620: NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)dn;
1621: NEXT(NEXT(n)) = 0; MKLIST(*rp,n);
1622: }
1623:
1624: void Pdp_weyl_true_nf_and_quotient_marked(NODE arg,LIST *rp)
1625: {
1626: NODE b,n;
1627: DP *ps,*hps;
1628: DP g;
1629: DP nm;
1630: VECT quo;
1631: P dn;
1632: int full;
1633:
1634: do_weyl = 1; dp_fcoeffs = 0;
1635: asir_assert(ARG0(arg),O_LIST,"dp_weyl_true_nf_and_quotient_marked");
1636: asir_assert(ARG1(arg),O_DP,"dp_weyl_true_nf_and_quotient_marked");
1637: asir_assert(ARG2(arg),O_VECT,"dp_weyl_true_nf_and_quotient_marked");
1638: asir_assert(ARG3(arg),O_VECT,"dp_weyl_true_nf_and_quotient_marked");
1639: if ( !(g = (DP)ARG1(arg)) ) {
1640: nm = 0; dn = (P)ONE;
1641: } else {
1642: b = BDY((LIST)ARG0(arg));
1643: ps = (DP *)BDY((VECT)ARG2(arg));
1644: hps = (DP *)BDY((VECT)ARG3(arg));
1645: NEWVECT(quo); quo->len = ((VECT)ARG2(arg))->len;
1646: quo->body = (pointer *)dp_true_nf_and_quotient_marked(b,g,ps,hps,&nm,&dn);
1647: }
1648: n = mknode(3,nm,dn,quo);
1649: MKLIST(*rp,n);
1650: }
1651:
1652: void Pdp_weyl_true_nf_and_quotient(NODE arg,LIST *rp)
1653: {
1654: NODE narg = mknode(4,ARG0(arg),ARG1(arg),ARG2(arg),ARG2(arg));
1655: Pdp_weyl_true_nf_and_quotient_marked(narg,rp);
1656: }
1657:
1658:
1659: void Pdp_weyl_true_nf_and_quotient_marked_mod(NODE arg,LIST *rp)
1660: {
1661: NODE b,n;
1662: DP *ps,*hps;
1663: DP g;
1664: DP nm;
1665: VECT quo;
1666: P dn;
1667: int full,mod;
1668:
1669: do_weyl = 1; dp_fcoeffs = 0;
1670: asir_assert(ARG0(arg),O_LIST,"dp_weyl_true_nf_and_quotient_marked_mod");
1671: asir_assert(ARG1(arg),O_DP,"dp_weyl_true_nf_and_quotient_marked_mod");
1672: asir_assert(ARG2(arg),O_VECT,"dp_weyl_true_nf_and_quotient_marked_mod");
1673: asir_assert(ARG3(arg),O_VECT,"dp_weyl_true_nf_and_quotient_marked_mod");
1674: asir_assert(ARG4(arg),O_N,"dp_weyl_true_nf_and_quotient_marked_mod");
1675: if ( !(g = (DP)ARG1(arg)) ) {
1676: nm = 0; dn = (P)ONE;
1677: } else {
1678: b = BDY((LIST)ARG0(arg));
1679: ps = (DP *)BDY((VECT)ARG2(arg));
1680: hps = (DP *)BDY((VECT)ARG3(arg));
1.2 noro 1681: mod = ZTOS((Q)ARG4(arg));
1.1 noro 1682: NEWVECT(quo); quo->len = ((VECT)ARG2(arg))->len;
1683: quo->body = (pointer *)dp_true_nf_and_quotient_marked_mod(b,g,ps,hps,mod,&nm,&dn);
1684: }
1685: n = mknode(3,nm,dn,quo);
1686: MKLIST(*rp,n);
1687: }
1688:
1689: void Pdp_weyl_true_nf_and_quotient_mod(NODE arg,LIST *rp)
1690: {
1691: NODE narg = mknode(5,ARG0(arg),ARG1(arg),ARG2(arg),ARG2(arg),ARG3(arg));
1692: Pdp_weyl_true_nf_and_quotient_marked_mod(narg,rp);
1693: }
1694:
1695:
1696: void Pdp_tdiv(NODE arg,DP *rp)
1697: {
1698: MP m,mr,mr0;
1699: DP p;
1700: Z d,q,r;
1701: int sgn;
1702:
1703: asir_assert(ARG0(arg),O_DP,"dp_tdiv");
1704: asir_assert(ARG1(arg),O_N,"dp_tdiv");
1705: p = (DP)ARG0(arg); d = (Z)ARG1(arg);
1706: if ( !p )
1707: *rp = 0;
1708: else {
1709: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
1710: divqrz((Z)m->c,d,&q,&r);
1711: if ( r ) {
1712: *rp = 0; return;
1713: } else {
1714: NEXTMP(mr0,mr);
1715: mr->c = (Obj)q; mr->dl = m->dl;
1716: }
1717: }
1718: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
1719: }
1720: }
1721:
1722: void Pdp_red_coef(NODE arg,DP *rp)
1723: {
1724: MP m,mr,mr0;
1725: P q,r;
1726: DP p;
1727: P mod;
1728:
1729: p = (DP)ARG0(arg); mod = (P)ARG1(arg);
1730: asir_assert(p,O_DP,"dp_red_coef");
1731: asir_assert(mod,O_P,"dp_red_coef");
1732: if ( !p )
1733: *rp = 0;
1734: else {
1735: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
1736: divsrp(CO,(P)m->c,mod,&q,&r);
1737: if ( r ) {
1738: NEXTMP(mr0,mr); mr->c = (Obj)r; mr->dl = m->dl;
1739: }
1740: }
1741: if ( mr0 ) {
1742: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
1743: } else
1744: *rp = 0;
1745: }
1746: }
1747:
1748: void Pdp_redble(NODE arg,Z *rp)
1749: {
1750: asir_assert(ARG0(arg),O_DP,"dp_redble");
1751: asir_assert(ARG1(arg),O_DP,"dp_redble");
1752: if ( dp_redble((DP)ARG0(arg),(DP)ARG1(arg)) )
1753: *rp = ONE;
1754: else
1755: *rp = 0;
1756: }
1757:
1758: void Pdp_red_mod(NODE arg,LIST *rp)
1759: {
1760: DP h,r;
1761: P dmy;
1762: NODE n;
1763:
1764: do_weyl = 0;
1765: asir_assert(ARG0(arg),O_DP,"dp_red_mod");
1766: asir_assert(ARG1(arg),O_DP,"dp_red_mod");
1767: asir_assert(ARG2(arg),O_DP,"dp_red_mod");
1768: asir_assert(ARG3(arg),O_N,"dp_red_mod");
1.2 noro 1769: dp_red_mod((DP)ARG0(arg),(DP)ARG1(arg),(DP)ARG2(arg),ZTOS((Q)ARG3(arg)),
1.1 noro 1770: &h,&r,&dmy);
1771: NEWNODE(n); BDY(n) = (pointer)h;
1772: NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)r;
1773: NEXT(NEXT(n)) = 0; MKLIST(*rp,n);
1774: }
1775:
1776: void Pdp_subd(NODE arg,DP *rp)
1777: {
1778: DP p1,p2;
1779:
1780: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1781: asir_assert(p1,O_DP,"dp_subd");
1782: asir_assert(p2,O_DP,"dp_subd");
1783: dp_subd(p1,p2,rp);
1784: }
1785:
1786: void Pdp_symb_add(NODE arg,DP *rp)
1787: {
1788: DP p1,p2,r;
1789: NODE s0;
1790: MP mp0,mp;
1791: int nv;
1792:
1793: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1794: asir_assert(p1,O_DP,"dp_symb_add");
1795: asir_assert(p2,O_DP,"dp_symb_add");
1796: if ( !p1 ) { *rp = p2; return; }
1797: else if ( !p2 ) { *rp = p1; return; }
1798: if ( p1->nv != p2->nv )
1799: error("dp_sumb_add : invalid input");
1800: nv = p1->nv;
1801: s0 = symb_merge(dp_dllist(p1),dp_dllist(p2),nv);
1802: for ( mp0 = 0; s0; s0 = NEXT(s0) ) {
1803: NEXTMP(mp0,mp); mp->dl = (DL)BDY(s0); mp->c = (Obj)ONE;
1804: }
1805: NEXT(mp) = 0;
1806: MKDP(nv,mp0,r); r->sugar = MAX(p1->sugar,p2->sugar);
1807: *rp = r;
1808: }
1809:
1810: void Pdp_mul_trunc(NODE arg,DP *rp)
1811: {
1812: DP p1,p2,p;
1813:
1814: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); p = (DP)ARG2(arg);
1815: asir_assert(p1,O_DP,"dp_mul_trunc");
1816: asir_assert(p2,O_DP,"dp_mul_trunc");
1817: asir_assert(p,O_DP,"dp_mul_trunc");
1818: comm_muld_trunc(CO,p1,p2,BDY(p)->dl,rp);
1819: }
1820:
1821: void Pdp_quo(NODE arg,DP *rp)
1822: {
1823: DP p1,p2;
1824:
1825: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1826: asir_assert(p1,O_DP,"dp_quo");
1827: asir_assert(p2,O_DP,"dp_quo");
1828: comm_quod(CO,p1,p2,rp);
1829: }
1830:
1831: void Pdp_weyl_mul(NODE arg,DP *rp)
1832: {
1833: DP p1,p2;
1834:
1835: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1836: asir_assert(p1,O_DP,"dp_weyl_mul"); asir_assert(p2,O_DP,"dp_weyl_mul");
1837: do_weyl = 1;
1838: muld(CO,p1,p2,rp);
1839: do_weyl = 0;
1840: }
1841:
1842: void Pdp_weyl_act(NODE arg,DP *rp)
1843: {
1844: DP p1,p2;
1845:
1846: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1847: asir_assert(p1,O_DP,"dp_weyl_act"); asir_assert(p2,O_DP,"dp_weyl_act");
1848: weyl_actd(CO,p1,p2,rp);
1849: }
1850:
1851:
1852: void Pdp_weyl_mul_mod(NODE arg,DP *rp)
1853: {
1854: DP p1,p2;
1855: Q m;
1856:
1857: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); m = (Q)ARG2(arg);
1858: asir_assert(p1,O_DP,"dp_weyl_mul_mod");
1859: asir_assert(p2,O_DP,"dp_mul_mod");
1860: asir_assert(m,O_N,"dp_mul_mod");
1861: do_weyl = 1;
1.2 noro 1862: mulmd(CO,ZTOS(m),p1,p2,rp);
1.1 noro 1863: do_weyl = 0;
1864: }
1865:
1866: void Pdp_red(NODE arg,LIST *rp)
1867: {
1868: NODE n;
1869: DP head,rest,dmy1;
1870: P dmy;
1871:
1872: do_weyl = 0;
1873: asir_assert(ARG0(arg),O_DP,"dp_red");
1874: asir_assert(ARG1(arg),O_DP,"dp_red");
1875: asir_assert(ARG2(arg),O_DP,"dp_red");
1876: dp_red((DP)ARG0(arg),(DP)ARG1(arg),(DP)ARG2(arg),&head,&rest,&dmy,&dmy1);
1877: NEWNODE(n); BDY(n) = (pointer)head;
1878: NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)rest;
1879: NEXT(NEXT(n)) = 0; MKLIST(*rp,n);
1880: }
1881:
1882: void Pdp_weyl_red(NODE arg,LIST *rp)
1883: {
1884: NODE n;
1885: DP head,rest,dmy1;
1886: P dmy;
1887:
1888: asir_assert(ARG0(arg),O_DP,"dp_weyl_red");
1889: asir_assert(ARG1(arg),O_DP,"dp_weyl_red");
1890: asir_assert(ARG2(arg),O_DP,"dp_weyl_red");
1891: do_weyl = 1;
1892: dp_red((DP)ARG0(arg),(DP)ARG1(arg),(DP)ARG2(arg),&head,&rest,&dmy,&dmy1);
1893: do_weyl = 0;
1894: NEWNODE(n); BDY(n) = (pointer)head;
1895: NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)rest;
1896: NEXT(NEXT(n)) = 0; MKLIST(*rp,n);
1897: }
1898:
1899: void Pdp_sp(NODE arg,DP *rp)
1900: {
1901: DP p1,p2;
1902:
1903: do_weyl = 0;
1904: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1905: asir_assert(p1,O_DP,"dp_sp"); asir_assert(p2,O_DP,"dp_sp");
1906: dp_sp(p1,p2,rp);
1907: }
1908:
1909: void Pdp_weyl_sp(NODE arg,DP *rp)
1910: {
1911: DP p1,p2;
1912:
1913: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1914: asir_assert(p1,O_DP,"dp_weyl_sp"); asir_assert(p2,O_DP,"dp_weyl_sp");
1915: do_weyl = 1;
1916: dp_sp(p1,p2,rp);
1917: do_weyl = 0;
1918: }
1919:
1920: void Pdpm_sp(NODE arg,DPM *rp)
1921: {
1922: DPM p1,p2;
1923:
1924: do_weyl = 0;
1925: p1 = (DPM)ARG0(arg); p2 = (DPM)ARG1(arg);
1926: asir_assert(p1,O_DPM,"dpm_sp"); asir_assert(p2,O_DPM,"dpm_sp");
1927: dpm_sp(p1,p2,rp);
1928: }
1929:
1930: void Pdpm_weyl_sp(NODE arg,DPM *rp)
1931: {
1932: DPM p1,p2;
1933:
1934: p1 = (DPM)ARG0(arg); p2 = (DPM)ARG1(arg);
1935: asir_assert(p1,O_DPM,"dpm_weyl_sp"); asir_assert(p2,O_DPM,"dpm_weyl_sp");
1936: do_weyl = 1;
1937: dpm_sp(p1,p2,rp);
1938: do_weyl = 0;
1939: }
1940:
1941: void Pdp_sp_mod(NODE arg,DP *rp)
1942: {
1943: DP p1,p2;
1944: int mod;
1945:
1946: do_weyl = 0;
1947: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1948: asir_assert(p1,O_DP,"dp_sp_mod"); asir_assert(p2,O_DP,"dp_sp_mod");
1949: asir_assert(ARG2(arg),O_N,"dp_sp_mod");
1.2 noro 1950: mod = ZTOS((Q)ARG2(arg));
1.1 noro 1951: dp_sp_mod(p1,p2,mod,rp);
1952: }
1953:
1954: void Pdp_lcm(NODE arg,DP *rp)
1955: {
1956: int i,n,td;
1957: DL d1,d2,d;
1958: MP m;
1959: DP p1,p2;
1960:
1961: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1962: asir_assert(p1,O_DP,"dp_lcm"); asir_assert(p2,O_DP,"dp_lcm");
1963: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
1964: NEWDL(d,n);
1965: for ( i = 0, td = 0; i < n; i++ ) {
1966: d->d[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(d->d[i],i);
1967: }
1968: d->td = td;
1969: NEWMP(m); m->dl = d; m->c = (Obj)ONE; NEXT(m) = 0;
1970: MKDP(n,m,*rp); (*rp)->sugar = td; /* XXX */
1971: }
1972:
1973: void Pdp_hm(NODE arg,DP *rp)
1974: {
1975: DP p;
1976:
1977: p = (DP)ARG0(arg); asir_assert(p,O_DP,"dp_hm");
1978: dp_hm(p,rp);
1979: }
1980:
1981: void Pdp_ht(NODE arg,DP *rp)
1982: {
1983: DP p;
1984: MP m,mr;
1985:
1986: p = (DP)ARG0(arg); asir_assert(p,O_DP,"dp_ht");
1987: dp_ht(p,rp);
1988: }
1989:
1990: void Pdp_hc(NODE arg,Obj *rp)
1991: {
1992: asir_assert(ARG0(arg),O_DP,"dp_hc");
1993: if ( !ARG0(arg) )
1994: *rp = 0;
1995: else
1996: *rp = BDY((DP)ARG0(arg))->c;
1997: }
1998:
1999: void Pdp_rest(NODE arg,DP *rp)
2000: {
2001: asir_assert(ARG0(arg),O_DP,"dp_rest");
2002: if ( !ARG0(arg) )
2003: *rp = 0;
2004: else
2005: dp_rest((DP)ARG0(arg),rp);
2006: }
2007:
2008: void Pdp_td(NODE arg,Z *rp)
2009: {
2010: DP p;
2011:
2012: p = (DP)ARG0(arg); asir_assert(p,O_DP,"dp_td");
2013: if ( !p )
2014: *rp = 0;
2015: else
1.2 noro 2016: STOZ(BDY(p)->dl->td,*rp);
1.1 noro 2017: }
2018:
2019: void Pdp_sugar(NODE arg,Z *rp)
2020: {
2021: DP p;
2022:
2023: p = (DP)ARG0(arg); asir_assert(p,O_DP,"dp_sugar");
2024: if ( !p )
2025: *rp = 0;
2026: else
1.2 noro 2027: STOZ(p->sugar,*rp);
1.1 noro 2028: }
2029:
2030: void Pdp_initial_term(NODE arg,Obj *rp)
2031: {
2032: struct order_spec *ord;
2033: Num homo;
2034: int modular,is_list;
2035: LIST v,f,l,initiallist;
2036: NODE n;
2037:
2038: f = (LIST)ARG0(arg);
2039: if ( f && OID(f) == O_LIST )
2040: is_list = 1;
2041: else {
2042: n = mknode(1,f); MKLIST(l,n); f = l;
2043: is_list = 0;
2044: }
2045: if ( current_option ) {
2046: parse_gr_option(f,current_option,&v,&homo,&modular,&ord);
2047: initd(ord);
2048: } else
2049: ord = dp_current_spec;
2050: initiallist = dp_initial_term(f,ord);
2051: if ( !is_list )
2052: *rp = (Obj)BDY(BDY(initiallist));
2053: else
2054: *rp = (Obj)initiallist;
2055: }
2056:
2057: void Pdp_order(NODE arg,Obj *rp)
2058: {
2059: struct order_spec *ord;
2060: Num homo;
2061: int modular,is_list;
2062: LIST v,f,l,ordlist;
2063: NODE n;
2064:
2065: f = (LIST)ARG0(arg);
2066: if ( f && OID(f) == O_LIST )
2067: is_list = 1;
2068: else {
2069: n = mknode(1,f); MKLIST(l,n); f = l;
2070: is_list = 0;
2071: }
2072: if ( current_option ) {
2073: parse_gr_option(f,current_option,&v,&homo,&modular,&ord);
2074: initd(ord);
2075: } else
2076: ord = dp_current_spec;
2077: ordlist = dp_order(f,ord);
2078: if ( !is_list )
2079: *rp = (Obj)BDY(BDY(ordlist));
2080: else
2081: *rp = (Obj)ordlist;
2082: }
2083:
2084: void Pdp_set_sugar(NODE arg,Q *rp)
2085: {
2086: DP p;
2087: Q q;
2088: int i;
2089:
2090: p = (DP)ARG0(arg);
2091: q = (Q)ARG1(arg);
2092: if ( p && q) {
2093: asir_assert(p,O_DP,"dp_set_sugar");
2094: asir_assert(q,O_N, "dp_set_sugar");
1.2 noro 2095: i = ZTOS(q);
1.1 noro 2096: if (p->sugar < i) {
2097: p->sugar = i;
2098: }
2099: }
2100: *rp = 0;
2101: }
2102:
2103: void Pdp_cri1(NODE arg,Z *rp)
2104: {
2105: DP p1,p2;
2106: int *d1,*d2;
2107: int i,n;
2108:
2109: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
2110: asir_assert(p1,O_DP,"dp_cri1"); asir_assert(p2,O_DP,"dp_cri1");
2111: n = p1->nv; d1 = BDY(p1)->dl->d; d2 = BDY(p2)->dl->d;
2112: for ( i = 0; i < n; i++ )
2113: if ( d1[i] > d2[i] )
2114: break;
2115: *rp = i == n ? ONE : 0;
2116: }
2117:
2118: void Pdp_cri2(NODE arg,Z *rp)
2119: {
2120: DP p1,p2;
2121: int *d1,*d2;
2122: int i,n;
2123:
2124: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
2125: asir_assert(p1,O_DP,"dp_cri2"); asir_assert(p2,O_DP,"dp_cri2");
2126: n = p1->nv; d1 = BDY(p1)->dl->d; d2 = BDY(p2)->dl->d;
2127: for ( i = 0; i < n; i++ )
2128: if ( MIN(d1[i],d2[i]) >= 1 )
2129: break;
2130: *rp = i == n ? ONE : 0;
2131: }
2132:
2133: void Pdp_minp(NODE arg,LIST *rp)
2134: {
2135: NODE tn,tn1,d,dd,dd0,p,tp;
2136: LIST l,minp;
2137: DP lcm,tlcm;
2138: int s,ts;
2139:
2140: asir_assert(ARG0(arg),O_LIST,"dp_minp");
2141: d = BDY((LIST)ARG0(arg)); minp = (LIST)BDY(d);
2142: p = BDY(minp); p = NEXT(NEXT(p)); lcm = (DP)BDY(p); p = NEXT(p);
2143: if ( !ARG1(arg) ) {
1.2 noro 2144: s = ZTOS((Q)BDY(p)); p = NEXT(p);
1.1 noro 2145: for ( dd0 = 0, d = NEXT(d); d; d = NEXT(d) ) {
2146: tp = BDY((LIST)BDY(d)); tp = NEXT(NEXT(tp));
2147: tlcm = (DP)BDY(tp); tp = NEXT(tp);
1.2 noro 2148: ts = ZTOS((Q)BDY(tp)); tp = NEXT(tp);
1.1 noro 2149: NEXTNODE(dd0,dd);
2150: if ( ts < s ) {
2151: BDY(dd) = (pointer)minp;
2152: minp = (LIST)BDY(d); lcm = tlcm; s = ts;
2153: } else if ( ts == s ) {
2154: if ( compd(CO,lcm,tlcm) > 0 ) {
2155: BDY(dd) = (pointer)minp;
2156: minp = (LIST)BDY(d); lcm = tlcm; s = ts;
2157: } else
2158: BDY(dd) = BDY(d);
2159: } else
2160: BDY(dd) = BDY(d);
2161: }
2162: } else {
2163: for ( dd0 = 0, d = NEXT(d); d; d = NEXT(d) ) {
2164: tp = BDY((LIST)BDY(d)); tp = NEXT(NEXT(tp));
2165: tlcm = (DP)BDY(tp);
2166: NEXTNODE(dd0,dd);
2167: if ( compd(CO,lcm,tlcm) > 0 ) {
2168: BDY(dd) = (pointer)minp; minp = (LIST)BDY(d); lcm = tlcm;
2169: } else
2170: BDY(dd) = BDY(d);
2171: }
2172: }
2173: if ( dd0 )
2174: NEXT(dd) = 0;
2175: MKLIST(l,dd0); MKNODE(tn,l,0); MKNODE(tn1,minp,tn); MKLIST(*rp,tn1);
2176: }
2177:
2178: void Pdp_criB(NODE arg,LIST *rp)
2179: {
2180: NODE d,ij,dd,ddd;
2181: int i,j,s,n;
2182: DP *ps;
2183: DL ts,ti,tj,lij,tdl;
2184:
2185: asir_assert(ARG0(arg),O_LIST,"dp_criB"); d = BDY((LIST)ARG0(arg));
1.2 noro 2186: asir_assert(ARG1(arg),O_N,"dp_criB"); s = ZTOS((Q)ARG1(arg));
1.1 noro 2187: asir_assert(ARG2(arg),O_VECT,"dp_criB"); ps = (DP *)BDY((VECT)ARG2(arg));
2188: if ( !d )
2189: *rp = (LIST)ARG0(arg);
2190: else {
2191: ts = BDY(ps[s])->dl;
2192: n = ps[s]->nv;
2193: NEWDL(tdl,n);
2194: for ( dd = 0; d; d = NEXT(d) ) {
2195: ij = BDY((LIST)BDY(d));
1.2 noro 2196: i = ZTOS((Q)BDY(ij)); ij = NEXT(ij);
2197: j = ZTOS((Q)BDY(ij)); ij = NEXT(ij);
1.1 noro 2198: lij = BDY((DP)BDY(ij))->dl;
2199: ti = BDY(ps[i])->dl; tj = BDY(ps[j])->dl;
2200: if ( lij->td != lcm_of_DL(n,lij,ts,tdl)->td
2201: || !dl_equal(n,lij,tdl)
2202: || (lij->td == lcm_of_DL(n,ti,ts,tdl)->td
2203: && dl_equal(n,tdl,lij))
2204: || (lij->td == lcm_of_DL(n,tj,ts,tdl)->td
2205: && dl_equal(n,tdl,lij)) ) {
2206: MKNODE(ddd,BDY(d),dd);
2207: dd = ddd;
2208: }
2209: }
2210: MKLIST(*rp,dd);
2211: }
2212: }
2213:
2214: void Pdp_nelim(NODE arg,Z *rp)
2215: {
2216: if ( arg ) {
2217: asir_assert(ARG0(arg),O_N,"dp_nelim");
1.2 noro 2218: dp_nelim = ZTOS((Q)ARG0(arg));
1.1 noro 2219: }
1.2 noro 2220: STOZ(dp_nelim,*rp);
1.1 noro 2221: }
2222:
2223: void Pdp_mag(NODE arg,Z *rp)
2224: {
2225: DP p;
2226: int s;
2227: MP m;
2228:
2229: p = (DP)ARG0(arg);
2230: asir_assert(p,O_DP,"dp_mag");
2231: if ( !p )
2232: *rp = 0;
2233: else {
2234: for ( s = 0, m = BDY(p); m; m = NEXT(m) )
2235: s += p_mag((P)m->c);
1.2 noro 2236: STOZ(s,*rp);
1.1 noro 2237: }
2238: }
2239:
2240: /* kara_mag is no longer used. */
2241:
2242: void Pdp_set_kara(NODE arg,Z *rp)
2243: {
2244: *rp = 0;
2245: }
2246:
2247: void Pdp_homo(NODE arg,DP *rp)
2248: {
2249: asir_assert(ARG0(arg),O_DP,"dp_homo");
2250: dp_homo((DP)ARG0(arg),rp);
2251: }
2252:
2253: void Pdp_dehomo(NODE arg,DP *rp)
2254: {
2255: asir_assert(ARG0(arg),O_DP,"dp_dehomo");
2256: dp_dehomo((DP)ARG0(arg),rp);
2257: }
2258:
2259: void Pdp_gr_flags(NODE arg,LIST *rp)
2260: {
2261: Obj name,value;
2262: NODE n;
2263:
2264: if ( arg ) {
2265: asir_assert(ARG0(arg),O_LIST,"dp_gr_flags");
2266: n = BDY((LIST)ARG0(arg));
2267: while ( n ) {
2268: name = (Obj)BDY(n); n = NEXT(n);
2269: if ( !n )
2270: break;
2271: else {
2272: value = (Obj)BDY(n); n = NEXT(n);
2273: }
2274: dp_set_flag(name,value);
2275: }
2276: }
2277: dp_make_flaglist(rp);
2278: }
2279:
2280: extern int DP_Print, DP_PrintShort;
2281:
2282: void Pdp_gr_print(NODE arg,Z *rp)
2283: {
2284: Z q;
2285: int s;
2286:
2287: if ( arg ) {
2288: asir_assert(ARG0(arg),O_N,"dp_gr_print");
2289: q = (Z)ARG0(arg);
1.2 noro 2290: s = ZTOS(q);
1.1 noro 2291: switch ( s ) {
2292: case 0:
2293: DP_Print = 0; DP_PrintShort = 0;
2294: break;
2295: case 1:
2296: DP_Print = 1;
2297: break;
2298: case 2:
2299: DP_Print = 0; DP_PrintShort = 1;
2300: break;
2301: default:
2302: DP_Print = s; DP_PrintShort = 0;
2303: break;
2304: }
2305: } else {
2306: if ( DP_Print ) {
1.2 noro 2307: STOZ(1,q);
1.1 noro 2308: } else if ( DP_PrintShort ) {
1.2 noro 2309: STOZ(2,q);
1.1 noro 2310: } else
2311: q = 0;
2312: }
2313: *rp = q;
2314: }
2315:
2316: void parse_gr_option(LIST f,NODE opt,LIST *v,Num *homo,
2317: int *modular,struct order_spec **ord)
2318: {
2319: NODE t,p;
2320: Z m,z;
2321: char *key;
2322: Obj value,dmy;
2323: int ord_is_set = 0;
2324: int modular_is_set = 0;
2325: int homo_is_set = 0;
2326: VL vl,vl0;
2327: LIST vars;
2328: char xiname[BUFSIZ];
2329: NODE x0,x;
2330: DP d;
2331: P xi;
2332: int nv,i;
2333:
2334: /* extract vars */
2335: vars = 0;
2336: for ( t = opt; t; t = NEXT(t) ) {
2337: p = BDY((LIST)BDY(t));
2338: key = BDY((STRING)BDY(p));
2339: value = (Obj)BDY(NEXT(p));
2340: if ( !strcmp(key,"v") ) {
2341: /* variable list */
2342: vars = (LIST)value;
2343: break;
2344: }
2345: }
2346: if ( vars ) {
2347: *v = vars; pltovl(vars,&vl);
2348: } else {
2349: for ( t = BDY(f); t; t = NEXT(t) )
2350: if ( BDY(t) && OID((Obj)BDY(t))==O_DP )
2351: break;
2352: if ( t ) {
2353: /* f is DP list */
2354: /* create dummy var list */
2355: d = (DP)BDY(t);
2356: nv = NV(d);
2357: for ( i = 0, vl0 = 0, x0 = 0; i < nv; i++ ) {
2358: NEXTVL(vl0,vl);
2359: NEXTNODE(x0,x);
2360: sprintf(xiname,"x%d",i);
2361: makevar(xiname,&xi);
2362: x->body = (pointer)xi;
2363: vl->v = VR((P)xi);
2364: }
2365: if ( vl0 ) {
2366: NEXT(vl) = 0;
2367: NEXT(x) = 0;
2368: }
2369: MKLIST(vars,x0);
2370: *v = vars;
2371: vl = vl0;
2372: } else {
2373: get_vars((Obj)f,&vl); vltopl(vl,v);
2374: }
2375: }
2376:
2377: for ( t = opt; t; t = NEXT(t) ) {
2378: p = BDY((LIST)BDY(t));
2379: key = BDY((STRING)BDY(p));
2380: value = (Obj)BDY(NEXT(p));
2381: if ( !strcmp(key,"v") ) {
2382: /* variable list; ignore */
2383: } else if ( !strcmp(key,"order") ) {
2384: /* order spec */
2385: if ( !vl )
2386: error("parse_gr_option : variables must be specified");
2387: create_order_spec(vl,value,ord);
2388: ord_is_set = 1;
2389: } else if ( !strcmp(key,"block") ) {
2390: create_order_spec(0,value,ord);
2391: ord_is_set = 1;
2392: } else if ( !strcmp(key,"matrix") ) {
2393: create_order_spec(0,value,ord);
2394: ord_is_set = 1;
2395: } else if ( !strcmp(key,"sugarweight") ) {
2396: /* weight */
2397: Pdp_set_weight(NEXT(p),&dmy);
2398: } else if ( !strcmp(key,"homo") ) {
2399: *homo = (Num)value;
2400: homo_is_set = 1;
2401: } else if ( !strcmp(key,"trace") ) {
2402: m = (Z)value;
1.2 noro 2403: STOZ(0x80000000,z);
1.1 noro 2404: if ( !m )
2405: *modular = 0;
2406: else if ( cmpz(m,z) >= 0 )
2407: error("parse_gr_option : too large modulus");
2408: else
1.2 noro 2409: *modular = ZTOS(m);
1.1 noro 2410: modular_is_set = 1;
2411: } else if ( !strcmp(key,"dp") ) {
2412: /* XXX : ignore */
2413: } else
2414: error("parse_gr_option : not implemented");
2415: }
2416: if ( !ord_is_set ) create_order_spec(0,0,ord);
2417: if ( !modular_is_set ) *modular = 0;
2418: if ( !homo_is_set ) *homo = 0;
2419: }
2420:
2421: void Pdp_gr_main(NODE arg,LIST *rp)
2422: {
2423: LIST f,v;
2424: VL vl;
2425: Num homo;
2426: Z m,z;
2427: int modular,ac;
2428: struct order_spec *ord;
2429:
2430: do_weyl = 0;
2431: asir_assert(ARG0(arg),O_LIST,"dp_gr_main");
2432: f = (LIST)ARG0(arg);
2433: f = remove_zero_from_list(f);
2434: if ( !BDY(f) ) {
2435: *rp = f; return;
2436: }
2437: if ( (ac = argc(arg)) == 5 ) {
2438: asir_assert(ARG1(arg),O_LIST,"dp_gr_main");
2439: asir_assert(ARG2(arg),O_N,"dp_gr_main");
2440: asir_assert(ARG3(arg),O_N,"dp_gr_main");
2441: v = (LIST)ARG1(arg);
2442: homo = (Num)ARG2(arg);
2443: m = (Z)ARG3(arg);
1.2 noro 2444: STOZ(0x80000000,z);
1.1 noro 2445: if ( !m )
2446: modular = 0;
2447: else if ( cmpz(m,z) >= 0 )
2448: error("dp_gr_main : too large modulus");
2449: else
1.2 noro 2450: modular = ZTOS(m);
1.1 noro 2451: create_order_spec(0,ARG4(arg),&ord);
2452: } else if ( current_option )
2453: parse_gr_option(f,current_option,&v,&homo,&modular,&ord);
2454: else if ( ac == 1 )
2455: parse_gr_option(f,0,&v,&homo,&modular,&ord);
2456: else
2457: error("dp_gr_main : invalid argument");
2458: dp_gr_main(f,v,homo,modular,0,ord,rp);
2459: }
2460:
2461: void Pdp_interreduce(NODE arg,LIST *rp)
2462: {
2463: LIST f,v;
2464: VL vl;
2465: int ac;
2466: struct order_spec *ord;
2467:
2468: do_weyl = 0;
2469: asir_assert(ARG0(arg),O_LIST,"dp_interreduce");
2470: f = (LIST)ARG0(arg);
2471: f = remove_zero_from_list(f);
2472: if ( !BDY(f) ) {
2473: *rp = f; return;
2474: }
2475: if ( (ac = argc(arg)) == 3 ) {
2476: asir_assert(ARG1(arg),O_LIST,"dp_interreduce");
2477: v = (LIST)ARG1(arg);
2478: create_order_spec(0,ARG2(arg),&ord);
2479: }
2480: dp_interreduce(f,v,0,ord,rp);
2481: }
2482:
2483: void Pdp_gr_f_main(NODE arg,LIST *rp)
2484: {
2485: LIST f,v;
2486: Num homo;
2487: int m,field,t;
2488: struct order_spec *ord;
2489: NODE n;
2490:
2491: do_weyl = 0;
2492: asir_assert(ARG0(arg),O_LIST,"dp_gr_f_main");
2493: asir_assert(ARG1(arg),O_LIST,"dp_gr_f_main");
2494: asir_assert(ARG2(arg),O_N,"dp_gr_f_main");
2495: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2496: f = remove_zero_from_list(f);
2497: if ( !BDY(f) ) {
2498: *rp = f; return;
2499: }
2500: homo = (Num)ARG2(arg);
2501: #if 0
2502: asir_assert(ARG3(arg),O_N,"dp_gr_f_main");
1.2 noro 2503: m = ZTOS((Q)ARG3(arg));
1.1 noro 2504: if ( m )
2505: error("dp_gr_f_main : trace lifting is not implemented yet");
2506: create_order_spec(0,ARG4(arg),&ord);
2507: #else
2508: m = 0;
2509: create_order_spec(0,ARG3(arg),&ord);
2510: #endif
2511: field = 0;
2512: for ( n = BDY(f); n; n = NEXT(n) ) {
2513: t = get_field_type(BDY(n));
2514: if ( !t )
2515: continue;
2516: if ( t < 0 )
2517: error("dp_gr_f_main : incosistent coefficients");
2518: if ( !field )
2519: field = t;
2520: else if ( t != field )
2521: error("dp_gr_f_main : incosistent coefficients");
2522: }
2523: dp_gr_main(f,v,homo,m?1:0,field,ord,rp);
2524: }
2525:
2526: void Pdp_f4_main(NODE arg,LIST *rp)
2527: {
2528: LIST f,v;
2529: struct order_spec *ord;
2530:
2531: do_weyl = 0;
2532: asir_assert(ARG0(arg),O_LIST,"dp_f4_main");
2533: asir_assert(ARG1(arg),O_LIST,"dp_f4_main");
2534: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2535: f = remove_zero_from_list(f);
2536: if ( !BDY(f) ) {
2537: *rp = f; return;
2538: }
2539: create_order_spec(0,ARG2(arg),&ord);
2540: dp_f4_main(f,v,ord,rp);
2541: }
2542:
2543: /* dp_gr_checklist(list of dp) */
2544:
2545: void Pdp_gr_checklist(NODE arg,LIST *rp)
2546: {
2547: VECT g;
2548: LIST dp;
2549: NODE r;
2550: int n;
2551:
2552: do_weyl = 0;
2553: asir_assert(ARG0(arg),O_LIST,"dp_gr_checklist");
2554: asir_assert(ARG1(arg),O_N,"dp_gr_checklist");
1.2 noro 2555: n = ZTOS((Q)ARG1(arg));
1.1 noro 2556: gbcheck_list(BDY((LIST)ARG0(arg)),n,&g,&dp);
2557: r = mknode(2,g,dp);
2558: MKLIST(*rp,r);
2559: }
2560:
2561: void Pdp_f4_mod_main(NODE arg,LIST *rp)
2562: {
2563: LIST f,v;
2564: int m;
2565: struct order_spec *ord;
2566:
2567: do_weyl = 0;
2568: asir_assert(ARG0(arg),O_LIST,"dp_f4_mod_main");
2569: asir_assert(ARG1(arg),O_LIST,"dp_f4_mod_main");
2570: asir_assert(ARG2(arg),O_N,"dp_f4_mod_main");
1.2 noro 2571: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); m = ZTOS((Q)ARG2(arg));
1.1 noro 2572: f = remove_zero_from_list(f);
2573: if ( !BDY(f) ) {
2574: *rp = f; return;
2575: }
2576: if ( !m )
2577: error("dp_f4_mod_main : invalid argument");
2578: create_order_spec(0,ARG3(arg),&ord);
2579: dp_f4_mod_main(f,v,m,ord,rp);
2580: }
2581:
2582: void Pdp_gr_mod_main(NODE arg,LIST *rp)
2583: {
2584: LIST f,v;
2585: Num homo;
2586: int m;
2587: struct order_spec *ord;
2588:
2589: do_weyl = 0;
2590: asir_assert(ARG0(arg),O_LIST,"dp_gr_mod_main");
2591: asir_assert(ARG1(arg),O_LIST,"dp_gr_mod_main");
2592: asir_assert(ARG2(arg),O_N,"dp_gr_mod_main");
2593: asir_assert(ARG3(arg),O_N,"dp_gr_mod_main");
2594: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2595: f = remove_zero_from_list(f);
2596: if ( !BDY(f) ) {
2597: *rp = f; return;
2598: }
1.2 noro 2599: homo = (Num)ARG2(arg); m = ZTOS((Q)ARG3(arg));
1.1 noro 2600: if ( !m )
2601: error("dp_gr_mod_main : invalid argument");
2602: create_order_spec(0,ARG4(arg),&ord);
2603: dp_gr_mod_main(f,v,homo,m,ord,rp);
2604: }
2605:
2606: void Psetmod_ff(NODE node, Obj *val);
2607:
2608: void Pnd_f4(NODE arg,LIST *rp)
2609: {
2610: LIST f,v;
2611: int m,homo,retdp,ac;
2612: Obj val;
2613: Z mq,z;
2614: Num nhomo;
2615: NODE node;
2616: struct order_spec *ord;
2617:
2618: do_weyl = 0;
2619: nd_rref2 = 0;
2620: retdp = 0;
2621: if ( (ac = argc(arg)) == 4 ) {
2622: asir_assert(ARG0(arg),O_LIST,"nd_f4");
2623: asir_assert(ARG1(arg),O_LIST,"nd_f4");
2624: asir_assert(ARG2(arg),O_N,"nd_f4");
2625: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2626: f = remove_zero_from_list(f);
2627: if ( !BDY(f) ) {
2628: *rp = f; return;
2629: }
2630: mq = (Z)ARG2(arg);
1.2 noro 2631: STOZ((unsigned long)0x40000000,z);
1.1 noro 2632: if ( cmpz(mq,z) >= 0 ) {
2633: node = mknode(1,mq);
2634: Psetmod_ff(node,&val);
2635: m = -2;
2636: } else
1.2 noro 2637: m = ZTOS(mq);
1.1 noro 2638: create_order_spec(0,ARG3(arg),&ord);
2639: homo = 0;
2640: if ( get_opt("homo",&val) && val ) homo = 1;
2641: if ( get_opt("dp",&val) && val ) retdp = 1;
2642: if ( get_opt("rref2",&val) && val ) nd_rref2 = 1;
2643: } else if ( ac == 1 ) {
2644: f = (LIST)ARG0(arg);
2645: parse_gr_option(f,current_option,&v,&nhomo,&m,&ord);
1.2 noro 2646: homo = ZTOS((Q)nhomo);
1.1 noro 2647: if ( get_opt("dp",&val) && val ) retdp = 1;
2648: if ( get_opt("rref2",&val) && val ) nd_rref2 = 1;
2649: } else
2650: error("nd_f4 : invalid argument");
2651: nd_gr(f,v,m,homo,retdp,1,ord,rp);
2652: }
2653:
2654: void Pnd_gr(NODE arg,LIST *rp)
2655: {
2656: LIST f,v;
2657: int m,homo,retdp,ac;
2658: Obj val;
2659: Z mq,z;
2660: Num nhomo;
2661: NODE node;
2662: struct order_spec *ord;
2663:
2664: do_weyl = 0;
2665: retdp = 0;
2666: if ( (ac=argc(arg)) == 4 ) {
2667: asir_assert(ARG0(arg),O_LIST,"nd_gr");
2668: asir_assert(ARG1(arg),O_LIST,"nd_gr");
2669: asir_assert(ARG2(arg),O_N,"nd_gr");
2670: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2671: f = remove_zero_from_list(f);
2672: if ( !BDY(f) ) {
2673: *rp = f; return;
2674: }
2675: mq = (Z)ARG2(arg);
1.2 noro 2676: STOZ(0x40000000,z);
1.1 noro 2677: if ( cmpz(mq,z) >= 0 ) {
2678: node = mknode(1,mq);
2679: Psetmod_ff(node,&val);
2680: m = -2;
2681: } else
1.2 noro 2682: m = ZTOS(mq);
1.1 noro 2683: create_order_spec(0,ARG3(arg),&ord);
2684: homo = 0;
2685: if ( get_opt("homo",&val) && val ) homo = 1;
2686: if ( get_opt("dp",&val) && val ) retdp = 1;
2687: } else if ( ac == 1 ) {
2688: f = (LIST)ARG0(arg);
2689: parse_gr_option(f,current_option,&v,&nhomo,&m,&ord);
1.2 noro 2690: homo = ZTOS((Q)nhomo);
1.1 noro 2691: if ( get_opt("dp",&val) && val ) retdp = 1;
2692: } else
2693: error("nd_gr : invalid argument");
2694: nd_gr(f,v,m,homo,retdp,0,ord,rp);
2695: }
2696:
2697: void Pnd_gr_postproc(NODE arg,LIST *rp)
2698: {
2699: LIST f,v;
2700: int m,do_check;
2701: Z mq,z;
2702: Obj val;
2703: NODE node;
2704: struct order_spec *ord;
2705:
2706: do_weyl = 0;
2707: asir_assert(ARG0(arg),O_LIST,"nd_gr");
2708: asir_assert(ARG1(arg),O_LIST,"nd_gr");
2709: asir_assert(ARG2(arg),O_N,"nd_gr");
2710: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2711: f = remove_zero_from_list(f);
2712: if ( !BDY(f) ) {
2713: *rp = f; return;
2714: }
2715: mq = (Z)ARG2(arg);
1.2 noro 2716: STOZ(0x40000000,z);
1.1 noro 2717: if ( cmpz(mq,z) >= 0 ) {
2718: node = mknode(1,mq);
2719: Psetmod_ff(node,&val);
2720: m = -2;
2721: } else
1.2 noro 2722: m = ZTOS(mq);
1.1 noro 2723: create_order_spec(0,ARG3(arg),&ord);
2724: do_check = ARG4(arg) ? 1 : 0;
2725: nd_gr_postproc(f,v,m,ord,do_check,rp);
2726: }
2727:
2728: void Pnd_gr_recompute_trace(NODE arg,LIST *rp)
2729: {
2730: LIST f,v,tlist;
2731: int m;
2732: struct order_spec *ord;
2733:
2734: do_weyl = 0;
2735: asir_assert(ARG0(arg),O_LIST,"nd_gr_recompute_trace");
2736: asir_assert(ARG1(arg),O_LIST,"nd_gr_recompute_trace");
2737: asir_assert(ARG2(arg),O_N,"nd_gr_recompute_trace");
2738: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
1.2 noro 2739: m = ZTOS((Q)ARG2(arg));
1.1 noro 2740: create_order_spec(0,ARG3(arg),&ord);
2741: tlist = (LIST)ARG4(arg);
2742: nd_gr_recompute_trace(f,v,m,ord,tlist,rp);
2743: }
2744:
2745: Obj nd_btog_one(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,int pos);
2746: Obj nd_btog(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist);
2747:
2748: void Pnd_btog(NODE arg,Obj *rp)
2749: {
2750: LIST f,v,tlist;
2751: Z mq,z;
2752: int m,ac,pos;
2753: struct order_spec *ord;
2754: NODE node;
2755: pointer val;
2756:
2757: do_weyl = 0;
2758: asir_assert(ARG0(arg),O_LIST,"nd_btog");
2759: asir_assert(ARG1(arg),O_LIST,"nd_btog");
2760: asir_assert(ARG2(arg),O_N,"nd_btog");
2761: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2762: mq = (Z)ARG2(arg);
1.2 noro 2763: STOZ(0x40000000,z);
1.1 noro 2764: if ( cmpz(mq,z) >= 0 ) {
2765: node = mknode(1,mq);
2766: Psetmod_ff(node,(Obj *)&val);
2767: m = -2;
2768: } else
1.2 noro 2769: m = ZTOS(mq);
1.1 noro 2770: create_order_spec(0,ARG3(arg),&ord);
2771: tlist = (LIST)ARG4(arg);
2772: if ( (ac = argc(arg)) == 6 ) {
2773: asir_assert(ARG5(arg),O_N,"nd_btog");
1.2 noro 2774: pos = ZTOS((Q)ARG5(arg));
1.1 noro 2775: *rp = nd_btog_one(f,v,m,ord,tlist,pos);
2776: } else if ( ac == 5 )
2777: *rp = nd_btog(f,v,m,ord,tlist);
2778: else
2779: error("nd_btog : argument mismatch");
2780: }
2781:
2782: void Pnd_weyl_gr_postproc(NODE arg,LIST *rp)
2783: {
2784: LIST f,v;
2785: int m,do_check;
2786: struct order_spec *ord;
2787:
2788: do_weyl = 1;
2789: asir_assert(ARG0(arg),O_LIST,"nd_gr");
2790: asir_assert(ARG1(arg),O_LIST,"nd_gr");
2791: asir_assert(ARG2(arg),O_N,"nd_gr");
2792: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2793: f = remove_zero_from_list(f);
2794: if ( !BDY(f) ) {
2795: *rp = f; do_weyl = 0; return;
2796: }
1.2 noro 2797: m = ZTOS((Q)ARG2(arg));
1.1 noro 2798: create_order_spec(0,ARG3(arg),&ord);
2799: do_check = ARG4(arg) ? 1 : 0;
2800: nd_gr_postproc(f,v,m,ord,do_check,rp);
2801: do_weyl = 0;
2802: }
2803:
2804: void Pnd_gr_trace(NODE arg,LIST *rp)
2805: {
2806: LIST f,v;
2807: int m,homo,ac;
2808: Num nhomo;
2809: struct order_spec *ord;
2810:
2811: do_weyl = 0;
2812: if ( (ac = argc(arg)) == 5 ) {
2813: asir_assert(ARG0(arg),O_LIST,"nd_gr_trace");
2814: asir_assert(ARG1(arg),O_LIST,"nd_gr_trace");
2815: asir_assert(ARG2(arg),O_N,"nd_gr_trace");
2816: asir_assert(ARG3(arg),O_N,"nd_gr_trace");
2817: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2818: f = remove_zero_from_list(f);
2819: if ( !BDY(f) ) {
2820: *rp = f; return;
2821: }
1.2 noro 2822: homo = ZTOS((Q)ARG2(arg));
2823: m = ZTOS((Q)ARG3(arg));
1.1 noro 2824: create_order_spec(0,ARG4(arg),&ord);
2825: } else if ( ac == 1 ) {
2826: f = (LIST)ARG0(arg);
2827: parse_gr_option(f,current_option,&v,&nhomo,&m,&ord);
1.2 noro 2828: homo = ZTOS((Q)nhomo);
1.1 noro 2829: } else
2830: error("nd_gr_trace : invalid argument");
2831: nd_gr_trace(f,v,m,homo,0,ord,rp);
2832: }
2833:
2834: void Pnd_f4_trace(NODE arg,LIST *rp)
2835: {
2836: LIST f,v;
2837: int m,homo,ac;
2838: Num nhomo;
2839: struct order_spec *ord;
2840:
2841: do_weyl = 0;
2842: if ( (ac = argc(arg))==5 ) {
2843: asir_assert(ARG0(arg),O_LIST,"nd_f4_trace");
2844: asir_assert(ARG1(arg),O_LIST,"nd_f4_trace");
2845: asir_assert(ARG2(arg),O_N,"nd_f4_trace");
2846: asir_assert(ARG3(arg),O_N,"nd_f4_trace");
2847: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2848: f = remove_zero_from_list(f);
2849: if ( !BDY(f) ) {
2850: *rp = f; return;
2851: }
1.2 noro 2852: homo = ZTOS((Q)ARG2(arg));
2853: m = ZTOS((Q)ARG3(arg));
1.1 noro 2854: create_order_spec(0,ARG4(arg),&ord);
2855: } else if ( ac == 1 ) {
2856: f = (LIST)ARG0(arg);
2857: parse_gr_option(f,current_option,&v,&nhomo,&m,&ord);
1.2 noro 2858: homo = ZTOS((Q)nhomo);
1.1 noro 2859: } else
2860: error("nd_gr_trace : invalid argument");
2861: nd_gr_trace(f,v,m,homo,1,ord,rp);
2862: }
2863:
2864: void Pnd_weyl_gr(NODE arg,LIST *rp)
2865: {
2866: LIST f,v;
2867: int m,homo,retdp,ac;
2868: Obj val;
2869: Num nhomo;
2870: struct order_spec *ord;
2871:
2872: do_weyl = 1;
2873: retdp = 0;
2874: if ( (ac = argc(arg)) == 4 ) {
2875: asir_assert(ARG0(arg),O_LIST,"nd_weyl_gr");
2876: asir_assert(ARG1(arg),O_LIST,"nd_weyl_gr");
2877: asir_assert(ARG2(arg),O_N,"nd_weyl_gr");
2878: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2879: f = remove_zero_from_list(f);
2880: if ( !BDY(f) ) {
2881: *rp = f; do_weyl = 0; return;
2882: }
1.2 noro 2883: m = ZTOS((Q)ARG2(arg));
1.1 noro 2884: create_order_spec(0,ARG3(arg),&ord);
2885: homo = 0;
2886: if ( get_opt("homo",&val) && val ) homo = 1;
2887: if ( get_opt("dp",&val) && val ) retdp = 1;
2888: } else if ( ac == 1 ) {
2889: f = (LIST)ARG0(arg);
2890: parse_gr_option(f,current_option,&v,&nhomo,&m,&ord);
1.2 noro 2891: homo = ZTOS((Q)nhomo);
1.1 noro 2892: if ( get_opt("dp",&val) && val ) retdp = 1;
2893: } else
2894: error("nd_weyl_gr : invalid argument");
2895: nd_gr(f,v,m,homo,retdp,0,ord,rp);
2896: do_weyl = 0;
2897: }
2898:
2899: void Pnd_weyl_gr_trace(NODE arg,LIST *rp)
2900: {
2901: LIST f,v;
2902: int m,homo,ac;
2903: Num nhomo;
2904: struct order_spec *ord;
2905:
2906: do_weyl = 1;
2907: if ( (ac = argc(arg)) == 5 ) {
2908: asir_assert(ARG0(arg),O_LIST,"nd_weyl_gr_trace");
2909: asir_assert(ARG1(arg),O_LIST,"nd_weyl_gr_trace");
2910: asir_assert(ARG2(arg),O_N,"nd_weyl_gr_trace");
2911: asir_assert(ARG3(arg),O_N,"nd_weyl_gr_trace");
2912: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2913: f = remove_zero_from_list(f);
2914: if ( !BDY(f) ) {
2915: *rp = f; do_weyl = 0; return;
2916: }
1.2 noro 2917: homo = ZTOS((Q)ARG2(arg));
2918: m = ZTOS((Q)ARG3(arg));
1.1 noro 2919: create_order_spec(0,ARG4(arg),&ord);
2920: } else if ( ac == 1 ) {
2921: f = (LIST)ARG0(arg);
2922: parse_gr_option(f,current_option,&v,&nhomo,&m,&ord);
1.2 noro 2923: homo = ZTOS((Q)nhomo);
1.1 noro 2924: } else
2925: error("nd_weyl_gr_trace : invalid argument");
2926: nd_gr_trace(f,v,m,homo,0,ord,rp);
2927: do_weyl = 0;
2928: }
2929:
2930: void Pnd_nf(NODE arg,Obj *rp)
2931: {
2932: Obj f;
2933: LIST g,v;
2934: struct order_spec *ord;
2935:
2936: do_weyl = 0;
2937: asir_assert(ARG1(arg),O_LIST,"nd_nf");
2938: asir_assert(ARG2(arg),O_LIST,"nd_nf");
2939: asir_assert(ARG4(arg),O_N,"nd_nf");
2940: f = (Obj)ARG0(arg);
2941: g = (LIST)ARG1(arg); g = remove_zero_from_list(g);
2942: if ( !BDY(g) ) {
2943: *rp = f; return;
2944: }
2945: v = (LIST)ARG2(arg);
2946: create_order_spec(0,ARG3(arg),&ord);
1.2 noro 2947: nd_nf_p(f,g,v,ZTOS((Q)ARG4(arg)),ord,rp);
1.1 noro 2948: }
2949:
2950: void Pnd_weyl_nf(NODE arg,Obj *rp)
2951: {
2952: Obj f;
2953: LIST g,v;
2954: struct order_spec *ord;
2955:
2956: do_weyl = 1;
2957: asir_assert(ARG1(arg),O_LIST,"nd_weyl_nf");
2958: asir_assert(ARG2(arg),O_LIST,"nd_weyl_nf");
2959: asir_assert(ARG4(arg),O_N,"nd_weyl_nf");
2960: f = (Obj)ARG0(arg);
2961: g = (LIST)ARG1(arg); g = remove_zero_from_list(g);
2962: if ( !BDY(g) ) {
2963: *rp = f; return;
2964: }
2965: v = (LIST)ARG2(arg);
2966: create_order_spec(0,ARG3(arg),&ord);
1.2 noro 2967: nd_nf_p(f,g,v,ZTOS((Q)ARG4(arg)),ord,rp);
1.1 noro 2968: }
2969:
2970: /* for Weyl algebra */
2971:
2972: void Pdp_weyl_gr_main(NODE arg,LIST *rp)
2973: {
2974: LIST f,v;
2975: Num homo;
2976: Z m,z;
2977: int modular,ac;
2978: struct order_spec *ord;
2979:
2980:
2981: asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_main");
2982: f = (LIST)ARG0(arg);
2983: f = remove_zero_from_list(f);
2984: if ( !BDY(f) ) {
2985: *rp = f; return;
2986: }
2987: if ( (ac = argc(arg)) == 5 ) {
2988: asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_main");
2989: asir_assert(ARG2(arg),O_N,"dp_weyl_gr_main");
2990: asir_assert(ARG3(arg),O_N,"dp_weyl_gr_main");
2991: v = (LIST)ARG1(arg);
2992: homo = (Num)ARG2(arg);
2993: m = (Z)ARG3(arg);
1.2 noro 2994: STOZ(0x80000000,z);
1.1 noro 2995: if ( !m )
2996: modular = 0;
2997: else if ( cmpz(m,z) >= 0 )
2998: error("dp_weyl_gr_main : too large modulus");
2999: else
1.2 noro 3000: modular = ZTOS(m);
1.1 noro 3001: create_order_spec(0,ARG4(arg),&ord);
3002: } else if ( current_option )
3003: parse_gr_option(f,current_option,&v,&homo,&modular,&ord);
3004: else if ( ac == 1 )
3005: parse_gr_option(f,0,&v,&homo,&modular,&ord);
3006: else
3007: error("dp_weyl_gr_main : invalid argument");
3008: do_weyl = 1;
3009: dp_gr_main(f,v,homo,modular,0,ord,rp);
3010: do_weyl = 0;
3011: }
3012:
3013: void Pdp_weyl_gr_f_main(NODE arg,LIST *rp)
3014: {
3015: LIST f,v;
3016: Num homo;
3017: struct order_spec *ord;
3018:
3019: asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_main");
3020: asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_main");
3021: asir_assert(ARG2(arg),O_N,"dp_weyl_gr_main");
3022: asir_assert(ARG3(arg),O_N,"dp_weyl_gr_main");
3023: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
3024: f = remove_zero_from_list(f);
3025: if ( !BDY(f) ) {
3026: *rp = f; return;
3027: }
3028: homo = (Num)ARG2(arg);
3029: create_order_spec(0,ARG3(arg),&ord);
3030: do_weyl = 1;
3031: dp_gr_main(f,v,homo,0,1,ord,rp);
3032: do_weyl = 0;
3033: }
3034:
3035: void Pdp_weyl_f4_main(NODE arg,LIST *rp)
3036: {
3037: LIST f,v;
3038: struct order_spec *ord;
3039:
3040: asir_assert(ARG0(arg),O_LIST,"dp_weyl_f4_main");
3041: asir_assert(ARG1(arg),O_LIST,"dp_weyl_f4_main");
3042: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
3043: f = remove_zero_from_list(f);
3044: if ( !BDY(f) ) {
3045: *rp = f; return;
3046: }
3047: create_order_spec(0,ARG2(arg),&ord);
3048: do_weyl = 1;
3049: dp_f4_main(f,v,ord,rp);
3050: do_weyl = 0;
3051: }
3052:
3053: void Pdp_weyl_f4_mod_main(NODE arg,LIST *rp)
3054: {
3055: LIST f,v;
3056: int m;
3057: struct order_spec *ord;
3058:
3059: asir_assert(ARG0(arg),O_LIST,"dp_weyl_f4_main");
3060: asir_assert(ARG1(arg),O_LIST,"dp_weyl_f4_main");
3061: asir_assert(ARG2(arg),O_N,"dp_f4_main");
1.2 noro 3062: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); m = ZTOS((Q)ARG2(arg));
1.1 noro 3063: f = remove_zero_from_list(f);
3064: if ( !BDY(f) ) {
3065: *rp = f; return;
3066: }
3067: if ( !m )
3068: error("dp_weyl_f4_mod_main : invalid argument");
3069: create_order_spec(0,ARG3(arg),&ord);
3070: do_weyl = 1;
3071: dp_f4_mod_main(f,v,m,ord,rp);
3072: do_weyl = 0;
3073: }
3074:
3075: void Pdp_weyl_gr_mod_main(NODE arg,LIST *rp)
3076: {
3077: LIST f,v;
3078: Num homo;
3079: int m;
3080: struct order_spec *ord;
3081:
3082: asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_mod_main");
3083: asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_mod_main");
3084: asir_assert(ARG2(arg),O_N,"dp_weyl_gr_mod_main");
3085: asir_assert(ARG3(arg),O_N,"dp_weyl_gr_mod_main");
3086: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
3087: f = remove_zero_from_list(f);
3088: if ( !BDY(f) ) {
3089: *rp = f; return;
3090: }
1.2 noro 3091: homo = (Num)ARG2(arg); m = ZTOS((Q)ARG3(arg));
1.1 noro 3092: if ( !m )
3093: error("dp_weyl_gr_mod_main : invalid argument");
3094: create_order_spec(0,ARG4(arg),&ord);
3095: do_weyl = 1;
3096: dp_gr_mod_main(f,v,homo,m,ord,rp);
3097: do_weyl = 0;
3098: }
3099:
3100: VECT current_dl_weight_vector_obj;
3101: int *current_dl_weight_vector;
3102: int dp_negative_weight;
3103:
3104: void Pdp_set_weight(NODE arg,VECT *rp)
3105: {
3106: VECT v;
3107: int i,n;
3108: NODE node;
3109:
3110: if ( !arg )
3111: *rp = current_dl_weight_vector_obj;
3112: else if ( !ARG0(arg) ) {
3113: current_dl_weight_vector_obj = 0;
3114: current_dl_weight_vector = 0;
3115: dp_negative_weight = 0;
3116: *rp = 0;
3117: } else {
3118: if ( OID(ARG0(arg)) != O_VECT && OID(ARG0(arg)) != O_LIST )
3119: error("dp_set_weight : invalid argument");
3120: if ( OID(ARG0(arg)) == O_VECT )
3121: v = (VECT)ARG0(arg);
3122: else {
3123: node = (NODE)BDY((LIST)ARG0(arg));
3124: n = length(node);
3125: MKVECT(v,n);
3126: for ( i = 0; i < n; i++, node = NEXT(node) )
3127: BDY(v)[i] = BDY(node);
3128: }
3129: current_dl_weight_vector_obj = v;
3130: n = v->len;
3131: current_dl_weight_vector = (int *)CALLOC(n,sizeof(int));
3132: for ( i = 0; i < n; i++ )
1.2 noro 3133: current_dl_weight_vector[i] = ZTOS((Q)v->body[i]);
1.1 noro 3134: for ( i = 0; i < n; i++ )
3135: if ( current_dl_weight_vector[i] < 0 ) break;
3136: if ( i < n )
3137: dp_negative_weight = 1;
3138: else
3139: dp_negative_weight = 0;
3140: *rp = v;
3141: }
3142: }
3143:
3144: VECT current_module_weight_vector_obj;
3145: int *current_module_weight_vector;
3146:
3147: void Pdp_set_module_weight(NODE arg,VECT *rp)
3148: {
3149: VECT v;
3150: int i,n;
3151: NODE node;
3152:
3153: if ( !arg )
3154: *rp = current_module_weight_vector_obj;
3155: else if ( !ARG0(arg) ) {
3156: current_module_weight_vector_obj = 0;
3157: current_module_weight_vector = 0;
3158: *rp = 0;
3159: } else {
3160: if ( OID(ARG0(arg)) != O_VECT && OID(ARG0(arg)) != O_LIST )
3161: error("dp_module_set_weight : invalid argument");
3162: if ( OID(ARG0(arg)) == O_VECT )
3163: v = (VECT)ARG0(arg);
3164: else {
3165: node = (NODE)BDY((LIST)ARG0(arg));
3166: n = length(node);
3167: MKVECT(v,n);
3168: for ( i = 0; i < n; i++, node = NEXT(node) )
3169: BDY(v)[i] = BDY(node);
3170: }
3171: current_module_weight_vector_obj = v;
3172: n = v->len;
3173: current_module_weight_vector = (int *)CALLOC(n,sizeof(int));
3174: for ( i = 0; i < n; i++ )
1.2 noro 3175: current_module_weight_vector[i] = ZTOS((Q)v->body[i]);
1.1 noro 3176: *rp = v;
3177: }
3178: }
3179:
3180: extern Obj current_top_weight;
3181: extern Obj nd_top_weight;
3182:
3183: void Pdp_set_top_weight(NODE arg,Obj *rp)
3184: {
3185: VECT v;
3186: MAT m;
3187: Obj obj;
3188: int i,j,n,id,row,col;
3189: Q *mi;
3190: NODE node;
3191:
3192: if ( !arg )
3193: *rp = current_top_weight;
3194: else if ( !ARG0(arg) ) {
3195: reset_top_weight();
3196: *rp = 0;
3197: } else {
3198: id = OID(ARG0(arg));
3199: if ( id != O_VECT && id != O_MAT && id != O_LIST )
3200: error("dp_set_top_weight : invalid argument");
3201: if ( id == O_LIST ) {
3202: node = (NODE)BDY((LIST)ARG0(arg));
3203: n = length(node);
3204: MKVECT(v,n);
3205: for ( i = 0; i < n; i++, node = NEXT(node) )
3206: BDY(v)[i] = BDY(node);
3207: obj = (Obj)v;
3208: } else
3209: obj = ARG0(arg);
3210: if ( OID(obj) == O_VECT ) {
3211: v = (VECT)obj;
3212: for ( i = 0; i < v->len; i++ )
3213: if ( !INT((Q)BDY(v)[i]) || sgnz((Z)BDY(v)[i]) < 0 )
3214: error("dp_set_top_weight : each element must be a non-negative integer");
3215: } else {
3216: m = (MAT)obj; row = m->row; col = m->col;
3217: for ( i = 0; i < row; i++ )
3218: for ( j = 0, mi = (Q *)BDY(m)[i]; j < col; j++ )
3219: if ( !INT((Q)mi[j]) || sgnz((Z)mi[j]) < 0 )
3220: error("dp_set_top_weight : each element must be a non-negative integer");
3221: }
3222: current_top_weight = obj;
3223: nd_top_weight = obj;
3224: *rp = current_top_weight;
3225: }
3226: }
3227:
3228: LIST get_denomlist();
3229:
3230: void Pdp_get_denomlist(LIST *rp)
3231: {
3232: *rp = get_denomlist();
3233: }
3234:
3235: static VECT current_weyl_weight_vector_obj;
3236: int *current_weyl_weight_vector;
3237:
3238: void Pdp_weyl_set_weight(NODE arg,VECT *rp)
3239: {
3240: VECT v;
3241: NODE node;
3242: int i,n;
3243:
3244: if ( !arg )
3245: *rp = current_weyl_weight_vector_obj;
3246: else if ( !ARG0(arg) ) {
3247: current_weyl_weight_vector_obj = 0;
3248: current_weyl_weight_vector = 0;
3249: *rp = 0;
3250: } else {
3251: if ( OID(ARG0(arg)) != O_VECT && OID(ARG0(arg)) != O_LIST )
3252: error("dp_weyl_set_weight : invalid argument");
3253: if ( OID(ARG0(arg)) == O_VECT )
3254: v = (VECT)ARG0(arg);
3255: else {
3256: node = (NODE)BDY((LIST)ARG0(arg));
3257: n = length(node);
3258: MKVECT(v,n);
3259: for ( i = 0; i < n; i++, node = NEXT(node) )
3260: BDY(v)[i] = BDY(node);
3261: }
3262: current_weyl_weight_vector_obj = v;
3263: n = v->len;
3264: current_weyl_weight_vector = (int *)CALLOC(n,sizeof(int));
3265: for ( i = 0; i < n; i++ )
1.2 noro 3266: current_weyl_weight_vector[i] = ZTOS((Q)v->body[i]);
1.1 noro 3267: *rp = v;
3268: }
3269: }
3270:
3271: NODE mono_raddec(NODE ideal);
3272:
3273: void Pdp_mono_raddec(NODE arg,LIST *rp)
3274: {
3275: NODE ideal,rd,t,t1,r,r1,u;
3276: VL vl0,vl;
3277: int nv,i,bpi;
3278: int *s;
3279: DP dp;
3280: P *v;
3281: LIST l;
3282:
3283: ideal = BDY((LIST)ARG0(arg));
3284: if ( !ideal ) *rp = (LIST)ARG0(arg);
3285: else {
3286: t = BDY((LIST)ARG1(arg));
3287: nv = length(t);
3288: v = (P *)MALLOC(nv*sizeof(P));
3289: for ( vl0 = 0, i = 0; t; t = NEXT(t), i++ ) {
3290: NEXTVL(vl0,vl); VR(vl) = VR((P)BDY(t));
3291: MKV(VR(vl),v[i]);
3292: }
3293: if ( vl0 ) NEXT(vl) = 0;
3294: for ( t = 0, r = ideal; r; r = NEXT(r) ) {
3295: ptod(CO,vl0,BDY(r),&dp); MKNODE(t1,dp,t); t = t1;
3296: }
3297: rd = mono_raddec(t);
3298: r = 0;
3299: bpi = (sizeof(int)/sizeof(char))*8;
3300: for ( u = rd; u; u = NEXT(u) ) {
3301: s = (int *)BDY(u);
3302: for ( i = nv-1, t = 0; i >= 0; i-- )
3303: if ( s[i/bpi]&(1<<(i%bpi)) ) {
3304: MKNODE(t1,v[i],t); t = t1;
3305: }
3306: MKLIST(l,t); MKNODE(r1,l,r); r = r1;
3307: }
3308: MKLIST(*rp,r);
3309: }
3310: }
3311:
3312: void Pdp_mono_reduce(NODE arg,LIST *rp)
3313: {
3314: NODE t,t0,t1,r0,r;
3315: int i,n;
3316: DP m;
3317: DP *a;
3318:
3319: t0 = BDY((LIST)ARG0(arg));
3320: t1 = BDY((LIST)ARG1(arg));
3321: n = length(t0);
3322: a = (DP *)MALLOC(n*sizeof(DP));
3323: for ( i = 0; i < n; i++, t0 = NEXT(t0) ) a[i] = (DP)BDY(t0);
3324: for ( t = t1; t; t = NEXT(t) ) {
3325: m = (DP)BDY(t);
3326: for ( i = 0; i < n; i++ )
3327: if ( a[i] && dp_redble(a[i],m) ) a[i] = 0;
3328: }
3329: for ( i = n-1, r0 = 0; i >= 0; i-- )
3330: if ( a[i] ) { NEXTNODE(r0,r); BDY(r) = a[i]; }
3331: if ( r0 ) NEXT(r) = 0;
3332: MKLIST(*rp,r0);
3333: }
3334:
3335: #define BLEN (8*sizeof(unsigned long))
3336:
3337: void showmat2(unsigned long **a,int row,int col)
3338: {
3339: int i,j;
3340:
3341: for ( i = 0; i < row; i++, putchar('\n') )
3342: for ( j = 0; j < col; j++ )
3343: if ( a[i][j/BLEN] & (1L<<(j%BLEN)) ) putchar('1');
3344: else putchar('0');
3345: }
3346:
3347: int rref2(unsigned long **a,int row,int col)
3348: {
3349: int i,j,k,l,s,wcol,wj;
3350: unsigned long bj;
3351: unsigned long *ai,*ak,*as,*t;
3352: int *pivot;
3353:
3354: wcol = (col+BLEN-1)/BLEN;
3355: pivot = (int *)MALLOC_ATOMIC(row*sizeof(int));
3356: i = 0;
3357: for ( j = 0; j < col; j++ ) {
3358: wj = j/BLEN; bj = 1L<<(j%BLEN);
3359: for ( k = i; k < row; k++ )
3360: if ( a[k][wj] & bj ) break;
3361: if ( k == row ) continue;
3362: pivot[i] = j;
3363: if ( k != i ) {
3364: t = a[i]; a[i] = a[k]; a[k] = t;
3365: }
3366: ai = a[i];
3367: for ( k = i+1; k < row; k++ ) {
3368: ak = a[k];
3369: if ( ak[wj] & bj ) {
3370: for ( l = wj; l < wcol; l++ )
3371: ak[l] ^= ai[l];
3372: }
3373: }
3374: i++;
3375: }
3376: for ( k = i-1; k >= 0; k-- ) {
3377: j = pivot[k]; wj = j/BLEN; bj = 1L<<(j%BLEN);
3378: ak = a[k];
3379: for ( s = 0; s < k; s++ ) {
3380: as = a[s];
3381: if ( as[wj] & bj ) {
3382: for ( l = wj; l < wcol; l++ )
3383: as[l] ^= ak[l];
3384: }
3385: }
3386: }
3387: return i;
3388: }
3389:
3390: void Pdp_rref2(NODE arg,VECT *rp)
3391: {
3392: VECT f,term,ret;
3393: int row,col,wcol,size,nv,i,j,rank,td;
3394: unsigned long **mat;
3395: unsigned long *v;
3396: DL d;
3397: DL *t;
3398: DP dp;
3399: MP m,m0;
3400:
3401: f = (VECT)ARG0(arg);
3402: row = f->len;
3403: term = (VECT)ARG1(arg);
3404: col = term->len;
3405: mat = (unsigned long **)MALLOC(row*sizeof(unsigned long *));
3406: size = sizeof(unsigned long)*((col+BLEN-1)/BLEN);
3407: nv = ((DP)term->body[0])->nv;
3408: t = (DL *)MALLOC(col*sizeof(DL));
3409: for ( i = 0; i < col; i++ ) t[i] = BDY((DP)BDY(term)[i])->dl;
3410: for ( i = 0; i < row; i++ ) {
3411: v = mat[i] = (unsigned long *)MALLOC_ATOMIC_IGNORE_OFF_PAGE(size);
3412: bzero(v,size);
3413: for ( j = 0, m = BDY((DP)BDY(f)[i]); m; m = NEXT(m) ) {
3414: d = m->dl;
3415: for ( ; !dl_equal(nv,d,t[j]); j++ );
3416: v[j/BLEN] |= 1L <<(j%BLEN);
3417: }
3418: }
3419: rank = rref2(mat,row,col);
3420: MKVECT(ret,rank);
3421: *rp = ret;
3422: for ( i = 0; i < rank; i++ ) {
3423: v = mat[i];
3424: m0 = 0;
3425: td = 0;
3426: for ( j = 0; j < col; j++ ) {
3427: if ( v[j/BLEN] & (1L<<(j%BLEN)) ) {
3428: NEXTMP(m0,m);
3429: m->dl = t[j];
3430: m->c = (Obj)ONE;
3431: td = MAX(td,m->dl->td);
3432: }
3433: }
3434: NEXT(m) = 0;
3435: MKDP(nv,m0,dp);
3436: dp->sugar = td;
3437: BDY(ret)[i] = (pointer)dp;
3438: }
3439: }
3440:
3441: #define HDL(f) (BDY(f)->dl)
3442:
3443: NODE sumi_criB(int nv,NODE d,DP *f,int m)
3444: {
3445: LIST p;
3446: NODE r0,r;
3447: int p0,p1;
3448: DL p2,lcm;
3449:
3450: NEWDL(lcm,nv);
3451: r0 = 0;
3452: for ( ; d; d = NEXT(d) ) {
3453: p = (LIST)BDY(d);
1.2 noro 3454: p0 = ZTOS((Q)ARG0(BDY(p)));
3455: p1 = ZTOS((Q)ARG1(BDY(p)));
1.1 noro 3456: p2 = HDL((DP)ARG2(BDY(p)));
3457: if(!_dl_redble(HDL((DP)f[m]),p2,nv) ||
3458: dl_equal(nv,lcm_of_DL(nv,HDL(f[p0]),HDL(f[m]),lcm),p2) ||
3459: dl_equal(nv,lcm_of_DL(nv,HDL(f[p1]),HDL(f[m]),lcm),p2) ) {
3460: NEXTNODE(r0,r);
3461: BDY(r) = p;
3462: }
3463: }
3464: if ( r0 ) NEXT(r) = 0;
3465: return r0;
3466: }
3467:
3468: NODE sumi_criFMD(int nv,DP *f,int m)
3469: {
3470: DL *a;
3471: DL l1,dl1,dl2;
3472: int i,j,k,k2;
3473: NODE r,r1,nd;
3474: MP mp;
3475: DP u;
3476: Z iq,mq;
3477: LIST list;
3478:
3479: /* a[i] = lcm(LT(f[i]),LT(f[m])) */
3480: a = (DL *)ALLOCA(m*sizeof(DL));
3481: for ( i = 0; i < m; i++ ) {
3482: a[i] = lcm_of_DL(nv,HDL(f[i]),HDL(f[m]),0);
3483: }
3484: r = 0;
3485: for( i = 0; i < m; i++) {
3486: l1 = a[i];
3487: if ( !l1 ) continue;
3488: /* Tkm = Tim (k<i) */
3489: for( k = 0; k < i; k++)
3490: if( dl_equal(nv,l1,a[k]) ) break;
3491: if( k == i ){
3492: /* Tk|Tim && Tkm != Tim (k<m) */
3493: for ( k2 = 0; k2 < m; k2++ )
3494: if ( _dl_redble(HDL(f[k2]),l1,nv) &&
3495: !dl_equal(nv,l1,a[k2]) ) break;
3496: if ( k2 == m ) {
3497: dl1 = HDL(f[i]); dl2 = HDL(f[m]);
3498: for ( k2 = 0; k2 < nv; k2++ )
3499: if ( dl1->d[k2] && dl2->d[k2] ) break;
3500: if ( k2 < nv ) {
3501: NEWMP(mp); mp->dl = l1; C(mp) = (Obj)ONE;
3502: NEXT(mp) = 0; MKDP(nv,mp,u); u->sugar = l1->td;
1.2 noro 3503: STOZ(i,iq); STOZ(m,mq);
1.1 noro 3504: nd = mknode(3,iq,mq,u);
3505: MKLIST(list,nd);
3506: MKNODE(r1,list,r);
3507: r = r1;
3508: }
3509: }
3510: }
3511: }
3512: return r;
3513: }
3514:
3515: LIST sumi_updatepairs(LIST d,DP *f,int m)
3516: {
3517: NODE old,new,t;
3518: LIST l;
3519: int nv;
3520:
3521: nv = f[0]->nv;
3522: old = sumi_criB(nv,BDY(d),f,m);
3523: new = sumi_criFMD(nv,f,m);
3524: if ( !new ) new = old;
3525: else {
3526: for ( t = new ; NEXT(t); t = NEXT(t) );
3527: NEXT(t) = old;
3528: }
3529: MKLIST(l,new);
3530: return l;
3531: }
3532:
3533: VECT ltov(LIST l)
3534: {
3535: NODE n;
3536: int i,len;
3537: VECT v;
3538:
3539: n = BDY(l);
3540: len = length(n);
3541: MKVECT(v,len);
3542: for ( i = 0; i < len; i++, n = NEXT(n) )
3543: BDY(v)[i] = BDY(n);
3544: return v;
3545: }
3546:
3547: DL subdl(int nv,DL d1,DL d2)
3548: {
3549: int i;
3550: DL d;
3551:
3552: NEWDL(d,nv);
3553: d->td = d1->td-d2->td;
3554: for ( i = 0; i < nv; i++ )
3555: d->d[i] = d1->d[i]-d2->d[i];
3556: return d;
3557: }
3558:
3559: DP dltodp(int nv,DL d)
3560: {
3561: MP mp;
3562: DP dp;
3563:
3564: NEWMP(mp); mp->dl = d; C(mp) = (Obj)ONE;
3565: NEXT(mp) = 0; MKDP(nv,mp,dp); dp->sugar = d->td;
3566: return dp;
3567: }
3568:
3569: LIST sumi_simplify(int nv,DL t,DP p,NODE f2,int simp)
3570: {
3571: DL d,h,hw;
3572: DP u,w,dp;
3573: int n,i,last;
3574: LIST *v;
3575: LIST list;
3576: NODE s,r;
3577:
3578: d = t; u = p;
3579: /* only the last history is used */
3580: if ( f2 && simp && t->td != 0 ) {
3581: adddl(nv,t,HDL(p),&h);
3582: n = length(f2);
3583: last = 1;
3584: if ( simp > 1 ) last = n;
3585: v = (LIST *)ALLOCA(n*sizeof(LIST));
3586: for ( r = f2, i = 0; r; r = NEXT(r), i++ ) v[n-i-1] = BDY(r);
3587: for ( i = 0; i < last; i++ ) {
3588: for ( s = BDY((LIST)v[i]); s; s = NEXT(s) ) {
3589: w = (DP)BDY(s); hw = HDL(w);
3590: if ( _dl_redble(hw,h,nv) ) {
3591: u = w;
3592: d = subdl(nv,h,hw);
3593: goto fin;
3594: }
3595: }
3596: }
3597: }
3598: fin:
3599: dp = dltodp(nv,d);
3600: r = mknode(2,dp,u);
3601: MKLIST(list,r);
3602: return list;
3603: }
3604:
3605: LIST sumi_symbolic(NODE l,int q,NODE f2,DP *g,int simp)
3606: {
3607: int nv;
3608: NODE t,r;
3609: NODE f0,f,fd0,fd,done0,done,red0,red;
3610: DL h,d;
3611: DP mul;
3612: int m;
3613: LIST tp,l0,l1,l2,l3,list;
3614: VECT v0,v1,v2,v3;
3615:
3616: nv = ((DP)BDY(l))->nv;
3617: t = 0;
3618:
3619: f0 = 0; fd0 = 0; done0 = 0; red0 = 0;
3620:
3621: for ( ; l; l = NEXT(l) ) {
3622: t = symb_merge(t,dp_dllist((DP)BDY(l)),nv);
3623: NEXTNODE(fd0,fd); BDY(fd) = BDY(l);
3624: }
3625:
3626: while ( t ) {
3627: h = (DL)BDY(t);
3628: NEXTNODE(done0,done); BDY(done) = dltodp(nv,h);
3629: t = NEXT(t);
3630: for(m = 0; m < q; m++)
3631: if ( _dl_redble(HDL(g[m]),h,nv) ) break;
3632: if ( m == q ) {
3633: } else {
3634: d = subdl(nv,h,HDL(g[m]));
3635: tp = sumi_simplify(nv,d,g[m],f2,simp);
3636:
3637: muldm(CO,ARG1(BDY(tp)),BDY((DP)ARG0(BDY(tp))),&mul);
3638: t = symb_merge(t,NEXT(dp_dllist(mul)),nv);
3639:
3640: NEXTNODE(f0,f); BDY(f) = tp;
3641: NEXTNODE(fd0,fd); BDY(fd) = mul;
3642: NEXTNODE(red0,red); BDY(red) = mul;
3643: }
3644: }
3645: if ( fd0 ) NEXT(fd) = 0; MKLIST(l0,fd0);
3646: v0 = ltov(l0);
3647: if ( done0 ) NEXT(done) = 0; MKLIST(l1,done0);
3648: v1 = ltov(l1);
3649: if ( f0 ) NEXT(f) = 0; MKLIST(l2,f0);
3650: v2 = ltov(l2);
3651: if ( red0 ) NEXT(red) = 0; MKLIST(l3,red0);
3652: v3 = ltov(l3);
3653: r = mknode(4,v0,v1,v2,v3);
3654: MKLIST(list,r);
3655: return list;
3656: }
3657:
3658: void Psumi_symbolic(NODE arg,LIST *rp)
3659: {
3660: NODE l,f2;
3661: DP *g;
3662: int q,simp;
3663:
3664: l = BDY((LIST)ARG0(arg));
1.2 noro 3665: q = ZTOS((Q)ARG1(arg));
1.1 noro 3666: f2 = BDY((LIST)ARG2(arg));
3667: g = (DP *)BDY((VECT)ARG3(arg));
1.2 noro 3668: simp = ZTOS((Q)ARG4(arg));
1.1 noro 3669: *rp = sumi_symbolic(l,q,f2,g,simp);
3670: }
3671:
3672: void Psumi_updatepairs(NODE arg,LIST *rp)
3673: {
3674: LIST d,l;
3675: DP *f;
3676: int m;
3677:
3678: d = (LIST)ARG0(arg);
3679: f = (DP *)BDY((VECT)ARG1(arg));
1.2 noro 3680: m = ZTOS((Q)ARG2(arg));
1.1 noro 3681: *rp = sumi_updatepairs(d,f,m);
3682: }
3683:
3684: LIST remove_zero_from_list(LIST l)
3685: {
3686: NODE n,r0,r;
3687: LIST rl;
3688:
3689: asir_assert(l,O_LIST,"remove_zero_from_list");
3690: n = BDY(l);
3691: for ( r0 = 0; n; n = NEXT(n) )
3692: if ( BDY(n) ) {
3693: NEXTNODE(r0,r);
3694: BDY(r) = BDY(n);
3695: }
3696: if ( r0 )
3697: NEXT(r) = 0;
3698: MKLIST(rl,r0);
3699: return rl;
3700: }
3701:
3702: int get_field_type(P p)
3703: {
3704: int type,t;
3705: DCP dc;
3706:
3707: if ( !p )
3708: return 0;
3709: else if ( NUM(p) )
3710: return NID((Num)p);
3711: else {
3712: type = 0;
3713: for ( dc = DC(p); dc; dc = NEXT(dc) ) {
3714: t = get_field_type(COEF(dc));
3715: if ( !t )
3716: continue;
3717: if ( t < 0 )
3718: return t;
3719: if ( !type )
3720: type = t;
3721: else if ( t != type )
3722: return -1;
3723: }
3724: return type;
3725: }
3726: }
3727:
3728: void Pdpv_ord(NODE arg,Obj *rp)
3729: {
3730: int ac,id;
3731: LIST shift;
3732:
3733: ac = argc(arg);
3734: if ( ac ) {
1.2 noro 3735: id = ZTOS((Q)ARG0(arg));
1.1 noro 3736: if ( ac > 1 && ARG1(arg) && OID((Obj)ARG1(arg))==O_LIST )
3737: shift = (LIST)ARG1(arg);
3738: else
3739: shift = 0;
3740: create_modorder_spec(id,shift,&dp_current_modspec);
3741: }
3742: *rp = dp_current_modspec->obj;
3743: }
3744:
3745: extern int dpm_ispot;
3746:
3747: void Pdpm_ord(NODE arg,LIST *rp)
3748: {
3749: Z q;
3750: NODE nd;
3751: struct order_spec *spec;
3752:
3753: if ( arg ) {
3754: nd = BDY((LIST)ARG0(arg));
3755: if ( !create_order_spec(0,(Obj)ARG1(nd),&spec) )
3756: error("dpm_ord : invalid order specification");
1.2 noro 3757: initdpm(spec,ZTOS((Q)ARG0(nd)));
1.1 noro 3758: }
1.2 noro 3759: STOZ(dpm_ispot,q);
1.1 noro 3760: nd = mknode(2,q,dp_current_spec->obj);
3761: MKLIST(*rp,nd);
3762: }
3763:
3764: void Pdpm_hm(NODE arg,DPM *rp)
3765: {
3766: DPM p;
3767:
3768: p = (DPM)ARG0(arg); asir_assert(p,O_DPM,"dpm_hm");
3769: dpm_hm(p,rp);
3770: }
3771:
3772: void Pdpm_ht(NODE arg,DPM *rp)
3773: {
3774: DPM p;
3775:
3776: p = (DPM)ARG0(arg); asir_assert(p,O_DPM,"dp_ht");
3777: dpm_ht(p,rp);
3778: }
3779:
3780: void Pdpm_hc(NODE arg,Obj *rp)
3781: {
3782: asir_assert(ARG0(arg),O_DPM,"dpm_hc");
3783: if ( !ARG0(arg) )
3784: *rp = 0;
3785: else
3786: *rp = BDY((DPM)ARG0(arg))->c;
3787: }
3788:
3789:
3790: void Pdpv_ht(NODE arg,LIST *rp)
3791: {
3792: NODE n;
3793: DP ht;
3794: int pos;
3795: DPV p;
3796: Z q;
3797:
3798: asir_assert(ARG0(arg),O_DPV,"dpv_ht");
3799: p = (DPV)ARG0(arg);
3800: pos = dpv_hp(p);
3801: if ( pos < 0 )
3802: ht = 0;
3803: else
3804: dp_ht(BDY(p)[pos],&ht);
1.2 noro 3805: STOZ(pos,q);
1.1 noro 3806: n = mknode(2,q,ht);
3807: MKLIST(*rp,n);
3808: }
3809:
3810: void Pdpv_hm(NODE arg,LIST *rp)
3811: {
3812: NODE n;
3813: DP ht;
3814: int pos;
3815: DPV p;
3816: Z q;
3817:
3818: asir_assert(ARG0(arg),O_DPV,"dpv_hm");
3819: p = (DPV)ARG0(arg);
3820: pos = dpv_hp(p);
3821: if ( pos < 0 )
3822: ht = 0;
3823: else
3824: dp_hm(BDY(p)[pos],&ht);
1.2 noro 3825: STOZ(pos,q);
1.1 noro 3826: n = mknode(2,q,ht);
3827: MKLIST(*rp,n);
3828: }
3829:
3830: void Pdpv_hc(NODE arg,LIST *rp)
3831: {
3832: NODE n;
3833: P hc;
3834: int pos;
3835: DPV p;
3836: Z q;
3837:
3838: asir_assert(ARG0(arg),O_DPV,"dpv_hc");
3839: p = (DPV)ARG0(arg);
3840: pos = dpv_hp(p);
3841: if ( pos < 0 )
3842: hc = 0;
3843: else
3844: hc = (P)BDY(BDY(p)[pos])->c;
1.2 noro 3845: STOZ(pos,q);
1.1 noro 3846: n = mknode(2,q,hc);
3847: MKLIST(*rp,n);
3848: }
3849:
3850: int dpv_hp(DPV p)
3851: {
3852: int len,i,maxp,maxw,w,slen;
3853: int *shift;
3854: DP *e;
3855:
3856: len = p->len;
3857: e = p->body;
3858: slen = dp_current_modspec->len;
3859: shift = dp_current_modspec->degree_shift;
3860: switch ( dp_current_modspec->id ) {
3861: case ORD_REVGRADLEX:
3862: for ( maxp = -1, i = 0; i < len; i++ )
3863: if ( !e[i] ) continue;
3864: else if ( maxp < 0 ) {
3865: maxw = BDY(e[i])->dl->td+(i<slen?shift[i]:0); maxp = i;
3866: } else {
3867: w = BDY(e[i])->dl->td+(i<slen?shift[i]:0);
3868: if ( w >= maxw ) {
3869: maxw = w; maxp = i;
3870: }
3871: }
3872: return maxp;
3873: case ORD_GRADLEX:
3874: for ( maxp = -1, i = 0; i < len; i++ )
3875: if ( !e[i] ) continue;
3876: else if ( maxp < 0 ) {
3877: maxw = BDY(e[i])->dl->td+(i<slen?shift[i]:0); maxp = i;
3878: } else {
3879: w = BDY(e[i])->dl->td+(i<slen?shift[i]:0);
3880: if ( w > maxw ) {
3881: maxw = w; maxp = i;
3882: }
3883: }
3884: return maxp;
3885: break;
3886: case ORD_LEX:
3887: for ( i = 0; i < len; i++ )
3888: if ( e[i] ) return i;
3889: return -1;
3890: break;
3891: }
3892: }
3893:
3894: int get_opt(char *key0,Obj *r) {
3895: NODE tt,p;
3896: char *key;
3897:
3898: if ( current_option ) {
3899: for ( tt = current_option; tt; tt = NEXT(tt) ) {
3900: p = BDY((LIST)BDY(tt));
3901: key = BDY((STRING)BDY(p));
3902: /* value = (Obj)BDY(NEXT(p)); */
3903: if ( !strcmp(key,key0) ) {
3904: *r = (Obj)BDY(NEXT(p));
3905: return 1;
3906: }
3907: }
3908: }
3909: return 0;
3910: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to dp.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2018 / builtin