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 "encodinggraph.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);
68 size = allFunctions.getSize();
69 for (uint i = 0; i < size; i++) {
70 delete allFunctions.get(i);
73 delete boolTrue.getBoolean();
77 CSolver *CSolver::clone() {
78 CSolver *copy = new CSolver();
80 SetIteratorBooleanEdge *it = getConstraints();
81 while (it->hasNext()) {
82 BooleanEdge b = it->next();
83 copy->addConstraint(cloneEdge(copy, &map, b));
89 void CSolver::serialize() {
90 model_print("serializing ...\n");
92 Serializer serializer("dump");
93 SetIteratorBooleanEdge *it = getConstraints();
94 while (it->hasNext()) {
95 BooleanEdge b = it->next();
96 serializeBooleanEdge(&serializer, b);
100 model_print("deserializing ...\n");
102 Deserializer deserializer("dump");
103 deserializer.deserialize();
107 Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
108 Set *set = new Set(type, elements, numelements);
113 Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange) {
114 Set *set = new Set(type, lowrange, highrange);
119 VarType CSolver::getSetVarType(Set *set) {
120 return set->getType();
123 Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) {
124 Set *s = createRangeSet(type, lowrange, highrange);
125 return getElementVar(s);
128 MutableSet *CSolver::createMutableSet(VarType type) {
129 MutableSet *set = new MutableSet(type);
134 void CSolver::addItem(MutableSet *set, uint64_t element) {
135 set->addElementMSet(element);
138 uint64_t CSolver::createUniqueItem(MutableSet *set) {
139 uint64_t element = set->getNewUniqueItem();
140 set->addElementMSet(element);
144 void CSolver::finalizeMutableSet(MutableSet *set) {
148 Element *CSolver::getElementVar(Set *set) {
149 Element *element = new ElementSet(set);
150 allElements.push(element);
154 Set *CSolver::getElementRange (Element *element) {
155 return element->getRange();
159 Element *CSolver::getElementConst(VarType type, uint64_t value) {
160 uint64_t array[] = {value};
161 Set *set = new Set(type, array, 1);
162 Element *element = new ElementConst(value, set);
163 Element *e = elemMap.get(element);
166 allElements.push(element);
167 elemMap.put(element, element);
177 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, BooleanEdge overflowstatus) {
178 Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
179 Element *e = elemMap.get(element);
181 element->updateParents();
182 allElements.push(element);
183 elemMap.put(element, element);
191 Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
192 Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior);
193 allFunctions.push(function);
197 Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
198 Predicate *predicate = new PredicateOperator(op, domain,numDomain);
199 allPredicates.push(predicate);
203 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
204 Predicate *predicate = new PredicateTable(table, behavior);
205 allPredicates.push(predicate);
209 Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
210 Table *table = new Table(domains,numDomain,range);
211 allTables.push(table);
215 Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
216 return createTable(domains, numDomain, NULL);
219 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
220 table->addNewTableEntry(inputs, inputSize, result);
223 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
224 Function *function = new FunctionTable(table, behavior);
225 allFunctions.push(function);
229 BooleanEdge CSolver::getBooleanVar(VarType type) {
230 Boolean *boolean = new BooleanVar(type);
231 allBooleans.push(boolean);
232 return BooleanEdge(boolean);
235 BooleanEdge CSolver::getBooleanTrue() {
239 BooleanEdge CSolver::getBooleanFalse() {
243 BooleanEdge CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
244 return applyPredicateTable(predicate, inputs, numInputs, BooleanEdge(NULL));
247 BooleanEdge CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, BooleanEdge undefinedStatus) {
248 BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
249 Boolean *b = boolMap.get(boolean);
251 boolean->updateParents();
252 boolMap.put(boolean, boolean);
253 allBooleans.push(boolean);
254 return BooleanEdge(boolean);
257 return BooleanEdge(b);
261 bool CSolver::isTrue(BooleanEdge b) {
262 return b.isNegated() ? b->isFalse() : b->isTrue();
265 bool CSolver::isFalse(BooleanEdge b) {
266 return b.isNegated() ? b->isTrue() : b->isFalse();
269 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2) {
270 BooleanEdge array[] = {arg1, arg2};
271 return applyLogicalOperation(op, array, 2);
274 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg) {
275 BooleanEdge array[] = {arg};
276 return applyLogicalOperation(op, array, 1);
279 static int ptrcompares(const void *p1, const void *p2) {
280 uintptr_t b1 = *(uintptr_t const *) p1;
281 uintptr_t b2 = *(uintptr_t const *) p2;
290 BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
291 BooleanEdge newarray[asize];
292 memcpy(newarray, array, asize * sizeof(BooleanEdge));
293 for (uint i = 0; i < asize; i++) {
294 BooleanEdge b = newarray[i];
295 if (b->type == LOGICOP) {
296 if (((BooleanLogic *) b.getBoolean())->replaced) {
297 newarray[i] = doRewrite(newarray[i]);
302 return applyLogicalOperation(op, newarray, asize);
305 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
306 BooleanEdge newarray[asize];
309 return array[0].negate();
312 for (uint i = 0; i < 2; i++) {
313 if (isTrue(array[i])) { // It can be undefined
315 } else if (isFalse(array[i])) {
316 newarray[0] = array[1 - i];
317 return applyLogicalOperation(SATC_NOT, newarray, 1);
318 } else if (array[i]->type == LOGICOP) {
319 BooleanLogic *b = (BooleanLogic *)array[i].getBoolean();
321 return rewriteLogicalOperation(op, array, asize);
328 for (uint i = 0; i < asize; i++) {
329 newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
331 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
335 for (uint i = 0; i < asize; i++) {
336 BooleanEdge b = array[i];
337 if (b->type == LOGICOP) {
338 if (((BooleanLogic *)b.getBoolean())->replaced)
339 return rewriteLogicalOperation(op, array, asize);
343 else if (isFalse(b)) {
346 newarray[newindex++] = b;
350 } else if (newindex == 1) {
353 bsdqsort(newarray, newindex, sizeof(BooleanEdge), ptrcompares);
360 //handle by translation
361 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_IFF, array, asize));
364 //handle by translation
365 return applyLogicalOperation(SATC_OR, applyLogicalOperation(SATC_NOT, array[0]), array[1]);
370 Boolean *boolean = new BooleanLogic(this, op, array, asize);
371 Boolean *b = boolMap.get(boolean);
373 boolean->updateParents();
374 boolMap.put(boolean, boolean);
375 allBooleans.push(boolean);
376 return BooleanEdge(boolean);
379 return BooleanEdge(b);
383 BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
384 // ASSERT(first != second);
386 return getBooleanFalse();
389 if (order->type == SATC_TOTAL) {
390 if (first > second) {
391 uint64_t tmp = first;
397 Boolean *constraint = new BooleanOrder(order, first, second);
398 Boolean *b = boolMap.get(constraint);
401 allBooleans.push(constraint);
402 boolMap.put(constraint, constraint);
403 constraint->updateParents();
409 BooleanEdge be = BooleanEdge(constraint);
410 return negate ? be.negate() : be;
413 void CSolver::addConstraint(BooleanEdge constraint) {
414 if (isTrue(constraint))
416 else if (isFalse(constraint)) {
421 if (constraint->type == LOGICOP) {
422 BooleanLogic *b = (BooleanLogic *) constraint.getBoolean();
423 if (!constraint.isNegated()) {
424 if (b->op == SATC_AND) {
425 for (uint i = 0; i < b->inputs.getSize(); i++) {
426 addConstraint(b->inputs.get(i));
432 addConstraint(doRewrite(constraint));
436 constraints.add(constraint);
437 Boolean *ptr = constraint.getBoolean();
439 if (ptr->boolVal == BV_UNSAT) {
443 replaceBooleanWithTrueNoRemove(constraint);
444 constraint->parents.clear();
448 Order *CSolver::createOrder(OrderType type, Set *set) {
449 Order *order = new Order(type, set);
450 allOrders.push(order);
451 activeOrders.add(order);
455 int CSolver::solve() {
456 bool deleteTuner = false;
458 tuner = new DefaultTuner();
462 long long startTime = getTimeNano();
463 computePolarities(this);
468 DecomposeOrderTransform dot(this);
471 //IntegerEncodingTransform iet(this);
474 //EncodingGraph eg(this);
477 //printConstraints();
478 naiveEncodingDecision(this);
479 satEncoder->encodeAllSATEncoder(this);
480 model_print("Is problem UNSAT after encoding: %d\n", unsat);
481 int result = unsat ? IS_UNSAT : satEncoder->solve();
482 model_print("Result Computed in CSolver: %d\n", result);
483 long long finishTime = getTimeNano();
484 elapsedTime = finishTime - startTime;
492 void CSolver::printConstraints() {
493 SetIteratorBooleanEdge *it = getConstraints();
494 while (it->hasNext()) {
495 BooleanEdge b = it->next();
505 void CSolver::printConstraint(BooleanEdge b) {
512 uint64_t CSolver::getElementValue(Element *element) {
513 switch (element->type) {
517 return getElementValueSATTranslator(this, element);
524 bool CSolver::getBooleanValue(BooleanEdge bedge) {
525 Boolean *boolean = bedge.getBoolean();
526 switch (boolean->type) {
528 return getBooleanVariableValueSATTranslator(this, boolean);
535 bool CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
536 return order->encoding.resolver->resolveOrder(first, second);
539 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
541 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
543 void CSolver::autoTune(uint budget) {
544 AutoTuner *autotuner = new AutoTuner(budget);
545 autotuner->addProblem(this);