OpenXM_contrib2/asir2000/builtin/dp.c - diff

Return to dp.c CVS log

Up to [local] / OpenXM_contrib2 / asir2000 / builtin

Diff for /OpenXM_contrib2/asir2000/builtin/dp.c between version 1.81 and 1.88

version 1.81, 2010/04/16 07:13:42

version 1.88, 2013/06/14 04:47:17

Line 44

* 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.80 2010/01/19 06:17:22 noro Exp $

* $OpenXM: OpenXM_contrib2/asir2000/builtin/dp.c,v 1.87 2012/08/27 05:38:00 noro Exp $

#include "ca.h"

#include "base.h"

Line 96 void Pdp_nf_f(),Pdp_weyl_nf_f();

void Pdp_lnf_f();

void Pnd_gr(),Pnd_gr_trace(),Pnd_f4(),Pnd_f4_trace();

void Pnd_gr_postproc(), Pnd_weyl_gr_postproc();

void Pnd_gr_recompute_trace();

void Pnd_weyl_gr(),Pnd_weyl_gr_trace();

void Pnd_nf();

void Pnd_nf(),Pnd_weyl_nf();

void Pdp_initial_term();

void Pdp_order();

void Pdp_inv_or_split();

Line 106 void Pdp_compute_last_w();

Line 107 void Pdp_compute_last_w();

void Pdp_compute_essential_df();

void Pdp_get_denomlist();

void Pdp_symb_add();

void Pdp_mono_raddec();

void Pdp_mono_reduce();

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);

NODE dp_inv_or_split(NODE gb,DP f,struct order_spec *spec, DP *inv);

LIST remove_zero_from_list(LIST);

Line 161 struct ftab dp_tab[] = {

Line 165 struct ftab dp_tab[] = {

{"nd_gr_trace",Pnd_gr_trace,5},

{"nd_f4_trace",Pnd_f4_trace,5},

{"nd_gr_postproc",Pnd_gr_postproc,5},

{"nd_gr_recompute_trace",Pnd_gr_recompute_trace,5},

{"nd_weyl_gr_postproc",Pnd_weyl_gr_postproc,5},

{"nd_weyl_gr",Pnd_weyl_gr,4},

{"nd_weyl_gr_trace",Pnd_weyl_gr_trace,5},

{"nd_nf",Pnd_nf,5},

{"nd_weyl_nf",Pnd_weyl_nf,5},

/* F4 algorithm */

{"dp_f4_main",Pdp_f4_main,3},

Line 265 struct ftab dp_supp_tab[] = {

Line 271 struct ftab dp_supp_tab[] = {

{"dp_compute_last_w",Pdp_compute_last_w,5},

{"dp_compute_last_t",Pdp_compute_last_t,5},

{"dp_compute_essential_df",Pdp_compute_essential_df,2},

{"dp_mono_raddec",Pdp_mono_raddec,2},

{"dp_mono_reduce",Pdp_mono_reduce,2},

{0,0,0}

};

Line 2130 NODE arg;

Line 2138 NODE arg;

LIST *rp;

{

LIST f,v;

int m,find;

int m,homo,retdp;

Obj homo;

Obj val;

struct order_spec *ord;

do_weyl = 0;

Line 2145 LIST *rp;

Line 2153 LIST *rp;

}

m = QTOS((Q)ARG2(arg));

create_order_spec(0,ARG3(arg),&ord);

find = get_opt("homo",&homo);

homo = retdp = 0;

nd_gr(f,v,m,find&&homo,1,ord,rp);

if ( get_opt("homo",&val) && val ) homo = 1;

if ( get_opt("dp",&val) && val ) retdp = 1;

nd_gr(f,v,m,homo,retdp,1,ord,rp);

}

void Pnd_gr(arg,rp)

Line 2154 NODE arg;

Line 2164 NODE arg;

LIST *rp;

{

LIST f,v;

int m,find;

int m,homo,retdp;

Obj homo;

Obj val;

struct order_spec *ord;

do_weyl = 0;

Line 2169 LIST *rp;

Line 2179 LIST *rp;

}

m = QTOS((Q)ARG2(arg));

create_order_spec(0,ARG3(arg),&ord);

find = get_opt("homo",&homo);

homo = retdp = 0;

nd_gr(f,v,m,find&&homo,0,ord,rp);

if ( get_opt("homo",&val) && val ) homo = 1;

if ( get_opt("dp",&val) && val ) retdp = 1;

nd_gr(f,v,m,homo,retdp,0,ord,rp);

}

void Pnd_gr_postproc(arg,rp)

Line 2196 LIST *rp;

Line 2208 LIST *rp;

nd_gr_postproc(f,v,m,ord,do_check,rp);

}

void Pnd_gr_recompute_trace(arg,rp)

NODE arg;

LIST *rp;

{

LIST f,v,tlist;

int m;

struct order_spec *ord;

do_weyl = 0;

asir_assert(ARG0(arg),O_LIST,"nd_gr_recompute_trace");

asir_assert(ARG1(arg),O_LIST,"nd_gr_recompute_trace");

asir_assert(ARG2(arg),O_N,"nd_gr_recompute_trace");

f = (LIST)ARG0(arg); v = (LIST)ARG1(arg);

m = QTOS((Q)ARG2(arg));

create_order_spec(0,ARG3(arg),&ord);

tlist = (LIST)ARG4(arg);

nd_gr_recompute_trace(f,v,m,ord,tlist,rp);

}

