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 Element* el = allElements.get(i);
52 model_print("deleting ...%u", i);
57 size = allTables.getSize();
58 for (uint i = 0; i < size; i++) {
59 delete allTables.get(i);
62 size = allPredicates.getSize();
63 for (uint i = 0; i < size; i++) {
64 delete allPredicates.get(i);
67 size = allOrders.getSize();
68 for (uint i = 0; i < size; i++) {
69 delete allOrders.get(i);
72 size = allFunctions.getSize();
73 for (uint i = 0; i < size; i++) {
74 delete allFunctions.get(i);
77 delete boolTrue.getBoolean();
81 CSolver *CSolver::clone() {
82 CSolver *copy = new CSolver();
84 SetIteratorBooleanEdge *it = getConstraints();
85 while (it->hasNext()) {
86 BooleanEdge b = it->next();
87 copy->addConstraint(cloneEdge(copy, &map, b));
93 void CSolver::serialize() {
94 model_print("serializing ...\n");
96 Serializer serializer("dump");
97 SetIteratorBooleanEdge *it = getConstraints();
98 while (it->hasNext()) {
99 BooleanEdge b = it->next();
100 serializeBooleanEdge(&serializer, b);
104 // model_print("deserializing ...\n");
106 // Deserializer deserializer("dump");
107 // deserializer.deserialize();
112 Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
113 Set *set = new Set(type, elements, numelements);
118 Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange) {
119 Set *set = new Set(type, lowrange, highrange);
124 VarType CSolver::getSetVarType(Set *set){
125 return set->getType();
128 Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) {
129 Set *s = createRangeSet(type, lowrange, highrange);
130 return getElementVar(s);
133 MutableSet *CSolver::createMutableSet(VarType type) {
134 MutableSet *set = new MutableSet(type);
139 void CSolver::addItem(MutableSet *set, uint64_t element) {
140 set->addElementMSet(element);
143 uint64_t CSolver::createUniqueItem(MutableSet *set) {
144 uint64_t element = set->getNewUniqueItem();
145 set->addElementMSet(element);
149 void CSolver::finalizeMutableSet(MutableSet* set){
153 Element *CSolver::getElementVar(Set *set) {
154 Element *element = new ElementSet(set);
155 model_println("%%%%ElementVar:%u", allElements.getSize());
156 allElements.push(element);
160 Set* CSolver::getElementRange (Element* element){
161 return element->getRange();
165 Element *CSolver::getElementConst(VarType type, uint64_t value) {
166 uint64_t array[] = {value};
167 Set *set = new Set(type, array, 1);
168 Element *element = new ElementConst(value, set);
169 Element *e = elemMap.get(element);
172 model_println("%%%%ElementConst:%u", allElements.getSize());
173 allElements.push(element);
174 elemMap.put(element, element);
183 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, BooleanEdge overflowstatus) {
184 Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
185 Element *e = elemMap.get(element);
187 element->updateParents();
188 model_println("%%%%ElementFunction:%u", allElements.getSize());
189 allElements.push(element);
190 elemMap.put(element, element);
198 Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
199 Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior);
200 allFunctions.push(function);
204 Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
205 Predicate *predicate = new PredicateOperator(op, domain,numDomain);
206 allPredicates.push(predicate);
210 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
211 Predicate *predicate = new PredicateTable(table, behavior);
212 allPredicates.push(predicate);
216 Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
217 Table *table = new Table(domains,numDomain,range);
218 allTables.push(table);
222 Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
223 return createTable(domains, numDomain, NULL);
226 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
227 table->addNewTableEntry(inputs, inputSize, result);
230 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
231 Function *function = new FunctionTable(table, behavior);
232 allFunctions.push(function);
236 BooleanEdge CSolver::getBooleanVar(VarType type) {
237 Boolean *boolean = new BooleanVar(type);
238 allBooleans.push(boolean);
239 return BooleanEdge(boolean);
242 BooleanEdge CSolver::getBooleanTrue() {
246 BooleanEdge CSolver::getBooleanFalse() {
250 BooleanEdge CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
251 return applyPredicateTable(predicate, inputs, numInputs, BooleanEdge(NULL));
254 BooleanEdge CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, BooleanEdge undefinedStatus) {
255 BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
256 Boolean *b = boolMap.get(boolean);
258 boolean->updateParents();
259 boolMap.put(boolean, boolean);
260 allBooleans.push(boolean);
261 return BooleanEdge(boolean);
264 return BooleanEdge(b);
268 bool CSolver::isTrue(BooleanEdge b) {
269 return b.isNegated()?b->isFalse():b->isTrue();
272 bool CSolver::isFalse(BooleanEdge b) {
273 return b.isNegated()?b->isTrue():b->isFalse();
276 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2) {
277 BooleanEdge array[] = {arg1, arg2};
278 return applyLogicalOperation(op, array, 2);
281 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg) {
282 BooleanEdge array[] = {arg};
283 return applyLogicalOperation(op, array, 1);
286 static int ptrcompares(const void *p1, const void *p2) {
287 uintptr_t b1 = *(uintptr_t const *) p1;
288 uintptr_t b2 = *(uintptr_t const *) p2;
297 BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge * array, uint asize) {
298 return applyLogicalOperation(op, array, asize);
299 /* BooleanEdge newarray[asize];
300 memcpy(newarray, array, asize * sizeof(BooleanEdge));
301 for(uint i=0; i < asize; i++) {
302 BooleanEdge b=newarray[i];
303 if (b->type == LOGICOP) {
304 if (((BooleanLogic *) b.getBoolean())->replaced) {
305 newarray[i] = doRewrite(newarray[i]);
310 return applyLogicalOperation(op, newarray, asize);*/
313 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
314 BooleanEdge newarray[asize];
317 return array[0].negate();
320 for (uint i = 0; i < 2; i++) {
321 if (array[i]->type == BOOLCONST) {
322 if (isTrue(array[i])) { // It can be undefined
324 } else if(isFalse(array[i])) {
325 newarray[0] = array[1 - i];
326 return applyLogicalOperation(SATC_NOT, newarray, 1);
328 } else if (array[i]->type == LOGICOP) {
329 BooleanLogic *b =(BooleanLogic *)array[i].getBoolean();
331 return rewriteLogicalOperation(op, array, asize);
338 for (uint i =0; i <asize; i++) {
339 newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
341 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
345 for (uint i = 0; i < asize; i++) {
346 BooleanEdge b = array[i];
347 // model_print("And: Argument %u:", i);
351 if (b->type == LOGICOP) {
352 if (((BooleanLogic *)b.getBoolean())->replaced)
353 return rewriteLogicalOperation(op, array, asize);
355 if (b->type == BOOLCONST) {
362 newarray[newindex++] = b;
366 } else if (newindex == 1) {
369 bsdqsort(newarray, newindex, sizeof(BooleanEdge), ptrcompares);
376 //handle by translation
377 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_IFF, array, asize));
380 //handle by translation
381 // model_print("Implies: first:");
382 // if(array[0].isNegated())
384 // array[0]->print();
385 // model_print("Implies: second:");
386 // if(array[1].isNegated())
388 // array[1]->print();
389 // model_println("##### OK let's get the operation done");
390 return applyLogicalOperation(SATC_OR, applyLogicalOperation(SATC_NOT, array[0]), array[1]);
395 Boolean *boolean = new BooleanLogic(this, op, array, asize);
396 /* Boolean *b = boolMap.get(boolean);
398 boolean->updateParents();
399 boolMap.put(boolean, boolean);
400 allBooleans.push(boolean);
401 return BooleanEdge(boolean);
404 return BooleanEdge(boolean);
408 BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
410 model_println("Creating order: From:%lu => To:%lu", first, second);
414 Boolean *constraint = new BooleanOrder(order, first, second);
415 allBooleans.push(constraint);
416 return BooleanEdge(constraint);
419 void CSolver::addConstraint(BooleanEdge constraint) {
421 model_println("****New Constraint******");
423 if (isTrue(constraint))
425 else if (isFalse(constraint)){
428 model_println("Adding constraint which is false :|");
433 if (constraint->type == LOGICOP) {
434 BooleanLogic *b=(BooleanLogic *) constraint.getBoolean();
435 if (!constraint.isNegated()) {
436 if (b->op==SATC_AND) {
437 for(uint i=0;i<b->inputs.getSize();i++) {
439 model_println("In loop");
441 addConstraint(b->inputs.get(i));
448 model_println("While rewriting");
450 addConstraint(doRewrite(constraint));
454 constraints.add(constraint);
455 Boolean *ptr=constraint.getBoolean();
457 if (ptr->boolVal == BV_UNSAT){
459 model_println("BooleanValue is Set to UnSAT");
464 replaceBooleanWithTrueNoRemove(constraint);
465 constraint->parents.clear();
469 Order *CSolver::createOrder(OrderType type, Set *set) {
470 Order *order = new Order(type, set);
471 allOrders.push(order);
472 activeOrders.add(order);
476 int CSolver::solve() {
477 bool deleteTuner = false;
479 tuner = new DefaultTuner();
483 long long startTime = getTimeNano();
484 computePolarities(this);
486 // Preprocess pp(this);
489 // DecomposeOrderTransform dot(this);
490 // dot.doTransform();
492 // IntegerEncodingTransform iet(this);
493 // iet.doTransform();
495 // EncodingGraph eg(this);
499 naiveEncodingDecision(this);
500 satEncoder->encodeAllSATEncoder(this);
501 model_println("Is problem UNSAT after encoding: %d", unsat);
502 int result = unsat ? IS_UNSAT : satEncoder->solve();
503 model_println("Result Computed in CSolver: %d", result);
504 long long finishTime = getTimeNano();
505 elapsedTime = finishTime - startTime;
513 uint64_t CSolver::getElementValue(Element *element) {
514 switch (element->type) {
518 return getElementValueSATTranslator(this, element);
525 bool CSolver::getBooleanValue(BooleanEdge bedge) {
526 Boolean *boolean=bedge.getBoolean();
527 switch (boolean->type) {
529 return getBooleanVariableValueSATTranslator(this, boolean);
536 bool CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
537 return order->encoding.resolver->resolveOrder(first, second);
540 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
542 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
544 void CSolver::autoTune(uint budget) {
545 AutoTuner *autotuner = new AutoTuner(budget);
546 autotuner->addProblem(this);