Merge branch 'master' into bernstein
[barvinok.git] / barvinok / evalue.h
blob395f87237670b9029cf9ab44e6a41a9bad9dd959
1 #ifndef EV_OPERATIONS_H
2 #define EV_OPERATIONS_H
4 #if defined(__cplusplus)
5 extern "C" {
6 #endif
8 #include <polylib/polylibgmp.h>
9 #undef divide
11 #define polynomial new_polynomial
12 #define periodic new_periodic
13 #define evector new_evector
14 #define enode_type new_enode_type
15 #define enode_node new_enode_node
16 #define _enumeration _new_enumeration
17 #define Enumeration _new_Enumeration
18 #define enode _new_enode
19 #define _enode _new__enode
20 #define evalue _new_evalue
21 #define _evalue _new__evalue
22 #define eadd _new_eadd
23 #define ecopy _new_ecopy
24 #define new_enode _new_new_enode
25 #define free_evalue_refs _new_free_evalue_refs
26 #define print_evalue _new_print_evalue
27 #define print_enode _new_print_enode
28 #define reduce_evalue _new_reduce
29 #define compute_evalue _new_compute_evalue
30 #define compute_poly _new_compute_poly
31 #define in_domain _new_in_domain
32 #define Enumeration_Free _new_Enumeration_Free
34 typedef enum { polynomial, periodic, evector, fractional, relation,
35 partition, flooring } enode_type;
37 typedef struct _evalue {
38 Value d; /* denominator */
39 union {
40 Value n; /* numerator (if denominator > 0) */
41 struct _enode *p; /* pointer (if denominator == 0) */
42 Polyhedron *D; /* domain (if denominator == -1) */
43 } x;
44 } evalue;
46 #define EVALUE_DOMAIN(ev) ((ev).x.D)
47 #define EVALUE_SET_DOMAIN(ev, D) \
48 do { \
49 value_set_si((ev).d, -1); \
50 EVALUE_DOMAIN(ev) = D; \
51 } while(0)
52 #define EVALUE_IS_DOMAIN(ev) (value_mone_p((ev).d))
54 #define EVALUE_IS_ZERO(ev) (value_pos_p((ev).d) && value_zero_p((ev).x.n))
55 #define EVALUE_IS_ONE(ev) (value_one_p((ev).d) && value_one_p((ev).x.n))
57 typedef struct _enode {
58 enode_type type; /* polynomial or periodic or evector */
59 int size; /* number of attached pointers */
60 int pos; /* parameter position */
61 evalue arr[1]; /* array of rational/pointer */
62 } enode;
64 typedef struct _enumeration {
66 Polyhedron *ValidityDomain; /* contraints on the parameters */
67 evalue EP; /* dimension = combined space */
68 struct _enumeration *next; /* Ehrhart Polynomial, corresponding
69 to parameter values inside the
70 domain ValidityDomain below */
71 } Enumeration;
74 void evalue_set_si(evalue *ev, int n, int d);
75 void evalue_set(evalue *ev, Value n, Value d);
76 void evalue_copy(evalue *dst, evalue *src);
77 evalue *evalue_zero();
78 enode *new_enode(enode_type type,int size,int pos);
79 enode *ecopy(enode *e);
80 int eequal(evalue *e1,evalue *e2);
81 void free_evalue_refs(evalue *e);
82 void print_evalue(FILE *DST,evalue *e,char **pname);
83 void print_enode(FILE *DST,enode *p,char **pname);
84 void reduce_evalue (evalue *e);
85 void reduce_evalue_in_domain(evalue *e, Polyhedron *D);
86 void aep_evalue(evalue *e, int *ref);
87 void addeliminatedparams_evalue(evalue *e,Matrix *CT);
88 void addeliminatedparams_enum(evalue *e, Matrix *CT, Polyhedron *CEq,
89 unsigned MaxRays, unsigned nparam);
90 void eadd(evalue *e1,evalue *res);
91 void emul (evalue *e1, evalue *res );
92 void emask(evalue *mask, evalue *res);
93 int in_domain(Polyhedron *P, Value *list_args);
94 double compute_evalue(evalue *e,Value *list_args);
95 Value *compute_poly(Enumeration *en,Value *list_args);
96 void evalue_mod2table(evalue *ev, int nparam);
97 void evalue_mod2relation(evalue *e);
98 void evalue_combine(evalue *e);
99 void evalue_range_reduction(evalue *e);
100 int evalue_range_reduction_in_domain(evalue *e, Polyhedron *D);
101 size_t evalue_size(evalue *e);
102 size_t domain_size(Polyhedron *D);
103 Enumeration* partition2enumeration(evalue *EP);
104 void evalue_frac2floor(evalue *e);
105 int evalue_frac2floor_in_domain(evalue *e, Polyhedron *D);
106 evalue *esum(evalue *E, int nvar);
107 void eor(evalue *e1, evalue *res);
108 void evalue_denom(evalue *e, Value *d);
110 #if defined(__cplusplus)
112 #endif
114 #endif