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