| version 1.8, 2003/07/25 07:41:25 |
version 1.64, 2003/09/12 01:12:40 |
|
|
| /* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.7 2003/07/25 07:25:16 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.63 2003/09/11 09:03:53 noro Exp $ */ |
| |
|
| #include "ca.h" |
#include "ca.h" |
| #include "inline.h" |
#include "inline.h" |
| |
#include <time.h> |
| |
|
| #define USE_NDV 1 |
|
| |
|
| #if defined(__GNUC__) |
#if defined(__GNUC__) |
| #define INLINE inline |
#define INLINE inline |
| #elif defined(VISUAL) |
#elif defined(VISUAL) |
|
|
| #define INLINE |
#define INLINE |
| #endif |
#endif |
| |
|
| |
typedef unsigned int UINT; |
| |
|
| |
#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; |
| unsigned int dl[1]; |
Q z; |
| |
P p; |
| |
} c; |
| |
UINT dl[1]; |
| } *NM; |
} *NM; |
| |
|
| |
/* monomial; array rep. */ |
| typedef struct oNMV { |
typedef struct oNMV { |
| int td; |
union { |
| int c; |
int m; |
| unsigned int dl[1]; |
Q z; |
| |
P p; |
| |
} c; |
| |
UINT dl[1]; |
| } *NMV; |
} *NMV; |
| |
|
| |
/* history of reducer */ |
| |
typedef struct oRHist { |
| |
struct oRHist *next; |
| |
int index; |
| |
int sugar; |
| |
UINT 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]; |
UINT lcm[1]; |
| } *ND_pairs; |
} *ND_pairs; |
| |
|
| static ND *nd_ps; |
/* index and shift count for each exponent */ |
| static NDV *nd_psv; |
typedef struct oEPOS { |
| static unsigned int **nd_bound; |
int i; /* index */ |
| int nd_mod,nd_nvar; |
int s; /* shift */ |
| int is_rlex; |
} *EPOS; |
| int nd_epw,nd_bpe,nd_wpd; |
|
| unsigned int nd_mask[32]; |
|
| unsigned int nd_mask0,nd_mask1; |
|
| NM _nm_free_list; |
|
| ND _nd_free_list; |
|
| ND_pairs _ndp_free_list; |
|
| NM *nd_red; |
|
| int nd_red_len; |
|
| |
|
| extern int Top,Reverse; |
typedef struct oBlockMask { |
| int nd_psn,nd_pslen; |
int n; |
| int nd_found,nd_create,nd_notfirst; |
struct order_pair *order_pair; |
| int *nd_psl; |
UINT **mask; |
| |
} *BlockMask; |
| |
|
| void GC_gcollect(); |
typedef struct oBaseSet { |
| NODE append_one(NODE,int); |
int len; |
| |
NDV *ps; |
| |
UINT **bound; |
| |
} *BaseSet; |
| |
|
| #define HTD(d) ((d)->body->td) |
typedef struct oNM_ind_pair |
| |
{ |
| |
NM mul; |
| |
int index; |
| |
} *NM_ind_pair; |
| |
|
| |
|
| |
int (*ndl_compare_function)(UINT *a1,UINT *a2); |
| |
|
| |
static double nd_scale=2; |
| |
static UINT **nd_bound; |
| |
static struct order_spec *nd_ord; |
| |
static EPOS nd_epos; |
| |
static BlockMask nd_blockmask; |
| |
static int nd_nvar; |
| |
static int nd_isrlex; |
| |
static int nd_epw,nd_bpe,nd_wpd,nd_exporigin; |
| |
static UINT nd_mask[32]; |
| |
static UINT nd_mask0,nd_mask1; |
| |
|
| |
static NM _nm_free_list; |
| |
static ND _nd_free_list; |
| |
static ND_pairs _ndp_free_list; |
| |
|
| |
static NDV *nd_ps; |
| |
static NDV *nd_ps_trace; |
| |
static RHist *nd_psh; |
| |
static int nd_psn,nd_pslen; |
| |
|
| |
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 VL CO; |
| |
extern int Top,Reverse,dp_nelim,do_weyl; |
| |
extern int *current_weyl_weight_vector; |
| |
|
| |
/* 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 HCM(d) ((d)->body->c.m) |
| |
#define HCQ(d) ((d)->body->c.z) |
| |
#define HCP(d) ((d)->body->c.p) |
| |
#define CM(a) ((a)->c.m) |
| |
#define CQ(a) ((a)->c.z) |
| |
#define CP(a) ((a)->c.p) |
| |
#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 GET_EXP_MASK(d,a,m) ((((d)[nd_epos[a].i]&(m)[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) |
#define GET_EXP_OLD(d,a) (((d)[oepos[a].i]>>oepos[a].s)&omask0) |
| #define NEWNM(m) if(!_nm_free_list)_NM_alloc(); (m)=_nm_free_list; _nm_free_list = NEXT(_nm_free_list) |
#define PUT_EXP_OLD(r,a,e) ((r)[oepos[a].i] |= ((e)<<oepos[a].s)) |
| #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) |
|
| |
|
| |
/* macros for term comparison */ |
| |
#define TD_DL_COMPARE(d1,d2)\ |
| |
(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(UINT))) |
| |
#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 MKNDV(n,m,l,d) NEWNDV(d); NV(d)=(n); BDY(d)=(m); LEN(d) = l; |
| |
#define NEWNM_ind_pair(p)\ |
| |
((p)=(NM_ind_pair)MALLOC(sizeof(struct oNM_ind_pair))) |
| |
|
| |
/* 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);} |
| |
#define MKNM_ind_pair(p,m,i) (NEWNM_ind_pair(p),(p)->mul=(m),(p)->index=(i)) |
| |
|
| |
/* 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)) |
| |
#define NMV_OADV(m) (m = (NMV)(((char *)m)+oadv)) |
| |
#define NDV_NADV(m) (m = (NMV)(((char *)m)+newadv)) |
| |
#define NMV_PREV(m) (m = (NMV)(((char *)m)-nmv_adv)) |
| |
#define NMV_OPREV(m) (m = (NMV)(((char *)m)-oadv)) |
| |
|
| 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_symbolic(PGeoBucket g,ND d); |
| |
void add_pbucket(int mod,PGeoBucket g,ND d); |
| |
void free_pbucket(PGeoBucket b); |
| |
void mulq_pbucket(PGeoBucket g,Q c); |
| |
NM remove_head_pbucket_symbolic(PGeoBucket g); |
| |
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 ); |
| |
ND_pairs nd_minsugarp( 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 ); |
| |
int ndv_newps(NDV a,NDV aq); |
| |
|
| |
/* top level functions */ |
| |
void nd_gr(LIST f,LIST v,int m,int f4,struct order_spec *ord,LIST *rp); |
| |
void nd_gr_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp); |
| |
NODE nd_f4(int m); |
| |
NODE nd_gb(int m,int checkonly); |
| |
NODE nd_gb_trace(int m); |
| |
|
| |
/* ndl functions */ |
| |
int ndl_weight(UINT *d); |
| |
void ndl_weight_mask(UINT *d); |
| |
void ndl_homogenize(UINT *d,UINT *r,int obpe,EPOS oepos,int weight); |
| |
void ndl_dehomogenize(UINT *p); |
| |
void ndl_reconstruct(UINT *d,UINT *r,int obpe,EPOS oepos); |
| |
INLINE int ndl_reducible(UINT *d1,UINT *d2); |
| |
INLINE int ndl_lex_compare(UINT *d1,UINT *d2); |
| |
INLINE int ndl_block_compare(UINT *d1,UINT *d2); |
| |
INLINE int ndl_equal(UINT *d1,UINT *d2); |
| |
INLINE void ndl_copy(UINT *d1,UINT *d2); |
| |
INLINE void ndl_zero(UINT *d); |
| |
INLINE void ndl_add(UINT *d1,UINT *d2,UINT *d); |
| |
INLINE void ndl_addto(UINT *d1,UINT *d2); |
| |
INLINE void ndl_sub(UINT *d1,UINT *d2,UINT *d); |
| |
INLINE int ndl_hash_value(UINT *d); |
| |
|
| |
/* normal forms */ |
| |
INLINE int ndl_find_reducer(UINT *g); |
| |
INLINE int ndl_find_reducer_direct(UINT *g,NDV *ps,int len); |
| |
int nd_sp(int mod,int trace,ND_pairs p,ND *nf); |
| |
int nd_nf(int mod,ND g,NDV *ps,int full,ND *nf); |
| |
int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *nf); |
| |
int nd_nf_direct(int mod,ND g,BaseSet base,int full,ND *rp); |
| |
|
| |
/* finalizers */ |
| |
NODE ndv_reducebase(NODE x); |
| |
NODE ndv_reduceall(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 nd_mul_nm(ND p,NM m0); |
|
| ND nd_mul_ind_nm(int index,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); |
|
| 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 ndl_print(unsigned int *dl); |
void nd_free_redlist(); |
| |
|
| |
/* printing */ |
| |
void ndl_print(UINT *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); |
| |
|
| |
|
| |
/* setup, reconstruct */ |
| |
void nd_init_ord(struct order_spec *spec); |
| |
ND_pairs nd_reconstruct(int mod,int trace,ND_pairs ndp); |
| |
void nd_reconstruct_direct(int mod,NDV *ps,int len); |
| |
void ndv_setup(int mod,int trace,NODE f); |
| |
void nd_setup_parameters(int nvar,int max); |
| |
BlockMask nd_create_blockmask(struct order_spec *ord); |
| |
EPOS nd_create_epos(struct order_spec *ord); |
| |
int nd_get_exporigin(struct order_spec *ord); |
| |
void ndv_mod(int mod,NDV p); |
| |
NDV ndv_dup(int mod,NDV p); |
| |
ND nd_dup(ND p); |
| |
|
| |
/* ND functions */ |
| |
int ndv_check_candidate(NODE input,int obpe,int oadv,EPOS oepos,NODE cand); |
| |
void nd_mul_c(int mod,ND p,int mul); |
| |
void nd_mul_c_q(ND p,Q mul); |
| |
void nd_mul_c_p(VL vl,ND p,P mul); |
| |
ND nd_remove_head(ND p); |
| int nd_length(ND p); |
int nd_length(ND p); |
| void nd_monic(ND p); |
void nd_append_red(UINT *d,int i); |
| void nd_mul_c(ND p,int mul); |
UINT *ndv_compute_bound(NDV p); |
| void nd_free_redlist(); |
|
| void nd_append_red(unsigned int *d,int td,int i); |
|
| unsigned int *nd_compute_bound(ND p); |
|
| unsigned int *dp_compute_bound(DP p); |
|
| ND_pairs nd_reconstruct(ND_pairs); |
|
| void nd_setup_parameters(); |
|
| ND nd_dup(ND p,int obpe); |
|
| ND nd_copy(ND p); |
ND nd_copy(ND p); |
| void ndl_dup(int obpe,unsigned int *d,unsigned int *r); |
ND nd_merge(ND p1,ND p2); |
| |
ND nd_add(int mod,ND p1,ND p2); |
| |
ND nd_add_q(ND p1,ND p2); |
| |
INLINE int nd_length(ND p); |
| |
|
| #if USE_NDV |
/* NDV functions */ |
| #define NMV_ADV(m) (m = (NMV)(((char *)m)+nmv_adv)) |
ND weyl_ndv_mul_nm(int mod,NM m0,NDV p); |
| #define NEWNDV(d) ((d)=(NDV)MALLOC(sizeof(struct oNDV))) |
void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *tab,int tlen); |
| #define MKNDV(n,m,l,d) NEWNDV(d); (d)->nv=(n); BDY(d)=(m); (d)->len = l; |
void ndv_mul_c(int mod,NDV p,int mul); |
| |
void ndv_mul_c_q(NDV p,Q mul); |
| |
ND ndv_mul_nm_symbolic(NM m0,NDV p); |
| |
ND ndv_mul_nm(int mod,NM m0,NDV p); |
| |
void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos); |
| |
NDV ndv_dup_realloc(NDV p,int obpe,int oadv,EPOS oepos); |
| |
void ndv_homogenize(NDV p,int obpe,int oadv,EPOS eops); |
| |
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); |
| |
|
| int nmv_adv; |
/* converters */ |
| int nmv_len; |
ND ptond(VL vl,VL dvl,P p); |
| NDV ndv_red; |
NDV ptondv(VL vl,VL dvl,P p); |
| |
P ndvtop(int mod,VL vl,VL dvl,NDV p); |
| |
NDV ndtondv(int mod,ND p); |
| |
ND ndvtond(int mod,NDV p); |
| |
int nm_ind_pair_to_vect(int m,UINT *s0,int n,NM_ind_pair pair,UINT *r); |
| |
void nm_ind_pair_to_vect_compress(int m,UINT *s0,int n,NM_ind_pair pair,UINT *r,int *ind); |
| |
int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r); |
| |
|
| ND ndv_add(ND p1,NDV p2); |
|
| NDV ndtondv(ND p); |
|
| void ndv_mul_nm(NDV pv,NM m,NDV r); |
|
| #endif |
|
| |
|
| 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; |
| _ndp_free_list = 0; |
_ndp_free_list = 0; |
| nd_red = 0; |
bzero(nd_red,sizeof(REDTAB_LEN*sizeof(RHist))); |
| GC_gcollect(); |
GC_gcollect(); |
| } |
} |
| |
|
| Line 165 void _NM_alloc() |
|
| Line 365 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(UINT)); |
| p->next = _nm_free_list; _nm_free_list = p; |
p->next = _nm_free_list; _nm_free_list = p; |
| } |
} |
| } |
} |
| Line 187 void _NDP_alloc() |
|
| Line 387 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(UINT)); |
| 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 207 INLINE nd_length(ND p) |
|
| Line 407 INLINE nd_length(ND p) |
|
| } |
} |
| } |
} |
| |
|
| INLINE int ndl_reducible(unsigned int *d1,unsigned int *d2) |
INLINE int ndl_reducible(UINT *d1,UINT *d2) |
| { |
{ |
| unsigned int u1,u2; |
UINT u1,u2; |
| int i,j; |
int i,j; |
| |
|
| |
if ( TD(d1) < TD(d2) ) return 0; |
| switch ( nd_bpe ) { |
switch ( nd_bpe ) { |
| |
#if 0 |
| |
case 3: |
| |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| |
u1 = d1[i]; u2 = d2[i]; |
| |
if ( (u1&0x38000000) < (u2&0x38000000) ) return 0; |
| |
if ( (u1& 0x7000000) < (u2& 0x7000000) ) return 0; |
| |
if ( (u1& 0xe00000) < (u2& 0xe00000) ) return 0; |
| |
if ( (u1& 0x1c0000) < (u2& 0x1c0000) ) return 0; |
| |
if ( (u1& 0x38000) < (u2& 0x38000) ) return 0; |
| |
if ( (u1& 0x7000) < (u2& 0x7000) ) return 0; |
| |
if ( (u1& 0xe00) < (u2& 0xe00) ) return 0; |
| |
if ( (u1& 0x1c0) < (u2& 0x1c0) ) return 0; |
| |
if ( (u1& 0x38) < (u2& 0x38) ) return 0; |
| |
if ( (u1& 0x7) < (u2& 0x7) ) return 0; |
| |
} |
| |
return 1; |
| |
break; |
| 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; |
| if ( (u1&0xf00000) < (u2&0xf00000) ) return 0; |
if ( (u1& 0xf00000) < (u2& 0xf00000) ) return 0; |
| if ( (u1&0xf0000) < (u2&0xf0000) ) return 0; |
if ( (u1& 0xf0000) < (u2& 0xf0000) ) return 0; |
| if ( (u1&0xf000) < (u2&0xf000) ) return 0; |
if ( (u1& 0xf000) < (u2& 0xf000) ) return 0; |
| if ( (u1&0xf00) < (u2&0xf00) ) return 0; |
if ( (u1& 0xf00) < (u2& 0xf00) ) return 0; |
| if ( (u1&0xf0) < (u2&0xf0) ) return 0; |
if ( (u1& 0xf0) < (u2& 0xf0) ) return 0; |
| if ( (u1&0xf) < (u2&0xf) ) return 0; |
if ( (u1& 0xf) < (u2& 0xf) ) return 0; |
| } |
} |
| 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; |
| if ( (u1&0x3f000) < (u2&0x3f000) ) return 0; |
if ( (u1& 0x3f000) < (u2& 0x3f000) ) return 0; |
| if ( (u1&0xfc0) < (u2&0xfc0) ) return 0; |
if ( (u1& 0xfc0) < (u2& 0xfc0) ) return 0; |
| if ( (u1&0x3f) < (u2&0x3f) ) return 0; |
if ( (u1& 0x3f) < (u2& 0x3f) ) return 0; |
| } |
} |
| 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; |
| if ( (u1&0xff00) < (u2&0xff00) ) return 0; |
if ( (u1& 0xff00) < (u2& 0xff00) ) return 0; |
| if ( (u1&0xff) < (u2&0xff) ) return 0; |
if ( (u1& 0xff) < (u2& 0xff) ) return 0; |
| } |
} |
| 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; |
| } |
} |
| 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; |
| |
#endif |
| 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 271 INLINE int ndl_reducible(unsigned int *d1,unsigned int |
|
| Line 490 INLINE int ndl_reducible(unsigned int *d1,unsigned int |
|
| } |
} |
| } |
} |
| |
|
| void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned int *d) |
/* |
| |
* If the current order is a block order, |
| |
* then the last block is length 1 and contains |
| |
* the homo variable. Otherwise, the original |
| |
* order is either 0 or 2. |
| |
*/ |
| |
|
| |
void ndl_homogenize(UINT *d,UINT *r,int obpe,EPOS oepos,int weight) |
| { |
{ |
| unsigned int t1,t2,u,u1,u2; |
int w,i,e,n,omask0; |
| int i,j; |
|
| |
|
| |
omask0 = (1<<obpe)-1; |
| |
n = nd_nvar-1; |
| |
ndl_zero(r); |
| |
for ( i = 0; i < n; i++ ) { |
| |
e = GET_EXP_OLD(d,i); |
| |
PUT_EXP(r,i,e); |
| |
} |
| |
w = TD(d); |
| |
PUT_EXP(r,nd_nvar-1,weight-w); |
| |
TD(r) = weight; |
| |
if ( nd_blockmask ) ndl_weight_mask(r); |
| |
} |
| |
|
| |
void ndl_dehomogenize(UINT *d) |
| |
{ |
| |
UINT mask; |
| |
UINT 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(UINT *d1,unsigned *d2,UINT *d) |
| |
{ |
| |
UINT t1,t2,u,u1,u2; |
| |
int i,j,l; |
| |
|
| switch ( nd_bpe ) { |
switch ( nd_bpe ) { |
| |
#if 0 |
| |
case 3: |
| |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| |
u1 = d1[i]; u2 = d2[i]; |
| |
t1 = (u1&0x38000000); t2 = (u2&0x38000000); u = t1>t2?t1:t2; |
| |
t1 = (u1& 0x7000000); t2 = (u2& 0x7000000); u |= t1>t2?t1:t2; |
| |
t1 = (u1& 0xe00000); t2 = (u2& 0xe00000); u |= t1>t2?t1:t2; |
| |
t1 = (u1& 0x1c0000); t2 = (u2& 0x1c0000); u |= t1>t2?t1:t2; |
| |
t1 = (u1& 0x38000); t2 = (u2& 0x38000); u |= t1>t2?t1:t2; |
| |
t1 = (u1& 0x7000); t2 = (u2& 0x7000); u |= t1>t2?t1:t2; |
| |
t1 = (u1& 0xe00); t2 = (u2& 0xe00); u |= t1>t2?t1:t2; |
| |
t1 = (u1& 0x1c0); t2 = (u2& 0x1c0); u |= t1>t2?t1:t2; |
| |
t1 = (u1& 0x38); t2 = (u2& 0x38); u |= t1>t2?t1:t2; |
| |
t1 = (u1& 0x7); t2 = (u2& 0x7); u |= t1>t2?t1:t2; |
| |
d[i] = u; |
| |
} |
| |
break; |
| 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; |
| t1 = (u1&0xf00000); t2 = (u2&0xf00000); u |= t1>t2?t1:t2; |
t1 = (u1& 0xf00000); t2 = (u2& 0xf00000); u |= t1>t2?t1:t2; |
| t1 = (u1&0xf0000); t2 = (u2&0xf0000); u |= t1>t2?t1:t2; |
t1 = (u1& 0xf0000); t2 = (u2& 0xf0000); u |= t1>t2?t1:t2; |
| t1 = (u1&0xf000); t2 = (u2&0xf000); u |= t1>t2?t1:t2; |
t1 = (u1& 0xf000); t2 = (u2& 0xf000); u |= t1>t2?t1:t2; |
| t1 = (u1&0xf00); t2 = (u2&0xf00); u |= t1>t2?t1:t2; |
t1 = (u1& 0xf00); t2 = (u2& 0xf00); u |= t1>t2?t1:t2; |
| t1 = (u1&0xf0); t2 = (u2&0xf0); u |= t1>t2?t1:t2; |
t1 = (u1& 0xf0); t2 = (u2& 0xf0); u |= t1>t2?t1:t2; |
| t1 = (u1&0xf); t2 = (u2&0xf); u |= t1>t2?t1:t2; |
t1 = (u1& 0xf); t2 = (u2& 0xf); u |= t1>t2?t1:t2; |
| d[i] = u; |
d[i] = u; |
| } |
} |
| 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; |
| t1 = (u1&0x3f000); t2 = (u2&0x3f000); u |= t1>t2?t1:t2; |
t1 = (u1& 0x3f000); t2 = (u2& 0x3f000); u |= t1>t2?t1:t2; |
| t1 = (u1&0xfc0); t2 = (u2&0xfc0); u |= t1>t2?t1:t2; |
t1 = (u1& 0xfc0); t2 = (u2& 0xfc0); u |= t1>t2?t1:t2; |
| t1 = (u1&0x3f); t2 = (u2&0x3f); u |= t1>t2?t1:t2; |
t1 = (u1& 0x3f); t2 = (u2& 0x3f); u |= t1>t2?t1:t2; |
| d[i] = u; |
d[i] = u; |
| } |
} |
| 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; |
| t1 = (u1&0xff00); t2 = (u2&0xff00); u |= t1>t2?t1:t2; |
t1 = (u1& 0xff00); t2 = (u2& 0xff00); u |= t1>t2?t1:t2; |
| t1 = (u1&0xff); t2 = (u2&0xff); u |= t1>t2?t1:t2; |
t1 = (u1& 0xff); t2 = (u2& 0xff); u |= t1>t2?t1:t2; |
| d[i] = u; |
d[i] = u; |
| } |
} |
| 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; |
| d[i] = u; |
d[i] = u; |
| } |
} |
| 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; |
| |
#endif |
| 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 336 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in |
|
| Line 633 void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in |
|
| } |
} |
| break; |
break; |
| } |
} |
| |
TD(d) = ndl_weight(d); |
| |
if ( nd_blockmask ) ndl_weight_mask(d); |
| } |
} |
| |
|
| int ndl_td(unsigned int *d) |
int ndl_weight(UINT *d) |
| { |
{ |
| unsigned int t,u; |
UINT t,u; |
| int i,j; |
int i,j; |
| |
|
| for ( t = 0, i = 0; i < nd_wpd; i++ ) { |
if ( current_dl_weight_vector ) |
| u = d[i]; |
for ( i = 0, t = 0; i < nd_nvar; i++ ) { |
| for ( j = 0; j < nd_epw; j++, u>>=nd_bpe ) |
u = GET_EXP(d,i); |
| t += (u&nd_mask0); |
t += MUL_WEIGHT(u,i); |
| } |
} |
| |
else |
| |
for ( t = 0, i = nd_exporigin; i < nd_wpd; i++ ) { |
| |
u = d[i]; |
| |
for ( j = 0; j < nd_epw; j++, u>>=nd_bpe ) |
| |
t += (u&nd_mask0); |
| |
} |
| return t; |
return t; |
| } |
} |
| |
|
| INLINE int ndl_compare(unsigned int *d1,unsigned int *d2) |
void ndl_weight_mask(UINT *d) |
| { |
{ |
| |
UINT t,u; |
| |
UINT *mask; |
| |
int i,j,k,l; |
| |
|
| |
l = nd_blockmask->n; |
| |
for ( k = 0; k < l; k++ ) { |
| |
mask = nd_blockmask->mask[k]; |
| |
if ( current_dl_weight_vector ) |
| |
for ( i = 0, t = 0; i < nd_nvar; i++ ) { |
| |
u = GET_EXP_MASK(d,i,mask); |
| |
t += MUL_WEIGHT(u,i); |
| |
} |
| |
else |
| |
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); |
| |
} |
| |
d[k+1] = t; |
| |
} |
| |
} |
| |
|
| |
int ndl_lex_compare(UINT *d1,UINT *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; |
| } |
} |
| |
|
| INLINE int ndl_equal(unsigned int *d1,unsigned int *d2) |
int ndl_block_compare(UINT *d1,UINT *d2) |
| { |
{ |
| |
int i,l,j,ord_o,ord_l; |
| |
struct order_pair *op; |
| |
UINT t1,t2,m; |
| |
UINT *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; |
| |
} |
| |
|
| |
/* TDH -> WW -> TD-> RL */ |
| |
|
| |
int ndl_ww_lex_compare(UINT *d1,UINT *d2) |
| |
{ |
| |
int i,m,e1,e2; |
| |
|
| |
if ( TD(d1) > TD(d2) ) return 1; |
| |
else if ( TD(d1) < TD(d2) ) return -1; |
| |
m = nd_nvar>>1; |
| |
for ( i = 0, e1 = e2 = 0; i < m; i++ ) { |
| |
e1 += current_weyl_weight_vector[i]*(GET_EXP(d1,m+i)-GET_EXP(d1,i)); |
| |
e2 += current_weyl_weight_vector[i]*(GET_EXP(d2,m+i)-GET_EXP(d2,i)); |
| |
} |
| |
if ( e1 > e2 ) return 1; |
| |
else if ( e1 < e2 ) return -1; |
| |
return ndl_lex_compare(d1,d2); |
| |
} |
| |
|
| |
INLINE int ndl_equal(UINT *d1,UINT *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) |
INLINE void ndl_copy(UINT *d1,UINT *d2) |
| { |
{ |
| int i; |
int i; |
| |
|
| switch ( nd_wpd ) { |
switch ( nd_wpd ) { |
| case 1: |
|
| d2[0] = d1[0]; |
|
| break; |
|
| case 2: |
case 2: |
| d2[0] = d1[0]; |
TD(d2) = TD(d1); |
| d2[1] = d1[1]; |
d2[1] = d1[1]; |
| break; |
break; |
| |
case 3: |
| |
TD(d2) = TD(d1); |
| |
d2[1] = d1[1]; |
| |
d2[2] = d1[2]; |
| |
break; |
| default: |
default: |
| for ( i = 0; i < nd_wpd; i++ ) |
for ( i = 0; i < nd_wpd; i++ ) |
| d2[i] = d1[i]; |
d2[i] = d1[i]; |
| Line 392 INLINE void ndl_copy(unsigned int *d1,unsigned int *d2 |
|
| Line 771 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_zero(UINT *d) |
| { |
{ |
| int i; |
int i; |
| |
for ( i = 0; i < nd_wpd; i++ ) d[i] = 0; |
| |
} |
| |
|
| |
INLINE void ndl_add(UINT *d1,UINT *d2,UINT *d) |
| |
{ |
| |
int i; |
| |
|
| |
#if 1 |
| switch ( nd_wpd ) { |
switch ( nd_wpd ) { |
| case 1: |
|
| d[0] = d1[0]+d2[0]; |
|
| break; |
|
| case 2: |
case 2: |
| d[0] = d1[0]+d2[0]; |
TD(d) = TD(d1)+TD(d2); |
| d[1] = d1[1]+d2[1]; |
d[1] = d1[1]+d2[1]; |
| break; |
break; |
| |
case 3: |
| |
TD(d) = TD(d1)+TD(d2); |
| |
d[1] = d1[1]+d2[1]; |
| |
d[2] = d1[2]+d2[2]; |
| |
break; |
| default: |
default: |
| 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]; |
|
| break; |
break; |
| } |
} |
| |
#else |
| |
for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]+d2[i]; |
| |
#endif |
| } |
} |
| |
|
| INLINE void ndl_add2(unsigned int *d1,unsigned int *d2) |
/* d1 += d2 */ |
| |
INLINE void ndl_addto(UINT *d1,UINT *d2) |
| { |
{ |
| int i; |
int i; |
| |
|
| |
#if 1 |
| switch ( nd_wpd ) { |
switch ( nd_wpd ) { |
| case 1: |
|
| d2[0] += d1[0]; |
|
| break; |
|
| case 2: |
case 2: |
| d2[0] += d1[0]; |
TD(d1) += TD(d2); |
| d2[1] += d1[1]; |
d1[1] += d2[1]; |
| break; |
break; |
| |
case 3: |
| |
TD(d1) += TD(d2); |
| |
d1[1] += d2[1]; |
| |
d1[2] += d2[2]; |
| |
break; |
| default: |
default: |
| for ( i = 0; i < nd_wpd; i++ ) |
for ( i = 0; i < nd_wpd; i++ ) d1[i] += d2[i]; |
| d2[i] += d1[i]; |
|
| break; |
break; |
| } |
} |
| |
#else |
| |
for ( i = 0; i < nd_wpd; i++ ) d1[i] += d2[i]; |
| |
#endif |
| } |
} |
| |
|
| void ndl_sub(unsigned int *d1,unsigned int *d2,unsigned int *d) |
INLINE void ndl_sub(UINT *d1,UINT *d2,UINT *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(UINT *d1,UINT *d2) |
| { |
{ |
| unsigned int t1,t2,u,u1,u2; |
UINT t1,t2,u,u1,u2; |
| int i,j; |
int i,j; |
| |
|
| switch ( nd_bpe ) { |
switch ( nd_bpe ) { |
| |
#if 0 |
| |
case 3: |
| |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| |
u1 = d1[i]; u2 = d2[i]; |
| |
t1 = u1&0x38000000; t2 = u2&0x38000000; if ( t1&&t2 ) return 0; |
| |
t1 = u1& 0x7000000; t2 = u2& 0x7000000; if ( t1&&t2 ) return 0; |
| |
t1 = u1& 0xe00000; t2 = u2& 0xe00000; if ( t1&&t2 ) return 0; |
| |
t1 = u1& 0x1c0000; t2 = u2& 0x1c0000; if ( t1&&t2 ) return 0; |
| |
t1 = u1& 0x38000; t2 = u2& 0x38000; if ( t1&&t2 ) return 0; |
| |
t1 = u1& 0x7000; t2 = u2& 0x7000; if ( t1&&t2 ) return 0; |
| |
t1 = u1& 0xe00; t2 = u2& 0xe00; if ( t1&&t2 ) return 0; |
| |
t1 = u1& 0x1c0; t2 = u2& 0x1c0; if ( t1&&t2 ) return 0; |
| |
t1 = u1& 0x38; t2 = u2& 0x38; if ( t1&&t2 ) return 0; |
| |
t1 = u1& 0x7; t2 = u2& 0x7; if ( t1&&t2 ) return 0; |
| |
} |
| |
return 1; |
| |
break; |
| 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; |
| t1 = u1&0xf00000; t2 = u2&0xf00000; if ( t1&&t2 ) return 0; |
t1 = u1& 0xf00000; t2 = u2& 0xf00000; if ( t1&&t2 ) return 0; |
| t1 = u1&0xf0000; t2 = u2&0xf0000; if ( t1&&t2 ) return 0; |
t1 = u1& 0xf0000; t2 = u2& 0xf0000; if ( t1&&t2 ) return 0; |
| t1 = u1&0xf000; t2 = u2&0xf000; if ( t1&&t2 ) return 0; |
t1 = u1& 0xf000; t2 = u2& 0xf000; if ( t1&&t2 ) return 0; |
| t1 = u1&0xf00; t2 = u2&0xf00; if ( t1&&t2 ) return 0; |
t1 = u1& 0xf00; t2 = u2& 0xf00; if ( t1&&t2 ) return 0; |
| t1 = u1&0xf0; t2 = u2&0xf0; if ( t1&&t2 ) return 0; |
t1 = u1& 0xf0; t2 = u2& 0xf0; if ( t1&&t2 ) return 0; |
| t1 = u1&0xf; t2 = u2&0xf; if ( t1&&t2 ) return 0; |
t1 = u1& 0xf; t2 = u2& 0xf; if ( t1&&t2 ) return 0; |
| } |
} |
| 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; |
| t1 = u1&0x3f000; t2 = u2&0x3f000; if ( t1&&t2 ) return 0; |
t1 = u1& 0x3f000; t2 = u2& 0x3f000; if ( t1&&t2 ) return 0; |
| t1 = u1&0xfc0; t2 = u2&0xfc0; if ( t1&&t2 ) return 0; |
t1 = u1& 0xfc0; t2 = u2& 0xfc0; if ( t1&&t2 ) return 0; |
| t1 = u1&0x3f; t2 = u2&0x3f; if ( t1&&t2 ) return 0; |
t1 = u1& 0x3f; t2 = u2& 0x3f; if ( t1&&t2 ) return 0; |
| } |
} |
| 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; |
| t1 = u1&0xff00; t2 = u2&0xff00; if ( t1&&t2 ) return 0; |
t1 = u1& 0xff00; t2 = u2& 0xff00; if ( t1&&t2 ) return 0; |
| t1 = u1&0xff; t2 = u2&0xff; if ( t1&&t2 ) return 0; |
t1 = u1& 0xff; t2 = u2& 0xff; if ( t1&&t2 ) return 0; |
| } |
} |
| 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; |
| } |
} |
| 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; |
| |
#endif |
| 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 505 int ndl_disjoint(unsigned int *d1,unsigned int *d2) |
|
| Line 918 int ndl_disjoint(unsigned int *d1,unsigned int *d2) |
|
| } |
} |
| } |
} |
| |
|
| ND nd_reduce(ND p1,ND p2) |
int ndl_check_bound2(int index,UINT *d2) |
| { |
{ |
| int c,c1,c2,t,td,td2,mul; |
UINT u2; |
| NM m2,prev,head,cur,new; |
UINT *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); |
#if 0 |
| c1 = nd_mod-HC(p1); |
case 3: |
| DMAR(c1,c2,0,nd_mod,mul); |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| td = HTD(p1)-HTD(p2); |
u2 = d2[i]; |
| d = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
if ( d1[ind++]+((u2>>27)&0x7) >= 0x8 ) return 1; |
| ndl_sub(HDL(p1),HDL(p2),d); |
if ( d1[ind++]+((u2>>24)&0x7) >= 0x8 ) return 1; |
| prev = 0; head = cur = BDY(p1); |
if ( d1[ind++]+((u2>>21)&0x7) >= 0x8 ) return 1; |
| NEWNM(new); |
if ( d1[ind++]+((u2>>18)&0x7) >= 0x8 ) return 1; |
| for ( m2 = BDY(p2); m2; ) { |
if ( d1[ind++]+((u2>>15)&0x7) >= 0x8 ) return 1; |
| td2 = new->td = m2->td+td; |
if ( d1[ind++]+((u2>>12)&0x7) >= 0x8 ) return 1; |
| ndl_add(m2->dl,d,new->dl); |
if ( d1[ind++]+((u2>>9)&0x7) >= 0x8 ) return 1; |
| if ( !cur ) { |
if ( d1[ind++]+((u2>>6)&0x7) >= 0x8 ) return 1; |
| c1 = C(m2); |
if ( d1[ind++]+((u2>>3)&0x7) >= 0x8 ) return 1; |
| DMAR(c1,mul,0,nd_mod,c2); |
if ( d1[ind++]+(u2&0x7) >= 0x8 ) return 1; |
| 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 4: |
| 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>>28)&0xf) >= 0x10 ) return 1; |
| switch ( c ) { |
if ( d1[ind++]+((u2>>24)&0xf) >= 0x10 ) return 1; |
| case 0: |
if ( d1[ind++]+((u2>>20)&0xf) >= 0x10 ) return 1; |
| c2 = C(m2); |
if ( d1[ind++]+((u2>>16)&0xf) >= 0x10 ) return 1; |
| c1 = C(cur); |
if ( d1[ind++]+((u2>>12)&0xf) >= 0x10 ) return 1; |
| DMAR(c2,mul,c1,nd_mod,t); |
if ( d1[ind++]+((u2>>8)&0xf) >= 0x10 ) return 1; |
| if ( t ) |
if ( d1[ind++]+((u2>>4)&0xf) >= 0x10 ) return 1; |
| C(cur) = t; |
if ( d1[ind++]+(u2&0xf) >= 0x10 ) return 1; |
| 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 6: |
| } |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| } |
u2 = d2[i]; |
| |
if ( d1[ind++]+((u2>>24)&0x3f) >= 0x40 ) return 1; |
| /* HDL(p1) = HDL(p2) */ |
if ( d1[ind++]+((u2>>18)&0x3f) >= 0x40 ) return 1; |
| |
if ( d1[ind++]+((u2>>12)&0x3f) >= 0x40 ) return 1; |
| ND nd_reduce_special(ND p1,ND p2) |
if ( d1[ind++]+((u2>>6)&0x3f) >= 0x40 ) return 1; |
| { |
if ( d1[ind++]+(u2&0x3f) >= 0x40 ) return 1; |
| int c,c1,c2,t,td,td2,mul; |
|
| NM m2,prev,head,cur,new; |
|
| |
|
| if ( !p1 ) |
|
| return 0; |
|
| else { |
|
| c2 = invm(HC(p2),nd_mod); |
|
| c1 = nd_mod-HC(p1); |
|
| DMAR(c1,c2,0,nd_mod,mul); |
|
| prev = 0; head = cur = BDY(p1); |
|
| NEWNM(new); |
|
| for ( m2 = BDY(p2); m2; ) { |
|
| td2 = new->td = m2->td; |
|
| if ( !cur ) { |
|
| c1 = C(m2); |
|
| DMAR(c1,mul,0,nd_mod,c2); |
|
| 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 8: |
| 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)&0xff) >= 0x100 ) return 1; |
| switch ( c ) { |
if ( d1[ind++]+((u2>>16)&0xff) >= 0x100 ) return 1; |
| case 0: |
if ( d1[ind++]+((u2>>8)&0xff) >= 0x100 ) return 1; |
| c2 = C(m2); |
if ( d1[ind++]+(u2&0xff) >= 0x100 ) return 1; |
| c1 = C(cur); |
|
| 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 16: |
| |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| |
u2 = d2[i]; |
| |
if ( d1[ind++]+((u2>>16)&0xffff) > 0x10000 ) return 1; |
| |
if ( d1[ind++]+(u2&0xffff) > 0x10000 ) return 1; |
| |
} |
| |
return 0; |
| |
break; |
| |
case 32: |
| |
for ( i = nd_exporigin; i < nd_wpd; i++ ) |
| |
if ( d1[i]+d2[i]<d1[i] ) return 1; |
| |
return 0; |
| |
break; |
| |
#endif |
| |
default: |
| |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| |
u2 = d2[i]; |
| |
k = (nd_epw-1)*nd_bpe; |
| |
for ( j = 0; j < nd_epw; j++, k -= nd_bpe ) |
| |
if ( d1[ind++]+((u2>>k)&nd_mask0) > nd_mask0 ) return 1; |
| |
} |
| |
return 0; |
| |
break; |
| } |
} |
| } |
} |
| |
|
| int ndl_check_bound2(int index,unsigned int *d2) |
int ndl_check_bound2_direct(UINT *d1,UINT *d2) |
| { |
{ |
| unsigned int u2; |
UINT u2; |
| unsigned int *d1; |
|
| int i,j,ind,k; |
int i,j,ind,k; |
| |
|
| d1 = nd_bound[index]; |
|
| ind = 0; |
ind = 0; |
| switch ( nd_bpe ) { |
switch ( nd_bpe ) { |
| |
#if 0 |
| |
case 3: |
| |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| |
u2 = d2[i]; |
| |
if ( d1[ind++]+((u2>>27)&0x7) >= 0x8 ) return 1; |
| |
if ( d1[ind++]+((u2>>24)&0x7) >= 0x8 ) return 1; |
| |
if ( d1[ind++]+((u2>>21)&0x7) >= 0x8 ) return 1; |
| |
if ( d1[ind++]+((u2>>18)&0x7) >= 0x8 ) return 1; |
| |
if ( d1[ind++]+((u2>>15)&0x7) >= 0x8 ) return 1; |
| |
if ( d1[ind++]+((u2>>12)&0x7) >= 0x8 ) return 1; |
| |
if ( d1[ind++]+((u2>>9)&0x7) >= 0x8 ) return 1; |
| |
if ( d1[ind++]+((u2>>6)&0x7) >= 0x8 ) return 1; |
| |
if ( d1[ind++]+((u2>>3)&0x7) >= 0x8 ) return 1; |
| |
if ( d1[ind++]+(u2&0x7) >= 0x8 ) return 1; |
| |
} |
| |
return 0; |
| |
break; |
| case 4: |
case 4: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u2 = d2[i]; |
u2 = d2[i]; |
| if ( d1[ind++]+((u2>>28)&0xf) >= 0x10 ) return 1; |
if ( d1[ind++]+((u2>>28)&0xf) >= 0x10 ) return 1; |
| if ( d1[ind++]+((u2>>24)&0xf) >= 0x10 ) return 1; |
if ( d1[ind++]+((u2>>24)&0xf) >= 0x10 ) return 1; |
| Line 728 int ndl_check_bound2(int index,unsigned int *d2) |
|
| Line 1044 int ndl_check_bound2(int index,unsigned int *d2) |
|
| return 0; |
return 0; |
| break; |
break; |
| case 6: |
case 6: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u2 = d2[i]; |
u2 = d2[i]; |
| if ( d1[ind++]+((u2>>24)&0x3f) >= 0x40 ) return 1; |
if ( d1[ind++]+((u2>>24)&0x3f) >= 0x40 ) return 1; |
| if ( d1[ind++]+((u2>>18)&0x3f) >= 0x40 ) return 1; |
if ( d1[ind++]+((u2>>18)&0x3f) >= 0x40 ) return 1; |
| Line 739 int ndl_check_bound2(int index,unsigned int *d2) |
|
| Line 1055 int ndl_check_bound2(int index,unsigned int *d2) |
|
| return 0; |
return 0; |
| break; |
break; |
| case 8: |
case 8: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u2 = d2[i]; |
u2 = d2[i]; |
| if ( d1[ind++]+((u2>>24)&0xff) >= 0x100 ) return 1; |
if ( d1[ind++]+((u2>>24)&0xff) >= 0x100 ) return 1; |
| if ( d1[ind++]+((u2>>16)&0xff) >= 0x100 ) return 1; |
if ( d1[ind++]+((u2>>16)&0xff) >= 0x100 ) return 1; |
| Line 749 int ndl_check_bound2(int index,unsigned int *d2) |
|
| Line 1065 int ndl_check_bound2(int index,unsigned int *d2) |
|
| return 0; |
return 0; |
| break; |
break; |
| case 16: |
case 16: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u2 = d2[i]; |
u2 = d2[i]; |
| if ( d1[ind++]+((u2>>16)&0xffff) > 0x10000 ) return 1; |
if ( d1[ind++]+((u2>>16)&0xffff) > 0x10000 ) return 1; |
| if ( d1[ind++]+(u2&0xffff) > 0x10000 ) return 1; |
if ( d1[ind++]+(u2&0xffff) > 0x10000 ) return 1; |
| Line 757 int ndl_check_bound2(int index,unsigned int *d2) |
|
| Line 1073 int ndl_check_bound2(int index,unsigned int *d2) |
|
| return 0; |
return 0; |
| 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]<d1[i] ) return 1; |
if ( d1[i]+d2[i]<d1[i] ) return 1; |
| return 0; |
return 0; |
| break; |
break; |
| |
#endif |
| default: |
default: |
| for ( i = 0; i < nd_wpd; i++ ) { |
for ( i = nd_exporigin; i < nd_wpd; i++ ) { |
| u2 = d2[i]; |
u2 = d2[i]; |
| k = (nd_epw-1)*nd_bpe; |
k = (nd_epw-1)*nd_bpe; |
| for ( j = 0; j < nd_epw; j++, k -= nd_bpe ) |
for ( j = 0; j < nd_epw; j++, k -= nd_bpe ) |
| Line 773 int ndl_check_bound2(int index,unsigned int *d2) |
|
| Line 1090 int ndl_check_bound2(int index,unsigned int *d2) |
|
| } |
} |
| } |
} |
| |
|
| int nd_sp(ND_pairs p,ND *rp) |
INLINE int ndl_hash_value(UINT *d) |
| { |
{ |
| NM m; |
|
| ND p1,p2,t1,t2; |
|
| unsigned int *lcm; |
|
| int td; |
|
| |
|
| 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; |
|
| if ( ndl_check_bound2(p->i1,m->dl) ) |
|
| 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); |
|
| if ( ndl_check_bound2(p->i2,m->dl) ) { |
|
| nd_free(t1); |
|
| return 0; |
|
| } |
|
| t2 = nd_mul_nm(p2,m); |
|
| FREENM(m); |
|
| *rp = nd_add(t1,t2); |
|
| return 1; |
|
| } |
|
| |
|
| INLINE int ndl_hash_value(int td,unsigned int *d) |
|
| { |
|
| int i; |
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) |
INLINE int ndl_find_reducer(UINT *dg) |
| { |
{ |
| NM m; |
RHist r; |
| ND p; |
|
| int d,k,i; |
int d,k,i; |
| |
|
| d = ndl_hash_value(HTD(g),HDL(g)); |
d = ndl_hash_value(dg); |
| for ( m = nd_red[d], k = 0; m; m = NEXT(m), k++ ) { |
for ( r = nd_red[d], k = 0; r; r = NEXT(r), k++ ) { |
| if ( HTD(g) == m->td && ndl_equal(HDL(g),m->dl) ) { |
if ( ndl_equal(dg,DL(r)) ) { |
| if ( k > 0 ) nd_notfirst++; |
if ( k > 0 ) nd_notfirst++; |
| nd_found++; |
nd_found++; |
| return m->c; |
return r->index; |
| } |
} |
| } |
} |
| |
if ( Reverse ) |
| |
for ( i = nd_psn-1; i >= 0; i-- ) { |
| |
r = nd_psh[i]; |
| |
if ( ndl_reducible(dg,DL(r)) ) { |
| |
nd_create++; |
| |
nd_append_red(dg,i); |
| |
return i; |
| |
} |
| |
} |
| |
else |
| |
for ( i = 0; i < nd_psn; i++ ) { |
| |
r = nd_psh[i]; |
| |
if ( ndl_reducible(dg,DL(r)) ) { |
| |
nd_create++; |
| |
nd_append_red(dg,i); |
| |
return i; |
| |
} |
| |
} |
| |
return -1; |
| |
} |
| |
|
| for ( i = 0; i < nd_psn; i++ ) { |
INLINE int ndl_find_reducer_direct(UINT *dg,NDV *ps,int len) |
| p = nd_ps[i]; |
{ |
| if ( HTD(g) >= HTD(p) && ndl_reducible(HDL(g),HDL(p)) ) { |
NDV r; |
| nd_create++; |
RHist s; |
| nd_append_red(HDL(g),HTD(g),i); |
int d,k,i; |
| return i; |
|
| |
if ( Reverse ) |
| |
for ( i = len-1; i >= 0; i-- ) { |
| |
r = ps[i]; |
| |
if ( ndl_reducible(dg,HDL(r)) ) |
| |
return i; |
| } |
} |
| } |
else |
| |
for ( i = 0; i < len; i++ ) { |
| |
r = ps[i]; |
| |
if ( ndl_reducible(dg,HDL(r)) ) |
| |
return i; |
| |
} |
| return -1; |
return -1; |
| } |
} |
| |
|
| ND nd_find_monic_reducer(ND g) |
ND nd_merge(ND p1,ND p2) |
| { |
{ |
| int *d; |
int n,c; |
| ND p,r; |
int t,can,td1,td2; |
| int i; |
ND r; |
| |
NM m1,m2,mr0,mr,s; |
| |
|
| for ( i = 0; i < nd_psn; i++ ) { |
if ( !p1 ) return p2; |
| p = nd_ps[i]; |
else if ( !p2 ) return p1; |
| if ( HTD(g) >= HTD(p) && ndl_reducible(HDL(g),HDL(p)) ) { |
else { |
| d = (int *)ALLOCA(nd_wpd*sizeof(int)); |
can = 0; |
| ndl_sub(HDL(g),HDL(p),d); |
for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) { |
| r = nd_mul_term(p,HTD(g)-HTD(p),d); |
c = DL_COMPARE(DL(m1),DL(m2)); |
| return r; |
switch ( c ) { |
| |
case 0: |
| |
s = m1; m1 = NEXT(m1); |
| |
can++; NEXTNM2(mr0,mr,s); |
| |
s = m2; m2 = NEXT(m2); FREENM(s); |
| |
break; |
| |
case 1: |
| |
s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s); |
| |
break; |
| |
case -1: |
| |
s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s); |
| |
break; |
| |
} |
| } |
} |
| |
if ( !mr0 ) |
| |
if ( m1 ) mr0 = m1; |
| |
else if ( m2 ) mr0 = m2; |
| |
else return 0; |
| |
else if ( m1 ) NEXT(mr) = m1; |
| |
else if ( m2 ) NEXT(mr) = m2; |
| |
else NEXT(mr) = 0; |
| |
BDY(p1) = mr0; |
| |
SG(p1) = MAX(SG(p1),SG(p2)); |
| |
LEN(p1) = LEN(p1)+LEN(p2)-can; |
| |
FREEND(p2); |
| |
return p1; |
| } |
} |
| return 0; |
|
| } |
} |
| |
|
| ND nd_add(ND p1,ND p2) |
ND nd_add(int mod,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 896 ND nd_add(ND p1,ND p2) |
|
| Line 1233 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; |
| } |
} |
| } |
} |
| |
|
| ND nd_mul_ind_nm(int index,NM m0) |
/* ret=1 : success, ret=0 : overflow */ |
| |
int nd_nf(int mod,ND g,NDV *ps,int full,ND *rp) |
| { |
{ |
| register int c1,c2,c; |
ND d; |
| register NM m,new,prev; |
NM m,mrd,tail; |
| NM mr0; |
NM mul; |
| unsigned int *d; |
int n,sugar,psugar,sugar0,stat,index; |
| int n,td,i,len,d0,d1; |
int c,c1,c2,dummy; |
| ND p,r; |
RHist h; |
| |
NDV p,red; |
| |
Q cg,cred,gcd; |
| |
double hmag; |
| |
|
| p = nd_ps[index]; |
if ( !g ) { |
| len = nd_psl[index]; |
*rp = 0; |
| n = NV(p); m = BDY(p); |
return 1; |
| d = m0->dl; td = m0->td; c = C(m0); |
} |
| |
if ( !mod ) hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
| |
|
| NEWNM(mr0); |
sugar0 = sugar = SG(g); |
| c1 = C(m); DMAR(c1,c,0,nd_mod,c2); C(mr0) = c2; |
n = NV(g); |
| mr0->td = m->td+td; ndl_add(m->dl,d,mr0->dl); |
mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); |
| prev = mr0; m = NEXT(m); |
for ( d = 0; g; ) { |
| len--; |
index = ndl_find_reducer(HDL(g)); |
| |
if ( index >= 0 ) { |
| switch ( nd_wpd ) { |
h = nd_psh[index]; |
| case 1: |
ndl_sub(HDL(g),DL(h),DL(mul)); |
| d0 = d[0]; |
if ( ndl_check_bound2(index,DL(mul)) ) { |
| while ( len-- ) { |
nd_free(g); nd_free(d); |
| c1 = C(m); DMAR(c1,c,0,nd_mod,c2); |
return 0; |
| NEWNM(new); C(new) = c2; |
|
| new->td = m->td+td; new->dl[0] = m->dl[0]+d0; |
|
| m = NEXT(m); NEXT(prev) = new; prev = new; |
|
| } |
} |
| break; |
p = ps[index]; |
| case 2: |
if ( mod ) { |
| d0 = d[0]; d1 = d[1]; |
c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
| while ( len-- ) { |
DMAR(c1,c2,0,mod,c); CM(mul) = c; |
| c1 = C(m); DMAR(c1,c,0,nd_mod,c2); |
} else { |
| NEWNM(new); C(new) = c2; |
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
| new->td = m->td+td; |
chsgnq(cg,&CQ(mul)); |
| new->dl[0] = m->dl[0]+d0; |
nd_mul_c_q(d,cred); nd_mul_c_q(g,cred); |
| new->dl[1] = m->dl[1]+d1; |
|
| m = NEXT(m); NEXT(prev) = new; prev = new; |
|
| } |
} |
| break; |
g = nd_add(mod,g,ndv_mul_nm(mod,mul,p)); |
| default: |
sugar = MAX(sugar,SG(p)+TD(DL(mul))); |
| while ( len-- ) { |
if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) { |
| c1 = C(m); DMAR(c1,c,0,nd_mod,c2); |
nd_removecont2(d,g); |
| NEWNM(new); C(new) = c2; |
hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
| new->td = m->td+td; ndl_add(m->dl,d,new->dl); |
|
| m = NEXT(m); NEXT(prev) = new; prev = new; |
|
| } |
} |
| break; |
} else if ( !full ) { |
| |
*rp = g; |
| |
return 1; |
| |
} else { |
| |
m = BDY(g); |
| |
if ( NEXT(m) ) { |
| |
BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--; |
| |
} else { |
| |
FREEND(g); g = 0; |
| |
} |
| |
if ( d ) { |
| |
NEXT(tail)=m; tail=m; LEN(d)++; |
| |
} else { |
| |
MKND(n,m,1,d); tail = BDY(d); |
| |
} |
| |
} |
| } |
} |
| |
if ( d ) SG(d) = sugar; |
| NEXT(prev) = 0; |
*rp = d; |
| MKND(NV(p),mr0,r); |
return 1; |
| r->sugar = p->sugar + td; |
|
| return r; |
|
| } |
} |
| |
|
| ND nd_mul_term(ND p,int td,unsigned int *d) |
int nd_nf_pbucket(int mod,ND g,NDV *ps,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(UINT)); |
| |
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 = ndl_find_reducer(HDL(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; |
| |
} |
| |
p = ps[index]; |
| |
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); |
| |
mulq_pbucket(bucket,cred); |
| |
g = bucket->body[hindex]; |
| |
gmag = (double)p_mag((P)HCQ(g)); |
| |
} |
| |
red = ndv_mul_nm(mod,mul,p); |
| |
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; |
| NM mul; |
NM mul; |
| int n,sugar,psugar,stat,index; |
NDV *ps; |
| |
int n,sugar,psugar,sugar0,stat,index,len; |
| int c,c1,c2; |
int c,c1,c2; |
| #if USE_NDV |
UINT **bound; |
| NDV red; |
RHist h; |
| #else |
NDV p,red; |
| ND red; |
Q cg,cred,gcd; |
| #endif |
double hmag; |
| |
|
| if ( !g ) { |
if ( !g ) { |
| *rp = 0; |
*rp = 0; |
| return 1; |
return 1; |
| } |
} |
| sugar = g->sugar; |
#if 0 |
| |
if ( !mod ) |
| |
hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
| |
#else |
| |
/* XXX */ |
| |
hmag = 0; |
| |
#endif |
| |
|
| |
ps = base->ps; |
| |
bound = base->bound; |
| |
len = base->len; |
| |
sugar0 = sugar = SG(g); |
| n = NV(g); |
n = NV(g); |
| mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int)); |
mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); |
| for ( d = 0; g; ) { |
for ( d = 0; g; ) { |
| index = nd_find_reducer(g); |
index = ndl_find_reducer_direct(HDL(g),ps,len); |
| if ( index >= 0 ) { |
if ( index >= 0 ) { |
| p = nd_ps[index]; |
p = ps[index]; |
| ndl_sub(HDL(g),HDL(p),mul->dl); |
ndl_sub(HDL(g),HDL(p),DL(mul)); |
| mul->td = HTD(g)-HTD(p); |
if ( ndl_check_bound2_direct(bound[index],DL(mul)) ) { |
| if ( ndl_check_bound2(index,mul->dl) ) { |
|
| nd_free(g); nd_free(d); |
nd_free(g); nd_free(d); |
| return 0; |
return 0; |
| } |
} |
| c1 = invm(HC(p),nd_mod); c2 = nd_mod-HC(g); |
if ( mod ) { |
| DMAR(c1,c2,0,nd_mod,c); C(mul) = c; |
c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
| #if USE_NDV |
DMAR(c1,c2,0,mod,c); CM(mul) = c; |
| ndv_mul_nm(nd_psv[index],mul,ndv_red); |
} else { |
| g = ndv_add(g,ndv_red); |
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
| sugar = MAX(sugar,ndv_red->sugar); |
chsgnq(cg,&CQ(mul)); |
| #else |
nd_mul_c_q(d,cred); nd_mul_c_q(g,cred); |
| red = nd_mul_ind_nm(index,mul); |
} |
| g = nd_add(g,red); |
g = nd_add(mod,g,ndv_mul_nm(mod,mul,p)); |
| sugar = MAX(sugar,red->sugar); |
sugar = MAX(sugar,SG(p)+TD(DL(mul))); |
| #endif |
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 NDV, cand : list of NDV */ |
| |
|
| |
int ndv_check_candidate(NODE input,int obpe,int oadv,EPOS oepos,NODE cand) |
| |
{ |
| |
int n,i,stat; |
| |
ND nf,d; |
| |
NDV r; |
| |
NODE t,s; |
| |
|
| |
ndv_setup(0,0,cand); |
| |
n = length(cand); |
| |
|
| |
/* membercheck : list is a subset of Id(cand) ? */ |
| |
for ( t = input; t; t = NEXT(t) ) { |
| |
again: |
| |
if ( nd_bpe > obpe ) |
| |
r = ndv_dup_realloc((NDV)BDY(t),obpe,oadv,oepos); |
| |
else |
| |
r = (NDV)BDY(t); |
| |
d = ndvtond(0,r); |
| |
stat = nd_nf(0,d,nd_ps,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 1116 PGeoBucket create_pbucket() |
|
| Line 1591 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_symbolic(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_merge(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_merge(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 add_pbucket(int mod,PGeoBucket g,ND d) |
| { |
{ |
| |
int l,i,k,m; |
| |
|
| |
if ( !d ) |
| |
return; |
| |
l = LEN(d); |
| |
for ( k = 0, m = 1; l > m; k++, m <<= 1 ); |
| |
/* 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; |
| |
d = nd_add(mod,g->body[k+1],d); |
| |
} |
| |
g->body[k] = d; |
| |
g->m = MAX(g->m,k); |
| |
} |
| |
|
| |
void mulq_pbucket(PGeoBucket g,Q c) |
| |
{ |
| |
int k; |
| |
|
| |
for ( k = 0; k <= g->m; k++ ) |
| |
nd_mul_c_q(g->body[k],c); |
| |
} |
| |
|
| |
NM remove_head_pbucket_symbolic(PGeoBucket g) |
| |
{ |
| |
int j,i,k,c; |
| |
NM head; |
| |
|
| |
k = g->m; |
| |
j = -1; |
| |
for ( i = 0; i <= k; i++ ) { |
| |
if ( !g->body[i] ) continue; |
| |
if ( j < 0 ) j = i; |
| |
else { |
| |
c = DL_COMPARE(HDL(g->body[i]),HDL(g->body[j])); |
| |
if ( c > 0 ) |
| |
j = i; |
| |
else if ( c == 0 ) |
| |
g->body[i] = nd_remove_head(g->body[i]); |
| |
} |
| |
} |
| |
if ( j < 0 ) return 0; |
| |
else { |
| |
head = BDY(g->body[j]); |
| |
if ( !NEXT(head) ) { |
| |
FREEND(g->body[j]); |
| |
g->body[j] = 0; |
| |
} else { |
| |
BDY(g->body[j]) = NEXT(head); |
| |
LEN(g->body[j])--; |
| |
} |
| |
return head; |
| |
} |
| |
} |
| |
|
| |
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; |
UINT *di,*dj; |
| ND gi,gj; |
ND gi,gj; |
| |
|
| k = g->m; |
k = g->m; |
| Line 1148 int head_pbucket(PGeoBucket g) |
|
| Line 1694 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; |
| |
NDV nfv; |
| |
|
| 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,0,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,nd_ps,!Top,&nf):nd_nf(m,h,nd_ps,!Top,&nf); |
| g = normalize_pbucket(bucket); |
#else |
| if ( g ) |
stat = nd_nf(m,h,nd_ps,!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); |
| |
nd_removecont(m,nf); |
| |
nfv = ndtondv(m,nf); nd_free(nf); |
| |
nh = ndv_newps(nfv,0); |
| |
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); |
|
| } |
|
| } |
} |
| } |
} |
| |
for ( t = g; t; t = NEXT(t) ) BDY(t) = (pointer)nd_ps[(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; |
| |
NDV nfv,nfqv; |
| |
|
| 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,0,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,nd_ps,!Top,&nf); |
| |
#else |
| |
stat = nd_nf(m,h,nd_ps,!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,1,l,&h); |
| d = update_pairs(d,g,nh); |
nd_nf(0,h,nd_ps_trace,!Top,&nfq); |
| g = update_base(g,nh); |
if ( nfq ) { |
| gall = append_one(gall,nh); |
/* failure; m|HC(nfq) */ |
| FREENDP(l); |
if ( !rem(NM(HCQ(nfq)),m) ) return 0; |
| |
|
| |
printf("+"); fflush(stdout); |
| |
nd_removecont(m,nf); nfv = ndtondv(m,nf); nd_free(nf); |
| |
nd_removecont(0,nfq); nfqv = ndtondv(0,nfq); nd_free(nfq); |
| |
nh = ndv_newps(nfv,nfqv); |
| |
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_ps_trace[(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 ndv_reduceall(int m,NODE f) |
| |
{ |
| |
int i,j,n,stat; |
| |
NDV *w,*ps; |
| |
ND nf,g; |
| |
NODE t,a0,a; |
| |
struct oBaseSet base; |
| |
UINT **bound; |
| |
|
| |
for ( n = 0, t = f; t; t = NEXT(t), n++ ); |
| |
ps = (NDV *)ALLOCA(n*sizeof(NDV)); |
| |
bound = (UINT **)ALLOCA(n*sizeof(UINT *)); |
| |
for ( i = 0, t = f; i < n; i++, t = NEXT(t) ) ps[i] = (NDV)BDY(t); |
| |
qsort(ps,n,sizeof(NDV),(int (*)(const void *,const void *))ndv_compare); |
| |
for ( i = 0; i < n; i++ ) bound[i] = ndv_compute_bound(ps[i]); |
| |
base.ps = (NDV *)ALLOCA((n-1)*sizeof(NDV)); |
| |
base.bound = (UINT **)ALLOCA((n-1)*sizeof(UINT *)); |
| |
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 1308 ND_pairs update_pairs( ND_pairs d, NODE /* of index */ |
|
| Line 1971 ND_pairs update_pairs( ND_pairs d, NODE /* of index */ |
|
| d1 = nd_newpairs(g,t); |
d1 = nd_newpairs(g,t); |
| d1 = crit_M(d1); |
d1 = crit_M(d1); |
| d1 = crit_F(d1); |
d1 = crit_F(d1); |
| prev = 0; cur = head = d1; |
if ( do_weyl ) |
| while ( cur ) { |
head = d1; |
| if ( crit_2( cur->i1,cur->i2 ) ) { |
else { |
| remove = cur; |
prev = 0; cur = head = d1; |
| if ( !prev ) { |
while ( cur ) { |
| head = cur = NEXT(cur); |
if ( crit_2( cur->i1,cur->i2 ) ) { |
| |
remove = cur; |
| |
if ( !prev ) head = cur = NEXT(cur); |
| |
else cur = NEXT(prev) = NEXT(cur); |
| |
FREENDP(remove); |
| } else { |
} else { |
| cur = NEXT(prev) = NEXT(cur); |
prev = cur; cur = NEXT(cur); |
| } |
} |
| FREENDP(remove); |
|
| } else { |
|
| prev = 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 1337 ND_pairs update_pairs( ND_pairs d, NODE /* of index */ |
|
| Line 1999 ND_pairs update_pairs( ND_pairs d, NODE /* of index */ |
|
| ND_pairs nd_newpairs( NODE g, int t ) |
ND_pairs nd_newpairs( NODE g, int t ) |
| { |
{ |
| NODE h; |
NODE h; |
| unsigned int *dl; |
UINT *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 1360 ND_pairs nd_newpairs( NODE g, int t ) |
|
| Line 2020 ND_pairs nd_newpairs( NODE g, int t ) |
|
| ND_pairs crit_B( ND_pairs d, int s ) |
ND_pairs crit_B( ND_pairs d, int s ) |
| { |
{ |
| ND_pairs cur,head,prev,remove; |
ND_pairs cur,head,prev,remove; |
| unsigned int *t,*tl,*lcm; |
UINT *t,*tl,*lcm; |
| 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 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT)); |
| 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 1381 ND_pairs crit_B( ND_pairs d, int s ) |
|
| Line 2041 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; |
| Line 1391 ND_pairs crit_B( ND_pairs d, int s ) |
|
| Line 2050 ND_pairs crit_B( ND_pairs d, int s ) |
|
| ND_pairs crit_M( ND_pairs d1 ) |
ND_pairs crit_M( ND_pairs d1 ) |
| { |
{ |
| ND_pairs e,d2,d3,dd,p; |
ND_pairs e,d2,d3,dd,p; |
| unsigned int *id,*jd; |
UINT *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 1441 ND_pairs crit_F( ND_pairs d1 ) |
|
| Line 2094 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 1453 ND_pairs crit_F( ND_pairs d1 ) |
|
| Line 2106 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 1477 ND_pairs crit_F( ND_pairs d1 ) |
|
| Line 2130 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; |
UINT *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 1507 static ND_pairs equivalent_pairs( ND_pairs d1, ND_pair |
|
| Line 2156 static ND_pairs equivalent_pairs( ND_pairs d1, ND_pair |
|
| |
|
| NODE update_base(NODE nd,int ndp) |
NODE update_base(NODE nd,int ndp) |
| { |
{ |
| unsigned int *dl, *dln; |
UINT *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 1531 NODE update_base(NODE nd,int ndp) |
|
| Line 2177 NODE update_base(NODE nd,int ndp) |
|
| ND_pairs nd_minp( ND_pairs d, ND_pairs *prest ) |
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; |
UINT *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_psl[m->i1]+nd_psl[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_psl[p->i1]+nd_psl[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) |
ND_pairs nd_minsugarp( ND_pairs d, ND_pairs *prest ) |
| { |
{ |
| |
int msugar; |
| |
ND_pairs t,dm0,dm,dr0,dr; |
| |
|
| |
for ( msugar = SG(d), t = NEXT(d); t; t = NEXT(t) ) |
| |
if ( SG(t) < msugar ) msugar = SG(t); |
| |
dm0 = 0; dr0 = 0; |
| |
for ( t = d; t; t = NEXT(t) ) |
| |
if ( SG(t) == msugar ) { |
| |
if ( dm0 ) NEXT(dm) = t; |
| |
else dm0 = t; |
| |
dm = t; |
| |
} else { |
| |
if ( dr0 ) NEXT(dr) = t; |
| |
else dr0 = t; |
| |
dr = t; |
| |
} |
| |
NEXT(dm) = 0; |
| |
if ( dr0 ) NEXT(dr) = 0; |
| |
*prest = dr0; |
| |
return dm0; |
| |
} |
| |
|
| |
int ndv_newps(NDV a,NDV 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_psl = (int *)REALLOC((char *)nd_psl,nd_pslen*sizeof(int)); |
nd_ps_trace = (NDV *)REALLOC((char *)nd_ps_trace,nd_pslen*sizeof(NDV)); |
| #if USE_NDV |
nd_psh = (RHist *)REALLOC((char *)nd_psh,nd_pslen*sizeof(RHist)); |
| nd_psv = (NDV *)REALLOC((char *)nd_psv,nd_pslen*sizeof(NDV)); |
nd_bound = (UINT **) |
| #endif |
REALLOC((char *)nd_bound,nd_pslen*sizeof(UINT *)); |
| nd_bound = (unsigned int **) |
|
| REALLOC((char *)nd_bound,nd_pslen*sizeof(unsigned int *)); |
|
| } |
} |
| nd_monic(a); |
NEWRHist(r); nd_psh[nd_psn] = r; |
| nd_ps[nd_psn] = a; |
nd_ps[nd_psn] = a; |
| nd_psl[nd_psn] = nd_length(a); |
if ( aq ) { |
| nd_bound[nd_psn] = nd_compute_bound(a); |
nd_ps_trace[nd_psn] = aq; |
| #if USE_NDV |
nd_bound[nd_psn] = ndv_compute_bound(aq); |
| nd_psv[nd_psn] = ndtondv(a); |
SG(r) = SG(aq); ndl_copy(HDL(aq),DL(r)); |
| len = nd_psv[nd_psn]->len; |
} else { |
| if ( len > nmv_len ) { |
nd_bound[nd_psn] = ndv_compute_bound(a); |
| nmv_len = 2*len; |
SG(r) = SG(a); ndl_copy(HDL(a),DL(r)); |
| BDY(ndv_red) = (NMV)REALLOC(BDY(ndv_red),nmv_len*nmv_adv); |
|
| } |
} |
| #endif |
|
| return nd_psn++; |
return nd_psn++; |
| } |
} |
| |
|
| NODE NODE_sortb(NODE f,int); |
void ndv_setup(int mod,int trace,NODE f) |
| ND dptond(DP); |
|
| DP ndtodp(ND); |
|
| |
|
| NODE nd_setup(NODE f) |
|
| { |
{ |
| int i,j,td,len,max; |
int i,j,td,len,max; |
| NODE s,s0,f0; |
NODE s,s0,f0; |
| unsigned int *d; |
UINT *d; |
| |
RHist r; |
| |
NDV a,am; |
| |
|
| 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_psl = (int *)MALLOC(nd_pslen*sizeof(int)); |
nd_ps_trace = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
| #if USE_NDV |
nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist)); |
| nd_psv = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
nd_bound = (UINT **)MALLOC(nd_pslen*sizeof(UINT *)); |
| #endif |
|
| nd_bound = (unsigned int **)MALLOC(nd_pslen*sizeof(unsigned int *)); |
|
| 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 ( max < 2 ) |
if ( !nd_red ) |
| nd_bpe = 2; |
nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist)); |
| else if ( max < 4 ) |
bzero(nd_red,REDTAB_LEN*sizeof(RHist)); |
| 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_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)); |
if ( trace ) { |
| nd_monic(nd_ps[i]); |
a = nd_ps_trace[i] = ndv_dup(0,(NDV)BDY(f)); |
| nd_psl[i] = nd_length(nd_ps[i]); |
ndv_removecont(0,a); |
| #if USE_NDV |
am = nd_ps[i] = ndv_dup(mod,a); |
| nd_psv[i] = ndtondv(nd_ps[i]); |
ndv_mod(mod,am); |
| len = MAX(len,nd_psv[i]->len); |
ndv_removecont(mod,am); |
| #endif |
} else { |
| |
a = nd_ps[i] = ndv_dup(mod,(NDV)BDY(f)); |
| |
if ( mod ) ndv_mod(mod,a); |
| |
ndv_removecont(mod,a); |
| |
} |
| |
NEWRHist(r); SG(r) = HTD(a); ndl_copy(HDL(a),DL(r)); |
| |
nd_bound[i] = ndv_compute_bound(a); |
| |
nd_psh[i] = r; |
| } |
} |
| nd_red = (NM *)MALLOC(REDTAB_LEN*sizeof(NM)); |
|
| #if USE_NDV |
|
| nmv_len = 16*len; |
|
| NEWNDV(ndv_red); |
|
| BDY(ndv_red) = (NMV)MALLOC_ATOMIC(nmv_len*nmv_adv); |
|
| #endif |
|
| 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,int f4,struct order_spec *ord,LIST *rp) |
| { |
{ |
| struct order_spec ord1; |
VL tv,fv,vv,vc; |
| VL fv,vv,vc; |
|
| NODE fd,fd0,r,r0,t,x,s,xx; |
NODE fd,fd0,r,r0,t,x,s,xx; |
| DP a,b,c; |
int e,max,nvar; |
| |
ND b; |
| |
|
| get_vars((Obj)f,&fv); pltovl(v,&vv); |
get_vars((Obj)f,&fv); pltovl(v,&vv); |
| nd_nvar = length(vv); |
nvar = length(vv); |
| if ( ord->id ) |
nd_init_ord(ord); |
| error("nd_gr : unsupported order"); |
for ( t = BDY(f), max = 0; t; t = NEXT(t) ) |
| switch ( ord->ord.simple ) { |
for ( tv = vv; tv; tv = NEXT(tv) ) { |
| case 0: |
e = getdeg(tv->v,(P)BDY(t)); |
| is_rlex = 1; |
max = MAX(e,max); |
| break; |
|
| case 1: |
|
| is_rlex = 0; |
|
| break; |
|
| default: |
|
| error("nd_gr : unsupported order"); |
|
| } |
|
| initd(ord); |
|
| nd_mod = m; |
|
| for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
|
| ptod(CO,vv,(P)BDY(t),&b); |
|
| _dp_mod(b,m,0,&c); |
|
| if ( c ) { |
|
| NEXTNODE(fd0,fd); BDY(fd) = (pointer)c; |
|
| } |
} |
| |
nd_setup_parameters(nvar,max); |
| |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
| |
b = (pointer)ptondv(CO,vv,(P)BDY(t)); |
| |
if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; } |
| } |
} |
| if ( fd0 ) NEXT(fd) = 0; |
if ( fd0 ) NEXT(fd) = 0; |
| s = nd_setup(fd0); |
ndv_setup(m,0,fd0); |
| x = nd_gb(s); |
x = f4?nd_f4(m):nd_gb(m,0); |
| #if 0 |
x = ndv_reducebase(x); |
| x = nd_reduceall(x,m); |
x = ndv_reduceall(m,x); |
| #endif |
for ( r0 = 0, t = x; t; t = NEXT(t) ) { |
| for ( r0 = 0; x; x = NEXT(x) ) { |
|
| NEXTNODE(r0,r); |
NEXTNODE(r0,r); |
| a = ndtodp(nd_ps[(int)BDY(x)]); |
BDY(r) = ndvtop(m,CO,vv,BDY(t)); |
| _dtop_mod(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 dltondl(int n,DL dl,unsigned int *r) |
void nd_gr_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp) |
| { |
{ |
| unsigned int *d; |
struct order_spec ord1; |
| int i; |
VL tv,fv,vv,vc; |
| |
NODE fd,fd0,in0,in,r,r0,t,s,cand; |
| |
int m,nocheck,nvar,mindex,e,max; |
| |
NDV c; |
| |
NMV a; |
| |
P p; |
| |
EPOS oepos; |
| |
int obpe,oadv,wmax,i,len,cbpe; |
| |
|
| |
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); |
| |
for ( t = BDY(f), max = 0; t; t = NEXT(t) ) |
| |
for ( tv = vv; tv; tv = NEXT(tv) ) { |
| |
e = getdeg(tv->v,(P)BDY(t)); |
| |
max = MAX(e,max); |
| |
} |
| |
nd_init_ord(ord); |
| |
nd_setup_parameters(nvar,max); |
| |
obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos; |
| |
for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
| |
c = ptondv(CO,vv,(P)BDY(t)); |
| |
if ( c ) { |
| |
NEXTNODE(in0,in); BDY(in) = (pointer)c; |
| |
NEXTNODE(fd0,fd); BDY(fd) = (pointer)ndv_dup(0,c); |
| |
} |
| |
} |
| |
if ( in0 ) NEXT(in) = 0; |
| |
if ( fd0 ) NEXT(fd) = 0; |
| |
if ( homo ) { |
| |
for ( t = in0, wmax = 0; t; t = NEXT(t) ) { |
| |
c = (NDV)BDY(t); len = LEN(c); |
| |
for ( a = BDY(c), i = 0; i < len; i++, NMV_ADV(a) ) |
| |
wmax = MAX(TD(DL(a)),wmax); |
| |
} |
| |
homogenize_order(ord,nvar,&ord1); |
| |
nd_init_ord(&ord1); |
| |
nd_setup_parameters(nvar+1,wmax); |
| |
for ( t = fd0; t; t = NEXT(t) ) |
| |
ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos); |
| |
} |
| |
while ( 1 ) { |
| |
ndv_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_init_ord(ord); |
| |
nd_setup_parameters(nvar,0); |
| |
} |
| |
cand = ndv_reducebase(cand); |
| |
cand = ndv_reduceall(0,cand); |
| |
if ( nocheck ) |
| |
break; |
| |
cbpe = nd_bpe; |
| |
if ( ndv_check_candidate(in0,obpe,oadv,oepos,cand) ) |
| |
/* success */ |
| |
break; |
| |
else if ( trace > 1 ) { |
| |
/* failure */ |
| |
*rp = 0; return; |
| |
} else { |
| |
/* try the next modulus */ |
| |
m = get_lprime(++mindex); |
| |
/* reset the parameters */ |
| |
if ( homo ) { |
| |
nd_init_ord(&ord1); |
| |
nd_setup_parameters(nvar+1,wmax); |
| |
} else { |
| |
nd_init_ord(ord); |
| |
nd_setup_parameters(nvar,max); |
| |
} |
| |
} |
| |
} |
| |
/* dp->p */ |
| |
nd_bpe = cbpe; |
| |
nd_setup_parameters(0,0); |
| |
for ( r = cand; r; r = NEXT(r) ) BDY(r) = (pointer)ndvtop(0,CO,vv,BDY(r)); |
| |
MKLIST(*rp,cand); |
| |
} |
| |
|
| |
void dltondl(int n,DL dl,UINT *r) |
| |
{ |
| |
UINT *d; |
| |
int i,j,l,s,ord_l; |
| |
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_l = op[j].length; |
| r[i/nd_epw] |= d[i]<<((nd_epw-(i%nd_epw)-1)*nd_bpe); |
for ( i = 0; i < ord_l; i++, s++ ) PUT_EXP(r,s,d[s]); |
| |
} |
| |
TD(r) = ndl_weight(r); |
| |
ndl_weight_mask(r); |
| |
} 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,UINT *ndl) |
| { |
{ |
| DL dl; |
DL dl; |
| int *d; |
int *d; |
| int i; |
int i,j,l,s,ord_l; |
| |
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_l = op[j].length; |
| for ( i = 0; i < n; i++ ) |
for ( i = 0; i < ord_l; i++, s++ ) d[s] = GET_EXP(ndl,s); |
| d[i] = (ndl[i/nd_epw]>>((nd_epw-(i%nd_epw)-1)*nd_bpe)) |
} |
| &((1<<nd_bpe)-1); |
} else { |
| |
for ( i = 0; i < n; i++ ) d[i] = GET_EXP(ndl,i); |
| |
} |
| return dl; |
return dl; |
| } |
} |
| |
|
| ND dptond(DP p) |
void ndl_print(UINT *dl) |
| { |
{ |
| ND d; |
|
| NM m0,m; |
|
| MP t; |
|
| int n; |
int n; |
| |
int i,j,l,ord_l,s,s0; |
| |
struct order_pair *op; |
| |
|
| if ( !p ) |
n = nd_nvar; |
| return 0; |
printf("<<"); |
| n = NV(p); |
if ( nd_blockmask ) { |
| m0 = 0; |
l = nd_blockmask->n; |
| for ( t = BDY(p); t; t = NEXT(t) ) { |
op = nd_blockmask->order_pair; |
| NEXTNM(m0,m); |
for ( j = 0, s = s0 = 0; j < l; j++ ) { |
| m->c = ITOS(t->c); |
ord_l = op[j].length; |
| m->td = t->dl->td; |
for ( i = 0; i < ord_l; i++, s++ ) |
| dltondl(n,t->dl,m->dl); |
printf(s==n-1?"%d":"%d,",GET_EXP(dl,s)); |
| |
} |
| |
} else { |
| |
for ( i = 0; i < n; i++ ) printf(i==n-1?"%d":"%d,",GET_EXP(dl,i)); |
| } |
} |
| NEXT(m) = 0; |
printf(">>"); |
| MKND(n,m0,d); |
|
| d->nv = n; |
|
| d->sugar = p->sugar; |
|
| return d; |
|
| } |
} |
| |
|
| DP ndtodp(ND p) |
void nd_print(ND p) |
| { |
{ |
| DP d; |
NM m; |
| MP m0,m; |
|
| NM t; |
|
| int n; |
|
| |
|
| if ( !p ) |
if ( !p ) |
| return 0; |
printf("0\n"); |
| n = NV(p); |
else { |
| m0 = 0; |
for ( m = BDY(p); m; m = NEXT(m) ) { |
| for ( t = BDY(p); t; t = NEXT(t) ) { |
printf("+%d*",CM(m)); |
| NEXTMP(m0,m); |
ndl_print(DL(m)); |
| m->c = STOI(t->c); |
} |
| m->dl = ndltodl(n,t->td,t->dl); |
printf("\n"); |
| } |
} |
| NEXT(m) = 0; |
|
| MKDP(n,m0,d); |
|
| d->sugar = p->sugar; |
|
| return d; |
|
| } |
} |
| |
|
| void ndl_print(unsigned int *dl) |
void nd_print_q(ND p) |
| { |
{ |
| int n; |
|
| int i; |
|
| |
|
| n = nd_nvar; |
|
| printf("<<"); |
|
| if ( is_rlex ) |
|
| for ( i = 0; i < n; i++ ) |
|
| printf(i==n-1?"%d":"%d,", |
|
| (dl[(n-1-i)/nd_epw]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe)) |
|
| &((1<<nd_bpe)-1)); |
|
| else |
|
| for ( i = 0; i < n; i++ ) |
|
| printf(i==n-1?"%d":"%d,", |
|
| (dl[i/nd_epw]>>((nd_epw-(i%nd_epw)-1)*nd_bpe)) |
|
| &((1<<nd_bpe)-1)); |
|
| printf(">>"); |
|
| } |
|
| |
|
| void nd_print(ND p) |
|
| { |
|
| NM m; |
NM m; |
| |
|
| if ( !p ) |
if ( !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("+"); |
| ndl_print(m->dl); |
printexpr(CO,CQ(m)); |
| |
printf("*"); |
| |
ndl_print(DL(m)); |
| } |
} |
| printf("\n"); |
printf("\n"); |
| } |
} |
| Line 1841 void ndp_print(ND_pairs d) |
|
| Line 2524 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_homogenize(NDV p,int obpe,int oadv,EPOS oepos) |
| |
{ |
| |
int len,i,max; |
| |
NMV m,mr0,mr,t; |
| |
|
| |
len = p->len; |
| |
for ( m = BDY(p), i = 0, max = 0; i < len; NMV_OADV(m), i++ ) |
| |
max = MAX(max,TD(DL(m))); |
| |
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) ) { |
| |
ndl_homogenize(DL(m),DL(t),obpe,oepos,max); |
| |
CQ(mr) = CQ(m); |
| |
ndl_copy(DL(t),DL(mr)); |
| |
} |
| |
NV(p)++; |
| |
BDY(p) = mr0; |
| |
} |
| |
|
| |
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; |
| |
|
| |
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(UINT); |
| |
for ( m = r = BDY(p), i = 0; i < len; NMV_ADV(m), NDV_NADV(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_mul_c_p(VL vl,ND p,P mul) |
| |
{ |
| |
NM m; |
| |
P c; |
| |
|
| |
if ( !p ) return; |
| |
for ( m = BDY(p); m; m = NEXT(m) ) { |
| |
mulp(vl,CP(m),mul,&c); CP(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 1884 void nd_free(ND p) |
|
| Line 2727 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(UINT *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)); |
| ndl_copy(d,m->dl); |
|
| NEXT(m) = nd_red[h]; |
NEXT(m) = nd_red[h]; |
| nd_red[h] = m; |
nd_red[h] = m; |
| } |
} |
| |
|
| unsigned int *dp_compute_bound(DP p) |
UINT *ndv_compute_bound(NDV p) |
| { |
{ |
| unsigned int *d,*d1,*d2,*t; |
UINT *d1,*d2,*t; |
| MP m; |
UINT u; |
| int i,l; |
int i,j,k,l,len,ind; |
| |
NMV m; |
| |
|
| if ( !p ) |
if ( !p ) |
| return 0; |
return 0; |
| d1 = (unsigned int *)ALLOCA(nd_nvar*sizeof(unsigned int)); |
d1 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT)); |
| d2 = (unsigned int *)ALLOCA(nd_nvar*sizeof(unsigned int)); |
d2 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT)); |
| m = BDY(p); |
len = LEN(p); |
| bcopy(m->dl->d,d1,nd_nvar*sizeof(unsigned int)); |
m = BDY(p); ndl_copy(DL(m),d1); NMV_ADV(m); |
| for ( m = NEXT(BDY(p)); m; m = NEXT(m) ) { |
for ( i = 1; i < len; i++, NMV_ADV(m) ) { |
| d = m->dl->d; |
ndl_lcm(DL(m),d1,d2); |
| for ( i = 0; i < nd_nvar; i++ ) |
|
| d2[i] = d[i] > d1[i] ? d[i] : d1[i]; |
|
| t = d1; d1 = d2; d2 = t; |
t = d1; d1 = d2; d2 = t; |
| } |
} |
| l = ((nd_nvar+(sizeof(unsigned int)-1))/sizeof(unsigned int))*sizeof(unsigned int); |
l = nd_nvar+31; |
| t = (unsigned int *)MALLOC_ATOMIC(l*sizeof(unsigned int)); |
t = (UINT *)MALLOC_ATOMIC(l*sizeof(UINT)); |
| bzero(t,l*sizeof(unsigned int)); |
for ( i = nd_exporigin, ind = 0; i < nd_wpd; i++ ) { |
| bcopy(d1,t,nd_nvar*sizeof(unsigned int)); |
u = d1[i]; |
| |
k = (nd_epw-1)*nd_bpe; |
| |
for ( j = 0; j < nd_epw; j++, k -= nd_bpe, ind++ ) |
| |
t[ind] = (u>>k)&nd_mask0; |
| |
} |
| |
for ( ; ind < l; ind++ ) t[ind] = 0; |
| return t; |
return t; |
| } |
} |
| |
|
| unsigned int *nd_compute_bound(ND p) |
int nd_get_exporigin(struct order_spec *ord) |
| { |
{ |
| unsigned int *d1,*d2,*t; |
switch ( ord->id ) { |
| int i; |
case 0: |
| NM m; |
return 1; |
| |
case 1: |
| if ( !p ) |
/* block order */ |
| return 0; |
/* d[0]:weight d[1]:w0,...,d[nd_exporigin-1]:w(n-1) */ |
| d1 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
return ord->ord.block.length+1; |
| d2 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); |
case 2: |
| bcopy(HDL(p),d1,nd_wpd*sizeof(unsigned int)); |
error("nd_get_exporigin : matrix order is not supported yet."); |
| for ( m = NEXT(BDY(p)); m; m = NEXT(m) ) { |
|
| ndl_lcm(m->dl,d1,d2); |
|
| t = d1; d1 = d2; d2 = t; |
|
| } |
} |
| t = (unsigned int *)MALLOC_ATOMIC(nd_nvar*sizeof(unsigned int)); |
|
| bzero(t,nd_nvar*sizeof(unsigned int)); |
|
| for ( i = 0; i < nd_nvar; i++ ) |
|
| t[i] = (d1[i/nd_epw]>>((nd_epw-(i%nd_epw)-1)*nd_bpe))&nd_mask0; |
|
| return t; |
|
| } |
} |
| |
|
| void nd_setup_parameters() { |
void nd_setup_parameters(int nvar,int max) { |
| int i; |
int i,j,n,elen,ord_o,ord_l,l,s; |
| |
struct order_pair *op; |
| |
|
| nd_epw = (sizeof(unsigned int)*8)/nd_bpe; |
/* if max == 0, don't touch nd_bpe */ |
| nd_wpd = nd_nvar/nd_epw+(nd_nvar%nd_epw?1:0); |
if ( max > 0 ) { |
| |
if ( max < 2 ) nd_bpe = 1; |
| |
if ( max < 4 ) nd_bpe = 2; |
| |
else if ( max < 8 ) nd_bpe = 3; |
| |
else if ( max < 16 ) nd_bpe = 4; |
| |
else if ( max < 32 ) nd_bpe = 5; |
| |
else if ( max < 64 ) nd_bpe = 6; |
| |
else if ( max < 256 ) nd_bpe = 8; |
| |
else if ( max < 1024 ) nd_bpe = 10; |
| |
else if ( max < 65536 ) nd_bpe = 16; |
| |
else nd_bpe = 32; |
| |
} |
| |
/* nvar == 0, don't touch nd_nvar */ |
| |
if ( nvar > 0 ) nd_nvar = nvar; |
| |
|
| |
nd_epw = (sizeof(UINT)*8)/nd_bpe; |
| |
elen = nd_nvar/nd_epw+(nd_nvar%nd_epw?1:0); |
| |
|
| |
nd_exporigin = nd_get_exporigin(nd_ord); |
| |
nd_wpd = nd_exporigin+elen; |
| |
|
| if ( nd_bpe < 32 ) { |
if ( nd_bpe < 32 ) { |
| nd_mask0 = (1<<nd_bpe)-1; |
nd_mask0 = (1<<nd_bpe)-1; |
| } else { |
} else { |
| Line 1961 void nd_setup_parameters() { |
|
| Line 2825 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); |
| } |
} |
| #if USE_NDV |
nm_adv = sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT); |
| nmv_adv = sizeof(struct oNMV)+(nd_wpd-1)*sizeof(unsigned int); |
nmv_adv = sizeof(struct oNMV)+(nd_wpd-1)*sizeof(UINT); |
| #endif |
nd_epos = nd_create_epos(nd_ord); |
| |
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,mr0,mr,m; |
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; |
| if ( obpe < 4 ) |
oadv = nmv_adv; |
| nd_bpe = 4; |
oepos = nd_epos; |
| else if ( obpe < 6 ) |
if ( obpe < 2 ) nd_bpe = 2; |
| nd_bpe = 6; |
else if ( obpe < 3 ) nd_bpe = 3; |
| else if ( obpe < 8 ) |
else if ( obpe < 4 ) nd_bpe = 4; |
| nd_bpe = 8; |
else if ( obpe < 5 ) nd_bpe = 5; |
| else if ( obpe < 16 ) |
else if ( obpe < 6 ) nd_bpe = 6; |
| nd_bpe = 16; |
else if ( obpe < 8 ) nd_bpe = 8; |
| else if ( obpe < 32 ) |
else if ( obpe < 10 ) nd_bpe = 10; |
| nd_bpe = 32; |
else if ( obpe < 16 ) nd_bpe = 16; |
| else |
else if ( obpe < 32 ) nd_bpe = 32; |
| error("nd_reconstruct : exponent too large"); |
else error("nd_reconstruct : exponent too large"); |
| |
|
| nd_setup_parameters(); |
nd_setup_parameters(0,0); |
| prev_nm_free_list = _nm_free_list; |
prev_nm_free_list = _nm_free_list; |
| prev_ndp_free_list = _ndp_free_list; |
prev_ndp_free_list = _ndp_free_list; |
| _nm_free_list = 0; |
_nm_free_list = 0; |
| _ndp_free_list = 0; |
_ndp_free_list = 0; |
| for ( i = 0; i < nd_psn; i++ ) { |
for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_ps[i],obpe,oadv,oepos); |
| nd_ps[i] = nd_dup(nd_ps[i],obpe); |
if ( trace ) |
| #if USE_NDV |
for ( i = nd_psn-1; i >= 0; i-- ) |
| nd_psv[i] = ndtondv(nd_ps[i]); |
ndv_realloc(nd_ps_trace[i],obpe,oadv,oepos); |
| #endif |
|
| } |
|
| 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(LCM(t),LCM(s),obpe,oepos); |
| ndl_dup(obpe,t->lcm,s->lcm); |
|
| } |
} |
| |
|
| |
old_red = (RHist *)ALLOCA(REDTAB_LEN*sizeof(RHist)); |
| for ( i = 0; i < REDTAB_LEN; i++ ) { |
for ( i = 0; i < REDTAB_LEN; i++ ) { |
| for ( mr0 = 0, m = nd_red[i]; m; m = NEXT(m) ) { |
old_red[i] = nd_red[i]; |
| NEXTNM(mr0,mr); |
nd_red[i] = 0; |
| mr->c = m->c; |
} |
| mr->td = m->td; |
for ( i = 0; i < REDTAB_LEN; i++ ) |
| ndl_dup(obpe,m->dl,mr->dl); |
for ( r = old_red[i]; r; r = NEXT(r) ) { |
| |
NEWRHist(mr); |
| |
mr->index = r->index; |
| |
SG(mr) = SG(r); |
| |
ndl_reconstruct(DL(r),DL(mr),obpe,oepos); |
| |
h = ndl_hash_value(DL(mr)); |
| |
NEXT(mr) = nd_red[h]; |
| |
nd_red[h] = mr; |
| } |
} |
| if ( mr0 ) NEXT(mr) = 0; |
for ( i = 0; i < REDTAB_LEN; i++ ) old_red[i] = 0; |
| nd_red[i] = mr0; |
old_red = 0; |
| |
for ( i = 0; i < nd_psn; i++ ) { |
| |
NEWRHist(r); SG(r) = SG(nd_psh[i]); |
| |
ndl_reconstruct(DL(nd_psh[i]),DL(r),obpe,oepos); |
| |
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; |
| #if USE_NDV |
|
| BDY(ndv_red) = (NMV)REALLOC(BDY(ndv_red),nmv_len*nmv_adv); |
|
| #endif |
|
| 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; |
| |
UINT **bound; |
| |
NM prev_nm_free_list; |
| |
RHist mr0,mr; |
| |
RHist r; |
| |
RHist *old_red; |
| |
ND_pairs s0,s,t,prev_ndp_free_list; |
| |
EPOS oepos; |
| |
|
| |
obpe = nd_bpe; |
| |
oadv = nmv_adv; |
| |
oepos = nd_epos; |
| |
if ( obpe < 2 ) nd_bpe = 2; |
| |
else if ( obpe < 3 ) nd_bpe = 3; |
| |
else if ( obpe < 4 ) nd_bpe = 4; |
| |
else if ( obpe < 5 ) nd_bpe = 5; |
| |
else if ( obpe < 6 ) nd_bpe = 6; |
| |
else if ( obpe < 8 ) nd_bpe = 8; |
| |
else if ( obpe < 10 ) nd_bpe = 10; |
| |
else if ( obpe < 16 ) nd_bpe = 16; |
| |
else if ( obpe < 32 ) nd_bpe = 32; |
| |
else error("nd_reconstruct_direct : exponent too large"); |
| |
|
| |
nd_setup_parameters(0,0); |
| |
prev_nm_free_list = _nm_free_list; |
| |
prev_ndp_free_list = _ndp_free_list; |
| |
_nm_free_list = 0; _ndp_free_list = 0; |
| |
for ( i = len-1; i >= 0; i-- ) ndv_realloc(ps[i],obpe,oadv,oepos); |
| |
prev_nm_free_list = 0; |
| |
prev_ndp_free_list = 0; |
| |
GC_gcollect(); |
| |
} |
| |
|
| |
void ndl_reconstruct(UINT *d,UINT *r,int obpe,EPOS oepos) |
| |
{ |
| |
int n,i,ei,oepw,omask0,j,s,ord_l,l; |
| |
struct order_pair *op; |
| |
|
| n = nd_nvar; |
n = nd_nvar; |
| oepw = (sizeof(unsigned int)*8)/obpe; |
oepw = (sizeof(UINT)*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_l = op[j].length; |
| |
for ( i = 0; i < ord_l; i++, s++ ) { |
| |
ei = GET_EXP_OLD(d,s); |
| |
PUT_EXP(r,s,ei); |
| |
} |
| } |
} |
| else |
} else { |
| for ( i = 0; i < n; i++ ) { |
for ( i = 0; i < n; i++ ) { |
| ei = (d[i/oepw]>>((oepw-(i%oepw)-1)*obpe)) |
ei = GET_EXP_OLD(d,i); |
| &((1<<obpe)-1); |
PUT_EXP(r,i,ei); |
| r[i/cepw] |= (ei<<((cepw-(i%cepw)-1)*cbpe)); |
|
| } |
} |
| |
} |
| } |
} |
| |
|
| 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 2057 ND nd_dup(ND p,int obpe) |
|
| Line 2976 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; |
| } |
} |
| } |
} |
| |
|
| ND nd_copy(ND p) |
int nd_sp(int mod,int trace,ND_pairs p,ND *rp) |
| { |
{ |
| NM m,mr,mr0; |
NM m; |
| int c,n,s; |
NDV p1,p2; |
| ND r; |
ND t1,t2; |
| |
UINT *lcm; |
| |
int td; |
| |
|
| if ( !p ) |
if ( trace ) { |
| |
p1 = nd_ps_trace[p->i1]; p2 = nd_ps_trace[p->i2]; |
| |
} else { |
| |
p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2]; |
| |
} |
| |
lcm = LCM(p); |
| |
NEWNM(m); |
| |
CQ(m) = HCQ(p2); |
| |
ndl_sub(lcm,HDL(p1),DL(m)); |
| |
if ( ndl_check_bound2(p->i1,DL(m)) ) |
| return 0; |
return 0; |
| |
t1 = ndv_mul_nm(mod,m,p1); |
| |
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,m,p2); |
| |
*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 weyl_ndv_mul_nm(int mod,NM m0,NDV p) { |
| |
int n2,i,j,l,n,tlen; |
| |
UINT *d0; |
| |
NM *tab,*psum; |
| |
ND s,r; |
| |
NM t; |
| |
NMV m1; |
| |
|
| |
if ( !p ) return 0; |
| |
n = NV(p); n2 = n>>1; |
| |
d0 = DL(m0); |
| |
l = LEN(p); |
| |
for ( i = 0, tlen = 1; i < n2; i++ ) tlen *= (GET_EXP(d0,n2+i)+1); |
| |
tab = (NM *)ALLOCA(tlen*sizeof(NM)); |
| |
psum = (NM *)ALLOCA(tlen*sizeof(NM)); |
| |
for ( i = 0; i < tlen; i++ ) psum[i] = 0; |
| |
m1 = (NMV)(((char *)BDY(p))+nmv_adv*(l-1)); |
| |
for ( i = l-1; i >= 0; i--, NMV_PREV(m1) ) { |
| |
/* m0(NM) * m1(NMV) => tab(NM) */ |
| |
weyl_mul_nm_nmv(n,mod,m0,m1,tab,tlen); |
| |
for ( j = 0; j < tlen; j++ ) { |
| |
if ( tab[j] ) { |
| |
NEXT(tab[j]) = psum[j]; psum[j] = tab[j]; |
| |
} |
| |
} |
| |
} |
| |
for ( i = tlen-1, r = 0; i >= 0; i-- ) |
| |
if ( psum[i] ) { |
| |
for ( j = 0, t = psum[i]; t; t = NEXT(t), j++ ); |
| |
MKND(n,psum[i],j,s); |
| |
r = nd_add(mod,r,s); |
| |
} |
| |
if ( r ) SG(r) = SG(p)+TD(d0); |
| |
return r; |
| |
} |
| |
|
| |
/* product of monomials */ |
| |
/* XXX block order is not handled correctly */ |
| |
|
| |
void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *tab,int tlen) |
| |
{ |
| |
int i,n2,j,s,curlen,homo,h,a,b,k,l,u,min; |
| |
UINT *d0,*d1,*d,*dt,*ctab; |
| |
Q *ctab_q; |
| |
Q q,q1; |
| |
UINT c0,c1,c; |
| |
NM *p; |
| |
NM m,t; |
| |
|
| |
for ( i = 0; i < tlen; i++ ) tab[i] = 0; |
| |
if ( !m0 || !m1 ) return; |
| |
d0 = DL(m0); d1 = DL(m1); n2 = n>>1; |
| |
NEWNM(m); d = DL(m); |
| |
if ( mod ) { |
| |
c0 = CM(m0); c1 = CM(m1); DMAR(c0,c1,0,mod,c); CM(m) = c; |
| |
} else |
| |
mulq(CQ(m0),CQ(m1),&CQ(m)); |
| |
for ( i = 0; i < nd_wpd; i++ ) d[i] = 0; |
| |
homo = n&1 ? 1 : 0; |
| |
if ( homo ) { |
| |
/* offset of h-degree */ |
| |
h = GET_EXP(d0,n-1)+GET_EXP(d1,n-1); |
| |
PUT_EXP(DL(m),n-1,h); |
| |
TD(DL(m)) = h; |
| |
if ( nd_blockmask ) ndl_weight_mask(DL(m)); |
| |
} |
| |
tab[0] = m; |
| |
NEWNM(m); d = DL(m); |
| |
for ( i = 0, curlen = 1; i < n2; i++ ) { |
| |
a = GET_EXP(d0,i); b = GET_EXP(d1,n2+i); |
| |
k = GET_EXP(d0,n2+i); l = GET_EXP(d1,i); |
| |
/* xi^a*(Di^k*xi^l)*Di^b */ |
| |
a += l; b += k; |
| |
s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i); |
| |
if ( !k || !l ) { |
| |
for ( j = 0; j < curlen; j++ ) |
| |
if ( t = tab[j] ) { |
| |
dt = DL(t); |
| |
PUT_EXP(dt,i,a); PUT_EXP(dt,n2+i,b); TD(dt) += s; |
| |
if ( nd_blockmask ) ndl_weight_mask(dt); |
| |
} |
| |
curlen *= k+1; |
| |
continue; |
| |
} |
| |
min = MIN(k,l); |
| |
if ( mod ) { |
| |
ctab = (UINT *)ALLOCA((min+1)*sizeof(UINT)); |
| |
mkwcm(k,l,mod,ctab); |
| |
} else { |
| |
ctab_q = (Q *)ALLOCA((min+1)*sizeof(Q)); |
| |
mkwc(k,l,ctab_q); |
| |
} |
| |
for ( j = min; j >= 0; j-- ) { |
| |
for ( u = 0; u < nd_wpd; u++ ) d[u] = 0; |
| |
PUT_EXP(d,i,a-j); PUT_EXP(d,n2+i,b-j); |
| |
h = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i); |
| |
if ( homo ) { |
| |
TD(d) = s; |
| |
PUT_EXP(d,n-1,s-h); |
| |
} else TD(d) = h; |
| |
if ( nd_blockmask ) ndl_weight_mask(d); |
| |
if ( mod ) c = ctab[j]; |
| |
else q = ctab_q[j]; |
| |
p = tab+curlen*j; |
| |
if ( j == 0 ) { |
| |
for ( u = 0; u < curlen; u++, p++ ) { |
| |
if ( tab[u] ) { |
| |
ndl_addto(DL(tab[u]),d); |
| |
if ( mod ) { |
| |
c0 = CM(tab[u]); DMAR(c0,c,0,mod,c1); CM(tab[u]) = c1; |
| |
} else { |
| |
mulq(CQ(tab[u]),q,&q1); CQ(tab[u]) = q1; |
| |
} |
| |
} |
| |
} |
| |
} else { |
| |
for ( u = 0; u < curlen; u++, p++ ) { |
| |
if ( tab[u] ) { |
| |
NEWNM(t); |
| |
ndl_add(DL(tab[u]),d,DL(t)); |
| |
if ( mod ) { |
| |
c0 = CM(tab[u]); DMAR(c0,c,0,mod,c1); CM(t) = c1; |
| |
} else |
| |
mulq(CQ(tab[u]),q,&CQ(t)); |
| |
*p = t; |
| |
} |
| |
} |
| |
} |
| |
} |
| |
curlen *= k+1; |
| |
} |
| |
FREENM(m); |
| |
} |
| |
|
| |
ND ndv_mul_nm_symbolic(NM m0,NDV p) |
| |
{ |
| |
NM mr,mr0; |
| |
NMV m; |
| |
UINT *d,*dt,*dm; |
| |
int c,n,td,i,c1,c2,len; |
| |
Q q; |
| |
ND r; |
| |
|
| |
if ( !p ) return 0; |
| else { |
else { |
| s = sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int); |
n = NV(p); m = BDY(p); |
| for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
d = DL(m0); |
| |
len = LEN(p); |
| |
mr0 = 0; |
| |
td = TD(d); |
| |
c = CM(m0); |
| |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
| NEXTNM(mr0,mr); |
NEXTNM(mr0,mr); |
| C(mr) = C(m); |
CM(mr) = 1; |
| mr->td = m->td; |
ndl_add(DL(m),d,DL(mr)); |
| ndl_copy(m->dl,mr->dl); |
|
| } |
} |
| NEXT(mr) = 0; |
NEXT(mr) = 0; |
| MKND(NV(p),mr0,r); |
MKND(NV(p),mr0,len,r); |
| r->sugar = p->sugar; |
SG(r) = SG(p) + TD(d); |
| return r; |
return r; |
| } |
} |
| } |
} |
| |
|
| #if USE_NDV |
ND ndv_mul_nm(int mod,NM m0,NDV p) |
| void ndv_mul_nm(NDV p,NM m0,NDV r) |
|
| { |
{ |
| NMV m,mr,mr0; |
NM mr,mr0; |
| unsigned int *d,*dt,*dm; |
NMV m; |
| |
UINT *d,*dt,*dm; |
| int c,n,td,i,c1,c2,len; |
int c,n,td,i,c1,c2,len; |
| |
Q q; |
| |
ND r; |
| |
|
| if ( !p ) |
if ( !p ) return 0; |
| /* XXX */ |
else if ( do_weyl ) |
| r->len = 0; |
return weyl_ndv_mul_nm(mod,m0,p); |
| else { |
else { |
| n = NV(p); m = BDY(p); len = p->len; |
n = NV(p); m = BDY(p); |
| d = m0->dl; td = m0->td; c = C(m0); |
d = DL(m0); |
| mr = BDY(r); |
len = LEN(p); |
| for ( i = 0; i < len; i++, NMV_ADV(m), NMV_ADV(mr) ) { |
mr0 = 0; |
| c1 = C(m); |
td = TD(d); |
| DMAR(c1,c,0,nd_mod,c2); |
if ( mod ) { |
| C(mr) = c2; |
c = CM(m0); |
| mr->td = m->td+td; |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
| ndl_add(m->dl,d,mr->dl); |
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)); |
| |
} |
| } |
} |
| NV(r) = NV(p); |
NEXT(mr) = 0; |
| r->len = p->len; |
MKND(NV(p),mr0,len,r); |
| r->sugar = p->sugar + td; |
SG(r) = SG(p) + TD(d); |
| |
return r; |
| } |
} |
| } |
} |
| |
|
| ND ndv_add(ND p1,NDV p2) |
void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos) |
| { |
{ |
| int c,c1,c2,t,td,td2,mul,len,i; |
NMV m,mr,mr0,t; |
| NM prev,head,cur,new; |
int len,i,k; |
| unsigned int *d; |
|
| NMV m2; |
|
| |
|
| if ( !p1 ) |
if ( !p ) return; |
| |
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(DL(m),DL(t),obpe,oepos); |
| |
CQ(mr) = CQ(t); |
| |
ndl_copy(DL(t),DL(mr)); |
| |
} |
| |
BDY(p) = mr0; |
| |
} |
| |
|
| |
NDV ndv_dup_realloc(NDV p,int obpe,int oadv,EPOS oepos) |
| |
{ |
| |
NMV m,mr,mr0; |
| |
int len,i; |
| |
NDV r; |
| |
|
| |
if ( !p ) return 0; |
| |
m = BDY(p); len = LEN(p); |
| |
mr0 = mr = (NMV)MALLOC(len*nmv_adv); |
| |
for ( i = 0; i < len; i++, NMV_OADV(m), NMV_ADV(mr) ) { |
| |
ndl_zero(DL(mr)); |
| |
ndl_reconstruct(DL(m),DL(mr),obpe,oepos); |
| |
CQ(mr) = CQ(m); |
| |
} |
| |
MKNDV(NV(p),mr0,len,r); |
| |
SG(r) = SG(p); |
| |
return r; |
| |
} |
| |
|
| |
/* duplicate p */ |
| |
|
| |
NDV ndv_dup(int mod,NDV p) |
| |
{ |
| |
NDV d; |
| |
NMV t,m,m0; |
| |
int i,len; |
| |
|
| |
if ( !p ) return 0; |
| |
len = LEN(p); |
| |
m0 = m = (NMV)(mod?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv)); |
| |
for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t), NMV_ADV(m) ) { |
| |
ndl_copy(DL(t),DL(m)); |
| |
CQ(m) = CQ(t); |
| |
} |
| |
MKNDV(NV(p),m0,len,d); |
| |
SG(d) = SG(p); |
| |
return d; |
| |
} |
| |
|
| |
ND nd_dup(ND p) |
| |
{ |
| |
ND d; |
| |
NM t,m,m0; |
| |
|
| |
if ( !p ) return 0; |
| |
for ( m0 = 0, t = BDY(p); t; t = NEXT(t) ) { |
| |
NEXTNM(m0,m); |
| |
ndl_copy(DL(t),DL(m)); |
| |
CQ(m) = CQ(t); |
| |
} |
| |
if ( m0 ) NEXT(m) = 0; |
| |
MKND(NV(p),m0,LEN(p),d); |
| |
SG(d) = SG(p); |
| |
return d; |
| |
} |
| |
|
| |
/* XXX if p->len == 0 then it represents 0 */ |
| |
|
| |
void ndv_mod(int mod,NDV p) |
| |
{ |
| |
NMV t,d; |
| |
int r; |
| |
int i,len,dlen; |
| |
|
| |
if ( !p ) return; |
| |
len = LEN(p); |
| |
dlen = 0; |
| |
for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) { |
| |
r = rem(NM(CQ(t)),mod); |
| |
if ( r ) { |
| |
if ( SGN(CQ(t)) < 0 ) |
| |
r = mod-r; |
| |
CM(d) = r; |
| |
ndl_copy(DL(t),DL(d)); |
| |
NMV_ADV(d); |
| |
dlen++; |
| |
} |
| |
} |
| |
LEN(p) = dlen; |
| |
} |
| |
|
| |
NDV ptondv(VL vl,VL dvl,P p) |
| |
{ |
| |
ND nd; |
| |
|
| |
nd = ptond(vl,dvl,p); |
| |
return ndtondv(0,nd); |
| |
} |
| |
|
| |
ND ptond(VL vl,VL dvl,P p) |
| |
{ |
| |
int n,i,j,k,e; |
| |
VL tvl; |
| |
V v; |
| |
DCP dc; |
| |
DCP *w; |
| |
ND r,s,t,u; |
| |
P x; |
| |
int c; |
| |
UINT *d; |
| |
NM m,m0; |
| |
|
| |
if ( !p ) |
| return 0; |
return 0; |
| else { |
else if ( NUM(p) ) { |
| prev = 0; head = cur = BDY(p1); |
NEWNM(m); |
| NEWNM(new); |
ndl_zero(DL(m)); |
| len = p2->len; |
CQ(m) = (Q)p; |
| for ( m2 = BDY(p2), i = 0; i < len; ) { |
NEXT(m) = 0; |
| td2 = new->td = m2->td; |
MKND(nd_nvar,m,1,r); |
| if ( !cur ) { |
SG(r) = 0; |
| C(new) = C(m2); |
return r; |
| ndl_copy(m2->dl,new->dl); |
} else { |
| if ( !prev ) { |
for ( dc = DC(p), k = 0; dc; dc = NEXT(dc), k++ ); |
| prev = new; |
w = (DCP *)ALLOCA(k*sizeof(DCP)); |
| NEXT(prev) = 0; |
for ( dc = DC(p), j = 0; j < k; dc = NEXT(dc), j++ ) w[j] = dc; |
| head = prev; |
for ( i = 0, tvl = dvl, v = VR(p); |
| } else { |
vl && tvl->v != v; tvl = NEXT(tvl), i++ ); |
| NEXT(prev) = new; |
if ( !tvl ) { |
| NEXT(new) = 0; |
for ( j = k-1, s = 0, MKV(v,x); j >= 0; j-- ) { |
| prev = new; |
t = ptond(vl,dvl,COEF(w[j])); |
| } |
pwrp(vl,x,DEG(w[j]),&p); |
| NMV_ADV(m2); i++; |
nd_mul_c_p(CO,t,p); s = nd_add(0,s,t); |
| NEWNM(new); |
|
| continue; |
|
| } |
} |
| if ( cur->td > td2 ) |
return s; |
| c = 1; |
} else { |
| else if ( cur->td < td2 ) |
NEWNM(m0); d = DL(m0); |
| c = -1; |
for ( j = k-1, s = 0; j >= 0; j-- ) { |
| else |
ndl_zero(d); e = QTOS(DEG(w[j])); PUT_EXP(d,i,e); |
| c = ndl_compare(cur->dl,m2->dl); |
TD(d) = MUL_WEIGHT(e,i); |
| switch ( c ) { |
if ( nd_blockmask) ndl_weight_mask(d); |
| case 0: |
t = ptond(vl,dvl,COEF(w[j])); |
| t = C(m2)+C(cur)-nd_mod; |
for ( m = BDY(t); m; m = NEXT(m) ) |
| if ( t < 0 ) |
ndl_addto(DL(m),d); |
| t += nd_mod; |
SG(t) += TD(d); |
| if ( t ) |
s = nd_add(0,s,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: |
|
| ndl_copy(m2->dl,new->dl); |
|
| if ( !prev ) { |
|
| /* cur = head */ |
|
| prev = new; |
|
| C(prev) = C(m2); |
|
| NEXT(prev) = head; |
|
| head = prev; |
|
| } else { |
|
| C(new) = C(m2); |
|
| NEXT(prev) = new; |
|
| NEXT(new) = cur; |
|
| prev = new; |
|
| } |
|
| NEWNM(new); |
|
| NMV_ADV(m2); i++; |
|
| break; |
|
| } |
} |
| |
FREENM(m0); |
| |
return s; |
| } |
} |
| FREENM(new); |
} |
| if ( head ) { |
} |
| BDY(p1) = head; |
|
| p1->sugar = MAX(p1->sugar,p2->sugar); |
P ndvtop(int mod,VL vl,VL dvl,NDV p) |
| return p1; |
{ |
| } else { |
VL tvl; |
| FREEND(p1); |
int len,n,j,i,e; |
| return 0; |
NMV m; |
| |
Q q; |
| |
P c; |
| |
UINT *d; |
| |
P s,r,u,t,w; |
| |
|
| |
if ( !p ) return 0; |
| |
else { |
| |
len = LEN(p); |
| |
n = NV(p); |
| |
m = (NMV)(((char *)BDY(p))+nmv_adv*(len-1)); |
| |
for ( j = len-1, s = 0; j >= 0; j--, NMV_PREV(m) ) { |
| |
if ( mod ) { |
| |
STOQ(CM(m),q); c = (P)q; |
| |
} else |
| |
c = CP(m); |
| |
d = DL(m); |
| |
for ( i = 0, t = c, tvl = dvl; i < n; tvl = NEXT(tvl), i++ ) { |
| |
MKV(tvl->v,r); e = GET_EXP(d,i); STOQ(e,q); |
| |
pwrp(vl,r,q,&u); mulp(vl,t,u,&w); t = w; |
| |
} |
| |
addp(vl,s,t,&u); s = u; |
| } |
} |
| |
return s; |
| } |
} |
| } |
} |
| |
|
| NDV ndtondv(ND p) |
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)); |
| ndl_copy(t->dl,m->dl); |
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; |
| |
} |
| |
|
| 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"); |
| } |
} |
| } |
} |
| #endif |
|
| |
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 ndv_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; |
| |
case 11: |
| |
/* XXX */ |
| |
nd_dcomp = 0; |
| |
nd_isrlex = 1; |
| |
ndl_compare_function = ndl_ww_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; |
| |
UINT *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 = (UINT **)MALLOC(n*sizeof(UINT *)); |
| |
for ( i = 0, s = 0; i < n; i++ ) { |
| |
bm->mask[i] = t = (UINT *)MALLOC_ATOMIC(nd_wpd*sizeof(UINT)); |
| |
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; |
| |
} |
| |
|
| |
EPOS nd_create_epos(struct order_spec *ord) |
| |
{ |
| |
int i,j,l,s,ord_l,ord_o; |
| |
EPOS epos; |
| |
struct order_pair *op; |
| |
|
| |
epos = (EPOS)MALLOC_ATOMIC(nd_nvar*sizeof(struct oEPOS)); |
| |
switch ( ord->id ) { |
| |
case 0: |
| |
if ( nd_isrlex ) { |
| |
for ( i = 0; i < nd_nvar; i++ ) { |
| |
epos[i].i = nd_exporigin + (nd_nvar-1-i)/nd_epw; |
| |
epos[i].s = (nd_epw-((nd_nvar-1-i)%nd_epw)-1)*nd_bpe; |
| |
} |
| |
} else { |
| |
for ( i = 0; i < nd_nvar; i++ ) { |
| |
epos[i].i = nd_exporigin + i/nd_epw; |
| |
epos[i].s = (nd_epw-(i%nd_epw)-1)*nd_bpe; |
| |
} |
| |
} |
| |
break; |
| |
case 1: |
| |
/* block order */ |
| |
l = ord->ord.block.length; |
| |
op = ord->ord.block.order_pair; |
| |
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++ ) { |
| |
epos[s+i].i = nd_exporigin + (s+ord_l-i-1)/nd_epw; |
| |
epos[s+i].s = (nd_epw-((s+ord_l-i-1)%nd_epw)-1)*nd_bpe; |
| |
} |
| |
else |
| |
for ( i = 0; i < ord_l; i++ ) { |
| |
epos[s+i].i = nd_exporigin + (s+i)/nd_epw; |
| |
epos[s+i].s = (nd_epw-((s+i)%nd_epw)-1)*nd_bpe; |
| |
} |
| |
s += ord_l; |
| |
} |
| |
break; |
| |
case 2: |
| |
error("nd_create_epos : matrix order is not supported yet."); |
| |
} |
| |
return epos; |
| |
} |
| |
|
| |
/* external interface */ |
| |
|
| |
void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec *ord,P *rp) |
| |
{ |
| |
NODE t,in0,in; |
| |
ND nd,nf; |
| |
NDV ndv; |
| |
VL vv,tv; |
| |
int stat,nvar,max,e; |
| |
|
| |
pltovl(v,&vv); |
| |
nvar = length(vv); |
| |
|
| |
/* get the degree bound */ |
| |
for ( t = BDY(g), max = 0; t; t = NEXT(t) ) |
| |
for ( tv = vv; tv; tv = NEXT(tv) ) { |
| |
e = getdeg(tv->v,(P)BDY(t)); |
| |
max = MAX(e,max); |
| |
} |
| |
for ( tv = vv; tv; tv = NEXT(tv) ) { |
| |
e = getdeg(tv->v,f); |
| |
max = MAX(e,max); |
| |
} |
| |
|
| |
nd_init_ord(ord); |
| |
nd_setup_parameters(nvar,max); |
| |
|
| |
/* conversion to ndv */ |
| |
for ( in0 = 0, t = BDY(g); t; t = NEXT(t) ) { |
| |
NEXTNODE(in0,in); |
| |
BDY(in) = (pointer)ptondv(CO,vv,(P)BDY(t)); |
| |
} |
| |
NEXTNODE(in0,in); |
| |
BDY(in) = (pointer)ptondv(CO,vv,f); |
| |
NEXT(in) = 0; |
| |
|
| |
ndv_setup(m,0,in0); |
| |
nd_psn--; |
| |
nd_scale=2; |
| |
while ( 1 ) { |
| |
nd = (pointer)ndvtond(m,nd_ps[nd_psn]); |
| |
stat = nd_nf(m,nd,nd_ps,1,&nf); |
| |
if ( !stat ) { |
| |
nd_psn++; |
| |
nd_reconstruct(m,0,0); |
| |
nd_psn--; |
| |
} else |
| |
break; |
| |
} |
| |
*rp = ndvtop(m,CO,vv,ndtondv(m,nf)); |
| |
} |
| |
|
| |
int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r) |
| |
{ |
| |
NM m; |
| |
UINT *t,*s; |
| |
int i; |
| |
|
| |
for ( i = 0; i < n; i++ ) r[i] = 0; |
| |
for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) { |
| |
t = DL(m); |
| |
for ( ; !ndl_equal(t,s); s += nd_wpd, i++ ); |
| |
r[i] = CM(m); |
| |
} |
| |
for ( i = 0; !r[i]; i++ ); |
| |
return i; |
| |
} |
| |
|
| |
int nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_pair pair,UINT *r) |
| |
{ |
| |
NM m; |
| |
NMV mr; |
| |
UINT *d,*t,*s; |
| |
NDV p; |
| |
int i,j,len; |
| |
|
| |
m = pair->mul; |
| |
d = DL(m); |
| |
p = nd_ps[pair->index]; |
| |
t = (UINT *)ALLOCA(nd_wpd*sizeof(UINT)); |
| |
for ( i = 0; i < n; i++ ) r[i] = 0; |
| |
len = LEN(p); |
| |
for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) { |
| |
ndl_add(d,DL(mr),t); |
| |
for ( ; !ndl_equal(t,s); s += nd_wpd, i++ ); |
| |
r[i] = CM(mr); |
| |
} |
| |
for ( i = 0; !r[i]; i++ ); |
| |
return i; |
| |
} |
| |
|
| |
void nm_ind_pair_to_vect_compress(int mod,UINT *s0,int n,NM_ind_pair pair,UINT *r,int *ind) |
| |
{ |
| |
NM m; |
| |
NMV mr; |
| |
UINT *d,*t,*s; |
| |
NDV p; |
| |
int i,j,len; |
| |
|
| |
m = pair->mul; |
| |
d = DL(m); |
| |
p = nd_ps[pair->index]; |
| |
len = LEN(p); |
| |
t = (UINT *)ALLOCA(nd_wpd*sizeof(UINT)); |
| |
for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) { |
| |
ndl_add(d,DL(mr),t); |
| |
for ( ; !ndl_equal(t,s); s += nd_wpd, i++ ); |
| |
r[j] = CM(mr); |
| |
ind[j] = i; |
| |
} |
| |
} |
| |
|
| |
NODE nd_f4(int m) |
| |
{ |
| |
int i,nh,stat,index; |
| |
NODE r,g; |
| |
ND_pairs d,l,t; |
| |
ND spol,red; |
| |
NDV nf; |
| |
NM_ind_pair pair,pair1,pair2; |
| |
NM s0,s; |
| |
NODE sp0,sp,rp0,rp; |
| |
RHist h; |
| |
int nsp,nred,col,rank,len,k,j; |
| |
NMV mr0,mr; |
| |
UINT c,c1,c2,c3; |
| |
NM mul,head; |
| |
UINT **spmat; |
| |
UINT *s0vect,*rvect,*svect,*p,*ivect; |
| |
int *colstat; |
| |
int sugar,pos; |
| |
PGeoBucket bucket; |
| |
int t_0,t_1,t_2,t_3,t_4,t_5,t_c,t_e,t_20,t_21; |
| |
|
| |
if ( !m ) |
| |
error("nd_f4 : not implemented"); |
| |
|
| |
g = 0; d = 0; |
| |
for ( i = 0; i < nd_psn; i++ ) { |
| |
d = update_pairs(d,g,i); |
| |
g = update_base(g,i); |
| |
} |
| |
while ( d ) { |
| |
l = nd_minsugarp(d,&d); |
| |
sugar = SG(l); |
| |
sp0 = 0; |
| |
bucket = create_pbucket(); |
| |
t_0 = clock(); |
| |
for ( t = l, nsp = 0; t; t = NEXT(t) ) { |
| |
stat = nd_sp(m,0,t,&spol); |
| |
if ( !stat ) goto again; |
| |
if ( spol ) { |
| |
NEXTNODE(sp0,sp); BDY(sp) = (pointer)nd_dup(spol); |
| |
add_pbucket_symbolic(bucket,spol); |
| |
nsp++; |
| |
} |
| |
} |
| |
if ( sp0 ) NEXT(sp) = 0; |
| |
s0 = 0; |
| |
rp0 = 0; |
| |
while ( 1 ) { |
| |
head = remove_head_pbucket_symbolic(bucket); |
| |
if ( !head ) break; |
| |
if ( !s0 ) s0 = head; |
| |
else NEXT(s) = head; |
| |
s = head; |
| |
index = ndl_find_reducer(DL(head)); |
| |
if ( index >= 0 ) { |
| |
h = nd_psh[index]; |
| |
NEWNM(mul); |
| |
ndl_sub(DL(head),DL(h),DL(mul)); |
| |
if ( ndl_check_bound2(index,DL(mul)) ) goto again; |
| |
MKNM_ind_pair(pair,mul,index); |
| |
red = ndv_mul_nm_symbolic(mul,nd_ps[index]); |
| |
add_pbucket_symbolic(bucket,nd_remove_head(red)); |
| |
NEXTNODE(rp0,rp); BDY(rp) = (pointer)pair; |
| |
nred++; |
| |
} |
| |
} |
| |
t_1 = clock(); |
| |
if ( s0 ) NEXT(s) = 0; |
| |
for ( i = 0, s = s0; s; s = NEXT(s), i++ ); |
| |
col = i; |
| |
s0vect = (UINT *)MALLOC(col*nd_wpd*sizeof(UINT)); |
| |
for ( i = 0, p = s0vect, s = s0; i < col; |
| |
i++, p += nd_wpd, s = NEXT(s) ) ndl_copy(DL(s),p); |
| |
spmat = (UINT **)MALLOC(nsp*sizeof(UINT *)); |
| |
for ( i = 0, sp = sp0; i < nsp; i++, sp = NEXT(sp) ) { |
| |
spmat[i] = (UINT *)MALLOC(col*sizeof(UINT)); |
| |
nd_to_vect(m,s0vect,col,BDY(sp),spmat[i]); |
| |
} |
| |
t_2 = clock(); |
| |
t_c = 0; |
| |
t_e = 0; |
| |
rvect = (UINT *)ALLOCA(col*sizeof(UINT)); |
| |
ivect = (int *)ALLOCA(col*sizeof(int)); |
| |
for ( rp = rp0; rp; rp = NEXT(rp) ) { |
| |
t_20 = clock(); |
| |
nm_ind_pair_to_vect_compress(m,s0vect,col,(NM_ind_pair)BDY(rp),rvect,ivect); |
| |
t_21 = clock(); |
| |
t_c += t_21-t_20; |
| |
k = ivect[0]; |
| |
len = LEN(nd_ps[((NM_ind_pair)BDY(rp))->index]); |
| |
for ( i = 0; i < nsp; i++ ) { |
| |
svect = spmat[i]; |
| |
if ( c = svect[k] ) |
| |
for ( j = 0; j < len; j++ ) { |
| |
pos = ivect[j]; |
| |
c1 = m-rvect[j]; |
| |
c2 = svect[pos]; DMAR(c1,c,c2,m,c3); |
| |
svect[pos] = c3; |
| |
} |
| |
} |
| |
t_e += clock()-t_21; |
| |
} |
| |
t_4 = clock(); |
| |
colstat = (int *)ALLOCA(col*sizeof(int)); |
| |
rank = generic_gauss_elim_mod(spmat,nsp,col,m,colstat); |
| |
t_5 = clock(); |
| |
fprintf(asir_out,"sugar=%d,rank=%d ",sugar,rank); |
| |
fprintf(asir_out,"symb=%f,conv1=%f,conv2=%f,elim1=%f,elim2=%f\n", |
| |
(t_1-t_0)/(double)CLOCKS_PER_SEC, |
| |
(t_2-t_1)/(double)CLOCKS_PER_SEC, |
| |
(t_c)/(double)CLOCKS_PER_SEC, |
| |
(t_e)/(double)CLOCKS_PER_SEC, |
| |
(t_5-t_4)/(double)CLOCKS_PER_SEC); |
| |
if ( rank ) |
| |
for ( j = 0, i = 0; j < col; j++ ) { |
| |
if ( colstat[j] ) { |
| |
for ( k = j, len = 0; k < col; k++ ) |
| |
if ( spmat[i][k] ) len++; |
| |
mr0 = (NMV)MALLOC_ATOMIC(nmv_adv*len); |
| |
mr = mr0; |
| |
p = s0vect+nd_wpd*j; |
| |
for ( k = j; k < col; k++, p += nd_wpd ) |
| |
if ( spmat[i][k] ) { |
| |
ndl_copy(p,DL(mr)); |
| |
CM(mr) = spmat[i][k]; |
| |
NMV_ADV(mr); |
| |
} |
| |
MKNDV(nd_nvar,mr0,len,nf); |
| |
SG(nf) = sugar; |
| |
ndv_removecont(m,nf); |
| |
nh = ndv_newps(nf,0); |
| |
d = update_pairs(d,g,nh); |
| |
g = update_base(g,nh); |
| |
i++; |
| |
} |
| |
} |
| |
continue; |
| |
|
| |
again: |
| |
for ( t = l; NEXT(t); t = NEXT(t) ); |
| |
NEXT(t) = d; d = l; |
| |
d = nd_reconstruct(m,0,d); |
| |
NEWNM(mul); |
| |
} |
| |
for ( r = g; r; r = NEXT(r) ) BDY(r) = (pointer)nd_ps[(int)BDY(r)]; |
| |
return g; |
| |
} |
![[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