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) {
40 for (uint i = 0; i < _numInputs; i++) {
41 _inputs[i]->parents.push(this);
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();