Fix tabbing

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

diff --git a/src/AST/rewriter.cc b/src/AST/rewriter.cc
index b6908e1f1dc1b7435b21fa637345492ad4f98971..2c946d567c5458b064cf491783c19f76ea55165b 100644 (file)
--- a/src/AST/rewriter.cc
+++ b/src/AST/rewriter.cc
@@ -7,19 +7,19 @@ void CSolver::replaceBooleanWithTrue(BooleanEdge bexpr) {
        if (constraints.contains(bexpr.negate())) {
                constraints.remove(bexpr.negate());
                setUnSAT();
-       }       
+       }
        if (constraints.contains(bexpr)) {
                constraints.remove(bexpr);
        }
 
        replaceBooleanWithTrueNoRemove(bexpr);
 }
-       
+
 void CSolver::replaceBooleanWithTrueNoRemove(BooleanEdge bexpr) {
        updateMustValue(bexpr.getBoolean(), bexpr.isNegated() ? BV_MUSTBEFALSE : BV_MUSTBETRUE);
 
        ASSERT(bexpr->boolVal != BV_UNSAT);
-       
+
        uint size = bexpr->parents.getSize();
        for (uint i = 0; i < size; i++) {
                Boolean *parent = bexpr->parents.get(i);
@@ -44,8 +44,8 @@ void CSolver::replaceBooleanWithTrueNoRemove(BooleanEdge bexpr) {
 void CSolver::replaceBooleanWithBoolean(BooleanEdge oldb, BooleanEdge newb) {
        //Canonicalize
        if (oldb.isNegated()) {
-               oldb=oldb.negate();
-               newb=newb.negate();
+               oldb = oldb.negate();
+               newb = newb.negate();
 
        }
        if (constraints.contains(oldb)) {
@@ -72,8 +72,8 @@ void CSolver::replaceBooleanWithBoolean(BooleanEdge oldb, BooleanEdge newb) {
        for (uint i = 0; i < size; i++) {
                Boolean *parent = oldb->parents.get(i);
                BooleanLogic *logicop = (BooleanLogic *) parent;
-               boolMap.remove(parent); //could change parent's hash
-               
+               boolMap.remove(parent); //could change parent's hash
+
                uint parentsize = logicop->inputs.getSize();
                for (uint j = 0; j < parentsize; j++) {
                        BooleanEdge b = logicop->inputs.get(j);
@@ -108,13 +108,13 @@ void CSolver::handleIFFTrue(BooleanLogic *bexpr, BooleanEdge child) {
 }
 
 void CSolver::handleANDTrue(BooleanLogic *bexpr, BooleanEdge child) {
-       BooleanEdge childNegate=child.negate();
-       
+       BooleanEdge childNegate = child.negate();
+
        boolMap.remove(bexpr);
-       
+
        for (uint i = 0; i < bexpr->inputs.getSize(); i++) {
                BooleanEdge b = bexpr->inputs.get(i);
-               
+
                if (b == child) {
                        bexpr->inputs.remove(i);
                        i--;
@@ -124,7 +124,7 @@ void CSolver::handleANDTrue(BooleanLogic *bexpr, BooleanEdge child) {
                }
        }
 
-       uint size=bexpr->inputs.getSize();
+       uint size = bexpr->inputs.getSize();
        if (size == 0) {
                bexpr->replaced = true;
                replaceBooleanWithTrue(bexpr);
@@ -142,8 +142,8 @@ void CSolver::replaceBooleanWithFalse(BooleanEdge bexpr) {
 }
 
 BooleanEdge CSolver::doRewrite(BooleanEdge bexpr) {
-       bool isNegated=bexpr.isNegated();
-       BooleanLogic * b = (BooleanLogic *) bexpr.getBoolean();
+       bool isNegated = bexpr.isNegated();
+       BooleanLogic *b = (BooleanLogic *) bexpr.getBoolean();
        BooleanEdge result;
        if (b->op == SATC_IFF) {
                if (isTrue(b->inputs.get(0))) {
@@ -155,7 +155,7 @@ BooleanEdge CSolver::doRewrite(BooleanEdge bexpr) {
                } else if (isFalse(b->inputs.get(1))) {
                        result = b->inputs.get(0).negate();
                } else ASSERT(0);
-       } else if (b->op==SATC_AND) {
+       } else if (b->op == SATC_AND) {
                uint size = b->inputs.getSize();
                if (size == 0)
                        result = boolTrue;