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.6 and 1.11

version 1.6, 2000/07/13 05:09:00

version 1.11, 2000/12/05 01:24:50

Line 1

/* $OpenXM: OpenXM_contrib2/asir2000/builtin/gr.c,v 1.5 2000/05/29 08:54:45 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.10 2000/09/08 02:56:32 noro Exp $

#include "ca.h"

#include "parse.h"

#include "base.h"

Line 42 void print_stat(void);

Line 90 void print_stat(void);

void init_stat(void);

int dp_load_t(int,DP *);

void dp_load(int,DP *);

void dp_save(int,DP);

void dp_save(int,Obj,char *);

void dp_make_flaglist(LIST *);

void dp_set_flag(Obj,Obj);

int membercheck(NODE,NODE);

Line 127 static char *Demand = 0;

Line 175 static char *Demand = 0;

static int PtozpRA = 0;

LIST Dist = 0;

int NoGCD = 0;

int GenTrace = 0;

int OXCheck = -1;

int doing_f4;

NODE TraceList;

void Pdp_gr_flags(arg,rp)

NODE arg;

Line 956 NODE f,*r;

Line 1007 NODE f,*r;

int m;

{

int i;

NODE s,s0;

NODE s,s0,f0;

f = NODE_sortb(f,1);

f0 = f = NODE_sortb(f,1);

psn = length(f); pslen = 2*psn;

ps = (DP *)MALLOC(pslen*sizeof(DP));

psh = (DL *)MALLOC(pslen*sizeof(DL));

Line 967 int m;

Line 1018 int m;

for ( i = 0; i < psn; i++, f = NEXT(f) ) {

prim_part((DP)BDY(f),m,&ps[i]);

if ( Demand )

dp_save(i,ps[i]);

dp_save(i,(Obj)ps[i],0);

psh[i] = BDY(ps[i])->dl;

pss[i] = ps[i]->sugar;

psc[i] = BDY(ps[i])->c;

}

if ( GenTrace && (OXCheck >= 0) ) {

Q q;

STRING fname;

LIST input;

NODE arg;

Obj dmy;

STOQ(OXCheck,q);

MKSTR(fname,"register_input");

MKLIST(input,f0);

arg = mknode(3,q,fname,input);

Pox_cmo_rpc(arg,&dmy);

}

for ( s0 = 0, i = 0; i < psn; i++ ) {

NEXTNODE(s0,s); BDY(s) = (pointer)i;

}

Line 983 void prim_part(f,m,r)

Line 1047 void prim_part(f,m,r)

DP f,*r;

int m;

{

P d,t;

if ( m > 0 ) {

if ( PCoeffs )

dp_prim_mod(f,m,r);

Line 995 int m;

Line 1061 int m;

dp_prim(f,r);

else

dp_ptozp(f,r);

if ( GenTrace && TraceList ) {

divsp(CO,BDY(f)->c,BDY(*r)->c,&d);

mulp(CO,(P)ARG3(BDY((LIST)BDY(TraceList))),d,&t);

ARG3(BDY((LIST)BDY(TraceList))) = t;

}

Line 1092 NODE *h;

Line 1163 NODE *h;

}

get_eg(&tmp0);

dp_load(w[i],&ps[w[i]]);

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

if ( GenTrace ) {

Q q;

NODE node;

LIST hist;

STOQ(w[i],q);

node = mknode(4,ONE,q,ONE,ONE);

MKLIST(hist,node);

MKNODE(TraceList,hist,0);

}

if ( !PtozpRA || !Multiple )

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

else

Line 1184 NODE subst;

Line 1264 NODE subst;

ps[psn] = a;

else

ps[psn] = 0;

dp_save(psn,a);

dp_save(psn,(Obj)a,0);

} else

ps[psn] = a;

psh[psn] = BDY(a)->dl;

Line 1192 NODE subst;

Line 1272 NODE subst;

psc[psn] = BDY(a)->c;

if ( m )

_dp_mod(a,m,subst,&psm[psn]);

if ( GenTrace ) {

NODE tn,tr,tr1;

LIST trace;

/* reverse the TraceList */

tn = TraceList;

for ( tr = 0; tn; tn = NEXT(tn) ) {

MKNODE(tr1,BDY(tn),tr); tr = tr1;

}

MKLIST(trace,tr);

if ( OXCheck >= 0 ) {

NODE arg;

Q q1,q2;

STRING fname;

Obj dmy;

STOQ(OXCheck,q1);

MKSTR(fname,"check_trace");

STOQ(psn,q2);

arg = mknode(5,q1,fname,a,q2,trace);

Pox_cmo_rpc(arg,&dmy);

} else

dp_save(psn,(Obj)trace,"t");

TraceList = 0;

}

return psn++;

}

Line 1267 NODE f,*g;

Line 1372 NODE f,*g;

}

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

if ( r[i] >= 0 ) {

dp_load(r[i],&ps[r[i]]); dp_dehomo(ps[r[i]],&u); j = newps(u,0,0);

dp_load(r[i],&ps[r[i]]); dp_dehomo(ps[r[i]],&u);

if ( GenTrace ) {

Q q;

LIST hist;

NODE node;

STOQ(r[i],q);

node = mknode(4,0,q,0,0);

MKLIST(hist,node);

MKNODE(TraceList,hist,0);

}

j = newps(u,0,0);

MKNODE(t,j,top); top = t;

}

*g = top;

Line 1355 NODE subst;

Line 1471 NODE subst;

struct oEGT tnf0,tnf1,tnfm0,tnfm1,tpz0,tpz1,tsp0,tsp1,tspm0,tspm1,tnp0,tnp1,tmp0,tmp1;

