5 #include "corestructs.h"
13 /** This function creates a set containing the elements passed in the array. */
14 Set *createSet(VarType type, uint64_t *elements, uint num);
16 /** This function creates a set from lowrange to highrange (inclusive). */
18 Set *createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange);
20 Element *createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange);
22 /** This function creates a mutable set. */
24 MutableSet *createMutableSet(VarType type);
26 /** This function adds a new item to a set. */
28 void addItem(MutableSet *set, uint64_t element);
30 /** This function adds a new unique item to the set and returns it.
31 This function cannot be used in conjunction with manually adding
34 uint64_t createUniqueItem(MutableSet *set);
36 /** This function creates an element variable over a set. */
38 Element *getElementVar(Set *set);
40 /** This function creates an element constrant. */
41 Element *getElementConst(VarType type, uint64_t value);
43 Boolean *getBooleanTrue();
45 Boolean *getBooleanFalse();
47 /** This function creates a boolean variable. */
49 Boolean *getBooleanVar(VarType type);
51 /** This function creates a function operator. */
53 Function *createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,
54 OverFlowBehavior overflowbehavior);
56 /** This function creates a predicate operator. */
58 Predicate *createPredicateOperator(CompOp op, Set **domain, uint numDomain);
60 Predicate *createPredicateTable(Table *table, UndefinedBehavior behavior);
62 /** This function creates an empty instance table.*/
64 Table *createTable(Set **domains, uint numDomain, Set *range);
66 Table *createTableForPredicate(Set **domains, uint numDomain);
67 /** This function adds an input output relation to a table. */
69 void addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result);
71 /** This function converts a completed table into a function. */
73 Function *completeTable(Table *, UndefinedBehavior behavior);
75 /** This function applies a function to the Elements in its input. */
77 Element *applyFunction(Function *function, Element **array, uint numArrays, Boolean *overflowstatus);
79 /** This function applies a predicate to the Elements in its input. */
81 Boolean *applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, Boolean *undefinedStatus);
83 Boolean *applyPredicate(Predicate *predicate, Element **inputs, uint numInputs);
85 /** This function applies a logical operation to the Booleans in its input. */
87 Boolean *applyLogicalOperation(LogicOp op, Boolean **array, uint asize);
89 /** This function adds a boolean constraint to the set of constraints
92 void addConstraint(Boolean *constraint);
94 /** This function instantiates an order of type type over the set set. */
95 Order *createOrder(OrderType type, Set *set);
97 /** This function instantiates a boolean on two items in an order. */
98 Boolean *orderConstraint(Order *order, uint64_t first, uint64_t second);
100 /** When everything is done, the client calls this function and then csolver starts to encode*/
103 /** After getting the solution from the SAT solver, client can get the value of an element via this function*/
104 uint64_t getElementValue(Element *element);
106 /** After getting the solution from the SAT solver, client can get the value of a boolean via this function*/
107 bool getBooleanValue(Boolean *boolean);
109 HappenedBefore getOrderConstraintValue(Order *order, uint64_t first, uint64_t second);
111 bool isTrue(Boolean *b);
112 bool isFalse(Boolean *b);
114 void setUnSAT() { unsat = true; }
116 bool isUnSAT() { return unsat; }
118 Vector<Order *> *getOrders() { return &allOrders;}
120 Tuner *getTuner() { return tuner; }
122 SetIteratorBoolean *getConstraints() { return constraints.iterator(); }
124 SATEncoder *getSATEncoder() {return satEncoder;}
126 void replaceBooleanWithTrue(Boolean *bexpr);
127 void replaceBooleanWithFalse(Boolean *bexpr);
128 void replaceBooleanWithBoolean(Boolean *oldb, Boolean *newb);
130 void autoTune(uint budget);
132 void setTuner(Tuner * _tuner) { tuner = _tuner; }
133 long long getElapsedTime() { return elapsedTime; }
134 long long getEncodeTime();
135 long long getSolveTime();
140 void handleXORFalse(BooleanLogic *bexpr, Boolean *child);
141 void handleIMPLIESTrue(BooleanLogic *bexpr, Boolean *child);
142 void handleIMPLIESFalse(BooleanLogic *bexpr, Boolean *child);
143 void handleANDTrue(BooleanLogic *bexpr, Boolean *child);
144 void handleORFalse(BooleanLogic *bexpr, Boolean *child);
146 /** This is a vector of constraints that must be satisfied. */
147 HashsetBoolean constraints;
149 /** This is a vector of all boolean structs that we have allocated. */
150 Vector<Boolean *> allBooleans;
152 /** This is a vector of all set structs that we have allocated. */
153 Vector<Set *> allSets;
155 /** This is a vector of all element structs that we have allocated. */
156 Vector<Element *> allElements;
158 /** This is a vector of all predicate structs that we have allocated. */
159 Vector<Predicate *> allPredicates;
161 /** This is a vector of all table structs that we have allocated. */
162 Vector<Table *> allTables;
164 /** This is a vector of all order structs that we have allocated. */
165 Vector<Order *> allOrders;
167 /** This is a vector of all function structs that we have allocated. */
168 Vector<Function *> allFunctions;
173 /** These two tables are used for deduplicating entries. */
174 BooleanMatchMap boolMap;
175 ElementMatchMap elemMap;
177 SATEncoder *satEncoder;
181 long long elapsedTime;