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 *rmw);
24 bool checkReachable(const ModelAction *from, const ModelAction *to);
27 CycleNode * getNode(const ModelAction *);
29 /** @brief A table for mapping ModelActions to CycleNodes */
30 HashTable<const ModelAction *, CycleNode *, uintptr_t, 4> actionToNode;
32 bool checkReachable(CycleNode *from, CycleNode *to);
34 /** @brief A flag: true if this graph contains cycles */
38 /** @brief A node within a CycleGraph; corresponds to one ModelAction */
41 CycleNode(const ModelAction *action);
42 void addEdge(CycleNode * node);
43 std::vector<CycleNode *> * getEdges();
44 bool setRMW(CycleNode *);
48 /** @brief The ModelAction that this node represents */
49 const ModelAction *action;
51 /** @brief The edges leading out from this node */
52 std::vector<CycleNode *> edges;
54 /** Pointer to a RMW node that reads from this node, or NULL, if none