OpenXM_contrib2/asir2000/builtin/gr.c - diff

Return to gr.c CVS log

Up to [local] / OpenXM_contrib2 / asir2000 / builtin

Diff for /OpenXM_contrib2/asir2000/builtin/gr.c between version 1.7 and 1.13

version 1.7, 2000/07/14 08:26:39

version 1.13, 2000/12/05 08:29:43

Line 1

/* $OpenXM: OpenXM_contrib2/asir2000/builtin/gr.c,v 1.6 2000/07/13 05:09:00 noro Exp $ */

* FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,

* non-exclusive and royalty-free license to use, copy, modify and

* redistribute, solely for non-commercial and non-profit purposes, the

* computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and

* conditions of this Agreement. For the avoidance of doubt, you acquire

* only a limited right to use the SOFTWARE hereunder, and FLL or any

* third party developer retains all rights, including but not limited to

* copyrights, in and to the SOFTWARE.

* (1) FLL does not grant you a license in any way for commercial

* purposes. You may use the SOFTWARE only for non-commercial and

* non-profit purposes only, such as academic, research and internal

* business use.

* (2) The SOFTWARE is protected by the Copyright Law of Japan and

* international copyright treaties. If you make copies of the SOFTWARE,

* with or without modification, as permitted hereunder, you shall affix

* to all such copies of the SOFTWARE the above copyright notice.

* (3) An explicit reference to this SOFTWARE and its copyright owner

* shall be made on your publication or presentation in any form of the

* results obtained by use of the SOFTWARE.

* (4) In the event that you modify the SOFTWARE, you shall notify FLL by

* e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification

* for such modification or the source code of the modified part of the

* SOFTWARE.

* THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL

* MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND

* EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS

* FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'

* RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY

* MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.

* UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,

* OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY

* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL

* DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES

* ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES

* FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY

* DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF

* SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART

* OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY

* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,

* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.

* $OpenXM: OpenXM_contrib2/asir2000/builtin/gr.c,v 1.12 2000/12/05 06:59:15 noro Exp $

#include "ca.h"

#include "parse.h"

#include "base.h"

Line 35 int TP,NBP,NMP,NFP,NDP,ZR,NZR;

Line 83 int TP,NBP,NMP,NFP,NDP,ZR,NZR;

extern int (*cmpdl)();

extern int do_weyl;

void Pdp_gr_flags(), Pdp_gr_print();

extern DP_Print;

void Pdp_gr_main(),Pdp_gr_mod_main(),Pdp_f4_main(),Pdp_f4_mod_main();

void print_stat(void);

void init_stat(void);

Line 60 DP_pairs updpairs(DP_pairs,NODE,int);

Line 107 DP_pairs updpairs(DP_pairs,NODE,int);

void _dp_nf_ptozp(NODE,DP,DP *,int,int,DP *);

void _dp_nf_ptozp_mpi(NODE,DP,DP *,int,int,DP *);

void _dp_nf(NODE,DP,DP *,int,DP *);

void _dp_nf_mod(NODE,DP,DP *,int,int,DP *);

void interreduce_mod(NODE,int,int);

NODE gb_mod(NODE,int);

NODE gbd(NODE,int,NODE,NODE);

NODE gb(NODE,int,NODE);

