+/** @file cyclegraph.h @brief Data structure to track ordering
+ * constraints on modification order. The idea is to see whether a
+ * total order exists that satisfies the ordering constriants.*/
+
#ifndef CYCLEGRAPH_H
#define CYCLEGRAPH_H
CycleNode(const ModelAction *action);
void addEdge(CycleNode * node);
std::vector<CycleNode *> * getEdges();
- bool setRMW();
+ bool setRMW(CycleNode *);
+ CycleNode* getRMW();
private:
const ModelAction *action;
std::vector<CycleNode *> edges;
- bool hasRMW;
+ CycleNode * hasRMW;
};
#endif