X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=src%2Fcsolver.h;h=6996e4229c9376f78b5d4258ee7d2669f334b858;hb=3a614d0deec343d2474efaabaa7220e7bcbed0d0;hp=c6044864313280cb71e21a01528d73d0d87b0a36;hpb=c93f23abbac2fb61c7e6663df292161038620fdb;p=satune.git diff --git a/src/csolver.h b/src/csolver.h index c604486..6996e42 100644 --- a/src/csolver.h +++ b/src/csolver.h @@ -58,7 +58,7 @@ public: Set *getElementRange (Element *element); void mustHaveValue(Element *element); - + BooleanEdge getBooleanTrue(); BooleanEdge getBooleanFalse(); @@ -101,8 +101,11 @@ public: BooleanEdge applyPredicate(Predicate *predicate, Element **inputs, uint numInputs); + /** This exactly one element of array can be true! (i.e. a1 + a2 + a3 + ... + an = 1)*/ + BooleanEdge applyExactlyOneConstraint (BooleanEdge *array, uint asize); + /** This function applies a logical operation to the Booleans in its input. */ - + BooleanEdge applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize); /** This function applies a logical operation to the Booleans in its input. */ @@ -126,10 +129,19 @@ public: /** When everything is done, the client calls this function and then csolver starts to encode*/ int solve(); - + /** + * Incremental Solving for SATUNE. + * It only supports incremental solving for elements! + * No support for BooleanVar, BooleanOrder or using interpreters + * @return + */ + int solveIncremental(); + /** After getting the solution from the SAT solver, client can get the value of an element via this function*/ uint64_t getElementValue(Element *element); + void freezeElement(Element *e); + /** After getting the solution from the SAT solver, client can get the value of a boolean via this function*/ bool getBooleanValue(BooleanEdge boolean); @@ -141,7 +153,7 @@ public: void setUnSAT() { model_print("Setting UNSAT %%%%%%\n"); unsat = true; } void setSatSolverTimeout(long seconds) { satsolverTimeout = seconds;} bool isUnSAT() { return unsat; } - bool isBooleanVarUsed(){return booleanVarUsed;} + bool isBooleanVarUsed() {return booleanVarUsed;} void printConstraint(BooleanEdge boolean); void printConstraints(); @@ -151,7 +163,9 @@ public: Tuner *getTuner() { return tuner; } SetIteratorBooleanEdge *getConstraints() { return constraints.iterator(); } - + bool isConstraintEncoded(BooleanEdge be) { return encodedConstraints.contains(be);} + void addEncodedConstraint(BooleanEdge be) {encodedConstraints.add(be);} + SATEncoder *getSATEncoder() {return satEncoder;} void replaceBooleanWithTrue(BooleanEdge bexpr); @@ -161,30 +175,33 @@ public: void replaceBooleanWithBoolean(BooleanEdge oldb, BooleanEdge newb); CSolver *clone(); void serialize(); - static CSolver *deserialize(const char *file); + static CSolver *deserialize(const char *file, InterpreterType itype = SATUNE); void autoTune(uint budget); void inferFixedOrders(); void inferFixedOrder(Order *order); - - + void setInterpreter(InterpreterType type); + bool useInterpreter() {return interpreter != NULL;} void setTuner(Tuner *_tuner) { tuner = _tuner; } long long getElapsedTime() { return elapsedTime; } long long getEncodeTime(); long long getSolveTime(); - + long getSatSolverTimeout() { return satsolverTimeout;} + bool isIncrementalMode() {return incrementalMode;} + void freezeElementsVariables(); CMEMALLOC; private: void handleIFFTrue(BooleanLogic *bexpr, BooleanEdge child); void handleANDTrue(BooleanLogic *bexpr, BooleanEdge child); void handleFunction(ElementFunction *ef, BooleanEdge child); - + //These two functions are helpers if the client has a pointer to a //Boolean object that we have since replaced BooleanEdge rewriteLogicalOperation(LogicOp op, BooleanEdge *array, uint asize); BooleanEdge doRewrite(BooleanEdge b); /** This is a vector of constraints that must be satisfied. */ HashsetBooleanEdge constraints; + HashsetBooleanEdge encodedConstraints; /** This is a vector of all boolean structs that we have allocated. */ Vector allBooleans; @@ -218,10 +235,12 @@ private: SATEncoder *satEncoder; bool unsat; - bool booleanVarUsed; - Tuner *tuner; + bool booleanVarUsed; + bool incrementalMode; + Tuner *tuner; long long elapsedTime; long satsolverTimeout; + Interpreter *interpreter; friend class ElementOpt; friend class VarOrderingOpt; };