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