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);
101 void BooleanLogic::updateParents() {
102 for (uint i = 0; i < inputs.getSize(); i++) inputs.get(i)->parents.push(this);
105 void BooleanVar::serialize(Serializer *serializer) {
106 if (serializer->isSerialized(this))
108 serializer->addObject(this);
109 serializer->mywrite(&type, sizeof(ASTNodeType));
110 BooleanVar *This = this;
111 serializer->mywrite(&This, sizeof(BooleanVar *));
112 serializer->mywrite(&vtype, sizeof(VarType));
115 void BooleanVar::print() {
116 model_print("BooleanVar:%lu\n", (uintptr_t)this);
119 void BooleanConst::print() {
120 model_print("BooleanConst:%s\n", istrue ? "TRUE" : "FALSE");
123 void BooleanOrder::serialize(Serializer *serializer) {
124 if (serializer->isSerialized(this))
126 serializer->addObject(this);
127 order->serialize(serializer);
129 serializer->mywrite(&type, sizeof(ASTNodeType));
130 BooleanOrder *This = this;
131 serializer->mywrite(&This, sizeof(BooleanOrder *));
132 serializer->mywrite(&order, sizeof(Order *));
133 serializer->mywrite(&first, sizeof(uint64_t));
134 serializer->mywrite(&second, sizeof(uint64_t));
137 void BooleanOrder::print() {
138 model_print("{BooleanOrder: First= %lu, Second = %lu on Order:\n", first, second);
143 void BooleanPredicate::serialize(Serializer *serializer) {
144 if (serializer->isSerialized(this))
146 serializer->addObject(this);
148 predicate->serialize(serializer);
149 uint size = inputs.getSize();
150 for (uint i = 0; i < size; i++) {
151 Element *input = inputs.get(i);
152 input->serialize(serializer);
154 serializeBooleanEdge(serializer, undefStatus);
156 serializer->mywrite(&type, sizeof(ASTNodeType));
157 BooleanPredicate *This = this;
158 serializer->mywrite(&This, sizeof(BooleanPredicate *));
159 serializer->mywrite(&predicate, sizeof(Predicate *));
160 serializer->mywrite(&size, sizeof(uint));
161 for (uint i = 0; i < size; i++) {
162 Element *input = inputs.get(i);
163 serializer->mywrite(&input, sizeof(Element *));
165 Boolean *undefStat = undefStatus != BooleanEdge(NULL) ? undefStatus.getRaw() : NULL;
166 serializer->mywrite(&undefStat, sizeof(Boolean *));
169 void BooleanPredicate::print() {
170 model_print("{BooleanPredicate:\n");
172 model_print("elements:\n");
173 uint size = inputs.getSize();
174 for (uint i = 0; i < size; i++) {
175 Element *input = inputs.get(i);
181 void BooleanLogic::serialize(Serializer *serializer) {
182 if (serializer->isSerialized(this))
184 serializer->addObject(this);
185 uint size = inputs.getSize();
186 for (uint i = 0; i < size; i++) {
187 BooleanEdge input = inputs.get(i);
188 serializeBooleanEdge(serializer, input);
190 serializer->mywrite(&type, sizeof(ASTNodeType));
191 BooleanLogic *This = this;
192 serializer->mywrite(&This, sizeof(BooleanLogic *));
193 serializer->mywrite(&op, sizeof(LogicOp));
194 serializer->mywrite(&size, sizeof(uint));
195 for (uint i = 0; i < size; i++) {
196 Boolean *input = inputs.get(i).getRaw();
197 serializer->mywrite(&input, sizeof(Boolean *));
201 void BooleanLogic::print() {
202 model_print("{BooleanLogic: %s\n",
203 op == SATC_AND ? "AND" : op == SATC_OR ? "OR" : op == SATC_NOT ? "NOT" :
204 op == SATC_XOR ? "XOR" : op == SATC_IFF ? "IFF" : "IMPLIES");
205 uint size = inputs.getSize();
206 for (uint i = 0; i < size; i++) {
207 BooleanEdge input = inputs.get(i);
208 if (input.isNegated())
210 input.getBoolean()->print();