3 #include "mutableset.h"
10 #include "satencoder.h"
11 #include "sattranslator.h"
13 #include "polarityassignment.h"
15 #include "autotuner.h"
20 boolTrue(new BooleanConst(true)),
21 boolFalse(new BooleanConst(false)),
26 satEncoder = new SATEncoder(this);
29 /** This function tears down the solver and the entire AST */
32 uint size = allBooleans.getSize();
33 for (uint i = 0; i < size; i++) {
34 delete allBooleans.get(i);
37 size = allSets.getSize();
38 for (uint i = 0; i < size; i++) {
39 delete allSets.get(i);
42 size = allElements.getSize();
43 for (uint i = 0; i < size; i++) {
44 delete allElements.get(i);
47 size = allTables.getSize();
48 for (uint i = 0; i < size; i++) {
49 delete allTables.get(i);
52 size = allPredicates.getSize();
53 for (uint i = 0; i < size; i++) {
54 delete allPredicates.get(i);
57 size = allOrders.getSize();
58 for (uint i = 0; i < size; i++) {
59 delete allOrders.get(i);
62 size = allFunctions.getSize();
63 for (uint i = 0; i < size; i++) {
64 delete allFunctions.get(i);
72 CSolver *CSolver::clone() {
73 CSolver *copy = new CSolver();
75 SetIteratorBoolean *it = getConstraints();
76 while (it->hasNext()) {
77 Boolean *b = it->next();
78 copy->addConstraint(b->clone(copy, &map));
84 Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
85 Set *set = new Set(type, elements, numelements);
90 Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange) {
91 Set *set = new Set(type, lowrange, highrange);
96 Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) {
97 Set *s = createRangeSet(type, lowrange, highrange);
98 return getElementVar(s);
101 MutableSet *CSolver::createMutableSet(VarType type) {
102 MutableSet *set = new MutableSet(type);
107 void CSolver::addItem(MutableSet *set, uint64_t element) {
108 set->addElementMSet(element);
111 uint64_t CSolver::createUniqueItem(MutableSet *set) {
112 uint64_t element = set->getNewUniqueItem();
113 set->addElementMSet(element);
117 Element *CSolver::getElementVar(Set *set) {
118 Element *element = new ElementSet(set);
119 allElements.push(element);
123 Element *CSolver::getElementConst(VarType type, uint64_t value) {
124 uint64_t array[] = {value};
125 Set *set = new Set(type, array, 1);
126 Element *element = new ElementConst(value, type, set);
127 Element *e = elemMap.get(element);
130 allElements.push(element);
131 elemMap.put(element, element);
140 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, Boolean *overflowstatus) {
141 Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
142 Element *e = elemMap.get(element);
144 allElements.push(element);
145 elemMap.put(element, element);
153 Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
154 Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior);
155 allFunctions.push(function);
159 Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
160 Predicate *predicate = new PredicateOperator(op, domain,numDomain);
161 allPredicates.push(predicate);
165 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
166 Predicate *predicate = new PredicateTable(table, behavior);
167 allPredicates.push(predicate);
171 Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
172 Table *table = new Table(domains,numDomain,range);
173 allTables.push(table);
177 Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
178 return createTable(domains, numDomain, NULL);
181 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
182 table->addNewTableEntry(inputs, inputSize, result);
185 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
186 Function *function = new FunctionTable(table, behavior);
187 allFunctions.push(function);
191 Boolean *CSolver::getBooleanVar(VarType type) {
192 Boolean *boolean = new BooleanVar(type);
193 allBooleans.push(boolean);
197 Boolean *CSolver::getBooleanTrue() {
201 Boolean *CSolver::getBooleanFalse() {
205 Boolean *CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
206 return applyPredicateTable(predicate, inputs, numInputs, NULL);
209 Boolean *CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, Boolean *undefinedStatus) {
210 BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
211 Boolean * b = boolMap.get(boolean);
213 boolMap.put(boolean, boolean);
214 allBooleans.push(boolean);
222 bool CSolver::isTrue(Boolean *b) {
226 bool CSolver::isFalse(Boolean *b) {
230 Boolean *CSolver::applyLogicalOperation(LogicOp op, Boolean **array, uint asize) {
231 Boolean * newarray[asize];
234 if (array[0]->type == LOGICOP && ((BooleanLogic *)array[0])->op==SATC_NOT) {
235 return ((BooleanLogic *) array[0])->inputs.get(0);
236 } else if (array[0]->type == BOOLCONST) {
237 return array[0]->isTrue() ? boolFalse : boolTrue;
242 for(uint i=0;i<2;i++) {
243 if (array[i]->type == BOOLCONST) {
244 if (array[i]->isTrue()) {
245 newarray[0]=array[1-i];
246 return applyLogicalOperation(SATC_NOT, newarray, 1);
255 for(uint i=0;i<asize;i++) {
257 if (b->type == BOOLCONST) {
263 newarray[newindex++]=b;
267 else if (newindex == 2) {
268 bool isNot0 = (newarray[0]->type==BOOLCONST) && ((BooleanLogic *)newarray[0])->op == SATC_NOT;
269 bool isNot1 = (newarray[1]->type==BOOLCONST) && ((BooleanLogic *)newarray[1])->op == SATC_NOT;
271 if (isNot0 != isNot1) {
273 newarray[0] = ((BooleanLogic *) newarray[0])->inputs.get(0);
275 Boolean *tmp = ((BooleanLogic *) array[1])->inputs.get(0);
279 return applyLogicalOperation(SATC_IMPLIES, newarray, 2);
289 for(uint i=0;i<asize;i++) {
291 if (b->type == BOOLCONST) {
297 newarray[newindex++]=b;
308 if (array[0]->type == BOOLCONST) {
309 if (array[0]->isTrue()) {
314 } else if (array[1]->type == BOOLCONST) {
315 if (array[1]->isTrue()) {
318 return applyLogicalOperation(SATC_NOT, array, 1);
325 Boolean *boolean = new BooleanLogic(this, op, array, asize);
326 Boolean *b = boolMap.get(boolean);
328 boolMap.put(boolean, boolean);
329 allBooleans.push(boolean);
337 Boolean *CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
338 Boolean *constraint = new BooleanOrder(order, first, second);
339 allBooleans.push(constraint);
343 void CSolver::addConstraint(Boolean *constraint) {
344 if (constraint == boolTrue)
346 else if (constraint == boolFalse)
349 constraints.add(constraint);
352 Order *CSolver::createOrder(OrderType type, Set *set) {
353 Order *order = new Order(type, set);
354 allOrders.push(order);
358 int CSolver::startEncoding() {
359 bool deleteTuner = false;
361 tuner = new DefaultTuner();
365 long long startTime = getTimeNano();
366 computePolarities(this);
368 naiveEncodingDecision(this);
369 satEncoder->encodeAllSATEncoder(this);
370 int result = unsat ? IS_UNSAT : satEncoder->solve();
371 long long finishTime = getTimeNano();
372 elapsedTime = finishTime - startTime;
380 uint64_t CSolver::getElementValue(Element *element) {
381 switch (element->type) {
385 return getElementValueSATTranslator(this, element);
392 bool CSolver::getBooleanValue(Boolean *boolean) {
393 switch (boolean->type) {
395 return getBooleanVariableValueSATTranslator(this, boolean);
402 HappenedBefore CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
403 return getOrderConstraintValueSATTranslator(this, order, first, second);
406 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
408 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
410 void CSolver::autoTune(uint budget) {
411 AutoTuner * autotuner=new AutoTuner(budget);
412 autotuner->addProblem(this);