8 Boolean::Boolean(ASTNodeType _type) :
10 polarity(P_UNDEFINED),
11 boolVal(BV_UNDEFINED),
15 BooleanConst::BooleanConst(bool _isTrue) :
20 BooleanVar::BooleanVar(VarType t) :
26 BooleanOrder::BooleanOrder(Order *_order, uint64_t _first, uint64_t _second) :
33 void BooleanOrder::updateParents() {
34 order->constraints.push(this);
37 BooleanPredicate::BooleanPredicate(Predicate *_predicate, Element **_inputs, uint _numInputs, BooleanEdge _undefinedStatus) :
39 predicate(_predicate),
41 inputs(_inputs, _numInputs),
42 undefStatus(_undefinedStatus) {
45 BooleanLogic::BooleanLogic(CSolver *solver, LogicOp _op, BooleanEdge *array, uint asize) :
49 inputs(array, asize) {
52 BooleanEdge cloneEdge(CSolver *solver, CloneMap *map, BooleanEdge e) {
53 bool isnegated = e.isNegated();
54 Boolean *b = e->clone(solver, map);
55 BooleanEdge be = BooleanEdge(b);
56 return isnegated ? be.negate() : be;
59 Boolean *BooleanConst::clone(CSolver *solver, CloneMap *map) {
60 return solver->getBooleanTrue().getRaw();
63 Boolean *BooleanVar::clone(CSolver *solver, CloneMap *map) {
64 Boolean *b = (Boolean *) map->get(this);
67 BooleanEdge bvar = solver->getBooleanVar(type);
68 Boolean *base = bvar.getRaw();
73 Boolean *BooleanOrder::clone(CSolver *solver, CloneMap *map) {
74 Boolean *b = (Boolean *) map->get(this);
77 Order *ordercopy = order->clone(solver, map);
78 b= solver->orderConstraint(ordercopy, first, second).getRaw();
83 Boolean *BooleanLogic::clone(CSolver *solver, CloneMap *map) {
84 Boolean *b = (Boolean *) map->get(this);
87 BooleanEdge array[inputs.getSize()];
88 for (uint i = 0; i < inputs.getSize(); i++) {
89 array[i] = cloneEdge(solver, map, inputs.get(i));
91 b= solver->applyLogicalOperation(op, array, inputs.getSize()).getRaw();
96 Boolean *BooleanPredicate::clone(CSolver *solver, CloneMap *map) {
97 Boolean *b = (Boolean *) map->get(this);
100 Element *array[inputs.getSize()];
101 for (uint i = 0; i < inputs.getSize(); i++) {
102 array[i] = inputs.get(i)->clone(solver, map);
104 Predicate *pred = predicate->clone(solver, map);
105 BooleanEdge defstatus = undefStatus ? cloneEdge(solver, map, undefStatus) : BooleanEdge();
107 b= solver->applyPredicateTable(pred, array, inputs.getSize(), defstatus).getRaw();
112 void BooleanPredicate::updateParents() {
113 for (uint i = 0; i < inputs.getSize(); i++) inputs.get(i)->parents.push(this);
115 undefStatus->parents.push(this);
118 void BooleanLogic::updateParents() {
119 for (uint i = 0; i < inputs.getSize(); i++) inputs.get(i)->parents.push(this);
122 void BooleanVar::serialize(Serializer *serializer) {
123 if (serializer->isSerialized(this))
125 serializer->addObject(this);
126 serializer->mywrite(&type, sizeof(ASTNodeType));
127 BooleanVar *This = this;
128 serializer->mywrite(&This, sizeof(BooleanVar *));
129 serializer->mywrite(&vtype, sizeof(VarType));
132 void BooleanVar::print() {
133 model_print("BooleanVar<%p>\n", this);
136 void BooleanConst::print() {
137 model_print("BooleanConst<%p>:%s\n", this, istrue ? "TRUE" : "FALSE");
140 void BooleanOrder::serialize(Serializer *serializer) {
141 if (serializer->isSerialized(this))
143 serializer->addObject(this);
144 order->serialize(serializer);
146 serializer->mywrite(&type, sizeof(ASTNodeType));
147 BooleanOrder *This = this;
148 serializer->mywrite(&This, sizeof(BooleanOrder *));
149 serializer->mywrite(&order, sizeof(Order *));
150 serializer->mywrite(&first, sizeof(uint64_t));
151 serializer->mywrite(&second, sizeof(uint64_t));
154 void BooleanOrder::print() {
155 model_print("{BooleanOrder<%p>: First= %lu, Second = %lu on Order:\n", this, first, second);
160 void BooleanPredicate::serialize(Serializer *serializer) {
161 if (serializer->isSerialized(this))
163 serializer->addObject(this);
165 predicate->serialize(serializer);
166 uint size = inputs.getSize();
167 for (uint i = 0; i < size; i++) {
168 Element *input = inputs.get(i);
169 input->serialize(serializer);
171 serializeBooleanEdge(serializer, undefStatus);
173 serializer->mywrite(&type, sizeof(ASTNodeType));
174 BooleanPredicate *This = this;
175 serializer->mywrite(&This, sizeof(BooleanPredicate *));
176 serializer->mywrite(&predicate, sizeof(Predicate *));
177 serializer->mywrite(&size, sizeof(uint));
178 for (uint i = 0; i < size; i++) {
179 Element *input = inputs.get(i);
180 serializer->mywrite(&input, sizeof(Element *));
182 Boolean *undefStat = undefStatus != BooleanEdge(NULL) ? undefStatus.getRaw() : NULL;
183 serializer->mywrite(&undefStat, sizeof(Boolean *));
186 void BooleanPredicate::print() {
187 model_print("{BooleanPredicate<%p>:\n", this);
189 model_print("elements:\n");
190 uint size = inputs.getSize();
191 for (uint i = 0; i < size; i++) {
192 Element *input = inputs.get(i);
198 void BooleanLogic::serialize(Serializer *serializer) {
199 if (serializer->isSerialized(this))
201 serializer->addObject(this);
202 uint size = inputs.getSize();
203 for (uint i = 0; i < size; i++) {
204 BooleanEdge input = inputs.get(i);
205 serializeBooleanEdge(serializer, input);
207 serializer->mywrite(&type, sizeof(ASTNodeType));
208 BooleanLogic *This = this;
209 serializer->mywrite(&This, sizeof(BooleanLogic *));
210 serializer->mywrite(&op, sizeof(LogicOp));
211 serializer->mywrite(&size, sizeof(uint));
212 for (uint i = 0; i < size; i++) {
213 Boolean *input = inputs.get(i).getRaw();
214 serializer->mywrite(&input, sizeof(Boolean *));
218 void BooleanLogic::print() {
219 model_print("{BooleanLogic<%p>: %s\n", this,
220 op == SATC_AND ? "AND" : op == SATC_OR ? "OR" : op == SATC_NOT ? "NOT" :
221 op == SATC_XOR ? "XOR" : op == SATC_IFF ? "IFF" : "IMPLIES");
222 uint size = inputs.getSize();
223 for (uint i = 0; i < size; i++) {
224 BooleanEdge input = inputs.get(i);
225 if (input.isNegated())
227 input.getBoolean()->print();