Annotation of OpenXM_contrib2/asir2000/engine/nd.h, Revision 1.35
1.35 ! noro 1: /* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.h,v 1.34 2016/12/05 10:29:15 noro Exp $ */
1.1 noro 2: #include "ca.h"
3: #include "parse.h"
4: #include "ox.h"
5: #include "base.h"
6: #include "inline.h"
7: #include <time.h>
8:
9: #if defined(__GNUC__)
1.30 ohara 10: #define INLINE static inline
1.33 fujimoto 11: #elif defined(VISUAL) || defined(__MINGW32__)
1.1 noro 12: #define INLINE __inline
13: #else
14: #define INLINE
15: #endif
16:
17: typedef unsigned int UINT;
18:
19: #define USE_GEOBUCKET 1
20: #define USE_UNROLL 1
21:
22: #define REDTAB_LEN 32003
23:
24: /* GeoBucket for polynomial addition */
25:
26: typedef struct oPGeoBucket {
27: int m;
28: struct oND *body[32];
29: } *PGeoBucket;
30:
31: /* distributed polynomial; linked list rep. */
32: typedef struct oND {
33: struct oNM *body;
34: int nv;
35: int len;
36: int sugar;
37: } *ND;
38:
39: /* distributed polynomial; array rep. */
40: typedef struct oNDV {
41: struct oNMV *body;
42: int nv;
43: int len;
44: int sugar;
45: } *NDV;
46:
47: typedef union oNDC {
48: int m;
1.11 noro 49: Q z;
1.35 ! noro 50: LM lm;
1.31 noro 51: GZ gz;
1.1 noro 52: P p;
1.16 noro 53: R r;
1.12 noro 54: DAlg a;
1.1 noro 55: } *NDC;
56:
57: /* monomial; linked list rep. */
58: typedef struct oNM {
59: struct oNM *next;
60: union oNDC c;
61: UINT dl[1];
62: } *NM;
63:
64: /* monomial; array rep. */
65: typedef struct oNMV {
66: union oNDC c;
67: UINT dl[1];
68: } *NMV;
69:
70: /* history of reducer */
71: typedef struct oRHist {
72: struct oRHist *next;
73: int index;
74: int sugar;
75: UINT dl[1];
76: } *RHist;
77:
78: /* S-pair list */
79: typedef struct oND_pairs {
80: struct oND_pairs *next;
81: int i1,i2;
82: int sugar;
1.34 noro 83: int sugar2;
1.1 noro 84: UINT lcm[1];
85: } *ND_pairs;
86:
87: /* index and shift count for each exponent */
88: typedef struct oEPOS {
89: int i; /* index */
90: int s; /* shift */
91: } *EPOS;
92:
93: typedef struct oBlockMask {
94: int n;
95: struct order_pair *order_pair;
96: UINT **mask;
97: } *BlockMask;
98:
99: typedef struct oBaseSet {
100: int len;
101: NDV *ps;
102: UINT **bound;
103: } *BaseSet;
104:
105: typedef struct oNM_ind_pair
106: {
107: NM mul;
108: int index,sugar;
109: } *NM_ind_pair;
110:
111: typedef struct oIndArray
112: {
113: char width;
114: int head;
115: union {
116: unsigned char *c;
117: unsigned short *s;
118: unsigned int *i;
119: } index;
120: } *IndArray;
121:
1.22 noro 122: typedef struct oNDVI {
123: NDV p;
124: int i;
125: } *NDVI;
126:
1.1 noro 127: extern int (*ndl_compare_function)(UINT *a1,UINT *a2);
128: extern int nd_dcomp;
129:
130: extern NM _nm_free_list;
131: extern ND _nd_free_list;
132: extern ND_pairs _ndp_free_list;
133:
134: extern struct order_spec *dp_current_spec;
135: extern char *Demand;
136: extern VL CO;
1.25 noro 137: extern int Top,Reverse,DP_Print,dp_nelim,do_weyl,NoSugar;
1.1 noro 138: extern int *current_weyl_weight_vector;
1.20 noro 139: extern int *current_module_weight_vector;
1.1 noro 140:
141: /* fundamental macros */
142: #define TD(d) (d[0])
143: #define HDL(d) ((d)->body->dl)
144: #define HTD(d) (TD(HDL(d)))
1.22 noro 145: #define HCU(d) ((d)->body->c)
1.1 noro 146: #define HCM(d) ((d)->body->c.m)
1.35 ! noro 147: #define HCLM(d) ((d)->body->c.lm)
1.11 noro 148: #define HCQ(d) ((d)->body->c.z)
1.31 noro 149: #define HCZ(d) ((d)->body->c.gz)
1.1 noro 150: #define HCP(d) ((d)->body->c.p)
1.12 noro 151: #define HCA(d) ((d)->body->c.a)
152: #define CM(x) ((x)->c.m)
1.35 ! noro 153: #define CLM(x) ((x)->c.lm)
1.12 noro 154: #define CQ(x) ((x)->c.z)
1.31 noro 155: #define CZ(x) ((x)->c.gz)
1.12 noro 156: #define CP(x) ((x)->c.p)
157: #define CA(x) ((x)->c.a)
158: #define DL(x) ((x)->dl)
159: #define SG(x) ((x)->sugar)
160: #define LEN(x) ((x)->len)
161: #define LCM(x) ((x)->lcm)
1.1 noro 162: #define GET_EXP(d,a) (((d)[nd_epos[a].i]>>nd_epos[a].s)&nd_mask0)
163: #define GET_EXP_MASK(d,a,m) ((((d)[nd_epos[a].i]&(m)[nd_epos[a].i])>>nd_epos[a].s)&nd_mask0)
164: #define PUT_EXP(r,a,e) ((r)[nd_epos[a].i] |= ((e)<<nd_epos[a].s))
165: #define XOR_EXP(r,a,e) ((r)[nd_epos[a].i] ^= ((e)<<nd_epos[a].s))
166:
167: #define GET_EXP_OLD(d,a) (((d)[oepos[a].i]>>oepos[a].s)&omask0)
168: #define PUT_EXP_OLD(r,a,e) ((r)[oepos[a].i] |= ((e)<<oepos[a].s))
1.19 noro 169: #define MPOS(d) (d[nd_mpos])
1.1 noro 170:
171: #define ROUND_FOR_ALIGN(s) ((((s)+sizeof(void *)-1)/sizeof(void *))*sizeof(void *))
172:
173: /* macros for term comparison */
174: #define TD_DL_COMPARE(d1,d2)\
175: (TD(d1)>TD(d2)?1:(TD(d1)<TD(d2)?-1:ndl_lex_compare(d1,d2)))
176: #if 0
177: #define DL_COMPARE(d1,d2)\
178: (nd_dcomp>0?TD_DL_COMPARE(d1,d2)\
179: :(nd_dcomp==0?ndl_lex_compare(d1,d2)\
180: :(nd_blockmask?ndl_block_compare(d1,d2)\
181: :(*ndl_compare_function)(d1,d2))))
182: #else
183: #define DL_COMPARE(d1,d2)\
184: (nd_dcomp>0?TD_DL_COMPARE(d1,d2):(*ndl_compare_function)(d1,d2))
185: #endif
186:
187: /* allocators */
188: #define NEWRHist(r) \
189: ((r)=(RHist)MALLOC(sizeof(struct oRHist)+(nd_wpd-1)*sizeof(UINT)))
190: #define NEWND_pairs(m) \
191: if(!_ndp_free_list)_NDP_alloc();\
192: (m)=_ndp_free_list; _ndp_free_list = NEXT(_ndp_free_list)
193: #define NEWNM(m)\
194: if(!_nm_free_list)_NM_alloc();\
195: (m)=_nm_free_list; _nm_free_list = NEXT(_nm_free_list)
196: #define MKND(n,m,len,d)\
197: if(!_nd_free_list)_ND_alloc();\
198: (d)=_nd_free_list; _nd_free_list = (ND)BDY(_nd_free_list);\
199: NV(d)=(n); LEN(d)=(len); BDY(d)=(m)
200: #define NEWNDV(d) ((d)=(NDV)MALLOC(sizeof(struct oNDV)))
201: #define MKNDV(n,m,l,d) NEWNDV(d); NV(d)=(n); BDY(d)=(m); LEN(d) = l;
202: #define NEWNM_ind_pair(p)\
203: ((p)=(NM_ind_pair)MALLOC(sizeof(struct oNM_ind_pair)))
204:
205: /* allocate and link a new object */
206: #define NEXTRHist(r,c) \
207: if(!(r)){NEWRHist(r);(c)=(r);}else{NEWRHist(NEXT(c));(c)=NEXT(c);}
208: #define NEXTNM(r,c) \
209: if(!(r)){NEWNM(r);(c)=(r);}else{NEWNM(NEXT(c));(c)=NEXT(c);}
210: #define NEXTNM2(r,c,s) \
211: if(!(r)){(c)=(r)=(s);}else{NEXT(c)=(s);(c)=(s);}
212: #define NEXTND_pairs(r,c) \
213: if(!(r)){NEWND_pairs(r);(c)=(r);}else{NEWND_pairs(NEXT(c));(c)=NEXT(c);}
214: #define MKNM_ind_pair(p,m,i,s) (NEWNM_ind_pair(p),(p)->mul=(m),(p)->index=(i),(p)->sugar = (s))
215:
216: /* deallocators */
217: #define FREENM(m) NEXT(m)=_nm_free_list; _nm_free_list=(m)
218: #define FREENDP(m) NEXT(m)=_ndp_free_list; _ndp_free_list=(m)
219: #define FREEND(m) BDY(m)=(NM)_nd_free_list; _nd_free_list=(m)
220:
221: /* macro for increasing pointer to NMV */
222: #define NMV_ADV(m) (m = (NMV)(((char *)m)+nmv_adv))
223: #define NMV_OADV(m) (m = (NMV)(((char *)m)+oadv))
224: #define NDV_NADV(m) (m = (NMV)(((char *)m)+newadv))
225: #define NMV_PREV(m) (m = (NMV)(((char *)m)-nmv_adv))
226: #define NMV_OPREV(m) (m = (NMV)(((char *)m)-oadv))
227:
228: /* external functions */
229: #if 1
230: void GC_gcollect();
231: #endif
232: NODE append_one(NODE,int);
233:
234: /* manipulation of coefficients */
235: void nd_removecont(int mod,ND p);
236: void nd_removecont2(ND p1,ND p2);
1.17 noro 237: void removecont_array(P *c,int n,int full);
1.16 noro 238: void removecont_array_q(Q *c,int n);
1.1 noro 239:
240: /* GeoBucket functions */
241: ND normalize_pbucket(int mod,PGeoBucket g);
242: int head_pbucket(int mod,PGeoBucket g);
1.11 noro 243: int head_pbucket_q(PGeoBucket g);
1.1 noro 244: void add_pbucket_symbolic(PGeoBucket g,ND d);
245: void add_pbucket(int mod,PGeoBucket g,ND d);
246: void free_pbucket(PGeoBucket b);
1.11 noro 247: void mulq_pbucket(PGeoBucket g,Q c);
1.1 noro 248: NM remove_head_pbucket_symbolic(PGeoBucket g);
249: PGeoBucket create_pbucket();
250:
251: /* manipulation of pairs and bases */
252: int nd_newps(int mod,ND a,ND aq);
253: ND_pairs nd_newpairs( NODE g, int t );
254: ND_pairs nd_minp( ND_pairs d, ND_pairs *prest );
255: ND_pairs nd_minsugarp( ND_pairs d, ND_pairs *prest );
256: NODE update_base(NODE nd,int ndp);
1.23 noro 257: ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t, int gensyz);
1.1 noro 258: ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest );
259: ND_pairs crit_B( ND_pairs d, int s );
260: ND_pairs crit_M( ND_pairs d1 );
261: ND_pairs crit_F( ND_pairs d1 );
262: int crit_2( int dp1, int dp2 );
1.31 noro 263: int ndv_newps(int m,NDV a,NDV aq,int f4);
1.1 noro 264:
265: /* top level functions */
1.28 noro 266: void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int f4,struct order_spec *ord,LIST *rp);
1.15 noro 267: void nd_gr_trace(LIST f,LIST v,int trace,int homo,int f4,struct order_spec *ord,LIST *rp);
1.22 noro 268: NODE nd_f4(int m,int **indp);
1.23 noro 269: NODE nd_gb(int m,int ishomo,int checkonly,int gensyz,int **indp);
1.22 noro 270: NODE nd_gb_trace(int m,int ishomo,int **indp);
271: NODE nd_f4_trace(int m,int **indp);
1.1 noro 272:
273: /* ndl functions */
274: int ndl_weight(UINT *d);
275: void ndl_weight_mask(UINT *d);
1.21 noro 276: void ndl_homogenize(UINT *d,UINT *r,int obpe,EPOS oepos,int ompos,int weight);
1.1 noro 277: void ndl_dehomogenize(UINT *p);
278: void ndl_reconstruct(UINT *d,UINT *r,int obpe,EPOS oepos);
279: INLINE int ndl_reducible(UINT *d1,UINT *d2);
280: INLINE int ndl_lex_compare(UINT *d1,UINT *d2);
281: INLINE int ndl_block_compare(UINT *d1,UINT *d2);
1.2 noro 282: INLINE int ndl_matrix_compare(UINT *d1,UINT *d2);
1.3 noro 283: INLINE int ndl_composite_compare(UINT *d1,UINT *d2);
1.1 noro 284: INLINE int ndl_equal(UINT *d1,UINT *d2);
285: INLINE void ndl_copy(UINT *d1,UINT *d2);
286: INLINE void ndl_zero(UINT *d);
287: INLINE void ndl_add(UINT *d1,UINT *d2,UINT *d);
288: INLINE void ndl_addto(UINT *d1,UINT *d2);
289: INLINE void ndl_sub(UINT *d1,UINT *d2,UINT *d);
290: INLINE int ndl_hash_value(UINT *d);
291:
292: /* normal forms */
293: INLINE int ndl_find_reducer(UINT *g);
294: int nd_sp(int mod,int trace,ND_pairs p,ND *nf);
1.16 noro 295: int nd_nf(int mod,ND d,ND g,NDV *ps,int full,NDC dn,ND *nf);
1.1 noro 296: int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *nf);
297:
298: /* finalizers */
1.22 noro 299: NODE ndv_reducebase(NODE x,int *perm);
1.1 noro 300: NODE ndv_reduceall(int m,NODE f);
301:
302: /* allocators */
303: void nd_free_private_storage();
304: void _NM_alloc();
305: void _ND_alloc();
306: void nd_free(ND p);
307: void nd_free_redlist();
308:
309: /* printing */
310: void ndl_print(UINT *dl);
311: void nd_print(ND p);
1.11 noro 312: void nd_print_q(ND p);
1.1 noro 313: void ndp_print(ND_pairs d);
314:
315:
316: /* setup, reconstruct */
317: void nd_init_ord(struct order_spec *spec);
1.6 noro 318: ND_pairs nd_reconstruct(int trace,ND_pairs ndp);
1.26 noro 319: int ndv_setup(int mod,int trace,NODE f,int dont_sort,int dont_removecont);
1.1 noro 320: void nd_setup_parameters(int nvar,int max);
321: BlockMask nd_create_blockmask(struct order_spec *ord);
322: EPOS nd_create_epos(struct order_spec *ord);
323: int nd_get_exporigin(struct order_spec *ord);
324: void ndv_mod(int mod,NDV p);
325: NDV ndv_dup(int mod,NDV p);
1.31 noro 326: NDV ndv_symbolic(int mod,NDV p);
1.1 noro 327: ND nd_dup(ND p);
328:
329: /* ND functions */
1.24 noro 330: int ndv_check_membership(int m,NODE input,int obpe,int oadv,EPOS oepos,NODE cand);
1.1 noro 331: void nd_mul_c(int mod,ND p,int mul);
1.16 noro 332: void nd_mul_c_q(ND p,P mul);
1.1 noro 333: void nd_mul_c_p(VL vl,ND p,P mul);
334: ND nd_remove_head(ND p);
335: ND nd_separate_head(ND p,ND *head);
1.30 ohara 336: INLINE int nd_length(ND p);
1.1 noro 337: void nd_append_red(UINT *d,int i);
338: UINT *ndv_compute_bound(NDV p);
1.4 noro 339: UINT *nd_compute_bound(ND p);
1.1 noro 340: ND nd_copy(ND p);
341: ND nd_merge(ND p1,ND p2);
342: ND nd_add(int mod,ND p1,ND p2);
1.11 noro 343: ND nd_add_q(ND p1,ND p2);
1.1 noro 344: ND nd_add_sf(ND p1,ND p2);
1.7 noro 345: ND nd_quo(int mod,PGeoBucket p,NDV d);
1.1 noro 346: INLINE int nd_length(ND p);
1.15 noro 347: NODE nd_f4_red(int m,ND_pairs sp0,int trace,UINT *s0vect,int col,NODE rp0,ND_pairs *nz);
348: NODE nd_f4_red_dist(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0, ND_pairs *nz);
1.8 noro 349: NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col,
1.15 noro 350: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred,ND_pairs *nz);
351: NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,int trace,UINT *s0vect,int col,
1.8 noro 352: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred);
1.31 noro 353: NODE nd_f4_red_gz_main(ND_pairs sp0,int nsp,int trace,UINT *s0vect,int col,
354: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred);
1.1 noro 355:
356: /* NDV functions */
357: ND weyl_ndv_mul_nm(int mod,NM m0,NDV p);
358: void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *tab,int tlen);
359: void ndv_mul_c(int mod,NDV p,int mul);
1.11 noro 360: void ndv_mul_c_q(NDV p,Q mul);
1.1 noro 361: ND ndv_mul_nm_symbolic(NM m0,NDV p);
362: ND ndv_mul_nm(int mod,NM m0,NDV p);
1.5 noro 363: ND ndv_mul_nmv_trunc(int mod,NMV m0,NDV p,UINT *d);
1.1 noro 364: void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos);
365: NDV ndv_dup_realloc(NDV p,int obpe,int oadv,EPOS oepos);
1.21 noro 366: void ndv_homogenize(NDV p,int obpe,int oadv,EPOS eops,int ompos);
1.1 noro 367: void ndv_dehomogenize(NDV p,struct order_spec *spec);
368: void ndv_removecont(int mod,NDV p);
369: void ndv_print(NDV p);
1.11 noro 370: void ndv_print_q(NDV p);
1.1 noro 371: void ndv_free(NDV p);
372: void ndv_save(NDV p,int index);
373: NDV ndv_load(int index);
374:
375: /* converters */
376: ND ptond(VL vl,VL dvl,P p);
377: NDV ptondv(VL vl,VL dvl,P p);
378: P ndvtop(int mod,VL vl,VL dvl,NDV p);
379: NDV ndtondv(int mod,ND p);
380: ND ndvtond(int mod,NDV p);
1.14 noro 381: Q *nm_ind_pair_to_vect(int m,UINT *s0,int n,NM_ind_pair pair);
1.29 noro 382: IndArray nm_ind_pair_to_vect_compress(int m,UINT *s0,int n,int *s0hash,NM_ind_pair pair);
1.1 noro 383: int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r);
1.11 noro 384: int nd_to_vect_q(UINT *s0,int n,ND d,Q *r);
385: NDV vect_to_ndv_q(Q *vect,int spcol,int col,int *rhead,UINT *s0vect);
1.1 noro 386:
387: /* elimination */
1.15 noro 388: int nd_gauss_elim_mod(int **mat0,int *sugar,ND_pairs *spactive,int row,int col,int md,int *colstat);
1.1 noro 389: int nd_gauss_elim_sf(int **mat0,int *sugar,int row,int col,int md,int *colstat);
1.11 noro 390: int nd_gauss_elim_q(Q **mat0,int *sugar,int row,int col,int *colstat);
1.1 noro 391:
392: int ndl_ww_lex_compare(UINT *a1,UINT *a2);
1.8 noro 393:
1.1 noro 394:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to nd.h CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / engine