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 MutableSet *CSolver::createMutableSet(VarType type) {
97 MutableSet *set = new MutableSet(type);
102 void CSolver::addItem(MutableSet *set, uint64_t element) {
103 set->addElementMSet(element);
106 uint64_t CSolver::createUniqueItem(MutableSet *set) {
107 uint64_t element = set->getNewUniqueItem();
108 set->addElementMSet(element);
112 Element *CSolver::getElementVar(Set *set) {
113 Element *element = new ElementSet(set);
114 allElements.push(element);
118 Element *CSolver::getElementConst(VarType type, uint64_t value) {
119 uint64_t array[] = {value};
120 Set *set = new Set(type, array, 1);
121 Element *element = new ElementConst(value, type, set);
122 Element *e = elemMap.get(element);
125 allElements.push(element);
126 elemMap.put(element, element);
135 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, Boolean *overflowstatus) {
136 Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
137 Element *e = elemMap.get(element);
139 allElements.push(element);
140 elemMap.put(element, element);
148 Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
149 Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior);
150 allFunctions.push(function);
154 Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
155 Predicate *predicate = new PredicateOperator(op, domain,numDomain);
156 allPredicates.push(predicate);
160 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
161 Predicate *predicate = new PredicateTable(table, behavior);
162 allPredicates.push(predicate);
166 Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
167 Table *table = new Table(domains,numDomain,range);
168 allTables.push(table);
172 Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
173 return createTable(domains, numDomain, NULL);
176 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
177 table->addNewTableEntry(inputs, inputSize, result);
180 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
181 Function *function = new FunctionTable(table, behavior);
182 allFunctions.push(function);
186 Boolean *CSolver::getBooleanVar(VarType type) {
187 Boolean *boolean = new BooleanVar(type);
188 allBooleans.push(boolean);
192 Boolean *CSolver::getBooleanTrue() {
196 Boolean *CSolver::getBooleanFalse() {
200 Boolean *CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
201 return applyPredicateTable(predicate, inputs, numInputs, NULL);
204 Boolean *CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, Boolean *undefinedStatus) {
205 BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
206 Boolean * b = boolMap.get(boolean);
208 boolMap.put(boolean, boolean);
209 allBooleans.push(boolean);
217 Boolean *CSolver::applyLogicalOperation(LogicOp op, Boolean **array, uint asize) {
218 Boolean * newarray[asize];
221 if (array[0]->type == LOGICOP && ((BooleanLogic *)array[0])->op==SATC_NOT) {
222 return ((BooleanLogic *) array[0])->inputs.get(0);
223 } else if (array[0]->type == BOOLCONST) {
224 return array[0]->isTrue() ? boolFalse : boolTrue;
229 for(uint i=0;i<2;i++) {
230 if (array[i]->type == BOOLCONST) {
231 if (array[i]->isTrue()) {
232 newarray[0]=array[1-i];
233 return applyLogicalOperation(SATC_NOT, newarray, 1);
242 for(uint i=0;i<asize;i++) {
244 if (b->type == BOOLCONST) {
250 newarray[newindex++]=b;
254 else if (newindex == 2) {
255 bool isNot0 = (newarray[0]->type==BOOLCONST) && ((BooleanLogic *)newarray[0])->op == SATC_NOT;
256 bool isNot1 = (newarray[1]->type==BOOLCONST) && ((BooleanLogic *)newarray[1])->op == SATC_NOT;
258 if (isNot0 != isNot1) {
260 newarray[0] = ((BooleanLogic *) newarray[0])->inputs.get(0);
262 Boolean *tmp = ((BooleanLogic *) array[1])->inputs.get(0);
266 return applyLogicalOperation(SATC_IMPLIES, newarray, 2);
276 for(uint i=0;i<asize;i++) {
278 if (b->type == BOOLCONST) {
284 newarray[newindex++]=b;
295 if (array[0]->type == BOOLCONST) {
296 if (array[0]->isTrue()) {
301 } else if (array[1]->type == BOOLCONST) {
302 if (array[1]->isTrue()) {
305 return applyLogicalOperation(SATC_NOT, array, 1);
312 Boolean *boolean = new BooleanLogic(this, op, array, asize);
313 Boolean *b = boolMap.get(boolean);
315 boolMap.put(boolean, boolean);
316 allBooleans.push(boolean);
324 Boolean *CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
325 Boolean *constraint = new BooleanOrder(order, first, second);
326 allBooleans.push(constraint);
330 void CSolver::addConstraint(Boolean *constraint) {
331 if (constraint == boolTrue)
333 else if (constraint == boolFalse)
336 constraints.add(constraint);
339 Order *CSolver::createOrder(OrderType type, Set *set) {
340 Order *order = new Order(type, set);
341 allOrders.push(order);
345 int CSolver::startEncoding() {
346 bool deleteTuner = false;
348 tuner = new DefaultTuner();
352 long long startTime = getTimeNano();
353 computePolarities(this);
355 naiveEncodingDecision(this);
356 satEncoder->encodeAllSATEncoder(this);
357 int result = unsat ? IS_UNSAT : satEncoder->solve();
358 long long finishTime = getTimeNano();
359 elapsedTime = finishTime - startTime;
367 uint64_t CSolver::getElementValue(Element *element) {
368 switch (element->type) {
372 return getElementValueSATTranslator(this, element);
379 bool CSolver::getBooleanValue(Boolean *boolean) {
380 switch (boolean->type) {
382 return getBooleanVariableValueSATTranslator(this, boolean);
389 HappenedBefore CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
390 return getOrderConstraintValueSATTranslator(this, order, first, second);
393 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
395 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
397 void CSolver::autoTune(uint budget) {
398 AutoTuner * autotuner=new AutoTuner(budget);
399 autotuner->addProblem(this);