b2ccfe7e5cc3a938ad1d170d30262b40d62f3a84
[satune.git] / src / csolver.c
1 #include "csolver.h"
2 #include "set.h"
3 #include "mutableset.h"
4 #include "element.h"
5 #include "boolean.h"
6 #include "predicate.h"
7 #include "order.h"
8
9 CSolver * allocCSolver() {
10         CSolver * tmp=(CSolver *) ourmalloc(sizeof(CSolver));
11         tmp->constraints=allocDefVectorBoolean();
12         tmp->allBooleans=allocDefVectorBoolean();
13         tmp->allSets=allocDefVectorSet();
14         tmp->allElements=allocDefVectorElement();
15         tmp->allPredicates = allocDefVectorPredicate();
16         tmp->allTables = allocDefVectorTable();
17         return tmp;
18 }
19
20 /** This function tears down the solver and the entire AST */
21
22 void deleteSolver(CSolver *this) {
23         deleteVectorBoolean(this->constraints);
24
25         uint size=getSizeVectorBoolean(this->allBooleans);
26         for(uint i=0;i<size;i++) {
27                 deleteBoolean(getVectorBoolean(this->allBooleans, i));
28         }
29
30         deleteVectorBoolean(this->allBooleans);
31
32         size=getSizeVectorSet(this->allSets);
33         for(uint i=0;i<size;i++) {
34                 deleteSet(getVectorSet(this->allSets, i));
35         }
36
37         deleteVectorSet(this->allSets);
38
39         size=getSizeVectorElement(this->allElements);
40         for(uint i=0;i<size;i++) {
41                 deleteElement(getVectorElement(this->allElements, i));
42         }
43         //FIXME: Freeing alltables and allpredicates
44         deleteVectorElement(this->allElements);
45         ourfree(this);
46 }
47
48 Set * createSet(CSolver * this, VarType type, uint64_t * elements, uint numelements) {
49         Set * set=allocSet(type, elements, numelements);
50         pushVectorSet(this->allSets, set);
51         return set;
52 }
53
54 Set * createRangeSet(CSolver * this, VarType type, uint64_t lowrange, uint64_t highrange) {
55         Set * set=allocSetRange(type, lowrange, highrange);
56         pushVectorSet(this->allSets, set);
57         return set;
58 }
59
60 MutableSet * createMutableSet(CSolver * this, VarType type) {
61         MutableSet * set=allocMutableSet(type);
62         pushVectorSet(this->allSets, set);
63         return set;
64 }
65
66 void addItem(CSolver *solver, MutableSet * set, uint64_t element) {
67         addElementMSet(set, element);
68 }
69
70 uint64_t createUniqueItem(CSolver *solver, MutableSet * set) {
71         uint64_t element=set->low++;
72         addElementMSet(set, element);
73         return element;
74 }
75
76 Element * getElementVar(CSolver *this, Set * set) {
77         Element * element=allocElement(set);
78         pushVectorElement(this->allElements, element);
79         return element;
80 }
81
82 Boolean * getBooleanVar(CSolver *solver, VarType type) {
83         Boolean* boolean= allocBoolean(type);
84         pushVectorBoolean(solver->allBooleans, boolean);
85         return boolean;
86 }
87
88 Function * createFunctionOperator(CSolver *solver, ArithOp op, Set ** domain, uint numDomain, Set * range,
89                                                                                                                                         OverFlowBehavior overflowbehavior) {
90         return NULL;
91 }
92
93 Predicate * createPredicateOperator(CSolver *solver, enum CompOp op, Set ** domain, uint numDomain) {
94         Predicate* predicate= allocPredicate(op, domain,numDomain);
95         pushVectorPredicate(solver->allPredicates, predicate);
96         return predicate;
97 }
98
99 Table * createTable(CSolver *solver, Set **domains, uint numDomain, Set * range) {
100         Table* table= allocTable(domains,numDomain,range);
101         pushVectorTable(solver->allTables, table);
102         return table;
103 }
104
105 void addTableEntry(CSolver *solver, Table* table, uint64_t* inputs, uint inputSize, uint64_t result) {
106     addNewTableEntry(table,inputs, inputSize,result);
107 }
108
109 Function * completeTable(CSolver *solver, Table * table) {
110         return NULL;
111 }
112
113 Element * applyFunction(CSolver *solver, Function * function, Element ** array, Boolean * overflowstatus) {
114         return NULL;
115 }
116
117 Boolean * applyPredicate(CSolver *solver, Predicate * predicate, Element ** inputs) {
118         return NULL;
119 }
120
121 Boolean * applyLogicalOperation(CSolver *solver, LogicOp op, Boolean ** array) {
122         return NULL;
123 }
124
125 void addBoolean(CSolver *this, Boolean * constraint) {
126         pushVectorBoolean(this->constraints, constraint);
127 }
128
129 Order * createOrder(CSolver *solver, OrderType type, Set * set) {
130         return allocOrder(type, set);
131 }
132
133 Boolean * orderConstraint(CSolver *solver, Order * order, uint64_t first, uint64_t second) {
134         Boolean* constraint = allocBooleanOrder(order, first, second);
135         pushVectorBoolean(solver->allBooleans,constraint);
136         return constraint;
137 }