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