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_println("BooleanVar");
116 void BooleanOrder::serialize(Serializer* serializer){
117 if(serializer->isSerialized(this))
119 serializer->addObject(this);
120 order->serialize(serializer);
122 serializer->mywrite(&type, sizeof(ASTNodeType));
123 BooleanOrder* This = this;
124 serializer->mywrite(&This, sizeof(BooleanOrder*));
125 serializer->mywrite(&order, sizeof(Order*));
126 serializer->mywrite(&first, sizeof(uint64_t));
127 serializer->mywrite(&second, sizeof(uint64_t));
130 void BooleanOrder::print(){
131 model_println("{BooleanOrder: First= %lu, Second = %lu on Order:", first, second);
133 model_println("}\n");
136 void BooleanPredicate::serialize(Serializer* serializer){
137 if(serializer->isSerialized(this))
139 serializer->addObject(this);
141 predicate->serialize(serializer);
142 uint size = inputs.getSize();
143 for(uint i=0; i<size; i++){
144 Element* input = inputs.get(i);
145 input->serialize(serializer);
147 serializeBooleanEdge(serializer, undefStatus);
149 serializer->mywrite(&type, sizeof(ASTNodeType));
150 BooleanPredicate* This = this;
151 serializer->mywrite(&This, sizeof(BooleanPredicate*));
152 serializer->mywrite(&predicate, sizeof(Predicate *));
153 serializer->mywrite(&size, sizeof(uint));
154 for(uint i=0; i<size; i++){
155 Element *input = inputs.get(i);
156 serializer->mywrite(&input, sizeof(Element *));
158 Boolean* undefStat = undefStatus!= BooleanEdge(NULL)?undefStatus.getRaw() : NULL;
159 serializer->mywrite(&undefStat, sizeof(Boolean*));
162 void BooleanPredicate::print(){
163 model_println("{BooleanPredicate:");
165 model_println("elements:");
166 uint size = inputs.getSize();
167 for(uint i=0; i<size; i++){
168 Element *input = inputs.get(i);
171 model_println("}\n");
174 void BooleanLogic::serialize(Serializer* serializer){
175 if(serializer->isSerialized(this))
177 serializer->addObject(this);
178 uint size = inputs.getSize();
179 for(uint i=0; i<size; i++){
180 BooleanEdge input = inputs.get(i);
181 serializeBooleanEdge(serializer, input);
183 serializer->mywrite(&type, sizeof(ASTNodeType));
184 BooleanLogic* This = this;
185 serializer->mywrite(&This, sizeof(BooleanLogic*));
186 serializer->mywrite(&op, sizeof(LogicOp));
187 serializer->mywrite(&size, sizeof(uint));
188 for(uint i=0; i<size; i++){
189 Boolean* input = inputs.get(i).getRaw();
190 serializer->mywrite(&input, sizeof(Boolean*));
194 void BooleanLogic::print(){
195 model_println("{BooleanLogic: %s",
196 op ==SATC_AND? "AND": op == SATC_OR? "OR": op==SATC_NOT? "NOT":
197 op == SATC_XOR? "XOR" : op==SATC_IFF? "IFF" : "IMPLIES");
198 uint size = inputs.getSize();
199 for(uint i=0; i<size; i++){
200 BooleanEdge input = inputs.get(i);
201 input.getBoolean()->print();
203 model_println("}\n");