X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=src%2Fcsolver.h;h=23c35e059811ba3dee0aaabe6907def5478f7107;hb=4c58af641a877bb6d65769994c8fd57ecedbd22c;hp=0093586600778d9c34bc4615884df69a45f3f25d;hpb=d4e365ab7ea6d97d8ad65c1f230871254ce36737;p=satune.git diff --git a/src/csolver.h b/src/csolver.h index 0093586..d7ccdb5 100644 --- a/src/csolver.h +++ b/src/csolver.h @@ -1,93 +1,262 @@ #ifndef CSOLVER_H #define CSOLVER_H -#include "classlist.h" +#include "classes.h" #include "ops.h" -#include "structs.h" - -struct CSolver { - VectorBoolean * constraints; - VectorBoolean * allBooleans; - VectorSet * allSets; - VectorElement * allElements; - VectorPredicate * allPredicates; - VectorTable * allTables; -}; +#include "corestructs.h" +#include "asthash.h" +#include "solver_interface.h" +#include "common.h" + +class CSolver { +public: + CSolver(); + ~CSolver(); + void resetSolver(); + /** This function creates a set containing the elements passed in the array. */ + Set *createSet(VarType type, uint64_t *elements, uint num); + + /** 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); + + 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! + */ + + MutableSet *createMutableSet(VarType type); + + /** This function adds a new item to a set. */ + + //Deprecating this unless we need it... + void addItem(MutableSet *set, uint64_t element); + + /** This function adds a new unique item to the set and returns it. + This function cannot be used in conjunction with manually adding + items to the set. */ + + uint64_t createUniqueItem(MutableSet *set); + + /** + * Freeze and finalize the mutableSet ... + */ + void finalizeMutableSet(MutableSet *set); + + /** This function creates an element variable over a set. */ + + Element *getElementVar(Set *set); + + /** This function creates an element constrant. */ + Element *getElementConst(VarType type, uint64_t value); + + Set *getElementRange (Element *element); + + void mustHaveValue(Element *element); + + BooleanEdge getBooleanTrue(); -/** Create a new solver instance. */ + BooleanEdge getBooleanFalse(); -CSolver * allocCSolver(); + /** This function creates a boolean variable. */ -/** This function creates a set containing the elements passed in the array. */ + BooleanEdge getBooleanVar(VarType type); -Set * createSet(CSolver *, VarType type, uint64_t * elements, uint num); + /** This function creates a function operator. */ -/** This function creates a set from lowrange to highrange (inclusive). */ + Function *createFunctionOperator(ArithOp op, Set *range, + OverFlowBehavior overflowbehavior); -Set * createRangeSet(CSolver *, VarType type, uint64_t lowrange, uint64_t highrange); + /** This function creates a predicate operator. */ -/** This function creates a mutable set. */ + Predicate *createPredicateOperator(CompOp op); -MutableSet * createMutableSet(CSolver *, VarType type); + Predicate *createPredicateTable(Table *table, UndefinedBehavior behavior); -/** This function adds a new item to a set. */ + /** This function creates an empty instance table.*/ -void addItem(CSolver *, MutableSet * set, uint64_t element); + Table *createTable(Set *range); -/** This function adds a new unique item to the set and returns it. - This function cannot be used in conjunction with manually adding - items to the set. */ + Table *createTableForPredicate(); + /** This function adds an input output relation to a table. */ -uint64_t createUniqueItem(CSolver *, MutableSet * set); + void addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result); -/** This function creates an element variable over a set. */ + /** This function converts a completed table into a function. */ -Element * getElementVar(CSolver *, Set * set); + Function *completeTable(Table *, UndefinedBehavior behavior); -/** This function creates a boolean variable. */ + /** This function applies a function to the Elements in its input. */ -Boolean * getBooleanVar(CSolver *, VarType type); + Element *applyFunction(Function *function, Element **array, uint numArrays, BooleanEdge overflowstatus); -/** This function creates a function operator. */ + /** This function applies a predicate to the Elements in its input. */ -Function * createFunctionOperator(CSolver *solver, enum ArithOp op, Set ** domain, uint numDomain, Set * range, - enum OverFlowBehavior overflowbehavior, Boolean * overflowstatus); + BooleanEdge applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, BooleanEdge undefinedStatus); -/** This function creates a predicate operator. */ + BooleanEdge applyPredicate(Predicate *predicate, Element **inputs, uint numInputs); -Predicate * createPredicateOperator(CSolver *solver, enum CompOp op, Set ** domain, uint numDomain); + /** This function applies a logical operation to the Booleans in its input. */ -/** This function creates an empty instance table.*/ + BooleanEdge applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize); -Table * createTable(CSolver *solver, Set **domains, uint numDomain, Set * range); + /** This function applies a logical operation to the Booleans in its input. */ -/** This function adds an input output relation to a table. */ + BooleanEdge applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2); -void addTableEntry(CSolver *solver, Table* table, uint64_t* inputs, uint inputSize, uint64_t result); + /** This function applies a logical operation to the Booleans in its input. */ -/** This function converts a completed table into a function. */ + BooleanEdge applyLogicalOperation(LogicOp op, BooleanEdge arg); -Function * completeTable(CSolver *, Table *); + /** This function adds a boolean constraint to the set of constraints + to be satisfied */ -/** This function applies a function to the Elements in its input. */ + void addConstraint(BooleanEdge constraint); -Element * applyFunction(CSolver *, Function * function, Element ** array); + /** This function instantiates an order of type type over the set set. */ + Order *createOrder(OrderType type, Set *set); -/** This function applies a predicate to the Elements in its input. */ + /** This function instantiates a boolean on two items in an order. */ + BooleanEdge orderConstraint(Order *order, uint64_t first, uint64_t second); -Boolean * applyPredicate(CSolver *, Predicate * predicate, Element ** inputs); + /** When everything is done, the client calls this function and then csolver starts to encode*/ + int solve(); -/** This function applies a logical operation to the Booleans in its input. */ + /** After getting the solution from the SAT solver, client can get the value of an element via this function*/ + uint64_t getElementValue(Element *element); -Boolean * applyLogicalOperation(CSolver *, enum LogicOp op, Boolean ** array); + /** After getting the solution from the SAT solver, client can get the value of a boolean via this function*/ + bool getBooleanValue(BooleanEdge boolean); -/** This function adds a boolean constraint to the set of constraints - to be satisfied */ + bool getOrderConstraintValue(Order *order, uint64_t first, uint64_t second); -void addBoolean(CSolver *, Boolean * constraint); + bool isTrue(BooleanEdge b); + bool isFalse(BooleanEdge b); -/** This function instantiates an order of type type over the set set. */ -Order * createOrder(CSolver *, enum OrderType type, Set * set); + void setUnSAT() { model_print("Setting UNSAT %%%%%%\n"); unsat = true; } + void setSatSolverTimeout(long seconds) { satsolverTimeout = seconds;} + bool isUnSAT() { return unsat; } + bool isBooleanVarUsed(){return booleanVarUsed;} + void printConstraint(BooleanEdge boolean); + void printConstraints(); + + Vector *getOrders() { return &allOrders;} + HashsetOrder *getActiveOrders() { return &activeOrders;} + + Tuner *getTuner() { return tuner; } + + SetIteratorBooleanEdge *getConstraints() { return constraints.iterator(); } + + SATEncoder *getSATEncoder() {return satEncoder;} + + void replaceBooleanWithTrue(BooleanEdge bexpr); + void replaceBooleanWithTrueNoRemove(BooleanEdge bexpr); + void replaceBooleanWithFalseNoRemove(BooleanEdge bexpr); + void replaceBooleanWithFalse(BooleanEdge bexpr); + void replaceBooleanWithBoolean(BooleanEdge oldb, BooleanEdge newb); + CSolver *clone(); + void serialize(); + 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;} + + 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; + + /** This is a vector of all boolean structs that we have allocated. */ + Vector allBooleans; + + /** This is a vector of all set structs that we have allocated. */ + Vector allSets; + + /** This is a vector of all element structs that we have allocated. */ + Vector allElements; + + /** This is a vector of all predicate structs that we have allocated. */ + Vector allPredicates; + + /** This is a vector of all table structs that we have allocated. */ + Vector allTables; + + /** This is a vector of all order structs that we have allocated. */ + Vector allOrders; + + HashsetOrder activeOrders; + + /** This is a vector of all function structs that we have allocated. */ + Vector allFunctions; + + BooleanEdge boolTrue; + BooleanEdge boolFalse; + + /** These two tables are used for deduplicating entries. */ + BooleanMatchMap boolMap; + ElementMatchMap elemMap; + + SATEncoder *satEncoder; + bool unsat; + bool booleanVarUsed; + Tuner *tuner; + long long elapsedTime; + long satsolverTimeout; + Interpreter *interpreter; + friend class ElementOpt; + friend class VarOrderingOpt; +}; -/** This function instantiates a boolean on two items in an order. */ -Boolean * orderConstraint(CSolver *, Order * order, uint64_t first, uint64_t second); +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