src/ASTAnalyses/Order/ordergraph.h

   1 /*
   2  * File:   ordergraph.h
   3  * Author: hamed
   4  *
   5  * Created on August 7, 2017, 3:42 PM
   6  */
   7
   8 #ifndef ORDERGRAPH_H
   9 #define ORDERGRAPH_H
  10 #include "classlist.h"
  11 #include "structs.h"
  12 #include "mymemory.h"
  13
  14 class OrderGraph {
  15 public:
  16         OrderGraph(Order *order);
  17         ~OrderGraph();
  18         void addOrderConstraintToOrderGraph(BooleanOrder *bOrder);
  19         void addMustOrderConstraintToOrderGraph(BooleanOrder *bOrder);
  20         OrderNode *getOrderNodeFromOrderGraph(uint64_t id);
  21         OrderEdge *getOrderEdgeFromOrderGraph(OrderNode *begin, OrderNode *end);
  22         OrderNode *lookupOrderNodeFromOrderGraph(uint64_t id);
  23         OrderEdge *lookupOrderEdgeFromOrderGraph(OrderNode *begin, OrderNode *end);
  24         void addOrderEdge(OrderNode *node1, OrderNode *node2, BooleanOrder *constr);
  25         void addMustOrderEdge(OrderNode *node1, OrderNode *node2, BooleanOrder *constr);
  26         void addEdge(uint64_t first, uint64_t second);
  27         OrderEdge *getInverseOrderEdge(OrderEdge *edge);
  28         Order *getOrder() {return order;}
  29         bool isTherePath(OrderNode *source, OrderNode *destination);
  30         bool isTherePathVisit(HashsetOrderNode &visited, OrderNode *current, OrderNode *destination);
  31         SetIteratorOrderNode *getNodes() {return nodes.iterator();}
  32         SetIteratorOrderEdge *getEdges() {return edges.iterator();}
  33         void DFS(Vector<OrderNode *> *finishNodes);
  34         void DFSMust(Vector<OrderNode *> *finishNodes);
  35         void computeStronglyConnectedComponentGraph();
  36         void resetNodeInfoStatusSCC();
  37         void completePartialOrderGraph();
  38
  39         CMEMALLOC;
  40 private:
  41         HashsetOrderNode nodes;
  42         HashsetOrderEdge edges;
  43         Order *order;
  44         void DFSNodeVisit(OrderNode *node, Vector<OrderNode *> *finishNodes, bool isReverse, bool mustvisit, uint sccNum);
  45         void DFSReverse(Vector<OrderNode *> *finishNodes);
  46 };
  47
  48 OrderGraph *buildOrderGraph(Order *order);
  49 OrderGraph *buildMustOrderGraph(Order *order);
  50 #endif/* ORDERGRAPH_H */
  51