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 void rollbackChanges();
30 CycleNode * getNode(const ModelAction *);
32 /** @brief A table for mapping ModelActions to CycleNodes */
33 HashTable<const ModelAction *, CycleNode *, uintptr_t, 4> actionToNode;
35 bool checkReachable(CycleNode *from, CycleNode *to);
37 /** @brief A flag: true if this graph contains cycles */
42 std::vector<CycleNode *> rollbackvector;
43 std::vector<CycleNode *> rmwrollbackvector;
46 /** @brief A node within a CycleGraph; corresponds to one ModelAction */
49 CycleNode(const ModelAction *action);
50 void addEdge(CycleNode * node);
51 std::vector<CycleNode *> * getEdges();
52 bool setRMW(CycleNode *);
62 /** @brief The ModelAction that this node represents */
63 const ModelAction *action;
65 /** @brief The edges leading out from this node */
66 std::vector<CycleNode *> edges;
68 /** Pointer to a RMW node that reads from this node, or NULL, if none