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. */
+ /** 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);
Set *getElementRange (Element *element);
+ void mustHaveValue(Element *element);
+
BooleanEdge getBooleanTrue();
BooleanEdge getBooleanFalse();
/** 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);
void setUnSAT() { model_print("Setting UNSAT %%%%%%\n"); unsat = true; }
bool isUnSAT() { return unsat; }
+ void printConstraint(BooleanEdge boolean);
void printConstraints();
Vector<Order *> *getOrders() { return &allOrders;}
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; }
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);
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