src/ASTTransform/decomposeordertransform.cc

   1 /*
   2  * File:   ordertransform.cc
   3  * Author: hamed
   4  *
   5  * Created on August 28, 2017, 10:35 AM
   6  */
   7
   8 #include "decomposeordertransform.h"
   9 #include "order.h"
  10 #include "orderedge.h"
  11 #include "ordernode.h"
  12 #include "boolean.h"
  13 #include "mutableset.h"
  14 #include "ordergraph.h"
  15 #include "csolver.h"
  16 #include "decomposeorderresolver.h"
  17 #include "tunable.h"
  18 #include "orderanalysis.h"
  19
  20
  21 DecomposeOrderTransform::DecomposeOrderTransform(CSolver *_solver)
  22         : Transform(_solver)
  23 {
  24 }
  25
  26 DecomposeOrderTransform::~DecomposeOrderTransform() {
  27 }
  28
  29 void DecomposeOrderTransform::doTransform() {
  30         HashsetOrder *orders = solver->getActiveOrders()->copy();
  31         SetIteratorOrder * orderit=orders->iterator();
  32         while(orderit->hasNext()) {
  33                 Order *order = orderit->next();
  34
  35                 if (GETVARTUNABLE(solver->getTuner(), order->type, DECOMPOSEORDER, &onoff) == 0) {
  36                         continue;
  37                 }
  38
  39                 OrderGraph *graph = buildOrderGraph(order);
  40                 if (order->type == SATC_PARTIAL) {
  41                         //Required to do SCC analysis for partial order graphs.  It
  42                         //makes sure we don't incorrectly optimize graphs with negative
  43                         //polarity edges
  44                         completePartialOrderGraph(graph);
  45                 }
  46
  47                 bool mustReachGlobal = GETVARTUNABLE(solver->getTuner(), order->type, MUSTREACHGLOBAL, &onoff);
  48
  49                 if (mustReachGlobal)
  50                         reachMustAnalysis(solver, graph, false);
  51
  52                 bool mustReachLocal = GETVARTUNABLE(solver->getTuner(), order->type, MUSTREACHLOCAL, &onoff);
  53
  54                 if (mustReachLocal) {
  55                         //This pair of analysis is also optional
  56                         if (order->type == SATC_PARTIAL) {
  57                                 localMustAnalysisPartial(solver, graph);
  58                         } else {
  59                                 localMustAnalysisTotal(solver, graph);
  60                         }
  61                 }
  62
  63                 bool mustReachPrune = GETVARTUNABLE(solver->getTuner(), order->type, MUSTREACHPRUNE, &onoff);
  64
  65                 if (mustReachPrune)
  66                         removeMustBeTrueNodes(solver, graph);
  67
  68                 //This is needed for splitorder
  69                 computeStronglyConnectedComponentGraph(graph);
  70                 decomposeOrder(order, graph);
  71                 delete graph;
  72         }
  73         delete orderit;
  74         delete orders;
  75 }
  76
  77
  78 void DecomposeOrderTransform::decomposeOrder (Order *currOrder, OrderGraph *currGraph) {
  79         Vector<Order *> ordervec;
  80         Vector<Order *> partialcandidatevec;
  81         uint size = currOrder->constraints.getSize();
  82         for (uint i = 0; i < size; i++) {
  83                 BooleanOrder *orderconstraint = currOrder->constraints.get(i);
  84                 OrderNode *from = currGraph->getOrderNodeFromOrderGraph(orderconstraint->first);
  85                 OrderNode *to = currGraph->getOrderNodeFromOrderGraph(orderconstraint->second);
  86                 if (from->sccNum != to->sccNum) {
  87                         OrderEdge *edge = currGraph->getOrderEdgeFromOrderGraph(from, to);
  88                         if (edge->polPos) {
  89                                 solver->replaceBooleanWithTrue(orderconstraint);
  90                         } else if (edge->polNeg) {
  91                                 solver->replaceBooleanWithFalse(orderconstraint);
  92                         } else {
  93                                 //This case should only be possible if constraint isn't in AST
  94                                 ASSERT(0);
  95                         }
  96                 } else {
  97                         //Build new order and change constraint's order
  98                         Order *neworder = NULL;
  99                         if (ordervec.getSize() > from->sccNum)
 100                                 neworder = ordervec.get(from->sccNum);
 101                         if (neworder == NULL) {
 102                                 MutableSet *set = solver->createMutableSet(currOrder->set->getType());
 103                                 neworder = solver->createOrder(currOrder->type, set);
 104                                 ordervec.setExpand(from->sccNum, neworder);
 105                                 if (currOrder->type == SATC_PARTIAL)
 106                                         partialcandidatevec.setExpand(from->sccNum, neworder);
 107                                 else
 108                                         partialcandidatevec.setExpand(from->sccNum, NULL);
 109                         }
 110                         if (from->status != ADDEDTOSET) {
 111                                 from->status = ADDEDTOSET;
 112                                 ((MutableSet *)neworder->set)->addElementMSet(from->id);
 113                         }
 114                         if (to->status != ADDEDTOSET) {
 115                                 to->status = ADDEDTOSET;
 116                                 ((MutableSet *)neworder->set)->addElementMSet(to->id);
 117                         }
 118                         if (currOrder->type == SATC_PARTIAL) {
 119                                 OrderEdge *edge = currGraph->getOrderEdgeFromOrderGraph(from, to);
 120                                 if (edge->polNeg)
 121                                         partialcandidatevec.setExpand(from->sccNum, NULL);
 122                         }
 123                         orderconstraint->order = neworder;
 124                         neworder->addOrderConstraint(orderconstraint);
 125                 }
 126         }
 127         currOrder->setOrderResolver( new DecomposeOrderResolver(currGraph, ordervec) );
 128         solver->getActiveOrders()->remove(currOrder);
 129         uint pcvsize = partialcandidatevec.getSize();
 130         for (uint i = 0; i < pcvsize; i++) {
 131                 Order *neworder = partialcandidatevec.get(i);
 132                 if (neworder != NULL) {
 133                         neworder->type = SATC_TOTAL;
 134                 }
 135         }
 136 }