=================================================================== RCS file: /home/cvs/OpenXM_contrib2/asir2000/builtin/dp.c,v retrieving revision 1.10 retrieving revision 1.50 diff -u -p -r1.10 -r1.50 --- OpenXM_contrib2/asir2000/builtin/dp.c 2000/12/08 06:43:09 1.10 +++ OpenXM_contrib2/asir2000/builtin/dp.c 2004/04/15 08:27:42 1.50 @@ -45,22 +45,25 @@ * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. * - * $OpenXM: OpenXM_contrib2/asir2000/builtin/dp.c,v 1.9 2000/12/08 02:39:05 noro Exp $ + * $OpenXM: OpenXM_contrib2/asir2000/builtin/dp.c,v 1.49 2004/04/15 08:14:13 noro Exp $ */ #include "ca.h" #include "base.h" #include "parse.h" -extern int dp_fcoeffs; extern int dp_nelim; extern int dp_order_pair_length; extern struct order_pair *dp_order_pair; -extern struct order_spec dp_current_spec; +extern struct order_spec *dp_current_spec; +int do_weyl; +void Pdp_sort(); +void Pdp_mul_trunc(),Pdp_quo(); void Pdp_ord(), Pdp_ptod(), Pdp_dtop(); void Pdp_ptozp(), Pdp_ptozp2(), Pdp_red(), Pdp_red2(), Pdp_lcm(), Pdp_redble(); void Pdp_sp(), Pdp_hm(), Pdp_ht(), Pdp_hc(), Pdp_rest(), Pdp_td(), Pdp_sugar(); +void Pdp_set_sugar(); void Pdp_cri1(),Pdp_cri2(),Pdp_subd(),Pdp_mod(),Pdp_red_mod(),Pdp_tdiv(); void Pdp_prim(),Pdp_red_coef(),Pdp_mag(),Pdp_set_kara(),Pdp_rat(); void Pdp_nf(),Pdp_true_nf(); @@ -68,14 +71,38 @@ void Pdp_nf_mod(),Pdp_true_nf_mod(); void Pdp_criB(),Pdp_nelim(); void Pdp_minp(),Pdp_sp_mod(); void Pdp_homo(),Pdp_dehomo(); -void Pdp_gr_mod_main(); +void Pdp_gr_mod_main(),Pdp_gr_f_main(); void Pdp_gr_main(),Pdp_gr_hm_main(),Pdp_gr_d_main(),Pdp_gr_flags(); -void Pdp_f4_main(),Pdp_f4_mod_main(); +void Pdp_f4_main(),Pdp_f4_mod_main(),Pdp_f4_f_main(); void Pdp_gr_print(); -void Pdp_mbase(),Pdp_lnf_mod(),Pdp_nf_tab_mod(),Pdp_mdtod(); +void Pdp_mbase(),Pdp_lnf_mod(),Pdp_nf_tab_mod(),Pdp_mdtod(), Pdp_nf_tab_f(); void Pdp_vtoe(), Pdp_etov(), Pdp_dtov(), Pdp_idiv(), Pdp_sep(); void Pdp_cont(); +void Pdp_gr_checklist(); +void Pdp_weyl_red(); +void Pdp_weyl_sp(); +void Pdp_weyl_nf(),Pdp_weyl_nf_mod(); +void Pdp_weyl_gr_main(),Pdp_weyl_gr_mod_main(),Pdp_weyl_gr_f_main(); +void Pdp_weyl_f4_main(),Pdp_weyl_f4_mod_main(),Pdp_weyl_f4_f_main(); +void Pdp_weyl_mul(),Pdp_weyl_mul_mod(); +void Pdp_weyl_set_weight(); +void Pdp_set_weight(); +void Pdp_nf_f(),Pdp_weyl_nf_f(); +void Pdp_lnf_f(); +void Pnd_gr(),Pnd_gr_trace(),Pnd_f4(); +void Pnd_weyl_gr(),Pnd_weyl_gr_trace(); +void Pnd_nf(); +void Pdp_initial_term(); +void Pdp_order(); + +LIST dp_initial_term(); +LIST dp_order(); +void parse_gr_option(LIST f,NODE opt,LIST *v,Num *homo, + int *modular,struct order_spec **ord); + +LIST remove_zero_from_list(LIST); + struct ftab dp_tab[] = { /* content reduction */ {"dp_ptozp",Pdp_ptozp,1}, @@ -84,6 +111,11 @@ struct ftab dp_tab[] = { {"dp_red_coef",Pdp_red_coef,2}, {"dp_cont",Pdp_cont,1}, +/* polynomial ring */ + /* special operations */ + {"dp_mul_trunc",Pdp_mul_trunc,3}, + {"dp_quo",Pdp_quo,2}, + /* s-poly */ {"dp_sp",Pdp_sp,2}, {"dp_sp_mod",Pdp_sp_mod,3}, @@ -94,25 +126,65 @@ struct ftab dp_tab[] = { /* normal form */ {"dp_nf",Pdp_nf,4}, + {"dp_nf_f",Pdp_nf_f,4}, {"dp_true_nf",Pdp_true_nf,4}, {"dp_nf_mod",Pdp_nf_mod,5}, {"dp_true_nf_mod",Pdp_true_nf_mod,5}, {"dp_lnf_mod",Pdp_lnf_mod,3}, + {"dp_nf_tab_f",Pdp_nf_tab_f,2}, {"dp_nf_tab_mod",Pdp_nf_tab_mod,3}, + {"dp_lnf_f",Pdp_lnf_f,2}, /* Buchberger algorithm */ - {"dp_gr_main",Pdp_gr_main,5}, + {"dp_gr_main",Pdp_gr_main,-5}, {"dp_gr_mod_main",Pdp_gr_mod_main,5}, + {"dp_gr_f_main",Pdp_gr_f_main,4}, + {"dp_gr_checklist",Pdp_gr_checklist,2}, + {"nd_f4",Pnd_f4,4}, + {"nd_gr",Pnd_gr,4}, + {"nd_gr_trace",Pnd_gr_trace,5}, + {"nd_weyl_gr",Pnd_weyl_gr,4}, + {"nd_weyl_gr_trace",Pnd_weyl_gr_trace,5}, + {"nd_nf",Pnd_nf,5}, /* F4 algorithm */ {"dp_f4_main",Pdp_f4_main,3}, {"dp_f4_mod_main",Pdp_f4_mod_main,4}, +/* weyl algebra */ + /* multiplication */ + {"dp_weyl_mul",Pdp_weyl_mul,2}, + {"dp_weyl_mul_mod",Pdp_weyl_mul_mod,3}, + + /* s-poly */ + {"dp_weyl_sp",Pdp_weyl_sp,2}, + + /* m-reduction */ + {"dp_weyl_red",Pdp_weyl_red,3}, + + /* normal form */ + {"dp_weyl_nf",Pdp_weyl_nf,4}, + {"dp_weyl_nf_mod",Pdp_weyl_nf_mod,5}, + {"dp_weyl_nf_f",Pdp_weyl_nf_f,4}, + + /* Buchberger algorithm */ + {"dp_weyl_gr_main",Pdp_weyl_gr_main,-5}, + {"dp_weyl_gr_mod_main",Pdp_weyl_gr_mod_main,5}, + {"dp_weyl_gr_f_main",Pdp_weyl_gr_f_main,4}, + + /* F4 algorithm */ + {"dp_weyl_f4_main",Pdp_weyl_f4_main,3}, + {"dp_weyl_f4_mod_main",Pdp_weyl_f4_mod_main,4}, + + /* misc */ + {"dp_set_weight",Pdp_set_weight,-1}, + {"dp_weyl_set_weight",Pdp_weyl_set_weight,-1}, {0,0,0}, }; struct ftab dp_supp_tab[] = { /* setting flags */ + {"dp_sort",Pdp_sort,1}, {"dp_ord",Pdp_ord,-1}, {"dp_set_kara",Pdp_set_kara,-1}, {"dp_nelim",Pdp_nelim,-1}, @@ -143,11 +215,14 @@ struct ftab dp_supp_tab[] = { {"dp_ht",Pdp_ht,1}, {"dp_hc",Pdp_hc,1}, {"dp_rest",Pdp_rest,1}, + {"dp_initial_term",Pdp_initial_term,1}, + {"dp_order",Pdp_order,1}, /* degree and size */ {"dp_td",Pdp_td,1}, {"dp_mag",Pdp_mag,1}, {"dp_sugar",Pdp_sugar,1}, + {"dp_set_sugar",Pdp_set_sugar,2}, /* misc */ {"dp_mbase",Pdp_mbase,1}, @@ -160,6 +235,13 @@ struct ftab dp_supp_tab[] = { {0,0,0} }; +void Pdp_sort(arg,rp) +NODE arg; +DP *rp; +{ + dp_sort((DP)ARG0(arg),rp); +} + void Pdp_mdtod(arg,rp) NODE arg; DP *rp; @@ -276,7 +358,7 @@ DP *rp; n = v->len; NEWDL(dl,n); d = dl->d; for ( i = 0, td = 0; i < n; i++ ) { - d[i] = QTOS((Q)(v->body[i])); td += d[i]; + d[i] = QTOS((Q)(v->body[i])); td += MUL_WEIGHT(d[i],i); } dl->td = td; NEWMP(m); m->dl = dl; m->c = (P)ONE; NEXT(m) = 0; @@ -303,6 +385,22 @@ LIST *rp; NEXT(NEXT(n)) = 0; MKLIST(*rp,n); } +void Pdp_lnf_f(arg,rp) +NODE arg; +LIST *rp; +{ + DP r1,r2; + NODE b,g,n; + + asir_assert(ARG0(arg),O_LIST,"dp_lnf_f"); + asir_assert(ARG1(arg),O_LIST,"dp_lnf_f"); + b = BDY((LIST)ARG0(arg)); g = BDY((LIST)ARG1(arg)); + dp_lnf_f((DP)BDY(b),(DP)BDY(NEXT(b)),g,&r1,&r2); + NEWNODE(n); BDY(n) = (pointer)r1; + NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)r2; + NEXT(NEXT(n)) = 0; MKLIST(*rp,n); +} + void Pdp_nf_tab_mod(arg,rp) NODE arg; DP *rp; @@ -314,18 +412,27 @@ DP *rp; QTOS((Q)ARG2(arg)),rp); } +void Pdp_nf_tab_f(arg,rp) +NODE arg; +DP *rp; +{ + asir_assert(ARG0(arg),O_DP,"dp_nf_tab_f"); + asir_assert(ARG1(arg),O_VECT,"dp_nf_tab_f"); + dp_nf_tab_f((DP)ARG0(arg),(LIST *)BDY((VECT)ARG1(arg)),rp); +} + void Pdp_ord(arg,rp) NODE arg; Obj *rp; { - struct order_spec spec; + struct order_spec *spec; if ( !arg ) - *rp = dp_current_spec.obj; - else if ( !create_order_spec((Obj)ARG0(arg),&spec) ) + *rp = dp_current_spec->obj; + else if ( !create_order_spec(0,(Obj)ARG0(arg),&spec) ) error("dp_ord : invalid order specification"); else { - initd(&spec); *rp = spec.obj; + initd(spec); *rp = spec->obj; } } @@ -445,6 +552,7 @@ DP *rp; DP g; int full; + do_weyl = 0; asir_assert(ARG0(arg),O_LIST,"dp_nf"); asir_assert(ARG1(arg),O_DP,"dp_nf"); asir_assert(ARG2(arg),O_VECT,"dp_nf"); @@ -454,9 +562,110 @@ DP *rp; } b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg)); full = (Q)ARG3(arg) ? 1 : 0; - dp_nf_ptozp(b,g,ps,full,DP_Multiple,rp); + dp_nf_z(b,g,ps,full,DP_Multiple,rp); } +void Pdp_weyl_nf(arg,rp) +NODE arg; +DP *rp; +{ + NODE b; + DP *ps; + DP g; + int full; + + asir_assert(ARG0(arg),O_LIST,"dp_weyl_nf"); + asir_assert(ARG1(arg),O_DP,"dp_weyl_nf"); + asir_assert(ARG2(arg),O_VECT,"dp_weyl_nf"); + asir_assert(ARG3(arg),O_N,"dp_weyl_nf"); + if ( !(g = (DP)ARG1(arg)) ) { + *rp = 0; return; + } + b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg)); + full = (Q)ARG3(arg) ? 1 : 0; + do_weyl = 1; + dp_nf_z(b,g,ps,full,DP_Multiple,rp); + do_weyl = 0; +} + +/* nf computation using field operations */ + +void Pdp_nf_f(arg,rp) +NODE arg; +DP *rp; +{ + NODE b; + DP *ps; + DP g; + int full; + + do_weyl = 0; + asir_assert(ARG0(arg),O_LIST,"dp_nf_f"); + asir_assert(ARG1(arg),O_DP,"dp_nf_f"); + asir_assert(ARG2(arg),O_VECT,"dp_nf_f"); + asir_assert(ARG3(arg),O_N,"dp_nf_f"); + if ( !(g = (DP)ARG1(arg)) ) { + *rp = 0; return; + } + b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg)); + full = (Q)ARG3(arg) ? 1 : 0; + dp_nf_f(b,g,ps,full,rp); +} + +void Pdp_weyl_nf_f(arg,rp) +NODE arg; +DP *rp; +{ + NODE b; + DP *ps; + DP g; + int full; + + asir_assert(ARG0(arg),O_LIST,"dp_weyl_nf_f"); + asir_assert(ARG1(arg),O_DP,"dp_weyl_nf_f"); + asir_assert(ARG2(arg),O_VECT,"dp_weyl_nf_f"); + asir_assert(ARG3(arg),O_N,"dp_weyl_nf_f"); + if ( !(g = (DP)ARG1(arg)) ) { + *rp = 0; return; + } + b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg)); + full = (Q)ARG3(arg) ? 1 : 0; + do_weyl = 1; + dp_nf_f(b,g,ps,full,rp); + do_weyl = 0; +} + +void Pdp_nf_mod(arg,rp) +NODE arg; +DP *rp; +{ + NODE b; + DP g; + DP *ps; + int mod,full,ac; + NODE n,n0; + + do_weyl = 0; + ac = argc(arg); + asir_assert(ARG0(arg),O_LIST,"dp_nf_mod"); + asir_assert(ARG1(arg),O_DP,"dp_nf_mod"); + asir_assert(ARG2(arg),O_VECT,"dp_nf_mod"); + asir_assert(ARG3(arg),O_N,"dp_nf_mod"); + asir_assert(ARG4(arg),O_N,"dp_nf_mod"); + if ( !(g = (DP)ARG1(arg)) ) { + *rp = 0; return; + } + b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg)); + full = QTOS((Q)ARG3(arg)); mod = QTOS((Q)ARG4(arg)); + for ( n0 = n = 0; b; b = NEXT(b) ) { + NEXTNODE(n0,n); + BDY(n) = (pointer)QTOS((Q)BDY(b)); + } + if ( n0 ) + NEXT(n) = 0; + dp_nf_mod(n0,g,ps,mod,full,rp); +} + void Pdp_true_nf(arg,rp) NODE arg; LIST *rp; @@ -468,6 +677,7 @@ LIST *rp; P dn; int full; + do_weyl = 0; asir_assert(ARG0(arg),O_LIST,"dp_true_nf"); asir_assert(ARG1(arg),O_DP,"dp_true_nf"); asir_assert(ARG2(arg),O_VECT,"dp_true_nf"); @@ -484,7 +694,7 @@ LIST *rp; NEXT(NEXT(n)) = 0; MKLIST(*rp,n); } -void Pdp_nf_mod(arg,rp) +void Pdp_weyl_nf_mod(arg,rp) NODE arg; DP *rp; { @@ -495,11 +705,11 @@ DP *rp; NODE n,n0; ac = argc(arg); - asir_assert(ARG0(arg),O_LIST,"dp_nf_mod"); - asir_assert(ARG1(arg),O_DP,"dp_nf_mod"); - asir_assert(ARG2(arg),O_VECT,"dp_nf_mod"); - asir_assert(ARG3(arg),O_N,"dp_nf_mod"); - asir_assert(ARG4(arg),O_N,"dp_nf_mod"); + asir_assert(ARG0(arg),O_LIST,"dp_weyl_nf_mod"); + asir_assert(ARG1(arg),O_DP,"dp_weyl_nf_mod"); + asir_assert(ARG2(arg),O_VECT,"dp_weyl_nf_mod"); + asir_assert(ARG3(arg),O_N,"dp_weyl_nf_mod"); + asir_assert(ARG4(arg),O_N,"dp_weyl_nf_mod"); if ( !(g = (DP)ARG1(arg)) ) { *rp = 0; return; } @@ -511,7 +721,9 @@ DP *rp; } if ( n0 ) NEXT(n) = 0; - dp_nf_mod(n,g,ps,mod,full,rp); + do_weyl = 1; + dp_nf_mod(n0,g,ps,mod,full,rp); + do_weyl = 0; } void Pdp_true_nf_mod(arg,rp) @@ -525,6 +737,7 @@ LIST *rp; int mod,full; NODE n; + do_weyl = 0; asir_assert(ARG0(arg),O_LIST,"dp_nf_mod"); asir_assert(ARG1(arg),O_DP,"dp_nf_mod"); asir_assert(ARG2(arg),O_VECT,"dp_nf_mod"); @@ -619,6 +832,7 @@ LIST *rp; P dmy; NODE n; + do_weyl = 0; asir_assert(ARG0(arg),O_DP,"dp_red_mod"); asir_assert(ARG1(arg),O_DP,"dp_red_mod"); asir_assert(ARG2(arg),O_DP,"dp_red_mod"); @@ -629,6 +843,7 @@ LIST *rp; NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)r; NEXT(NEXT(n)) = 0; MKLIST(*rp,n); } + void Pdp_subd(arg,rp) NODE arg; DP *rp; @@ -641,6 +856,60 @@ DP *rp; dp_subd(p1,p2,rp); } +void Pdp_mul_trunc(arg,rp) +NODE arg; +DP *rp; +{ + DP p1,p2,p; + + p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); p = (DP)ARG2(arg); + asir_assert(p1,O_DP,"dp_mul_trunc"); + asir_assert(p2,O_DP,"dp_mul_trunc"); + asir_assert(p,O_DP,"dp_mul_trunc"); + comm_muld_trunc(CO,p1,p2,BDY(p)->dl,rp); +} + +void Pdp_quo(arg,rp) +NODE arg; +DP *rp; +{ + DP p1,p2; + + p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); + asir_assert(p1,O_DP,"dp_quo"); + asir_assert(p2,O_DP,"dp_quo"); + comm_quod(CO,p1,p2,rp); +} + +void Pdp_weyl_mul(arg,rp) +NODE arg; +DP *rp; +{ + DP p1,p2; + + p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); + asir_assert(p1,O_DP,"dp_weyl_mul"); asir_assert(p2,O_DP,"dp_weyl_mul"); + do_weyl = 1; + muld(CO,p1,p2,rp); + do_weyl = 0; +} + +void Pdp_weyl_mul_mod(arg,rp) +NODE arg; +DP *rp; +{ + DP p1,p2; + Q m; + + p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); m = (Q)ARG2(arg); + asir_assert(p1,O_DP,"dp_weyl_mul_mod"); + asir_assert(p2,O_DP,"dp_mul_mod"); + asir_assert(m,O_N,"dp_mul_mod"); + do_weyl = 1; + mulmd(CO,QTOS(m),p1,p2,rp); + do_weyl = 0; +} + void Pdp_red(arg,rp) NODE arg; LIST *rp; @@ -649,6 +918,7 @@ LIST *rp; DP head,rest,dmy1; P dmy; + do_weyl = 0; asir_assert(ARG0(arg),O_DP,"dp_red"); asir_assert(ARG1(arg),O_DP,"dp_red"); asir_assert(ARG2(arg),O_DP,"dp_red"); @@ -658,17 +928,50 @@ LIST *rp; NEXT(NEXT(n)) = 0; MKLIST(*rp,n); } +void Pdp_weyl_red(arg,rp) +NODE arg; +LIST *rp; +{ + NODE n; + DP head,rest,dmy1; + P dmy; + + asir_assert(ARG0(arg),O_DP,"dp_weyl_red"); + asir_assert(ARG1(arg),O_DP,"dp_weyl_red"); + asir_assert(ARG2(arg),O_DP,"dp_weyl_red"); + do_weyl = 1; + dp_red((DP)ARG0(arg),(DP)ARG1(arg),(DP)ARG2(arg),&head,&rest,&dmy,&dmy1); + do_weyl = 0; + NEWNODE(n); BDY(n) = (pointer)head; + NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)rest; + NEXT(NEXT(n)) = 0; MKLIST(*rp,n); +} + void Pdp_sp(arg,rp) NODE arg; DP *rp; { DP p1,p2; + do_weyl = 0; p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); asir_assert(p1,O_DP,"dp_sp"); asir_assert(p2,O_DP,"dp_sp"); dp_sp(p1,p2,rp); } +void Pdp_weyl_sp(arg,rp) +NODE arg; +DP *rp; +{ + DP p1,p2; + + p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); + asir_assert(p1,O_DP,"dp_weyl_sp"); asir_assert(p2,O_DP,"dp_sp"); + do_weyl = 1; + dp_sp(p1,p2,rp); + do_weyl = 0; +} + void Pdp_sp_mod(arg,rp) NODE arg; DP *rp; @@ -676,6 +979,7 @@ DP *rp; DP p1,p2; int mod; + do_weyl = 0; p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); asir_assert(p1,O_DP,"dp_sp_mod"); asir_assert(p2,O_DP,"dp_sp_mod"); asir_assert(ARG2(arg),O_N,"dp_sp_mod"); @@ -697,7 +1001,7 @@ DP *rp; n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; NEWDL(d,n); for ( i = 0, td = 0; i < n; i++ ) { - d->d[i] = MAX(d1->d[i],d2->d[i]); td += d->d[i]; + d->d[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(d->d[i],i); } d->td = td; NEWMP(m); m->dl = d; m->c = (P)ONE; NEXT(m) = 0; @@ -779,6 +1083,83 @@ Q *rp; STOQ(p->sugar,*rp); } +void Pdp_initial_term(arg,rp) +NODE arg; +Obj *rp; +{ + struct order_spec *ord; + Num homo; + int modular,is_list; + LIST v,f,l,initiallist; + NODE n; + + f = (LIST)ARG0(arg); + if ( f && OID(f) == O_LIST ) + is_list = 1; + else { + n = mknode(1,f); MKLIST(l,n); f = l; + is_list = 0; + } + if ( argc(arg) == 2 && OID(ARG1(arg)) == O_OPTLIST ) + parse_gr_option(f,BDY((OPTLIST)ARG1(arg)),&v,&homo,&modular,&ord); + else + ord = dp_current_spec; + initiallist = dp_initial_term(f,ord); + if ( !is_list ) + *rp = (Obj)BDY(BDY(initiallist)); + else + *rp = (Obj)initiallist; +} + +void Pdp_order(arg,rp) +NODE arg; +Obj *rp; +{ + struct order_spec *ord; + Num homo; + int modular,is_list; + LIST v,f,l,ordlist; + NODE n; + + f = (LIST)ARG0(arg); + if ( f && OID(f) == O_LIST ) + is_list = 1; + else { + n = mknode(1,f); MKLIST(l,n); f = l; + is_list = 0; + } + if ( argc(arg) == 2 && OID(ARG1(arg)) == O_OPTLIST ) + parse_gr_option(f,BDY((OPTLIST)ARG1(arg)),&v,&homo,&modular,&ord); + else + ord = dp_current_spec; + ordlist = dp_order(f,ord); + if ( !is_list ) + *rp = (Obj)BDY(BDY(ordlist)); + else + *rp = (Obj)ordlist; +} + +void Pdp_set_sugar(arg,rp) +NODE arg; +Q *rp; +{ + DP p; + Q q; + int i; + + p = (DP)ARG0(arg); + q = (Q)ARG1(arg); + if ( p && q) { + asir_assert(p,O_DP,"dp_set_sugar"); + asir_assert(q,O_N, "dp_set_sugar"); + i = QTOS(q); + if (p->sugar < i) { + p->sugar = i; + } + } + *rp = 0; +} + void Pdp_cri1(arg,rp) NODE arg; Q *rp; @@ -980,47 +1361,228 @@ LIST *rp; dp_make_flaglist(rp); } -extern int DP_Print; +extern int DP_Print, DP_PrintShort; void Pdp_gr_print(arg,rp) NODE arg; Q *rp; { Q q; + int s; if ( arg ) { asir_assert(ARG0(arg),O_N,"dp_gr_print"); - q = (Q)ARG0(arg); DP_Print = QTOS(q); - } else - STOQ(DP_Print,q); + q = (Q)ARG0(arg); + s = QTOS(q); + switch ( s ) { + case 0: + DP_Print = 0; DP_PrintShort = 0; + break; + case 1: + DP_Print = 1; + break; + case 2: + DP_Print = 0; DP_PrintShort = 1; + break; + default: + DP_Print = s; DP_PrintShort = 0; + break; + } + } else { + if ( DP_Print ) { + STOQ(1,q); + } else if ( DP_PrintShort ) { + STOQ(2,q); + } else + q = 0; + } *rp = q; } +void parse_gr_option(LIST f,NODE opt,LIST *v,Num *homo, + int *modular,struct order_spec **ord) +{ + NODE t,p; + Q m; + char *key; + Obj value,dmy; + int ord_is_set = 0; + int modular_is_set = 0; + int homo_is_set = 0; + VL vl,vl0; + LIST vars; + char xiname[BUFSIZ]; + NODE x0,x; + DP d; + P xi; + int nv,i; + + /* extract vars */ + vars = 0; + for ( t = opt; t; t = NEXT(t) ) { + p = BDY((LIST)BDY(t)); + key = BDY((STRING)BDY(p)); + value = (Obj)BDY(NEXT(p)); + if ( !strcmp(key,"v") ) { + /* variable list */ + vars = (LIST)value; + break; + } + } + if ( vars ) { + *v = vars; pltovl(vars,&vl); + } else { + for ( t = BDY(f); t; t = NEXT(t) ) + if ( BDY(t) && OID((Obj)BDY(t))==O_DP ) + break; + if ( t ) { + /* f is DP list */ + /* create dummy var list */ + d = (DP)BDY(t); + nv = NV(d); + for ( i = 0, vl0 = 0, x0 = 0; i < nv; i++ ) { + NEXTVL(vl0,vl); + NEXTNODE(x0,x); + sprintf(xiname,"x%d",i); + makevar(xiname,&xi); + x->body = (pointer)xi; + vl->v = VR((P)xi); + } + if ( vl0 ) { + NEXT(vl) = 0; + NEXT(x) = 0; + } + MKLIST(vars,x0); + *v = vars; + vl = vl0; + } else { + get_vars((Obj)f,&vl); vltopl(vl,v); + } + } + + for ( t = opt; t; t = NEXT(t) ) { + p = BDY((LIST)BDY(t)); + key = BDY((STRING)BDY(p)); + value = (Obj)BDY(NEXT(p)); + if ( !strcmp(key,"v") ) { + /* variable list; ignore */ + } else if ( !strcmp(key,"order") ) { + /* order spec */ + create_order_spec(vl,value,ord); + ord_is_set = 1; + } else if ( !strcmp(key,"block") ) { + create_order_spec(0,value,ord); + } else if ( !strcmp(key,"matrix") ) { + create_order_spec(0,value,ord); + } else if ( !strcmp(key,"sugarweight") ) { + /* weight */ + Pdp_set_weight(NEXT(p),&dmy); + ord_is_set = 1; + } else if ( !strcmp(key,"homo") ) { + *homo = (Num)value; + homo_is_set = 1; + } else if ( !strcmp(key,"trace") ) { + m = (Q)value; + if ( !m ) + *modular = 0; + else if ( PL(NM(m))>1 || (PL(NM(m)) == 1 + && BD(NM(m))[0] >= 0x80000000) ) + error("parse_gr_option : too large modulus"); + else + *modular = QTOS(m); + modular_is_set = 1; + } else + error("parse_gr_option : not implemented"); + } + if ( !ord_is_set ) create_order_spec(0,0,ord); + if ( !modular_is_set ) *modular = 0; + if ( !homo_is_set ) *homo = 0; +} + void Pdp_gr_main(arg,rp) NODE arg; LIST *rp; { LIST f,v; + VL vl; Num homo; Q m; - int modular; - struct order_spec ord; + int modular,ac; + struct order_spec *ord; + do_weyl = 0; asir_assert(ARG0(arg),O_LIST,"dp_gr_main"); - asir_assert(ARG1(arg),O_LIST,"dp_gr_main"); - asir_assert(ARG2(arg),O_N,"dp_gr_main"); - asir_assert(ARG3(arg),O_N,"dp_gr_main"); + f = (LIST)ARG0(arg); + f = remove_zero_from_list(f); + if ( !BDY(f) ) { + *rp = f; return; + } + if ( argc(arg) == 5 ) { + asir_assert(ARG1(arg),O_LIST,"dp_gr_main"); + asir_assert(ARG2(arg),O_N,"dp_gr_main"); + asir_assert(ARG3(arg),O_N,"dp_gr_main"); + v = (LIST)ARG1(arg); + homo = (Num)ARG2(arg); + m = (Q)ARG3(arg); + if ( !m ) + modular = 0; + else if ( PL(NM(m))>1 || (PL(NM(m)) == 1 && BD(NM(m))[0] >= 0x80000000) ) + error("dp_gr_main : too large modulus"); + else + modular = QTOS(m); + create_order_spec(0,ARG4(arg),&ord); + } else if ( (ac=argc(arg)) == 2 && OID(ARG1(arg)) == O_OPTLIST ) + parse_gr_option(f,BDY((OPTLIST)ARG1(arg)),&v,&homo,&modular,&ord); + else if ( ac == 1 ) + parse_gr_option(f,0,&v,&homo,&modular,&ord); + else + error("dp_gr_main : invalid argument"); + dp_gr_main(f,v,homo,modular,0,ord,rp); +} + +void Pdp_gr_f_main(arg,rp) +NODE arg; +LIST *rp; +{ + LIST f,v; + Num homo; + int m,field,t; + struct order_spec *ord; + NODE n; + + do_weyl = 0; + asir_assert(ARG0(arg),O_LIST,"dp_gr_f_main"); + asir_assert(ARG1(arg),O_LIST,"dp_gr_f_main"); + asir_assert(ARG2(arg),O_N,"dp_gr_f_main"); f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); + f = remove_zero_from_list(f); + if ( !BDY(f) ) { + *rp = f; return; + } homo = (Num)ARG2(arg); - m = (Q)ARG3(arg); - if ( !m ) - modular = 0; - else if ( PL(NM(m))>1 || (PL(NM(m)) == 1 && BD(NM(m))[0] >= 0x80000000) ) - error("dp_gr_main : too large modulus"); - else - modular = QTOS(m); - create_order_spec(ARG4(arg),&ord); - dp_gr_main(f,v,homo,modular,&ord,rp); +#if 0 + asir_assert(ARG3(arg),O_N,"dp_gr_f_main"); + m = QTOS((Q)ARG3(arg)); + if ( m ) + error("dp_gr_f_main : trace lifting is not implemented yet"); + create_order_spec(0,ARG4(arg),&ord); +#else + m = 0; + create_order_spec(0,ARG3(arg),&ord); +#endif + field = 0; + for ( n = BDY(f); n; n = NEXT(n) ) { + t = get_field_type(BDY(n)); + if ( !t ) + continue; + if ( t < 0 ) + error("dp_gr_f_main : incosistent coefficients"); + if ( !field ) + field = t; + else if ( t != field ) + error("dp_gr_f_main : incosistent coefficients"); + } + dp_gr_main(f,v,homo,m?1:0,field,ord,rp); } void Pdp_f4_main(arg,rp) @@ -1028,29 +1590,61 @@ NODE arg; LIST *rp; { LIST f,v; - struct order_spec ord; + struct order_spec *ord; + do_weyl = 0; asir_assert(ARG0(arg),O_LIST,"dp_f4_main"); asir_assert(ARG1(arg),O_LIST,"dp_f4_main"); f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); - create_order_spec(ARG2(arg),&ord); - dp_f4_main(f,v,&ord,rp); + f = remove_zero_from_list(f); + if ( !BDY(f) ) { + *rp = f; return; + } + create_order_spec(0,ARG2(arg),&ord); + dp_f4_main(f,v,ord,rp); } +/* dp_gr_checklist(list of dp) */ + +void Pdp_gr_checklist(arg,rp) +NODE arg; +LIST *rp; +{ + VECT g; + LIST dp; + NODE r; + int n; + + do_weyl = 0; + asir_assert(ARG0(arg),O_LIST,"dp_gr_checklist"); + asir_assert(ARG1(arg),O_N,"dp_gr_checklist"); + n = QTOS((Q)ARG1(arg)); + gbcheck_list(BDY((LIST)ARG0(arg)),n,&g,&dp); + r = mknode(2,g,dp); + MKLIST(*rp,r); +} + void Pdp_f4_mod_main(arg,rp) NODE arg; LIST *rp; { LIST f,v; int m; - struct order_spec ord; + struct order_spec *ord; - asir_assert(ARG0(arg),O_LIST,"dp_f4_main"); - asir_assert(ARG1(arg),O_LIST,"dp_f4_main"); - asir_assert(ARG2(arg),O_N,"dp_f4_main"); + do_weyl = 0; + asir_assert(ARG0(arg),O_LIST,"dp_f4_mod_main"); + asir_assert(ARG1(arg),O_LIST,"dp_f4_mod_main"); + asir_assert(ARG2(arg),O_N,"dp_f4_mod_main"); f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); m = QTOS((Q)ARG2(arg)); - create_order_spec(ARG3(arg),&ord); - dp_f4_mod_main(f,v,m,&ord,rp); + f = remove_zero_from_list(f); + if ( !BDY(f) ) { + *rp = f; return; + } + if ( !m ) + error("dp_f4_mod_main : invalid argument"); + create_order_spec(0,ARG3(arg),&ord); + dp_f4_mod_main(f,v,m,ord,rp); } void Pdp_gr_mod_main(arg,rp) @@ -1060,15 +1654,403 @@ LIST *rp; LIST f,v; Num homo; int m; - struct order_spec ord; + struct order_spec *ord; + do_weyl = 0; asir_assert(ARG0(arg),O_LIST,"dp_gr_mod_main"); asir_assert(ARG1(arg),O_LIST,"dp_gr_mod_main"); asir_assert(ARG2(arg),O_N,"dp_gr_mod_main"); asir_assert(ARG3(arg),O_N,"dp_gr_mod_main"); f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); + f = remove_zero_from_list(f); + if ( !BDY(f) ) { + *rp = f; return; + } homo = (Num)ARG2(arg); m = QTOS((Q)ARG3(arg)); - create_order_spec(ARG4(arg),&ord); - dp_gr_mod_main(f,v,homo,m,&ord,rp); + if ( !m ) + error("dp_gr_mod_main : invalid argument"); + create_order_spec(0,ARG4(arg),&ord); + dp_gr_mod_main(f,v,homo,m,ord,rp); } +void Pnd_f4(arg,rp) +NODE arg; +LIST *rp; +{ + LIST f,v; + int m,homo; + struct order_spec *ord; + + do_weyl = 0; + asir_assert(ARG0(arg),O_LIST,"nd_gr"); + asir_assert(ARG1(arg),O_LIST,"nd_gr"); + asir_assert(ARG2(arg),O_N,"nd_gr"); + f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); + f = remove_zero_from_list(f); + if ( !BDY(f) ) { + *rp = f; return; + } + m = QTOS((Q)ARG2(arg)); + create_order_spec(0,ARG3(arg),&ord); + nd_gr(f,v,m,1,ord,rp); +} + +void Pnd_gr(arg,rp) +NODE arg; +LIST *rp; +{ + LIST f,v; + int m,homo; + struct order_spec *ord; + + do_weyl = 0; + asir_assert(ARG0(arg),O_LIST,"nd_gr"); + asir_assert(ARG1(arg),O_LIST,"nd_gr"); + asir_assert(ARG2(arg),O_N,"nd_gr"); + f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); + f = remove_zero_from_list(f); + if ( !BDY(f) ) { + *rp = f; return; + } + m = QTOS((Q)ARG2(arg)); + create_order_spec(0,ARG3(arg),&ord); + nd_gr(f,v,m,0,ord,rp); +} + +void Pnd_gr_trace(arg,rp) +NODE arg; +LIST *rp; +{ + LIST f,v; + int m,homo; + struct order_spec *ord; + + do_weyl = 0; + asir_assert(ARG0(arg),O_LIST,"nd_gr_trace"); + asir_assert(ARG1(arg),O_LIST,"nd_gr_trace"); + asir_assert(ARG2(arg),O_N,"nd_gr_trace"); + asir_assert(ARG3(arg),O_N,"nd_gr_trace"); + f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); + f = remove_zero_from_list(f); + if ( !BDY(f) ) { + *rp = f; return; + } + homo = QTOS((Q)ARG2(arg)); + m = QTOS((Q)ARG3(arg)); + create_order_spec(0,ARG4(arg),&ord); + nd_gr_trace(f,v,m,homo,ord,rp); +} + +void Pnd_weyl_gr(arg,rp) +NODE arg; +LIST *rp; +{ + LIST f,v; + int m,homo; + struct order_spec *ord; + + do_weyl = 1; + asir_assert(ARG0(arg),O_LIST,"nd_weyl_gr"); + asir_assert(ARG1(arg),O_LIST,"nd_weyl_gr"); + asir_assert(ARG2(arg),O_N,"nd_weyl_gr"); + f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); + f = remove_zero_from_list(f); + if ( !BDY(f) ) { + *rp = f; return; + } + m = QTOS((Q)ARG2(arg)); + create_order_spec(0,ARG3(arg),&ord); + nd_gr(f,v,m,0,ord,rp); +} + +void Pnd_weyl_gr_trace(arg,rp) +NODE arg; +LIST *rp; +{ + LIST f,v; + int m,homo; + struct order_spec *ord; + + do_weyl = 1; + asir_assert(ARG0(arg),O_LIST,"nd_weyl_gr_trace"); + asir_assert(ARG1(arg),O_LIST,"nd_weyl_gr_trace"); + asir_assert(ARG2(arg),O_N,"nd_weyl_gr_trace"); + asir_assert(ARG3(arg),O_N,"nd_weyl_gr_trace"); + f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); + f = remove_zero_from_list(f); + if ( !BDY(f) ) { + *rp = f; return; + } + homo = QTOS((Q)ARG2(arg)); + m = QTOS((Q)ARG3(arg)); + create_order_spec(0,ARG4(arg),&ord); + nd_gr_trace(f,v,m,homo,ord,rp); +} + +void Pnd_nf(arg,rp) +NODE arg; +P *rp; +{ + P f; + LIST g,v; + struct order_spec *ord; + + do_weyl = 0; + asir_assert(ARG0(arg),O_P,"nd_nf"); + asir_assert(ARG1(arg),O_LIST,"nd_nf"); + asir_assert(ARG2(arg),O_LIST,"nd_nf"); + asir_assert(ARG4(arg),O_N,"nd_nf"); + f = (P)ARG0(arg); + g = (LIST)ARG1(arg); g = remove_zero_from_list(g); + if ( !BDY(g) ) { + *rp = f; return; + } + v = (LIST)ARG2(arg); + create_order_spec(0,ARG3(arg),&ord); + nd_nf_p(f,g,v,QTOS((Q)ARG4(arg)),ord,rp); +} + +/* for Weyl algebra */ + +void Pdp_weyl_gr_main(arg,rp) +NODE arg; +LIST *rp; +{ + LIST f,v; + Num homo; + Q m; + int modular,ac; + struct order_spec *ord; + + + asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_main"); + f = (LIST)ARG0(arg); + f = remove_zero_from_list(f); + if ( !BDY(f) ) { + *rp = f; return; + } + if ( argc(arg) == 5 ) { + asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_main"); + asir_assert(ARG2(arg),O_N,"dp_weyl_gr_main"); + asir_assert(ARG3(arg),O_N,"dp_weyl_gr_main"); + v = (LIST)ARG1(arg); + homo = (Num)ARG2(arg); + m = (Q)ARG3(arg); + if ( !m ) + modular = 0; + else if ( PL(NM(m))>1 || (PL(NM(m)) == 1 && BD(NM(m))[0] >= 0x80000000) ) + error("dp_weyl_gr_main : too large modulus"); + else + modular = QTOS(m); + create_order_spec(0,ARG4(arg),&ord); + } else if ( (ac=argc(arg)) == 2 && OID(ARG1(arg)) == O_OPTLIST ) + parse_gr_option(f,BDY((OPTLIST)ARG1(arg)),&v,&homo,&modular,&ord); + else if ( ac == 1 ) + parse_gr_option(f,0,&v,&homo,&modular,&ord); + else + error("dp_weyl_gr_main : invalid argument"); + do_weyl = 1; + dp_gr_main(f,v,homo,modular,0,ord,rp); + do_weyl = 0; +} + +void Pdp_weyl_gr_f_main(arg,rp) +NODE arg; +LIST *rp; +{ + LIST f,v; + Num homo; + struct order_spec *ord; + + asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_main"); + asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_main"); + asir_assert(ARG2(arg),O_N,"dp_weyl_gr_main"); + asir_assert(ARG3(arg),O_N,"dp_weyl_gr_main"); + f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); + f = remove_zero_from_list(f); + if ( !BDY(f) ) { + *rp = f; return; + } + homo = (Num)ARG2(arg); + create_order_spec(0,ARG3(arg),&ord); + do_weyl = 1; + dp_gr_main(f,v,homo,0,1,ord,rp); + do_weyl = 0; +} + +void Pdp_weyl_f4_main(arg,rp) +NODE arg; +LIST *rp; +{ + LIST f,v; + struct order_spec *ord; + + asir_assert(ARG0(arg),O_LIST,"dp_weyl_f4_main"); + asir_assert(ARG1(arg),O_LIST,"dp_weyl_f4_main"); + f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); + f = remove_zero_from_list(f); + if ( !BDY(f) ) { + *rp = f; return; + } + create_order_spec(0,ARG2(arg),&ord); + do_weyl = 1; + dp_f4_main(f,v,ord,rp); + do_weyl = 0; +} + +void Pdp_weyl_f4_mod_main(arg,rp) +NODE arg; +LIST *rp; +{ + LIST f,v; + int m; + struct order_spec *ord; + + asir_assert(ARG0(arg),O_LIST,"dp_weyl_f4_main"); + asir_assert(ARG1(arg),O_LIST,"dp_weyl_f4_main"); + asir_assert(ARG2(arg),O_N,"dp_f4_main"); + f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); m = QTOS((Q)ARG2(arg)); + f = remove_zero_from_list(f); + if ( !BDY(f) ) { + *rp = f; return; + } + if ( !m ) + error("dp_weyl_f4_mod_main : invalid argument"); + create_order_spec(0,ARG3(arg),&ord); + do_weyl = 1; + dp_f4_mod_main(f,v,m,ord,rp); + do_weyl = 0; +} + +void Pdp_weyl_gr_mod_main(arg,rp) +NODE arg; +LIST *rp; +{ + LIST f,v; + Num homo; + int m; + struct order_spec *ord; + + asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_mod_main"); + asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_mod_main"); + asir_assert(ARG2(arg),O_N,"dp_weyl_gr_mod_main"); + asir_assert(ARG3(arg),O_N,"dp_weyl_gr_mod_main"); + f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); + f = remove_zero_from_list(f); + if ( !BDY(f) ) { + *rp = f; return; + } + homo = (Num)ARG2(arg); m = QTOS((Q)ARG3(arg)); + if ( !m ) + error("dp_weyl_gr_mod_main : invalid argument"); + create_order_spec(0,ARG4(arg),&ord); + do_weyl = 1; + dp_gr_mod_main(f,v,homo,m,ord,rp); + do_weyl = 0; +} + +static VECT current_dl_weight_vector_obj; +int *current_dl_weight_vector; + +void Pdp_set_weight(arg,rp) +NODE arg; +VECT *rp; +{ + VECT v; + int i,n; + NODE node; + + if ( !arg ) + *rp = current_dl_weight_vector_obj; + else if ( !ARG0(arg) ) { + current_dl_weight_vector_obj = 0; + current_dl_weight_vector = 0; + *rp = 0; + } else { + if ( OID(ARG0(arg)) != O_VECT && OID(ARG0(arg)) != O_LIST ) + error("dp_set_weight : invalid argument"); + if ( OID(ARG0(arg)) == O_VECT ) + v = (VECT)ARG0(arg); + else { + node = (NODE)BDY((LIST)ARG0(arg)); + n = length(node); + MKVECT(v,n); + for ( i = 0; i < n; i++, node = NEXT(node) ) + BDY(v)[i] = BDY(node); + } + current_dl_weight_vector_obj = v; + n = v->len; + current_dl_weight_vector = (int *)CALLOC(n,sizeof(int)); + for ( i = 0; i < n; i++ ) + current_dl_weight_vector[i] = QTOS((Q)v->body[i]); + *rp = v; + } +} + +static VECT current_weyl_weight_vector_obj; +int *current_weyl_weight_vector; + +void Pdp_weyl_set_weight(arg,rp) +NODE arg; +VECT *rp; +{ + VECT v; + int i,n; + + if ( !arg ) + *rp = current_weyl_weight_vector_obj; + else { + asir_assert(ARG0(arg),O_VECT,"dp_weyl_set_weight"); + v = (VECT)ARG0(arg); + current_weyl_weight_vector_obj = v; + n = v->len; + current_weyl_weight_vector = (int *)CALLOC(n,sizeof(int)); + for ( i = 0; i < n; i++ ) + current_weyl_weight_vector[i] = QTOS((Q)v->body[i]); + *rp = v; + } +} + +LIST remove_zero_from_list(LIST l) +{ + NODE n,r0,r; + LIST rl; + + asir_assert(l,O_LIST,"remove_zero_from_list"); + n = BDY(l); + for ( r0 = 0; n; n = NEXT(n) ) + if ( BDY(n) ) { + NEXTNODE(r0,r); + BDY(r) = BDY(n); + } + if ( r0 ) + NEXT(r) = 0; + MKLIST(rl,r0); + return rl; +} + +int get_field_type(P p) +{ + int type,t; + DCP dc; + + if ( !p ) + return 0; + else if ( NUM(p) ) + return NID((Num)p); + else { + type = 0; + for ( dc = DC(p); dc; dc = NEXT(dc) ) { + t = get_field_type(COEF(dc)); + if ( !t ) + continue; + if ( t < 0 ) + return t; + if ( !type ) + type = t; + else if ( t != type ) + return -1; + } + return type; + } +}