3 #include "mutableset.h"
10 #include "satencoder.h"
11 #include "sattranslator.h"
13 #include "polarityassignment.h"
14 #include "transformer.h"
15 #include "autotuner.h"
22 satEncoder = new SATEncoder(this);
23 transformer = new Transformer(this);
26 /** This function tears down the solver and the entire AST */
29 uint size = allBooleans.getSize();
30 for (uint i = 0; i < size; i++) {
31 delete allBooleans.get(i);
34 size = allSets.getSize();
35 for (uint i = 0; i < size; i++) {
36 delete allSets.get(i);
39 size = allElements.getSize();
40 for (uint i = 0; i < size; i++) {
41 delete allElements.get(i);
44 size = allTables.getSize();
45 for (uint i = 0; i < size; i++) {
46 delete allTables.get(i);
49 size = allPredicates.getSize();
50 for (uint i = 0; i < size; i++) {
51 delete allPredicates.get(i);
54 size = allOrders.getSize();
55 for (uint i = 0; i < size; i++) {
56 delete allOrders.get(i);
59 size = allFunctions.getSize();
60 for (uint i = 0; i < size; i++) {
61 delete allFunctions.get(i);
68 CSolver *CSolver::clone() {
69 CSolver *copy = new CSolver();
71 HSIteratorBoolean *it = getConstraints();
72 while (it->hasNext()) {
73 Boolean *b = it->next();
74 copy->addConstraint(b->clone(copy, &map));
80 Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
81 Set *set = new Set(type, elements, numelements);
86 Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange) {
87 Set *set = new Set(type, lowrange, highrange);
92 MutableSet *CSolver::createMutableSet(VarType type) {
93 MutableSet *set = new MutableSet(type);
98 void CSolver::addItem(MutableSet *set, uint64_t element) {
99 set->addElementMSet(element);
102 uint64_t CSolver::createUniqueItem(MutableSet *set) {
103 uint64_t element = set->getNewUniqueItem();
104 set->addElementMSet(element);
108 Element *CSolver::getElementVar(Set *set) {
109 Element *element = new ElementSet(set);
110 allElements.push(element);
114 Element *CSolver::getElementConst(VarType type, uint64_t value) {
115 uint64_t array[] = {value};
116 Set *set = new Set(type, array, 1);
117 Element *element = new ElementConst(value, type, set);
118 Element *e = elemMap.get(element);
121 allElements.push(element);
122 elemMap.put(element, element);
131 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, Boolean *overflowstatus) {
132 Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
133 Element *e = elemMap.get(element);
135 allElements.push(element);
136 elemMap.put(element, element);
144 Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
145 Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior);
146 allFunctions.push(function);
150 Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
151 Predicate *predicate = new PredicateOperator(op, domain,numDomain);
152 allPredicates.push(predicate);
156 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
157 Predicate *predicate = new PredicateTable(table, behavior);
158 allPredicates.push(predicate);
162 Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
163 Table *table = new Table(domains,numDomain,range);
164 allTables.push(table);
168 Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
169 return createTable(domains, numDomain, NULL);
172 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
173 table->addNewTableEntry(inputs, inputSize, result);
176 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
177 Function *function = new FunctionTable(table, behavior);
178 allFunctions.push(function);
182 Boolean *CSolver::getBooleanVar(VarType type) {
183 Boolean *boolean = new BooleanVar(type);
184 allBooleans.push(boolean);
188 Boolean *CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
189 return applyPredicateTable(predicate, inputs, numInputs, NULL);
192 Boolean *CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, Boolean *undefinedStatus) {
193 BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
194 Boolean * b = boolMap.get(boolean);
196 boolMap.put(boolean, boolean);
197 allBooleans.push(boolean);
205 Boolean *CSolver::applyLogicalOperation(LogicOp op, Boolean **array, uint asize) {
206 Boolean *boolean = new BooleanLogic(this, op, array, asize);
207 Boolean *b = boolMap.get(boolean);
209 boolMap.put(boolean, boolean);
210 allBooleans.push(boolean);
218 Boolean *CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
219 Boolean *constraint = new BooleanOrder(order, first, second);
220 allBooleans.push(constraint);
224 void CSolver::addConstraint(Boolean *constraint) {
225 constraints.add(constraint);
228 Order *CSolver::createOrder(OrderType type, Set *set) {
229 Order *order = new Order(type, set);
230 allOrders.push(order);
234 int CSolver::startEncoding() {
235 bool deleteTuner = false;
237 tuner = new DefaultTuner();
241 long long startTime = getTimeNano();
242 computePolarities(this);
243 transformer->orderAnalysis();
244 naiveEncodingDecision(this);
245 satEncoder->encodeAllSATEncoder(this);
246 int result = unsat ? IS_UNSAT : satEncoder->solve();
247 long long finishTime = getTimeNano();
248 elapsedTime = finishTime - startTime;
256 uint64_t CSolver::getElementValue(Element *element) {
257 switch (element->type) {
261 return getElementValueSATTranslator(this, element);
268 bool CSolver::getBooleanValue(Boolean *boolean) {
269 switch (boolean->type) {
271 return getBooleanVariableValueSATTranslator(this, boolean);
278 HappenedBefore CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
279 return getOrderConstraintValueSATTranslator(this, order, first, second);
282 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
284 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
286 void CSolver::autoTune(uint budget) {
287 AutoTuner * autotuner=new AutoTuner(budget);
288 autotuner->addProblem(this);