version 1.57, 2004/02/03 23:31:57 |
version 1.60, 2005/11/16 23:42:53 |
|
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* |
* |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/gr.c,v 1.56 2003/12/26 02:38:10 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/gr.c,v 1.59 2005/02/17 06:27:35 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
Line 69 double get_rtime(); |
|
Line 69 double get_rtime(); |
|
|
|
struct oEGT eg_nf,eg_nfm; |
struct oEGT eg_nf,eg_nfm; |
struct oEGT eg_znfm,eg_pz,eg_np,eg_ra,eg_mc,eg_gc; |
struct oEGT eg_znfm,eg_pz,eg_np,eg_ra,eg_mc,eg_gc; |
int TP,NBP,NMP,NFP,NDP,ZR,NZR; |
int TP,N_BP,NMP,NFP,NDP,ZR,NZR; |
|
|
extern int (*cmpdl)(); |
extern int (*cmpdl)(); |
extern int do_weyl; |
extern int do_weyl; |
Line 1383 void reduceall(NODE in,NODE *h) |
|
Line 1383 void reduceall(NODE in,NODE *h) |
|
w = (int *)ALLOCA(n*sizeof(int)); |
w = (int *)ALLOCA(n*sizeof(int)); |
for ( i = 0, t = r; i < n; i++, t = NEXT(t) ) |
for ( i = 0, t = r; i < n; i++, t = NEXT(t) ) |
w[i] = (int)BDY(t); |
w[i] = (int)BDY(t); |
|
/* w[i] < 0 : reduced to 0 */ |
for ( i = 0; i < n; i++ ) { |
for ( i = 0; i < n; i++ ) { |
for ( top = 0, j = n-1; j >= 0; j-- ) |
for ( top = 0, j = n-1; j >= 0; j-- ) |
if ( j != i ) { |
if ( w[j] >= 0 && j != i ) { |
MKNODE(t,(pointer)w[j],top); top = t; |
MKNODE(t,(pointer)w[j],top); top = t; |
} |
} |
get_eg(&tmp0); |
get_eg(&tmp0); |
Line 1407 void reduceall(NODE in,NODE *h) |
|
Line 1408 void reduceall(NODE in,NODE *h) |
|
if ( DP_Print || DP_PrintShort ) { |
if ( DP_Print || DP_PrintShort ) { |
fprintf(asir_out,"."); fflush(asir_out); |
fprintf(asir_out,"."); fflush(asir_out); |
} |
} |
w[i] = newps(g1,0,(NODE)0); |
if ( g1 ) { |
|
w[i] = newps(g1,0,(NODE)0); |
|
} else { |
|
w[i] = -1; |
|
} |
} |
} |
for ( top = 0, j = n-1; j >= 0; j-- ) { |
for ( top = 0, j = n-1; j >= 0; j-- ) { |
MKNODE(t,(pointer)w[j],top); top = t; |
if ( w[j] >= 0 ) { |
|
MKNODE(t,(pointer)w[j],top); top = t; |
|
} |
} |
} |
*h = top; |
*h = top; |
if ( DP_Print || DP_PrintShort ) |
if ( DP_Print || DP_PrintShort ) |
Line 1436 void reduceall_mod(NODE in,int m,NODE *h) |
|
Line 1443 void reduceall_mod(NODE in,int m,NODE *h) |
|
w = (int *)ALLOCA(n*sizeof(int)); |
w = (int *)ALLOCA(n*sizeof(int)); |
for ( i = 0, t = r; i < n; i++, t = NEXT(t) ) |
for ( i = 0, t = r; i < n; i++, t = NEXT(t) ) |
w[i] = (int)BDY(t); |
w[i] = (int)BDY(t); |
|
/* w[i] < 0 : reduced to 0 */ |
for ( i = 0; i < n; i++ ) { |
for ( i = 0; i < n; i++ ) { |
for ( top = 0, j = n-1; j >= 0; j-- ) |
for ( top = 0, j = n-1; j >= 0; j-- ) |
if ( j != i ) { |
if ( w[j] >= 0 && j != i ) { |
MKNODE(t,(pointer)w[j],top); top = t; |
MKNODE(t,(pointer)w[j],top); top = t; |
} |
} |
get_eg(&tmp0); |
get_eg(&tmp0); |
Line 1452 void reduceall_mod(NODE in,int m,NODE *h) |
|
Line 1460 void reduceall_mod(NODE in,int m,NODE *h) |
|
if ( DP_Print || DP_PrintShort ) { |
if ( DP_Print || DP_PrintShort ) { |
fprintf(asir_out,"."); fflush(asir_out); |
fprintf(asir_out,"."); fflush(asir_out); |
} |
} |
w[i] = newps_mod(g,m); |
if ( g ) { |
|
w[i] = newps_mod(g,m); |
|
} else { |
|
w[i] = -1; |
|
} |
} |
} |
for ( top = 0, j = n-1; j >= 0; j-- ) { |
for ( top = 0, j = n-1; j >= 0; j-- ) { |
MKNODE(t,(pointer)w[j],top); top = t; |
if ( w[j] >= 0 ) { |
|
MKNODE(t,(pointer)w[j],top); top = t; |
|
} |
} |
} |
*h = top; |
*h = top; |
if ( DP_Print || DP_PrintShort ) |
if ( DP_Print || DP_PrintShort ) |
Line 1870 DP_pairs updpairs( DP_pairs d, NODE /* of index */ g, |
|
Line 1884 DP_pairs updpairs( DP_pairs d, NODE /* of index */ g, |
|
if ( !NoCriB && d ) { |
if ( !NoCriB && d ) { |
dl = DPPlength(d); |
dl = DPPlength(d); |
d = criterion_B( d, t ); |
d = criterion_B( d, t ); |
dl -= DPPlength(d); NBP += dl; |
dl -= DPPlength(d); N_BP += dl; |
} |
} |
d1 = newpairs( g, t ); |
d1 = newpairs( g, t ); |
if ( NEXT(d1) ) { |
if ( NEXT(d1) ) { |
Line 2357 void init_stat() { |
|
Line 2371 void init_stat() { |
|
init_eg(&eg_nf); init_eg(&eg_nfm); init_eg(&eg_znfm); |
init_eg(&eg_nf); init_eg(&eg_nfm); init_eg(&eg_znfm); |
init_eg(&eg_pz); init_eg(&eg_np); |
init_eg(&eg_pz); init_eg(&eg_np); |
init_eg(&eg_ra); init_eg(&eg_mc); init_eg(&eg_gc); |
init_eg(&eg_ra); init_eg(&eg_mc); init_eg(&eg_gc); |
ZR = NZR = TP = NMP = NBP = NFP = NDP = 0; |
ZR = NZR = TP = NMP = N_BP = NFP = NDP = 0; |
} |
} |
|
|
void print_stat() { |
void print_stat() { |
Line 2366 void print_stat() { |
|
Line 2380 void print_stat() { |
|
print_eg("NF",&eg_nf); print_eg("NFM",&eg_nfm); print_eg("ZNFM",&eg_znfm); |
print_eg("NF",&eg_nf); print_eg("NFM",&eg_nfm); print_eg("ZNFM",&eg_znfm); |
print_eg("PZ",&eg_pz); print_eg("NP",&eg_np); |
print_eg("PZ",&eg_pz); print_eg("NP",&eg_np); |
print_eg("RA",&eg_ra); print_eg("MC",&eg_mc); print_eg("GC",&eg_gc); |
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); |
fprintf(asir_out,"T=%d,B=%d M=%d F=%d D=%d ZR=%d NZR=%d\n",TP,N_BP,NMP,NFP,NDP,ZR,NZR); |
} |
} |
|
|
/* |
/* |