rmw example works

[model-checker.git] / cyclegraph.cc

diff --git a/cyclegraph.cc b/cyclegraph.cc
index 324e01cc0312747e4b39ee4b6c37343cfd7d163f..c0e8e2af006c5f6f0e0829571c1dc774fd79f391 100644 (file)
--- a/cyclegraph.cc
+++ b/cyclegraph.cc
@@ -2,14 +2,15 @@
 #include "action.h"
 
 /** Initializes a CycleGraph object. */
-
 CycleGraph::CycleGraph() {
        hasCycles=false;
 }
 
-/** Returns the CycleNode for a given ModelAction. */
+CycleGraph::~CycleGraph() {
+}
 
-CycleNode * CycleGraph::getNode(ModelAction * action) {
+/** Returns the CycleNode for a given ModelAction. */
+CycleNode * CycleGraph::getNode(const ModelAction * action) {
        CycleNode *node=actionToNode.get(action);
        if (node==NULL) {
                node=new CycleNode(action);
@@ -20,18 +21,57 @@ CycleNode * CycleGraph::getNode(ModelAction * action) {
 
 /** Adds an edge between two ModelActions. */
 
-void CycleGraph::addEdge(ModelAction *from, ModelAction *to) {
+//the event to happens after the event from
+
+void CycleGraph::addEdge(const ModelAction *to, const ModelAction *from) {
        CycleNode *fromnode=getNode(from);
        CycleNode *tonode=getNode(to);
+
        if (!hasCycles) {
                // Check for Cycles
-               hasCycles=checkReachable(fromnode, tonode);
+               hasCycles=checkReachable(tonode, fromnode);
        }
        fromnode->addEdge(tonode);
+
+       CycleNode * rmwnode=fromnode->getRMW();
+
+       //If the fromnode has a rmwnode that is not the tonode, we
+       //should add an edge between its rmwnode and the tonode
+
+       if (rmwnode!=NULL&&rmwnode!=tonode) {
+               if (!hasCycles) {
+                       // Check for Cycles
+                       hasCycles=checkReachable(tonode, rmwnode);
+               }
+               rmwnode->addEdge(tonode);
+       }
 }
 
-/** Checks whether the first CycleNode can reach the second one. */
+//event rmw that reads from the node from
 
+void CycleGraph::addRMWEdge(const ModelAction *rmw, const ModelAction * from) {
+       CycleNode *fromnode=getNode(from);
+       CycleNode *rmwnode=getNode(rmw);
+
+       /* Two RMW actions cannot read from the same write. */
+       if (fromnode->setRMW(rmwnode)) {
+               hasCycles=true;
+       }
+
+       /* Transfer all outgoing edges from the from node to the rmw node */
+       /* This process cannot add a cycle because rmw should not have any
+                incoming edges yet.*/
+       std::vector<CycleNode *> * edges=fromnode->getEdges();
+       for(unsigned int i=0;i<edges->size();i++) {
+               CycleNode * tonode=(*edges)[i];
+               rmwnode->addEdge(tonode);
+       }
+
+       fromnode->addEdge(rmwnode);
+}
+
+
+/** Checks whether the first CycleNode can reach the second one. */
 bool CycleGraph::checkReachable(CycleNode *from, CycleNode *to) {
        std::vector<CycleNode *> queue;
        HashTable<CycleNode *, CycleNode *, uintptr_t, 4> discovered;
@@ -61,19 +101,27 @@ bool CycleGraph::checkForCycles() {
 }
 
 /** Constructor for a CycleNode. */
-
-CycleNode::CycleNode(ModelAction *modelaction) {
+CycleNode::CycleNode(const ModelAction *modelaction) {
        action=modelaction;
+       hasRMW=NULL;
 }
 
 /** Returns a vector of the edges from a CycleNode. */
-
 std::vector<CycleNode *> * CycleNode::getEdges() {
        return &edges;
 }
 
 /** Adds an edge to a CycleNode. */
-
 void CycleNode::addEdge(CycleNode * node) {
        edges.push_back(node);
 }
+
+CycleNode* CycleNode::getRMW() {
+       return hasRMW;
+}
+
+bool CycleNode::setRMW(CycleNode * node) {
+       CycleNode * oldhasRMW=hasRMW;
+       hasRMW=node;
+       return (oldhasRMW!=NULL);
+}