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