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