Line 96 void dp_f4_mod_main(LIST,LIST,int,struct order_spec *,

Line 141 void dp_f4_mod_main(LIST,LIST,int,struct order_spec *,

double get_rtime();

void _dpmod_to_vect(DP,DL *,int *);

void dp_to_vect(DP,DL *,Q *);

NODE dp_dllist(DP f),symb_merge(NODE,NODE,int);

NODE dp_dllist(DP f);

NODE symb_merge(NODE,NODE,int),_symb_merge(NODE,NODE,int);

extern int dp_nelim;

extern int dp_fcoeffs;

static DP *ps,*psm;

Line 113 static int NoCriB = 0;

Line 158 static int NoCriB = 0;

static int NoGC = 0;

static int NoMC = 0;

static int NoRA = 0;

int Print = 0;

int DP_Print = 0;

static int PrintShort = 0;

static int DP_PrintShort = 0;

static int ShowMag = 0;

static int Stat = 0;

static int Multiple = 0;

static int Denominator = 1;

static int Top = 0;

static int Reverse = 0;

static int InterReduce = 0;

static int Max_mag = 0;

static char *Demand = 0;

static int PtozpRA = 0;

Line 132 int OXCheck = -1;

Line 176 int OXCheck = -1;

int doing_f4;

NODE TraceList;

void Pdp_gr_flags(arg,rp)

NODE arg;

LIST *rp;

{

Obj name,value;

NODE n;

if ( arg ) {

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

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

while ( n ) {

name = (Obj)BDY(n); n = NEXT(n);

if ( !n )

break;

else {

value = (Obj)BDY(n); n = NEXT(n);

}

dp_set_flag(name,value);

}

dp_make_flaglist(rp);

}

void Pdp_gr_print(arg,rp)

NODE arg;

Q *rp;

{

Q q;

if ( arg ) {

asir_assert(ARG0(arg),O_N,"dp_gr_print");

q = (Q)ARG0(arg); Print = QTOS(q);

} else

STOQ(Print,q);

*rp = q;

}

void Pdp_gr_main(arg,rp)

NODE arg;

LIST *rp;

{

LIST f,v;

Num homo;

Q m;

int modular;

struct order_spec ord;

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); 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(ARG4(arg),&ord);

dp_gr_main(f,v,homo,modular,&ord,rp);

}

void Pdp_f4_main(arg,rp)

NODE arg;

LIST *rp;

{

LIST f,v;

struct order_spec ord;

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

}

void Pdp_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_f4_main");

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

asir_assert(ARG2(arg),O_N,"dp_f4_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);

}

void Pdp_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_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);

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

}

int eqdl(nv,dl1,dl2)

int nv;

DL dl1,dl2;

Line 370 LIST *rp;

Line 301 LIST *rp;

if ( homo ) {

initd(&ord1); CNVars = NVars+1;

}

