3 #include "mutableset.h"
10 #include "satencoder.h"
11 #include "sattranslator.h"
13 #include "polarityassignment.h"
14 #include "orderdecompose.h"
15 #include "autotuner.h"
22 satEncoder = new SATEncoder(this);
25 /** This function tears down the solver and the entire AST */
28 uint size = allBooleans.getSize();
29 for (uint i = 0; i < size; i++) {
30 delete allBooleans.get(i);
33 size = allSets.getSize();
34 for (uint i = 0; i < size; i++) {
35 delete allSets.get(i);
38 size = allElements.getSize();
39 for (uint i = 0; i < size; i++) {
40 delete allElements.get(i);
43 size = allTables.getSize();
44 for (uint i = 0; i < size; i++) {
45 delete allTables.get(i);
48 size = allPredicates.getSize();
49 for (uint i = 0; i < size; i++) {
50 delete allPredicates.get(i);
53 size = allOrders.getSize();
54 for (uint i = 0; i < size; i++) {
55 delete allOrders.get(i);
58 size = allFunctions.getSize();
59 for (uint i = 0; i < size; i++) {
60 delete allFunctions.get(i);
66 CSolver *CSolver::clone() {
67 CSolver *copy = new CSolver();
69 HSIteratorBoolean *it = getConstraints();
70 while (it->hasNext()) {
71 Boolean *b = it->next();
72 copy->addConstraint(b->clone(copy, &map));
78 Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
79 Set *set = new Set(type, elements, numelements);
84 Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange) {
85 Set *set = new Set(type, lowrange, highrange);
90 MutableSet *CSolver::createMutableSet(VarType type) {
91 MutableSet *set = new MutableSet(type);
96 void CSolver::addItem(MutableSet *set, uint64_t element) {
97 set->addElementMSet(element);
100 uint64_t CSolver::createUniqueItem(MutableSet *set) {
101 uint64_t element = set->low++;
102 set->addElementMSet(element);
106 Element *CSolver::getElementVar(Set *set) {
107 Element *element = new ElementSet(set);
108 allElements.push(element);
112 Element *CSolver::getElementConst(VarType type, uint64_t value) {
113 uint64_t array[] = {value};
114 Set *set = new Set(type, array, 1);
115 Element *element = new ElementConst(value, type, set);
116 Element *e = elemMap.get(element);
119 allElements.push(element);
120 elemMap.put(element, element);
129 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, Boolean *overflowstatus) {
130 Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
131 Element *e = elemMap.get(element);
133 allElements.push(element);
134 elemMap.put(element, element);
142 Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
143 Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior);
144 allFunctions.push(function);
148 Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
149 Predicate *predicate = new PredicateOperator(op, domain,numDomain);
150 allPredicates.push(predicate);
154 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
155 Predicate *predicate = new PredicateTable(table, behavior);
156 allPredicates.push(predicate);
160 Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
161 Table *table = new Table(domains,numDomain,range);
162 allTables.push(table);
166 Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
167 return createTable(domains, numDomain, NULL);
170 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
171 table->addNewTableEntry(inputs, inputSize, result);
174 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
175 Function *function = new FunctionTable(table, behavior);
176 allFunctions.push(function);
180 Boolean *CSolver::getBooleanVar(VarType type) {
181 Boolean *boolean = new BooleanVar(type);
182 allBooleans.push(boolean);
186 Boolean *CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
187 return applyPredicateTable(predicate, inputs, numInputs, NULL);
190 Boolean *CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, Boolean *undefinedStatus) {
191 BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
192 Boolean * b = boolMap.get(boolean);
194 boolMap.put(boolean, boolean);
195 allBooleans.push(boolean);
203 Boolean *CSolver::applyLogicalOperation(LogicOp op, Boolean **array, uint asize) {
204 Boolean *boolean = new BooleanLogic(this, op, array, asize);
205 Boolean *b = boolMap.get(boolean);
207 boolMap.put(boolean, boolean);
208 allBooleans.push(boolean);
216 Boolean *CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
217 Boolean *constraint = new BooleanOrder(order, first, second);
218 allBooleans.push(constraint);
222 void CSolver::addConstraint(Boolean *constraint) {
223 constraints.add(constraint);
226 Order *CSolver::createOrder(OrderType type, Set *set) {
227 Order *order = new Order(type, set);
228 allOrders.push(order);
232 int CSolver::startEncoding() {
233 bool deleteTuner = false;
235 tuner = new DefaultTuner();
239 long long startTime = getTimeNano();
240 computePolarities(this);
242 naiveEncodingDecision(this);
243 satEncoder->encodeAllSATEncoder(this);
244 int result = unsat ? IS_UNSAT : satEncoder->solve();
245 long long finishTime = getTimeNano();
246 elapsedTime = finishTime - startTime;
254 uint64_t CSolver::getElementValue(Element *element) {
255 switch (element->type) {
259 return getElementValueSATTranslator(this, element);
266 bool CSolver::getBooleanValue(Boolean *boolean) {
267 switch (boolean->type) {
269 return getBooleanVariableValueSATTranslator(this, boolean);
276 HappenedBefore CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
277 return getOrderConstraintValueSATTranslator(this, order, first, second);
280 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
282 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
284 void CSolver::autoTune(uint budget) {
285 AutoTuner * autotuner=new AutoTuner(budget);
286 autotuner->addProblem(this);