3 #include "mutableset.h"
10 #include "satencoder.h"
11 #include "sattranslator.h"
13 #include "polarityassignment.h"
14 #include "decomposeordertransform.h"
15 #include "autotuner.h"
18 #include "orderresolver.h"
19 #include "integerencoding.h"
21 #include "preprocess.h"
22 #include "serializer.h"
23 #include "deserializer.h"
24 #include "naiveencoder.h"
27 boolTrue(BooleanEdge(new BooleanConst(true))),
28 boolFalse(boolTrue.negate()),
33 satEncoder = new SATEncoder(this);
36 /** This function tears down the solver and the entire AST */
39 uint size = allBooleans.getSize();
40 for (uint i = 0; i < size; i++) {
41 delete allBooleans.get(i);
44 size = allSets.getSize();
45 for (uint i = 0; i < size; i++) {
46 delete allSets.get(i);
49 size = allElements.getSize();
50 for (uint i = 0; i < size; i++) {
51 delete allElements.get(i);
54 size = allTables.getSize();
55 for (uint i = 0; i < size; i++) {
56 delete allTables.get(i);
59 size = allPredicates.getSize();
60 for (uint i = 0; i < size; i++) {
61 delete allPredicates.get(i);
64 size = allOrders.getSize();
65 for (uint i = 0; i < size; i++) {
66 delete allOrders.get(i);
69 size = allFunctions.getSize();
70 for (uint i = 0; i < size; i++) {
71 delete allFunctions.get(i);
74 delete boolTrue.getBoolean();
78 CSolver *CSolver::clone() {
79 CSolver *copy = new CSolver();
81 SetIteratorBooleanEdge *it = getConstraints();
82 while (it->hasNext()) {
83 BooleanEdge b = it->next();
84 copy->addConstraint(cloneEdge(copy, &map, b));
90 void CSolver::serialize() {
91 model_print("serializing ...\n");
93 Serializer serializer("dump");
94 SetIteratorBooleanEdge *it = getConstraints();
95 while (it->hasNext()) {
96 BooleanEdge b = it->next();
97 serializeBooleanEdge(&serializer, b);
101 model_print("deserializing ...\n");
103 Deserializer deserializer("dump");
104 deserializer.deserialize();
109 Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
110 Set *set = new Set(type, elements, numelements);
115 Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange) {
116 Set *set = new Set(type, lowrange, highrange);
121 Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) {
122 Set *s = createRangeSet(type, lowrange, highrange);
123 return getElementVar(s);
126 MutableSet *CSolver::createMutableSet(VarType type) {
127 MutableSet *set = new MutableSet(type);
132 void CSolver::addItem(MutableSet *set, uint64_t element) {
133 set->addElementMSet(element);
136 uint64_t CSolver::createUniqueItem(MutableSet *set) {
137 uint64_t element = set->getNewUniqueItem();
138 set->addElementMSet(element);
142 void CSolver::finalizeMutableSet(MutableSet* set){
146 Element *CSolver::getElementVar(Set *set) {
147 Element *element = new ElementSet(set);
148 allElements.push(element);
152 Element *CSolver::getElementConst(VarType type, uint64_t value) {
153 uint64_t array[] = {value};
154 Set *set = new Set(type, array, 1);
155 Element *element = new ElementConst(value, set);
156 Element *e = elemMap.get(element);
159 allElements.push(element);
160 elemMap.put(element, element);
169 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, BooleanEdge overflowstatus) {
170 Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
171 Element *e = elemMap.get(element);
173 element->updateParents();
174 allElements.push(element);
175 elemMap.put(element, element);
183 Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
184 Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior);
185 allFunctions.push(function);
189 Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
190 Predicate *predicate = new PredicateOperator(op, domain,numDomain);
191 allPredicates.push(predicate);
195 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
196 Predicate *predicate = new PredicateTable(table, behavior);
197 allPredicates.push(predicate);
201 Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
202 Table *table = new Table(domains,numDomain,range);
203 allTables.push(table);
207 Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
208 return createTable(domains, numDomain, NULL);
211 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
212 table->addNewTableEntry(inputs, inputSize, result);
215 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
216 Function *function = new FunctionTable(table, behavior);
217 allFunctions.push(function);
221 BooleanEdge CSolver::getBooleanVar(VarType type) {
222 Boolean *boolean = new BooleanVar(type);
223 allBooleans.push(boolean);
224 return BooleanEdge(boolean);
227 BooleanEdge CSolver::getBooleanTrue() {
231 BooleanEdge CSolver::getBooleanFalse() {
235 BooleanEdge CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
236 return applyPredicateTable(predicate, inputs, numInputs, BooleanEdge(NULL));
239 BooleanEdge CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, BooleanEdge undefinedStatus) {
240 BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
241 Boolean *b = boolMap.get(boolean);
243 boolean->updateParents();
244 boolMap.put(boolean, boolean);
245 allBooleans.push(boolean);
246 return BooleanEdge(boolean);
249 return BooleanEdge(b);
253 bool CSolver::isTrue(BooleanEdge b) {
254 return b.isNegated()?b->isFalse():b->isTrue();
257 bool CSolver::isFalse(BooleanEdge b) {
258 return b.isNegated()?b->isTrue():b->isFalse();
261 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2) {
262 BooleanEdge array[] = {arg1, arg2};
263 return applyLogicalOperation(op, array, 2);
266 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg) {
267 BooleanEdge array[] = {arg};
268 return applyLogicalOperation(op, array, 1);
271 static int ptrcompares(const void *p1, const void *p2) {
272 uintptr_t b1 = *(uintptr_t const *) p1;
273 uintptr_t b2 = *(uintptr_t const *) p2;
282 BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge * array, uint asize) {
283 BooleanEdge newarray[asize];
284 memcpy(newarray, array, asize * sizeof(BooleanEdge));
285 for(uint i=0; i < asize; i++) {
286 BooleanEdge b=newarray[i];
287 if (b->type == LOGICOP) {
288 if (((BooleanLogic *) b.getBoolean())->replaced) {
289 newarray[i] = doRewrite(newarray[i]);
294 return applyLogicalOperation(op, newarray, asize);
297 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
298 BooleanEdge newarray[asize];
301 return array[0].negate();
304 for (uint i = 0; i < 2; i++) {
305 if (array[i]->type == BOOLCONST) {
306 if (array[i]->isTrue()) {
309 newarray[0] = array[1 - i];
310 return applyLogicalOperation(SATC_NOT, newarray, 1);
312 } else if (array[i]->type == LOGICOP) {
313 BooleanLogic *b =(BooleanLogic *)array[i].getBoolean();
315 return rewriteLogicalOperation(op, array, asize);
322 for (uint i =0; i <asize; i++) {
323 newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
325 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
329 for (uint i = 0; i < asize; i++) {
330 BooleanEdge b = array[i];
331 if (b->type == LOGICOP) {
332 if (((BooleanLogic *)b.getBoolean())->replaced)
333 return rewriteLogicalOperation(op, array, asize);
335 if (b->type == BOOLCONST) {
341 newarray[newindex++] = b;
345 } else if (newindex == 1) {
348 bsdqsort(newarray, newindex, sizeof(BooleanEdge), ptrcompares);
355 //handle by translation
356 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_IFF, array, asize));
359 //handle by translation
360 return applyLogicalOperation(SATC_OR, applyLogicalOperation(SATC_NOT, array[0]), array[1]);
365 Boolean *boolean = new BooleanLogic(this, op, array, asize);
366 Boolean *b = boolMap.get(boolean);
368 boolean->updateParents();
369 boolMap.put(boolean, boolean);
370 allBooleans.push(boolean);
371 return BooleanEdge(boolean);
374 return BooleanEdge(b);
378 BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
379 Boolean *constraint = new BooleanOrder(order, first, second);
380 allBooleans.push(constraint);
381 return BooleanEdge(constraint);
384 void CSolver::addConstraint(BooleanEdge constraint) {
385 if (isTrue(constraint))
387 else if (isFalse(constraint))
390 if (constraint->type == LOGICOP) {
391 BooleanLogic *b=(BooleanLogic *) constraint.getBoolean();
392 if (!constraint.isNegated()) {
393 if (b->op==SATC_AND) {
394 for(uint i=0;i<b->inputs.getSize();i++) {
395 addConstraint(b->inputs.get(i));
401 addConstraint(doRewrite(constraint));
405 constraints.add(constraint);
406 Boolean *ptr=constraint.getBoolean();
408 if (ptr->boolVal == BV_UNSAT)
411 replaceBooleanWithTrueNoRemove(constraint);
412 constraint->parents.clear();
416 Order *CSolver::createOrder(OrderType type, Set *set) {
417 Order *order = new Order(type, set);
418 allOrders.push(order);
419 activeOrders.add(order);
423 int CSolver::solve() {
424 bool deleteTuner = false;
426 tuner = new DefaultTuner();
430 long long startTime = getTimeNano();
431 computePolarities(this);
436 DecomposeOrderTransform dot(this);
439 IntegerEncodingTransform iet(this);
442 naiveEncodingDecision(this);
443 satEncoder->encodeAllSATEncoder(this);
444 int result = unsat ? IS_UNSAT : satEncoder->solve();
445 long long finishTime = getTimeNano();
446 elapsedTime = finishTime - startTime;
454 uint64_t CSolver::getElementValue(Element *element) {
455 switch (element->type) {
459 return getElementValueSATTranslator(this, element);
466 bool CSolver::getBooleanValue(BooleanEdge bedge) {
467 Boolean *boolean=bedge.getBoolean();
468 switch (boolean->type) {
470 return getBooleanVariableValueSATTranslator(this, boolean);
477 bool CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
478 return order->encoding.resolver->resolveOrder(first, second);
481 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
483 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
485 void CSolver::autoTune(uint budget) {
486 AutoTuner *autotuner = new AutoTuner(budget);
487 autotuner->addProblem(this);