2 * File: ordertransform.cc
5 * Created on August 28, 2017, 10:35 AM
8 #include "decomposeordertransform.h"
10 #include "orderedge.h"
11 #include "ordernode.h"
13 #include "mutableset.h"
14 #include "ordergraph.h"
16 #include "decomposeorderresolver.h"
18 #include "orderanalysis.h"
21 DecomposeOrderTransform::DecomposeOrderTransform(CSolver *_solver)
26 DecomposeOrderTransform::~DecomposeOrderTransform() {
29 void DecomposeOrderTransform::doTransform() {
30 HashsetOrder *orders = solver->getActiveOrders()->copy();
31 SetIteratorOrder * orderit=orders->iterator();
32 while(orderit->hasNext()) {
33 Order *order = orderit->next();
35 if (GETVARTUNABLE(solver->getTuner(), order->type, DECOMPOSEORDER, &onoff) == 0) {
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
44 completePartialOrderGraph(graph);
47 bool mustReachGlobal = GETVARTUNABLE(solver->getTuner(), order->type, MUSTREACHGLOBAL, &onoff);
50 reachMustAnalysis(solver, graph, false);
52 bool mustReachLocal = GETVARTUNABLE(solver->getTuner(), order->type, MUSTREACHLOCAL, &onoff);
55 //This pair of analysis is also optional
56 if (order->type == SATC_PARTIAL) {
57 localMustAnalysisPartial(solver, graph);
59 localMustAnalysisTotal(solver, graph);
64 bool mustReachPrune = GETVARTUNABLE(solver->getTuner(), order->type, MUSTREACHPRUNE, &onoff);
67 removeMustBeTrueNodes(solver, graph);
70 //This is needed for splitorder
71 computeStronglyConnectedComponentGraph(graph);
72 decomposeOrder(order, graph);
80 void DecomposeOrderTransform::decomposeOrder (Order *currOrder, OrderGraph *currGraph) {
81 Vector<Order *> ordervec;
82 Vector<Order *> partialcandidatevec;
83 uint size = currOrder->constraints.getSize();
84 for (uint i = 0; i < size; i++) {
85 BooleanOrder *orderconstraint = currOrder->constraints.get(i);
86 OrderNode *from = currGraph->getOrderNodeFromOrderGraph(orderconstraint->first);
87 OrderNode *to = currGraph->getOrderNodeFromOrderGraph(orderconstraint->second);
88 if (from->sccNum != to->sccNum) {
89 OrderEdge *edge = currGraph->getOrderEdgeFromOrderGraph(from, to);
91 solver->replaceBooleanWithTrue(orderconstraint);
92 } else if (edge->polNeg) {
93 solver->replaceBooleanWithFalse(orderconstraint);
95 //This case should only be possible if constraint isn't in AST
99 //Build new order and change constraint's order
100 Order *neworder = NULL;
101 if (ordervec.getSize() > from->sccNum)
102 neworder = ordervec.get(from->sccNum);
103 if (neworder == NULL) {
104 MutableSet *set = solver->createMutableSet(currOrder->set->getType());
105 neworder = solver->createOrder(currOrder->type, set);
106 ordervec.setExpand(from->sccNum, neworder);
107 if (currOrder->type == SATC_PARTIAL)
108 partialcandidatevec.setExpand(from->sccNum, neworder);
110 partialcandidatevec.setExpand(from->sccNum, NULL);
112 if (from->status != ADDEDTOSET) {
113 from->status = ADDEDTOSET;
114 ((MutableSet *)neworder->set)->addElementMSet(from->id);
116 if (to->status != ADDEDTOSET) {
117 to->status = ADDEDTOSET;
118 ((MutableSet *)neworder->set)->addElementMSet(to->id);
120 if (currOrder->type == SATC_PARTIAL) {
121 OrderEdge *edge = currGraph->getOrderEdgeFromOrderGraph(from, to);
123 partialcandidatevec.setExpand(from->sccNum, NULL);
125 orderconstraint->order = neworder;
126 neworder->addOrderConstraint(orderconstraint);
129 currOrder->setOrderResolver( new DecomposeOrderResolver(currGraph, ordervec) );
130 solver->getActiveOrders()->remove(currOrder);
131 uint pcvsize = partialcandidatevec.getSize();
132 for (uint i = 0; i < pcvsize; i++) {
133 Order *neworder = partialcandidatevec.get(i);
134 if (neworder != NULL) {
135 neworder->type = SATC_TOTAL;