if ( Print && modular ) {

if ( DP_Print && modular ) {

fprintf(asir_out,"mod= %d, eval = ",m); printsubst(subst);

}

x = gb(s,m,subst);

Line 579 NODE f;

Line 510 NODE f;

while ( d ) {

get_eg(&tmp0);

minsugar(d,&dm,&dr); d = dr;

if ( Print )

if ( DP_Print )

fprintf(asir_out,"sugar=%d\n",dm->sugar);

blist = 0; s0 = 0;

/* asph : sum of all head terms of spoly */

Line 620 NODE f;

Line 551 NODE f;

dp_to_vect(BDY(r),at,(Q *)mat->body[i]);

get_eg(&tmp1); add_eg(&eg_symb,&tmp0,&tmp1);

init_eg(&eg_split_symb); add_eg(&eg_split_symb,&tmp0,&tmp1);

if ( Print ) {

if ( DP_Print ) {

print_eg("Symb",&eg_split_symb);

fprintf(asir_out,"mat : %d x %d",row,col);

fflush(asir_out);

Line 630 NODE f;

Line 561 NODE f;

#else

rank = generic_gauss_elim(mat,&nm,&dn,&rind,&cind);

#endif

if ( Print )

if ( DP_Print )

fprintf(asir_out,"done rank = %d\n",rank,row,col);

for ( i = 0; i < rank; i++ ) {

for ( k = 0; k < nred; k++ )

Line 655 NODE f;

Line 586 NODE f;

}

if ( Print ) {

if ( DP_Print ) {

print_eg("Symb",&eg_symb);

print_eg("Mod",&eg_mod); print_eg("GaussElim",&eg_elim);

print_eg("ChRem",&eg_chrem); print_eg("IntToRat",&eg_intrat);

Line 697 int m;

Line 628 int m;

while ( d ) {

get_eg(&tmp0);

minsugar(d,&dm,&dr); d = dr;

if ( Print )

if ( DP_Print )

fprintf(asir_out,"sugar=%d\n",dm->sugar);

blist = 0; s0 = 0;

/* asph : sum of all head terms of spoly */

Line 717 int m;

Line 648 int m;

dltod(BDY(s),nv,&tdp);

dp_subd(tdp,ps[(int)BDY(r)],&sd);

_dp_mod(sd,m,0,&sdm);

_mulmd(CO,m,sdm,ps[(int)BDY(r)],&f2);

mulmd_dup(m,sdm,ps[(int)BDY(r)],&f2);

MKNODE(bt,f2,blist); blist = bt;

s = symb_merge(s,dp_dllist(f2),nv);

nred++;

Line 792 int m;

Line 723 int m;

for ( j = 0; j < spcol; j++ )

if ( spmat[i][j] )

nonzero++;

if ( Print )

if ( DP_Print )

fprintf(asir_out,"spmat : %d x %d (nonzero=%f%%)...",

nsp,spcol,((double)nonzero*100)/(nsp*spcol));

rank = generic_gauss_elim_mod(spmat,nsp,spcol,m,colstat);

Line 800 int m;

Line 731 int m;

get_eg(&tmp1); add_eg(&eg_elim2,&tmp0,&tmp1);

init_eg(&eg_split_elim2); add_eg(&eg_split_elim2,&tmp0,&tmp1);

if ( Print ) {

if ( DP_Print ) {

fprintf(asir_out,"done rank = %d\n",rank,row,col);

print_eg("Symb",&eg_split_symb);

print_eg("Elim1",&eg_split_elim1);

Line 825 int m;

Line 756 int m;

i++;

}

if ( Print ) {

if ( DP_Print ) {

print_eg("Symb",&eg_symb);

print_eg("Elim1",&eg_elim1);

print_eg("Elim2",&eg_elim2);

Line 1100 NODE *h;

Line 1031 NODE *h;

if ( NoRA ) {

*h = in; return;

}

if ( Print || PrintShort ) {

if ( DP_Print || DP_PrintShort ) {

fprintf(asir_out,"reduceall\n"); fflush(asir_out);

}

r = NODE_sortbi(in,0);

Line 1136 NODE *h;

Line 1067 NODE *h;

#endif

prim_part(g,0,&g1);

get_eg(&tmp1); add_eg(&eg_ra,&tmp0,&tmp1);

if ( Print || PrintShort ) {

if ( DP_Print || DP_PrintShort ) {

fprintf(asir_out,"."); fflush(asir_out);

}

w[i] = newps(g1,0,(NODE)0);

Line 1145 NODE *h;

Line 1076 NODE *h;

MKNODE(t,(pointer)w[j],top); top = t;

}

*h = top;

if ( Print || PrintShort )

if ( DP_Print || DP_PrintShort )

fprintf(asir_out,"\n");

}

Line 1157 NODE *h;

Line 1088 NODE *h;

NODE r,t,top;

int n,i,j;

int *w;

DP g;

DP g,p;

struct oEGT tmp0,tmp1;

if ( NoRA ) {

*h = in; return;

}

if ( Print || PrintShort ) {

if ( DP_Print || DP_PrintShort ) {

fprintf(asir_out,"reduceall\n"); fflush(asir_out);

}

r = NODE_sortbi(in,0);

Line 1179 NODE *h;

Line 1110 NODE *h;

get_eg(&tmp0);

if ( PCoeffs )

dp_nf_mod(top,ps[w[i]],ps,m,1,&g);

else

else {

_dp_nf_mod(top,ps[w[i]],ps,m,1,&g);

dpto_dp(ps[w[i]],&p);

_dp_nf_mod_destructive(top,p,ps,m,1,&g);

}

get_eg(&tmp1); add_eg(&eg_ra,&tmp0,&tmp1);

if ( Print || PrintShort ) {

if ( DP_Print || DP_PrintShort ) {

fprintf(asir_out,"."); fflush(asir_out);

}

w[i] = newps_mod(g,m);

Line 1191 NODE *h;

Line 1124 NODE *h;

MKNODE(t,(pointer)w[j],top); top = t;

}

*h = top;

if ( Print || PrintShort )

if ( DP_Print || DP_PrintShort )

fprintf(asir_out,"\n");

}

Line 1451 NODE subst;

Line 1384 NODE subst;

if ( m ) {

get_eg(&tspm0);

_dp_sp_mod_dup(psm[l->dp1],psm[l->dp2],m,&h);

new_sugar = h->sugar;

if ( h )

new_sugar = h->sugar;

get_eg(&tspm1); add_eg(&eg_spm,&tspm0,&tspm1);

get_eg(&tnfm0);

_dp_nf_mod_destructive(gall,h,psm,m,0,&nfm);

Line 1477 NODE subst;

Line 1411 NODE subst;

STOQ(l->dp1,q); ARG1(BDY((LIST)BDY(NEXT(TraceList)))) = q;

STOQ(l->dp2,q); ARG1(BDY((LIST)BDY(TraceList))) = q;

}

new_sugar = h->sugar;

if ( h )

new_sugar = h->sugar;

get_eg(&tsp1); add_eg(&eg_sp,&tsp0,&tsp1);

get_eg(&tnf0);

t_0 = get_rtime();

Line 1489 NODE subst;

Line 1424 NODE subst;

#else

_dp_nf_ptozp(gall,h,ps,!Top,Multiple,&nf);

#endif

if ( Print )

if ( DP_Print )

fprintf(asir_out,"(%.3g)",get_rtime()-t_0);

get_eg(&tnf1); add_eg(&eg_nf,&tnf0,&tnf1);

} else

Line 1516 skip_nf:

Line 1451 skip_nf:

mag += p_mag((P)mp->c);

Max_mag = MAX(Max_mag,mag);

}

if ( Print ) {

if ( DP_Print ) {

if ( !prev )

fprintf(asir_out,"\n");

print_split_e(&tnf0,&tnf1); print_split_e(&tpz0,&tpz1);

Line 1527 skip_nf:

Line 1462 skip_nf:

if ( ShowMag )

fprintf(asir_out,",mag=%d",mag);

fprintf(asir_out,"\n"); fflush(asir_out);

} else if ( PrintShort ) {

} else if ( DP_PrintShort ) {

fprintf(asir_out,"+"); fflush(asir_out);

}

prev = 1;

Line 1535 skip_nf:

Line 1470 skip_nf:

if ( m )

add_eg(&eg_znfm,&tnfm0,&tnfm1);

ZR++;

if ( Print || PrintShort ) {

if ( DP_Print || DP_PrintShort ) {

if ( new_sugar != prev_sugar ) {

fprintf(asir_out,"[%d]",new_sugar);

prev_sugar = new_sugar;

Line 1544 skip_nf:

Line 1479 skip_nf:

}

if ( Print || PrintShort )

if ( DP_Print || DP_PrintShort )

fprintf(asir_out,"gb done\n");

return g;

}

Line 1620 NODE dlist;

Line 1555 NODE dlist;

return 0;

g = updbase(g,nh);

gall = append_one(gall,nh);

if ( Print ) {

if ( DP_Print ) {

if ( !prev )

fprintf(asir_out,"\n");

print_split_eg(&tnf0,&tnf1); fflush(asir_out);

Line 1632 NODE dlist;

Line 1567 NODE dlist;

if ( m )

add_eg(&eg_znfm,&tnfm0,&tnfm1);

ZR++;

if ( Print ) {

if ( DP_Print ) {

fprintf(asir_out,"."); fflush(asir_out); prev = 0;

}

if ( Print )

if ( DP_Print )

fprintf(asir_out,"gb done\n");

return g;

}

Line 1684 int m;

Line 1619 int m;

return 0;

d = updpairs(d,g,nh);

g = updbase(g,nh);

if ( InterReduce )

interreduce_mod(g,nh,m);

gall = append_one(gall,nh);

if ( Print ) {

if ( DP_Print ) {

if ( !prev )

fprintf(asir_out,"\n");

print_split_eg(&tnfm0,&tnfm1); fflush(asir_out);

fprintf(asir_out,"(%d,%d),nb=%d,nab=%d,rp=%d,sugar=%d",l->dp1,l->dp2,length(g),length(gall),DPPlength(d),pss[nh]);

printdl(psh[nh]); fprintf(asir_out,"\n"); fflush(asir_out);

} else if ( PrintShort ) {

} else if ( DP_PrintShort ) {

fprintf(asir_out,"+"); fflush(asir_out);

}

prev = 1;

} else {

add_eg(&eg_znfm,&tnfm0,&tnfm1);

ZR++;

if ( Print || PrintShort ) {

if ( DP_Print || DP_PrintShort ) {

fprintf(asir_out,"."); fflush(asir_out); prev = 0;

}

if ( Print || PrintShort )

if ( DP_Print || DP_PrintShort )

fprintf(asir_out,"gb_mod done\n");

return g;

}

void interreduce_mod(g,n,m)

NODE g;

int n,m;

{

DP nf;

NODE gn,t;

int i;

MKNODE(gn,(pointer)n,0);

if ( PCoeffs )

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

i = (int)BDY(t);

if ( i != n ) {

dp_nf_mod(gn,ps[i],ps,m,1,&nf); ps[i] = nf;

}

else

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

i = (int)BDY(t);

if ( i != n ) {

_dp_nf_mod(gn,ps[i],ps,m,1,&nf); ps[i] = nf;

}

void _dp_nf_mod(b,g,ps,mod,full,rp)

NODE b;

DP g;

DP *ps;

int mod,full;

DP *rp;

{

DP u,p,d,s,t;

NODE l;

MP m,mr;

int sugar,psugar;

if ( !g ) {

*rp = 0; return;

}

sugar = g->sugar;

for ( d = 0; g; ) {

for ( u = 0, l = b; l; l = NEXT(l) ) {

if ( dp_redble(g,p = ps[(int)BDY(l)]) ) {

_dp_red_mod(g,p,mod,&u);

psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;

sugar = MAX(sugar,psugar);

if ( !u ) {

if ( d )

d->sugar = sugar;

*rp = d; return;

}

break;

}

if ( u )

g = u;

else if ( !full ) {

if ( g ) {

MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;

}

*rp = g; return;

} else {

m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;

NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;

_addmd(CO,mod,d,t,&s); d = s;

dp_rest(g,&t); g = t;

}

if ( d )

d->sugar = sugar;

*rp = d;

}

void _dp_nf(b,g,ps,full,rp)

NODE b;

DP g;

Line 1911 DP *r;

Line 1770 DP *r;

t_0 = get_rtime();

dp_subd(rp,red,&shift);

#if INET

if ( Dist && ndist && HMAG(red) > kara_bit ) {

NODE n0,n1,n2,n3;

int i,s,id;

Obj dmy;

Q ind;

if ( Print )

if ( DP_Print )

fprintf(asir_out,"d");

i = (int)BDY(l); STOQ(i,ind);

chsgnp((P)cred,(P *)&mcred);

Line 1929 DP *r;

Line 1787 DP *r;

muldc(CO,rp,(P)cr,&t);

NEXT(n0)=0;

Pox_pop_local(n0,&t1);

} else

} else {

#endif

{

if ( Print )

if ( DP_Print )

fprintf(asir_out,"l");

t_00 = get_rtime();

Line 1977 DP *r;

Line 1833 DP *r;

if ( u ) {

if ( HMAG(u) > hmag ) {

t_0 = get_rtime();

#if INET

if ( Dist && HMAG(u) > kara_bit ) {

if ( Print )

if ( DP_Print )

fprintf(asir_out,"D");

dp_ptozp_d(dist,ndist,u,&t);

} else {

if ( Print )

if ( DP_Print )

fprintf(asir_out,"L");

dp_ptozp_d(0,0,u,&t);

}

#else

dp_ptozp(u,&t); /* XXX */

#endif

tt = get_rtime()-t_0; t_g += tt;

t_0 = get_rtime();

divsn(NM((Q)BDY(u)->c),NM((Q)BDY(t)->c),&cn); NTOQ(cn,1,cont);

if ( !dp_fcoeffs && Print ) {

if ( !dp_fcoeffs && DP_Print ) {

fprintf(asir_out,"(%d)",p_mag((P)cont)*100/p_mag((P)BDY(u)->c));

fflush(asir_out);

}

Line 2050 DP *r;

Line 1902 DP *r;

dp->sugar = sugar;

*r = dp;

final:

if ( Print )

if ( DP_Print )

fprintf(asir_out,"(%.3g %.3g %.3g %.3g %.3g %.3g %.3g %.3g %.3g %.3g %.3g)",

t_p,t_m,t_m1,t_m2,t_s,

t_g,t_a,

Line 2121 DP *r;

Line 1973 DP *r;

t_00 = get_rtime();

if ( Dist && ndist

&& HMAG(rp) > mpi_mag && p_mag((P)cr) > mpi_mag ) {

if ( Print ) fprintf(asir_out,"~");

if ( DP_Print ) fprintf(asir_out,"~");

dp_imul_d(rp,cr,&t);

} else {

if ( Print ) fprintf(asir_out,"_");

if ( DP_Print ) fprintf(asir_out,"_");

muldc(CO,rp,(P)cr,&t);

}

ttt = get_rtime()-t_00; t_m1 += ttt/dp_nt(rp);

Line 2133 DP *r;

Line 1985 DP *r;

chsgnp((P)cred,(P *)&mcred);

if ( Dist && ndist

&& HMAG(red) > mpi_mag && p_mag((P)mcred) > mpi_mag ) {

if ( Print ) fprintf(asir_out,"=");

if ( DP_Print ) fprintf(asir_out,"=");

dp_imul_d(red,mcred,&t1);

} else {

if ( Print ) fprintf(asir_out,"_");

if ( DP_Print ) fprintf(asir_out,"_");

muldc(CO,red,(P)mcred,&t1);

}

ttt = get_rtime()-t_00; t_m2 += ttt/dp_nt(red);

Line 2162 DP *r;

Line 2014 DP *r;

if ( HMAG(u) > hmag ) {

t_0 = get_rtime();

if ( Dist && HMAG(u) > mpi_mag ) {

if ( Print )

if ( DP_Print )

fprintf(asir_out,"D");

dp_ptozp_d(dist,ndist,u,&t);

} else {

if ( Print )

if ( DP_Print )

fprintf(asir_out,"L");

dp_ptozp_d(0,0,u,&t);

}

tt = get_rtime()-t_0; t_g += tt;

t_0 = get_rtime();

divsn(NM((Q)BDY(u)->c),NM((Q)BDY(t)->c),&cn); NTOQ(cn,1,cont);

if ( Print ) {

if ( DP_Print ) {

fprintf(asir_out,"(%d)",p_mag((P)cont)*100/p_mag((P)BDY(u)->c));

fflush(asir_out);

}

Line 2217 DP *r;

Line 2069 DP *r;

dp->sugar = sugar;

*r = dp;

final:

if ( Print )

if ( DP_Print )

fprintf(asir_out,"(%.3g %.3g %.3g %.3g %.3g %.3g %.3g %.3g %.3g %.3g %.3g)",

t_p,t_m,t_m1,t_m2,t_s,

t_g,t_a,

Line 2568 NODE f;

Line 2420 NODE f;

g = updbase(g,i);

gall = append_one(gall,i);

}

if ( Print || PrintShort ) {

if ( DP_Print || DP_PrintShort ) {

fprintf(asir_out,"gbcheck total %d pairs\n",DPPlength(d)); fflush(asir_out);

}

while ( d ) {

Line 2577 NODE f;

Line 2429 NODE f;

dp_load(l->dp1,&dp1); dp_load(l->dp2,&dp2); dp_sp(dp1,dp2,&h);

_dp_nf(gall,h,ps,1,&nf);

get_eg(&tmp1); add_eg(&eg_gc,&tmp0,&tmp1);

if ( Print || PrintShort ) {

if ( DP_Print || DP_PrintShort ) {

fprintf(asir_out,"."); fflush(asir_out);

}

if ( nf )

return 0;

}

if ( Print || PrintShort )

if ( DP_Print || DP_PrintShort )

fprintf(asir_out,"\n");

return 1;

}

Line 2596 NODE f,x;

Line 2448 NODE f,x;

if ( NoMC )

return 1;

if ( Print || PrintShort ) {

if ( DP_Print || DP_PrintShort ) {

fprintf(asir_out,"membercheck\n"); fflush(asir_out);

}

for ( ; f; f = NEXT(f) ) {

get_eg(&tmp0);

_dp_nf(x,(DP)BDY(f),ps,1,&g);

get_eg(&tmp1); add_eg(&eg_mc,&tmp0,&tmp1);

if ( Print ) {

if ( DP_Print ) {

print_split_eg(&tmp0,&tmp1); fflush(asir_out);

} else if ( PrintShort ) {

} else if ( DP_PrintShort ) {

fprintf(asir_out,"."); fflush(asir_out);

}

if ( g )

return 0;

}

if ( Print || PrintShort )

if ( DP_Print || DP_PrintShort )

fprintf(asir_out,"\n");

return 1;

}

Line 2650 Obj name,value;

Line 2502 Obj name,value;

Top = v;

else if ( !strcmp(n,"ShowMag") )

ShowMag = v;

else if ( !strcmp(n,"PrintShort") )

else if ( !strcmp(n,"DP_PrintShort") )

PrintShort = v;

DP_PrintShort = v;

else if ( !strcmp(n,"Print") )

else if ( !strcmp(n,"DP_Print") )

Print = v;

DP_Print = v;

else if ( !strcmp(n,"Stat") )

Stat = v;

else if ( !strcmp(n,"Reverse") )

Reverse = v;

else if ( !strcmp(n,"InterReduce") )

InterReduce = v;

else if ( !strcmp(n,"Multiple") )

Multiple = v;

else if ( !strcmp(n,"Denominator") )

Line 2682 LIST *list;

Line 2532 LIST *list;

STOQ(Multiple,v); MKNODE(n,v,0); MKSTR(name,"Multiple"); MKNODE(n1,name,n); n = n1;

STOQ(Denominator,v); MKNODE(n1,v,n); n = n1; MKSTR(name,"Denominator"); MKNODE(n1,name,n); n = n1;

MKNODE(n1,Dist,n); n = n1; MKSTR(name,"Dist"); MKNODE(n1,name,n); n = n1;

STOQ(InterReduce,v); MKNODE(n1,v,n); n = n1; MKSTR(name,"InterReduce"); MKNODE(n1,name,n); n = n1;

STOQ(Reverse,v); MKNODE(n1,v,n); n = n1; MKSTR(name,"Reverse"); MKNODE(n1,name,n); n = n1;

STOQ(Stat,v); MKNODE(n1,v,n); n = n1; MKSTR(name,"Stat"); MKNODE(n1,name,n); n = n1;

STOQ(Print,v); MKNODE(n1,v,n); n = n1; MKSTR(name,"Print"); MKNODE(n1,name,n); n = n1;

STOQ(DP_Print,v); MKNODE(n1,v,n); n = n1; MKSTR(name,"DP_Print"); MKNODE(n1,name,n); n = n1;

STOQ(OXCheck,v); MKNODE(n1,v,n); n = n1; MKSTR(name,"OXCheck"); MKNODE(n1,name,n); n = n1;

STOQ(GenTrace,v); MKNODE(n1,v,n); n = n1; MKSTR(name,"GenTrace"); MKNODE(n1,name,n); n = n1;

STOQ(PtozpRA,v); MKNODE(n1,v,n); n = n1; MKSTR(name,"PtozpRA"); MKNODE(n1,name,n); n = n1;

Line 2707 LIST *list;

Line 2556 LIST *list;

#define DELIM '/'

#if defined(THINK_C)

#undef DELIM

#define DELIM ':'

#endif

void dp_save(index,p,prefix)

int index;

Obj p;

Line 2724 char *prefix;

Line 2568 char *prefix;

sprintf(path,"%s%c%s%d",Demand,DELIM,prefix,index);

else

sprintf(path,"%s%c%d",Demand,DELIM,index);

#if defined(VISUAL) || defined(THINK_C)

if ( !(fp = fopen(path,"wb") ) )

#else

if ( !(fp = fopen(path,"w") ) )

#endif

error("dp_save : cannot open a file");

savevl(fp,VC); saveobj(fp,p); fclose(fp);

}

Line 2744 DP *p;

Line 2584 DP *p;

*p = ps[index];

else {

sprintf(path,"%s%c%d",Demand,DELIM,index);

#if defined(VISUAL) || defined(THINK_C)

if ( !(fp = fopen(path,"rb") ) )

#else

if ( !(fp = fopen(path,"r") ) )

#endif

error("dp_load : cannot open a file");

skipvl(fp); loadobj(fp,(Obj *)p); fclose(fp);

}

Line 2762 DP *p;

Line 2598 DP *p;

char path[BUFSIZ];

sprintf(path,"%s%c%d",Demand,DELIM,index);

#if defined(VISUAL) || defined(THINK_C)

if ( !(fp = fopen(path,"rb") ) )

#else

if ( !(fp = fopen(path,"r") ) )

#endif

return 0;

else {

skipvl(fp); loadobj(fp,(Obj *)p); fclose(fp); return 1;

Line 2782 void init_stat() {

Line 2614 void init_stat() {

}

void print_stat() {

if ( !Print && !Stat )

if ( !DP_Print && !Stat )

return;

print_eg("UP",&eg_up); print_eg("SP",&eg_sp); print_eg("SPM",&eg_spm);

print_eg("NF",&eg_nf); print_eg("NFM",&eg_nfm); print_eg("ZNFM",&eg_znfm);

Line 2790 void print_stat() {

Line 2622 void print_stat() {

print_eg("RA",&eg_ra); print_eg("MC",&eg_mc); print_eg("GC",&eg_gc);

fprintf(asir_out,"T=%d,B=%d M=%d F=%d D=%d ZR=%d NZR=%d\n",TP,NBP,NMP,NFP,NDP,ZR,NZR);

}

* Old codes

#if 0

void _dp_nf_ptozp(b,g,ps,full,multiple,rp)

NODE b;

DP g;

DP *ps;

int full,multiple;

DP *rp;

{

P dmy;

DP u,p,d,s,t,dmy1;

NODE l;

MP m,mr;

int i,n;

int hmag,denom;

int sugar,psugar;

NODE dist;

int ndist;

int kara_bit;

extern int kara_mag;

if ( !g ) {

*rp = 0; return;

}

denom = Denominator?Denominator:1;

hmag = multiple*HMAG(g)/denom;

kara_bit = kara_mag*27; /* XXX */

if ( Dist ) {

dist = BDY(Dist);

ndist = length(dist);

}

sugar = g->sugar;

for ( d = 0; g; ) {

for ( u = 0, l = b; l; l = NEXT(l) ) {

if ( dl_redble(BDY(g)->dl,psh[(int)BDY(l)]) ) {

dp_load((int)BDY(l),&p);

dp_red(d,g,p,&t,&u,&dmy,&dmy1);

psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;

sugar = MAX(sugar,psugar);

if ( !u ) {

if ( d )

d->sugar = sugar;

*rp = d; return;

}

d = t;

break;

}

if ( u ) {

g = u;

if ( d ) {

if ( HMAG(d) > hmag ) {

if ( Dist && HMAG(g) > kara_bit )

dp_ptozp2_d(dist,ndist,d,g,&t,&u);

else

dp_ptozp2(d,g,&t,&u);

d = t; g = u;

hmag = multiple*HMAG(d)/denom;

}

} else {

if ( HMAG(g) > hmag ) {

#if INET

if ( Dist && HMAG(g) > kara_bit ) {

dp_ptozp_d(dist,ndist,g,&t);

} else

#endif

dp_ptozp(g,&t);

g = t;

hmag = multiple*HMAG(g)/denom;

}

else if ( !full ) {

if ( g ) {

MKDP(g->nv,BDY(g),t); t->sugar = sugar; g = t;

}

*rp = g; return;

} else {

m = BDY(g); NEWMP(mr); mr->dl = m->dl; mr->c = m->c;

NEXT(mr) = 0; MKDP(g->nv,mr,t); t->sugar = mr->dl->td;

addd(CO,d,t,&s); d = s;

dp_rest(g,&t); g = t;

}

if ( d )

d->sugar = sugar;

*rp = d;

}

int criterion_2(dp1,dp2)

{

DP g1,g2,g,s1,s2;

monomial_gcd(ps[dp1],&g1); monomial_gcd(ps[dp2],&g2);

dp_gcd(g1,g2,&g);

dp_subd(ps[dp1],g,&s1); dp_subd(ps[dp2],g,&s2);

return _criterion_2(s1,s2);

}

int _criterion_2( dp1, dp2 )

DP dp1, dp2;

{

d1 = BDY(dp1)->dl->d; d2 = BDY(dp2)->dl->d;

for ( i = CNVars; --i >= 0; d1++, d2++ )

if ( (*d1 <= *d2 ? *d1 : *d2) > 0 ) return 0;

return 1;

}

void dp_gcd(p1,p2,rp)

DP p1,p2;

DP *rp;

{

int i,n,td;

DL d1,d2,d;

MP m;

DP s;

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] = MIN(d1->d[i],d2->d[i]);

td += d->d[i];

}

d->td = td;

NEWMP(m); m->dl = d; m->c = (P)ONE; NEXT(m) = 0; MKDP(n,m,s); s->sugar = d->td;

*rp = s;

}

void monomial_gcd(p,rp)

DP p;

DP *rp;

{

int n,i,td;

DL d,d1;

MP m;

DP s;

n = p->nv; m = BDY(p); d = m->dl;

NEWDL(d1,n);

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

d1->d[i] = d->d[i];

for ( m = NEXT(m); m; m = NEXT(m) ) {

d = m->dl;

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

d1->d[i] = MIN(d1->d[i],d->d[i]);

}

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

td += d1->d[i];

NEWMP(m); m->dl = d1; m->c = (P)ONE; NEXT(m) = 0; MKDP(n,m,s); s->sugar = d->td;

*rp = s;

}

#endif

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