X-Git-Url: http://plrg.eecs.uci.edu/git/?p=satune.git;a=blobdiff_plain;f=src%2Fcsolver.cc;h=b42dbe0974224df3560d5f95b96aed1e5fce56f2;hp=ce749b13c27b20d1645383f86e27f5101e3a6234;hb=2035b78e3840ec3abb0f5a6db2f87978ada4107c;hpb=abe0dee853780f8254436b0de7c8330d326d4017 diff --git a/src/csolver.cc b/src/csolver.cc index ce749b1..b42dbe0 100644 --- a/src/csolver.cc +++ b/src/csolver.cc @@ -21,6 +21,13 @@ #include "preprocess.h" #include "serializer.h" #include "deserializer.h" +#include "encodinggraph.h" +#include "ordergraph.h" +#include "orderedge.h" +#include "orderanalysis.h" +#include "elementopt.h" +#include +#include CSolver::CSolver() : boolTrue(BooleanEdge(new BooleanConst(true))), @@ -35,6 +42,7 @@ CSolver::CSolver() : /** This function tears down the solver and the entire AST */ CSolver::~CSolver() { + //serialize(); uint size = allBooleans.getSize(); for (uint i = 0; i < size; i++) { delete allBooleans.get(i); @@ -47,7 +55,8 @@ CSolver::~CSolver() { size = allElements.getSize(); for (uint i = 0; i < size; i++) { - delete allElements.get(i); + Element *el = allElements.get(i); + delete el; } size = allTables.getSize(); @@ -64,7 +73,6 @@ CSolver::~CSolver() { for (uint i = 0; i < size; i++) { delete allOrders.get(i); } - size = allFunctions.getSize(); for (uint i = 0; i < size; i++) { delete allFunctions.get(i); @@ -74,6 +82,64 @@ CSolver::~CSolver() { delete satEncoder; } +void CSolver::resetSolver() { + //serialize(); + uint size = allBooleans.getSize(); + for (uint i = 0; i < size; i++) { + delete allBooleans.get(i); + } + + size = allSets.getSize(); + for (uint i = 0; i < size; i++) { + delete allSets.get(i); + } + + size = allElements.getSize(); + for (uint i = 0; i < size; i++) { + Element *el = allElements.get(i); + delete el; + } + + size = allTables.getSize(); + for (uint i = 0; i < size; i++) { + delete allTables.get(i); + } + + size = allPredicates.getSize(); + for (uint i = 0; i < size; i++) { + delete allPredicates.get(i); + } + + size = allOrders.getSize(); + for (uint i = 0; i < size; i++) { + delete allOrders.get(i); + } + size = allFunctions.getSize(); + for (uint i = 0; i < size; i++) { + delete allFunctions.get(i); + } + delete boolTrue.getBoolean(); + allBooleans.clear(); + allSets.clear(); + allElements.clear(); + allTables.clear(); + allPredicates.clear(); + allOrders.clear(); + allFunctions.clear(); + constraints.reset(); + activeOrders.reset(); + boolMap.reset(); + elemMap.reset(); + + boolTrue = BooleanEdge(new BooleanConst(true)); + boolFalse = boolTrue.negate(); + unsat = false; + elapsedTime = 0; + tuner = NULL; + satEncoder->resetSATEncoder(); + +} + CSolver *CSolver::clone() { CSolver *copy = new CSolver(); CloneMap map; @@ -86,23 +152,24 @@ CSolver *CSolver::clone() { return copy; } +CSolver *CSolver::deserialize(const char *file) { + model_print("deserializing ...\n"); + Deserializer deserializer(file); + return deserializer.deserialize(); +} + void CSolver::serialize() { model_print("serializing ...\n"); - { - Serializer serializer("dump"); - SetIteratorBooleanEdge *it = getConstraints(); - while (it->hasNext()) { - BooleanEdge b = it->next(); - serializeBooleanEdge(&serializer, b); - } - delete it; - } - model_print("deserializing ...\n"); - { - Deserializer deserializer("dump"); - deserializer.deserialize(); + char buffer[255]; + long long nanotime = getTimeNano(); + int numchars = sprintf(buffer, "DUMP%llu", nanotime); + Serializer serializer(buffer); + SetIteratorBooleanEdge *it = getConstraints(); + while (it->hasNext()) { + BooleanEdge b = it->next(); + serializeBooleanEdge(&serializer, b, true); } - + delete it; } Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) { @@ -117,6 +184,14 @@ Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange return set; } +bool CSolver::itemExistInSet(Set *set, uint64_t item){ + return set->exists(item); +} + +VarType CSolver::getSetVarType(Set *set) { + return set->getType(); +} + Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) { Set *s = createRangeSet(type, lowrange, highrange); return getElementVar(s); @@ -138,12 +213,25 @@ uint64_t CSolver::createUniqueItem(MutableSet *set) { return element; } +void CSolver::finalizeMutableSet(MutableSet *set) { + set->finalize(); +} + Element *CSolver::getElementVar(Set *set) { Element *element = new ElementSet(set); allElements.push(element); return element; } +void CSolver::mustHaveValue(Element *element){ + element->getElementEncoding()->anyValue = true; +} + +Set *CSolver::getElementRange (Element *element) { + return element->getRange(); +} + + Element *CSolver::getElementConst(VarType type, uint64_t value) { uint64_t array[] = {value}; Set *set = new Set(type, array, 1); @@ -161,6 +249,7 @@ Element *CSolver::getElementConst(VarType type, uint64_t value) { } } + Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, BooleanEdge overflowstatus) { Element *element = new ElementFunction(function,array,numArrays,overflowstatus); Element *e = elemMap.get(element); @@ -175,14 +264,14 @@ Element *CSolver::applyFunction(Function *function, Element **array, uint numArr } } -Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) { - Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior); +Function *CSolver::createFunctionOperator(ArithOp op, Set *range, OverFlowBehavior overflowbehavior) { + Function *function = new FunctionOperator(op, range, overflowbehavior); allFunctions.push(function); return function; } -Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) { - Predicate *predicate = new PredicateOperator(op, domain,numDomain); +Predicate *CSolver::createPredicateOperator(CompOp op) { + Predicate *predicate = new PredicateOperator(op); allPredicates.push(predicate); return predicate; } @@ -193,14 +282,14 @@ Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavio return predicate; } -Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) { - Table *table = new Table(domains,numDomain,range); +Table *CSolver::createTable(Set *range) { + Table *table = new Table(range); allTables.push(table); return table; } -Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) { - return createTable(domains, numDomain, NULL); +Table *CSolver::createTableForPredicate() { + return createTable(NULL); } void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) { @@ -228,7 +317,7 @@ BooleanEdge CSolver::getBooleanFalse() { } BooleanEdge CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) { - return applyPredicateTable(predicate, inputs, numInputs, NULL); + return applyPredicateTable(predicate, inputs, numInputs, BooleanEdge(NULL)); } BooleanEdge CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, BooleanEdge undefinedStatus) { @@ -246,11 +335,11 @@ BooleanEdge CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, } bool CSolver::isTrue(BooleanEdge b) { - return b.isNegated()?b->isFalse():b->isTrue(); + return b.isNegated() ? b->isFalse() : b->isTrue(); } bool CSolver::isFalse(BooleanEdge b) { - return b.isNegated()?b->isTrue():b->isFalse(); + return b.isNegated() ? b->isTrue() : b->isFalse(); } BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2) { @@ -263,9 +352,11 @@ BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg) { return applyLogicalOperation(op, array, 1); } -static int ptrcompares(const void *p1, const void *p2) { - uintptr_t b1 = *(uintptr_t const *) p1; - uintptr_t b2 = *(uintptr_t const *) p2; +static int booleanEdgeCompares(const void *p1, const void *p2) { + BooleanEdge be1 = *(BooleanEdge const *) p1; + BooleanEdge be2 = *(BooleanEdge const *) p2; + uint64_t b1 = be1->id; + uint64_t b2 = be2->id; if (b1 < b2) return -1; else if (b1 == b2) @@ -274,11 +365,11 @@ static int ptrcompares(const void *p1, const void *p2) { return 1; } -BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge * array, uint asize) { +BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) { BooleanEdge newarray[asize]; memcpy(newarray, array, asize * sizeof(BooleanEdge)); - for(uint i=0; i < asize; i++) { - BooleanEdge b=newarray[i]; + for (uint i = 0; i < asize; i++) { + BooleanEdge b = newarray[i]; if (b->type == LOGICOP) { if (((BooleanLogic *) b.getBoolean())->replaced) { newarray[i] = doRewrite(newarray[i]); @@ -297,15 +388,13 @@ BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint } case SATC_IFF: { for (uint i = 0; i < 2; i++) { - if (array[i]->type == BOOLCONST) { - if (array[i]->isTrue()) { - return array[1 - i]; - } else { - newarray[0] = array[1 - i]; - return applyLogicalOperation(SATC_NOT, newarray, 1); - } + if (isTrue(array[i])) { // It can be undefined + return array[1 - i]; + } else if (isFalse(array[i])) { + newarray[0] = array[1 - i]; + return applyLogicalOperation(SATC_NOT, newarray, 1); } else if (array[i]->type == LOGICOP) { - BooleanLogic *b =(BooleanLogic *)array[i].getBoolean(); + BooleanLogic *b = (BooleanLogic *)array[i].getBoolean(); if (b->replaced) { return rewriteLogicalOperation(op, array, asize); } @@ -314,7 +403,7 @@ BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint break; } case SATC_OR: { - for (uint i =0; i replaced) return rewriteLogicalOperation(op, array, asize); } - if (b->type == BOOLCONST) { - if (b->isTrue()) - continue; - else - return boolFalse; + if (isTrue(b)) + continue; + else if (isFalse(b)) { + return boolFalse; } else newarray[newindex++] = b; } @@ -340,7 +428,7 @@ BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint } else if (newindex == 1) { return newarray[0]; } else { - bsdqsort(newarray, newindex, sizeof(BooleanEdge), ptrcompares); + bsdqsort(newarray, newindex, sizeof(BooleanEdge), booleanEdgeCompares); array = newarray; asize = newindex; } @@ -371,22 +459,68 @@ BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint } BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) { + // ASSERT(first != second); + if (first == second) + return getBooleanFalse(); + + bool negate = false; + if (order->type == SATC_TOTAL) { + if (first > second) { + uint64_t tmp = first; + first = second; + second = tmp; + negate = true; + } + } Boolean *constraint = new BooleanOrder(order, first, second); - allBooleans.push(constraint); - return BooleanEdge(constraint); + Boolean *b = boolMap.get(constraint); + + if (b == NULL) { + allBooleans.push(constraint); + boolMap.put(constraint, constraint); + constraint->updateParents(); + if (order->graph != NULL) { + OrderGraph *graph = order->graph; + OrderNode *from = graph->lookupOrderNodeFromOrderGraph(first); + if (from != NULL) { + OrderNode *to = graph->lookupOrderNodeFromOrderGraph(second); + if (to != NULL) { + OrderEdge *edge = graph->lookupOrderEdgeFromOrderGraph(from, to); + OrderEdge *invedge; + + if (edge != NULL && edge->mustPos) { + replaceBooleanWithTrueNoRemove(constraint); + } else if (edge != NULL && edge->mustNeg) { + replaceBooleanWithFalseNoRemove(constraint); + } else if ((invedge = graph->lookupOrderEdgeFromOrderGraph(to, from)) != NULL + && invedge->mustPos) { + replaceBooleanWithFalseNoRemove(constraint); + } + } + } + } + } else { + delete constraint; + constraint = b; + } + + BooleanEdge be = BooleanEdge(constraint); + return negate ? be.negate() : be; } void CSolver::addConstraint(BooleanEdge constraint) { if (isTrue(constraint)) return; - else if (isFalse(constraint)) + else if (isFalse(constraint)) { + int t = 0; setUnSAT(); + } else { if (constraint->type == LOGICOP) { - BooleanLogic *b=(BooleanLogic *) constraint.getBoolean(); + BooleanLogic *b = (BooleanLogic *) constraint.getBoolean(); if (!constraint.isNegated()) { - if (b->op==SATC_AND) { - for(uint i=0;iinputs.getSize();i++) { + if (b->op == SATC_AND) { + for (uint i = 0; i < b->inputs.getSize(); i++) { addConstraint(b->inputs.get(i)); } return; @@ -398,11 +532,12 @@ void CSolver::addConstraint(BooleanEdge constraint) { } } constraints.add(constraint); - Boolean *ptr=constraint.getBoolean(); - - if (ptr->boolVal == BV_UNSAT) + Boolean *ptr = constraint.getBoolean(); + + if (ptr->boolVal == BV_UNSAT) { setUnSAT(); - + } + replaceBooleanWithTrueNoRemove(constraint); constraint->parents.clear(); } @@ -415,30 +550,84 @@ Order *CSolver::createOrder(OrderType type, Set *set) { return order; } +/** Computes static ordering information to allow isTrue/isFalse + queries on newly created orders to work. */ + +void CSolver::inferFixedOrder(Order *order) { + if (order->graph != NULL) { + delete order->graph; + } + order->graph = buildMustOrderGraph(order); + reachMustAnalysis(this, order->graph, true); +} + +void CSolver::inferFixedOrders() { + SetIteratorOrder *orderit = activeOrders.iterator(); + while (orderit->hasNext()) { + Order *order = orderit->next(); + inferFixedOrder(order); + } +} + +#define NANOSEC 1000000000.0 int CSolver::solve() { + long long starttime = getTimeNano(); bool deleteTuner = false; if (tuner == NULL) { tuner = new DefaultTuner(); deleteTuner = true; } - long long startTime = getTimeNano(); - computePolarities(this); + { + SetIteratorOrder *orderit = activeOrders.iterator(); + while (orderit->hasNext()) { + Order *order = orderit->next(); + if (order->graph != NULL) { + delete order->graph; + order->graph = NULL; + } + } + delete orderit; + } + computePolarities(this); + long long time2 = getTimeNano(); + model_print("Polarity time: %f\n", (time2 - starttime) / NANOSEC); Preprocess pp(this); pp.doTransform(); - + long long time3 = getTimeNano(); + model_print("Preprocess time: %f\n", (time3 - time2) / NANOSEC); + DecomposeOrderTransform dot(this); dot.doTransform(); + long long time4 = getTimeNano(); + model_print("Decompose Order: %f\n", (time4 - time3) / NANOSEC); IntegerEncodingTransform iet(this); iet.doTransform(); + ElementOpt eop(this); + eop.doTransform(); + + EncodingGraph eg(this); + eg.buildGraph(); + eg.encode(); + naiveEncodingDecision(this); + long long time5 = getTimeNano(); + model_print("Encoding Graph Time: %f\n", (time5 - time4) / NANOSEC); + + long long startTime = getTimeNano(); satEncoder->encodeAllSATEncoder(this); + long long endTime = getTimeNano(); + + elapsedTime = endTime - startTime; + model_print("Elapse Encode time: %f\n", elapsedTime / NANOSEC); + + model_print("Is problem UNSAT after encoding: %d\n", unsat); int result = unsat ? IS_UNSAT : satEncoder->solve(); - long long finishTime = getTimeNano(); - elapsedTime = finishTime - startTime; + model_print("Result Computed in SAT solver: %d\n", result); + if (deleteTuner) { delete tuner; tuner = NULL; @@ -446,6 +635,25 @@ int CSolver::solve() { return result; } +void CSolver::printConstraints() { + SetIteratorBooleanEdge *it = getConstraints(); + while (it->hasNext()) { + BooleanEdge b = it->next(); + if (b.isNegated()) + model_print("!"); + b->print(); + model_print("\n"); + } + delete it; +} + +void CSolver::printConstraint(BooleanEdge b) { + if (b.isNegated()) + model_print("!"); + b->print(); + model_print("\n"); +} + uint64_t CSolver::getElementValue(Element *element) { switch (element->type) { case ELEMSET: @@ -459,7 +667,7 @@ uint64_t CSolver::getElementValue(Element *element) { } bool CSolver::getBooleanValue(BooleanEdge bedge) { - Boolean *boolean=bedge.getBoolean(); + Boolean *boolean = bedge.getBoolean(); switch (boolean->type) { case BOOLEANVAR: return getBooleanVariableValueSATTranslator(this, boolean); @@ -483,3 +691,21 @@ void CSolver::autoTune(uint budget) { autotuner->tune(); delete autotuner; } + +//Set* CSolver::addItemsToRange(Element* element, uint num, ...){ +// va_list args; +// va_start(args, num); +// element->getRange() +// uint setSize = set->getSize(); +// uint newSize = setSize+ num; +// uint64_t members[newSize]; +// for(uint i=0; igetElement(i); +// } +// for( uint i=0; i< num; i++){ +// uint64_t arg = va_arg(args, uint64_t); +// members[setSize+i] = arg; +// } +// va_end(args); +// return createSet(set->getType(), members, newSize); +//}