#include "sattranslator.h"
#include "tunable.h"
#include "polarityassignment.h"
-#include "orderdecompose.h"
+#include "analyzer.h"
#include "autotuner.h"
CSolver::CSolver() :
Element *CSolver::getElementConst(VarType type, uint64_t value) {
uint64_t array[] = {value};
Set *set = new Set(type, array, 1);
- allSets.push(set);
Element *element = new ElementConst(value, type, set);
- allElements.push(element);
- return element;
+ Element *e = elemMap.get(element);
+ if (e == NULL) {
+ allSets.push(set);
+ allElements.push(element);
+ elemMap.put(element, element);
+ return element;
+ } else {
+ delete set;
+ delete element;
+ return e;
+ }
}
-Boolean *CSolver::getBooleanVar(VarType type) {
- Boolean *boolean = new BooleanVar(type);
- allBooleans.push(boolean);
- return boolean;
+Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, Boolean *overflowstatus) {
+ Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
+ Element *e = elemMap.get(element);
+ if (e == NULL) {
+ allElements.push(element);
+ elemMap.put(element, element);
+ return element;
+ } else {
+ delete element;
+ return e;
+ }
}
Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
return function;
}
-Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, Boolean *overflowstatus) {
- Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
- allElements.push(element);
- return element;
+Boolean *CSolver::getBooleanVar(VarType type) {
+ Boolean *boolean = new BooleanVar(type);
+ allBooleans.push(boolean);
+ return boolean;
}
Boolean *CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
Boolean *CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, Boolean *undefinedStatus) {
BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
- allBooleans.push(boolean);
- return boolean;
+ Boolean * b = boolMap.get(boolean);
+ if (b == NULL) {
+ boolMap.put(boolean, boolean);
+ allBooleans.push(boolean);
+ return boolean;
+ } else {
+ delete boolean;
+ return b;
+ }
}
Boolean *CSolver::applyLogicalOperation(LogicOp op, Boolean **array, uint asize) {
Boolean *boolean = new BooleanLogic(this, op, array, asize);
- allBooleans.push(boolean);
- return boolean;
+ Boolean *b = boolMap.get(boolean);
+ if (b == NULL) {
+ boolMap.put(boolean, boolean);
+ allBooleans.push(boolean);
+ return boolean;
+ } else {
+ delete boolean;
+ return b;
+ }
+}
+
+Boolean *CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
+ Boolean *constraint = new BooleanOrder(order, first, second);
+ allBooleans.push(constraint);
+ return constraint;
}
void CSolver::addConstraint(Boolean *constraint) {
return order;
}
-Boolean *CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
- Boolean *constraint = new BooleanOrder(order, first, second);
- allBooleans.push(constraint);
- return constraint;
-}
-
int CSolver::startEncoding() {
bool deleteTuner = false;
if (tuner == NULL) {
orderAnalysis(this);
naiveEncodingDecision(this);
satEncoder->encodeAllSATEncoder(this);
- int result = satEncoder->solve();
+ int result = unsat ? IS_UNSAT : satEncoder->solve();
long long finishTime = getTimeNano();
elapsedTime = finishTime - startTime;
if (deleteTuner) {
}
uint64_t CSolver::getElementValue(Element *element) {
- switch (GETELEMENTTYPE(element)) {
+ switch (element->type) {
case ELEMSET:
case ELEMCONST:
case ELEMFUNCRETURN:
}
bool CSolver::getBooleanValue(Boolean *boolean) {
- switch (GETBOOLEANTYPE(boolean)) {
+ switch (boolean->type) {
case BOOLEANVAR:
return getBooleanVariableValueSATTranslator(this, boolean);
default: