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->constraints.push(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 BooleanVar::print() {
120 model_print("BooleanVar<%p>\n", this);
123 void BooleanConst::print() {
124 model_print("BooleanConst<%p>:%s\n", this, istrue ? "TRUE" : "FALSE");
127 void BooleanOrder::serialize(Serializer *serializer) {
128 if (serializer->isSerialized(this))
130 serializer->addObject(this);
131 order->serialize(serializer);
133 serializer->mywrite(&type, sizeof(ASTNodeType));
134 BooleanOrder *This = this;
135 serializer->mywrite(&This, sizeof(BooleanOrder *));
136 serializer->mywrite(&order, sizeof(Order *));
137 serializer->mywrite(&first, sizeof(uint64_t));
138 serializer->mywrite(&second, sizeof(uint64_t));
141 void BooleanOrder::print() {
142 model_print("{BooleanOrder<%p>: First= %lu, Second = %lu on Order:\n", this, first, second);
147 void BooleanPredicate::serialize(Serializer *serializer) {
148 if (serializer->isSerialized(this))
150 serializer->addObject(this);
152 predicate->serialize(serializer);
153 uint size = inputs.getSize();
154 for (uint i = 0; i < size; i++) {
155 Element *input = inputs.get(i);
156 input->serialize(serializer);
158 serializeBooleanEdge(serializer, undefStatus);
160 serializer->mywrite(&type, sizeof(ASTNodeType));
161 BooleanPredicate *This = this;
162 serializer->mywrite(&This, sizeof(BooleanPredicate *));
163 serializer->mywrite(&predicate, sizeof(Predicate *));
164 serializer->mywrite(&size, sizeof(uint));
165 for (uint i = 0; i < size; i++) {
166 Element *input = inputs.get(i);
167 serializer->mywrite(&input, sizeof(Element *));
169 Boolean *undefStat = undefStatus != BooleanEdge(NULL) ? undefStatus.getRaw() : NULL;
170 serializer->mywrite(&undefStat, sizeof(Boolean *));
173 void BooleanPredicate::print() {
174 model_print("{BooleanPredicate<%p>:\n", this);
176 model_print("elements:\n");
177 uint size = inputs.getSize();
178 for (uint i = 0; i < size; i++) {
179 Element *input = inputs.get(i);
185 void BooleanLogic::serialize(Serializer *serializer) {
186 if (serializer->isSerialized(this))
188 serializer->addObject(this);
189 uint size = inputs.getSize();
190 for (uint i = 0; i < size; i++) {
191 BooleanEdge input = inputs.get(i);
192 serializeBooleanEdge(serializer, input);
194 serializer->mywrite(&type, sizeof(ASTNodeType));
195 BooleanLogic *This = this;
196 serializer->mywrite(&This, sizeof(BooleanLogic *));
197 serializer->mywrite(&op, sizeof(LogicOp));
198 serializer->mywrite(&size, sizeof(uint));
199 for (uint i = 0; i < size; i++) {
200 Boolean *input = inputs.get(i).getRaw();
201 serializer->mywrite(&input, sizeof(Boolean *));
205 void BooleanLogic::print() {
206 model_print("{BooleanLogic<%p>: %s\n", this,
207 op == SATC_AND ? "AND" : op == SATC_OR ? "OR" : op == SATC_NOT ? "NOT" :
208 op == SATC_XOR ? "XOR" : op == SATC_IFF ? "IFF" : "IMPLIES");
209 uint size = inputs.getSize();
210 for (uint i = 0; i < size; i++) {
211 BooleanEdge input = inputs.get(i);
212 if (input.isNegated())
214 input.getBoolean()->print();