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