X-Git-Url: http://plrg.eecs.uci.edu/git/?p=satune.git;a=blobdiff_plain;f=src%2Fcsolver.h;h=c916c58499992b73450e294a26531801b8cc6791;hp=1e697948e83518465a9c7412c8cdace3c9b24d99;hb=d106cc1899b1f3d82cc35a60d77b2c87f8355fdd;hpb=25a6a7672de392c9708c227b80123df8a1528b55 diff --git a/src/csolver.h b/src/csolver.h index 1e69794..c916c58 100644 --- a/src/csolver.h +++ b/src/csolver.h @@ -1,130 +1,256 @@ #ifndef CSOLVER_H #define CSOLVER_H -#include "classlist.h" +#include "classes.h" #include "ops.h" -#include "structs.h" +#include "corestructs.h" +#include "asthash.h" +#include "solver_interface.h" +#include "common.h" -struct CSolver { - SATEncoder* satEncoder; - /** This is a vector of constraints that must be satisfied. */ - VectorBoolean * constraints; +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 is a vector of all boolean structs that we have allocated. */ - VectorBoolean * allBooleans; + /** This function creates a set from lowrange to highrange (inclusive). */ - /** This is a vector of all set structs that we have allocated. */ - VectorSet * allSets; + Set *createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange); + + bool itemExistInSet(Set *set, uint64_t item); - /** This is a vector of all element structs that we have allocated. */ - VectorElement * allElements; + VarType getSetVarType(Set *set); - /** This is a vector of all predicate structs that we have allocated. */ - VectorPredicate * allPredicates; + Element *createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange); - /** This is a vector of all table structs that we have allocated. */ - VectorTable * allTables; + /** 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! + */ - /** This is a vector of all order structs that we have allocated. */ - VectorOrder * allOrders; + MutableSet *createMutableSet(VarType type); - /** This is a vector of all function structs that we have allocated. */ - VectorFunction* allFunctions; -}; + /** 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(); + + BooleanEdge getBooleanFalse(); + + /** This function creates a boolean variable. */ -/** Create a new solver instance. */ + BooleanEdge getBooleanVar(VarType type); -CSolver * allocCSolver(); + /** This function creates a function operator. */ -/** Delete solver instance. */ + Function *createFunctionOperator(ArithOp op, Set *range, + OverFlowBehavior overflowbehavior); -void deleteSolver(CSolver * This); + /** This function creates a predicate operator. */ -/** This function creates a set containing the elements passed in the array. */ + Predicate *createPredicateOperator(CompOp op); -Set * createSet(CSolver *, VarType type, uint64_t * elements, uint num); + Predicate *createPredicateTable(Table *table, UndefinedBehavior behavior); -/** This function creates a set from lowrange to highrange (inclusive). */ + /** This function creates an empty instance table.*/ -Set * createRangeSet(CSolver *, VarType type, uint64_t lowrange, uint64_t highrange); + Table *createTable(Set *range); -/** This function creates a mutable set. */ + Table *createTableForPredicate(); + /** This function adds an input output relation to a table. */ -MutableSet * createMutableSet(CSolver *, VarType type); + void addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result); -/** This function adds a new item to a set. */ + /** This function converts a completed table into a function. */ -void addItem(CSolver *, MutableSet * set, uint64_t element); + Function *completeTable(Table *, UndefinedBehavior behavior); -/** 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. */ + /** This function applies a function to the Elements in its input. */ -uint64_t createUniqueItem(CSolver *, MutableSet * set); + Element *applyFunction(Function *function, Element **array, uint numArrays, BooleanEdge overflowstatus); -/** This function creates an element variable over a set. */ + /** This function applies a predicate to the Elements in its input. */ -Element * getElementVar(CSolver *, Set * set); + BooleanEdge applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, BooleanEdge undefinedStatus); -/** This function creates an element constrant. */ -Element * getElementConst(CSolver *, VarType type, uint64_t value); + BooleanEdge applyPredicate(Predicate *predicate, Element **inputs, uint numInputs); -/** This function creates a boolean variable. */ + /** This function applies a logical operation to the Booleans in its input. */ -Boolean * getBooleanVar(CSolver *, VarType type); + BooleanEdge applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize); -/** This function creates a function operator. */ + /** This function applies a logical operation to the Booleans in its input. */ -Function * createFunctionOperator(CSolver *solver, ArithOp op, Set ** domain, uint numDomain, Set * range, - OverFlowBehavior overflowbehavior); + BooleanEdge applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2); -/** This function creates a predicate operator. */ + /** This function applies a logical operation to the Booleans in its input. */ -Predicate * createPredicateOperator(CSolver *solver, CompOp op, Set ** domain, uint numDomain); + BooleanEdge applyLogicalOperation(LogicOp op, BooleanEdge arg); -/** This function creates an empty instance table.*/ + /** This function adds a boolean constraint to the set of constraints + to be satisfied */ -Table * createTable(CSolver *solver, Set **domains, uint numDomain, Set * range); + void addConstraint(BooleanEdge constraint); -/** This function adds an input output relation to a table. */ + /** This function instantiates an order of type type over the set set. */ + Order *createOrder(OrderType type, Set *set); -void addTableEntry(CSolver *solver, Table* table, uint64_t* inputs, uint inputSize, uint64_t result); + /** This function instantiates a boolean on two items in an order. */ + BooleanEdge orderConstraint(Order *order, uint64_t first, uint64_t second); -/** This function converts a completed table into a function. */ + /** When everything is done, the client calls this function and then csolver starts to encode*/ + int solve(); -Function * completeTable(CSolver *, Table *); + /** After getting the solution from the SAT solver, client can get the value of an element via this function*/ + uint64_t getElementValue(Element *element); -/** This function applies a function to the Elements in its input. */ + /** After getting the solution from the SAT solver, client can get the value of a boolean via this function*/ + bool getBooleanValue(BooleanEdge boolean); -Element * applyFunction(CSolver *, Function * function, Element ** array, uint numArrays, Boolean * overflowstatus); + bool getOrderConstraintValue(Order *order, uint64_t first, uint64_t second); -/** This function applies a predicate to the Elements in its input. */ + bool isTrue(BooleanEdge b); + bool isFalse(BooleanEdge b); -Boolean * applyPredicate(CSolver *, Predicate * predicate, Element ** inputs, uint numInputs); + void setUnSAT() { model_print("Setting UNSAT %%%%%%\n"); unsat = true; } + bool isUnSAT() { return unsat; } -/** This function applies a logical operation to the Booleans in its input. */ + void printConstraint(BooleanEdge boolean); + void printConstraints(); -Boolean * applyLogicalOperation(CSolver *, LogicOp op, Boolean ** array, uint asize); + Vector *getOrders() { return &allOrders;} + HashsetOrder *getActiveOrders() { return &activeOrders;} -/** This function adds a boolean constraint to the set of constraints - to be satisfied */ + Tuner *getTuner() { return tuner; } -void addConstraint(CSolver *, Boolean * constraint); + SetIteratorBooleanEdge *getConstraints() { return constraints.iterator(); } -/** This function instantiates an order of type type over the set set. */ -Order * createOrder(CSolver *, OrderType type, Set * set); + SATEncoder *getSATEncoder() {return satEncoder;} -/** This function instantiates a boolean on two items in an order. */ -Boolean * orderConstraint(CSolver *, Order * order, uint64_t first, uint64_t second); + 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); + void autoTune(uint budget); + void inferFixedOrders(); + void inferFixedOrder(Order *order); -/** When everything is done, the client calls this function and then csolver starts to encode*/ -int startEncoding(CSolver*); -/** After getting the solution from the SAT solver, client can get the value of an element via this function*/ -uint64_t getElementValue(CSolver*, Element* element); + void setTuner(Tuner *_tuner) { tuner = _tuner; } + long long getElapsedTime() { return elapsedTime; } + long long getEncodeTime(); + long long getSolveTime(); -/** After getting the solution from the SAT solver, client can get the value of a boolean via this function*/ -bool getBooleanValue( CSolver* , Boolean* boolean); + CMEMALLOC; -HappenedBefore getOrderConstraintValue(CSolver*, Boolean* orderConstr); +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; + Tuner *tuner; + long long elapsedTime; + friend class ElementOpt; +}; +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