3 #include "mutableset.h"
10 #include "satencoder.h"
11 #include "sattranslator.h"
13 #include "polarityassignment.h"
14 #include "transformer.h"
15 #include "autotuner.h"
20 boolTrue(new BooleanConst(true)),
21 boolFalse(new BooleanConst(false)),
26 satEncoder = new SATEncoder(this);
27 transformer = new Transformer(this);
30 /** This function tears down the solver and the entire AST */
33 uint size = allBooleans.getSize();
34 for (uint i = 0; i < size; i++) {
35 delete allBooleans.get(i);
38 size = allSets.getSize();
39 for (uint i = 0; i < size; i++) {
40 delete allSets.get(i);
43 size = allElements.getSize();
44 for (uint i = 0; i < size; i++) {
45 delete allElements.get(i);
48 size = allTables.getSize();
49 for (uint i = 0; i < size; i++) {
50 delete allTables.get(i);
53 size = allPredicates.getSize();
54 for (uint i = 0; i < size; i++) {
55 delete allPredicates.get(i);
58 size = allOrders.getSize();
59 for (uint i = 0; i < size; i++) {
60 delete allOrders.get(i);
63 size = allFunctions.getSize();
64 for (uint i = 0; i < size; i++) {
65 delete allFunctions.get(i);
74 CSolver *CSolver::clone() {
75 CSolver *copy = new CSolver();
77 SetIteratorBoolean *it = getConstraints();
78 while (it->hasNext()) {
79 Boolean *b = it->next();
80 copy->addConstraint(b->clone(copy, &map));
86 Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
87 Set *set = new Set(type, elements, numelements);
92 Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange) {
93 Set *set = new Set(type, lowrange, highrange);
98 Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) {
99 Set *s = createRangeSet(type, lowrange, highrange);
100 return getElementVar(s);
103 MutableSet *CSolver::createMutableSet(VarType type) {
104 MutableSet *set = new MutableSet(type);
109 void CSolver::addItem(MutableSet *set, uint64_t element) {
110 set->addElementMSet(element);
113 uint64_t CSolver::createUniqueItem(MutableSet *set) {
114 uint64_t element = set->getNewUniqueItem();
115 set->addElementMSet(element);
119 Element *CSolver::getElementVar(Set *set) {
120 Element *element = new ElementSet(set);
121 allElements.push(element);
125 Element *CSolver::getElementConst(VarType type, uint64_t value) {
126 uint64_t array[] = {value};
127 Set *set = new Set(type, array, 1);
128 Element *element = new ElementConst(value, type, set);
129 Element *e = elemMap.get(element);
132 allElements.push(element);
133 elemMap.put(element, element);
142 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, Boolean *overflowstatus) {
143 Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
144 Element *e = elemMap.get(element);
146 allElements.push(element);
147 elemMap.put(element, element);
155 Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
156 Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior);
157 allFunctions.push(function);
161 Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
162 Predicate *predicate = new PredicateOperator(op, domain,numDomain);
163 allPredicates.push(predicate);
167 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
168 Predicate *predicate = new PredicateTable(table, behavior);
169 allPredicates.push(predicate);
173 Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
174 Table *table = new Table(domains,numDomain,range);
175 allTables.push(table);
179 Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
180 return createTable(domains, numDomain, NULL);
183 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
184 table->addNewTableEntry(inputs, inputSize, result);
187 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
188 Function *function = new FunctionTable(table, behavior);
189 allFunctions.push(function);
193 Boolean *CSolver::getBooleanVar(VarType type) {
194 Boolean *boolean = new BooleanVar(type);
195 allBooleans.push(boolean);
199 Boolean *CSolver::getBooleanTrue() {
203 Boolean *CSolver::getBooleanFalse() {
207 Boolean *CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
208 return applyPredicateTable(predicate, inputs, numInputs, NULL);
211 Boolean *CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, Boolean *undefinedStatus) {
212 BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
213 Boolean * b = boolMap.get(boolean);
215 boolMap.put(boolean, boolean);
216 allBooleans.push(boolean);
224 bool CSolver::isTrue(Boolean *b) {
228 bool CSolver::isFalse(Boolean *b) {
232 Boolean *CSolver::applyLogicalOperation(LogicOp op, Boolean * arg1, Boolean * arg2) {
233 Boolean * array[] = {arg1, arg2};
234 return applyLogicalOperation(op, array, 2);
237 Boolean *CSolver::applyLogicalOperation(LogicOp op, Boolean *arg) {
238 Boolean * array[] = {arg};
239 return applyLogicalOperation(op, array, 1);
243 Boolean *CSolver::applyLogicalOperation(LogicOp op, Boolean **array, uint asize) {
244 Boolean * newarray[asize];
247 if (array[0]->type == LOGICOP && ((BooleanLogic *)array[0])->op==SATC_NOT) {
248 return ((BooleanLogic *) array[0])->inputs.get(0);
249 } else if (array[0]->type == BOOLCONST) {
250 return array[0]->isTrue() ? boolFalse : boolTrue;
255 for(uint i=0;i<2;i++) {
256 if (array[i]->type == BOOLCONST) {
257 if (array[i]->isTrue()) {
260 newarray[0]=array[1-i];
261 return applyLogicalOperation(SATC_NOT, newarray, 1);
268 for(uint i=0;i<2;i++) {
269 if (array[i]->type == BOOLCONST) {
270 if (array[i]->isTrue()) {
271 newarray[0]=array[1-i];
272 return applyLogicalOperation(SATC_NOT, newarray, 1);
281 for(uint i=0;i<asize;i++) {
283 if (b->type == BOOLCONST) {
289 newarray[newindex++]=b;
293 } else if (newindex==1)
295 else if (newindex == 2) {
296 bool isNot0 = (newarray[0]->type==BOOLCONST) && ((BooleanLogic *)newarray[0])->op == SATC_NOT;
297 bool isNot1 = (newarray[1]->type==BOOLCONST) && ((BooleanLogic *)newarray[1])->op == SATC_NOT;
299 if (isNot0 != isNot1) {
301 newarray[0] = ((BooleanLogic *) newarray[0])->inputs.get(0);
303 Boolean *tmp = ((BooleanLogic *) array[1])->inputs.get(0);
307 return applyLogicalOperation(SATC_IMPLIES, newarray, 2);
317 for(uint i=0;i<asize;i++) {
319 if (b->type == BOOLCONST) {
325 newarray[newindex++]=b;
329 } else if(newindex==1) {
338 if (array[0]->type == BOOLCONST) {
339 if (array[0]->isTrue()) {
344 } else if (array[1]->type == BOOLCONST) {
345 if (array[1]->isTrue()) {
348 return applyLogicalOperation(SATC_NOT, array, 1);
356 Boolean *boolean = new BooleanLogic(this, op, array, asize);
357 Boolean *b = boolMap.get(boolean);
359 boolMap.put(boolean, boolean);
360 allBooleans.push(boolean);
368 Boolean *CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
369 Boolean *constraint = new BooleanOrder(order, first, second);
370 allBooleans.push(constraint);
374 void CSolver::addConstraint(Boolean *constraint) {
375 if (constraint == boolTrue)
377 else if (constraint == boolFalse)
380 constraints.add(constraint);
383 Order *CSolver::createOrder(OrderType type, Set *set) {
384 Order *order = new Order(type, set);
385 allOrders.push(order);
389 int CSolver::solve() {
390 bool deleteTuner = false;
392 tuner = new DefaultTuner();
396 long long startTime = getTimeNano();
397 computePolarities(this);
398 transformer->orderAnalysis();
399 naiveEncodingDecision(this);
400 satEncoder->encodeAllSATEncoder(this);
401 int result = unsat ? IS_UNSAT : satEncoder->solve();
402 long long finishTime = getTimeNano();
403 elapsedTime = finishTime - startTime;
411 uint64_t CSolver::getElementValue(Element *element) {
412 switch (element->type) {
416 return getElementValueSATTranslator(this, element);
423 bool CSolver::getBooleanValue(Boolean *boolean) {
424 switch (boolean->type) {
426 return getBooleanVariableValueSATTranslator(this, boolean);
433 HappenedBefore CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
434 return getOrderConstraintValueSATTranslator(this, order, first, second);
437 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
439 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
441 void CSolver::autoTune(uint budget) {
442 AutoTuner * autotuner=new AutoTuner(budget);
443 autotuner->addProblem(this);