X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=src%2Fcsolver.h;h=16937ddd63827f67aaa46827dcdc371914dd0de6;hb=f96c6affc7f990067f4d298d9c989f789933c9ce;hp=e254abbc29c8026ddc274166f4b9de23c167c89d;hpb=e80028bf761f04dd410b45d1dadc0b8b5fd5817e;p=satune.git diff --git a/src/csolver.h b/src/csolver.h index e254abb..16937dd 100644 --- a/src/csolver.h +++ b/src/csolver.h @@ -18,17 +18,17 @@ public: /** This function creates a set from lowrange to highrange (inclusive). */ Set *createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange); - - bool itemExistInSet(Set *set, uint64_t item); + + bool itemExistInSet(Set *set, uint64_t item); VarType getSetVarType(Set *set); Element *createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange); /** This function creates a mutable set. - * Note: You should use addItem for adding new item to Mutable sets, and - * at the end, you should call finalizeMutableSet! - */ + * Note: You should use addItem for adding new item to Mutable sets, and + * at the end, you should call finalizeMutableSet! + */ MutableSet *createMutableSet(VarType type); @@ -57,6 +57,8 @@ public: Set *getElementRange (Element *element); + void mustHaveValue(Element *element); + BooleanEdge getBooleanTrue(); BooleanEdge getBooleanFalse(); @@ -67,20 +69,20 @@ public: /** This function creates a function operator. */ - Function *createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range, + Function *createFunctionOperator(ArithOp op, Set *range, OverFlowBehavior overflowbehavior); /** This function creates a predicate operator. */ - Predicate *createPredicateOperator(CompOp op, Set **domain, uint numDomain); + Predicate *createPredicateOperator(CompOp op); Predicate *createPredicateTable(Table *table, UndefinedBehavior behavior); /** This function creates an empty instance table.*/ - Table *createTable(Set **domains, uint numDomain, Set *range); + Table *createTable(Set *range); - Table *createTableForPredicate(Set **domains, uint numDomain); + Table *createTableForPredicate(); /** This function adds an input output relation to a table. */ void addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result); @@ -137,6 +139,7 @@ public: bool isFalse(BooleanEdge b); void setUnSAT() { model_print("Setting UNSAT %%%%%%\n"); unsat = true; } + void setSatSolverTimeout(long seconds) { satsolverTimeout = seconds;} bool isUnSAT() { return unsat; } void printConstraint(BooleanEdge boolean); @@ -174,6 +177,7 @@ public: 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 @@ -216,5 +220,40 @@ private: bool unsat; Tuner *tuner; long long elapsedTime; + long satsolverTimeout; + friend class ElementOpt; + friend class VarOrderingOpt; }; + +inline CompOp flipOp(CompOp op) { + switch (op) { + case SATC_EQUALS: + return SATC_EQUALS; + case SATC_LT: + return SATC_GT; + case SATC_GT: + return SATC_LT; + case SATC_LTE: + return SATC_GTE; + case SATC_GTE: + return SATC_LTE; + } + ASSERT(0); +} + +inline CompOp negateOp(CompOp op) { + switch (op) { + case SATC_EQUALS: + ASSERT(0); + case SATC_LT: + return SATC_GTE; + case SATC_GT: + return SATC_LTE; + case SATC_LTE: + return SATC_GT; + case SATC_GTE: + return SATC_LT; + } + ASSERT(0); +} #endif