Annotation of OpenXM_contrib2/asir2000/builtin/dp.c, Revision 1.101
1.5 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
1.68 noro 9: * conditions of this Agreement. For the avoidance of doubt, you acquire * only a limited right to use the SOFTWARE hereunder, and FLL or any
1.5 noro 10: * third party developer retains all rights, including but not limited to
11: * copyrights, in and to the SOFTWARE.
12: *
13: * (1) FLL does not grant you a license in any way for commercial
14: * purposes. You may use the SOFTWARE only for non-commercial and
15: * non-profit purposes only, such as academic, research and internal
16: * business use.
17: * (2) The SOFTWARE is protected by the Copyright Law of Japan and
18: * international copyright treaties. If you make copies of the SOFTWARE,
19: * with or without modification, as permitted hereunder, you shall affix
20: * to all such copies of the SOFTWARE the above copyright notice.
21: * (3) An explicit reference to this SOFTWARE and its copyright owner
22: * shall be made on your publication or presentation in any form of the
23: * results obtained by use of the SOFTWARE.
24: * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
1.6 noro 25: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.5 noro 26: * for such modification or the source code of the modified part of the
27: * SOFTWARE.
28: *
29: * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
30: * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
31: * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
32: * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
33: * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
34: * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
35: * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
36: * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
37: * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
38: * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
39: * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
40: * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
41: * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
42: * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
43: * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
44: * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
45: * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
46: *
1.101 ! noro 47: * $OpenXM: OpenXM_contrib2/asir2000/builtin/dp.c,v 1.100 2017/02/27 05:14:53 noro Exp $
1.5 noro 48: */
1.1 noro 49: #include "ca.h"
50: #include "base.h"
51: #include "parse.h"
52:
1.61 noro 53: extern int dp_fcoeffs;
1.8 noro 54: extern int dp_nelim;
55: extern int dp_order_pair_length;
56: extern struct order_pair *dp_order_pair;
1.46 noro 57: extern struct order_spec *dp_current_spec;
1.52 noro 58: extern struct modorder_spec *dp_current_modspec;
1.94 noro 59: extern int nd_rref2;
1.8 noro 60:
1.11 noro 61: int do_weyl;
1.1 noro 62:
1.44 noro 63: void Pdp_sort();
1.32 noro 64: void Pdp_mul_trunc(),Pdp_quo();
1.64 noro 65: void Pdp_ord(), Pdp_ptod(), Pdp_dtop(), Phomogenize();
1.1 noro 66: void Pdp_ptozp(), Pdp_ptozp2(), Pdp_red(), Pdp_red2(), Pdp_lcm(), Pdp_redble();
67: void Pdp_sp(), Pdp_hm(), Pdp_ht(), Pdp_hc(), Pdp_rest(), Pdp_td(), Pdp_sugar();
1.30 ohara 68: void Pdp_set_sugar();
1.1 noro 69: void Pdp_cri1(),Pdp_cri2(),Pdp_subd(),Pdp_mod(),Pdp_red_mod(),Pdp_tdiv();
70: void Pdp_prim(),Pdp_red_coef(),Pdp_mag(),Pdp_set_kara(),Pdp_rat();
1.70 noro 71: void Pdp_nf(),Pdp_true_nf(),Pdp_true_nf_marked(),Pdp_true_nf_marked_mod();
1.98 noro 72:
73: void Pdp_true_nf_and_quotient(),Pdp_true_nf_and_quotient_mod();
1.79 noro 74: void Pdp_true_nf_and_quotient_marked(),Pdp_true_nf_and_quotient_marked_mod();
1.98 noro 75:
1.1 noro 76: void Pdp_nf_mod(),Pdp_true_nf_mod();
77: void Pdp_criB(),Pdp_nelim();
1.9 noro 78: void Pdp_minp(),Pdp_sp_mod();
1.1 noro 79: void Pdp_homo(),Pdp_dehomo();
1.16 noro 80: void Pdp_gr_mod_main(),Pdp_gr_f_main();
1.1 noro 81: void Pdp_gr_main(),Pdp_gr_hm_main(),Pdp_gr_d_main(),Pdp_gr_flags();
1.63 noro 82: void Pdp_interreduce();
1.16 noro 83: void Pdp_f4_main(),Pdp_f4_mod_main(),Pdp_f4_f_main();
1.1 noro 84: void Pdp_gr_print();
1.28 noro 85: void Pdp_mbase(),Pdp_lnf_mod(),Pdp_nf_tab_mod(),Pdp_mdtod(), Pdp_nf_tab_f();
1.8 noro 86: void Pdp_vtoe(), Pdp_etov(), Pdp_dtov(), Pdp_idiv(), Pdp_sep();
87: void Pdp_cont();
1.22 noro 88: void Pdp_gr_checklist();
1.52 noro 89: void Pdp_ltod(),Pdpv_ord(),Pdpv_ht(),Pdpv_hm(),Pdpv_hc();
1.1 noro 90:
1.13 noro 91: void Pdp_weyl_red();
92: void Pdp_weyl_sp();
1.98 noro 93:
1.13 noro 94: void Pdp_weyl_nf(),Pdp_weyl_nf_mod();
1.98 noro 95: void Pdp_weyl_true_nf_and_quotient(),Pdp_weyl_true_nf_and_quotient_mod();
96: void Pdp_weyl_true_nf_and_quotient_marked(),Pdp_weyl_true_nf_and_quotient_marked_mod();
97:
1.16 noro 98: void Pdp_weyl_gr_main(),Pdp_weyl_gr_mod_main(),Pdp_weyl_gr_f_main();
99: void Pdp_weyl_f4_main(),Pdp_weyl_f4_mod_main(),Pdp_weyl_f4_f_main();
1.96 noro 100: void Pdp_weyl_mul(),Pdp_weyl_mul_mod(),Pdp_weyl_act();
1.15 noro 101: void Pdp_weyl_set_weight();
1.77 noro 102: void Pdp_set_weight(),Pdp_set_top_weight(),Pdp_set_module_weight();
1.16 noro 103: void Pdp_nf_f(),Pdp_weyl_nf_f();
104: void Pdp_lnf_f();
1.62 noro 105: void Pnd_gr(),Pnd_gr_trace(),Pnd_f4(),Pnd_f4_trace();
1.75 noro 106: void Pnd_gr_postproc(), Pnd_weyl_gr_postproc();
1.89 noro 107: void Pnd_gr_recompute_trace(), Pnd_btog();
1.38 noro 108: void Pnd_weyl_gr(),Pnd_weyl_gr_trace();
1.83 noro 109: void Pnd_nf(),Pnd_weyl_nf();
1.49 noro 110: void Pdp_initial_term();
111: void Pdp_order();
1.66 noro 112: void Pdp_inv_or_split();
1.74 noro 113: void Pdp_compute_last_t();
1.68 noro 114: void Pdp_compute_last_w();
1.70 noro 115: void Pdp_compute_essential_df();
1.72 noro 116: void Pdp_get_denomlist();
1.80 noro 117: void Pdp_symb_add();
1.82 noro 118: void Pdp_mono_raddec();
1.84 noro 119: void Pdp_mono_reduce();
1.95 noro 120: void Pdp_rref2(),Psumi_updatepairs(),Psumi_symbolic();
1.49 noro 121:
122: LIST dp_initial_term();
123: LIST dp_order();
124: void parse_gr_option(LIST f,NODE opt,LIST *v,Num *homo,
125: int *modular,struct order_spec **ord);
1.88 ohara 126: NODE dp_inv_or_split(NODE gb,DP f,struct order_spec *spec, DP *inv);
1.11 noro 127:
1.25 noro 128: LIST remove_zero_from_list(LIST);
129:
1.1 noro 130: struct ftab dp_tab[] = {
1.8 noro 131: /* content reduction */
1.1 noro 132: {"dp_ptozp",Pdp_ptozp,1},
133: {"dp_ptozp2",Pdp_ptozp2,2},
134: {"dp_prim",Pdp_prim,1},
1.8 noro 135: {"dp_red_coef",Pdp_red_coef,2},
136: {"dp_cont",Pdp_cont,1},
137:
1.11 noro 138: /* polynomial ring */
1.32 noro 139: /* special operations */
140: {"dp_mul_trunc",Pdp_mul_trunc,3},
141: {"dp_quo",Pdp_quo,2},
142:
1.8 noro 143: /* s-poly */
144: {"dp_sp",Pdp_sp,2},
145: {"dp_sp_mod",Pdp_sp_mod,3},
146:
147: /* m-reduction */
1.1 noro 148: {"dp_red",Pdp_red,3},
149: {"dp_red_mod",Pdp_red_mod,4},
1.8 noro 150:
151: /* normal form */
1.1 noro 152: {"dp_nf",Pdp_nf,4},
1.98 noro 153: {"dp_nf_mod",Pdp_nf_mod,5},
1.16 noro 154: {"dp_nf_f",Pdp_nf_f,4},
1.98 noro 155:
1.1 noro 156: {"dp_true_nf",Pdp_true_nf,4},
1.98 noro 157: {"dp_true_nf_mod",Pdp_true_nf_mod,5},
1.67 noro 158: {"dp_true_nf_marked",Pdp_true_nf_marked,4},
1.98 noro 159: {"dp_true_nf_marked_mod",Pdp_true_nf_marked_mod,5},
160:
161: {"dp_true_nf_and_quotient",Pdp_true_nf_and_quotient,3},
162: {"dp_true_nf_and_quotient_mod",Pdp_true_nf_and_quotient_mod,4},
1.73 noro 163: {"dp_true_nf_and_quotient_marked",Pdp_true_nf_and_quotient_marked,4},
1.79 noro 164: {"dp_true_nf_and_quotient_marked_mod",Pdp_true_nf_and_quotient_marked_mod,5},
1.98 noro 165:
1.8 noro 166: {"dp_lnf_mod",Pdp_lnf_mod,3},
1.28 noro 167: {"dp_nf_tab_f",Pdp_nf_tab_f,2},
1.8 noro 168: {"dp_nf_tab_mod",Pdp_nf_tab_mod,3},
1.16 noro 169: {"dp_lnf_f",Pdp_lnf_f,2},
1.8 noro 170:
171: /* Buchberger algorithm */
1.46 noro 172: {"dp_gr_main",Pdp_gr_main,-5},
1.63 noro 173: {"dp_interreduce",Pdp_interreduce,3},
1.1 noro 174: {"dp_gr_mod_main",Pdp_gr_mod_main,5},
1.27 noro 175: {"dp_gr_f_main",Pdp_gr_f_main,4},
1.23 noro 176: {"dp_gr_checklist",Pdp_gr_checklist,2},
1.40 noro 177: {"nd_f4",Pnd_f4,4},
1.33 noro 178: {"nd_gr",Pnd_gr,4},
1.36 noro 179: {"nd_gr_trace",Pnd_gr_trace,5},
1.62 noro 180: {"nd_f4_trace",Pnd_f4_trace,5},
1.58 noro 181: {"nd_gr_postproc",Pnd_gr_postproc,5},
1.86 noro 182: {"nd_gr_recompute_trace",Pnd_gr_recompute_trace,5},
1.90 noro 183: {"nd_btog",Pnd_btog,-6},
1.75 noro 184: {"nd_weyl_gr_postproc",Pnd_weyl_gr_postproc,5},
1.38 noro 185: {"nd_weyl_gr",Pnd_weyl_gr,4},
186: {"nd_weyl_gr_trace",Pnd_weyl_gr_trace,5},
1.39 noro 187: {"nd_nf",Pnd_nf,5},
1.83 noro 188: {"nd_weyl_nf",Pnd_weyl_nf,5},
1.8 noro 189:
190: /* F4 algorithm */
1.1 noro 191: {"dp_f4_main",Pdp_f4_main,3},
192: {"dp_f4_mod_main",Pdp_f4_mod_main,4},
1.8 noro 193:
1.11 noro 194: /* weyl algebra */
1.12 noro 195: /* multiplication */
196: {"dp_weyl_mul",Pdp_weyl_mul,2},
1.13 noro 197: {"dp_weyl_mul_mod",Pdp_weyl_mul_mod,3},
1.96 noro 198: {"dp_weyl_act",Pdp_weyl_act,2},
1.12 noro 199:
1.11 noro 200: /* s-poly */
201: {"dp_weyl_sp",Pdp_weyl_sp,2},
202:
203: /* m-reduction */
204: {"dp_weyl_red",Pdp_weyl_red,3},
205:
206: /* normal form */
207: {"dp_weyl_nf",Pdp_weyl_nf,4},
1.13 noro 208: {"dp_weyl_nf_mod",Pdp_weyl_nf_mod,5},
1.16 noro 209: {"dp_weyl_nf_f",Pdp_weyl_nf_f,4},
1.11 noro 210:
1.98 noro 211: {"dp_weyl_true_nf_and_quotient",Pdp_weyl_true_nf_and_quotient,3},
212: {"dp_weyl_true_nf_and_quotient_mod",Pdp_weyl_true_nf_and_quotient_mod,4},
213: {"dp_weyl_true_nf_and_quotient_marked",Pdp_weyl_true_nf_and_quotient_marked,4},
214: {"dp_weyl_true_nf_and_quotient_marked_mod",Pdp_weyl_true_nf_and_quotient_marked_mod,5},
215:
216:
1.11 noro 217: /* Buchberger algorithm */
1.50 noro 218: {"dp_weyl_gr_main",Pdp_weyl_gr_main,-5},
1.11 noro 219: {"dp_weyl_gr_mod_main",Pdp_weyl_gr_mod_main,5},
1.16 noro 220: {"dp_weyl_gr_f_main",Pdp_weyl_gr_f_main,4},
1.11 noro 221:
222: /* F4 algorithm */
223: {"dp_weyl_f4_main",Pdp_weyl_f4_main,3},
1.19 noro 224: {"dp_weyl_f4_mod_main",Pdp_weyl_f4_mod_main,4},
1.11 noro 225:
1.15 noro 226: /* misc */
1.66 noro 227: {"dp_inv_or_split",Pdp_inv_or_split,3},
1.24 noro 228: {"dp_set_weight",Pdp_set_weight,-1},
1.77 noro 229: {"dp_set_module_weight",Pdp_set_module_weight,-1},
1.71 noro 230: {"dp_set_top_weight",Pdp_set_top_weight,-1},
1.15 noro 231: {"dp_weyl_set_weight",Pdp_weyl_set_weight,-1},
1.72 noro 232:
233: {"dp_get_denomlist",Pdp_get_denomlist,0},
1.8 noro 234: {0,0,0},
235: };
236:
237: struct ftab dp_supp_tab[] = {
238: /* setting flags */
1.44 noro 239: {"dp_sort",Pdp_sort,1},
1.8 noro 240: {"dp_ord",Pdp_ord,-1},
1.52 noro 241: {"dpv_ord",Pdpv_ord,-2},
1.8 noro 242: {"dp_set_kara",Pdp_set_kara,-1},
243: {"dp_nelim",Pdp_nelim,-1},
1.1 noro 244: {"dp_gr_flags",Pdp_gr_flags,-1},
245: {"dp_gr_print",Pdp_gr_print,-1},
1.8 noro 246:
247: /* converters */
1.64 noro 248: {"homogenize",Phomogenize,3},
1.53 noro 249: {"dp_ptod",Pdp_ptod,-2},
1.8 noro 250: {"dp_dtop",Pdp_dtop,2},
251: {"dp_homo",Pdp_homo,1},
252: {"dp_dehomo",Pdp_dehomo,1},
253: {"dp_etov",Pdp_etov,1},
254: {"dp_vtoe",Pdp_vtoe,1},
255: {"dp_dtov",Pdp_dtov,1},
256: {"dp_mdtod",Pdp_mdtod,1},
257: {"dp_mod",Pdp_mod,3},
258: {"dp_rat",Pdp_rat,1},
1.53 noro 259: {"dp_ltod",Pdp_ltod,-2},
1.8 noro 260:
261: /* criteria */
262: {"dp_cri1",Pdp_cri1,2},
263: {"dp_cri2",Pdp_cri2,2},
264: {"dp_criB",Pdp_criB,3},
265:
266: /* simple operation */
267: {"dp_subd",Pdp_subd,2},
268: {"dp_lcm",Pdp_lcm,2},
269: {"dp_hm",Pdp_hm,1},
270: {"dp_ht",Pdp_ht,1},
271: {"dp_hc",Pdp_hc,1},
1.52 noro 272: {"dpv_hm",Pdpv_hm,1},
273: {"dpv_ht",Pdpv_ht,1},
274: {"dpv_hc",Pdpv_hc,1},
1.8 noro 275: {"dp_rest",Pdp_rest,1},
1.49 noro 276: {"dp_initial_term",Pdp_initial_term,1},
277: {"dp_order",Pdp_order,1},
1.80 noro 278: {"dp_symb_add",Pdp_symb_add,2},
1.8 noro 279:
280: /* degree and size */
281: {"dp_td",Pdp_td,1},
282: {"dp_mag",Pdp_mag,1},
283: {"dp_sugar",Pdp_sugar,1},
1.30 ohara 284: {"dp_set_sugar",Pdp_set_sugar,2},
1.8 noro 285:
286: /* misc */
287: {"dp_mbase",Pdp_mbase,1},
288: {"dp_redble",Pdp_redble,2},
289: {"dp_sep",Pdp_sep,2},
290: {"dp_idiv",Pdp_idiv,2},
291: {"dp_tdiv",Pdp_tdiv,2},
292: {"dp_minp",Pdp_minp,2},
1.68 noro 293: {"dp_compute_last_w",Pdp_compute_last_w,5},
1.74 noro 294: {"dp_compute_last_t",Pdp_compute_last_t,5},
1.70 noro 295: {"dp_compute_essential_df",Pdp_compute_essential_df,2},
1.82 noro 296: {"dp_mono_raddec",Pdp_mono_raddec,2},
1.84 noro 297: {"dp_mono_reduce",Pdp_mono_reduce,2},
1.8 noro 298:
1.94 noro 299: {"dp_rref2",Pdp_rref2,2},
1.95 noro 300: {"sumi_updatepairs",Psumi_updatepairs,3},
301: {"sumi_symbolic",Psumi_symbolic,5},
1.94 noro 302:
1.8 noro 303: {0,0,0}
1.1 noro 304: };
1.44 noro 305:
1.68 noro 306: NODE compute_last_w(NODE g,NODE gh,int n,int **v,int row1,int **m1,int row2,int **m2);
1.74 noro 307: Q compute_last_t(NODE g,NODE gh,Q t,VECT w1,VECT w2,NODE *homo,VECT *wp);
308:
309: void Pdp_compute_last_t(NODE arg,LIST *rp)
310: {
311: NODE g,gh,homo,n;
312: LIST hlist;
313: VECT v1,v2,w;
314: Q t;
315:
316: g = (NODE)BDY((LIST)ARG0(arg));
317: gh = (NODE)BDY((LIST)ARG1(arg));
318: t = (Q)ARG2(arg);
319: v1 = (VECT)ARG3(arg);
320: v2 = (VECT)ARG4(arg);
321: t = compute_last_t(g,gh,t,v1,v2,&homo,&w);
322: MKLIST(hlist,homo);
323: n = mknode(3,t,w,hlist);
324: MKLIST(*rp,n);
325: }
1.68 noro 326:
327: void Pdp_compute_last_w(NODE arg,LIST *rp)
328: {
329: NODE g,gh,r;
330: VECT w,rv;
331: LIST l;
332: MAT w1,w2;
333: int row1,row2,i,j,n;
334: int *v;
335: int **m1,**m2;
336: Q q;
337:
338: g = (NODE)BDY((LIST)ARG0(arg));
339: gh = (NODE)BDY((LIST)ARG1(arg));
340: w = (VECT)ARG2(arg);
341: w1 = (MAT)ARG3(arg);
342: w2 = (MAT)ARG4(arg);
343: n = w1->col;
344: row1 = w1->row;
345: row2 = w2->row;
346: if ( w ) {
347: v = W_ALLOC(n);
348: for ( i = 0; i < n; i++ ) v[i] = QTOS((Q)w->body[i]);
349: } else v = 0;
350: m1 = almat(row1,n);
351: for ( i = 0; i < row1; i++ )
352: for ( j = 0; j < n; j++ ) m1[i][j] = QTOS((Q)w1->body[i][j]);
353: m2 = almat(row2,n);
354: for ( i = 0; i < row2; i++ )
355: for ( j = 0; j < n; j++ ) m2[i][j] = QTOS((Q)w2->body[i][j]);
356: r = compute_last_w(g,gh,n,&v,row1,m1,row2,m2);
357: if ( !r ) *rp = 0;
358: else {
359: MKVECT(rv,n);
360: for ( i = 0; i < n; i++ ) {
361: STOQ(v[i],q); rv->body[i] = (pointer)q;
362: }
363: MKLIST(l,r);
364: r = mknode(2,rv,l);
365: MKLIST(*rp,r);
366: }
367: }
368:
1.70 noro 369: NODE compute_essential_df(DP *g,DP *gh,int n);
370:
371: void Pdp_compute_essential_df(NODE arg,LIST *rp)
372: {
373: VECT g,gh;
374: NODE r;
375:
376: g = (VECT)ARG0(arg);
377: gh = (VECT)ARG1(arg);
378: r = (NODE)compute_essential_df((DP *)BDY(g),(DP *)BDY(gh),g->len);
379: MKLIST(*rp,r);
380: }
381:
1.97 noro 382: void Pdp_inv_or_split(NODE arg,Obj *rp)
1.66 noro 383: {
384: NODE gb,newgb;
385: DP f,inv;
386: struct order_spec *spec;
387: LIST list;
388:
389: do_weyl = 0; dp_fcoeffs = 0;
390: asir_assert(ARG0(arg),O_LIST,"dp_inv_or_split");
391: asir_assert(ARG1(arg),O_DP,"dp_inv_or_split");
392: if ( !create_order_spec(0,(Obj)ARG2(arg),&spec) )
393: error("dp_inv_or_split : invalid order specification");
394: gb = BDY((LIST)ARG0(arg));
395: f = (DP)ARG1(arg);
396: newgb = (NODE)dp_inv_or_split(gb,f,spec,&inv);
397: if ( !newgb ) {
398: /* invertible */
399: *rp = (Obj)inv;
400: } else {
401: MKLIST(list,newgb);
402: *rp = (Obj)list;
403: }
404: }
405:
1.97 noro 406: void Pdp_sort(NODE arg,DP *rp)
1.44 noro 407: {
408: dp_sort((DP)ARG0(arg),rp);
409: }
1.1 noro 410:
1.97 noro 411: void Pdp_mdtod(NODE arg,DP *rp)
1.8 noro 412: {
413: MP m,mr,mr0;
414: DP p;
415: P t;
416:
417: p = (DP)ARG0(arg);
418: if ( !p )
419: *rp = 0;
420: else {
421: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
422: mptop(m->c,&t); NEXTMP(mr0,mr); mr->c = t; mr->dl = m->dl;
423: }
424: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
425: }
426: }
427:
1.97 noro 428: void Pdp_sep(NODE arg,VECT *rp)
1.8 noro 429: {
430: DP p,r;
431: MP m,t;
432: MP *w0,*w;
433: int i,n,d,nv,sugar;
434: VECT v;
435: pointer *pv;
436:
437: p = (DP)ARG0(arg); m = BDY(p);
438: d = QTOS((Q)ARG1(arg));
439: for ( t = m, n = 0; t; t = NEXT(t), n++ );
440: if ( d > n )
441: d = n;
442: MKVECT(v,d); *rp = v;
443: pv = BDY(v); nv = p->nv; sugar = p->sugar;
444: w0 = (MP *)MALLOC(d*sizeof(MP)); bzero(w0,d*sizeof(MP));
445: w = (MP *)MALLOC(d*sizeof(MP)); bzero(w,d*sizeof(MP));
446: for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, i %= d ) {
447: NEXTMP(w0[i],w[i]); w[i]->c = t->c; w[i]->dl = t->dl;
448: }
449: for ( i = 0; i < d; i++ ) {
450: NEXT(w[i]) = 0; MKDP(nv,w0[i],r); r->sugar = sugar;
451: pv[i] = (pointer)r;
452: }
453: }
454:
1.97 noro 455: void Pdp_idiv(NODE arg,DP *rp)
1.8 noro 456: {
457: dp_idiv((DP)ARG0(arg),(Q)ARG1(arg),rp);
458: }
459:
1.97 noro 460: void Pdp_cont(NODE arg,Q *rp)
1.8 noro 461: {
462: dp_cont((DP)ARG0(arg),rp);
463: }
464:
1.97 noro 465: void Pdp_dtov(NODE arg,VECT *rp)
1.8 noro 466: {
467: dp_dtov((DP)ARG0(arg),rp);
468: }
469:
1.97 noro 470: void Pdp_mbase(NODE arg,LIST *rp)
1.8 noro 471: {
472: NODE mb;
473:
474: asir_assert(ARG0(arg),O_LIST,"dp_mbase");
475: dp_mbase(BDY((LIST)ARG0(arg)),&mb);
476: MKLIST(*rp,mb);
477: }
478:
1.97 noro 479: void Pdp_etov(NODE arg,VECT *rp)
1.8 noro 480: {
481: DP dp;
482: int n,i;
483: int *d;
484: VECT v;
485: Q t;
486:
487: dp = (DP)ARG0(arg);
488: asir_assert(dp,O_DP,"dp_etov");
489: n = dp->nv; d = BDY(dp)->dl->d;
490: MKVECT(v,n);
491: for ( i = 0; i < n; i++ ) {
492: STOQ(d[i],t); v->body[i] = (pointer)t;
493: }
494: *rp = v;
495: }
496:
1.97 noro 497: void Pdp_vtoe(NODE arg,DP *rp)
1.8 noro 498: {
499: DP dp;
500: DL dl;
501: MP m;
502: int n,i,td;
503: int *d;
504: VECT v;
505:
506: v = (VECT)ARG0(arg);
507: asir_assert(v,O_VECT,"dp_vtoe");
508: n = v->len;
509: NEWDL(dl,n); d = dl->d;
510: for ( i = 0, td = 0; i < n; i++ ) {
1.24 noro 511: d[i] = QTOS((Q)(v->body[i])); td += MUL_WEIGHT(d[i],i);
1.8 noro 512: }
513: dl->td = td;
514: NEWMP(m); m->dl = dl; m->c = (P)ONE; NEXT(m) = 0;
515: MKDP(n,m,dp); dp->sugar = td;
516: *rp = dp;
517: }
518:
1.97 noro 519: void Pdp_lnf_mod(NODE arg,LIST *rp)
1.8 noro 520: {
521: DP r1,r2;
522: NODE b,g,n;
523: int mod;
524:
525: asir_assert(ARG0(arg),O_LIST,"dp_lnf_mod");
526: asir_assert(ARG1(arg),O_LIST,"dp_lnf_mod");
527: asir_assert(ARG2(arg),O_N,"dp_lnf_mod");
528: b = BDY((LIST)ARG0(arg)); g = BDY((LIST)ARG1(arg));
529: mod = QTOS((Q)ARG2(arg));
530: dp_lnf_mod((DP)BDY(b),(DP)BDY(NEXT(b)),g,mod,&r1,&r2);
531: NEWNODE(n); BDY(n) = (pointer)r1;
532: NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)r2;
533: NEXT(NEXT(n)) = 0; MKLIST(*rp,n);
534: }
535:
1.97 noro 536: void Pdp_lnf_f(NODE arg,LIST *rp)
1.16 noro 537: {
538: DP r1,r2;
539: NODE b,g,n;
540:
541: asir_assert(ARG0(arg),O_LIST,"dp_lnf_f");
542: asir_assert(ARG1(arg),O_LIST,"dp_lnf_f");
543: b = BDY((LIST)ARG0(arg)); g = BDY((LIST)ARG1(arg));
544: dp_lnf_f((DP)BDY(b),(DP)BDY(NEXT(b)),g,&r1,&r2);
545: NEWNODE(n); BDY(n) = (pointer)r1;
546: NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)r2;
547: NEXT(NEXT(n)) = 0; MKLIST(*rp,n);
548: }
549:
1.97 noro 550: void Pdp_nf_tab_mod(NODE arg,DP *rp)
1.8 noro 551: {
552: asir_assert(ARG0(arg),O_DP,"dp_nf_tab_mod");
553: asir_assert(ARG1(arg),O_VECT,"dp_nf_tab_mod");
554: asir_assert(ARG2(arg),O_N,"dp_nf_tab_mod");
555: dp_nf_tab_mod((DP)ARG0(arg),(LIST *)BDY((VECT)ARG1(arg)),
556: QTOS((Q)ARG2(arg)),rp);
1.28 noro 557: }
558:
1.97 noro 559: void Pdp_nf_tab_f(NODE arg,DP *rp)
1.28 noro 560: {
561: asir_assert(ARG0(arg),O_DP,"dp_nf_tab_f");
562: asir_assert(ARG1(arg),O_VECT,"dp_nf_tab_f");
563: dp_nf_tab_f((DP)ARG0(arg),(LIST *)BDY((VECT)ARG1(arg)),rp);
1.8 noro 564: }
1.1 noro 565:
1.97 noro 566: void Pdp_ord(NODE arg,Obj *rp)
1.1 noro 567: {
1.46 noro 568: struct order_spec *spec;
1.51 noro 569: LIST v;
570: struct oLIST f;
571: Num homo;
572: int modular;
573:
574: f.id = O_LIST; f.body = 0;
1.59 noro 575: if ( !arg && !current_option )
1.46 noro 576: *rp = dp_current_spec->obj;
1.1 noro 577: else {
1.53 noro 578: if ( current_option )
579: parse_gr_option(&f,current_option,&v,&homo,&modular,&spec);
1.51 noro 580: else if ( !create_order_spec(0,(Obj)ARG0(arg),&spec) )
581: error("dp_ord : invalid order specification");
1.46 noro 582: initd(spec); *rp = spec->obj;
1.1 noro 583: }
584: }
585:
1.97 noro 586: void Pdp_ptod(NODE arg,DP *rp)
1.1 noro 587: {
1.53 noro 588: P p;
1.1 noro 589: NODE n;
590: VL vl,tvl;
1.53 noro 591: struct oLIST f;
592: int ac;
593: LIST v;
594: Num homo;
595: int modular;
596: struct order_spec *ord;
1.1 noro 597:
598: asir_assert(ARG0(arg),O_P,"dp_ptod");
1.53 noro 599: p = (P)ARG0(arg);
600: ac = argc(arg);
601: if ( ac == 1 ) {
602: if ( current_option ) {
603: f.id = O_LIST; f.body = mknode(1,p);
604: parse_gr_option(&f,current_option,&v,&homo,&modular,&ord);
1.54 noro 605: initd(ord);
1.53 noro 606: } else
607: error("dp_ptod : invalid argument");
608: } else {
609: asir_assert(ARG1(arg),O_LIST,"dp_ptod");
610: v = (LIST)ARG1(arg);
611: }
612: for ( vl = 0, n = BDY(v); n; n = NEXT(n) ) {
1.1 noro 613: if ( !vl ) {
614: NEWVL(vl); tvl = vl;
615: } else {
616: NEWVL(NEXT(tvl)); tvl = NEXT(tvl);
617: }
618: VR(tvl) = VR((P)BDY(n));
619: }
620: if ( vl )
621: NEXT(tvl) = 0;
1.53 noro 622: ptod(CO,vl,p,rp);
1.64 noro 623: }
624:
1.97 noro 625: void Phomogenize(NODE arg,P *rp)
1.64 noro 626: {
627: P p;
628: DP d,h;
629: NODE n;
630: V hv;
631: VL vl,tvl,last;
632: struct oLIST f;
633: LIST v;
634:
635: asir_assert(ARG0(arg),O_P,"homogenize");
636: p = (P)ARG0(arg);
637: asir_assert(ARG1(arg),O_LIST,"homogenize");
638: v = (LIST)ARG1(arg);
639: asir_assert(ARG2(arg),O_P,"homogenize");
640: hv = VR((P)ARG2(arg));
641: for ( vl = 0, n = BDY(v); n; n = NEXT(n) ) {
642: if ( !vl ) {
643: NEWVL(vl); tvl = vl;
644: } else {
645: NEWVL(NEXT(tvl)); tvl = NEXT(tvl);
646: }
647: VR(tvl) = VR((P)BDY(n));
648: }
649: if ( vl ) {
650: last = tvl;
651: NEXT(tvl) = 0;
652: }
653: ptod(CO,vl,p,&d);
654: dp_homo(d,&h);
655: NEWVL(NEXT(last)); last = NEXT(last);
656: VR(last) = hv; NEXT(last) = 0;
657: dtop(CO,vl,h,rp);
1.1 noro 658: }
659:
1.97 noro 660: void Pdp_ltod(NODE arg,DPV *rp)
1.52 noro 661: {
662: NODE n;
663: VL vl,tvl;
1.53 noro 664: LIST f,v;
665: int sugar,i,len,ac,modular;
666: Num homo;
667: struct order_spec *ord;
1.52 noro 668: DP *e;
669: NODE nd,t;
670:
1.53 noro 671: ac = argc(arg);
1.52 noro 672: asir_assert(ARG0(arg),O_LIST,"dp_ptod");
1.53 noro 673: f = (LIST)ARG0(arg);
674: if ( ac == 1 ) {
675: if ( current_option ) {
676: parse_gr_option(f,current_option,&v,&homo,&modular,&ord);
1.54 noro 677: initd(ord);
1.53 noro 678: } else
679: error("dp_ltod : invalid argument");
680: } else {
681: asir_assert(ARG1(arg),O_LIST,"dp_ptod");
682: v = (LIST)ARG1(arg);
683: }
684: for ( vl = 0, n = BDY(v); n; n = NEXT(n) ) {
1.52 noro 685: if ( !vl ) {
686: NEWVL(vl); tvl = vl;
687: } else {
688: NEWVL(NEXT(tvl)); tvl = NEXT(tvl);
689: }
690: VR(tvl) = VR((P)BDY(n));
691: }
692: if ( vl )
693: NEXT(tvl) = 0;
1.53 noro 694:
695: nd = BDY(f);
1.52 noro 696: len = length(nd);
697: e = (DP *)MALLOC(len*sizeof(DP));
698: sugar = 0;
699: for ( i = 0, t = nd; i < len; i++, t = NEXT(t) ) {
700: ptod(CO,vl,(P)BDY(t),&e[i]);
701: if ( e[i] )
702: sugar = MAX(sugar,e[i]->sugar);
703: }
704: MKDPV(len,e,*rp);
705: }
706:
1.97 noro 707: void Pdp_dtop(NODE arg,P *rp)
1.1 noro 708: {
709: NODE n;
710: VL vl,tvl;
711:
712: asir_assert(ARG0(arg),O_DP,"dp_dtop");
713: asir_assert(ARG1(arg),O_LIST,"dp_dtop");
714: for ( vl = 0, n = BDY((LIST)ARG1(arg)); n; n = NEXT(n) ) {
715: if ( !vl ) {
716: NEWVL(vl); tvl = vl;
717: } else {
718: NEWVL(NEXT(tvl)); tvl = NEXT(tvl);
719: }
720: VR(tvl) = VR((P)BDY(n));
721: }
722: if ( vl )
723: NEXT(tvl) = 0;
724: dtop(CO,vl,(DP)ARG0(arg),rp);
725: }
726:
727: extern LIST Dist;
728:
1.97 noro 729: void Pdp_ptozp(NODE arg,Obj *rp)
1.1 noro 730: {
1.60 ohara 731: Q t;
732: NODE tt,p;
733: NODE n,n0;
734: char *key;
735: DP pp;
736: LIST list;
737: int get_factor=0;
738:
1.1 noro 739: asir_assert(ARG0(arg),O_DP,"dp_ptozp");
1.60 ohara 740:
741: /* analyze the option */
742: if ( current_option ) {
743: for ( tt = current_option; tt; tt = NEXT(tt) ) {
744: p = BDY((LIST)BDY(tt));
745: key = BDY((STRING)BDY(p));
746: /* value = (Obj)BDY(NEXT(p)); */
747: if ( !strcmp(key,"factor") ) get_factor=1;
748: else {
749: error("ptozp: unknown option.");
750: }
751: }
752: }
753:
754: dp_ptozp3((DP)ARG0(arg),&t,&pp);
755:
756: /* printexpr(NULL,t); */
757: /* if the option factor is given, then it returns the answer
758: in the format [zpoly, num] where num*zpoly is equal to the argument.*/
759: if (get_factor) {
760: n0 = mknode(2,pp,t);
761: MKLIST(list,n0);
762: *rp = (Obj)list;
763: } else
764: *rp = (Obj)pp;
1.1 noro 765: }
766:
1.97 noro 767: void Pdp_ptozp2(NODE arg,LIST *rp)
1.1 noro 768: {
769: DP p0,p1,h,r;
770: NODE n0;
771:
772: p0 = (DP)ARG0(arg); p1 = (DP)ARG1(arg);
773: asir_assert(p0,O_DP,"dp_ptozp2");
774: asir_assert(p1,O_DP,"dp_ptozp2");
1.10 noro 775: dp_ptozp2(p0,p1,&h,&r);
1.1 noro 776: NEWNODE(n0); BDY(n0) = (pointer)h;
777: NEWNODE(NEXT(n0)); BDY(NEXT(n0)) = (pointer)r;
778: NEXT(NEXT(n0)) = 0;
779: MKLIST(*rp,n0);
780: }
781:
1.97 noro 782: void Pdp_prim(NODE arg,DP *rp)
1.1 noro 783: {
784: DP t;
785:
786: asir_assert(ARG0(arg),O_DP,"dp_prim");
787: dp_prim((DP)ARG0(arg),&t); dp_ptozp(t,rp);
788: }
789:
1.97 noro 790: void Pdp_mod(NODE arg,DP *rp)
1.1 noro 791: {
792: DP p;
793: int mod;
794: NODE subst;
795:
796: asir_assert(ARG0(arg),O_DP,"dp_mod");
797: asir_assert(ARG1(arg),O_N,"dp_mod");
798: asir_assert(ARG2(arg),O_LIST,"dp_mod");
799: p = (DP)ARG0(arg); mod = QTOS((Q)ARG1(arg));
800: subst = BDY((LIST)ARG2(arg));
801: dp_mod(p,mod,subst,rp);
802: }
803:
1.97 noro 804: void Pdp_rat(NODE arg,DP *rp)
1.1 noro 805: {
806: asir_assert(ARG0(arg),O_DP,"dp_rat");
807: dp_rat((DP)ARG0(arg),rp);
808: }
809:
1.9 noro 810: extern int DP_Multiple;
811:
1.97 noro 812: void Pdp_nf(NODE arg,DP *rp)
1.1 noro 813: {
814: NODE b;
815: DP *ps;
816: DP g;
817: int full;
818:
1.61 noro 819: do_weyl = 0; dp_fcoeffs = 0;
1.1 noro 820: asir_assert(ARG0(arg),O_LIST,"dp_nf");
821: asir_assert(ARG1(arg),O_DP,"dp_nf");
822: asir_assert(ARG2(arg),O_VECT,"dp_nf");
823: asir_assert(ARG3(arg),O_N,"dp_nf");
824: if ( !(g = (DP)ARG1(arg)) ) {
825: *rp = 0; return;
826: }
827: b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg));
828: full = (Q)ARG3(arg) ? 1 : 0;
1.16 noro 829: dp_nf_z(b,g,ps,full,DP_Multiple,rp);
1.1 noro 830: }
831:
1.97 noro 832: void Pdp_weyl_nf(NODE arg,DP *rp)
1.11 noro 833: {
834: NODE b;
835: DP *ps;
836: DP g;
837: int full;
838:
839: asir_assert(ARG0(arg),O_LIST,"dp_weyl_nf");
840: asir_assert(ARG1(arg),O_DP,"dp_weyl_nf");
841: asir_assert(ARG2(arg),O_VECT,"dp_weyl_nf");
842: asir_assert(ARG3(arg),O_N,"dp_weyl_nf");
843: if ( !(g = (DP)ARG1(arg)) ) {
844: *rp = 0; return;
845: }
846: b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg));
847: full = (Q)ARG3(arg) ? 1 : 0;
1.12 noro 848: do_weyl = 1;
1.16 noro 849: dp_nf_z(b,g,ps,full,DP_Multiple,rp);
850: do_weyl = 0;
851: }
852:
853: /* nf computation using field operations */
854:
1.97 noro 855: void Pdp_nf_f(NODE arg,DP *rp)
1.16 noro 856: {
857: NODE b;
858: DP *ps;
859: DP g;
860: int full;
861:
862: do_weyl = 0;
863: asir_assert(ARG0(arg),O_LIST,"dp_nf_f");
864: asir_assert(ARG1(arg),O_DP,"dp_nf_f");
865: asir_assert(ARG2(arg),O_VECT,"dp_nf_f");
866: asir_assert(ARG3(arg),O_N,"dp_nf_f");
867: if ( !(g = (DP)ARG1(arg)) ) {
868: *rp = 0; return;
869: }
870: b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg));
871: full = (Q)ARG3(arg) ? 1 : 0;
872: dp_nf_f(b,g,ps,full,rp);
873: }
874:
1.97 noro 875: void Pdp_weyl_nf_f(NODE arg,DP *rp)
1.16 noro 876: {
877: NODE b;
878: DP *ps;
879: DP g;
880: int full;
881:
882: asir_assert(ARG0(arg),O_LIST,"dp_weyl_nf_f");
883: asir_assert(ARG1(arg),O_DP,"dp_weyl_nf_f");
884: asir_assert(ARG2(arg),O_VECT,"dp_weyl_nf_f");
885: asir_assert(ARG3(arg),O_N,"dp_weyl_nf_f");
886: if ( !(g = (DP)ARG1(arg)) ) {
887: *rp = 0; return;
888: }
889: b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg));
890: full = (Q)ARG3(arg) ? 1 : 0;
891: do_weyl = 1;
892: dp_nf_f(b,g,ps,full,rp);
1.12 noro 893: do_weyl = 0;
1.11 noro 894: }
895:
1.97 noro 896: void Pdp_nf_mod(NODE arg,DP *rp)
1.13 noro 897: {
898: NODE b;
899: DP g;
900: DP *ps;
901: int mod,full,ac;
902: NODE n,n0;
903:
1.14 noro 904: do_weyl = 0;
1.13 noro 905: ac = argc(arg);
1.14 noro 906: asir_assert(ARG0(arg),O_LIST,"dp_nf_mod");
907: asir_assert(ARG1(arg),O_DP,"dp_nf_mod");
908: asir_assert(ARG2(arg),O_VECT,"dp_nf_mod");
909: asir_assert(ARG3(arg),O_N,"dp_nf_mod");
910: asir_assert(ARG4(arg),O_N,"dp_nf_mod");
1.13 noro 911: if ( !(g = (DP)ARG1(arg)) ) {
912: *rp = 0; return;
913: }
914: b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg));
915: full = QTOS((Q)ARG3(arg)); mod = QTOS((Q)ARG4(arg));
916: for ( n0 = n = 0; b; b = NEXT(b) ) {
917: NEXTNODE(n0,n);
918: BDY(n) = (pointer)QTOS((Q)BDY(b));
919: }
920: if ( n0 )
921: NEXT(n) = 0;
922: dp_nf_mod(n0,g,ps,mod,full,rp);
923: }
924:
1.97 noro 925: void Pdp_true_nf(NODE arg,LIST *rp)
1.1 noro 926: {
927: NODE b,n;
928: DP *ps;
929: DP g;
930: DP nm;
931: P dn;
932: int full;
933:
1.61 noro 934: do_weyl = 0; dp_fcoeffs = 0;
1.1 noro 935: asir_assert(ARG0(arg),O_LIST,"dp_true_nf");
936: asir_assert(ARG1(arg),O_DP,"dp_true_nf");
937: asir_assert(ARG2(arg),O_VECT,"dp_true_nf");
938: asir_assert(ARG3(arg),O_N,"dp_nf");
939: if ( !(g = (DP)ARG1(arg)) ) {
940: nm = 0; dn = (P)ONE;
941: } else {
942: b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg));
943: full = (Q)ARG3(arg) ? 1 : 0;
944: dp_true_nf(b,g,ps,full,&nm,&dn);
945: }
946: NEWNODE(n); BDY(n) = (pointer)nm;
947: NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)dn;
948: NEXT(NEXT(n)) = 0; MKLIST(*rp,n);
949: }
950:
1.98 noro 951: DP *dp_true_nf_and_quotient_marked(NODE b,DP g,DP *ps,DP *hps,DP *rp,P *dnp);
1.73 noro 952:
1.97 noro 953: void Pdp_true_nf_and_quotient_marked(NODE arg,LIST *rp)
1.73 noro 954: {
955: NODE b,n;
956: DP *ps,*hps;
957: DP g;
958: DP nm;
959: VECT quo;
960: P dn;
961: int full;
962:
963: do_weyl = 0; dp_fcoeffs = 0;
964: asir_assert(ARG0(arg),O_LIST,"dp_true_nf_and_quotient_marked");
965: asir_assert(ARG1(arg),O_DP,"dp_true_nf_and_quotient_marked");
966: asir_assert(ARG2(arg),O_VECT,"dp_true_nf_and_quotient_marked");
967: asir_assert(ARG3(arg),O_VECT,"dp_true_nf_and_quotient_marked");
968: if ( !(g = (DP)ARG1(arg)) ) {
969: nm = 0; dn = (P)ONE;
970: } else {
971: b = BDY((LIST)ARG0(arg));
972: ps = (DP *)BDY((VECT)ARG2(arg));
973: hps = (DP *)BDY((VECT)ARG3(arg));
974: NEWVECT(quo); quo->len = ((VECT)ARG2(arg))->len;
975: quo->body = (pointer *)dp_true_nf_and_quotient_marked(b,g,ps,hps,&nm,&dn);
976: }
977: n = mknode(3,nm,dn,quo);
978: MKLIST(*rp,n);
979: }
980:
1.98 noro 981: void Pdp_true_nf_and_quotient(NODE arg,LIST *rp)
982: {
983: NODE narg = mknode(4,ARG0(arg),ARG1(arg),ARG2(arg),ARG2(arg));
984: Pdp_true_nf_and_quotient_marked(narg,rp);
985: }
986:
987:
1.79 noro 988: DP *dp_true_nf_and_quotient_marked_mod (NODE b,DP g,DP *ps,DP *hps,int mod,DP *rp,P *dnp);
989:
1.97 noro 990: void Pdp_true_nf_and_quotient_marked_mod(NODE arg,LIST *rp)
1.79 noro 991: {
992: NODE b,n;
993: DP *ps,*hps;
994: DP g;
995: DP nm;
996: VECT quo;
997: P dn;
998: int full,mod;
999:
1000: do_weyl = 0; dp_fcoeffs = 0;
1001: asir_assert(ARG0(arg),O_LIST,"dp_true_nf_and_quotient_marked_mod");
1002: asir_assert(ARG1(arg),O_DP,"dp_true_nf_and_quotient_marked_mod");
1003: asir_assert(ARG2(arg),O_VECT,"dp_true_nf_and_quotient_marked_mod");
1004: asir_assert(ARG3(arg),O_VECT,"dp_true_nf_and_quotient_marked_mod");
1005: asir_assert(ARG4(arg),O_N,"dp_true_nf_and_quotient_marked_mod");
1006: if ( !(g = (DP)ARG1(arg)) ) {
1007: nm = 0; dn = (P)ONE;
1008: } else {
1009: b = BDY((LIST)ARG0(arg));
1010: ps = (DP *)BDY((VECT)ARG2(arg));
1011: hps = (DP *)BDY((VECT)ARG3(arg));
1012: mod = QTOS((Q)ARG4(arg));
1013: NEWVECT(quo); quo->len = ((VECT)ARG2(arg))->len;
1014: quo->body = (pointer *)dp_true_nf_and_quotient_marked_mod(b,g,ps,hps,mod,&nm,&dn);
1015: }
1016: n = mknode(3,nm,dn,quo);
1017: MKLIST(*rp,n);
1018: }
1019:
1.98 noro 1020: void Pdp_true_nf_and_quotient_mod(NODE arg,LIST *rp)
1021: {
1022: NODE narg = mknode(5,ARG0(arg),ARG1(arg),ARG2(arg),ARG2(arg),ARG3(arg));
1023: Pdp_true_nf_and_quotient_marked_mod(narg,rp);
1024: }
1025:
1.97 noro 1026: void Pdp_true_nf_marked(NODE arg,LIST *rp)
1027: {
1028: NODE b,n;
1029: DP *ps,*hps;
1030: DP g;
1031: DP nm;
1032: Q cont;
1033: P dn;
1034: int full;
1035:
1036: do_weyl = 0; dp_fcoeffs = 0;
1037: asir_assert(ARG0(arg),O_LIST,"dp_true_nf_marked");
1038: asir_assert(ARG1(arg),O_DP,"dp_true_nf_marked");
1039: asir_assert(ARG2(arg),O_VECT,"dp_true_nf_marked");
1040: asir_assert(ARG3(arg),O_VECT,"dp_true_nf_marked");
1041: if ( !(g = (DP)ARG1(arg)) ) {
1042: nm = 0; dn = (P)ONE;
1043: } else {
1044: b = BDY((LIST)ARG0(arg));
1045: ps = (DP *)BDY((VECT)ARG2(arg));
1046: hps = (DP *)BDY((VECT)ARG3(arg));
1047: dp_true_nf_marked(b,g,ps,hps,&nm,&cont,&dn);
1048: }
1049: n = mknode(3,nm,cont,dn);
1050: MKLIST(*rp,n);
1051: }
1052:
1053: void Pdp_true_nf_marked_mod(NODE arg,LIST *rp)
1.70 noro 1054: {
1055: NODE b,n;
1056: DP *ps,*hps;
1057: DP g;
1058: DP nm;
1059: P dn;
1060: int mod;
1061:
1062: do_weyl = 0; dp_fcoeffs = 0;
1063: asir_assert(ARG0(arg),O_LIST,"dp_true_nf_marked_mod");
1064: asir_assert(ARG1(arg),O_DP,"dp_true_nf_marked_mod");
1065: asir_assert(ARG2(arg),O_VECT,"dp_true_nf_marked_mod");
1066: asir_assert(ARG3(arg),O_VECT,"dp_true_nf_marked_mod");
1067: asir_assert(ARG4(arg),O_N,"dp_true_nf_marked_mod");
1068: if ( !(g = (DP)ARG1(arg)) ) {
1069: nm = 0; dn = (P)ONE;
1070: } else {
1071: b = BDY((LIST)ARG0(arg));
1072: ps = (DP *)BDY((VECT)ARG2(arg));
1073: hps = (DP *)BDY((VECT)ARG3(arg));
1074: mod = QTOS((Q)ARG4(arg));
1075: dp_true_nf_marked_mod(b,g,ps,hps,mod,&nm,&dn);
1076: }
1077: n = mknode(2,nm,dn);
1078: MKLIST(*rp,n);
1079: }
1080:
1.97 noro 1081: void Pdp_weyl_nf_mod(NODE arg,DP *rp)
1.8 noro 1082: {
1083: NODE b;
1084: DP g;
1085: DP *ps;
1086: int mod,full,ac;
1.9 noro 1087: NODE n,n0;
1.8 noro 1088:
1089: ac = argc(arg);
1.14 noro 1090: asir_assert(ARG0(arg),O_LIST,"dp_weyl_nf_mod");
1091: asir_assert(ARG1(arg),O_DP,"dp_weyl_nf_mod");
1092: asir_assert(ARG2(arg),O_VECT,"dp_weyl_nf_mod");
1093: asir_assert(ARG3(arg),O_N,"dp_weyl_nf_mod");
1094: asir_assert(ARG4(arg),O_N,"dp_weyl_nf_mod");
1.8 noro 1095: if ( !(g = (DP)ARG1(arg)) ) {
1096: *rp = 0; return;
1097: }
1098: b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg));
1099: full = QTOS((Q)ARG3(arg)); mod = QTOS((Q)ARG4(arg));
1.9 noro 1100: for ( n0 = n = 0; b; b = NEXT(b) ) {
1101: NEXTNODE(n0,n);
1102: BDY(n) = (pointer)QTOS((Q)BDY(b));
1103: }
1104: if ( n0 )
1105: NEXT(n) = 0;
1.13 noro 1106: do_weyl = 1;
1107: dp_nf_mod(n0,g,ps,mod,full,rp);
1108: do_weyl = 0;
1.8 noro 1109: }
1110:
1.97 noro 1111: void Pdp_true_nf_mod(NODE arg,LIST *rp)
1.8 noro 1112: {
1113: NODE b;
1114: DP g,nm;
1115: P dn;
1116: DP *ps;
1117: int mod,full;
1118: NODE n;
1119:
1.11 noro 1120: do_weyl = 0;
1.8 noro 1121: asir_assert(ARG0(arg),O_LIST,"dp_nf_mod");
1122: asir_assert(ARG1(arg),O_DP,"dp_nf_mod");
1123: asir_assert(ARG2(arg),O_VECT,"dp_nf_mod");
1124: asir_assert(ARG3(arg),O_N,"dp_nf_mod");
1125: asir_assert(ARG4(arg),O_N,"dp_nf_mod");
1126: if ( !(g = (DP)ARG1(arg)) ) {
1127: nm = 0; dn = (P)ONEM;
1128: } else {
1129: b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg));
1130: full = QTOS((Q)ARG3(arg)); mod = QTOS((Q)ARG4(arg));
1131: dp_true_nf_mod(b,g,ps,mod,full,&nm,&dn);
1132: }
1133: NEWNODE(n); BDY(n) = (pointer)nm;
1134: NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)dn;
1135: NEXT(NEXT(n)) = 0; MKLIST(*rp,n);
1.1 noro 1136: }
1137:
1.98 noro 1138: void Pdp_weyl_true_nf_and_quotient_marked(NODE arg,LIST *rp)
1139: {
1140: NODE b,n;
1141: DP *ps,*hps;
1142: DP g;
1143: DP nm;
1144: VECT quo;
1145: P dn;
1146: int full;
1147:
1148: do_weyl = 1; dp_fcoeffs = 0;
1149: asir_assert(ARG0(arg),O_LIST,"dp_weyl_true_nf_and_quotient_marked");
1150: asir_assert(ARG1(arg),O_DP,"dp_weyl_true_nf_and_quotient_marked");
1151: asir_assert(ARG2(arg),O_VECT,"dp_weyl_true_nf_and_quotient_marked");
1152: asir_assert(ARG3(arg),O_VECT,"dp_weyl_true_nf_and_quotient_marked");
1153: if ( !(g = (DP)ARG1(arg)) ) {
1154: nm = 0; dn = (P)ONE;
1155: } else {
1156: b = BDY((LIST)ARG0(arg));
1157: ps = (DP *)BDY((VECT)ARG2(arg));
1158: hps = (DP *)BDY((VECT)ARG3(arg));
1159: NEWVECT(quo); quo->len = ((VECT)ARG2(arg))->len;
1160: quo->body = (pointer *)dp_true_nf_and_quotient_marked(b,g,ps,hps,&nm,&dn);
1161: }
1162: n = mknode(3,nm,dn,quo);
1163: MKLIST(*rp,n);
1164: }
1165:
1166: void Pdp_weyl_true_nf_and_quotient(NODE arg,LIST *rp)
1167: {
1168: NODE narg = mknode(4,ARG0(arg),ARG1(arg),ARG2(arg),ARG2(arg));
1169: Pdp_weyl_true_nf_and_quotient_marked(narg,rp);
1170: }
1171:
1172:
1173: void Pdp_weyl_true_nf_and_quotient_marked_mod(NODE arg,LIST *rp)
1174: {
1175: NODE b,n;
1176: DP *ps,*hps;
1177: DP g;
1178: DP nm;
1179: VECT quo;
1180: P dn;
1181: int full,mod;
1182:
1183: do_weyl = 1; dp_fcoeffs = 0;
1184: asir_assert(ARG0(arg),O_LIST,"dp_weyl_true_nf_and_quotient_marked_mod");
1185: asir_assert(ARG1(arg),O_DP,"dp_weyl_true_nf_and_quotient_marked_mod");
1186: asir_assert(ARG2(arg),O_VECT,"dp_weyl_true_nf_and_quotient_marked_mod");
1187: asir_assert(ARG3(arg),O_VECT,"dp_weyl_true_nf_and_quotient_marked_mod");
1188: asir_assert(ARG4(arg),O_N,"dp_weyl_true_nf_and_quotient_marked_mod");
1189: if ( !(g = (DP)ARG1(arg)) ) {
1190: nm = 0; dn = (P)ONE;
1191: } else {
1192: b = BDY((LIST)ARG0(arg));
1193: ps = (DP *)BDY((VECT)ARG2(arg));
1194: hps = (DP *)BDY((VECT)ARG3(arg));
1195: mod = QTOS((Q)ARG4(arg));
1196: NEWVECT(quo); quo->len = ((VECT)ARG2(arg))->len;
1197: quo->body = (pointer *)dp_true_nf_and_quotient_marked_mod(b,g,ps,hps,mod,&nm,&dn);
1198: }
1199: n = mknode(3,nm,dn,quo);
1200: MKLIST(*rp,n);
1201: }
1202:
1203: void Pdp_weyl_true_nf_and_quotient_mod(NODE arg,LIST *rp)
1204: {
1205: NODE narg = mknode(5,ARG0(arg),ARG1(arg),ARG2(arg),ARG2(arg),ARG3(arg));
1206: Pdp_weyl_true_nf_and_quotient_marked_mod(narg,rp);
1207: }
1208:
1209:
1.97 noro 1210: void Pdp_tdiv(NODE arg,DP *rp)
1.1 noro 1211: {
1212: MP m,mr,mr0;
1213: DP p;
1214: Q c;
1215: N d,q,r;
1216: int sgn;
1217:
1218: asir_assert(ARG0(arg),O_DP,"dp_tdiv");
1219: asir_assert(ARG1(arg),O_N,"dp_tdiv");
1220: p = (DP)ARG0(arg); d = NM((Q)ARG1(arg)); sgn = SGN((Q)ARG1(arg));
1221: if ( !p )
1222: *rp = 0;
1223: else {
1224: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
1225: divn(NM((Q)m->c),d,&q,&r);
1226: if ( r ) {
1227: *rp = 0; return;
1228: } else {
1229: NEXTMP(mr0,mr); NTOQ(q,SGN((Q)m->c)*sgn,c);
1230: mr->c = (P)c; mr->dl = m->dl;
1231: }
1232: }
1233: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
1234: }
1235: }
1236:
1.97 noro 1237: void Pdp_red_coef(NODE arg,DP *rp)
1.1 noro 1238: {
1239: MP m,mr,mr0;
1240: P q,r;
1241: DP p;
1242: P mod;
1243:
1244: p = (DP)ARG0(arg); mod = (P)ARG1(arg);
1245: asir_assert(p,O_DP,"dp_red_coef");
1246: asir_assert(mod,O_P,"dp_red_coef");
1247: if ( !p )
1248: *rp = 0;
1249: else {
1250: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
1251: divsrp(CO,m->c,mod,&q,&r);
1252: if ( r ) {
1253: NEXTMP(mr0,mr); mr->c = r; mr->dl = m->dl;
1254: }
1255: }
1256: if ( mr0 ) {
1257: NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar;
1258: } else
1259: *rp = 0;
1260: }
1261: }
1262:
1.97 noro 1263: void Pdp_redble(NODE arg,Q *rp)
1.1 noro 1264: {
1265: asir_assert(ARG0(arg),O_DP,"dp_redble");
1266: asir_assert(ARG1(arg),O_DP,"dp_redble");
1267: if ( dp_redble((DP)ARG0(arg),(DP)ARG1(arg)) )
1268: *rp = ONE;
1269: else
1270: *rp = 0;
1271: }
1272:
1.97 noro 1273: void Pdp_red_mod(NODE arg,LIST *rp)
1.1 noro 1274: {
1275: DP h,r;
1276: P dmy;
1277: NODE n;
1278:
1.11 noro 1279: do_weyl = 0;
1.1 noro 1280: asir_assert(ARG0(arg),O_DP,"dp_red_mod");
1281: asir_assert(ARG1(arg),O_DP,"dp_red_mod");
1282: asir_assert(ARG2(arg),O_DP,"dp_red_mod");
1283: asir_assert(ARG3(arg),O_N,"dp_red_mod");
1284: dp_red_mod((DP)ARG0(arg),(DP)ARG1(arg),(DP)ARG2(arg),QTOS((Q)ARG3(arg)),
1285: &h,&r,&dmy);
1286: NEWNODE(n); BDY(n) = (pointer)h;
1287: NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)r;
1288: NEXT(NEXT(n)) = 0; MKLIST(*rp,n);
1289: }
1.13 noro 1290:
1.97 noro 1291: void Pdp_subd(NODE arg,DP *rp)
1.1 noro 1292: {
1293: DP p1,p2;
1294:
1295: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1296: asir_assert(p1,O_DP,"dp_subd");
1297: asir_assert(p2,O_DP,"dp_subd");
1298: dp_subd(p1,p2,rp);
1299: }
1300:
1.97 noro 1301: void Pdp_symb_add(NODE arg,DP *rp)
1.80 noro 1302: {
1303: DP p1,p2,r;
1304: NODE s0;
1305: MP mp0,mp;
1306: int nv;
1307:
1308: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1309: asir_assert(p1,O_DP,"dp_symb_add");
1310: asir_assert(p2,O_DP,"dp_symb_add");
1.94 noro 1311: if ( !p1 ) { *rp = p2; return; }
1312: else if ( !p2 ) { *rp = p1; return; }
1.80 noro 1313: if ( p1->nv != p2->nv )
1314: error("dp_sumb_add : invalid input");
1315: nv = p1->nv;
1316: s0 = symb_merge(dp_dllist(p1),dp_dllist(p2),nv);
1317: for ( mp0 = 0; s0; s0 = NEXT(s0) ) {
1318: NEXTMP(mp0,mp); mp->dl = (DL)BDY(s0); mp->c = (P)ONE;
1319: }
1320: NEXT(mp) = 0;
1321: MKDP(nv,mp0,r); r->sugar = MAX(p1->sugar,p2->sugar);
1322: *rp = r;
1323: }
1324:
1.97 noro 1325: void Pdp_mul_trunc(NODE arg,DP *rp)
1.32 noro 1326: {
1327: DP p1,p2,p;
1328:
1329: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); p = (DP)ARG2(arg);
1330: asir_assert(p1,O_DP,"dp_mul_trunc");
1331: asir_assert(p2,O_DP,"dp_mul_trunc");
1332: asir_assert(p,O_DP,"dp_mul_trunc");
1333: comm_muld_trunc(CO,p1,p2,BDY(p)->dl,rp);
1334: }
1335:
1.97 noro 1336: void Pdp_quo(NODE arg,DP *rp)
1.32 noro 1337: {
1338: DP p1,p2;
1339:
1340: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1341: asir_assert(p1,O_DP,"dp_quo");
1342: asir_assert(p2,O_DP,"dp_quo");
1343: comm_quod(CO,p1,p2,rp);
1344: }
1345:
1.97 noro 1346: void Pdp_weyl_mul(NODE arg,DP *rp)
1.12 noro 1347: {
1348: DP p1,p2;
1349:
1350: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1.32 noro 1351: asir_assert(p1,O_DP,"dp_weyl_mul"); asir_assert(p2,O_DP,"dp_weyl_mul");
1.12 noro 1352: do_weyl = 1;
1353: muld(CO,p1,p2,rp);
1.13 noro 1354: do_weyl = 0;
1355: }
1356:
1.97 noro 1357: void Pdp_weyl_act(NODE arg,DP *rp)
1.96 noro 1358: {
1359: DP p1,p2;
1360:
1361: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1362: asir_assert(p1,O_DP,"dp_weyl_act"); asir_assert(p2,O_DP,"dp_weyl_act");
1363: weyl_actd(CO,p1,p2,rp);
1364: }
1365:
1366:
1.97 noro 1367: void Pdp_weyl_mul_mod(NODE arg,DP *rp)
1.13 noro 1368: {
1369: DP p1,p2;
1370: Q m;
1371:
1372: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); m = (Q)ARG2(arg);
1373: asir_assert(p1,O_DP,"dp_weyl_mul_mod");
1374: asir_assert(p2,O_DP,"dp_mul_mod");
1375: asir_assert(m,O_N,"dp_mul_mod");
1376: do_weyl = 1;
1377: mulmd(CO,QTOS(m),p1,p2,rp);
1.12 noro 1378: do_weyl = 0;
1379: }
1380:
1.97 noro 1381: void Pdp_red(NODE arg,LIST *rp)
1.1 noro 1382: {
1383: NODE n;
1.4 noro 1384: DP head,rest,dmy1;
1.1 noro 1385: P dmy;
1386:
1.11 noro 1387: do_weyl = 0;
1.1 noro 1388: asir_assert(ARG0(arg),O_DP,"dp_red");
1389: asir_assert(ARG1(arg),O_DP,"dp_red");
1390: asir_assert(ARG2(arg),O_DP,"dp_red");
1.4 noro 1391: dp_red((DP)ARG0(arg),(DP)ARG1(arg),(DP)ARG2(arg),&head,&rest,&dmy,&dmy1);
1.1 noro 1392: NEWNODE(n); BDY(n) = (pointer)head;
1393: NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)rest;
1394: NEXT(NEXT(n)) = 0; MKLIST(*rp,n);
1395: }
1396:
1.97 noro 1397: void Pdp_weyl_red(NODE arg,LIST *rp)
1.11 noro 1398: {
1399: NODE n;
1400: DP head,rest,dmy1;
1401: P dmy;
1402:
1403: asir_assert(ARG0(arg),O_DP,"dp_weyl_red");
1404: asir_assert(ARG1(arg),O_DP,"dp_weyl_red");
1405: asir_assert(ARG2(arg),O_DP,"dp_weyl_red");
1.12 noro 1406: do_weyl = 1;
1.11 noro 1407: dp_red((DP)ARG0(arg),(DP)ARG1(arg),(DP)ARG2(arg),&head,&rest,&dmy,&dmy1);
1.12 noro 1408: do_weyl = 0;
1.11 noro 1409: NEWNODE(n); BDY(n) = (pointer)head;
1410: NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)rest;
1411: NEXT(NEXT(n)) = 0; MKLIST(*rp,n);
1412: }
1413:
1.97 noro 1414: void Pdp_sp(NODE arg,DP *rp)
1.1 noro 1415: {
1416: DP p1,p2;
1417:
1.11 noro 1418: do_weyl = 0;
1.1 noro 1419: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1420: asir_assert(p1,O_DP,"dp_sp"); asir_assert(p2,O_DP,"dp_sp");
1421: dp_sp(p1,p2,rp);
1422: }
1423:
1.97 noro 1424: void Pdp_weyl_sp(NODE arg,DP *rp)
1.11 noro 1425: {
1426: DP p1,p2;
1427:
1428: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1429: asir_assert(p1,O_DP,"dp_weyl_sp"); asir_assert(p2,O_DP,"dp_sp");
1.12 noro 1430: do_weyl = 1;
1.11 noro 1431: dp_sp(p1,p2,rp);
1.12 noro 1432: do_weyl = 0;
1.11 noro 1433: }
1434:
1.97 noro 1435: void Pdp_sp_mod(NODE arg,DP *rp)
1.1 noro 1436: {
1437: DP p1,p2;
1438: int mod;
1439:
1.11 noro 1440: do_weyl = 0;
1.1 noro 1441: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1442: asir_assert(p1,O_DP,"dp_sp_mod"); asir_assert(p2,O_DP,"dp_sp_mod");
1443: asir_assert(ARG2(arg),O_N,"dp_sp_mod");
1444: mod = QTOS((Q)ARG2(arg));
1445: dp_sp_mod(p1,p2,mod,rp);
1446: }
1447:
1.97 noro 1448: void Pdp_lcm(NODE arg,DP *rp)
1.1 noro 1449: {
1450: int i,n,td;
1451: DL d1,d2,d;
1452: MP m;
1453: DP p1,p2;
1454:
1455: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1456: asir_assert(p1,O_DP,"dp_lcm"); asir_assert(p2,O_DP,"dp_lcm");
1457: n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
1458: NEWDL(d,n);
1459: for ( i = 0, td = 0; i < n; i++ ) {
1.24 noro 1460: d->d[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(d->d[i],i);
1.1 noro 1461: }
1462: d->td = td;
1463: NEWMP(m); m->dl = d; m->c = (P)ONE; NEXT(m) = 0;
1464: MKDP(n,m,*rp); (*rp)->sugar = td; /* XXX */
1465: }
1466:
1.97 noro 1467: void Pdp_hm(NODE arg,DP *rp)
1.1 noro 1468: {
1469: DP p;
1470:
1471: p = (DP)ARG0(arg); asir_assert(p,O_DP,"dp_hm");
1472: dp_hm(p,rp);
1473: }
1474:
1.97 noro 1475: void Pdp_ht(NODE arg,DP *rp)
1.1 noro 1476: {
1477: DP p;
1478: MP m,mr;
1479:
1480: p = (DP)ARG0(arg); asir_assert(p,O_DP,"dp_ht");
1.52 noro 1481: dp_ht(p,rp);
1.1 noro 1482: }
1483:
1.97 noro 1484: void Pdp_hc(NODE arg,P *rp)
1.1 noro 1485: {
1486: asir_assert(ARG0(arg),O_DP,"dp_hc");
1487: if ( !ARG0(arg) )
1488: *rp = 0;
1489: else
1490: *rp = BDY((DP)ARG0(arg))->c;
1491: }
1492:
1.97 noro 1493: void Pdp_rest(NODE arg,DP *rp)
1.1 noro 1494: {
1495: asir_assert(ARG0(arg),O_DP,"dp_rest");
1496: if ( !ARG0(arg) )
1497: *rp = 0;
1498: else
1499: dp_rest((DP)ARG0(arg),rp);
1500: }
1501:
1.97 noro 1502: void Pdp_td(NODE arg,Q *rp)
1.1 noro 1503: {
1504: DP p;
1505:
1506: p = (DP)ARG0(arg); asir_assert(p,O_DP,"dp_td");
1507: if ( !p )
1508: *rp = 0;
1509: else
1510: STOQ(BDY(p)->dl->td,*rp);
1511: }
1512:
1.97 noro 1513: void Pdp_sugar(NODE arg,Q *rp)
1.1 noro 1514: {
1515: DP p;
1516:
1517: p = (DP)ARG0(arg); asir_assert(p,O_DP,"dp_sugar");
1518: if ( !p )
1519: *rp = 0;
1520: else
1521: STOQ(p->sugar,*rp);
1.30 ohara 1522: }
1523:
1.97 noro 1524: void Pdp_initial_term(NODE arg,Obj *rp)
1.49 noro 1525: {
1526: struct order_spec *ord;
1527: Num homo;
1528: int modular,is_list;
1529: LIST v,f,l,initiallist;
1530: NODE n;
1531:
1532: f = (LIST)ARG0(arg);
1533: if ( f && OID(f) == O_LIST )
1534: is_list = 1;
1535: else {
1536: n = mknode(1,f); MKLIST(l,n); f = l;
1537: is_list = 0;
1538: }
1.54 noro 1539: if ( current_option ) {
1.53 noro 1540: parse_gr_option(f,current_option,&v,&homo,&modular,&ord);
1.54 noro 1541: initd(ord);
1542: } else
1.49 noro 1543: ord = dp_current_spec;
1544: initiallist = dp_initial_term(f,ord);
1545: if ( !is_list )
1546: *rp = (Obj)BDY(BDY(initiallist));
1547: else
1548: *rp = (Obj)initiallist;
1549: }
1550:
1.97 noro 1551: void Pdp_order(NODE arg,Obj *rp)
1.49 noro 1552: {
1553: struct order_spec *ord;
1554: Num homo;
1555: int modular,is_list;
1556: LIST v,f,l,ordlist;
1557: NODE n;
1558:
1559: f = (LIST)ARG0(arg);
1560: if ( f && OID(f) == O_LIST )
1561: is_list = 1;
1562: else {
1563: n = mknode(1,f); MKLIST(l,n); f = l;
1564: is_list = 0;
1565: }
1.54 noro 1566: if ( current_option ) {
1.53 noro 1567: parse_gr_option(f,current_option,&v,&homo,&modular,&ord);
1.54 noro 1568: initd(ord);
1569: } else
1.49 noro 1570: ord = dp_current_spec;
1571: ordlist = dp_order(f,ord);
1572: if ( !is_list )
1573: *rp = (Obj)BDY(BDY(ordlist));
1574: else
1575: *rp = (Obj)ordlist;
1576: }
1577:
1.97 noro 1578: void Pdp_set_sugar(NODE arg,Q *rp)
1.30 ohara 1579: {
1580: DP p;
1581: Q q;
1582: int i;
1583:
1584: p = (DP)ARG0(arg);
1585: q = (Q)ARG1(arg);
1586: if ( p && q) {
1587: asir_assert(p,O_DP,"dp_set_sugar");
1588: asir_assert(q,O_N, "dp_set_sugar");
1589: i = QTOS(q);
1590: if (p->sugar < i) {
1591: p->sugar = i;
1592: }
1593: }
1594: *rp = 0;
1.1 noro 1595: }
1596:
1.97 noro 1597: void Pdp_cri1(NODE arg,Q *rp)
1.1 noro 1598: {
1599: DP p1,p2;
1600: int *d1,*d2;
1601: int i,n;
1602:
1603: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1604: asir_assert(p1,O_DP,"dp_cri1"); asir_assert(p2,O_DP,"dp_cri1");
1605: n = p1->nv; d1 = BDY(p1)->dl->d; d2 = BDY(p2)->dl->d;
1606: for ( i = 0; i < n; i++ )
1607: if ( d1[i] > d2[i] )
1608: break;
1609: *rp = i == n ? ONE : 0;
1610: }
1611:
1.97 noro 1612: void Pdp_cri2(NODE arg,Q *rp)
1.1 noro 1613: {
1614: DP p1,p2;
1615: int *d1,*d2;
1616: int i,n;
1617:
1618: p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg);
1619: asir_assert(p1,O_DP,"dp_cri2"); asir_assert(p2,O_DP,"dp_cri2");
1620: n = p1->nv; d1 = BDY(p1)->dl->d; d2 = BDY(p2)->dl->d;
1621: for ( i = 0; i < n; i++ )
1622: if ( MIN(d1[i],d2[i]) >= 1 )
1623: break;
1624: *rp = i == n ? ONE : 0;
1625: }
1626:
1.97 noro 1627: void Pdp_minp(NODE arg,LIST *rp)
1.1 noro 1628: {
1629: NODE tn,tn1,d,dd,dd0,p,tp;
1630: LIST l,minp;
1631: DP lcm,tlcm;
1632: int s,ts;
1633:
1634: asir_assert(ARG0(arg),O_LIST,"dp_minp");
1635: d = BDY((LIST)ARG0(arg)); minp = (LIST)BDY(d);
1636: p = BDY(minp); p = NEXT(NEXT(p)); lcm = (DP)BDY(p); p = NEXT(p);
1637: if ( !ARG1(arg) ) {
1638: s = QTOS((Q)BDY(p)); p = NEXT(p);
1639: for ( dd0 = 0, d = NEXT(d); d; d = NEXT(d) ) {
1640: tp = BDY((LIST)BDY(d)); tp = NEXT(NEXT(tp));
1641: tlcm = (DP)BDY(tp); tp = NEXT(tp);
1642: ts = QTOS((Q)BDY(tp)); tp = NEXT(tp);
1643: NEXTNODE(dd0,dd);
1644: if ( ts < s ) {
1645: BDY(dd) = (pointer)minp;
1646: minp = (LIST)BDY(d); lcm = tlcm; s = ts;
1647: } else if ( ts == s ) {
1648: if ( compd(CO,lcm,tlcm) > 0 ) {
1649: BDY(dd) = (pointer)minp;
1650: minp = (LIST)BDY(d); lcm = tlcm; s = ts;
1651: } else
1652: BDY(dd) = BDY(d);
1653: } else
1654: BDY(dd) = BDY(d);
1655: }
1656: } else {
1657: for ( dd0 = 0, d = NEXT(d); d; d = NEXT(d) ) {
1658: tp = BDY((LIST)BDY(d)); tp = NEXT(NEXT(tp));
1659: tlcm = (DP)BDY(tp);
1660: NEXTNODE(dd0,dd);
1661: if ( compd(CO,lcm,tlcm) > 0 ) {
1662: BDY(dd) = (pointer)minp; minp = (LIST)BDY(d); lcm = tlcm;
1663: } else
1664: BDY(dd) = BDY(d);
1665: }
1666: }
1667: if ( dd0 )
1668: NEXT(dd) = 0;
1669: MKLIST(l,dd0); MKNODE(tn,l,0); MKNODE(tn1,minp,tn); MKLIST(*rp,tn1);
1670: }
1671:
1.97 noro 1672: void Pdp_criB(NODE arg,LIST *rp)
1.1 noro 1673: {
1674: NODE d,ij,dd,ddd;
1675: int i,j,s,n;
1676: DP *ps;
1677: DL ts,ti,tj,lij,tdl;
1678:
1679: asir_assert(ARG0(arg),O_LIST,"dp_criB"); d = BDY((LIST)ARG0(arg));
1680: asir_assert(ARG1(arg),O_N,"dp_criB"); s = QTOS((Q)ARG1(arg));
1681: asir_assert(ARG2(arg),O_VECT,"dp_criB"); ps = (DP *)BDY((VECT)ARG2(arg));
1682: if ( !d )
1683: *rp = (LIST)ARG0(arg);
1684: else {
1685: ts = BDY(ps[s])->dl;
1686: n = ps[s]->nv;
1687: NEWDL(tdl,n);
1688: for ( dd = 0; d; d = NEXT(d) ) {
1689: ij = BDY((LIST)BDY(d));
1690: i = QTOS((Q)BDY(ij)); ij = NEXT(ij);
1691: j = QTOS((Q)BDY(ij)); ij = NEXT(ij);
1692: lij = BDY((DP)BDY(ij))->dl;
1693: ti = BDY(ps[i])->dl; tj = BDY(ps[j])->dl;
1694: if ( lij->td != lcm_of_DL(n,lij,ts,tdl)->td
1695: || !dl_equal(n,lij,tdl)
1696: || (lij->td == lcm_of_DL(n,ti,ts,tdl)->td
1697: && dl_equal(n,tdl,lij))
1698: || (lij->td == lcm_of_DL(n,tj,ts,tdl)->td
1699: && dl_equal(n,tdl,lij)) ) {
1700: MKNODE(ddd,BDY(d),dd);
1701: dd = ddd;
1702: }
1703: }
1704: MKLIST(*rp,dd);
1705: }
1706: }
1707:
1.97 noro 1708: void Pdp_nelim(NODE arg,Q *rp)
1.1 noro 1709: {
1710: if ( arg ) {
1711: asir_assert(ARG0(arg),O_N,"dp_nelim");
1712: dp_nelim = QTOS((Q)ARG0(arg));
1713: }
1714: STOQ(dp_nelim,*rp);
1715: }
1716:
1.97 noro 1717: void Pdp_mag(NODE arg,Q *rp)
1.1 noro 1718: {
1719: DP p;
1720: int s;
1721: MP m;
1722:
1723: p = (DP)ARG0(arg);
1724: asir_assert(p,O_DP,"dp_mag");
1725: if ( !p )
1726: *rp = 0;
1727: else {
1728: for ( s = 0, m = BDY(p); m; m = NEXT(m) )
1729: s += p_mag(m->c);
1730: STOQ(s,*rp);
1731: }
1732: }
1733:
1734: extern int kara_mag;
1735:
1.97 noro 1736: void Pdp_set_kara(NODE arg,Q *rp)
1.1 noro 1737: {
1738: if ( arg ) {
1739: asir_assert(ARG0(arg),O_N,"dp_set_kara");
1740: kara_mag = QTOS((Q)ARG0(arg));
1741: }
1742: STOQ(kara_mag,*rp);
1743: }
1744:
1.97 noro 1745: void Pdp_homo(NODE arg,DP *rp)
1.1 noro 1746: {
1747: asir_assert(ARG0(arg),O_DP,"dp_homo");
1748: dp_homo((DP)ARG0(arg),rp);
1749: }
1750:
1.97 noro 1751: void Pdp_dehomo(NODE arg,DP *rp)
1.1 noro 1752: {
1.8 noro 1753: asir_assert(ARG0(arg),O_DP,"dp_dehomo");
1754: dp_dehomo((DP)ARG0(arg),rp);
1755: }
1756:
1.97 noro 1757: void Pdp_gr_flags(NODE arg,LIST *rp)
1.8 noro 1758: {
1759: Obj name,value;
1760: NODE n;
1.1 noro 1761:
1.8 noro 1762: if ( arg ) {
1763: asir_assert(ARG0(arg),O_LIST,"dp_gr_flags");
1764: n = BDY((LIST)ARG0(arg));
1765: while ( n ) {
1766: name = (Obj)BDY(n); n = NEXT(n);
1767: if ( !n )
1768: break;
1769: else {
1770: value = (Obj)BDY(n); n = NEXT(n);
1771: }
1772: dp_set_flag(name,value);
1.1 noro 1773: }
1774: }
1.8 noro 1775: dp_make_flaglist(rp);
1776: }
1777:
1.29 noro 1778: extern int DP_Print, DP_PrintShort;
1.8 noro 1779:
1.97 noro 1780: void Pdp_gr_print(NODE arg,Q *rp)
1.8 noro 1781: {
1782: Q q;
1.29 noro 1783: int s;
1.8 noro 1784:
1785: if ( arg ) {
1786: asir_assert(ARG0(arg),O_N,"dp_gr_print");
1.29 noro 1787: q = (Q)ARG0(arg);
1788: s = QTOS(q);
1789: switch ( s ) {
1790: case 0:
1791: DP_Print = 0; DP_PrintShort = 0;
1792: break;
1793: case 1:
1794: DP_Print = 1;
1795: break;
1.41 noro 1796: case 2:
1.29 noro 1797: DP_Print = 0; DP_PrintShort = 1;
1.43 noro 1798: break;
1.41 noro 1799: default:
1800: DP_Print = s; DP_PrintShort = 0;
1.29 noro 1801: break;
1802: }
1803: } else {
1804: if ( DP_Print ) {
1805: STOQ(1,q);
1806: } else if ( DP_PrintShort ) {
1807: STOQ(2,q);
1808: } else
1809: q = 0;
1810: }
1.8 noro 1811: *rp = q;
1.1 noro 1812: }
1813:
1.46 noro 1814: void parse_gr_option(LIST f,NODE opt,LIST *v,Num *homo,
1815: int *modular,struct order_spec **ord)
1816: {
1817: NODE t,p;
1818: Q m;
1819: char *key;
1820: Obj value,dmy;
1821: int ord_is_set = 0;
1822: int modular_is_set = 0;
1823: int homo_is_set = 0;
1.47 noro 1824: VL vl,vl0;
1.46 noro 1825: LIST vars;
1.47 noro 1826: char xiname[BUFSIZ];
1827: NODE x0,x;
1828: DP d;
1829: P xi;
1830: int nv,i;
1.46 noro 1831:
1832: /* extract vars */
1833: vars = 0;
1834: for ( t = opt; t; t = NEXT(t) ) {
1835: p = BDY((LIST)BDY(t));
1836: key = BDY((STRING)BDY(p));
1837: value = (Obj)BDY(NEXT(p));
1838: if ( !strcmp(key,"v") ) {
1839: /* variable list */
1840: vars = (LIST)value;
1841: break;
1842: }
1843: }
1.48 noro 1844: if ( vars ) {
1845: *v = vars; pltovl(vars,&vl);
1846: } else {
1847: for ( t = BDY(f); t; t = NEXT(t) )
1848: if ( BDY(t) && OID((Obj)BDY(t))==O_DP )
1849: break;
1850: if ( t ) {
1851: /* f is DP list */
1852: /* create dummy var list */
1853: d = (DP)BDY(t);
1854: nv = NV(d);
1855: for ( i = 0, vl0 = 0, x0 = 0; i < nv; i++ ) {
1856: NEXTVL(vl0,vl);
1857: NEXTNODE(x0,x);
1858: sprintf(xiname,"x%d",i);
1859: makevar(xiname,&xi);
1860: x->body = (pointer)xi;
1861: vl->v = VR((P)xi);
1862: }
1863: if ( vl0 ) {
1864: NEXT(vl) = 0;
1865: NEXT(x) = 0;
1866: }
1867: MKLIST(vars,x0);
1868: *v = vars;
1869: vl = vl0;
1870: } else {
1871: get_vars((Obj)f,&vl); vltopl(vl,v);
1.47 noro 1872: }
1.46 noro 1873: }
1874:
1875: for ( t = opt; t; t = NEXT(t) ) {
1876: p = BDY((LIST)BDY(t));
1877: key = BDY((STRING)BDY(p));
1878: value = (Obj)BDY(NEXT(p));
1879: if ( !strcmp(key,"v") ) {
1880: /* variable list; ignore */
1881: } else if ( !strcmp(key,"order") ) {
1882: /* order spec */
1.51 noro 1883: if ( !vl )
1884: error("parse_gr_option : variables must be specified");
1.46 noro 1885: create_order_spec(vl,value,ord);
1886: ord_is_set = 1;
1887: } else if ( !strcmp(key,"block") ) {
1888: create_order_spec(0,value,ord);
1.51 noro 1889: ord_is_set = 1;
1.46 noro 1890: } else if ( !strcmp(key,"matrix") ) {
1891: create_order_spec(0,value,ord);
1.51 noro 1892: ord_is_set = 1;
1.46 noro 1893: } else if ( !strcmp(key,"sugarweight") ) {
1894: /* weight */
1895: Pdp_set_weight(NEXT(p),&dmy);
1896: } else if ( !strcmp(key,"homo") ) {
1897: *homo = (Num)value;
1898: homo_is_set = 1;
1899: } else if ( !strcmp(key,"trace") ) {
1900: m = (Q)value;
1901: if ( !m )
1902: *modular = 0;
1903: else if ( PL(NM(m))>1 || (PL(NM(m)) == 1
1904: && BD(NM(m))[0] >= 0x80000000) )
1905: error("parse_gr_option : too large modulus");
1906: else
1907: *modular = QTOS(m);
1908: modular_is_set = 1;
1909: } else
1910: error("parse_gr_option : not implemented");
1911: }
1912: if ( !ord_is_set ) create_order_spec(0,0,ord);
1913: if ( !modular_is_set ) *modular = 0;
1914: if ( !homo_is_set ) *homo = 0;
1915: }
1916:
1.97 noro 1917: void Pdp_gr_main(NODE arg,LIST *rp)
1.1 noro 1918: {
1.8 noro 1919: LIST f,v;
1.46 noro 1920: VL vl;
1.8 noro 1921: Num homo;
1922: Q m;
1.46 noro 1923: int modular,ac;
1924: struct order_spec *ord;
1.8 noro 1925:
1.11 noro 1926: do_weyl = 0;
1.8 noro 1927: asir_assert(ARG0(arg),O_LIST,"dp_gr_main");
1.46 noro 1928: f = (LIST)ARG0(arg);
1.25 noro 1929: f = remove_zero_from_list(f);
1930: if ( !BDY(f) ) {
1931: *rp = f; return;
1932: }
1.53 noro 1933: if ( (ac = argc(arg)) == 5 ) {
1.46 noro 1934: asir_assert(ARG1(arg),O_LIST,"dp_gr_main");
1935: asir_assert(ARG2(arg),O_N,"dp_gr_main");
1936: asir_assert(ARG3(arg),O_N,"dp_gr_main");
1.49 noro 1937: v = (LIST)ARG1(arg);
1.46 noro 1938: homo = (Num)ARG2(arg);
1939: m = (Q)ARG3(arg);
1940: if ( !m )
1941: modular = 0;
1942: else if ( PL(NM(m))>1 || (PL(NM(m)) == 1 && BD(NM(m))[0] >= 0x80000000) )
1943: error("dp_gr_main : too large modulus");
1944: else
1945: modular = QTOS(m);
1946: create_order_spec(0,ARG4(arg),&ord);
1.53 noro 1947: } else if ( current_option )
1948: parse_gr_option(f,current_option,&v,&homo,&modular,&ord);
1.46 noro 1949: else if ( ac == 1 )
1950: parse_gr_option(f,0,&v,&homo,&modular,&ord);
1.8 noro 1951: else
1.46 noro 1952: error("dp_gr_main : invalid argument");
1953: dp_gr_main(f,v,homo,modular,0,ord,rp);
1.63 noro 1954: }
1955:
1.97 noro 1956: void Pdp_interreduce(NODE arg,LIST *rp)
1.63 noro 1957: {
1958: LIST f,v;
1959: VL vl;
1960: int ac;
1961: struct order_spec *ord;
1962:
1963: do_weyl = 0;
1964: asir_assert(ARG0(arg),O_LIST,"dp_interreduce");
1965: f = (LIST)ARG0(arg);
1966: f = remove_zero_from_list(f);
1967: if ( !BDY(f) ) {
1968: *rp = f; return;
1969: }
1970: if ( (ac = argc(arg)) == 3 ) {
1971: asir_assert(ARG1(arg),O_LIST,"dp_interreduce");
1972: v = (LIST)ARG1(arg);
1973: create_order_spec(0,ARG2(arg),&ord);
1974: }
1975: dp_interreduce(f,v,0,ord,rp);
1.16 noro 1976: }
1977:
1.97 noro 1978: void Pdp_gr_f_main(NODE arg,LIST *rp)
1.16 noro 1979: {
1980: LIST f,v;
1981: Num homo;
1.26 noro 1982: int m,field,t;
1.46 noro 1983: struct order_spec *ord;
1.26 noro 1984: NODE n;
1.16 noro 1985:
1986: do_weyl = 0;
1987: asir_assert(ARG0(arg),O_LIST,"dp_gr_f_main");
1988: asir_assert(ARG1(arg),O_LIST,"dp_gr_f_main");
1989: asir_assert(ARG2(arg),O_N,"dp_gr_f_main");
1990: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
1.25 noro 1991: f = remove_zero_from_list(f);
1992: if ( !BDY(f) ) {
1993: *rp = f; return;
1994: }
1.16 noro 1995: homo = (Num)ARG2(arg);
1.27 noro 1996: #if 0
1997: asir_assert(ARG3(arg),O_N,"dp_gr_f_main");
1.26 noro 1998: m = QTOS((Q)ARG3(arg));
1999: if ( m )
2000: error("dp_gr_f_main : trace lifting is not implemented yet");
1.46 noro 2001: create_order_spec(0,ARG4(arg),&ord);
1.27 noro 2002: #else
2003: m = 0;
1.46 noro 2004: create_order_spec(0,ARG3(arg),&ord);
1.27 noro 2005: #endif
1.26 noro 2006: field = 0;
2007: for ( n = BDY(f); n; n = NEXT(n) ) {
2008: t = get_field_type(BDY(n));
2009: if ( !t )
2010: continue;
2011: if ( t < 0 )
2012: error("dp_gr_f_main : incosistent coefficients");
2013: if ( !field )
2014: field = t;
2015: else if ( t != field )
2016: error("dp_gr_f_main : incosistent coefficients");
2017: }
1.46 noro 2018: dp_gr_main(f,v,homo,m?1:0,field,ord,rp);
1.1 noro 2019: }
2020:
1.97 noro 2021: void Pdp_f4_main(NODE arg,LIST *rp)
1.1 noro 2022: {
1.8 noro 2023: LIST f,v;
1.46 noro 2024: struct order_spec *ord;
1.1 noro 2025:
1.11 noro 2026: do_weyl = 0;
1.8 noro 2027: asir_assert(ARG0(arg),O_LIST,"dp_f4_main");
2028: asir_assert(ARG1(arg),O_LIST,"dp_f4_main");
2029: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
1.25 noro 2030: f = remove_zero_from_list(f);
2031: if ( !BDY(f) ) {
2032: *rp = f; return;
2033: }
1.46 noro 2034: create_order_spec(0,ARG2(arg),&ord);
2035: dp_f4_main(f,v,ord,rp);
1.22 noro 2036: }
2037:
2038: /* dp_gr_checklist(list of dp) */
2039:
1.97 noro 2040: void Pdp_gr_checklist(NODE arg,LIST *rp)
1.22 noro 2041: {
2042: VECT g;
2043: LIST dp;
2044: NODE r;
1.23 noro 2045: int n;
1.22 noro 2046:
2047: do_weyl = 0;
2048: asir_assert(ARG0(arg),O_LIST,"dp_gr_checklist");
1.23 noro 2049: asir_assert(ARG1(arg),O_N,"dp_gr_checklist");
2050: n = QTOS((Q)ARG1(arg));
2051: gbcheck_list(BDY((LIST)ARG0(arg)),n,&g,&dp);
1.22 noro 2052: r = mknode(2,g,dp);
2053: MKLIST(*rp,r);
1.1 noro 2054: }
2055:
1.97 noro 2056: void Pdp_f4_mod_main(NODE arg,LIST *rp)
1.1 noro 2057: {
1.8 noro 2058: LIST f,v;
2059: int m;
1.46 noro 2060: struct order_spec *ord;
1.8 noro 2061:
1.11 noro 2062: do_weyl = 0;
1.17 noro 2063: asir_assert(ARG0(arg),O_LIST,"dp_f4_mod_main");
2064: asir_assert(ARG1(arg),O_LIST,"dp_f4_mod_main");
2065: asir_assert(ARG2(arg),O_N,"dp_f4_mod_main");
1.8 noro 2066: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); m = QTOS((Q)ARG2(arg));
1.25 noro 2067: f = remove_zero_from_list(f);
2068: if ( !BDY(f) ) {
2069: *rp = f; return;
2070: }
1.20 noro 2071: if ( !m )
2072: error("dp_f4_mod_main : invalid argument");
1.46 noro 2073: create_order_spec(0,ARG3(arg),&ord);
2074: dp_f4_mod_main(f,v,m,ord,rp);
1.8 noro 2075: }
1.1 noro 2076:
1.97 noro 2077: void Pdp_gr_mod_main(NODE arg,LIST *rp)
1.8 noro 2078: {
2079: LIST f,v;
2080: Num homo;
2081: int m;
1.46 noro 2082: struct order_spec *ord;
1.8 noro 2083:
1.11 noro 2084: do_weyl = 0;
1.8 noro 2085: asir_assert(ARG0(arg),O_LIST,"dp_gr_mod_main");
2086: asir_assert(ARG1(arg),O_LIST,"dp_gr_mod_main");
2087: asir_assert(ARG2(arg),O_N,"dp_gr_mod_main");
2088: asir_assert(ARG3(arg),O_N,"dp_gr_mod_main");
1.11 noro 2089: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
1.25 noro 2090: f = remove_zero_from_list(f);
2091: if ( !BDY(f) ) {
2092: *rp = f; return;
2093: }
1.11 noro 2094: homo = (Num)ARG2(arg); m = QTOS((Q)ARG3(arg));
1.20 noro 2095: if ( !m )
2096: error("dp_gr_mod_main : invalid argument");
1.46 noro 2097: create_order_spec(0,ARG4(arg),&ord);
2098: dp_gr_mod_main(f,v,homo,m,ord,rp);
1.33 noro 2099: }
2100:
1.97 noro 2101: void Pnd_f4(NODE arg,LIST *rp)
1.40 noro 2102: {
2103: LIST f,v;
1.87 noro 2104: int m,homo,retdp;
2105: Obj val;
1.100 noro 2106: Q mq;
2107: NODE node;
1.46 noro 2108: struct order_spec *ord;
1.40 noro 2109:
2110: do_weyl = 0;
1.94 noro 2111: nd_rref2 = 0;
1.76 noro 2112: asir_assert(ARG0(arg),O_LIST,"nd_f4");
2113: asir_assert(ARG1(arg),O_LIST,"nd_f4");
2114: asir_assert(ARG2(arg),O_N,"nd_f4");
1.40 noro 2115: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2116: f = remove_zero_from_list(f);
2117: if ( !BDY(f) ) {
2118: *rp = f; return;
2119: }
1.100 noro 2120: mq = (Q)ARG2(arg);
2121: if ( PL(NM(mq)) > 1 || BD(NM(mq))[0] >= (1<<30) ) {
2122: node = mknode(1,mq);
2123: Psetmod_ff(node,&val);
2124: m = -2;
1.101 ! noro 2125: } else
! 2126: m = QTOS(mq);
1.46 noro 2127: create_order_spec(0,ARG3(arg),&ord);
1.87 noro 2128: homo = retdp = 0;
2129: if ( get_opt("homo",&val) && val ) homo = 1;
2130: if ( get_opt("dp",&val) && val ) retdp = 1;
1.94 noro 2131: if ( get_opt("rref2",&val) && val ) nd_rref2 = 1;
1.87 noro 2132: nd_gr(f,v,m,homo,retdp,1,ord,rp);
1.40 noro 2133: }
2134:
1.97 noro 2135: void Pnd_gr(NODE arg,LIST *rp)
1.33 noro 2136: {
2137: LIST f,v;
1.87 noro 2138: int m,homo,retdp;
2139: Obj val;
1.100 noro 2140: Q mq;
2141: NODE node;
1.46 noro 2142: struct order_spec *ord;
1.33 noro 2143:
2144: do_weyl = 0;
2145: asir_assert(ARG0(arg),O_LIST,"nd_gr");
2146: asir_assert(ARG1(arg),O_LIST,"nd_gr");
1.36 noro 2147: asir_assert(ARG2(arg),O_N,"nd_gr");
1.33 noro 2148: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2149: f = remove_zero_from_list(f);
2150: if ( !BDY(f) ) {
2151: *rp = f; return;
2152: }
1.100 noro 2153: mq = (Q)ARG2(arg);
2154: if ( PL(NM(mq)) > 1 || BD(NM(mq))[0] >= (1<<30) ) {
2155: node = mknode(1,mq);
2156: Psetmod_ff(node,&val);
2157: m = -2;
1.101 ! noro 2158: } else
! 2159: m = QTOS(mq);
1.46 noro 2160: create_order_spec(0,ARG3(arg),&ord);
1.87 noro 2161: homo = retdp = 0;
2162: if ( get_opt("homo",&val) && val ) homo = 1;
2163: if ( get_opt("dp",&val) && val ) retdp = 1;
2164: nd_gr(f,v,m,homo,retdp,0,ord,rp);
1.58 noro 2165: }
2166:
1.97 noro 2167: void Pnd_gr_postproc(NODE arg,LIST *rp)
1.58 noro 2168: {
2169: LIST f,v;
2170: int m,do_check;
2171: struct order_spec *ord;
2172:
2173: do_weyl = 0;
2174: asir_assert(ARG0(arg),O_LIST,"nd_gr");
2175: asir_assert(ARG1(arg),O_LIST,"nd_gr");
2176: asir_assert(ARG2(arg),O_N,"nd_gr");
2177: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2178: f = remove_zero_from_list(f);
2179: if ( !BDY(f) ) {
2180: *rp = f; return;
2181: }
2182: m = QTOS((Q)ARG2(arg));
2183: create_order_spec(0,ARG3(arg),&ord);
2184: do_check = ARG4(arg) ? 1 : 0;
2185: nd_gr_postproc(f,v,m,ord,do_check,rp);
1.36 noro 2186: }
2187:
1.97 noro 2188: void Pnd_gr_recompute_trace(NODE arg,LIST *rp)
1.86 noro 2189: {
2190: LIST f,v,tlist;
2191: int m;
2192: struct order_spec *ord;
2193:
2194: do_weyl = 0;
2195: asir_assert(ARG0(arg),O_LIST,"nd_gr_recompute_trace");
2196: asir_assert(ARG1(arg),O_LIST,"nd_gr_recompute_trace");
2197: asir_assert(ARG2(arg),O_N,"nd_gr_recompute_trace");
2198: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2199: m = QTOS((Q)ARG2(arg));
2200: create_order_spec(0,ARG3(arg),&ord);
2201: tlist = (LIST)ARG4(arg);
2202: nd_gr_recompute_trace(f,v,m,ord,tlist,rp);
2203: }
1.89 noro 2204:
1.90 noro 2205: Obj nd_btog_one(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,int pos);
2206: Obj nd_btog(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist);
2207:
1.97 noro 2208: void Pnd_btog(NODE arg,Obj *rp)
1.89 noro 2209: {
2210: LIST f,v,tlist;
1.90 noro 2211: int m,ac,pos;
1.89 noro 2212: struct order_spec *ord;
2213:
2214: do_weyl = 0;
2215: asir_assert(ARG0(arg),O_LIST,"nd_btog");
2216: asir_assert(ARG1(arg),O_LIST,"nd_btog");
2217: asir_assert(ARG2(arg),O_N,"nd_btog");
2218: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2219: m = QTOS((Q)ARG2(arg));
2220: create_order_spec(0,ARG3(arg),&ord);
2221: tlist = (LIST)ARG4(arg);
1.90 noro 2222: if ( (ac = argc(arg)) == 6 ) {
2223: asir_assert(ARG5(arg),O_N,"nd_btog");
2224: pos = QTOS((Q)ARG5(arg));
2225: *rp = nd_btog_one(f,v,m,ord,tlist,pos);
2226: } else if ( ac == 5 )
2227: *rp = nd_btog(f,v,m,ord,tlist);
2228: else
2229: error("nd_btog : argument mismatch");
1.89 noro 2230: }
1.86 noro 2231:
1.97 noro 2232: void Pnd_weyl_gr_postproc(NODE arg,LIST *rp)
1.75 noro 2233: {
2234: LIST f,v;
2235: int m,do_check;
2236: struct order_spec *ord;
2237:
2238: do_weyl = 1;
2239: asir_assert(ARG0(arg),O_LIST,"nd_gr");
2240: asir_assert(ARG1(arg),O_LIST,"nd_gr");
2241: asir_assert(ARG2(arg),O_N,"nd_gr");
2242: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2243: f = remove_zero_from_list(f);
2244: if ( !BDY(f) ) {
1.80 noro 2245: *rp = f; do_weyl = 0; return;
1.75 noro 2246: }
2247: m = QTOS((Q)ARG2(arg));
2248: create_order_spec(0,ARG3(arg),&ord);
2249: do_check = ARG4(arg) ? 1 : 0;
2250: nd_gr_postproc(f,v,m,ord,do_check,rp);
1.80 noro 2251: do_weyl = 0;
1.75 noro 2252: }
2253:
1.97 noro 2254: void Pnd_gr_trace(NODE arg,LIST *rp)
1.36 noro 2255: {
2256: LIST f,v;
2257: int m,homo;
1.46 noro 2258: struct order_spec *ord;
1.36 noro 2259:
2260: do_weyl = 0;
2261: asir_assert(ARG0(arg),O_LIST,"nd_gr_trace");
2262: asir_assert(ARG1(arg),O_LIST,"nd_gr_trace");
2263: asir_assert(ARG2(arg),O_N,"nd_gr_trace");
2264: asir_assert(ARG3(arg),O_N,"nd_gr_trace");
2265: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2266: f = remove_zero_from_list(f);
2267: if ( !BDY(f) ) {
2268: *rp = f; return;
2269: }
2270: homo = QTOS((Q)ARG2(arg));
2271: m = QTOS((Q)ARG3(arg));
1.46 noro 2272: create_order_spec(0,ARG4(arg),&ord);
1.62 noro 2273: nd_gr_trace(f,v,m,homo,0,ord,rp);
2274: }
2275:
1.97 noro 2276: void Pnd_f4_trace(NODE arg,LIST *rp)
1.62 noro 2277: {
2278: LIST f,v;
2279: int m,homo;
2280: struct order_spec *ord;
2281:
2282: do_weyl = 0;
2283: asir_assert(ARG0(arg),O_LIST,"nd_gr_trace");
2284: asir_assert(ARG1(arg),O_LIST,"nd_gr_trace");
2285: asir_assert(ARG2(arg),O_N,"nd_gr_trace");
2286: asir_assert(ARG3(arg),O_N,"nd_gr_trace");
2287: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2288: f = remove_zero_from_list(f);
2289: if ( !BDY(f) ) {
2290: *rp = f; return;
2291: }
2292: homo = QTOS((Q)ARG2(arg));
2293: m = QTOS((Q)ARG3(arg));
2294: create_order_spec(0,ARG4(arg),&ord);
2295: nd_gr_trace(f,v,m,homo,1,ord,rp);
1.11 noro 2296: }
2297:
1.97 noro 2298: void Pnd_weyl_gr(NODE arg,LIST *rp)
1.38 noro 2299: {
2300: LIST f,v;
1.87 noro 2301: int m,homo,retdp;
2302: Obj val;
1.46 noro 2303: struct order_spec *ord;
1.38 noro 2304:
2305: do_weyl = 1;
2306: asir_assert(ARG0(arg),O_LIST,"nd_weyl_gr");
2307: asir_assert(ARG1(arg),O_LIST,"nd_weyl_gr");
2308: asir_assert(ARG2(arg),O_N,"nd_weyl_gr");
2309: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2310: f = remove_zero_from_list(f);
2311: if ( !BDY(f) ) {
1.80 noro 2312: *rp = f; do_weyl = 0; return;
1.38 noro 2313: }
2314: m = QTOS((Q)ARG2(arg));
1.46 noro 2315: create_order_spec(0,ARG3(arg),&ord);
1.87 noro 2316: homo = retdp = 0;
2317: if ( get_opt("homo",&val) && val ) homo = 1;
2318: if ( get_opt("dp",&val) && val ) retdp = 1;
2319: nd_gr(f,v,m,homo,retdp,0,ord,rp);
1.80 noro 2320: do_weyl = 0;
1.38 noro 2321: }
2322:
1.97 noro 2323: void Pnd_weyl_gr_trace(NODE arg,LIST *rp)
1.38 noro 2324: {
2325: LIST f,v;
2326: int m,homo;
1.46 noro 2327: struct order_spec *ord;
1.38 noro 2328:
2329: do_weyl = 1;
2330: asir_assert(ARG0(arg),O_LIST,"nd_weyl_gr_trace");
2331: asir_assert(ARG1(arg),O_LIST,"nd_weyl_gr_trace");
2332: asir_assert(ARG2(arg),O_N,"nd_weyl_gr_trace");
2333: asir_assert(ARG3(arg),O_N,"nd_weyl_gr_trace");
2334: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
2335: f = remove_zero_from_list(f);
2336: if ( !BDY(f) ) {
1.80 noro 2337: *rp = f; do_weyl = 0; return;
1.38 noro 2338: }
2339: homo = QTOS((Q)ARG2(arg));
2340: m = QTOS((Q)ARG3(arg));
1.46 noro 2341: create_order_spec(0,ARG4(arg),&ord);
1.65 noro 2342: nd_gr_trace(f,v,m,homo,0,ord,rp);
1.80 noro 2343: do_weyl = 0;
1.38 noro 2344: }
1.39 noro 2345:
1.83 noro 2346: void Pnd_nf(NODE arg,Obj *rp)
1.39 noro 2347: {
1.83 noro 2348: Obj f;
1.39 noro 2349: LIST g,v;
1.46 noro 2350: struct order_spec *ord;
1.39 noro 2351:
2352: do_weyl = 0;
2353: asir_assert(ARG1(arg),O_LIST,"nd_nf");
2354: asir_assert(ARG2(arg),O_LIST,"nd_nf");
2355: asir_assert(ARG4(arg),O_N,"nd_nf");
1.83 noro 2356: f = (Obj)ARG0(arg);
2357: g = (LIST)ARG1(arg); g = remove_zero_from_list(g);
2358: if ( !BDY(g) ) {
2359: *rp = f; return;
2360: }
2361: v = (LIST)ARG2(arg);
2362: create_order_spec(0,ARG3(arg),&ord);
2363: nd_nf_p(f,g,v,QTOS((Q)ARG4(arg)),ord,rp);
2364: }
2365:
2366: void Pnd_weyl_nf(NODE arg,Obj *rp)
2367: {
2368: Obj f;
2369: LIST g,v;
2370: struct order_spec *ord;
2371:
2372: do_weyl = 1;
2373: asir_assert(ARG1(arg),O_LIST,"nd_weyl_nf");
2374: asir_assert(ARG2(arg),O_LIST,"nd_weyl_nf");
2375: asir_assert(ARG4(arg),O_N,"nd_weyl_nf");
2376: f = (Obj)ARG0(arg);
1.39 noro 2377: g = (LIST)ARG1(arg); g = remove_zero_from_list(g);
2378: if ( !BDY(g) ) {
2379: *rp = f; return;
2380: }
2381: v = (LIST)ARG2(arg);
1.46 noro 2382: create_order_spec(0,ARG3(arg),&ord);
2383: nd_nf_p(f,g,v,QTOS((Q)ARG4(arg)),ord,rp);
1.39 noro 2384: }
2385:
1.11 noro 2386: /* for Weyl algebra */
2387:
1.97 noro 2388: void Pdp_weyl_gr_main(NODE arg,LIST *rp)
1.11 noro 2389: {
2390: LIST f,v;
2391: Num homo;
2392: Q m;
1.49 noro 2393: int modular,ac;
1.46 noro 2394: struct order_spec *ord;
1.11 noro 2395:
1.49 noro 2396:
1.11 noro 2397: asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_main");
1.49 noro 2398: f = (LIST)ARG0(arg);
1.25 noro 2399: f = remove_zero_from_list(f);
2400: if ( !BDY(f) ) {
2401: *rp = f; return;
2402: }
1.53 noro 2403: if ( (ac = argc(arg)) == 5 ) {
1.49 noro 2404: asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_main");
2405: asir_assert(ARG2(arg),O_N,"dp_weyl_gr_main");
2406: asir_assert(ARG3(arg),O_N,"dp_weyl_gr_main");
2407: v = (LIST)ARG1(arg);
2408: homo = (Num)ARG2(arg);
2409: m = (Q)ARG3(arg);
2410: if ( !m )
2411: modular = 0;
2412: else if ( PL(NM(m))>1 || (PL(NM(m)) == 1 && BD(NM(m))[0] >= 0x80000000) )
2413: error("dp_weyl_gr_main : too large modulus");
2414: else
2415: modular = QTOS(m);
2416: create_order_spec(0,ARG4(arg),&ord);
1.53 noro 2417: } else if ( current_option )
2418: parse_gr_option(f,current_option,&v,&homo,&modular,&ord);
1.49 noro 2419: else if ( ac == 1 )
2420: parse_gr_option(f,0,&v,&homo,&modular,&ord);
1.11 noro 2421: else
1.49 noro 2422: error("dp_weyl_gr_main : invalid argument");
1.12 noro 2423: do_weyl = 1;
1.46 noro 2424: dp_gr_main(f,v,homo,modular,0,ord,rp);
1.16 noro 2425: do_weyl = 0;
2426: }
2427:
1.97 noro 2428: void Pdp_weyl_gr_f_main(NODE arg,LIST *rp)
1.16 noro 2429: {
2430: LIST f,v;
2431: Num homo;
1.46 noro 2432: struct order_spec *ord;
1.16 noro 2433:
2434: asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_main");
2435: asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_main");
2436: asir_assert(ARG2(arg),O_N,"dp_weyl_gr_main");
2437: asir_assert(ARG3(arg),O_N,"dp_weyl_gr_main");
2438: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
1.25 noro 2439: f = remove_zero_from_list(f);
2440: if ( !BDY(f) ) {
2441: *rp = f; return;
2442: }
1.16 noro 2443: homo = (Num)ARG2(arg);
1.46 noro 2444: create_order_spec(0,ARG3(arg),&ord);
1.16 noro 2445: do_weyl = 1;
1.46 noro 2446: dp_gr_main(f,v,homo,0,1,ord,rp);
1.12 noro 2447: do_weyl = 0;
1.11 noro 2448: }
2449:
1.97 noro 2450: void Pdp_weyl_f4_main(NODE arg,LIST *rp)
1.11 noro 2451: {
2452: LIST f,v;
1.46 noro 2453: struct order_spec *ord;
1.11 noro 2454:
2455: asir_assert(ARG0(arg),O_LIST,"dp_weyl_f4_main");
2456: asir_assert(ARG1(arg),O_LIST,"dp_weyl_f4_main");
2457: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
1.25 noro 2458: f = remove_zero_from_list(f);
2459: if ( !BDY(f) ) {
2460: *rp = f; return;
2461: }
1.46 noro 2462: create_order_spec(0,ARG2(arg),&ord);
1.12 noro 2463: do_weyl = 1;
1.46 noro 2464: dp_f4_main(f,v,ord,rp);
1.12 noro 2465: do_weyl = 0;
1.11 noro 2466: }
2467:
1.97 noro 2468: void Pdp_weyl_f4_mod_main(NODE arg,LIST *rp)
1.11 noro 2469: {
2470: LIST f,v;
2471: int m;
1.46 noro 2472: struct order_spec *ord;
1.11 noro 2473:
2474: asir_assert(ARG0(arg),O_LIST,"dp_weyl_f4_main");
2475: asir_assert(ARG1(arg),O_LIST,"dp_weyl_f4_main");
2476: asir_assert(ARG2(arg),O_N,"dp_f4_main");
2477: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); m = QTOS((Q)ARG2(arg));
1.25 noro 2478: f = remove_zero_from_list(f);
2479: if ( !BDY(f) ) {
2480: *rp = f; return;
2481: }
1.20 noro 2482: if ( !m )
2483: error("dp_weyl_f4_mod_main : invalid argument");
1.46 noro 2484: create_order_spec(0,ARG3(arg),&ord);
1.12 noro 2485: do_weyl = 1;
1.46 noro 2486: dp_f4_mod_main(f,v,m,ord,rp);
1.12 noro 2487: do_weyl = 0;
1.11 noro 2488: }
2489:
1.97 noro 2490: void Pdp_weyl_gr_mod_main(NODE arg,LIST *rp)
1.11 noro 2491: {
2492: LIST f,v;
2493: Num homo;
2494: int m;
1.46 noro 2495: struct order_spec *ord;
1.11 noro 2496:
2497: asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_mod_main");
2498: asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_mod_main");
2499: asir_assert(ARG2(arg),O_N,"dp_weyl_gr_mod_main");
2500: asir_assert(ARG3(arg),O_N,"dp_weyl_gr_mod_main");
1.8 noro 2501: f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);
1.25 noro 2502: f = remove_zero_from_list(f);
2503: if ( !BDY(f) ) {
2504: *rp = f; return;
2505: }
1.8 noro 2506: homo = (Num)ARG2(arg); m = QTOS((Q)ARG3(arg));
1.20 noro 2507: if ( !m )
2508: error("dp_weyl_gr_mod_main : invalid argument");
1.46 noro 2509: create_order_spec(0,ARG4(arg),&ord);
1.12 noro 2510: do_weyl = 1;
1.46 noro 2511: dp_gr_mod_main(f,v,homo,m,ord,rp);
1.12 noro 2512: do_weyl = 0;
1.1 noro 2513: }
1.8 noro 2514:
1.57 noro 2515: VECT current_dl_weight_vector_obj;
1.24 noro 2516: int *current_dl_weight_vector;
1.99 noro 2517: int dp_negative_weight;
1.24 noro 2518:
1.97 noro 2519: void Pdp_set_weight(NODE arg,VECT *rp)
1.24 noro 2520: {
2521: VECT v;
2522: int i,n;
1.45 noro 2523: NODE node;
1.24 noro 2524:
2525: if ( !arg )
2526: *rp = current_dl_weight_vector_obj;
2527: else if ( !ARG0(arg) ) {
2528: current_dl_weight_vector_obj = 0;
2529: current_dl_weight_vector = 0;
1.99 noro 2530: dp_negative_weight = 0;
1.24 noro 2531: *rp = 0;
2532: } else {
1.45 noro 2533: if ( OID(ARG0(arg)) != O_VECT && OID(ARG0(arg)) != O_LIST )
2534: error("dp_set_weight : invalid argument");
2535: if ( OID(ARG0(arg)) == O_VECT )
2536: v = (VECT)ARG0(arg);
2537: else {
2538: node = (NODE)BDY((LIST)ARG0(arg));
2539: n = length(node);
2540: MKVECT(v,n);
2541: for ( i = 0; i < n; i++, node = NEXT(node) )
2542: BDY(v)[i] = BDY(node);
2543: }
1.24 noro 2544: current_dl_weight_vector_obj = v;
2545: n = v->len;
2546: current_dl_weight_vector = (int *)CALLOC(n,sizeof(int));
2547: for ( i = 0; i < n; i++ )
2548: current_dl_weight_vector[i] = QTOS((Q)v->body[i]);
1.99 noro 2549: for ( i = 0; i < n; i++ )
2550: if ( current_dl_weight_vector[i] < 0 ) break;
2551: if ( i < n )
2552: dp_negative_weight = 1;
2553: else
2554: dp_negative_weight = 0;
1.24 noro 2555: *rp = v;
2556: }
2557: }
2558:
1.77 noro 2559: VECT current_module_weight_vector_obj;
2560: int *current_module_weight_vector;
2561:
1.97 noro 2562: void Pdp_set_module_weight(NODE arg,VECT *rp)
1.77 noro 2563: {
2564: VECT v;
2565: int i,n;
2566: NODE node;
2567:
2568: if ( !arg )
2569: *rp = current_module_weight_vector_obj;
2570: else if ( !ARG0(arg) ) {
2571: current_module_weight_vector_obj = 0;
2572: current_module_weight_vector = 0;
2573: *rp = 0;
2574: } else {
2575: if ( OID(ARG0(arg)) != O_VECT && OID(ARG0(arg)) != O_LIST )
2576: error("dp_module_set_weight : invalid argument");
2577: if ( OID(ARG0(arg)) == O_VECT )
2578: v = (VECT)ARG0(arg);
2579: else {
2580: node = (NODE)BDY((LIST)ARG0(arg));
2581: n = length(node);
2582: MKVECT(v,n);
2583: for ( i = 0; i < n; i++, node = NEXT(node) )
2584: BDY(v)[i] = BDY(node);
2585: }
2586: current_module_weight_vector_obj = v;
2587: n = v->len;
2588: current_module_weight_vector = (int *)CALLOC(n,sizeof(int));
2589: for ( i = 0; i < n; i++ )
2590: current_module_weight_vector[i] = QTOS((Q)v->body[i]);
2591: *rp = v;
2592: }
2593: }
2594:
1.93 noro 2595: extern Obj current_top_weight;
1.92 noro 2596: extern Obj nd_top_weight;
1.71 noro 2597:
1.92 noro 2598: void Pdp_set_top_weight(NODE arg,Obj *rp)
1.71 noro 2599: {
2600: VECT v;
1.92 noro 2601: MAT m;
2602: Obj obj;
2603: int i,j,n,id,row,col;
2604: Q *mi;
1.71 noro 2605: NODE node;
2606:
2607: if ( !arg )
1.92 noro 2608: *rp = current_top_weight;
1.71 noro 2609: else if ( !ARG0(arg) ) {
1.93 noro 2610: reset_top_weight();
1.71 noro 2611: *rp = 0;
2612: } else {
1.92 noro 2613: id = OID(ARG0(arg));
2614: if ( id != O_VECT && id != O_MAT && id != O_LIST )
1.71 noro 2615: error("dp_set_top_weight : invalid argument");
1.92 noro 2616: if ( id == O_LIST ) {
1.71 noro 2617: node = (NODE)BDY((LIST)ARG0(arg));
2618: n = length(node);
2619: MKVECT(v,n);
2620: for ( i = 0; i < n; i++, node = NEXT(node) )
2621: BDY(v)[i] = BDY(node);
1.97 noro 2622: obj = (Obj)v;
1.92 noro 2623: } else
2624: obj = ARG0(arg);
2625: if ( OID(obj) == O_VECT ) {
2626: v = (VECT)obj;
2627: for ( i = 0; i < v->len; i++ )
2628: if ( !INT(BDY(v)[i]) || (BDY(v)[i] && SGN((Q)BDY(v)[i]) < 0) )
2629: error("dp_set_top_weight : each element must be a non-negative integer");
2630: } else {
2631: m = (MAT)obj; row = m->row; col = m->col;
2632: for ( i = 0; i < row; i++ )
2633: for ( j = 0, mi = (Q *)BDY(m)[i]; j < col; j++ )
2634: if ( !INT(mi[j]) || (mi[j] && SGN((Q)mi[j]) < 0) )
2635: error("dp_set_top_weight : each element must be a non-negative integer");
2636: }
2637: current_top_weight = obj;
2638: nd_top_weight = obj;
2639: *rp = current_top_weight;
1.71 noro 2640: }
2641: }
2642:
1.72 noro 2643: LIST get_denomlist();
2644:
2645: void Pdp_get_denomlist(LIST *rp)
2646: {
2647: *rp = get_denomlist();
2648: }
2649:
1.24 noro 2650: static VECT current_weyl_weight_vector_obj;
2651: int *current_weyl_weight_vector;
1.15 noro 2652:
1.97 noro 2653: void Pdp_weyl_set_weight(NODE arg,VECT *rp)
1.15 noro 2654: {
2655: VECT v;
1.85 noro 2656: NODE node;
1.15 noro 2657: int i,n;
2658:
2659: if ( !arg )
1.24 noro 2660: *rp = current_weyl_weight_vector_obj;
1.78 noro 2661: else if ( !ARG0(arg) ) {
2662: current_weyl_weight_vector_obj = 0;
2663: current_weyl_weight_vector = 0;
2664: *rp = 0;
2665: } else {
1.85 noro 2666: if ( OID(ARG0(arg)) != O_VECT && OID(ARG0(arg)) != O_LIST )
2667: error("dp_weyl_set_weight : invalid argument");
2668: if ( OID(ARG0(arg)) == O_VECT )
2669: v = (VECT)ARG0(arg);
2670: else {
2671: node = (NODE)BDY((LIST)ARG0(arg));
2672: n = length(node);
2673: MKVECT(v,n);
2674: for ( i = 0; i < n; i++, node = NEXT(node) )
2675: BDY(v)[i] = BDY(node);
2676: }
1.24 noro 2677: current_weyl_weight_vector_obj = v;
1.15 noro 2678: n = v->len;
1.24 noro 2679: current_weyl_weight_vector = (int *)CALLOC(n,sizeof(int));
1.15 noro 2680: for ( i = 0; i < n; i++ )
1.24 noro 2681: current_weyl_weight_vector[i] = QTOS((Q)v->body[i]);
1.15 noro 2682: *rp = v;
2683: }
1.25 noro 2684: }
2685:
1.82 noro 2686: NODE mono_raddec(NODE ideal);
2687:
2688: void Pdp_mono_raddec(NODE arg,LIST *rp)
2689: {
2690: NODE ideal,rd,t,t1,r,r1,u;
2691: VL vl0,vl;
2692: int nv,i,bpi;
2693: int *s;
2694: DP dp;
2695: P *v;
2696: LIST l;
2697:
2698: ideal = BDY((LIST)ARG0(arg));
2699: if ( !ideal ) *rp = (LIST)ARG0(arg);
2700: else {
2701: t = BDY((LIST)ARG1(arg));
2702: nv = length(t);
1.97 noro 2703: v = (P *)MALLOC(nv*sizeof(P));
1.82 noro 2704: for ( vl0 = 0, i = 0; t; t = NEXT(t), i++ ) {
2705: NEXTVL(vl0,vl); VR(vl) = VR((P)BDY(t));
2706: MKV(VR(vl),v[i]);
2707: }
2708: if ( vl0 ) NEXT(vl) = 0;
2709: for ( t = 0, r = ideal; r; r = NEXT(r) ) {
2710: ptod(CO,vl0,BDY(r),&dp); MKNODE(t1,dp,t); t = t1;
2711: }
2712: rd = mono_raddec(t);
2713: r = 0;
2714: bpi = (sizeof(int)/sizeof(char))*8;
2715: for ( u = rd; u; u = NEXT(u) ) {
2716: s = (int *)BDY(u);
2717: for ( i = nv-1, t = 0; i >= 0; i-- )
2718: if ( s[i/bpi]&(1<<(i%bpi)) ) {
2719: MKNODE(t1,v[i],t); t = t1;
2720: }
2721: MKLIST(l,t); MKNODE(r1,l,r); r = r1;
2722: }
2723: MKLIST(*rp,r);
2724: }
2725: }
2726:
1.84 noro 2727: void Pdp_mono_reduce(NODE arg,LIST *rp)
2728: {
2729: NODE t,t0,t1,r0,r;
2730: int i,n;
2731: DP m;
2732: DP *a;
2733:
2734: t0 = BDY((LIST)ARG0(arg));
2735: t1 = BDY((LIST)ARG1(arg));
2736: n = length(t0);
2737: a = (DP *)MALLOC(n*sizeof(DP));
2738: for ( i = 0; i < n; i++, t0 = NEXT(t0) ) a[i] = (DP)BDY(t0);
2739: for ( t = t1; t; t = NEXT(t) ) {
2740: m = (DP)BDY(t);
2741: for ( i = 0; i < n; i++ )
2742: if ( a[i] && dp_redble(a[i],m) ) a[i] = 0;
2743: }
2744: for ( i = n-1, r0 = 0; i >= 0; i-- )
2745: if ( a[i] ) { NEXTNODE(r0,r); BDY(r) = a[i]; }
2746: if ( r0 ) NEXT(r) = 0;
2747: MKLIST(*rp,r0);
2748: }
2749:
1.94 noro 2750: #define BLEN (8*sizeof(unsigned long))
2751:
2752: void showmat2(unsigned long **a,int row,int col)
2753: {
2754: int i,j;
2755:
2756: for ( i = 0; i < row; i++, putchar('\n') )
2757: for ( j = 0; j < col; j++ )
2758: if ( a[i][j/BLEN] & (1L<<(j%BLEN)) ) putchar('1');
2759: else putchar('0');
2760: }
2761:
2762: int rref2(unsigned long **a,int row,int col)
2763: {
2764: int i,j,k,l,s,wcol,wj;
2765: unsigned long bj;
2766: unsigned long *ai,*ak,*as,*t;
2767: int *pivot;
2768:
2769: wcol = (col+BLEN-1)/BLEN;
2770: pivot = (int *)MALLOC_ATOMIC(row*sizeof(int));
2771: i = 0;
2772: for ( j = 0; j < col; j++ ) {
2773: wj = j/BLEN; bj = 1L<<(j%BLEN);
2774: for ( k = i; k < row; k++ )
2775: if ( a[k][wj] & bj ) break;
2776: if ( k == row ) continue;
2777: pivot[i] = j;
2778: if ( k != i ) {
2779: t = a[i]; a[i] = a[k]; a[k] = t;
2780: }
2781: ai = a[i];
2782: for ( k = i+1; k < row; k++ ) {
2783: ak = a[k];
2784: if ( ak[wj] & bj ) {
2785: for ( l = wj; l < wcol; l++ )
2786: ak[l] ^= ai[l];
2787: }
2788: }
2789: i++;
2790: }
2791: for ( k = i-1; k >= 0; k-- ) {
2792: j = pivot[k]; wj = j/BLEN; bj = 1L<<(j%BLEN);
2793: ak = a[k];
2794: for ( s = 0; s < k; s++ ) {
2795: as = a[s];
2796: if ( as[wj] & bj ) {
2797: for ( l = wj; l < wcol; l++ )
2798: as[l] ^= ak[l];
2799: }
2800: }
2801: }
2802: return i;
2803: }
2804:
2805: void Pdp_rref2(NODE arg,VECT *rp)
2806: {
2807: VECT f,term,ret;
2808: int row,col,wcol,size,nv,i,j,rank,td;
2809: unsigned long **mat;
2810: unsigned long *v;
2811: DL d;
2812: DL *t;
2813: DP dp;
2814: MP m,m0;
2815:
2816: f = (VECT)ARG0(arg);
2817: row = f->len;
2818: term = (VECT)ARG1(arg);
2819: col = term->len;
2820: mat = (unsigned long **)MALLOC(row*sizeof(unsigned long *));
2821: size = sizeof(unsigned long)*((col+BLEN-1)/BLEN);
2822: nv = ((DP)term->body[0])->nv;
2823: t = (DL *)MALLOC(col*sizeof(DL));
2824: for ( i = 0; i < col; i++ ) t[i] = BDY((DP)BDY(term)[i])->dl;
2825: for ( i = 0; i < row; i++ ) {
2826: v = mat[i] = (unsigned long *)MALLOC_ATOMIC_IGNORE_OFF_PAGE(size);
2827: bzero(v,size);
2828: for ( j = 0, m = BDY((DP)BDY(f)[i]); m; m = NEXT(m) ) {
2829: d = m->dl;
2830: for ( ; !dl_equal(nv,d,t[j]); j++ );
2831: v[j/BLEN] |= 1L <<(j%BLEN);
2832: }
2833: }
2834: rank = rref2(mat,row,col);
2835: MKVECT(ret,rank);
2836: *rp = ret;
2837: for ( i = 0; i < rank; i++ ) {
2838: v = mat[i];
2839: m0 = 0;
2840: td = 0;
2841: for ( j = 0; j < col; j++ ) {
2842: if ( v[j/BLEN] & (1L<<(j%BLEN)) ) {
2843: NEXTMP(m0,m);
2844: m->dl = t[j];
2845: m->c = (P)ONE;
2846: td = MAX(td,m->dl->td);
2847: }
2848: }
2849: NEXT(m) = 0;
2850: MKDP(nv,m0,dp);
2851: dp->sugar = td;
2852: BDY(ret)[i] = (pointer)dp;
2853: }
2854: }
2855:
1.95 noro 2856: #define HDL(f) (BDY(f)->dl)
2857:
2858: NODE sumi_criB(int nv,NODE d,DP *f,int m)
2859: {
2860: LIST p;
2861: NODE r0,r;
2862: int p0,p1;
2863: DL p2,lcm;
2864:
2865: NEWDL(lcm,nv);
2866: r0 = 0;
2867: for ( ; d; d = NEXT(d) ) {
2868: p = (LIST)BDY(d);
2869: p0 = QTOS((Q)ARG0(BDY(p)));
2870: p1 = QTOS((Q)ARG1(BDY(p)));
2871: p2 = HDL((DP)ARG2(BDY(p)));
2872: if(!_dl_redble(HDL((DP)f[m]),p2,nv) ||
2873: dl_equal(nv,lcm_of_DL(nv,HDL(f[p0]),HDL(f[m]),lcm),p2) ||
2874: dl_equal(nv,lcm_of_DL(nv,HDL(f[p1]),HDL(f[m]),lcm),p2) ) {
2875: NEXTNODE(r0,r);
2876: BDY(r) = p;
2877: }
2878: }
2879: if ( r0 ) NEXT(r) = 0;
2880: return r0;
2881: }
2882:
2883: NODE sumi_criFMD(int nv,DP *f,int m)
2884: {
2885: DL *a;
2886: DL l1,dl1,dl2;
2887: int i,j,k,k2;
2888: NODE r,r1,nd;
2889: MP mp;
2890: DP u;
2891: Q iq,mq;
2892: LIST list;
2893:
2894: /* a[i] = lcm(LT(f[i]),LT(f[m])) */
2895: a = (DL *)ALLOCA(m*sizeof(DL));
2896: for ( i = 0; i < m; i++ ) {
2897: a[i] = lcm_of_DL(nv,HDL(f[i]),HDL(f[m]),0);
2898: }
2899: r = 0;
2900: for( i = 0; i < m; i++) {
2901: l1 = a[i];
2902: if ( !l1 ) continue;
2903: /* Tkm = Tim (k<i) */
2904: for( k = 0; k < i; k++)
2905: if( dl_equal(nv,l1,a[k]) ) break;
2906: if( k == i ){
2907: /* Tk|Tim && Tkm != Tim (k<m) */
2908: for ( k2 = 0; k2 < m; k2++ )
2909: if ( _dl_redble(HDL(f[k2]),l1,nv) &&
2910: !dl_equal(nv,l1,a[k2]) ) break;
2911: if ( k2 == m ) {
2912: dl1 = HDL(f[i]); dl2 = HDL(f[m]);
2913: for ( k2 = 0; k2 < nv; k2++ )
2914: if ( dl1->d[k2] && dl2->d[k2] ) break;
2915: if ( k2 < nv ) {
2916: NEWMP(mp); mp->dl = l1; C(mp) = (P)ONE;
2917: NEXT(mp) = 0; MKDP(nv,mp,u); u->sugar = l1->td;
2918: STOQ(i,iq); STOQ(m,mq);
2919: nd = mknode(3,iq,mq,u);
2920: MKLIST(list,nd);
2921: MKNODE(r1,list,r);
2922: r = r1;
2923: }
2924: }
2925: }
2926: }
2927: return r;
2928: }
2929:
2930: LIST sumi_updatepairs(LIST d,DP *f,int m)
2931: {
2932: NODE old,new,t;
2933: LIST l;
2934: int nv;
2935:
2936: nv = f[0]->nv;
2937: old = sumi_criB(nv,BDY(d),f,m);
2938: new = sumi_criFMD(nv,f,m);
2939: if ( !new ) new = old;
2940: else {
2941: for ( t = new ; NEXT(t); t = NEXT(t) );
2942: NEXT(t) = old;
2943: }
2944: MKLIST(l,new);
2945: return l;
2946: }
2947:
2948: VECT ltov(LIST l)
2949: {
2950: NODE n;
2951: int i,len;
2952: VECT v;
2953:
2954: n = BDY(l);
2955: len = length(n);
2956: MKVECT(v,len);
2957: for ( i = 0; i < len; i++, n = NEXT(n) )
2958: BDY(v)[i] = BDY(n);
2959: return v;
2960: }
2961:
2962: DL subdl(int nv,DL d1,DL d2)
2963: {
2964: int i;
2965: DL d;
2966:
2967: NEWDL(d,nv);
2968: d->td = d1->td-d2->td;
2969: for ( i = 0; i < nv; i++ )
2970: d->d[i] = d1->d[i]-d2->d[i];
2971: return d;
2972: }
2973:
2974: DP dltodp(int nv,DL d)
2975: {
2976: MP mp;
2977: DP dp;
2978:
2979: NEWMP(mp); mp->dl = d; C(mp) = (P)ONE;
2980: NEXT(mp) = 0; MKDP(nv,mp,dp); dp->sugar = d->td;
2981: return dp;
2982: }
2983:
2984: LIST sumi_simplify(int nv,DL t,DP p,NODE f2,int simp)
2985: {
2986: DL d,h,hw;
2987: DP u,w,dp;
2988: int n,i,last;
2989: LIST *v;
2990: LIST list;
2991: NODE s,r;
2992:
2993: d = t; u = p;
2994: /* only the last history is used */
2995: if ( f2 && simp && t->td != 0 ) {
2996: adddl(nv,t,HDL(p),&h);
2997: n = length(f2);
2998: last = 1;
2999: if ( simp > 1 ) last = n;
3000: v = (LIST *)ALLOCA(n*sizeof(LIST));
3001: for ( r = f2, i = 0; r; r = NEXT(r), i++ ) v[n-i-1] = BDY(r);
3002: for ( i = 0; i < last; i++ ) {
3003: for ( s = BDY((LIST)v[i]); s; s = NEXT(s) ) {
3004: w = (DP)BDY(s); hw = HDL(w);
3005: if ( _dl_redble(hw,h,nv) ) {
3006: u = w;
3007: d = subdl(nv,h,hw);
3008: goto fin;
3009: }
3010: }
3011: }
3012: }
3013: fin:
3014: dp = dltodp(nv,d);
3015: r = mknode(2,dp,u);
3016: MKLIST(list,r);
3017: return list;
3018: }
3019:
3020: LIST sumi_symbolic(NODE l,int q,NODE f2,DP *g,int simp)
3021: {
3022: int nv;
3023: NODE t,r;
3024: NODE f0,f,fd0,fd,done0,done,red0,red;
3025: DL h,d;
3026: DP mul;
3027: int m;
3028: LIST tp,l0,l1,l2,l3,list;
3029: VECT v0,v1,v2,v3;
3030:
3031: nv = ((DP)BDY(l))->nv;
3032: t = 0;
3033:
3034: f0 = 0; fd0 = 0; done0 = 0; red0 = 0;
3035:
3036: for ( ; l; l = NEXT(l) ) {
3037: t = symb_merge(t,dp_dllist((DP)BDY(l)),nv);
3038: NEXTNODE(fd0,fd); BDY(fd) = BDY(l);
3039: }
3040:
3041: while ( t ) {
3042: h = (DL)BDY(t);
3043: NEXTNODE(done0,done); BDY(done) = dltodp(nv,h);
3044: t = NEXT(t);
3045: for(m = 0; m < q; m++)
3046: if ( _dl_redble(HDL(g[m]),h,nv) ) break;
3047: if ( m == q ) {
3048: } else {
3049: d = subdl(nv,h,HDL(g[m]));
3050: tp = sumi_simplify(nv,d,g[m],f2,simp);
3051:
3052: muldm(CO,ARG1(BDY(tp)),BDY((DP)ARG0(BDY(tp))),&mul);
3053: t = symb_merge(t,NEXT(dp_dllist(mul)),nv);
3054:
3055: NEXTNODE(f0,f); BDY(f) = tp;
3056: NEXTNODE(fd0,fd); BDY(fd) = mul;
3057: NEXTNODE(red0,red); BDY(red) = mul;
3058: }
3059: }
3060: if ( fd0 ) NEXT(fd) = 0; MKLIST(l0,fd0);
3061: v0 = ltov(l0);
3062: if ( done0 ) NEXT(done) = 0; MKLIST(l1,done0);
3063: v1 = ltov(l1);
3064: if ( f0 ) NEXT(f) = 0; MKLIST(l2,f0);
3065: v2 = ltov(l2);
3066: if ( red0 ) NEXT(red) = 0; MKLIST(l3,red0);
3067: v3 = ltov(l3);
3068: r = mknode(4,v0,v1,v2,v3);
3069: MKLIST(list,r);
3070: return list;
3071: }
3072:
3073: void Psumi_symbolic(NODE arg,LIST *rp)
3074: {
3075: NODE l,f2;
3076: DP *g;
3077: int q,simp;
3078:
3079: l = BDY((LIST)ARG0(arg));
3080: q = QTOS((Q)ARG1(arg));
3081: f2 = BDY((LIST)ARG2(arg));
3082: g = (DP *)BDY((VECT)ARG3(arg));
3083: simp = QTOS((Q)ARG4(arg));
3084: *rp = sumi_symbolic(l,q,f2,g,simp);
3085: }
3086:
3087: void Psumi_updatepairs(NODE arg,LIST *rp)
3088: {
3089: LIST d,l;
3090: DP *f;
3091: int m;
3092:
3093: d = (LIST)ARG0(arg);
3094: f = (DP *)BDY((VECT)ARG1(arg));
3095: m = QTOS((Q)ARG2(arg));
3096: *rp = sumi_updatepairs(d,f,m);
3097: }
3098:
1.25 noro 3099: LIST remove_zero_from_list(LIST l)
3100: {
3101: NODE n,r0,r;
3102: LIST rl;
3103:
3104: asir_assert(l,O_LIST,"remove_zero_from_list");
3105: n = BDY(l);
3106: for ( r0 = 0; n; n = NEXT(n) )
3107: if ( BDY(n) ) {
3108: NEXTNODE(r0,r);
3109: BDY(r) = BDY(n);
3110: }
3111: if ( r0 )
3112: NEXT(r) = 0;
3113: MKLIST(rl,r0);
3114: return rl;
1.26 noro 3115: }
3116:
3117: int get_field_type(P p)
3118: {
3119: int type,t;
3120: DCP dc;
3121:
3122: if ( !p )
3123: return 0;
3124: else if ( NUM(p) )
3125: return NID((Num)p);
3126: else {
3127: type = 0;
3128: for ( dc = DC(p); dc; dc = NEXT(dc) ) {
3129: t = get_field_type(COEF(dc));
3130: if ( !t )
3131: continue;
3132: if ( t < 0 )
3133: return t;
3134: if ( !type )
3135: type = t;
3136: else if ( t != type )
3137: return -1;
3138: }
3139: return type;
1.52 noro 3140: }
3141: }
3142:
3143: void Pdpv_ord(NODE arg,Obj *rp)
3144: {
3145: int ac,id;
3146: LIST shift;
3147:
3148: ac = argc(arg);
3149: if ( ac ) {
3150: id = QTOS((Q)ARG0(arg));
3151: if ( ac > 1 && ARG1(arg) && OID((Obj)ARG1(arg))==O_LIST )
3152: shift = (LIST)ARG1(arg);
3153: else
3154: shift = 0;
3155: create_modorder_spec(id,shift,&dp_current_modspec);
3156: }
3157: *rp = dp_current_modspec->obj;
3158: }
3159:
3160: void Pdpv_ht(NODE arg,LIST *rp)
3161: {
3162: NODE n;
3163: DP ht;
3164: int pos;
3165: DPV p;
3166: Q q;
3167:
3168: asir_assert(ARG0(arg),O_DPV,"dpv_ht");
3169: p = (DPV)ARG0(arg);
3170: pos = dpv_hp(p);
3171: if ( pos < 0 )
3172: ht = 0;
3173: else
3174: dp_ht(BDY(p)[pos],&ht);
3175: STOQ(pos,q);
3176: n = mknode(2,q,ht);
3177: MKLIST(*rp,n);
3178: }
3179:
3180: void Pdpv_hm(NODE arg,LIST *rp)
3181: {
3182: NODE n;
3183: DP ht;
3184: int pos;
3185: DPV p;
3186: Q q;
3187:
3188: asir_assert(ARG0(arg),O_DPV,"dpv_hm");
3189: p = (DPV)ARG0(arg);
3190: pos = dpv_hp(p);
3191: if ( pos < 0 )
3192: ht = 0;
3193: else
3194: dp_hm(BDY(p)[pos],&ht);
3195: STOQ(pos,q);
3196: n = mknode(2,q,ht);
3197: MKLIST(*rp,n);
3198: }
3199:
3200: void Pdpv_hc(NODE arg,LIST *rp)
3201: {
3202: NODE n;
3203: P hc;
3204: int pos;
3205: DPV p;
3206: Q q;
3207:
3208: asir_assert(ARG0(arg),O_DPV,"dpv_hc");
3209: p = (DPV)ARG0(arg);
3210: pos = dpv_hp(p);
3211: if ( pos < 0 )
3212: hc = 0;
3213: else
3214: hc = BDY(BDY(p)[pos])->c;
3215: STOQ(pos,q);
3216: n = mknode(2,q,hc);
3217: MKLIST(*rp,n);
3218: }
3219:
3220: int dpv_hp(DPV p)
3221: {
3222: int len,i,maxp,maxw,w,slen;
3223: int *shift;
3224: DP *e;
3225:
3226: len = p->len;
3227: e = p->body;
3228: slen = dp_current_modspec->len;
3229: shift = dp_current_modspec->degree_shift;
3230: switch ( dp_current_modspec->id ) {
3231: case ORD_REVGRADLEX:
3232: for ( maxp = -1, i = 0; i < len; i++ )
3233: if ( !e[i] ) continue;
3234: else if ( maxp < 0 ) {
3235: maxw = BDY(e[i])->dl->td+(i<slen?shift[i]:0); maxp = i;
3236: } else {
3237: w = BDY(e[i])->dl->td+(i<slen?shift[i]:0);
3238: if ( w >= maxw ) {
3239: maxw = w; maxp = i;
3240: }
3241: }
3242: return maxp;
3243: case ORD_GRADLEX:
3244: for ( maxp = -1, i = 0; i < len; i++ )
3245: if ( !e[i] ) continue;
3246: else if ( maxp < 0 ) {
3247: maxw = BDY(e[i])->dl->td+(i<slen?shift[i]:0); maxp = i;
3248: } else {
3249: w = BDY(e[i])->dl->td+(i<slen?shift[i]:0);
3250: if ( w > maxw ) {
3251: maxw = w; maxp = i;
3252: }
3253: }
3254: return maxp;
3255: break;
3256: case ORD_LEX:
3257: for ( i = 0; i < len; i++ )
3258: if ( e[i] ) return i;
3259: return -1;
3260: break;
1.26 noro 3261: }
1.15 noro 3262: }
1.81 noro 3263:
3264: int get_opt(char *key0,Obj *r) {
3265: NODE tt,p;
3266: char *key;
3267:
3268: if ( current_option ) {
3269: for ( tt = current_option; tt; tt = NEXT(tt) ) {
3270: p = BDY((LIST)BDY(tt));
3271: key = BDY((STRING)BDY(p));
3272: /* value = (Obj)BDY(NEXT(p)); */
3273: if ( !strcmp(key,key0) ) {
3274: *r = (Obj)BDY(NEXT(p));
3275: return 1;
3276: }
3277: }
3278: }
3279: return 0;
3280: }
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 / asir2000 / builtin