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 Order *ordercopy = order->clone(solver, map);
75 return solver->orderConstraint(ordercopy, first, second).getRaw();
78 Boolean *BooleanLogic::clone(CSolver *solver, CloneMap *map) {
79 BooleanEdge array[inputs.getSize()];
80 for (uint i = 0; i < inputs.getSize(); i++) {
81 array[i] = cloneEdge(solver, map, inputs.get(i));
83 return solver->applyLogicalOperation(op, array, inputs.getSize()).getRaw();
86 Boolean *BooleanPredicate::clone(CSolver *solver, CloneMap *map) {
87 Element *array[inputs.getSize()];
88 for (uint i = 0; i < inputs.getSize(); i++) {
89 array[i] = inputs.get(i)->clone(solver, map);
91 Predicate *pred = predicate->clone(solver, map);
92 BooleanEdge defstatus = undefStatus ? cloneEdge(solver, map, undefStatus) : BooleanEdge();
94 return solver->applyPredicateTable(pred, array, inputs.getSize(), defstatus).getRaw();
97 void BooleanPredicate::updateParents() {
98 for (uint i = 0; i < inputs.getSize(); i++) inputs.get(i)->parents.push(this);
100 undefStatus->parents.push(this);
103 void BooleanLogic::updateParents() {
104 for (uint i = 0; i < inputs.getSize(); i++) inputs.get(i)->parents.push(this);
107 void BooleanVar::serialize(Serializer *serializer) {
108 if (serializer->isSerialized(this))
110 serializer->addObject(this);
111 serializer->mywrite(&type, sizeof(ASTNodeType));
112 BooleanVar *This = this;
113 serializer->mywrite(&This, sizeof(BooleanVar *));
114 serializer->mywrite(&vtype, sizeof(VarType));
117 void BooleanVar::print() {
118 model_print("BooleanVar<%p>\n", this);
121 void BooleanConst::print() {
122 model_print("BooleanConst<%p>:%s\n", this, istrue ? "TRUE" : "FALSE");
125 void BooleanOrder::serialize(Serializer *serializer) {
126 if (serializer->isSerialized(this))
128 serializer->addObject(this);
129 order->serialize(serializer);
131 serializer->mywrite(&type, sizeof(ASTNodeType));
132 BooleanOrder *This = this;
133 serializer->mywrite(&This, sizeof(BooleanOrder *));
134 serializer->mywrite(&order, sizeof(Order *));
135 serializer->mywrite(&first, sizeof(uint64_t));
136 serializer->mywrite(&second, sizeof(uint64_t));
139 void BooleanOrder::print() {
140 model_print("{BooleanOrder<%p>: First= %lu, Second = %lu on Order:\n", this, first, second);
145 void BooleanPredicate::serialize(Serializer *serializer) {
146 if (serializer->isSerialized(this))
148 serializer->addObject(this);
150 predicate->serialize(serializer);
151 uint size = inputs.getSize();
152 for (uint i = 0; i < size; i++) {
153 Element *input = inputs.get(i);
154 input->serialize(serializer);
156 serializeBooleanEdge(serializer, undefStatus);
158 serializer->mywrite(&type, sizeof(ASTNodeType));
159 BooleanPredicate *This = this;
160 serializer->mywrite(&This, sizeof(BooleanPredicate *));
161 serializer->mywrite(&predicate, sizeof(Predicate *));
162 serializer->mywrite(&size, sizeof(uint));
163 for (uint i = 0; i < size; i++) {
164 Element *input = inputs.get(i);
165 serializer->mywrite(&input, sizeof(Element *));
167 Boolean *undefStat = undefStatus != BooleanEdge(NULL) ? undefStatus.getRaw() : NULL;
168 serializer->mywrite(&undefStat, sizeof(Boolean *));
171 void BooleanPredicate::print() {
172 model_print("{BooleanPredicate<%p>:\n", this);
174 model_print("elements:\n");
175 uint size = inputs.getSize();
176 for (uint i = 0; i < size; i++) {
177 Element *input = inputs.get(i);
183 void BooleanLogic::serialize(Serializer *serializer) {
184 if (serializer->isSerialized(this))
186 serializer->addObject(this);
187 uint size = inputs.getSize();
188 for (uint i = 0; i < size; i++) {
189 BooleanEdge input = inputs.get(i);
190 serializeBooleanEdge(serializer, input);
192 serializer->mywrite(&type, sizeof(ASTNodeType));
193 BooleanLogic *This = this;
194 serializer->mywrite(&This, sizeof(BooleanLogic *));
195 serializer->mywrite(&op, sizeof(LogicOp));
196 serializer->mywrite(&size, sizeof(uint));
197 for (uint i = 0; i < size; i++) {
198 Boolean *input = inputs.get(i).getRaw();
199 serializer->mywrite(&input, sizeof(Boolean *));
203 void BooleanLogic::print() {
204 model_print("{BooleanLogic<%p>: %s\n", this,
205 op == SATC_AND ? "AND" : op == SATC_OR ? "OR" : op == SATC_NOT ? "NOT" :
206 op == SATC_XOR ? "XOR" : op == SATC_IFF ? "IFF" : "IMPLIES");
207 uint size = inputs.getSize();
208 for (uint i = 0; i < size; i++) {
209 BooleanEdge input = inputs.get(i);
210 if (input.isNegated())
212 input.getBoolean()->print();