8 uint64_t Boolean::counter = 0;
10 Boolean::Boolean(ASTNodeType _type) :
12 polarity(P_UNDEFINED),
13 boolVal(BV_UNDEFINED),
14 parents(), id(counter++) {
17 BooleanConst::BooleanConst(bool _isTrue) :
22 BooleanVar::BooleanVar(VarType t) :
28 BooleanOrder::BooleanOrder(Order *_order, uint64_t _first, uint64_t _second) :
35 void BooleanOrder::updateParents() {
36 order->addOrderConstraint(this);
39 BooleanPredicate::BooleanPredicate(Predicate *_predicate, Element **_inputs, uint _numInputs, BooleanEdge _undefinedStatus) :
41 predicate(_predicate),
43 inputs(_inputs, _numInputs),
44 undefStatus(_undefinedStatus) {
47 BooleanLogic::BooleanLogic(CSolver *solver, LogicOp _op, BooleanEdge *array, uint asize) :
51 inputs(array, asize) {
54 BooleanEdge cloneEdge(CSolver *solver, CloneMap *map, BooleanEdge e) {
55 bool isnegated = e.isNegated();
56 Boolean *b = e->clone(solver, map);
57 BooleanEdge be = BooleanEdge(b);
58 return isnegated ? be.negate() : be;
61 Boolean *BooleanConst::clone(CSolver *solver, CloneMap *map) {
62 return solver->getBooleanTrue().getRaw();
65 Boolean *BooleanVar::clone(CSolver *solver, CloneMap *map) {
66 Boolean *b = (Boolean *) map->get(this);
69 BooleanEdge bvar = solver->getBooleanVar(type);
70 Boolean *base = bvar.getRaw();
75 Boolean *BooleanOrder::clone(CSolver *solver, CloneMap *map) {
76 Order *ordercopy = order->clone(solver, map);
77 return solver->orderConstraint(ordercopy, first, second).getRaw();
80 Boolean *BooleanLogic::clone(CSolver *solver, CloneMap *map) {
81 BooleanEdge array[inputs.getSize()];
82 for (uint i = 0; i < inputs.getSize(); i++) {
83 array[i] = cloneEdge(solver, map, inputs.get(i));
85 return solver->applyLogicalOperation(op, array, inputs.getSize()).getRaw();
88 Boolean *BooleanPredicate::clone(CSolver *solver, CloneMap *map) {
89 Element *array[inputs.getSize()];
90 for (uint i = 0; i < inputs.getSize(); i++) {
91 array[i] = inputs.get(i)->clone(solver, map);
93 Predicate *pred = predicate->clone(solver, map);
94 BooleanEdge defstatus = undefStatus ? cloneEdge(solver, map, undefStatus) : BooleanEdge();
96 return solver->applyPredicateTable(pred, array, inputs.getSize(), defstatus).getRaw();
99 void BooleanPredicate::updateParents() {
100 for (uint i = 0; i < inputs.getSize(); i++) inputs.get(i)->parents.push(this);
102 undefStatus->parents.push(this);
105 void BooleanLogic::updateParents() {
106 for (uint i = 0; i < inputs.getSize(); i++) inputs.get(i)->parents.push(this);
109 void BooleanVar::serialize(Serializer *serializer) {
110 if (serializer->isSerialized(this))
112 serializer->addObject(this);
113 serializer->mywrite(&type, sizeof(ASTNodeType));
114 BooleanVar *This = this;
115 serializer->mywrite(&This, sizeof(BooleanVar *));
116 serializer->mywrite(&vtype, sizeof(VarType));
119 void BooleanConst::serialize(Serializer *serializer) {
120 if (serializer->isSerialized(this))
122 serializer->addObject(this);
123 serializer->mywrite(&type, sizeof(ASTNodeType));
124 BooleanConst *This = this;
125 serializer->mywrite(&This, sizeof(BooleanConst *));
126 serializer->mywrite(&istrue, sizeof(bool));
129 void BooleanVar::print() {
130 model_print("BooleanVar<%p>\n", this);
133 void BooleanConst::print() {
134 model_print("BooleanConst<%p>:%s\n", this, istrue ? "TRUE" : "FALSE");
137 void BooleanOrder::serialize(Serializer *serializer) {
138 if (serializer->isSerialized(this))
140 serializer->addObject(this);
141 order->serialize(serializer);
143 serializer->mywrite(&type, sizeof(ASTNodeType));
144 BooleanOrder *This = this;
145 serializer->mywrite(&This, sizeof(BooleanOrder *));
146 serializer->mywrite(&order, sizeof(Order *));
147 serializer->mywrite(&first, sizeof(uint64_t));
148 serializer->mywrite(&second, sizeof(uint64_t));
151 void BooleanOrder::print() {
152 model_print("{BooleanOrder<%p>: First= %lu, Second = %lu on Order:\n", this, first, second);
157 void BooleanPredicate::serialize(Serializer *serializer) {
158 if (serializer->isSerialized(this))
160 serializer->addObject(this);
162 predicate->serialize(serializer);
163 uint size = inputs.getSize();
164 for (uint i = 0; i < size; i++) {
165 Element *input = inputs.get(i);
166 input->serialize(serializer);
168 serializeBooleanEdge(serializer, undefStatus);
170 serializer->mywrite(&type, sizeof(ASTNodeType));
171 BooleanPredicate *This = this;
172 serializer->mywrite(&This, sizeof(BooleanPredicate *));
173 serializer->mywrite(&predicate, sizeof(Predicate *));
174 serializer->mywrite(&size, sizeof(uint));
175 for (uint i = 0; i < size; i++) {
176 Element *input = inputs.get(i);
177 serializer->mywrite(&input, sizeof(Element *));
179 Boolean *undefStat = undefStatus != BooleanEdge(NULL) ? undefStatus.getRaw() : NULL;
180 serializer->mywrite(&undefStat, sizeof(Boolean *));
183 void BooleanPredicate::print() {
184 model_print("{BooleanPredicate<%p>:\n", this);
186 model_print("elements:\n");
187 uint size = inputs.getSize();
188 for (uint i = 0; i < size; i++) {
189 Element *input = inputs.get(i);
195 void BooleanLogic::serialize(Serializer *serializer) {
196 if (serializer->isSerialized(this))
198 serializer->addObject(this);
199 uint size = inputs.getSize();
200 for (uint i = 0; i < size; i++) {
201 BooleanEdge input = inputs.get(i);
202 serializeBooleanEdge(serializer, input);
204 serializer->mywrite(&type, sizeof(ASTNodeType));
205 BooleanLogic *This = this;
206 serializer->mywrite(&This, sizeof(BooleanLogic *));
207 serializer->mywrite(&op, sizeof(LogicOp));
208 serializer->mywrite(&size, sizeof(uint));
209 for (uint i = 0; i < size; i++) {
210 Boolean *input = inputs.get(i).getRaw();
211 serializer->mywrite(&input, sizeof(Boolean *));
215 void BooleanLogic::print() {
216 model_print("{BooleanLogic<%p>: %s\n", this,
217 op == SATC_AND ? "AND" : op == SATC_OR ? "OR" : op == SATC_NOT ? "NOT" :
218 op == SATC_XOR ? "XOR" : op == SATC_IFF ? "IFF" : "IMPLIES");
219 uint size = inputs.getSize();
220 for (uint i = 0; i < size; i++) {
221 BooleanEdge input = inputs.get(i);
222 if (input.isNegated())
224 input.getBoolean()->print();