src/ASTTransform/transformer.cc

   1 #include "transformer.h"
   2 #include "common.h"
   3 #include "order.h"
   4 #include "boolean.h"
   5 #include "ordergraph.h"
   6 #include "ordernode.h"
   7 #include "rewriter.h"
   8 #include "orderedge.h"
   9 #include "mutableset.h"
  10 #include "ops.h"
  11 #include "csolver.h"
  12 #include "orderanalysis.h"
  13 #include "tunable.h"
  14 #include "transform.h"
  15 #include "element.h"
  16 #include "integerencoding.h"
  17 #include "decomposeordertransform.h"
  18
  19 Transformer::Transformer(CSolver *_solver):
  20         integerEncoding(new IntegerEncodingTransform(_solver)),
  21         solver(_solver)
  22 {
  23 }
  24
  25 Transformer::~Transformer(){
  26         delete integerEncoding;
  27 }
  28
  29 void Transformer::orderAnalysis() {
  30         Vector<Order *> *orders = solver->getOrders();
  31         uint size = orders->getSize();
  32         for (uint i = 0; i < size; i++) {
  33                 Order *order = orders->get(i);
  34                 DecomposeOrderTransform* decompose = new DecomposeOrderTransform(solver, order);
  35                 if (!decompose->canExecuteTransform()){
  36                         delete decompose;
  37                         continue;
  38                 }
  39
  40                 OrderGraph *graph = buildOrderGraph(order);
  41                 if (order->type == SATC_PARTIAL) {
  42                         //Required to do SCC analysis for partial order graphs.  It
  43                         //makes sure we don't incorrectly optimize graphs with negative
  44                         //polarity edges
  45                         completePartialOrderGraph(graph);
  46                 }
  47
  48
  49                 bool mustReachGlobal = GETVARTUNABLE(solver->getTuner(), order->type, MUSTREACHGLOBAL, &onoff);
  50
  51                 if (mustReachGlobal)
  52                         reachMustAnalysis(solver, graph, false);
  53
  54                 bool mustReachLocal = GETVARTUNABLE(solver->getTuner(), order->type, MUSTREACHLOCAL, &onoff);
  55
  56                 if (mustReachLocal) {
  57                         //This pair of analysis is also optional
  58                         if (order->type == SATC_PARTIAL) {
  59                                 localMustAnalysisPartial(solver, graph);
  60                         } else {
  61                                 localMustAnalysisTotal(solver, graph);
  62                         }
  63                 }
  64
  65                 bool mustReachPrune = GETVARTUNABLE(solver->getTuner(), order->type, MUSTREACHPRUNE, &onoff);
  66
  67                 if (mustReachPrune)
  68                         removeMustBeTrueNodes(solver, graph);
  69
  70                 //This is needed for splitorder
  71                 computeStronglyConnectedComponentGraph(graph);
  72                 decompose->setOrderGraph(graph);
  73                 decompose->doTransform();
  74                 delete decompose;
  75                 delete graph;
  76
  77                 integerEncoding->setCurrentOrder(order);
  78                 if(!integerEncoding->canExecuteTransform()){
  79                         continue;
  80                 }
  81                 integerEncoding->doTransform();
  82         }
  83 }
  84
  85