1 /** @file cyclegraph.h @brief Data structure to track ordering
2 * constraints on modification order. The idea is to see whether a
3 * total order exists that satisfies the ordering constriants.*/
15 /** @brief A graph of Model Actions for tracking cycles. */
20 void addEdge(const ModelAction *from, const ModelAction *to);
21 bool checkForCycles();
22 void addRMWEdge(const ModelAction *from, const ModelAction *to);
25 CycleNode * getNode(const ModelAction *);
26 HashTable<const ModelAction *, CycleNode *, uintptr_t, 4> actionToNode;
27 bool checkReachable(CycleNode *from, CycleNode *to);
33 CycleNode(const ModelAction *action);
34 void addEdge(CycleNode * node);
35 std::vector<CycleNode *> * getEdges();
36 bool setRMW(CycleNode *);
40 const ModelAction *action;
41 std::vector<CycleNode *> edges;