| version 1.63, 2003/09/11 09:03:53 |
version 1.84, 2003/10/18 01:39:42 |
|
|
| /* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.62 2003/09/11 01:52:25 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.83 2003/10/17 05:15:20 noro Exp $ */ |
| |
|
| #include "ca.h" |
#include "ca.h" |
| |
#include "parse.h" |
| |
#include "ox.h" |
| #include "inline.h" |
#include "inline.h" |
| |
#include <time.h> |
| |
|
| #if defined(__GNUC__) |
#if defined(__GNUC__) |
| #define INLINE inline |
#define INLINE inline |
|
|
| typedef unsigned int UINT; |
typedef unsigned int UINT; |
| |
|
| #define USE_GEOBUCKET 1 |
#define USE_GEOBUCKET 1 |
| |
#define USE_UNROLL 1 |
| |
|
| #define REDTAB_LEN 32003 |
#define REDTAB_LEN 32003 |
| |
|
| Line 40 typedef struct oNDV { |
|
| Line 44 typedef struct oNDV { |
|
| int sugar; |
int sugar; |
| } *NDV; |
} *NDV; |
| |
|
| |
typedef union oNDC { |
| |
int m; |
| |
Q z; |
| |
P p; |
| |
} *NDC; |
| |
|
| /* monomial; linked list rep. */ |
/* monomial; linked list rep. */ |
| typedef struct oNM { |
typedef struct oNM { |
| struct oNM *next; |
struct oNM *next; |
| union { |
union oNDC c; |
| int m; |
|
| Q z; |
|
| P p; |
|
| } c; |
|
| UINT dl[1]; |
UINT dl[1]; |
| } *NM; |
} *NM; |
| |
|
| /* monomial; array rep. */ |
/* monomial; array rep. */ |
| typedef struct oNMV { |
typedef struct oNMV { |
| union { |
union oNDC c; |
| int m; |
|
| Q z; |
|
| P p; |
|
| } c; |
|
| UINT dl[1]; |
UINT dl[1]; |
| } *NMV; |
} *NMV; |
| |
|
| Line 98 typedef struct oBaseSet { |
|
| Line 100 typedef struct oBaseSet { |
|
| typedef struct oNM_ind_pair |
typedef struct oNM_ind_pair |
| { |
{ |
| NM mul; |
NM mul; |
| int index; |
int index,sugar; |
| } *NM_ind_pair; |
} *NM_ind_pair; |
| |
|
| |
typedef struct oIndArray |
| |
{ |
| |
char width; |
| |
int head; |
| |
union { |
| |
unsigned char *c; |
| |
unsigned short *s; |
| |
unsigned int *i; |
| |
} index; |
| |
} *IndArray; |
| |
|
| int (*ndl_compare_function)(UINT *a1,UINT *a2); |
int (*ndl_compare_function)(UINT *a1,UINT *a2); |
| |
|
| |
static int ndv_alloc; |
| |
static int nd_f4_nsp=0x7fffffff; |
| static double nd_scale=2; |
static double nd_scale=2; |
| static UINT **nd_bound; |
static UINT **nd_bound; |
| static struct order_spec *nd_ord; |
static struct order_spec *nd_ord; |
| Line 130 static int nd_found,nd_create,nd_notfirst; |
|
| Line 144 static int nd_found,nd_create,nd_notfirst; |
|
| static int nm_adv; |
static int nm_adv; |
| static int nmv_adv; |
static int nmv_adv; |
| static int nd_dcomp; |
static int nd_dcomp; |
| |
static int nd_demand; |
| |
|
| |
extern struct order_spec dp_current_spec; |
| |
extern char *Demand; |
| extern VL CO; |
extern VL CO; |
| extern int Top,Reverse,dp_nelim,do_weyl; |
extern int Top,Reverse,DP_Print,dp_nelim,do_weyl,NoSugar; |
| extern int *current_weyl_weight_vector; |
extern int *current_weyl_weight_vector; |
| |
|
| /* fundamental macros */ |
/* fundamental macros */ |
| Line 198 if(!(r)){NEWNM(r);(c)=(r);}else{NEWNM(NEXT(c));(c)=NEX |
|
| Line 215 if(!(r)){NEWNM(r);(c)=(r);}else{NEWNM(NEXT(c));(c)=NEX |
|
| if(!(r)){(c)=(r)=(s);}else{NEXT(c)=(s);(c)=(s);} |
if(!(r)){(c)=(r)=(s);}else{NEXT(c)=(s);(c)=(s);} |
| #define NEXTND_pairs(r,c) \ |
#define NEXTND_pairs(r,c) \ |
| if(!(r)){NEWND_pairs(r);(c)=(r);}else{NEWND_pairs(NEXT(c));(c)=NEXT(c);} |
if(!(r)){NEWND_pairs(r);(c)=(r);}else{NEWND_pairs(NEXT(c));(c)=NEXT(c);} |
| #define MKNM_ind_pair(p,m,i) (NEWNM_ind_pair(p),(p)->mul=(m),(p)->index=(i)) |
#define MKNM_ind_pair(p,m,i,s) (NEWNM_ind_pair(p),(p)->mul=(m),(p)->index=(i),(p)->sugar = (s)) |
| |
|
| /* deallocators */ |
/* deallocators */ |
| #define FREENM(m) NEXT(m)=_nm_free_list; _nm_free_list=(m) |
#define FREENM(m) NEXT(m)=_nm_free_list; _nm_free_list=(m) |
| Line 213 if(!(r)){NEWND_pairs(r);(c)=(r);}else{NEWND_pairs(NEXT |
|
| Line 230 if(!(r)){NEWND_pairs(r);(c)=(r);}else{NEWND_pairs(NEXT |
|
| #define NMV_OPREV(m) (m = (NMV)(((char *)m)-oadv)) |
#define NMV_OPREV(m) (m = (NMV)(((char *)m)-oadv)) |
| |
|
| /* external functions */ |
/* external functions */ |
| |
#if 1 |
| void GC_gcollect(); |
void GC_gcollect(); |
| |
#endif |
| NODE append_one(NODE,int); |
NODE append_one(NODE,int); |
| |
|
| /* manipulation of coefficients */ |
/* manipulation of coefficients */ |
| Line 244 ND_pairs crit_B( ND_pairs d, int s ); |
|
| Line 263 ND_pairs crit_B( ND_pairs d, int s ); |
|
| ND_pairs crit_M( ND_pairs d1 ); |
ND_pairs crit_M( ND_pairs d1 ); |
| ND_pairs crit_F( ND_pairs d1 ); |
ND_pairs crit_F( ND_pairs d1 ); |
| int crit_2( int dp1, int dp2 ); |
int crit_2( int dp1, int dp2 ); |
| int ndv_newps(NDV a,NDV aq); |
int ndv_newps(int m,NDV a,NDV aq); |
| |
|
| /* top level functions */ |
/* top level functions */ |
| void nd_gr(LIST f,LIST v,int m,int f4,struct order_spec *ord,LIST *rp); |
void nd_gr(LIST f,LIST v,int m,int f4,struct order_spec *ord,LIST *rp); |
| void nd_gr_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp); |
void nd_gr_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp); |
| NODE nd_f4(int m); |
NODE nd_f4(int m); |
| NODE nd_gb(int m,int checkonly); |
NODE nd_gb(int m,int ishomo,int checkonly); |
| NODE nd_gb_trace(int m); |
NODE nd_gb_trace(int m,int ishomo); |
| |
|
| /* ndl functions */ |
/* ndl functions */ |
| int ndl_weight(UINT *d); |
int ndl_weight(UINT *d); |
| Line 272 INLINE int ndl_hash_value(UINT *d); |
|
| Line 291 INLINE int ndl_hash_value(UINT *d); |
|
| |
|
| /* normal forms */ |
/* normal forms */ |
| INLINE int ndl_find_reducer(UINT *g); |
INLINE int ndl_find_reducer(UINT *g); |
| INLINE int ndl_find_reducer_direct(UINT *g,NDV *ps,int len); |
|
| int nd_sp(int mod,int trace,ND_pairs p,ND *nf); |
int nd_sp(int mod,int trace,ND_pairs p,ND *nf); |
| int nd_nf(int mod,ND g,NDV *ps,int full,ND *nf); |
int nd_nf(int mod,ND g,NDV *ps,int full,NDC dn,ND *nf); |
| int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *nf); |
int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *nf); |
| int nd_nf_direct(int mod,ND g,BaseSet base,int full,ND *rp); |
|
| |
|
| /* finalizers */ |
/* finalizers */ |
| NODE ndv_reducebase(NODE x); |
NODE ndv_reducebase(NODE x); |
| Line 299 void ndp_print(ND_pairs d); |
|
| Line 316 void ndp_print(ND_pairs d); |
|
| /* setup, reconstruct */ |
/* setup, reconstruct */ |
| void nd_init_ord(struct order_spec *spec); |
void nd_init_ord(struct order_spec *spec); |
| ND_pairs nd_reconstruct(int mod,int trace,ND_pairs ndp); |
ND_pairs nd_reconstruct(int mod,int trace,ND_pairs ndp); |
| void nd_reconstruct_direct(int mod,NDV *ps,int len); |
|
| void ndv_setup(int mod,int trace,NODE f); |
void ndv_setup(int mod,int trace,NODE f); |
| void nd_setup_parameters(int nvar,int max); |
void nd_setup_parameters(int nvar,int max); |
| BlockMask nd_create_blockmask(struct order_spec *ord); |
BlockMask nd_create_blockmask(struct order_spec *ord); |
| Line 315 void nd_mul_c(int mod,ND p,int mul); |
|
| Line 331 void nd_mul_c(int mod,ND p,int mul); |
|
| void nd_mul_c_q(ND p,Q mul); |
void nd_mul_c_q(ND p,Q mul); |
| void nd_mul_c_p(VL vl,ND p,P mul); |
void nd_mul_c_p(VL vl,ND p,P mul); |
| ND nd_remove_head(ND p); |
ND nd_remove_head(ND p); |
| |
ND nd_separate_head(ND p,ND *head); |
| int nd_length(ND p); |
int nd_length(ND p); |
| void nd_append_red(UINT *d,int i); |
void nd_append_red(UINT *d,int i); |
| UINT *ndv_compute_bound(NDV p); |
UINT *ndv_compute_bound(NDV p); |
| Line 322 ND nd_copy(ND p); |
|
| Line 339 ND nd_copy(ND p); |
|
| ND nd_merge(ND p1,ND p2); |
ND nd_merge(ND p1,ND p2); |
| ND nd_add(int mod,ND p1,ND p2); |
ND nd_add(int mod,ND p1,ND p2); |
| ND nd_add_q(ND p1,ND p2); |
ND nd_add_q(ND p1,ND p2); |
| |
ND nd_add_sf(ND p1,ND p2); |
| INLINE int nd_length(ND p); |
INLINE int nd_length(ND p); |
| |
NODE nd_f4_red(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0); |
| |
NODE nd_f4_red_dist(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0); |
| |
|
| /* NDV functions */ |
/* NDV functions */ |
| ND weyl_ndv_mul_nm(int mod,NM m0,NDV p); |
ND weyl_ndv_mul_nm(int mod,NM m0,NDV p); |
| Line 339 void ndv_removecont(int mod,NDV p); |
|
| Line 359 void ndv_removecont(int mod,NDV p); |
|
| void ndv_print(NDV p); |
void ndv_print(NDV p); |
| void ndv_print_q(NDV p); |
void ndv_print_q(NDV p); |
| void ndv_free(NDV p); |
void ndv_free(NDV p); |
| |
void ndv_save(NDV p,int index); |
| |
NDV ndv_load(int index); |
| |
|
| /* converters */ |
/* converters */ |
| ND ptond(VL vl,VL dvl,P p); |
ND ptond(VL vl,VL dvl,P p); |
| Line 347 P ndvtop(int mod,VL vl,VL dvl,NDV p); |
|
| Line 369 P ndvtop(int mod,VL vl,VL dvl,NDV p); |
|
| NDV ndtondv(int mod,ND p); |
NDV ndtondv(int mod,ND p); |
| ND ndvtond(int mod,NDV p); |
ND ndvtond(int mod,NDV p); |
| int nm_ind_pair_to_vect(int m,UINT *s0,int n,NM_ind_pair pair,UINT *r); |
int nm_ind_pair_to_vect(int m,UINT *s0,int n,NM_ind_pair pair,UINT *r); |
| |
IndArray nm_ind_pair_to_vect_compress(int m,UINT *s0,int n,NM_ind_pair pair); |
| int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r); |
int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r); |
| |
|
| |
/* elimination */ |
| |
int nd_gauss_elim_mod(int **mat0,int *sugar,int row,int col,int md,int *colstat); |
| |
int nd_gauss_elim_sf(int **mat0,int *sugar,int row,int col,int md,int *colstat); |
| |
|
| void nd_free_private_storage() |
void nd_free_private_storage() |
| { |
{ |
| _nd_free_list = 0; |
|
| _nm_free_list = 0; |
_nm_free_list = 0; |
| _ndp_free_list = 0; |
_ndp_free_list = 0; |
| bzero(nd_red,sizeof(REDTAB_LEN*sizeof(RHist))); |
#if 0 |
| GC_gcollect(); |
GC_gcollect(); |
| |
#endif |
| } |
} |
| |
|
| void _NM_alloc() |
void _NM_alloc() |
| Line 411 INLINE int ndl_reducible(UINT *d1,UINT *d2) |
|
| Line 438 INLINE int ndl_reducible(UINT *d1,UINT *d2) |
|
| int i,j; |
int i,j; |
| |
|
| if ( TD(d1) < TD(d2) ) return 0; |
if ( TD(d1) < TD(d2) ) return 0; |
| |
#if USE_UNROLL |
| switch ( nd_bpe ) { |
switch ( nd_bpe ) { |
| #if 0 |
|
| case 3: |
case 3: |
| for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| Line 477 INLINE int ndl_reducible(UINT *d1,UINT *d2) |
|
| Line 504 INLINE int ndl_reducible(UINT *d1,UINT *d2) |
|
| if ( d1[i] < d2[i] ) return 0; |
if ( d1[i] < d2[i] ) return 0; |
| return 1; |
return 1; |
| break; |
break; |
| #endif |
|
| default: |
default: |
| for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| Line 486 INLINE int ndl_reducible(UINT *d1,UINT *d2) |
|
| Line 512 INLINE int ndl_reducible(UINT *d1,UINT *d2) |
|
| } |
} |
| return 1; |
return 1; |
| } |
} |
| |
#else |
| |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| |
u1 = d1[i]; u2 = d2[i]; |
| |
for ( j = 0; j < nd_epw; j++ ) |
| |
if ( (u1&nd_mask[j]) < (u2&nd_mask[j]) ) return 0; |
| |
} |
| |
return 1; |
| |
#endif |
| } |
} |
| |
|
| /* |
/* |
| Line 553 void ndl_lcm(UINT *d1,unsigned *d2,UINT *d) |
|
| Line 587 void ndl_lcm(UINT *d1,unsigned *d2,UINT *d) |
|
| UINT t1,t2,u,u1,u2; |
UINT t1,t2,u,u1,u2; |
| int i,j,l; |
int i,j,l; |
| |
|
| |
#if USE_UNROLL |
| switch ( nd_bpe ) { |
switch ( nd_bpe ) { |
| #if 0 |
|
| case 3: |
case 3: |
| for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| Line 620 void ndl_lcm(UINT *d1,unsigned *d2,UINT *d) |
|
| Line 654 void ndl_lcm(UINT *d1,unsigned *d2,UINT *d) |
|
| d[i] = u1>u2?u1:u2; |
d[i] = u1>u2?u1:u2; |
| } |
} |
| break; |
break; |
| #endif |
|
| default: |
default: |
| for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| Line 631 void ndl_lcm(UINT *d1,unsigned *d2,UINT *d) |
|
| Line 664 void ndl_lcm(UINT *d1,unsigned *d2,UINT *d) |
|
| } |
} |
| break; |
break; |
| } |
} |
| |
#else |
| |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| |
u1 = d1[i]; u2 = d2[i]; |
| |
for ( j = 0, u = 0; j < nd_epw; j++ ) { |
| |
t1 = (u1&nd_mask[j]); t2 = (u2&nd_mask[j]); u |= t1>t2?t1:t2; |
| |
} |
| |
d[i] = u; |
| |
} |
| |
#endif |
| TD(d) = ndl_weight(d); |
TD(d) = ndl_weight(d); |
| if ( nd_blockmask ) ndl_weight_mask(d); |
if ( nd_blockmask ) ndl_weight_mask(d); |
| } |
} |
| Line 742 INLINE int ndl_equal(UINT *d1,UINT *d2) |
|
| Line 784 INLINE int ndl_equal(UINT *d1,UINT *d2) |
|
| { |
{ |
| int i; |
int i; |
| |
|
| for ( i = 0; i < nd_wpd; i++ ) |
switch ( nd_wpd ) { |
| if ( *d1++ != *d2++ ) |
case 2: |
| return 0; |
if ( TD(d2) != TD(d1) ) return 0; |
| return 1; |
if ( d2[1] != d1[1] ) return 0; |
| |
return 1; |
| |
break; |
| |
case 3: |
| |
if ( TD(d2) != TD(d1) ) return 0; |
| |
if ( d2[1] != d1[1] ) return 0; |
| |
if ( d2[2] != d1[2] ) return 0; |
| |
return 1; |
| |
break; |
| |
default: |
| |
for ( i = 0; i < nd_wpd; i++ ) |
| |
if ( *d1++ != *d2++ ) return 0; |
| |
return 1; |
| |
break; |
| |
} |
| } |
} |
| |
|
| INLINE void ndl_copy(UINT *d1,UINT *d2) |
INLINE void ndl_copy(UINT *d1,UINT *d2) |
| Line 836 int ndl_disjoint(UINT *d1,UINT *d2) |
|
| Line 892 int ndl_disjoint(UINT *d1,UINT *d2) |
|
| UINT t1,t2,u,u1,u2; |
UINT t1,t2,u,u1,u2; |
| int i,j; |
int i,j; |
| |
|
| |
#if USE_UNROLL |
| switch ( nd_bpe ) { |
switch ( nd_bpe ) { |
| #if 0 |
|
| case 3: |
case 3: |
| for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| Line 902 int ndl_disjoint(UINT *d1,UINT *d2) |
|
| Line 958 int ndl_disjoint(UINT *d1,UINT *d2) |
|
| if ( d1[i] && d2[i] ) return 0; |
if ( d1[i] && d2[i] ) return 0; |
| return 1; |
return 1; |
| break; |
break; |
| #endif |
|
| default: |
default: |
| for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| Line 914 int ndl_disjoint(UINT *d1,UINT *d2) |
|
| Line 969 int ndl_disjoint(UINT *d1,UINT *d2) |
|
| return 1; |
return 1; |
| break; |
break; |
| } |
} |
| |
#else |
| |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| |
u1 = d1[i]; u2 = d2[i]; |
| |
for ( j = 0; j < nd_epw; j++ ) { |
| |
if ( (u1&nd_mask0) && (u2&nd_mask0) ) return 0; |
| |
u1 >>= nd_bpe; u2 >>= nd_bpe; |
| |
} |
| |
} |
| |
return 1; |
| |
#endif |
| } |
} |
| |
|
| int ndl_check_bound2(int index,UINT *d2) |
int ndl_check_bound2(int index,UINT *d2) |
| Line 924 int ndl_check_bound2(int index,UINT *d2) |
|
| Line 989 int ndl_check_bound2(int index,UINT *d2) |
|
| |
|
| d1 = nd_bound[index]; |
d1 = nd_bound[index]; |
| ind = 0; |
ind = 0; |
| |
#if USE_UNROLL |
| switch ( nd_bpe ) { |
switch ( nd_bpe ) { |
| #if 0 |
|
| case 3: |
case 3: |
| for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u2 = d2[i]; |
u2 = d2[i]; |
| Line 990 int ndl_check_bound2(int index,UINT *d2) |
|
| Line 1055 int ndl_check_bound2(int index,UINT *d2) |
|
| if ( d1[i]+d2[i]<d1[i] ) return 1; |
if ( d1[i]+d2[i]<d1[i] ) return 1; |
| return 0; |
return 0; |
| break; |
break; |
| #endif |
|
| default: |
default: |
| for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u2 = d2[i]; |
u2 = d2[i]; |
| Line 1001 int ndl_check_bound2(int index,UINT *d2) |
|
| Line 1065 int ndl_check_bound2(int index,UINT *d2) |
|
| return 0; |
return 0; |
| break; |
break; |
| } |
} |
| } |
#else |
| |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| int ndl_check_bound2_direct(UINT *d1,UINT *d2) |
u2 = d2[i]; |
| { |
k = (nd_epw-1)*nd_bpe; |
| UINT u2; |
for ( j = 0; j < nd_epw; j++, k -= nd_bpe ) |
| int i,j,ind,k; |
if ( d1[ind++]+((u2>>k)&nd_mask0) > nd_mask0 ) return 1; |
| |
|
| ind = 0; |
|
| switch ( nd_bpe ) { |
|
| #if 0 |
|
| case 3: |
|
| for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
|
| u2 = d2[i]; |
|
| if ( d1[ind++]+((u2>>27)&0x7) >= 0x8 ) return 1; |
|
| if ( d1[ind++]+((u2>>24)&0x7) >= 0x8 ) return 1; |
|
| if ( d1[ind++]+((u2>>21)&0x7) >= 0x8 ) return 1; |
|
| if ( d1[ind++]+((u2>>18)&0x7) >= 0x8 ) return 1; |
|
| if ( d1[ind++]+((u2>>15)&0x7) >= 0x8 ) return 1; |
|
| if ( d1[ind++]+((u2>>12)&0x7) >= 0x8 ) return 1; |
|
| if ( d1[ind++]+((u2>>9)&0x7) >= 0x8 ) return 1; |
|
| if ( d1[ind++]+((u2>>6)&0x7) >= 0x8 ) return 1; |
|
| if ( d1[ind++]+((u2>>3)&0x7) >= 0x8 ) return 1; |
|
| if ( d1[ind++]+(u2&0x7) >= 0x8 ) return 1; |
|
| } |
|
| return 0; |
|
| break; |
|
| case 4: |
|
| for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
|
| u2 = d2[i]; |
|
| if ( d1[ind++]+((u2>>28)&0xf) >= 0x10 ) return 1; |
|
| if ( d1[ind++]+((u2>>24)&0xf) >= 0x10 ) return 1; |
|
| if ( d1[ind++]+((u2>>20)&0xf) >= 0x10 ) return 1; |
|
| if ( d1[ind++]+((u2>>16)&0xf) >= 0x10 ) return 1; |
|
| if ( d1[ind++]+((u2>>12)&0xf) >= 0x10 ) return 1; |
|
| if ( d1[ind++]+((u2>>8)&0xf) >= 0x10 ) return 1; |
|
| if ( d1[ind++]+((u2>>4)&0xf) >= 0x10 ) return 1; |
|
| if ( d1[ind++]+(u2&0xf) >= 0x10 ) return 1; |
|
| } |
|
| return 0; |
|
| break; |
|
| case 6: |
|
| for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
|
| u2 = d2[i]; |
|
| if ( d1[ind++]+((u2>>24)&0x3f) >= 0x40 ) return 1; |
|
| if ( d1[ind++]+((u2>>18)&0x3f) >= 0x40 ) return 1; |
|
| if ( d1[ind++]+((u2>>12)&0x3f) >= 0x40 ) return 1; |
|
| if ( d1[ind++]+((u2>>6)&0x3f) >= 0x40 ) return 1; |
|
| if ( d1[ind++]+(u2&0x3f) >= 0x40 ) return 1; |
|
| } |
|
| return 0; |
|
| break; |
|
| case 8: |
|
| for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
|
| u2 = d2[i]; |
|
| if ( d1[ind++]+((u2>>24)&0xff) >= 0x100 ) return 1; |
|
| if ( d1[ind++]+((u2>>16)&0xff) >= 0x100 ) return 1; |
|
| if ( d1[ind++]+((u2>>8)&0xff) >= 0x100 ) return 1; |
|
| if ( d1[ind++]+(u2&0xff) >= 0x100 ) return 1; |
|
| } |
|
| return 0; |
|
| break; |
|
| case 16: |
|
| for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
|
| u2 = d2[i]; |
|
| if ( d1[ind++]+((u2>>16)&0xffff) > 0x10000 ) return 1; |
|
| if ( d1[ind++]+(u2&0xffff) > 0x10000 ) return 1; |
|
| } |
|
| return 0; |
|
| break; |
|
| case 32: |
|
| for ( i = nd_exporigin; i < nd_wpd; i++ ) |
|
| if ( d1[i]+d2[i]<d1[i] ) return 1; |
|
| return 0; |
|
| break; |
|
| #endif |
|
| default: |
|
| for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
|
| u2 = d2[i]; |
|
| k = (nd_epw-1)*nd_bpe; |
|
| for ( j = 0; j < nd_epw; j++, k -= nd_bpe ) |
|
| if ( d1[ind++]+((u2>>k)&nd_mask0) > nd_mask0 ) return 1; |
|
| } |
|
| return 0; |
|
| break; |
|
| } |
} |
| |
return 0; |
| |
#endif |
| } |
} |
| |
|
| INLINE int ndl_hash_value(UINT *d) |
INLINE int ndl_hash_value(UINT *d) |
| Line 1133 INLINE int ndl_find_reducer(UINT *dg) |
|
| Line 1121 INLINE int ndl_find_reducer(UINT *dg) |
|
| return -1; |
return -1; |
| } |
} |
| |
|
| INLINE int ndl_find_reducer_direct(UINT *dg,NDV *ps,int len) |
|
| { |
|
| NDV r; |
|
| RHist s; |
|
| int d,k,i; |
|
| |
|
| if ( Reverse ) |
|
| for ( i = len-1; i >= 0; i-- ) { |
|
| r = ps[i]; |
|
| if ( ndl_reducible(dg,HDL(r)) ) |
|
| return i; |
|
| } |
|
| else |
|
| for ( i = 0; i < len; i++ ) { |
|
| r = ps[i]; |
|
| if ( ndl_reducible(dg,HDL(r)) ) |
|
| return i; |
|
| } |
|
| return -1; |
|
| } |
|
| |
|
| ND nd_merge(ND p1,ND p2) |
ND nd_merge(ND p1,ND p2) |
| { |
{ |
| int n,c; |
int n,c; |
| Line 1205 ND nd_add(int mod,ND p1,ND p2) |
|
| Line 1172 ND nd_add(int mod,ND p1,ND p2) |
|
| |
|
| if ( !p1 ) return p2; |
if ( !p1 ) return p2; |
| else if ( !p2 ) return p1; |
else if ( !p2 ) return p1; |
| |
else if ( mod == -1 ) return nd_add_sf(p1,p2); |
| else if ( !mod ) return nd_add_q(p1,p2); |
else if ( !mod ) return nd_add_q(p1,p2); |
| else { |
else { |
| can = 0; |
can = 0; |
| Line 1292 ND nd_add_q(ND p1,ND p2) |
|
| Line 1260 ND nd_add_q(ND p1,ND p2) |
|
| } |
} |
| } |
} |
| |
|
| |
ND nd_add_sf(ND p1,ND p2) |
| |
{ |
| |
int n,c,can; |
| |
ND r; |
| |
NM m1,m2,mr0,mr,s; |
| |
int t; |
| |
|
| |
if ( !p1 ) return p2; |
| |
else if ( !p2 ) return p1; |
| |
else { |
| |
can = 0; |
| |
for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) { |
| |
c = DL_COMPARE(DL(m1),DL(m2)); |
| |
switch ( c ) { |
| |
case 0: |
| |
t = _addsf(CM(m1),CM(m2)); |
| |
s = m1; m1 = NEXT(m1); |
| |
if ( t ) { |
| |
can++; NEXTNM2(mr0,mr,s); CM(mr) = (t); |
| |
} else { |
| |
can += 2; FREENM(s); |
| |
} |
| |
s = m2; m2 = NEXT(m2); FREENM(s); |
| |
break; |
| |
case 1: |
| |
s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s); |
| |
break; |
| |
case -1: |
| |
s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s); |
| |
break; |
| |
} |
| |
} |
| |
if ( !mr0 ) |
| |
if ( m1 ) mr0 = m1; |
| |
else if ( m2 ) mr0 = m2; |
| |
else return 0; |
| |
else if ( m1 ) NEXT(mr) = m1; |
| |
else if ( m2 ) NEXT(mr) = m2; |
| |
else NEXT(mr) = 0; |
| |
BDY(p1) = mr0; |
| |
SG(p1) = MAX(SG(p1),SG(p2)); |
| |
LEN(p1) = LEN(p1)+LEN(p2)-can; |
| |
FREEND(p2); |
| |
return p1; |
| |
} |
| |
} |
| |
|
| /* ret=1 : success, ret=0 : overflow */ |
/* ret=1 : success, ret=0 : overflow */ |
| int nd_nf(int mod,ND g,NDV *ps,int full,ND *rp) |
int nd_nf(int mod,ND g,NDV *ps,int full,NDC dn,ND *rp) |
| { |
{ |
| ND d; |
ND d; |
| NM m,mrd,tail; |
NM m,mrd,tail; |
| Line 1302 int nd_nf(int mod,ND g,NDV *ps,int full,ND *rp) |
|
| Line 1317 int nd_nf(int mod,ND g,NDV *ps,int full,ND *rp) |
|
| int c,c1,c2,dummy; |
int c,c1,c2,dummy; |
| RHist h; |
RHist h; |
| NDV p,red; |
NDV p,red; |
| Q cg,cred,gcd; |
Q cg,cred,gcd,tq,qq; |
| double hmag; |
double hmag; |
| |
|
| |
if ( dn ) { |
| |
if ( mod ) |
| |
dn->m = 1; |
| |
else |
| |
dn->z = ONE; |
| |
} |
| if ( !g ) { |
if ( !g ) { |
| *rp = 0; |
*rp = 0; |
| return 1; |
return 1; |
| Line 1323 int nd_nf(int mod,ND g,NDV *ps,int full,ND *rp) |
|
| Line 1344 int nd_nf(int mod,ND g,NDV *ps,int full,ND *rp) |
|
| nd_free(g); nd_free(d); |
nd_free(g); nd_free(d); |
| return 0; |
return 0; |
| } |
} |
| p = ps[index]; |
if ( nd_demand ) |
| if ( mod ) { |
p = ndv_load(index); |
| |
else |
| |
p = ps[index]; |
| |
if ( mod == -1 ) |
| |
CM(mul) = _mulsf(_invsf(HCM(p)),_chsgnsf(HCM(g))); |
| |
else if ( mod ) { |
| c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
| DMAR(c1,c2,0,mod,c); CM(mul) = c; |
DMAR(c1,c2,0,mod,c); CM(mul) = c; |
| } else { |
} else { |
| igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
| chsgnq(cg,&CQ(mul)); |
chsgnq(cg,&CQ(mul)); |
| nd_mul_c_q(d,cred); nd_mul_c_q(g,cred); |
nd_mul_c_q(d,cred); nd_mul_c_q(g,cred); |
| |
if ( dn ) { |
| |
mulq(dn->z,cred,&tq); dn->z = tq; |
| |
} |
| } |
} |
| g = nd_add(mod,g,ndv_mul_nm(mod,mul,p)); |
g = nd_add(mod,g,ndv_mul_nm(mod,mul,p)); |
| sugar = MAX(sugar,SG(p)+TD(DL(mul))); |
sugar = MAX(sugar,SG(p)+TD(DL(mul))); |
| if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) { |
if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) { |
| |
tq = HCQ(g); |
| nd_removecont2(d,g); |
nd_removecont2(d,g); |
| |
if ( dn ) { |
| |
divq(tq,HCQ(g),&qq); divq(dn->z,qq,&tq); dn->z = tq; |
| |
} |
| hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
| } |
} |
| } else if ( !full ) { |
} else if ( !full ) { |
| Line 1373 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
| Line 1406 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
| Q cg,cred,gcd,zzz; |
Q cg,cred,gcd,zzz; |
| RHist h; |
RHist h; |
| double hmag,gmag; |
double hmag,gmag; |
| |
int count = 0; |
| |
int hcount = 0; |
| |
|
| if ( !g ) { |
if ( !g ) { |
| *rp = 0; |
*rp = 0; |
| Line 1388 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
| Line 1423 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
| while ( 1 ) { |
while ( 1 ) { |
| hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket); |
hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket); |
| if ( hindex < 0 ) { |
if ( hindex < 0 ) { |
| |
if ( DP_Print > 3 ) printf("(%d %d)",count,hcount); |
| if ( d ) SG(d) = sugar; |
if ( d ) SG(d) = sugar; |
| *rp = d; |
*rp = d; |
| return 1; |
return 1; |
| Line 1395 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
| Line 1431 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
| g = bucket->body[hindex]; |
g = bucket->body[hindex]; |
| index = ndl_find_reducer(HDL(g)); |
index = ndl_find_reducer(HDL(g)); |
| if ( index >= 0 ) { |
if ( index >= 0 ) { |
| |
count++; |
| |
if ( !d ) hcount++; |
| h = nd_psh[index]; |
h = nd_psh[index]; |
| ndl_sub(HDL(g),DL(h),DL(mul)); |
ndl_sub(HDL(g),DL(h),DL(mul)); |
| if ( ndl_check_bound2(index,DL(mul)) ) { |
if ( ndl_check_bound2(index,DL(mul)) ) { |
| Line 1404 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
| Line 1442 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
| return 0; |
return 0; |
| } |
} |
| p = ps[index]; |
p = ps[index]; |
| if ( mod ) { |
if ( mod == -1 ) |
| |
CM(mul) = _mulsf(_invsf(HCM(p)),_chsgnsf(HCM(g))); |
| |
else if ( mod ) { |
| c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
| DMAR(c1,c2,0,mod,c); CM(mul) = c; |
DMAR(c1,c2,0,mod,c); CM(mul) = c; |
| } else { |
} else { |
| Line 1455 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
| Line 1495 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
| } |
} |
| } |
} |
| |
|
| int nd_nf_direct(int mod,ND g,BaseSet base,int full,ND *rp) |
|
| { |
|
| ND d; |
|
| NM m,mrd,tail; |
|
| NM mul; |
|
| NDV *ps; |
|
| int n,sugar,psugar,sugar0,stat,index,len; |
|
| int c,c1,c2; |
|
| UINT **bound; |
|
| RHist h; |
|
| NDV p,red; |
|
| Q cg,cred,gcd; |
|
| double hmag; |
|
| |
|
| if ( !g ) { |
|
| *rp = 0; |
|
| return 1; |
|
| } |
|
| #if 0 |
|
| if ( !mod ) |
|
| hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
|
| #else |
|
| /* XXX */ |
|
| hmag = 0; |
|
| #endif |
|
| |
|
| ps = base->ps; |
|
| bound = base->bound; |
|
| len = base->len; |
|
| sugar0 = sugar = SG(g); |
|
| n = NV(g); |
|
| mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); |
|
| for ( d = 0; g; ) { |
|
| index = ndl_find_reducer_direct(HDL(g),ps,len); |
|
| if ( index >= 0 ) { |
|
| p = ps[index]; |
|
| ndl_sub(HDL(g),HDL(p),DL(mul)); |
|
| if ( ndl_check_bound2_direct(bound[index],DL(mul)) ) { |
|
| nd_free(g); nd_free(d); |
|
| return 0; |
|
| } |
|
| if ( mod ) { |
|
| c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
|
| DMAR(c1,c2,0,mod,c); CM(mul) = c; |
|
| } else { |
|
| igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
|
| chsgnq(cg,&CQ(mul)); |
|
| nd_mul_c_q(d,cred); nd_mul_c_q(g,cred); |
|
| } |
|
| g = nd_add(mod,g,ndv_mul_nm(mod,mul,p)); |
|
| sugar = MAX(sugar,SG(p)+TD(DL(mul))); |
|
| if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) { |
|
| nd_removecont2(d,g); |
|
| hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
|
| } |
|
| } else if ( !full ) { |
|
| *rp = g; |
|
| return 1; |
|
| } else { |
|
| m = BDY(g); |
|
| if ( NEXT(m) ) { |
|
| BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--; |
|
| } else { |
|
| FREEND(g); g = 0; |
|
| } |
|
| if ( d ) { |
|
| NEXT(tail)=m; tail=m; LEN(d)++; |
|
| } else { |
|
| MKND(n,m,1,d); tail = BDY(d); |
|
| } |
|
| } |
|
| } |
|
| if ( d ) SG(d) = sugar; |
|
| *rp = d; |
|
| return 1; |
|
| } |
|
| |
|
| /* input : list of NDV, cand : list of NDV */ |
/* input : list of NDV, cand : list of NDV */ |
| |
|
| int ndv_check_candidate(NODE input,int obpe,int oadv,EPOS oepos,NODE cand) |
int ndv_check_candidate(NODE input,int obpe,int oadv,EPOS oepos,NODE cand) |
| Line 1540 int ndv_check_candidate(NODE input,int obpe,int oadv,E |
|
| Line 1503 int ndv_check_candidate(NODE input,int obpe,int oadv,E |
|
| ND nf,d; |
ND nf,d; |
| NDV r; |
NDV r; |
| NODE t,s; |
NODE t,s; |
| |
union oNDC dn; |
| |
|
| ndv_setup(0,0,cand); |
ndv_setup(0,0,cand); |
| n = length(cand); |
n = length(cand); |
|
|
| else |
else |
| r = (NDV)BDY(t); |
r = (NDV)BDY(t); |
| d = ndvtond(0,r); |
d = ndvtond(0,r); |
| stat = nd_nf(0,d,nd_ps,0,&nf); |
stat = nd_nf(0,d,nd_ps,0,0,&nf); |
| if ( !stat ) { |
if ( !stat ) { |
| nd_reconstruct(0,0,0); |
nd_reconstruct(0,0,0); |
| goto again; |
goto again; |
| } else if ( nf ) return 0; |
} else if ( nf ) return 0; |
| printf("."); fflush(stdout); |
if ( DP_Print ) { printf("."); fflush(stdout); } |
| } |
} |
| printf("\n"); |
if ( DP_Print ) { printf("\n"); } |
| /* gbcheck : cand is a GB of Id(cand) ? */ |
/* gbcheck : cand is a GB of Id(cand) ? */ |
| if ( !nd_gb(0,1) ) return 0; |
if ( !nd_gb(0,0,1) ) return 0; |
| /* XXX */ |
/* XXX */ |
| return 1; |
return 1; |
| } |
} |
| Line 1580 ND nd_remove_head(ND p) |
|
| Line 1544 ND nd_remove_head(ND p) |
|
| return p; |
return p; |
| } |
} |
| |
|
| |
ND nd_separate_head(ND p,ND *head) |
| |
{ |
| |
NM m,m0; |
| |
ND r; |
| |
|
| |
m = BDY(p); |
| |
if ( !NEXT(m) ) { |
| |
*head = p; p = 0; |
| |
} else { |
| |
m0 = m; |
| |
BDY(p) = NEXT(m); LEN(p)--; |
| |
NEXT(m0) = 0; |
| |
MKND(NV(p),m0,1,r); |
| |
*head = r; |
| |
} |
| |
return p; |
| |
} |
| |
|
| PGeoBucket create_pbucket() |
PGeoBucket create_pbucket() |
| { |
{ |
| PGeoBucket g; |
PGeoBucket g; |
| Line 1703 int head_pbucket(int mod,PGeoBucket g) |
|
| Line 1685 int head_pbucket(int mod,PGeoBucket g) |
|
| dj = HDL(gj); |
dj = HDL(gj); |
| sum = HCM(gj); |
sum = HCM(gj); |
| } else if ( c == 0 ) { |
} else if ( c == 0 ) { |
| sum = sum+HCM(gi)-mod; |
if ( mod == -1 ) |
| if ( sum < 0 ) sum += mod; |
sum = _addsf(sum,HCM(gi)); |
| |
else { |
| |
sum = sum+HCM(gi)-mod; |
| |
if ( sum < 0 ) sum += mod; |
| |
} |
| g->body[i] = nd_remove_head(gi); |
g->body[i] = nd_remove_head(gi); |
| } |
} |
| } |
} |
| Line 1774 ND normalize_pbucket(int mod,PGeoBucket g) |
|
| Line 1760 ND normalize_pbucket(int mod,PGeoBucket g) |
|
| |
|
| /* return value = 0 => input is not a GB */ |
/* return value = 0 => input is not a GB */ |
| |
|
| NODE nd_gb(int m,int checkonly) |
NODE nd_gb(int m,int ishomo,int checkonly) |
| { |
{ |
| int i,nh,sugar,stat; |
int i,nh,sugar,stat; |
| NODE r,g,t; |
NODE r,g,t; |
| ND_pairs d; |
ND_pairs d; |
| ND_pairs l; |
ND_pairs l; |
| ND h,nf; |
ND h,nf,s,head; |
| NDV nfv; |
NDV nfv; |
| |
Q q; |
| |
union oNDC dn; |
| |
|
| g = 0; d = 0; |
g = 0; d = 0; |
| for ( i = 0; i < nd_psn; i++ ) { |
for ( i = 0; i < nd_psn; i++ ) { |
| Line 1793 NODE nd_gb(int m,int checkonly) |
|
| Line 1781 NODE nd_gb(int m,int checkonly) |
|
| again: |
again: |
| l = nd_minp(d,&d); |
l = nd_minp(d,&d); |
| if ( SG(l) != sugar ) { |
if ( SG(l) != sugar ) { |
| |
if ( ishomo ) { |
| |
for ( i = nd_psn-1; SG(nd_psh[i]) == sugar; i-- ) { |
| |
if ( nd_demand ) |
| |
nfv = ndv_load(i); |
| |
else |
| |
nfv = nd_ps[i]; |
| |
s = ndvtond(m,nfv); |
| |
s = nd_separate_head(s,&head); |
| |
nd_nf(m,s,nd_ps,1,&dn,&nf); |
| |
if ( !m ) { mulq(HCQ(head),dn.z,&q); HCQ(head) = q; } |
| |
nf = nd_add(m,head,nf); |
| |
ndv_free(nfv); |
| |
nd_removecont(m,nf); |
| |
nfv = ndtondv(m,nf); |
| |
nd_free(nf); |
| |
nd_bound[i] = ndv_compute_bound(nfv); |
| |
if ( nd_demand ) { |
| |
ndv_save(nfv,i); |
| |
ndv_free(nfv); |
| |
} else |
| |
nd_ps[i] = nfv; |
| |
} |
| |
} |
| sugar = SG(l); |
sugar = SG(l); |
| fprintf(asir_out,"%d",sugar); |
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
| } |
} |
| stat = nd_sp(m,0,l,&h); |
stat = nd_sp(m,0,l,&h); |
| if ( !stat ) { |
if ( !stat ) { |
|
|
| goto again; |
goto again; |
| } |
} |
| #if USE_GEOBUCKET |
#if USE_GEOBUCKET |
| stat = m?nd_nf_pbucket(m,h,nd_ps,!Top,&nf):nd_nf(m,h,nd_ps,!Top,&nf); |
stat = m?nd_nf_pbucket(m,h,nd_ps,!Top,&nf):nd_nf(m,h,nd_ps,!Top,0,&nf); |
| #else |
#else |
| stat = nd_nf(m,h,nd_ps,!Top,&nf); |
stat = nd_nf(m,h,nd_ps,!Top,0,&nf); |
| #endif |
#endif |
| if ( !stat ) { |
if ( !stat ) { |
| NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
|
|
| goto again; |
goto again; |
| } else if ( nf ) { |
} else if ( nf ) { |
| if ( checkonly ) return 0; |
if ( checkonly ) return 0; |
| printf("+"); fflush(stdout); |
if ( DP_Print ) { printf("+"); fflush(stdout); } |
| nd_removecont(m,nf); |
nd_removecont(m,nf); |
| nfv = ndtondv(m,nf); nd_free(nf); |
nfv = ndtondv(m,nf); nd_free(nf); |
| nh = ndv_newps(nfv,0); |
nh = ndv_newps(m,nfv,0); |
| d = update_pairs(d,g,nh); |
d = update_pairs(d,g,nh); |
| g = update_base(g,nh); |
g = update_base(g,nh); |
| FREENDP(l); |
FREENDP(l); |
| } else { |
} else { |
| printf("."); fflush(stdout); |
if ( DP_Print ) { printf("."); fflush(stdout); } |
| FREENDP(l); |
FREENDP(l); |
| } |
} |
| } |
} |
| for ( t = g; t; t = NEXT(t) ) BDY(t) = (pointer)nd_ps[(int)BDY(t)]; |
if ( nd_demand ) |
| |
for ( t = g; t; t = NEXT(t) ) |
| |
BDY(t) = (pointer)ndv_load((int)BDY(t)); |
| |
else |
| |
for ( t = g; t; t = NEXT(t) ) |
| |
BDY(t) = (pointer)nd_ps[(int)BDY(t)]; |
| return g; |
return g; |
| } |
} |
| |
|
| NODE nd_gb_trace(int m) |
NODE nd_gb_trace(int m,int ishomo) |
| { |
{ |
| int i,nh,sugar,stat; |
int i,nh,sugar,stat; |
| NODE r,g,t; |
NODE r,g,t; |
| ND_pairs d; |
ND_pairs d; |
| ND_pairs l; |
ND_pairs l; |
| ND h,nf,nfq; |
ND h,nf,nfq,s,head; |
| NDV nfv,nfqv; |
NDV nfv,nfqv; |
| |
Q q; |
| |
union oNDC dn; |
| |
|
| g = 0; d = 0; |
g = 0; d = 0; |
| for ( i = 0; i < nd_psn; i++ ) { |
for ( i = 0; i < nd_psn; i++ ) { |
| Line 1848 NODE nd_gb_trace(int m) |
|
| Line 1866 NODE nd_gb_trace(int m) |
|
| again: |
again: |
| l = nd_minp(d,&d); |
l = nd_minp(d,&d); |
| if ( SG(l) != sugar ) { |
if ( SG(l) != sugar ) { |
| |
if ( ishomo ) { |
| |
for ( i = nd_psn-1; SG(nd_psh[i]) == sugar; i-- ) { |
| |
/* for nd_ps */ |
| |
s = ndvtond(m,nd_ps[i]); |
| |
s = nd_separate_head(s,&head); |
| |
nd_nf_pbucket(m,s,nd_ps,1,&nf); |
| |
nf = nd_add(m,head,nf); |
| |
ndv_free(nd_ps[i]); |
| |
nd_ps[i] = ndtondv(m,nf); |
| |
nd_free(nf); |
| |
|
| |
/* for nd_ps_trace */ |
| |
if ( nd_demand ) |
| |
nfv = ndv_load(i); |
| |
else |
| |
nfv = nd_ps_trace[i]; |
| |
s = ndvtond(0,nfv); |
| |
s = nd_separate_head(s,&head); |
| |
nd_nf(0,s,nd_ps_trace,1,&dn,&nf); |
| |
mulq(HCQ(head),dn.z,&q); HCQ(head) = q; |
| |
nf = nd_add(0,head,nf); |
| |
ndv_free(nfv); |
| |
nd_removecont(0,nf); |
| |
nfv = ndtondv(0,nf); |
| |
nd_free(nf); |
| |
nd_bound[i] = ndv_compute_bound(nfv); |
| |
if ( nd_demand ) { |
| |
ndv_save(nfv,i); |
| |
ndv_free(nfv); |
| |
} else |
| |
nd_ps_trace[i] = nfv; |
| |
} |
| |
} |
| sugar = SG(l); |
sugar = SG(l); |
| fprintf(asir_out,"%d",sugar); |
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
| } |
} |
| stat = nd_sp(m,0,l,&h); |
stat = nd_sp(m,0,l,&h); |
| if ( !stat ) { |
if ( !stat ) { |
|
|
| #if USE_GEOBUCKET |
#if USE_GEOBUCKET |
| stat = nd_nf_pbucket(m,h,nd_ps,!Top,&nf); |
stat = nd_nf_pbucket(m,h,nd_ps,!Top,&nf); |
| #else |
#else |
| stat = nd_nf(m,h,nd_ps,!Top,&nf); |
stat = nd_nf(m,h,nd_ps,!Top,0,&nf); |
| #endif |
#endif |
| if ( !stat ) { |
if ( !stat ) { |
| NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
| d = nd_reconstruct(m,1,d); |
d = nd_reconstruct(m,1,d); |
| goto again; |
goto again; |
| } else if ( nf ) { |
} else if ( nf ) { |
| /* overflow does not occur */ |
if ( nd_demand ) { |
| nd_sp(0,1,l,&h); |
nfqv = ndv_load(nd_psn); |
| nd_nf(0,h,nd_ps_trace,!Top,&nfq); |
nfq = ndvtond(0,nfqv); |
| |
} else |
| |
nfq = 0; |
| |
if ( !nfq ) { |
| |
if ( !nd_sp(0,1,l,&h) || !nd_nf(0,h,nd_ps_trace,!Top,0,&nfq) ) { |
| |
NEXT(l) = d; d = l; |
| |
d = nd_reconstruct(m,1,d); |
| |
goto again; |
| |
} |
| |
} |
| if ( nfq ) { |
if ( nfq ) { |
| /* failure; m|HC(nfq) */ |
/* m|HC(nfq) => failure */ |
| if ( !rem(NM(HCQ(nfq)),m) ) return 0; |
if ( !rem(NM(HCQ(nfq)),m) ) return 0; |
| |
|
| printf("+"); fflush(stdout); |
if ( DP_Print ) { printf("+"); fflush(stdout); } |
| nd_removecont(m,nf); nfv = ndtondv(m,nf); nd_free(nf); |
nd_removecont(m,nf); nfv = ndtondv(m,nf); nd_free(nf); |
| nd_removecont(0,nfq); nfqv = ndtondv(0,nfq); nd_free(nfq); |
nd_removecont(0,nfq); nfqv = ndtondv(0,nfq); nd_free(nfq); |
| nh = ndv_newps(nfv,nfqv); |
nh = ndv_newps(0,nfv,nfqv); |
| d = update_pairs(d,g,nh); |
d = update_pairs(d,g,nh); |
| g = update_base(g,nh); |
g = update_base(g,nh); |
| } else { |
} else { |
| printf("*"); fflush(stdout); |
if ( DP_Print ) { printf("*"); fflush(stdout); } |
| } |
} |
| } else { |
} else { |
| printf("."); fflush(stdout); |
if ( DP_Print ) { printf("."); fflush(stdout); } |
| } |
} |
| FREENDP(l); |
FREENDP(l); |
| } |
} |
| for ( t = g; t; t = NEXT(t) ) |
if ( nd_demand ) |
| BDY(t) = (pointer)nd_ps_trace[(int)BDY(t)]; |
for ( t = g; t; t = NEXT(t) ) |
| |
BDY(t) = (pointer)ndv_load((int)BDY(t)); |
| |
else |
| |
for ( t = g; t; t = NEXT(t) ) |
| |
BDY(t) = (pointer)nd_ps_trace[(int)BDY(t)]; |
| return g; |
return g; |
| } |
} |
| |
|
| Line 1905 int ndv_compare_rev(NDV *p1,NDV *p2) |
|
| Line 1969 int ndv_compare_rev(NDV *p1,NDV *p2) |
|
| |
|
| NODE ndv_reduceall(int m,NODE f) |
NODE ndv_reduceall(int m,NODE f) |
| { |
{ |
| int i,j,n,stat; |
int i,n,stat; |
| NDV *w,*ps; |
ND nf,g,head; |
| ND nf,g; |
|
| NODE t,a0,a; |
NODE t,a0,a; |
| struct oBaseSet base; |
union oNDC dn; |
| UINT **bound; |
NDV *w; |
| |
Q q; |
| |
|
| for ( n = 0, t = f; t; t = NEXT(t), n++ ); |
n = length(f); |
| ps = (NDV *)ALLOCA(n*sizeof(NDV)); |
#if 0 |
| bound = (UINT **)ALLOCA(n*sizeof(UINT *)); |
w = (NDV *)ALLOCA(n*sizeof(NDV)); |
| for ( i = 0, t = f; i < n; i++, t = NEXT(t) ) ps[i] = (NDV)BDY(t); |
for ( i = 0, t = f; i < n; i++, t = NEXT(t) ) w[i] = (NDV)BDY(t); |
| qsort(ps,n,sizeof(NDV),(int (*)(const void *,const void *))ndv_compare); |
qsort(w,n,sizeof(NDV), |
| for ( i = 0; i < n; i++ ) bound[i] = ndv_compute_bound(ps[i]); |
(int (*)(const void *,const void *))ndv_compare); |
| base.ps = (NDV *)ALLOCA((n-1)*sizeof(NDV)); |
for ( t = f, i = 0; t; i++, t = NEXT(t) ) BDY(t) = (pointer)w[i]; |
| base.bound = (UINT **)ALLOCA((n-1)*sizeof(UINT *)); |
#endif |
| base.len = n-1; |
ndv_setup(m,0,f); |
| i = 0; |
for ( i = 0; i < n; ) { |
| while ( i < n ) { |
g = ndvtond(m,nd_ps[i]); |
| for ( j = 0; j < i; j++ ) { |
g = nd_separate_head(g,&head); |
| base.ps[j] = ps[j]; base.bound[j] = bound[j]; |
stat = nd_nf(m,g,nd_ps,1,&dn,&nf); |
| } |
|
| for ( j = i+1; j < n; j++ ) { |
|
| base.ps[j-1] = ps[j]; base.bound[j-1] = bound[j]; |
|
| } |
|
| g = ndvtond(m,ps[i]); |
|
| stat = nd_nf_direct(m,g,&base,1,&nf); |
|
| if ( !stat ) |
if ( !stat ) |
| nd_reconstruct_direct(m,ps,n); |
nd_reconstruct(m,0,0); |
| else if ( !nf ) { |
else { |
| printf("."); fflush(stdout); |
if ( DP_Print ) { printf("."); fflush(stdout); } |
| ndv_free(ps[i]); |
if ( !m ) { mulq(HCQ(head),dn.z,&q); HCQ(head) = q; } |
| for ( j = i+1; j < n; j++ ) { |
nf = nd_add(m,head,nf); |
| ps[j-1] = ps[j]; bound[j-1] = bound[j]; |
ndv_free(nd_ps[i]); |
| } |
|
| n--; |
|
| base.len = n-1; |
|
| } else { |
|
| printf("."); fflush(stdout); |
|
| ndv_free(ps[i]); |
|
| nd_removecont(m,nf); |
nd_removecont(m,nf); |
| ps[i] = ndtondv(m,nf); |
nd_ps[i] = ndtondv(m,nf); nd_free(nf); |
| bound[i] = ndv_compute_bound(ps[i]); |
nd_bound[i] = ndv_compute_bound(nd_ps[i]); |
| nd_free(nf); |
|
| i++; |
i++; |
| } |
} |
| } |
} |
| printf("\n"); |
if ( DP_Print ) { printf("\n"); } |
| for ( a0 = 0, i = 0; i < n; i++ ) { |
for ( a0 = 0, i = 0; i < n; i++ ) { |
| NEXTNODE(a0,a); |
NEXTNODE(a0,a); |
| BDY(a) = (pointer)ps[i]; |
BDY(a) = (pointer)nd_ps[i]; |
| } |
} |
| NEXT(a) = 0; |
NEXT(a) = 0; |
| return a0; |
return a0; |
| Line 2184 ND_pairs nd_minp( ND_pairs d, ND_pairs *prest ) |
|
| Line 2235 ND_pairs nd_minp( ND_pairs d, ND_pairs *prest ) |
|
| return m; |
return m; |
| } |
} |
| s = SG(m); |
s = SG(m); |
| for ( ml = 0, l = m; p; p = NEXT(l = p) ) |
if ( !NoSugar ) { |
| if ( (SG(p) < s) |
for ( ml = 0, l = m; p; p = NEXT(l = p) ) |
| || ((SG(p) == s) && (DL_COMPARE(LCM(p),LCM(m)) < 0)) ) { |
if ( (SG(p) < s) |
| ml = l; m = p; s = SG(m); |
|| ((SG(p) == s) && (DL_COMPARE(LCM(p),LCM(m)) < 0)) ) { |
| } |
ml = l; m = p; s = SG(m); |
| |
} |
| |
} else { |
| |
for ( ml = 0, l = m; p; p = NEXT(l = p) ) |
| |
if ( DL_COMPARE(LCM(p),LCM(m)) < 0 ) { |
| |
ml = l; m = p; s = SG(m); |
| |
} |
| |
} |
| if ( !ml ) *prest = NEXT(m); |
if ( !ml ) *prest = NEXT(m); |
| else { |
else { |
| NEXT(ml) = NEXT(m); |
NEXT(ml) = NEXT(m); |
| Line 2200 ND_pairs nd_minp( ND_pairs d, ND_pairs *prest ) |
|
| Line 2258 ND_pairs nd_minp( ND_pairs d, ND_pairs *prest ) |
|
| |
|
| ND_pairs nd_minsugarp( ND_pairs d, ND_pairs *prest ) |
ND_pairs nd_minsugarp( ND_pairs d, ND_pairs *prest ) |
| { |
{ |
| int msugar; |
int msugar,i; |
| ND_pairs t,dm0,dm,dr0,dr; |
ND_pairs t,dm0,dm,dr0,dr; |
| |
|
| for ( msugar = SG(d), t = NEXT(d); t; t = NEXT(t) ) |
for ( msugar = SG(d), t = NEXT(d); t; t = NEXT(t) ) |
| if ( SG(t) < msugar ) msugar = SG(t); |
if ( SG(t) < msugar ) msugar = SG(t); |
| dm0 = 0; dr0 = 0; |
dm0 = 0; dr0 = 0; |
| for ( t = d; t; t = NEXT(t) ) |
for ( i = 0, t = d; t; t = NEXT(t) ) |
| if ( SG(t) == msugar ) { |
if ( i < nd_f4_nsp && SG(t) == msugar ) { |
| if ( dm0 ) NEXT(dm) = t; |
if ( dm0 ) NEXT(dm) = t; |
| else dm0 = t; |
else dm0 = t; |
| dm = t; |
dm = t; |
| |
i++; |
| } else { |
} else { |
| if ( dr0 ) NEXT(dr) = t; |
if ( dr0 ) NEXT(dr) = t; |
| else dr0 = t; |
else dr0 = t; |
| Line 2222 ND_pairs nd_minsugarp( ND_pairs d, ND_pairs *prest ) |
|
| Line 2281 ND_pairs nd_minsugarp( ND_pairs d, ND_pairs *prest ) |
|
| return dm0; |
return dm0; |
| } |
} |
| |
|
| int ndv_newps(NDV a,NDV aq) |
int ndv_newps(int m,NDV a,NDV aq) |
| { |
{ |
| int len; |
int len; |
| RHist r; |
RHist r; |
| Line 2246 int ndv_newps(NDV a,NDV aq) |
|
| Line 2305 int ndv_newps(NDV a,NDV aq) |
|
| nd_bound[nd_psn] = ndv_compute_bound(a); |
nd_bound[nd_psn] = ndv_compute_bound(a); |
| SG(r) = SG(a); ndl_copy(HDL(a),DL(r)); |
SG(r) = SG(a); ndl_copy(HDL(a),DL(r)); |
| } |
} |
| |
if ( nd_demand ) { |
| |
if ( aq ) { |
| |
ndv_save(nd_ps_trace[nd_psn],nd_psn); |
| |
nd_ps_trace[nd_psn] = 0; |
| |
} else { |
| |
ndv_save(nd_ps[nd_psn],nd_psn); |
| |
nd_ps[nd_psn] = 0; |
| |
} |
| |
} |
| return nd_psn++; |
return nd_psn++; |
| } |
} |
| |
|
| Line 2255 void ndv_setup(int mod,int trace,NODE f) |
|
| Line 2323 void ndv_setup(int mod,int trace,NODE f) |
|
| NODE s,s0,f0; |
NODE s,s0,f0; |
| UINT *d; |
UINT *d; |
| RHist r; |
RHist r; |
| |
NDV *w; |
| NDV a,am; |
NDV a,am; |
| |
|
| nd_found = 0; nd_notfirst = 0; nd_create = 0; |
nd_found = 0; nd_notfirst = 0; nd_create = 0; |
| |
|
| nd_psn = length(f); nd_pslen = 2*nd_psn; |
for ( nd_psn = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) nd_psn++; |
| |
w = (NDV *)ALLOCA(nd_psn*sizeof(NDV)); |
| |
for ( i = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) w[i++] = BDY(s); |
| |
qsort(w,nd_psn,sizeof(NDV), |
| |
(int (*)(const void *,const void *))ndv_compare); |
| |
nd_pslen = 2*nd_psn; |
| nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
| nd_ps_trace = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
nd_ps_trace = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
| nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist)); |
nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist)); |
| Line 2267 void ndv_setup(int mod,int trace,NODE f) |
|
| Line 2341 void ndv_setup(int mod,int trace,NODE f) |
|
| |
|
| if ( !nd_red ) |
if ( !nd_red ) |
| nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist)); |
nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist)); |
| bzero(nd_red,REDTAB_LEN*sizeof(RHist)); |
for ( i = 0; i < REDTAB_LEN; i++ ) nd_red[i] = 0; |
| nd_free_private_storage(); |
for ( i = 0; i < nd_psn; i++ ) { |
| for ( i = 0; i < nd_psn; i++, f = NEXT(f) ) { |
|
| if ( trace ) { |
if ( trace ) { |
| a = nd_ps_trace[i] = ndv_dup(0,(NDV)BDY(f)); |
a = nd_ps_trace[i] = ndv_dup(0,w[i]); |
| ndv_removecont(0,a); |
ndv_removecont(0,a); |
| am = nd_ps[i] = ndv_dup(mod,a); |
am = nd_ps[i] = ndv_dup(mod,a); |
| ndv_mod(mod,am); |
ndv_mod(mod,am); |
| ndv_removecont(mod,am); |
ndv_removecont(mod,am); |
| } else { |
} else { |
| a = nd_ps[i] = ndv_dup(mod,(NDV)BDY(f)); |
a = nd_ps[i] = ndv_dup(mod,w[i]); |
| if ( mod ) ndv_mod(mod,a); |
|
| ndv_removecont(mod,a); |
ndv_removecont(mod,a); |
| } |
} |
| NEWRHist(r); SG(r) = HTD(a); ndl_copy(HDL(a),DL(r)); |
NEWRHist(r); SG(r) = HTD(a); ndl_copy(HDL(a),DL(r)); |
| nd_bound[i] = ndv_compute_bound(a); |
nd_bound[i] = ndv_compute_bound(a); |
| nd_psh[i] = r; |
nd_psh[i] = r; |
| |
if ( nd_demand ) { |
| |
if ( trace ) { |
| |
ndv_save(nd_ps_trace[i],i); |
| |
nd_ps_trace[i] = 0; |
| |
} else { |
| |
ndv_save(nd_ps[i],i); |
| |
nd_ps[i] = 0; |
| |
} |
| |
} |
| } |
} |
| } |
} |
| |
|
| Line 2292 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
| Line 2373 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
| VL tv,fv,vv,vc; |
VL tv,fv,vv,vc; |
| NODE fd,fd0,r,r0,t,x,s,xx; |
NODE fd,fd0,r,r0,t,x,s,xx; |
| int e,max,nvar; |
int e,max,nvar; |
| ND b; |
NDV b; |
| |
int ishomo; |
| |
|
| |
if ( !m && Demand ) nd_demand = 1; |
| |
else nd_demand = 0; |
| |
|
| |
ndv_alloc = 0; |
| get_vars((Obj)f,&fv); pltovl(v,&vv); |
get_vars((Obj)f,&fv); pltovl(v,&vv); |
| nvar = length(vv); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
| nd_init_ord(ord); |
nd_init_ord(ord); |
| for ( t = BDY(f), max = 0; t; t = NEXT(t) ) |
for ( t = BDY(f), max = 0; t; t = NEXT(t) ) |
| for ( tv = vv; tv; tv = NEXT(tv) ) { |
for ( tv = vv; tv; tv = NEXT(tv) ) { |
| Line 2303 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
| Line 2389 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
| max = MAX(e,max); |
max = MAX(e,max); |
| } |
} |
| nd_setup_parameters(nvar,max); |
nd_setup_parameters(nvar,max); |
| |
ishomo = 1; |
| for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
| b = (pointer)ptondv(CO,vv,(P)BDY(t)); |
b = (pointer)ptondv(CO,vv,(P)BDY(t)); |
| |
if ( ishomo ) |
| |
ishomo = ishomo && ndv_ishomo(b); |
| |
if ( m ) ndv_mod(m,b); |
| if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; } |
if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; } |
| } |
} |
| if ( fd0 ) NEXT(fd) = 0; |
if ( fd0 ) NEXT(fd) = 0; |
| ndv_setup(m,0,fd0); |
ndv_setup(m,0,fd0); |
| x = f4?nd_f4(m):nd_gb(m,0); |
x = f4?nd_f4(m):nd_gb(m,ishomo,0); |
| |
nd_demand = 0; |
| x = ndv_reducebase(x); |
x = ndv_reducebase(x); |
| x = ndv_reduceall(m,x); |
x = ndv_reduceall(m,x); |
| for ( r0 = 0, t = x; t; t = NEXT(t) ) { |
for ( r0 = 0, t = x; t; t = NEXT(t) ) { |
| Line 2318 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
| Line 2409 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
| } |
} |
| if ( r0 ) NEXT(r) = 0; |
if ( r0 ) NEXT(r) = 0; |
| MKLIST(*rp,r0); |
MKLIST(*rp,r0); |
| |
fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc); |
| } |
} |
| |
|
| void nd_gr_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp) |
void nd_gr_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp) |
| Line 2330 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
| Line 2422 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
| NMV a; |
NMV a; |
| P p; |
P p; |
| EPOS oepos; |
EPOS oepos; |
| int obpe,oadv,wmax,i,len,cbpe; |
int obpe,oadv,wmax,i,len,cbpe,ishomo; |
| |
|
| get_vars((Obj)f,&fv); pltovl(v,&vv); |
get_vars((Obj)f,&fv); pltovl(v,&vv); |
| nvar = length(vv); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
| nocheck = 0; |
nocheck = 0; |
| mindex = 0; |
mindex = 0; |
| |
|
| |
if ( Demand ) nd_demand = 1; |
| |
else nd_demand = 0; |
| |
|
| /* setup modulus */ |
/* setup modulus */ |
| if ( trace < 0 ) { |
if ( trace < 0 ) { |
| trace = -trace; |
trace = -trace; |
| Line 2351 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
| Line 2446 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
| nd_init_ord(ord); |
nd_init_ord(ord); |
| nd_setup_parameters(nvar,max); |
nd_setup_parameters(nvar,max); |
| obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos; |
obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos; |
| |
ishomo = 1; |
| for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
| c = ptondv(CO,vv,(P)BDY(t)); |
c = ptondv(CO,vv,(P)BDY(t)); |
| |
if ( ishomo ) |
| |
ishomo = ishomo && ndv_ishomo(c); |
| if ( c ) { |
if ( c ) { |
| NEXTNODE(in0,in); BDY(in) = (pointer)c; |
NEXTNODE(in0,in); BDY(in) = (pointer)c; |
| NEXTNODE(fd0,fd); BDY(fd) = (pointer)ndv_dup(0,c); |
NEXTNODE(fd0,fd); BDY(fd) = (pointer)ndv_dup(0,c); |
| Line 2360 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
| Line 2458 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
| } |
} |
| if ( in0 ) NEXT(in) = 0; |
if ( in0 ) NEXT(in) = 0; |
| if ( fd0 ) NEXT(fd) = 0; |
if ( fd0 ) NEXT(fd) = 0; |
| if ( homo ) { |
if ( !ishomo && homo ) { |
| for ( t = in0, wmax = 0; t; t = NEXT(t) ) { |
for ( t = in0, wmax = 0; t; t = NEXT(t) ) { |
| c = (NDV)BDY(t); len = LEN(c); |
c = (NDV)BDY(t); len = LEN(c); |
| for ( a = BDY(c), i = 0; i < len; i++, NMV_ADV(a) ) |
for ( a = BDY(c), i = 0; i < len; i++, NMV_ADV(a) ) |
| Line 2373 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
| Line 2471 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
| ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos); |
ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos); |
| } |
} |
| while ( 1 ) { |
while ( 1 ) { |
| |
if ( Demand ) |
| |
nd_demand = 1; |
| ndv_setup(m,1,fd0); |
ndv_setup(m,1,fd0); |
| cand = nd_gb_trace(m); |
cand = nd_gb_trace(m,ishomo || homo); |
| if ( !cand ) { |
if ( !cand ) { |
| /* failure */ |
/* failure */ |
| if ( trace > 1 ) { *rp = 0; return; } |
if ( trace > 1 ) { *rp = 0; return; } |
| else m = get_lprime(++mindex); |
else m = get_lprime(++mindex); |
| continue; |
continue; |
| } |
} |
| if ( homo ) { |
if ( !ishomo && homo ) { |
| /* dehomogenization */ |
/* dehomogenization */ |
| for ( t = cand; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord); |
for ( t = cand; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord); |
| nd_init_ord(ord); |
nd_init_ord(ord); |
| nd_setup_parameters(nvar,0); |
nd_setup_parameters(nvar,0); |
| } |
} |
| |
nd_demand = 0; |
| cand = ndv_reducebase(cand); |
cand = ndv_reducebase(cand); |
| cand = ndv_reduceall(0,cand); |
cand = ndv_reduceall(0,cand); |
| |
cbpe = nd_bpe; |
| if ( nocheck ) |
if ( nocheck ) |
| break; |
break; |
| cbpe = nd_bpe; |
|
| if ( ndv_check_candidate(in0,obpe,oadv,oepos,cand) ) |
if ( ndv_check_candidate(in0,obpe,oadv,oepos,cand) ) |
| /* success */ |
/* success */ |
| break; |
break; |
| Line 2402 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
| Line 2503 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
| /* try the next modulus */ |
/* try the next modulus */ |
| m = get_lprime(++mindex); |
m = get_lprime(++mindex); |
| /* reset the parameters */ |
/* reset the parameters */ |
| if ( homo ) { |
if ( !ishomo && homo ) { |
| nd_init_ord(&ord1); |
nd_init_ord(&ord1); |
| nd_setup_parameters(nvar+1,wmax); |
nd_setup_parameters(nvar+1,wmax); |
| } else { |
} else { |
| Line 2413 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
| Line 2514 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
| } |
} |
| /* dp->p */ |
/* dp->p */ |
| nd_bpe = cbpe; |
nd_bpe = cbpe; |
| nd_setup_parameters(0,0); |
nd_setup_parameters(nd_nvar,0); |
| for ( r = cand; r; r = NEXT(r) ) BDY(r) = (pointer)ndvtop(0,CO,vv,BDY(r)); |
for ( r = cand; r; r = NEXT(r) ) BDY(r) = (pointer)ndvtop(0,CO,vv,BDY(r)); |
| MKLIST(*rp,cand); |
MKLIST(*rp,cand); |
| } |
} |
| Line 2494 void nd_print(ND p) |
|
| Line 2595 void nd_print(ND p) |
|
| printf("0\n"); |
printf("0\n"); |
| else { |
else { |
| for ( m = BDY(p); m; m = NEXT(m) ) { |
for ( m = BDY(p); m; m = NEXT(m) ) { |
| printf("+%d*",CM(m)); |
if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m))); |
| |
else printf("+%d*",CM(m)); |
| ndl_print(DL(m)); |
ndl_print(DL(m)); |
| } |
} |
| printf("\n"); |
printf("\n"); |
| Line 2510 void nd_print_q(ND p) |
|
| Line 2612 void nd_print_q(ND p) |
|
| else { |
else { |
| for ( m = BDY(p); m; m = NEXT(m) ) { |
for ( m = BDY(p); m; m = NEXT(m) ) { |
| printf("+"); |
printf("+"); |
| printexpr(CO,CQ(m)); |
printexpr(CO,(Obj)CQ(m)); |
| printf("*"); |
printf("*"); |
| ndl_print(DL(m)); |
ndl_print(DL(m)); |
| } |
} |
| Line 2535 void nd_removecont(int mod,ND p) |
|
| Line 2637 void nd_removecont(int mod,ND p) |
|
| struct oVECT v; |
struct oVECT v; |
| N q,r; |
N q,r; |
| |
|
| if ( mod ) nd_mul_c(mod,p,invm(HCM(p),mod)); |
if ( mod == -1 ) nd_mul_c(mod,p,_invsf(HCM(p))); |
| |
else if ( mod ) nd_mul_c(mod,p,invm(HCM(p),mod)); |
| else { |
else { |
| for ( m = BDY(p), n = 0; m; m = NEXT(m), n++ ); |
for ( m = BDY(p), n = 0; m; m = NEXT(m), n++ ); |
| w = (Q *)ALLOCA(n*sizeof(Q)); |
w = (Q *)ALLOCA(n*sizeof(Q)); |
| Line 2581 void ndv_removecont(int mod,NDV p) |
|
| Line 2684 void ndv_removecont(int mod,NDV p) |
|
| Q dvr,t; |
Q dvr,t; |
| NMV m; |
NMV m; |
| |
|
| if ( mod ) |
if ( mod == -1 ) |
| |
ndv_mul_c(mod,p,_invsf(HCM(p))); |
| |
else if ( mod ) |
| ndv_mul_c(mod,p,invm(HCM(p),mod)); |
ndv_mul_c(mod,p,invm(HCM(p),mod)); |
| else { |
else { |
| len = p->len; |
len = p->len; |
| Line 2682 void nd_mul_c(int mod,ND p,int mul) |
|
| Line 2787 void nd_mul_c(int mod,ND p,int mul) |
|
| int c,c1; |
int c,c1; |
| |
|
| if ( !p ) return; |
if ( !p ) return; |
| for ( m = BDY(p); m; m = NEXT(m) ) { |
if ( mod == -1 ) |
| c1 = CM(m); |
for ( m = BDY(p); m; m = NEXT(m) ) |
| DMAR(c1,mul,0,mod,c); |
CM(m) = _mulsf(CM(m),mul); |
| CM(m) = c; |
else |
| } |
for ( m = BDY(p); m; m = NEXT(m) ) { |
| |
c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c; |
| |
} |
| } |
} |
| |
|
| void nd_mul_c_q(ND p,Q mul) |
void nd_mul_c_q(ND p,Q mul) |
| Line 2787 int nd_get_exporigin(struct order_spec *ord) |
|
| Line 2894 int nd_get_exporigin(struct order_spec *ord) |
|
| } |
} |
| |
|
| void nd_setup_parameters(int nvar,int max) { |
void nd_setup_parameters(int nvar,int max) { |
| int i,j,n,elen,ord_o,ord_l,l,s; |
int i,j,n,elen,ord_o,ord_l,l,s,wpd; |
| struct order_pair *op; |
struct order_pair *op; |
| |
|
| /* if max == 0, don't touch nd_bpe */ |
nd_nvar = nvar; |
| if ( max > 0 ) { |
if ( max ) { |
| if ( max < 2 ) nd_bpe = 1; |
/* XXX */ |
| if ( max < 4 ) nd_bpe = 2; |
if ( do_weyl ) nd_bpe = 32; |
| |
else if ( max < 2 ) nd_bpe = 1; |
| |
else if ( max < 4 ) nd_bpe = 2; |
| else if ( max < 8 ) nd_bpe = 3; |
else if ( max < 8 ) nd_bpe = 3; |
| else if ( max < 16 ) nd_bpe = 4; |
else if ( max < 16 ) nd_bpe = 4; |
| else if ( max < 32 ) nd_bpe = 5; |
else if ( max < 32 ) nd_bpe = 5; |
| Line 2803 void nd_setup_parameters(int nvar,int max) { |
|
| Line 2912 void nd_setup_parameters(int nvar,int max) { |
|
| else if ( max < 65536 ) nd_bpe = 16; |
else if ( max < 65536 ) nd_bpe = 16; |
| else nd_bpe = 32; |
else nd_bpe = 32; |
| } |
} |
| /* nvar == 0, don't touch nd_nvar */ |
|
| if ( nvar > 0 ) nd_nvar = nvar; |
|
| |
|
| nd_epw = (sizeof(UINT)*8)/nd_bpe; |
nd_epw = (sizeof(UINT)*8)/nd_bpe; |
| elen = nd_nvar/nd_epw+(nd_nvar%nd_epw?1:0); |
elen = nd_nvar/nd_epw+(nd_nvar%nd_epw?1:0); |
| |
|
| nd_exporigin = nd_get_exporigin(nd_ord); |
nd_exporigin = nd_get_exporigin(nd_ord); |
| nd_wpd = nd_exporigin+elen; |
wpd = nd_exporigin+elen; |
| |
if ( wpd != nd_wpd ) { |
| |
nd_free_private_storage(); |
| |
nd_wpd = wpd; |
| |
} |
| if ( nd_bpe < 32 ) { |
if ( nd_bpe < 32 ) { |
| nd_mask0 = (1<<nd_bpe)-1; |
nd_mask0 = (1<<nd_bpe)-1; |
| } else { |
} else { |
| Line 2832 void nd_setup_parameters(int nvar,int max) { |
|
| Line 2940 void nd_setup_parameters(int nvar,int max) { |
|
| ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d) |
ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d) |
| { |
{ |
| int i,obpe,oadv,h; |
int i,obpe,oadv,h; |
| NM prev_nm_free_list; |
static NM prev_nm_free_list; |
| |
static ND_pairs prev_ndp_free_list; |
| RHist mr0,mr; |
RHist mr0,mr; |
| RHist r; |
RHist r; |
| RHist *old_red; |
RHist *old_red; |
| ND_pairs s0,s,t,prev_ndp_free_list; |
ND_pairs s0,s,t; |
| EPOS oepos; |
EPOS oepos; |
| |
|
| obpe = nd_bpe; |
obpe = nd_bpe; |
| Line 2853 ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d) |
|
| Line 2962 ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d) |
|
| else if ( obpe < 32 ) nd_bpe = 32; |
else if ( obpe < 32 ) nd_bpe = 32; |
| else error("nd_reconstruct : exponent too large"); |
else error("nd_reconstruct : exponent too large"); |
| |
|
| nd_setup_parameters(0,0); |
nd_setup_parameters(nd_nvar,0); |
| prev_nm_free_list = _nm_free_list; |
prev_nm_free_list = _nm_free_list; |
| prev_ndp_free_list = _ndp_free_list; |
prev_ndp_free_list = _ndp_free_list; |
| _nm_free_list = 0; |
_nm_free_list = 0; |
| Line 2896 ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d) |
|
| Line 3005 ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d) |
|
| if ( s0 ) NEXT(s) = 0; |
if ( s0 ) NEXT(s) = 0; |
| prev_nm_free_list = 0; |
prev_nm_free_list = 0; |
| prev_ndp_free_list = 0; |
prev_ndp_free_list = 0; |
| |
#if 0 |
| GC_gcollect(); |
GC_gcollect(); |
| |
#endif |
| return s0; |
return s0; |
| } |
} |
| |
|
| void nd_reconstruct_direct(int mod,NDV *ps,int len) |
|
| { |
|
| int i,obpe,oadv,h; |
|
| UINT **bound; |
|
| NM prev_nm_free_list; |
|
| RHist mr0,mr; |
|
| RHist r; |
|
| RHist *old_red; |
|
| ND_pairs s0,s,t,prev_ndp_free_list; |
|
| EPOS oepos; |
|
| |
|
| obpe = nd_bpe; |
|
| oadv = nmv_adv; |
|
| oepos = nd_epos; |
|
| if ( obpe < 2 ) nd_bpe = 2; |
|
| else if ( obpe < 3 ) nd_bpe = 3; |
|
| else if ( obpe < 4 ) nd_bpe = 4; |
|
| else if ( obpe < 5 ) nd_bpe = 5; |
|
| else if ( obpe < 6 ) nd_bpe = 6; |
|
| else if ( obpe < 8 ) nd_bpe = 8; |
|
| else if ( obpe < 10 ) nd_bpe = 10; |
|
| else if ( obpe < 16 ) nd_bpe = 16; |
|
| else if ( obpe < 32 ) nd_bpe = 32; |
|
| else error("nd_reconstruct_direct : exponent too large"); |
|
| |
|
| nd_setup_parameters(0,0); |
|
| prev_nm_free_list = _nm_free_list; |
|
| prev_ndp_free_list = _ndp_free_list; |
|
| _nm_free_list = 0; _ndp_free_list = 0; |
|
| for ( i = len-1; i >= 0; i-- ) ndv_realloc(ps[i],obpe,oadv,oepos); |
|
| prev_nm_free_list = 0; |
|
| prev_ndp_free_list = 0; |
|
| GC_gcollect(); |
|
| } |
|
| |
|
| void ndl_reconstruct(UINT *d,UINT *r,int obpe,EPOS oepos) |
void ndl_reconstruct(UINT *d,UINT *r,int obpe,EPOS oepos) |
| { |
{ |
| int n,i,ei,oepw,omask0,j,s,ord_l,l; |
int n,i,ei,oepw,omask0,j,s,ord_l,l; |
| Line 2994 int nd_sp(int mod,int trace,ND_pairs p,ND *rp) |
|
| Line 3070 int nd_sp(int mod,int trace,ND_pairs p,ND *rp) |
|
| UINT *lcm; |
UINT *lcm; |
| int td; |
int td; |
| |
|
| if ( trace ) { |
if ( !mod && nd_demand ) { |
| p1 = nd_ps_trace[p->i1]; p2 = nd_ps_trace[p->i2]; |
p1 = ndv_load(p->i1); p2 = ndv_load(p->i2); |
| } else { |
} else { |
| p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2]; |
if ( trace ) { |
| |
p1 = nd_ps_trace[p->i1]; p2 = nd_ps_trace[p->i2]; |
| |
} else { |
| |
p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2]; |
| |
} |
| } |
} |
| lcm = LCM(p); |
lcm = LCM(p); |
| NEWNM(m); |
NEWNM(m); |
| Line 3006 int nd_sp(int mod,int trace,ND_pairs p,ND *rp) |
|
| Line 3086 int nd_sp(int mod,int trace,ND_pairs p,ND *rp) |
|
| if ( ndl_check_bound2(p->i1,DL(m)) ) |
if ( ndl_check_bound2(p->i1,DL(m)) ) |
| return 0; |
return 0; |
| t1 = ndv_mul_nm(mod,m,p1); |
t1 = ndv_mul_nm(mod,m,p1); |
| if ( mod ) CM(m) = mod-HCM(p1); |
if ( mod == -1 ) CM(m) = _chsgnsf(HCM(p1)); |
| |
else if ( mod ) CM(m) = mod-HCM(p1); |
| else chsgnq(HCQ(p1),&CQ(m)); |
else chsgnq(HCQ(p1),&CQ(m)); |
| ndl_sub(lcm,HDL(p2),DL(m)); |
ndl_sub(lcm,HDL(p2),DL(m)); |
| if ( ndl_check_bound2(p->i2,DL(m)) ) { |
if ( ndl_check_bound2(p->i2,DL(m)) ) { |
| Line 3026 void ndv_mul_c(int mod,NDV p,int mul) |
|
| Line 3107 void ndv_mul_c(int mod,NDV p,int mul) |
|
| |
|
| if ( !p ) return; |
if ( !p ) return; |
| len = LEN(p); |
len = LEN(p); |
| for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
if ( mod == -1 ) |
| c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c; |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) |
| } |
CM(m) = _mulsf(CM(m),mul); |
| |
else |
| |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
| |
c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c; |
| |
} |
| } |
} |
| |
|
| void ndv_mul_c_q(NDV p,Q mul) |
void ndv_mul_c_q(NDV p,Q mul) |
| Line 3218 ND ndv_mul_nm(int mod,NM m0,NDV p) |
|
| Line 3303 ND ndv_mul_nm(int mod,NM m0,NDV p) |
|
| |
|
| if ( !p ) return 0; |
if ( !p ) return 0; |
| else if ( do_weyl ) |
else if ( do_weyl ) |
| return weyl_ndv_mul_nm(mod,m0,p); |
if ( mod == -1 ) |
| |
error("ndv_mul_nm : not implemented (weyl)"); |
| |
else |
| |
return weyl_ndv_mul_nm(mod,m0,p); |
| else { |
else { |
| n = NV(p); m = BDY(p); |
n = NV(p); m = BDY(p); |
| d = DL(m0); |
d = DL(m0); |
| len = LEN(p); |
len = LEN(p); |
| mr0 = 0; |
mr0 = 0; |
| td = TD(d); |
td = TD(d); |
| if ( mod ) { |
if ( mod == -1 ) { |
| c = CM(m0); |
c = CM(m0); |
| for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
| NEXTNM(mr0,mr); |
NEXTNM(mr0,mr); |
| |
CM(mr) = _mulsf(CM(m),c); |
| |
ndl_add(DL(m),d,DL(mr)); |
| |
} |
| |
} else if ( mod ) { |
| |
c = CM(m0); |
| |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
| |
NEXTNM(mr0,mr); |
| c1 = CM(m); |
c1 = CM(m); |
| DMAR(c1,c,0,mod,c2); |
DMAR(c1,c,0,mod,c2); |
| CM(mr) = c2; |
CM(mr) = c2; |
| Line 3333 void ndv_mod(int mod,NDV p) |
|
| Line 3428 void ndv_mod(int mod,NDV p) |
|
| NMV t,d; |
NMV t,d; |
| int r; |
int r; |
| int i,len,dlen; |
int i,len,dlen; |
| |
Obj gfs; |
| |
|
| if ( !p ) return; |
if ( !p ) return; |
| len = LEN(p); |
len = LEN(p); |
| dlen = 0; |
dlen = 0; |
| for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) { |
if ( mod == -1 ) |
| r = rem(NM(CQ(t)),mod); |
for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) { |
| if ( r ) { |
simp_ff((Obj)CP(t),&gfs); |
| if ( SGN(CQ(t)) < 0 ) |
r = FTOIF(CONT((GFS)gfs)); |
| r = mod-r; |
|
| CM(d) = r; |
CM(d) = r; |
| ndl_copy(DL(t),DL(d)); |
ndl_copy(DL(t),DL(d)); |
| NMV_ADV(d); |
NMV_ADV(d); |
| dlen++; |
dlen++; |
| } |
} |
| } |
else |
| |
for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) { |
| |
r = rem(NM(CQ(t)),mod); |
| |
if ( r ) { |
| |
if ( SGN(CQ(t)) < 0 ) |
| |
r = mod-r; |
| |
CM(d) = r; |
| |
ndl_copy(DL(t),DL(d)); |
| |
NMV_ADV(d); |
| |
dlen++; |
| |
} |
| |
} |
| LEN(p) = dlen; |
LEN(p) = dlen; |
| } |
} |
| |
|
| Line 3422 P ndvtop(int mod,VL vl,VL dvl,NDV p) |
|
| Line 3528 P ndvtop(int mod,VL vl,VL dvl,NDV p) |
|
| P c; |
P c; |
| UINT *d; |
UINT *d; |
| P s,r,u,t,w; |
P s,r,u,t,w; |
| |
GFS gfs; |
| |
|
| if ( !p ) return 0; |
if ( !p ) return 0; |
| else { |
else { |
| Line 3429 P ndvtop(int mod,VL vl,VL dvl,NDV p) |
|
| Line 3536 P ndvtop(int mod,VL vl,VL dvl,NDV p) |
|
| n = NV(p); |
n = NV(p); |
| m = (NMV)(((char *)BDY(p))+nmv_adv*(len-1)); |
m = (NMV)(((char *)BDY(p))+nmv_adv*(len-1)); |
| for ( j = len-1, s = 0; j >= 0; j--, NMV_PREV(m) ) { |
for ( j = len-1, s = 0; j >= 0; j--, NMV_PREV(m) ) { |
| if ( mod ) { |
if ( mod == -1 ) { |
| |
e = IFTOF(CM(m)); MKGFS(e,gfs); c = (P)gfs; |
| |
} else if ( mod ) { |
| STOQ(CM(m),q); c = (P)q; |
STOQ(CM(m),q); c = (P)q; |
| } else |
} else |
| c = CP(m); |
c = CP(m); |
| Line 3453 NDV ndtondv(int mod,ND p) |
|
| Line 3562 NDV ndtondv(int mod,ND p) |
|
| |
|
| if ( !p ) return 0; |
if ( !p ) return 0; |
| len = LEN(p); |
len = LEN(p); |
| m0 = m = (NMV)(mod?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv)); |
if ( mod ) |
| |
m0 = m = (NMV)GC_malloc_atomic_ignore_off_page(len*nmv_adv); |
| |
else |
| |
m0 = m = MALLOC(len*nmv_adv); |
| |
ndv_alloc += nmv_adv*len; |
| for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, NMV_ADV(m) ) { |
for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, NMV_ADV(m) ) { |
| ndl_copy(DL(t),DL(m)); |
ndl_copy(DL(t),DL(m)); |
| CQ(m) = CQ(t); |
CQ(m) = CQ(t); |
| Line 3493 void ndv_print(NDV p) |
|
| Line 3606 void ndv_print(NDV p) |
|
| else { |
else { |
| len = LEN(p); |
len = LEN(p); |
| for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
| printf("+%d*",CM(m)); |
if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m))); |
| |
else printf("+%d*",CM(m)); |
| ndl_print(DL(m)); |
ndl_print(DL(m)); |
| } |
} |
| printf("\n"); |
printf("\n"); |
| Line 3510 void ndv_print_q(NDV p) |
|
| Line 3624 void ndv_print_q(NDV p) |
|
| len = LEN(p); |
len = LEN(p); |
| for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
| printf("+"); |
printf("+"); |
| printexpr(CO,CQ(m)); |
printexpr(CO,(Obj)CQ(m)); |
| printf("*"); |
printf("*"); |
| ndl_print(DL(m)); |
ndl_print(DL(m)); |
| } |
} |
| Line 3662 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
| Line 3776 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
| NDV ndv; |
NDV ndv; |
| VL vv,tv; |
VL vv,tv; |
| int stat,nvar,max,e; |
int stat,nvar,max,e; |
| |
union oNDC dn; |
| |
|
| pltovl(v,&vv); |
pltovl(v,&vv); |
| nvar = length(vv); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
| |
|
| /* get the degree bound */ |
/* get the degree bound */ |
| for ( t = BDY(g), max = 0; t; t = NEXT(t) ) |
for ( t = BDY(g), max = 0; t; t = NEXT(t) ) |
| Line 3684 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
| Line 3799 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
| for ( in0 = 0, t = BDY(g); t; t = NEXT(t) ) { |
for ( in0 = 0, t = BDY(g); t; t = NEXT(t) ) { |
| NEXTNODE(in0,in); |
NEXTNODE(in0,in); |
| BDY(in) = (pointer)ptondv(CO,vv,(P)BDY(t)); |
BDY(in) = (pointer)ptondv(CO,vv,(P)BDY(t)); |
| |
if ( m ) ndv_mod(m,(NDV)BDY(in)); |
| } |
} |
| NEXTNODE(in0,in); |
NEXTNODE(in0,in); |
| BDY(in) = (pointer)ptondv(CO,vv,f); |
BDY(in) = (pointer)ptondv(CO,vv,f); |
| |
if ( m ) ndv_mod(m,(NDV)BDY(in)); |
| NEXT(in) = 0; |
NEXT(in) = 0; |
| |
|
| ndv_setup(m,0,in0); |
ndv_setup(m,0,in0); |
| Line 3694 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
| Line 3811 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
| nd_scale=2; |
nd_scale=2; |
| while ( 1 ) { |
while ( 1 ) { |
| nd = (pointer)ndvtond(m,nd_ps[nd_psn]); |
nd = (pointer)ndvtond(m,nd_ps[nd_psn]); |
| stat = nd_nf(m,nd,nd_ps,1,&nf); |
stat = nd_nf(m,nd,nd_ps,1,0,&nf); |
| if ( !stat ) { |
if ( !stat ) { |
| nd_psn++; |
nd_psn++; |
| nd_reconstruct(m,0,0); |
nd_reconstruct(m,0,0); |
| Line 3721 int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r) |
|
| Line 3838 int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r) |
|
| return i; |
return i; |
| } |
} |
| |
|
| |
int ndv_to_vect(int mod,UINT *s0,int n,NDV d,UINT *r) |
| |
{ |
| |
NMV m; |
| |
UINT *t,*s; |
| |
int i,j,len; |
| |
|
| |
for ( i = 0; i < n; i++ ) r[i] = 0; |
| |
m = BDY(d); |
| |
len = LEN(d); |
| |
for ( i = j = 0, s = s0; j < len; j++, NMV_ADV(m)) { |
| |
t = DL(m); |
| |
for ( ; !ndl_equal(t,s); s += nd_wpd, i++ ); |
| |
r[i] = CM(m); |
| |
} |
| |
for ( i = 0; !r[i]; i++ ); |
| |
return i; |
| |
} |
| |
|
| int nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_pair pair,UINT *r) |
int nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_pair pair,UINT *r) |
| { |
{ |
| NM m; |
NM m; |
| Line 3744 int nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_ |
|
| Line 3879 int nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_ |
|
| return i; |
return i; |
| } |
} |
| |
|
| |
IndArray nm_ind_pair_to_vect_compress(int mod,UINT *s0,int n,NM_ind_pair pair) |
| |
{ |
| |
NM m; |
| |
NMV mr; |
| |
UINT *d,*t,*s; |
| |
NDV p; |
| |
unsigned char *ivc; |
| |
unsigned short *ivs; |
| |
UINT *v,*ivi,*s0v; |
| |
int i,j,len,prev,diff,cdiff; |
| |
IndArray r; |
| |
|
| |
m = pair->mul; |
| |
d = DL(m); |
| |
p = nd_ps[pair->index]; |
| |
len = LEN(p); |
| |
t = (UINT *)ALLOCA(nd_wpd*sizeof(UINT)); |
| |
v = (unsigned int *)ALLOCA(len*sizeof(unsigned int)); |
| |
for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) { |
| |
ndl_add(d,DL(mr),t); |
| |
for ( ; !ndl_equal(t,s); s += nd_wpd, i++ ); |
| |
v[j] = i; |
| |
} |
| |
r = (IndArray)MALLOC(sizeof(struct oIndArray)); |
| |
r->head = v[0]; |
| |
diff = 0; |
| |
for ( i = 1; i < len; i++ ) { |
| |
cdiff = v[i]-v[i-1]; diff = MAX(cdiff,diff); |
| |
} |
| |
if ( diff < 256 ) { |
| |
r->width = 1; |
| |
ivc = (unsigned char *)MALLOC_ATOMIC(len*sizeof(unsigned char)); |
| |
r->index.c = ivc; |
| |
for ( i = 1, ivc[0] = 0; i < len; i++ ) ivc[i] = v[i]-v[i-1]; |
| |
} else if ( diff < 65536 ) { |
| |
r->width = 2; |
| |
ivs = (unsigned short *)MALLOC_ATOMIC(len*sizeof(unsigned short)); |
| |
r->index.s = ivs; |
| |
for ( i = 1, ivs[0] = 0; i < len; i++ ) ivs[i] = v[i]-v[i-1]; |
| |
} else { |
| |
r->width = 4; |
| |
ivi = (unsigned int *)MALLOC_ATOMIC(len*sizeof(unsigned int)); |
| |
r->index.i = ivi; |
| |
for ( i = 1, ivi[0] = 0; i < len; i++ ) ivi[i] = v[i]-v[i-1]; |
| |
} |
| |
return r; |
| |
} |
| |
|
| |
|
| |
int ndv_reduce_vect(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred) |
| |
{ |
| |
int i,j,k,len,pos,prev; |
| |
UINT c,c1,c2,c3,up,lo,dmy; |
| |
IndArray ivect; |
| |
unsigned char *ivc; |
| |
unsigned short *ivs; |
| |
unsigned int *ivi; |
| |
NDV redv; |
| |
NMV mr; |
| |
NODE rp; |
| |
int maxrs; |
| |
|
| |
maxrs = 0; |
| |
for ( i = 0; i < nred; i++ ) { |
| |
ivect = imat[i]; |
| |
k = ivect->head; svect[k] %= m; |
| |
if ( c = svect[k] ) { |
| |
maxrs = MAX(maxrs,rp0[i]->sugar); |
| |
c = m-c; redv = nd_ps[rp0[i]->index]; |
| |
len = LEN(redv); mr = BDY(redv); |
| |
svect[k] = 0; prev = k; |
| |
switch ( ivect->width ) { |
| |
case 1: |
| |
ivc = ivect->index.c; |
| |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
| |
pos = prev+ivc[j]; c1 = CM(mr); c2 = svect[pos]; |
| |
prev = pos; |
| |
DMA(c1,c,c2,up,lo); |
| |
if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3; |
| |
} else svect[pos] = lo; |
| |
} |
| |
break; |
| |
case 2: |
| |
ivs = ivect->index.s; |
| |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
| |
pos = prev+ivs[j]; c1 = CM(mr); c2 = svect[pos]; |
| |
prev = pos; |
| |
DMA(c1,c,c2,up,lo); |
| |
if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3; |
| |
} else svect[pos] = lo; |
| |
} |
| |
break; |
| |
case 4: |
| |
ivi = ivect->index.i; |
| |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
| |
pos = prev+ivi[j]; c1 = CM(mr); c2 = svect[pos]; |
| |
prev = pos; |
| |
DMA(c1,c,c2,up,lo); |
| |
if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3; |
| |
} else svect[pos] = lo; |
| |
} |
| |
break; |
| |
} |
| |
} |
| |
} |
| |
for ( i = 0; i < col; i++ ) |
| |
if ( svect[i] >= (UINT)m ) svect[i] %= m; |
| |
return maxrs; |
| |
} |
| |
|
| |
int ndv_reduce_vect_sf(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred) |
| |
{ |
| |
int i,j,k,len,pos,prev; |
| |
UINT c,c1,c2,c3,up,lo,dmy; |
| |
IndArray ivect; |
| |
unsigned char *ivc; |
| |
unsigned short *ivs; |
| |
unsigned int *ivi; |
| |
NDV redv; |
| |
NMV mr; |
| |
NODE rp; |
| |
int maxrs; |
| |
|
| |
maxrs = 0; |
| |
for ( i = 0; i < nred; i++ ) { |
| |
ivect = imat[i]; |
| |
k = ivect->head; svect[k] %= m; |
| |
if ( c = svect[k] ) { |
| |
maxrs = MAX(maxrs,rp0[i]->sugar); |
| |
c = _chsgnsf(c); redv = nd_ps[rp0[i]->index]; |
| |
len = LEN(redv); mr = BDY(redv); |
| |
svect[k] = 0; prev = k; |
| |
switch ( ivect->width ) { |
| |
case 1: |
| |
ivc = ivect->index.c; |
| |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
| |
pos = prev+ivc[j]; prev = pos; |
| |
svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]); |
| |
} |
| |
break; |
| |
case 2: |
| |
ivs = ivect->index.s; |
| |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
| |
pos = prev+ivs[j]; prev = pos; |
| |
svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]); |
| |
} |
| |
break; |
| |
case 4: |
| |
ivi = ivect->index.i; |
| |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
| |
pos = prev+ivi[j]; prev = pos; |
| |
svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]); |
| |
} |
| |
break; |
| |
} |
| |
} |
| |
} |
| |
return maxrs; |
| |
} |
| |
|
| |
NDV vect_to_ndv(UINT *vect,int spcol,int col,int *rhead,UINT *s0vect) |
| |
{ |
| |
int j,k,len; |
| |
UINT *p; |
| |
UINT c; |
| |
NDV r; |
| |
NMV mr0,mr; |
| |
|
| |
for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++; |
| |
if ( !len ) return 0; |
| |
else { |
| |
mr0 = (NMV)GC_malloc_atomic_ignore_off_page(nmv_adv*len); |
| |
ndv_alloc += nmv_adv*len; |
| |
mr = mr0; |
| |
p = s0vect; |
| |
for ( j = k = 0; j < col; j++, p += nd_wpd ) |
| |
if ( !rhead[j] ) { |
| |
if ( c = vect[k++] ) { |
| |
ndl_copy(p,DL(mr)); CM(mr) = c; NMV_ADV(mr); |
| |
} |
| |
} |
| |
MKNDV(nd_nvar,mr0,len,r); |
| |
return r; |
| |
} |
| |
} |
| |
|
| |
int nd_sp_f4(int m,ND_pairs l,PGeoBucket bucket) |
| |
{ |
| |
ND_pairs t; |
| |
NODE sp0,sp; |
| |
int stat; |
| |
ND spol; |
| |
|
| |
for ( t = l; t; t = NEXT(t) ) { |
| |
stat = nd_sp(m,0,t,&spol); |
| |
if ( !stat ) return 0; |
| |
if ( spol ) { |
| |
add_pbucket_symbolic(bucket,spol); |
| |
} |
| |
} |
| |
return 1; |
| |
} |
| |
|
| |
int nd_symbolic_preproc(PGeoBucket bucket,UINT **s0vect,NODE *r) |
| |
{ |
| |
NODE rp0,rp; |
| |
NM mul,head,s0,s; |
| |
int index,col,i,sugar; |
| |
RHist h; |
| |
UINT *s0v,*p; |
| |
NM_ind_pair pair; |
| |
ND red; |
| |
|
| |
s0 = 0; rp0 = 0; col = 0; |
| |
while ( 1 ) { |
| |
head = remove_head_pbucket_symbolic(bucket); |
| |
if ( !head ) break; |
| |
if ( !s0 ) s0 = head; |
| |
else NEXT(s) = head; |
| |
s = head; |
| |
index = ndl_find_reducer(DL(head)); |
| |
if ( index >= 0 ) { |
| |
h = nd_psh[index]; |
| |
NEWNM(mul); |
| |
ndl_sub(DL(head),DL(h),DL(mul)); |
| |
if ( ndl_check_bound2(index,DL(mul)) ) return 0; |
| |
sugar = TD(DL(mul))+SG(nd_ps[index]); |
| |
MKNM_ind_pair(pair,mul,index,sugar); |
| |
red = ndv_mul_nm_symbolic(mul,nd_ps[index]); |
| |
add_pbucket_symbolic(bucket,nd_remove_head(red)); |
| |
NEXTNODE(rp0,rp); BDY(rp) = (pointer)pair; |
| |
} |
| |
col++; |
| |
} |
| |
if ( rp0 ) NEXT(rp) = 0; |
| |
NEXT(s) = 0; |
| |
s0v = (UINT *)MALLOC_ATOMIC(col*nd_wpd*sizeof(UINT)); |
| |
for ( i = 0, p = s0v, s = s0; i < col; |
| |
i++, p += nd_wpd, s = NEXT(s) ) ndl_copy(DL(s),p); |
| |
*s0vect = s0v; |
| |
*r = rp0; |
| |
return col; |
| |
} |
| |
|
| NODE nd_f4(int m) |
NODE nd_f4(int m) |
| { |
{ |
| int i,nh,stat,index; |
int i,nh,stat,index; |
| NODE r,g; |
NODE r,g; |
| ND_pairs d,l,t; |
ND_pairs d,l,t; |
| ND spol,red; |
ND spol,red; |
| NDV nf; |
NDV nf,redv; |
| NM_ind_pair pair,pair1,pair2; |
|
| NM s0,s; |
NM s0,s; |
| NODE sp0,sp,rp0,rp; |
NODE rp0,srp0,nflist; |
| RHist h; |
int nsp,nred,col,rank,len,k,j,a; |
| int nsp,nred,col,rank,len,k,j; |
UINT c; |
| NMV mr0,mr; |
|
| UINT c,c1,c2,c3; |
|
| NM mul,head; |
|
| UINT **spmat; |
UINT **spmat; |
| UINT *s0vect,*rvect,*svect,*p; |
UINT *s0vect,*svect,*p,*v; |
| int *colstat; |
int *colstat; |
| |
IndArray *imat; |
| |
int *rhead; |
| |
int spcol,sprow; |
| int sugar; |
int sugar; |
| PGeoBucket bucket; |
PGeoBucket bucket; |
| |
struct oEGT eg0,eg1,eg_f4; |
| |
|
| if ( !m ) |
if ( !m ) |
| error("nd_f4 : not implemented"); |
error("nd_f4 : not implemented"); |
| |
ndv_alloc = 0; |
| g = 0; d = 0; |
g = 0; d = 0; |
| for ( i = 0; i < nd_psn; i++ ) { |
for ( i = 0; i < nd_psn; i++ ) { |
| d = update_pairs(d,g,i); |
d = update_pairs(d,g,i); |
| g = update_base(g,i); |
g = update_base(g,i); |
| } |
} |
| while ( d ) { |
while ( d ) { |
| |
get_eg(&eg0); |
| l = nd_minsugarp(d,&d); |
l = nd_minsugarp(d,&d); |
| sugar = SG(l); |
sugar = SG(l); |
| fprintf(asir_out,"%d",sugar); |
|
| sp0 = 0; |
|
| bucket = create_pbucket(); |
bucket = create_pbucket(); |
| for ( t = l, nsp = 0; t; t = NEXT(t) ) { |
stat = nd_sp_f4(m,l,bucket); |
| stat = nd_sp(m,0,t,&spol); |
if ( !stat ) { |
| if ( !stat ) goto again; |
for ( t = l; NEXT(t); t = NEXT(t) ); |
| if ( spol ) { |
NEXT(t) = d; d = l; |
| NEXTNODE(sp0,sp); BDY(sp) = (pointer)nd_dup(spol); |
d = nd_reconstruct(m,0,d); |
| add_pbucket_symbolic(bucket,spol); |
continue; |
| nsp++; |
} |
| |
col = nd_symbolic_preproc(bucket,&s0vect,&rp0); |
| |
if ( !col ) { |
| |
for ( t = l; NEXT(t); t = NEXT(t) ); |
| |
NEXT(t) = d; d = l; |
| |
d = nd_reconstruct(m,0,d); |
| |
continue; |
| |
} |
| |
get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1); |
| |
if ( DP_Print ) |
| |
fprintf(asir_out,"sugar=%d,symb=%fsec,", |
| |
sugar,eg_f4.exectime+eg_f4.gctime); |
| |
if ( 1 ) |
| |
nflist = nd_f4_red(m,l,s0vect,col,rp0); |
| |
else |
| |
nflist = nd_f4_red_dist(m,l,s0vect,col,rp0); |
| |
/* adding new bases */ |
| |
for ( r = nflist; r; r = NEXT(r) ) { |
| |
nf = (NDV)BDY(r); |
| |
ndv_removecont(m,nf); |
| |
nh = ndv_newps(m,nf,0); |
| |
d = update_pairs(d,g,nh); |
| |
g = update_base(g,nh); |
| |
} |
| |
} |
| |
for ( r = g; r; r = NEXT(r) ) BDY(r) = (pointer)nd_ps[(int)BDY(r)]; |
| |
fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc); |
| |
return g; |
| |
} |
| |
|
| |
NODE nd_f4_red(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0) |
| |
{ |
| |
IndArray *imat; |
| |
int nsp,nred,spcol,sprow,a; |
| |
int *rhead; |
| |
int i,j,k,l,rank; |
| |
NODE rp,r0,r; |
| |
ND_pairs sp; |
| |
ND spol; |
| |
int **spmat; |
| |
UINT *svect,*v; |
| |
int *colstat; |
| |
struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2; |
| |
NM_ind_pair *rvect; |
| |
int maxrs; |
| |
int *spsugar; |
| |
|
| |
get_eg(&eg0); |
| |
for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ ); |
| |
nred = length(rp0); spcol = col-nred; |
| |
imat = (IndArray *)ALLOCA(nred*sizeof(IndArray)); |
| |
rhead = (int *)ALLOCA(col*sizeof(int)); |
| |
for ( i = 0; i < col; i++ ) rhead[i] = 0; |
| |
|
| |
/* construction of index arrays */ |
| |
rvect = (NM_ind_pair *)ALLOCA(nred*sizeof(NM_ind_pair)); |
| |
for ( rp = rp0, i = 0; rp; i++, rp = NEXT(rp) ) { |
| |
rvect[i] = (NM_ind_pair)BDY(rp); |
| |
imat[i] = nm_ind_pair_to_vect_compress(m,s0vect,col,rvect[i]); |
| |
rhead[imat[i]->head] = 1; |
| |
} |
| |
|
| |
/* elimination (1st step) */ |
| |
spmat = (int **)ALLOCA(nsp*sizeof(UINT *)); |
| |
svect = (UINT *)ALLOCA(col*sizeof(UINT)); |
| |
spsugar = (int *)ALLOCA(nsp*sizeof(UINT)); |
| |
for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) { |
| |
nd_sp(m,0,sp,&spol); |
| |
if ( !spol ) continue; |
| |
nd_to_vect(m,s0vect,col,spol,svect); |
| |
if ( m == -1 ) |
| |
maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rvect,nred); |
| |
else |
| |
maxrs = ndv_reduce_vect(m,svect,col,imat,rvect,nred); |
| |
for ( i = 0; i < col; i++ ) if ( svect[i] ) break; |
| |
if ( i < col ) { |
| |
spmat[sprow] = v = (UINT *)MALLOC_ATOMIC(spcol*sizeof(UINT)); |
| |
for ( j = k = 0; j < col; j++ ) |
| |
if ( !rhead[j] ) v[k++] = svect[j]; |
| |
spsugar[sprow] = MAX(maxrs,SG(spol)); |
| |
sprow++; |
| |
} |
| |
nd_free(spol); |
| |
} |
| |
get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1); |
| |
if ( DP_Print ) { |
| |
fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime); |
| |
fflush(asir_out); |
| |
} |
| |
/* free index arrays */ |
| |
for ( i = 0; i < nred; i++ ) GC_free(imat[i]->index.c); |
| |
|
| |
/* elimination (2nd step) */ |
| |
colstat = (int *)ALLOCA(spcol*sizeof(int)); |
| |
if ( m == -1 ) |
| |
rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat); |
| |
else |
| |
rank = nd_gauss_elim_mod(spmat,spsugar,sprow,spcol,m,colstat); |
| |
r0 = 0; |
| |
for ( i = 0; i < rank; i++ ) { |
| |
NEXTNODE(r0,r); BDY(r) = |
| |
(pointer)vect_to_ndv(spmat[i],spcol,col,rhead,s0vect); |
| |
SG((NDV)BDY(r)) = spsugar[i]; |
| |
GC_free(spmat[i]); |
| |
} |
| |
for ( ; i < sprow; i++ ) GC_free(spmat[i]); |
| |
get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2); |
| |
init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); |
| |
if ( DP_Print ) { |
| |
fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime); |
| |
fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ", |
| |
nsp,nred,sprow,spcol,rank); |
| |
fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime); |
| |
} |
| |
return r0; |
| |
} |
| |
|
| |
FILE *nd_write,*nd_read; |
| |
|
| |
void nd_send_int(int a) { |
| |
write_int(nd_write,&a); |
| |
} |
| |
|
| |
void nd_send_intarray(int *p,int len) { |
| |
write_intarray(nd_write,p,len); |
| |
} |
| |
|
| |
int nd_recv_int() { |
| |
int a; |
| |
|
| |
read_int(nd_read,&a); |
| |
return a; |
| |
} |
| |
|
| |
void nd_recv_intarray(int *p,int len) { |
| |
read_intarray(nd_read,p,len); |
| |
} |
| |
|
| |
void nd_send_ndv(NDV p) { |
| |
int len,i; |
| |
NMV m; |
| |
|
| |
if ( !p ) nd_send_int(0); |
| |
else { |
| |
len = LEN(p); |
| |
nd_send_int(len); |
| |
m = BDY(p); |
| |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
| |
nd_send_int(CM(m)); |
| |
nd_send_intarray(DL(m),nd_wpd); |
| |
} |
| |
} |
| |
} |
| |
|
| |
void nd_send_nd(ND p) { |
| |
int len,i; |
| |
NM m; |
| |
|
| |
if ( !p ) nd_send_int(0); |
| |
else { |
| |
len = LEN(p); |
| |
nd_send_int(len); |
| |
m = BDY(p); |
| |
for ( i = 0; i < len; i++, m = NEXT(m) ) { |
| |
nd_send_int(CM(m)); |
| |
nd_send_intarray(DL(m),nd_wpd); |
| |
} |
| |
} |
| |
} |
| |
|
| |
NDV nd_recv_ndv() |
| |
{ |
| |
int len,i; |
| |
NMV m,m0; |
| |
NDV r; |
| |
|
| |
len = nd_recv_int(); |
| |
if ( !len ) return 0; |
| |
else { |
| |
m0 = m = (NMV)GC_malloc_atomic_ignore_off_page(nmv_adv*len); |
| |
ndv_alloc += len*nmv_adv; |
| |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
| |
CM(m) = nd_recv_int(); |
| |
nd_recv_intarray(DL(m),nd_wpd); |
| |
} |
| |
MKNDV(nd_nvar,m0,len,r); |
| |
return r; |
| |
} |
| |
} |
| |
|
| |
int ox_exec_f4_red(Q proc) |
| |
{ |
| |
Obj obj; |
| |
STRING fname; |
| |
NODE arg; |
| |
int s; |
| |
extern int ox_need_conv,ox_file_io; |
| |
|
| |
MKSTR(fname,"nd_exec_f4_red"); |
| |
arg = mknode(2,proc,fname); |
| |
Pox_cmo_rpc(arg,&obj); |
| |
s = get_ox_server_id(QTOS(proc)); |
| |
nd_write = iofp[s].out; |
| |
nd_read = iofp[s].in; |
| |
ox_need_conv = ox_file_io = 0; |
| |
return s; |
| |
} |
| |
|
| |
NODE nd_f4_red_dist(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0) |
| |
{ |
| |
int nsp,nred; |
| |
int i,rank,s; |
| |
NODE rp,r0,r; |
| |
ND_pairs sp; |
| |
NM_ind_pair pair; |
| |
NMV nmv; |
| |
NM nm; |
| |
NDV nf; |
| |
Obj proc,dmy; |
| |
|
| |
ox_launch_main(0,0,&proc); |
| |
s = ox_exec_f4_red((Q)proc); |
| |
|
| |
nd_send_int(m); |
| |
nd_send_int(nd_nvar); |
| |
nd_send_int(nd_bpe); |
| |
nd_send_int(nd_wpd); |
| |
nd_send_int(nmv_adv); |
| |
|
| |
saveobj(nd_write,dp_current_spec.obj); fflush(nd_write); |
| |
|
| |
nd_send_int(nd_psn); |
| |
for ( i = 0; i < nd_psn; i++ ) nd_send_ndv(nd_ps[i]); |
| |
|
| |
for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ ); |
| |
nd_send_int(nsp); |
| |
for ( i = 0, sp = sp0; i < nsp; i++, sp = NEXT(sp) ) { |
| |
nd_send_int(sp->i1); nd_send_int(sp->i2); |
| |
} |
| |
|
| |
nd_send_int(col); nd_send_intarray(s0vect,col*nd_wpd); |
| |
|
| |
nred = length(rp0); nd_send_int(nred); |
| |
for ( i = 0, rp = rp0; i < nred; i++, rp = NEXT(rp) ) { |
| |
pair = (NM_ind_pair)BDY(rp); |
| |
nd_send_int(pair->index); |
| |
nd_send_intarray(pair->mul->dl,nd_wpd); |
| |
} |
| |
fflush(nd_write); |
| |
rank = nd_recv_int(); |
| |
fprintf(asir_out,"rank=%d\n",rank); |
| |
r0 = 0; |
| |
for ( i = 0; i < rank; i++ ) { |
| |
nf = nd_recv_ndv(); |
| |
NEXTNODE(r0,r); BDY(r) = (pointer)nf; |
| |
} |
| |
Pox_shutdown(mknode(1,proc),&dmy); |
| |
return r0; |
| |
} |
| |
|
| |
/* server side */ |
| |
|
| |
void nd_exec_f4_red_dist() |
| |
{ |
| |
int m,i,nsp,col,s0size,nred,spcol,j,k; |
| |
NM_ind_pair *rp0; |
| |
NDV nf; |
| |
UINT *s0vect; |
| |
IndArray *imat; |
| |
int *rhead; |
| |
int **spmat; |
| |
UINT *svect,*v; |
| |
ND_pairs *sp0; |
| |
int *colstat; |
| |
int a,sprow,rank; |
| |
struct order_spec ord; |
| |
Obj ordspec; |
| |
ND spol; |
| |
int maxrs; |
| |
int *spsugar; |
| |
|
| |
nd_read = iofp[0].in; |
| |
nd_write = iofp[0].out; |
| |
m = nd_recv_int(); |
| |
nd_nvar = nd_recv_int(); |
| |
nd_bpe = nd_recv_int(); |
| |
nd_wpd = nd_recv_int(); |
| |
nmv_adv = nd_recv_int(); |
| |
|
| |
loadobj(nd_read,&ordspec); |
| |
create_order_spec(ordspec,&ord); |
| |
nd_init_ord(&ord); |
| |
nd_setup_parameters(nd_nvar,0); |
| |
|
| |
nd_psn = nd_recv_int(); |
| |
nd_ps = (NDV *)MALLOC(nd_psn*sizeof(NDV)); |
| |
nd_bound = (UINT **)MALLOC(nd_psn*sizeof(UINT *)); |
| |
for ( i = 0; i < nd_psn; i++ ) { |
| |
nd_ps[i] = nd_recv_ndv(); |
| |
nd_bound[i] = ndv_compute_bound(nd_ps[i]); |
| |
} |
| |
|
| |
nsp = nd_recv_int(); |
| |
sp0 = (ND_pairs *)MALLOC(nsp*sizeof(ND_pairs)); |
| |
for ( i = 0; i < nsp; i++ ) { |
| |
NEWND_pairs(sp0[i]); |
| |
sp0[i]->i1 = nd_recv_int(); sp0[i]->i2 = nd_recv_int(); |
| |
ndl_lcm(HDL(nd_ps[sp0[i]->i1]),HDL(nd_ps[sp0[i]->i2]),LCM(sp0[i])); |
| |
} |
| |
|
| |
col = nd_recv_int(); |
| |
s0size = col*nd_wpd; |
| |
s0vect = (UINT *)MALLOC(s0size*sizeof(UINT)); |
| |
nd_recv_intarray(s0vect,s0size); |
| |
|
| |
nred = nd_recv_int(); |
| |
rp0 = (NM_ind_pair *)MALLOC(nred*sizeof(NM_ind_pair)); |
| |
for ( i = 0; i < nred; i++ ) { |
| |
rp0[i] = (NM_ind_pair)MALLOC(sizeof(struct oNM_ind_pair)); |
| |
rp0[i]->index = nd_recv_int(); |
| |
rp0[i]->mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); |
| |
nd_recv_intarray(rp0[i]->mul->dl,nd_wpd); |
| |
} |
| |
|
| |
spcol = col-nred; |
| |
imat = (IndArray *)MALLOC(nred*sizeof(IndArray)); |
| |
rhead = (int *)MALLOC(col*sizeof(int)); |
| |
for ( i = 0; i < col; i++ ) rhead[i] = 0; |
| |
|
| |
/* construction of index arrays */ |
| |
for ( i = 0; i < nred; i++ ) { |
| |
imat[i] = nm_ind_pair_to_vect_compress(m,s0vect,col,rp0[i]); |
| |
rhead[imat[i]->head] = 1; |
| |
} |
| |
|
| |
/* elimination (1st step) */ |
| |
spmat = (int **)MALLOC(nsp*sizeof(UINT *)); |
| |
svect = (UINT *)MALLOC(col*sizeof(UINT)); |
| |
spsugar = (int *)ALLOCA(nsp*sizeof(UINT)); |
| |
for ( a = sprow = 0; a < nsp; a++ ) { |
| |
nd_sp(m,0,sp0[a],&spol); |
| |
if ( !spol ) continue; |
| |
nd_to_vect(m,s0vect,col,spol,svect); |
| |
if ( m == -1 ) |
| |
maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rp0,nred); |
| |
else |
| |
maxrs = ndv_reduce_vect(m,svect,col,imat,rp0,nred); |
| |
for ( i = 0; i < col; i++ ) if ( svect[i] ) break; |
| |
if ( i < col ) { |
| |
spmat[sprow] = v = (UINT *)MALLOC(spcol*sizeof(UINT)); |
| |
for ( j = k = 0; j < col; j++ ) |
| |
if ( !rhead[j] ) v[k++] = svect[j]; |
| |
spsugar[sprow] = MAX(maxrs,SG(spol)); |
| |
sprow++; |
| |
} |
| |
nd_free(spol); |
| |
} |
| |
/* elimination (2nd step) */ |
| |
colstat = (int *)ALLOCA(spcol*sizeof(int)); |
| |
if ( m == -1 ) |
| |
rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat); |
| |
else |
| |
rank = nd_gauss_elim_mod(spmat,spsugar,sprow,spcol,m,colstat); |
| |
nd_send_int(rank); |
| |
for ( i = 0; i < rank; i++ ) { |
| |
nf = vect_to_ndv(spmat[i],spcol,col,rhead,s0vect); |
| |
nd_send_ndv(nf); |
| |
} |
| |
fflush(nd_write); |
| |
} |
| |
|
| |
int nd_gauss_elim_mod(int **mat0,int *sugar,int row,int col,int md,int *colstat) |
| |
{ |
| |
int i,j,k,l,inv,a,rank,s; |
| |
unsigned int *t,*pivot,*pk; |
| |
unsigned int **mat; |
| |
|
| |
mat = (unsigned int **)mat0; |
| |
for ( rank = 0, j = 0; j < col; j++ ) { |
| |
for ( i = rank; i < row; i++ ) |
| |
mat[i][j] %= md; |
| |
for ( i = rank; i < row; i++ ) |
| |
if ( mat[i][j] ) |
| |
break; |
| |
if ( i == row ) { |
| |
colstat[j] = 0; |
| |
continue; |
| |
} else |
| |
colstat[j] = 1; |
| |
if ( i != rank ) { |
| |
t = mat[i]; mat[i] = mat[rank]; mat[rank] = t; |
| |
s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s; |
| |
} |
| |
pivot = mat[rank]; |
| |
s = sugar[rank]; |
| |
inv = invm(pivot[j],md); |
| |
for ( k = j, pk = pivot+k; k < col; k++, pk++ ) |
| |
if ( *pk ) { |
| |
if ( *pk >= (unsigned int)md ) |
| |
*pk %= md; |
| |
DMAR(*pk,inv,0,md,*pk) |
| } |
} |
| |
for ( i = rank+1; i < row; i++ ) { |
| |
t = mat[i]; |
| |
if ( a = t[j] ) { |
| |
sugar[i] = MAX(sugar[i],s); |
| |
red_by_vect(md,t+j,pivot+j,md-a,col-j); |
| |
} |
| } |
} |
| if ( sp0 ) NEXT(sp) = 0; |
rank++; |
| s0 = 0; |
} |
| rp0 = 0; |
for ( j = col-1, l = rank-1; j >= 0; j-- ) |
| while ( 1 ) { |
if ( colstat[j] ) { |
| head = remove_head_pbucket_symbolic(bucket); |
pivot = mat[l]; |
| if ( !head ) break; |
s = sugar[l]; |
| if ( !s0 ) s0 = head; |
for ( i = 0; i < l; i++ ) { |
| else NEXT(s) = head; |
t = mat[i]; |
| s = head; |
t[j] %= md; |
| index = ndl_find_reducer(DL(head)); |
if ( a = t[j] ) { |
| if ( index >= 0 ) { |
sugar[i] = MAX(sugar[i],s); |
| h = nd_psh[index]; |
red_by_vect(md,t+j,pivot+j,md-a,col-j); |
| NEWNM(mul); |
} |
| ndl_sub(DL(head),DL(h),DL(mul)); |
|
| if ( ndl_check_bound2(index,DL(mul)) ) goto again; |
|
| MKNM_ind_pair(pair,mul,index); |
|
| red = ndv_mul_nm_symbolic(mul,nd_ps[index]); |
|
| add_pbucket_symbolic(bucket,nd_remove_head(red)); |
|
| NEXTNODE(rp0,rp); BDY(rp) = (pointer)pair; |
|
| nred++; |
|
| } |
} |
| |
l--; |
| } |
} |
| if ( s0 ) NEXT(s) = 0; |
for ( j = 0, l = 0; l < rank; j++ ) |
| for ( i = 0, s = s0; s; s = NEXT(s), i++ ); |
if ( colstat[j] ) { |
| col = i; |
t = mat[l]; |
| s0vect = (UINT *)MALLOC(col*nd_wpd*sizeof(UINT)); |
for ( k = j; k < col; k++ ) |
| for ( i = 0, p = s0vect, s = s0; i < col; |
if ( t[k] >= (unsigned int)md ) |
| i++, p += nd_wpd, s = NEXT(s) ) ndl_copy(DL(s),p); |
t[k] %= md; |
| spmat = (UINT **)MALLOC(nsp*sizeof(UINT *)); |
l++; |
| for ( i = 0, sp = sp0; i < nsp; i++, sp = NEXT(sp) ) { |
|
| spmat[i] = (UINT *)MALLOC(col*sizeof(UINT)); |
|
| nd_to_vect(m,s0vect,col,BDY(sp),spmat[i]); |
|
| } |
} |
| rvect = (UINT *)ALLOCA(col*sizeof(UINT)); |
return rank; |
| for ( rp = rp0; rp; rp = NEXT(rp) ) { |
} |
| k = nm_ind_pair_to_vect(m,s0vect,col,(NM_ind_pair)BDY(rp),rvect); |
|
| for ( i = 0; i < nsp; i++ ) { |
int nd_gauss_elim_sf(int **mat0,int *sugar,int row,int col,int md,int *colstat) |
| svect = spmat[i]; |
{ |
| if ( c = svect[k] ) |
int i,j,k,l,inv,a,rank,s; |
| for ( j = k; j < col; j++ ) { |
unsigned int *t,*pivot,*pk; |
| if ( c1 = rvect[j] ) { |
unsigned int **mat; |
| c1 = m-c1; c2 = svect[j]; DMAR(c1,c,c2,m,c3); |
|
| svect[j] = c3; |
mat = (unsigned int **)mat0; |
| } |
for ( rank = 0, j = 0; j < col; j++ ) { |
| } |
for ( i = rank; i < row; i++ ) |
| |
if ( mat[i][j] ) |
| |
break; |
| |
if ( i == row ) { |
| |
colstat[j] = 0; |
| |
continue; |
| |
} else |
| |
colstat[j] = 1; |
| |
if ( i != rank ) { |
| |
t = mat[i]; mat[i] = mat[rank]; mat[rank] = t; |
| |
s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s; |
| |
} |
| |
pivot = mat[rank]; |
| |
s = sugar[rank]; |
| |
inv = _invsf(pivot[j]); |
| |
for ( k = j, pk = pivot+k; k < col; k++, pk++ ) |
| |
if ( *pk ) |
| |
*pk = _mulsf(*pk,inv); |
| |
for ( i = rank+1; i < row; i++ ) { |
| |
t = mat[i]; |
| |
if ( a = t[j] ) { |
| |
sugar[i] = MAX(sugar[i],s); |
| |
red_by_vect_sf(md,t+j,pivot+j,_chsgnsf(a),col-j); |
| } |
} |
| } |
} |
| colstat = (int *)ALLOCA(col*sizeof(int)); |
rank++; |
| rank = generic_gauss_elim_mod(spmat,nsp,col,m,colstat); |
} |
| printf("rank = %d\n",rank); |
for ( j = col-1, l = rank-1; j >= 0; j-- ) |
| if ( rank ) |
if ( colstat[j] ) { |
| for ( j = 0, i = 0; j < col; j++ ) { |
pivot = mat[l]; |
| if ( colstat[j] ) { |
s = sugar[l]; |
| for ( k = j, len = 0; k < col; k++ ) |
for ( i = 0; i < l; i++ ) { |
| if ( spmat[i][k] ) len++; |
t = mat[i]; |
| mr0 = (NMV)MALLOC_ATOMIC(nmv_adv*len); |
if ( a = t[j] ) { |
| mr = mr0; |
sugar[i] = MAX(sugar[i],s); |
| p = s0vect+nd_wpd*j; |
red_by_vect_sf(md,t+j,pivot+j,_chsgnsf(a),col-j); |
| for ( k = j; k < col; k++, p += nd_wpd ) |
|
| if ( spmat[i][k] ) { |
|
| ndl_copy(p,DL(mr)); |
|
| CM(mr) = spmat[i][k]; |
|
| NMV_ADV(mr); |
|
| } |
|
| MKNDV(nd_nvar,mr0,len,nf); |
|
| SG(nf) = sugar; |
|
| ndv_removecont(m,nf); |
|
| nh = ndv_newps(nf,0); |
|
| d = update_pairs(d,g,nh); |
|
| g = update_base(g,nh); |
|
| i++; |
|
| } |
} |
| } |
} |
| continue; |
l--; |
| |
} |
| |
return rank; |
| |
} |
| |
|
| again: |
int ndv_ishomo(NDV p) |
| for ( t = l; NEXT(t); t = NEXT(t) ); |
{ |
| NEXT(t) = d; d = l; |
NMV m; |
| d = nd_reconstruct(m,0,d); |
int len,h; |
| NEWNM(mul); |
|
| |
if ( !p ) return 1; |
| |
len = LEN(p); |
| |
m = BDY(p); |
| |
h = TD(DL(m)); |
| |
NMV_ADV(m); |
| |
for ( len--; len; len--, NMV_ADV(m) ) |
| |
if ( TD(DL(m)) != h ) return 0; |
| |
return 1; |
| |
} |
| |
|
| |
void ndv_save(NDV p,int index) |
| |
{ |
| |
FILE *s; |
| |
char name[BUFSIZ]; |
| |
short id; |
| |
int nv,sugar,len,n,i,td,e,j; |
| |
NMV m; |
| |
unsigned int *dl; |
| |
|
| |
sprintf(name,"%s/%d",Demand,index); |
| |
s = fopen(name,"w"); |
| |
savevl(s,0); |
| |
if ( !p ) { |
| |
saveobj(s,0); |
| |
return; |
| } |
} |
| for ( r = g; r; r = NEXT(r) ) BDY(r) = (pointer)nd_ps[(int)BDY(r)]; |
id = O_DP; |
| return g; |
nv = NV(p); |
| |
sugar = SG(p); |
| |
len = LEN(p); |
| |
write_short(s,&id); write_int(s,&nv); write_int(s,&sugar); |
| |
write_int(s,&len); |
| |
|
| |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
| |
saveobj(s,(Obj)CQ(m)); |
| |
dl = DL(m); |
| |
td = TD(dl); |
| |
write_int(s,&td); |
| |
for ( j = 0; j < nv; j++ ) { |
| |
e = GET_EXP(dl,j); |
| |
write_int(s,&e); |
| |
} |
| |
} |
| |
fclose(s); |
| |
} |
| |
|
| |
NDV ndv_load(int index) |
| |
{ |
| |
FILE *s; |
| |
char name[BUFSIZ]; |
| |
short id; |
| |
int nv,sugar,len,n,i,td,e,j; |
| |
NDV d; |
| |
NMV m0,m; |
| |
unsigned int *dl; |
| |
Obj obj; |
| |
|
| |
sprintf(name,"%s/%d",Demand,index); |
| |
s = fopen(name,"r"); |
| |
if ( !s ) return 0; |
| |
|
| |
skipvl(s); |
| |
read_short(s,&id); |
| |
if ( !id ) return 0; |
| |
read_int(s,&nv); |
| |
read_int(s,&sugar); |
| |
read_int(s,&len); |
| |
|
| |
m0 = m = MALLOC(len*nmv_adv); |
| |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
| |
loadobj(s,&obj); CQ(m) = (Q)obj; |
| |
dl = DL(m); |
| |
ndl_zero(dl); |
| |
read_int(s,&td); TD(dl) = td; |
| |
for ( j = 0; j < nv; j++ ) { |
| |
read_int(s,&e); |
| |
PUT_EXP(dl,j,e); |
| |
} |
| |
if ( nd_blockmask ) ndl_weight_mask(dl); |
| |
} |
| |
fclose(s); |
| |
MKNDV(nv,m0,len,d); |
| |
SG(d) = sugar; |
| |
return d; |
| } |
} |
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to nd.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / engine