edits
[satune.git] / src / Backend / satorderencoder.cc
1 #include "satencoder.h"
2 #include "structs.h"
3 #include "common.h"
4 #include "order.h"
5 #include "csolver.h"
6 #include "orderpair.h"
7 #include "set.h"
8 #include "tunable.h"
9 #include "orderencoder.h"
10 #include "ordergraph.h"
11 #include "orderedge.h"
12 #include "element.h"
13 #include "predicate.h"
14 #include "orderelement.h"
15
16 Edge encodeOrderSATEncoder(SATEncoder *This, BooleanOrder *constraint) {
17         if(constraint->order->order.type == INTEGERENCODING){
18                 return orderIntegerEncodingSATEncoder(This, constraint);
19         }
20         switch ( constraint->order->type) {
21         case PARTIAL:
22                 return encodePartialOrderSATEncoder(This, constraint);
23         case TOTAL:
24                 return encodeTotalOrderSATEncoder(This, constraint);
25         default:
26                 ASSERT(0);
27         }
28         return E_BOGUS;
29 }
30
31 Edge orderIntegerEncodingSATEncoder(SATEncoder *This, BooleanOrder *boolOrder){
32         if(boolOrder->order->graph == NULL){
33                 bool doOptOrderStructure=GETVARTUNABLE(This->solver->tuner, boolOrder->order->type,
34                         OPTIMIZEORDERSTRUCTURE, &onoff);
35                 if (doOptOrderStructure ) {
36                         boolOrder->order->graph = buildMustOrderGraph(boolOrder->order);
37                         reachMustAnalysis(This->solver, boolOrder->order->graph, true);
38                 }
39         }
40         Order* order = boolOrder->order;
41         Edge gvalue = inferOrderConstraintFromGraph(order, boolOrder->first, boolOrder->second);
42         if(!edgeIsNull(gvalue))
43                 return gvalue;
44         
45         if (boolOrder->order->elementTable == NULL) {
46                 boolOrder->order->initializeOrderElementsHashTable();
47         }
48         //getting two elements and using LT predicate ...
49         Element* elem1 = getOrderIntegerElement(This, order, boolOrder->first);
50         ElementEncoding *encoding = getElementEncoding(elem1);
51         if (encoding->getElementEncodingType() == ELEM_UNASSIGNED) {
52                 encoding->setElementEncodingType(BINARYINDEX);
53                 encoding->encodingArrayInitialization();
54         }
55         Element* elem2 = getOrderIntegerElement(This, order, boolOrder->second);
56         encoding = getElementEncoding(elem2);
57         if (encoding->getElementEncodingType() == ELEM_UNASSIGNED) {
58                 encoding->setElementEncodingType(BINARYINDEX);
59                 encoding->encodingArrayInitialization();
60         }
61         Set * sarray[]={order->set, order->set};
62         Predicate *predicate =new PredicateOperator(LT, sarray, 2);
63         Element * parray[]={elem1, elem2};
64         BooleanPredicate * boolean=new BooleanPredicate(predicate, parray, 2, NULL);
65         boolean->getFunctionEncoding()->setFunctionEncodingType(CIRCUIT);
66         {//Adding new elements and boolean/predicate to solver regarding memory management
67                 This->solver->allBooleans.push(boolean);
68                 This->solver->allPredicates.push(predicate);
69                 This->solver->allElements.push(elem1);
70                 This->solver->allElements.push(elem2);
71         }
72         return encodeConstraintSATEncoder(This, boolean);
73 }
74
75 Edge inferOrderConstraintFromGraph(Order* order, uint64_t _first, uint64_t _second){
76         if (order->graph != NULL) {
77                 OrderGraph *graph=order->graph;
78                 OrderNode *first=lookupOrderNodeFromOrderGraph(graph, _first);
79                 OrderNode *second=lookupOrderNodeFromOrderGraph(graph, _second);
80                 if ((first != NULL) && (second != NULL)) {
81                         OrderEdge *edge=lookupOrderEdgeFromOrderGraph(graph, first, second);
82                         if (edge != NULL) {
83                                 if (edge->mustPos)
84                                         return E_True;
85                                 else if (edge->mustNeg)
86                                         return E_False;
87                         }
88                         OrderEdge *invedge=getOrderEdgeFromOrderGraph(graph, second, first);
89                         if (invedge != NULL) {
90                                 if (invedge->mustPos)
91                                         return E_False;
92                                 else if (invedge->mustNeg)
93                                         return E_True;
94                         }
95                 }
96         }
97         return E_NULL;
98 }
99
100 Element* getOrderIntegerElement(SATEncoder* This,Order *order, uint64_t item) {
101         HashSetOrderElement* eset = order->elementTable;
102         OrderElement oelement ={item, NULL};
103         if( !eset->contains(&oelement)){
104                 Element* elem = new ElementSet(order->set);
105                 ElementEncoding* encoding = getElementEncoding(elem);
106                 encoding->setElementEncodingType(BINARYINDEX);
107                 encoding->encodingArrayInitialization();
108                 encodeElementSATEncoder(This, elem);
109                 eset->add(allocOrderElement(item, elem));
110                 return elem;
111         } else
112                 return eset->get(&oelement)->elem;
113 }
114
115 Edge getPairConstraint(SATEncoder *This, Order *order, OrderPair *pair) {
116         Edge gvalue = inferOrderConstraintFromGraph(order, pair->first, pair->second);
117         if(!edgeIsNull(gvalue))
118                 return gvalue;
119         
120         HashTableOrderPair *table = order->orderPairTable;
121         bool negate = false;
122         OrderPair flipped;
123         if (pair->first < pair->second) {
124                 negate = true;
125                 flipped.first = pair->second;
126                 flipped.second = pair->first;
127                 pair = &flipped;
128         }
129         Edge constraint;
130         if (!(table->contains(pair))) {
131                 constraint = getNewVarSATEncoder(This);
132                 OrderPair *paircopy = new OrderPair(pair->first, pair->second, constraint);
133                 table->put(paircopy, paircopy);
134         } else
135                 constraint = table->get(pair)->constraint;
136         
137         return negate ? constraintNegate(constraint) : constraint;
138 }
139
140 Edge encodeTotalOrderSATEncoder(SATEncoder *This, BooleanOrder *boolOrder) {
141         ASSERT(boolOrder->order->type == TOTAL);
142         if (boolOrder->order->orderPairTable == NULL) {
143                 boolOrder->order->initializeOrderHashTable();
144                 bool doOptOrderStructure=GETVARTUNABLE(This->solver->tuner, boolOrder->order->type, OPTIMIZEORDERSTRUCTURE, &onoff);
145                 if (doOptOrderStructure) {
146                         boolOrder->order->graph = buildMustOrderGraph(boolOrder->order);
147                         reachMustAnalysis(This->solver, boolOrder->order->graph, true);
148                 }
149                 createAllTotalOrderConstraintsSATEncoder(This, boolOrder->order);
150         }
151         OrderPair pair(boolOrder->first, boolOrder->second, E_NULL);
152         Edge constraint = getPairConstraint(This, boolOrder->order, &pair);
153         return constraint;
154 }
155
156
157 void createAllTotalOrderConstraintsSATEncoder(SATEncoder *This, Order *order) {
158 #ifdef TRACE_DEBUG
159         model_print("in total order ...\n");
160 #endif
161         ASSERT(order->type == TOTAL);
162         Vector<uint64_t> *mems = order->set->members;
163         uint size = mems->getSize();
164         for (uint i = 0; i < size; i++) {
165                 uint64_t valueI = mems->get(i);
166                 for (uint j = i + 1; j < size; j++) {
167                         uint64_t valueJ = mems->get(j);
168                         OrderPair pairIJ(valueI, valueJ, E_NULL);
169                         Edge constIJ = getPairConstraint(This, order, &pairIJ);
170                         for (uint k = j + 1; k < size; k++) {
171                                 uint64_t valueK = mems->get(k);
172                                 OrderPair pairJK(valueJ, valueK, E_NULL);
173                                 OrderPair pairIK(valueI, valueK, E_NULL);
174                                 Edge constIK = getPairConstraint(This, order, &pairIK);
175                                 Edge constJK = getPairConstraint(This, order, &pairJK);
176                                 addConstraintCNF(This->cnf, generateTransOrderConstraintSATEncoder(This, constIJ, constJK, constIK));
177                         }
178                 }
179         }
180 }
181
182 Edge getOrderConstraint(HashTableOrderPair *table, OrderPair *pair) {
183         ASSERT(pair->first != pair->second);
184         bool negate = false;
185         OrderPair flipped;
186         if (pair->first < pair->second) {
187                 negate = true;
188                 flipped.first = pair->second;
189                 flipped.second = pair->first;
190                 pair = &flipped;
191         }
192         if (!table->contains(pair)) {
193                 return E_NULL;
194         }
195         Edge constraint = table->get(pair)->constraint;
196         ASSERT(!edgeIsNull(constraint));
197         return negate ? constraintNegate(constraint) : constraint;
198 }
199
200 Edge generateTransOrderConstraintSATEncoder(SATEncoder *This, Edge constIJ,Edge constJK,Edge constIK) {
201         Edge carray[] = {constIJ, constJK, constraintNegate(constIK)};
202         Edge loop1 = constraintOR(This->cnf, 3, carray);
203         Edge carray2[] = {constraintNegate(constIJ), constraintNegate(constJK), constIK};
204         Edge loop2 = constraintOR(This->cnf, 3, carray2 );
205         return constraintAND2(This->cnf, loop1, loop2);
206 }
207
208 Edge encodePartialOrderSATEncoder(SATEncoder *This, BooleanOrder *constraint) {
209         ASSERT(constraint->order->type == PARTIAL);
210         return E_BOGUS;
211 }