Bug fix

[satune.git] / src / AST / predicate.cc

diff --git a/src/AST/predicate.cc b/src/AST/predicate.cc
index 0e04668a6ac719d8c49582f3982fe062734fad35..d359811663dedab5d83ecb35c7fb84db889548d7 100644 (file)
--- a/src/AST/predicate.cc
+++ b/src/AST/predicate.cc
@@ -2,6 +2,7 @@
 #include "boolean.h"
 #include "set.h"
 #include "table.h"
+#include "csolver.h"
 
 PredicateOperator::PredicateOperator(CompOp _op, Set **domain, uint numDomain) : Predicate(OPERATORPRED), op(_op), domains(domain, numDomain) {
 }
@@ -11,17 +12,41 @@ PredicateTable::PredicateTable(Table *_table, UndefinedBehavior _undefBehavior)
 
 bool PredicateOperator::evalPredicateOperator(uint64_t *inputs) {
        switch (op) {
-       case EQUALS:
+       case SATC_EQUALS:
                return inputs[0] == inputs[1];
-       case LT:
+       case SATC_LT:
                return inputs[0] < inputs[1];
-       case GT:
+       case SATC_GT:
                return inputs[0] > inputs[1];
-       case LTE:
+       case SATC_LTE:
                return inputs[0] <= inputs[1];
-       case GTE:
+       case SATC_GTE:
                return inputs[0] >= inputs[1];
        }
        ASSERT(0);
        return false;
 }
+
+Predicate *PredicateOperator::clone(CSolver *solver, CloneMap *map) {
+       Predicate *p = (Predicate *) map->get(this);
+       if (p != NULL)
+               return p;
+
+       Set *array[domains.getSize()];
+       for (uint i = 0; i < domains.getSize(); i++)
+               array[i] = domains.get(i)->clone(solver, map);
+
+       p = solver->createPredicateOperator(op, array, domains.getSize());
+       map->put(this, p);
+       return p;
+}
+
+Predicate *PredicateTable::clone(CSolver *solver, CloneMap *map) {
+       Predicate *p = (Predicate *) map->get(this);
+       if (p != NULL)
+               return p;
+
+       p = solver->createPredicateTable(table->clone(solver, map), undefinedbehavior);
+       map->put(this, p);
+       return p;
+}