3 #include "mutableset.h"
10 #include "satencoder.h"
11 #include "sattranslator.h"
13 #include "polarityassignment.h"
14 #include "transformer.h"
15 #include "autotuner.h"
18 #include "orderresolver.h"
21 boolTrue(new BooleanConst(true)),
22 boolFalse(new BooleanConst(false)),
27 satEncoder = new SATEncoder(this);
28 transformer = new Transformer(this);
31 /** This function tears down the solver and the entire AST */
34 uint size = allBooleans.getSize();
35 for (uint i = 0; i < size; i++) {
36 delete allBooleans.get(i);
39 size = allSets.getSize();
40 for (uint i = 0; i < size; i++) {
41 delete allSets.get(i);
44 size = allElements.getSize();
45 for (uint i = 0; i < size; i++) {
46 delete allElements.get(i);
49 size = allTables.getSize();
50 for (uint i = 0; i < size; i++) {
51 delete allTables.get(i);
54 size = allPredicates.getSize();
55 for (uint i = 0; i < size; i++) {
56 delete allPredicates.get(i);
59 size = allOrders.getSize();
60 for (uint i = 0; i < size; i++) {
61 delete allOrders.get(i);
64 size = allFunctions.getSize();
65 for (uint i = 0; i < size; i++) {
66 delete allFunctions.get(i);
75 CSolver *CSolver::clone() {
76 CSolver *copy = new CSolver();
78 SetIteratorBoolean *it = getConstraints();
79 while (it->hasNext()) {
80 Boolean *b = it->next();
81 copy->addConstraint(b->clone(copy, &map));
87 Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
88 Set *set = new Set(type, elements, numelements);
93 Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange) {
94 Set *set = new Set(type, lowrange, highrange);
99 Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) {
100 Set *s = createRangeSet(type, lowrange, highrange);
101 return getElementVar(s);
104 MutableSet *CSolver::createMutableSet(VarType type) {
105 MutableSet *set = new MutableSet(type);
110 void CSolver::addItem(MutableSet *set, uint64_t element) {
111 set->addElementMSet(element);
114 uint64_t CSolver::createUniqueItem(MutableSet *set) {
115 uint64_t element = set->getNewUniqueItem();
116 set->addElementMSet(element);
120 Element *CSolver::getElementVar(Set *set) {
121 Element *element = new ElementSet(set);
122 allElements.push(element);
126 Element *CSolver::getElementConst(VarType type, uint64_t value) {
127 uint64_t array[] = {value};
128 Set *set = new Set(type, array, 1);
129 Element *element = new ElementConst(value, type, set);
130 Element *e = elemMap.get(element);
133 allElements.push(element);
134 elemMap.put(element, element);
143 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, Boolean *overflowstatus) {
144 Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
145 Element *e = elemMap.get(element);
147 allElements.push(element);
148 elemMap.put(element, element);
156 Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
157 Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior);
158 allFunctions.push(function);
162 Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
163 Predicate *predicate = new PredicateOperator(op, domain,numDomain);
164 allPredicates.push(predicate);
168 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
169 Predicate *predicate = new PredicateTable(table, behavior);
170 allPredicates.push(predicate);
174 Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
175 Table *table = new Table(domains,numDomain,range);
176 allTables.push(table);
180 Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
181 return createTable(domains, numDomain, NULL);
184 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
185 table->addNewTableEntry(inputs, inputSize, result);
188 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
189 Function *function = new FunctionTable(table, behavior);
190 allFunctions.push(function);
194 Boolean *CSolver::getBooleanVar(VarType type) {
195 Boolean *boolean = new BooleanVar(type);
196 allBooleans.push(boolean);
200 Boolean *CSolver::getBooleanTrue() {
204 Boolean *CSolver::getBooleanFalse() {
208 Boolean *CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
209 return applyPredicateTable(predicate, inputs, numInputs, NULL);
212 Boolean *CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, Boolean *undefinedStatus) {
213 BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
214 Boolean * b = boolMap.get(boolean);
216 boolMap.put(boolean, boolean);
217 allBooleans.push(boolean);
225 bool CSolver::isTrue(Boolean *b) {
229 bool CSolver::isFalse(Boolean *b) {
233 Boolean *CSolver::applyLogicalOperation(LogicOp op, Boolean * arg1, Boolean * arg2) {
234 Boolean * array[] = {arg1, arg2};
235 return applyLogicalOperation(op, array, 2);
238 Boolean *CSolver::applyLogicalOperation(LogicOp op, Boolean *arg) {
239 Boolean * array[] = {arg};
240 return applyLogicalOperation(op, array, 1);
244 Boolean *CSolver::applyLogicalOperation(LogicOp op, Boolean **array, uint asize) {
245 Boolean * newarray[asize];
248 if (array[0]->type == LOGICOP && ((BooleanLogic *)array[0])->op==SATC_NOT) {
249 return ((BooleanLogic *) array[0])->inputs.get(0);
250 } else if (array[0]->type == BOOLCONST) {
251 return array[0]->isTrue() ? boolFalse : boolTrue;
256 for(uint i=0;i<2;i++) {
257 if (array[i]->type == BOOLCONST) {
258 if (array[i]->isTrue()) {
261 newarray[0]=array[1-i];
262 return applyLogicalOperation(SATC_NOT, newarray, 1);
269 for(uint i=0;i<2;i++) {
270 if (array[i]->type == BOOLCONST) {
271 if (array[i]->isTrue()) {
272 newarray[0]=array[1-i];
273 return applyLogicalOperation(SATC_NOT, newarray, 1);
282 for(uint i=0;i<asize;i++) {
284 if (b->type == BOOLCONST) {
290 newarray[newindex++]=b;
294 } else if (newindex==1)
296 else if (newindex == 2) {
297 bool isNot0 = (newarray[0]->type==BOOLCONST) && ((BooleanLogic *)newarray[0])->op == SATC_NOT;
298 bool isNot1 = (newarray[1]->type==BOOLCONST) && ((BooleanLogic *)newarray[1])->op == SATC_NOT;
300 if (isNot0 != isNot1) {
302 newarray[0] = ((BooleanLogic *) newarray[0])->inputs.get(0);
304 Boolean *tmp = ((BooleanLogic *) array[1])->inputs.get(0);
308 return applyLogicalOperation(SATC_IMPLIES, newarray, 2);
318 for(uint i=0;i<asize;i++) {
320 if (b->type == BOOLCONST) {
326 newarray[newindex++]=b;
330 } else if(newindex==1) {
339 if (array[0]->type == BOOLCONST) {
340 if (array[0]->isTrue()) {
345 } else if (array[1]->type == BOOLCONST) {
346 if (array[1]->isTrue()) {
349 return applyLogicalOperation(SATC_NOT, array, 1);
357 Boolean *boolean = new BooleanLogic(this, op, array, asize);
358 Boolean *b = boolMap.get(boolean);
360 boolMap.put(boolean, boolean);
361 allBooleans.push(boolean);
369 Boolean *CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
370 Boolean *constraint = new BooleanOrder(order, first, second);
371 allBooleans.push(constraint);
375 void CSolver::addConstraint(Boolean *constraint) {
376 if (constraint == boolTrue)
378 else if (constraint == boolFalse)
381 constraints.add(constraint);
384 Order *CSolver::createOrder(OrderType type, Set *set) {
385 Order *order = new Order(type, set);
386 allOrders.push(order);
390 int CSolver::solve() {
391 bool deleteTuner = false;
393 tuner = new DefaultTuner();
397 long long startTime = getTimeNano();
398 computePolarities(this);
399 transformer->orderAnalysis();
400 naiveEncodingDecision(this);
401 satEncoder->encodeAllSATEncoder(this);
402 int result = unsat ? IS_UNSAT : satEncoder->solve();
403 long long finishTime = getTimeNano();
404 elapsedTime = finishTime - startTime;
412 uint64_t CSolver::getElementValue(Element *element) {
413 switch (element->type) {
417 return getElementValueSATTranslator(this, element);
424 bool CSolver::getBooleanValue(Boolean *boolean) {
425 switch (boolean->type) {
427 return getBooleanVariableValueSATTranslator(this, boolean);
434 HappenedBefore CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
435 return order->encoding.resolver->resolveOrder(first, second);
438 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
440 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
442 void CSolver::autoTune(uint budget) {
443 AutoTuner * autotuner=new AutoTuner(budget);
444 autotuner->addProblem(this);