Adding decomposeOrderTransform to transformer

diff --git a/src/ASTTransform/decomposeordertransform.cc b/src/ASTTransform/decomposeordertransform.cc
index d458b2f07811e293f6ce65ea6b1fc4515dad60ad..f90a66699deaa3b8fc15ff19695f913452313564 100644 (file)
--- a/src/ASTTransform/decomposeordertransform.cc
+++ b/src/ASTTransform/decomposeordertransform.cc
@@ -15,9 +15,8 @@
 #include "csolver.h"
 
 
 #include "csolver.h"
 
 

-DecomposeOrderTransform::DecomposeOrderTransform(CSolver* _solver, Order* _order)
-       :Transform(_solver),
-       order(_order)
+DecomposeOrderTransform::DecomposeOrderTransform(CSolver* _solver)
+       :Transform(_solver)

 {
 }
 
 {
 }
 


@@ -25,20 +24,20 @@ DecomposeOrderTransform::~DecomposeOrderTransform() {
 }
 
 bool DecomposeOrderTransform::canExecuteTransform(){
 }
 
 bool DecomposeOrderTransform::canExecuteTransform(){

-       return canExecutePass(solver, order->type, DECOMPOSEORDER, &onoff);
+       return canExecutePass(solver, currOrder->type, DECOMPOSEORDER, &onoff);

 }
 
 void DecomposeOrderTransform::doTransform(){
        Vector<Order *> ordervec;
        Vector<Order *> partialcandidatevec;
 }
 
 void DecomposeOrderTransform::doTransform(){
        Vector<Order *> ordervec;
        Vector<Order *> partialcandidatevec;

-       uint size = order->constraints.getSize();
+       uint size = currOrder->constraints.getSize();

        for (uint i = 0; i < size; i++) {
        for (uint i = 0; i < size; i++) {

-               BooleanOrder *orderconstraint = order->constraints.get(i);
-               OrderNode *from = graph->getOrderNodeFromOrderGraph(orderconstraint->first);
-               OrderNode *to = graph->getOrderNodeFromOrderGraph(orderconstraint->second);
+               BooleanOrder *orderconstraint = currOrder->constraints.get(i);
+               OrderNode *from = currGraph->getOrderNodeFromOrderGraph(orderconstraint->first);
+               OrderNode *to = currGraph->getOrderNodeFromOrderGraph(orderconstraint->second);

                model_print("from->sccNum:%u\tto->sccNum:%u\n", from->sccNum, to->sccNum);
                if (from->sccNum != to->sccNum) {
                model_print("from->sccNum:%u\tto->sccNum:%u\n", from->sccNum, to->sccNum);
                if (from->sccNum != to->sccNum) {

-                       OrderEdge *edge = graph->getOrderEdgeFromOrderGraph(from, to);
+                       OrderEdge *edge = currGraph->getOrderEdgeFromOrderGraph(from, to);

                        if (edge->polPos) {
                                solver->replaceBooleanWithTrue(orderconstraint);
                        } else if (edge->polNeg) {
                        if (edge->polPos) {
                                solver->replaceBooleanWithTrue(orderconstraint);
                        } else if (edge->polNeg) {


@@ -53,10 +52,10 @@ void DecomposeOrderTransform::doTransform(){
                        if (ordervec.getSize() > from->sccNum)
                                neworder = ordervec.get(from->sccNum);
                        if (neworder == NULL) {
                        if (ordervec.getSize() > from->sccNum)
                                neworder = ordervec.get(from->sccNum);
                        if (neworder == NULL) {

-                               MutableSet *set = solver->createMutableSet(order->set->getType());
-                               neworder = solver->createOrder(order->type, set);
+                               MutableSet *set = solver->createMutableSet(currOrder->set->getType());
+                               neworder = solver->createOrder(currOrder->type, set);

                                ordervec.setExpand(from->sccNum, neworder);
                                ordervec.setExpand(from->sccNum, neworder);

-                               if (order->type == SATC_PARTIAL)
+                               if (currOrder->type == SATC_PARTIAL)

                                        partialcandidatevec.setExpand(from->sccNum, neworder);
                                else
                                        partialcandidatevec.setExpand(from->sccNum, NULL);
                                        partialcandidatevec.setExpand(from->sccNum, neworder);
                                else
                                        partialcandidatevec.setExpand(from->sccNum, NULL);


@@ -69,8 +68,8 @@ void DecomposeOrderTransform::doTransform(){
                                to->status = SATC_ADDEDTOSET;
                                ((MutableSet *)neworder->set)->addElementMSet(to->id);
                        }
                                to->status = SATC_ADDEDTOSET;
                                ((MutableSet *)neworder->set)->addElementMSet(to->id);
                        }

-                       if (order->type == SATC_PARTIAL) {
-                               OrderEdge *edge = graph->getOrderEdgeFromOrderGraph(from, to);
+                       if (currOrder->type == SATC_PARTIAL) {
+                               OrderEdge *edge = currGraph->getOrderEdgeFromOrderGraph(from, to);

                                if (edge->polNeg)
                                        partialcandidatevec.setExpand(from->sccNum, NULL);
                        }
                                if (edge->polNeg)
                                        partialcandidatevec.setExpand(from->sccNum, NULL);
                        }

diff --git a/src/ASTTransform/decomposeordertransform.h b/src/ASTTransform/decomposeordertransform.h
index 1fe7356370686ff8428596814c106dd3862063ad..84b17f323631b6fd966c05df75881c0651ad0cbf 100644 (file)
--- a/src/ASTTransform/decomposeordertransform.h
+++ b/src/ASTTransform/decomposeordertransform.h
@@ -13,16 +13,17 @@
 
 class DecomposeOrderTransform : public Transform {
 public:
 
 class DecomposeOrderTransform : public Transform {
 public:

-       DecomposeOrderTransform(CSolver* _solver, Order* order);
+       DecomposeOrderTransform(CSolver* _solver);

        virtual ~DecomposeOrderTransform();
        void doTransform();
        void setOrderGraph(OrderGraph* _graph){
        virtual ~DecomposeOrderTransform();
        void doTransform();
        void setOrderGraph(OrderGraph* _graph){

-               graph = _graph;
+               currGraph = _graph;

        }
        }

+       void setCurrentOrder(Order* _current) { currOrder = _current;}

        bool canExecuteTransform();
 private:
        bool canExecuteTransform();
 private:

-       Order* order;
-       OrderGraph* graph;
+       Order* currOrder;
+       OrderGraph* currGraph;

 };
 
 #endif /* ORDERTRANSFORM_H */
 };
 
 #endif /* ORDERTRANSFORM_H */

diff --git a/src/ASTTransform/transformer.cc b/src/ASTTransform/transformer.cc
index b22b87d6c2abe20ccec957e7b1cbf48a844fa6f3..54dad59ebe14ef5b89635bd56a65fdfa590ea2c9 100644 (file)
--- a/src/ASTTransform/transformer.cc
+++ b/src/ASTTransform/transformer.cc
@@ -18,12 +18,14 @@
 
 Transformer::Transformer(CSolver *_solver):
        integerEncoding(new IntegerEncodingTransform(_solver)),
 
 Transformer::Transformer(CSolver *_solver):
        integerEncoding(new IntegerEncodingTransform(_solver)),

+       decomposeOrder(new DecomposeOrderTransform(_solver)),

        solver(_solver)
 {
 }
 
 Transformer::~Transformer(){
        delete integerEncoding;
        solver(_solver)
 {
 }
 
 Transformer::~Transformer(){
        delete integerEncoding;

+       delete decomposeOrder;

 }
 
 void Transformer::orderAnalysis() {
 }
 
 void Transformer::orderAnalysis() {


@@ -31,9 +33,8 @@ void Transformer::orderAnalysis() {
        uint size = orders->getSize();
        for (uint i = 0; i < size; i++) {
                Order *order = orders->get(i);
        uint size = orders->getSize();
        for (uint i = 0; i < size; i++) {
                Order *order = orders->get(i);

-               DecomposeOrderTransform* decompose = new DecomposeOrderTransform(solver, order);
-               if (!decompose->canExecuteTransform()){
-                       delete decompose;
+               decomposeOrder->setCurrentOrder(order);
+               if (!decomposeOrder->canExecuteTransform()){

                        continue;
                }
 
                        continue;
                }
 


@@ -69,9 +70,8 @@ void Transformer::orderAnalysis() {
 
                //This is needed for splitorder
                computeStronglyConnectedComponentGraph(graph);
 
                //This is needed for splitorder
                computeStronglyConnectedComponentGraph(graph);

-               decompose->setOrderGraph(graph);
-               decompose->doTransform();
-               delete decompose;
+               decomposeOrder->setOrderGraph(graph);
+               decomposeOrder->doTransform();

                delete graph;
 
                integerEncoding->setCurrentOrder(order);
                delete graph;
 
                integerEncoding->setCurrentOrder(order);

diff --git a/src/ASTTransform/transformer.h b/src/ASTTransform/transformer.h
index 24922d058c1ec721821440e58a279826feddbf92..68e64b1e929cd97c66ac12eb160bdaf6db47c8c4 100644 (file)
--- a/src/ASTTransform/transformer.h
+++ b/src/ASTTransform/transformer.h
@@ -11,6 +11,7 @@
 #include "structs.h"
 #include "transform.h"
 #include "integerencoding.h"
 #include "structs.h"
 #include "transform.h"
 #include "integerencoding.h"

+#include "decomposeordertransform.h"

 
 class Transformer{
 public:
 
 class Transformer{
 public:


@@ -21,7 +22,7 @@ public:
 private:
        //For now we can just add transforms here, but in future we may want take a smarter approach.
        IntegerEncodingTransform* integerEncoding;
 private:
        //For now we can just add transforms here, but in future we may want take a smarter approach.
        IntegerEncodingTransform* integerEncoding;

-       
+       DecomposeOrderTransform* decomposeOrder;

        
        CSolver* solver;
 };
        
        CSolver* solver;
 };