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