src/Encoders/orderencoder.h

   1 /*
   2  * File:   orderencoder.h
   3  * Author: hamed
   4  *
   5  * Created on August 8, 2017, 6:36 PM
   6  */
   7
   8 #ifndef ORDERGRAPHBUILDER_H
   9 #define ORDERGRAPHBUILDER_H
  10 #include "classlist.h"
  11 #include "structs.h"
  12 #include "mymemory.h"
  13
  14 enum NodeStatus {NOTVISITED, VISITED, FINISHED};
  15 typedef enum NodeStatus NodeStatus;
  16
  17 struct NodeInfo {
  18         NodeStatus status;
  19 };
  20
  21 NodeInfo* allocNodeInfo();
  22 void deleteNodeInfo(NodeInfo* info);
  23
  24 OrderGraph* buildOrderGraph(Order *order);
  25 void computeStronglyConnectedComponentGraph(OrderGraph* graph);
  26 void orderAnalysis(CSolver* solver);
  27 void initializeNodeInfoSCC(OrderGraph* graph, HashTableNodeInfo* nodeToInfo);
  28 void DFSNodeVisit(OrderNode* node, VectorOrderNode* finishNodes, HashTableNodeInfo* nodeToInfo, bool isReverse);
  29 void DFS(OrderGraph* graph, VectorOrderNode* finishNodes, HashTableNodeInfo* nodeToInfo);
  30 void DFSReverse(OrderGraph* graph, VectorOrderNode* finishNodes, HashTableNodeInfo* nodeToInfo);
  31 void completePartialOrderGraph(OrderGraph* graph);
  32 void resetNodeInfoStatusSCC(OrderGraph* graph, HashTableNodeInfo* nodeToInfo);
  33 void removeMustBeTrueNodes(OrderGraph* graph);
  34 void DFSPseudoNodeVisit(OrderGraph *graph, OrderNode* node, HashTableNodeInfo* nodeToInfo);
  35 void completePartialOrderGraph(OrderGraph* graph);
  36 void DFSMust(OrderGraph* graph, VectorOrderNode* finishNodes, HashTableNodeInfo* nodeToInfo);
  37 void DFSMustNodeVisit(OrderNode* node, VectorOrderNode* finishNodes, HashTableNodeInfo* nodeToInfo, bool clearBackEdges);
  38 void DFSClearContradictions(OrderGraph* graph, VectorOrderNode* finishNodes, HashTableNodeInfo* nodeToInfo);
  39 void reachMustAnalysis(OrderGraph *graph);
  40 void localMustAnalysisTotal(OrderGraph *graph);
  41 void localMustAnalysisPartial(OrderGraph *graph);
  42 void orderAnalysis(CSolver* This);
  43
  44 #endif /* ORDERGRAPHBUILDER_H */
  45