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