void Pnd_weyl_gr_postproc(arg,rp)

NODE arg;

LIST *rp;

Line 2273 NODE arg;

Line 2304 NODE arg;

LIST *rp;

{

LIST f,v;

int m,find;

int m,homo,retdp;

Obj homo;

Obj val;

struct order_spec *ord;

do_weyl = 1;

Line 2288 LIST *rp;

Line 2319 LIST *rp;

}

m = QTOS((Q)ARG2(arg));

create_order_spec(0,ARG3(arg),&ord);

find = get_opt("homo",&homo);

homo = retdp = 0;

nd_gr(f,v,m,find&&homo,0,ord,rp);

if ( get_opt("homo",&val) && val ) homo = 1;

if ( get_opt("dp",&val) && val ) retdp = 1;

nd_gr(f,v,m,homo,retdp,0,ord,rp);

do_weyl = 0;

}

Line 2318 LIST *rp;

Line 2351 LIST *rp;

do_weyl = 0;

}

void Pnd_nf(arg,rp)

void Pnd_nf(NODE arg,Obj *rp)

NODE arg;

P *rp;

{

P f;

Obj 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);

f = (Obj)ARG0(arg);

g = (LIST)ARG1(arg); g = remove_zero_from_list(g);

if ( !BDY(g) ) {

*rp = f; return;

Line 2341 P *rp;

Line 2371 P *rp;

nd_nf_p(f,g,v,QTOS((Q)ARG4(arg)),ord,rp);

}

void Pnd_weyl_nf(NODE arg,Obj *rp)

{

Obj f;

LIST g,v;

struct order_spec *ord;

do_weyl = 1;

asir_assert(ARG1(arg),O_LIST,"nd_weyl_nf");

asir_assert(ARG2(arg),O_LIST,"nd_weyl_nf");

asir_assert(ARG4(arg),O_N,"nd_weyl_nf");

f = (Obj)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)

Line 2612 NODE arg;

Line 2662 NODE arg;

VECT *rp;

{

VECT v;

NODE node;

int i,n;

if ( !arg )

Line 2621 VECT *rp;

Line 2672 VECT *rp;

current_weyl_weight_vector = 0;

*rp = 0;

} else {

asir_assert(ARG0(arg),O_VECT,"dp_weyl_set_weight");

if ( OID(ARG0(arg)) != O_VECT && OID(ARG0(arg)) != O_LIST )

v = (VECT)ARG0(arg);

error("dp_weyl_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_weyl_weight_vector_obj = v;

n = v->len;

current_weyl_weight_vector = (int *)CALLOC(n,sizeof(int));

Line 2630 VECT *rp;

Line 2690 VECT *rp;

current_weyl_weight_vector[i] = QTOS((Q)v->body[i]);

*rp = v;

}

NODE mono_raddec(NODE ideal);

void Pdp_mono_raddec(NODE arg,LIST *rp)

{

NODE ideal,rd,t,t1,r,r1,u;

VL vl0,vl;

int nv,i,bpi;

int *s;

DP dp;

P *v;

LIST l;

ideal = BDY((LIST)ARG0(arg));

if ( !ideal ) *rp = (LIST)ARG0(arg);

else {

t = BDY((LIST)ARG1(arg));

nv = length(t);

v = (P)MALLOC(nv*sizeof(P));

for ( vl0 = 0, i = 0; t; t = NEXT(t), i++ ) {

NEXTVL(vl0,vl); VR(vl) = VR((P)BDY(t));

MKV(VR(vl),v[i]);

}

if ( vl0 ) NEXT(vl) = 0;

for ( t = 0, r = ideal; r; r = NEXT(r) ) {

ptod(CO,vl0,BDY(r),&dp); MKNODE(t1,dp,t); t = t1;

}

rd = mono_raddec(t);

r = 0;

bpi = (sizeof(int)/sizeof(char))*8;

for ( u = rd; u; u = NEXT(u) ) {

s = (int *)BDY(u);

for ( i = nv-1, t = 0; i >= 0; i-- )

if ( s[i/bpi]&(1<<(i%bpi)) ) {

MKNODE(t1,v[i],t); t = t1;

}

MKLIST(l,t); MKNODE(r1,l,r); r = r1;

}

MKLIST(*rp,r);

}

void Pdp_mono_reduce(NODE arg,LIST *rp)

{

NODE t,t0,t1,r0,r;

int i,n;

DP m;

DP *a;

t0 = BDY((LIST)ARG0(arg));

t1 = BDY((LIST)ARG1(arg));

n = length(t0);

a = (DP *)MALLOC(n*sizeof(DP));

for ( i = 0; i < n; i++, t0 = NEXT(t0) ) a[i] = (DP)BDY(t0);

for ( t = t1; t; t = NEXT(t) ) {

m = (DP)BDY(t);

for ( i = 0; i < n; i++ )

if ( a[i] && dp_redble(a[i],m) ) a[i] = 0;

}

for ( i = n-1, r0 = 0; i >= 0; i-- )

if ( a[i] ) { NEXTNODE(r0,r); BDY(r) = a[i]; }

if ( r0 ) NEXT(r) = 0;

MKLIST(*rp,r0);

}

LIST remove_zero_from_list(LIST l)

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>