| version 1.3, 2003/07/23 07:50:32 |
version 1.52, 2003/08/27 02:21:16 |
|
|
| /* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.2 2003/07/23 01:23:34 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.51 2003/08/27 01:53:29 noro Exp $ */ |
| |
|
| #include "ca.h" |
#include "ca.h" |
| #include "inline.h" |
#include "inline.h" |
|
|
| #define INLINE |
#define INLINE |
| #endif |
#endif |
| |
|
| |
#define USE_GEOBUCKET 1 |
| |
|
| #define REDTAB_LEN 32003 |
#define REDTAB_LEN 32003 |
| |
|
| |
/* GeoBucket for polynomial addition */ |
| |
|
| typedef struct oPGeoBucket { |
typedef struct oPGeoBucket { |
| int m; |
int m; |
| struct oND *body[32]; |
struct oND *body[32]; |
| } *PGeoBucket; |
} *PGeoBucket; |
| |
|
| |
/* distributed polynomial; linked list rep. */ |
| typedef struct oND { |
typedef struct oND { |
| struct oNM *body; |
struct oNM *body; |
| int nv; |
int nv; |
| |
int len; |
| int sugar; |
int sugar; |
| } *ND; |
} *ND; |
| |
|
| |
/* distributed polynomial; array rep. */ |
| typedef struct oNDV { |
typedef struct oNDV { |
| struct oNMV *body; |
struct oNMV *body; |
| int nv; |
int nv; |
| int sugar; |
|
| int len; |
int len; |
| |
int sugar; |
| } *NDV; |
} *NDV; |
| |
|
| |
/* monomial; linked list rep. */ |
| typedef struct oNM { |
typedef struct oNM { |
| struct oNM *next; |
struct oNM *next; |
| int td; |
union { |
| int c; |
int m; |
| |
Q z; |
| |
} c; |
| unsigned int dl[1]; |
unsigned int dl[1]; |
| } *NM; |
} *NM; |
| |
|
| |
/* monomial; array rep. */ |
| typedef struct oNMV { |
typedef struct oNMV { |
| int td; |
union { |
| int c; |
int m; |
| |
Q z; |
| |
} c; |
| unsigned int dl[1]; |
unsigned int dl[1]; |
| } *NMV; |
} *NMV; |
| |
|
| |
/* history of reducer */ |
| |
typedef struct oRHist { |
| |
struct oRHist *next; |
| |
int index; |
| |
int sugar; |
| |
unsigned int dl[1]; |
| |
} *RHist; |
| |
|
| |
/* S-pair list */ |
| typedef struct oND_pairs { |
typedef struct oND_pairs { |
| struct oND_pairs *next; |
struct oND_pairs *next; |
| int i1,i2; |
int i1,i2; |
| int td,sugar; |
int sugar; |
| unsigned int lcm[1]; |
unsigned int lcm[1]; |
| } *ND_pairs; |
} *ND_pairs; |
| |
|
| static ND *nd_ps; |
/* index and shift count for each exponent */ |
| static NDV *nd_psv; |
typedef struct oEPOS { |
| |
int i; /* index */ |
| |
int s; /* shift */ |
| |
} *EPOS; |
| |
|
| |
typedef struct oBlockMask { |
| |
int n; |
| |
struct order_pair *order_pair; |
| |
unsigned int **mask; |
| |
} *BlockMask; |
| |
|
| |
typedef struct oBaseSet { |
| |
int len; |
| |
NDV *ps; |
| |
unsigned int **bound; |
| |
} *BaseSet; |
| |
|
| |
int (*ndl_compare_function)(unsigned int *a1,unsigned int *a2); |
| |
|
| |
static double nd_scale=2; |
| static unsigned int **nd_bound; |
static unsigned int **nd_bound; |
| int nd_mod,nd_nvar; |
static struct order_spec *nd_ord; |
| int is_rlex; |
static EPOS nd_epos; |
| int nd_epw,nd_bpe,nd_wpd; |
static BlockMask nd_blockmask; |
| unsigned int nd_mask[32]; |
static int nd_nvar; |
| unsigned int nd_mask0,nd_mask1; |
static int nd_isrlex; |
| NM _nm_free_list; |
static int nd_epw,nd_bpe,nd_wpd,nd_exporigin; |
| ND _nd_free_list; |
static unsigned int nd_mask[32]; |
| ND_pairs _ndp_free_list; |
static unsigned int nd_mask0,nd_mask1; |
| NM *nd_red; |
|
| int nd_red_len; |
|
| int nmv_adv; |
|
| int nmv_len; |
|
| NDV ndv_red; |
|
| |
|
| extern int Top,Reverse; |
static NM _nm_free_list; |
| int nd_psn,nd_pslen; |
static ND _nd_free_list; |
| int nd_found,nd_create,nd_notfirst; |
static ND_pairs _ndp_free_list; |
| |
|
| void GC_gcollect(); |
static NDV *nd_ps; |
| NODE append_one(NODE,int); |
static NDV *nd_psq; |
| |
static RHist *nd_psh; |
| |
static int nd_psn,nd_pslen; |
| |
|
| #define HTD(d) ((d)->body->td) |
static RHist *nd_red; |
| |
|
| |
static int nd_found,nd_create,nd_notfirst; |
| |
static int nm_adv; |
| |
static int nmv_adv; |
| |
static int nd_dcomp; |
| |
|
| |
extern int Top,Reverse,dp_nelim; |
| |
|
| |
/* fundamental macros */ |
| |
#define TD(d) (d[0]) |
| #define HDL(d) ((d)->body->dl) |
#define HDL(d) ((d)->body->dl) |
| #define HC(d) ((d)->body->c) |
#define HTD(d) (TD(HDL(d))) |
| #define NMV_ADV(m) (m = (NMV)(((char *)m)+nmv_adv)) |
#define HCM(d) ((d)->body->c.m) |
| |
#define HCQ(d) ((d)->body->c.z) |
| |
#define CM(a) ((a)->c.m) |
| |
#define CQ(a) ((a)->c.z) |
| |
#define DL(a) ((a)->dl) |
| |
#define SG(a) ((a)->sugar) |
| |
#define LEN(a) ((a)->len) |
| |
#define LCM(a) ((a)->lcm) |
| |
#define GET_EXP(d,a) (((d)[nd_epos[a].i]>>nd_epos[a].s)&nd_mask0) |
| |
#define PUT_EXP(r,a,e) ((r)[nd_epos[a].i] |= ((e)<<nd_epos[a].s)) |
| |
#define XOR_EXP(r,a,e) ((r)[nd_epos[a].i] ^= ((e)<<nd_epos[a].s)) |
| |
|
| #define NEWND_pairs(m) if(!_ndp_free_list)_NDP_alloc(); (m)=_ndp_free_list; _ndp_free_list = NEXT(_ndp_free_list) |
/* macros for term comparison */ |
| #define NEWNM(m) if(!_nm_free_list)_NM_alloc(); (m)=_nm_free_list; _nm_free_list = NEXT(_nm_free_list) |
#define TD_DL_COMPARE(d1,d2)\ |
| #define MKND(n,m,d) if(!_nd_free_list)_ND_alloc(); (d)=_nd_free_list; _nd_free_list = (ND)BDY(_nd_free_list); (d)->nv=(n); BDY(d)=(m) |
(TD(d1)>TD(d2)?1:(TD(d1)<TD(d2)?-1:ndl_lex_compare(d1,d2))) |
| |
#if 0 |
| |
#define DL_COMPARE(d1,d2)\ |
| |
(nd_dcomp>0?TD_DL_COMPARE(d1,d2)\ |
| |
:(nd_dcomp==0?ndl_lex_compare(d1,d2)\ |
| |
:(nd_blockmask?ndl_block_compare(d1,d2)\ |
| |
:(*ndl_compare_function)(d1,d2)))) |
| |
#else |
| |
#define DL_COMPARE(d1,d2)\ |
| |
(nd_dcomp>0?TD_DL_COMPARE(d1,d2):(*ndl_compare_function)(d1,d2)) |
| |
#endif |
| |
|
| |
/* allocators */ |
| |
#define NEWRHist(r) \ |
| |
((r)=(RHist)MALLOC(sizeof(struct oRHist)+(nd_wpd-1)*sizeof(unsigned int))) |
| |
#define NEWND_pairs(m) \ |
| |
if(!_ndp_free_list)_NDP_alloc();\ |
| |
(m)=_ndp_free_list; _ndp_free_list = NEXT(_ndp_free_list) |
| |
#define NEWNM(m)\ |
| |
if(!_nm_free_list)_NM_alloc();\ |
| |
(m)=_nm_free_list; _nm_free_list = NEXT(_nm_free_list) |
| |
#define MKND(n,m,len,d)\ |
| |
if(!_nd_free_list)_ND_alloc();\ |
| |
(d)=_nd_free_list; _nd_free_list = (ND)BDY(_nd_free_list);\ |
| |
NV(d)=(n); LEN(d)=(len); BDY(d)=(m) |
| #define NEWNDV(d) ((d)=(NDV)MALLOC(sizeof(struct oNDV))) |
#define NEWNDV(d) ((d)=(NDV)MALLOC(sizeof(struct oNDV))) |
| #define MKNDV(n,m,l,d) NEWNDV(d); (d)->nv=(n); BDY(d)=(m); (d)->len = l; |
#define MKNDV(n,m,l,d) NEWNDV(d); NV(d)=(n); BDY(d)=(m); LEN(d) = l; |
| |
|
| |
/* allocate and link a new object */ |
| |
#define NEXTRHist(r,c) \ |
| |
if(!(r)){NEWRHist(r);(c)=(r);}else{NEWRHist(NEXT(c));(c)=NEXT(c);} |
| #define NEXTNM(r,c) \ |
#define NEXTNM(r,c) \ |
| if(!(r)){NEWNM(r);(c)=(r);}else{NEWNM(NEXT(c));(c)=NEXT(c);} |
if(!(r)){NEWNM(r);(c)=(r);}else{NEWNM(NEXT(c));(c)=NEXT(c);} |
| #define NEXTNM2(r,c,s) \ |
#define NEXTNM2(r,c,s) \ |
| 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) \ |
| |
if(!(r)){NEWND_pairs(r);(c)=(r);}else{NEWND_pairs(NEXT(c));(c)=NEXT(c);} |
| |
|
| |
/* 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) |
| #define FREENDP(m) NEXT(m)=_ndp_free_list; _ndp_free_list=(m) |
#define FREENDP(m) NEXT(m)=_ndp_free_list; _ndp_free_list=(m) |
| #define FREEND(m) BDY(m)=(NM)_nd_free_list; _nd_free_list=(m) |
#define FREEND(m) BDY(m)=(NM)_nd_free_list; _nd_free_list=(m) |
| |
|
| #define NEXTND_pairs(r,c) \ |
/* macro for increasing pointer to NMV */ |
| if(!(r)){NEWND_pairs(r);(c)=(r);}else{NEWND_pairs(NEXT(c));(c)=NEXT(c);} |
#define NMV_ADV(m) (m = (NMV)(((char *)m)+nmv_adv)) |
| |
|
| ND_pairs crit_B( ND_pairs d, int s ); |
/* external functions */ |
| void nd_gr(LIST f,LIST v,int m,struct order_spec *ord,LIST *rp); |
void GC_gcollect(); |
| NODE nd_setup(NODE f); |
NODE append_one(NODE,int); |
| int nd_newps(ND a); |
|
| |
/* manipulation of coefficients */ |
| |
void nd_removecont(int mod,ND p); |
| |
void nd_removecont2(ND p1,ND p2); |
| |
void removecont_array(Q *c,int n); |
| |
|
| |
/* GeoBucket functions */ |
| |
ND normalize_pbucket(int mod,PGeoBucket g); |
| |
int head_pbucket(int mod,PGeoBucket g); |
| |
int head_pbucket_q(PGeoBucket g); |
| |
void add_pbucket(int mod,PGeoBucket g,ND d); |
| |
void free_pbucket(PGeoBucket b); |
| |
void mulq_pbucket(PGeoBucket g,Q c); |
| |
PGeoBucket create_pbucket(); |
| |
|
| |
/* manipulation of pairs and bases */ |
| |
int nd_newps(int mod,ND a,ND aq); |
| |
ND_pairs nd_newpairs( NODE g, int t ); |
| ND_pairs nd_minp( ND_pairs d, ND_pairs *prest ); |
ND_pairs nd_minp( ND_pairs d, ND_pairs *prest ); |
| NODE update_base(NODE nd,int ndp); |
NODE update_base(NODE nd,int ndp); |
| static ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest ); |
|
| int crit_2( int dp1, int dp2 ); |
|
| ND_pairs crit_F( ND_pairs d1 ); |
|
| ND_pairs crit_M( ND_pairs d1 ); |
|
| ND_pairs nd_newpairs( NODE g, int t ); |
|
| ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t); |
ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t); |
| NODE nd_gb(NODE f); |
ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest ); |
| |
ND_pairs crit_B( ND_pairs d, int s ); |
| |
ND_pairs crit_M( ND_pairs d1 ); |
| |
ND_pairs crit_F( ND_pairs d1 ); |
| |
int crit_2( int dp1, int dp2 ); |
| |
|
| |
/* top level functions */ |
| |
void nd_gr(LIST f,LIST v,int m,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_gb(int m,int checkonly); |
| |
NODE nd_gb_trace(int m); |
| |
|
| |
/* ndl functions */ |
| |
int ndl_weight(unsigned int *d); |
| |
int ndl_weight_mask(unsigned int *d,int i); |
| |
void ndl_dehomogenize(unsigned int *p); |
| |
void ndl_reconstruct(int obpe,EPOS oepos,unsigned int *d,unsigned int *r); |
| |
INLINE int ndl_reducible(unsigned int *d1,unsigned int *d2); |
| |
INLINE int ndl_lex_compare(unsigned int *d1,unsigned int *d2); |
| |
INLINE int ndl_block_compare(unsigned int *d1,unsigned int *d2); |
| |
INLINE int ndl_equal(unsigned int *d1,unsigned int *d2); |
| |
INLINE void ndl_copy(unsigned int *d1,unsigned int *d2); |
| |
INLINE void ndl_add(unsigned int *d1,unsigned int *d2,unsigned int *d); |
| |
INLINE void ndl_sub(unsigned int *d1,unsigned int *d2,unsigned int *d); |
| |
INLINE int ndl_hash_value(unsigned int *d); |
| |
|
| |
/* normal forms */ |
| |
INLINE int nd_find_reducer(ND g); |
| |
INLINE int nd_find_reducer_direct(ND g,NDV *ps,int len); |
| |
int nd_sp(int mod,ND_pairs p,ND *nf); |
| |
int nd_nf(int mod,ND g,int full,ND *nf); |
| |
int nd_nf_pbucket(int mod,ND g,int full,ND *nf); |
| |
int nd_nf_direct(int mod,ND g,BaseSet base,int full,ND *rp); |
| |
|
| |
/* finalizers */ |
| |
NODE nd_reducebase(NODE x); |
| |
NODE nd_reduceall(int m,NODE f); |
| |
int nd_gbcheck(int m,NODE f); |
| |
int nd_membercheck(int m,NODE f); |
| |
|
| |
/* allocators */ |
| void nd_free_private_storage(); |
void nd_free_private_storage(); |
| void _NM_alloc(); |
void _NM_alloc(); |
| void _ND_alloc(); |
void _ND_alloc(); |
| int ndl_td(unsigned int *d); |
|
| ND nd_add(ND p1,ND p2); |
|
| ND ndv_add(ND p1,NDV p2); |
|
| ND nd_mul_nm(ND p,NM m0); |
|
| ND nd_mul_term(ND p,int td,unsigned int *d); |
|
| int nd_sp(ND_pairs p,ND *nf); |
|
| int nd_find_reducer(ND g,ND *red); |
|
| int ndv_find_reducer(ND g,NDV red); |
|
| int nd_nf(ND g,int full,ND *nf); |
|
| ND nd_reduce(ND p1,ND p2); |
|
| ND nd_reduce_special(ND p1,ND p2); |
|
| void nd_free(ND p); |
void nd_free(ND p); |
| |
void nd_free_redlist(); |
| |
|
| |
/* printing */ |
| void ndl_print(unsigned int *dl); |
void ndl_print(unsigned int *dl); |
| void nd_print(ND p); |
void nd_print(ND p); |
| |
void nd_print_q(ND p); |
| void ndp_print(ND_pairs d); |
void ndp_print(ND_pairs d); |
| int nd_length(ND p); |
|
| void nd_monic(ND p); |
|
| void nd_mul_c(ND p,int mul); |
/* setup, reconstruct */ |
| void nd_free_redlist(); |
void nd_init_ord(struct order_spec *spec); |
| void nd_append_red(unsigned int *d,int td,int i); |
ND_pairs nd_reconstruct(int mod,int trace,ND_pairs ndp); |
| unsigned int *nd_compute_bound(ND p); |
void nd_reconstruct_direct(int mod,NDV *ps,int len); |
| ND_pairs nd_reconstruct(ND_pairs); |
void nd_setup(int mod,int trace,NODE f); |
| void nd_setup_parameters(); |
void nd_setup_parameters(); |
| ND nd_dup(ND p,int obpe); |
BlockMask nd_create_blockmask(struct order_spec *ord); |
| void ndl_dup(int obpe,unsigned int *d,unsigned int *r); |
int nd_get_exporigin(struct order_spec *ord); |
| NDV ndtondv(ND p); |
|
| void ndv_mul_nm(NDV pv,NM m,NDV r); |
|
| |
|
| |
/* ND functions */ |
| |
int nd_check_candidate(NODE input,NODE cand); |
| |
void nd_mul_c(int mod,ND p,int mul); |
| |
void nd_mul_c_q(ND p,Q mul); |
| |
ND nd_remove_head(ND p); |
| |
int nd_length(ND p); |
| |
void nd_append_red(unsigned int *d,int i); |
| |
unsigned int *ndv_compute_bound(NDV p); |
| |
unsigned int *dp_compute_bound(DP p); |
| |
ND nd_copy(ND p); |
| |
ND nd_add(int mod,ND p1,ND p2); |
| |
ND nd_add_q(ND p1,ND p2); |
| |
INLINE int nd_length(ND p); |
| |
|
| |
/* NDV functions */ |
| |
void ndv_mul_c(int mod,NDV p,int mul); |
| |
void ndv_mul_c_q(NDV p,Q mul); |
| |
void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos); |
| |
ND ndv_mul_nm(int mod,NDV p,NM m0); |
| |
void ndv_dehomogenize(NDV p,struct order_spec *spec); |
| |
void ndv_removecont(int mod,NDV p); |
| |
void ndv_print(NDV p); |
| |
void ndv_print_q(NDV p); |
| |
void ndv_free(NDV p); |
| |
|
| |
/* converters */ |
| |
NDV ndtondv(int mod,ND p); |
| |
ND ndvtond(int mod,NDV p); |
| |
NDV dptondv(int,DP); |
| |
DP ndvtodp(int,NDV); |
| |
ND dptond(int,DP); |
| |
DP ndtodp(int,ND); |
| |
|
| void nd_free_private_storage() |
void nd_free_private_storage() |
| { |
{ |
| _nd_free_list = 0; |
_nd_free_list = 0; |
| _nm_free_list = 0; |
_nm_free_list = 0; |
| nd_red = 0; |
_ndp_free_list = 0; |
| |
bzero(nd_red,sizeof(REDTAB_LEN*sizeof(RHist))); |
| GC_gcollect(); |
GC_gcollect(); |
| } |
} |
| |
|
| Line 155 void _NM_alloc() |
|
| Line 320 void _NM_alloc() |
|
| NM p; |
NM p; |
| int i; |
int i; |
| |
|
| for ( i = 0; i < 16; i++ ) { |
for ( i = 0; i < 1024; i++ ) { |
| p = (NM)GC_malloc(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int)); |
p = (NM)GC_malloc(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int)); |
| p->next = _nm_free_list; _nm_free_list = p; |
p->next = _nm_free_list; _nm_free_list = p; |
| } |
} |
| Line 177 void _NDP_alloc() |
|
| Line 342 void _NDP_alloc() |
|
| ND_pairs p; |
ND_pairs p; |
| int i; |
int i; |
| |
|
| for ( i = 0; i < 10240; i++ ) { |
for ( i = 0; i < 1024; i++ ) { |
| p = (ND_pairs)GC_malloc(sizeof(struct oND_pairs) |
p = (ND_pairs)GC_malloc(sizeof(struct oND_pairs) |
| +(nd_wpd-1)*sizeof(unsigned int)); |
+(nd_wpd-1)*sizeof(unsigned int)); |
| p->next = _ndp_free_list; _ndp_free_list = p; |
p->next = _ndp_free_list; _ndp_free_list = p; |
| } |
} |
| } |
} |
| |
|
| INLINE nd_length(ND p) |
INLINE int nd_length(ND p) |
| { |
{ |
| NM m; |
NM m; |
| int i; |
int i; |
| Line 202 INLINE int ndl_reducible(unsigned int *d1,unsigned int |
|
| Line 367 INLINE int ndl_reducible(unsigned int *d1,unsigned int |
|
| unsigned int u1,u2; |
unsigned int u1,u2; |
| int i,j; |
int i,j; |
| |
|
| |
if ( TD(d1) < TD(d2) ) return 0; |
| switch ( nd_bpe ) { |
switch ( nd_bpe ) { |
| case 4: |
case 4: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| if ( (u1&0xf0000000) < (u2&0xf0000000) ) return 0; |
if ( (u1&0xf0000000) < (u2&0xf0000000) ) return 0; |
| if ( (u1&0xf000000) < (u2&0xf000000) ) return 0; |
if ( (u1&0xf000000) < (u2&0xf000000) ) return 0; |
| Line 218 INLINE int ndl_reducible(unsigned int *d1,unsigned int |
|
| Line 384 INLINE int ndl_reducible(unsigned int *d1,unsigned int |
|
| return 1; |
return 1; |
| break; |
break; |
| case 6: |
case 6: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| if ( (u1&0x3f000000) < (u2&0x3f000000) ) return 0; |
if ( (u1&0x3f000000) < (u2&0x3f000000) ) return 0; |
| if ( (u1&0xfc0000) < (u2&0xfc0000) ) return 0; |
if ( (u1&0xfc0000) < (u2&0xfc0000) ) return 0; |
| Line 229 INLINE int ndl_reducible(unsigned int *d1,unsigned int |
|
| Line 395 INLINE int ndl_reducible(unsigned int *d1,unsigned int |
|
| return 1; |
return 1; |
| break; |
break; |
| case 8: |
case 8: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| if ( (u1&0xff000000) < (u2&0xff000000) ) return 0; |
if ( (u1&0xff000000) < (u2&0xff000000) ) return 0; |
| if ( (u1&0xff0000) < (u2&0xff0000) ) return 0; |
if ( (u1&0xff0000) < (u2&0xff0000) ) return 0; |
| Line 239 INLINE int ndl_reducible(unsigned int *d1,unsigned int |
|
| Line 405 INLINE int ndl_reducible(unsigned int *d1,unsigned int |
|
| return 1; |
return 1; |
| break; |
break; |
| case 16: |
case 16: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| if ( (u1&0xffff0000) < (u2&0xffff0000) ) return 0; |
if ( (u1&0xffff0000) < (u2&0xffff0000) ) return 0; |
| if ( (u1&0xffff) < (u2&0xffff) ) return 0; |
if ( (u1&0xffff) < (u2&0xffff) ) return 0; |
| Line 247 INLINE int ndl_reducible(unsigned int *d1,unsigned int |
|
| Line 413 INLINE int ndl_reducible(unsigned int *d1,unsigned int |
|
| return 1; |
return 1; |
| break; |
break; |
| case 32: |
case 32: |
| for ( i = 0; i < nd_wpd; i++ ) |
for ( i = nd_exporigin; i < nd_wpd; i++ ) |
| if ( d1[i] < d2[i] ) return 0; |
if ( d1[i] < d2[i] ) return 0; |
| return 1; |
return 1; |
| break; |
break; |
| default: |
default: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| for ( j = 0; j < nd_epw; j++ ) |
for ( j = 0; j < nd_epw; j++ ) |
| if ( (u1&nd_mask[j]) < (u2&nd_mask[j]) ) return 0; |
if ( (u1&nd_mask[j]) < (u2&nd_mask[j]) ) return 0; |
| Line 261 INLINE int ndl_reducible(unsigned int *d1,unsigned int |
|
| Line 427 INLINE int ndl_reducible(unsigned int *d1,unsigned int |
|
| } |
} |
| } |
} |
| |
|
| |
void ndl_dehomogenize(unsigned int *d) |
| |
{ |
| |
unsigned int mask; |
| |
unsigned int h; |
| |
int i,bits; |
| |
|
| |
if ( nd_blockmask ) { |
| |
h = GET_EXP(d,nd_nvar-1); |
| |
XOR_EXP(d,nd_nvar-1,h); |
| |
TD(d) -= h; |
| |
d[nd_exporigin-1] -= h; |
| |
} else { |
| |
if ( nd_isrlex ) { |
| |
if ( nd_bpe == 32 ) { |
| |
h = d[nd_exporigin]; |
| |
for ( i = nd_exporigin+1; i < nd_wpd; i++ ) |
| |
d[i-1] = d[i]; |
| |
d[i-1] = 0; |
| |
TD(d) -= h; |
| |
} else { |
| |
bits = nd_epw*nd_bpe; |
| |
mask = bits==32?0xffffffff:((1<<(nd_epw*nd_bpe))-1); |
| |
h = (d[nd_exporigin]>>((nd_epw-1)*nd_bpe))&nd_mask0; |
| |
for ( i = nd_exporigin; i < nd_wpd; i++ ) |
| |
d[i] = ((d[i]<<nd_bpe)&mask) |
| |
|(i+1<nd_wpd?((d[i+1]>>((nd_epw-1)*nd_bpe))&nd_mask0):0); |
| |
TD(d) -= h; |
| |
} |
| |
} else { |
| |
h = GET_EXP(d,nd_nvar-1); |
| |
XOR_EXP(d,nd_nvar-1,h); |
| |
TD(d) -= h; |
| |
} |
| |
} |
| |
} |
| |
|
| void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned int *d) |
void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned int *d) |
| { |
{ |
| unsigned int t1,t2,u,u1,u2; |
unsigned int t1,t2,u,u1,u2; |
| int i,j; |
int i,j,l; |
| |
|
| switch ( nd_bpe ) { |
switch ( nd_bpe ) { |
| case 4: |
case 4: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| t1 = (u1&0xf0000000); t2 = (u2&0xf0000000); u = t1>t2?t1:t2; |
t1 = (u1&0xf0000000); t2 = (u2&0xf0000000); u = t1>t2?t1:t2; |
| t1 = (u1&0xf000000); t2 = (u2&0xf000000); u |= t1>t2?t1:t2; |
t1 = (u1&0xf000000); t2 = (u2&0xf000000); u |= t1>t2?t1:t2; |
| Line 282 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in |
|
| Line 484 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in |
|
| } |
} |
| break; |
break; |
| case 6: |
case 6: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| t1 = (u1&0x3f000000); t2 = (u2&0x3f000000); u = t1>t2?t1:t2; |
t1 = (u1&0x3f000000); t2 = (u2&0x3f000000); u = t1>t2?t1:t2; |
| t1 = (u1&0xfc0000); t2 = (u2&0xfc0000); u |= t1>t2?t1:t2; |
t1 = (u1&0xfc0000); t2 = (u2&0xfc0000); u |= t1>t2?t1:t2; |
| Line 293 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in |
|
| Line 495 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in |
|
| } |
} |
| break; |
break; |
| case 8: |
case 8: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| t1 = (u1&0xff000000); t2 = (u2&0xff000000); u = t1>t2?t1:t2; |
t1 = (u1&0xff000000); t2 = (u2&0xff000000); u = t1>t2?t1:t2; |
| t1 = (u1&0xff0000); t2 = (u2&0xff0000); u |= t1>t2?t1:t2; |
t1 = (u1&0xff0000); t2 = (u2&0xff0000); u |= t1>t2?t1:t2; |
| Line 303 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in |
|
| Line 505 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in |
|
| } |
} |
| break; |
break; |
| case 16: |
case 16: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| t1 = (u1&0xffff0000); t2 = (u2&0xffff0000); u = t1>t2?t1:t2; |
t1 = (u1&0xffff0000); t2 = (u2&0xffff0000); u = t1>t2?t1:t2; |
| t1 = (u1&0xffff); t2 = (u2&0xffff); u |= t1>t2?t1:t2; |
t1 = (u1&0xffff); t2 = (u2&0xffff); u |= t1>t2?t1:t2; |
| Line 311 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in |
|
| Line 513 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in |
|
| } |
} |
| break; |
break; |
| case 32: |
case 32: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| d[i] = u1>u2?u1:u2; |
d[i] = u1>u2?u1:u2; |
| } |
} |
| break; |
break; |
| default: |
default: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| for ( j = 0, u = 0; j < nd_epw; j++ ) { |
for ( j = 0, u = 0; j < nd_epw; j++ ) { |
| t1 = (u1&nd_mask[j]); t2 = (u2&nd_mask[j]); u |= t1>t2?t1:t2; |
t1 = (u1&nd_mask[j]); t2 = (u2&nd_mask[j]); u |= t1>t2?t1:t2; |
| Line 326 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in |
|
| Line 528 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in |
|
| } |
} |
| break; |
break; |
| } |
} |
| |
TD(d) = ndl_weight(d); |
| |
if ( nd_blockmask ) { |
| |
l = nd_blockmask->n; |
| |
for ( j = 0; j < l; j++ ) |
| |
d[j+1] = ndl_weight_mask(d,j); |
| |
} |
| } |
} |
| |
|
| int ndl_td(unsigned int *d) |
int ndl_weight(unsigned int *d) |
| { |
{ |
| unsigned int t,u; |
unsigned int t,u; |
| int i,j; |
int i,j; |
| |
|
| for ( t = 0, i = 0; i < nd_wpd; i++ ) { |
for ( t = 0, i = nd_exporigin; i < nd_wpd; i++ ) { |
| u = d[i]; |
u = d[i]; |
| for ( j = 0; j < nd_epw; j++, u>>=nd_bpe ) |
for ( j = 0; j < nd_epw; j++, u>>=nd_bpe ) |
| t += (u&nd_mask0); |
t += (u&nd_mask0); |
| Line 341 int ndl_td(unsigned int *d) |
|
| Line 549 int ndl_td(unsigned int *d) |
|
| return t; |
return t; |
| } |
} |
| |
|
| INLINE int ndl_compare(unsigned int *d1,unsigned int *d2) |
int ndl_weight_mask(unsigned int *d,int index) |
| { |
{ |
| |
unsigned int t,u; |
| |
unsigned int *mask; |
| |
int i,j; |
| |
|
| |
mask = nd_blockmask->mask[index]; |
| |
for ( t = 0, i = nd_exporigin; i < nd_wpd; i++ ) { |
| |
u = d[i]&mask[i]; |
| |
for ( j = 0; j < nd_epw; j++, u>>=nd_bpe ) |
| |
t += (u&nd_mask0); |
| |
} |
| |
return t; |
| |
} |
| |
|
| |
int ndl_lex_compare(unsigned int *d1,unsigned int *d2) |
| |
{ |
| int i; |
int i; |
| |
|
| for ( i = 0; i < nd_wpd; i++, d1++, d2++ ) |
d1 += nd_exporigin; |
| |
d2 += nd_exporigin; |
| |
for ( i = nd_exporigin; i < nd_wpd; i++, d1++, d2++ ) |
| if ( *d1 > *d2 ) |
if ( *d1 > *d2 ) |
| return is_rlex ? -1 : 1; |
return nd_isrlex ? -1 : 1; |
| else if ( *d1 < *d2 ) |
else if ( *d1 < *d2 ) |
| return is_rlex ? 1 : -1; |
return nd_isrlex ? 1 : -1; |
| return 0; |
return 0; |
| } |
} |
| |
|
| |
int ndl_block_compare(unsigned int *d1,unsigned int *d2) |
| |
{ |
| |
int i,l,j,ord_o,ord_l; |
| |
struct order_pair *op; |
| |
unsigned int t1,t2,m; |
| |
unsigned int *mask; |
| |
|
| |
l = nd_blockmask->n; |
| |
op = nd_blockmask->order_pair; |
| |
for ( j = 0; j < l; j++ ) { |
| |
mask = nd_blockmask->mask[j]; |
| |
ord_o = op[j].order; |
| |
if ( ord_o < 2 ) |
| |
if ( (t1=d1[j+1]) > (t2=d2[j+1]) ) return 1; |
| |
else if ( t1 < t2 ) return -1; |
| |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| |
m = mask[i]; |
| |
t1 = d1[i]&m; |
| |
t2 = d2[i]&m; |
| |
if ( t1 > t2 ) |
| |
return !ord_o ? -1 : 1; |
| |
else if ( t1 < t2 ) |
| |
return !ord_o ? 1 : -1; |
| |
} |
| |
} |
| |
return 0; |
| |
} |
| |
|
| INLINE int ndl_equal(unsigned int *d1,unsigned int *d2) |
INLINE int ndl_equal(unsigned int *d1,unsigned int *d2) |
| { |
{ |
| int i; |
int i; |
| |
|
| for ( i = 0; i < nd_wpd; i++ ) |
for ( i = 0; i < nd_wpd; i++ ) |
| if ( d1[i] != d2[i] ) |
if ( *d1++ != *d2++ ) |
| return 0; |
return 0; |
| return 1; |
return 1; |
| } |
} |
| |
|
| |
INLINE void ndl_copy(unsigned int *d1,unsigned int *d2) |
| |
{ |
| |
int i; |
| |
|
| |
switch ( nd_wpd ) { |
| |
case 2: |
| |
TD(d2) = TD(d1); |
| |
d2[1] = d1[1]; |
| |
break; |
| |
case 3: |
| |
TD(d2) = TD(d1); |
| |
d2[1] = d1[1]; |
| |
d2[2] = d1[2]; |
| |
break; |
| |
default: |
| |
for ( i = 0; i < nd_wpd; i++ ) |
| |
d2[i] = d1[i]; |
| |
break; |
| |
} |
| |
} |
| |
|
| INLINE void ndl_add(unsigned int *d1,unsigned int *d2,unsigned int *d) |
INLINE void ndl_add(unsigned int *d1,unsigned int *d2,unsigned int *d) |
| { |
{ |
| int i; |
int i; |
| |
|
| for ( i = 0; i < nd_wpd; i++ ) { |
#if 1 |
| d[i] = d1[i]+d2[i]; |
switch ( nd_wpd ) { |
| |
case 2: |
| |
TD(d) = TD(d1)+TD(d2); |
| |
d[1] = d1[1]+d2[1]; |
| |
break; |
| |
case 3: |
| |
TD(d) = TD(d1)+TD(d2); |
| |
d[1] = d1[1]+d2[1]; |
| |
d[2] = d1[2]+d2[2]; |
| |
break; |
| |
default: |
| |
for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]+d2[i]; |
| |
break; |
| } |
} |
| |
#else |
| |
for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]+d2[i]; |
| |
#endif |
| } |
} |
| |
|
| void ndl_sub(unsigned int *d1,unsigned int *d2,unsigned int *d) |
INLINE void ndl_sub(unsigned int *d1,unsigned int *d2,unsigned int *d) |
| { |
{ |
| int i; |
int i; |
| |
|
| for ( i = 0; i < nd_wpd; i++ ) |
for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]-d2[i]; |
| d[i] = d1[i]-d2[i]; |
|
| } |
} |
| |
|
| int ndl_disjoint(unsigned int *d1,unsigned int *d2) |
int ndl_disjoint(unsigned int *d1,unsigned int *d2) |
| Line 387 int ndl_disjoint(unsigned int *d1,unsigned int *d2) |
|
| Line 675 int ndl_disjoint(unsigned int *d1,unsigned int *d2) |
|
| |
|
| switch ( nd_bpe ) { |
switch ( nd_bpe ) { |
| case 4: |
case 4: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| t1 = u1&0xf0000000; t2 = u2&0xf0000000; if ( t1&&t2 ) return 0; |
t1 = u1&0xf0000000; t2 = u2&0xf0000000; if ( t1&&t2 ) return 0; |
| t1 = u1&0xf000000; t2 = u2&0xf000000; if ( t1&&t2 ) return 0; |
t1 = u1&0xf000000; t2 = u2&0xf000000; if ( t1&&t2 ) return 0; |
| Line 401 int ndl_disjoint(unsigned int *d1,unsigned int *d2) |
|
| Line 689 int ndl_disjoint(unsigned int *d1,unsigned int *d2) |
|
| return 1; |
return 1; |
| break; |
break; |
| case 6: |
case 6: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| t1 = u1&0x3f000000; t2 = u2&0x3f000000; if ( t1&&t2 ) return 0; |
t1 = u1&0x3f000000; t2 = u2&0x3f000000; if ( t1&&t2 ) return 0; |
| t1 = u1&0xfc0000; t2 = u2&0xfc0000; if ( t1&&t2 ) return 0; |
t1 = u1&0xfc0000; t2 = u2&0xfc0000; if ( t1&&t2 ) return 0; |
| Line 412 int ndl_disjoint(unsigned int *d1,unsigned int *d2) |
|
| Line 700 int ndl_disjoint(unsigned int *d1,unsigned int *d2) |
|
| return 1; |
return 1; |
| break; |
break; |
| case 8: |
case 8: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| t1 = u1&0xff000000; t2 = u2&0xff000000; if ( t1&&t2 ) return 0; |
t1 = u1&0xff000000; t2 = u2&0xff000000; if ( t1&&t2 ) return 0; |
| t1 = u1&0xff0000; t2 = u2&0xff0000; if ( t1&&t2 ) return 0; |
t1 = u1&0xff0000; t2 = u2&0xff0000; if ( t1&&t2 ) return 0; |
| Line 422 int ndl_disjoint(unsigned int *d1,unsigned int *d2) |
|
| Line 710 int ndl_disjoint(unsigned int *d1,unsigned int *d2) |
|
| return 1; |
return 1; |
| break; |
break; |
| case 16: |
case 16: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| t1 = u1&0xffff0000; t2 = u2&0xffff0000; if ( t1&&t2 ) return 0; |
t1 = u1&0xffff0000; t2 = u2&0xffff0000; if ( t1&&t2 ) return 0; |
| t1 = u1&0xffff; t2 = u2&0xffff; if ( t1&&t2 ) return 0; |
t1 = u1&0xffff; t2 = u2&0xffff; if ( t1&&t2 ) return 0; |
| Line 430 int ndl_disjoint(unsigned int *d1,unsigned int *d2) |
|
| Line 718 int ndl_disjoint(unsigned int *d1,unsigned int *d2) |
|
| return 1; |
return 1; |
| break; |
break; |
| case 32: |
case 32: |
| for ( i = 0; i < nd_wpd; i++ ) |
for ( i = nd_exporigin; i < nd_wpd; i++ ) |
| if ( d1[i] && d2[i] ) return 0; |
if ( d1[i] && d2[i] ) return 0; |
| return 1; |
return 1; |
| break; |
break; |
| default: |
default: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u1 = d1[i]; u2 = d2[i]; |
u1 = d1[i]; u2 = d2[i]; |
| for ( j = 0; j < nd_epw; j++ ) { |
for ( j = 0; j < nd_epw; j++ ) { |
| if ( (u1&nd_mask0) && (u2&nd_mask0) ) return 0; |
if ( (u1&nd_mask0) && (u2&nd_mask0) ) return 0; |
| Line 447 int ndl_disjoint(unsigned int *d1,unsigned int *d2) |
|
| Line 735 int ndl_disjoint(unsigned int *d1,unsigned int *d2) |
|
| } |
} |
| } |
} |
| |
|
| ND nd_reduce(ND p1,ND p2) |
int ndl_check_bound2(int index,unsigned int *d2) |
| { |
{ |
| int c,c1,c2,t,td,td2,mul; |
unsigned int u2; |
| NM m2,prev,head,cur,new; |
unsigned int *d1; |
| unsigned int *d; |
int i,j,ind,k; |
| |
|
| if ( !p1 ) |
d1 = nd_bound[index]; |
| return 0; |
ind = 0; |
| else { |
switch ( nd_bpe ) { |
| c2 = invm(HC(p2),nd_mod); |
case 4: |
| c1 = nd_mod-HC(p1); |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| DMAR(c1,c2,0,nd_mod,mul); |
u2 = d2[i]; |
| td = HTD(p1)-HTD(p2); |
if ( d1[ind++]+((u2>>28)&0xf) >= 0x10 ) return 1; |
| d = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
if ( d1[ind++]+((u2>>24)&0xf) >= 0x10 ) return 1; |
| ndl_sub(HDL(p1),HDL(p2),d); |
if ( d1[ind++]+((u2>>20)&0xf) >= 0x10 ) return 1; |
| prev = 0; head = cur = BDY(p1); |
if ( d1[ind++]+((u2>>16)&0xf) >= 0x10 ) return 1; |
| NEWNM(new); |
if ( d1[ind++]+((u2>>12)&0xf) >= 0x10 ) return 1; |
| for ( m2 = BDY(p2); m2; ) { |
if ( d1[ind++]+((u2>>8)&0xf) >= 0x10 ) return 1; |
| td2 = new->td = m2->td+td; |
if ( d1[ind++]+((u2>>4)&0xf) >= 0x10 ) return 1; |
| ndl_add(m2->dl,d,new->dl); |
if ( d1[ind++]+(u2&0xf) >= 0x10 ) return 1; |
| if ( !cur ) { |
|
| c1 = C(m2); |
|
| DMAR(c1,mul,0,nd_mod,c2); |
|
| C(new) = c2; |
|
| if ( !prev ) { |
|
| prev = new; |
|
| NEXT(prev) = 0; |
|
| head = prev; |
|
| } else { |
|
| NEXT(prev) = new; |
|
| NEXT(new) = 0; |
|
| prev = new; |
|
| } |
|
| m2 = NEXT(m2); |
|
| NEWNM(new); |
|
| continue; |
|
| } |
} |
| if ( cur->td > td2 ) |
return 0; |
| c = 1; |
break; |
| else if ( cur->td < td2 ) |
case 6: |
| c = -1; |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| else |
u2 = d2[i]; |
| c = ndl_compare(cur->dl,new->dl); |
if ( d1[ind++]+((u2>>24)&0x3f) >= 0x40 ) return 1; |
| switch ( c ) { |
if ( d1[ind++]+((u2>>18)&0x3f) >= 0x40 ) return 1; |
| case 0: |
if ( d1[ind++]+((u2>>12)&0x3f) >= 0x40 ) return 1; |
| c2 = C(m2); |
if ( d1[ind++]+((u2>>6)&0x3f) >= 0x40 ) return 1; |
| c1 = C(cur); |
if ( d1[ind++]+(u2&0x3f) >= 0x40 ) return 1; |
| DMAR(c2,mul,c1,nd_mod,t); |
|
| if ( t ) |
|
| C(cur) = t; |
|
| else if ( !prev ) { |
|
| head = NEXT(cur); |
|
| FREENM(cur); |
|
| cur = head; |
|
| } else { |
|
| NEXT(prev) = NEXT(cur); |
|
| FREENM(cur); |
|
| cur = NEXT(prev); |
|
| } |
|
| m2 = NEXT(m2); |
|
| break; |
|
| case 1: |
|
| prev = cur; |
|
| cur = NEXT(cur); |
|
| break; |
|
| case -1: |
|
| if ( !prev ) { |
|
| /* cur = head */ |
|
| prev = new; |
|
| c2 = C(m2); |
|
| DMAR(c2,mul,0,nd_mod,c1); |
|
| C(prev) = c1; |
|
| NEXT(prev) = head; |
|
| head = prev; |
|
| } else { |
|
| c2 = C(m2); |
|
| DMAR(c2,mul,0,nd_mod,c1); |
|
| C(new) = c1; |
|
| NEXT(prev) = new; |
|
| NEXT(new) = cur; |
|
| prev = new; |
|
| } |
|
| NEWNM(new); |
|
| m2 = NEXT(m2); |
|
| break; |
|
| } |
} |
| } |
|
| FREENM(new); |
|
| if ( head ) { |
|
| BDY(p1) = head; |
|
| p1->sugar = MAX(p1->sugar,p2->sugar+td); |
|
| return p1; |
|
| } else { |
|
| FREEND(p1); |
|
| return 0; |
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; |
| ND ndv_add(ND p1,NDV p2) |
if ( d1[ind++]+((u2>>16)&0xff) >= 0x100 ) return 1; |
| { |
if ( d1[ind++]+((u2>>8)&0xff) >= 0x100 ) return 1; |
| int c,c1,c2,t,td,td2,mul,len,i; |
if ( d1[ind++]+(u2&0xff) >= 0x100 ) return 1; |
| NM prev,head,cur,new; |
|
| unsigned int *d; |
|
| NMV m2; |
|
| |
|
| if ( !p1 ) |
|
| return 0; |
|
| else { |
|
| prev = 0; head = cur = BDY(p1); |
|
| NEWNM(new); |
|
| len = p2->len; |
|
| for ( m2 = BDY(p2), i = 0; i < len; ) { |
|
| td2 = new->td = m2->td; |
|
| if ( !cur ) { |
|
| C(new) = C(m2); |
|
| bcopy(m2->dl,new->dl,nd_wpd*sizeof(unsigned int)); |
|
| if ( !prev ) { |
|
| prev = new; |
|
| NEXT(prev) = 0; |
|
| head = prev; |
|
| } else { |
|
| NEXT(prev) = new; |
|
| NEXT(new) = 0; |
|
| prev = new; |
|
| } |
|
| NMV_ADV(m2); i++; |
|
| NEWNM(new); |
|
| continue; |
|
| } |
} |
| if ( cur->td > td2 ) |
return 0; |
| c = 1; |
break; |
| else if ( cur->td < td2 ) |
case 16: |
| c = -1; |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| else |
u2 = d2[i]; |
| c = ndl_compare(cur->dl,m2->dl); |
if ( d1[ind++]+((u2>>16)&0xffff) > 0x10000 ) return 1; |
| switch ( c ) { |
if ( d1[ind++]+(u2&0xffff) > 0x10000 ) return 1; |
| case 0: |
|
| t = C(m2)+C(cur)-nd_mod; |
|
| if ( t < 0 ) |
|
| t += nd_mod; |
|
| if ( t ) |
|
| C(cur) = t; |
|
| else if ( !prev ) { |
|
| head = NEXT(cur); |
|
| FREENM(cur); |
|
| cur = head; |
|
| } else { |
|
| NEXT(prev) = NEXT(cur); |
|
| FREENM(cur); |
|
| cur = NEXT(prev); |
|
| } |
|
| NMV_ADV(m2); i++; |
|
| break; |
|
| case 1: |
|
| prev = cur; |
|
| cur = NEXT(cur); |
|
| break; |
|
| case -1: |
|
| if ( !prev ) { |
|
| /* cur = head */ |
|
| prev = new; |
|
| bcopy(m2->dl,new->dl,nd_wpd*sizeof(unsigned int)); |
|
| C(prev) = C(m2); |
|
| NEXT(prev) = head; |
|
| head = prev; |
|
| } else { |
|
| C(new) = C(m2); |
|
| bcopy(m2->dl,new->dl,nd_wpd*sizeof(unsigned int)); |
|
| NEXT(prev) = new; |
|
| NEXT(new) = cur; |
|
| prev = new; |
|
| } |
|
| NEWNM(new); |
|
| NMV_ADV(m2); i++; |
|
| break; |
|
| } |
} |
| } |
|
| FREENM(new); |
|
| if ( head ) { |
|
| BDY(p1) = head; |
|
| p1->sugar = MAX(p1->sugar,p2->sugar+td); |
|
| return p1; |
|
| } else { |
|
| FREEND(p1); |
|
| return 0; |
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; |
| |
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; |
| } |
} |
| } |
} |
| |
|
| /* HDL(p1) = HDL(p2) */ |
int ndl_check_bound2_direct(unsigned int *d1,unsigned int *d2) |
| |
|
| ND nd_reduce_special(ND p1,ND p2) |
|
| { |
{ |
| int c,c1,c2,t,td,td2,mul; |
unsigned int u2; |
| NM m2,prev,head,cur,new; |
int i,j,ind,k; |
| |
|
| if ( !p1 ) |
ind = 0; |
| return 0; |
switch ( nd_bpe ) { |
| else { |
case 4: |
| c2 = invm(HC(p2),nd_mod); |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| c1 = nd_mod-HC(p1); |
u2 = d2[i]; |
| DMAR(c1,c2,0,nd_mod,mul); |
if ( d1[ind++]+((u2>>28)&0xf) >= 0x10 ) return 1; |
| prev = 0; head = cur = BDY(p1); |
if ( d1[ind++]+((u2>>24)&0xf) >= 0x10 ) return 1; |
| NEWNM(new); |
if ( d1[ind++]+((u2>>20)&0xf) >= 0x10 ) return 1; |
| for ( m2 = BDY(p2); m2; ) { |
if ( d1[ind++]+((u2>>16)&0xf) >= 0x10 ) return 1; |
| td2 = new->td = m2->td; |
if ( d1[ind++]+((u2>>12)&0xf) >= 0x10 ) return 1; |
| if ( !cur ) { |
if ( d1[ind++]+((u2>>8)&0xf) >= 0x10 ) return 1; |
| c1 = C(m2); |
if ( d1[ind++]+((u2>>4)&0xf) >= 0x10 ) return 1; |
| DMAR(c1,mul,0,nd_mod,c2); |
if ( d1[ind++]+(u2&0xf) >= 0x10 ) return 1; |
| C(new) = c2; |
|
| bcopy(m2->dl,new->dl,nd_wpd*sizeof(unsigned int)); |
|
| if ( !prev ) { |
|
| prev = new; |
|
| NEXT(prev) = 0; |
|
| head = prev; |
|
| } else { |
|
| NEXT(prev) = new; |
|
| NEXT(new) = 0; |
|
| prev = new; |
|
| } |
|
| m2 = NEXT(m2); |
|
| NEWNM(new); |
|
| continue; |
|
| } |
} |
| if ( cur->td > td2 ) |
return 0; |
| c = 1; |
break; |
| else if ( cur->td < td2 ) |
case 6: |
| c = -1; |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| else |
u2 = d2[i]; |
| c = ndl_compare(cur->dl,m2->dl); |
if ( d1[ind++]+((u2>>24)&0x3f) >= 0x40 ) return 1; |
| switch ( c ) { |
if ( d1[ind++]+((u2>>18)&0x3f) >= 0x40 ) return 1; |
| case 0: |
if ( d1[ind++]+((u2>>12)&0x3f) >= 0x40 ) return 1; |
| c2 = C(m2); |
if ( d1[ind++]+((u2>>6)&0x3f) >= 0x40 ) return 1; |
| c1 = C(cur); |
if ( d1[ind++]+(u2&0x3f) >= 0x40 ) return 1; |
| DMAR(c2,mul,c1,nd_mod,t); |
|
| if ( t ) |
|
| C(cur) = t; |
|
| else if ( !prev ) { |
|
| head = NEXT(cur); |
|
| FREENM(cur); |
|
| cur = head; |
|
| } else { |
|
| NEXT(prev) = NEXT(cur); |
|
| FREENM(cur); |
|
| cur = NEXT(prev); |
|
| } |
|
| m2 = NEXT(m2); |
|
| break; |
|
| case 1: |
|
| prev = cur; |
|
| cur = NEXT(cur); |
|
| break; |
|
| case -1: |
|
| bcopy(m2->dl,new->dl,nd_wpd*sizeof(unsigned int)); |
|
| if ( !prev ) { |
|
| /* cur = head */ |
|
| prev = new; |
|
| c2 = C(m2); |
|
| DMAR(c2,mul,0,nd_mod,c1); |
|
| C(prev) = c1; |
|
| NEXT(prev) = head; |
|
| head = prev; |
|
| } else { |
|
| c2 = C(m2); |
|
| DMAR(c2,mul,0,nd_mod,c1); |
|
| C(new) = c1; |
|
| NEXT(prev) = new; |
|
| NEXT(new) = cur; |
|
| prev = new; |
|
| } |
|
| NEWNM(new); |
|
| m2 = NEXT(m2); |
|
| break; |
|
| } |
} |
| } |
|
| FREENM(new); |
|
| if ( head ) { |
|
| BDY(p1) = head; |
|
| p1->sugar = MAX(p1->sugar,p2->sugar+td); |
|
| return p1; |
|
| } else { |
|
| FREEND(p1); |
|
| return 0; |
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; |
| |
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; |
| } |
} |
| } |
} |
| |
|
| INLINE int ndl_check_bound(unsigned int *d) |
INLINE int ndl_hash_value(unsigned int *d) |
| { |
{ |
| int i; |
int i; |
| |
|
| for ( i = 0; i < nd_wpd; i++ ) |
|
| if ( d[i] & nd_mask1 ) |
|
| return 1; |
|
| return 0; |
|
| } |
|
| |
|
| int nd_sp(ND_pairs p,ND *rp) |
|
| { |
|
| NM m; |
|
| ND p1,p2,t1,t2; |
|
| unsigned int *lcm,*check; |
|
| int td; |
|
| |
|
| check = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
|
| p1 = nd_ps[p->i1]; |
|
| p2 = nd_ps[p->i2]; |
|
| lcm = p->lcm; |
|
| td = p->td; |
|
| NEWNM(m); |
|
| C(m) = HC(p2); m->td = td-HTD(p1); ndl_sub(lcm,HDL(p1),m->dl); NEXT(m) = 0; |
|
| ndl_add(nd_bound[p->i1],m->dl,check); |
|
| if ( ndl_check_bound(check) ) |
|
| return 0; |
|
| t1 = nd_mul_nm(p1,m); |
|
| C(m) = nd_mod-HC(p1); m->td = td-HTD(p2); ndl_sub(lcm,HDL(p2),m->dl); |
|
| ndl_add(nd_bound[p->i2],m->dl,check); |
|
| if ( ndl_check_bound(check) ) { |
|
| nd_free(t1); |
|
| return 0; |
|
| } |
|
| t2 = nd_mul_nm(p2,m); |
|
| FREENM(m); |
|
| *rp = nd_add(t1,t2); |
|
| return 1; |
|
| } |
|
| |
|
| int ndl_hash_value(int td,unsigned int *d) |
|
| { |
|
| int i; |
|
| int r; |
int r; |
| |
|
| r = td; |
r = 0; |
| for ( i = 0; i < nd_wpd; i++ ) |
for ( i = 0; i < nd_wpd; i++ ) |
| r = ((r<<16)+d[i])%REDTAB_LEN; |
r = ((r<<16)+d[i])%REDTAB_LEN; |
| return r; |
return r; |
| } |
} |
| |
|
| int nd_find_reducer(ND g, ND *rp) |
INLINE int nd_find_reducer(ND g) |
| { |
{ |
| NM m; |
RHist r; |
| ND r,p; |
unsigned int *dg; |
| int i,c1,c2,c; |
int d,k,i; |
| int d,k,append,index; |
|
| unsigned int *check; |
|
| NM t; |
|
| |
|
| d = ndl_hash_value(HTD(g),HDL(g)); |
dg = HDL(g); |
| for ( m = nd_red[d], k = 0; m; m = NEXT(m), k++ ) { |
#if 1 |
| if ( HTD(g) == m->td && ndl_equal(HDL(g),m->dl) ) { |
d = ndl_hash_value(HDL(g)); |
| |
for ( r = nd_red[d], k = 0; r; r = NEXT(r), k++ ) { |
| |
if ( ndl_equal(dg,DL(r)) ) { |
| if ( k > 0 ) nd_notfirst++; |
if ( k > 0 ) nd_notfirst++; |
| index = m->c; |
|
| append = 0; |
|
| nd_found++; |
nd_found++; |
| goto found; |
return r->index; |
| } |
} |
| } |
} |
| |
#endif |
| for ( i = 0; i < nd_psn; i++ ) { |
if ( Reverse ) |
| p = nd_ps[i]; |
for ( i = nd_psn-1; i >= 0; i-- ) { |
| if ( HTD(g) >= HTD(p) && ndl_reducible(HDL(g),HDL(p)) ) { |
r = nd_psh[i]; |
| index = i; |
if ( ndl_reducible(dg,DL(r)) ) { |
| append = 1; |
nd_create++; |
| nd_create++; |
nd_append_red(dg,i); |
| goto found; |
return i; |
| |
} |
| } |
} |
| } |
else |
| return 0; |
for ( i = 0; i < nd_psn; i++ ) { |
| |
r = nd_psh[i]; |
| found: |
if ( ndl_reducible(dg,DL(r)) ) { |
| NEWNM(m); |
nd_create++; |
| p = nd_ps[index]; |
nd_append_red(dg,i); |
| ndl_sub(HDL(g),HDL(p),m->dl); |
return i; |
| |
} |
| check = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
} |
| ndl_add(nd_bound[index],m->dl,check); |
return -1; |
| if ( ndl_check_bound(check) ) { |
|
| FREENM(m); |
|
| return -1; |
|
| } |
|
| |
|
| c1 = invm(HC(p),nd_mod); |
|
| c2 = nd_mod-HC(g); |
|
| DMAR(c1,c2,0,nd_mod,c); |
|
| C(m) = c; |
|
| m->td = HTD(g)-HTD(p); |
|
| NEXT(m) = 0; |
|
| *rp = r = nd_mul_nm(p,m); |
|
| FREENM(m); |
|
| |
|
| if ( append ) nd_append_red(HDL(g),HTD(g),i); |
|
| return 1; |
|
| } |
} |
| |
|
| int ndv_find_reducer(ND g, NDV red) |
INLINE int nd_find_reducer_direct(ND g,NDV *ps,int len) |
| { |
{ |
| NM m; |
NDV r; |
| ND r,p; |
RHist s; |
| int i,c1,c2,c; |
int d,k,i; |
| int d,k,append,index; |
|
| unsigned int *check; |
|
| NM t; |
|
| NDV pv; |
|
| |
|
| d = ndl_hash_value(HTD(g),HDL(g)); |
if ( Reverse ) |
| for ( m = nd_red[d], k = 0; m; m = NEXT(m), k++ ) { |
for ( i = len-1; i >= 0; i-- ) { |
| if ( HTD(g) == m->td && ndl_equal(HDL(g),m->dl) ) { |
r = ps[i]; |
| if ( k > 0 ) nd_notfirst++; |
if ( ndl_reducible(HDL(g),HDL(r)) ) |
| index = m->c; |
return i; |
| append = 0; |
|
| nd_found++; |
|
| goto found; |
|
| } |
} |
| } |
else |
| |
for ( i = 0; i < len; i++ ) { |
| for ( i = 0; i < nd_psn; i++ ) { |
r = ps[i]; |
| p = nd_ps[i]; |
if ( ndl_reducible(HDL(g),HDL(r)) ) |
| if ( HTD(g) >= HTD(p) && ndl_reducible(HDL(g),HDL(p)) ) { |
return i; |
| index = i; |
|
| append = 1; |
|
| nd_create++; |
|
| goto found; |
|
| } |
} |
| } |
return -1; |
| return 0; |
|
| |
|
| found: |
|
| NEWNM(m); |
|
| p = nd_ps[index]; |
|
| pv = nd_psv[index]; |
|
| ndl_sub(HDL(g),HDL(p),m->dl); |
|
| |
|
| check = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
|
| ndl_add(nd_bound[index],m->dl,check); |
|
| if ( ndl_check_bound(check) ) { |
|
| FREENM(m); |
|
| return -1; |
|
| } |
|
| |
|
| c1 = invm(HC(p),nd_mod); |
|
| c2 = nd_mod-HC(g); |
|
| DMAR(c1,c2,0,nd_mod,c); |
|
| C(m) = c; |
|
| m->td = HTD(g)-HTD(p); |
|
| NEXT(m) = 0; |
|
| ndv_mul_nm(pv,m,red); |
|
| FREENM(m); |
|
| |
|
| if ( append ) nd_append_red(HDL(g),HTD(g),i); |
|
| return 1; |
|
| } |
} |
| |
|
| ND nd_find_monic_reducer(ND g) |
ND nd_add(int mod,ND p1,ND p2) |
| { |
{ |
| int *d; |
|
| ND p,r; |
|
| int i; |
|
| |
|
| for ( i = 0; i < nd_psn; i++ ) { |
|
| p = nd_ps[i]; |
|
| if ( HTD(g) >= HTD(p) && ndl_reducible(HDL(g),HDL(p)) ) { |
|
| d = (int *)ALLOCA(nd_wpd*sizeof(int)); |
|
| ndl_sub(HDL(g),HDL(p),d); |
|
| r = nd_mul_term(p,HTD(g)-HTD(p),d); |
|
| return r; |
|
| } |
|
| } |
|
| return 0; |
|
| } |
|
| |
|
| ND nd_add(ND p1,ND p2) |
|
| { |
|
| int n,c; |
int n,c; |
| int t; |
int t,can,td1,td2; |
| ND r; |
ND r; |
| NM m1,m2,mr0,mr,s; |
NM m1,m2,mr0,mr,s; |
| |
|
| if ( !p1 ) |
if ( !p1 ) return p2; |
| return p2; |
else if ( !p2 ) return p1; |
| else if ( !p2 ) |
else if ( !mod ) return nd_add_q(p1,p2); |
| return p1; |
|
| else { |
else { |
| |
can = 0; |
| for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) { |
for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) { |
| if ( m1->td > m2->td ) |
c = DL_COMPARE(DL(m1),DL(m2)); |
| c = 1; |
|
| else if ( m1->td < m2->td ) |
|
| c = -1; |
|
| else |
|
| c = ndl_compare(m1->dl,m2->dl); |
|
| switch ( c ) { |
switch ( c ) { |
| case 0: |
case 0: |
| t = ((C(m1))+(C(m2))) - nd_mod; |
t = ((CM(m1))+(CM(m2))) - mod; |
| if ( t < 0 ) |
if ( t < 0 ) t += mod; |
| t += nd_mod; |
|
| s = m1; m1 = NEXT(m1); |
s = m1; m1 = NEXT(m1); |
| if ( t ) { |
if ( t ) { |
| NEXTNM2(mr0,mr,s); C(mr) = (t); |
can++; NEXTNM2(mr0,mr,s); CM(mr) = (t); |
| } else { |
} else { |
| FREENM(s); |
can += 2; FREENM(s); |
| } |
} |
| s = m2; m2 = NEXT(m2); FREENM(s); |
s = m2; m2 = NEXT(m2); FREENM(s); |
| break; |
break; |
| Line 962 ND nd_add(ND p1,ND p2) |
|
| Line 976 ND nd_add(ND p1,ND p2) |
|
| } |
} |
| } |
} |
| if ( !mr0 ) |
if ( !mr0 ) |
| if ( m1 ) |
if ( m1 ) mr0 = m1; |
| mr0 = m1; |
else if ( m2 ) mr0 = m2; |
| else if ( m2 ) |
else return 0; |
| mr0 = m2; |
else if ( m1 ) NEXT(mr) = m1; |
| else |
else if ( m2 ) NEXT(mr) = m2; |
| return 0; |
else NEXT(mr) = 0; |
| else if ( m1 ) |
|
| NEXT(mr) = m1; |
|
| else if ( m2 ) |
|
| NEXT(mr) = m2; |
|
| else |
|
| NEXT(mr) = 0; |
|
| BDY(p1) = mr0; |
BDY(p1) = mr0; |
| p1->sugar = MAX(p1->sugar,p2->sugar); |
SG(p1) = MAX(SG(p1),SG(p2)); |
| |
LEN(p1) = LEN(p1)+LEN(p2)-can; |
| FREEND(p2); |
FREEND(p2); |
| return p1; |
return p1; |
| } |
} |
| } |
} |
| |
|
| ND nd_mul_nm(ND p,NM m0) |
ND nd_add_q(ND p1,ND p2) |
| { |
{ |
| NM m,mr,mr0; |
int n,c,can; |
| unsigned int *d,*dt,*dm; |
|
| int c,n,td,i,c1,c2; |
|
| int *pt,*p1,*p2; |
|
| ND r; |
ND r; |
| |
NM m1,m2,mr0,mr,s; |
| |
Q t; |
| |
|
| if ( !p ) |
if ( !p1 ) return p2; |
| return 0; |
else if ( !p2 ) return p1; |
| else { |
else { |
| n = NV(p); m = BDY(p); |
can = 0; |
| d = m0->dl; td = m0->td; c = C(m0); |
for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) { |
| mr0 = 0; |
c = DL_COMPARE(DL(m1),DL(m2)); |
| for ( ; m; m = NEXT(m) ) { |
switch ( c ) { |
| NEXTNM(mr0,mr); |
case 0: |
| c1 = C(m); |
addq(CQ(m1),CQ(m2),&t); |
| DMAR(c1,c,0,nd_mod,c2); |
s = m1; m1 = NEXT(m1); |
| C(mr) = c2; |
if ( t ) { |
| mr->td = m->td+td; |
can++; NEXTNM2(mr0,mr,s); CQ(mr) = (t); |
| ndl_add(m->dl,d,mr->dl); |
} 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; |
| |
} |
| } |
} |
| NEXT(mr) = 0; |
if ( !mr0 ) |
| MKND(NV(p),mr0,r); |
if ( m1 ) mr0 = m1; |
| r->sugar = p->sugar + td; |
else if ( m2 ) mr0 = m2; |
| return r; |
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; |
| } |
} |
| } |
} |
| |
|
| void ndv_mul_nm(NDV p,NM m0,NDV r) |
/* ret=1 : success, ret=0 : overflow */ |
| |
int nd_nf(int mod,ND g,int full,ND *rp) |
| { |
{ |
| NMV m,mr,mr0; |
ND d; |
| unsigned int *d,*dt,*dm; |
NM m,mrd,tail; |
| int c,n,td,i,c1,c2,len; |
NM mul; |
| |
int n,sugar,psugar,sugar0,stat,index; |
| |
int c,c1,c2,dummy; |
| |
RHist h; |
| |
NDV p,red; |
| |
Q cg,cred,gcd; |
| |
double hmag; |
| |
|
| if ( !p ) |
if ( !g ) { |
| /* XXX */ |
*rp = 0; |
| r->len = 0; |
return 1; |
| else { |
} |
| n = NV(p); m = BDY(p); len = p->len; |
if ( !mod ) hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
| d = m0->dl; td = m0->td; c = C(m0); |
|
| mr = BDY(r); |
sugar0 = sugar = SG(g); |
| for ( i = 0; i < len; i++, NMV_ADV(m), NMV_ADV(mr) ) { |
n = NV(g); |
| c1 = C(m); |
mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int)); |
| DMAR(c1,c,0,nd_mod,c2); |
for ( d = 0; g; ) { |
| C(mr) = c2; |
index = nd_find_reducer(g); |
| mr->td = m->td+td; |
if ( index >= 0 ) { |
| ndl_add(m->dl,d,mr->dl); |
h = nd_psh[index]; |
| |
ndl_sub(HDL(g),DL(h),DL(mul)); |
| |
if ( ndl_check_bound2(index,DL(mul)) ) { |
| |
nd_free(g); nd_free(d); |
| |
return 0; |
| |
} |
| |
if ( mod ) { |
| |
p = nd_ps[index]; |
| |
c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
| |
DMAR(c1,c2,0,mod,c); CM(mul) = c; |
| |
} else { |
| |
p = nd_psq[index]; |
| |
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,p,mul)); |
| |
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); |
| |
} |
| } |
} |
| NV(r) = NV(p); |
|
| r->len = p->len; |
|
| r->sugar = p->sugar + td; |
|
| } |
} |
| |
if ( d ) SG(d) = sugar; |
| |
*rp = d; |
| |
return 1; |
| } |
} |
| |
|
| ND nd_mul_term(ND p,int td,unsigned int *d) |
int nd_nf_pbucket(int mod,ND g,int full,ND *rp) |
| { |
{ |
| NM m,mr,mr0; |
int hindex,index; |
| int c,n; |
NDV p; |
| ND r; |
ND u,d,red; |
| |
NODE l; |
| |
NM mul,m,mrd,tail; |
| |
int sugar,psugar,n,h_reducible; |
| |
PGeoBucket bucket; |
| |
int c,c1,c2; |
| |
Q cg,cred,gcd,zzz; |
| |
RHist h; |
| |
double hmag,gmag; |
| |
|
| if ( !p ) |
if ( !g ) { |
| return 0; |
*rp = 0; |
| else { |
return 1; |
| n = NV(p); m = BDY(p); |
} |
| for ( mr0 = 0; m; m = NEXT(m) ) { |
sugar = SG(g); |
| NEXTNM(mr0,mr); |
n = NV(g); |
| C(mr) = C(m); |
if ( !mod ) hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
| mr->td = m->td+td; |
bucket = create_pbucket(); |
| ndl_add(m->dl,d,mr->dl); |
add_pbucket(mod,bucket,g); |
| |
d = 0; |
| |
mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int)); |
| |
while ( 1 ) { |
| |
hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket); |
| |
if ( hindex < 0 ) { |
| |
if ( d ) SG(d) = sugar; |
| |
*rp = d; |
| |
return 1; |
| } |
} |
| NEXT(mr) = 0; |
g = bucket->body[hindex]; |
| MKND(NV(p),mr0,r); |
index = nd_find_reducer(g); |
| r->sugar = p->sugar + td; |
if ( index >= 0 ) { |
| return r; |
h = nd_psh[index]; |
| |
ndl_sub(HDL(g),DL(h),DL(mul)); |
| |
if ( ndl_check_bound2(index,DL(mul)) ) { |
| |
nd_free(d); |
| |
free_pbucket(bucket); |
| |
*rp = 0; |
| |
return 0; |
| |
} |
| |
if ( mod ) { |
| |
p = nd_ps[index]; |
| |
c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
| |
DMAR(c1,c2,0,mod,c); CM(mul) = c; |
| |
} else { |
| |
p = nd_psq[index]; |
| |
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
| |
chsgnq(cg,&CQ(mul)); |
| |
nd_mul_c_q(d,cred); |
| |
mulq_pbucket(bucket,cred); |
| |
g = bucket->body[hindex]; |
| |
gmag = (double)p_mag((P)HCQ(g)); |
| |
} |
| |
red = ndv_mul_nm(mod,p,mul); |
| |
bucket->body[hindex] = nd_remove_head(g); |
| |
red = nd_remove_head(red); |
| |
add_pbucket(mod,bucket,red); |
| |
psugar = SG(p)+TD(DL(mul)); |
| |
sugar = MAX(sugar,psugar); |
| |
if ( !mod && hmag && (gmag > hmag) ) { |
| |
g = normalize_pbucket(mod,bucket); |
| |
if ( !g ) { |
| |
if ( d ) SG(d) = sugar; |
| |
*rp = d; |
| |
return 1; |
| |
} |
| |
nd_removecont2(d,g); |
| |
hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
| |
add_pbucket(mod,bucket,g); |
| |
} |
| |
} else if ( !full ) { |
| |
g = normalize_pbucket(mod,bucket); |
| |
if ( g ) SG(g) = sugar; |
| |
*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; |
| |
} |
| |
bucket->body[hindex] = g; |
| |
NEXT(m) = 0; |
| |
if ( d ) { |
| |
NEXT(tail)=m; tail=m; LEN(d)++; |
| |
} else { |
| |
MKND(n,m,1,d); tail = BDY(d); |
| |
} |
| |
} |
| } |
} |
| } |
} |
| |
|
| #if 1 |
int nd_nf_direct(int mod,ND g,BaseSet base,int full,ND *rp) |
| /* ret=1 : success, ret=0 : overflow */ |
|
| int nd_nf(ND g,int full,ND *rp) |
|
| { |
{ |
| ND p,d; |
ND d; |
| NM m,mrd,tail; |
NM m,mrd,tail; |
| int n,sugar,psugar,stat; |
NM mul; |
| NDV red; |
NDV *ps; |
| |
int n,sugar,psugar,sugar0,stat,index,len; |
| |
int c,c1,c2; |
| |
unsigned int **bound; |
| |
RHist h; |
| |
NDV p,red; |
| |
Q cg,cred,gcd; |
| |
double hmag; |
| |
|
| if ( !g ) { |
if ( !g ) { |
| *rp = 0; |
*rp = 0; |
| return 1; |
return 1; |
| } |
} |
| sugar = g->sugar; |
|
| n = NV(g); |
|
| for ( d = 0; g; ) { |
|
| /* stat=1 : found, stat=0 : not found, stat=-1 : overflow */ |
|
| #if 0 |
#if 0 |
| stat = nd_find_reducer(g,&red); |
if ( !mod ) |
| |
hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
| #else |
#else |
| stat = ndv_find_reducer(g,ndv_red); |
/* XXX */ |
| |
hmag = 0; |
| #endif |
#endif |
| if ( stat == 1 ) { |
|
| #if 0 |
ps = base->ps; |
| g = nd_add(g,red); |
bound = base->bound; |
| #else |
len = base->len; |
| g = ndv_add(g,ndv_red); |
sugar0 = sugar = SG(g); |
| #endif |
n = NV(g); |
| sugar = MAX(sugar,ndv_red->sugar); |
mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int)); |
| } else if ( stat == -1 ) { |
for ( d = 0; g; ) { |
| nd_free(g); |
index = nd_find_reducer_direct(g,ps,len); |
| nd_free(d); |
if ( index >= 0 ) { |
| return 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,p,mul)); |
| |
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 ) { |
} else if ( !full ) { |
| *rp = g; |
*rp = g; |
| return 1; |
return 1; |
| } else { |
} else { |
| m = BDY(g); |
m = BDY(g); |
| if ( NEXT(m) ) { |
if ( NEXT(m) ) { |
| BDY(g) = NEXT(m); NEXT(m) = 0; |
BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--; |
| } else { |
} else { |
| FREEND(g); g = 0; |
FREEND(g); g = 0; |
| } |
} |
| if ( d ) { |
if ( d ) { |
| NEXT(tail)=m; |
NEXT(tail)=m; tail=m; LEN(d)++; |
| tail=m; |
|
| } else { |
} else { |
| MKND(n,m,d); |
MKND(n,m,1,d); tail = BDY(d); |
| tail = BDY(d); |
|
| } |
} |
| } |
} |
| } |
} |
| if ( d ) |
if ( d ) SG(d) = sugar; |
| d->sugar = sugar; |
|
| *rp = d; |
*rp = d; |
| return 1; |
return 1; |
| } |
} |
| #else |
|
| |
|
| |
/* input : list of DP, cand : list of DP */ |
| |
|
| |
int nd_check_candidate(NODE input,NODE cand) |
| |
{ |
| |
int n,i,stat; |
| |
ND nf,d; |
| |
NODE t,s; |
| |
|
| |
#if 0 |
| |
for ( t = 0; cand; cand = NEXT(cand) ) { |
| |
MKNODE(s,BDY(cand),t); t = s; |
| |
} |
| |
cand = t; |
| |
#endif |
| |
|
| |
nd_setup(0,0,cand); |
| |
n = length(cand); |
| |
|
| |
/* membercheck : list is a subset of Id(cand) ? */ |
| |
for ( t = input; t; t = NEXT(t) ) { |
| |
again: |
| |
d = dptond(0,(DP)BDY(t)); |
| |
stat = nd_nf(0,d,0,&nf); |
| |
if ( !stat ) { |
| |
nd_reconstruct(0,0,0); |
| |
goto again; |
| |
} else if ( nf ) return 0; |
| |
printf("."); fflush(stdout); |
| |
} |
| |
printf("\n"); |
| |
/* gbcheck : cand is a GB of Id(cand) ? */ |
| |
if ( !nd_gb(0,1) ) return 0; |
| |
/* XXX */ |
| |
return 1; |
| |
} |
| |
|
| ND nd_remove_head(ND p) |
ND nd_remove_head(ND p) |
| { |
{ |
| NM m; |
NM m; |
| |
|
| m = BDY(p); |
m = BDY(p); |
| if ( !NEXT(m) ) { |
if ( !NEXT(m) ) { |
| FREEND(p); |
FREEND(p); p = 0; |
| p = 0; |
} else { |
| } else |
BDY(p) = NEXT(m); LEN(p)--; |
| BDY(p) = NEXT(m); |
} |
| FREENM(m); |
FREENM(m); |
| return p; |
return p; |
| } |
} |
| Line 1141 PGeoBucket create_pbucket() |
|
| Line 1338 PGeoBucket create_pbucket() |
|
| return g; |
return g; |
| } |
} |
| |
|
| void add_pbucket(PGeoBucket g,ND d) |
void free_pbucket(PGeoBucket b) { |
| |
int i; |
| |
|
| |
for ( i = 0; i <= b->m; i++ ) |
| |
if ( b->body[i] ) { |
| |
nd_free(b->body[i]); |
| |
b->body[i] = 0; |
| |
} |
| |
GC_free(b); |
| |
} |
| |
|
| |
void add_pbucket(int mod,PGeoBucket g,ND d) |
| { |
{ |
| int l,k,m; |
int l,i,k,m; |
| |
|
| l = nd_length(d); |
if ( !d ) |
| for ( k = 0, m = 1; l > m; k++, m <<= 2 ); |
return; |
| /* 4^(k-1) < l <= 4^k */ |
l = LEN(d); |
| d = nd_add(g->body[k],d); |
for ( k = 0, m = 1; l > m; k++, m <<= 1 ); |
| for ( ; d && nd_length(d) > 1<<(2*k); k++ ) { |
/* 2^(k-1) < l <= 2^k (=m) */ |
| |
d = nd_add(mod,g->body[k],d); |
| |
for ( ; d && LEN(d) > m; k++, m <<= 1 ) { |
| g->body[k] = 0; |
g->body[k] = 0; |
| d = nd_add(g->body[k+1],d); |
d = nd_add(mod,g->body[k+1],d); |
| } |
} |
| g->body[k] = d; |
g->body[k] = d; |
| g->m = MAX(g->m,k); |
g->m = MAX(g->m,k); |
| } |
} |
| |
|
| int head_pbucket(PGeoBucket g) |
void mulq_pbucket(PGeoBucket g,Q c) |
| { |
{ |
| |
int k; |
| |
|
| |
for ( k = 0; k <= g->m; k++ ) |
| |
nd_mul_c_q(g->body[k],c); |
| |
} |
| |
|
| |
int head_pbucket(int mod,PGeoBucket g) |
| |
{ |
| int j,i,c,k,nv,sum; |
int j,i,c,k,nv,sum; |
| unsigned int *di,*dj; |
unsigned int *di,*dj; |
| ND gi,gj; |
ND gi,gj; |
| Line 1173 int head_pbucket(PGeoBucket g) |
|
| Line 1391 int head_pbucket(PGeoBucket g) |
|
| j = i; |
j = i; |
| gj = g->body[j]; |
gj = g->body[j]; |
| dj = HDL(gj); |
dj = HDL(gj); |
| sum = HC(gj); |
sum = HCM(gj); |
| } else { |
} else { |
| di = HDL(gi); |
c = DL_COMPARE(HDL(gi),dj); |
| nv = NV(gi); |
|
| if ( HTD(gi) > HTD(gj) ) |
|
| c = 1; |
|
| else if ( HTD(gi) < HTD(gj) ) |
|
| c = -1; |
|
| else |
|
| c = ndl_compare(di,dj); |
|
| if ( c > 0 ) { |
if ( c > 0 ) { |
| if ( sum ) |
if ( sum ) HCM(gj) = sum; |
| HC(gj) = sum; |
else g->body[j] = nd_remove_head(gj); |
| else |
|
| g->body[j] = nd_remove_head(gj); |
|
| j = i; |
j = i; |
| gj = g->body[j]; |
gj = g->body[j]; |
| dj = HDL(gj); |
dj = HDL(gj); |
| sum = HC(gj); |
sum = HCM(gj); |
| } else if ( c == 0 ) { |
} else if ( c == 0 ) { |
| sum = sum+HC(gi)-nd_mod; |
sum = sum+HCM(gi)-mod; |
| if ( sum < 0 ) |
if ( sum < 0 ) sum += mod; |
| sum += nd_mod; |
|
| g->body[i] = nd_remove_head(gi); |
g->body[i] = nd_remove_head(gi); |
| } |
} |
| } |
} |
| } |
} |
| if ( j < 0 ) |
if ( j < 0 ) return -1; |
| return -1; |
|
| else if ( sum ) { |
else if ( sum ) { |
| HC(gj) = sum; |
HCM(gj) = sum; |
| return j; |
return j; |
| } else |
} else |
| g->body[j] = nd_remove_head(gj); |
g->body[j] = nd_remove_head(gj); |
| } |
} |
| } |
} |
| |
|
| ND normalize_pbucket(PGeoBucket g) |
int head_pbucket_q(PGeoBucket g) |
| { |
{ |
| |
int j,i,c,k,nv; |
| |
Q sum,t; |
| |
ND gi,gj; |
| |
|
| |
k = g->m; |
| |
while ( 1 ) { |
| |
j = -1; |
| |
for ( i = 0; i <= k; i++ ) { |
| |
if ( !(gi = g->body[i]) ) continue; |
| |
if ( j < 0 ) { |
| |
j = i; |
| |
gj = g->body[j]; |
| |
sum = HCQ(gj); |
| |
} else { |
| |
nv = NV(gi); |
| |
c = DL_COMPARE(HDL(gi),HDL(gj)); |
| |
if ( c > 0 ) { |
| |
if ( sum ) HCQ(gj) = sum; |
| |
else g->body[j] = nd_remove_head(gj); |
| |
j = i; |
| |
gj = g->body[j]; |
| |
sum = HCQ(gj); |
| |
} else if ( c == 0 ) { |
| |
addq(sum,HCQ(gi),&t); |
| |
sum = t; |
| |
g->body[i] = nd_remove_head(gi); |
| |
} |
| |
} |
| |
} |
| |
if ( j < 0 ) return -1; |
| |
else if ( sum ) { |
| |
HCQ(gj) = sum; |
| |
return j; |
| |
} else |
| |
g->body[j] = nd_remove_head(gj); |
| |
} |
| |
} |
| |
|
| |
ND normalize_pbucket(int mod,PGeoBucket g) |
| |
{ |
| int i; |
int i; |
| ND r,t; |
ND r,t; |
| |
|
| r = 0; |
r = 0; |
| for ( i = 0; i <= g->m; i++ ) |
for ( i = 0; i <= g->m; i++ ) { |
| r = nd_add(r,g->body[i]); |
r = nd_add(mod,r,g->body[i]); |
| |
g->body[i] = 0; |
| |
} |
| |
g->m = -1; |
| return r; |
return r; |
| } |
} |
| |
|
| ND nd_nf(ND g,int full) |
/* return value = 0 => input is not a GB */ |
| |
|
| |
NODE nd_gb(int m,int checkonly) |
| { |
{ |
| ND u,p,d,red; |
int i,nh,sugar,stat; |
| NODE l; |
NODE r,g,t; |
| NM m,mrd; |
ND_pairs d; |
| int sugar,psugar,n,h_reducible,h; |
ND_pairs l; |
| PGeoBucket bucket; |
ND h,nf; |
| |
|
| if ( !g ) { |
g = 0; d = 0; |
| return 0; |
for ( i = 0; i < nd_psn; i++ ) { |
| |
d = update_pairs(d,g,i); |
| |
g = update_base(g,i); |
| } |
} |
| sugar = g->sugar; |
sugar = 0; |
| n = g->nv; |
while ( d ) { |
| bucket = create_pbucket(); |
again: |
| add_pbucket(bucket,g); |
l = nd_minp(d,&d); |
| d = 0; |
if ( SG(l) != sugar ) { |
| while ( 1 ) { |
sugar = SG(l); |
| h = head_pbucket(bucket); |
fprintf(asir_out,"%d",sugar); |
| if ( h < 0 ) { |
|
| if ( d ) |
|
| d->sugar = sugar; |
|
| return d; |
|
| } |
} |
| g = bucket->body[h]; |
stat = nd_sp(m,l,&h); |
| red = nd_find_reducer(g); |
if ( !stat ) { |
| if ( red ) { |
NEXT(l) = d; d = l; |
| bucket->body[h] = nd_remove_head(g); |
d = nd_reconstruct(m,0,d); |
| red = nd_remove_head(red); |
goto again; |
| add_pbucket(bucket,red); |
} |
| sugar = MAX(sugar,red->sugar); |
#if USE_GEOBUCKET |
| } else if ( !full ) { |
stat = m?nd_nf_pbucket(m,h,!Top,&nf):nd_nf(m,h,!Top,&nf); |
| g = normalize_pbucket(bucket); |
#else |
| if ( g ) |
stat = nd_nf(m,h,!Top,&nf); |
| g->sugar = sugar; |
#endif |
| return g; |
if ( !stat ) { |
| |
NEXT(l) = d; d = l; |
| |
d = nd_reconstruct(m,0,d); |
| |
goto again; |
| |
} else if ( nf ) { |
| |
if ( checkonly ) return 0; |
| |
printf("+"); fflush(stdout); |
| |
nh = m?nd_newps(m,nf,0):nd_newps(m,0,nf); |
| |
d = update_pairs(d,g,nh); |
| |
g = update_base(g,nh); |
| |
FREENDP(l); |
| } else { |
} else { |
| m = BDY(g); |
printf("."); fflush(stdout); |
| if ( NEXT(m) ) { |
FREENDP(l); |
| BDY(g) = NEXT(m); NEXT(m) = 0; |
|
| } else { |
|
| FREEND(g); g = 0; |
|
| } |
|
| bucket->body[h] = g; |
|
| NEXT(m) = 0; |
|
| if ( d ) { |
|
| for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) ); |
|
| NEXT(mrd) = m; |
|
| } else { |
|
| MKND(n,m,d); |
|
| } |
|
| } |
} |
| } |
} |
| |
if ( m ) |
| |
for ( t = g; t; t = NEXT(t) ) BDY(t) = (pointer)nd_ps[(int)BDY(t)]; |
| |
else |
| |
for ( t = g; t; t = NEXT(t) ) BDY(t) = (pointer)nd_psq[(int)BDY(t)]; |
| |
return g; |
| } |
} |
| #endif |
|
| |
|
| NODE nd_gb(NODE f) |
NODE nd_gb_trace(int m) |
| { |
{ |
| int i,nh,sugar,stat; |
int i,nh,sugar,stat; |
| NODE r,g,gall; |
NODE r,g,t; |
| ND_pairs d; |
ND_pairs d; |
| ND_pairs l; |
ND_pairs l; |
| ND h,nf; |
ND h,nf,nfq; |
| |
|
| for ( gall = g = 0, d = 0, r = f; r; r = NEXT(r) ) { |
g = 0; d = 0; |
| i = (int)BDY(r); |
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); |
| gall = append_one(gall,i); |
|
| } |
} |
| sugar = 0; |
sugar = 0; |
| while ( d ) { |
while ( d ) { |
| again: |
again: |
| l = nd_minp(d,&d); |
l = nd_minp(d,&d); |
| if ( l->sugar != sugar ) { |
if ( SG(l) != sugar ) { |
| sugar = l->sugar; |
sugar = SG(l); |
| fprintf(asir_out,"%d",sugar); |
fprintf(asir_out,"%d",sugar); |
| } |
} |
| stat = nd_sp(l,&h); |
stat = nd_sp(m,l,&h); |
| if ( !stat ) { |
if ( !stat ) { |
| NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
| d = nd_reconstruct(d); |
d = nd_reconstruct(m,1,d); |
| goto again; |
goto again; |
| } |
} |
| stat = nd_nf(h,!Top,&nf); |
#if USE_GEOBUCKET |
| |
stat = nd_nf_pbucket(m,h,!Top,&nf); |
| |
#else |
| |
stat = nd_nf(m,h,!Top,&nf); |
| |
#endif |
| if ( !stat ) { |
if ( !stat ) { |
| NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
| d = nd_reconstruct(d); |
d = nd_reconstruct(m,1,d); |
| goto again; |
goto again; |
| } else if ( nf ) { |
} else if ( nf ) { |
| printf("+"); fflush(stdout); |
/* overflow does not occur */ |
| nh = nd_newps(nf); |
nd_sp(0,l,&h); |
| d = update_pairs(d,g,nh); |
nd_nf(0,h,!Top,&nfq); |
| g = update_base(g,nh); |
if ( nfq ) { |
| gall = append_one(gall,nh); |
printf("+"); fflush(stdout); |
| FREENDP(l); |
nh = nd_newps(m,nf,nfq); |
| |
/* failure; m|HC(nfq) */ |
| |
if ( nh < 0 ) return 0; |
| |
d = update_pairs(d,g,nh); |
| |
g = update_base(g,nh); |
| |
} else { |
| |
printf("*"); fflush(stdout); |
| |
} |
| } else { |
} else { |
| printf("."); fflush(stdout); |
printf("."); fflush(stdout); |
| FREENDP(l); |
|
| } |
} |
| |
FREENDP(l); |
| } |
} |
| |
for ( t = g; t; t = NEXT(t) ) |
| |
BDY(t) = (pointer)nd_psq[(int)BDY(t)]; |
| return g; |
return g; |
| } |
} |
| |
|
| |
int ndv_compare(NDV *p1,NDV *p2) |
| |
{ |
| |
return DL_COMPARE(HDL(*p1),HDL(*p2)); |
| |
} |
| |
|
| |
int ndv_compare_rev(NDV *p1,NDV *p2) |
| |
{ |
| |
return -DL_COMPARE(HDL(*p1),HDL(*p2)); |
| |
} |
| |
|
| |
NODE nd_reduceall(int m,NODE f) |
| |
{ |
| |
int i,j,n,stat; |
| |
NDV *w,*ps; |
| |
ND nf,g; |
| |
NODE t,a0,a; |
| |
struct oBaseSet base; |
| |
unsigned int **bound; |
| |
|
| |
for ( n = 0, t = f; t; t = NEXT(t), n++ ); |
| |
ps = (NDV *)ALLOCA(n*sizeof(NDV)); |
| |
bound = (unsigned int **)ALLOCA(n*sizeof(unsigned int *)); |
| |
for ( i = 0, t = f; i < n; i++, t = NEXT(t) ) { |
| |
ps[i] = (NDV)BDY(t); |
| |
bound[i] = ndv_compute_bound(ps[i]); |
| |
} |
| |
qsort(ps,n,sizeof(NDV),(int (*)(const void *,const void *))ndv_compare); |
| |
base.ps = (NDV *)ALLOCA((n-1)*sizeof(NDV)); |
| |
base.bound = (unsigned int **)ALLOCA((n-1)*sizeof(unsigned int *)); |
| |
base.len = n-1; |
| |
i = 0; |
| |
while ( i < n ) { |
| |
for ( j = 0; j < i; j++ ) { |
| |
base.ps[j] = ps[j]; base.bound[j] = bound[j]; |
| |
} |
| |
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 ) |
| |
nd_reconstruct_direct(m,ps,n); |
| |
else if ( !nf ) { |
| |
printf("."); fflush(stdout); |
| |
ndv_free(ps[i]); |
| |
for ( j = i+1; j < n; j++ ) { |
| |
ps[j-1] = ps[j]; bound[j-1] = bound[j]; |
| |
} |
| |
n--; |
| |
base.len = n-1; |
| |
} else { |
| |
printf("."); fflush(stdout); |
| |
ndv_free(ps[i]); |
| |
nd_removecont(m,nf); |
| |
ps[i] = ndtondv(m,nf); |
| |
bound[i] = ndv_compute_bound(ps[i]); |
| |
nd_free(nf); |
| |
i++; |
| |
} |
| |
} |
| |
printf("\n"); |
| |
for ( a0 = 0, i = 0; i < n; i++ ) { |
| |
NEXTNODE(a0,a); |
| |
BDY(a) = (pointer)ps[i]; |
| |
} |
| |
NEXT(a) = 0; |
| |
return a0; |
| |
} |
| |
|
| ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t) |
ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t) |
| { |
{ |
| ND_pairs d1,nd,cur,head,prev,remove; |
ND_pairs d1,nd,cur,head,prev,remove; |
| Line 1337 ND_pairs update_pairs( ND_pairs d, NODE /* of index */ |
|
| Line 1670 ND_pairs update_pairs( ND_pairs d, NODE /* of index */ |
|
| while ( cur ) { |
while ( cur ) { |
| if ( crit_2( cur->i1,cur->i2 ) ) { |
if ( crit_2( cur->i1,cur->i2 ) ) { |
| remove = cur; |
remove = cur; |
| if ( !prev ) { |
if ( !prev ) head = cur = NEXT(cur); |
| head = cur = NEXT(cur); |
else cur = NEXT(prev) = NEXT(cur); |
| } else { |
|
| cur = NEXT(prev) = NEXT(cur); |
|
| } |
|
| FREENDP(remove); |
FREENDP(remove); |
| } else { |
} else { |
| prev = cur; |
prev = cur; cur = NEXT(cur); |
| cur = NEXT(cur); |
|
| } |
} |
| } |
} |
| if ( !d ) |
if ( !d ) |
| return head; |
return head; |
| else { |
else { |
| nd = d; |
nd = d; |
| while ( NEXT(nd) ) |
while ( NEXT(nd) ) nd = NEXT(nd); |
| nd = NEXT(nd); |
|
| NEXT(nd) = head; |
NEXT(nd) = head; |
| return d; |
return d; |
| } |
} |
| Line 1363 ND_pairs nd_newpairs( NODE g, int t ) |
|
| Line 1691 ND_pairs nd_newpairs( NODE g, int t ) |
|
| { |
{ |
| NODE h; |
NODE h; |
| unsigned int *dl; |
unsigned int *dl; |
| int td,ts,s; |
int ts,s; |
| ND_pairs r,r0; |
ND_pairs r,r0; |
| |
|
| dl = HDL(nd_ps[t]); |
dl = DL(nd_psh[t]); |
| td = HTD(nd_ps[t]); |
ts = SG(nd_psh[t]) - TD(dl); |
| ts = nd_ps[t]->sugar - td; |
|
| for ( r0 = 0, h = g; h; h = NEXT(h) ) { |
for ( r0 = 0, h = g; h; h = NEXT(h) ) { |
| NEXTND_pairs(r0,r); |
NEXTND_pairs(r0,r); |
| r->i1 = (int)BDY(h); |
r->i1 = (int)BDY(h); |
| r->i2 = t; |
r->i2 = t; |
| ndl_lcm(HDL(nd_ps[r->i1]),dl,r->lcm); |
ndl_lcm(DL(nd_psh[r->i1]),dl,r->lcm); |
| r->td = ndl_td(r->lcm); |
s = SG(nd_psh[r->i1])-TD(DL(nd_psh[r->i1])); |
| s = nd_ps[r->i1]->sugar-HTD(nd_ps[r->i1]); |
SG(r) = MAX(s,ts) + TD(LCM(r)); |
| r->sugar = MAX(s,ts) + r->td; |
|
| } |
} |
| NEXT(r) = 0; |
NEXT(r) = 0; |
| return r0; |
return r0; |
| Line 1389 ND_pairs crit_B( ND_pairs d, int s ) |
|
| Line 1715 ND_pairs crit_B( ND_pairs d, int s ) |
|
| int td,tdl; |
int td,tdl; |
| |
|
| if ( !d ) return 0; |
if ( !d ) return 0; |
| t = HDL(nd_ps[s]); |
t = DL(nd_psh[s]); |
| prev = 0; |
prev = 0; |
| head = cur = d; |
head = cur = d; |
| lcm = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
lcm = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
| while ( cur ) { |
while ( cur ) { |
| tl = cur->lcm; |
tl = cur->lcm; |
| if ( ndl_reducible(tl,t) |
if ( ndl_reducible(tl,t) |
| && (ndl_lcm(HDL(nd_ps[cur->i1]),t,lcm),!ndl_equal(lcm,tl)) |
&& (ndl_lcm(DL(nd_psh[cur->i1]),t,lcm),!ndl_equal(lcm,tl)) |
| && (ndl_lcm(HDL(nd_ps[cur->i2]),t,lcm),!ndl_equal(lcm,tl)) ) { |
&& (ndl_lcm(DL(nd_psh[cur->i2]),t,lcm),!ndl_equal(lcm,tl)) ) { |
| remove = cur; |
remove = cur; |
| if ( !prev ) { |
if ( !prev ) { |
| head = cur = NEXT(cur); |
head = cur = NEXT(cur); |
| Line 1406 ND_pairs crit_B( ND_pairs d, int s ) |
|
| Line 1732 ND_pairs crit_B( ND_pairs d, int s ) |
|
| } |
} |
| FREENDP(remove); |
FREENDP(remove); |
| } else { |
} else { |
| prev = cur; |
prev = cur; cur = NEXT(cur); |
| cur = NEXT(cur); |
|
| } |
} |
| } |
} |
| return head; |
return head; |
| } |
} |
| |
|
| |
/* XXX : check is necessary */ |
| |
|
| ND_pairs crit_M( ND_pairs d1 ) |
ND_pairs crit_M( ND_pairs d1 ) |
| { |
{ |
| ND_pairs e,d2,d3,dd,p; |
ND_pairs e,d2,d3,dd,p; |
| unsigned int *id,*jd; |
unsigned int *id,*jd; |
| int itd,jtd; |
|
| |
|
| for ( dd = 0, e = d1; e; e = d3 ) { |
for ( dd = 0, e = d1; e; e = d3 ) { |
| if ( !(d2 = NEXT(e)) ) { |
if ( !(d2 = NEXT(e)) ) { |
| NEXT(e) = dd; |
NEXT(e) = dd; |
| return e; |
return e; |
| } |
} |
| id = e->lcm; |
id = LCM(e); |
| itd = e->td; |
|
| for ( d3 = 0; d2; d2 = p ) { |
for ( d3 = 0; d2; d2 = p ) { |
| p = NEXT(d2), |
p = NEXT(d2); |
| jd = d2->lcm; |
jd = LCM(d2); |
| jtd = d2->td; |
if ( ndl_equal(jd,id) ) |
| if ( jtd == itd ) |
; |
| if ( id == jd ); |
else if ( TD(jd) > TD(id) ) |
| else if ( ndl_reducible(jd,id) ) continue; |
|
| else if ( ndl_reducible(id,jd) ) goto delit; |
|
| else ; |
|
| else if ( jtd > itd ) |
|
| if ( ndl_reducible(jd,id) ) continue; |
if ( ndl_reducible(jd,id) ) continue; |
| else ; |
else ; |
| else if ( ndl_reducible(id,jd ) ) goto delit; |
else if ( ndl_reducible(id,jd) ) goto delit; |
| NEXT(d2) = d3; |
NEXT(d2) = d3; |
| d3 = d2; |
d3 = d2; |
| } |
} |
| Line 1466 ND_pairs crit_F( ND_pairs d1 ) |
|
| Line 1787 ND_pairs crit_F( ND_pairs d1 ) |
|
| |
|
| for ( head = last = 0, p = d1; NEXT(p); ) { |
for ( head = last = 0, p = d1; NEXT(p); ) { |
| r = w = equivalent_pairs(p,&rest); |
r = w = equivalent_pairs(p,&rest); |
| s = r->sugar; |
s = SG(r); |
| w = NEXT(w); |
w = NEXT(w); |
| while ( w ) { |
while ( w ) { |
| if ( crit_2(w->i1,w->i2) ) { |
if ( crit_2(w->i1,w->i2) ) { |
| Line 1478 ND_pairs crit_F( ND_pairs d1 ) |
|
| Line 1799 ND_pairs crit_F( ND_pairs d1 ) |
|
| FREENDP(remove); |
FREENDP(remove); |
| } |
} |
| break; |
break; |
| } else if ( w->sugar < s ) { |
} else if ( SG(w) < s ) { |
| FREENDP(r); |
FREENDP(r); |
| r = w; |
r = w; |
| s = r->sugar; |
s = SG(r); |
| w = NEXT(w); |
w = NEXT(w); |
| } else { |
} else { |
| remove = w; |
remove = w; |
| Line 1502 ND_pairs crit_F( ND_pairs d1 ) |
|
| Line 1823 ND_pairs crit_F( ND_pairs d1 ) |
|
| |
|
| int crit_2( int dp1, int dp2 ) |
int crit_2( int dp1, int dp2 ) |
| { |
{ |
| return ndl_disjoint(HDL(nd_ps[dp1]),HDL(nd_ps[dp2])); |
return ndl_disjoint(DL(nd_psh[dp1]),DL(nd_psh[dp2])); |
| } |
} |
| |
|
| static ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest ) |
ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest ) |
| { |
{ |
| ND_pairs w,p,r,s; |
ND_pairs w,p,r,s; |
| unsigned int *d; |
unsigned int *d; |
| int td; |
|
| |
|
| w = d1; |
w = d1; |
| d = w->lcm; |
d = LCM(w); |
| td = w->td; |
|
| s = NEXT(w); |
s = NEXT(w); |
| NEXT(w) = 0; |
NEXT(w) = 0; |
| for ( r = 0; s; s = p ) { |
for ( r = 0; s; s = p ) { |
| p = NEXT(s); |
p = NEXT(s); |
| if ( td == s->td && ndl_equal(d,s->lcm) ) { |
if ( ndl_equal(d,LCM(s)) ) { |
| NEXT(s) = w; |
NEXT(s) = w; w = s; |
| w = s; |
|
| } else { |
} else { |
| NEXT(s) = r; |
NEXT(s) = r; r = s; |
| r = s; |
|
| } |
} |
| } |
} |
| *prest = r; |
*prest = r; |
| Line 1534 NODE update_base(NODE nd,int ndp) |
|
| Line 1851 NODE update_base(NODE nd,int ndp) |
|
| { |
{ |
| unsigned int *dl, *dln; |
unsigned int *dl, *dln; |
| NODE last, p, head; |
NODE last, p, head; |
| int td,tdn; |
|
| |
|
| dl = HDL(nd_ps[ndp]); |
dl = DL(nd_psh[ndp]); |
| td = HTD(nd_ps[ndp]); |
|
| for ( head = last = 0, p = nd; p; ) { |
for ( head = last = 0, p = nd; p; ) { |
| dln = HDL(nd_ps[(int)BDY(p)]); |
dln = DL(nd_psh[(int)BDY(p)]); |
| tdn = HTD(nd_ps[(int)BDY(p)]); |
if ( ndl_reducible( dln, dl ) ) { |
| if ( tdn >= td && ndl_reducible( dln, dl ) ) { |
|
| p = NEXT(p); |
p = NEXT(p); |
| if ( last ) NEXT(last) = p; |
if ( last ) NEXT(last) = p; |
| } else { |
} else { |
| Line 1557 ND_pairs nd_minp( ND_pairs d, ND_pairs *prest ) |
|
| Line 1871 ND_pairs nd_minp( ND_pairs d, ND_pairs *prest ) |
|
| { |
{ |
| ND_pairs m,ml,p,l; |
ND_pairs m,ml,p,l; |
| unsigned int *lcm; |
unsigned int *lcm; |
| int s,td,len,tlen,c; |
int s,td,len,tlen,c,c1; |
| |
|
| if ( !(p = NEXT(m = d)) ) { |
if ( !(p = NEXT(m = d)) ) { |
| *prest = p; |
*prest = p; |
| NEXT(m) = 0; |
NEXT(m) = 0; |
| return m; |
return m; |
| } |
} |
| lcm = m->lcm; |
s = SG(m); |
| s = m->sugar; |
for ( ml = 0, l = m; p; p = NEXT(l = p) ) |
| td = m->td; |
if ( (SG(p) < s) |
| len = nd_length(nd_ps[m->i1])+nd_length(nd_ps[m->i2]); |
|| ((SG(p) == s) && (DL_COMPARE(LCM(p),LCM(m)) < 0)) ) { |
| for ( ml = 0, l = m; p; p = NEXT(l = p) ) { |
ml = l; m = p; s = SG(m); |
| if (p->sugar < s) |
|
| goto find; |
|
| else if ( p->sugar == s ) { |
|
| if ( p->td < td ) |
|
| goto find; |
|
| else if ( p->td == td ) { |
|
| c = ndl_compare(p->lcm,lcm); |
|
| if ( c < 0 ) |
|
| goto find; |
|
| else if ( c == 0 ) { |
|
| tlen = nd_length(nd_ps[p->i1])+nd_length(nd_ps[p->i2]); |
|
| if ( tlen < len ) |
|
| goto find; |
|
| } |
|
| } |
|
| } |
} |
| continue; |
|
| find: |
|
| ml = l; |
|
| m = p; |
|
| lcm = m->lcm; |
|
| s = m->sugar; |
|
| td = m->td; |
|
| len = tlen; |
|
| } |
|
| if ( !ml ) *prest = NEXT(m); |
if ( !ml ) *prest = NEXT(m); |
| else { |
else { |
| NEXT(ml) = NEXT(m); |
NEXT(ml) = NEXT(m); |
|
|
| return m; |
return m; |
| } |
} |
| |
|
| int nd_newps(ND a) |
int nd_newps(int mod,ND a,ND aq) |
| { |
{ |
| int len; |
int len; |
| |
RHist r; |
| |
NDV b; |
| |
|
| if ( nd_psn == nd_pslen ) { |
if ( nd_psn == nd_pslen ) { |
| nd_pslen *= 2; |
nd_pslen *= 2; |
| nd_ps = (ND *)REALLOC((char *)nd_ps,nd_pslen*sizeof(ND)); |
nd_ps = (NDV *)REALLOC((char *)nd_ps,nd_pslen*sizeof(NDV)); |
| nd_psv = (NDV *)REALLOC((char *)nd_psv,nd_pslen*sizeof(NDV)); |
nd_psq = (NDV *)REALLOC((char *)nd_psq,nd_pslen*sizeof(NDV)); |
| |
nd_psh = (RHist *)REALLOC((char *)nd_psh,nd_pslen*sizeof(RHist)); |
| nd_bound = (unsigned int **) |
nd_bound = (unsigned int **) |
| REALLOC((char *)nd_bound,nd_pslen*sizeof(unsigned int *)); |
REALLOC((char *)nd_bound,nd_pslen*sizeof(unsigned int *)); |
| } |
} |
| nd_monic(a); |
if ( a && aq ) { |
| nd_ps[nd_psn] = a; |
/* trace lifting */ |
| nd_psv[nd_psn] = ndtondv(a); |
if ( !rem(NM(HCQ(aq)),mod) ) |
| nd_bound[nd_psn] = nd_compute_bound(a); |
return -1; |
| len = nd_psv[nd_psn]->len; |
|
| if ( len > nmv_len ) { |
|
| nmv_len = 2*len; |
|
| BDY(ndv_red) = (NMV)REALLOC(BDY(ndv_red),nmv_len*nmv_adv); |
|
| } |
} |
| |
NEWRHist(r); nd_psh[nd_psn] = r; |
| |
if ( aq ) { |
| |
nd_removecont(0,aq); |
| |
nd_psq[nd_psn] = ndtondv(0,aq); |
| |
nd_bound[nd_psn] = ndv_compute_bound(nd_psq[nd_psn]); |
| |
SG(r) = SG(aq); ndl_copy(HDL(aq),DL(r)); |
| |
} |
| |
if ( a ) { |
| |
nd_removecont(mod,a); |
| |
nd_ps[nd_psn] = ndtondv(mod,a); |
| |
if ( !aq ) { |
| |
nd_bound[nd_psn] = ndv_compute_bound(nd_ps[nd_psn]); |
| |
SG(r) = SG(a); ndl_copy(HDL(a),DL(r)); |
| |
} |
| |
} |
| |
nd_free(a); nd_free(aq); |
| return nd_psn++; |
return nd_psn++; |
| } |
} |
| |
|
| NODE NODE_sortb(NODE f,int); |
void nd_setup(int mod,int trace,NODE f) |
| ND dptond(DP); |
|
| DP ndtodp(ND); |
|
| |
|
| NODE nd_setup(NODE f) |
|
| { |
{ |
| int i,td,len; |
int i,j,td,len,max; |
| NODE s,s0,f0; |
NODE s,s0,f0; |
| |
unsigned int *d; |
| |
RHist r; |
| |
NDV a; |
| |
|
| nd_found = 0; |
nd_found = 0; nd_notfirst = 0; nd_create = 0; |
| nd_notfirst = 0; |
|
| nd_create = 0; |
|
| #if 0 |
|
| f0 = f = NODE_sortb(f,1); |
|
| #endif |
|
| nd_psn = length(f); nd_pslen = 2*nd_psn; |
nd_psn = length(f); nd_pslen = 2*nd_psn; |
| nd_ps = (ND *)MALLOC(nd_pslen*sizeof(ND)); |
nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
| nd_psv = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
nd_psq = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
| |
nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist)); |
| nd_bound = (unsigned int **)MALLOC(nd_pslen*sizeof(unsigned int *)); |
nd_bound = (unsigned int **)MALLOC(nd_pslen*sizeof(unsigned int *)); |
| nd_bpe = 4; |
for ( max = 0, i = 0, s = f; i < nd_psn; i++, s = NEXT(s) ) { |
| |
nd_bound[i] = d = dp_compute_bound((DP)BDY(s)); |
| |
for ( j = 0; j < nd_nvar; j++ ) |
| |
max = MAX(d[j],max); |
| |
} |
| |
if ( !nd_red ) |
| |
nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist)); |
| |
bzero(nd_red,REDTAB_LEN*sizeof(RHist)); |
| |
|
| |
if ( max < 2 ) nd_bpe = 2; |
| |
else if ( max < 4 ) nd_bpe = 4; |
| |
else if ( max < 64 ) nd_bpe = 6; |
| |
else if ( max < 256 ) nd_bpe = 8; |
| |
else if ( max < 65536 ) nd_bpe = 16; |
| |
else nd_bpe = 32; |
| |
|
| nd_setup_parameters(); |
nd_setup_parameters(); |
| nd_free_private_storage(); |
nd_free_private_storage(); |
| len = 0; |
|
| for ( i = 0; i < nd_psn; i++, f = NEXT(f) ) { |
for ( i = 0; i < nd_psn; i++, f = NEXT(f) ) { |
| nd_ps[i] = dptond((DP)BDY(f)); |
NEWRHist(r); |
| nd_psv[i] = ndtondv(nd_ps[i]); |
a = dptondv(mod,(DP)BDY(f)); ndv_removecont(mod,a); |
| nd_monic(nd_ps[i]); |
SG(r) = HTD(a); ndl_copy(HDL(a),DL(r)); |
| nd_bound[i] = nd_compute_bound(nd_ps[i]); |
|
| len = MAX(len,nd_psv[i]->len); |
if ( trace ) { |
| |
nd_ps[i] = a; |
| |
a = dptondv(0,(DP)BDY(f)); ndv_removecont(0,a); |
| |
nd_psq[i] = a; |
| |
} else { |
| |
if ( mod ) nd_ps[i] = a; |
| |
else nd_psq[i] = a; |
| |
} |
| |
nd_psh[i] = r; |
| } |
} |
| nd_red = (NM *)MALLOC(REDTAB_LEN*sizeof(NM)); |
|
| nmv_len = 16*len; |
|
| NEWNDV(ndv_red); |
|
| BDY(ndv_red) = (NMV)MALLOC_ATOMIC(nmv_len*nmv_adv); |
|
| for ( s0 = 0, i = 0; i < nd_psn; i++ ) { |
|
| NEXTNODE(s0,s); BDY(s) = (pointer)i; |
|
| } |
|
| if ( s0 ) NEXT(s) = 0; |
|
| return s0; |
|
| } |
} |
| |
|
| void nd_gr(LIST f,LIST v,int m,struct order_spec *ord,LIST *rp) |
void nd_gr(LIST f,LIST v,int m,struct order_spec *ord,LIST *rp) |
| Line 1676 void nd_gr(LIST f,LIST v,int m,struct order_spec *ord, |
|
| Line 1990 void nd_gr(LIST f,LIST v,int m,struct order_spec *ord, |
|
| |
|
| get_vars((Obj)f,&fv); pltovl(v,&vv); |
get_vars((Obj)f,&fv); pltovl(v,&vv); |
| nd_nvar = length(vv); |
nd_nvar = length(vv); |
| if ( ord->id ) |
nd_init_ord(ord); |
| error("nd_gr : unsupported order"); |
/* XXX for DP */ |
| switch ( ord->ord.simple ) { |
|
| case 0: |
|
| is_rlex = 1; |
|
| break; |
|
| case 1: |
|
| is_rlex = 0; |
|
| break; |
|
| default: |
|
| error("nd_gr : unsupported order"); |
|
| } |
|
| initd(ord); |
initd(ord); |
| nd_mod = m; |
|
| for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
| ptod(CO,vv,(P)BDY(t),&b); |
ptod(CO,vv,(P)BDY(t),&b); |
| _dp_mod(b,m,0,&c); |
NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; |
| if ( c ) { |
|
| NEXTNODE(fd0,fd); BDY(fd) = (pointer)c; |
|
| } |
|
| } |
} |
| if ( fd0 ) NEXT(fd) = 0; |
if ( fd0 ) NEXT(fd) = 0; |
| s = nd_setup(fd0); |
nd_setup(m,0,fd0); |
| x = nd_gb(s); |
x = nd_gb(m,0); |
| #if 0 |
fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n", |
| x = nd_reduceall(x,m); |
nd_found,nd_notfirst,nd_create); |
| #endif |
x = nd_reducebase(x); |
| for ( r0 = 0; x; x = NEXT(x) ) { |
x = nd_reduceall(m,x); |
| |
for ( r0 = 0, t = x; t; t = NEXT(t) ) { |
| NEXTNODE(r0,r); |
NEXTNODE(r0,r); |
| a = ndtodp(nd_ps[(int)BDY(x)]); |
if ( m ) { |
| _dtop_mod(CO,vv,a,(P *)&BDY(r)); |
a = ndvtodp(m,BDY(t)); |
| |
_dtop_mod(CO,vv,a,(P *)&BDY(r)); |
| |
} else { |
| |
a = ndvtodp(m,BDY(t)); |
| |
dtop(CO,vv,a,(P *)&BDY(r)); |
| |
} |
| } |
} |
| if ( r0 ) NEXT(r) = 0; |
if ( r0 ) NEXT(r) = 0; |
| MKLIST(*rp,r0); |
MKLIST(*rp,r0); |
| fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n", |
|
| nd_found,nd_notfirst,nd_create); |
|
| } |
} |
| |
|
| |
void nd_gr_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp) |
| |
{ |
| |
struct order_spec ord1; |
| |
VL fv,vv,vc; |
| |
NODE fd,fd0,in0,in,r,r0,t,s,cand; |
| |
int m,nocheck,nvar,mindex; |
| |
DP a,b,c,h; |
| |
P p; |
| |
|
| |
get_vars((Obj)f,&fv); pltovl(v,&vv); |
| |
nvar = length(vv); |
| |
nocheck = 0; |
| |
mindex = 0; |
| |
|
| |
/* setup modulus */ |
| |
if ( trace < 0 ) { |
| |
trace = -trace; |
| |
nocheck = 1; |
| |
} |
| |
m = trace > 1 ? trace : get_lprime(mindex); |
| |
|
| |
initd(ord); |
| |
if ( homo ) { |
| |
homogenize_order(ord,nd_nvar,&ord1); |
| |
for ( fd0 = 0, in0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
| |
ptod(CO,vv,(P)BDY(t),&c); |
| |
if ( c ) { |
| |
dp_homo(c,&h); NEXTNODE(fd0,fd); BDY(fd) = (pointer)h; |
| |
NEXTNODE(in0,in); BDY(in) = (pointer)c; |
| |
} |
| |
} |
| |
if ( fd0 ) NEXT(fd) = 0; |
| |
if ( in0 ) NEXT(in) = 0; |
| |
} else { |
| |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
| |
ptod(CO,vv,(P)BDY(t),&c); |
| |
if ( c ) { |
| |
NEXTNODE(fd0,fd); BDY(fd) = (pointer)c; |
| |
} |
| |
} |
| |
if ( fd0 ) NEXT(fd) = 0; |
| |
in0 = fd0; |
| |
} |
| |
while ( 1 ) { |
| |
if ( homo ) { |
| |
nd_init_ord(&ord1); |
| |
initd(&ord1); |
| |
nd_nvar = nvar+1; |
| |
} else { |
| |
nd_init_ord(ord); |
| |
nd_nvar = nvar; |
| |
} |
| |
nd_setup(m,1,fd0); |
| |
cand = nd_gb_trace(m); |
| |
if ( !cand ) { |
| |
/* failure */ |
| |
if ( trace > 1 ) { |
| |
*rp = 0; return; |
| |
} else |
| |
m = get_lprime(++mindex); |
| |
continue; |
| |
} |
| |
|
| |
if ( homo ) { |
| |
/* dehomogenization */ |
| |
for ( t = cand; t; t = NEXT(t) ) |
| |
ndv_dehomogenize((NDV)BDY(t),ord); |
| |
nd_nvar = nvar; |
| |
initd(ord); |
| |
nd_init_ord(ord); |
| |
nd_setup_parameters(); |
| |
} |
| |
cand = nd_reducebase(cand); |
| |
fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n", |
| |
nd_found,nd_notfirst,nd_create); |
| |
cand = nd_reduceall(0,cand); |
| |
initd(ord); |
| |
for ( r0 = 0; cand; cand = NEXT(cand) ) { |
| |
NEXTNODE(r0,r); |
| |
BDY(r) = (pointer)ndvtodp(0,(NDV)BDY(cand)); |
| |
} |
| |
if ( r0 ) NEXT(r) = 0; |
| |
cand = r0; |
| |
if ( nocheck || nd_check_candidate(in0,cand) ) |
| |
/* success */ |
| |
break; |
| |
else if ( trace > 1 ) { |
| |
/* failure */ |
| |
*rp = 0; return; |
| |
} else |
| |
/* try the next modulus */ |
| |
m = get_lprime(++mindex); |
| |
} |
| |
/* dp->p */ |
| |
for ( r = cand; r; r = NEXT(r) ) { |
| |
dtop(CO,vv,BDY(r),&p); |
| |
BDY(r) = (pointer)p; |
| |
} |
| |
MKLIST(*rp,cand); |
| |
} |
| |
|
| void dltondl(int n,DL dl,unsigned int *r) |
void dltondl(int n,DL dl,unsigned int *r) |
| { |
{ |
| unsigned int *d; |
unsigned int *d; |
| int i; |
int i,j,l,s,ord_l,ord_o; |
| |
struct order_pair *op; |
| |
|
| d = dl->d; |
d = dl->d; |
| bzero(r,nd_wpd*sizeof(unsigned int)); |
for ( i = 0; i < nd_wpd; i++ ) r[i] = 0; |
| if ( is_rlex ) |
if ( nd_blockmask ) { |
| for ( i = 0; i < n; i++ ) |
l = nd_blockmask->n; |
| r[(n-1-i)/nd_epw] |= (d[i]<<((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe)); |
op = nd_blockmask->order_pair; |
| else |
for ( j = 0, s = 0; j < l; j++ ) { |
| for ( i = 0; i < n; i++ ) |
ord_o = op[j].order; |
| r[i/nd_epw] |= d[i]<<((nd_epw-(i%nd_epw)-1)*nd_bpe); |
ord_l = op[j].length; |
| |
if ( !ord_o ) |
| |
for ( i = 0; i < ord_l; i++ ) |
| |
PUT_EXP(r,s+ord_l-i-1,d[s+i]); |
| |
else |
| |
for ( i = 0; i < ord_l; i++ ) |
| |
PUT_EXP(r,s+i,d[s+i]); |
| |
s += ord_l; |
| |
} |
| |
TD(r) = ndl_weight(r); |
| |
for ( j = 0; j < l; j++ ) |
| |
r[j+1] = ndl_weight_mask(r,j); |
| |
} else { |
| |
if ( nd_isrlex ) |
| |
for ( i = 0; i < n; i++ ) PUT_EXP(r,n-1-i,d[i]); |
| |
else |
| |
for ( i = 0; i < n; i++ ) PUT_EXP(r,i,d[i]); |
| |
TD(r) = ndl_weight(r); |
| |
} |
| } |
} |
| |
|
| DL ndltodl(int n,int td,unsigned int *ndl) |
DL ndltodl(int n,unsigned int *ndl) |
| { |
{ |
| DL dl; |
DL dl; |
| int *d; |
int *d; |
| int i; |
int i,j,l,s,ord_l,ord_o; |
| |
struct order_pair *op; |
| |
|
| NEWDL(dl,n); |
NEWDL(dl,n); |
| dl->td = td; |
dl->td = TD(ndl); |
| d = dl->d; |
d = dl->d; |
| if ( is_rlex ) |
if ( nd_blockmask ) { |
| for ( i = 0; i < n; i++ ) |
l = nd_blockmask->n; |
| d[i] = (ndl[(n-1-i)/nd_epw]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe)) |
op = nd_blockmask->order_pair; |
| &((1<<nd_bpe)-1); |
for ( j = 0, s = 0; j < l; j++ ) { |
| else |
ord_o = op[j].order; |
| for ( i = 0; i < n; i++ ) |
ord_l = op[j].length; |
| d[i] = (ndl[i/nd_epw]>>((nd_epw-(i%nd_epw)-1)*nd_bpe)) |
if ( !ord_o ) |
| &((1<<nd_bpe)-1); |
for ( i = 0; i < ord_l; i++ ) |
| |
d[s+i] = GET_EXP(ndl,s+ord_l-i-1); |
| |
else |
| |
for ( i = 0; i < ord_l; i++ ) |
| |
d[s+i] = GET_EXP(ndl,s+i); |
| |
s += ord_l; |
| |
} |
| |
} else { |
| |
if ( nd_isrlex ) |
| |
for ( i = 0; i < n; i++ ) |
| |
d[i] = GET_EXP(ndl,n-1-i); |
| |
else |
| |
for ( i = 0; i < n; i++ ) |
| |
d[i] = GET_EXP(ndl,i); |
| |
} |
| return dl; |
return dl; |
| } |
} |
| |
|
| ND dptond(DP p) |
ND dptond(int mod,DP p) |
| { |
{ |
| ND d; |
ND d; |
| NM m0,m; |
NM m0,m; |
| MP t; |
MP t; |
| int n; |
int n,l; |
| |
|
| if ( !p ) |
if ( !p ) |
| return 0; |
return 0; |
| n = NV(p); |
n = NV(p); |
| m0 = 0; |
m0 = 0; |
| for ( t = BDY(p); t; t = NEXT(t) ) { |
for ( t = BDY(p), l = 0; t; t = NEXT(t), l++ ) { |
| NEXTNM(m0,m); |
NEXTNM(m0,m); |
| m->c = ITOS(t->c); |
if ( mod ) CM(m) = ITOS(C(t)); |
| m->td = t->dl->td; |
else CQ(m) = (Q)C(t); |
| dltondl(n,t->dl,m->dl); |
dltondl(n,DL(t),DL(m)); |
| } |
} |
| NEXT(m) = 0; |
NEXT(m) = 0; |
| MKND(n,m0,d); |
MKND(n,m0,l,d); |
| d->nv = n; |
SG(d) = SG(p); |
| d->sugar = p->sugar; |
|
| return d; |
return d; |
| } |
} |
| |
|
| DP ndtodp(ND p) |
DP ndtodp(int mod,ND p) |
| { |
{ |
| DP d; |
DP d; |
| MP m0,m; |
MP m0,m; |
| Line 1786 DP ndtodp(ND p) |
|
| Line 2224 DP ndtodp(ND p) |
|
| m0 = 0; |
m0 = 0; |
| for ( t = BDY(p); t; t = NEXT(t) ) { |
for ( t = BDY(p); t; t = NEXT(t) ) { |
| NEXTMP(m0,m); |
NEXTMP(m0,m); |
| m->c = STOI(t->c); |
if ( mod ) C(m) = STOI(CM(t)); |
| m->dl = ndltodl(n,t->td,t->dl); |
else C(m) = (P)CQ(t); |
| |
DL(m) = ndltodl(n,DL(t)); |
| } |
} |
| NEXT(m) = 0; |
NEXT(m) = 0; |
| MKDP(n,m0,d); |
MKDP(n,m0,d); |
| d->sugar = p->sugar; |
SG(d) = SG(p); |
| return d; |
return d; |
| } |
} |
| |
|
| void ndl_print(unsigned int *dl) |
void ndl_print(unsigned int *dl) |
| { |
{ |
| int n; |
int n; |
| int i; |
int i,j,l,ord_o,ord_l,s,s0; |
| |
struct order_pair *op; |
| |
|
| n = nd_nvar; |
n = nd_nvar; |
| printf("<<"); |
printf("<<"); |
| if ( is_rlex ) |
if ( nd_blockmask ) { |
| for ( i = 0; i < n; i++ ) |
l = nd_blockmask->n; |
| printf(i==n-1?"%d":"%d,", |
op = nd_blockmask->order_pair; |
| (dl[(n-1-i)/nd_epw]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe)) |
for ( j = 0, s = s0 = 0; j < l; j++ ) { |
| &((1<<nd_bpe)-1)); |
ord_o = op[j].order; |
| else |
ord_l = op[j].length; |
| for ( i = 0; i < n; i++ ) |
if ( !ord_o ) |
| printf(i==n-1?"%d":"%d,", |
for ( i = 0, s0 += ord_l; i < ord_l; i++, s++ ) |
| (dl[i/nd_epw]>>((nd_epw-(i%nd_epw)-1)*nd_bpe)) |
printf(s==n-1?"%d":"%d,",GET_EXP(dl,s0-i-1)); |
| &((1<<nd_bpe)-1)); |
else |
| |
for ( i = 0; i < ord_l; i++, s++ ) |
| |
printf(s==n-1?"%d":"%d,",GET_EXP(dl,s)); |
| |
} |
| |
} else { |
| |
if ( nd_isrlex ) |
| |
for ( i = 0; i < n; i++ ) printf(i==n-1?"%d":"%d,",GET_EXP(dl,n-1-i)); |
| |
else |
| |
for ( i = 0; i < n; i++ ) printf(i==n-1?"%d":"%d,",GET_EXP(dl,i)); |
| |
} |
| printf(">>"); |
printf(">>"); |
| } |
} |
| |
|
| Line 1823 void nd_print(ND p) |
|
| Line 2272 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*",m->c); |
printf("+%d*",CM(m)); |
| ndl_print(m->dl); |
ndl_print(DL(m)); |
| } |
} |
| printf("\n"); |
printf("\n"); |
| } |
} |
| } |
} |
| |
|
| |
void nd_print_q(ND p) |
| |
{ |
| |
NM m; |
| |
|
| |
if ( !p ) |
| |
printf("0\n"); |
| |
else { |
| |
for ( m = BDY(p); m; m = NEXT(m) ) { |
| |
printf("+"); |
| |
printexpr(CO,CQ(m)); |
| |
printf("*"); |
| |
ndl_print(DL(m)); |
| |
} |
| |
printf("\n"); |
| |
} |
| |
} |
| |
|
| void ndp_print(ND_pairs d) |
void ndp_print(ND_pairs d) |
| { |
{ |
| ND_pairs t; |
ND_pairs t; |
| |
|
| for ( t = d; t; t = NEXT(t) ) { |
for ( t = d; t; t = NEXT(t) ) printf("%d,%d ",t->i1,t->i2); |
| printf("%d,%d ",t->i1,t->i2); |
|
| } |
|
| printf("\n"); |
printf("\n"); |
| } |
} |
| |
|
| void nd_monic(ND p) |
void nd_removecont(int mod,ND p) |
| { |
{ |
| if ( !p ) |
int i,n; |
| return; |
Q *w; |
| else |
Q dvr,t; |
| nd_mul_c(p,invm(HC(p),nd_mod)); |
NM m; |
| |
struct oVECT v; |
| |
N q,r; |
| |
|
| |
if ( mod ) nd_mul_c(mod,p,invm(HCM(p),mod)); |
| |
else { |
| |
for ( m = BDY(p), n = 0; m; m = NEXT(m), n++ ); |
| |
w = (Q *)ALLOCA(n*sizeof(Q)); |
| |
v.len = n; |
| |
v.body = (pointer *)w; |
| |
for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CQ(m); |
| |
removecont_array(w,n); |
| |
for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) CQ(m) = w[i]; |
| |
} |
| } |
} |
| |
|
| void nd_mul_c(ND p,int mul) |
void nd_removecont2(ND p1,ND p2) |
| { |
{ |
| |
int i,n1,n2,n; |
| |
Q *w; |
| |
Q dvr,t; |
| NM m; |
NM m; |
| |
struct oVECT v; |
| |
N q,r; |
| |
|
| |
if ( !p1 ) { |
| |
nd_removecont(0,p2); return; |
| |
} else if ( !p2 ) { |
| |
nd_removecont(0,p1); return; |
| |
} |
| |
n1 = nd_length(p1); |
| |
n2 = nd_length(p2); |
| |
n = n1+n2; |
| |
w = (Q *)ALLOCA(n*sizeof(Q)); |
| |
v.len = n; |
| |
v.body = (pointer *)w; |
| |
for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) w[i] = CQ(m); |
| |
for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = CQ(m); |
| |
removecont_array(w,n); |
| |
for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) CQ(m) = w[i]; |
| |
for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) CQ(m) = w[i]; |
| |
} |
| |
|
| |
void ndv_removecont(int mod,NDV p) |
| |
{ |
| |
int i,len; |
| |
Q *w; |
| |
Q dvr,t; |
| |
NMV m; |
| |
|
| |
if ( mod ) |
| |
ndv_mul_c(mod,p,invm(HCM(p),mod)); |
| |
else { |
| |
len = p->len; |
| |
w = (Q *)ALLOCA(len*sizeof(Q)); |
| |
for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) w[i] = CQ(m); |
| |
sortbynm(w,len); |
| |
qltozl(w,len,&dvr); |
| |
for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) { |
| |
divq(CQ(m),dvr,&t); CQ(m) = t; |
| |
} |
| |
} |
| |
} |
| |
|
| |
void ndv_dehomogenize(NDV p,struct order_spec *ord) |
| |
{ |
| |
int i,j,adj,len,newnvar,newwpd,newadv,newexporigin; |
| |
Q *w; |
| |
Q dvr,t; |
| |
NMV m,r; |
| |
#define NEWADV(m) (m = (NMV)(((char *)m)+newadv)) |
| |
|
| |
len = p->len; |
| |
newnvar = nd_nvar-1; |
| |
newexporigin = nd_get_exporigin(ord); |
| |
newwpd = newnvar/nd_epw+(newnvar%nd_epw?1:0)+newexporigin; |
| |
for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) |
| |
ndl_dehomogenize(DL(m)); |
| |
if ( newwpd != nd_wpd ) { |
| |
newadv = sizeof(struct oNMV)+(newwpd-1)*sizeof(unsigned int); |
| |
for ( m = r = BDY(p), i = 0; i < len; NMV_ADV(m), NEWADV(r), i++ ) { |
| |
CQ(r) = CQ(m); |
| |
for ( j = 0; j < newexporigin; j++ ) DL(r)[j] = DL(m)[j]; |
| |
adj = nd_exporigin-newexporigin; |
| |
for ( ; j < newwpd; j++ ) DL(r)[j] = DL(m)[j+adj]; |
| |
} |
| |
} |
| |
NV(p)--; |
| |
} |
| |
|
| |
void removecont_array(Q *c,int n) |
| |
{ |
| |
struct oVECT v; |
| |
Q d0,d1,a,u,u1,gcd; |
| |
int i; |
| |
N qn,rn,gn; |
| |
Q *q,*r; |
| |
|
| |
q = (Q *)ALLOCA(n*sizeof(Q)); |
| |
r = (Q *)ALLOCA(n*sizeof(Q)); |
| |
v.id = O_VECT; v.len = n; v.body = (pointer *)c; |
| |
igcdv_estimate(&v,&d0); |
| |
for ( i = 0; i < n; i++ ) { |
| |
divn(NM(c[i]),NM(d0),&qn,&rn); |
| |
NTOQ(qn,SGN(c[i])*SGN(d0),q[i]); |
| |
NTOQ(rn,SGN(c[i]),r[i]); |
| |
} |
| |
for ( i = 0; i < n; i++ ) if ( r[i] ) break; |
| |
if ( i < n ) { |
| |
v.id = O_VECT; v.len = n; v.body = (pointer *)r; |
| |
igcdv(&v,&d1); |
| |
gcdn(NM(d0),NM(d1),&gn); NTOQ(gn,1,gcd); |
| |
divsn(NM(d0),gn,&qn); NTOQ(qn,1,a); |
| |
for ( i = 0; i < n; i++ ) { |
| |
mulq(a,q[i],&u); |
| |
if ( r[i] ) { |
| |
divsn(NM(r[i]),gn,&qn); NTOQ(qn,SGN(r[i]),u1); |
| |
addq(u,u1,&q[i]); |
| |
} else |
| |
q[i] = u; |
| |
} |
| |
} |
| |
for ( i = 0; i < n; i++ ) c[i] = q[i]; |
| |
} |
| |
|
| |
void nd_mul_c(int mod,ND p,int mul) |
| |
{ |
| |
NM m; |
| int c,c1; |
int c,c1; |
| |
|
| if ( !p ) |
if ( !p ) return; |
| return; |
|
| for ( m = BDY(p); m; m = NEXT(m) ) { |
for ( m = BDY(p); m; m = NEXT(m) ) { |
| c1 = C(m); |
c1 = CM(m); |
| DMAR(c1,mul,0,nd_mod,c); |
DMAR(c1,mul,0,mod,c); |
| C(m) = c; |
CM(m) = c; |
| } |
} |
| } |
} |
| |
|
| |
void nd_mul_c_q(ND p,Q mul) |
| |
{ |
| |
NM m; |
| |
Q c; |
| |
|
| |
if ( !p ) return; |
| |
for ( m = BDY(p); m; m = NEXT(m) ) { |
| |
mulq(CQ(m),mul,&c); CQ(m) = c; |
| |
} |
| |
} |
| |
|
| void nd_free(ND p) |
void nd_free(ND p) |
| { |
{ |
| NM t,s; |
NM t,s; |
| |
|
| if ( !p ) |
if ( !p ) return; |
| return; |
|
| t = BDY(p); |
t = BDY(p); |
| while ( t ) { |
while ( t ) { |
| s = NEXT(t); |
s = NEXT(t); |
| Line 1877 void nd_free(ND p) |
|
| Line 2472 void nd_free(ND p) |
|
| FREEND(p); |
FREEND(p); |
| } |
} |
| |
|
| void nd_append_red(unsigned int *d,int td,int i) |
void ndv_free(NDV p) |
| { |
{ |
| NM m,m0; |
GC_free(BDY(p)); |
| |
} |
| |
|
| |
void nd_append_red(unsigned int *d,int i) |
| |
{ |
| |
RHist m,m0; |
| int h; |
int h; |
| |
|
| NEWNM(m); |
NEWRHist(m); |
| h = ndl_hash_value(td,d); |
h = ndl_hash_value(d); |
| m->c = i; |
m->index = i; |
| m->td = td; |
ndl_copy(d,DL(m)); |
| bcopy(d,m->dl,nd_wpd*sizeof(unsigned int)); |
|
| NEXT(m) = nd_red[h]; |
NEXT(m) = nd_red[h]; |
| nd_red[h] = m; |
nd_red[h] = m; |
| } |
} |
| |
|
| unsigned int *nd_compute_bound(ND p) |
unsigned int *dp_compute_bound(DP p) |
| { |
{ |
| |
unsigned int *d,*d1,*d2,*t; |
| |
MP m; |
| |
int i,l; |
| |
|
| |
if ( !p ) |
| |
return 0; |
| |
d1 = (unsigned int *)ALLOCA(nd_nvar*sizeof(unsigned int)); |
| |
d2 = (unsigned int *)ALLOCA(nd_nvar*sizeof(unsigned int)); |
| |
m = BDY(p); |
| |
d = DL(m)->d; |
| |
for ( i = 0; i < nd_nvar; i++ ) d1[i] = d[i]; |
| |
for ( m = NEXT(BDY(p)); m; m = NEXT(m) ) { |
| |
d = DL(m)->d; |
| |
for ( i = 0; i < nd_nvar; i++ ) |
| |
d2[i] = d[i] > d1[i] ? d[i] : d1[i]; |
| |
t = d1; d1 = d2; d2 = t; |
| |
} |
| |
l = (nd_nvar+31); |
| |
t = (unsigned int *)MALLOC_ATOMIC(l*sizeof(unsigned int)); |
| |
for ( i = 0; i < nd_nvar; i++ ) t[i] = d1[i]; |
| |
for ( ; i < l; i++ ) t[i] = 0; |
| |
return t; |
| |
} |
| |
|
| |
unsigned int *ndv_compute_bound(NDV p) |
| |
{ |
| unsigned int *d1,*d2,*t; |
unsigned int *d1,*d2,*t; |
| NM m; |
int i,l,len; |
| |
NMV m; |
| |
|
| if ( !p ) |
if ( !p ) |
| return 0; |
return 0; |
| d1 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
d1 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
| d2 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
d2 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
| bcopy(HDL(p),d1,nd_wpd*sizeof(unsigned int)); |
len = LEN(p); |
| for ( m = NEXT(BDY(p)); m; m = NEXT(m) ) { |
m = BDY(p); ndl_copy(DL(m),d1); NMV_ADV(m); |
| ndl_lcm(m->dl,d1,d2); |
for ( i = 1; i < len; i++, NMV_ADV(m) ) { |
| |
ndl_lcm(DL(m),d1,d2); |
| t = d1; d1 = d2; d2 = t; |
t = d1; d1 = d2; d2 = t; |
| } |
} |
| t = (unsigned int *)MALLOC_ATOMIC(nd_wpd*sizeof(unsigned int)); |
l = nd_nvar+31; |
| bcopy(d1,t,nd_wpd*sizeof(unsigned int)); |
t = (unsigned int *)MALLOC_ATOMIC(l*sizeof(unsigned int)); |
| |
for ( i = 0; i < nd_nvar; i++ ) t[i] = GET_EXP(d1,i); |
| |
for ( ; i < l; i++ ) t[i] = 0; |
| return t; |
return t; |
| } |
} |
| |
|
| |
int nd_get_exporigin(struct order_spec *ord) |
| |
{ |
| |
switch ( ord->id ) { |
| |
case 0: |
| |
return 1; |
| |
case 1: |
| |
/* block order */ |
| |
/* d[0]:weight d[1]:w0,...,d[nd_exporigin-1]:w(n-1) */ |
| |
return ord->ord.block.length+1; |
| |
case 2: |
| |
error("nd_get_exporigin : matrix order is not supported yet."); |
| |
} |
| |
} |
| |
|
| void nd_setup_parameters() { |
void nd_setup_parameters() { |
| int i; |
int i,n,elen; |
| |
|
| nd_epw = (sizeof(unsigned int)*8)/nd_bpe; |
nd_epw = (sizeof(unsigned int)*8)/nd_bpe; |
| nd_wpd = 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_wpd = nd_exporigin+elen; |
| |
nd_epos = (EPOS)MALLOC_ATOMIC(nd_nvar*sizeof(struct oEPOS)); |
| |
for ( i = 0; i < nd_nvar; i++ ) { |
| |
nd_epos[i].i = nd_exporigin + i/nd_epw; |
| |
nd_epos[i].s = (nd_epw-(i%nd_epw)-1)*nd_bpe; |
| |
} |
| if ( nd_bpe < 32 ) { |
if ( nd_bpe < 32 ) { |
| nd_mask0 = (1<<nd_bpe)-1; |
nd_mask0 = (1<<nd_bpe)-1; |
| } else { |
} else { |
| Line 1926 void nd_setup_parameters() { |
|
| Line 2577 void nd_setup_parameters() { |
|
| nd_mask[nd_epw-i-1] = (nd_mask0<<(i*nd_bpe)); |
nd_mask[nd_epw-i-1] = (nd_mask0<<(i*nd_bpe)); |
| nd_mask1 |= (1<<(nd_bpe-1))<<(i*nd_bpe); |
nd_mask1 |= (1<<(nd_bpe-1))<<(i*nd_bpe); |
| } |
} |
| |
nm_adv = sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int); |
| nmv_adv = sizeof(struct oNMV)+(nd_wpd-1)*sizeof(unsigned int); |
nmv_adv = sizeof(struct oNMV)+(nd_wpd-1)*sizeof(unsigned int); |
| |
nd_blockmask = nd_create_blockmask(nd_ord); |
| } |
} |
| |
|
| ND_pairs nd_reconstruct(ND_pairs d) |
ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d) |
| { |
{ |
| int i,obpe; |
int i,obpe,oadv,h; |
| NM prev_nm_free_list; |
NM prev_nm_free_list; |
| |
RHist mr0,mr; |
| |
RHist r; |
| |
RHist *old_red; |
| ND_pairs s0,s,t,prev_ndp_free_list; |
ND_pairs s0,s,t,prev_ndp_free_list; |
| |
EPOS oepos; |
| |
|
| obpe = nd_bpe; |
obpe = nd_bpe; |
| switch ( nd_bpe ) { |
oadv = nmv_adv; |
| case 4: nd_bpe = 6; break; |
oepos = nd_epos; |
| case 6: nd_bpe = 8; break; |
if ( obpe < 4 ) nd_bpe = 4; |
| case 8: nd_bpe = 16; break; |
else if ( obpe < 6 ) nd_bpe = 6; |
| case 16: nd_bpe = 32; break; |
else if ( obpe < 8 ) nd_bpe = 8; |
| } |
else if ( obpe < 16 ) nd_bpe = 16; |
| |
else if ( obpe < 32 ) nd_bpe = 32; |
| |
else error("nd_reconstruct : exponent too large"); |
| |
|
| nd_setup_parameters(); |
nd_setup_parameters(); |
| 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; |
| _ndp_free_list = 0; |
_ndp_free_list = 0; |
| for ( i = 0; i < nd_psn; i++ ) { |
if ( mod != 0 ) |
| nd_ps[i] = nd_dup(nd_ps[i],obpe); |
for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_ps[i],obpe,oadv,oepos); |
| nd_psv[i] = ndtondv(nd_ps[i]); |
if ( !mod || trace ) |
| nd_bound[i] = nd_compute_bound(nd_ps[i]); |
for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_psq[i],obpe,oadv,oepos); |
| } |
|
| s0 = 0; |
s0 = 0; |
| for ( t = d; t; t = NEXT(t) ) { |
for ( t = d; t; t = NEXT(t) ) { |
| NEXTND_pairs(s0,s); |
NEXTND_pairs(s0,s); |
| s->i1 = t->i1; |
s->i1 = t->i1; |
| s->i2 = t->i2; |
s->i2 = t->i2; |
| s->td = t->td; |
SG(s) = SG(t); |
| s->sugar = t->sugar; |
ndl_reconstruct(obpe,oepos,LCM(t),LCM(s)); |
| ndl_dup(obpe,t->lcm,s->lcm); |
|
| } |
} |
| |
|
| |
old_red = (RHist *)ALLOCA(REDTAB_LEN*sizeof(RHist)); |
| |
for ( i = 0; i < REDTAB_LEN; i++ ) { |
| |
old_red[i] = nd_red[i]; |
| |
nd_red[i] = 0; |
| |
} |
| |
for ( i = 0; i < REDTAB_LEN; i++ ) |
| |
for ( r = old_red[i]; r; r = NEXT(r) ) { |
| |
NEWRHist(mr); |
| |
mr->index = r->index; |
| |
SG(mr) = SG(r); |
| |
ndl_reconstruct(obpe,oepos,DL(r),DL(mr)); |
| |
h = ndl_hash_value(DL(mr)); |
| |
NEXT(mr) = nd_red[h]; |
| |
nd_red[h] = mr; |
| |
} |
| |
for ( i = 0; i < REDTAB_LEN; i++ ) old_red[i] = 0; |
| |
old_red = 0; |
| |
for ( i = 0; i < nd_psn; i++ ) { |
| |
NEWRHist(r); SG(r) = SG(nd_psh[i]); |
| |
ndl_reconstruct(obpe,oepos,DL(nd_psh[i]),DL(r)); |
| |
nd_psh[i] = r; |
| |
} |
| 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; |
| BDY(ndv_red) = (NMV)REALLOC(BDY(ndv_red),nmv_len*nmv_adv); |
|
| GC_gcollect(); |
GC_gcollect(); |
| return s0; |
return s0; |
| } |
} |
| |
|
| void ndl_dup(int obpe,unsigned int *d,unsigned int *r) |
void nd_reconstruct_direct(int mod,NDV *ps,int len) |
| { |
{ |
| int n,i,ei,oepw,cepw,cbpe; |
int i,obpe,oadv,h; |
| |
unsigned int **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 < 4 ) nd_bpe = 4; |
| |
else if ( obpe < 6 ) nd_bpe = 6; |
| |
else if ( obpe < 8 ) nd_bpe = 8; |
| |
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(); |
| |
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(int obpe,EPOS oepos,unsigned int *d,unsigned int *r) |
| |
{ |
| |
int n,i,ei,oepw,omask0,j,s,ord_l,ord_o,l; |
| |
struct order_pair *op; |
| |
#define GET_EXP_OLD(d,a) (((d)[oepos[a].i]>>oepos[a].s)&omask0) |
| |
#define PUT_EXP_OLD(r,a,e) ((r)[oepos[a].i] |= ((e)<<oepos[a].s)) |
| |
|
| n = nd_nvar; |
n = nd_nvar; |
| oepw = (sizeof(unsigned int)*8)/obpe; |
oepw = (sizeof(unsigned int)*8)/obpe; |
| cepw = nd_epw; |
omask0 = (1<<obpe)-1; |
| cbpe = nd_bpe; |
TD(r) = TD(d); |
| if ( is_rlex ) |
for ( i = nd_exporigin; i < nd_wpd; i++ ) r[i] = 0; |
| for ( i = 0; i < n; i++ ) { |
if ( nd_blockmask ) { |
| ei = (d[(n-1-i)/oepw]>>((oepw-((n-1-i)%oepw)-1)*obpe)) |
l = nd_blockmask->n; |
| &((1<<obpe)-1); |
op = nd_blockmask->order_pair; |
| r[(n-1-i)/cepw] |= (ei<<((cepw-((n-1-i)%cepw)-1)*cbpe)); |
for ( i = 1; i < nd_exporigin; i++ ) |
| |
r[i] = d[i]; |
| |
for ( j = 0, s = 0; j < l; j++ ) { |
| |
ord_o = op[j].order; |
| |
ord_l = op[j].length; |
| |
if ( !ord_o ) |
| |
for ( i = 0; i < ord_l; i++ ) { |
| |
ei = GET_EXP_OLD(d,s+ord_l-i-1); |
| |
PUT_EXP(r,s+ord_l-i-1,ei); |
| |
} |
| |
else |
| |
for ( i = 0; i < ord_l; i++ ) { |
| |
ei = GET_EXP_OLD(d,s+i); |
| |
PUT_EXP(r,s+i,ei); |
| |
} |
| |
s += ord_l; |
| } |
} |
| else |
} else { |
| for ( i = 0; i < n; i++ ) { |
if ( nd_isrlex ) |
| ei = (d[i/oepw]>>((oepw-(i%oepw)-1)*obpe)) |
for ( i = 0; i < n; i++ ) { |
| &((1<<obpe)-1); |
ei = GET_EXP_OLD(d,n-1-i); |
| r[i/cepw] |= (ei<<((cepw-(i%cepw)-1)*cbpe)); |
PUT_EXP(r,n-1-i,ei); |
| } |
} |
| |
else |
| |
for ( i = 0; i < n; i++ ) { |
| |
ei = GET_EXP_OLD(d,i); |
| |
PUT_EXP(r,i,ei); |
| |
} |
| |
} |
| } |
} |
| |
|
| ND nd_dup(ND p,int obpe) |
ND nd_copy(ND p) |
| { |
{ |
| NM m,mr,mr0; |
NM m,mr,mr0; |
| int c,n; |
int c,n; |
| Line 2000 ND nd_dup(ND p,int obpe) |
|
| Line 2735 ND nd_dup(ND p,int obpe) |
|
| if ( !p ) |
if ( !p ) |
| return 0; |
return 0; |
| else { |
else { |
| n = NV(p); m = BDY(p); |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
| for ( mr0 = 0; m; m = NEXT(m) ) { |
|
| NEXTNM(mr0,mr); |
NEXTNM(mr0,mr); |
| C(mr) = C(m); |
CM(mr) = CM(m); |
| mr->td = m->td; |
ndl_copy(DL(m),DL(mr)); |
| ndl_dup(obpe,m->dl,mr->dl); |
|
| } |
} |
| NEXT(mr) = 0; |
NEXT(mr) = 0; |
| MKND(NV(p),mr0,r); |
MKND(NV(p),mr0,LEN(p),r); |
| r->sugar = p->sugar; |
SG(r) = SG(p); |
| return r; |
return r; |
| } |
} |
| } |
} |
| |
|
| NDV ndtondv(ND p) |
int nd_sp(int mod,ND_pairs p,ND *rp) |
| { |
{ |
| |
NM m; |
| |
NDV p1,p2; |
| |
ND t1,t2; |
| |
unsigned int *lcm; |
| |
int td; |
| |
|
| |
if ( mod ) { |
| |
p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2]; |
| |
} else { |
| |
p1 = nd_psq[p->i1]; p2 = nd_psq[p->i2]; |
| |
} |
| |
lcm = LCM(p); |
| |
NEWNM(m); |
| |
CQ(m) = HCQ(p2); |
| |
ndl_sub(lcm,HDL(p1),DL(m)); |
| |
if ( ndl_check_bound2(p->i1,DL(m)) ) return 0; |
| |
t1 = ndv_mul_nm(mod,p1,m); |
| |
if ( mod ) CM(m) = mod-HCM(p1); |
| |
else chsgnq(HCQ(p1),&CQ(m)); |
| |
ndl_sub(lcm,HDL(p2),DL(m)); |
| |
if ( ndl_check_bound2(p->i2,DL(m)) ) { |
| |
nd_free(t1); |
| |
return 0; |
| |
} |
| |
t2 = ndv_mul_nm(mod,p2,m); |
| |
*rp = nd_add(mod,t1,t2); |
| |
FREENM(m); |
| |
return 1; |
| |
} |
| |
|
| |
void ndv_mul_c(int mod,NDV p,int mul) |
| |
{ |
| |
NMV m; |
| |
int c,c1,len,i; |
| |
|
| |
if ( !p ) return; |
| |
len = LEN(p); |
| |
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) |
| |
{ |
| |
NMV m; |
| |
Q c; |
| |
int len,i; |
| |
|
| |
if ( !p ) return; |
| |
len = LEN(p); |
| |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
| |
mulq(CQ(m),mul,&c); CQ(m) = c; |
| |
} |
| |
} |
| |
|
| |
ND ndv_mul_nm(int mod,NDV p,NM m0) |
| |
{ |
| |
NM mr,mr0; |
| |
NMV m; |
| |
unsigned int *d,*dt,*dm; |
| |
int c,n,td,i,c1,c2,len; |
| |
Q q; |
| |
ND r; |
| |
|
| |
if ( !p ) return 0; |
| |
else { |
| |
n = NV(p); m = BDY(p); |
| |
d = DL(m0); |
| |
len = LEN(p); |
| |
mr0 = 0; |
| |
td = TD(d); |
| |
if ( mod ) { |
| |
c = CM(m0); |
| |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
| |
NEXTNM(mr0,mr); |
| |
c1 = CM(m); |
| |
DMAR(c1,c,0,mod,c2); |
| |
CM(mr) = c2; |
| |
ndl_add(DL(m),d,DL(mr)); |
| |
} |
| |
} else { |
| |
q = CQ(m0); |
| |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
| |
NEXTNM(mr0,mr); |
| |
mulq(CQ(m),q,&CQ(mr)); |
| |
ndl_add(DL(m),d,DL(mr)); |
| |
} |
| |
} |
| |
NEXT(mr) = 0; |
| |
MKND(NV(p),mr0,len,r); |
| |
SG(r) = SG(p) + TD(d); |
| |
return r; |
| |
} |
| |
} |
| |
|
| |
void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos) |
| |
{ |
| |
NMV m,mr,mr0,t; |
| |
int len,i,k; |
| |
|
| |
#define NMV_OPREV(m) (m = (NMV)(((char *)m)-oadv)) |
| |
#define NMV_PREV(m) (m = (NMV)(((char *)m)-nmv_adv)) |
| |
|
| |
if ( p ) { |
| |
m = BDY(p); len = LEN(p); |
| |
mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p); |
| |
m = (NMV)((char *)mr0+(len-1)*oadv); |
| |
mr = (NMV)((char *)mr0+(len-1)*nmv_adv); |
| |
t = (NMV)ALLOCA(nmv_adv); |
| |
for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) { |
| |
CQ(t) = CQ(m); |
| |
for ( k = 0; k < nd_wpd; k++ ) DL(t)[k] = 0; |
| |
ndl_reconstruct(obpe,oepos,DL(m),DL(t)); |
| |
CQ(mr) = CQ(t); |
| |
ndl_copy(DL(t),DL(mr)); |
| |
} |
| |
BDY(p) = mr0; |
| |
} |
| |
} |
| |
|
| |
NDV ndtondv(int mod,ND p) |
| |
{ |
| NDV d; |
NDV d; |
| NMV m,m0; |
NMV m,m0; |
| NM t; |
NM t; |
| int i,len; |
int i,len; |
| |
|
| if ( !p ) |
if ( !p ) return 0; |
| return 0; |
len = LEN(p); |
| len = nd_length(p); |
m0 = m = (NMV)(mod?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv)); |
| m0 = m = (NMV)MALLOC_ATOMIC(len*nmv_adv); |
|
| 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) ) { |
| m->td = t->td; |
ndl_copy(DL(t),DL(m)); |
| bcopy(t->dl,m->dl,nd_wpd*sizeof(unsigned int)); |
CQ(m) = CQ(t); |
| m->c = t->c; |
|
| } |
} |
| MKNDV(NV(p),m0,len,d); |
MKNDV(NV(p),m0,len,d); |
| d->sugar = p->sugar; |
SG(d) = SG(p); |
| return d; |
return d; |
| } |
} |
| |
|
| |
ND ndvtond(int mod,NDV p) |
| |
{ |
| |
ND d; |
| |
NM m,m0; |
| |
NMV t; |
| |
int i,len; |
| |
|
| |
if ( !p ) return 0; |
| |
m0 = 0; |
| |
len = p->len; |
| |
for ( t = BDY(p), i = 0; i < len; NMV_ADV(t), i++ ) { |
| |
NEXTNM(m0,m); |
| |
ndl_copy(DL(t),DL(m)); |
| |
CQ(m) = CQ(t); |
| |
} |
| |
NEXT(m) = 0; |
| |
MKND(NV(p),m0,len,d); |
| |
SG(d) = SG(p); |
| |
return d; |
| |
} |
| |
|
| |
NDV dptondv(int mod,DP p) |
| |
{ |
| |
NDV d; |
| |
NMV m0,m; |
| |
MP t; |
| |
DP q; |
| |
int l,i,n; |
| |
|
| |
if ( mod ) { |
| |
_dp_mod(p,mod,0,&q); p = q; |
| |
} |
| |
if ( !p ) return 0; |
| |
for ( t = BDY(p), l = 0; t; t = NEXT(t), l++ ); |
| |
if ( mod ) |
| |
m0 = m = (NMV)MALLOC_ATOMIC(l*nmv_adv); |
| |
else |
| |
m0 = m = (NMV)MALLOC(l*nmv_adv); |
| |
n = NV(p); |
| |
for ( t = BDY(p); t; t = NEXT(t), NMV_ADV(m) ) { |
| |
if ( mod ) CM(m) = ITOS(C(t)); |
| |
else CQ(m) = (Q)C(t); |
| |
dltondl(n,DL(t),DL(m)); |
| |
} |
| |
MKNDV(n,m0,l,d); |
| |
SG(d) = SG(p); |
| |
return d; |
| |
} |
| |
|
| |
DP ndvtodp(int mod,NDV p) |
| |
{ |
| |
DP d; |
| |
MP m0,m; |
| |
NMV t; |
| |
int len,i,n; |
| |
|
| |
if ( !p ) return 0; |
| |
m0 = 0; |
| |
len = LEN(p); |
| |
n = NV(p); |
| |
for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) { |
| |
NEXTMP(m0,m); |
| |
if ( mod ) C(m) = STOI(CM(t)); |
| |
else C(m) = (P)CQ(t); |
| |
DL(m) = ndltodl(n,DL(t)); |
| |
} |
| |
NEXT(m) = 0; |
| |
MKDP(NV(p),m0,d); |
| |
SG(d) = SG(p); |
| |
return d; |
| |
} |
| |
|
| void ndv_print(NDV p) |
void ndv_print(NDV p) |
| { |
{ |
| NMV m; |
NMV m; |
| int i,len; |
int i,len; |
| |
|
| if ( !p ) |
if ( !p ) printf("0\n"); |
| printf("0\n"); |
|
| else { |
else { |
| len = p->len; |
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*",m->c); |
printf("+%d*",CM(m)); |
| ndl_print(m->dl); |
ndl_print(DL(m)); |
| } |
} |
| printf("\n"); |
printf("\n"); |
| } |
} |
| } |
} |
| |
|
| |
void ndv_print_q(NDV p) |
| |
{ |
| |
NMV m; |
| |
int i,len; |
| |
|
| |
if ( !p ) printf("0\n"); |
| |
else { |
| |
len = LEN(p); |
| |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
| |
printf("+"); |
| |
printexpr(CO,CQ(m)); |
| |
printf("*"); |
| |
ndl_print(DL(m)); |
| |
} |
| |
printf("\n"); |
| |
} |
| |
} |
| |
|
| |
NODE nd_reducebase(NODE x) |
| |
{ |
| |
int len,i,j; |
| |
NDV *w; |
| |
NODE t,t0; |
| |
|
| |
len = length(x); |
| |
w = (NDV *)ALLOCA(len*sizeof(NDV)); |
| |
for ( i = 0, t = x; i < len; i++, t = NEXT(t) ) w[i] = BDY(t); |
| |
for ( i = 0; i < len; i++ ) { |
| |
for ( j = 0; j < i; j++ ) { |
| |
if ( w[i] && w[j] ) |
| |
if ( ndl_reducible(HDL(w[i]),HDL(w[j])) ) w[i] = 0; |
| |
else if ( ndl_reducible(HDL(w[j]),HDL(w[i])) ) w[j] = 0; |
| |
} |
| |
} |
| |
for ( i = len-1, t0 = 0; i >= 0; i-- ) { |
| |
if ( w[i] ) { NEXTNODE(t0,t); BDY(t) = (pointer)w[i]; } |
| |
} |
| |
NEXT(t) = 0; x = t0; |
| |
return x; |
| |
} |
| |
|
| |
/* XXX incomplete */ |
| |
|
| |
void nd_init_ord(struct order_spec *ord) |
| |
{ |
| |
switch ( ord->id ) { |
| |
case 0: |
| |
switch ( ord->ord.simple ) { |
| |
case 0: |
| |
nd_dcomp = 1; |
| |
nd_isrlex = 1; |
| |
break; |
| |
case 1: |
| |
nd_dcomp = 1; |
| |
nd_isrlex = 0; |
| |
break; |
| |
case 2: |
| |
nd_dcomp = 0; |
| |
nd_isrlex = 0; |
| |
ndl_compare_function = ndl_lex_compare; |
| |
break; |
| |
default: |
| |
error("nd_gr : unsupported order"); |
| |
} |
| |
break; |
| |
case 1: |
| |
/* XXX */ |
| |
nd_dcomp = -1; |
| |
nd_isrlex = 0; |
| |
ndl_compare_function = ndl_block_compare; |
| |
break; |
| |
case 2: |
| |
error("nd_init_ord : matrix order is not supported yet."); |
| |
break; |
| |
} |
| |
nd_ord = ord; |
| |
} |
| |
|
| |
BlockMask nd_create_blockmask(struct order_spec *ord) |
| |
{ |
| |
int n,i,j,s,l; |
| |
unsigned int *t; |
| |
BlockMask bm; |
| |
|
| |
if ( !ord->id ) |
| |
return 0; |
| |
n = ord->ord.block.length; |
| |
bm = (BlockMask)MALLOC(sizeof(struct oBlockMask)); |
| |
bm->n = n; |
| |
bm->order_pair = ord->ord.block.order_pair; |
| |
bm->mask = (unsigned int **)MALLOC(n*sizeof(unsigned int *)); |
| |
for ( i = 0, s = 0; i < n; i++ ) { |
| |
bm->mask[i] = t |
| |
= (unsigned int *)MALLOC_ATOMIC(nd_wpd*sizeof(unsigned int)); |
| |
for ( j = 0; j < nd_wpd; j++ ) t[j] = 0; |
| |
l = bm->order_pair[i].length; |
| |
for ( j = 0; j < l; j++, s++ ) PUT_EXP(t,s,nd_mask0); |
| |
} |
| |
return bm; |
| |
} |
![[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