int skip_nf_flag;

double t_0;

Q q;

int new_sugar;

static prev_sugar = -1;

Line 1382 NODE subst;

Line 1499 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 1404 NODE subst;

Line 1522 NODE subst;

}

} else

dp_sp(ps[l->dp1],ps[l->dp2],&h);

new_sugar = h->sugar;

if ( GenTrace ) {

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

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

}

if ( h )

new_sugar = h->sugar;

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

get_eg(&tnf0);

t_0 = get_rtime();

Line 1718 DP *ps;

Line 1841 DP *ps;

int full;

DP *rp;

{

DP u,p,d,s,t;

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

P dmy;

P coef;

NODE l;

MP m,mr;

int sugar,psugar;

Line 1732 DP *rp;

Line 1855 DP *rp;

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

/* t+u = coef*(d+g) - mult*p (t = coef*d) */

dp_red(d,g,p,&t,&u,&coef,&mult);

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

sugar = MAX(sugar,psugar);

if ( GenTrace ) {

LIST hist;

Q cq;

NODE node,node0;

STOQ((int)BDY(l),cq);

node0 = mknode(4,coef,cq,mult,ONE);

MKLIST(hist,node0);

MKNODE(node,hist,TraceList); TraceList = node;

}

if ( !u ) {

if ( d )

d->sugar = sugar;

Line 1767 DP *rp;

Line 1901 DP *rp;

double pz_t_e, pz_t_d, pz_t_d1, pz_t_c, im_t_s, im_t_r;

extern int GenTrace;

extern NODE TraceList;

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

NODE b;

DP g;

Line 1788 DP *r;

Line 1925 DP *r;

extern int kara_mag;

double get_rtime();

double t_0,t_00,tt,ttt,t_p,t_m,t_m1,t_m2,t_s,t_g,t_a;

LIST hist;

NODE node;

Q rcred,mrcred;

if ( !g ) {

*r = 0; return;

Line 1807 DP *r;

Line 1947 DP *r;

dc = 0; dp = 0; rc = ONE; rp = g;

MKSTR(imul,"dp_imul_index");

/* g = dc*dp+rc*rp */

for ( ; rp; ) {

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

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

Line 1820 DP *r;

Line 1961 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;

Line 1838 DP *r;

Line 1978 DP *r;

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

NEXT(n0)=0;

Pox_pop_local(n0,&t1);

} else

} else {

#endif

{

if ( Print )

fprintf(asir_out,"l");

Line 1861 DP *r;

Line 1999 DP *r;

psugar = (BDY(rp)->dl->td - BDY(red)->dl->td) + red->sugar;

sugar = MAX(sugar,psugar);

if ( GenTrace ) {

/* u = cr*rp + (-cred)*shift*red */

STOQ((int)BDY(l),cq);

node = mknode(4,cr,cq,0,0);

mulq(cred,rc,&rcred);

chsgnnum((Num)rcred,(Num *)&mrcred);

muldc(CO,shift,(P)mrcred,(DP *)&ARG2(node));

MKLIST(hist,node);

}

if ( !u ) {

if ( dp )

dp->sugar = sugar;

*r = dp;

if ( GenTrace ) {

ARG3(BDY(hist)) = ONE;

MKNODE(node,hist,TraceList); TraceList = node;

}

goto final;

}

break;

Line 1873 DP *r;

Line 2024 DP *r;

if ( u ) {

if ( HMAG(u) > hmag ) {

t_0 = get_rtime();

#if INET

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

if ( Print )

fprintf(asir_out,"D");

Line 1882 DP *r;

Line 2032 DP *r;

if ( Print )

fprintf(asir_out,"L");

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

}

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

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

Line 1901 DP *r;

Line 2048 DP *r;

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

rp = t;

hmag = multiple*HMAG(rp)/denom;

if ( GenTrace ) {

NTOQ(gn,1,gcd);

ARG3(BDY(hist)) = (pointer)gcd;

MKNODE(node,hist,TraceList); TraceList = node;

}

} else {

t_0 = get_rtime();

mulq(cr,dc,&dcq); dc = dcq;

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

rp = u;

if ( GenTrace ) {

ARG3(BDY(hist)) = (pointer)ONE;

MKNODE(node,hist,TraceList); TraceList = node;

}

} else if ( !full ) {

if ( rp ) {

Line 1929 DP *r;

Line 2085 DP *r;

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

}

if ( GenTrace ) {

mulq(ARG3(BDY((LIST)BDY(TraceList))),dc,&cq);

ARG3(BDY((LIST)BDY(TraceList))) = (pointer)cq;

}

if ( dp )

dp->sugar = sugar;

*r = dp;

Line 2549 Obj name,value;

Line 2709 Obj name,value;

Denominator = v;

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

PtozpRA = v;

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

GenTrace = v;

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

OXCheck = v;

}

void dp_make_flaglist(list)

Line 2565 LIST *list;

Line 2729 LIST *list;

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

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

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

Line 2584 LIST *list;

Line 2750 LIST *list;

#define DELIM '/'

#if defined(THINK_C)

void dp_save(index,p,prefix)

#undef DELIM

#define DELIM ':'

#endif

void dp_save(index,p)

int index;

DP p;

Obj p;

char *prefix;

{

FILE *fp;

char path[BUFSIZ];

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

if ( prefix )

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

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

else

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

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

#else

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

#endif

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

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

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

}

void dp_load(index,p)

Line 2617 DP *p;

Line 2778 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 2635 DP *p;

Line 2792 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 2663 void print_stat() {

Line 2816 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;

{

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

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

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>