3 #include "mutableset.h"
10 #include "satencoder.h"
11 #include "sattranslator.h"
13 #include "polarityassignment.h"
15 #include "autotuner.h"
19 boolTrue(new BooleanConst(true)),
20 boolFalse(new BooleanConst(false)),
25 satEncoder = new SATEncoder(this);
28 /** This function tears down the solver and the entire AST */
31 uint size = allBooleans.getSize();
32 for (uint i = 0; i < size; i++) {
33 delete allBooleans.get(i);
36 size = allSets.getSize();
37 for (uint i = 0; i < size; i++) {
38 delete allSets.get(i);
41 size = allElements.getSize();
42 for (uint i = 0; i < size; i++) {
43 delete allElements.get(i);
46 size = allTables.getSize();
47 for (uint i = 0; i < size; i++) {
48 delete allTables.get(i);
51 size = allPredicates.getSize();
52 for (uint i = 0; i < size; i++) {
53 delete allPredicates.get(i);
56 size = allOrders.getSize();
57 for (uint i = 0; i < size; i++) {
58 delete allOrders.get(i);
61 size = allFunctions.getSize();
62 for (uint i = 0; i < size; i++) {
63 delete allFunctions.get(i);
71 CSolver *CSolver::clone() {
72 CSolver *copy = new CSolver();
74 HSIteratorBoolean *it = getConstraints();
75 while (it->hasNext()) {
76 Boolean *b = it->next();
77 copy->addConstraint(b->clone(copy, &map));
83 Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
84 Set *set = new Set(type, elements, numelements);
89 Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange) {
90 Set *set = new Set(type, lowrange, highrange);
95 MutableSet *CSolver::createMutableSet(VarType type) {
96 MutableSet *set = new MutableSet(type);
101 void CSolver::addItem(MutableSet *set, uint64_t element) {
102 set->addElementMSet(element);
105 uint64_t CSolver::createUniqueItem(MutableSet *set) {
106 uint64_t element = set->getNewUniqueItem();
107 set->addElementMSet(element);
111 Element *CSolver::getElementVar(Set *set) {
112 Element *element = new ElementSet(set);
113 allElements.push(element);
117 Element *CSolver::getElementConst(VarType type, uint64_t value) {
118 uint64_t array[] = {value};
119 Set *set = new Set(type, array, 1);
120 Element *element = new ElementConst(value, type, set);
121 Element *e = elemMap.get(element);
124 allElements.push(element);
125 elemMap.put(element, element);
134 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, Boolean *overflowstatus) {
135 Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
136 Element *e = elemMap.get(element);
138 allElements.push(element);
139 elemMap.put(element, element);
147 Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
148 Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior);
149 allFunctions.push(function);
153 Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
154 Predicate *predicate = new PredicateOperator(op, domain,numDomain);
155 allPredicates.push(predicate);
159 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
160 Predicate *predicate = new PredicateTable(table, behavior);
161 allPredicates.push(predicate);
165 Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
166 Table *table = new Table(domains,numDomain,range);
167 allTables.push(table);
171 Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
172 return createTable(domains, numDomain, NULL);
175 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
176 table->addNewTableEntry(inputs, inputSize, result);
179 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
180 Function *function = new FunctionTable(table, behavior);
181 allFunctions.push(function);
185 Boolean *CSolver::getBooleanVar(VarType type) {
186 Boolean *boolean = new BooleanVar(type);
187 allBooleans.push(boolean);
191 Boolean *CSolver::getBooleanTrue() {
195 Boolean *CSolver::getBooleanFalse() {
199 Boolean *CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
200 return applyPredicateTable(predicate, inputs, numInputs, NULL);
203 Boolean *CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, Boolean *undefinedStatus) {
204 BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
205 Boolean * b = boolMap.get(boolean);
207 boolMap.put(boolean, boolean);
208 allBooleans.push(boolean);
216 Boolean *CSolver::applyLogicalOperation(LogicOp op, Boolean **array, uint asize) {
217 Boolean * newarray[asize];
220 if (array[0]->type == LOGICOP && ((BooleanLogic *)array[0])->op==SATC_NOT) {
221 return ((BooleanLogic *) array[0])->inputs.get(0);
222 } else if (array[0]->type == BOOLCONST) {
223 bool isTrue = ((BooleanConst *) array[0])->isTrue;
224 return isTrue ? boolFalse : boolTrue;
229 for(uint i=0;i<2;i++) {
230 if (array[i]->type == BOOLCONST) {
231 bool isTrue = ((BooleanConst *) array[i])->isTrue;
233 newarray[0]=array[1-i];
234 return applyLogicalOperation(SATC_NOT, newarray, 1);
243 for(uint i=0;i<asize;i++) {
245 if (b->type == BOOLCONST) {
246 bool isTrue = ((BooleanConst *) b)->isTrue;
252 newarray[newindex++]=b;
256 else if (newindex == 2) {
257 bool isNot0 = (newarray[0]->type==BOOLCONST) && ((BooleanLogic *)newarray[0])->op == SATC_NOT;
258 bool isNot1 = (newarray[1]->type==BOOLCONST) && ((BooleanLogic *)newarray[1])->op == SATC_NOT;
260 if (isNot0 != isNot1) {
262 newarray[0] = ((BooleanLogic *) newarray[0])->inputs.get(0);
264 Boolean *tmp = ((BooleanLogic *) array[1])->inputs.get(0);
268 return applyLogicalOperation(SATC_IMPLIES, newarray, 2);
278 for(uint i=0;i<asize;i++) {
280 if (b->type == BOOLCONST) {
281 bool isTrue = ((BooleanConst *) b)->isTrue;
287 newarray[newindex++]=b;
298 if (array[0]->type == BOOLCONST) {
299 BooleanConst *b=(BooleanConst *) array[0];
305 } else if (array[1]->type == BOOLCONST) {
306 BooleanConst *b=(BooleanConst *) array[0];
310 return applyLogicalOperation(SATC_NOT, array, 1);
317 Boolean *boolean = new BooleanLogic(this, op, array, asize);
318 Boolean *b = boolMap.get(boolean);
320 boolMap.put(boolean, boolean);
321 allBooleans.push(boolean);
329 Boolean *CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
330 Boolean *constraint = new BooleanOrder(order, first, second);
331 allBooleans.push(constraint);
335 void CSolver::addConstraint(Boolean *constraint) {
336 if (constraint == boolTrue)
338 else if (constraint == boolFalse)
341 constraints.add(constraint);
344 Order *CSolver::createOrder(OrderType type, Set *set) {
345 Order *order = new Order(type, set);
346 allOrders.push(order);
350 int CSolver::startEncoding() {
351 bool deleteTuner = false;
353 tuner = new DefaultTuner();
357 long long startTime = getTimeNano();
358 computePolarities(this);
360 naiveEncodingDecision(this);
361 satEncoder->encodeAllSATEncoder(this);
362 int result = unsat ? IS_UNSAT : satEncoder->solve();
363 long long finishTime = getTimeNano();
364 elapsedTime = finishTime - startTime;
372 uint64_t CSolver::getElementValue(Element *element) {
373 switch (element->type) {
377 return getElementValueSATTranslator(this, element);
384 bool CSolver::getBooleanValue(Boolean *boolean) {
385 switch (boolean->type) {
387 return getBooleanVariableValueSATTranslator(this, boolean);
394 HappenedBefore CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
395 return getOrderConstraintValueSATTranslator(this, order, first, second);
398 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
400 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
402 void CSolver::autoTune(uint budget) {
403 AutoTuner * autotuner=new AutoTuner(budget);
404 autotuner->addProblem(this);