X-Git-Url: http://plrg.eecs.uci.edu/git/?p=satune.git;a=blobdiff_plain;f=src%2Fcsolver.h;h=19ba3e12db5eac9f06affa74540cf66bf774f997;hp=b53b77ba9b9b6ffd565aa1698bc43999cc4f3ffc;hb=19c299fd9e91386883e788f445d153abfe58430a;hpb=da9bf180de81b31c95fb4987b84412e11ce3f6eb

diff --git a/src/csolver.h b/src/csolver.h
index b53b77b..19ba3e1 100644
--- a/src/csolver.h
+++ b/src/csolver.h
@@ -5,12 +5,13 @@
 #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);
 
@@ -18,14 +19,22 @@ public:
 
 	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. */
+	/** 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.
@@ -34,6 +43,11 @@ public:
 
 	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);
@@ -41,6 +55,10 @@ public:
 	/** 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();
@@ -51,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);
@@ -120,25 +138,33 @@ public:
 	bool isTrue(BooleanEdge b);
 	bool isFalse(BooleanEdge b);
 
-	void setUnSAT() { unsat = true; }
-
+	void setUnSAT() { model_print("Setting UNSAT %%%%%%\n"); unsat = true; }
 	bool isUnSAT() { return unsat; }
 
+	void printConstraint(BooleanEdge boolean);
+	void printConstraints();
+
 	Vector<Order *> *getOrders() { return &allOrders;}
-	HashsetOrder * getActiveOrders() { return &activeOrders;}
+	HashsetOrder *getActiveOrders() { return &activeOrders;}
 
 	Tuner *getTuner() { return tuner; }
 
-	SetIteratorBooleanEdge * getConstraints() { return constraints.iterator(); }
+	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);
 	void autoTune(uint budget);
+	void inferFixedOrders();
+	void inferFixedOrder(Order *order);
+
 
 	void setTuner(Tuner *_tuner) { tuner = _tuner; }
 	long long getElapsedTime() { return elapsedTime; }
@@ -150,6 +176,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
@@ -177,7 +204,7 @@ private:
 	Vector<Order *> allOrders;
 
 	HashsetOrder activeOrders;
-	
+
 	/** This is a vector of all function structs that we have allocated. */
 	Vector<Function *> allFunctions;
 
@@ -192,5 +219,38 @@ private:
 	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