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) :
31 order->constraints.push(this);
34 BooleanPredicate::BooleanPredicate(Predicate *_predicate, Element **_inputs, uint _numInputs, BooleanEdge _undefinedStatus) :
36 predicate(_predicate),
38 inputs(_inputs, _numInputs),
39 undefStatus(_undefinedStatus) {
42 BooleanLogic::BooleanLogic(CSolver *solver, LogicOp _op, BooleanEdge *array, uint asize) :
46 inputs(array, asize) {
49 BooleanEdge cloneEdge(CSolver *solver, CloneMap *map, BooleanEdge e) {
50 bool isnegated = e.isNegated();
51 Boolean *b = e->clone(solver, map);
52 BooleanEdge be = BooleanEdge(b);
53 return isnegated ? be.negate() : be;
56 Boolean *BooleanConst::clone(CSolver *solver, CloneMap *map) {
57 return solver->getBooleanTrue().getRaw();
60 Boolean *BooleanVar::clone(CSolver *solver, CloneMap *map) {
61 Boolean *b = (Boolean *) map->get(this);
64 BooleanEdge bvar = solver->getBooleanVar(type);
65 Boolean *base = bvar.getRaw();
70 Boolean *BooleanOrder::clone(CSolver *solver, CloneMap *map) {
71 Order *ordercopy = order->clone(solver, map);
72 return solver->orderConstraint(ordercopy, first, second).getRaw();
75 Boolean *BooleanLogic::clone(CSolver *solver, CloneMap *map) {
76 BooleanEdge array[inputs.getSize()];
77 for (uint i = 0; i < inputs.getSize(); i++) {
78 array[i] = cloneEdge(solver, map, inputs.get(i));
80 return solver->applyLogicalOperation(op, array, inputs.getSize()).getRaw();
83 Boolean *BooleanPredicate::clone(CSolver *solver, CloneMap *map) {
84 Element *array[inputs.getSize()];
85 for (uint i = 0; i < inputs.getSize(); i++) {
86 array[i] = inputs.get(i)->clone(solver, map);
88 Predicate *pred = predicate->clone(solver, map);
89 BooleanEdge defstatus = undefStatus ? cloneEdge(solver, map, undefStatus) : BooleanEdge();
91 return solver->applyPredicateTable(pred, array, inputs.getSize(), defstatus).getRaw();
94 void BooleanPredicate::updateParents() {
95 for (uint i = 0; i < inputs.getSize(); i++) inputs.get(i)->parents.push(this);
98 void BooleanLogic::updateParents() {
99 for (uint i = 0; i < inputs.getSize(); i++) inputs.get(i)->parents.push(this);
102 void BooleanVar::serialize(Serializer *serializer) {
103 if (serializer->isSerialized(this))
105 serializer->addObject(this);
106 serializer->mywrite(&type, sizeof(ASTNodeType));
107 BooleanVar *This = this;
108 serializer->mywrite(&This, sizeof(BooleanVar *));
109 serializer->mywrite(&vtype, sizeof(VarType));
112 void BooleanVar::print() {
113 model_print("BooleanVar:%lu\n", (uintptr_t)this);
116 void BooleanConst::print() {
117 model_print("BooleanConst:%s\n", istrue ? "TRUE" : "FALSE");
120 void BooleanOrder::serialize(Serializer *serializer) {
121 if (serializer->isSerialized(this))
123 serializer->addObject(this);
124 order->serialize(serializer);
126 serializer->mywrite(&type, sizeof(ASTNodeType));
127 BooleanOrder *This = this;
128 serializer->mywrite(&This, sizeof(BooleanOrder *));
129 serializer->mywrite(&order, sizeof(Order *));
130 serializer->mywrite(&first, sizeof(uint64_t));
131 serializer->mywrite(&second, sizeof(uint64_t));
134 void BooleanOrder::print() {
135 model_print("{BooleanOrder: First= %lu, Second = %lu on Order:\n", first, second);
140 void BooleanPredicate::serialize(Serializer *serializer) {
141 if (serializer->isSerialized(this))
143 serializer->addObject(this);
145 predicate->serialize(serializer);
146 uint size = inputs.getSize();
147 for (uint i = 0; i < size; i++) {
148 Element *input = inputs.get(i);
149 input->serialize(serializer);
151 serializeBooleanEdge(serializer, undefStatus);
153 serializer->mywrite(&type, sizeof(ASTNodeType));
154 BooleanPredicate *This = this;
155 serializer->mywrite(&This, sizeof(BooleanPredicate *));
156 serializer->mywrite(&predicate, sizeof(Predicate *));
157 serializer->mywrite(&size, sizeof(uint));
158 for (uint i = 0; i < size; i++) {
159 Element *input = inputs.get(i);
160 serializer->mywrite(&input, sizeof(Element *));
162 Boolean *undefStat = undefStatus != BooleanEdge(NULL) ? undefStatus.getRaw() : NULL;
163 serializer->mywrite(&undefStat, sizeof(Boolean *));
166 void BooleanPredicate::print() {
167 model_print("{BooleanPredicate:\n");
169 model_print("elements:\n");
170 uint size = inputs.getSize();
171 for (uint i = 0; i < size; i++) {
172 Element *input = inputs.get(i);
178 void BooleanLogic::serialize(Serializer *serializer) {
179 if (serializer->isSerialized(this))
181 serializer->addObject(this);
182 uint size = inputs.getSize();
183 for (uint i = 0; i < size; i++) {
184 BooleanEdge input = inputs.get(i);
185 serializeBooleanEdge(serializer, input);
187 serializer->mywrite(&type, sizeof(ASTNodeType));
188 BooleanLogic *This = this;
189 serializer->mywrite(&This, sizeof(BooleanLogic *));
190 serializer->mywrite(&op, sizeof(LogicOp));
191 serializer->mywrite(&size, sizeof(uint));
192 for (uint i = 0; i < size; i++) {
193 Boolean *input = inputs.get(i).getRaw();
194 serializer->mywrite(&input, sizeof(Boolean *));
198 void BooleanLogic::print() {
199 model_print("{BooleanLogic: %s\n",
200 op == SATC_AND ? "AND" : op == SATC_OR ? "OR" : op == SATC_NOT ? "NOT" :
201 op == SATC_XOR ? "XOR" : op == SATC_IFF ? "IFF" : "IMPLIES");
202 uint size = inputs.getSize();
203 for (uint i = 0; i < size; i++) {
204 BooleanEdge input = inputs.get(i);
205 if (input.isNegated())
207 input.getBoolean()->print();