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